2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
31 #include "c-family/c-pragma.h"
34 #include "diagnostic-core.h"
38 #include "c-family/c-common.h"
39 #include "c-family/c-objc.h"
41 #include "tree-pretty-print.h"
47 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
48 and c-lex.c) and the C++ parser. */
50 static cp_token eof_token
=
52 CPP_EOF
, RID_MAX
, 0, PRAGMA_NONE
, false, false, false, 0, { NULL
}
55 /* The various kinds of non integral constant we encounter. */
56 typedef enum non_integral_constant
{
58 /* floating-point literal */
62 /* %<__FUNCTION__%> */
64 /* %<__PRETTY_FUNCTION__%> */
72 /* %<typeid%> operator */
74 /* non-constant compound literals */
82 /* an array reference */
88 /* the address of a label */
102 /* calls to overloaded operators */
106 /* a comma operator */
108 /* a call to a constructor */
110 /* a transaction expression */
112 } non_integral_constant
;
114 /* The various kinds of errors about name-lookup failing. */
115 typedef enum name_lookup_error
{
120 /* is not a class or namespace */
122 /* is not a class, namespace, or enumeration */
126 /* The various kinds of required token */
127 typedef enum required_token
{
129 RT_SEMICOLON
, /* ';' */
130 RT_OPEN_PAREN
, /* '(' */
131 RT_CLOSE_BRACE
, /* '}' */
132 RT_OPEN_BRACE
, /* '{' */
133 RT_CLOSE_SQUARE
, /* ']' */
134 RT_OPEN_SQUARE
, /* '[' */
138 RT_GREATER
, /* '>' */
140 RT_ELLIPSIS
, /* '...' */
144 RT_COLON_SCOPE
, /* ':' or '::' */
145 RT_CLOSE_PAREN
, /* ')' */
146 RT_COMMA_CLOSE_PAREN
, /* ',' or ')' */
147 RT_PRAGMA_EOL
, /* end of line */
148 RT_NAME
, /* identifier */
150 /* The type is CPP_KEYWORD */
152 RT_DELETE
, /* delete */
153 RT_RETURN
, /* return */
154 RT_WHILE
, /* while */
155 RT_EXTERN
, /* extern */
156 RT_STATIC_ASSERT
, /* static_assert */
157 RT_DECLTYPE
, /* decltype */
158 RT_OPERATOR
, /* operator */
159 RT_CLASS
, /* class */
160 RT_TEMPLATE
, /* template */
161 RT_NAMESPACE
, /* namespace */
162 RT_USING
, /* using */
165 RT_CATCH
, /* catch */
166 RT_THROW
, /* throw */
167 RT_LABEL
, /* __label__ */
168 RT_AT_TRY
, /* @try */
169 RT_AT_SYNCHRONIZED
, /* @synchronized */
170 RT_AT_THROW
, /* @throw */
172 RT_SELECT
, /* selection-statement */
173 RT_INTERATION
, /* iteration-statement */
174 RT_JUMP
, /* jump-statement */
175 RT_CLASS_KEY
, /* class-key */
176 RT_CLASS_TYPENAME_TEMPLATE
, /* class, typename, or template */
177 RT_TRANSACTION_ATOMIC
, /* __transaction_atomic */
178 RT_TRANSACTION_RELAXED
, /* __transaction_relaxed */
179 RT_TRANSACTION_CANCEL
/* __transaction_cancel */
184 static cp_lexer
*cp_lexer_new_main
186 static cp_lexer
*cp_lexer_new_from_tokens
187 (cp_token_cache
*tokens
);
188 static void cp_lexer_destroy
190 static int cp_lexer_saving_tokens
192 static cp_token
*cp_lexer_token_at
193 (cp_lexer
*, cp_token_position
);
194 static void cp_lexer_get_preprocessor_token
195 (cp_lexer
*, cp_token
*);
196 static inline cp_token
*cp_lexer_peek_token
198 static cp_token
*cp_lexer_peek_nth_token
199 (cp_lexer
*, size_t);
200 static inline bool cp_lexer_next_token_is
201 (cp_lexer
*, enum cpp_ttype
);
202 static bool cp_lexer_next_token_is_not
203 (cp_lexer
*, enum cpp_ttype
);
204 static bool cp_lexer_next_token_is_keyword
205 (cp_lexer
*, enum rid
);
206 static cp_token
*cp_lexer_consume_token
208 static void cp_lexer_purge_token
210 static void cp_lexer_purge_tokens_after
211 (cp_lexer
*, cp_token_position
);
212 static void cp_lexer_save_tokens
214 static void cp_lexer_commit_tokens
216 static void cp_lexer_rollback_tokens
218 static void cp_lexer_print_token
219 (FILE *, cp_token
*);
220 static inline bool cp_lexer_debugging_p
222 static void cp_lexer_start_debugging
223 (cp_lexer
*) ATTRIBUTE_UNUSED
;
224 static void cp_lexer_stop_debugging
225 (cp_lexer
*) ATTRIBUTE_UNUSED
;
227 static cp_token_cache
*cp_token_cache_new
228 (cp_token
*, cp_token
*);
230 static void cp_parser_initial_pragma
233 static tree cp_literal_operator_id
236 /* Manifest constants. */
237 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
238 #define CP_SAVED_TOKEN_STACK 5
242 /* The stream to which debugging output should be written. */
243 static FILE *cp_lexer_debug_stream
;
245 /* Nonzero if we are parsing an unevaluated operand: an operand to
246 sizeof, typeof, or alignof. */
247 int cp_unevaluated_operand
;
249 /* Dump up to NUM tokens in BUFFER to FILE starting with token
250 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
251 first token in BUFFER. If NUM is 0, dump all the tokens. If
252 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
253 highlighted by surrounding it in [[ ]]. */
256 cp_lexer_dump_tokens (FILE *file
, VEC(cp_token
,gc
) *buffer
,
257 cp_token
*start_token
, unsigned num
,
258 cp_token
*curr_token
)
260 unsigned i
, nprinted
;
264 fprintf (file
, "%u tokens\n", VEC_length (cp_token
, buffer
));
270 num
= VEC_length (cp_token
, buffer
);
272 if (start_token
== NULL
)
273 start_token
= VEC_address (cp_token
, buffer
);
275 if (start_token
> VEC_address (cp_token
, buffer
))
277 cp_lexer_print_token (file
, VEC_index (cp_token
, buffer
, 0));
278 fprintf (file
, " ... ");
283 for (i
= 0; VEC_iterate (cp_token
, buffer
, i
, token
) && nprinted
< num
; i
++)
285 if (token
== start_token
)
292 if (token
== curr_token
)
293 fprintf (file
, "[[");
295 cp_lexer_print_token (file
, token
);
297 if (token
== curr_token
)
298 fprintf (file
, "]]");
304 case CPP_CLOSE_BRACE
:
314 if (i
== num
&& i
< VEC_length (cp_token
, buffer
))
316 fprintf (file
, " ... ");
317 cp_lexer_print_token (file
, VEC_index (cp_token
, buffer
,
318 VEC_length (cp_token
, buffer
) - 1));
321 fprintf (file
, "\n");
325 /* Dump all tokens in BUFFER to stderr. */
328 cp_lexer_debug_tokens (VEC(cp_token
,gc
) *buffer
)
330 cp_lexer_dump_tokens (stderr
, buffer
, NULL
, 0, NULL
);
334 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
335 description for T. */
338 cp_debug_print_tree_if_set (FILE *file
, const char *desc
, tree t
)
342 fprintf (file
, "%s: ", desc
);
343 print_node_brief (file
, "", t
, 0);
348 /* Dump parser context C to FILE. */
351 cp_debug_print_context (FILE *file
, cp_parser_context
*c
)
353 const char *status_s
[] = { "OK", "ERROR", "COMMITTED" };
354 fprintf (file
, "{ status = %s, scope = ", status_s
[c
->status
]);
355 print_node_brief (file
, "", c
->object_type
, 0);
356 fprintf (file
, "}\n");
360 /* Print the stack of parsing contexts to FILE starting with FIRST. */
363 cp_debug_print_context_stack (FILE *file
, cp_parser_context
*first
)
366 cp_parser_context
*c
;
368 fprintf (file
, "Parsing context stack:\n");
369 for (i
= 0, c
= first
; c
; c
= c
->next
, i
++)
371 fprintf (file
, "\t#%u: ", i
);
372 cp_debug_print_context (file
, c
);
377 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
380 cp_debug_print_flag (FILE *file
, const char *desc
, bool flag
)
383 fprintf (file
, "%s: true\n", desc
);
387 /* Print an unparsed function entry UF to FILE. */
390 cp_debug_print_unparsed_function (FILE *file
, cp_unparsed_functions_entry
*uf
)
393 cp_default_arg_entry
*default_arg_fn
;
396 fprintf (file
, "\tFunctions with default args:\n");
398 VEC_iterate (cp_default_arg_entry
, uf
->funs_with_default_args
, i
,
402 fprintf (file
, "\t\tClass type: ");
403 print_node_brief (file
, "", default_arg_fn
->class_type
, 0);
404 fprintf (file
, "\t\tDeclaration: ");
405 print_node_brief (file
, "", default_arg_fn
->decl
, 0);
406 fprintf (file
, "\n");
409 fprintf (file
, "\n\tFunctions with definitions that require "
410 "post-processing\n\t\t");
411 for (i
= 0; VEC_iterate (tree
, uf
->funs_with_definitions
, i
, fn
); i
++)
413 print_node_brief (file
, "", fn
, 0);
416 fprintf (file
, "\n");
418 fprintf (file
, "\n\tNon-static data members with initializers that require "
419 "post-processing\n\t\t");
420 for (i
= 0; VEC_iterate (tree
, uf
->nsdmis
, i
, fn
); i
++)
422 print_node_brief (file
, "", fn
, 0);
425 fprintf (file
, "\n");
429 /* Print the stack of unparsed member functions S to FILE. */
432 cp_debug_print_unparsed_queues (FILE *file
,
433 VEC(cp_unparsed_functions_entry
, gc
) *s
)
436 cp_unparsed_functions_entry
*uf
;
438 fprintf (file
, "Unparsed functions\n");
439 for (i
= 0; VEC_iterate (cp_unparsed_functions_entry
, s
, i
, uf
); i
++)
441 fprintf (file
, "#%u:\n", i
);
442 cp_debug_print_unparsed_function (file
, uf
);
447 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
448 the given PARSER. If FILE is NULL, the output is printed on stderr. */
451 cp_debug_parser_tokens (FILE *file
, cp_parser
*parser
, int window_size
)
453 cp_token
*next_token
, *first_token
, *start_token
;
458 next_token
= parser
->lexer
->next_token
;
459 first_token
= VEC_address (cp_token
, parser
->lexer
->buffer
);
460 start_token
= (next_token
> first_token
+ window_size
/ 2)
461 ? next_token
- window_size
/ 2
463 cp_lexer_dump_tokens (file
, parser
->lexer
->buffer
, start_token
, window_size
,
468 /* Dump debugging information for the given PARSER. If FILE is NULL,
469 the output is printed on stderr. */
472 cp_debug_parser (FILE *file
, cp_parser
*parser
)
474 const size_t window_size
= 20;
476 expanded_location eloc
;
481 fprintf (file
, "Parser state\n\n");
482 fprintf (file
, "Number of tokens: %u\n",
483 VEC_length (cp_token
, parser
->lexer
->buffer
));
484 cp_debug_print_tree_if_set (file
, "Lookup scope", parser
->scope
);
485 cp_debug_print_tree_if_set (file
, "Object scope",
486 parser
->object_scope
);
487 cp_debug_print_tree_if_set (file
, "Qualifying scope",
488 parser
->qualifying_scope
);
489 cp_debug_print_context_stack (file
, parser
->context
);
490 cp_debug_print_flag (file
, "Allow GNU extensions",
491 parser
->allow_gnu_extensions_p
);
492 cp_debug_print_flag (file
, "'>' token is greater-than",
493 parser
->greater_than_is_operator_p
);
494 cp_debug_print_flag (file
, "Default args allowed in current "
495 "parameter list", parser
->default_arg_ok_p
);
496 cp_debug_print_flag (file
, "Parsing integral constant-expression",
497 parser
->integral_constant_expression_p
);
498 cp_debug_print_flag (file
, "Allow non-constant expression in current "
499 "constant-expression",
500 parser
->allow_non_integral_constant_expression_p
);
501 cp_debug_print_flag (file
, "Seen non-constant expression",
502 parser
->non_integral_constant_expression_p
);
503 cp_debug_print_flag (file
, "Local names and 'this' forbidden in "
505 parser
->local_variables_forbidden_p
);
506 cp_debug_print_flag (file
, "In unbraced linkage specification",
507 parser
->in_unbraced_linkage_specification_p
);
508 cp_debug_print_flag (file
, "Parsing a declarator",
509 parser
->in_declarator_p
);
510 cp_debug_print_flag (file
, "In template argument list",
511 parser
->in_template_argument_list_p
);
512 cp_debug_print_flag (file
, "Parsing an iteration statement",
513 parser
->in_statement
& IN_ITERATION_STMT
);
514 cp_debug_print_flag (file
, "Parsing a switch statement",
515 parser
->in_statement
& IN_SWITCH_STMT
);
516 cp_debug_print_flag (file
, "Parsing a structured OpenMP block",
517 parser
->in_statement
& IN_OMP_BLOCK
);
518 cp_debug_print_flag (file
, "Parsing a an OpenMP loop",
519 parser
->in_statement
& IN_OMP_FOR
);
520 cp_debug_print_flag (file
, "Parsing an if statement",
521 parser
->in_statement
& IN_IF_STMT
);
522 cp_debug_print_flag (file
, "Parsing a type-id in an expression "
523 "context", parser
->in_type_id_in_expr_p
);
524 cp_debug_print_flag (file
, "Declarations are implicitly extern \"C\"",
525 parser
->implicit_extern_c
);
526 cp_debug_print_flag (file
, "String expressions should be translated "
527 "to execution character set",
528 parser
->translate_strings_p
);
529 cp_debug_print_flag (file
, "Parsing function body outside of a "
530 "local class", parser
->in_function_body
);
531 cp_debug_print_flag (file
, "Auto correct a colon to a scope operator",
532 parser
->colon_corrects_to_scope_p
);
533 if (parser
->type_definition_forbidden_message
)
534 fprintf (file
, "Error message for forbidden type definitions: %s\n",
535 parser
->type_definition_forbidden_message
);
536 cp_debug_print_unparsed_queues (file
, parser
->unparsed_queues
);
537 fprintf (file
, "Number of class definitions in progress: %u\n",
538 parser
->num_classes_being_defined
);
539 fprintf (file
, "Number of template parameter lists for the current "
540 "declaration: %u\n", parser
->num_template_parameter_lists
);
541 cp_debug_parser_tokens (file
, parser
, window_size
);
542 token
= parser
->lexer
->next_token
;
543 fprintf (file
, "Next token to parse:\n");
544 fprintf (file
, "\tToken: ");
545 cp_lexer_print_token (file
, token
);
546 eloc
= expand_location (token
->location
);
547 fprintf (file
, "\n\tFile: %s\n", eloc
.file
);
548 fprintf (file
, "\tLine: %d\n", eloc
.line
);
549 fprintf (file
, "\tColumn: %d\n", eloc
.column
);
553 /* Allocate memory for a new lexer object and return it. */
556 cp_lexer_alloc (void)
560 c_common_no_more_pch ();
562 /* Allocate the memory. */
563 lexer
= ggc_alloc_cleared_cp_lexer ();
565 /* Initially we are not debugging. */
566 lexer
->debugging_p
= false;
568 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
569 CP_SAVED_TOKEN_STACK
);
571 /* Create the buffer. */
572 lexer
->buffer
= VEC_alloc (cp_token
, gc
, CP_LEXER_BUFFER_SIZE
);
578 /* Create a new main C++ lexer, the lexer that gets tokens from the
582 cp_lexer_new_main (void)
587 /* It's possible that parsing the first pragma will load a PCH file,
588 which is a GC collection point. So we have to do that before
589 allocating any memory. */
590 cp_parser_initial_pragma (&token
);
592 lexer
= cp_lexer_alloc ();
594 /* Put the first token in the buffer. */
595 VEC_quick_push (cp_token
, lexer
->buffer
, &token
);
597 /* Get the remaining tokens from the preprocessor. */
598 while (token
.type
!= CPP_EOF
)
600 cp_lexer_get_preprocessor_token (lexer
, &token
);
601 VEC_safe_push (cp_token
, gc
, lexer
->buffer
, &token
);
604 lexer
->last_token
= VEC_address (cp_token
, lexer
->buffer
)
605 + VEC_length (cp_token
, lexer
->buffer
)
607 lexer
->next_token
= VEC_length (cp_token
, lexer
->buffer
)
608 ? VEC_address (cp_token
, lexer
->buffer
)
611 /* Subsequent preprocessor diagnostics should use compiler
612 diagnostic functions to get the compiler source location. */
615 gcc_assert (!lexer
->next_token
->purged_p
);
619 /* Create a new lexer whose token stream is primed with the tokens in
620 CACHE. When these tokens are exhausted, no new tokens will be read. */
623 cp_lexer_new_from_tokens (cp_token_cache
*cache
)
625 cp_token
*first
= cache
->first
;
626 cp_token
*last
= cache
->last
;
627 cp_lexer
*lexer
= ggc_alloc_cleared_cp_lexer ();
629 /* We do not own the buffer. */
630 lexer
->buffer
= NULL
;
631 lexer
->next_token
= first
== last
? &eof_token
: first
;
632 lexer
->last_token
= last
;
634 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
635 CP_SAVED_TOKEN_STACK
);
637 /* Initially we are not debugging. */
638 lexer
->debugging_p
= false;
640 gcc_assert (!lexer
->next_token
->purged_p
);
644 /* Frees all resources associated with LEXER. */
647 cp_lexer_destroy (cp_lexer
*lexer
)
649 VEC_free (cp_token
, gc
, lexer
->buffer
);
650 VEC_free (cp_token_position
, heap
, lexer
->saved_tokens
);
654 /* Returns nonzero if debugging information should be output. */
657 cp_lexer_debugging_p (cp_lexer
*lexer
)
659 return lexer
->debugging_p
;
663 static inline cp_token_position
664 cp_lexer_token_position (cp_lexer
*lexer
, bool previous_p
)
666 gcc_assert (!previous_p
|| lexer
->next_token
!= &eof_token
);
668 return lexer
->next_token
- previous_p
;
671 static inline cp_token
*
672 cp_lexer_token_at (cp_lexer
*lexer ATTRIBUTE_UNUSED
, cp_token_position pos
)
678 cp_lexer_set_token_position (cp_lexer
*lexer
, cp_token_position pos
)
680 lexer
->next_token
= cp_lexer_token_at (lexer
, pos
);
683 static inline cp_token_position
684 cp_lexer_previous_token_position (cp_lexer
*lexer
)
686 if (lexer
->next_token
== &eof_token
)
687 return lexer
->last_token
- 1;
689 return cp_lexer_token_position (lexer
, true);
692 static inline cp_token
*
693 cp_lexer_previous_token (cp_lexer
*lexer
)
695 cp_token_position tp
= cp_lexer_previous_token_position (lexer
);
697 return cp_lexer_token_at (lexer
, tp
);
700 /* nonzero if we are presently saving tokens. */
703 cp_lexer_saving_tokens (const cp_lexer
* lexer
)
705 return VEC_length (cp_token_position
, lexer
->saved_tokens
) != 0;
708 /* Store the next token from the preprocessor in *TOKEN. Return true
709 if we reach EOF. If LEXER is NULL, assume we are handling an
710 initial #pragma pch_preprocess, and thus want the lexer to return
711 processed strings. */
714 cp_lexer_get_preprocessor_token (cp_lexer
*lexer
, cp_token
*token
)
716 static int is_extern_c
= 0;
718 /* Get a new token from the preprocessor. */
720 = c_lex_with_flags (&token
->u
.value
, &token
->location
, &token
->flags
,
721 lexer
== NULL
? 0 : C_LEX_STRING_NO_JOIN
);
722 token
->keyword
= RID_MAX
;
723 token
->pragma_kind
= PRAGMA_NONE
;
724 token
->purged_p
= false;
726 /* On some systems, some header files are surrounded by an
727 implicit extern "C" block. Set a flag in the token if it
728 comes from such a header. */
729 is_extern_c
+= pending_lang_change
;
730 pending_lang_change
= 0;
731 token
->implicit_extern_c
= is_extern_c
> 0;
733 /* Check to see if this token is a keyword. */
734 if (token
->type
== CPP_NAME
)
736 if (C_IS_RESERVED_WORD (token
->u
.value
))
738 /* Mark this token as a keyword. */
739 token
->type
= CPP_KEYWORD
;
740 /* Record which keyword. */
741 token
->keyword
= C_RID_CODE (token
->u
.value
);
745 if (warn_cxx0x_compat
746 && C_RID_CODE (token
->u
.value
) >= RID_FIRST_CXX0X
747 && C_RID_CODE (token
->u
.value
) <= RID_LAST_CXX0X
)
749 /* Warn about the C++0x keyword (but still treat it as
751 warning (OPT_Wc__0x_compat
,
752 "identifier %qE is a keyword in C++11",
755 /* Clear out the C_RID_CODE so we don't warn about this
756 particular identifier-turned-keyword again. */
757 C_SET_RID_CODE (token
->u
.value
, RID_MAX
);
760 token
->ambiguous_p
= false;
761 token
->keyword
= RID_MAX
;
764 else if (token
->type
== CPP_AT_NAME
)
766 /* This only happens in Objective-C++; it must be a keyword. */
767 token
->type
= CPP_KEYWORD
;
768 switch (C_RID_CODE (token
->u
.value
))
770 /* Replace 'class' with '@class', 'private' with '@private',
771 etc. This prevents confusion with the C++ keyword
772 'class', and makes the tokens consistent with other
773 Objective-C 'AT' keywords. For example '@class' is
774 reported as RID_AT_CLASS which is consistent with
775 '@synchronized', which is reported as
778 case RID_CLASS
: token
->keyword
= RID_AT_CLASS
; break;
779 case RID_PRIVATE
: token
->keyword
= RID_AT_PRIVATE
; break;
780 case RID_PROTECTED
: token
->keyword
= RID_AT_PROTECTED
; break;
781 case RID_PUBLIC
: token
->keyword
= RID_AT_PUBLIC
; break;
782 case RID_THROW
: token
->keyword
= RID_AT_THROW
; break;
783 case RID_TRY
: token
->keyword
= RID_AT_TRY
; break;
784 case RID_CATCH
: token
->keyword
= RID_AT_CATCH
; break;
785 default: token
->keyword
= C_RID_CODE (token
->u
.value
);
788 else if (token
->type
== CPP_PRAGMA
)
790 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
791 token
->pragma_kind
= ((enum pragma_kind
)
792 TREE_INT_CST_LOW (token
->u
.value
));
793 token
->u
.value
= NULL_TREE
;
797 /* Update the globals input_location and the input file stack from TOKEN. */
799 cp_lexer_set_source_position_from_token (cp_token
*token
)
801 if (token
->type
!= CPP_EOF
)
803 input_location
= token
->location
;
807 /* Return a pointer to the next token in the token stream, but do not
810 static inline cp_token
*
811 cp_lexer_peek_token (cp_lexer
*lexer
)
813 if (cp_lexer_debugging_p (lexer
))
815 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream
);
816 cp_lexer_print_token (cp_lexer_debug_stream
, lexer
->next_token
);
817 putc ('\n', cp_lexer_debug_stream
);
819 return lexer
->next_token
;
822 /* Return true if the next token has the indicated TYPE. */
825 cp_lexer_next_token_is (cp_lexer
* lexer
, enum cpp_ttype type
)
827 return cp_lexer_peek_token (lexer
)->type
== type
;
830 /* Return true if the next token does not have the indicated TYPE. */
833 cp_lexer_next_token_is_not (cp_lexer
* lexer
, enum cpp_ttype type
)
835 return !cp_lexer_next_token_is (lexer
, type
);
838 /* Return true if the next token is the indicated KEYWORD. */
841 cp_lexer_next_token_is_keyword (cp_lexer
* lexer
, enum rid keyword
)
843 return cp_lexer_peek_token (lexer
)->keyword
== keyword
;
846 /* Return true if the next token is not the indicated KEYWORD. */
849 cp_lexer_next_token_is_not_keyword (cp_lexer
* lexer
, enum rid keyword
)
851 return cp_lexer_peek_token (lexer
)->keyword
!= keyword
;
854 /* Return true if the next token is a keyword for a decl-specifier. */
857 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer
*lexer
)
861 token
= cp_lexer_peek_token (lexer
);
862 switch (token
->keyword
)
864 /* auto specifier: storage-class-specifier in C++,
865 simple-type-specifier in C++0x. */
867 /* Storage classes. */
873 /* Elaborated type specifiers. */
879 /* Simple type specifiers. */
894 /* GNU extensions. */
897 /* C++0x extensions. */
899 case RID_UNDERLYING_TYPE
:
907 /* Returns TRUE iff the token T begins a decltype type. */
910 token_is_decltype (cp_token
*t
)
912 return (t
->keyword
== RID_DECLTYPE
913 || t
->type
== CPP_DECLTYPE
);
916 /* Returns TRUE iff the next token begins a decltype type. */
919 cp_lexer_next_token_is_decltype (cp_lexer
*lexer
)
921 cp_token
*t
= cp_lexer_peek_token (lexer
);
922 return token_is_decltype (t
);
925 /* Return a pointer to the Nth token in the token stream. If N is 1,
926 then this is precisely equivalent to cp_lexer_peek_token (except
927 that it is not inline). One would like to disallow that case, but
928 there is one case (cp_parser_nth_token_starts_template_id) where
929 the caller passes a variable for N and it might be 1. */
932 cp_lexer_peek_nth_token (cp_lexer
* lexer
, size_t n
)
936 /* N is 1-based, not zero-based. */
939 if (cp_lexer_debugging_p (lexer
))
940 fprintf (cp_lexer_debug_stream
,
941 "cp_lexer: peeking ahead %ld at token: ", (long)n
);
944 token
= lexer
->next_token
;
945 gcc_assert (!n
|| token
!= &eof_token
);
949 if (token
== lexer
->last_token
)
955 if (!token
->purged_p
)
959 if (cp_lexer_debugging_p (lexer
))
961 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
962 putc ('\n', cp_lexer_debug_stream
);
968 /* Return the next token, and advance the lexer's next_token pointer
969 to point to the next non-purged token. */
972 cp_lexer_consume_token (cp_lexer
* lexer
)
974 cp_token
*token
= lexer
->next_token
;
976 gcc_assert (token
!= &eof_token
);
977 gcc_assert (!lexer
->in_pragma
|| token
->type
!= CPP_PRAGMA_EOL
);
982 if (lexer
->next_token
== lexer
->last_token
)
984 lexer
->next_token
= &eof_token
;
989 while (lexer
->next_token
->purged_p
);
991 cp_lexer_set_source_position_from_token (token
);
993 /* Provide debugging output. */
994 if (cp_lexer_debugging_p (lexer
))
996 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream
);
997 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
998 putc ('\n', cp_lexer_debug_stream
);
1004 /* Permanently remove the next token from the token stream, and
1005 advance the next_token pointer to refer to the next non-purged
1009 cp_lexer_purge_token (cp_lexer
*lexer
)
1011 cp_token
*tok
= lexer
->next_token
;
1013 gcc_assert (tok
!= &eof_token
);
1014 tok
->purged_p
= true;
1015 tok
->location
= UNKNOWN_LOCATION
;
1016 tok
->u
.value
= NULL_TREE
;
1017 tok
->keyword
= RID_MAX
;
1022 if (tok
== lexer
->last_token
)
1028 while (tok
->purged_p
);
1029 lexer
->next_token
= tok
;
1032 /* Permanently remove all tokens after TOK, up to, but not
1033 including, the token that will be returned next by
1034 cp_lexer_peek_token. */
1037 cp_lexer_purge_tokens_after (cp_lexer
*lexer
, cp_token
*tok
)
1039 cp_token
*peek
= lexer
->next_token
;
1041 if (peek
== &eof_token
)
1042 peek
= lexer
->last_token
;
1044 gcc_assert (tok
< peek
);
1046 for ( tok
+= 1; tok
!= peek
; tok
+= 1)
1048 tok
->purged_p
= true;
1049 tok
->location
= UNKNOWN_LOCATION
;
1050 tok
->u
.value
= NULL_TREE
;
1051 tok
->keyword
= RID_MAX
;
1055 /* Begin saving tokens. All tokens consumed after this point will be
1059 cp_lexer_save_tokens (cp_lexer
* lexer
)
1061 /* Provide debugging output. */
1062 if (cp_lexer_debugging_p (lexer
))
1063 fprintf (cp_lexer_debug_stream
, "cp_lexer: saving tokens\n");
1065 VEC_safe_push (cp_token_position
, heap
,
1066 lexer
->saved_tokens
, lexer
->next_token
);
1069 /* Commit to the portion of the token stream most recently saved. */
1072 cp_lexer_commit_tokens (cp_lexer
* lexer
)
1074 /* Provide debugging output. */
1075 if (cp_lexer_debugging_p (lexer
))
1076 fprintf (cp_lexer_debug_stream
, "cp_lexer: committing tokens\n");
1078 VEC_pop (cp_token_position
, lexer
->saved_tokens
);
1081 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1082 to the token stream. Stop saving tokens. */
1085 cp_lexer_rollback_tokens (cp_lexer
* lexer
)
1087 /* Provide debugging output. */
1088 if (cp_lexer_debugging_p (lexer
))
1089 fprintf (cp_lexer_debug_stream
, "cp_lexer: restoring tokens\n");
1091 lexer
->next_token
= VEC_pop (cp_token_position
, lexer
->saved_tokens
);
1094 /* Print a representation of the TOKEN on the STREAM. */
1097 cp_lexer_print_token (FILE * stream
, cp_token
*token
)
1099 /* We don't use cpp_type2name here because the parser defines
1100 a few tokens of its own. */
1101 static const char *const token_names
[] = {
1102 /* cpplib-defined token types */
1103 #define OP(e, s) #e,
1104 #define TK(e, s) #e,
1108 /* C++ parser token types - see "Manifest constants", above. */
1111 "NESTED_NAME_SPECIFIER",
1114 /* For some tokens, print the associated data. */
1115 switch (token
->type
)
1118 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1119 For example, `struct' is mapped to an INTEGER_CST. */
1120 if (TREE_CODE (token
->u
.value
) != IDENTIFIER_NODE
)
1122 /* else fall through */
1124 fputs (IDENTIFIER_POINTER (token
->u
.value
), stream
);
1131 case CPP_UTF8STRING
:
1132 fprintf (stream
, " \"%s\"", TREE_STRING_POINTER (token
->u
.value
));
1136 print_generic_expr (stream
, token
->u
.value
, 0);
1140 /* If we have a name for the token, print it out. Otherwise, we
1141 simply give the numeric code. */
1142 if (token
->type
< ARRAY_SIZE(token_names
))
1143 fputs (token_names
[token
->type
], stream
);
1145 fprintf (stream
, "[%d]", token
->type
);
1150 /* Start emitting debugging information. */
1153 cp_lexer_start_debugging (cp_lexer
* lexer
)
1155 lexer
->debugging_p
= true;
1156 cp_lexer_debug_stream
= stderr
;
1159 /* Stop emitting debugging information. */
1162 cp_lexer_stop_debugging (cp_lexer
* lexer
)
1164 lexer
->debugging_p
= false;
1165 cp_lexer_debug_stream
= NULL
;
1168 /* Create a new cp_token_cache, representing a range of tokens. */
1170 static cp_token_cache
*
1171 cp_token_cache_new (cp_token
*first
, cp_token
*last
)
1173 cp_token_cache
*cache
= ggc_alloc_cp_token_cache ();
1174 cache
->first
= first
;
1180 /* Decl-specifiers. */
1182 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1185 clear_decl_specs (cp_decl_specifier_seq
*decl_specs
)
1187 memset (decl_specs
, 0, sizeof (cp_decl_specifier_seq
));
1192 /* Nothing other than the parser should be creating declarators;
1193 declarators are a semi-syntactic representation of C++ entities.
1194 Other parts of the front end that need to create entities (like
1195 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1197 static cp_declarator
*make_call_declarator
1198 (cp_declarator
*, tree
, cp_cv_quals
, cp_virt_specifiers
, tree
, tree
);
1199 static cp_declarator
*make_array_declarator
1200 (cp_declarator
*, tree
);
1201 static cp_declarator
*make_pointer_declarator
1202 (cp_cv_quals
, cp_declarator
*);
1203 static cp_declarator
*make_reference_declarator
1204 (cp_cv_quals
, cp_declarator
*, bool);
1205 static cp_parameter_declarator
*make_parameter_declarator
1206 (cp_decl_specifier_seq
*, cp_declarator
*, tree
);
1207 static cp_declarator
*make_ptrmem_declarator
1208 (cp_cv_quals
, tree
, cp_declarator
*);
1210 /* An erroneous declarator. */
1211 static cp_declarator
*cp_error_declarator
;
1213 /* The obstack on which declarators and related data structures are
1215 static struct obstack declarator_obstack
;
1217 /* Alloc BYTES from the declarator memory pool. */
1219 static inline void *
1220 alloc_declarator (size_t bytes
)
1222 return obstack_alloc (&declarator_obstack
, bytes
);
1225 /* Allocate a declarator of the indicated KIND. Clear fields that are
1226 common to all declarators. */
1228 static cp_declarator
*
1229 make_declarator (cp_declarator_kind kind
)
1231 cp_declarator
*declarator
;
1233 declarator
= (cp_declarator
*) alloc_declarator (sizeof (cp_declarator
));
1234 declarator
->kind
= kind
;
1235 declarator
->attributes
= NULL_TREE
;
1236 declarator
->declarator
= NULL
;
1237 declarator
->parameter_pack_p
= false;
1238 declarator
->id_loc
= UNKNOWN_LOCATION
;
1243 /* Make a declarator for a generalized identifier. If
1244 QUALIFYING_SCOPE is non-NULL, the identifier is
1245 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1246 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1249 static cp_declarator
*
1250 make_id_declarator (tree qualifying_scope
, tree unqualified_name
,
1251 special_function_kind sfk
)
1253 cp_declarator
*declarator
;
1255 /* It is valid to write:
1257 class C { void f(); };
1261 The standard is not clear about whether `typedef const C D' is
1262 legal; as of 2002-09-15 the committee is considering that
1263 question. EDG 3.0 allows that syntax. Therefore, we do as
1265 if (qualifying_scope
&& TYPE_P (qualifying_scope
))
1266 qualifying_scope
= TYPE_MAIN_VARIANT (qualifying_scope
);
1268 gcc_assert (TREE_CODE (unqualified_name
) == IDENTIFIER_NODE
1269 || TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
1270 || TREE_CODE (unqualified_name
) == TEMPLATE_ID_EXPR
);
1272 declarator
= make_declarator (cdk_id
);
1273 declarator
->u
.id
.qualifying_scope
= qualifying_scope
;
1274 declarator
->u
.id
.unqualified_name
= unqualified_name
;
1275 declarator
->u
.id
.sfk
= sfk
;
1280 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1281 of modifiers such as const or volatile to apply to the pointer
1282 type, represented as identifiers. */
1285 make_pointer_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
)
1287 cp_declarator
*declarator
;
1289 declarator
= make_declarator (cdk_pointer
);
1290 declarator
->declarator
= target
;
1291 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1292 declarator
->u
.pointer
.class_type
= NULL_TREE
;
1295 declarator
->id_loc
= target
->id_loc
;
1296 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1297 target
->parameter_pack_p
= false;
1300 declarator
->parameter_pack_p
= false;
1305 /* Like make_pointer_declarator -- but for references. */
1308 make_reference_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
,
1311 cp_declarator
*declarator
;
1313 declarator
= make_declarator (cdk_reference
);
1314 declarator
->declarator
= target
;
1315 declarator
->u
.reference
.qualifiers
= cv_qualifiers
;
1316 declarator
->u
.reference
.rvalue_ref
= rvalue_ref
;
1319 declarator
->id_loc
= target
->id_loc
;
1320 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1321 target
->parameter_pack_p
= false;
1324 declarator
->parameter_pack_p
= false;
1329 /* Like make_pointer_declarator -- but for a pointer to a non-static
1330 member of CLASS_TYPE. */
1333 make_ptrmem_declarator (cp_cv_quals cv_qualifiers
, tree class_type
,
1334 cp_declarator
*pointee
)
1336 cp_declarator
*declarator
;
1338 declarator
= make_declarator (cdk_ptrmem
);
1339 declarator
->declarator
= pointee
;
1340 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1341 declarator
->u
.pointer
.class_type
= class_type
;
1345 declarator
->parameter_pack_p
= pointee
->parameter_pack_p
;
1346 pointee
->parameter_pack_p
= false;
1349 declarator
->parameter_pack_p
= false;
1354 /* Make a declarator for the function given by TARGET, with the
1355 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1356 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1357 indicates what exceptions can be thrown. */
1360 make_call_declarator (cp_declarator
*target
,
1362 cp_cv_quals cv_qualifiers
,
1363 cp_virt_specifiers virt_specifiers
,
1364 tree exception_specification
,
1365 tree late_return_type
)
1367 cp_declarator
*declarator
;
1369 declarator
= make_declarator (cdk_function
);
1370 declarator
->declarator
= target
;
1371 declarator
->u
.function
.parameters
= parms
;
1372 declarator
->u
.function
.qualifiers
= cv_qualifiers
;
1373 declarator
->u
.function
.virt_specifiers
= virt_specifiers
;
1374 declarator
->u
.function
.exception_specification
= exception_specification
;
1375 declarator
->u
.function
.late_return_type
= late_return_type
;
1378 declarator
->id_loc
= target
->id_loc
;
1379 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1380 target
->parameter_pack_p
= false;
1383 declarator
->parameter_pack_p
= false;
1388 /* Make a declarator for an array of BOUNDS elements, each of which is
1389 defined by ELEMENT. */
1392 make_array_declarator (cp_declarator
*element
, tree bounds
)
1394 cp_declarator
*declarator
;
1396 declarator
= make_declarator (cdk_array
);
1397 declarator
->declarator
= element
;
1398 declarator
->u
.array
.bounds
= bounds
;
1401 declarator
->id_loc
= element
->id_loc
;
1402 declarator
->parameter_pack_p
= element
->parameter_pack_p
;
1403 element
->parameter_pack_p
= false;
1406 declarator
->parameter_pack_p
= false;
1411 /* Determine whether the declarator we've seen so far can be a
1412 parameter pack, when followed by an ellipsis. */
1414 declarator_can_be_parameter_pack (cp_declarator
*declarator
)
1416 /* Search for a declarator name, or any other declarator that goes
1417 after the point where the ellipsis could appear in a parameter
1418 pack. If we find any of these, then this declarator can not be
1419 made into a parameter pack. */
1421 while (declarator
&& !found
)
1423 switch ((int)declarator
->kind
)
1434 declarator
= declarator
->declarator
;
1442 cp_parameter_declarator
*no_parameters
;
1444 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1445 DECLARATOR and DEFAULT_ARGUMENT. */
1447 cp_parameter_declarator
*
1448 make_parameter_declarator (cp_decl_specifier_seq
*decl_specifiers
,
1449 cp_declarator
*declarator
,
1450 tree default_argument
)
1452 cp_parameter_declarator
*parameter
;
1454 parameter
= ((cp_parameter_declarator
*)
1455 alloc_declarator (sizeof (cp_parameter_declarator
)));
1456 parameter
->next
= NULL
;
1457 if (decl_specifiers
)
1458 parameter
->decl_specifiers
= *decl_specifiers
;
1460 clear_decl_specs (¶meter
->decl_specifiers
);
1461 parameter
->declarator
= declarator
;
1462 parameter
->default_argument
= default_argument
;
1463 parameter
->ellipsis_p
= false;
1468 /* Returns true iff DECLARATOR is a declaration for a function. */
1471 function_declarator_p (const cp_declarator
*declarator
)
1475 if (declarator
->kind
== cdk_function
1476 && declarator
->declarator
->kind
== cdk_id
)
1478 if (declarator
->kind
== cdk_id
1479 || declarator
->kind
== cdk_error
)
1481 declarator
= declarator
->declarator
;
1491 A cp_parser parses the token stream as specified by the C++
1492 grammar. Its job is purely parsing, not semantic analysis. For
1493 example, the parser breaks the token stream into declarators,
1494 expressions, statements, and other similar syntactic constructs.
1495 It does not check that the types of the expressions on either side
1496 of an assignment-statement are compatible, or that a function is
1497 not declared with a parameter of type `void'.
1499 The parser invokes routines elsewhere in the compiler to perform
1500 semantic analysis and to build up the abstract syntax tree for the
1503 The parser (and the template instantiation code, which is, in a
1504 way, a close relative of parsing) are the only parts of the
1505 compiler that should be calling push_scope and pop_scope, or
1506 related functions. The parser (and template instantiation code)
1507 keeps track of what scope is presently active; everything else
1508 should simply honor that. (The code that generates static
1509 initializers may also need to set the scope, in order to check
1510 access control correctly when emitting the initializers.)
1515 The parser is of the standard recursive-descent variety. Upcoming
1516 tokens in the token stream are examined in order to determine which
1517 production to use when parsing a non-terminal. Some C++ constructs
1518 require arbitrary look ahead to disambiguate. For example, it is
1519 impossible, in the general case, to tell whether a statement is an
1520 expression or declaration without scanning the entire statement.
1521 Therefore, the parser is capable of "parsing tentatively." When the
1522 parser is not sure what construct comes next, it enters this mode.
1523 Then, while we attempt to parse the construct, the parser queues up
1524 error messages, rather than issuing them immediately, and saves the
1525 tokens it consumes. If the construct is parsed successfully, the
1526 parser "commits", i.e., it issues any queued error messages and
1527 the tokens that were being preserved are permanently discarded.
1528 If, however, the construct is not parsed successfully, the parser
1529 rolls back its state completely so that it can resume parsing using
1530 a different alternative.
1535 The performance of the parser could probably be improved substantially.
1536 We could often eliminate the need to parse tentatively by looking ahead
1537 a little bit. In some places, this approach might not entirely eliminate
1538 the need to parse tentatively, but it might still speed up the average
1541 /* Flags that are passed to some parsing functions. These values can
1542 be bitwise-ored together. */
1547 CP_PARSER_FLAGS_NONE
= 0x0,
1548 /* The construct is optional. If it is not present, then no error
1549 should be issued. */
1550 CP_PARSER_FLAGS_OPTIONAL
= 0x1,
1551 /* When parsing a type-specifier, treat user-defined type-names
1552 as non-type identifiers. */
1553 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
= 0x2,
1554 /* When parsing a type-specifier, do not try to parse a class-specifier
1555 or enum-specifier. */
1556 CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
= 0x4,
1557 /* When parsing a decl-specifier-seq, only allow type-specifier or
1559 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
= 0x8
1562 /* This type is used for parameters and variables which hold
1563 combinations of the above flags. */
1564 typedef int cp_parser_flags
;
1566 /* The different kinds of declarators we want to parse. */
1568 typedef enum cp_parser_declarator_kind
1570 /* We want an abstract declarator. */
1571 CP_PARSER_DECLARATOR_ABSTRACT
,
1572 /* We want a named declarator. */
1573 CP_PARSER_DECLARATOR_NAMED
,
1574 /* We don't mind, but the name must be an unqualified-id. */
1575 CP_PARSER_DECLARATOR_EITHER
1576 } cp_parser_declarator_kind
;
1578 /* The precedence values used to parse binary expressions. The minimum value
1579 of PREC must be 1, because zero is reserved to quickly discriminate
1580 binary operators from other tokens. */
1585 PREC_LOGICAL_OR_EXPRESSION
,
1586 PREC_LOGICAL_AND_EXPRESSION
,
1587 PREC_INCLUSIVE_OR_EXPRESSION
,
1588 PREC_EXCLUSIVE_OR_EXPRESSION
,
1589 PREC_AND_EXPRESSION
,
1590 PREC_EQUALITY_EXPRESSION
,
1591 PREC_RELATIONAL_EXPRESSION
,
1592 PREC_SHIFT_EXPRESSION
,
1593 PREC_ADDITIVE_EXPRESSION
,
1594 PREC_MULTIPLICATIVE_EXPRESSION
,
1596 NUM_PREC_VALUES
= PREC_PM_EXPRESSION
1599 /* A mapping from a token type to a corresponding tree node type, with a
1600 precedence value. */
1602 typedef struct cp_parser_binary_operations_map_node
1604 /* The token type. */
1605 enum cpp_ttype token_type
;
1606 /* The corresponding tree code. */
1607 enum tree_code tree_type
;
1608 /* The precedence of this operator. */
1609 enum cp_parser_prec prec
;
1610 } cp_parser_binary_operations_map_node
;
1612 typedef struct cp_parser_expression_stack_entry
1614 /* Left hand side of the binary operation we are currently
1617 /* Original tree code for left hand side, if it was a binary
1618 expression itself (used for -Wparentheses). */
1619 enum tree_code lhs_type
;
1620 /* Tree code for the binary operation we are parsing. */
1621 enum tree_code tree_type
;
1622 /* Precedence of the binary operation we are parsing. */
1623 enum cp_parser_prec prec
;
1624 } cp_parser_expression_stack_entry
;
1626 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1627 entries because precedence levels on the stack are monotonically
1629 typedef struct cp_parser_expression_stack_entry
1630 cp_parser_expression_stack
[NUM_PREC_VALUES
];
1634 /* Constructors and destructors. */
1636 static cp_parser_context
*cp_parser_context_new
1637 (cp_parser_context
*);
1639 /* Class variables. */
1641 static GTY((deletable
)) cp_parser_context
* cp_parser_context_free_list
;
1643 /* The operator-precedence table used by cp_parser_binary_expression.
1644 Transformed into an associative array (binops_by_token) by
1647 static const cp_parser_binary_operations_map_node binops
[] = {
1648 { CPP_DEREF_STAR
, MEMBER_REF
, PREC_PM_EXPRESSION
},
1649 { CPP_DOT_STAR
, DOTSTAR_EXPR
, PREC_PM_EXPRESSION
},
1651 { CPP_MULT
, MULT_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1652 { CPP_DIV
, TRUNC_DIV_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1653 { CPP_MOD
, TRUNC_MOD_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1655 { CPP_PLUS
, PLUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1656 { CPP_MINUS
, MINUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1658 { CPP_LSHIFT
, LSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1659 { CPP_RSHIFT
, RSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1661 { CPP_LESS
, LT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1662 { CPP_GREATER
, GT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1663 { CPP_LESS_EQ
, LE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1664 { CPP_GREATER_EQ
, GE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1666 { CPP_EQ_EQ
, EQ_EXPR
, PREC_EQUALITY_EXPRESSION
},
1667 { CPP_NOT_EQ
, NE_EXPR
, PREC_EQUALITY_EXPRESSION
},
1669 { CPP_AND
, BIT_AND_EXPR
, PREC_AND_EXPRESSION
},
1671 { CPP_XOR
, BIT_XOR_EXPR
, PREC_EXCLUSIVE_OR_EXPRESSION
},
1673 { CPP_OR
, BIT_IOR_EXPR
, PREC_INCLUSIVE_OR_EXPRESSION
},
1675 { CPP_AND_AND
, TRUTH_ANDIF_EXPR
, PREC_LOGICAL_AND_EXPRESSION
},
1677 { CPP_OR_OR
, TRUTH_ORIF_EXPR
, PREC_LOGICAL_OR_EXPRESSION
}
1680 /* The same as binops, but initialized by cp_parser_new so that
1681 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1683 static cp_parser_binary_operations_map_node binops_by_token
[N_CP_TTYPES
];
1685 /* Constructors and destructors. */
1687 /* Construct a new context. The context below this one on the stack
1688 is given by NEXT. */
1690 static cp_parser_context
*
1691 cp_parser_context_new (cp_parser_context
* next
)
1693 cp_parser_context
*context
;
1695 /* Allocate the storage. */
1696 if (cp_parser_context_free_list
!= NULL
)
1698 /* Pull the first entry from the free list. */
1699 context
= cp_parser_context_free_list
;
1700 cp_parser_context_free_list
= context
->next
;
1701 memset (context
, 0, sizeof (*context
));
1704 context
= ggc_alloc_cleared_cp_parser_context ();
1706 /* No errors have occurred yet in this context. */
1707 context
->status
= CP_PARSER_STATUS_KIND_NO_ERROR
;
1708 /* If this is not the bottommost context, copy information that we
1709 need from the previous context. */
1712 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1713 expression, then we are parsing one in this context, too. */
1714 context
->object_type
= next
->object_type
;
1715 /* Thread the stack. */
1716 context
->next
= next
;
1722 /* Managing the unparsed function queues. */
1724 #define unparsed_funs_with_default_args \
1725 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_default_args
1726 #define unparsed_funs_with_definitions \
1727 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_definitions
1728 #define unparsed_nsdmis \
1729 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->nsdmis
1732 push_unparsed_function_queues (cp_parser
*parser
)
1734 VEC_safe_push (cp_unparsed_functions_entry
, gc
,
1735 parser
->unparsed_queues
, NULL
);
1736 unparsed_funs_with_default_args
= NULL
;
1737 unparsed_funs_with_definitions
= make_tree_vector ();
1738 unparsed_nsdmis
= NULL
;
1742 pop_unparsed_function_queues (cp_parser
*parser
)
1744 release_tree_vector (unparsed_funs_with_definitions
);
1745 VEC_pop (cp_unparsed_functions_entry
, parser
->unparsed_queues
);
1750 /* Constructors and destructors. */
1752 static cp_parser
*cp_parser_new
1755 /* Routines to parse various constructs.
1757 Those that return `tree' will return the error_mark_node (rather
1758 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1759 Sometimes, they will return an ordinary node if error-recovery was
1760 attempted, even though a parse error occurred. So, to check
1761 whether or not a parse error occurred, you should always use
1762 cp_parser_error_occurred. If the construct is optional (indicated
1763 either by an `_opt' in the name of the function that does the
1764 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1765 the construct is not present. */
1767 /* Lexical conventions [gram.lex] */
1769 static tree cp_parser_identifier
1771 static tree cp_parser_string_literal
1772 (cp_parser
*, bool, bool);
1773 static tree cp_parser_userdef_char_literal
1775 static tree cp_parser_userdef_string_literal
1777 static tree cp_parser_userdef_numeric_literal
1780 /* Basic concepts [gram.basic] */
1782 static bool cp_parser_translation_unit
1785 /* Expressions [gram.expr] */
1787 static tree cp_parser_primary_expression
1788 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
1789 static tree cp_parser_id_expression
1790 (cp_parser
*, bool, bool, bool *, bool, bool);
1791 static tree cp_parser_unqualified_id
1792 (cp_parser
*, bool, bool, bool, bool);
1793 static tree cp_parser_nested_name_specifier_opt
1794 (cp_parser
*, bool, bool, bool, bool);
1795 static tree cp_parser_nested_name_specifier
1796 (cp_parser
*, bool, bool, bool, bool);
1797 static tree cp_parser_qualifying_entity
1798 (cp_parser
*, bool, bool, bool, bool, bool);
1799 static tree cp_parser_postfix_expression
1800 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
1801 static tree cp_parser_postfix_open_square_expression
1802 (cp_parser
*, tree
, bool);
1803 static tree cp_parser_postfix_dot_deref_expression
1804 (cp_parser
*, enum cpp_ttype
, tree
, bool, cp_id_kind
*, location_t
);
1805 static VEC(tree
,gc
) *cp_parser_parenthesized_expression_list
1806 (cp_parser
*, int, bool, bool, bool *);
1807 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1808 enum { non_attr
= 0, normal_attr
= 1, id_attr
= 2 };
1809 static void cp_parser_pseudo_destructor_name
1810 (cp_parser
*, tree
*, tree
*);
1811 static tree cp_parser_unary_expression
1812 (cp_parser
*, bool, bool, cp_id_kind
*);
1813 static enum tree_code cp_parser_unary_operator
1815 static tree cp_parser_new_expression
1817 static VEC(tree
,gc
) *cp_parser_new_placement
1819 static tree cp_parser_new_type_id
1820 (cp_parser
*, tree
*);
1821 static cp_declarator
*cp_parser_new_declarator_opt
1823 static cp_declarator
*cp_parser_direct_new_declarator
1825 static VEC(tree
,gc
) *cp_parser_new_initializer
1827 static tree cp_parser_delete_expression
1829 static tree cp_parser_cast_expression
1830 (cp_parser
*, bool, bool, cp_id_kind
*);
1831 static tree cp_parser_binary_expression
1832 (cp_parser
*, bool, bool, enum cp_parser_prec
, cp_id_kind
*);
1833 static tree cp_parser_question_colon_clause
1834 (cp_parser
*, tree
);
1835 static tree cp_parser_assignment_expression
1836 (cp_parser
*, bool, cp_id_kind
*);
1837 static enum tree_code cp_parser_assignment_operator_opt
1839 static tree cp_parser_expression
1840 (cp_parser
*, bool, cp_id_kind
*);
1841 static tree cp_parser_constant_expression
1842 (cp_parser
*, bool, bool *);
1843 static tree cp_parser_builtin_offsetof
1845 static tree cp_parser_lambda_expression
1847 static void cp_parser_lambda_introducer
1848 (cp_parser
*, tree
);
1849 static bool cp_parser_lambda_declarator_opt
1850 (cp_parser
*, tree
);
1851 static void cp_parser_lambda_body
1852 (cp_parser
*, tree
);
1854 /* Statements [gram.stmt.stmt] */
1856 static void cp_parser_statement
1857 (cp_parser
*, tree
, bool, bool *);
1858 static void cp_parser_label_for_labeled_statement
1860 static tree cp_parser_expression_statement
1861 (cp_parser
*, tree
);
1862 static tree cp_parser_compound_statement
1863 (cp_parser
*, tree
, bool, bool);
1864 static void cp_parser_statement_seq_opt
1865 (cp_parser
*, tree
);
1866 static tree cp_parser_selection_statement
1867 (cp_parser
*, bool *);
1868 static tree cp_parser_condition
1870 static tree cp_parser_iteration_statement
1872 static bool cp_parser_for_init_statement
1873 (cp_parser
*, tree
*decl
);
1874 static tree cp_parser_for
1876 static tree cp_parser_c_for
1877 (cp_parser
*, tree
, tree
);
1878 static tree cp_parser_range_for
1879 (cp_parser
*, tree
, tree
, tree
);
1880 static void do_range_for_auto_deduction
1882 static tree cp_parser_perform_range_for_lookup
1883 (tree
, tree
*, tree
*);
1884 static tree cp_parser_range_for_member_function
1886 static tree cp_parser_jump_statement
1888 static void cp_parser_declaration_statement
1891 static tree cp_parser_implicitly_scoped_statement
1892 (cp_parser
*, bool *);
1893 static void cp_parser_already_scoped_statement
1896 /* Declarations [gram.dcl.dcl] */
1898 static void cp_parser_declaration_seq_opt
1900 static void cp_parser_declaration
1902 static void cp_parser_block_declaration
1903 (cp_parser
*, bool);
1904 static void cp_parser_simple_declaration
1905 (cp_parser
*, bool, tree
*);
1906 static void cp_parser_decl_specifier_seq
1907 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, int *);
1908 static tree cp_parser_storage_class_specifier_opt
1910 static tree cp_parser_function_specifier_opt
1911 (cp_parser
*, cp_decl_specifier_seq
*);
1912 static tree cp_parser_type_specifier
1913 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, bool,
1915 static tree cp_parser_simple_type_specifier
1916 (cp_parser
*, cp_decl_specifier_seq
*, cp_parser_flags
);
1917 static tree cp_parser_type_name
1919 static tree cp_parser_nonclass_name
1920 (cp_parser
* parser
);
1921 static tree cp_parser_elaborated_type_specifier
1922 (cp_parser
*, bool, bool);
1923 static tree cp_parser_enum_specifier
1925 static void cp_parser_enumerator_list
1926 (cp_parser
*, tree
);
1927 static void cp_parser_enumerator_definition
1928 (cp_parser
*, tree
);
1929 static tree cp_parser_namespace_name
1931 static void cp_parser_namespace_definition
1933 static void cp_parser_namespace_body
1935 static tree cp_parser_qualified_namespace_specifier
1937 static void cp_parser_namespace_alias_definition
1939 static bool cp_parser_using_declaration
1940 (cp_parser
*, bool);
1941 static void cp_parser_using_directive
1943 static tree cp_parser_alias_declaration
1945 static void cp_parser_asm_definition
1947 static void cp_parser_linkage_specification
1949 static void cp_parser_static_assert
1950 (cp_parser
*, bool);
1951 static tree cp_parser_decltype
1954 /* Declarators [gram.dcl.decl] */
1956 static tree cp_parser_init_declarator
1957 (cp_parser
*, cp_decl_specifier_seq
*, VEC (deferred_access_check
,gc
)*, bool, bool, int, bool *, tree
*);
1958 static cp_declarator
*cp_parser_declarator
1959 (cp_parser
*, cp_parser_declarator_kind
, int *, bool *, bool);
1960 static cp_declarator
*cp_parser_direct_declarator
1961 (cp_parser
*, cp_parser_declarator_kind
, int *, bool);
1962 static enum tree_code cp_parser_ptr_operator
1963 (cp_parser
*, tree
*, cp_cv_quals
*);
1964 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1966 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1968 static tree cp_parser_late_return_type_opt
1969 (cp_parser
*, cp_cv_quals
);
1970 static tree cp_parser_declarator_id
1971 (cp_parser
*, bool);
1972 static tree cp_parser_type_id
1974 static tree cp_parser_template_type_arg
1976 static tree
cp_parser_trailing_type_id (cp_parser
*);
1977 static tree cp_parser_type_id_1
1978 (cp_parser
*, bool, bool);
1979 static void cp_parser_type_specifier_seq
1980 (cp_parser
*, bool, bool, cp_decl_specifier_seq
*);
1981 static tree cp_parser_parameter_declaration_clause
1983 static tree cp_parser_parameter_declaration_list
1984 (cp_parser
*, bool *);
1985 static cp_parameter_declarator
*cp_parser_parameter_declaration
1986 (cp_parser
*, bool, bool *);
1987 static tree cp_parser_default_argument
1988 (cp_parser
*, bool);
1989 static void cp_parser_function_body
1991 static tree cp_parser_initializer
1992 (cp_parser
*, bool *, bool *);
1993 static tree cp_parser_initializer_clause
1994 (cp_parser
*, bool *);
1995 static tree cp_parser_braced_list
1996 (cp_parser
*, bool*);
1997 static VEC(constructor_elt
,gc
) *cp_parser_initializer_list
1998 (cp_parser
*, bool *);
2000 static bool cp_parser_ctor_initializer_opt_and_function_body
2003 /* Classes [gram.class] */
2005 static tree cp_parser_class_name
2006 (cp_parser
*, bool, bool, enum tag_types
, bool, bool, bool);
2007 static tree cp_parser_class_specifier
2009 static tree cp_parser_class_head
2010 (cp_parser
*, bool *, tree
*, tree
*);
2011 static enum tag_types cp_parser_class_key
2013 static void cp_parser_member_specification_opt
2015 static void cp_parser_member_declaration
2017 static tree cp_parser_pure_specifier
2019 static tree cp_parser_constant_initializer
2022 /* Derived classes [gram.class.derived] */
2024 static tree cp_parser_base_clause
2026 static tree cp_parser_base_specifier
2029 /* Special member functions [gram.special] */
2031 static tree cp_parser_conversion_function_id
2033 static tree cp_parser_conversion_type_id
2035 static cp_declarator
*cp_parser_conversion_declarator_opt
2037 static bool cp_parser_ctor_initializer_opt
2039 static void cp_parser_mem_initializer_list
2041 static tree cp_parser_mem_initializer
2043 static tree cp_parser_mem_initializer_id
2046 /* Overloading [gram.over] */
2048 static tree cp_parser_operator_function_id
2050 static tree cp_parser_operator
2053 /* Templates [gram.temp] */
2055 static void cp_parser_template_declaration
2056 (cp_parser
*, bool);
2057 static tree cp_parser_template_parameter_list
2059 static tree cp_parser_template_parameter
2060 (cp_parser
*, bool *, bool *);
2061 static tree cp_parser_type_parameter
2062 (cp_parser
*, bool *);
2063 static tree cp_parser_template_id
2064 (cp_parser
*, bool, bool, bool);
2065 static tree cp_parser_template_name
2066 (cp_parser
*, bool, bool, bool, bool *);
2067 static tree cp_parser_template_argument_list
2069 static tree cp_parser_template_argument
2071 static void cp_parser_explicit_instantiation
2073 static void cp_parser_explicit_specialization
2076 /* Exception handling [gram.exception] */
2078 static tree cp_parser_try_block
2080 static bool cp_parser_function_try_block
2082 static void cp_parser_handler_seq
2084 static void cp_parser_handler
2086 static tree cp_parser_exception_declaration
2088 static tree cp_parser_throw_expression
2090 static tree cp_parser_exception_specification_opt
2092 static tree cp_parser_type_id_list
2095 /* GNU Extensions */
2097 static tree cp_parser_asm_specification_opt
2099 static tree cp_parser_asm_operand_list
2101 static tree cp_parser_asm_clobber_list
2103 static tree cp_parser_asm_label_list
2105 static tree cp_parser_attributes_opt
2107 static tree cp_parser_attribute_list
2109 static bool cp_parser_extension_opt
2110 (cp_parser
*, int *);
2111 static void cp_parser_label_declaration
2114 /* Transactional Memory Extensions */
2116 static tree cp_parser_transaction
2117 (cp_parser
*, enum rid
);
2118 static tree cp_parser_transaction_expression
2119 (cp_parser
*, enum rid
);
2120 static bool cp_parser_function_transaction
2121 (cp_parser
*, enum rid
);
2122 static tree cp_parser_transaction_cancel
2125 enum pragma_context
{ pragma_external
, pragma_stmt
, pragma_compound
};
2126 static bool cp_parser_pragma
2127 (cp_parser
*, enum pragma_context
);
2129 /* Objective-C++ Productions */
2131 static tree cp_parser_objc_message_receiver
2133 static tree cp_parser_objc_message_args
2135 static tree cp_parser_objc_message_expression
2137 static tree cp_parser_objc_encode_expression
2139 static tree cp_parser_objc_defs_expression
2141 static tree cp_parser_objc_protocol_expression
2143 static tree cp_parser_objc_selector_expression
2145 static tree cp_parser_objc_expression
2147 static bool cp_parser_objc_selector_p
2149 static tree cp_parser_objc_selector
2151 static tree cp_parser_objc_protocol_refs_opt
2153 static void cp_parser_objc_declaration
2154 (cp_parser
*, tree
);
2155 static tree cp_parser_objc_statement
2157 static bool cp_parser_objc_valid_prefix_attributes
2158 (cp_parser
*, tree
*);
2159 static void cp_parser_objc_at_property_declaration
2161 static void cp_parser_objc_at_synthesize_declaration
2163 static void cp_parser_objc_at_dynamic_declaration
2165 static tree cp_parser_objc_struct_declaration
2168 /* Utility Routines */
2170 static tree cp_parser_lookup_name
2171 (cp_parser
*, tree
, enum tag_types
, bool, bool, bool, tree
*, location_t
);
2172 static tree cp_parser_lookup_name_simple
2173 (cp_parser
*, tree
, location_t
);
2174 static tree cp_parser_maybe_treat_template_as_class
2176 static bool cp_parser_check_declarator_template_parameters
2177 (cp_parser
*, cp_declarator
*, location_t
);
2178 static bool cp_parser_check_template_parameters
2179 (cp_parser
*, unsigned, location_t
, cp_declarator
*);
2180 static tree cp_parser_simple_cast_expression
2182 static tree cp_parser_global_scope_opt
2183 (cp_parser
*, bool);
2184 static bool cp_parser_constructor_declarator_p
2185 (cp_parser
*, bool);
2186 static tree cp_parser_function_definition_from_specifiers_and_declarator
2187 (cp_parser
*, cp_decl_specifier_seq
*, tree
, const cp_declarator
*);
2188 static tree cp_parser_function_definition_after_declarator
2189 (cp_parser
*, bool);
2190 static void cp_parser_template_declaration_after_export
2191 (cp_parser
*, bool);
2192 static void cp_parser_perform_template_parameter_access_checks
2193 (VEC (deferred_access_check
,gc
)*);
2194 static tree cp_parser_single_declaration
2195 (cp_parser
*, VEC (deferred_access_check
,gc
)*, bool, bool, bool *);
2196 static tree cp_parser_functional_cast
2197 (cp_parser
*, tree
);
2198 static tree cp_parser_save_member_function_body
2199 (cp_parser
*, cp_decl_specifier_seq
*, cp_declarator
*, tree
);
2200 static tree cp_parser_save_nsdmi
2202 static tree cp_parser_enclosed_template_argument_list
2204 static void cp_parser_save_default_args
2205 (cp_parser
*, tree
);
2206 static void cp_parser_late_parsing_for_member
2207 (cp_parser
*, tree
);
2208 static tree cp_parser_late_parse_one_default_arg
2209 (cp_parser
*, tree
, tree
, tree
);
2210 static void cp_parser_late_parsing_nsdmi
2211 (cp_parser
*, tree
);
2212 static void cp_parser_late_parsing_default_args
2213 (cp_parser
*, tree
);
2214 static tree cp_parser_sizeof_operand
2215 (cp_parser
*, enum rid
);
2216 static tree cp_parser_trait_expr
2217 (cp_parser
*, enum rid
);
2218 static bool cp_parser_declares_only_class_p
2220 static void cp_parser_set_storage_class
2221 (cp_parser
*, cp_decl_specifier_seq
*, enum rid
, location_t
);
2222 static void cp_parser_set_decl_spec_type
2223 (cp_decl_specifier_seq
*, tree
, location_t
, bool);
2224 static bool cp_parser_friend_p
2225 (const cp_decl_specifier_seq
*);
2226 static void cp_parser_required_error
2227 (cp_parser
*, required_token
, bool);
2228 static cp_token
*cp_parser_require
2229 (cp_parser
*, enum cpp_ttype
, required_token
);
2230 static cp_token
*cp_parser_require_keyword
2231 (cp_parser
*, enum rid
, required_token
);
2232 static bool cp_parser_token_starts_function_definition_p
2234 static bool cp_parser_next_token_starts_class_definition_p
2236 static bool cp_parser_next_token_ends_template_argument_p
2238 static bool cp_parser_nth_token_starts_template_argument_list_p
2239 (cp_parser
*, size_t);
2240 static enum tag_types cp_parser_token_is_class_key
2242 static void cp_parser_check_class_key
2243 (enum tag_types
, tree type
);
2244 static void cp_parser_check_access_in_redeclaration
2245 (tree type
, location_t location
);
2246 static bool cp_parser_optional_template_keyword
2248 static void cp_parser_pre_parsed_nested_name_specifier
2250 static bool cp_parser_cache_group
2251 (cp_parser
*, enum cpp_ttype
, unsigned);
2252 static void cp_parser_parse_tentatively
2254 static void cp_parser_commit_to_tentative_parse
2256 static void cp_parser_abort_tentative_parse
2258 static bool cp_parser_parse_definitely
2260 static inline bool cp_parser_parsing_tentatively
2262 static bool cp_parser_uncommitted_to_tentative_parse_p
2264 static void cp_parser_error
2265 (cp_parser
*, const char *);
2266 static void cp_parser_name_lookup_error
2267 (cp_parser
*, tree
, tree
, name_lookup_error
, location_t
);
2268 static bool cp_parser_simulate_error
2270 static bool cp_parser_check_type_definition
2272 static void cp_parser_check_for_definition_in_return_type
2273 (cp_declarator
*, tree
, location_t type_location
);
2274 static void cp_parser_check_for_invalid_template_id
2275 (cp_parser
*, tree
, location_t location
);
2276 static bool cp_parser_non_integral_constant_expression
2277 (cp_parser
*, non_integral_constant
);
2278 static void cp_parser_diagnose_invalid_type_name
2279 (cp_parser
*, tree
, tree
, location_t
);
2280 static bool cp_parser_parse_and_diagnose_invalid_type_name
2282 static int cp_parser_skip_to_closing_parenthesis
2283 (cp_parser
*, bool, bool, bool);
2284 static void cp_parser_skip_to_end_of_statement
2286 static void cp_parser_consume_semicolon_at_end_of_statement
2288 static void cp_parser_skip_to_end_of_block_or_statement
2290 static bool cp_parser_skip_to_closing_brace
2292 static void cp_parser_skip_to_end_of_template_parameter_list
2294 static void cp_parser_skip_to_pragma_eol
2295 (cp_parser
*, cp_token
*);
2296 static bool cp_parser_error_occurred
2298 static bool cp_parser_allow_gnu_extensions_p
2300 static bool cp_parser_is_pure_string_literal
2302 static bool cp_parser_is_string_literal
2304 static bool cp_parser_is_keyword
2305 (cp_token
*, enum rid
);
2306 static tree cp_parser_make_typename_type
2307 (cp_parser
*, tree
, tree
, location_t location
);
2308 static cp_declarator
* cp_parser_make_indirect_declarator
2309 (enum tree_code
, tree
, cp_cv_quals
, cp_declarator
*);
2311 /* Returns nonzero if we are parsing tentatively. */
2314 cp_parser_parsing_tentatively (cp_parser
* parser
)
2316 return parser
->context
->next
!= NULL
;
2319 /* Returns nonzero if TOKEN is a string literal. */
2322 cp_parser_is_pure_string_literal (cp_token
* token
)
2324 return (token
->type
== CPP_STRING
||
2325 token
->type
== CPP_STRING16
||
2326 token
->type
== CPP_STRING32
||
2327 token
->type
== CPP_WSTRING
||
2328 token
->type
== CPP_UTF8STRING
);
2331 /* Returns nonzero if TOKEN is a string literal
2332 of a user-defined string literal. */
2335 cp_parser_is_string_literal (cp_token
* token
)
2337 return (cp_parser_is_pure_string_literal (token
) ||
2338 token
->type
== CPP_STRING_USERDEF
||
2339 token
->type
== CPP_STRING16_USERDEF
||
2340 token
->type
== CPP_STRING32_USERDEF
||
2341 token
->type
== CPP_WSTRING_USERDEF
||
2342 token
->type
== CPP_UTF8STRING_USERDEF
);
2345 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2348 cp_parser_is_keyword (cp_token
* token
, enum rid keyword
)
2350 return token
->keyword
== keyword
;
2353 /* If not parsing tentatively, issue a diagnostic of the form
2354 FILE:LINE: MESSAGE before TOKEN
2355 where TOKEN is the next token in the input stream. MESSAGE
2356 (specified by the caller) is usually of the form "expected
2360 cp_parser_error (cp_parser
* parser
, const char* gmsgid
)
2362 if (!cp_parser_simulate_error (parser
))
2364 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2365 /* This diagnostic makes more sense if it is tagged to the line
2366 of the token we just peeked at. */
2367 cp_lexer_set_source_position_from_token (token
);
2369 if (token
->type
== CPP_PRAGMA
)
2371 error_at (token
->location
,
2372 "%<#pragma%> is not allowed here");
2373 cp_parser_skip_to_pragma_eol (parser
, token
);
2377 c_parse_error (gmsgid
,
2378 /* Because c_parser_error does not understand
2379 CPP_KEYWORD, keywords are treated like
2381 (token
->type
== CPP_KEYWORD
? CPP_NAME
: token
->type
),
2382 token
->u
.value
, token
->flags
);
2386 /* Issue an error about name-lookup failing. NAME is the
2387 IDENTIFIER_NODE DECL is the result of
2388 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2389 the thing that we hoped to find. */
2392 cp_parser_name_lookup_error (cp_parser
* parser
,
2395 name_lookup_error desired
,
2396 location_t location
)
2398 /* If name lookup completely failed, tell the user that NAME was not
2400 if (decl
== error_mark_node
)
2402 if (parser
->scope
&& parser
->scope
!= global_namespace
)
2403 error_at (location
, "%<%E::%E%> has not been declared",
2404 parser
->scope
, name
);
2405 else if (parser
->scope
== global_namespace
)
2406 error_at (location
, "%<::%E%> has not been declared", name
);
2407 else if (parser
->object_scope
2408 && !CLASS_TYPE_P (parser
->object_scope
))
2409 error_at (location
, "request for member %qE in non-class type %qT",
2410 name
, parser
->object_scope
);
2411 else if (parser
->object_scope
)
2412 error_at (location
, "%<%T::%E%> has not been declared",
2413 parser
->object_scope
, name
);
2415 error_at (location
, "%qE has not been declared", name
);
2417 else if (parser
->scope
&& parser
->scope
!= global_namespace
)
2422 error_at (location
, "%<%E::%E%> is not a type",
2423 parser
->scope
, name
);
2426 error_at (location
, "%<%E::%E%> is not a class or namespace",
2427 parser
->scope
, name
);
2431 "%<%E::%E%> is not a class, namespace, or enumeration",
2432 parser
->scope
, name
);
2439 else if (parser
->scope
== global_namespace
)
2444 error_at (location
, "%<::%E%> is not a type", name
);
2447 error_at (location
, "%<::%E%> is not a class or namespace", name
);
2451 "%<::%E%> is not a class, namespace, or enumeration",
2463 error_at (location
, "%qE is not a type", name
);
2466 error_at (location
, "%qE is not a class or namespace", name
);
2470 "%qE is not a class, namespace, or enumeration", name
);
2478 /* If we are parsing tentatively, remember that an error has occurred
2479 during this tentative parse. Returns true if the error was
2480 simulated; false if a message should be issued by the caller. */
2483 cp_parser_simulate_error (cp_parser
* parser
)
2485 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2487 parser
->context
->status
= CP_PARSER_STATUS_KIND_ERROR
;
2493 /* Check for repeated decl-specifiers. */
2496 cp_parser_check_decl_spec (cp_decl_specifier_seq
*decl_specs
,
2497 location_t location
)
2501 for (ds
= ds_first
; ds
!= ds_last
; ++ds
)
2503 unsigned count
= decl_specs
->specs
[ds
];
2506 /* The "long" specifier is a special case because of "long long". */
2510 error_at (location
, "%<long long long%> is too long for GCC");
2512 pedwarn_cxx98 (location
, OPT_Wlong_long
,
2513 "ISO C++ 1998 does not support %<long long%>");
2517 static const char *const decl_spec_names
[] = {
2535 error_at (location
, "duplicate %qs", decl_spec_names
[ds
]);
2540 /* This function is called when a type is defined. If type
2541 definitions are forbidden at this point, an error message is
2545 cp_parser_check_type_definition (cp_parser
* parser
)
2547 /* If types are forbidden here, issue a message. */
2548 if (parser
->type_definition_forbidden_message
)
2550 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2551 in the message need to be interpreted. */
2552 error (parser
->type_definition_forbidden_message
);
2558 /* This function is called when the DECLARATOR is processed. The TYPE
2559 was a type defined in the decl-specifiers. If it is invalid to
2560 define a type in the decl-specifiers for DECLARATOR, an error is
2561 issued. TYPE_LOCATION is the location of TYPE and is used
2562 for error reporting. */
2565 cp_parser_check_for_definition_in_return_type (cp_declarator
*declarator
,
2566 tree type
, location_t type_location
)
2568 /* [dcl.fct] forbids type definitions in return types.
2569 Unfortunately, it's not easy to know whether or not we are
2570 processing a return type until after the fact. */
2572 && (declarator
->kind
== cdk_pointer
2573 || declarator
->kind
== cdk_reference
2574 || declarator
->kind
== cdk_ptrmem
))
2575 declarator
= declarator
->declarator
;
2577 && declarator
->kind
== cdk_function
)
2579 error_at (type_location
,
2580 "new types may not be defined in a return type");
2581 inform (type_location
,
2582 "(perhaps a semicolon is missing after the definition of %qT)",
2587 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2588 "<" in any valid C++ program. If the next token is indeed "<",
2589 issue a message warning the user about what appears to be an
2590 invalid attempt to form a template-id. LOCATION is the location
2591 of the type-specifier (TYPE) */
2594 cp_parser_check_for_invalid_template_id (cp_parser
* parser
,
2595 tree type
, location_t location
)
2597 cp_token_position start
= 0;
2599 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2602 error_at (location
, "%qT is not a template", type
);
2603 else if (TREE_CODE (type
) == IDENTIFIER_NODE
)
2604 error_at (location
, "%qE is not a template", type
);
2606 error_at (location
, "invalid template-id");
2607 /* Remember the location of the invalid "<". */
2608 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2609 start
= cp_lexer_token_position (parser
->lexer
, true);
2610 /* Consume the "<". */
2611 cp_lexer_consume_token (parser
->lexer
);
2612 /* Parse the template arguments. */
2613 cp_parser_enclosed_template_argument_list (parser
);
2614 /* Permanently remove the invalid template arguments so that
2615 this error message is not issued again. */
2617 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
2621 /* If parsing an integral constant-expression, issue an error message
2622 about the fact that THING appeared and return true. Otherwise,
2623 return false. In either case, set
2624 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2627 cp_parser_non_integral_constant_expression (cp_parser
*parser
,
2628 non_integral_constant thing
)
2630 parser
->non_integral_constant_expression_p
= true;
2631 if (parser
->integral_constant_expression_p
)
2633 if (!parser
->allow_non_integral_constant_expression_p
)
2635 const char *msg
= NULL
;
2639 error ("floating-point literal "
2640 "cannot appear in a constant-expression");
2643 error ("a cast to a type other than an integral or "
2644 "enumeration type cannot appear in a "
2645 "constant-expression");
2648 error ("%<typeid%> operator "
2649 "cannot appear in a constant-expression");
2652 error ("non-constant compound literals "
2653 "cannot appear in a constant-expression");
2656 error ("a function call "
2657 "cannot appear in a constant-expression");
2660 error ("an increment "
2661 "cannot appear in a constant-expression");
2664 error ("an decrement "
2665 "cannot appear in a constant-expression");
2668 error ("an array reference "
2669 "cannot appear in a constant-expression");
2671 case NIC_ADDR_LABEL
:
2672 error ("the address of a label "
2673 "cannot appear in a constant-expression");
2675 case NIC_OVERLOADED
:
2676 error ("calls to overloaded operators "
2677 "cannot appear in a constant-expression");
2679 case NIC_ASSIGNMENT
:
2680 error ("an assignment cannot appear in a constant-expression");
2683 error ("a comma operator "
2684 "cannot appear in a constant-expression");
2686 case NIC_CONSTRUCTOR
:
2687 error ("a call to a constructor "
2688 "cannot appear in a constant-expression");
2690 case NIC_TRANSACTION
:
2691 error ("a transaction expression "
2692 "cannot appear in a constant-expression");
2698 msg
= "__FUNCTION__";
2700 case NIC_PRETTY_FUNC
:
2701 msg
= "__PRETTY_FUNCTION__";
2721 case NIC_PREINCREMENT
:
2724 case NIC_PREDECREMENT
:
2737 error ("%qs cannot appear in a constant-expression", msg
);
2744 /* Emit a diagnostic for an invalid type name. SCOPE is the
2745 qualifying scope (or NULL, if none) for ID. This function commits
2746 to the current active tentative parse, if any. (Otherwise, the
2747 problematic construct might be encountered again later, resulting
2748 in duplicate error messages.) LOCATION is the location of ID. */
2751 cp_parser_diagnose_invalid_type_name (cp_parser
*parser
,
2752 tree scope
, tree id
,
2753 location_t location
)
2755 tree decl
, old_scope
;
2756 cp_parser_commit_to_tentative_parse (parser
);
2757 /* Try to lookup the identifier. */
2758 old_scope
= parser
->scope
;
2759 parser
->scope
= scope
;
2760 decl
= cp_parser_lookup_name_simple (parser
, id
, location
);
2761 parser
->scope
= old_scope
;
2762 /* If the lookup found a template-name, it means that the user forgot
2763 to specify an argument list. Emit a useful error message. */
2764 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2766 "invalid use of template-name %qE without an argument list",
2768 else if (TREE_CODE (id
) == BIT_NOT_EXPR
)
2769 error_at (location
, "invalid use of destructor %qD as a type", id
);
2770 else if (TREE_CODE (decl
) == TYPE_DECL
)
2771 /* Something like 'unsigned A a;' */
2772 error_at (location
, "invalid combination of multiple type-specifiers");
2773 else if (!parser
->scope
)
2775 /* Issue an error message. */
2776 error_at (location
, "%qE does not name a type", id
);
2777 /* If we're in a template class, it's possible that the user was
2778 referring to a type from a base class. For example:
2780 template <typename T> struct A { typedef T X; };
2781 template <typename T> struct B : public A<T> { X x; };
2783 The user should have said "typename A<T>::X". */
2784 if (cxx_dialect
< cxx0x
&& id
== ridpointers
[(int)RID_CONSTEXPR
])
2785 inform (location
, "C++11 %<constexpr%> only available with "
2786 "-std=c++11 or -std=gnu++11");
2787 else if (processing_template_decl
&& current_class_type
2788 && TYPE_BINFO (current_class_type
))
2792 for (b
= TREE_CHAIN (TYPE_BINFO (current_class_type
));
2796 tree base_type
= BINFO_TYPE (b
);
2797 if (CLASS_TYPE_P (base_type
)
2798 && dependent_type_p (base_type
))
2801 /* Go from a particular instantiation of the
2802 template (which will have an empty TYPE_FIELDs),
2803 to the main version. */
2804 base_type
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type
);
2805 for (field
= TYPE_FIELDS (base_type
);
2807 field
= DECL_CHAIN (field
))
2808 if (TREE_CODE (field
) == TYPE_DECL
2809 && DECL_NAME (field
) == id
)
2812 "(perhaps %<typename %T::%E%> was intended)",
2813 BINFO_TYPE (b
), id
);
2822 /* Here we diagnose qualified-ids where the scope is actually correct,
2823 but the identifier does not resolve to a valid type name. */
2824 else if (parser
->scope
!= error_mark_node
)
2826 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
2827 error_at (location
, "%qE in namespace %qE does not name a type",
2829 else if (CLASS_TYPE_P (parser
->scope
)
2830 && constructor_name_p (id
, parser
->scope
))
2833 error_at (location
, "%<%T::%E%> names the constructor, not"
2834 " the type", parser
->scope
, id
);
2835 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2836 error_at (location
, "and %qT has no template constructors",
2839 else if (TYPE_P (parser
->scope
)
2840 && dependent_scope_p (parser
->scope
))
2841 error_at (location
, "need %<typename%> before %<%T::%E%> because "
2842 "%qT is a dependent scope",
2843 parser
->scope
, id
, parser
->scope
);
2844 else if (TYPE_P (parser
->scope
))
2845 error_at (location
, "%qE in %q#T does not name a type",
2852 /* Check for a common situation where a type-name should be present,
2853 but is not, and issue a sensible error message. Returns true if an
2854 invalid type-name was detected.
2856 The situation handled by this function are variable declarations of the
2857 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2858 Usually, `ID' should name a type, but if we got here it means that it
2859 does not. We try to emit the best possible error message depending on
2860 how exactly the id-expression looks like. */
2863 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser
*parser
)
2866 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2868 /* Avoid duplicate error about ambiguous lookup. */
2869 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
2871 cp_token
*next
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
2872 if (next
->type
== CPP_NAME
&& next
->ambiguous_p
)
2876 cp_parser_parse_tentatively (parser
);
2877 id
= cp_parser_id_expression (parser
,
2878 /*template_keyword_p=*/false,
2879 /*check_dependency_p=*/true,
2880 /*template_p=*/NULL
,
2881 /*declarator_p=*/true,
2882 /*optional_p=*/false);
2883 /* If the next token is a (, this is a function with no explicit return
2884 type, i.e. constructor, destructor or conversion op. */
2885 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
2886 || TREE_CODE (id
) == TYPE_DECL
)
2888 cp_parser_abort_tentative_parse (parser
);
2891 if (!cp_parser_parse_definitely (parser
))
2894 /* Emit a diagnostic for the invalid type. */
2895 cp_parser_diagnose_invalid_type_name (parser
, parser
->scope
,
2896 id
, token
->location
);
2898 /* If we aren't in the middle of a declarator (i.e. in a
2899 parameter-declaration-clause), skip to the end of the declaration;
2900 there's no point in trying to process it. */
2901 if (!parser
->in_declarator_p
)
2902 cp_parser_skip_to_end_of_block_or_statement (parser
);
2906 /* Consume tokens up to, and including, the next non-nested closing `)'.
2907 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2908 are doing error recovery. Returns -1 if OR_COMMA is true and we
2909 found an unnested comma. */
2912 cp_parser_skip_to_closing_parenthesis (cp_parser
*parser
,
2917 unsigned paren_depth
= 0;
2918 unsigned brace_depth
= 0;
2919 unsigned square_depth
= 0;
2921 if (recovering
&& !or_comma
2922 && cp_parser_uncommitted_to_tentative_parse_p (parser
))
2927 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
2929 switch (token
->type
)
2932 case CPP_PRAGMA_EOL
:
2933 /* If we've run out of tokens, then there is no closing `)'. */
2936 /* This is good for lambda expression capture-lists. */
2937 case CPP_OPEN_SQUARE
:
2940 case CPP_CLOSE_SQUARE
:
2941 if (!square_depth
--)
2946 /* This matches the processing in skip_to_end_of_statement. */
2951 case CPP_OPEN_BRACE
:
2954 case CPP_CLOSE_BRACE
:
2960 if (recovering
&& or_comma
&& !brace_depth
&& !paren_depth
2965 case CPP_OPEN_PAREN
:
2970 case CPP_CLOSE_PAREN
:
2971 if (!brace_depth
&& !paren_depth
--)
2974 cp_lexer_consume_token (parser
->lexer
);
2983 /* Consume the token. */
2984 cp_lexer_consume_token (parser
->lexer
);
2988 /* Consume tokens until we reach the end of the current statement.
2989 Normally, that will be just before consuming a `;'. However, if a
2990 non-nested `}' comes first, then we stop before consuming that. */
2993 cp_parser_skip_to_end_of_statement (cp_parser
* parser
)
2995 unsigned nesting_depth
= 0;
2999 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3001 switch (token
->type
)
3004 case CPP_PRAGMA_EOL
:
3005 /* If we've run out of tokens, stop. */
3009 /* If the next token is a `;', we have reached the end of the
3015 case CPP_CLOSE_BRACE
:
3016 /* If this is a non-nested '}', stop before consuming it.
3017 That way, when confronted with something like:
3021 we stop before consuming the closing '}', even though we
3022 have not yet reached a `;'. */
3023 if (nesting_depth
== 0)
3026 /* If it is the closing '}' for a block that we have
3027 scanned, stop -- but only after consuming the token.
3033 we will stop after the body of the erroneously declared
3034 function, but before consuming the following `typedef'
3036 if (--nesting_depth
== 0)
3038 cp_lexer_consume_token (parser
->lexer
);
3042 case CPP_OPEN_BRACE
:
3050 /* Consume the token. */
3051 cp_lexer_consume_token (parser
->lexer
);
3055 /* This function is called at the end of a statement or declaration.
3056 If the next token is a semicolon, it is consumed; otherwise, error
3057 recovery is attempted. */
3060 cp_parser_consume_semicolon_at_end_of_statement (cp_parser
*parser
)
3062 /* Look for the trailing `;'. */
3063 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
3065 /* If there is additional (erroneous) input, skip to the end of
3067 cp_parser_skip_to_end_of_statement (parser
);
3068 /* If the next token is now a `;', consume it. */
3069 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
3070 cp_lexer_consume_token (parser
->lexer
);
3074 /* Skip tokens until we have consumed an entire block, or until we
3075 have consumed a non-nested `;'. */
3078 cp_parser_skip_to_end_of_block_or_statement (cp_parser
* parser
)
3080 int nesting_depth
= 0;
3082 while (nesting_depth
>= 0)
3084 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3086 switch (token
->type
)
3089 case CPP_PRAGMA_EOL
:
3090 /* If we've run out of tokens, stop. */
3094 /* Stop if this is an unnested ';'. */
3099 case CPP_CLOSE_BRACE
:
3100 /* Stop if this is an unnested '}', or closes the outermost
3103 if (nesting_depth
< 0)
3109 case CPP_OPEN_BRACE
:
3118 /* Consume the token. */
3119 cp_lexer_consume_token (parser
->lexer
);
3123 /* Skip tokens until a non-nested closing curly brace is the next
3124 token, or there are no more tokens. Return true in the first case,
3128 cp_parser_skip_to_closing_brace (cp_parser
*parser
)
3130 unsigned nesting_depth
= 0;
3134 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3136 switch (token
->type
)
3139 case CPP_PRAGMA_EOL
:
3140 /* If we've run out of tokens, stop. */
3143 case CPP_CLOSE_BRACE
:
3144 /* If the next token is a non-nested `}', then we have reached
3145 the end of the current block. */
3146 if (nesting_depth
-- == 0)
3150 case CPP_OPEN_BRACE
:
3151 /* If it the next token is a `{', then we are entering a new
3152 block. Consume the entire block. */
3160 /* Consume the token. */
3161 cp_lexer_consume_token (parser
->lexer
);
3165 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3166 parameter is the PRAGMA token, allowing us to purge the entire pragma
3170 cp_parser_skip_to_pragma_eol (cp_parser
* parser
, cp_token
*pragma_tok
)
3174 parser
->lexer
->in_pragma
= false;
3177 token
= cp_lexer_consume_token (parser
->lexer
);
3178 while (token
->type
!= CPP_PRAGMA_EOL
&& token
->type
!= CPP_EOF
);
3180 /* Ensure that the pragma is not parsed again. */
3181 cp_lexer_purge_tokens_after (parser
->lexer
, pragma_tok
);
3184 /* Require pragma end of line, resyncing with it as necessary. The
3185 arguments are as for cp_parser_skip_to_pragma_eol. */
3188 cp_parser_require_pragma_eol (cp_parser
*parser
, cp_token
*pragma_tok
)
3190 parser
->lexer
->in_pragma
= false;
3191 if (!cp_parser_require (parser
, CPP_PRAGMA_EOL
, RT_PRAGMA_EOL
))
3192 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
3195 /* This is a simple wrapper around make_typename_type. When the id is
3196 an unresolved identifier node, we can provide a superior diagnostic
3197 using cp_parser_diagnose_invalid_type_name. */
3200 cp_parser_make_typename_type (cp_parser
*parser
, tree scope
,
3201 tree id
, location_t id_location
)
3204 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
3206 result
= make_typename_type (scope
, id
, typename_type
,
3207 /*complain=*/tf_none
);
3208 if (result
== error_mark_node
)
3209 cp_parser_diagnose_invalid_type_name (parser
, scope
, id
, id_location
);
3212 return make_typename_type (scope
, id
, typename_type
, tf_error
);
3215 /* This is a wrapper around the
3216 make_{pointer,ptrmem,reference}_declarator functions that decides
3217 which one to call based on the CODE and CLASS_TYPE arguments. The
3218 CODE argument should be one of the values returned by
3219 cp_parser_ptr_operator. */
3220 static cp_declarator
*
3221 cp_parser_make_indirect_declarator (enum tree_code code
, tree class_type
,
3222 cp_cv_quals cv_qualifiers
,
3223 cp_declarator
*target
)
3225 if (code
== ERROR_MARK
)
3226 return cp_error_declarator
;
3228 if (code
== INDIRECT_REF
)
3229 if (class_type
== NULL_TREE
)
3230 return make_pointer_declarator (cv_qualifiers
, target
);
3232 return make_ptrmem_declarator (cv_qualifiers
, class_type
, target
);
3233 else if (code
== ADDR_EXPR
&& class_type
== NULL_TREE
)
3234 return make_reference_declarator (cv_qualifiers
, target
, false);
3235 else if (code
== NON_LVALUE_EXPR
&& class_type
== NULL_TREE
)
3236 return make_reference_declarator (cv_qualifiers
, target
, true);
3240 /* Create a new C++ parser. */
3243 cp_parser_new (void)
3249 /* cp_lexer_new_main is called before doing GC allocation because
3250 cp_lexer_new_main might load a PCH file. */
3251 lexer
= cp_lexer_new_main ();
3253 /* Initialize the binops_by_token so that we can get the tree
3254 directly from the token. */
3255 for (i
= 0; i
< sizeof (binops
) / sizeof (binops
[0]); i
++)
3256 binops_by_token
[binops
[i
].token_type
] = binops
[i
];
3258 parser
= ggc_alloc_cleared_cp_parser ();
3259 parser
->lexer
= lexer
;
3260 parser
->context
= cp_parser_context_new (NULL
);
3262 /* For now, we always accept GNU extensions. */
3263 parser
->allow_gnu_extensions_p
= 1;
3265 /* The `>' token is a greater-than operator, not the end of a
3267 parser
->greater_than_is_operator_p
= true;
3269 parser
->default_arg_ok_p
= true;
3271 /* We are not parsing a constant-expression. */
3272 parser
->integral_constant_expression_p
= false;
3273 parser
->allow_non_integral_constant_expression_p
= false;
3274 parser
->non_integral_constant_expression_p
= false;
3276 /* Local variable names are not forbidden. */
3277 parser
->local_variables_forbidden_p
= false;
3279 /* We are not processing an `extern "C"' declaration. */
3280 parser
->in_unbraced_linkage_specification_p
= false;
3282 /* We are not processing a declarator. */
3283 parser
->in_declarator_p
= false;
3285 /* We are not processing a template-argument-list. */
3286 parser
->in_template_argument_list_p
= false;
3288 /* We are not in an iteration statement. */
3289 parser
->in_statement
= 0;
3291 /* We are not in a switch statement. */
3292 parser
->in_switch_statement_p
= false;
3294 /* We are not parsing a type-id inside an expression. */
3295 parser
->in_type_id_in_expr_p
= false;
3297 /* Declarations aren't implicitly extern "C". */
3298 parser
->implicit_extern_c
= false;
3300 /* String literals should be translated to the execution character set. */
3301 parser
->translate_strings_p
= true;
3303 /* We are not parsing a function body. */
3304 parser
->in_function_body
= false;
3306 /* We can correct until told otherwise. */
3307 parser
->colon_corrects_to_scope_p
= true;
3309 /* The unparsed function queue is empty. */
3310 push_unparsed_function_queues (parser
);
3312 /* There are no classes being defined. */
3313 parser
->num_classes_being_defined
= 0;
3315 /* No template parameters apply. */
3316 parser
->num_template_parameter_lists
= 0;
3321 /* Create a cp_lexer structure which will emit the tokens in CACHE
3322 and push it onto the parser's lexer stack. This is used for delayed
3323 parsing of in-class method bodies and default arguments, and should
3324 not be confused with tentative parsing. */
3326 cp_parser_push_lexer_for_tokens (cp_parser
*parser
, cp_token_cache
*cache
)
3328 cp_lexer
*lexer
= cp_lexer_new_from_tokens (cache
);
3329 lexer
->next
= parser
->lexer
;
3330 parser
->lexer
= lexer
;
3332 /* Move the current source position to that of the first token in the
3334 cp_lexer_set_source_position_from_token (lexer
->next_token
);
3337 /* Pop the top lexer off the parser stack. This is never used for the
3338 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3340 cp_parser_pop_lexer (cp_parser
*parser
)
3342 cp_lexer
*lexer
= parser
->lexer
;
3343 parser
->lexer
= lexer
->next
;
3344 cp_lexer_destroy (lexer
);
3346 /* Put the current source position back where it was before this
3347 lexer was pushed. */
3348 cp_lexer_set_source_position_from_token (parser
->lexer
->next_token
);
3351 /* Lexical conventions [gram.lex] */
3353 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3357 cp_parser_identifier (cp_parser
* parser
)
3361 /* Look for the identifier. */
3362 token
= cp_parser_require (parser
, CPP_NAME
, RT_NAME
);
3363 /* Return the value. */
3364 return token
? token
->u
.value
: error_mark_node
;
3367 /* Parse a sequence of adjacent string constants. Returns a
3368 TREE_STRING representing the combined, nul-terminated string
3369 constant. If TRANSLATE is true, translate the string to the
3370 execution character set. If WIDE_OK is true, a wide string is
3373 C++98 [lex.string] says that if a narrow string literal token is
3374 adjacent to a wide string literal token, the behavior is undefined.
3375 However, C99 6.4.5p4 says that this results in a wide string literal.
3376 We follow C99 here, for consistency with the C front end.
3378 This code is largely lifted from lex_string() in c-lex.c.
3380 FUTURE: ObjC++ will need to handle @-strings here. */
3382 cp_parser_string_literal (cp_parser
*parser
, bool translate
, bool wide_ok
)
3386 struct obstack str_ob
;
3387 cpp_string str
, istr
, *strs
;
3389 enum cpp_ttype type
, curr_type
;
3390 int have_suffix_p
= 0;
3392 tree suffix_id
= NULL_TREE
;
3393 bool curr_tok_is_userdef_p
= false;
3395 tok
= cp_lexer_peek_token (parser
->lexer
);
3396 if (!cp_parser_is_string_literal (tok
))
3398 cp_parser_error (parser
, "expected string-literal");
3399 return error_mark_node
;
3402 if (cpp_userdef_string_p (tok
->type
))
3404 string_tree
= USERDEF_LITERAL_VALUE (tok
->u
.value
);
3405 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3406 curr_tok_is_userdef_p
= true;
3410 string_tree
= tok
->u
.value
;
3411 curr_type
= tok
->type
;
3415 /* Try to avoid the overhead of creating and destroying an obstack
3416 for the common case of just one string. */
3417 if (!cp_parser_is_string_literal
3418 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
3420 cp_lexer_consume_token (parser
->lexer
);
3422 str
.text
= (const unsigned char *)TREE_STRING_POINTER (string_tree
);
3423 str
.len
= TREE_STRING_LENGTH (string_tree
);
3426 if (curr_tok_is_userdef_p
)
3428 suffix_id
= USERDEF_LITERAL_SUFFIX_ID (tok
->u
.value
);
3430 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3433 curr_type
= tok
->type
;
3439 gcc_obstack_init (&str_ob
);
3444 cp_lexer_consume_token (parser
->lexer
);
3446 str
.text
= (const unsigned char *)TREE_STRING_POINTER (string_tree
);
3447 str
.len
= TREE_STRING_LENGTH (string_tree
);
3449 if (curr_tok_is_userdef_p
)
3451 tree curr_suffix_id
= USERDEF_LITERAL_SUFFIX_ID (tok
->u
.value
);
3452 if (have_suffix_p
== 0)
3454 suffix_id
= curr_suffix_id
;
3457 else if (have_suffix_p
== 1
3458 && curr_suffix_id
!= suffix_id
)
3460 error ("inconsistent user-defined literal suffixes"
3461 " %qD and %qD in string literal",
3462 suffix_id
, curr_suffix_id
);
3465 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3468 curr_type
= tok
->type
;
3470 if (type
!= curr_type
)
3472 if (type
== CPP_STRING
)
3474 else if (curr_type
!= CPP_STRING
)
3475 error_at (tok
->location
,
3476 "unsupported non-standard concatenation "
3477 "of string literals");
3480 obstack_grow (&str_ob
, &str
, sizeof (cpp_string
));
3482 tok
= cp_lexer_peek_token (parser
->lexer
);
3483 if (cpp_userdef_string_p (tok
->type
))
3485 string_tree
= USERDEF_LITERAL_VALUE (tok
->u
.value
);
3486 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3487 curr_tok_is_userdef_p
= true;
3491 string_tree
= tok
->u
.value
;
3492 curr_type
= tok
->type
;
3493 curr_tok_is_userdef_p
= false;
3496 while (cp_parser_is_string_literal (tok
));
3498 strs
= (cpp_string
*) obstack_finish (&str_ob
);
3501 if (type
!= CPP_STRING
&& !wide_ok
)
3503 cp_parser_error (parser
, "a wide string is invalid in this context");
3507 if ((translate
? cpp_interpret_string
: cpp_interpret_string_notranslate
)
3508 (parse_in
, strs
, count
, &istr
, type
))
3510 value
= build_string (istr
.len
, (const char *)istr
.text
);
3511 free (CONST_CAST (unsigned char *, istr
.text
));
3517 case CPP_UTF8STRING
:
3518 TREE_TYPE (value
) = char_array_type_node
;
3521 TREE_TYPE (value
) = char16_array_type_node
;
3524 TREE_TYPE (value
) = char32_array_type_node
;
3527 TREE_TYPE (value
) = wchar_array_type_node
;
3531 value
= fix_string_type (value
);
3535 tree literal
= build_userdef_literal (suffix_id
, value
, NULL_TREE
);
3536 tok
->u
.value
= literal
;
3537 return cp_parser_userdef_string_literal (tok
);
3541 /* cpp_interpret_string has issued an error. */
3542 value
= error_mark_node
;
3545 obstack_free (&str_ob
, 0);
3550 /* Parse a user-defined char constant. Returns a call to a user-defined
3551 literal operator taking the character as an argument. */
3554 cp_parser_userdef_char_literal (cp_parser
*parser
)
3556 cp_token
*token
= NULL
;
3557 tree literal
, suffix_id
, value
;
3562 token
= cp_lexer_consume_token (parser
->lexer
);
3563 literal
= token
->u
.value
;
3564 suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
3565 value
= USERDEF_LITERAL_VALUE (literal
);
3566 name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
3568 /* Build up a call to the user-defined operator */
3569 /* Lookup the name we got back from the id-expression. */
3570 vec
= make_tree_vector ();
3571 VEC_safe_push (tree
, gc
, vec
, value
);
3572 decl
= lookup_function_nonclass (name
, vec
, /*block_p=*/false);
3573 if (!decl
|| decl
== error_mark_node
)
3575 error ("unable to find user-defined character literal operator %qD",
3577 release_tree_vector (vec
);
3578 return error_mark_node
;
3580 result
= finish_call_expr (decl
, &vec
, false, true, tf_warning_or_error
);
3581 release_tree_vector (vec
);
3586 /* A subroutine of cp_parser_userdef_numeric_literal to
3587 create a char... template parameter pack from a string node. */
3590 make_char_string_pack (tree value
)
3593 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
3594 const char *str
= TREE_STRING_POINTER (value
);
3595 int i
, len
= TREE_STRING_LENGTH (value
) - 1;
3596 tree argvec
= make_tree_vec (1);
3598 /* Fill in CHARVEC with all of the parameters. */
3599 charvec
= make_tree_vec (len
);
3600 for (i
= 0; i
< len
; ++i
)
3601 TREE_VEC_ELT (charvec
, i
) = build_int_cst (char_type_node
, str
[i
]);
3603 /* Build the argument packs. */
3604 SET_ARGUMENT_PACK_ARGS (argpack
, charvec
);
3605 TREE_TYPE (argpack
) = char_type_node
;
3607 TREE_VEC_ELT (argvec
, 0) = argpack
;
3612 /* Parse a user-defined numeric constant. returns a call to a user-defined
3613 literal operator. */
3616 cp_parser_userdef_numeric_literal (cp_parser
*parser
)
3618 cp_token
*token
= NULL
;
3619 tree literal
, suffix_id
, value
, num_string
;
3621 tree result
= error_mark_node
;
3624 token
= cp_lexer_consume_token (parser
->lexer
);
3625 literal
= token
->u
.value
;
3626 suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
3627 value
= USERDEF_LITERAL_VALUE (literal
);
3628 num_string
= USERDEF_LITERAL_NUM_STRING (literal
);
3629 name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
3631 /* Build up a call to the user-defined operator */
3632 /* Lookup the name we got back from the id-expression. */
3633 /* Try to find the literal operator by finishing the call expression
3634 with the numeric argument. */
3635 args
= make_tree_vector ();
3636 VEC_safe_push (tree
, gc
, args
, value
);
3637 decl
= lookup_function_nonclass (name
, args
, /*block_p=*/false);
3638 if (decl
&& decl
!= error_mark_node
)
3640 result
= finish_call_expr (decl
, &args
, false, true, tf_none
);
3641 if (result
!= error_mark_node
)
3643 release_tree_vector (args
);
3647 release_tree_vector (args
);
3649 /* If the numeric argument didn't work, look for a raw literal
3650 operator taking a const char* argument consisting of the number
3651 in string format. */
3652 args
= make_tree_vector ();
3653 VEC_safe_push (tree
, gc
, args
, num_string
);
3654 decl
= lookup_function_nonclass (name
, args
, /*block_p=*/false);
3655 if (decl
&& decl
!= error_mark_node
)
3657 result
= finish_call_expr (decl
, &args
, false, true, tf_none
);
3658 if (result
!= error_mark_node
)
3660 release_tree_vector (args
);
3664 release_tree_vector (args
);
3666 /* If the raw literal didn't work, look for a non-type template
3667 function with parameter pack char.... Call the function with
3668 template parameter characters representing the number. */
3669 args
= make_tree_vector ();
3670 decl
= lookup_function_nonclass (name
, args
, /*block_p=*/false);
3671 if (decl
&& decl
!= error_mark_node
)
3673 tree tmpl_args
= make_char_string_pack (num_string
);
3674 decl
= lookup_template_function (decl
, tmpl_args
);
3675 result
= finish_call_expr (decl
, &args
, false, true, tf_none
);
3676 if (result
!= error_mark_node
)
3678 release_tree_vector (args
);
3682 release_tree_vector (args
);
3684 if (result
== error_mark_node
)
3685 error ("unable to find user-defined numeric literal operator %qD", name
);
3690 /* Parse a user-defined string constant. Returns a call to a user-defined
3691 literal operator taking a character pointer and the length of the string
3695 cp_parser_userdef_string_literal (cp_token
*token
)
3697 tree literal
, suffix_id
, value
;
3703 literal
= token
->u
.value
;
3704 suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
3705 name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
3706 value
= USERDEF_LITERAL_VALUE (literal
);
3707 len
= TREE_STRING_LENGTH (value
)
3708 / TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (value
)))) - 1;
3709 /* Build up a call to the user-defined operator */
3710 /* Lookup the name we got back from the id-expression. */
3711 vec
= make_tree_vector ();
3712 VEC_safe_push (tree
, gc
, vec
, value
);
3713 VEC_safe_push (tree
, gc
, vec
, build_int_cst (size_type_node
, len
));
3714 decl
= lookup_function_nonclass (name
, vec
, /*block_p=*/false);
3715 if (!decl
|| decl
== error_mark_node
)
3717 error ("unable to find user-defined string literal operator %qD", name
);
3718 release_tree_vector (vec
);
3719 return error_mark_node
;
3721 result
= finish_call_expr (decl
, &vec
, false, true, tf_none
);
3722 if (result
== error_mark_node
)
3723 error ("unable to find valid user-defined string literal operator %qD."
3724 " Possible missing length argument in string literal operator.",
3726 release_tree_vector (vec
);
3732 /* Basic concepts [gram.basic] */
3734 /* Parse a translation-unit.
3737 declaration-seq [opt]
3739 Returns TRUE if all went well. */
3742 cp_parser_translation_unit (cp_parser
* parser
)
3744 /* The address of the first non-permanent object on the declarator
3746 static void *declarator_obstack_base
;
3750 /* Create the declarator obstack, if necessary. */
3751 if (!cp_error_declarator
)
3753 gcc_obstack_init (&declarator_obstack
);
3754 /* Create the error declarator. */
3755 cp_error_declarator
= make_declarator (cdk_error
);
3756 /* Create the empty parameter list. */
3757 no_parameters
= make_parameter_declarator (NULL
, NULL
, NULL_TREE
);
3758 /* Remember where the base of the declarator obstack lies. */
3759 declarator_obstack_base
= obstack_next_free (&declarator_obstack
);
3762 cp_parser_declaration_seq_opt (parser
);
3764 /* If there are no tokens left then all went well. */
3765 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
3767 /* Get rid of the token array; we don't need it any more. */
3768 cp_lexer_destroy (parser
->lexer
);
3769 parser
->lexer
= NULL
;
3771 /* This file might have been a context that's implicitly extern
3772 "C". If so, pop the lang context. (Only relevant for PCH.) */
3773 if (parser
->implicit_extern_c
)
3775 pop_lang_context ();
3776 parser
->implicit_extern_c
= false;
3780 finish_translation_unit ();
3786 cp_parser_error (parser
, "expected declaration");
3790 /* Make sure the declarator obstack was fully cleaned up. */
3791 gcc_assert (obstack_next_free (&declarator_obstack
)
3792 == declarator_obstack_base
);
3794 /* All went well. */
3798 /* Expressions [gram.expr] */
3800 /* Parse a primary-expression.
3811 ( compound-statement )
3812 __builtin_va_arg ( assignment-expression , type-id )
3813 __builtin_offsetof ( type-id , offsetof-expression )
3816 __has_nothrow_assign ( type-id )
3817 __has_nothrow_constructor ( type-id )
3818 __has_nothrow_copy ( type-id )
3819 __has_trivial_assign ( type-id )
3820 __has_trivial_constructor ( type-id )
3821 __has_trivial_copy ( type-id )
3822 __has_trivial_destructor ( type-id )
3823 __has_virtual_destructor ( type-id )
3824 __is_abstract ( type-id )
3825 __is_base_of ( type-id , type-id )
3826 __is_class ( type-id )
3827 __is_convertible_to ( type-id , type-id )
3828 __is_empty ( type-id )
3829 __is_enum ( type-id )
3830 __is_literal_type ( type-id )
3831 __is_pod ( type-id )
3832 __is_polymorphic ( type-id )
3833 __is_std_layout ( type-id )
3834 __is_trivial ( type-id )
3835 __is_union ( type-id )
3837 Objective-C++ Extension:
3845 ADDRESS_P is true iff this expression was immediately preceded by
3846 "&" and therefore might denote a pointer-to-member. CAST_P is true
3847 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3848 true iff this expression is a template argument.
3850 Returns a representation of the expression. Upon return, *IDK
3851 indicates what kind of id-expression (if any) was present. */
3854 cp_parser_primary_expression (cp_parser
*parser
,
3857 bool template_arg_p
,
3860 cp_token
*token
= NULL
;
3862 /* Assume the primary expression is not an id-expression. */
3863 *idk
= CP_ID_KIND_NONE
;
3865 /* Peek at the next token. */
3866 token
= cp_lexer_peek_token (parser
->lexer
);
3867 switch (token
->type
)
3876 user-defined-literal */
3882 if (TREE_CODE (token
->u
.value
) == USERDEF_LITERAL
)
3883 return cp_parser_userdef_numeric_literal (parser
);
3884 token
= cp_lexer_consume_token (parser
->lexer
);
3885 if (TREE_CODE (token
->u
.value
) == FIXED_CST
)
3887 error_at (token
->location
,
3888 "fixed-point types not supported in C++");
3889 return error_mark_node
;
3891 /* Floating-point literals are only allowed in an integral
3892 constant expression if they are cast to an integral or
3893 enumeration type. */
3894 if (TREE_CODE (token
->u
.value
) == REAL_CST
3895 && parser
->integral_constant_expression_p
3898 /* CAST_P will be set even in invalid code like "int(2.7 +
3899 ...)". Therefore, we have to check that the next token
3900 is sure to end the cast. */
3903 cp_token
*next_token
;
3905 next_token
= cp_lexer_peek_token (parser
->lexer
);
3906 if (/* The comma at the end of an
3907 enumerator-definition. */
3908 next_token
->type
!= CPP_COMMA
3909 /* The curly brace at the end of an enum-specifier. */
3910 && next_token
->type
!= CPP_CLOSE_BRACE
3911 /* The end of a statement. */
3912 && next_token
->type
!= CPP_SEMICOLON
3913 /* The end of the cast-expression. */
3914 && next_token
->type
!= CPP_CLOSE_PAREN
3915 /* The end of an array bound. */
3916 && next_token
->type
!= CPP_CLOSE_SQUARE
3917 /* The closing ">" in a template-argument-list. */
3918 && (next_token
->type
!= CPP_GREATER
3919 || parser
->greater_than_is_operator_p
)
3920 /* C++0x only: A ">>" treated like two ">" tokens,
3921 in a template-argument-list. */
3922 && (next_token
->type
!= CPP_RSHIFT
3923 || (cxx_dialect
== cxx98
)
3924 || parser
->greater_than_is_operator_p
))
3928 /* If we are within a cast, then the constraint that the
3929 cast is to an integral or enumeration type will be
3930 checked at that point. If we are not within a cast, then
3931 this code is invalid. */
3933 cp_parser_non_integral_constant_expression (parser
, NIC_FLOAT
);
3935 return token
->u
.value
;
3937 case CPP_CHAR_USERDEF
:
3938 case CPP_CHAR16_USERDEF
:
3939 case CPP_CHAR32_USERDEF
:
3940 case CPP_WCHAR_USERDEF
:
3941 return cp_parser_userdef_char_literal (parser
);
3947 case CPP_UTF8STRING
:
3948 case CPP_STRING_USERDEF
:
3949 case CPP_STRING16_USERDEF
:
3950 case CPP_STRING32_USERDEF
:
3951 case CPP_WSTRING_USERDEF
:
3952 case CPP_UTF8STRING_USERDEF
:
3953 /* ??? Should wide strings be allowed when parser->translate_strings_p
3954 is false (i.e. in attributes)? If not, we can kill the third
3955 argument to cp_parser_string_literal. */
3956 return cp_parser_string_literal (parser
,
3957 parser
->translate_strings_p
,
3960 case CPP_OPEN_PAREN
:
3963 bool saved_greater_than_is_operator_p
;
3965 /* Consume the `('. */
3966 cp_lexer_consume_token (parser
->lexer
);
3967 /* Within a parenthesized expression, a `>' token is always
3968 the greater-than operator. */
3969 saved_greater_than_is_operator_p
3970 = parser
->greater_than_is_operator_p
;
3971 parser
->greater_than_is_operator_p
= true;
3972 /* If we see `( { ' then we are looking at the beginning of
3973 a GNU statement-expression. */
3974 if (cp_parser_allow_gnu_extensions_p (parser
)
3975 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
3977 /* Statement-expressions are not allowed by the standard. */
3978 pedwarn (token
->location
, OPT_pedantic
,
3979 "ISO C++ forbids braced-groups within expressions");
3981 /* And they're not allowed outside of a function-body; you
3982 cannot, for example, write:
3984 int i = ({ int j = 3; j + 1; });
3986 at class or namespace scope. */
3987 if (!parser
->in_function_body
3988 || parser
->in_template_argument_list_p
)
3990 error_at (token
->location
,
3991 "statement-expressions are not allowed outside "
3992 "functions nor in template-argument lists");
3993 cp_parser_skip_to_end_of_block_or_statement (parser
);
3994 expr
= error_mark_node
;
3998 /* Start the statement-expression. */
3999 expr
= begin_stmt_expr ();
4000 /* Parse the compound-statement. */
4001 cp_parser_compound_statement (parser
, expr
, false, false);
4003 expr
= finish_stmt_expr (expr
, false);
4008 /* Parse the parenthesized expression. */
4009 expr
= cp_parser_expression (parser
, cast_p
, idk
);
4010 /* Let the front end know that this expression was
4011 enclosed in parentheses. This matters in case, for
4012 example, the expression is of the form `A::B', since
4013 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4015 finish_parenthesized_expr (expr
);
4016 /* DR 705: Wrapping an unqualified name in parentheses
4017 suppresses arg-dependent lookup. We want to pass back
4018 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4019 (c++/37862), but none of the others. */
4020 if (*idk
!= CP_ID_KIND_QUALIFIED
)
4021 *idk
= CP_ID_KIND_NONE
;
4023 /* The `>' token might be the end of a template-id or
4024 template-parameter-list now. */
4025 parser
->greater_than_is_operator_p
4026 = saved_greater_than_is_operator_p
;
4027 /* Consume the `)'. */
4028 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
4029 cp_parser_skip_to_end_of_statement (parser
);
4034 case CPP_OPEN_SQUARE
:
4035 if (c_dialect_objc ())
4036 /* We have an Objective-C++ message. */
4037 return cp_parser_objc_expression (parser
);
4039 tree lam
= cp_parser_lambda_expression (parser
);
4040 /* Don't warn about a failed tentative parse. */
4041 if (cp_parser_error_occurred (parser
))
4042 return error_mark_node
;
4043 maybe_warn_cpp0x (CPP0X_LAMBDA_EXPR
);
4047 case CPP_OBJC_STRING
:
4048 if (c_dialect_objc ())
4049 /* We have an Objective-C++ string literal. */
4050 return cp_parser_objc_expression (parser
);
4051 cp_parser_error (parser
, "expected primary-expression");
4052 return error_mark_node
;
4055 switch (token
->keyword
)
4057 /* These two are the boolean literals. */
4059 cp_lexer_consume_token (parser
->lexer
);
4060 return boolean_true_node
;
4062 cp_lexer_consume_token (parser
->lexer
);
4063 return boolean_false_node
;
4065 /* The `__null' literal. */
4067 cp_lexer_consume_token (parser
->lexer
);
4070 /* The `nullptr' literal. */
4072 cp_lexer_consume_token (parser
->lexer
);
4073 return nullptr_node
;
4075 /* Recognize the `this' keyword. */
4077 cp_lexer_consume_token (parser
->lexer
);
4078 if (parser
->local_variables_forbidden_p
)
4080 error_at (token
->location
,
4081 "%<this%> may not be used in this context");
4082 return error_mark_node
;
4084 /* Pointers cannot appear in constant-expressions. */
4085 if (cp_parser_non_integral_constant_expression (parser
, NIC_THIS
))
4086 return error_mark_node
;
4087 return finish_this_expr ();
4089 /* The `operator' keyword can be the beginning of an
4094 case RID_FUNCTION_NAME
:
4095 case RID_PRETTY_FUNCTION_NAME
:
4096 case RID_C99_FUNCTION_NAME
:
4098 non_integral_constant name
;
4100 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4101 __func__ are the names of variables -- but they are
4102 treated specially. Therefore, they are handled here,
4103 rather than relying on the generic id-expression logic
4104 below. Grammatically, these names are id-expressions.
4106 Consume the token. */
4107 token
= cp_lexer_consume_token (parser
->lexer
);
4109 switch (token
->keyword
)
4111 case RID_FUNCTION_NAME
:
4112 name
= NIC_FUNC_NAME
;
4114 case RID_PRETTY_FUNCTION_NAME
:
4115 name
= NIC_PRETTY_FUNC
;
4117 case RID_C99_FUNCTION_NAME
:
4118 name
= NIC_C99_FUNC
;
4124 if (cp_parser_non_integral_constant_expression (parser
, name
))
4125 return error_mark_node
;
4127 /* Look up the name. */
4128 return finish_fname (token
->u
.value
);
4136 /* The `__builtin_va_arg' construct is used to handle
4137 `va_arg'. Consume the `__builtin_va_arg' token. */
4138 cp_lexer_consume_token (parser
->lexer
);
4139 /* Look for the opening `('. */
4140 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
4141 /* Now, parse the assignment-expression. */
4142 expression
= cp_parser_assignment_expression (parser
,
4143 /*cast_p=*/false, NULL
);
4144 /* Look for the `,'. */
4145 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
4146 /* Parse the type-id. */
4147 type
= cp_parser_type_id (parser
);
4148 /* Look for the closing `)'. */
4149 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
4150 /* Using `va_arg' in a constant-expression is not
4152 if (cp_parser_non_integral_constant_expression (parser
,
4154 return error_mark_node
;
4155 return build_x_va_arg (expression
, type
);
4159 return cp_parser_builtin_offsetof (parser
);
4161 case RID_HAS_NOTHROW_ASSIGN
:
4162 case RID_HAS_NOTHROW_CONSTRUCTOR
:
4163 case RID_HAS_NOTHROW_COPY
:
4164 case RID_HAS_TRIVIAL_ASSIGN
:
4165 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
4166 case RID_HAS_TRIVIAL_COPY
:
4167 case RID_HAS_TRIVIAL_DESTRUCTOR
:
4168 case RID_HAS_VIRTUAL_DESTRUCTOR
:
4169 case RID_IS_ABSTRACT
:
4170 case RID_IS_BASE_OF
:
4172 case RID_IS_CONVERTIBLE_TO
:
4175 case RID_IS_LITERAL_TYPE
:
4177 case RID_IS_POLYMORPHIC
:
4178 case RID_IS_STD_LAYOUT
:
4179 case RID_IS_TRIVIAL
:
4181 return cp_parser_trait_expr (parser
, token
->keyword
);
4183 /* Objective-C++ expressions. */
4185 case RID_AT_PROTOCOL
:
4186 case RID_AT_SELECTOR
:
4187 return cp_parser_objc_expression (parser
);
4190 if (parser
->in_function_body
4191 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
4194 error_at (token
->location
,
4195 "a template declaration cannot appear at block scope");
4196 cp_parser_skip_to_end_of_block_or_statement (parser
);
4197 return error_mark_node
;
4200 cp_parser_error (parser
, "expected primary-expression");
4201 return error_mark_node
;
4204 /* An id-expression can start with either an identifier, a
4205 `::' as the beginning of a qualified-id, or the "operator"
4209 case CPP_TEMPLATE_ID
:
4210 case CPP_NESTED_NAME_SPECIFIER
:
4214 const char *error_msg
;
4217 cp_token
*id_expr_token
;
4220 /* Parse the id-expression. */
4222 = cp_parser_id_expression (parser
,
4223 /*template_keyword_p=*/false,
4224 /*check_dependency_p=*/true,
4226 /*declarator_p=*/false,
4227 /*optional_p=*/false);
4228 if (id_expression
== error_mark_node
)
4229 return error_mark_node
;
4230 id_expr_token
= token
;
4231 token
= cp_lexer_peek_token (parser
->lexer
);
4232 done
= (token
->type
!= CPP_OPEN_SQUARE
4233 && token
->type
!= CPP_OPEN_PAREN
4234 && token
->type
!= CPP_DOT
4235 && token
->type
!= CPP_DEREF
4236 && token
->type
!= CPP_PLUS_PLUS
4237 && token
->type
!= CPP_MINUS_MINUS
);
4238 /* If we have a template-id, then no further lookup is
4239 required. If the template-id was for a template-class, we
4240 will sometimes have a TYPE_DECL at this point. */
4241 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
4242 || TREE_CODE (id_expression
) == TYPE_DECL
)
4243 decl
= id_expression
;
4244 /* Look up the name. */
4247 tree ambiguous_decls
;
4249 /* If we already know that this lookup is ambiguous, then
4250 we've already issued an error message; there's no reason
4252 if (id_expr_token
->type
== CPP_NAME
4253 && id_expr_token
->ambiguous_p
)
4255 cp_parser_simulate_error (parser
);
4256 return error_mark_node
;
4259 decl
= cp_parser_lookup_name (parser
, id_expression
,
4262 /*is_namespace=*/false,
4263 /*check_dependency=*/true,
4265 id_expr_token
->location
);
4266 /* If the lookup was ambiguous, an error will already have
4268 if (ambiguous_decls
)
4269 return error_mark_node
;
4271 /* In Objective-C++, we may have an Objective-C 2.0
4272 dot-syntax for classes here. */
4273 if (c_dialect_objc ()
4274 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
4275 && TREE_CODE (decl
) == TYPE_DECL
4276 && objc_is_class_name (decl
))
4279 cp_lexer_consume_token (parser
->lexer
);
4280 component
= cp_parser_identifier (parser
);
4281 if (component
== error_mark_node
)
4282 return error_mark_node
;
4284 return objc_build_class_component_ref (id_expression
, component
);
4287 /* In Objective-C++, an instance variable (ivar) may be preferred
4288 to whatever cp_parser_lookup_name() found. */
4289 decl
= objc_lookup_ivar (decl
, id_expression
);
4291 /* If name lookup gives us a SCOPE_REF, then the
4292 qualifying scope was dependent. */
4293 if (TREE_CODE (decl
) == SCOPE_REF
)
4295 /* At this point, we do not know if DECL is a valid
4296 integral constant expression. We assume that it is
4297 in fact such an expression, so that code like:
4299 template <int N> struct A {
4303 is accepted. At template-instantiation time, we
4304 will check that B<N>::i is actually a constant. */
4307 /* Check to see if DECL is a local variable in a context
4308 where that is forbidden. */
4309 if (parser
->local_variables_forbidden_p
4310 && local_variable_p (decl
))
4312 /* It might be that we only found DECL because we are
4313 trying to be generous with pre-ISO scoping rules.
4314 For example, consider:
4318 for (int i = 0; i < 10; ++i) {}
4319 extern void f(int j = i);
4322 Here, name look up will originally find the out
4323 of scope `i'. We need to issue a warning message,
4324 but then use the global `i'. */
4325 decl
= check_for_out_of_scope_variable (decl
);
4326 if (local_variable_p (decl
))
4328 error_at (id_expr_token
->location
,
4329 "local variable %qD may not appear in this context",
4331 return error_mark_node
;
4336 decl
= (finish_id_expression
4337 (id_expression
, decl
, parser
->scope
,
4339 parser
->integral_constant_expression_p
,
4340 parser
->allow_non_integral_constant_expression_p
,
4341 &parser
->non_integral_constant_expression_p
,
4342 template_p
, done
, address_p
,
4345 id_expr_token
->location
));
4347 cp_parser_error (parser
, error_msg
);
4351 /* Anything else is an error. */
4353 cp_parser_error (parser
, "expected primary-expression");
4354 return error_mark_node
;
4358 /* Parse an id-expression.
4365 :: [opt] nested-name-specifier template [opt] unqualified-id
4367 :: operator-function-id
4370 Return a representation of the unqualified portion of the
4371 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4372 a `::' or nested-name-specifier.
4374 Often, if the id-expression was a qualified-id, the caller will
4375 want to make a SCOPE_REF to represent the qualified-id. This
4376 function does not do this in order to avoid wastefully creating
4377 SCOPE_REFs when they are not required.
4379 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4382 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4383 uninstantiated templates.
4385 If *TEMPLATE_P is non-NULL, it is set to true iff the
4386 `template' keyword is used to explicitly indicate that the entity
4387 named is a template.
4389 If DECLARATOR_P is true, the id-expression is appearing as part of
4390 a declarator, rather than as part of an expression. */
4393 cp_parser_id_expression (cp_parser
*parser
,
4394 bool template_keyword_p
,
4395 bool check_dependency_p
,
4400 bool global_scope_p
;
4401 bool nested_name_specifier_p
;
4403 /* Assume the `template' keyword was not used. */
4405 *template_p
= template_keyword_p
;
4407 /* Look for the optional `::' operator. */
4409 = (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false)
4411 /* Look for the optional nested-name-specifier. */
4412 nested_name_specifier_p
4413 = (cp_parser_nested_name_specifier_opt (parser
,
4414 /*typename_keyword_p=*/false,
4419 /* If there is a nested-name-specifier, then we are looking at
4420 the first qualified-id production. */
4421 if (nested_name_specifier_p
)
4424 tree saved_object_scope
;
4425 tree saved_qualifying_scope
;
4426 tree unqualified_id
;
4429 /* See if the next token is the `template' keyword. */
4431 template_p
= &is_template
;
4432 *template_p
= cp_parser_optional_template_keyword (parser
);
4433 /* Name lookup we do during the processing of the
4434 unqualified-id might obliterate SCOPE. */
4435 saved_scope
= parser
->scope
;
4436 saved_object_scope
= parser
->object_scope
;
4437 saved_qualifying_scope
= parser
->qualifying_scope
;
4438 /* Process the final unqualified-id. */
4439 unqualified_id
= cp_parser_unqualified_id (parser
, *template_p
,
4442 /*optional_p=*/false);
4443 /* Restore the SAVED_SCOPE for our caller. */
4444 parser
->scope
= saved_scope
;
4445 parser
->object_scope
= saved_object_scope
;
4446 parser
->qualifying_scope
= saved_qualifying_scope
;
4448 return unqualified_id
;
4450 /* Otherwise, if we are in global scope, then we are looking at one
4451 of the other qualified-id productions. */
4452 else if (global_scope_p
)
4457 /* Peek at the next token. */
4458 token
= cp_lexer_peek_token (parser
->lexer
);
4460 /* If it's an identifier, and the next token is not a "<", then
4461 we can avoid the template-id case. This is an optimization
4462 for this common case. */
4463 if (token
->type
== CPP_NAME
4464 && !cp_parser_nth_token_starts_template_argument_list_p
4466 return cp_parser_identifier (parser
);
4468 cp_parser_parse_tentatively (parser
);
4469 /* Try a template-id. */
4470 id
= cp_parser_template_id (parser
,
4471 /*template_keyword_p=*/false,
4472 /*check_dependency_p=*/true,
4474 /* If that worked, we're done. */
4475 if (cp_parser_parse_definitely (parser
))
4478 /* Peek at the next token. (Changes in the token buffer may
4479 have invalidated the pointer obtained above.) */
4480 token
= cp_lexer_peek_token (parser
->lexer
);
4482 switch (token
->type
)
4485 return cp_parser_identifier (parser
);
4488 if (token
->keyword
== RID_OPERATOR
)
4489 return cp_parser_operator_function_id (parser
);
4493 cp_parser_error (parser
, "expected id-expression");
4494 return error_mark_node
;
4498 return cp_parser_unqualified_id (parser
, template_keyword_p
,
4499 /*check_dependency_p=*/true,
4504 /* Parse an unqualified-id.
4508 operator-function-id
4509 conversion-function-id
4513 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4514 keyword, in a construct like `A::template ...'.
4516 Returns a representation of unqualified-id. For the `identifier'
4517 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4518 production a BIT_NOT_EXPR is returned; the operand of the
4519 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4520 other productions, see the documentation accompanying the
4521 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4522 names are looked up in uninstantiated templates. If DECLARATOR_P
4523 is true, the unqualified-id is appearing as part of a declarator,
4524 rather than as part of an expression. */
4527 cp_parser_unqualified_id (cp_parser
* parser
,
4528 bool template_keyword_p
,
4529 bool check_dependency_p
,
4535 /* Peek at the next token. */
4536 token
= cp_lexer_peek_token (parser
->lexer
);
4538 switch (token
->type
)
4544 /* We don't know yet whether or not this will be a
4546 cp_parser_parse_tentatively (parser
);
4547 /* Try a template-id. */
4548 id
= cp_parser_template_id (parser
, template_keyword_p
,
4551 /* If it worked, we're done. */
4552 if (cp_parser_parse_definitely (parser
))
4554 /* Otherwise, it's an ordinary identifier. */
4555 return cp_parser_identifier (parser
);
4558 case CPP_TEMPLATE_ID
:
4559 return cp_parser_template_id (parser
, template_keyword_p
,
4566 tree qualifying_scope
;
4571 /* Consume the `~' token. */
4572 cp_lexer_consume_token (parser
->lexer
);
4573 /* Parse the class-name. The standard, as written, seems to
4576 template <typename T> struct S { ~S (); };
4577 template <typename T> S<T>::~S() {}
4579 is invalid, since `~' must be followed by a class-name, but
4580 `S<T>' is dependent, and so not known to be a class.
4581 That's not right; we need to look in uninstantiated
4582 templates. A further complication arises from:
4584 template <typename T> void f(T t) {
4588 Here, it is not possible to look up `T' in the scope of `T'
4589 itself. We must look in both the current scope, and the
4590 scope of the containing complete expression.
4592 Yet another issue is:
4601 The standard does not seem to say that the `S' in `~S'
4602 should refer to the type `S' and not the data member
4605 /* DR 244 says that we look up the name after the "~" in the
4606 same scope as we looked up the qualifying name. That idea
4607 isn't fully worked out; it's more complicated than that. */
4608 scope
= parser
->scope
;
4609 object_scope
= parser
->object_scope
;
4610 qualifying_scope
= parser
->qualifying_scope
;
4612 /* Check for invalid scopes. */
4613 if (scope
== error_mark_node
)
4615 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
4616 cp_lexer_consume_token (parser
->lexer
);
4617 return error_mark_node
;
4619 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
4621 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
4622 error_at (token
->location
,
4623 "scope %qT before %<~%> is not a class-name",
4625 cp_parser_simulate_error (parser
);
4626 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
4627 cp_lexer_consume_token (parser
->lexer
);
4628 return error_mark_node
;
4630 gcc_assert (!scope
|| TYPE_P (scope
));
4632 /* If the name is of the form "X::~X" it's OK even if X is a
4634 token
= cp_lexer_peek_token (parser
->lexer
);
4636 && token
->type
== CPP_NAME
4637 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
4639 && (token
->u
.value
== TYPE_IDENTIFIER (scope
)
4640 || (CLASS_TYPE_P (scope
)
4641 && constructor_name_p (token
->u
.value
, scope
))))
4643 cp_lexer_consume_token (parser
->lexer
);
4644 return build_nt (BIT_NOT_EXPR
, scope
);
4647 /* If there was an explicit qualification (S::~T), first look
4648 in the scope given by the qualification (i.e., S).
4650 Note: in the calls to cp_parser_class_name below we pass
4651 typename_type so that lookup finds the injected-class-name
4652 rather than the constructor. */
4654 type_decl
= NULL_TREE
;
4657 cp_parser_parse_tentatively (parser
);
4658 type_decl
= cp_parser_class_name (parser
,
4659 /*typename_keyword_p=*/false,
4660 /*template_keyword_p=*/false,
4662 /*check_dependency=*/false,
4663 /*class_head_p=*/false,
4665 if (cp_parser_parse_definitely (parser
))
4668 /* In "N::S::~S", look in "N" as well. */
4669 if (!done
&& scope
&& qualifying_scope
)
4671 cp_parser_parse_tentatively (parser
);
4672 parser
->scope
= qualifying_scope
;
4673 parser
->object_scope
= NULL_TREE
;
4674 parser
->qualifying_scope
= NULL_TREE
;
4676 = cp_parser_class_name (parser
,
4677 /*typename_keyword_p=*/false,
4678 /*template_keyword_p=*/false,
4680 /*check_dependency=*/false,
4681 /*class_head_p=*/false,
4683 if (cp_parser_parse_definitely (parser
))
4686 /* In "p->S::~T", look in the scope given by "*p" as well. */
4687 else if (!done
&& object_scope
)
4689 cp_parser_parse_tentatively (parser
);
4690 parser
->scope
= object_scope
;
4691 parser
->object_scope
= NULL_TREE
;
4692 parser
->qualifying_scope
= NULL_TREE
;
4694 = cp_parser_class_name (parser
,
4695 /*typename_keyword_p=*/false,
4696 /*template_keyword_p=*/false,
4698 /*check_dependency=*/false,
4699 /*class_head_p=*/false,
4701 if (cp_parser_parse_definitely (parser
))
4704 /* Look in the surrounding context. */
4707 parser
->scope
= NULL_TREE
;
4708 parser
->object_scope
= NULL_TREE
;
4709 parser
->qualifying_scope
= NULL_TREE
;
4710 if (processing_template_decl
)
4711 cp_parser_parse_tentatively (parser
);
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 (processing_template_decl
4721 && ! cp_parser_parse_definitely (parser
))
4723 /* We couldn't find a type with this name, so just accept
4724 it and check for a match at instantiation time. */
4725 type_decl
= cp_parser_identifier (parser
);
4726 if (type_decl
!= error_mark_node
)
4727 type_decl
= build_nt (BIT_NOT_EXPR
, type_decl
);
4731 /* If an error occurred, assume that the name of the
4732 destructor is the same as the name of the qualifying
4733 class. That allows us to keep parsing after running
4734 into ill-formed destructor names. */
4735 if (type_decl
== error_mark_node
&& scope
)
4736 return build_nt (BIT_NOT_EXPR
, scope
);
4737 else if (type_decl
== error_mark_node
)
4738 return error_mark_node
;
4740 /* Check that destructor name and scope match. */
4741 if (declarator_p
&& scope
&& !check_dtor_name (scope
, type_decl
))
4743 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
4744 error_at (token
->location
,
4745 "declaration of %<~%T%> as member of %qT",
4747 cp_parser_simulate_error (parser
);
4748 return error_mark_node
;
4753 A typedef-name that names a class shall not be used as the
4754 identifier in the declarator for a destructor declaration. */
4756 && !DECL_IMPLICIT_TYPEDEF_P (type_decl
)
4757 && !DECL_SELF_REFERENCE_P (type_decl
)
4758 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
4759 error_at (token
->location
,
4760 "typedef-name %qD used as destructor declarator",
4763 return build_nt (BIT_NOT_EXPR
, TREE_TYPE (type_decl
));
4767 if (token
->keyword
== RID_OPERATOR
)
4771 /* This could be a template-id, so we try that first. */
4772 cp_parser_parse_tentatively (parser
);
4773 /* Try a template-id. */
4774 id
= cp_parser_template_id (parser
, template_keyword_p
,
4775 /*check_dependency_p=*/true,
4777 /* If that worked, we're done. */
4778 if (cp_parser_parse_definitely (parser
))
4780 /* We still don't know whether we're looking at an
4781 operator-function-id or a conversion-function-id. */
4782 cp_parser_parse_tentatively (parser
);
4783 /* Try an operator-function-id. */
4784 id
= cp_parser_operator_function_id (parser
);
4785 /* If that didn't work, try a conversion-function-id. */
4786 if (!cp_parser_parse_definitely (parser
))
4787 id
= cp_parser_conversion_function_id (parser
);
4788 else if (UDLIT_OPER_P (id
))
4791 const char *name
= UDLIT_OP_SUFFIX (id
);
4792 if (name
[0] != '_' && !in_system_header
)
4793 warning (0, "literal operator suffixes not preceded by %<_%>"
4794 " are reserved for future standardization");
4804 cp_parser_error (parser
, "expected unqualified-id");
4805 return error_mark_node
;
4809 /* Parse an (optional) nested-name-specifier.
4811 nested-name-specifier: [C++98]
4812 class-or-namespace-name :: nested-name-specifier [opt]
4813 class-or-namespace-name :: template nested-name-specifier [opt]
4815 nested-name-specifier: [C++0x]
4818 nested-name-specifier identifier ::
4819 nested-name-specifier template [opt] simple-template-id ::
4821 PARSER->SCOPE should be set appropriately before this function is
4822 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4823 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4826 Sets PARSER->SCOPE to the class (TYPE) or namespace
4827 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4828 it unchanged if there is no nested-name-specifier. Returns the new
4829 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4831 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4832 part of a declaration and/or decl-specifier. */
4835 cp_parser_nested_name_specifier_opt (cp_parser
*parser
,
4836 bool typename_keyword_p
,
4837 bool check_dependency_p
,
4839 bool is_declaration
)
4841 bool success
= false;
4842 cp_token_position start
= 0;
4845 /* Remember where the nested-name-specifier starts. */
4846 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
4848 start
= cp_lexer_token_position (parser
->lexer
, false);
4849 push_deferring_access_checks (dk_deferred
);
4856 tree saved_qualifying_scope
;
4857 bool template_keyword_p
;
4859 /* Spot cases that cannot be the beginning of a
4860 nested-name-specifier. */
4861 token
= cp_lexer_peek_token (parser
->lexer
);
4863 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4864 the already parsed nested-name-specifier. */
4865 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
4867 /* Grab the nested-name-specifier and continue the loop. */
4868 cp_parser_pre_parsed_nested_name_specifier (parser
);
4869 /* If we originally encountered this nested-name-specifier
4870 with IS_DECLARATION set to false, we will not have
4871 resolved TYPENAME_TYPEs, so we must do so here. */
4873 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
4875 new_scope
= resolve_typename_type (parser
->scope
,
4876 /*only_current_p=*/false);
4877 if (TREE_CODE (new_scope
) != TYPENAME_TYPE
)
4878 parser
->scope
= new_scope
;
4884 /* Spot cases that cannot be the beginning of a
4885 nested-name-specifier. On the second and subsequent times
4886 through the loop, we look for the `template' keyword. */
4887 if (success
&& token
->keyword
== RID_TEMPLATE
)
4889 /* A template-id can start a nested-name-specifier. */
4890 else if (token
->type
== CPP_TEMPLATE_ID
)
4892 /* DR 743: decltype can be used in a nested-name-specifier. */
4893 else if (token_is_decltype (token
))
4897 /* If the next token is not an identifier, then it is
4898 definitely not a type-name or namespace-name. */
4899 if (token
->type
!= CPP_NAME
)
4901 /* If the following token is neither a `<' (to begin a
4902 template-id), nor a `::', then we are not looking at a
4903 nested-name-specifier. */
4904 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
4906 if (token
->type
== CPP_COLON
4907 && parser
->colon_corrects_to_scope_p
4908 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_NAME
)
4910 error_at (token
->location
,
4911 "found %<:%> in nested-name-specifier, expected %<::%>");
4912 token
->type
= CPP_SCOPE
;
4915 if (token
->type
!= CPP_SCOPE
4916 && !cp_parser_nth_token_starts_template_argument_list_p
4921 /* The nested-name-specifier is optional, so we parse
4923 cp_parser_parse_tentatively (parser
);
4925 /* Look for the optional `template' keyword, if this isn't the
4926 first time through the loop. */
4928 template_keyword_p
= cp_parser_optional_template_keyword (parser
);
4930 template_keyword_p
= false;
4932 /* Save the old scope since the name lookup we are about to do
4933 might destroy it. */
4934 old_scope
= parser
->scope
;
4935 saved_qualifying_scope
= parser
->qualifying_scope
;
4936 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4937 look up names in "X<T>::I" in order to determine that "Y" is
4938 a template. So, if we have a typename at this point, we make
4939 an effort to look through it. */
4941 && !typename_keyword_p
4943 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
4944 parser
->scope
= resolve_typename_type (parser
->scope
,
4945 /*only_current_p=*/false);
4946 /* Parse the qualifying entity. */
4948 = cp_parser_qualifying_entity (parser
,
4954 /* Look for the `::' token. */
4955 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
4957 /* If we found what we wanted, we keep going; otherwise, we're
4959 if (!cp_parser_parse_definitely (parser
))
4961 bool error_p
= false;
4963 /* Restore the OLD_SCOPE since it was valid before the
4964 failed attempt at finding the last
4965 class-or-namespace-name. */
4966 parser
->scope
= old_scope
;
4967 parser
->qualifying_scope
= saved_qualifying_scope
;
4969 /* If the next token is a decltype, and the one after that is a
4970 `::', then the decltype has failed to resolve to a class or
4971 enumeration type. Give this error even when parsing
4972 tentatively since it can't possibly be valid--and we're going
4973 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
4974 won't get another chance.*/
4975 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DECLTYPE
)
4976 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
4979 token
= cp_lexer_consume_token (parser
->lexer
);
4980 error_at (token
->location
, "decltype evaluates to %qT, "
4981 "which is not a class or enumeration type",
4983 parser
->scope
= error_mark_node
;
4987 cp_lexer_consume_token (parser
->lexer
);
4990 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
4992 /* If the next token is an identifier, and the one after
4993 that is a `::', then any valid interpretation would have
4994 found a class-or-namespace-name. */
4995 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
4996 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
4998 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
5001 token
= cp_lexer_consume_token (parser
->lexer
);
5004 if (!token
->ambiguous_p
)
5007 tree ambiguous_decls
;
5009 decl
= cp_parser_lookup_name (parser
, token
->u
.value
,
5011 /*is_template=*/false,
5012 /*is_namespace=*/false,
5013 /*check_dependency=*/true,
5016 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
5017 error_at (token
->location
,
5018 "%qD used without template parameters",
5020 else if (ambiguous_decls
)
5022 error_at (token
->location
,
5023 "reference to %qD is ambiguous",
5025 print_candidates (ambiguous_decls
);
5026 decl
= error_mark_node
;
5030 if (cxx_dialect
!= cxx98
)
5031 cp_parser_name_lookup_error
5032 (parser
, token
->u
.value
, decl
, NLE_NOT_CXX98
,
5035 cp_parser_name_lookup_error
5036 (parser
, token
->u
.value
, decl
, NLE_CXX98
,
5040 parser
->scope
= error_mark_node
;
5042 /* Treat this as a successful nested-name-specifier
5047 If the name found is not a class-name (clause
5048 _class_) or namespace-name (_namespace.def_), the
5049 program is ill-formed. */
5052 cp_lexer_consume_token (parser
->lexer
);
5056 /* We've found one valid nested-name-specifier. */
5058 /* Name lookup always gives us a DECL. */
5059 if (TREE_CODE (new_scope
) == TYPE_DECL
)
5060 new_scope
= TREE_TYPE (new_scope
);
5061 /* Uses of "template" must be followed by actual templates. */
5062 if (template_keyword_p
5063 && !(CLASS_TYPE_P (new_scope
)
5064 && ((CLASSTYPE_USE_TEMPLATE (new_scope
)
5065 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope
)))
5066 || CLASSTYPE_IS_TEMPLATE (new_scope
)))
5067 && !(TREE_CODE (new_scope
) == TYPENAME_TYPE
5068 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope
))
5069 == TEMPLATE_ID_EXPR
)))
5070 permerror (input_location
, TYPE_P (new_scope
)
5071 ? G_("%qT is not a template")
5072 : G_("%qD is not a template"),
5074 /* If it is a class scope, try to complete it; we are about to
5075 be looking up names inside the class. */
5076 if (TYPE_P (new_scope
)
5077 /* Since checking types for dependency can be expensive,
5078 avoid doing it if the type is already complete. */
5079 && !COMPLETE_TYPE_P (new_scope
)
5080 /* Do not try to complete dependent types. */
5081 && !dependent_type_p (new_scope
))
5083 new_scope
= complete_type (new_scope
);
5084 /* If it is a typedef to current class, use the current
5085 class instead, as the typedef won't have any names inside
5087 if (!COMPLETE_TYPE_P (new_scope
)
5088 && currently_open_class (new_scope
))
5089 new_scope
= TYPE_MAIN_VARIANT (new_scope
);
5091 /* Make sure we look in the right scope the next time through
5093 parser
->scope
= new_scope
;
5096 /* If parsing tentatively, replace the sequence of tokens that makes
5097 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5098 token. That way, should we re-parse the token stream, we will
5099 not have to repeat the effort required to do the parse, nor will
5100 we issue duplicate error messages. */
5101 if (success
&& start
)
5105 token
= cp_lexer_token_at (parser
->lexer
, start
);
5106 /* Reset the contents of the START token. */
5107 token
->type
= CPP_NESTED_NAME_SPECIFIER
;
5108 /* Retrieve any deferred checks. Do not pop this access checks yet
5109 so the memory will not be reclaimed during token replacing below. */
5110 token
->u
.tree_check_value
= ggc_alloc_cleared_tree_check ();
5111 token
->u
.tree_check_value
->value
= parser
->scope
;
5112 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
5113 token
->u
.tree_check_value
->qualifying_scope
=
5114 parser
->qualifying_scope
;
5115 token
->keyword
= RID_MAX
;
5117 /* Purge all subsequent tokens. */
5118 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
5122 pop_to_parent_deferring_access_checks ();
5124 return success
? parser
->scope
: NULL_TREE
;
5127 /* Parse a nested-name-specifier. See
5128 cp_parser_nested_name_specifier_opt for details. This function
5129 behaves identically, except that it will an issue an error if no
5130 nested-name-specifier is present. */
5133 cp_parser_nested_name_specifier (cp_parser
*parser
,
5134 bool typename_keyword_p
,
5135 bool check_dependency_p
,
5137 bool is_declaration
)
5141 /* Look for the nested-name-specifier. */
5142 scope
= cp_parser_nested_name_specifier_opt (parser
,
5147 /* If it was not present, issue an error message. */
5150 cp_parser_error (parser
, "expected nested-name-specifier");
5151 parser
->scope
= NULL_TREE
;
5157 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5158 this is either a class-name or a namespace-name (which corresponds
5159 to the class-or-namespace-name production in the grammar). For
5160 C++0x, it can also be a type-name that refers to an enumeration
5161 type or a simple-template-id.
5163 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5164 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5165 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5166 TYPE_P is TRUE iff the next name should be taken as a class-name,
5167 even the same name is declared to be another entity in the same
5170 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5171 specified by the class-or-namespace-name. If neither is found the
5172 ERROR_MARK_NODE is returned. */
5175 cp_parser_qualifying_entity (cp_parser
*parser
,
5176 bool typename_keyword_p
,
5177 bool template_keyword_p
,
5178 bool check_dependency_p
,
5180 bool is_declaration
)
5183 tree saved_qualifying_scope
;
5184 tree saved_object_scope
;
5187 bool successful_parse_p
;
5189 /* DR 743: decltype can appear in a nested-name-specifier. */
5190 if (cp_lexer_next_token_is_decltype (parser
->lexer
))
5192 scope
= cp_parser_decltype (parser
);
5193 if (TREE_CODE (scope
) != ENUMERAL_TYPE
5194 && !MAYBE_CLASS_TYPE_P (scope
))
5196 cp_parser_simulate_error (parser
);
5197 return error_mark_node
;
5199 if (TYPE_NAME (scope
))
5200 scope
= TYPE_NAME (scope
);
5204 /* Before we try to parse the class-name, we must save away the
5205 current PARSER->SCOPE since cp_parser_class_name will destroy
5207 saved_scope
= parser
->scope
;
5208 saved_qualifying_scope
= parser
->qualifying_scope
;
5209 saved_object_scope
= parser
->object_scope
;
5210 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5211 there is no need to look for a namespace-name. */
5212 only_class_p
= template_keyword_p
5213 || (saved_scope
&& TYPE_P (saved_scope
) && cxx_dialect
== cxx98
);
5215 cp_parser_parse_tentatively (parser
);
5216 scope
= cp_parser_class_name (parser
,
5219 type_p
? class_type
: none_type
,
5221 /*class_head_p=*/false,
5223 successful_parse_p
= only_class_p
|| cp_parser_parse_definitely (parser
);
5224 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5226 && cxx_dialect
!= cxx98
5227 && !successful_parse_p
)
5229 /* Restore the saved scope. */
5230 parser
->scope
= saved_scope
;
5231 parser
->qualifying_scope
= saved_qualifying_scope
;
5232 parser
->object_scope
= saved_object_scope
;
5234 /* Parse tentatively. */
5235 cp_parser_parse_tentatively (parser
);
5237 /* Parse a type-name */
5238 scope
= cp_parser_type_name (parser
);
5240 /* "If the name found does not designate a namespace or a class,
5241 enumeration, or dependent type, the program is ill-formed."
5243 We cover classes and dependent types above and namespaces below,
5244 so this code is only looking for enums. */
5245 if (!scope
|| TREE_CODE (scope
) != TYPE_DECL
5246 || TREE_CODE (TREE_TYPE (scope
)) != ENUMERAL_TYPE
)
5247 cp_parser_simulate_error (parser
);
5249 successful_parse_p
= cp_parser_parse_definitely (parser
);
5251 /* If that didn't work, try for a namespace-name. */
5252 if (!only_class_p
&& !successful_parse_p
)
5254 /* Restore the saved scope. */
5255 parser
->scope
= saved_scope
;
5256 parser
->qualifying_scope
= saved_qualifying_scope
;
5257 parser
->object_scope
= saved_object_scope
;
5258 /* If we are not looking at an identifier followed by the scope
5259 resolution operator, then this is not part of a
5260 nested-name-specifier. (Note that this function is only used
5261 to parse the components of a nested-name-specifier.) */
5262 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
)
5263 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
5264 return error_mark_node
;
5265 scope
= cp_parser_namespace_name (parser
);
5271 /* Parse a postfix-expression.
5275 postfix-expression [ expression ]
5276 postfix-expression ( expression-list [opt] )
5277 simple-type-specifier ( expression-list [opt] )
5278 typename :: [opt] nested-name-specifier identifier
5279 ( expression-list [opt] )
5280 typename :: [opt] nested-name-specifier template [opt] template-id
5281 ( expression-list [opt] )
5282 postfix-expression . template [opt] id-expression
5283 postfix-expression -> template [opt] id-expression
5284 postfix-expression . pseudo-destructor-name
5285 postfix-expression -> pseudo-destructor-name
5286 postfix-expression ++
5287 postfix-expression --
5288 dynamic_cast < type-id > ( expression )
5289 static_cast < type-id > ( expression )
5290 reinterpret_cast < type-id > ( expression )
5291 const_cast < type-id > ( expression )
5292 typeid ( expression )
5298 ( type-id ) { initializer-list , [opt] }
5300 This extension is a GNU version of the C99 compound-literal
5301 construct. (The C99 grammar uses `type-name' instead of `type-id',
5302 but they are essentially the same concept.)
5304 If ADDRESS_P is true, the postfix expression is the operand of the
5305 `&' operator. CAST_P is true if this expression is the target of a
5308 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5309 class member access expressions [expr.ref].
5311 Returns a representation of the expression. */
5314 cp_parser_postfix_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
5315 bool member_access_only_p
,
5316 cp_id_kind
* pidk_return
)
5320 cp_id_kind idk
= CP_ID_KIND_NONE
;
5321 tree postfix_expression
= NULL_TREE
;
5322 bool is_member_access
= false;
5324 /* Peek at the next token. */
5325 token
= cp_lexer_peek_token (parser
->lexer
);
5326 /* Some of the productions are determined by keywords. */
5327 keyword
= token
->keyword
;
5337 const char *saved_message
;
5339 /* All of these can be handled in the same way from the point
5340 of view of parsing. Begin by consuming the token
5341 identifying the cast. */
5342 cp_lexer_consume_token (parser
->lexer
);
5344 /* New types cannot be defined in the cast. */
5345 saved_message
= parser
->type_definition_forbidden_message
;
5346 parser
->type_definition_forbidden_message
5347 = G_("types may not be defined in casts");
5349 /* Look for the opening `<'. */
5350 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
5351 /* Parse the type to which we are casting. */
5352 type
= cp_parser_type_id (parser
);
5353 /* Look for the closing `>'. */
5354 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
5355 /* Restore the old message. */
5356 parser
->type_definition_forbidden_message
= saved_message
;
5358 /* And the expression which is being cast. */
5359 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
5360 expression
= cp_parser_expression (parser
, /*cast_p=*/true, & idk
);
5361 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5363 /* Only type conversions to integral or enumeration types
5364 can be used in constant-expressions. */
5365 if (!cast_valid_in_integral_constant_expression_p (type
)
5366 && cp_parser_non_integral_constant_expression (parser
, NIC_CAST
))
5367 return error_mark_node
;
5373 = build_dynamic_cast (type
, expression
, tf_warning_or_error
);
5377 = build_static_cast (type
, expression
, tf_warning_or_error
);
5381 = build_reinterpret_cast (type
, expression
,
5382 tf_warning_or_error
);
5386 = build_const_cast (type
, expression
, tf_warning_or_error
);
5397 const char *saved_message
;
5398 bool saved_in_type_id_in_expr_p
;
5400 /* Consume the `typeid' token. */
5401 cp_lexer_consume_token (parser
->lexer
);
5402 /* Look for the `(' token. */
5403 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
5404 /* Types cannot be defined in a `typeid' expression. */
5405 saved_message
= parser
->type_definition_forbidden_message
;
5406 parser
->type_definition_forbidden_message
5407 = G_("types may not be defined in a %<typeid%> expression");
5408 /* We can't be sure yet whether we're looking at a type-id or an
5410 cp_parser_parse_tentatively (parser
);
5411 /* Try a type-id first. */
5412 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
5413 parser
->in_type_id_in_expr_p
= true;
5414 type
= cp_parser_type_id (parser
);
5415 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
5416 /* Look for the `)' token. Otherwise, we can't be sure that
5417 we're not looking at an expression: consider `typeid (int
5418 (3))', for example. */
5419 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5420 /* If all went well, simply lookup the type-id. */
5421 if (cp_parser_parse_definitely (parser
))
5422 postfix_expression
= get_typeid (type
);
5423 /* Otherwise, fall back to the expression variant. */
5428 /* Look for an expression. */
5429 expression
= cp_parser_expression (parser
, /*cast_p=*/false, & idk
);
5430 /* Compute its typeid. */
5431 postfix_expression
= build_typeid (expression
);
5432 /* Look for the `)' token. */
5433 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5435 /* Restore the saved message. */
5436 parser
->type_definition_forbidden_message
= saved_message
;
5437 /* `typeid' may not appear in an integral constant expression. */
5438 if (cp_parser_non_integral_constant_expression (parser
, NIC_TYPEID
))
5439 return error_mark_node
;
5446 /* The syntax permitted here is the same permitted for an
5447 elaborated-type-specifier. */
5448 type
= cp_parser_elaborated_type_specifier (parser
,
5449 /*is_friend=*/false,
5450 /*is_declaration=*/false);
5451 postfix_expression
= cp_parser_functional_cast (parser
, type
);
5459 /* If the next thing is a simple-type-specifier, we may be
5460 looking at a functional cast. We could also be looking at
5461 an id-expression. So, we try the functional cast, and if
5462 that doesn't work we fall back to the primary-expression. */
5463 cp_parser_parse_tentatively (parser
);
5464 /* Look for the simple-type-specifier. */
5465 type
= cp_parser_simple_type_specifier (parser
,
5466 /*decl_specs=*/NULL
,
5467 CP_PARSER_FLAGS_NONE
);
5468 /* Parse the cast itself. */
5469 if (!cp_parser_error_occurred (parser
))
5471 = cp_parser_functional_cast (parser
, type
);
5472 /* If that worked, we're done. */
5473 if (cp_parser_parse_definitely (parser
))
5476 /* If the functional-cast didn't work out, try a
5477 compound-literal. */
5478 if (cp_parser_allow_gnu_extensions_p (parser
)
5479 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
5481 VEC(constructor_elt
,gc
) *initializer_list
= NULL
;
5482 bool saved_in_type_id_in_expr_p
;
5484 cp_parser_parse_tentatively (parser
);
5485 /* Consume the `('. */
5486 cp_lexer_consume_token (parser
->lexer
);
5487 /* Parse the type. */
5488 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
5489 parser
->in_type_id_in_expr_p
= true;
5490 type
= cp_parser_type_id (parser
);
5491 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
5492 /* Look for the `)'. */
5493 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5494 /* Look for the `{'. */
5495 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
5496 /* If things aren't going well, there's no need to
5498 if (!cp_parser_error_occurred (parser
))
5500 bool non_constant_p
;
5501 /* Parse the initializer-list. */
5503 = cp_parser_initializer_list (parser
, &non_constant_p
);
5504 /* Allow a trailing `,'. */
5505 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
5506 cp_lexer_consume_token (parser
->lexer
);
5507 /* Look for the final `}'. */
5508 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
5510 /* If that worked, we're definitely looking at a
5511 compound-literal expression. */
5512 if (cp_parser_parse_definitely (parser
))
5514 /* Warn the user that a compound literal is not
5515 allowed in standard C++. */
5516 pedwarn (input_location
, OPT_pedantic
, "ISO C++ forbids compound-literals");
5517 /* For simplicity, we disallow compound literals in
5518 constant-expressions. We could
5519 allow compound literals of integer type, whose
5520 initializer was a constant, in constant
5521 expressions. Permitting that usage, as a further
5522 extension, would not change the meaning of any
5523 currently accepted programs. (Of course, as
5524 compound literals are not part of ISO C++, the
5525 standard has nothing to say.) */
5526 if (cp_parser_non_integral_constant_expression (parser
,
5529 postfix_expression
= error_mark_node
;
5532 /* Form the representation of the compound-literal. */
5534 = (finish_compound_literal
5535 (type
, build_constructor (init_list_type_node
,
5537 tf_warning_or_error
));
5542 /* It must be a primary-expression. */
5544 = cp_parser_primary_expression (parser
, address_p
, cast_p
,
5545 /*template_arg_p=*/false,
5551 /* Keep looping until the postfix-expression is complete. */
5554 if (idk
== CP_ID_KIND_UNQUALIFIED
5555 && TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
5556 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
5557 /* It is not a Koenig lookup function call. */
5559 = unqualified_name_lookup_error (postfix_expression
);
5561 /* Peek at the next token. */
5562 token
= cp_lexer_peek_token (parser
->lexer
);
5564 switch (token
->type
)
5566 case CPP_OPEN_SQUARE
:
5568 = cp_parser_postfix_open_square_expression (parser
,
5571 idk
= CP_ID_KIND_NONE
;
5572 is_member_access
= false;
5575 case CPP_OPEN_PAREN
:
5576 /* postfix-expression ( expression-list [opt] ) */
5579 bool is_builtin_constant_p
;
5580 bool saved_integral_constant_expression_p
= false;
5581 bool saved_non_integral_constant_expression_p
= false;
5584 is_member_access
= false;
5586 is_builtin_constant_p
5587 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression
);
5588 if (is_builtin_constant_p
)
5590 /* The whole point of __builtin_constant_p is to allow
5591 non-constant expressions to appear as arguments. */
5592 saved_integral_constant_expression_p
5593 = parser
->integral_constant_expression_p
;
5594 saved_non_integral_constant_expression_p
5595 = parser
->non_integral_constant_expression_p
;
5596 parser
->integral_constant_expression_p
= false;
5598 args
= (cp_parser_parenthesized_expression_list
5600 /*cast_p=*/false, /*allow_expansion_p=*/true,
5601 /*non_constant_p=*/NULL
));
5602 if (is_builtin_constant_p
)
5604 parser
->integral_constant_expression_p
5605 = saved_integral_constant_expression_p
;
5606 parser
->non_integral_constant_expression_p
5607 = saved_non_integral_constant_expression_p
;
5612 postfix_expression
= error_mark_node
;
5616 /* Function calls are not permitted in
5617 constant-expressions. */
5618 if (! builtin_valid_in_constant_expr_p (postfix_expression
)
5619 && cp_parser_non_integral_constant_expression (parser
,
5622 postfix_expression
= error_mark_node
;
5623 release_tree_vector (args
);
5628 if (idk
== CP_ID_KIND_UNQUALIFIED
5629 || idk
== CP_ID_KIND_TEMPLATE_ID
)
5631 if (TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
)
5633 if (!VEC_empty (tree
, args
))
5636 if (!any_type_dependent_arguments_p (args
))
5638 = perform_koenig_lookup (postfix_expression
, args
,
5639 /*include_std=*/false,
5640 tf_warning_or_error
);
5644 = unqualified_fn_lookup_error (postfix_expression
);
5646 /* We do not perform argument-dependent lookup if
5647 normal lookup finds a non-function, in accordance
5648 with the expected resolution of DR 218. */
5649 else if (!VEC_empty (tree
, args
)
5650 && is_overloaded_fn (postfix_expression
))
5652 tree fn
= get_first_fn (postfix_expression
);
5653 fn
= STRIP_TEMPLATE (fn
);
5655 /* Do not do argument dependent lookup if regular
5656 lookup finds a member function or a block-scope
5657 function declaration. [basic.lookup.argdep]/3 */
5658 if (!DECL_FUNCTION_MEMBER_P (fn
)
5659 && !DECL_LOCAL_FUNCTION_P (fn
))
5662 if (!any_type_dependent_arguments_p (args
))
5664 = perform_koenig_lookup (postfix_expression
, args
,
5665 /*include_std=*/false,
5666 tf_warning_or_error
);
5671 if (TREE_CODE (postfix_expression
) == COMPONENT_REF
)
5673 tree instance
= TREE_OPERAND (postfix_expression
, 0);
5674 tree fn
= TREE_OPERAND (postfix_expression
, 1);
5676 if (processing_template_decl
5677 && (type_dependent_expression_p (instance
)
5678 || (!BASELINK_P (fn
)
5679 && TREE_CODE (fn
) != FIELD_DECL
)
5680 || type_dependent_expression_p (fn
)
5681 || any_type_dependent_arguments_p (args
)))
5684 = build_nt_call_vec (postfix_expression
, args
);
5685 release_tree_vector (args
);
5689 if (BASELINK_P (fn
))
5692 = (build_new_method_call
5693 (instance
, fn
, &args
, NULL_TREE
,
5694 (idk
== CP_ID_KIND_QUALIFIED
5695 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
5698 tf_warning_or_error
));
5702 = finish_call_expr (postfix_expression
, &args
,
5703 /*disallow_virtual=*/false,
5705 tf_warning_or_error
);
5707 else if (TREE_CODE (postfix_expression
) == OFFSET_REF
5708 || TREE_CODE (postfix_expression
) == MEMBER_REF
5709 || TREE_CODE (postfix_expression
) == DOTSTAR_EXPR
)
5710 postfix_expression
= (build_offset_ref_call_from_tree
5711 (postfix_expression
, &args
));
5712 else if (idk
== CP_ID_KIND_QUALIFIED
)
5713 /* A call to a static class member, or a namespace-scope
5716 = finish_call_expr (postfix_expression
, &args
,
5717 /*disallow_virtual=*/true,
5719 tf_warning_or_error
);
5721 /* All other function calls. */
5723 = finish_call_expr (postfix_expression
, &args
,
5724 /*disallow_virtual=*/false,
5726 tf_warning_or_error
);
5728 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5729 idk
= CP_ID_KIND_NONE
;
5731 release_tree_vector (args
);
5737 /* postfix-expression . template [opt] id-expression
5738 postfix-expression . pseudo-destructor-name
5739 postfix-expression -> template [opt] id-expression
5740 postfix-expression -> pseudo-destructor-name */
5742 /* Consume the `.' or `->' operator. */
5743 cp_lexer_consume_token (parser
->lexer
);
5746 = cp_parser_postfix_dot_deref_expression (parser
, token
->type
,
5751 is_member_access
= true;
5755 /* postfix-expression ++ */
5756 /* Consume the `++' token. */
5757 cp_lexer_consume_token (parser
->lexer
);
5758 /* Generate a representation for the complete expression. */
5760 = finish_increment_expr (postfix_expression
,
5761 POSTINCREMENT_EXPR
);
5762 /* Increments may not appear in constant-expressions. */
5763 if (cp_parser_non_integral_constant_expression (parser
, NIC_INC
))
5764 postfix_expression
= error_mark_node
;
5765 idk
= CP_ID_KIND_NONE
;
5766 is_member_access
= false;
5769 case CPP_MINUS_MINUS
:
5770 /* postfix-expression -- */
5771 /* Consume the `--' token. */
5772 cp_lexer_consume_token (parser
->lexer
);
5773 /* Generate a representation for the complete expression. */
5775 = finish_increment_expr (postfix_expression
,
5776 POSTDECREMENT_EXPR
);
5777 /* Decrements may not appear in constant-expressions. */
5778 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEC
))
5779 postfix_expression
= error_mark_node
;
5780 idk
= CP_ID_KIND_NONE
;
5781 is_member_access
= false;
5785 if (pidk_return
!= NULL
)
5786 * pidk_return
= idk
;
5787 if (member_access_only_p
)
5788 return is_member_access
? postfix_expression
: error_mark_node
;
5790 return postfix_expression
;
5794 /* We should never get here. */
5796 return error_mark_node
;
5799 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5800 by cp_parser_builtin_offsetof. We're looking for
5802 postfix-expression [ expression ]
5804 FOR_OFFSETOF is set if we're being called in that context, which
5805 changes how we deal with integer constant expressions. */
5808 cp_parser_postfix_open_square_expression (cp_parser
*parser
,
5809 tree postfix_expression
,
5814 /* Consume the `[' token. */
5815 cp_lexer_consume_token (parser
->lexer
);
5817 /* Parse the index expression. */
5818 /* ??? For offsetof, there is a question of what to allow here. If
5819 offsetof is not being used in an integral constant expression context,
5820 then we *could* get the right answer by computing the value at runtime.
5821 If we are in an integral constant expression context, then we might
5822 could accept any constant expression; hard to say without analysis.
5823 Rather than open the barn door too wide right away, allow only integer
5824 constant expressions here. */
5826 index
= cp_parser_constant_expression (parser
, false, NULL
);
5828 index
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
5830 /* Look for the closing `]'. */
5831 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
5833 /* Build the ARRAY_REF. */
5834 postfix_expression
= grok_array_decl (postfix_expression
, index
);
5836 /* When not doing offsetof, array references are not permitted in
5837 constant-expressions. */
5839 && (cp_parser_non_integral_constant_expression (parser
, NIC_ARRAY_REF
)))
5840 postfix_expression
= error_mark_node
;
5842 return postfix_expression
;
5845 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5846 by cp_parser_builtin_offsetof. We're looking for
5848 postfix-expression . template [opt] id-expression
5849 postfix-expression . pseudo-destructor-name
5850 postfix-expression -> template [opt] id-expression
5851 postfix-expression -> pseudo-destructor-name
5853 FOR_OFFSETOF is set if we're being called in that context. That sorta
5854 limits what of the above we'll actually accept, but nevermind.
5855 TOKEN_TYPE is the "." or "->" token, which will already have been
5856 removed from the stream. */
5859 cp_parser_postfix_dot_deref_expression (cp_parser
*parser
,
5860 enum cpp_ttype token_type
,
5861 tree postfix_expression
,
5862 bool for_offsetof
, cp_id_kind
*idk
,
5863 location_t location
)
5867 bool pseudo_destructor_p
;
5868 tree scope
= NULL_TREE
;
5870 /* If this is a `->' operator, dereference the pointer. */
5871 if (token_type
== CPP_DEREF
)
5872 postfix_expression
= build_x_arrow (postfix_expression
);
5873 /* Check to see whether or not the expression is type-dependent. */
5874 dependent_p
= type_dependent_expression_p (postfix_expression
);
5875 /* The identifier following the `->' or `.' is not qualified. */
5876 parser
->scope
= NULL_TREE
;
5877 parser
->qualifying_scope
= NULL_TREE
;
5878 parser
->object_scope
= NULL_TREE
;
5879 *idk
= CP_ID_KIND_NONE
;
5881 /* Enter the scope corresponding to the type of the object
5882 given by the POSTFIX_EXPRESSION. */
5883 if (!dependent_p
&& TREE_TYPE (postfix_expression
) != NULL_TREE
)
5885 scope
= TREE_TYPE (postfix_expression
);
5886 /* According to the standard, no expression should ever have
5887 reference type. Unfortunately, we do not currently match
5888 the standard in this respect in that our internal representation
5889 of an expression may have reference type even when the standard
5890 says it does not. Therefore, we have to manually obtain the
5891 underlying type here. */
5892 scope
= non_reference (scope
);
5893 /* The type of the POSTFIX_EXPRESSION must be complete. */
5894 if (scope
== unknown_type_node
)
5896 error_at (location
, "%qE does not have class type",
5897 postfix_expression
);
5900 /* Unlike the object expression in other contexts, *this is not
5901 required to be of complete type for purposes of class member
5902 access (5.2.5) outside the member function body. */
5903 else if (scope
!= current_class_ref
5904 && !(processing_template_decl
&& scope
== current_class_type
))
5905 scope
= complete_type_or_else (scope
, NULL_TREE
);
5906 /* Let the name lookup machinery know that we are processing a
5907 class member access expression. */
5908 parser
->context
->object_type
= scope
;
5909 /* If something went wrong, we want to be able to discern that case,
5910 as opposed to the case where there was no SCOPE due to the type
5911 of expression being dependent. */
5913 scope
= error_mark_node
;
5914 /* If the SCOPE was erroneous, make the various semantic analysis
5915 functions exit quickly -- and without issuing additional error
5917 if (scope
== error_mark_node
)
5918 postfix_expression
= error_mark_node
;
5921 /* Assume this expression is not a pseudo-destructor access. */
5922 pseudo_destructor_p
= false;
5924 /* If the SCOPE is a scalar type, then, if this is a valid program,
5925 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5926 is type dependent, it can be pseudo-destructor-name or something else.
5927 Try to parse it as pseudo-destructor-name first. */
5928 if ((scope
&& SCALAR_TYPE_P (scope
)) || dependent_p
)
5933 cp_parser_parse_tentatively (parser
);
5934 /* Parse the pseudo-destructor-name. */
5936 cp_parser_pseudo_destructor_name (parser
, &s
, &type
);
5938 && (cp_parser_error_occurred (parser
)
5939 || TREE_CODE (type
) != TYPE_DECL
5940 || !SCALAR_TYPE_P (TREE_TYPE (type
))))
5941 cp_parser_abort_tentative_parse (parser
);
5942 else if (cp_parser_parse_definitely (parser
))
5944 pseudo_destructor_p
= true;
5946 = finish_pseudo_destructor_expr (postfix_expression
,
5947 s
, TREE_TYPE (type
));
5951 if (!pseudo_destructor_p
)
5953 /* If the SCOPE is not a scalar type, we are looking at an
5954 ordinary class member access expression, rather than a
5955 pseudo-destructor-name. */
5957 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
5958 /* Parse the id-expression. */
5959 name
= (cp_parser_id_expression
5961 cp_parser_optional_template_keyword (parser
),
5962 /*check_dependency_p=*/true,
5964 /*declarator_p=*/false,
5965 /*optional_p=*/false));
5966 /* In general, build a SCOPE_REF if the member name is qualified.
5967 However, if the name was not dependent and has already been
5968 resolved; there is no need to build the SCOPE_REF. For example;
5970 struct X { void f(); };
5971 template <typename T> void f(T* t) { t->X::f(); }
5973 Even though "t" is dependent, "X::f" is not and has been resolved
5974 to a BASELINK; there is no need to include scope information. */
5976 /* But we do need to remember that there was an explicit scope for
5977 virtual function calls. */
5979 *idk
= CP_ID_KIND_QUALIFIED
;
5981 /* If the name is a template-id that names a type, we will get a
5982 TYPE_DECL here. That is invalid code. */
5983 if (TREE_CODE (name
) == TYPE_DECL
)
5985 error_at (token
->location
, "invalid use of %qD", name
);
5986 postfix_expression
= error_mark_node
;
5990 if (name
!= error_mark_node
&& !BASELINK_P (name
) && parser
->scope
)
5992 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
5994 error_at (token
->location
, "%<%D::%D%> is not a class member",
5995 parser
->scope
, name
);
5996 postfix_expression
= error_mark_node
;
5999 name
= build_qualified_name (/*type=*/NULL_TREE
,
6003 parser
->scope
= NULL_TREE
;
6004 parser
->qualifying_scope
= NULL_TREE
;
6005 parser
->object_scope
= NULL_TREE
;
6007 if (scope
&& name
&& BASELINK_P (name
))
6008 adjust_result_of_qualified_name_lookup
6009 (name
, BINFO_TYPE (BASELINK_ACCESS_BINFO (name
)), scope
);
6011 = finish_class_member_access_expr (postfix_expression
, name
,
6013 tf_warning_or_error
);
6017 /* We no longer need to look up names in the scope of the object on
6018 the left-hand side of the `.' or `->' operator. */
6019 parser
->context
->object_type
= NULL_TREE
;
6021 /* Outside of offsetof, these operators may not appear in
6022 constant-expressions. */
6024 && (cp_parser_non_integral_constant_expression
6025 (parser
, token_type
== CPP_DEREF
? NIC_ARROW
: NIC_POINT
)))
6026 postfix_expression
= error_mark_node
;
6028 return postfix_expression
;
6031 /* Parse a parenthesized expression-list.
6034 assignment-expression
6035 expression-list, assignment-expression
6040 identifier, expression-list
6042 CAST_P is true if this expression is the target of a cast.
6044 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6047 Returns a vector of trees. Each element is a representation of an
6048 assignment-expression. NULL is returned if the ( and or ) are
6049 missing. An empty, but allocated, vector is returned on no
6050 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6051 if we are parsing an attribute list for an attribute that wants a
6052 plain identifier argument, normal_attr for an attribute that wants
6053 an expression, or non_attr if we aren't parsing an attribute list. If
6054 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6055 not all of the expressions in the list were constant. */
6057 static VEC(tree
,gc
) *
6058 cp_parser_parenthesized_expression_list (cp_parser
* parser
,
6059 int is_attribute_list
,
6061 bool allow_expansion_p
,
6062 bool *non_constant_p
)
6064 VEC(tree
,gc
) *expression_list
;
6065 bool fold_expr_p
= is_attribute_list
!= non_attr
;
6066 tree identifier
= NULL_TREE
;
6067 bool saved_greater_than_is_operator_p
;
6069 /* Assume all the expressions will be constant. */
6071 *non_constant_p
= false;
6073 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
6076 expression_list
= make_tree_vector ();
6078 /* Within a parenthesized expression, a `>' token is always
6079 the greater-than operator. */
6080 saved_greater_than_is_operator_p
6081 = parser
->greater_than_is_operator_p
;
6082 parser
->greater_than_is_operator_p
= true;
6084 /* Consume expressions until there are no more. */
6085 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
6090 /* At the beginning of attribute lists, check to see if the
6091 next token is an identifier. */
6092 if (is_attribute_list
== id_attr
6093 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_NAME
)
6097 /* Consume the identifier. */
6098 token
= cp_lexer_consume_token (parser
->lexer
);
6099 /* Save the identifier. */
6100 identifier
= token
->u
.value
;
6104 bool expr_non_constant_p
;
6106 /* Parse the next assignment-expression. */
6107 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
6109 /* A braced-init-list. */
6110 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
6111 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
6112 if (non_constant_p
&& expr_non_constant_p
)
6113 *non_constant_p
= true;
6115 else if (non_constant_p
)
6117 expr
= (cp_parser_constant_expression
6118 (parser
, /*allow_non_constant_p=*/true,
6119 &expr_non_constant_p
));
6120 if (expr_non_constant_p
)
6121 *non_constant_p
= true;
6124 expr
= cp_parser_assignment_expression (parser
, cast_p
, NULL
);
6127 expr
= fold_non_dependent_expr (expr
);
6129 /* If we have an ellipsis, then this is an expression
6131 if (allow_expansion_p
6132 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
6134 /* Consume the `...'. */
6135 cp_lexer_consume_token (parser
->lexer
);
6137 /* Build the argument pack. */
6138 expr
= make_pack_expansion (expr
);
6141 /* Add it to the list. We add error_mark_node
6142 expressions to the list, so that we can still tell if
6143 the correct form for a parenthesized expression-list
6144 is found. That gives better errors. */
6145 VEC_safe_push (tree
, gc
, expression_list
, expr
);
6147 if (expr
== error_mark_node
)
6151 /* After the first item, attribute lists look the same as
6152 expression lists. */
6153 is_attribute_list
= non_attr
;
6156 /* If the next token isn't a `,', then we are done. */
6157 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
6160 /* Otherwise, consume the `,' and keep going. */
6161 cp_lexer_consume_token (parser
->lexer
);
6164 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
6169 /* We try and resync to an unnested comma, as that will give the
6170 user better diagnostics. */
6171 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
6172 /*recovering=*/true,
6174 /*consume_paren=*/true);
6179 parser
->greater_than_is_operator_p
6180 = saved_greater_than_is_operator_p
;
6185 parser
->greater_than_is_operator_p
6186 = saved_greater_than_is_operator_p
;
6189 VEC_safe_insert (tree
, gc
, expression_list
, 0, identifier
);
6191 return expression_list
;
6194 /* Parse a pseudo-destructor-name.
6196 pseudo-destructor-name:
6197 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6198 :: [opt] nested-name-specifier template template-id :: ~ type-name
6199 :: [opt] nested-name-specifier [opt] ~ type-name
6201 If either of the first two productions is used, sets *SCOPE to the
6202 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6203 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6204 or ERROR_MARK_NODE if the parse fails. */
6207 cp_parser_pseudo_destructor_name (cp_parser
* parser
,
6211 bool nested_name_specifier_p
;
6213 /* Assume that things will not work out. */
6214 *type
= error_mark_node
;
6216 /* Look for the optional `::' operator. */
6217 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
6218 /* Look for the optional nested-name-specifier. */
6219 nested_name_specifier_p
6220 = (cp_parser_nested_name_specifier_opt (parser
,
6221 /*typename_keyword_p=*/false,
6222 /*check_dependency_p=*/true,
6224 /*is_declaration=*/false)
6226 /* Now, if we saw a nested-name-specifier, we might be doing the
6227 second production. */
6228 if (nested_name_specifier_p
6229 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
6231 /* Consume the `template' keyword. */
6232 cp_lexer_consume_token (parser
->lexer
);
6233 /* Parse the template-id. */
6234 cp_parser_template_id (parser
,
6235 /*template_keyword_p=*/true,
6236 /*check_dependency_p=*/false,
6237 /*is_declaration=*/true);
6238 /* Look for the `::' token. */
6239 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
6241 /* If the next token is not a `~', then there might be some
6242 additional qualification. */
6243 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMPL
))
6245 /* At this point, we're looking for "type-name :: ~". The type-name
6246 must not be a class-name, since this is a pseudo-destructor. So,
6247 it must be either an enum-name, or a typedef-name -- both of which
6248 are just identifiers. So, we peek ahead to check that the "::"
6249 and "~" tokens are present; if they are not, then we can avoid
6250 calling type_name. */
6251 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_NAME
6252 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
6253 || cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_COMPL
)
6255 cp_parser_error (parser
, "non-scalar type");
6259 /* Look for the type-name. */
6260 *scope
= TREE_TYPE (cp_parser_nonclass_name (parser
));
6261 if (*scope
== error_mark_node
)
6264 /* Look for the `::' token. */
6265 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
6270 /* Look for the `~'. */
6271 cp_parser_require (parser
, CPP_COMPL
, RT_COMPL
);
6273 /* Once we see the ~, this has to be a pseudo-destructor. */
6274 if (!processing_template_decl
&& !cp_parser_error_occurred (parser
))
6275 cp_parser_commit_to_tentative_parse (parser
);
6277 /* Look for the type-name again. We are not responsible for
6278 checking that it matches the first type-name. */
6279 *type
= cp_parser_nonclass_name (parser
);
6282 /* Parse a unary-expression.
6288 unary-operator cast-expression
6289 sizeof unary-expression
6291 alignof ( type-id ) [C++0x]
6298 __extension__ cast-expression
6299 __alignof__ unary-expression
6300 __alignof__ ( type-id )
6301 alignof unary-expression [C++0x]
6302 __real__ cast-expression
6303 __imag__ cast-expression
6306 ADDRESS_P is true iff the unary-expression is appearing as the
6307 operand of the `&' operator. CAST_P is true if this expression is
6308 the target of a cast.
6310 Returns a representation of the expression. */
6313 cp_parser_unary_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
6317 enum tree_code unary_operator
;
6319 /* Peek at the next token. */
6320 token
= cp_lexer_peek_token (parser
->lexer
);
6321 /* Some keywords give away the kind of expression. */
6322 if (token
->type
== CPP_KEYWORD
)
6324 enum rid keyword
= token
->keyword
;
6334 op
= keyword
== RID_ALIGNOF
? ALIGNOF_EXPR
: SIZEOF_EXPR
;
6335 /* Consume the token. */
6336 cp_lexer_consume_token (parser
->lexer
);
6337 /* Parse the operand. */
6338 operand
= cp_parser_sizeof_operand (parser
, keyword
);
6340 if (TYPE_P (operand
))
6341 return cxx_sizeof_or_alignof_type (operand
, op
, true);
6344 /* ISO C++ defines alignof only with types, not with
6345 expressions. So pedwarn if alignof is used with a non-
6346 type expression. However, __alignof__ is ok. */
6347 if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "alignof"))
6348 pedwarn (token
->location
, OPT_pedantic
,
6349 "ISO C++ does not allow %<alignof%> "
6352 return cxx_sizeof_or_alignof_expr (operand
, op
, true);
6357 return cp_parser_new_expression (parser
);
6360 return cp_parser_delete_expression (parser
);
6364 /* The saved value of the PEDANTIC flag. */
6368 /* Save away the PEDANTIC flag. */
6369 cp_parser_extension_opt (parser
, &saved_pedantic
);
6370 /* Parse the cast-expression. */
6371 expr
= cp_parser_simple_cast_expression (parser
);
6372 /* Restore the PEDANTIC flag. */
6373 pedantic
= saved_pedantic
;
6383 /* Consume the `__real__' or `__imag__' token. */
6384 cp_lexer_consume_token (parser
->lexer
);
6385 /* Parse the cast-expression. */
6386 expression
= cp_parser_simple_cast_expression (parser
);
6387 /* Create the complete representation. */
6388 return build_x_unary_op ((keyword
== RID_REALPART
6389 ? REALPART_EXPR
: IMAGPART_EXPR
),
6391 tf_warning_or_error
);
6395 case RID_TRANSACTION_ATOMIC
:
6396 case RID_TRANSACTION_RELAXED
:
6397 return cp_parser_transaction_expression (parser
, keyword
);
6402 const char *saved_message
;
6403 bool saved_integral_constant_expression_p
;
6404 bool saved_non_integral_constant_expression_p
;
6405 bool saved_greater_than_is_operator_p
;
6407 cp_lexer_consume_token (parser
->lexer
);
6408 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
6410 saved_message
= parser
->type_definition_forbidden_message
;
6411 parser
->type_definition_forbidden_message
6412 = G_("types may not be defined in %<noexcept%> expressions");
6414 saved_integral_constant_expression_p
6415 = parser
->integral_constant_expression_p
;
6416 saved_non_integral_constant_expression_p
6417 = parser
->non_integral_constant_expression_p
;
6418 parser
->integral_constant_expression_p
= false;
6420 saved_greater_than_is_operator_p
6421 = parser
->greater_than_is_operator_p
;
6422 parser
->greater_than_is_operator_p
= true;
6424 ++cp_unevaluated_operand
;
6425 ++c_inhibit_evaluation_warnings
;
6426 expr
= cp_parser_expression (parser
, false, NULL
);
6427 --c_inhibit_evaluation_warnings
;
6428 --cp_unevaluated_operand
;
6430 parser
->greater_than_is_operator_p
6431 = saved_greater_than_is_operator_p
;
6433 parser
->integral_constant_expression_p
6434 = saved_integral_constant_expression_p
;
6435 parser
->non_integral_constant_expression_p
6436 = saved_non_integral_constant_expression_p
;
6438 parser
->type_definition_forbidden_message
= saved_message
;
6440 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6441 return finish_noexcept_expr (expr
, tf_warning_or_error
);
6449 /* Look for the `:: new' and `:: delete', which also signal the
6450 beginning of a new-expression, or delete-expression,
6451 respectively. If the next token is `::', then it might be one of
6453 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
6457 /* See if the token after the `::' is one of the keywords in
6458 which we're interested. */
6459 keyword
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->keyword
;
6460 /* If it's `new', we have a new-expression. */
6461 if (keyword
== RID_NEW
)
6462 return cp_parser_new_expression (parser
);
6463 /* Similarly, for `delete'. */
6464 else if (keyword
== RID_DELETE
)
6465 return cp_parser_delete_expression (parser
);
6468 /* Look for a unary operator. */
6469 unary_operator
= cp_parser_unary_operator (token
);
6470 /* The `++' and `--' operators can be handled similarly, even though
6471 they are not technically unary-operators in the grammar. */
6472 if (unary_operator
== ERROR_MARK
)
6474 if (token
->type
== CPP_PLUS_PLUS
)
6475 unary_operator
= PREINCREMENT_EXPR
;
6476 else if (token
->type
== CPP_MINUS_MINUS
)
6477 unary_operator
= PREDECREMENT_EXPR
;
6478 /* Handle the GNU address-of-label extension. */
6479 else if (cp_parser_allow_gnu_extensions_p (parser
)
6480 && token
->type
== CPP_AND_AND
)
6484 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
6486 /* Consume the '&&' token. */
6487 cp_lexer_consume_token (parser
->lexer
);
6488 /* Look for the identifier. */
6489 identifier
= cp_parser_identifier (parser
);
6490 /* Create an expression representing the address. */
6491 expression
= finish_label_address_expr (identifier
, loc
);
6492 if (cp_parser_non_integral_constant_expression (parser
,
6494 expression
= error_mark_node
;
6498 if (unary_operator
!= ERROR_MARK
)
6500 tree cast_expression
;
6501 tree expression
= error_mark_node
;
6502 non_integral_constant non_constant_p
= NIC_NONE
;
6504 /* Consume the operator token. */
6505 token
= cp_lexer_consume_token (parser
->lexer
);
6506 /* Parse the cast-expression. */
6508 = cp_parser_cast_expression (parser
,
6509 unary_operator
== ADDR_EXPR
,
6510 /*cast_p=*/false, pidk
);
6511 /* Now, build an appropriate representation. */
6512 switch (unary_operator
)
6515 non_constant_p
= NIC_STAR
;
6516 expression
= build_x_indirect_ref (cast_expression
, RO_UNARY_STAR
,
6517 tf_warning_or_error
);
6521 non_constant_p
= NIC_ADDR
;
6524 expression
= build_x_unary_op (unary_operator
, cast_expression
,
6525 tf_warning_or_error
);
6528 case PREINCREMENT_EXPR
:
6529 case PREDECREMENT_EXPR
:
6530 non_constant_p
= unary_operator
== PREINCREMENT_EXPR
6531 ? NIC_PREINCREMENT
: NIC_PREDECREMENT
;
6533 case UNARY_PLUS_EXPR
:
6535 case TRUTH_NOT_EXPR
:
6536 expression
= finish_unary_op_expr (unary_operator
, cast_expression
);
6543 if (non_constant_p
!= NIC_NONE
6544 && cp_parser_non_integral_constant_expression (parser
,
6546 expression
= error_mark_node
;
6551 return cp_parser_postfix_expression (parser
, address_p
, cast_p
,
6552 /*member_access_only_p=*/false,
6556 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6557 unary-operator, the corresponding tree code is returned. */
6559 static enum tree_code
6560 cp_parser_unary_operator (cp_token
* token
)
6562 switch (token
->type
)
6565 return INDIRECT_REF
;
6571 return UNARY_PLUS_EXPR
;
6577 return TRUTH_NOT_EXPR
;
6580 return BIT_NOT_EXPR
;
6587 /* Parse a new-expression.
6590 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6591 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6593 Returns a representation of the expression. */
6596 cp_parser_new_expression (cp_parser
* parser
)
6598 bool global_scope_p
;
6599 VEC(tree
,gc
) *placement
;
6601 VEC(tree
,gc
) *initializer
;
6605 /* Look for the optional `::' operator. */
6607 = (cp_parser_global_scope_opt (parser
,
6608 /*current_scope_valid_p=*/false)
6610 /* Look for the `new' operator. */
6611 cp_parser_require_keyword (parser
, RID_NEW
, RT_NEW
);
6612 /* There's no easy way to tell a new-placement from the
6613 `( type-id )' construct. */
6614 cp_parser_parse_tentatively (parser
);
6615 /* Look for a new-placement. */
6616 placement
= cp_parser_new_placement (parser
);
6617 /* If that didn't work out, there's no new-placement. */
6618 if (!cp_parser_parse_definitely (parser
))
6620 if (placement
!= NULL
)
6621 release_tree_vector (placement
);
6625 /* If the next token is a `(', then we have a parenthesized
6627 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
6630 /* Consume the `('. */
6631 cp_lexer_consume_token (parser
->lexer
);
6632 /* Parse the type-id. */
6633 type
= cp_parser_type_id (parser
);
6634 /* Look for the closing `)'. */
6635 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6636 token
= cp_lexer_peek_token (parser
->lexer
);
6637 /* There should not be a direct-new-declarator in this production,
6638 but GCC used to allowed this, so we check and emit a sensible error
6639 message for this case. */
6640 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
6642 error_at (token
->location
,
6643 "array bound forbidden after parenthesized type-id");
6644 inform (token
->location
,
6645 "try removing the parentheses around the type-id");
6646 cp_parser_direct_new_declarator (parser
);
6650 /* Otherwise, there must be a new-type-id. */
6652 type
= cp_parser_new_type_id (parser
, &nelts
);
6654 /* If the next token is a `(' or '{', then we have a new-initializer. */
6655 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
6656 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
6657 initializer
= cp_parser_new_initializer (parser
);
6661 /* A new-expression may not appear in an integral constant
6663 if (cp_parser_non_integral_constant_expression (parser
, NIC_NEW
))
6664 ret
= error_mark_node
;
6667 /* Create a representation of the new-expression. */
6668 ret
= build_new (&placement
, type
, nelts
, &initializer
, global_scope_p
,
6669 tf_warning_or_error
);
6672 if (placement
!= NULL
)
6673 release_tree_vector (placement
);
6674 if (initializer
!= NULL
)
6675 release_tree_vector (initializer
);
6680 /* Parse a new-placement.
6685 Returns the same representation as for an expression-list. */
6687 static VEC(tree
,gc
) *
6688 cp_parser_new_placement (cp_parser
* parser
)
6690 VEC(tree
,gc
) *expression_list
;
6692 /* Parse the expression-list. */
6693 expression_list
= (cp_parser_parenthesized_expression_list
6694 (parser
, non_attr
, /*cast_p=*/false,
6695 /*allow_expansion_p=*/true,
6696 /*non_constant_p=*/NULL
));
6698 return expression_list
;
6701 /* Parse a new-type-id.
6704 type-specifier-seq new-declarator [opt]
6706 Returns the TYPE allocated. If the new-type-id indicates an array
6707 type, *NELTS is set to the number of elements in the last array
6708 bound; the TYPE will not include the last array bound. */
6711 cp_parser_new_type_id (cp_parser
* parser
, tree
*nelts
)
6713 cp_decl_specifier_seq type_specifier_seq
;
6714 cp_declarator
*new_declarator
;
6715 cp_declarator
*declarator
;
6716 cp_declarator
*outer_declarator
;
6717 const char *saved_message
;
6720 /* The type-specifier sequence must not contain type definitions.
6721 (It cannot contain declarations of new types either, but if they
6722 are not definitions we will catch that because they are not
6724 saved_message
= parser
->type_definition_forbidden_message
;
6725 parser
->type_definition_forbidden_message
6726 = G_("types may not be defined in a new-type-id");
6727 /* Parse the type-specifier-seq. */
6728 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
6729 /*is_trailing_return=*/false,
6730 &type_specifier_seq
);
6731 /* Restore the old message. */
6732 parser
->type_definition_forbidden_message
= saved_message
;
6733 /* Parse the new-declarator. */
6734 new_declarator
= cp_parser_new_declarator_opt (parser
);
6736 /* Determine the number of elements in the last array dimension, if
6739 /* Skip down to the last array dimension. */
6740 declarator
= new_declarator
;
6741 outer_declarator
= NULL
;
6742 while (declarator
&& (declarator
->kind
== cdk_pointer
6743 || declarator
->kind
== cdk_ptrmem
))
6745 outer_declarator
= declarator
;
6746 declarator
= declarator
->declarator
;
6749 && declarator
->kind
== cdk_array
6750 && declarator
->declarator
6751 && declarator
->declarator
->kind
== cdk_array
)
6753 outer_declarator
= declarator
;
6754 declarator
= declarator
->declarator
;
6757 if (declarator
&& declarator
->kind
== cdk_array
)
6759 *nelts
= declarator
->u
.array
.bounds
;
6760 if (*nelts
== error_mark_node
)
6761 *nelts
= integer_one_node
;
6763 if (outer_declarator
)
6764 outer_declarator
->declarator
= declarator
->declarator
;
6766 new_declarator
= NULL
;
6769 type
= groktypename (&type_specifier_seq
, new_declarator
, false);
6773 /* Parse an (optional) new-declarator.
6776 ptr-operator new-declarator [opt]
6777 direct-new-declarator
6779 Returns the declarator. */
6781 static cp_declarator
*
6782 cp_parser_new_declarator_opt (cp_parser
* parser
)
6784 enum tree_code code
;
6786 cp_cv_quals cv_quals
;
6788 /* We don't know if there's a ptr-operator next, or not. */
6789 cp_parser_parse_tentatively (parser
);
6790 /* Look for a ptr-operator. */
6791 code
= cp_parser_ptr_operator (parser
, &type
, &cv_quals
);
6792 /* If that worked, look for more new-declarators. */
6793 if (cp_parser_parse_definitely (parser
))
6795 cp_declarator
*declarator
;
6797 /* Parse another optional declarator. */
6798 declarator
= cp_parser_new_declarator_opt (parser
);
6800 return cp_parser_make_indirect_declarator
6801 (code
, type
, cv_quals
, declarator
);
6804 /* If the next token is a `[', there is a direct-new-declarator. */
6805 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
6806 return cp_parser_direct_new_declarator (parser
);
6811 /* Parse a direct-new-declarator.
6813 direct-new-declarator:
6815 direct-new-declarator [constant-expression]
6819 static cp_declarator
*
6820 cp_parser_direct_new_declarator (cp_parser
* parser
)
6822 cp_declarator
*declarator
= NULL
;
6828 /* Look for the opening `['. */
6829 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
6830 /* The first expression is not required to be constant. */
6833 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
6834 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
6835 /* The standard requires that the expression have integral
6836 type. DR 74 adds enumeration types. We believe that the
6837 real intent is that these expressions be handled like the
6838 expression in a `switch' condition, which also allows
6839 classes with a single conversion to integral or
6840 enumeration type. */
6841 if (!processing_template_decl
)
6844 = build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
6849 error_at (token
->location
,
6850 "expression in new-declarator must have integral "
6851 "or enumeration type");
6852 expression
= error_mark_node
;
6856 /* But all the other expressions must be. */
6859 = cp_parser_constant_expression (parser
,
6860 /*allow_non_constant=*/false,
6862 /* Look for the closing `]'. */
6863 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
6865 /* Add this bound to the declarator. */
6866 declarator
= make_array_declarator (declarator
, expression
);
6868 /* If the next token is not a `[', then there are no more
6870 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
6877 /* Parse a new-initializer.
6880 ( expression-list [opt] )
6883 Returns a representation of the expression-list. */
6885 static VEC(tree
,gc
) *
6886 cp_parser_new_initializer (cp_parser
* parser
)
6888 VEC(tree
,gc
) *expression_list
;
6890 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
6893 bool expr_non_constant_p
;
6894 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
6895 t
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
6896 CONSTRUCTOR_IS_DIRECT_INIT (t
) = 1;
6897 expression_list
= make_tree_vector_single (t
);
6900 expression_list
= (cp_parser_parenthesized_expression_list
6901 (parser
, non_attr
, /*cast_p=*/false,
6902 /*allow_expansion_p=*/true,
6903 /*non_constant_p=*/NULL
));
6905 return expression_list
;
6908 /* Parse a delete-expression.
6911 :: [opt] delete cast-expression
6912 :: [opt] delete [ ] cast-expression
6914 Returns a representation of the expression. */
6917 cp_parser_delete_expression (cp_parser
* parser
)
6919 bool global_scope_p
;
6923 /* Look for the optional `::' operator. */
6925 = (cp_parser_global_scope_opt (parser
,
6926 /*current_scope_valid_p=*/false)
6928 /* Look for the `delete' keyword. */
6929 cp_parser_require_keyword (parser
, RID_DELETE
, RT_DELETE
);
6930 /* See if the array syntax is in use. */
6931 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
6933 /* Consume the `[' token. */
6934 cp_lexer_consume_token (parser
->lexer
);
6935 /* Look for the `]' token. */
6936 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
6937 /* Remember that this is the `[]' construct. */
6943 /* Parse the cast-expression. */
6944 expression
= cp_parser_simple_cast_expression (parser
);
6946 /* A delete-expression may not appear in an integral constant
6948 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEL
))
6949 return error_mark_node
;
6951 return delete_sanity (expression
, NULL_TREE
, array_p
, global_scope_p
,
6952 tf_warning_or_error
);
6955 /* Returns true if TOKEN may start a cast-expression and false
6959 cp_parser_token_starts_cast_expression (cp_token
*token
)
6961 switch (token
->type
)
6967 case CPP_CLOSE_SQUARE
:
6968 case CPP_CLOSE_PAREN
:
6969 case CPP_CLOSE_BRACE
:
6973 case CPP_DEREF_STAR
:
6981 case CPP_GREATER_EQ
:
7001 /* '[' may start a primary-expression in obj-c++. */
7002 case CPP_OPEN_SQUARE
:
7003 return c_dialect_objc ();
7010 /* Parse a cast-expression.
7014 ( type-id ) cast-expression
7016 ADDRESS_P is true iff the unary-expression is appearing as the
7017 operand of the `&' operator. CAST_P is true if this expression is
7018 the target of a cast.
7020 Returns a representation of the expression. */
7023 cp_parser_cast_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
7026 /* If it's a `(', then we might be looking at a cast. */
7027 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
7029 tree type
= NULL_TREE
;
7030 tree expr
= NULL_TREE
;
7031 bool compound_literal_p
;
7032 const char *saved_message
;
7034 /* There's no way to know yet whether or not this is a cast.
7035 For example, `(int (3))' is a unary-expression, while `(int)
7036 3' is a cast. So, we resort to parsing tentatively. */
7037 cp_parser_parse_tentatively (parser
);
7038 /* Types may not be defined in a cast. */
7039 saved_message
= parser
->type_definition_forbidden_message
;
7040 parser
->type_definition_forbidden_message
7041 = G_("types may not be defined in casts");
7042 /* Consume the `('. */
7043 cp_lexer_consume_token (parser
->lexer
);
7044 /* A very tricky bit is that `(struct S) { 3 }' is a
7045 compound-literal (which we permit in C++ as an extension).
7046 But, that construct is not a cast-expression -- it is a
7047 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7048 is legal; if the compound-literal were a cast-expression,
7049 you'd need an extra set of parentheses.) But, if we parse
7050 the type-id, and it happens to be a class-specifier, then we
7051 will commit to the parse at that point, because we cannot
7052 undo the action that is done when creating a new class. So,
7053 then we cannot back up and do a postfix-expression.
7055 Therefore, we scan ahead to the closing `)', and check to see
7056 if the token after the `)' is a `{'. If so, we are not
7057 looking at a cast-expression.
7059 Save tokens so that we can put them back. */
7060 cp_lexer_save_tokens (parser
->lexer
);
7061 /* Skip tokens until the next token is a closing parenthesis.
7062 If we find the closing `)', and the next token is a `{', then
7063 we are looking at a compound-literal. */
7065 = (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
7066 /*consume_paren=*/true)
7067 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
));
7068 /* Roll back the tokens we skipped. */
7069 cp_lexer_rollback_tokens (parser
->lexer
);
7070 /* If we were looking at a compound-literal, simulate an error
7071 so that the call to cp_parser_parse_definitely below will
7073 if (compound_literal_p
)
7074 cp_parser_simulate_error (parser
);
7077 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
7078 parser
->in_type_id_in_expr_p
= true;
7079 /* Look for the type-id. */
7080 type
= cp_parser_type_id (parser
);
7081 /* Look for the closing `)'. */
7082 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7083 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
7086 /* Restore the saved message. */
7087 parser
->type_definition_forbidden_message
= saved_message
;
7089 /* At this point this can only be either a cast or a
7090 parenthesized ctor such as `(T ())' that looks like a cast to
7091 function returning T. */
7092 if (!cp_parser_error_occurred (parser
)
7093 && cp_parser_token_starts_cast_expression (cp_lexer_peek_token
7096 cp_parser_parse_definitely (parser
);
7097 expr
= cp_parser_cast_expression (parser
,
7098 /*address_p=*/false,
7099 /*cast_p=*/true, pidk
);
7101 /* Warn about old-style casts, if so requested. */
7102 if (warn_old_style_cast
7103 && !in_system_header
7104 && !VOID_TYPE_P (type
)
7105 && current_lang_name
!= lang_name_c
)
7106 warning (OPT_Wold_style_cast
, "use of old-style cast");
7108 /* Only type conversions to integral or enumeration types
7109 can be used in constant-expressions. */
7110 if (!cast_valid_in_integral_constant_expression_p (type
)
7111 && cp_parser_non_integral_constant_expression (parser
,
7113 return error_mark_node
;
7115 /* Perform the cast. */
7116 expr
= build_c_cast (input_location
, type
, expr
);
7120 cp_parser_abort_tentative_parse (parser
);
7123 /* If we get here, then it's not a cast, so it must be a
7124 unary-expression. */
7125 return cp_parser_unary_expression (parser
, address_p
, cast_p
, pidk
);
7128 /* Parse a binary expression of the general form:
7132 pm-expression .* cast-expression
7133 pm-expression ->* cast-expression
7135 multiplicative-expression:
7137 multiplicative-expression * pm-expression
7138 multiplicative-expression / pm-expression
7139 multiplicative-expression % pm-expression
7141 additive-expression:
7142 multiplicative-expression
7143 additive-expression + multiplicative-expression
7144 additive-expression - multiplicative-expression
7148 shift-expression << additive-expression
7149 shift-expression >> additive-expression
7151 relational-expression:
7153 relational-expression < shift-expression
7154 relational-expression > shift-expression
7155 relational-expression <= shift-expression
7156 relational-expression >= shift-expression
7160 relational-expression:
7161 relational-expression <? shift-expression
7162 relational-expression >? shift-expression
7164 equality-expression:
7165 relational-expression
7166 equality-expression == relational-expression
7167 equality-expression != relational-expression
7171 and-expression & equality-expression
7173 exclusive-or-expression:
7175 exclusive-or-expression ^ and-expression
7177 inclusive-or-expression:
7178 exclusive-or-expression
7179 inclusive-or-expression | exclusive-or-expression
7181 logical-and-expression:
7182 inclusive-or-expression
7183 logical-and-expression && inclusive-or-expression
7185 logical-or-expression:
7186 logical-and-expression
7187 logical-or-expression || logical-and-expression
7189 All these are implemented with a single function like:
7192 simple-cast-expression
7193 binary-expression <token> binary-expression
7195 CAST_P is true if this expression is the target of a cast.
7197 The binops_by_token map is used to get the tree codes for each <token> type.
7198 binary-expressions are associated according to a precedence table. */
7200 #define TOKEN_PRECEDENCE(token) \
7201 (((token->type == CPP_GREATER \
7202 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7203 && !parser->greater_than_is_operator_p) \
7204 ? PREC_NOT_OPERATOR \
7205 : binops_by_token[token->type].prec)
7208 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
,
7209 bool no_toplevel_fold_p
,
7210 enum cp_parser_prec prec
,
7213 cp_parser_expression_stack stack
;
7214 cp_parser_expression_stack_entry
*sp
= &stack
[0];
7217 enum tree_code tree_type
, lhs_type
, rhs_type
;
7218 enum cp_parser_prec new_prec
, lookahead_prec
;
7221 /* Parse the first expression. */
7222 lhs
= cp_parser_cast_expression (parser
, /*address_p=*/false, cast_p
, pidk
);
7223 lhs_type
= ERROR_MARK
;
7227 /* Get an operator token. */
7228 token
= cp_lexer_peek_token (parser
->lexer
);
7230 if (warn_cxx0x_compat
7231 && token
->type
== CPP_RSHIFT
7232 && !parser
->greater_than_is_operator_p
)
7234 if (warning_at (token
->location
, OPT_Wc__0x_compat
,
7235 "%<>>%> operator is treated as"
7236 " two right angle brackets in C++11"))
7237 inform (token
->location
,
7238 "suggest parentheses around %<>>%> expression");
7241 new_prec
= TOKEN_PRECEDENCE (token
);
7243 /* Popping an entry off the stack means we completed a subexpression:
7244 - either we found a token which is not an operator (`>' where it is not
7245 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7246 will happen repeatedly;
7247 - or, we found an operator which has lower priority. This is the case
7248 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7250 if (new_prec
<= prec
)
7259 tree_type
= binops_by_token
[token
->type
].tree_type
;
7261 /* We used the operator token. */
7262 cp_lexer_consume_token (parser
->lexer
);
7264 /* For "false && x" or "true || x", x will never be executed;
7265 disable warnings while evaluating it. */
7266 if (tree_type
== TRUTH_ANDIF_EXPR
)
7267 c_inhibit_evaluation_warnings
+= lhs
== truthvalue_false_node
;
7268 else if (tree_type
== TRUTH_ORIF_EXPR
)
7269 c_inhibit_evaluation_warnings
+= lhs
== truthvalue_true_node
;
7271 /* Extract another operand. It may be the RHS of this expression
7272 or the LHS of a new, higher priority expression. */
7273 rhs
= cp_parser_simple_cast_expression (parser
);
7274 rhs_type
= ERROR_MARK
;
7276 /* Get another operator token. Look up its precedence to avoid
7277 building a useless (immediately popped) stack entry for common
7278 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7279 token
= cp_lexer_peek_token (parser
->lexer
);
7280 lookahead_prec
= TOKEN_PRECEDENCE (token
);
7281 if (lookahead_prec
> new_prec
)
7283 /* ... and prepare to parse the RHS of the new, higher priority
7284 expression. Since precedence levels on the stack are
7285 monotonically increasing, we do not have to care about
7288 sp
->tree_type
= tree_type
;
7290 sp
->lhs_type
= lhs_type
;
7293 lhs_type
= rhs_type
;
7295 new_prec
= lookahead_prec
;
7299 lookahead_prec
= new_prec
;
7300 /* If the stack is not empty, we have parsed into LHS the right side
7301 (`4' in the example above) of an expression we had suspended.
7302 We can use the information on the stack to recover the LHS (`3')
7303 from the stack together with the tree code (`MULT_EXPR'), and
7304 the precedence of the higher level subexpression
7305 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7306 which will be used to actually build the additive expression. */
7309 tree_type
= sp
->tree_type
;
7311 rhs_type
= lhs_type
;
7313 lhs_type
= sp
->lhs_type
;
7316 /* Undo the disabling of warnings done above. */
7317 if (tree_type
== TRUTH_ANDIF_EXPR
)
7318 c_inhibit_evaluation_warnings
-= lhs
== truthvalue_false_node
;
7319 else if (tree_type
== TRUTH_ORIF_EXPR
)
7320 c_inhibit_evaluation_warnings
-= lhs
== truthvalue_true_node
;
7323 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7324 ERROR_MARK for everything that is not a binary expression.
7325 This makes warn_about_parentheses miss some warnings that
7326 involve unary operators. For unary expressions we should
7327 pass the correct tree_code unless the unary expression was
7328 surrounded by parentheses.
7330 if (no_toplevel_fold_p
7331 && lookahead_prec
<= prec
7333 && TREE_CODE_CLASS (tree_type
) == tcc_comparison
)
7334 lhs
= build2 (tree_type
, boolean_type_node
, lhs
, rhs
);
7336 lhs
= build_x_binary_op (tree_type
, lhs
, lhs_type
, rhs
, rhs_type
,
7337 &overload
, tf_warning_or_error
);
7338 lhs_type
= tree_type
;
7340 /* If the binary operator required the use of an overloaded operator,
7341 then this expression cannot be an integral constant-expression.
7342 An overloaded operator can be used even if both operands are
7343 otherwise permissible in an integral constant-expression if at
7344 least one of the operands is of enumeration type. */
7347 && cp_parser_non_integral_constant_expression (parser
,
7349 return error_mark_node
;
7356 /* Parse the `? expression : assignment-expression' part of a
7357 conditional-expression. The LOGICAL_OR_EXPR is the
7358 logical-or-expression that started the conditional-expression.
7359 Returns a representation of the entire conditional-expression.
7361 This routine is used by cp_parser_assignment_expression.
7363 ? expression : assignment-expression
7367 ? : assignment-expression */
7370 cp_parser_question_colon_clause (cp_parser
* parser
, tree logical_or_expr
)
7373 tree assignment_expr
;
7374 struct cp_token
*token
;
7376 /* Consume the `?' token. */
7377 cp_lexer_consume_token (parser
->lexer
);
7378 token
= cp_lexer_peek_token (parser
->lexer
);
7379 if (cp_parser_allow_gnu_extensions_p (parser
)
7380 && token
->type
== CPP_COLON
)
7382 pedwarn (token
->location
, OPT_pedantic
,
7383 "ISO C++ does not allow ?: with omitted middle operand");
7384 /* Implicit true clause. */
7386 c_inhibit_evaluation_warnings
+= logical_or_expr
== truthvalue_true_node
;
7387 warn_for_omitted_condop (token
->location
, logical_or_expr
);
7391 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
7392 parser
->colon_corrects_to_scope_p
= false;
7393 /* Parse the expression. */
7394 c_inhibit_evaluation_warnings
+= logical_or_expr
== truthvalue_false_node
;
7395 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
7396 c_inhibit_evaluation_warnings
+=
7397 ((logical_or_expr
== truthvalue_true_node
)
7398 - (logical_or_expr
== truthvalue_false_node
));
7399 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
7402 /* The next token should be a `:'. */
7403 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
7404 /* Parse the assignment-expression. */
7405 assignment_expr
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
7406 c_inhibit_evaluation_warnings
-= logical_or_expr
== truthvalue_true_node
;
7408 /* Build the conditional-expression. */
7409 return build_x_conditional_expr (logical_or_expr
,
7412 tf_warning_or_error
);
7415 /* Parse an assignment-expression.
7417 assignment-expression:
7418 conditional-expression
7419 logical-or-expression assignment-operator assignment_expression
7422 CAST_P is true if this expression is the target of a cast.
7424 Returns a representation for the expression. */
7427 cp_parser_assignment_expression (cp_parser
* parser
, bool cast_p
,
7432 /* If the next token is the `throw' keyword, then we're looking at
7433 a throw-expression. */
7434 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THROW
))
7435 expr
= cp_parser_throw_expression (parser
);
7436 /* Otherwise, it must be that we are looking at a
7437 logical-or-expression. */
7440 /* Parse the binary expressions (logical-or-expression). */
7441 expr
= cp_parser_binary_expression (parser
, cast_p
, false,
7442 PREC_NOT_OPERATOR
, pidk
);
7443 /* If the next token is a `?' then we're actually looking at a
7444 conditional-expression. */
7445 if (cp_lexer_next_token_is (parser
->lexer
, CPP_QUERY
))
7446 return cp_parser_question_colon_clause (parser
, expr
);
7449 enum tree_code assignment_operator
;
7451 /* If it's an assignment-operator, we're using the second
7454 = cp_parser_assignment_operator_opt (parser
);
7455 if (assignment_operator
!= ERROR_MARK
)
7457 bool non_constant_p
;
7459 /* Parse the right-hand side of the assignment. */
7460 tree rhs
= cp_parser_initializer_clause (parser
, &non_constant_p
);
7462 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
7463 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
7465 /* An assignment may not appear in a
7466 constant-expression. */
7467 if (cp_parser_non_integral_constant_expression (parser
,
7469 return error_mark_node
;
7470 /* Build the assignment expression. */
7471 expr
= build_x_modify_expr (expr
,
7472 assignment_operator
,
7474 tf_warning_or_error
);
7482 /* Parse an (optional) assignment-operator.
7484 assignment-operator: one of
7485 = *= /= %= += -= >>= <<= &= ^= |=
7489 assignment-operator: one of
7492 If the next token is an assignment operator, the corresponding tree
7493 code is returned, and the token is consumed. For example, for
7494 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7495 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7496 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7497 operator, ERROR_MARK is returned. */
7499 static enum tree_code
7500 cp_parser_assignment_operator_opt (cp_parser
* parser
)
7505 /* Peek at the next token. */
7506 token
= cp_lexer_peek_token (parser
->lexer
);
7508 switch (token
->type
)
7519 op
= TRUNC_DIV_EXPR
;
7523 op
= TRUNC_MOD_EXPR
;
7555 /* Nothing else is an assignment operator. */
7559 /* If it was an assignment operator, consume it. */
7560 if (op
!= ERROR_MARK
)
7561 cp_lexer_consume_token (parser
->lexer
);
7566 /* Parse an expression.
7569 assignment-expression
7570 expression , assignment-expression
7572 CAST_P is true if this expression is the target of a cast.
7574 Returns a representation of the expression. */
7577 cp_parser_expression (cp_parser
* parser
, bool cast_p
, cp_id_kind
* pidk
)
7579 tree expression
= NULL_TREE
;
7583 tree assignment_expression
;
7585 /* Parse the next assignment-expression. */
7586 assignment_expression
7587 = cp_parser_assignment_expression (parser
, cast_p
, pidk
);
7588 /* If this is the first assignment-expression, we can just
7591 expression
= assignment_expression
;
7593 expression
= build_x_compound_expr (expression
,
7594 assignment_expression
,
7595 tf_warning_or_error
);
7596 /* If the next token is not a comma, then we are done with the
7598 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
7600 /* Consume the `,'. */
7601 cp_lexer_consume_token (parser
->lexer
);
7602 /* A comma operator cannot appear in a constant-expression. */
7603 if (cp_parser_non_integral_constant_expression (parser
, NIC_COMMA
))
7604 expression
= error_mark_node
;
7610 /* Parse a constant-expression.
7612 constant-expression:
7613 conditional-expression
7615 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7616 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7617 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7618 is false, NON_CONSTANT_P should be NULL. */
7621 cp_parser_constant_expression (cp_parser
* parser
,
7622 bool allow_non_constant_p
,
7623 bool *non_constant_p
)
7625 bool saved_integral_constant_expression_p
;
7626 bool saved_allow_non_integral_constant_expression_p
;
7627 bool saved_non_integral_constant_expression_p
;
7630 /* It might seem that we could simply parse the
7631 conditional-expression, and then check to see if it were
7632 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7633 one that the compiler can figure out is constant, possibly after
7634 doing some simplifications or optimizations. The standard has a
7635 precise definition of constant-expression, and we must honor
7636 that, even though it is somewhat more restrictive.
7642 is not a legal declaration, because `(2, 3)' is not a
7643 constant-expression. The `,' operator is forbidden in a
7644 constant-expression. However, GCC's constant-folding machinery
7645 will fold this operation to an INTEGER_CST for `3'. */
7647 /* Save the old settings. */
7648 saved_integral_constant_expression_p
= parser
->integral_constant_expression_p
;
7649 saved_allow_non_integral_constant_expression_p
7650 = parser
->allow_non_integral_constant_expression_p
;
7651 saved_non_integral_constant_expression_p
= parser
->non_integral_constant_expression_p
;
7652 /* We are now parsing a constant-expression. */
7653 parser
->integral_constant_expression_p
= true;
7654 parser
->allow_non_integral_constant_expression_p
7655 = (allow_non_constant_p
|| cxx_dialect
>= cxx0x
);
7656 parser
->non_integral_constant_expression_p
= false;
7657 /* Although the grammar says "conditional-expression", we parse an
7658 "assignment-expression", which also permits "throw-expression"
7659 and the use of assignment operators. In the case that
7660 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7661 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7662 actually essential that we look for an assignment-expression.
7663 For example, cp_parser_initializer_clauses uses this function to
7664 determine whether a particular assignment-expression is in fact
7666 expression
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
7667 /* Restore the old settings. */
7668 parser
->integral_constant_expression_p
7669 = saved_integral_constant_expression_p
;
7670 parser
->allow_non_integral_constant_expression_p
7671 = saved_allow_non_integral_constant_expression_p
;
7672 if (cxx_dialect
>= cxx0x
)
7674 /* Require an rvalue constant expression here; that's what our
7675 callers expect. Reference constant expressions are handled
7676 separately in e.g. cp_parser_template_argument. */
7677 bool is_const
= potential_rvalue_constant_expression (expression
);
7678 parser
->non_integral_constant_expression_p
= !is_const
;
7679 if (!is_const
&& !allow_non_constant_p
)
7680 require_potential_rvalue_constant_expression (expression
);
7682 if (allow_non_constant_p
)
7683 *non_constant_p
= parser
->non_integral_constant_expression_p
;
7684 parser
->non_integral_constant_expression_p
7685 = saved_non_integral_constant_expression_p
;
7690 /* Parse __builtin_offsetof.
7692 offsetof-expression:
7693 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7695 offsetof-member-designator:
7697 | offsetof-member-designator "." id-expression
7698 | offsetof-member-designator "[" expression "]"
7699 | offsetof-member-designator "->" id-expression */
7702 cp_parser_builtin_offsetof (cp_parser
*parser
)
7704 int save_ice_p
, save_non_ice_p
;
7709 /* We're about to accept non-integral-constant things, but will
7710 definitely yield an integral constant expression. Save and
7711 restore these values around our local parsing. */
7712 save_ice_p
= parser
->integral_constant_expression_p
;
7713 save_non_ice_p
= parser
->non_integral_constant_expression_p
;
7715 /* Consume the "__builtin_offsetof" token. */
7716 cp_lexer_consume_token (parser
->lexer
);
7717 /* Consume the opening `('. */
7718 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
7719 /* Parse the type-id. */
7720 type
= cp_parser_type_id (parser
);
7721 /* Look for the `,'. */
7722 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
7723 token
= cp_lexer_peek_token (parser
->lexer
);
7725 /* Build the (type *)null that begins the traditional offsetof macro. */
7726 expr
= build_static_cast (build_pointer_type (type
), null_pointer_node
,
7727 tf_warning_or_error
);
7729 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7730 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DEREF
, expr
,
7731 true, &dummy
, token
->location
);
7734 token
= cp_lexer_peek_token (parser
->lexer
);
7735 switch (token
->type
)
7737 case CPP_OPEN_SQUARE
:
7738 /* offsetof-member-designator "[" expression "]" */
7739 expr
= cp_parser_postfix_open_square_expression (parser
, expr
, true);
7743 /* offsetof-member-designator "->" identifier */
7744 expr
= grok_array_decl (expr
, integer_zero_node
);
7748 /* offsetof-member-designator "." identifier */
7749 cp_lexer_consume_token (parser
->lexer
);
7750 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
,
7755 case CPP_CLOSE_PAREN
:
7756 /* Consume the ")" token. */
7757 cp_lexer_consume_token (parser
->lexer
);
7761 /* Error. We know the following require will fail, but
7762 that gives the proper error message. */
7763 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7764 cp_parser_skip_to_closing_parenthesis (parser
, true, false, true);
7765 expr
= error_mark_node
;
7771 /* If we're processing a template, we can't finish the semantics yet.
7772 Otherwise we can fold the entire expression now. */
7773 if (processing_template_decl
)
7774 expr
= build1 (OFFSETOF_EXPR
, size_type_node
, expr
);
7776 expr
= finish_offsetof (expr
);
7779 parser
->integral_constant_expression_p
= save_ice_p
;
7780 parser
->non_integral_constant_expression_p
= save_non_ice_p
;
7785 /* Parse a trait expression.
7787 Returns a representation of the expression, the underlying type
7788 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7791 cp_parser_trait_expr (cp_parser
* parser
, enum rid keyword
)
7794 tree type1
, type2
= NULL_TREE
;
7795 bool binary
= false;
7796 cp_decl_specifier_seq decl_specs
;
7800 case RID_HAS_NOTHROW_ASSIGN
:
7801 kind
= CPTK_HAS_NOTHROW_ASSIGN
;
7803 case RID_HAS_NOTHROW_CONSTRUCTOR
:
7804 kind
= CPTK_HAS_NOTHROW_CONSTRUCTOR
;
7806 case RID_HAS_NOTHROW_COPY
:
7807 kind
= CPTK_HAS_NOTHROW_COPY
;
7809 case RID_HAS_TRIVIAL_ASSIGN
:
7810 kind
= CPTK_HAS_TRIVIAL_ASSIGN
;
7812 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
7813 kind
= CPTK_HAS_TRIVIAL_CONSTRUCTOR
;
7815 case RID_HAS_TRIVIAL_COPY
:
7816 kind
= CPTK_HAS_TRIVIAL_COPY
;
7818 case RID_HAS_TRIVIAL_DESTRUCTOR
:
7819 kind
= CPTK_HAS_TRIVIAL_DESTRUCTOR
;
7821 case RID_HAS_VIRTUAL_DESTRUCTOR
:
7822 kind
= CPTK_HAS_VIRTUAL_DESTRUCTOR
;
7824 case RID_IS_ABSTRACT
:
7825 kind
= CPTK_IS_ABSTRACT
;
7827 case RID_IS_BASE_OF
:
7828 kind
= CPTK_IS_BASE_OF
;
7832 kind
= CPTK_IS_CLASS
;
7834 case RID_IS_CONVERTIBLE_TO
:
7835 kind
= CPTK_IS_CONVERTIBLE_TO
;
7839 kind
= CPTK_IS_EMPTY
;
7842 kind
= CPTK_IS_ENUM
;
7844 case RID_IS_LITERAL_TYPE
:
7845 kind
= CPTK_IS_LITERAL_TYPE
;
7850 case RID_IS_POLYMORPHIC
:
7851 kind
= CPTK_IS_POLYMORPHIC
;
7853 case RID_IS_STD_LAYOUT
:
7854 kind
= CPTK_IS_STD_LAYOUT
;
7856 case RID_IS_TRIVIAL
:
7857 kind
= CPTK_IS_TRIVIAL
;
7860 kind
= CPTK_IS_UNION
;
7862 case RID_UNDERLYING_TYPE
:
7863 kind
= CPTK_UNDERLYING_TYPE
;
7868 case RID_DIRECT_BASES
:
7869 kind
= CPTK_DIRECT_BASES
;
7875 /* Consume the token. */
7876 cp_lexer_consume_token (parser
->lexer
);
7878 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
7880 type1
= cp_parser_type_id (parser
);
7882 if (type1
== error_mark_node
)
7883 return error_mark_node
;
7885 /* Build a trivial decl-specifier-seq. */
7886 clear_decl_specs (&decl_specs
);
7887 decl_specs
.type
= type1
;
7889 /* Call grokdeclarator to figure out what type this is. */
7890 type1
= grokdeclarator (NULL
, &decl_specs
, TYPENAME
,
7891 /*initialized=*/0, /*attrlist=*/NULL
);
7895 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
7897 type2
= cp_parser_type_id (parser
);
7899 if (type2
== error_mark_node
)
7900 return error_mark_node
;
7902 /* Build a trivial decl-specifier-seq. */
7903 clear_decl_specs (&decl_specs
);
7904 decl_specs
.type
= type2
;
7906 /* Call grokdeclarator to figure out what type this is. */
7907 type2
= grokdeclarator (NULL
, &decl_specs
, TYPENAME
,
7908 /*initialized=*/0, /*attrlist=*/NULL
);
7911 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7913 /* Complete the trait expression, which may mean either processing
7914 the trait expr now or saving it for template instantiation. */
7917 case CPTK_UNDERLYING_TYPE
:
7918 return finish_underlying_type (type1
);
7920 return finish_bases (type1
, false);
7921 case CPTK_DIRECT_BASES
:
7922 return finish_bases (type1
, true);
7924 return finish_trait_expr (kind
, type1
, type2
);
7928 /* Lambdas that appear in variable initializer or default argument scope
7929 get that in their mangling, so we need to record it. We might as well
7930 use the count for function and namespace scopes as well. */
7931 static GTY(()) tree lambda_scope
;
7932 static GTY(()) int lambda_count
;
7933 typedef struct GTY(()) tree_int
7938 DEF_VEC_O(tree_int
);
7939 DEF_VEC_ALLOC_O(tree_int
,gc
);
7940 static GTY(()) VEC(tree_int
,gc
) *lambda_scope_stack
;
7943 start_lambda_scope (tree decl
)
7947 /* Once we're inside a function, we ignore other scopes and just push
7948 the function again so that popping works properly. */
7949 if (current_function_decl
&& TREE_CODE (decl
) != FUNCTION_DECL
)
7950 decl
= current_function_decl
;
7951 ti
.t
= lambda_scope
;
7952 ti
.i
= lambda_count
;
7953 VEC_safe_push (tree_int
, gc
, lambda_scope_stack
, &ti
);
7954 if (lambda_scope
!= decl
)
7956 /* Don't reset the count if we're still in the same function. */
7957 lambda_scope
= decl
;
7963 record_lambda_scope (tree lambda
)
7965 LAMBDA_EXPR_EXTRA_SCOPE (lambda
) = lambda_scope
;
7966 LAMBDA_EXPR_DISCRIMINATOR (lambda
) = lambda_count
++;
7970 finish_lambda_scope (void)
7972 tree_int
*p
= VEC_last (tree_int
, lambda_scope_stack
);
7973 if (lambda_scope
!= p
->t
)
7975 lambda_scope
= p
->t
;
7976 lambda_count
= p
->i
;
7978 VEC_pop (tree_int
, lambda_scope_stack
);
7981 /* Parse a lambda expression.
7984 lambda-introducer lambda-declarator [opt] compound-statement
7986 Returns a representation of the expression. */
7989 cp_parser_lambda_expression (cp_parser
* parser
)
7991 tree lambda_expr
= build_lambda_expr ();
7995 LAMBDA_EXPR_LOCATION (lambda_expr
)
7996 = cp_lexer_peek_token (parser
->lexer
)->location
;
7998 if (cp_unevaluated_operand
)
7999 error_at (LAMBDA_EXPR_LOCATION (lambda_expr
),
8000 "lambda-expression in unevaluated context");
8002 /* We may be in the middle of deferred access check. Disable
8004 push_deferring_access_checks (dk_no_deferred
);
8006 cp_parser_lambda_introducer (parser
, lambda_expr
);
8008 type
= begin_lambda_type (lambda_expr
);
8010 record_lambda_scope (lambda_expr
);
8012 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8013 determine_visibility (TYPE_NAME (type
));
8015 /* Now that we've started the type, add the capture fields for any
8016 explicit captures. */
8017 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
));
8020 /* Inside the class, surrounding template-parameter-lists do not apply. */
8021 unsigned int saved_num_template_parameter_lists
8022 = parser
->num_template_parameter_lists
;
8023 unsigned char in_statement
= parser
->in_statement
;
8024 bool in_switch_statement_p
= parser
->in_switch_statement_p
;
8026 parser
->num_template_parameter_lists
= 0;
8027 parser
->in_statement
= 0;
8028 parser
->in_switch_statement_p
= false;
8030 /* By virtue of defining a local class, a lambda expression has access to
8031 the private variables of enclosing classes. */
8033 ok
= cp_parser_lambda_declarator_opt (parser
, lambda_expr
);
8036 cp_parser_lambda_body (parser
, lambda_expr
);
8037 else if (cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
8038 cp_parser_skip_to_end_of_block_or_statement (parser
);
8040 /* The capture list was built up in reverse order; fix that now. */
8042 tree newlist
= NULL_TREE
;
8045 for (elt
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
8048 next
= TREE_CHAIN (elt
);
8049 TREE_CHAIN (elt
) = newlist
;
8052 LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
) = newlist
;
8056 maybe_add_lambda_conv_op (type
);
8058 type
= finish_struct (type
, /*attributes=*/NULL_TREE
);
8060 parser
->num_template_parameter_lists
= saved_num_template_parameter_lists
;
8061 parser
->in_statement
= in_statement
;
8062 parser
->in_switch_statement_p
= in_switch_statement_p
;
8065 pop_deferring_access_checks ();
8067 /* This field is only used during parsing of the lambda. */
8068 LAMBDA_EXPR_THIS_CAPTURE (lambda_expr
) = NULL_TREE
;
8070 /* This lambda shouldn't have any proxies left at this point. */
8071 gcc_assert (LAMBDA_EXPR_PENDING_PROXIES (lambda_expr
) == NULL
);
8072 /* And now that we're done, push proxies for an enclosing lambda. */
8073 insert_pending_capture_proxies ();
8076 return build_lambda_object (lambda_expr
);
8078 return error_mark_node
;
8081 /* Parse the beginning of a lambda expression.
8084 [ lambda-capture [opt] ]
8086 LAMBDA_EXPR is the current representation of the lambda expression. */
8089 cp_parser_lambda_introducer (cp_parser
* parser
, tree lambda_expr
)
8091 /* Need commas after the first capture. */
8094 /* Eat the leading `['. */
8095 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
8097 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8098 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
)
8099 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_NAME
)
8100 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_REFERENCE
;
8101 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
8102 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_COPY
;
8104 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) != CPLD_NONE
)
8106 cp_lexer_consume_token (parser
->lexer
);
8110 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_SQUARE
))
8112 cp_token
* capture_token
;
8114 tree capture_init_expr
;
8115 cp_id_kind idk
= CP_ID_KIND_NONE
;
8116 bool explicit_init_p
= false;
8118 enum capture_kind_type
8123 enum capture_kind_type capture_kind
= BY_COPY
;
8125 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
8127 error ("expected end of capture-list");
8134 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
8136 /* Possibly capture `this'. */
8137 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THIS
))
8139 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
8140 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_COPY
)
8141 pedwarn (loc
, 0, "explicit by-copy capture of %<this%> redundant "
8142 "with by-copy capture default");
8143 cp_lexer_consume_token (parser
->lexer
);
8144 add_capture (lambda_expr
,
8145 /*id=*/this_identifier
,
8146 /*initializer=*/finish_this_expr(),
8147 /*by_reference_p=*/false,
8152 /* Remember whether we want to capture as a reference or not. */
8153 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
))
8155 capture_kind
= BY_REFERENCE
;
8156 cp_lexer_consume_token (parser
->lexer
);
8159 /* Get the identifier. */
8160 capture_token
= cp_lexer_peek_token (parser
->lexer
);
8161 capture_id
= cp_parser_identifier (parser
);
8163 if (capture_id
== error_mark_node
)
8164 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8165 delimiters, but I modified this to stop on unnested ']' as well. It
8166 was already changed to stop on unnested '}', so the
8167 "closing_parenthesis" name is no more misleading with my change. */
8169 cp_parser_skip_to_closing_parenthesis (parser
,
8170 /*recovering=*/true,
8172 /*consume_paren=*/true);
8176 /* Find the initializer for this capture. */
8177 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
8179 /* An explicit expression exists. */
8180 cp_lexer_consume_token (parser
->lexer
);
8181 pedwarn (input_location
, OPT_pedantic
,
8182 "ISO C++ does not allow initializers "
8183 "in lambda expression capture lists");
8184 capture_init_expr
= cp_parser_assignment_expression (parser
,
8187 explicit_init_p
= true;
8191 const char* error_msg
;
8193 /* Turn the identifier into an id-expression. */
8195 = cp_parser_lookup_name
8199 /*is_template=*/false,
8200 /*is_namespace=*/false,
8201 /*check_dependency=*/true,
8202 /*ambiguous_decls=*/NULL
,
8203 capture_token
->location
);
8205 if (capture_init_expr
== error_mark_node
)
8207 unqualified_name_lookup_error (capture_id
);
8210 else if (DECL_P (capture_init_expr
)
8211 && (TREE_CODE (capture_init_expr
) != VAR_DECL
8212 && TREE_CODE (capture_init_expr
) != PARM_DECL
))
8214 error_at (capture_token
->location
,
8215 "capture of non-variable %qD ",
8217 inform (0, "%q+#D declared here", capture_init_expr
);
8220 if (TREE_CODE (capture_init_expr
) == VAR_DECL
8221 && decl_storage_duration (capture_init_expr
) != dk_auto
)
8223 pedwarn (capture_token
->location
, 0, "capture of variable "
8224 "%qD with non-automatic storage duration",
8226 inform (0, "%q+#D declared here", capture_init_expr
);
8231 = finish_id_expression
8236 /*integral_constant_expression_p=*/false,
8237 /*allow_non_integral_constant_expression_p=*/false,
8238 /*non_integral_constant_expression_p=*/NULL
,
8239 /*template_p=*/false,
8241 /*address_p=*/false,
8242 /*template_arg_p=*/false,
8244 capture_token
->location
);
8247 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) != CPLD_NONE
8248 && !explicit_init_p
)
8250 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_COPY
8251 && capture_kind
== BY_COPY
)
8252 pedwarn (capture_token
->location
, 0, "explicit by-copy capture "
8253 "of %qD redundant with by-copy capture default",
8255 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_REFERENCE
8256 && capture_kind
== BY_REFERENCE
)
8257 pedwarn (capture_token
->location
, 0, "explicit by-reference "
8258 "capture of %qD redundant with by-reference capture "
8259 "default", capture_id
);
8262 add_capture (lambda_expr
,
8265 /*by_reference_p=*/capture_kind
== BY_REFERENCE
,
8269 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
8272 /* Parse the (optional) middle of a lambda expression.
8275 ( parameter-declaration-clause [opt] )
8276 attribute-specifier [opt]
8278 exception-specification [opt]
8279 lambda-return-type-clause [opt]
8281 LAMBDA_EXPR is the current representation of the lambda expression. */
8284 cp_parser_lambda_declarator_opt (cp_parser
* parser
, tree lambda_expr
)
8286 /* 5.1.1.4 of the standard says:
8287 If a lambda-expression does not include a lambda-declarator, it is as if
8288 the lambda-declarator were ().
8289 This means an empty parameter list, no attributes, and no exception
8291 tree param_list
= void_list_node
;
8292 tree attributes
= NULL_TREE
;
8293 tree exception_spec
= NULL_TREE
;
8296 /* The lambda-declarator is optional, but must begin with an opening
8297 parenthesis if present. */
8298 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
8300 cp_lexer_consume_token (parser
->lexer
);
8302 begin_scope (sk_function_parms
, /*entity=*/NULL_TREE
);
8304 /* Parse parameters. */
8305 param_list
= cp_parser_parameter_declaration_clause (parser
);
8307 /* Default arguments shall not be specified in the
8308 parameter-declaration-clause of a lambda-declarator. */
8309 for (t
= param_list
; t
; t
= TREE_CHAIN (t
))
8310 if (TREE_PURPOSE (t
))
8311 pedwarn (DECL_SOURCE_LOCATION (TREE_VALUE (t
)), OPT_pedantic
,
8312 "default argument specified for lambda parameter");
8314 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
8316 attributes
= cp_parser_attributes_opt (parser
);
8318 /* Parse optional `mutable' keyword. */
8319 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_MUTABLE
))
8321 cp_lexer_consume_token (parser
->lexer
);
8322 LAMBDA_EXPR_MUTABLE_P (lambda_expr
) = 1;
8325 /* Parse optional exception specification. */
8326 exception_spec
= cp_parser_exception_specification_opt (parser
);
8328 /* Parse optional trailing return type. */
8329 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
8331 cp_lexer_consume_token (parser
->lexer
);
8332 LAMBDA_EXPR_RETURN_TYPE (lambda_expr
) = cp_parser_type_id (parser
);
8335 /* The function parameters must be in scope all the way until after the
8336 trailing-return-type in case of decltype. */
8337 for (t
= current_binding_level
->names
; t
; t
= DECL_CHAIN (t
))
8338 pop_binding (DECL_NAME (t
), t
);
8343 /* Create the function call operator.
8345 Messing with declarators like this is no uglier than building up the
8346 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8349 cp_decl_specifier_seq return_type_specs
;
8350 cp_declarator
* declarator
;
8355 clear_decl_specs (&return_type_specs
);
8356 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
8357 return_type_specs
.type
= LAMBDA_EXPR_RETURN_TYPE (lambda_expr
);
8359 /* Maybe we will deduce the return type later, but we can use void
8360 as a placeholder return type anyways. */
8361 return_type_specs
.type
= void_type_node
;
8363 p
= obstack_alloc (&declarator_obstack
, 0);
8365 declarator
= make_id_declarator (NULL_TREE
, ansi_opname (CALL_EXPR
),
8368 quals
= (LAMBDA_EXPR_MUTABLE_P (lambda_expr
)
8369 ? TYPE_UNQUALIFIED
: TYPE_QUAL_CONST
);
8370 declarator
= make_call_declarator (declarator
, param_list
, quals
,
8371 VIRT_SPEC_UNSPECIFIED
,
8373 /*late_return_type=*/NULL_TREE
);
8374 declarator
->id_loc
= LAMBDA_EXPR_LOCATION (lambda_expr
);
8376 fco
= grokmethod (&return_type_specs
,
8379 if (fco
!= error_mark_node
)
8381 DECL_INITIALIZED_IN_CLASS_P (fco
) = 1;
8382 DECL_ARTIFICIAL (fco
) = 1;
8383 /* Give the object parameter a different name. */
8384 DECL_NAME (DECL_ARGUMENTS (fco
)) = get_identifier ("__closure");
8387 finish_member_declaration (fco
);
8389 obstack_free (&declarator_obstack
, p
);
8391 return (fco
!= error_mark_node
);
8395 /* Parse the body of a lambda expression, which is simply
8399 but which requires special handling.
8400 LAMBDA_EXPR is the current representation of the lambda expression. */
8403 cp_parser_lambda_body (cp_parser
* parser
, tree lambda_expr
)
8405 bool nested
= (current_function_decl
!= NULL_TREE
);
8406 bool local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
8408 push_function_context ();
8410 /* Still increment function_depth so that we don't GC in the
8411 middle of an expression. */
8413 /* Clear this in case we're in the middle of a default argument. */
8414 parser
->local_variables_forbidden_p
= false;
8416 /* Finish the function call operator
8418 + late_parsing_for_member
8419 + function_definition_after_declarator
8420 + ctor_initializer_opt_and_function_body */
8422 tree fco
= lambda_function (lambda_expr
);
8428 /* Let the front end know that we are going to be defining this
8430 start_preparsed_function (fco
,
8432 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8434 start_lambda_scope (fco
);
8435 body
= begin_function_body ();
8437 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
8440 /* Push the proxies for any explicit captures. */
8441 for (cap
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
); cap
;
8442 cap
= TREE_CHAIN (cap
))
8443 build_capture_proxy (TREE_PURPOSE (cap
));
8445 compound_stmt
= begin_compound_stmt (0);
8447 /* 5.1.1.4 of the standard says:
8448 If a lambda-expression does not include a trailing-return-type, it
8449 is as if the trailing-return-type denotes the following type:
8450 * if the compound-statement is of the form
8451 { return attribute-specifier [opt] expression ; }
8452 the type of the returned expression after lvalue-to-rvalue
8453 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8454 (_conv.array_ 4.2), and function-to-pointer conversion
8456 * otherwise, void. */
8458 /* In a lambda that has neither a lambda-return-type-clause
8459 nor a deducible form, errors should be reported for return statements
8460 in the body. Since we used void as the placeholder return type, parsing
8461 the body as usual will give such desired behavior. */
8462 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr
)
8463 && cp_lexer_peek_nth_token (parser
->lexer
, 1)->keyword
== RID_RETURN
8464 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SEMICOLON
)
8466 tree expr
= NULL_TREE
;
8467 cp_id_kind idk
= CP_ID_KIND_NONE
;
8469 /* Parse tentatively in case there's more after the initial return
8471 cp_parser_parse_tentatively (parser
);
8473 cp_parser_require_keyword (parser
, RID_RETURN
, RT_RETURN
);
8475 expr
= cp_parser_expression (parser
, /*cast_p=*/false, &idk
);
8477 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
8478 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
8480 if (cp_parser_parse_definitely (parser
))
8482 apply_lambda_return_type (lambda_expr
, lambda_return_type (expr
));
8484 /* Will get error here if type not deduced yet. */
8485 finish_return_stmt (expr
);
8493 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
8494 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr
) = true;
8495 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
8496 cp_parser_label_declaration (parser
);
8497 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
8498 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
8499 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr
) = false;
8502 finish_compound_stmt (compound_stmt
);
8505 finish_function_body (body
);
8506 finish_lambda_scope ();
8508 /* Finish the function and generate code for it if necessary. */
8509 expand_or_defer_fn (finish_function (/*inline*/2));
8512 parser
->local_variables_forbidden_p
= local_variables_forbidden_p
;
8514 pop_function_context();
8519 /* Statements [gram.stmt.stmt] */
8521 /* Parse a statement.
8525 expression-statement
8530 declaration-statement
8538 IN_COMPOUND is true when the statement is nested inside a
8539 cp_parser_compound_statement; this matters for certain pragmas.
8541 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8542 is a (possibly labeled) if statement which is not enclosed in braces
8543 and has an else clause. This is used to implement -Wparentheses. */
8546 cp_parser_statement (cp_parser
* parser
, tree in_statement_expr
,
8547 bool in_compound
, bool *if_p
)
8551 location_t statement_location
;
8556 /* There is no statement yet. */
8557 statement
= NULL_TREE
;
8558 /* Peek at the next token. */
8559 token
= cp_lexer_peek_token (parser
->lexer
);
8560 /* Remember the location of the first token in the statement. */
8561 statement_location
= token
->location
;
8562 /* If this is a keyword, then that will often determine what kind of
8563 statement we have. */
8564 if (token
->type
== CPP_KEYWORD
)
8566 enum rid keyword
= token
->keyword
;
8572 /* Looks like a labeled-statement with a case label.
8573 Parse the label, and then use tail recursion to parse
8575 cp_parser_label_for_labeled_statement (parser
);
8580 statement
= cp_parser_selection_statement (parser
, if_p
);
8586 statement
= cp_parser_iteration_statement (parser
);
8593 statement
= cp_parser_jump_statement (parser
);
8596 /* Objective-C++ exception-handling constructs. */
8599 case RID_AT_FINALLY
:
8600 case RID_AT_SYNCHRONIZED
:
8602 statement
= cp_parser_objc_statement (parser
);
8606 statement
= cp_parser_try_block (parser
);
8610 /* This must be a namespace alias definition. */
8611 cp_parser_declaration_statement (parser
);
8614 case RID_TRANSACTION_ATOMIC
:
8615 case RID_TRANSACTION_RELAXED
:
8616 statement
= cp_parser_transaction (parser
, keyword
);
8618 case RID_TRANSACTION_CANCEL
:
8619 statement
= cp_parser_transaction_cancel (parser
);
8623 /* It might be a keyword like `int' that can start a
8624 declaration-statement. */
8628 else if (token
->type
== CPP_NAME
)
8630 /* If the next token is a `:', then we are looking at a
8631 labeled-statement. */
8632 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
8633 if (token
->type
== CPP_COLON
)
8635 /* Looks like a labeled-statement with an ordinary label.
8636 Parse the label, and then use tail recursion to parse
8638 cp_parser_label_for_labeled_statement (parser
);
8642 /* Anything that starts with a `{' must be a compound-statement. */
8643 else if (token
->type
== CPP_OPEN_BRACE
)
8644 statement
= cp_parser_compound_statement (parser
, NULL
, false, false);
8645 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8646 a statement all its own. */
8647 else if (token
->type
== CPP_PRAGMA
)
8649 /* Only certain OpenMP pragmas are attached to statements, and thus
8650 are considered statements themselves. All others are not. In
8651 the context of a compound, accept the pragma as a "statement" and
8652 return so that we can check for a close brace. Otherwise we
8653 require a real statement and must go back and read one. */
8655 cp_parser_pragma (parser
, pragma_compound
);
8656 else if (!cp_parser_pragma (parser
, pragma_stmt
))
8660 else if (token
->type
== CPP_EOF
)
8662 cp_parser_error (parser
, "expected statement");
8666 /* Everything else must be a declaration-statement or an
8667 expression-statement. Try for the declaration-statement
8668 first, unless we are looking at a `;', in which case we know that
8669 we have an expression-statement. */
8672 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
8674 cp_parser_parse_tentatively (parser
);
8675 /* Try to parse the declaration-statement. */
8676 cp_parser_declaration_statement (parser
);
8677 /* If that worked, we're done. */
8678 if (cp_parser_parse_definitely (parser
))
8681 /* Look for an expression-statement instead. */
8682 statement
= cp_parser_expression_statement (parser
, in_statement_expr
);
8685 /* Set the line number for the statement. */
8686 if (statement
&& STATEMENT_CODE_P (TREE_CODE (statement
)))
8687 SET_EXPR_LOCATION (statement
, statement_location
);
8690 /* Parse the label for a labeled-statement, i.e.
8693 case constant-expression :
8697 case constant-expression ... constant-expression : statement
8699 When a label is parsed without errors, the label is added to the
8700 parse tree by the finish_* functions, so this function doesn't
8701 have to return the label. */
8704 cp_parser_label_for_labeled_statement (cp_parser
* parser
)
8707 tree label
= NULL_TREE
;
8708 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
8710 /* The next token should be an identifier. */
8711 token
= cp_lexer_peek_token (parser
->lexer
);
8712 if (token
->type
!= CPP_NAME
8713 && token
->type
!= CPP_KEYWORD
)
8715 cp_parser_error (parser
, "expected labeled-statement");
8719 parser
->colon_corrects_to_scope_p
= false;
8720 switch (token
->keyword
)
8727 /* Consume the `case' token. */
8728 cp_lexer_consume_token (parser
->lexer
);
8729 /* Parse the constant-expression. */
8730 expr
= cp_parser_constant_expression (parser
,
8731 /*allow_non_constant_p=*/false,
8734 ellipsis
= cp_lexer_peek_token (parser
->lexer
);
8735 if (ellipsis
->type
== CPP_ELLIPSIS
)
8737 /* Consume the `...' token. */
8738 cp_lexer_consume_token (parser
->lexer
);
8740 cp_parser_constant_expression (parser
,
8741 /*allow_non_constant_p=*/false,
8743 /* We don't need to emit warnings here, as the common code
8744 will do this for us. */
8747 expr_hi
= NULL_TREE
;
8749 if (parser
->in_switch_statement_p
)
8750 finish_case_label (token
->location
, expr
, expr_hi
);
8752 error_at (token
->location
,
8753 "case label %qE not within a switch statement",
8759 /* Consume the `default' token. */
8760 cp_lexer_consume_token (parser
->lexer
);
8762 if (parser
->in_switch_statement_p
)
8763 finish_case_label (token
->location
, NULL_TREE
, NULL_TREE
);
8765 error_at (token
->location
, "case label not within a switch statement");
8769 /* Anything else must be an ordinary label. */
8770 label
= finish_label_stmt (cp_parser_identifier (parser
));
8774 /* Require the `:' token. */
8775 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
8777 /* An ordinary label may optionally be followed by attributes.
8778 However, this is only permitted if the attributes are then
8779 followed by a semicolon. This is because, for backward
8780 compatibility, when parsing
8781 lab: __attribute__ ((unused)) int i;
8782 we want the attribute to attach to "i", not "lab". */
8783 if (label
!= NULL_TREE
8784 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
8788 cp_parser_parse_tentatively (parser
);
8789 attrs
= cp_parser_attributes_opt (parser
);
8790 if (attrs
== NULL_TREE
8791 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
8792 cp_parser_abort_tentative_parse (parser
);
8793 else if (!cp_parser_parse_definitely (parser
))
8796 cplus_decl_attributes (&label
, attrs
, 0);
8799 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
8802 /* Parse an expression-statement.
8804 expression-statement:
8807 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8808 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8809 indicates whether this expression-statement is part of an
8810 expression statement. */
8813 cp_parser_expression_statement (cp_parser
* parser
, tree in_statement_expr
)
8815 tree statement
= NULL_TREE
;
8816 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8818 /* If the next token is a ';', then there is no expression
8820 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
8821 statement
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
8823 /* Give a helpful message for "A<T>::type t;" and the like. */
8824 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
8825 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
8827 if (TREE_CODE (statement
) == SCOPE_REF
)
8828 error_at (token
->location
, "need %<typename%> before %qE because "
8829 "%qT is a dependent scope",
8830 statement
, TREE_OPERAND (statement
, 0));
8831 else if (is_overloaded_fn (statement
)
8832 && DECL_CONSTRUCTOR_P (get_first_fn (statement
)))
8835 tree fn
= get_first_fn (statement
);
8836 error_at (token
->location
,
8837 "%<%T::%D%> names the constructor, not the type",
8838 DECL_CONTEXT (fn
), DECL_NAME (fn
));
8842 /* Consume the final `;'. */
8843 cp_parser_consume_semicolon_at_end_of_statement (parser
);
8845 if (in_statement_expr
8846 && cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
8847 /* This is the final expression statement of a statement
8849 statement
= finish_stmt_expr_expr (statement
, in_statement_expr
);
8851 statement
= finish_expr_stmt (statement
);
8858 /* Parse a compound-statement.
8861 { statement-seq [opt] }
8866 { label-declaration-seq [opt] statement-seq [opt] }
8868 label-declaration-seq:
8870 label-declaration-seq label-declaration
8872 Returns a tree representing the statement. */
8875 cp_parser_compound_statement (cp_parser
*parser
, tree in_statement_expr
,
8876 bool in_try
, bool function_body
)
8880 /* Consume the `{'. */
8881 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
8882 return error_mark_node
;
8883 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl
)
8885 pedwarn (input_location
, OPT_pedantic
,
8886 "compound-statement in constexpr function");
8887 /* Begin the compound-statement. */
8888 compound_stmt
= begin_compound_stmt (in_try
? BCS_TRY_BLOCK
: 0);
8889 /* If the next keyword is `__label__' we have a label declaration. */
8890 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
8891 cp_parser_label_declaration (parser
);
8892 /* Parse an (optional) statement-seq. */
8893 cp_parser_statement_seq_opt (parser
, in_statement_expr
);
8894 /* Finish the compound-statement. */
8895 finish_compound_stmt (compound_stmt
);
8896 /* Consume the `}'. */
8897 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
8899 return compound_stmt
;
8902 /* Parse an (optional) statement-seq.
8906 statement-seq [opt] statement */
8909 cp_parser_statement_seq_opt (cp_parser
* parser
, tree in_statement_expr
)
8911 /* Scan statements until there aren't any more. */
8914 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8916 /* If we are looking at a `}', then we have run out of
8917 statements; the same is true if we have reached the end
8918 of file, or have stumbled upon a stray '@end'. */
8919 if (token
->type
== CPP_CLOSE_BRACE
8920 || token
->type
== CPP_EOF
8921 || token
->type
== CPP_PRAGMA_EOL
8922 || (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_AT_END
))
8925 /* If we are in a compound statement and find 'else' then
8926 something went wrong. */
8927 else if (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ELSE
)
8929 if (parser
->in_statement
& IN_IF_STMT
)
8933 token
= cp_lexer_consume_token (parser
->lexer
);
8934 error_at (token
->location
, "%<else%> without a previous %<if%>");
8938 /* Parse the statement. */
8939 cp_parser_statement (parser
, in_statement_expr
, true, NULL
);
8943 /* Parse a selection-statement.
8945 selection-statement:
8946 if ( condition ) statement
8947 if ( condition ) statement else statement
8948 switch ( condition ) statement
8950 Returns the new IF_STMT or SWITCH_STMT.
8952 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8953 is a (possibly labeled) if statement which is not enclosed in
8954 braces and has an else clause. This is used to implement
8958 cp_parser_selection_statement (cp_parser
* parser
, bool *if_p
)
8966 /* Peek at the next token. */
8967 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_SELECT
);
8969 /* See what kind of keyword it is. */
8970 keyword
= token
->keyword
;
8979 /* Look for the `('. */
8980 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
8982 cp_parser_skip_to_end_of_statement (parser
);
8983 return error_mark_node
;
8986 /* Begin the selection-statement. */
8987 if (keyword
== RID_IF
)
8988 statement
= begin_if_stmt ();
8990 statement
= begin_switch_stmt ();
8992 /* Parse the condition. */
8993 condition
= cp_parser_condition (parser
);
8994 /* Look for the `)'. */
8995 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
8996 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
8997 /*consume_paren=*/true);
8999 if (keyword
== RID_IF
)
9002 unsigned char in_statement
;
9004 /* Add the condition. */
9005 finish_if_stmt_cond (condition
, statement
);
9007 /* Parse the then-clause. */
9008 in_statement
= parser
->in_statement
;
9009 parser
->in_statement
|= IN_IF_STMT
;
9010 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
9012 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9013 add_stmt (build_empty_stmt (loc
));
9014 cp_lexer_consume_token (parser
->lexer
);
9015 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ELSE
))
9016 warning_at (loc
, OPT_Wempty_body
, "suggest braces around "
9017 "empty body in an %<if%> statement");
9021 cp_parser_implicitly_scoped_statement (parser
, &nested_if
);
9022 parser
->in_statement
= in_statement
;
9024 finish_then_clause (statement
);
9026 /* If the next token is `else', parse the else-clause. */
9027 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
9030 /* Consume the `else' keyword. */
9031 cp_lexer_consume_token (parser
->lexer
);
9032 begin_else_clause (statement
);
9033 /* Parse the else-clause. */
9034 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
9037 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9039 OPT_Wempty_body
, "suggest braces around "
9040 "empty body in an %<else%> statement");
9041 add_stmt (build_empty_stmt (loc
));
9042 cp_lexer_consume_token (parser
->lexer
);
9045 cp_parser_implicitly_scoped_statement (parser
, NULL
);
9047 finish_else_clause (statement
);
9049 /* If we are currently parsing a then-clause, then
9050 IF_P will not be NULL. We set it to true to
9051 indicate that this if statement has an else clause.
9052 This may trigger the Wparentheses warning below
9053 when we get back up to the parent if statement. */
9059 /* This if statement does not have an else clause. If
9060 NESTED_IF is true, then the then-clause is an if
9061 statement which does have an else clause. We warn
9062 about the potential ambiguity. */
9064 warning_at (EXPR_LOCATION (statement
), OPT_Wparentheses
,
9065 "suggest explicit braces to avoid ambiguous"
9069 /* Now we're all done with the if-statement. */
9070 finish_if_stmt (statement
);
9074 bool in_switch_statement_p
;
9075 unsigned char in_statement
;
9077 /* Add the condition. */
9078 finish_switch_cond (condition
, statement
);
9080 /* Parse the body of the switch-statement. */
9081 in_switch_statement_p
= parser
->in_switch_statement_p
;
9082 in_statement
= parser
->in_statement
;
9083 parser
->in_switch_statement_p
= true;
9084 parser
->in_statement
|= IN_SWITCH_STMT
;
9085 cp_parser_implicitly_scoped_statement (parser
, NULL
);
9086 parser
->in_switch_statement_p
= in_switch_statement_p
;
9087 parser
->in_statement
= in_statement
;
9089 /* Now we're all done with the switch-statement. */
9090 finish_switch_stmt (statement
);
9098 cp_parser_error (parser
, "expected selection-statement");
9099 return error_mark_node
;
9103 /* Parse a condition.
9107 type-specifier-seq declarator = initializer-clause
9108 type-specifier-seq declarator braced-init-list
9113 type-specifier-seq declarator asm-specification [opt]
9114 attributes [opt] = assignment-expression
9116 Returns the expression that should be tested. */
9119 cp_parser_condition (cp_parser
* parser
)
9121 cp_decl_specifier_seq type_specifiers
;
9122 const char *saved_message
;
9123 int declares_class_or_enum
;
9125 /* Try the declaration first. */
9126 cp_parser_parse_tentatively (parser
);
9127 /* New types are not allowed in the type-specifier-seq for a
9129 saved_message
= parser
->type_definition_forbidden_message
;
9130 parser
->type_definition_forbidden_message
9131 = G_("types may not be defined in conditions");
9132 /* Parse the type-specifier-seq. */
9133 cp_parser_decl_specifier_seq (parser
,
9134 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
,
9136 &declares_class_or_enum
);
9137 /* Restore the saved message. */
9138 parser
->type_definition_forbidden_message
= saved_message
;
9139 /* If all is well, we might be looking at a declaration. */
9140 if (!cp_parser_error_occurred (parser
))
9143 tree asm_specification
;
9145 cp_declarator
*declarator
;
9146 tree initializer
= NULL_TREE
;
9148 /* Parse the declarator. */
9149 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
9150 /*ctor_dtor_or_conv_p=*/NULL
,
9151 /*parenthesized_p=*/NULL
,
9152 /*member_p=*/false);
9153 /* Parse the attributes. */
9154 attributes
= cp_parser_attributes_opt (parser
);
9155 /* Parse the asm-specification. */
9156 asm_specification
= cp_parser_asm_specification_opt (parser
);
9157 /* If the next token is not an `=' or '{', then we might still be
9158 looking at an expression. For example:
9162 looks like a decl-specifier-seq and a declarator -- but then
9163 there is no `=', so this is an expression. */
9164 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
9165 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
9166 cp_parser_simulate_error (parser
);
9168 /* If we did see an `=' or '{', then we are looking at a declaration
9170 if (cp_parser_parse_definitely (parser
))
9173 bool non_constant_p
;
9174 bool flags
= LOOKUP_ONLYCONVERTING
;
9176 /* Create the declaration. */
9177 decl
= start_decl (declarator
, &type_specifiers
,
9178 /*initialized_p=*/true,
9179 attributes
, /*prefix_attributes=*/NULL_TREE
,
9182 /* Parse the initializer. */
9183 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9185 initializer
= cp_parser_braced_list (parser
, &non_constant_p
);
9186 CONSTRUCTOR_IS_DIRECT_INIT (initializer
) = 1;
9191 /* Consume the `='. */
9192 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
9193 initializer
= cp_parser_initializer_clause (parser
, &non_constant_p
);
9195 if (BRACE_ENCLOSED_INITIALIZER_P (initializer
))
9196 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
9198 /* Process the initializer. */
9199 cp_finish_decl (decl
,
9200 initializer
, !non_constant_p
,
9205 pop_scope (pushed_scope
);
9207 return convert_from_reference (decl
);
9210 /* If we didn't even get past the declarator successfully, we are
9211 definitely not looking at a declaration. */
9213 cp_parser_abort_tentative_parse (parser
);
9215 /* Otherwise, we are looking at an expression. */
9216 return cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
9219 /* Parses a for-statement or range-for-statement until the closing ')',
9223 cp_parser_for (cp_parser
*parser
)
9225 tree init
, scope
, decl
;
9228 /* Begin the for-statement. */
9229 scope
= begin_for_scope (&init
);
9231 /* Parse the initialization. */
9232 is_range_for
= cp_parser_for_init_statement (parser
, &decl
);
9235 return cp_parser_range_for (parser
, scope
, init
, decl
);
9237 return cp_parser_c_for (parser
, scope
, init
);
9241 cp_parser_c_for (cp_parser
*parser
, tree scope
, tree init
)
9243 /* Normal for loop */
9244 tree condition
= NULL_TREE
;
9245 tree expression
= NULL_TREE
;
9248 stmt
= begin_for_stmt (scope
, init
);
9249 /* The for-init-statement has already been parsed in
9250 cp_parser_for_init_statement, so no work is needed here. */
9251 finish_for_init_stmt (stmt
);
9253 /* If there's a condition, process it. */
9254 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
9255 condition
= cp_parser_condition (parser
);
9256 finish_for_cond (condition
, stmt
);
9257 /* Look for the `;'. */
9258 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9260 /* If there's an expression, process it. */
9261 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
9262 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
9263 finish_for_expr (expression
, stmt
);
9268 /* Tries to parse a range-based for-statement:
9271 decl-specifier-seq declarator : expression
9273 The decl-specifier-seq declarator and the `:' are already parsed by
9274 cp_parser_for_init_statement. If processing_template_decl it returns a
9275 newly created RANGE_FOR_STMT; if not, it is converted to a
9276 regular FOR_STMT. */
9279 cp_parser_range_for (cp_parser
*parser
, tree scope
, tree init
, tree range_decl
)
9281 tree stmt
, range_expr
;
9283 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9285 bool expr_non_constant_p
;
9286 range_expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
9289 range_expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
9291 /* If in template, STMT is converted to a normal for-statement
9292 at instantiation. If not, it is done just ahead. */
9293 if (processing_template_decl
)
9295 if (check_for_bare_parameter_packs (range_expr
))
9296 range_expr
= error_mark_node
;
9297 stmt
= begin_range_for_stmt (scope
, init
);
9298 finish_range_for_decl (stmt
, range_decl
, range_expr
);
9299 if (!type_dependent_expression_p (range_expr
)
9300 /* do_auto_deduction doesn't mess with template init-lists. */
9301 && !BRACE_ENCLOSED_INITIALIZER_P (range_expr
))
9302 do_range_for_auto_deduction (range_decl
, range_expr
);
9306 stmt
= begin_for_stmt (scope
, init
);
9307 stmt
= cp_convert_range_for (stmt
, range_decl
, range_expr
);
9312 /* Subroutine of cp_convert_range_for: given the initializer expression,
9313 builds up the range temporary. */
9316 build_range_temp (tree range_expr
)
9318 tree range_type
, range_temp
;
9320 /* Find out the type deduced by the declaration
9321 `auto &&__range = range_expr'. */
9322 range_type
= cp_build_reference_type (make_auto (), true);
9323 range_type
= do_auto_deduction (range_type
, range_expr
,
9324 type_uses_auto (range_type
));
9326 /* Create the __range variable. */
9327 range_temp
= build_decl (input_location
, VAR_DECL
,
9328 get_identifier ("__for_range"), range_type
);
9329 TREE_USED (range_temp
) = 1;
9330 DECL_ARTIFICIAL (range_temp
) = 1;
9335 /* Used by cp_parser_range_for in template context: we aren't going to
9336 do a full conversion yet, but we still need to resolve auto in the
9337 type of the for-range-declaration if present. This is basically
9338 a shortcut version of cp_convert_range_for. */
9341 do_range_for_auto_deduction (tree decl
, tree range_expr
)
9343 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
9346 tree begin_dummy
, end_dummy
, range_temp
, iter_type
, iter_decl
;
9347 range_temp
= convert_from_reference (build_range_temp (range_expr
));
9348 iter_type
= (cp_parser_perform_range_for_lookup
9349 (range_temp
, &begin_dummy
, &end_dummy
));
9350 iter_decl
= build_decl (input_location
, VAR_DECL
, NULL_TREE
, iter_type
);
9351 iter_decl
= build_x_indirect_ref (iter_decl
, RO_NULL
,
9352 tf_warning_or_error
);
9353 TREE_TYPE (decl
) = do_auto_deduction (TREE_TYPE (decl
),
9354 iter_decl
, auto_node
);
9358 /* Converts a range-based for-statement into a normal
9359 for-statement, as per the definition.
9361 for (RANGE_DECL : RANGE_EXPR)
9364 should be equivalent to:
9367 auto &&__range = RANGE_EXPR;
9368 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9372 RANGE_DECL = *__begin;
9377 If RANGE_EXPR is an array:
9378 BEGIN_EXPR = __range
9379 END_EXPR = __range + ARRAY_SIZE(__range)
9380 Else if RANGE_EXPR has a member 'begin' or 'end':
9381 BEGIN_EXPR = __range.begin()
9382 END_EXPR = __range.end()
9384 BEGIN_EXPR = begin(__range)
9385 END_EXPR = end(__range);
9387 If __range has a member 'begin' but not 'end', or vice versa, we must
9388 still use the second alternative (it will surely fail, however).
9389 When calling begin()/end() in the third alternative we must use
9390 argument dependent lookup, but always considering 'std' as an associated
9394 cp_convert_range_for (tree statement
, tree range_decl
, tree range_expr
)
9397 tree iter_type
, begin_expr
, end_expr
;
9398 tree condition
, expression
;
9400 if (range_decl
== error_mark_node
|| range_expr
== error_mark_node
)
9401 /* If an error happened previously do nothing or else a lot of
9402 unhelpful errors would be issued. */
9403 begin_expr
= end_expr
= iter_type
= error_mark_node
;
9406 tree range_temp
= build_range_temp (range_expr
);
9407 pushdecl (range_temp
);
9408 cp_finish_decl (range_temp
, range_expr
,
9409 /*is_constant_init*/false, NULL_TREE
,
9410 LOOKUP_ONLYCONVERTING
);
9412 range_temp
= convert_from_reference (range_temp
);
9413 iter_type
= cp_parser_perform_range_for_lookup (range_temp
,
9414 &begin_expr
, &end_expr
);
9417 /* The new for initialization statement. */
9418 begin
= build_decl (input_location
, VAR_DECL
,
9419 get_identifier ("__for_begin"), iter_type
);
9420 TREE_USED (begin
) = 1;
9421 DECL_ARTIFICIAL (begin
) = 1;
9423 cp_finish_decl (begin
, begin_expr
,
9424 /*is_constant_init*/false, NULL_TREE
,
9425 LOOKUP_ONLYCONVERTING
);
9427 end
= build_decl (input_location
, VAR_DECL
,
9428 get_identifier ("__for_end"), iter_type
);
9429 TREE_USED (end
) = 1;
9430 DECL_ARTIFICIAL (end
) = 1;
9432 cp_finish_decl (end
, end_expr
,
9433 /*is_constant_init*/false, NULL_TREE
,
9434 LOOKUP_ONLYCONVERTING
);
9436 finish_for_init_stmt (statement
);
9438 /* The new for condition. */
9439 condition
= build_x_binary_op (NE_EXPR
,
9442 NULL
, tf_warning_or_error
);
9443 finish_for_cond (condition
, statement
);
9445 /* The new increment expression. */
9446 expression
= finish_unary_op_expr (PREINCREMENT_EXPR
, begin
);
9447 finish_for_expr (expression
, statement
);
9449 /* The declaration is initialized with *__begin inside the loop body. */
9450 cp_finish_decl (range_decl
,
9451 build_x_indirect_ref (begin
, RO_NULL
, tf_warning_or_error
),
9452 /*is_constant_init*/false, NULL_TREE
,
9453 LOOKUP_ONLYCONVERTING
);
9458 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9459 We need to solve both at the same time because the method used
9460 depends on the existence of members begin or end.
9461 Returns the type deduced for the iterator expression. */
9464 cp_parser_perform_range_for_lookup (tree range
, tree
*begin
, tree
*end
)
9466 if (error_operand_p (range
))
9468 *begin
= *end
= error_mark_node
;
9469 return error_mark_node
;
9472 if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (range
))))
9474 error ("range-based %<for%> expression of type %qT "
9475 "has incomplete type", TREE_TYPE (range
));
9476 *begin
= *end
= error_mark_node
;
9477 return error_mark_node
;
9479 if (TREE_CODE (TREE_TYPE (range
)) == ARRAY_TYPE
)
9481 /* If RANGE is an array, we will use pointer arithmetic. */
9483 *end
= build_binary_op (input_location
, PLUS_EXPR
,
9485 array_type_nelts_top (TREE_TYPE (range
)),
9487 return build_pointer_type (TREE_TYPE (TREE_TYPE (range
)));
9491 /* If it is not an array, we must do a bit of magic. */
9492 tree id_begin
, id_end
;
9493 tree member_begin
, member_end
;
9495 *begin
= *end
= error_mark_node
;
9497 id_begin
= get_identifier ("begin");
9498 id_end
= get_identifier ("end");
9499 member_begin
= lookup_member (TREE_TYPE (range
), id_begin
,
9500 /*protect=*/2, /*want_type=*/false,
9501 tf_warning_or_error
);
9502 member_end
= lookup_member (TREE_TYPE (range
), id_end
,
9503 /*protect=*/2, /*want_type=*/false,
9504 tf_warning_or_error
);
9506 if (member_begin
!= NULL_TREE
|| member_end
!= NULL_TREE
)
9508 /* Use the member functions. */
9509 if (member_begin
!= NULL_TREE
)
9510 *begin
= cp_parser_range_for_member_function (range
, id_begin
);
9512 error ("range-based %<for%> expression of type %qT has an "
9513 "%<end%> member but not a %<begin%>", TREE_TYPE (range
));
9515 if (member_end
!= NULL_TREE
)
9516 *end
= cp_parser_range_for_member_function (range
, id_end
);
9518 error ("range-based %<for%> expression of type %qT has a "
9519 "%<begin%> member but not an %<end%>", TREE_TYPE (range
));
9523 /* Use global functions with ADL. */
9525 vec
= make_tree_vector ();
9527 VEC_safe_push (tree
, gc
, vec
, range
);
9529 member_begin
= perform_koenig_lookup (id_begin
, vec
,
9530 /*include_std=*/true,
9531 tf_warning_or_error
);
9532 *begin
= finish_call_expr (member_begin
, &vec
, false, true,
9533 tf_warning_or_error
);
9534 member_end
= perform_koenig_lookup (id_end
, vec
,
9535 /*include_std=*/true,
9536 tf_warning_or_error
);
9537 *end
= finish_call_expr (member_end
, &vec
, false, true,
9538 tf_warning_or_error
);
9540 release_tree_vector (vec
);
9543 /* Last common checks. */
9544 if (*begin
== error_mark_node
|| *end
== error_mark_node
)
9546 /* If one of the expressions is an error do no more checks. */
9547 *begin
= *end
= error_mark_node
;
9548 return error_mark_node
;
9552 tree iter_type
= cv_unqualified (TREE_TYPE (*begin
));
9553 /* The unqualified type of the __begin and __end temporaries should
9554 be the same, as required by the multiple auto declaration. */
9555 if (!same_type_p (iter_type
, cv_unqualified (TREE_TYPE (*end
))))
9556 error ("inconsistent begin/end types in range-based %<for%> "
9557 "statement: %qT and %qT",
9558 TREE_TYPE (*begin
), TREE_TYPE (*end
));
9564 /* Helper function for cp_parser_perform_range_for_lookup.
9565 Builds a tree for RANGE.IDENTIFIER(). */
9568 cp_parser_range_for_member_function (tree range
, tree identifier
)
9573 member
= finish_class_member_access_expr (range
, identifier
,
9574 false, tf_warning_or_error
);
9575 if (member
== error_mark_node
)
9576 return error_mark_node
;
9578 vec
= make_tree_vector ();
9579 res
= finish_call_expr (member
, &vec
,
9580 /*disallow_virtual=*/false,
9582 tf_warning_or_error
);
9583 release_tree_vector (vec
);
9587 /* Parse an iteration-statement.
9589 iteration-statement:
9590 while ( condition ) statement
9591 do statement while ( expression ) ;
9592 for ( for-init-statement condition [opt] ; expression [opt] )
9595 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9598 cp_parser_iteration_statement (cp_parser
* parser
)
9603 unsigned char in_statement
;
9605 /* Peek at the next token. */
9606 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_INTERATION
);
9608 return error_mark_node
;
9610 /* Remember whether or not we are already within an iteration
9612 in_statement
= parser
->in_statement
;
9614 /* See what kind of keyword it is. */
9615 keyword
= token
->keyword
;
9622 /* Begin the while-statement. */
9623 statement
= begin_while_stmt ();
9624 /* Look for the `('. */
9625 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9626 /* Parse the condition. */
9627 condition
= cp_parser_condition (parser
);
9628 finish_while_stmt_cond (condition
, statement
);
9629 /* Look for the `)'. */
9630 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9631 /* Parse the dependent statement. */
9632 parser
->in_statement
= IN_ITERATION_STMT
;
9633 cp_parser_already_scoped_statement (parser
);
9634 parser
->in_statement
= in_statement
;
9635 /* We're done with the while-statement. */
9636 finish_while_stmt (statement
);
9644 /* Begin the do-statement. */
9645 statement
= begin_do_stmt ();
9646 /* Parse the body of the do-statement. */
9647 parser
->in_statement
= IN_ITERATION_STMT
;
9648 cp_parser_implicitly_scoped_statement (parser
, NULL
);
9649 parser
->in_statement
= in_statement
;
9650 finish_do_body (statement
);
9651 /* Look for the `while' keyword. */
9652 cp_parser_require_keyword (parser
, RID_WHILE
, RT_WHILE
);
9653 /* Look for the `('. */
9654 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9655 /* Parse the expression. */
9656 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
9657 /* We're done with the do-statement. */
9658 finish_do_stmt (expression
, statement
);
9659 /* Look for the `)'. */
9660 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9661 /* Look for the `;'. */
9662 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9668 /* Look for the `('. */
9669 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9671 statement
= cp_parser_for (parser
);
9673 /* Look for the `)'. */
9674 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9676 /* Parse the body of the for-statement. */
9677 parser
->in_statement
= IN_ITERATION_STMT
;
9678 cp_parser_already_scoped_statement (parser
);
9679 parser
->in_statement
= in_statement
;
9681 /* We're done with the for-statement. */
9682 finish_for_stmt (statement
);
9687 cp_parser_error (parser
, "expected iteration-statement");
9688 statement
= error_mark_node
;
9695 /* Parse a for-init-statement or the declarator of a range-based-for.
9696 Returns true if a range-based-for declaration is seen.
9699 expression-statement
9700 simple-declaration */
9703 cp_parser_for_init_statement (cp_parser
* parser
, tree
*decl
)
9705 /* If the next token is a `;', then we have an empty
9706 expression-statement. Grammatically, this is also a
9707 simple-declaration, but an invalid one, because it does not
9708 declare anything. Therefore, if we did not handle this case
9709 specially, we would issue an error message about an invalid
9711 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
9713 bool is_range_for
= false;
9714 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
9716 parser
->colon_corrects_to_scope_p
= false;
9718 /* We're going to speculatively look for a declaration, falling back
9719 to an expression, if necessary. */
9720 cp_parser_parse_tentatively (parser
);
9721 /* Parse the declaration. */
9722 cp_parser_simple_declaration (parser
,
9723 /*function_definition_allowed_p=*/false,
9725 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
9726 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
9728 /* It is a range-for, consume the ':' */
9729 cp_lexer_consume_token (parser
->lexer
);
9730 is_range_for
= true;
9731 if (cxx_dialect
< cxx0x
)
9733 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
9734 "range-based %<for%> loops are not allowed "
9736 *decl
= error_mark_node
;
9740 /* The ';' is not consumed yet because we told
9741 cp_parser_simple_declaration not to. */
9742 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9744 if (cp_parser_parse_definitely (parser
))
9745 return is_range_for
;
9746 /* If the tentative parse failed, then we shall need to look for an
9747 expression-statement. */
9749 /* If we are here, it is an expression-statement. */
9750 cp_parser_expression_statement (parser
, NULL_TREE
);
9754 /* Parse a jump-statement.
9759 return expression [opt] ;
9760 return braced-init-list ;
9768 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9771 cp_parser_jump_statement (cp_parser
* parser
)
9773 tree statement
= error_mark_node
;
9776 unsigned char in_statement
;
9778 /* Peek at the next token. */
9779 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_JUMP
);
9781 return error_mark_node
;
9783 /* See what kind of keyword it is. */
9784 keyword
= token
->keyword
;
9788 in_statement
= parser
->in_statement
& ~IN_IF_STMT
;
9789 switch (in_statement
)
9792 error_at (token
->location
, "break statement not within loop or switch");
9795 gcc_assert ((in_statement
& IN_SWITCH_STMT
)
9796 || in_statement
== IN_ITERATION_STMT
);
9797 statement
= finish_break_stmt ();
9800 error_at (token
->location
, "invalid exit from OpenMP structured block");
9803 error_at (token
->location
, "break statement used with OpenMP for loop");
9806 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9810 switch (parser
->in_statement
& ~(IN_SWITCH_STMT
| IN_IF_STMT
))
9813 error_at (token
->location
, "continue statement not within a loop");
9815 case IN_ITERATION_STMT
:
9817 statement
= finish_continue_stmt ();
9820 error_at (token
->location
, "invalid exit from OpenMP structured block");
9825 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9831 bool expr_non_constant_p
;
9833 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9835 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
9836 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
9838 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
9839 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
9841 /* If the next token is a `;', then there is no
9844 /* Build the return-statement. */
9845 statement
= finish_return_stmt (expr
);
9846 /* Look for the final `;'. */
9847 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9852 /* Create the goto-statement. */
9853 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
))
9855 /* Issue a warning about this use of a GNU extension. */
9856 pedwarn (token
->location
, OPT_pedantic
, "ISO C++ forbids computed gotos");
9857 /* Consume the '*' token. */
9858 cp_lexer_consume_token (parser
->lexer
);
9859 /* Parse the dependent expression. */
9860 finish_goto_stmt (cp_parser_expression (parser
, /*cast_p=*/false, NULL
));
9863 finish_goto_stmt (cp_parser_identifier (parser
));
9864 /* Look for the final `;'. */
9865 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9869 cp_parser_error (parser
, "expected jump-statement");
9876 /* Parse a declaration-statement.
9878 declaration-statement:
9879 block-declaration */
9882 cp_parser_declaration_statement (cp_parser
* parser
)
9886 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9887 p
= obstack_alloc (&declarator_obstack
, 0);
9889 /* Parse the block-declaration. */
9890 cp_parser_block_declaration (parser
, /*statement_p=*/true);
9892 /* Free any declarators allocated. */
9893 obstack_free (&declarator_obstack
, p
);
9895 /* Finish off the statement. */
9899 /* Some dependent statements (like `if (cond) statement'), are
9900 implicitly in their own scope. In other words, if the statement is
9901 a single statement (as opposed to a compound-statement), it is
9902 none-the-less treated as if it were enclosed in braces. Any
9903 declarations appearing in the dependent statement are out of scope
9904 after control passes that point. This function parses a statement,
9905 but ensures that is in its own scope, even if it is not a
9908 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9909 is a (possibly labeled) if statement which is not enclosed in
9910 braces and has an else clause. This is used to implement
9913 Returns the new statement. */
9916 cp_parser_implicitly_scoped_statement (cp_parser
* parser
, bool *if_p
)
9923 /* Mark if () ; with a special NOP_EXPR. */
9924 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
9926 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9927 cp_lexer_consume_token (parser
->lexer
);
9928 statement
= add_stmt (build_empty_stmt (loc
));
9930 /* if a compound is opened, we simply parse the statement directly. */
9931 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9932 statement
= cp_parser_compound_statement (parser
, NULL
, false, false);
9933 /* If the token is not a `{', then we must take special action. */
9936 /* Create a compound-statement. */
9937 statement
= begin_compound_stmt (0);
9938 /* Parse the dependent-statement. */
9939 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
9940 /* Finish the dummy compound-statement. */
9941 finish_compound_stmt (statement
);
9944 /* Return the statement. */
9948 /* For some dependent statements (like `while (cond) statement'), we
9949 have already created a scope. Therefore, even if the dependent
9950 statement is a compound-statement, we do not want to create another
9954 cp_parser_already_scoped_statement (cp_parser
* parser
)
9956 /* If the token is a `{', then we must take special action. */
9957 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
9958 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
9961 /* Avoid calling cp_parser_compound_statement, so that we
9962 don't create a new scope. Do everything else by hand. */
9963 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
9964 /* If the next keyword is `__label__' we have a label declaration. */
9965 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
9966 cp_parser_label_declaration (parser
);
9967 /* Parse an (optional) statement-seq. */
9968 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
9969 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
9973 /* Declarations [gram.dcl.dcl] */
9975 /* Parse an optional declaration-sequence.
9979 declaration-seq declaration */
9982 cp_parser_declaration_seq_opt (cp_parser
* parser
)
9988 token
= cp_lexer_peek_token (parser
->lexer
);
9990 if (token
->type
== CPP_CLOSE_BRACE
9991 || token
->type
== CPP_EOF
9992 || token
->type
== CPP_PRAGMA_EOL
)
9995 if (token
->type
== CPP_SEMICOLON
)
9997 /* A declaration consisting of a single semicolon is
9998 invalid. Allow it unless we're being pedantic. */
9999 cp_lexer_consume_token (parser
->lexer
);
10000 if (!in_system_header
)
10001 pedwarn (input_location
, OPT_pedantic
, "extra %<;%>");
10005 /* If we're entering or exiting a region that's implicitly
10006 extern "C", modify the lang context appropriately. */
10007 if (!parser
->implicit_extern_c
&& token
->implicit_extern_c
)
10009 push_lang_context (lang_name_c
);
10010 parser
->implicit_extern_c
= true;
10012 else if (parser
->implicit_extern_c
&& !token
->implicit_extern_c
)
10014 pop_lang_context ();
10015 parser
->implicit_extern_c
= false;
10018 if (token
->type
== CPP_PRAGMA
)
10020 /* A top-level declaration can consist solely of a #pragma.
10021 A nested declaration cannot, so this is done here and not
10022 in cp_parser_declaration. (A #pragma at block scope is
10023 handled in cp_parser_statement.) */
10024 cp_parser_pragma (parser
, pragma_external
);
10028 /* Parse the declaration itself. */
10029 cp_parser_declaration (parser
);
10033 /* Parse a declaration.
10037 function-definition
10038 template-declaration
10039 explicit-instantiation
10040 explicit-specialization
10041 linkage-specification
10042 namespace-definition
10047 __extension__ declaration */
10050 cp_parser_declaration (cp_parser
* parser
)
10054 int saved_pedantic
;
10056 tree attributes
= NULL_TREE
;
10058 /* Check for the `__extension__' keyword. */
10059 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
10061 /* Parse the qualified declaration. */
10062 cp_parser_declaration (parser
);
10063 /* Restore the PEDANTIC flag. */
10064 pedantic
= saved_pedantic
;
10069 /* Try to figure out what kind of declaration is present. */
10070 token1
= *cp_lexer_peek_token (parser
->lexer
);
10072 if (token1
.type
!= CPP_EOF
)
10073 token2
= *cp_lexer_peek_nth_token (parser
->lexer
, 2);
10076 token2
.type
= CPP_EOF
;
10077 token2
.keyword
= RID_MAX
;
10080 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10081 p
= obstack_alloc (&declarator_obstack
, 0);
10083 /* If the next token is `extern' and the following token is a string
10084 literal, then we have a linkage specification. */
10085 if (token1
.keyword
== RID_EXTERN
10086 && cp_parser_is_pure_string_literal (&token2
))
10087 cp_parser_linkage_specification (parser
);
10088 /* If the next token is `template', then we have either a template
10089 declaration, an explicit instantiation, or an explicit
10091 else if (token1
.keyword
== RID_TEMPLATE
)
10093 /* `template <>' indicates a template specialization. */
10094 if (token2
.type
== CPP_LESS
10095 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
10096 cp_parser_explicit_specialization (parser
);
10097 /* `template <' indicates a template declaration. */
10098 else if (token2
.type
== CPP_LESS
)
10099 cp_parser_template_declaration (parser
, /*member_p=*/false);
10100 /* Anything else must be an explicit instantiation. */
10102 cp_parser_explicit_instantiation (parser
);
10104 /* If the next token is `export', then we have a template
10106 else if (token1
.keyword
== RID_EXPORT
)
10107 cp_parser_template_declaration (parser
, /*member_p=*/false);
10108 /* If the next token is `extern', 'static' or 'inline' and the one
10109 after that is `template', we have a GNU extended explicit
10110 instantiation directive. */
10111 else if (cp_parser_allow_gnu_extensions_p (parser
)
10112 && (token1
.keyword
== RID_EXTERN
10113 || token1
.keyword
== RID_STATIC
10114 || token1
.keyword
== RID_INLINE
)
10115 && token2
.keyword
== RID_TEMPLATE
)
10116 cp_parser_explicit_instantiation (parser
);
10117 /* If the next token is `namespace', check for a named or unnamed
10118 namespace definition. */
10119 else if (token1
.keyword
== RID_NAMESPACE
10120 && (/* A named namespace definition. */
10121 (token2
.type
== CPP_NAME
10122 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
10124 /* An unnamed namespace definition. */
10125 || token2
.type
== CPP_OPEN_BRACE
10126 || token2
.keyword
== RID_ATTRIBUTE
))
10127 cp_parser_namespace_definition (parser
);
10128 /* An inline (associated) namespace definition. */
10129 else if (token1
.keyword
== RID_INLINE
10130 && token2
.keyword
== RID_NAMESPACE
)
10131 cp_parser_namespace_definition (parser
);
10132 /* Objective-C++ declaration/definition. */
10133 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1
.keyword
))
10134 cp_parser_objc_declaration (parser
, NULL_TREE
);
10135 else if (c_dialect_objc ()
10136 && token1
.keyword
== RID_ATTRIBUTE
10137 && cp_parser_objc_valid_prefix_attributes (parser
, &attributes
))
10138 cp_parser_objc_declaration (parser
, attributes
);
10139 /* We must have either a block declaration or a function
10142 /* Try to parse a block-declaration, or a function-definition. */
10143 cp_parser_block_declaration (parser
, /*statement_p=*/false);
10145 /* Free any declarators allocated. */
10146 obstack_free (&declarator_obstack
, p
);
10149 /* Parse a block-declaration.
10154 namespace-alias-definition
10161 __extension__ block-declaration
10166 static_assert-declaration
10168 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10169 part of a declaration-statement. */
10172 cp_parser_block_declaration (cp_parser
*parser
,
10176 int saved_pedantic
;
10178 /* Check for the `__extension__' keyword. */
10179 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
10181 /* Parse the qualified declaration. */
10182 cp_parser_block_declaration (parser
, statement_p
);
10183 /* Restore the PEDANTIC flag. */
10184 pedantic
= saved_pedantic
;
10189 /* Peek at the next token to figure out which kind of declaration is
10191 token1
= cp_lexer_peek_token (parser
->lexer
);
10193 /* If the next keyword is `asm', we have an asm-definition. */
10194 if (token1
->keyword
== RID_ASM
)
10197 cp_parser_commit_to_tentative_parse (parser
);
10198 cp_parser_asm_definition (parser
);
10200 /* If the next keyword is `namespace', we have a
10201 namespace-alias-definition. */
10202 else if (token1
->keyword
== RID_NAMESPACE
)
10203 cp_parser_namespace_alias_definition (parser
);
10204 /* If the next keyword is `using', we have a
10205 using-declaration, a using-directive, or an alias-declaration. */
10206 else if (token1
->keyword
== RID_USING
)
10211 cp_parser_commit_to_tentative_parse (parser
);
10212 /* If the token after `using' is `namespace', then we have a
10213 using-directive. */
10214 token2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
10215 if (token2
->keyword
== RID_NAMESPACE
)
10216 cp_parser_using_directive (parser
);
10217 /* If the second token after 'using' is '=', then we have an
10218 alias-declaration. */
10219 else if (cxx_dialect
>= cxx0x
10220 && token2
->type
== CPP_NAME
10221 && ((cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_EQ
)
10222 || (cp_lexer_peek_nth_token (parser
->lexer
, 3)->keyword
10223 == RID_ATTRIBUTE
)))
10224 cp_parser_alias_declaration (parser
);
10225 /* Otherwise, it's a using-declaration. */
10227 cp_parser_using_declaration (parser
,
10228 /*access_declaration_p=*/false);
10230 /* If the next keyword is `__label__' we have a misplaced label
10232 else if (token1
->keyword
== RID_LABEL
)
10234 cp_lexer_consume_token (parser
->lexer
);
10235 error_at (token1
->location
, "%<__label__%> not at the beginning of a block");
10236 cp_parser_skip_to_end_of_statement (parser
);
10237 /* If the next token is now a `;', consume it. */
10238 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
10239 cp_lexer_consume_token (parser
->lexer
);
10241 /* If the next token is `static_assert' we have a static assertion. */
10242 else if (token1
->keyword
== RID_STATIC_ASSERT
)
10243 cp_parser_static_assert (parser
, /*member_p=*/false);
10244 /* Anything else must be a simple-declaration. */
10246 cp_parser_simple_declaration (parser
, !statement_p
,
10247 /*maybe_range_for_decl*/NULL
);
10250 /* Parse a simple-declaration.
10252 simple-declaration:
10253 decl-specifier-seq [opt] init-declarator-list [opt] ;
10255 init-declarator-list:
10257 init-declarator-list , init-declarator
10259 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10260 function-definition as a simple-declaration.
10262 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10263 parsed declaration if it is an uninitialized single declarator not followed
10264 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10265 if present, will not be consumed. */
10268 cp_parser_simple_declaration (cp_parser
* parser
,
10269 bool function_definition_allowed_p
,
10270 tree
*maybe_range_for_decl
)
10272 cp_decl_specifier_seq decl_specifiers
;
10273 int declares_class_or_enum
;
10274 bool saw_declarator
;
10276 if (maybe_range_for_decl
)
10277 *maybe_range_for_decl
= NULL_TREE
;
10279 /* Defer access checks until we know what is being declared; the
10280 checks for names appearing in the decl-specifier-seq should be
10281 done as if we were in the scope of the thing being declared. */
10282 push_deferring_access_checks (dk_deferred
);
10284 /* Parse the decl-specifier-seq. We have to keep track of whether
10285 or not the decl-specifier-seq declares a named class or
10286 enumeration type, since that is the only case in which the
10287 init-declarator-list is allowed to be empty.
10291 In a simple-declaration, the optional init-declarator-list can be
10292 omitted only when declaring a class or enumeration, that is when
10293 the decl-specifier-seq contains either a class-specifier, an
10294 elaborated-type-specifier, or an enum-specifier. */
10295 cp_parser_decl_specifier_seq (parser
,
10296 CP_PARSER_FLAGS_OPTIONAL
,
10298 &declares_class_or_enum
);
10299 /* We no longer need to defer access checks. */
10300 stop_deferring_access_checks ();
10302 /* In a block scope, a valid declaration must always have a
10303 decl-specifier-seq. By not trying to parse declarators, we can
10304 resolve the declaration/expression ambiguity more quickly. */
10305 if (!function_definition_allowed_p
10306 && !decl_specifiers
.any_specifiers_p
)
10308 cp_parser_error (parser
, "expected declaration");
10312 /* If the next two tokens are both identifiers, the code is
10313 erroneous. The usual cause of this situation is code like:
10317 where "T" should name a type -- but does not. */
10318 if (!decl_specifiers
.any_type_specifiers_p
10319 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
10321 /* If parsing tentatively, we should commit; we really are
10322 looking at a declaration. */
10323 cp_parser_commit_to_tentative_parse (parser
);
10328 /* If we have seen at least one decl-specifier, and the next token
10329 is not a parenthesis, then we must be looking at a declaration.
10330 (After "int (" we might be looking at a functional cast.) */
10331 if (decl_specifiers
.any_specifiers_p
10332 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
)
10333 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
10334 && !cp_parser_error_occurred (parser
))
10335 cp_parser_commit_to_tentative_parse (parser
);
10337 /* Keep going until we hit the `;' at the end of the simple
10339 saw_declarator
= false;
10340 while (cp_lexer_next_token_is_not (parser
->lexer
,
10344 bool function_definition_p
;
10347 if (saw_declarator
)
10349 /* If we are processing next declarator, coma is expected */
10350 token
= cp_lexer_peek_token (parser
->lexer
);
10351 gcc_assert (token
->type
== CPP_COMMA
);
10352 cp_lexer_consume_token (parser
->lexer
);
10353 if (maybe_range_for_decl
)
10354 *maybe_range_for_decl
= error_mark_node
;
10357 saw_declarator
= true;
10359 /* Parse the init-declarator. */
10360 decl
= cp_parser_init_declarator (parser
, &decl_specifiers
,
10362 function_definition_allowed_p
,
10363 /*member_p=*/false,
10364 declares_class_or_enum
,
10365 &function_definition_p
,
10366 maybe_range_for_decl
);
10367 /* If an error occurred while parsing tentatively, exit quickly.
10368 (That usually happens when in the body of a function; each
10369 statement is treated as a declaration-statement until proven
10371 if (cp_parser_error_occurred (parser
))
10373 /* Handle function definitions specially. */
10374 if (function_definition_p
)
10376 /* If the next token is a `,', then we are probably
10377 processing something like:
10381 which is erroneous. */
10382 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
10384 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10385 error_at (token
->location
,
10387 " declarations and function-definitions is forbidden");
10389 /* Otherwise, we're done with the list of declarators. */
10392 pop_deferring_access_checks ();
10396 if (maybe_range_for_decl
&& *maybe_range_for_decl
== NULL_TREE
)
10397 *maybe_range_for_decl
= decl
;
10398 /* The next token should be either a `,' or a `;'. */
10399 token
= cp_lexer_peek_token (parser
->lexer
);
10400 /* If it's a `,', there are more declarators to come. */
10401 if (token
->type
== CPP_COMMA
)
10402 /* will be consumed next time around */;
10403 /* If it's a `;', we are done. */
10404 else if (token
->type
== CPP_SEMICOLON
|| maybe_range_for_decl
)
10406 /* Anything else is an error. */
10409 /* If we have already issued an error message we don't need
10410 to issue another one. */
10411 if (decl
!= error_mark_node
10412 || cp_parser_uncommitted_to_tentative_parse_p (parser
))
10413 cp_parser_error (parser
, "expected %<,%> or %<;%>");
10414 /* Skip tokens until we reach the end of the statement. */
10415 cp_parser_skip_to_end_of_statement (parser
);
10416 /* If the next token is now a `;', consume it. */
10417 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
10418 cp_lexer_consume_token (parser
->lexer
);
10421 /* After the first time around, a function-definition is not
10422 allowed -- even if it was OK at first. For example:
10427 function_definition_allowed_p
= false;
10430 /* Issue an error message if no declarators are present, and the
10431 decl-specifier-seq does not itself declare a class or
10433 if (!saw_declarator
)
10435 if (cp_parser_declares_only_class_p (parser
))
10436 shadow_tag (&decl_specifiers
);
10437 /* Perform any deferred access checks. */
10438 perform_deferred_access_checks ();
10441 /* Consume the `;'. */
10442 if (!maybe_range_for_decl
)
10443 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
10446 pop_deferring_access_checks ();
10449 /* Parse a decl-specifier-seq.
10451 decl-specifier-seq:
10452 decl-specifier-seq [opt] decl-specifier
10455 storage-class-specifier
10466 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10468 The parser flags FLAGS is used to control type-specifier parsing.
10470 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10473 1: one of the decl-specifiers is an elaborated-type-specifier
10474 (i.e., a type declaration)
10475 2: one of the decl-specifiers is an enum-specifier or a
10476 class-specifier (i.e., a type definition)
10481 cp_parser_decl_specifier_seq (cp_parser
* parser
,
10482 cp_parser_flags flags
,
10483 cp_decl_specifier_seq
*decl_specs
,
10484 int* declares_class_or_enum
)
10486 bool constructor_possible_p
= !parser
->in_declarator_p
;
10487 cp_token
*start_token
= NULL
;
10489 /* Clear DECL_SPECS. */
10490 clear_decl_specs (decl_specs
);
10492 /* Assume no class or enumeration type is declared. */
10493 *declares_class_or_enum
= 0;
10495 /* Keep reading specifiers until there are no more to read. */
10498 bool constructor_p
;
10499 bool found_decl_spec
;
10502 /* Peek at the next token. */
10503 token
= cp_lexer_peek_token (parser
->lexer
);
10505 /* Save the first token of the decl spec list for error
10508 start_token
= token
;
10509 /* Handle attributes. */
10510 if (token
->keyword
== RID_ATTRIBUTE
)
10512 /* Parse the attributes. */
10513 decl_specs
->attributes
10514 = chainon (decl_specs
->attributes
,
10515 cp_parser_attributes_opt (parser
));
10518 /* Assume we will find a decl-specifier keyword. */
10519 found_decl_spec
= true;
10520 /* If the next token is an appropriate keyword, we can simply
10521 add it to the list. */
10522 switch (token
->keyword
)
10528 if (!at_class_scope_p ())
10530 error_at (token
->location
, "%<friend%> used outside of class");
10531 cp_lexer_purge_token (parser
->lexer
);
10535 ++decl_specs
->specs
[(int) ds_friend
];
10536 /* Consume the token. */
10537 cp_lexer_consume_token (parser
->lexer
);
10541 case RID_CONSTEXPR
:
10542 ++decl_specs
->specs
[(int) ds_constexpr
];
10543 cp_lexer_consume_token (parser
->lexer
);
10546 /* function-specifier:
10553 cp_parser_function_specifier_opt (parser
, decl_specs
);
10559 ++decl_specs
->specs
[(int) ds_typedef
];
10560 /* Consume the token. */
10561 cp_lexer_consume_token (parser
->lexer
);
10562 /* A constructor declarator cannot appear in a typedef. */
10563 constructor_possible_p
= false;
10564 /* The "typedef" keyword can only occur in a declaration; we
10565 may as well commit at this point. */
10566 cp_parser_commit_to_tentative_parse (parser
);
10568 if (decl_specs
->storage_class
!= sc_none
)
10569 decl_specs
->conflicting_specifiers_p
= true;
10572 /* storage-class-specifier:
10582 if (cxx_dialect
== cxx98
)
10584 /* Consume the token. */
10585 cp_lexer_consume_token (parser
->lexer
);
10587 /* Complain about `auto' as a storage specifier, if
10588 we're complaining about C++0x compatibility. */
10589 warning_at (token
->location
, OPT_Wc__0x_compat
, "%<auto%>"
10590 " changes meaning in C++11; please remove it");
10592 /* Set the storage class anyway. */
10593 cp_parser_set_storage_class (parser
, decl_specs
, RID_AUTO
,
10597 /* C++0x auto type-specifier. */
10598 found_decl_spec
= false;
10605 /* Consume the token. */
10606 cp_lexer_consume_token (parser
->lexer
);
10607 cp_parser_set_storage_class (parser
, decl_specs
, token
->keyword
,
10611 /* Consume the token. */
10612 cp_lexer_consume_token (parser
->lexer
);
10613 ++decl_specs
->specs
[(int) ds_thread
];
10617 /* We did not yet find a decl-specifier yet. */
10618 found_decl_spec
= false;
10622 if (found_decl_spec
10623 && (flags
& CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
)
10624 && token
->keyword
!= RID_CONSTEXPR
)
10625 error ("decl-specifier invalid in condition");
10627 /* Constructors are a special case. The `S' in `S()' is not a
10628 decl-specifier; it is the beginning of the declarator. */
10630 = (!found_decl_spec
10631 && constructor_possible_p
10632 && (cp_parser_constructor_declarator_p
10633 (parser
, decl_specs
->specs
[(int) ds_friend
] != 0)));
10635 /* If we don't have a DECL_SPEC yet, then we must be looking at
10636 a type-specifier. */
10637 if (!found_decl_spec
&& !constructor_p
)
10639 int decl_spec_declares_class_or_enum
;
10640 bool is_cv_qualifier
;
10644 = cp_parser_type_specifier (parser
, flags
,
10646 /*is_declaration=*/true,
10647 &decl_spec_declares_class_or_enum
,
10649 *declares_class_or_enum
|= decl_spec_declares_class_or_enum
;
10651 /* If this type-specifier referenced a user-defined type
10652 (a typedef, class-name, etc.), then we can't allow any
10653 more such type-specifiers henceforth.
10657 The longest sequence of decl-specifiers that could
10658 possibly be a type name is taken as the
10659 decl-specifier-seq of a declaration. The sequence shall
10660 be self-consistent as described below.
10664 As a general rule, at most one type-specifier is allowed
10665 in the complete decl-specifier-seq of a declaration. The
10666 only exceptions are the following:
10668 -- const or volatile can be combined with any other
10671 -- signed or unsigned can be combined with char, long,
10679 void g (const int Pc);
10681 Here, Pc is *not* part of the decl-specifier seq; it's
10682 the declarator. Therefore, once we see a type-specifier
10683 (other than a cv-qualifier), we forbid any additional
10684 user-defined types. We *do* still allow things like `int
10685 int' to be considered a decl-specifier-seq, and issue the
10686 error message later. */
10687 if (type_spec
&& !is_cv_qualifier
)
10688 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
10689 /* A constructor declarator cannot follow a type-specifier. */
10692 constructor_possible_p
= false;
10693 found_decl_spec
= true;
10694 if (!is_cv_qualifier
)
10695 decl_specs
->any_type_specifiers_p
= true;
10699 /* If we still do not have a DECL_SPEC, then there are no more
10700 decl-specifiers. */
10701 if (!found_decl_spec
)
10704 decl_specs
->any_specifiers_p
= true;
10705 /* After we see one decl-specifier, further decl-specifiers are
10706 always optional. */
10707 flags
|= CP_PARSER_FLAGS_OPTIONAL
;
10710 cp_parser_check_decl_spec (decl_specs
, start_token
->location
);
10712 /* Don't allow a friend specifier with a class definition. */
10713 if (decl_specs
->specs
[(int) ds_friend
] != 0
10714 && (*declares_class_or_enum
& 2))
10715 error_at (start_token
->location
,
10716 "class definition may not be declared a friend");
10719 /* Parse an (optional) storage-class-specifier.
10721 storage-class-specifier:
10730 storage-class-specifier:
10733 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10736 cp_parser_storage_class_specifier_opt (cp_parser
* parser
)
10738 switch (cp_lexer_peek_token (parser
->lexer
)->keyword
)
10741 if (cxx_dialect
!= cxx98
)
10743 /* Fall through for C++98. */
10750 /* Consume the token. */
10751 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
10758 /* Parse an (optional) function-specifier.
10760 function-specifier:
10765 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10766 Updates DECL_SPECS, if it is non-NULL. */
10769 cp_parser_function_specifier_opt (cp_parser
* parser
,
10770 cp_decl_specifier_seq
*decl_specs
)
10772 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10773 switch (token
->keyword
)
10777 ++decl_specs
->specs
[(int) ds_inline
];
10781 /* 14.5.2.3 [temp.mem]
10783 A member function template shall not be virtual. */
10784 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
10785 error_at (token
->location
, "templates may not be %<virtual%>");
10786 else if (decl_specs
)
10787 ++decl_specs
->specs
[(int) ds_virtual
];
10792 ++decl_specs
->specs
[(int) ds_explicit
];
10799 /* Consume the token. */
10800 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
10803 /* Parse a linkage-specification.
10805 linkage-specification:
10806 extern string-literal { declaration-seq [opt] }
10807 extern string-literal declaration */
10810 cp_parser_linkage_specification (cp_parser
* parser
)
10814 /* Look for the `extern' keyword. */
10815 cp_parser_require_keyword (parser
, RID_EXTERN
, RT_EXTERN
);
10817 /* Look for the string-literal. */
10818 linkage
= cp_parser_string_literal (parser
, false, false);
10820 /* Transform the literal into an identifier. If the literal is a
10821 wide-character string, or contains embedded NULs, then we can't
10822 handle it as the user wants. */
10823 if (strlen (TREE_STRING_POINTER (linkage
))
10824 != (size_t) (TREE_STRING_LENGTH (linkage
) - 1))
10826 cp_parser_error (parser
, "invalid linkage-specification");
10827 /* Assume C++ linkage. */
10828 linkage
= lang_name_cplusplus
;
10831 linkage
= get_identifier (TREE_STRING_POINTER (linkage
));
10833 /* We're now using the new linkage. */
10834 push_lang_context (linkage
);
10836 /* If the next token is a `{', then we're using the first
10838 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
10840 /* Consume the `{' token. */
10841 cp_lexer_consume_token (parser
->lexer
);
10842 /* Parse the declarations. */
10843 cp_parser_declaration_seq_opt (parser
);
10844 /* Look for the closing `}'. */
10845 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
10847 /* Otherwise, there's just one declaration. */
10850 bool saved_in_unbraced_linkage_specification_p
;
10852 saved_in_unbraced_linkage_specification_p
10853 = parser
->in_unbraced_linkage_specification_p
;
10854 parser
->in_unbraced_linkage_specification_p
= true;
10855 cp_parser_declaration (parser
);
10856 parser
->in_unbraced_linkage_specification_p
10857 = saved_in_unbraced_linkage_specification_p
;
10860 /* We're done with the linkage-specification. */
10861 pop_lang_context ();
10864 /* Parse a static_assert-declaration.
10866 static_assert-declaration:
10867 static_assert ( constant-expression , string-literal ) ;
10869 If MEMBER_P, this static_assert is a class member. */
10872 cp_parser_static_assert(cp_parser
*parser
, bool member_p
)
10877 location_t saved_loc
;
10880 /* Peek at the `static_assert' token so we can keep track of exactly
10881 where the static assertion started. */
10882 token
= cp_lexer_peek_token (parser
->lexer
);
10883 saved_loc
= token
->location
;
10885 /* Look for the `static_assert' keyword. */
10886 if (!cp_parser_require_keyword (parser
, RID_STATIC_ASSERT
,
10890 /* We know we are in a static assertion; commit to any tentative
10892 if (cp_parser_parsing_tentatively (parser
))
10893 cp_parser_commit_to_tentative_parse (parser
);
10895 /* Parse the `(' starting the static assertion condition. */
10896 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
10898 /* Parse the constant-expression. Allow a non-constant expression
10899 here in order to give better diagnostics in finish_static_assert. */
10901 cp_parser_constant_expression (parser
,
10902 /*allow_non_constant_p=*/true,
10903 /*non_constant_p=*/&dummy
);
10905 /* Parse the separating `,'. */
10906 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
10908 /* Parse the string-literal message. */
10909 message
= cp_parser_string_literal (parser
,
10910 /*translate=*/false,
10913 /* A `)' completes the static assertion. */
10914 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
10915 cp_parser_skip_to_closing_parenthesis (parser
,
10916 /*recovering=*/true,
10917 /*or_comma=*/false,
10918 /*consume_paren=*/true);
10920 /* A semicolon terminates the declaration. */
10921 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
10923 /* Complete the static assertion, which may mean either processing
10924 the static assert now or saving it for template instantiation. */
10925 finish_static_assert (condition
, message
, saved_loc
, member_p
);
10928 /* Parse a `decltype' type. Returns the type.
10930 simple-type-specifier:
10931 decltype ( expression ) */
10934 cp_parser_decltype (cp_parser
*parser
)
10937 bool id_expression_or_member_access_p
= false;
10938 const char *saved_message
;
10939 bool saved_integral_constant_expression_p
;
10940 bool saved_non_integral_constant_expression_p
;
10941 cp_token
*id_expr_start_token
;
10942 cp_token
*start_token
= cp_lexer_peek_token (parser
->lexer
);
10944 if (start_token
->type
== CPP_DECLTYPE
)
10946 /* Already parsed. */
10947 cp_lexer_consume_token (parser
->lexer
);
10948 return start_token
->u
.value
;
10951 /* Look for the `decltype' token. */
10952 if (!cp_parser_require_keyword (parser
, RID_DECLTYPE
, RT_DECLTYPE
))
10953 return error_mark_node
;
10955 /* Types cannot be defined in a `decltype' expression. Save away the
10957 saved_message
= parser
->type_definition_forbidden_message
;
10959 /* And create the new one. */
10960 parser
->type_definition_forbidden_message
10961 = G_("types may not be defined in %<decltype%> expressions");
10963 /* The restrictions on constant-expressions do not apply inside
10964 decltype expressions. */
10965 saved_integral_constant_expression_p
10966 = parser
->integral_constant_expression_p
;
10967 saved_non_integral_constant_expression_p
10968 = parser
->non_integral_constant_expression_p
;
10969 parser
->integral_constant_expression_p
= false;
10971 /* Do not actually evaluate the expression. */
10972 ++cp_unevaluated_operand
;
10974 /* Do not warn about problems with the expression. */
10975 ++c_inhibit_evaluation_warnings
;
10977 /* Parse the opening `('. */
10978 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
10979 return error_mark_node
;
10981 /* First, try parsing an id-expression. */
10982 id_expr_start_token
= cp_lexer_peek_token (parser
->lexer
);
10983 cp_parser_parse_tentatively (parser
);
10984 expr
= cp_parser_id_expression (parser
,
10985 /*template_keyword_p=*/false,
10986 /*check_dependency_p=*/true,
10987 /*template_p=*/NULL
,
10988 /*declarator_p=*/false,
10989 /*optional_p=*/false);
10991 if (!cp_parser_error_occurred (parser
) && expr
!= error_mark_node
)
10993 bool non_integral_constant_expression_p
= false;
10994 tree id_expression
= expr
;
10996 const char *error_msg
;
10998 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
10999 /* Lookup the name we got back from the id-expression. */
11000 expr
= cp_parser_lookup_name (parser
, expr
,
11002 /*is_template=*/false,
11003 /*is_namespace=*/false,
11004 /*check_dependency=*/true,
11005 /*ambiguous_decls=*/NULL
,
11006 id_expr_start_token
->location
);
11009 && expr
!= error_mark_node
11010 && TREE_CODE (expr
) != TEMPLATE_ID_EXPR
11011 && TREE_CODE (expr
) != TYPE_DECL
11012 && (TREE_CODE (expr
) != BIT_NOT_EXPR
11013 || !TYPE_P (TREE_OPERAND (expr
, 0)))
11014 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
11016 /* Complete lookup of the id-expression. */
11017 expr
= (finish_id_expression
11018 (id_expression
, expr
, parser
->scope
, &idk
,
11019 /*integral_constant_expression_p=*/false,
11020 /*allow_non_integral_constant_expression_p=*/true,
11021 &non_integral_constant_expression_p
,
11022 /*template_p=*/false,
11024 /*address_p=*/false,
11025 /*template_arg_p=*/false,
11027 id_expr_start_token
->location
));
11029 if (expr
== error_mark_node
)
11030 /* We found an id-expression, but it was something that we
11031 should not have found. This is an error, not something
11032 we can recover from, so note that we found an
11033 id-expression and we'll recover as gracefully as
11035 id_expression_or_member_access_p
= true;
11039 && expr
!= error_mark_node
11040 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
11041 /* We have an id-expression. */
11042 id_expression_or_member_access_p
= true;
11045 if (!id_expression_or_member_access_p
)
11047 /* Abort the id-expression parse. */
11048 cp_parser_abort_tentative_parse (parser
);
11050 /* Parsing tentatively, again. */
11051 cp_parser_parse_tentatively (parser
);
11053 /* Parse a class member access. */
11054 expr
= cp_parser_postfix_expression (parser
, /*address_p=*/false,
11056 /*member_access_only_p=*/true, NULL
);
11059 && expr
!= error_mark_node
11060 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
11061 /* We have an id-expression. */
11062 id_expression_or_member_access_p
= true;
11065 if (id_expression_or_member_access_p
)
11066 /* We have parsed the complete id-expression or member access. */
11067 cp_parser_parse_definitely (parser
);
11070 bool saved_greater_than_is_operator_p
;
11072 /* Abort our attempt to parse an id-expression or member access
11074 cp_parser_abort_tentative_parse (parser
);
11076 /* Within a parenthesized expression, a `>' token is always
11077 the greater-than operator. */
11078 saved_greater_than_is_operator_p
11079 = parser
->greater_than_is_operator_p
;
11080 parser
->greater_than_is_operator_p
= true;
11082 /* Parse a full expression. */
11083 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
11085 /* The `>' token might be the end of a template-id or
11086 template-parameter-list now. */
11087 parser
->greater_than_is_operator_p
11088 = saved_greater_than_is_operator_p
;
11091 /* Go back to evaluating expressions. */
11092 --cp_unevaluated_operand
;
11093 --c_inhibit_evaluation_warnings
;
11095 /* Restore the old message and the integral constant expression
11097 parser
->type_definition_forbidden_message
= saved_message
;
11098 parser
->integral_constant_expression_p
11099 = saved_integral_constant_expression_p
;
11100 parser
->non_integral_constant_expression_p
11101 = saved_non_integral_constant_expression_p
;
11103 /* Parse to the closing `)'. */
11104 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
11106 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
11107 /*consume_paren=*/true);
11108 return error_mark_node
;
11111 expr
= finish_decltype_type (expr
, id_expression_or_member_access_p
,
11112 tf_warning_or_error
);
11114 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11116 start_token
->type
= CPP_DECLTYPE
;
11117 start_token
->u
.value
= expr
;
11118 start_token
->keyword
= RID_MAX
;
11119 cp_lexer_purge_tokens_after (parser
->lexer
, start_token
);
11124 /* Special member functions [gram.special] */
11126 /* Parse a conversion-function-id.
11128 conversion-function-id:
11129 operator conversion-type-id
11131 Returns an IDENTIFIER_NODE representing the operator. */
11134 cp_parser_conversion_function_id (cp_parser
* parser
)
11138 tree saved_qualifying_scope
;
11139 tree saved_object_scope
;
11140 tree pushed_scope
= NULL_TREE
;
11142 /* Look for the `operator' token. */
11143 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
11144 return error_mark_node
;
11145 /* When we parse the conversion-type-id, the current scope will be
11146 reset. However, we need that information in able to look up the
11147 conversion function later, so we save it here. */
11148 saved_scope
= parser
->scope
;
11149 saved_qualifying_scope
= parser
->qualifying_scope
;
11150 saved_object_scope
= parser
->object_scope
;
11151 /* We must enter the scope of the class so that the names of
11152 entities declared within the class are available in the
11153 conversion-type-id. For example, consider:
11160 S::operator I() { ... }
11162 In order to see that `I' is a type-name in the definition, we
11163 must be in the scope of `S'. */
11165 pushed_scope
= push_scope (saved_scope
);
11166 /* Parse the conversion-type-id. */
11167 type
= cp_parser_conversion_type_id (parser
);
11168 /* Leave the scope of the class, if any. */
11170 pop_scope (pushed_scope
);
11171 /* Restore the saved scope. */
11172 parser
->scope
= saved_scope
;
11173 parser
->qualifying_scope
= saved_qualifying_scope
;
11174 parser
->object_scope
= saved_object_scope
;
11175 /* If the TYPE is invalid, indicate failure. */
11176 if (type
== error_mark_node
)
11177 return error_mark_node
;
11178 return mangle_conv_op_name_for_type (type
);
11181 /* Parse a conversion-type-id:
11183 conversion-type-id:
11184 type-specifier-seq conversion-declarator [opt]
11186 Returns the TYPE specified. */
11189 cp_parser_conversion_type_id (cp_parser
* parser
)
11192 cp_decl_specifier_seq type_specifiers
;
11193 cp_declarator
*declarator
;
11194 tree type_specified
;
11196 /* Parse the attributes. */
11197 attributes
= cp_parser_attributes_opt (parser
);
11198 /* Parse the type-specifiers. */
11199 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
11200 /*is_trailing_return=*/false,
11202 /* If that didn't work, stop. */
11203 if (type_specifiers
.type
== error_mark_node
)
11204 return error_mark_node
;
11205 /* Parse the conversion-declarator. */
11206 declarator
= cp_parser_conversion_declarator_opt (parser
);
11208 type_specified
= grokdeclarator (declarator
, &type_specifiers
, TYPENAME
,
11209 /*initialized=*/0, &attributes
);
11211 cplus_decl_attributes (&type_specified
, attributes
, /*flags=*/0);
11213 /* Don't give this error when parsing tentatively. This happens to
11214 work because we always parse this definitively once. */
11215 if (! cp_parser_uncommitted_to_tentative_parse_p (parser
)
11216 && type_uses_auto (type_specified
))
11218 error ("invalid use of %<auto%> in conversion operator");
11219 return error_mark_node
;
11222 return type_specified
;
11225 /* Parse an (optional) conversion-declarator.
11227 conversion-declarator:
11228 ptr-operator conversion-declarator [opt]
11232 static cp_declarator
*
11233 cp_parser_conversion_declarator_opt (cp_parser
* parser
)
11235 enum tree_code code
;
11237 cp_cv_quals cv_quals
;
11239 /* We don't know if there's a ptr-operator next, or not. */
11240 cp_parser_parse_tentatively (parser
);
11241 /* Try the ptr-operator. */
11242 code
= cp_parser_ptr_operator (parser
, &class_type
, &cv_quals
);
11243 /* If it worked, look for more conversion-declarators. */
11244 if (cp_parser_parse_definitely (parser
))
11246 cp_declarator
*declarator
;
11248 /* Parse another optional declarator. */
11249 declarator
= cp_parser_conversion_declarator_opt (parser
);
11251 return cp_parser_make_indirect_declarator
11252 (code
, class_type
, cv_quals
, declarator
);
11258 /* Parse an (optional) ctor-initializer.
11261 : mem-initializer-list
11263 Returns TRUE iff the ctor-initializer was actually present. */
11266 cp_parser_ctor_initializer_opt (cp_parser
* parser
)
11268 /* If the next token is not a `:', then there is no
11269 ctor-initializer. */
11270 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
11272 /* Do default initialization of any bases and members. */
11273 if (DECL_CONSTRUCTOR_P (current_function_decl
))
11274 finish_mem_initializers (NULL_TREE
);
11279 /* Consume the `:' token. */
11280 cp_lexer_consume_token (parser
->lexer
);
11281 /* And the mem-initializer-list. */
11282 cp_parser_mem_initializer_list (parser
);
11287 /* Parse a mem-initializer-list.
11289 mem-initializer-list:
11290 mem-initializer ... [opt]
11291 mem-initializer ... [opt] , mem-initializer-list */
11294 cp_parser_mem_initializer_list (cp_parser
* parser
)
11296 tree mem_initializer_list
= NULL_TREE
;
11297 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11299 /* Let the semantic analysis code know that we are starting the
11300 mem-initializer-list. */
11301 if (!DECL_CONSTRUCTOR_P (current_function_decl
))
11302 error_at (token
->location
,
11303 "only constructors take member initializers");
11305 /* Loop through the list. */
11308 tree mem_initializer
;
11310 token
= cp_lexer_peek_token (parser
->lexer
);
11311 /* Parse the mem-initializer. */
11312 mem_initializer
= cp_parser_mem_initializer (parser
);
11313 /* If the next token is a `...', we're expanding member initializers. */
11314 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
11316 /* Consume the `...'. */
11317 cp_lexer_consume_token (parser
->lexer
);
11319 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11320 can be expanded but members cannot. */
11321 if (mem_initializer
!= error_mark_node
11322 && !TYPE_P (TREE_PURPOSE (mem_initializer
)))
11324 error_at (token
->location
,
11325 "cannot expand initializer for member %<%D%>",
11326 TREE_PURPOSE (mem_initializer
));
11327 mem_initializer
= error_mark_node
;
11330 /* Construct the pack expansion type. */
11331 if (mem_initializer
!= error_mark_node
)
11332 mem_initializer
= make_pack_expansion (mem_initializer
);
11334 /* Add it to the list, unless it was erroneous. */
11335 if (mem_initializer
!= error_mark_node
)
11337 TREE_CHAIN (mem_initializer
) = mem_initializer_list
;
11338 mem_initializer_list
= mem_initializer
;
11340 /* If the next token is not a `,', we're done. */
11341 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
11343 /* Consume the `,' token. */
11344 cp_lexer_consume_token (parser
->lexer
);
11347 /* Perform semantic analysis. */
11348 if (DECL_CONSTRUCTOR_P (current_function_decl
))
11349 finish_mem_initializers (mem_initializer_list
);
11352 /* Parse a mem-initializer.
11355 mem-initializer-id ( expression-list [opt] )
11356 mem-initializer-id braced-init-list
11361 ( expression-list [opt] )
11363 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11364 class) or FIELD_DECL (for a non-static data member) to initialize;
11365 the TREE_VALUE is the expression-list. An empty initialization
11366 list is represented by void_list_node. */
11369 cp_parser_mem_initializer (cp_parser
* parser
)
11371 tree mem_initializer_id
;
11372 tree expression_list
;
11374 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11376 /* Find out what is being initialized. */
11377 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
11379 permerror (token
->location
,
11380 "anachronistic old-style base class initializer");
11381 mem_initializer_id
= NULL_TREE
;
11385 mem_initializer_id
= cp_parser_mem_initializer_id (parser
);
11386 if (mem_initializer_id
== error_mark_node
)
11387 return mem_initializer_id
;
11389 member
= expand_member_init (mem_initializer_id
);
11390 if (member
&& !DECL_P (member
))
11391 in_base_initializer
= 1;
11393 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11395 bool expr_non_constant_p
;
11396 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
11397 expression_list
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
11398 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
11399 expression_list
= build_tree_list (NULL_TREE
, expression_list
);
11404 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
11406 /*allow_expansion_p=*/true,
11407 /*non_constant_p=*/NULL
);
11409 return error_mark_node
;
11410 expression_list
= build_tree_list_vec (vec
);
11411 release_tree_vector (vec
);
11414 if (expression_list
== error_mark_node
)
11415 return error_mark_node
;
11416 if (!expression_list
)
11417 expression_list
= void_type_node
;
11419 in_base_initializer
= 0;
11421 return member
? build_tree_list (member
, expression_list
) : error_mark_node
;
11424 /* Parse a mem-initializer-id.
11426 mem-initializer-id:
11427 :: [opt] nested-name-specifier [opt] class-name
11430 Returns a TYPE indicating the class to be initializer for the first
11431 production. Returns an IDENTIFIER_NODE indicating the data member
11432 to be initialized for the second production. */
11435 cp_parser_mem_initializer_id (cp_parser
* parser
)
11437 bool global_scope_p
;
11438 bool nested_name_specifier_p
;
11439 bool template_p
= false;
11442 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11444 /* `typename' is not allowed in this context ([temp.res]). */
11445 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
11447 error_at (token
->location
,
11448 "keyword %<typename%> not allowed in this context (a qualified "
11449 "member initializer is implicitly a type)");
11450 cp_lexer_consume_token (parser
->lexer
);
11452 /* Look for the optional `::' operator. */
11454 = (cp_parser_global_scope_opt (parser
,
11455 /*current_scope_valid_p=*/false)
11457 /* Look for the optional nested-name-specifier. The simplest way to
11462 The keyword `typename' is not permitted in a base-specifier or
11463 mem-initializer; in these contexts a qualified name that
11464 depends on a template-parameter is implicitly assumed to be a
11467 is to assume that we have seen the `typename' keyword at this
11469 nested_name_specifier_p
11470 = (cp_parser_nested_name_specifier_opt (parser
,
11471 /*typename_keyword_p=*/true,
11472 /*check_dependency_p=*/true,
11474 /*is_declaration=*/true)
11476 if (nested_name_specifier_p
)
11477 template_p
= cp_parser_optional_template_keyword (parser
);
11478 /* If there is a `::' operator or a nested-name-specifier, then we
11479 are definitely looking for a class-name. */
11480 if (global_scope_p
|| nested_name_specifier_p
)
11481 return cp_parser_class_name (parser
,
11482 /*typename_keyword_p=*/true,
11483 /*template_keyword_p=*/template_p
,
11485 /*check_dependency_p=*/true,
11486 /*class_head_p=*/false,
11487 /*is_declaration=*/true);
11488 /* Otherwise, we could also be looking for an ordinary identifier. */
11489 cp_parser_parse_tentatively (parser
);
11490 /* Try a class-name. */
11491 id
= cp_parser_class_name (parser
,
11492 /*typename_keyword_p=*/true,
11493 /*template_keyword_p=*/false,
11495 /*check_dependency_p=*/true,
11496 /*class_head_p=*/false,
11497 /*is_declaration=*/true);
11498 /* If we found one, we're done. */
11499 if (cp_parser_parse_definitely (parser
))
11501 /* Otherwise, look for an ordinary identifier. */
11502 return cp_parser_identifier (parser
);
11505 /* Overloading [gram.over] */
11507 /* Parse an operator-function-id.
11509 operator-function-id:
11512 Returns an IDENTIFIER_NODE for the operator which is a
11513 human-readable spelling of the identifier, e.g., `operator +'. */
11516 cp_parser_operator_function_id (cp_parser
* parser
)
11518 /* Look for the `operator' keyword. */
11519 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
11520 return error_mark_node
;
11521 /* And then the name of the operator itself. */
11522 return cp_parser_operator (parser
);
11525 /* Return an identifier node for a user-defined literal operator.
11526 The suffix identifier is chained to the operator name identifier. */
11529 cp_literal_operator_id (const char* name
)
11532 char *buffer
= XNEWVEC (char, strlen (UDLIT_OP_ANSI_PREFIX
)
11533 + strlen (name
) + 10);
11534 sprintf (buffer
, UDLIT_OP_ANSI_FORMAT
, name
);
11535 identifier
= get_identifier (buffer
);
11536 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11541 /* Parse an operator.
11544 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11545 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11546 || ++ -- , ->* -> () []
11553 Returns an IDENTIFIER_NODE for the operator which is a
11554 human-readable spelling of the identifier, e.g., `operator +'. */
11557 cp_parser_operator (cp_parser
* parser
)
11559 tree id
= NULL_TREE
;
11562 /* Peek at the next token. */
11563 token
= cp_lexer_peek_token (parser
->lexer
);
11564 /* Figure out which operator we have. */
11565 switch (token
->type
)
11571 /* The keyword should be either `new' or `delete'. */
11572 if (token
->keyword
== RID_NEW
)
11574 else if (token
->keyword
== RID_DELETE
)
11579 /* Consume the `new' or `delete' token. */
11580 cp_lexer_consume_token (parser
->lexer
);
11582 /* Peek at the next token. */
11583 token
= cp_lexer_peek_token (parser
->lexer
);
11584 /* If it's a `[' token then this is the array variant of the
11586 if (token
->type
== CPP_OPEN_SQUARE
)
11588 /* Consume the `[' token. */
11589 cp_lexer_consume_token (parser
->lexer
);
11590 /* Look for the `]' token. */
11591 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
11592 id
= ansi_opname (op
== NEW_EXPR
11593 ? VEC_NEW_EXPR
: VEC_DELETE_EXPR
);
11595 /* Otherwise, we have the non-array variant. */
11597 id
= ansi_opname (op
);
11603 id
= ansi_opname (PLUS_EXPR
);
11607 id
= ansi_opname (MINUS_EXPR
);
11611 id
= ansi_opname (MULT_EXPR
);
11615 id
= ansi_opname (TRUNC_DIV_EXPR
);
11619 id
= ansi_opname (TRUNC_MOD_EXPR
);
11623 id
= ansi_opname (BIT_XOR_EXPR
);
11627 id
= ansi_opname (BIT_AND_EXPR
);
11631 id
= ansi_opname (BIT_IOR_EXPR
);
11635 id
= ansi_opname (BIT_NOT_EXPR
);
11639 id
= ansi_opname (TRUTH_NOT_EXPR
);
11643 id
= ansi_assopname (NOP_EXPR
);
11647 id
= ansi_opname (LT_EXPR
);
11651 id
= ansi_opname (GT_EXPR
);
11655 id
= ansi_assopname (PLUS_EXPR
);
11659 id
= ansi_assopname (MINUS_EXPR
);
11663 id
= ansi_assopname (MULT_EXPR
);
11667 id
= ansi_assopname (TRUNC_DIV_EXPR
);
11671 id
= ansi_assopname (TRUNC_MOD_EXPR
);
11675 id
= ansi_assopname (BIT_XOR_EXPR
);
11679 id
= ansi_assopname (BIT_AND_EXPR
);
11683 id
= ansi_assopname (BIT_IOR_EXPR
);
11687 id
= ansi_opname (LSHIFT_EXPR
);
11691 id
= ansi_opname (RSHIFT_EXPR
);
11694 case CPP_LSHIFT_EQ
:
11695 id
= ansi_assopname (LSHIFT_EXPR
);
11698 case CPP_RSHIFT_EQ
:
11699 id
= ansi_assopname (RSHIFT_EXPR
);
11703 id
= ansi_opname (EQ_EXPR
);
11707 id
= ansi_opname (NE_EXPR
);
11711 id
= ansi_opname (LE_EXPR
);
11714 case CPP_GREATER_EQ
:
11715 id
= ansi_opname (GE_EXPR
);
11719 id
= ansi_opname (TRUTH_ANDIF_EXPR
);
11723 id
= ansi_opname (TRUTH_ORIF_EXPR
);
11726 case CPP_PLUS_PLUS
:
11727 id
= ansi_opname (POSTINCREMENT_EXPR
);
11730 case CPP_MINUS_MINUS
:
11731 id
= ansi_opname (PREDECREMENT_EXPR
);
11735 id
= ansi_opname (COMPOUND_EXPR
);
11738 case CPP_DEREF_STAR
:
11739 id
= ansi_opname (MEMBER_REF
);
11743 id
= ansi_opname (COMPONENT_REF
);
11746 case CPP_OPEN_PAREN
:
11747 /* Consume the `('. */
11748 cp_lexer_consume_token (parser
->lexer
);
11749 /* Look for the matching `)'. */
11750 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
11751 return ansi_opname (CALL_EXPR
);
11753 case CPP_OPEN_SQUARE
:
11754 /* Consume the `['. */
11755 cp_lexer_consume_token (parser
->lexer
);
11756 /* Look for the matching `]'. */
11757 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
11758 return ansi_opname (ARRAY_REF
);
11761 if (cxx_dialect
== cxx98
)
11762 maybe_warn_cpp0x (CPP0X_USER_DEFINED_LITERALS
);
11763 if (TREE_STRING_LENGTH (token
->u
.value
) > 2)
11765 error ("expected empty string after %<operator%> keyword");
11766 return error_mark_node
;
11768 /* Consume the string. */
11769 cp_lexer_consume_token (parser
->lexer
);
11770 /* Look for the suffix identifier. */
11771 token
= cp_lexer_peek_token (parser
->lexer
);
11772 if (token
->type
== CPP_NAME
)
11774 id
= cp_parser_identifier (parser
);
11775 if (id
!= error_mark_node
)
11777 const char *name
= IDENTIFIER_POINTER (id
);
11778 return cp_literal_operator_id (name
);
11783 error ("expected suffix identifier");
11784 return error_mark_node
;
11787 case CPP_STRING_USERDEF
:
11788 error ("missing space between %<\"\"%> and suffix identifier");
11789 return error_mark_node
;
11792 /* Anything else is an error. */
11796 /* If we have selected an identifier, we need to consume the
11799 cp_lexer_consume_token (parser
->lexer
);
11800 /* Otherwise, no valid operator name was present. */
11803 cp_parser_error (parser
, "expected operator");
11804 id
= error_mark_node
;
11810 /* Parse a template-declaration.
11812 template-declaration:
11813 export [opt] template < template-parameter-list > declaration
11815 If MEMBER_P is TRUE, this template-declaration occurs within a
11818 The grammar rule given by the standard isn't correct. What
11819 is really meant is:
11821 template-declaration:
11822 export [opt] template-parameter-list-seq
11823 decl-specifier-seq [opt] init-declarator [opt] ;
11824 export [opt] template-parameter-list-seq
11825 function-definition
11827 template-parameter-list-seq:
11828 template-parameter-list-seq [opt]
11829 template < template-parameter-list > */
11832 cp_parser_template_declaration (cp_parser
* parser
, bool member_p
)
11834 /* Check for `export'. */
11835 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXPORT
))
11837 /* Consume the `export' token. */
11838 cp_lexer_consume_token (parser
->lexer
);
11839 /* Warn that we do not support `export'. */
11840 warning (0, "keyword %<export%> not implemented, and will be ignored");
11843 cp_parser_template_declaration_after_export (parser
, member_p
);
11846 /* Parse a template-parameter-list.
11848 template-parameter-list:
11850 template-parameter-list , template-parameter
11852 Returns a TREE_LIST. Each node represents a template parameter.
11853 The nodes are connected via their TREE_CHAINs. */
11856 cp_parser_template_parameter_list (cp_parser
* parser
)
11858 tree parameter_list
= NULL_TREE
;
11860 begin_template_parm_list ();
11862 /* The loop below parses the template parms. We first need to know
11863 the total number of template parms to be able to compute proper
11864 canonical types of each dependent type. So after the loop, when
11865 we know the total number of template parms,
11866 end_template_parm_list computes the proper canonical types and
11867 fixes up the dependent types accordingly. */
11872 bool is_parameter_pack
;
11873 location_t parm_loc
;
11875 /* Parse the template-parameter. */
11876 parm_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
11877 parameter
= cp_parser_template_parameter (parser
,
11879 &is_parameter_pack
);
11880 /* Add it to the list. */
11881 if (parameter
!= error_mark_node
)
11882 parameter_list
= process_template_parm (parameter_list
,
11890 tree err_parm
= build_tree_list (parameter
, parameter
);
11891 parameter_list
= chainon (parameter_list
, err_parm
);
11894 /* If the next token is not a `,', we're done. */
11895 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
11897 /* Otherwise, consume the `,' token. */
11898 cp_lexer_consume_token (parser
->lexer
);
11901 return end_template_parm_list (parameter_list
);
11904 /* Parse a template-parameter.
11906 template-parameter:
11908 parameter-declaration
11910 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
11911 the parameter. The TREE_PURPOSE is the default value, if any.
11912 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
11913 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
11914 set to true iff this parameter is a parameter pack. */
11917 cp_parser_template_parameter (cp_parser
* parser
, bool *is_non_type
,
11918 bool *is_parameter_pack
)
11921 cp_parameter_declarator
*parameter_declarator
;
11922 cp_declarator
*id_declarator
;
11925 /* Assume it is a type parameter or a template parameter. */
11926 *is_non_type
= false;
11927 /* Assume it not a parameter pack. */
11928 *is_parameter_pack
= false;
11929 /* Peek at the next token. */
11930 token
= cp_lexer_peek_token (parser
->lexer
);
11931 /* If it is `class' or `template', we have a type-parameter. */
11932 if (token
->keyword
== RID_TEMPLATE
)
11933 return cp_parser_type_parameter (parser
, is_parameter_pack
);
11934 /* If it is `class' or `typename' we do not know yet whether it is a
11935 type parameter or a non-type parameter. Consider:
11937 template <typename T, typename T::X X> ...
11941 template <class C, class D*> ...
11943 Here, the first parameter is a type parameter, and the second is
11944 a non-type parameter. We can tell by looking at the token after
11945 the identifier -- if it is a `,', `=', or `>' then we have a type
11947 if (token
->keyword
== RID_TYPENAME
|| token
->keyword
== RID_CLASS
)
11949 /* Peek at the token after `class' or `typename'. */
11950 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
11951 /* If it's an ellipsis, we have a template type parameter
11953 if (token
->type
== CPP_ELLIPSIS
)
11954 return cp_parser_type_parameter (parser
, is_parameter_pack
);
11955 /* If it's an identifier, skip it. */
11956 if (token
->type
== CPP_NAME
)
11957 token
= cp_lexer_peek_nth_token (parser
->lexer
, 3);
11958 /* Now, see if the token looks like the end of a template
11960 if (token
->type
== CPP_COMMA
11961 || token
->type
== CPP_EQ
11962 || token
->type
== CPP_GREATER
)
11963 return cp_parser_type_parameter (parser
, is_parameter_pack
);
11966 /* Otherwise, it is a non-type parameter.
11970 When parsing a default template-argument for a non-type
11971 template-parameter, the first non-nested `>' is taken as the end
11972 of the template parameter-list rather than a greater-than
11974 *is_non_type
= true;
11975 parameter_declarator
11976 = cp_parser_parameter_declaration (parser
, /*template_parm_p=*/true,
11977 /*parenthesized_p=*/NULL
);
11979 /* If the parameter declaration is marked as a parameter pack, set
11980 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
11981 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
11983 if (parameter_declarator
11984 && parameter_declarator
->declarator
11985 && parameter_declarator
->declarator
->parameter_pack_p
)
11987 *is_parameter_pack
= true;
11988 parameter_declarator
->declarator
->parameter_pack_p
= false;
11991 /* If the next token is an ellipsis, and we don't already have it
11992 marked as a parameter pack, then we have a parameter pack (that
11993 has no declarator). */
11994 if (!*is_parameter_pack
11995 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
11996 && declarator_can_be_parameter_pack (parameter_declarator
->declarator
))
11998 /* Consume the `...'. */
11999 cp_lexer_consume_token (parser
->lexer
);
12000 maybe_warn_variadic_templates ();
12002 *is_parameter_pack
= true;
12004 /* We might end up with a pack expansion as the type of the non-type
12005 template parameter, in which case this is a non-type template
12007 else if (parameter_declarator
12008 && parameter_declarator
->decl_specifiers
.type
12009 && PACK_EXPANSION_P (parameter_declarator
->decl_specifiers
.type
))
12011 *is_parameter_pack
= true;
12012 parameter_declarator
->decl_specifiers
.type
=
12013 PACK_EXPANSION_PATTERN (parameter_declarator
->decl_specifiers
.type
);
12016 if (*is_parameter_pack
&& cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
12018 /* Parameter packs cannot have default arguments. However, a
12019 user may try to do so, so we'll parse them and give an
12020 appropriate diagnostic here. */
12022 cp_token
*start_token
= cp_lexer_peek_token (parser
->lexer
);
12024 /* Find the name of the parameter pack. */
12025 id_declarator
= parameter_declarator
->declarator
;
12026 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
12027 id_declarator
= id_declarator
->declarator
;
12029 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
12030 error_at (start_token
->location
,
12031 "template parameter pack %qD cannot have a default argument",
12032 id_declarator
->u
.id
.unqualified_name
);
12034 error_at (start_token
->location
,
12035 "template parameter pack cannot have a default argument");
12037 /* Parse the default argument, but throw away the result. */
12038 cp_parser_default_argument (parser
, /*template_parm_p=*/true);
12041 parm
= grokdeclarator (parameter_declarator
->declarator
,
12042 ¶meter_declarator
->decl_specifiers
,
12043 TPARM
, /*initialized=*/0,
12044 /*attrlist=*/NULL
);
12045 if (parm
== error_mark_node
)
12046 return error_mark_node
;
12048 return build_tree_list (parameter_declarator
->default_argument
, parm
);
12051 /* Parse a type-parameter.
12054 class identifier [opt]
12055 class identifier [opt] = type-id
12056 typename identifier [opt]
12057 typename identifier [opt] = type-id
12058 template < template-parameter-list > class identifier [opt]
12059 template < template-parameter-list > class identifier [opt]
12062 GNU Extension (variadic templates):
12065 class ... identifier [opt]
12066 typename ... identifier [opt]
12068 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12069 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12070 the declaration of the parameter.
12072 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12075 cp_parser_type_parameter (cp_parser
* parser
, bool *is_parameter_pack
)
12080 /* Look for a keyword to tell us what kind of parameter this is. */
12081 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_TYPENAME_TEMPLATE
);
12083 return error_mark_node
;
12085 switch (token
->keyword
)
12091 tree default_argument
;
12093 /* If the next token is an ellipsis, we have a template
12095 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
12097 /* Consume the `...' token. */
12098 cp_lexer_consume_token (parser
->lexer
);
12099 maybe_warn_variadic_templates ();
12101 *is_parameter_pack
= true;
12104 /* If the next token is an identifier, then it names the
12106 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
12107 identifier
= cp_parser_identifier (parser
);
12109 identifier
= NULL_TREE
;
12111 /* Create the parameter. */
12112 parameter
= finish_template_type_parm (class_type_node
, identifier
);
12114 /* If the next token is an `=', we have a default argument. */
12115 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
12117 /* Consume the `=' token. */
12118 cp_lexer_consume_token (parser
->lexer
);
12119 /* Parse the default-argument. */
12120 push_deferring_access_checks (dk_no_deferred
);
12121 default_argument
= cp_parser_type_id (parser
);
12123 /* Template parameter packs cannot have default
12125 if (*is_parameter_pack
)
12128 error_at (token
->location
,
12129 "template parameter pack %qD cannot have a "
12130 "default argument", identifier
);
12132 error_at (token
->location
,
12133 "template parameter packs cannot have "
12134 "default arguments");
12135 default_argument
= NULL_TREE
;
12137 pop_deferring_access_checks ();
12140 default_argument
= NULL_TREE
;
12142 /* Create the combined representation of the parameter and the
12143 default argument. */
12144 parameter
= build_tree_list (default_argument
, parameter
);
12151 tree default_argument
;
12153 /* Look for the `<'. */
12154 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
12155 /* Parse the template-parameter-list. */
12156 cp_parser_template_parameter_list (parser
);
12157 /* Look for the `>'. */
12158 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
12159 /* Look for the `class' keyword. */
12160 cp_parser_require_keyword (parser
, RID_CLASS
, RT_CLASS
);
12161 /* If the next token is an ellipsis, we have a template
12163 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
12165 /* Consume the `...' token. */
12166 cp_lexer_consume_token (parser
->lexer
);
12167 maybe_warn_variadic_templates ();
12169 *is_parameter_pack
= true;
12171 /* If the next token is an `=', then there is a
12172 default-argument. If the next token is a `>', we are at
12173 the end of the parameter-list. If the next token is a `,',
12174 then we are at the end of this parameter. */
12175 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
12176 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_GREATER
)
12177 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
12179 identifier
= cp_parser_identifier (parser
);
12180 /* Treat invalid names as if the parameter were nameless. */
12181 if (identifier
== error_mark_node
)
12182 identifier
= NULL_TREE
;
12185 identifier
= NULL_TREE
;
12187 /* Create the template parameter. */
12188 parameter
= finish_template_template_parm (class_type_node
,
12191 /* If the next token is an `=', then there is a
12192 default-argument. */
12193 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
12197 /* Consume the `='. */
12198 cp_lexer_consume_token (parser
->lexer
);
12199 /* Parse the id-expression. */
12200 push_deferring_access_checks (dk_no_deferred
);
12201 /* save token before parsing the id-expression, for error
12203 token
= cp_lexer_peek_token (parser
->lexer
);
12205 = cp_parser_id_expression (parser
,
12206 /*template_keyword_p=*/false,
12207 /*check_dependency_p=*/true,
12208 /*template_p=*/&is_template
,
12209 /*declarator_p=*/false,
12210 /*optional_p=*/false);
12211 if (TREE_CODE (default_argument
) == TYPE_DECL
)
12212 /* If the id-expression was a template-id that refers to
12213 a template-class, we already have the declaration here,
12214 so no further lookup is needed. */
12217 /* Look up the name. */
12219 = cp_parser_lookup_name (parser
, default_argument
,
12221 /*is_template=*/is_template
,
12222 /*is_namespace=*/false,
12223 /*check_dependency=*/true,
12224 /*ambiguous_decls=*/NULL
,
12226 /* See if the default argument is valid. */
12228 = check_template_template_default_arg (default_argument
);
12230 /* Template parameter packs cannot have default
12232 if (*is_parameter_pack
)
12235 error_at (token
->location
,
12236 "template parameter pack %qD cannot "
12237 "have a default argument",
12240 error_at (token
->location
, "template parameter packs cannot "
12241 "have default arguments");
12242 default_argument
= NULL_TREE
;
12244 pop_deferring_access_checks ();
12247 default_argument
= NULL_TREE
;
12249 /* Create the combined representation of the parameter and the
12250 default argument. */
12251 parameter
= build_tree_list (default_argument
, parameter
);
12256 gcc_unreachable ();
12263 /* Parse a template-id.
12266 template-name < template-argument-list [opt] >
12268 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12269 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12270 returned. Otherwise, if the template-name names a function, or set
12271 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12272 names a class, returns a TYPE_DECL for the specialization.
12274 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12275 uninstantiated templates. */
12278 cp_parser_template_id (cp_parser
*parser
,
12279 bool template_keyword_p
,
12280 bool check_dependency_p
,
12281 bool is_declaration
)
12287 cp_token_position start_of_id
= 0;
12288 deferred_access_check
*chk
;
12289 VEC (deferred_access_check
,gc
) *access_check
;
12290 cp_token
*next_token
= NULL
, *next_token_2
= NULL
;
12291 bool is_identifier
;
12293 /* If the next token corresponds to a template-id, there is no need
12295 next_token
= cp_lexer_peek_token (parser
->lexer
);
12296 if (next_token
->type
== CPP_TEMPLATE_ID
)
12298 struct tree_check
*check_value
;
12300 /* Get the stored value. */
12301 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
12302 /* Perform any access checks that were deferred. */
12303 access_check
= check_value
->checks
;
12306 FOR_EACH_VEC_ELT (deferred_access_check
, access_check
, i
, chk
)
12307 perform_or_defer_access_check (chk
->binfo
,
12311 /* Return the stored value. */
12312 return check_value
->value
;
12315 /* Avoid performing name lookup if there is no possibility of
12316 finding a template-id. */
12317 if ((next_token
->type
!= CPP_NAME
&& next_token
->keyword
!= RID_OPERATOR
)
12318 || (next_token
->type
== CPP_NAME
12319 && !cp_parser_nth_token_starts_template_argument_list_p
12322 cp_parser_error (parser
, "expected template-id");
12323 return error_mark_node
;
12326 /* Remember where the template-id starts. */
12327 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
12328 start_of_id
= cp_lexer_token_position (parser
->lexer
, false);
12330 push_deferring_access_checks (dk_deferred
);
12332 /* Parse the template-name. */
12333 is_identifier
= false;
12334 templ
= cp_parser_template_name (parser
, template_keyword_p
,
12335 check_dependency_p
,
12338 if (templ
== error_mark_node
|| is_identifier
)
12340 pop_deferring_access_checks ();
12344 /* If we find the sequence `[:' after a template-name, it's probably
12345 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12346 parse correctly the argument list. */
12347 next_token
= cp_lexer_peek_token (parser
->lexer
);
12348 next_token_2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
12349 if (next_token
->type
== CPP_OPEN_SQUARE
12350 && next_token
->flags
& DIGRAPH
12351 && next_token_2
->type
== CPP_COLON
12352 && !(next_token_2
->flags
& PREV_WHITE
))
12354 cp_parser_parse_tentatively (parser
);
12355 /* Change `:' into `::'. */
12356 next_token_2
->type
= CPP_SCOPE
;
12357 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12359 cp_lexer_consume_token (parser
->lexer
);
12361 /* Parse the arguments. */
12362 arguments
= cp_parser_enclosed_template_argument_list (parser
);
12363 if (!cp_parser_parse_definitely (parser
))
12365 /* If we couldn't parse an argument list, then we revert our changes
12366 and return simply an error. Maybe this is not a template-id
12368 next_token_2
->type
= CPP_COLON
;
12369 cp_parser_error (parser
, "expected %<<%>");
12370 pop_deferring_access_checks ();
12371 return error_mark_node
;
12373 /* Otherwise, emit an error about the invalid digraph, but continue
12374 parsing because we got our argument list. */
12375 if (permerror (next_token
->location
,
12376 "%<<::%> cannot begin a template-argument list"))
12378 static bool hint
= false;
12379 inform (next_token
->location
,
12380 "%<<:%> is an alternate spelling for %<[%>."
12381 " Insert whitespace between %<<%> and %<::%>");
12382 if (!hint
&& !flag_permissive
)
12384 inform (next_token
->location
, "(if you use %<-fpermissive%>"
12385 " G++ will accept your code)");
12392 /* Look for the `<' that starts the template-argument-list. */
12393 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
12395 pop_deferring_access_checks ();
12396 return error_mark_node
;
12398 /* Parse the arguments. */
12399 arguments
= cp_parser_enclosed_template_argument_list (parser
);
12402 /* Build a representation of the specialization. */
12403 if (TREE_CODE (templ
) == IDENTIFIER_NODE
)
12404 template_id
= build_min_nt (TEMPLATE_ID_EXPR
, templ
, arguments
);
12405 else if (DECL_TYPE_TEMPLATE_P (templ
)
12406 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
12408 bool entering_scope
;
12409 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12410 template (rather than some instantiation thereof) only if
12411 is not nested within some other construct. For example, in
12412 "template <typename T> void f(T) { A<T>::", A<T> is just an
12413 instantiation of A. */
12414 entering_scope
= (template_parm_scope_p ()
12415 && cp_lexer_next_token_is (parser
->lexer
,
12418 = finish_template_type (templ
, arguments
, entering_scope
);
12422 /* If it's not a class-template or a template-template, it should be
12423 a function-template. */
12424 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ
)
12425 || TREE_CODE (templ
) == OVERLOAD
12426 || BASELINK_P (templ
)));
12428 template_id
= lookup_template_function (templ
, arguments
);
12431 /* If parsing tentatively, replace the sequence of tokens that makes
12432 up the template-id with a CPP_TEMPLATE_ID token. That way,
12433 should we re-parse the token stream, we will not have to repeat
12434 the effort required to do the parse, nor will we issue duplicate
12435 error messages about problems during instantiation of the
12439 cp_token
*token
= cp_lexer_token_at (parser
->lexer
, start_of_id
);
12441 /* Reset the contents of the START_OF_ID token. */
12442 token
->type
= CPP_TEMPLATE_ID
;
12443 /* Retrieve any deferred checks. Do not pop this access checks yet
12444 so the memory will not be reclaimed during token replacing below. */
12445 token
->u
.tree_check_value
= ggc_alloc_cleared_tree_check ();
12446 token
->u
.tree_check_value
->value
= template_id
;
12447 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
12448 token
->keyword
= RID_MAX
;
12450 /* Purge all subsequent tokens. */
12451 cp_lexer_purge_tokens_after (parser
->lexer
, start_of_id
);
12453 /* ??? Can we actually assume that, if template_id ==
12454 error_mark_node, we will have issued a diagnostic to the
12455 user, as opposed to simply marking the tentative parse as
12457 if (cp_parser_error_occurred (parser
) && template_id
!= error_mark_node
)
12458 error_at (token
->location
, "parse error in template argument list");
12461 pop_deferring_access_checks ();
12462 return template_id
;
12465 /* Parse a template-name.
12470 The standard should actually say:
12474 operator-function-id
12476 A defect report has been filed about this issue.
12478 A conversion-function-id cannot be a template name because they cannot
12479 be part of a template-id. In fact, looking at this code:
12481 a.operator K<int>()
12483 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12484 It is impossible to call a templated conversion-function-id with an
12485 explicit argument list, since the only allowed template parameter is
12486 the type to which it is converting.
12488 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12489 `template' keyword, in a construction like:
12493 In that case `f' is taken to be a template-name, even though there
12494 is no way of knowing for sure.
12496 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12497 name refers to a set of overloaded functions, at least one of which
12498 is a template, or an IDENTIFIER_NODE with the name of the template,
12499 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12500 names are looked up inside uninstantiated templates. */
12503 cp_parser_template_name (cp_parser
* parser
,
12504 bool template_keyword_p
,
12505 bool check_dependency_p
,
12506 bool is_declaration
,
12507 bool *is_identifier
)
12512 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12514 /* If the next token is `operator', then we have either an
12515 operator-function-id or a conversion-function-id. */
12516 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_OPERATOR
))
12518 /* We don't know whether we're looking at an
12519 operator-function-id or a conversion-function-id. */
12520 cp_parser_parse_tentatively (parser
);
12521 /* Try an operator-function-id. */
12522 identifier
= cp_parser_operator_function_id (parser
);
12523 /* If that didn't work, try a conversion-function-id. */
12524 if (!cp_parser_parse_definitely (parser
))
12526 cp_parser_error (parser
, "expected template-name");
12527 return error_mark_node
;
12530 /* Look for the identifier. */
12532 identifier
= cp_parser_identifier (parser
);
12534 /* If we didn't find an identifier, we don't have a template-id. */
12535 if (identifier
== error_mark_node
)
12536 return error_mark_node
;
12538 /* If the name immediately followed the `template' keyword, then it
12539 is a template-name. However, if the next token is not `<', then
12540 we do not treat it as a template-name, since it is not being used
12541 as part of a template-id. This enables us to handle constructs
12544 template <typename T> struct S { S(); };
12545 template <typename T> S<T>::S();
12547 correctly. We would treat `S' as a template -- if it were `S<T>'
12548 -- but we do not if there is no `<'. */
12550 if (processing_template_decl
12551 && cp_parser_nth_token_starts_template_argument_list_p (parser
, 1))
12553 /* In a declaration, in a dependent context, we pretend that the
12554 "template" keyword was present in order to improve error
12555 recovery. For example, given:
12557 template <typename T> void f(T::X<int>);
12559 we want to treat "X<int>" as a template-id. */
12561 && !template_keyword_p
12562 && parser
->scope
&& TYPE_P (parser
->scope
)
12563 && check_dependency_p
12564 && dependent_scope_p (parser
->scope
)
12565 /* Do not do this for dtors (or ctors), since they never
12566 need the template keyword before their name. */
12567 && !constructor_name_p (identifier
, parser
->scope
))
12569 cp_token_position start
= 0;
12571 /* Explain what went wrong. */
12572 error_at (token
->location
, "non-template %qD used as template",
12574 inform (token
->location
, "use %<%T::template %D%> to indicate that it is a template",
12575 parser
->scope
, identifier
);
12576 /* If parsing tentatively, find the location of the "<" token. */
12577 if (cp_parser_simulate_error (parser
))
12578 start
= cp_lexer_token_position (parser
->lexer
, true);
12579 /* Parse the template arguments so that we can issue error
12580 messages about them. */
12581 cp_lexer_consume_token (parser
->lexer
);
12582 cp_parser_enclosed_template_argument_list (parser
);
12583 /* Skip tokens until we find a good place from which to
12584 continue parsing. */
12585 cp_parser_skip_to_closing_parenthesis (parser
,
12586 /*recovering=*/true,
12588 /*consume_paren=*/false);
12589 /* If parsing tentatively, permanently remove the
12590 template argument list. That will prevent duplicate
12591 error messages from being issued about the missing
12592 "template" keyword. */
12594 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
12596 *is_identifier
= true;
12600 /* If the "template" keyword is present, then there is generally
12601 no point in doing name-lookup, so we just return IDENTIFIER.
12602 But, if the qualifying scope is non-dependent then we can
12603 (and must) do name-lookup normally. */
12604 if (template_keyword_p
12606 || (TYPE_P (parser
->scope
)
12607 && dependent_type_p (parser
->scope
))))
12611 /* Look up the name. */
12612 decl
= cp_parser_lookup_name (parser
, identifier
,
12614 /*is_template=*/true,
12615 /*is_namespace=*/false,
12616 check_dependency_p
,
12617 /*ambiguous_decls=*/NULL
,
12620 /* If DECL is a template, then the name was a template-name. */
12621 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
12625 tree fn
= NULL_TREE
;
12627 /* The standard does not explicitly indicate whether a name that
12628 names a set of overloaded declarations, some of which are
12629 templates, is a template-name. However, such a name should
12630 be a template-name; otherwise, there is no way to form a
12631 template-id for the overloaded templates. */
12632 fns
= BASELINK_P (decl
) ? BASELINK_FUNCTIONS (decl
) : decl
;
12633 if (TREE_CODE (fns
) == OVERLOAD
)
12634 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
12635 if (TREE_CODE (OVL_CURRENT (fn
)) == TEMPLATE_DECL
)
12640 /* The name does not name a template. */
12641 cp_parser_error (parser
, "expected template-name");
12642 return error_mark_node
;
12646 /* If DECL is dependent, and refers to a function, then just return
12647 its name; we will look it up again during template instantiation. */
12648 if (DECL_FUNCTION_TEMPLATE_P (decl
) || !DECL_P (decl
))
12650 tree scope
= CP_DECL_CONTEXT (get_first_fn (decl
));
12651 if (TYPE_P (scope
) && dependent_type_p (scope
))
12658 /* Parse a template-argument-list.
12660 template-argument-list:
12661 template-argument ... [opt]
12662 template-argument-list , template-argument ... [opt]
12664 Returns a TREE_VEC containing the arguments. */
12667 cp_parser_template_argument_list (cp_parser
* parser
)
12669 tree fixed_args
[10];
12670 unsigned n_args
= 0;
12671 unsigned alloced
= 10;
12672 tree
*arg_ary
= fixed_args
;
12674 bool saved_in_template_argument_list_p
;
12676 bool saved_non_ice_p
;
12678 saved_in_template_argument_list_p
= parser
->in_template_argument_list_p
;
12679 parser
->in_template_argument_list_p
= true;
12680 /* Even if the template-id appears in an integral
12681 constant-expression, the contents of the argument list do
12683 saved_ice_p
= parser
->integral_constant_expression_p
;
12684 parser
->integral_constant_expression_p
= false;
12685 saved_non_ice_p
= parser
->non_integral_constant_expression_p
;
12686 parser
->non_integral_constant_expression_p
= false;
12688 /* Parse the arguments. */
12694 /* Consume the comma. */
12695 cp_lexer_consume_token (parser
->lexer
);
12697 /* Parse the template-argument. */
12698 argument
= cp_parser_template_argument (parser
);
12700 /* If the next token is an ellipsis, we're expanding a template
12702 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
12704 if (argument
== error_mark_node
)
12706 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12707 error_at (token
->location
,
12708 "expected parameter pack before %<...%>");
12710 /* Consume the `...' token. */
12711 cp_lexer_consume_token (parser
->lexer
);
12713 /* Make the argument into a TYPE_PACK_EXPANSION or
12714 EXPR_PACK_EXPANSION. */
12715 argument
= make_pack_expansion (argument
);
12718 if (n_args
== alloced
)
12722 if (arg_ary
== fixed_args
)
12724 arg_ary
= XNEWVEC (tree
, alloced
);
12725 memcpy (arg_ary
, fixed_args
, sizeof (tree
) * n_args
);
12728 arg_ary
= XRESIZEVEC (tree
, arg_ary
, alloced
);
12730 arg_ary
[n_args
++] = argument
;
12732 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
12734 vec
= make_tree_vec (n_args
);
12737 TREE_VEC_ELT (vec
, n_args
) = arg_ary
[n_args
];
12739 if (arg_ary
!= fixed_args
)
12741 parser
->non_integral_constant_expression_p
= saved_non_ice_p
;
12742 parser
->integral_constant_expression_p
= saved_ice_p
;
12743 parser
->in_template_argument_list_p
= saved_in_template_argument_list_p
;
12744 #ifdef ENABLE_CHECKING
12745 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
12750 /* Parse a template-argument.
12753 assignment-expression
12757 The representation is that of an assignment-expression, type-id, or
12758 id-expression -- except that the qualified id-expression is
12759 evaluated, so that the value returned is either a DECL or an
12762 Although the standard says "assignment-expression", it forbids
12763 throw-expressions or assignments in the template argument.
12764 Therefore, we use "conditional-expression" instead. */
12767 cp_parser_template_argument (cp_parser
* parser
)
12772 bool maybe_type_id
= false;
12773 cp_token
*token
= NULL
, *argument_start_token
= NULL
;
12776 /* There's really no way to know what we're looking at, so we just
12777 try each alternative in order.
12781 In a template-argument, an ambiguity between a type-id and an
12782 expression is resolved to a type-id, regardless of the form of
12783 the corresponding template-parameter.
12785 Therefore, we try a type-id first. */
12786 cp_parser_parse_tentatively (parser
);
12787 argument
= cp_parser_template_type_arg (parser
);
12788 /* If there was no error parsing the type-id but the next token is a
12789 '>>', our behavior depends on which dialect of C++ we're
12790 parsing. In C++98, we probably found a typo for '> >'. But there
12791 are type-id which are also valid expressions. For instance:
12793 struct X { int operator >> (int); };
12794 template <int V> struct Foo {};
12797 Here 'X()' is a valid type-id of a function type, but the user just
12798 wanted to write the expression "X() >> 5". Thus, we remember that we
12799 found a valid type-id, but we still try to parse the argument as an
12800 expression to see what happens.
12802 In C++0x, the '>>' will be considered two separate '>'
12804 if (!cp_parser_error_occurred (parser
)
12805 && cxx_dialect
== cxx98
12806 && cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
12808 maybe_type_id
= true;
12809 cp_parser_abort_tentative_parse (parser
);
12813 /* If the next token isn't a `,' or a `>', then this argument wasn't
12814 really finished. This means that the argument is not a valid
12816 if (!cp_parser_next_token_ends_template_argument_p (parser
))
12817 cp_parser_error (parser
, "expected template-argument");
12818 /* If that worked, we're done. */
12819 if (cp_parser_parse_definitely (parser
))
12822 /* We're still not sure what the argument will be. */
12823 cp_parser_parse_tentatively (parser
);
12824 /* Try a template. */
12825 argument_start_token
= cp_lexer_peek_token (parser
->lexer
);
12826 argument
= cp_parser_id_expression (parser
,
12827 /*template_keyword_p=*/false,
12828 /*check_dependency_p=*/true,
12830 /*declarator_p=*/false,
12831 /*optional_p=*/false);
12832 /* If the next token isn't a `,' or a `>', then this argument wasn't
12833 really finished. */
12834 if (!cp_parser_next_token_ends_template_argument_p (parser
))
12835 cp_parser_error (parser
, "expected template-argument");
12836 if (!cp_parser_error_occurred (parser
))
12838 /* Figure out what is being referred to. If the id-expression
12839 was for a class template specialization, then we will have a
12840 TYPE_DECL at this point. There is no need to do name lookup
12841 at this point in that case. */
12842 if (TREE_CODE (argument
) != TYPE_DECL
)
12843 argument
= cp_parser_lookup_name (parser
, argument
,
12845 /*is_template=*/template_p
,
12846 /*is_namespace=*/false,
12847 /*check_dependency=*/true,
12848 /*ambiguous_decls=*/NULL
,
12849 argument_start_token
->location
);
12850 if (TREE_CODE (argument
) != TEMPLATE_DECL
12851 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
12852 cp_parser_error (parser
, "expected template-name");
12854 if (cp_parser_parse_definitely (parser
))
12856 /* It must be a non-type argument. There permitted cases are given
12857 in [temp.arg.nontype]:
12859 -- an integral constant-expression of integral or enumeration
12862 -- the name of a non-type template-parameter; or
12864 -- the name of an object or function with external linkage...
12866 -- the address of an object or function with external linkage...
12868 -- a pointer to member... */
12869 /* Look for a non-type template parameter. */
12870 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
12872 cp_parser_parse_tentatively (parser
);
12873 argument
= cp_parser_primary_expression (parser
,
12874 /*address_p=*/false,
12876 /*template_arg_p=*/true,
12878 if (TREE_CODE (argument
) != TEMPLATE_PARM_INDEX
12879 || !cp_parser_next_token_ends_template_argument_p (parser
))
12880 cp_parser_simulate_error (parser
);
12881 if (cp_parser_parse_definitely (parser
))
12885 /* If the next token is "&", the argument must be the address of an
12886 object or function with external linkage. */
12887 address_p
= cp_lexer_next_token_is (parser
->lexer
, CPP_AND
);
12889 cp_lexer_consume_token (parser
->lexer
);
12890 /* See if we might have an id-expression. */
12891 token
= cp_lexer_peek_token (parser
->lexer
);
12892 if (token
->type
== CPP_NAME
12893 || token
->keyword
== RID_OPERATOR
12894 || token
->type
== CPP_SCOPE
12895 || token
->type
== CPP_TEMPLATE_ID
12896 || token
->type
== CPP_NESTED_NAME_SPECIFIER
)
12898 cp_parser_parse_tentatively (parser
);
12899 argument
= cp_parser_primary_expression (parser
,
12902 /*template_arg_p=*/true,
12904 if (cp_parser_error_occurred (parser
)
12905 || !cp_parser_next_token_ends_template_argument_p (parser
))
12906 cp_parser_abort_tentative_parse (parser
);
12911 if (TREE_CODE (argument
) == INDIRECT_REF
)
12913 gcc_assert (REFERENCE_REF_P (argument
));
12914 argument
= TREE_OPERAND (argument
, 0);
12917 /* If we're in a template, we represent a qualified-id referring
12918 to a static data member as a SCOPE_REF even if the scope isn't
12919 dependent so that we can check access control later. */
12921 if (TREE_CODE (probe
) == SCOPE_REF
)
12922 probe
= TREE_OPERAND (probe
, 1);
12923 if (TREE_CODE (probe
) == VAR_DECL
)
12925 /* A variable without external linkage might still be a
12926 valid constant-expression, so no error is issued here
12927 if the external-linkage check fails. */
12928 if (!address_p
&& !DECL_EXTERNAL_LINKAGE_P (probe
))
12929 cp_parser_simulate_error (parser
);
12931 else if (is_overloaded_fn (argument
))
12932 /* All overloaded functions are allowed; if the external
12933 linkage test does not pass, an error will be issued
12937 && (TREE_CODE (argument
) == OFFSET_REF
12938 || TREE_CODE (argument
) == SCOPE_REF
))
12939 /* A pointer-to-member. */
12941 else if (TREE_CODE (argument
) == TEMPLATE_PARM_INDEX
)
12944 cp_parser_simulate_error (parser
);
12946 if (cp_parser_parse_definitely (parser
))
12949 argument
= build_x_unary_op (ADDR_EXPR
, argument
,
12950 tf_warning_or_error
);
12955 /* If the argument started with "&", there are no other valid
12956 alternatives at this point. */
12959 cp_parser_error (parser
, "invalid non-type template argument");
12960 return error_mark_node
;
12963 /* If the argument wasn't successfully parsed as a type-id followed
12964 by '>>', the argument can only be a constant expression now.
12965 Otherwise, we try parsing the constant-expression tentatively,
12966 because the argument could really be a type-id. */
12968 cp_parser_parse_tentatively (parser
);
12969 argument
= cp_parser_constant_expression (parser
,
12970 /*allow_non_constant_p=*/false,
12971 /*non_constant_p=*/NULL
);
12972 argument
= fold_non_dependent_expr (argument
);
12973 if (!maybe_type_id
)
12975 if (!cp_parser_next_token_ends_template_argument_p (parser
))
12976 cp_parser_error (parser
, "expected template-argument");
12977 if (cp_parser_parse_definitely (parser
))
12979 /* We did our best to parse the argument as a non type-id, but that
12980 was the only alternative that matched (albeit with a '>' after
12981 it). We can assume it's just a typo from the user, and a
12982 diagnostic will then be issued. */
12983 return cp_parser_template_type_arg (parser
);
12986 /* Parse an explicit-instantiation.
12988 explicit-instantiation:
12989 template declaration
12991 Although the standard says `declaration', what it really means is:
12993 explicit-instantiation:
12994 template decl-specifier-seq [opt] declarator [opt] ;
12996 Things like `template int S<int>::i = 5, int S<double>::j;' are not
12997 supposed to be allowed. A defect report has been filed about this
13002 explicit-instantiation:
13003 storage-class-specifier template
13004 decl-specifier-seq [opt] declarator [opt] ;
13005 function-specifier template
13006 decl-specifier-seq [opt] declarator [opt] ; */
13009 cp_parser_explicit_instantiation (cp_parser
* parser
)
13011 int declares_class_or_enum
;
13012 cp_decl_specifier_seq decl_specifiers
;
13013 tree extension_specifier
= NULL_TREE
;
13015 timevar_push (TV_TEMPLATE_INST
);
13017 /* Look for an (optional) storage-class-specifier or
13018 function-specifier. */
13019 if (cp_parser_allow_gnu_extensions_p (parser
))
13021 extension_specifier
13022 = cp_parser_storage_class_specifier_opt (parser
);
13023 if (!extension_specifier
)
13024 extension_specifier
13025 = cp_parser_function_specifier_opt (parser
,
13026 /*decl_specs=*/NULL
);
13029 /* Look for the `template' keyword. */
13030 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
13031 /* Let the front end know that we are processing an explicit
13033 begin_explicit_instantiation ();
13034 /* [temp.explicit] says that we are supposed to ignore access
13035 control while processing explicit instantiation directives. */
13036 push_deferring_access_checks (dk_no_check
);
13037 /* Parse a decl-specifier-seq. */
13038 cp_parser_decl_specifier_seq (parser
,
13039 CP_PARSER_FLAGS_OPTIONAL
,
13041 &declares_class_or_enum
);
13042 /* If there was exactly one decl-specifier, and it declared a class,
13043 and there's no declarator, then we have an explicit type
13045 if (declares_class_or_enum
&& cp_parser_declares_only_class_p (parser
))
13049 type
= check_tag_decl (&decl_specifiers
);
13050 /* Turn access control back on for names used during
13051 template instantiation. */
13052 pop_deferring_access_checks ();
13054 do_type_instantiation (type
, extension_specifier
,
13055 /*complain=*/tf_error
);
13059 cp_declarator
*declarator
;
13062 /* Parse the declarator. */
13064 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
13065 /*ctor_dtor_or_conv_p=*/NULL
,
13066 /*parenthesized_p=*/NULL
,
13067 /*member_p=*/false);
13068 if (declares_class_or_enum
& 2)
13069 cp_parser_check_for_definition_in_return_type (declarator
,
13070 decl_specifiers
.type
,
13071 decl_specifiers
.type_location
);
13072 if (declarator
!= cp_error_declarator
)
13074 if (decl_specifiers
.specs
[(int)ds_inline
])
13075 permerror (input_location
, "explicit instantiation shall not use"
13076 " %<inline%> specifier");
13077 if (decl_specifiers
.specs
[(int)ds_constexpr
])
13078 permerror (input_location
, "explicit instantiation shall not use"
13079 " %<constexpr%> specifier");
13081 decl
= grokdeclarator (declarator
, &decl_specifiers
,
13082 NORMAL
, 0, &decl_specifiers
.attributes
);
13083 /* Turn access control back on for names used during
13084 template instantiation. */
13085 pop_deferring_access_checks ();
13086 /* Do the explicit instantiation. */
13087 do_decl_instantiation (decl
, extension_specifier
);
13091 pop_deferring_access_checks ();
13092 /* Skip the body of the explicit instantiation. */
13093 cp_parser_skip_to_end_of_statement (parser
);
13096 /* We're done with the instantiation. */
13097 end_explicit_instantiation ();
13099 cp_parser_consume_semicolon_at_end_of_statement (parser
);
13101 timevar_pop (TV_TEMPLATE_INST
);
13104 /* Parse an explicit-specialization.
13106 explicit-specialization:
13107 template < > declaration
13109 Although the standard says `declaration', what it really means is:
13111 explicit-specialization:
13112 template <> decl-specifier [opt] init-declarator [opt] ;
13113 template <> function-definition
13114 template <> explicit-specialization
13115 template <> template-declaration */
13118 cp_parser_explicit_specialization (cp_parser
* parser
)
13120 bool need_lang_pop
;
13121 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13123 /* Look for the `template' keyword. */
13124 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
13125 /* Look for the `<'. */
13126 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
13127 /* Look for the `>'. */
13128 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
13129 /* We have processed another parameter list. */
13130 ++parser
->num_template_parameter_lists
;
13133 A template ... explicit specialization ... shall not have C
13135 if (current_lang_name
== lang_name_c
)
13137 error_at (token
->location
, "template specialization with C linkage");
13138 /* Give it C++ linkage to avoid confusing other parts of the
13140 push_lang_context (lang_name_cplusplus
);
13141 need_lang_pop
= true;
13144 need_lang_pop
= false;
13145 /* Let the front end know that we are beginning a specialization. */
13146 if (!begin_specialization ())
13148 end_specialization ();
13152 /* If the next keyword is `template', we need to figure out whether
13153 or not we're looking a template-declaration. */
13154 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
13156 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
13157 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_GREATER
)
13158 cp_parser_template_declaration_after_export (parser
,
13159 /*member_p=*/false);
13161 cp_parser_explicit_specialization (parser
);
13164 /* Parse the dependent declaration. */
13165 cp_parser_single_declaration (parser
,
13167 /*member_p=*/false,
13168 /*explicit_specialization_p=*/true,
13169 /*friend_p=*/NULL
);
13170 /* We're done with the specialization. */
13171 end_specialization ();
13172 /* For the erroneous case of a template with C linkage, we pushed an
13173 implicit C++ linkage scope; exit that scope now. */
13175 pop_lang_context ();
13176 /* We're done with this parameter list. */
13177 --parser
->num_template_parameter_lists
;
13180 /* Parse a type-specifier.
13183 simple-type-specifier
13186 elaborated-type-specifier
13194 Returns a representation of the type-specifier. For a
13195 class-specifier, enum-specifier, or elaborated-type-specifier, a
13196 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13198 The parser flags FLAGS is used to control type-specifier parsing.
13200 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13201 in a decl-specifier-seq.
13203 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13204 class-specifier, enum-specifier, or elaborated-type-specifier, then
13205 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13206 if a type is declared; 2 if it is defined. Otherwise, it is set to
13209 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13210 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13211 is set to FALSE. */
13214 cp_parser_type_specifier (cp_parser
* parser
,
13215 cp_parser_flags flags
,
13216 cp_decl_specifier_seq
*decl_specs
,
13217 bool is_declaration
,
13218 int* declares_class_or_enum
,
13219 bool* is_cv_qualifier
)
13221 tree type_spec
= NULL_TREE
;
13224 cp_decl_spec ds
= ds_last
;
13226 /* Assume this type-specifier does not declare a new type. */
13227 if (declares_class_or_enum
)
13228 *declares_class_or_enum
= 0;
13229 /* And that it does not specify a cv-qualifier. */
13230 if (is_cv_qualifier
)
13231 *is_cv_qualifier
= false;
13232 /* Peek at the next token. */
13233 token
= cp_lexer_peek_token (parser
->lexer
);
13235 /* If we're looking at a keyword, we can use that to guide the
13236 production we choose. */
13237 keyword
= token
->keyword
;
13241 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
13242 goto elaborated_type_specifier
;
13244 /* Look for the enum-specifier. */
13245 type_spec
= cp_parser_enum_specifier (parser
);
13246 /* If that worked, we're done. */
13249 if (declares_class_or_enum
)
13250 *declares_class_or_enum
= 2;
13252 cp_parser_set_decl_spec_type (decl_specs
,
13255 /*type_definition_p=*/true);
13259 goto elaborated_type_specifier
;
13261 /* Any of these indicate either a class-specifier, or an
13262 elaborated-type-specifier. */
13266 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
13267 goto elaborated_type_specifier
;
13269 /* Parse tentatively so that we can back up if we don't find a
13270 class-specifier. */
13271 cp_parser_parse_tentatively (parser
);
13272 /* Look for the class-specifier. */
13273 type_spec
= cp_parser_class_specifier (parser
);
13274 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE
, type_spec
);
13275 /* If that worked, we're done. */
13276 if (cp_parser_parse_definitely (parser
))
13278 if (declares_class_or_enum
)
13279 *declares_class_or_enum
= 2;
13281 cp_parser_set_decl_spec_type (decl_specs
,
13284 /*type_definition_p=*/true);
13288 /* Fall through. */
13289 elaborated_type_specifier
:
13290 /* We're declaring (not defining) a class or enum. */
13291 if (declares_class_or_enum
)
13292 *declares_class_or_enum
= 1;
13294 /* Fall through. */
13296 /* Look for an elaborated-type-specifier. */
13298 = (cp_parser_elaborated_type_specifier
13300 decl_specs
&& decl_specs
->specs
[(int) ds_friend
],
13303 cp_parser_set_decl_spec_type (decl_specs
,
13306 /*type_definition_p=*/false);
13311 if (is_cv_qualifier
)
13312 *is_cv_qualifier
= true;
13317 if (is_cv_qualifier
)
13318 *is_cv_qualifier
= true;
13323 if (is_cv_qualifier
)
13324 *is_cv_qualifier
= true;
13328 /* The `__complex__' keyword is a GNU extension. */
13336 /* Handle simple keywords. */
13341 ++decl_specs
->specs
[(int)ds
];
13342 decl_specs
->any_specifiers_p
= true;
13344 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
13347 /* If we do not already have a type-specifier, assume we are looking
13348 at a simple-type-specifier. */
13349 type_spec
= cp_parser_simple_type_specifier (parser
,
13353 /* If we didn't find a type-specifier, and a type-specifier was not
13354 optional in this context, issue an error message. */
13355 if (!type_spec
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
13357 cp_parser_error (parser
, "expected type specifier");
13358 return error_mark_node
;
13364 /* Parse a simple-type-specifier.
13366 simple-type-specifier:
13367 :: [opt] nested-name-specifier [opt] type-name
13368 :: [opt] nested-name-specifier template template-id
13383 simple-type-specifier:
13385 decltype ( expression )
13388 __underlying_type ( type-id )
13392 simple-type-specifier:
13394 __typeof__ unary-expression
13395 __typeof__ ( type-id )
13397 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13398 appropriately updated. */
13401 cp_parser_simple_type_specifier (cp_parser
* parser
,
13402 cp_decl_specifier_seq
*decl_specs
,
13403 cp_parser_flags flags
)
13405 tree type
= NULL_TREE
;
13408 /* Peek at the next token. */
13409 token
= cp_lexer_peek_token (parser
->lexer
);
13411 /* If we're looking at a keyword, things are easy. */
13412 switch (token
->keyword
)
13416 decl_specs
->explicit_char_p
= true;
13417 type
= char_type_node
;
13420 type
= char16_type_node
;
13423 type
= char32_type_node
;
13426 type
= wchar_type_node
;
13429 type
= boolean_type_node
;
13433 ++decl_specs
->specs
[(int) ds_short
];
13434 type
= short_integer_type_node
;
13438 decl_specs
->explicit_int_p
= true;
13439 type
= integer_type_node
;
13442 if (!int128_integer_type_node
)
13445 decl_specs
->explicit_int128_p
= true;
13446 type
= int128_integer_type_node
;
13450 ++decl_specs
->specs
[(int) ds_long
];
13451 type
= long_integer_type_node
;
13455 ++decl_specs
->specs
[(int) ds_signed
];
13456 type
= integer_type_node
;
13460 ++decl_specs
->specs
[(int) ds_unsigned
];
13461 type
= unsigned_type_node
;
13464 type
= float_type_node
;
13467 type
= double_type_node
;
13470 type
= void_type_node
;
13474 maybe_warn_cpp0x (CPP0X_AUTO
);
13475 type
= make_auto ();
13479 /* Since DR 743, decltype can either be a simple-type-specifier by
13480 itself or begin a nested-name-specifier. Parsing it will replace
13481 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13482 handling below decide what to do. */
13483 cp_parser_decltype (parser
);
13484 cp_lexer_set_token_position (parser
->lexer
, token
);
13488 /* Consume the `typeof' token. */
13489 cp_lexer_consume_token (parser
->lexer
);
13490 /* Parse the operand to `typeof'. */
13491 type
= cp_parser_sizeof_operand (parser
, RID_TYPEOF
);
13492 /* If it is not already a TYPE, take its type. */
13493 if (!TYPE_P (type
))
13494 type
= finish_typeof (type
);
13497 cp_parser_set_decl_spec_type (decl_specs
, type
,
13499 /*type_definition_p=*/false);
13503 case RID_UNDERLYING_TYPE
:
13504 type
= cp_parser_trait_expr (parser
, RID_UNDERLYING_TYPE
);
13506 cp_parser_set_decl_spec_type (decl_specs
, type
,
13508 /*type_definition_p=*/false);
13513 case RID_DIRECT_BASES
:
13514 type
= cp_parser_trait_expr (parser
, token
->keyword
);
13516 cp_parser_set_decl_spec_type (decl_specs
, type
,
13518 /*type_definition_p=*/false);
13524 /* If token is an already-parsed decltype not followed by ::,
13525 it's a simple-type-specifier. */
13526 if (token
->type
== CPP_DECLTYPE
13527 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
13529 type
= token
->u
.value
;
13531 cp_parser_set_decl_spec_type (decl_specs
, type
,
13533 /*type_definition_p=*/false);
13534 cp_lexer_consume_token (parser
->lexer
);
13538 /* If the type-specifier was for a built-in type, we're done. */
13541 /* Record the type. */
13543 && (token
->keyword
!= RID_SIGNED
13544 && token
->keyword
!= RID_UNSIGNED
13545 && token
->keyword
!= RID_SHORT
13546 && token
->keyword
!= RID_LONG
))
13547 cp_parser_set_decl_spec_type (decl_specs
,
13550 /*type_definition_p=*/false);
13552 decl_specs
->any_specifiers_p
= true;
13554 /* Consume the token. */
13555 cp_lexer_consume_token (parser
->lexer
);
13557 /* There is no valid C++ program where a non-template type is
13558 followed by a "<". That usually indicates that the user thought
13559 that the type was a template. */
13560 cp_parser_check_for_invalid_template_id (parser
, type
, token
->location
);
13562 return TYPE_NAME (type
);
13565 /* The type-specifier must be a user-defined type. */
13566 if (!(flags
& CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
))
13571 /* Don't gobble tokens or issue error messages if this is an
13572 optional type-specifier. */
13573 if (flags
& CP_PARSER_FLAGS_OPTIONAL
)
13574 cp_parser_parse_tentatively (parser
);
13576 /* Look for the optional `::' operator. */
13578 = (cp_parser_global_scope_opt (parser
,
13579 /*current_scope_valid_p=*/false)
13581 /* Look for the nested-name specifier. */
13583 = (cp_parser_nested_name_specifier_opt (parser
,
13584 /*typename_keyword_p=*/false,
13585 /*check_dependency_p=*/true,
13587 /*is_declaration=*/false)
13589 token
= cp_lexer_peek_token (parser
->lexer
);
13590 /* If we have seen a nested-name-specifier, and the next token
13591 is `template', then we are using the template-id production. */
13593 && cp_parser_optional_template_keyword (parser
))
13595 /* Look for the template-id. */
13596 type
= cp_parser_template_id (parser
,
13597 /*template_keyword_p=*/true,
13598 /*check_dependency_p=*/true,
13599 /*is_declaration=*/false);
13600 /* If the template-id did not name a type, we are out of
13602 if (TREE_CODE (type
) != TYPE_DECL
)
13604 cp_parser_error (parser
, "expected template-id for type");
13608 /* Otherwise, look for a type-name. */
13610 type
= cp_parser_type_name (parser
);
13611 /* Keep track of all name-lookups performed in class scopes. */
13615 && TREE_CODE (type
) == TYPE_DECL
13616 && TREE_CODE (DECL_NAME (type
)) == IDENTIFIER_NODE
)
13617 maybe_note_name_used_in_class (DECL_NAME (type
), type
);
13618 /* If it didn't work out, we don't have a TYPE. */
13619 if ((flags
& CP_PARSER_FLAGS_OPTIONAL
)
13620 && !cp_parser_parse_definitely (parser
))
13622 if (type
&& decl_specs
)
13623 cp_parser_set_decl_spec_type (decl_specs
, type
,
13625 /*type_definition_p=*/false);
13628 /* If we didn't get a type-name, issue an error message. */
13629 if (!type
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
13631 cp_parser_error (parser
, "expected type-name");
13632 return error_mark_node
;
13635 if (type
&& type
!= error_mark_node
)
13637 /* See if TYPE is an Objective-C type, and if so, parse and
13638 accept any protocol references following it. Do this before
13639 the cp_parser_check_for_invalid_template_id() call, because
13640 Objective-C types can be followed by '<...>' which would
13641 enclose protocol names rather than template arguments, and so
13642 everything is fine. */
13643 if (c_dialect_objc () && !parser
->scope
13644 && (objc_is_id (type
) || objc_is_class_name (type
)))
13646 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
13647 tree qual_type
= objc_get_protocol_qualified_type (type
, protos
);
13649 /* Clobber the "unqualified" type previously entered into
13650 DECL_SPECS with the new, improved protocol-qualified version. */
13652 decl_specs
->type
= qual_type
;
13657 /* There is no valid C++ program where a non-template type is
13658 followed by a "<". That usually indicates that the user
13659 thought that the type was a template. */
13660 cp_parser_check_for_invalid_template_id (parser
, TREE_TYPE (type
),
13667 /* Parse a type-name.
13673 simple-template-id [in c++0x]
13681 Returns a TYPE_DECL for the type. */
13684 cp_parser_type_name (cp_parser
* parser
)
13688 /* We can't know yet whether it is a class-name or not. */
13689 cp_parser_parse_tentatively (parser
);
13690 /* Try a class-name. */
13691 type_decl
= cp_parser_class_name (parser
,
13692 /*typename_keyword_p=*/false,
13693 /*template_keyword_p=*/false,
13695 /*check_dependency_p=*/true,
13696 /*class_head_p=*/false,
13697 /*is_declaration=*/false);
13698 /* If it's not a class-name, keep looking. */
13699 if (!cp_parser_parse_definitely (parser
))
13701 if (cxx_dialect
< cxx0x
)
13702 /* It must be a typedef-name or an enum-name. */
13703 return cp_parser_nonclass_name (parser
);
13705 cp_parser_parse_tentatively (parser
);
13706 /* It is either a simple-template-id representing an
13707 instantiation of an alias template... */
13708 type_decl
= cp_parser_template_id (parser
,
13709 /*template_keyword_p=*/false,
13710 /*check_dependency_p=*/false,
13711 /*is_declaration=*/false);
13712 /* Note that this must be an instantiation of an alias template
13713 because [temp.names]/6 says:
13715 A template-id that names an alias template specialization
13718 Whereas [temp.names]/7 says:
13720 A simple-template-id that names a class template
13721 specialization is a class-name. */
13722 if (type_decl
!= NULL_TREE
13723 && TREE_CODE (type_decl
) == TYPE_DECL
13724 && TYPE_DECL_ALIAS_P (type_decl
))
13725 gcc_assert (DECL_TEMPLATE_INSTANTIATION (type_decl
));
13727 cp_parser_simulate_error (parser
);
13729 if (!cp_parser_parse_definitely (parser
))
13730 /* ... Or a typedef-name or an enum-name. */
13731 return cp_parser_nonclass_name (parser
);
13737 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13745 Returns a TYPE_DECL for the type. */
13748 cp_parser_nonclass_name (cp_parser
* parser
)
13753 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13754 identifier
= cp_parser_identifier (parser
);
13755 if (identifier
== error_mark_node
)
13756 return error_mark_node
;
13758 /* Look up the type-name. */
13759 type_decl
= cp_parser_lookup_name_simple (parser
, identifier
, token
->location
);
13761 if (TREE_CODE (type_decl
) != TYPE_DECL
13762 && (objc_is_id (identifier
) || objc_is_class_name (identifier
)))
13764 /* See if this is an Objective-C type. */
13765 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
13766 tree type
= objc_get_protocol_qualified_type (identifier
, protos
);
13768 type_decl
= TYPE_NAME (type
);
13771 /* Issue an error if we did not find a type-name. */
13772 if (TREE_CODE (type_decl
) != TYPE_DECL
13773 /* In Objective-C, we have the complication that class names are
13774 normally type names and start declarations (eg, the
13775 "NSObject" in "NSObject *object;"), but can be used in an
13776 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13777 is an expression. So, a classname followed by a dot is not a
13778 valid type-name. */
13779 || (objc_is_class_name (TREE_TYPE (type_decl
))
13780 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
))
13782 if (!cp_parser_simulate_error (parser
))
13783 cp_parser_name_lookup_error (parser
, identifier
, type_decl
,
13784 NLE_TYPE
, token
->location
);
13785 return error_mark_node
;
13787 /* Remember that the name was used in the definition of the
13788 current class so that we can check later to see if the
13789 meaning would have been different after the class was
13790 entirely defined. */
13791 else if (type_decl
!= error_mark_node
13793 maybe_note_name_used_in_class (identifier
, type_decl
);
13798 /* Parse an elaborated-type-specifier. Note that the grammar given
13799 here incorporates the resolution to DR68.
13801 elaborated-type-specifier:
13802 class-key :: [opt] nested-name-specifier [opt] identifier
13803 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13804 enum-key :: [opt] nested-name-specifier [opt] identifier
13805 typename :: [opt] nested-name-specifier identifier
13806 typename :: [opt] nested-name-specifier template [opt]
13811 elaborated-type-specifier:
13812 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13813 class-key attributes :: [opt] nested-name-specifier [opt]
13814 template [opt] template-id
13815 enum attributes :: [opt] nested-name-specifier [opt] identifier
13817 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13818 declared `friend'. If IS_DECLARATION is TRUE, then this
13819 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13820 something is being declared.
13822 Returns the TYPE specified. */
13825 cp_parser_elaborated_type_specifier (cp_parser
* parser
,
13827 bool is_declaration
)
13829 enum tag_types tag_type
;
13831 tree type
= NULL_TREE
;
13832 tree attributes
= NULL_TREE
;
13834 cp_token
*token
= NULL
;
13836 /* See if we're looking at the `enum' keyword. */
13837 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ENUM
))
13839 /* Consume the `enum' token. */
13840 cp_lexer_consume_token (parser
->lexer
);
13841 /* Remember that it's an enumeration type. */
13842 tag_type
= enum_type
;
13843 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13844 enums) is used here. */
13845 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
13846 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
13848 pedwarn (input_location
, 0, "elaborated-type-specifier "
13849 "for a scoped enum must not use the %<%D%> keyword",
13850 cp_lexer_peek_token (parser
->lexer
)->u
.value
);
13851 /* Consume the `struct' or `class' and parse it anyway. */
13852 cp_lexer_consume_token (parser
->lexer
);
13854 /* Parse the attributes. */
13855 attributes
= cp_parser_attributes_opt (parser
);
13857 /* Or, it might be `typename'. */
13858 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
13861 /* Consume the `typename' token. */
13862 cp_lexer_consume_token (parser
->lexer
);
13863 /* Remember that it's a `typename' type. */
13864 tag_type
= typename_type
;
13866 /* Otherwise it must be a class-key. */
13869 tag_type
= cp_parser_class_key (parser
);
13870 if (tag_type
== none_type
)
13871 return error_mark_node
;
13872 /* Parse the attributes. */
13873 attributes
= cp_parser_attributes_opt (parser
);
13876 /* Look for the `::' operator. */
13877 globalscope
= cp_parser_global_scope_opt (parser
,
13878 /*current_scope_valid_p=*/false);
13879 /* Look for the nested-name-specifier. */
13880 if (tag_type
== typename_type
&& !globalscope
)
13882 if (!cp_parser_nested_name_specifier (parser
,
13883 /*typename_keyword_p=*/true,
13884 /*check_dependency_p=*/true,
13887 return error_mark_node
;
13890 /* Even though `typename' is not present, the proposed resolution
13891 to Core Issue 180 says that in `class A<T>::B', `B' should be
13892 considered a type-name, even if `A<T>' is dependent. */
13893 cp_parser_nested_name_specifier_opt (parser
,
13894 /*typename_keyword_p=*/true,
13895 /*check_dependency_p=*/true,
13898 /* For everything but enumeration types, consider a template-id.
13899 For an enumeration type, consider only a plain identifier. */
13900 if (tag_type
!= enum_type
)
13902 bool template_p
= false;
13905 /* Allow the `template' keyword. */
13906 template_p
= cp_parser_optional_template_keyword (parser
);
13907 /* If we didn't see `template', we don't know if there's a
13908 template-id or not. */
13910 cp_parser_parse_tentatively (parser
);
13911 /* Parse the template-id. */
13912 token
= cp_lexer_peek_token (parser
->lexer
);
13913 decl
= cp_parser_template_id (parser
, template_p
,
13914 /*check_dependency_p=*/true,
13916 /* If we didn't find a template-id, look for an ordinary
13918 if (!template_p
&& !cp_parser_parse_definitely (parser
))
13920 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
13921 in effect, then we must assume that, upon instantiation, the
13922 template will correspond to a class. */
13923 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
13924 && tag_type
== typename_type
)
13925 type
= make_typename_type (parser
->scope
, decl
,
13927 /*complain=*/tf_error
);
13928 /* If the `typename' keyword is in effect and DECL is not a type
13929 decl. Then type is non existant. */
13930 else if (tag_type
== typename_type
&& TREE_CODE (decl
) != TYPE_DECL
)
13933 type
= TREE_TYPE (decl
);
13938 token
= cp_lexer_peek_token (parser
->lexer
);
13939 identifier
= cp_parser_identifier (parser
);
13941 if (identifier
== error_mark_node
)
13943 parser
->scope
= NULL_TREE
;
13944 return error_mark_node
;
13947 /* For a `typename', we needn't call xref_tag. */
13948 if (tag_type
== typename_type
13949 && TREE_CODE (parser
->scope
) != NAMESPACE_DECL
)
13950 return cp_parser_make_typename_type (parser
, parser
->scope
,
13953 /* Look up a qualified name in the usual way. */
13957 tree ambiguous_decls
;
13959 decl
= cp_parser_lookup_name (parser
, identifier
,
13961 /*is_template=*/false,
13962 /*is_namespace=*/false,
13963 /*check_dependency=*/true,
13967 /* If the lookup was ambiguous, an error will already have been
13969 if (ambiguous_decls
)
13970 return error_mark_node
;
13972 /* If we are parsing friend declaration, DECL may be a
13973 TEMPLATE_DECL tree node here. However, we need to check
13974 whether this TEMPLATE_DECL results in valid code. Consider
13975 the following example:
13978 template <class T> class C {};
13981 template <class T> friend class N::C; // #1, valid code
13983 template <class T> class Y {
13984 friend class N::C; // #2, invalid code
13987 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
13988 name lookup of `N::C'. We see that friend declaration must
13989 be template for the code to be valid. Note that
13990 processing_template_decl does not work here since it is
13991 always 1 for the above two cases. */
13993 decl
= (cp_parser_maybe_treat_template_as_class
13994 (decl
, /*tag_name_p=*/is_friend
13995 && parser
->num_template_parameter_lists
));
13997 if (TREE_CODE (decl
) != TYPE_DECL
)
13999 cp_parser_diagnose_invalid_type_name (parser
,
14003 return error_mark_node
;
14006 if (TREE_CODE (TREE_TYPE (decl
)) != TYPENAME_TYPE
)
14008 bool allow_template
= (parser
->num_template_parameter_lists
14009 || DECL_SELF_REFERENCE_P (decl
));
14010 type
= check_elaborated_type_specifier (tag_type
, decl
,
14013 if (type
== error_mark_node
)
14014 return error_mark_node
;
14017 /* Forward declarations of nested types, such as
14022 are invalid unless all components preceding the final '::'
14023 are complete. If all enclosing types are complete, these
14024 declarations become merely pointless.
14026 Invalid forward declarations of nested types are errors
14027 caught elsewhere in parsing. Those that are pointless arrive
14030 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
14031 && !is_friend
&& !processing_explicit_instantiation
)
14032 warning (0, "declaration %qD does not declare anything", decl
);
14034 type
= TREE_TYPE (decl
);
14038 /* An elaborated-type-specifier sometimes introduces a new type and
14039 sometimes names an existing type. Normally, the rule is that it
14040 introduces a new type only if there is not an existing type of
14041 the same name already in scope. For example, given:
14044 void f() { struct S s; }
14046 the `struct S' in the body of `f' is the same `struct S' as in
14047 the global scope; the existing definition is used. However, if
14048 there were no global declaration, this would introduce a new
14049 local class named `S'.
14051 An exception to this rule applies to the following code:
14053 namespace N { struct S; }
14055 Here, the elaborated-type-specifier names a new type
14056 unconditionally; even if there is already an `S' in the
14057 containing scope this declaration names a new type.
14058 This exception only applies if the elaborated-type-specifier
14059 forms the complete declaration:
14063 A declaration consisting solely of `class-key identifier ;' is
14064 either a redeclaration of the name in the current scope or a
14065 forward declaration of the identifier as a class name. It
14066 introduces the name into the current scope.
14068 We are in this situation precisely when the next token is a `;'.
14070 An exception to the exception is that a `friend' declaration does
14071 *not* name a new type; i.e., given:
14073 struct S { friend struct T; };
14075 `T' is not a new type in the scope of `S'.
14077 Also, `new struct S' or `sizeof (struct S)' never results in the
14078 definition of a new type; a new type can only be declared in a
14079 declaration context. */
14085 /* Friends have special name lookup rules. */
14086 ts
= ts_within_enclosing_non_class
;
14087 else if (is_declaration
14088 && cp_lexer_next_token_is (parser
->lexer
,
14090 /* This is a `class-key identifier ;' */
14096 (parser
->num_template_parameter_lists
14097 && (cp_parser_next_token_starts_class_definition_p (parser
)
14098 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)));
14099 /* An unqualified name was used to reference this type, so
14100 there were no qualifying templates. */
14101 if (!cp_parser_check_template_parameters (parser
,
14102 /*num_templates=*/0,
14104 /*declarator=*/NULL
))
14105 return error_mark_node
;
14106 type
= xref_tag (tag_type
, identifier
, ts
, template_p
);
14110 if (type
== error_mark_node
)
14111 return error_mark_node
;
14113 /* Allow attributes on forward declarations of classes. */
14116 if (TREE_CODE (type
) == TYPENAME_TYPE
)
14117 warning (OPT_Wattributes
,
14118 "attributes ignored on uninstantiated type");
14119 else if (tag_type
!= enum_type
&& CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
14120 && ! processing_explicit_instantiation
)
14121 warning (OPT_Wattributes
,
14122 "attributes ignored on template instantiation");
14123 else if (is_declaration
&& cp_parser_declares_only_class_p (parser
))
14124 cplus_decl_attributes (&type
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
14126 warning (OPT_Wattributes
,
14127 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
14130 if (tag_type
!= enum_type
)
14132 /* Indicate whether this class was declared as a `class' or as a
14134 if (TREE_CODE (type
) == RECORD_TYPE
)
14135 CLASSTYPE_DECLARED_CLASS (type
) = (tag_type
== class_type
);
14136 cp_parser_check_class_key (tag_type
, type
);
14139 /* A "<" cannot follow an elaborated type specifier. If that
14140 happens, the user was probably trying to form a template-id. */
14141 cp_parser_check_for_invalid_template_id (parser
, type
, token
->location
);
14146 /* Parse an enum-specifier.
14149 enum-head { enumerator-list [opt] }
14150 enum-head { enumerator-list , } [C++0x]
14153 enum-key identifier [opt] enum-base [opt]
14154 enum-key nested-name-specifier identifier enum-base [opt]
14159 enum struct [C++0x]
14162 : type-specifier-seq
14164 opaque-enum-specifier:
14165 enum-key identifier enum-base [opt] ;
14168 enum-key attributes[opt] identifier [opt] enum-base [opt]
14169 { enumerator-list [opt] }attributes[opt]
14170 enum-key attributes[opt] identifier [opt] enum-base [opt]
14171 { enumerator-list, }attributes[opt] [C++0x]
14173 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14174 if the token stream isn't an enum-specifier after all. */
14177 cp_parser_enum_specifier (cp_parser
* parser
)
14180 tree type
= NULL_TREE
;
14182 tree nested_name_specifier
= NULL_TREE
;
14184 bool scoped_enum_p
= false;
14185 bool has_underlying_type
= false;
14186 bool nested_being_defined
= false;
14187 bool new_value_list
= false;
14188 bool is_new_type
= false;
14189 bool is_anonymous
= false;
14190 tree underlying_type
= NULL_TREE
;
14191 cp_token
*type_start_token
= NULL
;
14192 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
14194 parser
->colon_corrects_to_scope_p
= false;
14196 /* Parse tentatively so that we can back up if we don't find a
14198 cp_parser_parse_tentatively (parser
);
14200 /* Caller guarantees that the current token is 'enum', an identifier
14201 possibly follows, and the token after that is an opening brace.
14202 If we don't have an identifier, fabricate an anonymous name for
14203 the enumeration being defined. */
14204 cp_lexer_consume_token (parser
->lexer
);
14206 /* Parse the "class" or "struct", which indicates a scoped
14207 enumeration type in C++0x. */
14208 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
14209 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
14211 if (cxx_dialect
< cxx0x
)
14212 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
14214 /* Consume the `struct' or `class' token. */
14215 cp_lexer_consume_token (parser
->lexer
);
14217 scoped_enum_p
= true;
14220 attributes
= cp_parser_attributes_opt (parser
);
14222 /* Clear the qualification. */
14223 parser
->scope
= NULL_TREE
;
14224 parser
->qualifying_scope
= NULL_TREE
;
14225 parser
->object_scope
= NULL_TREE
;
14227 /* Figure out in what scope the declaration is being placed. */
14228 prev_scope
= current_scope ();
14230 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
14232 push_deferring_access_checks (dk_no_check
);
14233 nested_name_specifier
14234 = cp_parser_nested_name_specifier_opt (parser
,
14235 /*typename_keyword_p=*/true,
14236 /*check_dependency_p=*/false,
14238 /*is_declaration=*/false);
14240 if (nested_name_specifier
)
14244 identifier
= cp_parser_identifier (parser
);
14245 name
= cp_parser_lookup_name (parser
, identifier
,
14247 /*is_template=*/false,
14248 /*is_namespace=*/false,
14249 /*check_dependency=*/true,
14250 /*ambiguous_decls=*/NULL
,
14254 type
= TREE_TYPE (name
);
14255 if (TREE_CODE (type
) == TYPENAME_TYPE
)
14257 /* Are template enums allowed in ISO? */
14258 if (template_parm_scope_p ())
14259 pedwarn (type_start_token
->location
, OPT_pedantic
,
14260 "%qD is an enumeration template", name
);
14261 /* ignore a typename reference, for it will be solved by name
14267 error_at (type_start_token
->location
,
14268 "%qD is not an enumerator-name", identifier
);
14272 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
14273 identifier
= cp_parser_identifier (parser
);
14276 identifier
= make_anon_name ();
14277 is_anonymous
= true;
14280 pop_deferring_access_checks ();
14282 /* Check for the `:' that denotes a specified underlying type in C++0x.
14283 Note that a ':' could also indicate a bitfield width, however. */
14284 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
14286 cp_decl_specifier_seq type_specifiers
;
14288 /* Consume the `:'. */
14289 cp_lexer_consume_token (parser
->lexer
);
14291 /* Parse the type-specifier-seq. */
14292 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
14293 /*is_trailing_return=*/false,
14296 /* At this point this is surely not elaborated type specifier. */
14297 if (!cp_parser_parse_definitely (parser
))
14300 if (cxx_dialect
< cxx0x
)
14301 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
14303 has_underlying_type
= true;
14305 /* If that didn't work, stop. */
14306 if (type_specifiers
.type
!= error_mark_node
)
14308 underlying_type
= grokdeclarator (NULL
, &type_specifiers
, TYPENAME
,
14309 /*initialized=*/0, NULL
);
14310 if (underlying_type
== error_mark_node
)
14311 underlying_type
= NULL_TREE
;
14315 /* Look for the `{' but don't consume it yet. */
14316 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
14318 if (cxx_dialect
< cxx0x
|| (!scoped_enum_p
&& !underlying_type
))
14320 cp_parser_error (parser
, "expected %<{%>");
14321 if (has_underlying_type
)
14327 /* An opaque-enum-specifier must have a ';' here. */
14328 if ((scoped_enum_p
|| underlying_type
)
14329 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
14331 cp_parser_error (parser
, "expected %<;%> or %<{%>");
14332 if (has_underlying_type
)
14340 if (!has_underlying_type
&& !cp_parser_parse_definitely (parser
))
14343 if (nested_name_specifier
)
14345 if (CLASS_TYPE_P (nested_name_specifier
))
14347 nested_being_defined
= TYPE_BEING_DEFINED (nested_name_specifier
);
14348 TYPE_BEING_DEFINED (nested_name_specifier
) = 1;
14349 push_scope (nested_name_specifier
);
14351 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
14353 push_nested_namespace (nested_name_specifier
);
14357 /* Issue an error message if type-definitions are forbidden here. */
14358 if (!cp_parser_check_type_definition (parser
))
14359 type
= error_mark_node
;
14361 /* Create the new type. We do this before consuming the opening
14362 brace so the enum will be recorded as being on the line of its
14363 tag (or the 'enum' keyword, if there is no tag). */
14364 type
= start_enum (identifier
, type
, underlying_type
,
14365 scoped_enum_p
, &is_new_type
);
14367 /* If the next token is not '{' it is an opaque-enum-specifier or an
14368 elaborated-type-specifier. */
14369 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
14371 timevar_push (TV_PARSE_ENUM
);
14372 if (nested_name_specifier
)
14374 /* The following catches invalid code such as:
14375 enum class S<int>::E { A, B, C }; */
14376 if (!processing_specialization
14377 && CLASS_TYPE_P (nested_name_specifier
)
14378 && CLASSTYPE_USE_TEMPLATE (nested_name_specifier
))
14379 error_at (type_start_token
->location
, "cannot add an enumerator "
14380 "list to a template instantiation");
14382 /* If that scope does not contain the scope in which the
14383 class was originally declared, the program is invalid. */
14384 if (prev_scope
&& !is_ancestor (prev_scope
, nested_name_specifier
))
14386 if (at_namespace_scope_p ())
14387 error_at (type_start_token
->location
,
14388 "declaration of %qD in namespace %qD which does not "
14390 type
, prev_scope
, nested_name_specifier
);
14392 error_at (type_start_token
->location
,
14393 "declaration of %qD in %qD which does not enclose %qD",
14394 type
, prev_scope
, nested_name_specifier
);
14395 type
= error_mark_node
;
14400 begin_scope (sk_scoped_enum
, type
);
14402 /* Consume the opening brace. */
14403 cp_lexer_consume_token (parser
->lexer
);
14405 if (type
== error_mark_node
)
14406 ; /* Nothing to add */
14407 else if (OPAQUE_ENUM_P (type
)
14408 || (cxx_dialect
> cxx98
&& processing_specialization
))
14410 new_value_list
= true;
14411 SET_OPAQUE_ENUM_P (type
, false);
14412 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
14416 error_at (type_start_token
->location
, "multiple definition of %q#T", type
);
14417 error_at (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)),
14418 "previous definition here");
14419 type
= error_mark_node
;
14422 if (type
== error_mark_node
)
14423 cp_parser_skip_to_end_of_block_or_statement (parser
);
14424 /* If the next token is not '}', then there are some enumerators. */
14425 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
14426 cp_parser_enumerator_list (parser
, type
);
14428 /* Consume the final '}'. */
14429 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
14433 timevar_pop (TV_PARSE_ENUM
);
14437 /* If a ';' follows, then it is an opaque-enum-specifier
14438 and additional restrictions apply. */
14439 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
14442 error_at (type_start_token
->location
,
14443 "opaque-enum-specifier without name");
14444 else if (nested_name_specifier
)
14445 error_at (type_start_token
->location
,
14446 "opaque-enum-specifier must use a simple identifier");
14450 /* Look for trailing attributes to apply to this enumeration, and
14451 apply them if appropriate. */
14452 if (cp_parser_allow_gnu_extensions_p (parser
))
14454 tree trailing_attr
= cp_parser_attributes_opt (parser
);
14455 trailing_attr
= chainon (trailing_attr
, attributes
);
14456 cplus_decl_attributes (&type
,
14458 (int) ATTR_FLAG_TYPE_IN_PLACE
);
14461 /* Finish up the enumeration. */
14462 if (type
!= error_mark_node
)
14464 if (new_value_list
)
14465 finish_enum_value_list (type
);
14467 finish_enum (type
);
14470 if (nested_name_specifier
)
14472 if (CLASS_TYPE_P (nested_name_specifier
))
14474 TYPE_BEING_DEFINED (nested_name_specifier
) = nested_being_defined
;
14475 pop_scope (nested_name_specifier
);
14477 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
14479 pop_nested_namespace (nested_name_specifier
);
14483 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
14487 /* Parse an enumerator-list. The enumerators all have the indicated
14491 enumerator-definition
14492 enumerator-list , enumerator-definition */
14495 cp_parser_enumerator_list (cp_parser
* parser
, tree type
)
14499 /* Parse an enumerator-definition. */
14500 cp_parser_enumerator_definition (parser
, type
);
14502 /* If the next token is not a ',', we've reached the end of
14504 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14506 /* Otherwise, consume the `,' and keep going. */
14507 cp_lexer_consume_token (parser
->lexer
);
14508 /* If the next token is a `}', there is a trailing comma. */
14509 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
14511 if (cxx_dialect
< cxx0x
&& !in_system_header
)
14512 pedwarn (input_location
, OPT_pedantic
,
14513 "comma at end of enumerator list");
14519 /* Parse an enumerator-definition. The enumerator has the indicated
14522 enumerator-definition:
14524 enumerator = constant-expression
14530 cp_parser_enumerator_definition (cp_parser
* parser
, tree type
)
14536 /* Save the input location because we are interested in the location
14537 of the identifier and not the location of the explicit value. */
14538 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
14540 /* Look for the identifier. */
14541 identifier
= cp_parser_identifier (parser
);
14542 if (identifier
== error_mark_node
)
14545 /* If the next token is an '=', then there is an explicit value. */
14546 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
14548 /* Consume the `=' token. */
14549 cp_lexer_consume_token (parser
->lexer
);
14550 /* Parse the value. */
14551 value
= cp_parser_constant_expression (parser
,
14552 /*allow_non_constant_p=*/false,
14558 /* If we are processing a template, make sure the initializer of the
14559 enumerator doesn't contain any bare template parameter pack. */
14560 if (check_for_bare_parameter_packs (value
))
14561 value
= error_mark_node
;
14563 /* integral_constant_value will pull out this expression, so make sure
14564 it's folded as appropriate. */
14565 value
= fold_non_dependent_expr (value
);
14567 /* Create the enumerator. */
14568 build_enumerator (identifier
, value
, type
, loc
);
14571 /* Parse a namespace-name.
14574 original-namespace-name
14577 Returns the NAMESPACE_DECL for the namespace. */
14580 cp_parser_namespace_name (cp_parser
* parser
)
14583 tree namespace_decl
;
14585 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
14587 /* Get the name of the namespace. */
14588 identifier
= cp_parser_identifier (parser
);
14589 if (identifier
== error_mark_node
)
14590 return error_mark_node
;
14592 /* Look up the identifier in the currently active scope. Look only
14593 for namespaces, due to:
14595 [basic.lookup.udir]
14597 When looking up a namespace-name in a using-directive or alias
14598 definition, only namespace names are considered.
14602 [basic.lookup.qual]
14604 During the lookup of a name preceding the :: scope resolution
14605 operator, object, function, and enumerator names are ignored.
14607 (Note that cp_parser_qualifying_entity only calls this
14608 function if the token after the name is the scope resolution
14610 namespace_decl
= cp_parser_lookup_name (parser
, identifier
,
14612 /*is_template=*/false,
14613 /*is_namespace=*/true,
14614 /*check_dependency=*/true,
14615 /*ambiguous_decls=*/NULL
,
14617 /* If it's not a namespace, issue an error. */
14618 if (namespace_decl
== error_mark_node
14619 || TREE_CODE (namespace_decl
) != NAMESPACE_DECL
)
14621 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
14622 error_at (token
->location
, "%qD is not a namespace-name", identifier
);
14623 cp_parser_error (parser
, "expected namespace-name");
14624 namespace_decl
= error_mark_node
;
14627 return namespace_decl
;
14630 /* Parse a namespace-definition.
14632 namespace-definition:
14633 named-namespace-definition
14634 unnamed-namespace-definition
14636 named-namespace-definition:
14637 original-namespace-definition
14638 extension-namespace-definition
14640 original-namespace-definition:
14641 namespace identifier { namespace-body }
14643 extension-namespace-definition:
14644 namespace original-namespace-name { namespace-body }
14646 unnamed-namespace-definition:
14647 namespace { namespace-body } */
14650 cp_parser_namespace_definition (cp_parser
* parser
)
14652 tree identifier
, attribs
;
14653 bool has_visibility
;
14656 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_INLINE
))
14658 maybe_warn_cpp0x (CPP0X_INLINE_NAMESPACES
);
14660 cp_lexer_consume_token (parser
->lexer
);
14665 /* Look for the `namespace' keyword. */
14666 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
14668 /* Get the name of the namespace. We do not attempt to distinguish
14669 between an original-namespace-definition and an
14670 extension-namespace-definition at this point. The semantic
14671 analysis routines are responsible for that. */
14672 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
14673 identifier
= cp_parser_identifier (parser
);
14675 identifier
= NULL_TREE
;
14677 /* Parse any specified attributes. */
14678 attribs
= cp_parser_attributes_opt (parser
);
14680 /* Look for the `{' to start the namespace. */
14681 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
14682 /* Start the namespace. */
14683 push_namespace (identifier
);
14685 /* "inline namespace" is equivalent to a stub namespace definition
14686 followed by a strong using directive. */
14689 tree name_space
= current_namespace
;
14690 /* Set up namespace association. */
14691 DECL_NAMESPACE_ASSOCIATIONS (name_space
)
14692 = tree_cons (CP_DECL_CONTEXT (name_space
), NULL_TREE
,
14693 DECL_NAMESPACE_ASSOCIATIONS (name_space
));
14694 /* Import the contents of the inline namespace. */
14696 do_using_directive (name_space
);
14697 push_namespace (identifier
);
14700 has_visibility
= handle_namespace_attrs (current_namespace
, attribs
);
14702 /* Parse the body of the namespace. */
14703 cp_parser_namespace_body (parser
);
14705 if (has_visibility
)
14706 pop_visibility (1);
14708 /* Finish the namespace. */
14710 /* Look for the final `}'. */
14711 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
14714 /* Parse a namespace-body.
14717 declaration-seq [opt] */
14720 cp_parser_namespace_body (cp_parser
* parser
)
14722 cp_parser_declaration_seq_opt (parser
);
14725 /* Parse a namespace-alias-definition.
14727 namespace-alias-definition:
14728 namespace identifier = qualified-namespace-specifier ; */
14731 cp_parser_namespace_alias_definition (cp_parser
* parser
)
14734 tree namespace_specifier
;
14736 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
14738 /* Look for the `namespace' keyword. */
14739 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
14740 /* Look for the identifier. */
14741 identifier
= cp_parser_identifier (parser
);
14742 if (identifier
== error_mark_node
)
14744 /* Look for the `=' token. */
14745 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
)
14746 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
14748 error_at (token
->location
, "%<namespace%> definition is not allowed here");
14749 /* Skip the definition. */
14750 cp_lexer_consume_token (parser
->lexer
);
14751 if (cp_parser_skip_to_closing_brace (parser
))
14752 cp_lexer_consume_token (parser
->lexer
);
14755 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
14756 /* Look for the qualified-namespace-specifier. */
14757 namespace_specifier
14758 = cp_parser_qualified_namespace_specifier (parser
);
14759 /* Look for the `;' token. */
14760 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
14762 /* Register the alias in the symbol table. */
14763 do_namespace_alias (identifier
, namespace_specifier
);
14766 /* Parse a qualified-namespace-specifier.
14768 qualified-namespace-specifier:
14769 :: [opt] nested-name-specifier [opt] namespace-name
14771 Returns a NAMESPACE_DECL corresponding to the specified
14775 cp_parser_qualified_namespace_specifier (cp_parser
* parser
)
14777 /* Look for the optional `::'. */
14778 cp_parser_global_scope_opt (parser
,
14779 /*current_scope_valid_p=*/false);
14781 /* Look for the optional nested-name-specifier. */
14782 cp_parser_nested_name_specifier_opt (parser
,
14783 /*typename_keyword_p=*/false,
14784 /*check_dependency_p=*/true,
14786 /*is_declaration=*/true);
14788 return cp_parser_namespace_name (parser
);
14791 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14792 access declaration.
14795 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14796 using :: unqualified-id ;
14798 access-declaration:
14804 cp_parser_using_declaration (cp_parser
* parser
,
14805 bool access_declaration_p
)
14808 bool typename_p
= false;
14809 bool global_scope_p
;
14814 if (access_declaration_p
)
14815 cp_parser_parse_tentatively (parser
);
14818 /* Look for the `using' keyword. */
14819 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
14821 /* Peek at the next token. */
14822 token
= cp_lexer_peek_token (parser
->lexer
);
14823 /* See if it's `typename'. */
14824 if (token
->keyword
== RID_TYPENAME
)
14826 /* Remember that we've seen it. */
14828 /* Consume the `typename' token. */
14829 cp_lexer_consume_token (parser
->lexer
);
14833 /* Look for the optional global scope qualification. */
14835 = (cp_parser_global_scope_opt (parser
,
14836 /*current_scope_valid_p=*/false)
14839 /* If we saw `typename', or didn't see `::', then there must be a
14840 nested-name-specifier present. */
14841 if (typename_p
|| !global_scope_p
)
14842 qscope
= cp_parser_nested_name_specifier (parser
, typename_p
,
14843 /*check_dependency_p=*/true,
14845 /*is_declaration=*/true);
14846 /* Otherwise, we could be in either of the two productions. In that
14847 case, treat the nested-name-specifier as optional. */
14849 qscope
= cp_parser_nested_name_specifier_opt (parser
,
14850 /*typename_keyword_p=*/false,
14851 /*check_dependency_p=*/true,
14853 /*is_declaration=*/true);
14855 qscope
= global_namespace
;
14857 if (access_declaration_p
&& cp_parser_error_occurred (parser
))
14858 /* Something has already gone wrong; there's no need to parse
14859 further. Since an error has occurred, the return value of
14860 cp_parser_parse_definitely will be false, as required. */
14861 return cp_parser_parse_definitely (parser
);
14863 token
= cp_lexer_peek_token (parser
->lexer
);
14864 /* Parse the unqualified-id. */
14865 identifier
= cp_parser_unqualified_id (parser
,
14866 /*template_keyword_p=*/false,
14867 /*check_dependency_p=*/true,
14868 /*declarator_p=*/true,
14869 /*optional_p=*/false);
14871 if (access_declaration_p
)
14873 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
14874 cp_parser_simulate_error (parser
);
14875 if (!cp_parser_parse_definitely (parser
))
14879 /* The function we call to handle a using-declaration is different
14880 depending on what scope we are in. */
14881 if (qscope
== error_mark_node
|| identifier
== error_mark_node
)
14883 else if (TREE_CODE (identifier
) != IDENTIFIER_NODE
14884 && TREE_CODE (identifier
) != BIT_NOT_EXPR
)
14885 /* [namespace.udecl]
14887 A using declaration shall not name a template-id. */
14888 error_at (token
->location
,
14889 "a template-id may not appear in a using-declaration");
14892 if (at_class_scope_p ())
14894 /* Create the USING_DECL. */
14895 decl
= do_class_using_decl (parser
->scope
, identifier
);
14897 if (check_for_bare_parameter_packs (decl
))
14900 /* Add it to the list of members in this class. */
14901 finish_member_declaration (decl
);
14905 decl
= cp_parser_lookup_name_simple (parser
,
14908 if (decl
== error_mark_node
)
14909 cp_parser_name_lookup_error (parser
, identifier
,
14912 else if (check_for_bare_parameter_packs (decl
))
14914 else if (!at_namespace_scope_p ())
14915 do_local_using_decl (decl
, qscope
, identifier
);
14917 do_toplevel_using_decl (decl
, qscope
, identifier
);
14921 /* Look for the final `;'. */
14922 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
14927 /* Parse an alias-declaration.
14930 using identifier attribute-specifier-seq [opt] = type-id */
14933 cp_parser_alias_declaration (cp_parser
* parser
)
14935 tree id
, type
, decl
, pushed_scope
= NULL_TREE
, attributes
;
14936 location_t id_location
;
14937 cp_declarator
*declarator
;
14938 cp_decl_specifier_seq decl_specs
;
14941 /* Look for the `using' keyword. */
14942 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
14943 id_location
= cp_lexer_peek_token (parser
->lexer
)->location
;
14944 id
= cp_parser_identifier (parser
);
14945 attributes
= cp_parser_attributes_opt (parser
);
14946 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
14948 type
= cp_parser_type_id (parser
);
14949 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
14951 if (cp_parser_error_occurred (parser
))
14952 return error_mark_node
;
14954 /* A typedef-name can also be introduced by an alias-declaration. The
14955 identifier following the using keyword becomes a typedef-name. It has
14956 the same semantics as if it were introduced by the typedef
14957 specifier. In particular, it does not define a new type and it shall
14958 not appear in the type-id. */
14960 clear_decl_specs (&decl_specs
);
14961 decl_specs
.type
= type
;
14962 decl_specs
.attributes
= attributes
;
14963 ++decl_specs
.specs
[(int) ds_typedef
];
14964 ++decl_specs
.specs
[(int) ds_alias
];
14966 declarator
= make_id_declarator (NULL_TREE
, id
, sfk_none
);
14967 declarator
->id_loc
= id_location
;
14969 member_p
= at_class_scope_p ();
14971 decl
= grokfield (declarator
, &decl_specs
, NULL_TREE
, false,
14972 NULL_TREE
, attributes
);
14974 decl
= start_decl (declarator
, &decl_specs
, 0,
14975 attributes
, NULL_TREE
, &pushed_scope
);
14976 if (decl
== error_mark_node
)
14979 cp_finish_decl (decl
, NULL_TREE
, 0, NULL_TREE
, 0);
14982 pop_scope (pushed_scope
);
14984 /* If decl is a template, return its TEMPLATE_DECL so that it gets
14985 added into the symbol table; otherwise, return the TYPE_DECL. */
14986 if (DECL_LANG_SPECIFIC (decl
)
14987 && DECL_TEMPLATE_INFO (decl
)
14988 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
14990 decl
= DECL_TI_TEMPLATE (decl
);
14992 check_member_template (decl
);
14998 /* Parse a using-directive.
15001 using namespace :: [opt] nested-name-specifier [opt]
15002 namespace-name ; */
15005 cp_parser_using_directive (cp_parser
* parser
)
15007 tree namespace_decl
;
15010 /* Look for the `using' keyword. */
15011 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
15012 /* And the `namespace' keyword. */
15013 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
15014 /* Look for the optional `::' operator. */
15015 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
15016 /* And the optional nested-name-specifier. */
15017 cp_parser_nested_name_specifier_opt (parser
,
15018 /*typename_keyword_p=*/false,
15019 /*check_dependency_p=*/true,
15021 /*is_declaration=*/true);
15022 /* Get the namespace being used. */
15023 namespace_decl
= cp_parser_namespace_name (parser
);
15024 /* And any specified attributes. */
15025 attribs
= cp_parser_attributes_opt (parser
);
15026 /* Update the symbol table. */
15027 parse_using_directive (namespace_decl
, attribs
);
15028 /* Look for the final `;'. */
15029 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
15032 /* Parse an asm-definition.
15035 asm ( string-literal ) ;
15040 asm volatile [opt] ( string-literal ) ;
15041 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15042 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15043 : asm-operand-list [opt] ) ;
15044 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15045 : asm-operand-list [opt]
15046 : asm-clobber-list [opt] ) ;
15047 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15048 : asm-clobber-list [opt]
15049 : asm-goto-list ) ; */
15052 cp_parser_asm_definition (cp_parser
* parser
)
15055 tree outputs
= NULL_TREE
;
15056 tree inputs
= NULL_TREE
;
15057 tree clobbers
= NULL_TREE
;
15058 tree labels
= NULL_TREE
;
15060 bool volatile_p
= false;
15061 bool extended_p
= false;
15062 bool invalid_inputs_p
= false;
15063 bool invalid_outputs_p
= false;
15064 bool goto_p
= false;
15065 required_token missing
= RT_NONE
;
15067 /* Look for the `asm' keyword. */
15068 cp_parser_require_keyword (parser
, RID_ASM
, RT_ASM
);
15069 /* See if the next token is `volatile'. */
15070 if (cp_parser_allow_gnu_extensions_p (parser
)
15071 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_VOLATILE
))
15073 /* Remember that we saw the `volatile' keyword. */
15075 /* Consume the token. */
15076 cp_lexer_consume_token (parser
->lexer
);
15078 if (cp_parser_allow_gnu_extensions_p (parser
)
15079 && parser
->in_function_body
15080 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_GOTO
))
15082 /* Remember that we saw the `goto' keyword. */
15084 /* Consume the token. */
15085 cp_lexer_consume_token (parser
->lexer
);
15087 /* Look for the opening `('. */
15088 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
15090 /* Look for the string. */
15091 string
= cp_parser_string_literal (parser
, false, false);
15092 if (string
== error_mark_node
)
15094 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
15095 /*consume_paren=*/true);
15099 /* If we're allowing GNU extensions, check for the extended assembly
15100 syntax. Unfortunately, the `:' tokens need not be separated by
15101 a space in C, and so, for compatibility, we tolerate that here
15102 too. Doing that means that we have to treat the `::' operator as
15104 if (cp_parser_allow_gnu_extensions_p (parser
)
15105 && parser
->in_function_body
15106 && (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)
15107 || cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
)))
15109 bool inputs_p
= false;
15110 bool clobbers_p
= false;
15111 bool labels_p
= false;
15113 /* The extended syntax was used. */
15116 /* Look for outputs. */
15117 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
15119 /* Consume the `:'. */
15120 cp_lexer_consume_token (parser
->lexer
);
15121 /* Parse the output-operands. */
15122 if (cp_lexer_next_token_is_not (parser
->lexer
,
15124 && cp_lexer_next_token_is_not (parser
->lexer
,
15126 && cp_lexer_next_token_is_not (parser
->lexer
,
15129 outputs
= cp_parser_asm_operand_list (parser
);
15131 if (outputs
== error_mark_node
)
15132 invalid_outputs_p
= true;
15134 /* If the next token is `::', there are no outputs, and the
15135 next token is the beginning of the inputs. */
15136 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
15137 /* The inputs are coming next. */
15140 /* Look for inputs. */
15142 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
15144 /* Consume the `:' or `::'. */
15145 cp_lexer_consume_token (parser
->lexer
);
15146 /* Parse the output-operands. */
15147 if (cp_lexer_next_token_is_not (parser
->lexer
,
15149 && cp_lexer_next_token_is_not (parser
->lexer
,
15151 && cp_lexer_next_token_is_not (parser
->lexer
,
15153 inputs
= cp_parser_asm_operand_list (parser
);
15155 if (inputs
== error_mark_node
)
15156 invalid_inputs_p
= true;
15158 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
15159 /* The clobbers are coming next. */
15162 /* Look for clobbers. */
15164 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
15167 /* Consume the `:' or `::'. */
15168 cp_lexer_consume_token (parser
->lexer
);
15169 /* Parse the clobbers. */
15170 if (cp_lexer_next_token_is_not (parser
->lexer
,
15172 && cp_lexer_next_token_is_not (parser
->lexer
,
15174 clobbers
= cp_parser_asm_clobber_list (parser
);
15177 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
15178 /* The labels are coming next. */
15181 /* Look for labels. */
15183 || (goto_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)))
15186 /* Consume the `:' or `::'. */
15187 cp_lexer_consume_token (parser
->lexer
);
15188 /* Parse the labels. */
15189 labels
= cp_parser_asm_label_list (parser
);
15192 if (goto_p
&& !labels_p
)
15193 missing
= clobbers_p
? RT_COLON
: RT_COLON_SCOPE
;
15196 missing
= RT_COLON_SCOPE
;
15198 /* Look for the closing `)'. */
15199 if (!cp_parser_require (parser
, missing
? CPP_COLON
: CPP_CLOSE_PAREN
,
15200 missing
? missing
: RT_CLOSE_PAREN
))
15201 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
15202 /*consume_paren=*/true);
15203 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
15205 if (!invalid_inputs_p
&& !invalid_outputs_p
)
15207 /* Create the ASM_EXPR. */
15208 if (parser
->in_function_body
)
15210 asm_stmt
= finish_asm_stmt (volatile_p
, string
, outputs
,
15211 inputs
, clobbers
, labels
);
15212 /* If the extended syntax was not used, mark the ASM_EXPR. */
15215 tree temp
= asm_stmt
;
15216 if (TREE_CODE (temp
) == CLEANUP_POINT_EXPR
)
15217 temp
= TREE_OPERAND (temp
, 0);
15219 ASM_INPUT_P (temp
) = 1;
15223 cgraph_add_asm_node (string
);
15227 /* Declarators [gram.dcl.decl] */
15229 /* Parse an init-declarator.
15232 declarator initializer [opt]
15237 declarator asm-specification [opt] attributes [opt] initializer [opt]
15239 function-definition:
15240 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15242 decl-specifier-seq [opt] declarator function-try-block
15246 function-definition:
15247 __extension__ function-definition
15251 function-definition:
15252 decl-specifier-seq [opt] declarator function-transaction-block
15254 The DECL_SPECIFIERS apply to this declarator. Returns a
15255 representation of the entity declared. If MEMBER_P is TRUE, then
15256 this declarator appears in a class scope. The new DECL created by
15257 this declarator is returned.
15259 The CHECKS are access checks that should be performed once we know
15260 what entity is being declared (and, therefore, what classes have
15263 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15264 for a function-definition here as well. If the declarator is a
15265 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15266 be TRUE upon return. By that point, the function-definition will
15267 have been completely parsed.
15269 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15272 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15273 parsed declaration if it is an uninitialized single declarator not followed
15274 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15275 if present, will not be consumed. If returned, this declarator will be
15276 created with SD_INITIALIZED but will not call cp_finish_decl. */
15279 cp_parser_init_declarator (cp_parser
* parser
,
15280 cp_decl_specifier_seq
*decl_specifiers
,
15281 VEC (deferred_access_check
,gc
)* checks
,
15282 bool function_definition_allowed_p
,
15284 int declares_class_or_enum
,
15285 bool* function_definition_p
,
15286 tree
* maybe_range_for_decl
)
15288 cp_token
*token
= NULL
, *asm_spec_start_token
= NULL
,
15289 *attributes_start_token
= NULL
;
15290 cp_declarator
*declarator
;
15291 tree prefix_attributes
;
15293 tree asm_specification
;
15295 tree decl
= NULL_TREE
;
15297 int is_initialized
;
15298 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15299 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15301 enum cpp_ttype initialization_kind
;
15302 bool is_direct_init
= false;
15303 bool is_non_constant_init
;
15304 int ctor_dtor_or_conv_p
;
15306 tree pushed_scope
= NULL_TREE
;
15307 bool range_for_decl_p
= false;
15309 /* Gather the attributes that were provided with the
15310 decl-specifiers. */
15311 prefix_attributes
= decl_specifiers
->attributes
;
15313 /* Assume that this is not the declarator for a function
15315 if (function_definition_p
)
15316 *function_definition_p
= false;
15318 /* Defer access checks while parsing the declarator; we cannot know
15319 what names are accessible until we know what is being
15321 resume_deferring_access_checks ();
15323 /* Parse the declarator. */
15324 token
= cp_lexer_peek_token (parser
->lexer
);
15326 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
15327 &ctor_dtor_or_conv_p
,
15328 /*parenthesized_p=*/NULL
,
15330 /* Gather up the deferred checks. */
15331 stop_deferring_access_checks ();
15333 /* If the DECLARATOR was erroneous, there's no need to go
15335 if (declarator
== cp_error_declarator
)
15336 return error_mark_node
;
15338 /* Check that the number of template-parameter-lists is OK. */
15339 if (!cp_parser_check_declarator_template_parameters (parser
, declarator
,
15341 return error_mark_node
;
15343 if (declares_class_or_enum
& 2)
15344 cp_parser_check_for_definition_in_return_type (declarator
,
15345 decl_specifiers
->type
,
15346 decl_specifiers
->type_location
);
15348 /* Figure out what scope the entity declared by the DECLARATOR is
15349 located in. `grokdeclarator' sometimes changes the scope, so
15350 we compute it now. */
15351 scope
= get_scope_of_declarator (declarator
);
15353 /* Perform any lookups in the declared type which were thought to be
15354 dependent, but are not in the scope of the declarator. */
15355 decl_specifiers
->type
15356 = maybe_update_decl_type (decl_specifiers
->type
, scope
);
15358 /* If we're allowing GNU extensions, look for an asm-specification
15360 if (cp_parser_allow_gnu_extensions_p (parser
))
15362 /* Look for an asm-specification. */
15363 asm_spec_start_token
= cp_lexer_peek_token (parser
->lexer
);
15364 asm_specification
= cp_parser_asm_specification_opt (parser
);
15365 /* And attributes. */
15366 attributes_start_token
= cp_lexer_peek_token (parser
->lexer
);
15367 attributes
= cp_parser_attributes_opt (parser
);
15371 asm_specification
= NULL_TREE
;
15372 attributes
= NULL_TREE
;
15375 /* Peek at the next token. */
15376 token
= cp_lexer_peek_token (parser
->lexer
);
15377 /* Check to see if the token indicates the start of a
15378 function-definition. */
15379 if (function_declarator_p (declarator
)
15380 && cp_parser_token_starts_function_definition_p (token
))
15382 if (!function_definition_allowed_p
)
15384 /* If a function-definition should not appear here, issue an
15386 cp_parser_error (parser
,
15387 "a function-definition is not allowed here");
15388 return error_mark_node
;
15392 location_t func_brace_location
15393 = cp_lexer_peek_token (parser
->lexer
)->location
;
15395 /* Neither attributes nor an asm-specification are allowed
15396 on a function-definition. */
15397 if (asm_specification
)
15398 error_at (asm_spec_start_token
->location
,
15399 "an asm-specification is not allowed "
15400 "on a function-definition");
15402 error_at (attributes_start_token
->location
,
15403 "attributes are not allowed on a function-definition");
15404 /* This is a function-definition. */
15405 *function_definition_p
= true;
15407 /* Parse the function definition. */
15409 decl
= cp_parser_save_member_function_body (parser
,
15412 prefix_attributes
);
15415 = (cp_parser_function_definition_from_specifiers_and_declarator
15416 (parser
, decl_specifiers
, prefix_attributes
, declarator
));
15418 if (decl
!= error_mark_node
&& DECL_STRUCT_FUNCTION (decl
))
15420 /* This is where the prologue starts... */
15421 DECL_STRUCT_FUNCTION (decl
)->function_start_locus
15422 = func_brace_location
;
15431 Only in function declarations for constructors, destructors, and
15432 type conversions can the decl-specifier-seq be omitted.
15434 We explicitly postpone this check past the point where we handle
15435 function-definitions because we tolerate function-definitions
15436 that are missing their return types in some modes. */
15437 if (!decl_specifiers
->any_specifiers_p
&& ctor_dtor_or_conv_p
<= 0)
15439 cp_parser_error (parser
,
15440 "expected constructor, destructor, or type conversion");
15441 return error_mark_node
;
15444 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15445 if (token
->type
== CPP_EQ
15446 || token
->type
== CPP_OPEN_PAREN
15447 || token
->type
== CPP_OPEN_BRACE
)
15449 is_initialized
= SD_INITIALIZED
;
15450 initialization_kind
= token
->type
;
15451 if (maybe_range_for_decl
)
15452 *maybe_range_for_decl
= error_mark_node
;
15454 if (token
->type
== CPP_EQ
15455 && function_declarator_p (declarator
))
15457 cp_token
*t2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
15458 if (t2
->keyword
== RID_DEFAULT
)
15459 is_initialized
= SD_DEFAULTED
;
15460 else if (t2
->keyword
== RID_DELETE
)
15461 is_initialized
= SD_DELETED
;
15466 /* If the init-declarator isn't initialized and isn't followed by a
15467 `,' or `;', it's not a valid init-declarator. */
15468 if (token
->type
!= CPP_COMMA
15469 && token
->type
!= CPP_SEMICOLON
)
15471 if (maybe_range_for_decl
&& *maybe_range_for_decl
!= error_mark_node
)
15472 range_for_decl_p
= true;
15475 cp_parser_error (parser
, "expected initializer");
15476 return error_mark_node
;
15479 is_initialized
= SD_UNINITIALIZED
;
15480 initialization_kind
= CPP_EOF
;
15483 /* Because start_decl has side-effects, we should only call it if we
15484 know we're going ahead. By this point, we know that we cannot
15485 possibly be looking at any other construct. */
15486 cp_parser_commit_to_tentative_parse (parser
);
15488 /* If the decl specifiers were bad, issue an error now that we're
15489 sure this was intended to be a declarator. Then continue
15490 declaring the variable(s), as int, to try to cut down on further
15492 if (decl_specifiers
->any_specifiers_p
15493 && decl_specifiers
->type
== error_mark_node
)
15495 cp_parser_error (parser
, "invalid type in declaration");
15496 decl_specifiers
->type
= integer_type_node
;
15499 /* Check to see whether or not this declaration is a friend. */
15500 friend_p
= cp_parser_friend_p (decl_specifiers
);
15502 /* Enter the newly declared entry in the symbol table. If we're
15503 processing a declaration in a class-specifier, we wait until
15504 after processing the initializer. */
15507 if (parser
->in_unbraced_linkage_specification_p
)
15508 decl_specifiers
->storage_class
= sc_extern
;
15509 decl
= start_decl (declarator
, decl_specifiers
,
15510 range_for_decl_p
? SD_INITIALIZED
: is_initialized
,
15511 attributes
, prefix_attributes
,
15513 /* Adjust location of decl if declarator->id_loc is more appropriate:
15514 set, and decl wasn't merged with another decl, in which case its
15515 location would be different from input_location, and more accurate. */
15517 && declarator
->id_loc
!= UNKNOWN_LOCATION
15518 && DECL_SOURCE_LOCATION (decl
) == input_location
)
15519 DECL_SOURCE_LOCATION (decl
) = declarator
->id_loc
;
15522 /* Enter the SCOPE. That way unqualified names appearing in the
15523 initializer will be looked up in SCOPE. */
15524 pushed_scope
= push_scope (scope
);
15526 /* Perform deferred access control checks, now that we know in which
15527 SCOPE the declared entity resides. */
15528 if (!member_p
&& decl
)
15530 tree saved_current_function_decl
= NULL_TREE
;
15532 /* If the entity being declared is a function, pretend that we
15533 are in its scope. If it is a `friend', it may have access to
15534 things that would not otherwise be accessible. */
15535 if (TREE_CODE (decl
) == FUNCTION_DECL
)
15537 saved_current_function_decl
= current_function_decl
;
15538 current_function_decl
= decl
;
15541 /* Perform access checks for template parameters. */
15542 cp_parser_perform_template_parameter_access_checks (checks
);
15544 /* Perform the access control checks for the declarator and the
15545 decl-specifiers. */
15546 perform_deferred_access_checks ();
15548 /* Restore the saved value. */
15549 if (TREE_CODE (decl
) == FUNCTION_DECL
)
15550 current_function_decl
= saved_current_function_decl
;
15553 /* Parse the initializer. */
15554 initializer
= NULL_TREE
;
15555 is_direct_init
= false;
15556 is_non_constant_init
= true;
15557 if (is_initialized
)
15559 if (function_declarator_p (declarator
))
15561 cp_token
*initializer_start_token
= cp_lexer_peek_token (parser
->lexer
);
15562 if (initialization_kind
== CPP_EQ
)
15563 initializer
= cp_parser_pure_specifier (parser
);
15566 /* If the declaration was erroneous, we don't really
15567 know what the user intended, so just silently
15568 consume the initializer. */
15569 if (decl
!= error_mark_node
)
15570 error_at (initializer_start_token
->location
,
15571 "initializer provided for function");
15572 cp_parser_skip_to_closing_parenthesis (parser
,
15573 /*recovering=*/true,
15574 /*or_comma=*/false,
15575 /*consume_paren=*/true);
15580 /* We want to record the extra mangling scope for in-class
15581 initializers of class members and initializers of static data
15582 member templates. The former is a C++0x feature which isn't
15583 implemented yet, and I expect it will involve deferring
15584 parsing of the initializer until end of class as with default
15585 arguments. So right here we only handle the latter. */
15586 if (!member_p
&& processing_template_decl
)
15587 start_lambda_scope (decl
);
15588 initializer
= cp_parser_initializer (parser
,
15590 &is_non_constant_init
);
15591 if (!member_p
&& processing_template_decl
)
15592 finish_lambda_scope ();
15596 /* The old parser allows attributes to appear after a parenthesized
15597 initializer. Mark Mitchell proposed removing this functionality
15598 on the GCC mailing lists on 2002-08-13. This parser accepts the
15599 attributes -- but ignores them. */
15600 if (cp_parser_allow_gnu_extensions_p (parser
)
15601 && initialization_kind
== CPP_OPEN_PAREN
)
15602 if (cp_parser_attributes_opt (parser
))
15603 warning (OPT_Wattributes
,
15604 "attributes after parenthesized initializer ignored");
15606 /* For an in-class declaration, use `grokfield' to create the
15612 pop_scope (pushed_scope
);
15613 pushed_scope
= NULL_TREE
;
15615 decl
= grokfield (declarator
, decl_specifiers
,
15616 initializer
, !is_non_constant_init
,
15617 /*asmspec=*/NULL_TREE
,
15618 prefix_attributes
);
15619 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
15620 cp_parser_save_default_args (parser
, decl
);
15623 /* Finish processing the declaration. But, skip member
15625 if (!member_p
&& decl
&& decl
!= error_mark_node
&& !range_for_decl_p
)
15627 cp_finish_decl (decl
,
15628 initializer
, !is_non_constant_init
,
15630 /* If the initializer is in parentheses, then this is
15631 a direct-initialization, which means that an
15632 `explicit' constructor is OK. Otherwise, an
15633 `explicit' constructor cannot be used. */
15634 ((is_direct_init
|| !is_initialized
)
15635 ? LOOKUP_NORMAL
: LOOKUP_IMPLICIT
));
15637 else if ((cxx_dialect
!= cxx98
) && friend_p
15638 && decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
15639 /* Core issue #226 (C++0x only): A default template-argument
15640 shall not be specified in a friend class template
15642 check_default_tmpl_args (decl
, current_template_parms
, /*is_primary=*/1,
15643 /*is_partial=*/0, /*is_friend_decl=*/1);
15645 if (!friend_p
&& pushed_scope
)
15646 pop_scope (pushed_scope
);
15651 /* Parse a declarator.
15655 ptr-operator declarator
15657 abstract-declarator:
15658 ptr-operator abstract-declarator [opt]
15659 direct-abstract-declarator
15664 attributes [opt] direct-declarator
15665 attributes [opt] ptr-operator declarator
15667 abstract-declarator:
15668 attributes [opt] ptr-operator abstract-declarator [opt]
15669 attributes [opt] direct-abstract-declarator
15671 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15672 detect constructor, destructor or conversion operators. It is set
15673 to -1 if the declarator is a name, and +1 if it is a
15674 function. Otherwise it is set to zero. Usually you just want to
15675 test for >0, but internally the negative value is used.
15677 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15678 a decl-specifier-seq unless it declares a constructor, destructor,
15679 or conversion. It might seem that we could check this condition in
15680 semantic analysis, rather than parsing, but that makes it difficult
15681 to handle something like `f()'. We want to notice that there are
15682 no decl-specifiers, and therefore realize that this is an
15683 expression, not a declaration.)
15685 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15686 the declarator is a direct-declarator of the form "(...)".
15688 MEMBER_P is true iff this declarator is a member-declarator. */
15690 static cp_declarator
*
15691 cp_parser_declarator (cp_parser
* parser
,
15692 cp_parser_declarator_kind dcl_kind
,
15693 int* ctor_dtor_or_conv_p
,
15694 bool* parenthesized_p
,
15697 cp_declarator
*declarator
;
15698 enum tree_code code
;
15699 cp_cv_quals cv_quals
;
15701 tree attributes
= NULL_TREE
;
15703 /* Assume this is not a constructor, destructor, or type-conversion
15705 if (ctor_dtor_or_conv_p
)
15706 *ctor_dtor_or_conv_p
= 0;
15708 if (cp_parser_allow_gnu_extensions_p (parser
))
15709 attributes
= cp_parser_attributes_opt (parser
);
15711 /* Check for the ptr-operator production. */
15712 cp_parser_parse_tentatively (parser
);
15713 /* Parse the ptr-operator. */
15714 code
= cp_parser_ptr_operator (parser
,
15717 /* If that worked, then we have a ptr-operator. */
15718 if (cp_parser_parse_definitely (parser
))
15720 /* If a ptr-operator was found, then this declarator was not
15722 if (parenthesized_p
)
15723 *parenthesized_p
= true;
15724 /* The dependent declarator is optional if we are parsing an
15725 abstract-declarator. */
15726 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
15727 cp_parser_parse_tentatively (parser
);
15729 /* Parse the dependent declarator. */
15730 declarator
= cp_parser_declarator (parser
, dcl_kind
,
15731 /*ctor_dtor_or_conv_p=*/NULL
,
15732 /*parenthesized_p=*/NULL
,
15733 /*member_p=*/false);
15735 /* If we are parsing an abstract-declarator, we must handle the
15736 case where the dependent declarator is absent. */
15737 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
15738 && !cp_parser_parse_definitely (parser
))
15741 declarator
= cp_parser_make_indirect_declarator
15742 (code
, class_type
, cv_quals
, declarator
);
15744 /* Everything else is a direct-declarator. */
15747 if (parenthesized_p
)
15748 *parenthesized_p
= cp_lexer_next_token_is (parser
->lexer
,
15750 declarator
= cp_parser_direct_declarator (parser
, dcl_kind
,
15751 ctor_dtor_or_conv_p
,
15755 if (attributes
&& declarator
&& declarator
!= cp_error_declarator
)
15756 declarator
->attributes
= attributes
;
15761 /* Parse a direct-declarator or direct-abstract-declarator.
15765 direct-declarator ( parameter-declaration-clause )
15766 cv-qualifier-seq [opt]
15767 exception-specification [opt]
15768 direct-declarator [ constant-expression [opt] ]
15771 direct-abstract-declarator:
15772 direct-abstract-declarator [opt]
15773 ( parameter-declaration-clause )
15774 cv-qualifier-seq [opt]
15775 exception-specification [opt]
15776 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15777 ( abstract-declarator )
15779 Returns a representation of the declarator. DCL_KIND is
15780 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15781 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15782 we are parsing a direct-declarator. It is
15783 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15784 of ambiguity we prefer an abstract declarator, as per
15785 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15786 cp_parser_declarator. */
15788 static cp_declarator
*
15789 cp_parser_direct_declarator (cp_parser
* parser
,
15790 cp_parser_declarator_kind dcl_kind
,
15791 int* ctor_dtor_or_conv_p
,
15795 cp_declarator
*declarator
= NULL
;
15796 tree scope
= NULL_TREE
;
15797 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
15798 bool saved_in_declarator_p
= parser
->in_declarator_p
;
15800 tree pushed_scope
= NULL_TREE
;
15804 /* Peek at the next token. */
15805 token
= cp_lexer_peek_token (parser
->lexer
);
15806 if (token
->type
== CPP_OPEN_PAREN
)
15808 /* This is either a parameter-declaration-clause, or a
15809 parenthesized declarator. When we know we are parsing a
15810 named declarator, it must be a parenthesized declarator
15811 if FIRST is true. For instance, `(int)' is a
15812 parameter-declaration-clause, with an omitted
15813 direct-abstract-declarator. But `((*))', is a
15814 parenthesized abstract declarator. Finally, when T is a
15815 template parameter `(T)' is a
15816 parameter-declaration-clause, and not a parenthesized
15819 We first try and parse a parameter-declaration-clause,
15820 and then try a nested declarator (if FIRST is true).
15822 It is not an error for it not to be a
15823 parameter-declaration-clause, even when FIRST is
15829 The first is the declaration of a function while the
15830 second is the definition of a variable, including its
15833 Having seen only the parenthesis, we cannot know which of
15834 these two alternatives should be selected. Even more
15835 complex are examples like:
15840 The former is a function-declaration; the latter is a
15841 variable initialization.
15843 Thus again, we try a parameter-declaration-clause, and if
15844 that fails, we back out and return. */
15846 if (!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
15849 unsigned saved_num_template_parameter_lists
;
15850 bool is_declarator
= false;
15853 /* In a member-declarator, the only valid interpretation
15854 of a parenthesis is the start of a
15855 parameter-declaration-clause. (It is invalid to
15856 initialize a static data member with a parenthesized
15857 initializer; only the "=" form of initialization is
15860 cp_parser_parse_tentatively (parser
);
15862 /* Consume the `('. */
15863 cp_lexer_consume_token (parser
->lexer
);
15866 /* If this is going to be an abstract declarator, we're
15867 in a declarator and we can't have default args. */
15868 parser
->default_arg_ok_p
= false;
15869 parser
->in_declarator_p
= true;
15872 /* Inside the function parameter list, surrounding
15873 template-parameter-lists do not apply. */
15874 saved_num_template_parameter_lists
15875 = parser
->num_template_parameter_lists
;
15876 parser
->num_template_parameter_lists
= 0;
15878 begin_scope (sk_function_parms
, NULL_TREE
);
15880 /* Parse the parameter-declaration-clause. */
15881 params
= cp_parser_parameter_declaration_clause (parser
);
15883 parser
->num_template_parameter_lists
15884 = saved_num_template_parameter_lists
;
15886 /* Consume the `)'. */
15887 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
15889 /* If all went well, parse the cv-qualifier-seq and the
15890 exception-specification. */
15891 if (member_p
|| cp_parser_parse_definitely (parser
))
15893 cp_cv_quals cv_quals
;
15894 cp_virt_specifiers virt_specifiers
;
15895 tree exception_specification
;
15898 is_declarator
= true;
15900 if (ctor_dtor_or_conv_p
)
15901 *ctor_dtor_or_conv_p
= *ctor_dtor_or_conv_p
< 0;
15904 /* Parse the cv-qualifier-seq. */
15905 cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
15906 /* And the exception-specification. */
15907 exception_specification
15908 = cp_parser_exception_specification_opt (parser
);
15909 /* Parse the virt-specifier-seq. */
15910 virt_specifiers
= cp_parser_virt_specifier_seq_opt (parser
);
15912 late_return
= (cp_parser_late_return_type_opt
15913 (parser
, member_p
? cv_quals
: -1));
15915 /* Create the function-declarator. */
15916 declarator
= make_call_declarator (declarator
,
15920 exception_specification
,
15922 /* Any subsequent parameter lists are to do with
15923 return type, so are not those of the declared
15925 parser
->default_arg_ok_p
= false;
15928 /* Remove the function parms from scope. */
15929 for (t
= current_binding_level
->names
; t
; t
= DECL_CHAIN (t
))
15930 pop_binding (DECL_NAME (t
), t
);
15934 /* Repeat the main loop. */
15938 /* If this is the first, we can try a parenthesized
15942 bool saved_in_type_id_in_expr_p
;
15944 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
15945 parser
->in_declarator_p
= saved_in_declarator_p
;
15947 /* Consume the `('. */
15948 cp_lexer_consume_token (parser
->lexer
);
15949 /* Parse the nested declarator. */
15950 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
15951 parser
->in_type_id_in_expr_p
= true;
15953 = cp_parser_declarator (parser
, dcl_kind
, ctor_dtor_or_conv_p
,
15954 /*parenthesized_p=*/NULL
,
15956 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
15958 /* Expect a `)'. */
15959 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
15960 declarator
= cp_error_declarator
;
15961 if (declarator
== cp_error_declarator
)
15964 goto handle_declarator
;
15966 /* Otherwise, we must be done. */
15970 else if ((!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
15971 && token
->type
== CPP_OPEN_SQUARE
)
15973 /* Parse an array-declarator. */
15976 if (ctor_dtor_or_conv_p
)
15977 *ctor_dtor_or_conv_p
= 0;
15980 parser
->default_arg_ok_p
= false;
15981 parser
->in_declarator_p
= true;
15982 /* Consume the `['. */
15983 cp_lexer_consume_token (parser
->lexer
);
15984 /* Peek at the next token. */
15985 token
= cp_lexer_peek_token (parser
->lexer
);
15986 /* If the next token is `]', then there is no
15987 constant-expression. */
15988 if (token
->type
!= CPP_CLOSE_SQUARE
)
15990 bool non_constant_p
;
15993 = cp_parser_constant_expression (parser
,
15994 /*allow_non_constant=*/true,
15996 if (!non_constant_p
)
15998 /* Normally, the array bound must be an integral constant
15999 expression. However, as an extension, we allow VLAs
16000 in function scopes as long as they aren't part of a
16001 parameter declaration. */
16002 else if (!parser
->in_function_body
16003 || current_binding_level
->kind
== sk_function_parms
)
16005 cp_parser_error (parser
,
16006 "array bound is not an integer constant");
16007 bounds
= error_mark_node
;
16009 else if (processing_template_decl
&& !error_operand_p (bounds
))
16011 /* Remember this wasn't a constant-expression. */
16012 bounds
= build_nop (TREE_TYPE (bounds
), bounds
);
16013 TREE_SIDE_EFFECTS (bounds
) = 1;
16017 bounds
= NULL_TREE
;
16018 /* Look for the closing `]'. */
16019 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
16021 declarator
= cp_error_declarator
;
16025 declarator
= make_array_declarator (declarator
, bounds
);
16027 else if (first
&& dcl_kind
!= CP_PARSER_DECLARATOR_ABSTRACT
)
16030 tree qualifying_scope
;
16031 tree unqualified_name
;
16032 special_function_kind sfk
;
16034 bool pack_expansion_p
= false;
16035 cp_token
*declarator_id_start_token
;
16037 /* Parse a declarator-id */
16038 abstract_ok
= (dcl_kind
== CP_PARSER_DECLARATOR_EITHER
);
16041 cp_parser_parse_tentatively (parser
);
16043 /* If we see an ellipsis, we should be looking at a
16045 if (token
->type
== CPP_ELLIPSIS
)
16047 /* Consume the `...' */
16048 cp_lexer_consume_token (parser
->lexer
);
16050 pack_expansion_p
= true;
16054 declarator_id_start_token
= cp_lexer_peek_token (parser
->lexer
);
16056 = cp_parser_declarator_id (parser
, /*optional_p=*/abstract_ok
);
16057 qualifying_scope
= parser
->scope
;
16062 if (!unqualified_name
&& pack_expansion_p
)
16064 /* Check whether an error occurred. */
16065 okay
= !cp_parser_error_occurred (parser
);
16067 /* We already consumed the ellipsis to mark a
16068 parameter pack, but we have no way to report it,
16069 so abort the tentative parse. We will be exiting
16070 immediately anyway. */
16071 cp_parser_abort_tentative_parse (parser
);
16074 okay
= cp_parser_parse_definitely (parser
);
16077 unqualified_name
= error_mark_node
;
16078 else if (unqualified_name
16079 && (qualifying_scope
16080 || (TREE_CODE (unqualified_name
)
16081 != IDENTIFIER_NODE
)))
16083 cp_parser_error (parser
, "expected unqualified-id");
16084 unqualified_name
= error_mark_node
;
16088 if (!unqualified_name
)
16090 if (unqualified_name
== error_mark_node
)
16092 declarator
= cp_error_declarator
;
16093 pack_expansion_p
= false;
16094 declarator
->parameter_pack_p
= false;
16098 if (qualifying_scope
&& at_namespace_scope_p ()
16099 && TREE_CODE (qualifying_scope
) == TYPENAME_TYPE
)
16101 /* In the declaration of a member of a template class
16102 outside of the class itself, the SCOPE will sometimes
16103 be a TYPENAME_TYPE. For example, given:
16105 template <typename T>
16106 int S<T>::R::i = 3;
16108 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16109 this context, we must resolve S<T>::R to an ordinary
16110 type, rather than a typename type.
16112 The reason we normally avoid resolving TYPENAME_TYPEs
16113 is that a specialization of `S' might render
16114 `S<T>::R' not a type. However, if `S' is
16115 specialized, then this `i' will not be used, so there
16116 is no harm in resolving the types here. */
16119 /* Resolve the TYPENAME_TYPE. */
16120 type
= resolve_typename_type (qualifying_scope
,
16121 /*only_current_p=*/false);
16122 /* If that failed, the declarator is invalid. */
16123 if (TREE_CODE (type
) == TYPENAME_TYPE
)
16125 if (typedef_variant_p (type
))
16126 error_at (declarator_id_start_token
->location
,
16127 "cannot define member of dependent typedef "
16130 error_at (declarator_id_start_token
->location
,
16131 "%<%T::%E%> is not a type",
16132 TYPE_CONTEXT (qualifying_scope
),
16133 TYPE_IDENTIFIER (qualifying_scope
));
16135 qualifying_scope
= type
;
16140 if (unqualified_name
)
16144 if (qualifying_scope
16145 && CLASS_TYPE_P (qualifying_scope
))
16146 class_type
= qualifying_scope
;
16148 class_type
= current_class_type
;
16150 if (TREE_CODE (unqualified_name
) == TYPE_DECL
)
16152 tree name_type
= TREE_TYPE (unqualified_name
);
16153 if (class_type
&& same_type_p (name_type
, class_type
))
16155 if (qualifying_scope
16156 && CLASSTYPE_USE_TEMPLATE (name_type
))
16158 error_at (declarator_id_start_token
->location
,
16159 "invalid use of constructor as a template");
16160 inform (declarator_id_start_token
->location
,
16161 "use %<%T::%D%> instead of %<%T::%D%> to "
16162 "name the constructor in a qualified name",
16164 DECL_NAME (TYPE_TI_TEMPLATE (class_type
)),
16165 class_type
, name_type
);
16166 declarator
= cp_error_declarator
;
16170 unqualified_name
= constructor_name (class_type
);
16174 /* We do not attempt to print the declarator
16175 here because we do not have enough
16176 information about its original syntactic
16178 cp_parser_error (parser
, "invalid declarator");
16179 declarator
= cp_error_declarator
;
16186 if (TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
)
16187 sfk
= sfk_destructor
;
16188 else if (IDENTIFIER_TYPENAME_P (unqualified_name
))
16189 sfk
= sfk_conversion
;
16190 else if (/* There's no way to declare a constructor
16191 for an anonymous type, even if the type
16192 got a name for linkage purposes. */
16193 !TYPE_WAS_ANONYMOUS (class_type
)
16194 && constructor_name_p (unqualified_name
,
16197 unqualified_name
= constructor_name (class_type
);
16198 sfk
= sfk_constructor
;
16200 else if (is_overloaded_fn (unqualified_name
)
16201 && DECL_CONSTRUCTOR_P (get_first_fn
16202 (unqualified_name
)))
16203 sfk
= sfk_constructor
;
16205 if (ctor_dtor_or_conv_p
&& sfk
!= sfk_none
)
16206 *ctor_dtor_or_conv_p
= -1;
16209 declarator
= make_id_declarator (qualifying_scope
,
16212 declarator
->id_loc
= token
->location
;
16213 declarator
->parameter_pack_p
= pack_expansion_p
;
16215 if (pack_expansion_p
)
16216 maybe_warn_variadic_templates ();
16219 handle_declarator
:;
16220 scope
= get_scope_of_declarator (declarator
);
16222 /* Any names that appear after the declarator-id for a
16223 member are looked up in the containing scope. */
16224 pushed_scope
= push_scope (scope
);
16225 parser
->in_declarator_p
= true;
16226 if ((ctor_dtor_or_conv_p
&& *ctor_dtor_or_conv_p
)
16227 || (declarator
&& declarator
->kind
== cdk_id
))
16228 /* Default args are only allowed on function
16230 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
16232 parser
->default_arg_ok_p
= false;
16241 /* For an abstract declarator, we might wind up with nothing at this
16242 point. That's an error; the declarator is not optional. */
16244 cp_parser_error (parser
, "expected declarator");
16246 /* If we entered a scope, we must exit it now. */
16248 pop_scope (pushed_scope
);
16250 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
16251 parser
->in_declarator_p
= saved_in_declarator_p
;
16256 /* Parse a ptr-operator.
16259 * cv-qualifier-seq [opt]
16261 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16266 & cv-qualifier-seq [opt]
16268 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16269 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16270 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16271 filled in with the TYPE containing the member. *CV_QUALS is
16272 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16273 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16274 Note that the tree codes returned by this function have nothing
16275 to do with the types of trees that will be eventually be created
16276 to represent the pointer or reference type being parsed. They are
16277 just constants with suggestive names. */
16278 static enum tree_code
16279 cp_parser_ptr_operator (cp_parser
* parser
,
16281 cp_cv_quals
*cv_quals
)
16283 enum tree_code code
= ERROR_MARK
;
16286 /* Assume that it's not a pointer-to-member. */
16288 /* And that there are no cv-qualifiers. */
16289 *cv_quals
= TYPE_UNQUALIFIED
;
16291 /* Peek at the next token. */
16292 token
= cp_lexer_peek_token (parser
->lexer
);
16294 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16295 if (token
->type
== CPP_MULT
)
16296 code
= INDIRECT_REF
;
16297 else if (token
->type
== CPP_AND
)
16299 else if ((cxx_dialect
!= cxx98
) &&
16300 token
->type
== CPP_AND_AND
) /* C++0x only */
16301 code
= NON_LVALUE_EXPR
;
16303 if (code
!= ERROR_MARK
)
16305 /* Consume the `*', `&' or `&&'. */
16306 cp_lexer_consume_token (parser
->lexer
);
16308 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16309 `&', if we are allowing GNU extensions. (The only qualifier
16310 that can legally appear after `&' is `restrict', but that is
16311 enforced during semantic analysis. */
16312 if (code
== INDIRECT_REF
16313 || cp_parser_allow_gnu_extensions_p (parser
))
16314 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
16318 /* Try the pointer-to-member case. */
16319 cp_parser_parse_tentatively (parser
);
16320 /* Look for the optional `::' operator. */
16321 cp_parser_global_scope_opt (parser
,
16322 /*current_scope_valid_p=*/false);
16323 /* Look for the nested-name specifier. */
16324 token
= cp_lexer_peek_token (parser
->lexer
);
16325 cp_parser_nested_name_specifier (parser
,
16326 /*typename_keyword_p=*/false,
16327 /*check_dependency_p=*/true,
16329 /*is_declaration=*/false);
16330 /* If we found it, and the next token is a `*', then we are
16331 indeed looking at a pointer-to-member operator. */
16332 if (!cp_parser_error_occurred (parser
)
16333 && cp_parser_require (parser
, CPP_MULT
, RT_MULT
))
16335 /* Indicate that the `*' operator was used. */
16336 code
= INDIRECT_REF
;
16338 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
16339 error_at (token
->location
, "%qD is a namespace", parser
->scope
);
16342 /* The type of which the member is a member is given by the
16344 *type
= parser
->scope
;
16345 /* The next name will not be qualified. */
16346 parser
->scope
= NULL_TREE
;
16347 parser
->qualifying_scope
= NULL_TREE
;
16348 parser
->object_scope
= NULL_TREE
;
16349 /* Look for the optional cv-qualifier-seq. */
16350 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
16353 /* If that didn't work we don't have a ptr-operator. */
16354 if (!cp_parser_parse_definitely (parser
))
16355 cp_parser_error (parser
, "expected ptr-operator");
16361 /* Parse an (optional) cv-qualifier-seq.
16364 cv-qualifier cv-qualifier-seq [opt]
16375 Returns a bitmask representing the cv-qualifiers. */
16378 cp_parser_cv_qualifier_seq_opt (cp_parser
* parser
)
16380 cp_cv_quals cv_quals
= TYPE_UNQUALIFIED
;
16385 cp_cv_quals cv_qualifier
;
16387 /* Peek at the next token. */
16388 token
= cp_lexer_peek_token (parser
->lexer
);
16389 /* See if it's a cv-qualifier. */
16390 switch (token
->keyword
)
16393 cv_qualifier
= TYPE_QUAL_CONST
;
16397 cv_qualifier
= TYPE_QUAL_VOLATILE
;
16401 cv_qualifier
= TYPE_QUAL_RESTRICT
;
16405 cv_qualifier
= TYPE_UNQUALIFIED
;
16412 if (cv_quals
& cv_qualifier
)
16414 error_at (token
->location
, "duplicate cv-qualifier");
16415 cp_lexer_purge_token (parser
->lexer
);
16419 cp_lexer_consume_token (parser
->lexer
);
16420 cv_quals
|= cv_qualifier
;
16427 /* Parse an (optional) virt-specifier-seq.
16429 virt-specifier-seq:
16430 virt-specifier virt-specifier-seq [opt]
16436 Returns a bitmask representing the virt-specifiers. */
16438 static cp_virt_specifiers
16439 cp_parser_virt_specifier_seq_opt (cp_parser
* parser
)
16441 cp_virt_specifiers virt_specifiers
= VIRT_SPEC_UNSPECIFIED
;
16446 cp_virt_specifiers virt_specifier
;
16448 /* Peek at the next token. */
16449 token
= cp_lexer_peek_token (parser
->lexer
);
16450 /* See if it's a virt-specifier-qualifier. */
16451 if (token
->type
!= CPP_NAME
)
16453 if (!strcmp (IDENTIFIER_POINTER(token
->u
.value
), "override"))
16455 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS
);
16456 virt_specifier
= VIRT_SPEC_OVERRIDE
;
16458 else if (!strcmp (IDENTIFIER_POINTER(token
->u
.value
), "final"))
16460 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS
);
16461 virt_specifier
= VIRT_SPEC_FINAL
;
16463 else if (!strcmp (IDENTIFIER_POINTER(token
->u
.value
), "__final"))
16465 virt_specifier
= VIRT_SPEC_FINAL
;
16470 if (virt_specifiers
& virt_specifier
)
16472 error_at (token
->location
, "duplicate virt-specifier");
16473 cp_lexer_purge_token (parser
->lexer
);
16477 cp_lexer_consume_token (parser
->lexer
);
16478 virt_specifiers
|= virt_specifier
;
16481 return virt_specifiers
;
16484 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16485 is in scope even though it isn't real. */
16488 inject_this_parameter (tree ctype
, cp_cv_quals quals
)
16492 if (current_class_ptr
)
16494 /* We don't clear this between NSDMIs. Is it already what we want? */
16495 tree type
= TREE_TYPE (TREE_TYPE (current_class_ptr
));
16496 if (same_type_ignoring_top_level_qualifiers_p (ctype
, type
)
16497 && cp_type_quals (type
) == quals
)
16501 this_parm
= build_this_parm (ctype
, quals
);
16502 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16503 current_class_ptr
= NULL_TREE
;
16505 = cp_build_indirect_ref (this_parm
, RO_NULL
, tf_warning_or_error
);
16506 current_class_ptr
= this_parm
;
16509 /* Parse a late-specified return type, if any. This is not a separate
16510 non-terminal, but part of a function declarator, which looks like
16512 -> trailing-type-specifier-seq abstract-declarator(opt)
16514 Returns the type indicated by the type-id.
16516 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16520 cp_parser_late_return_type_opt (cp_parser
* parser
, cp_cv_quals quals
)
16525 /* Peek at the next token. */
16526 token
= cp_lexer_peek_token (parser
->lexer
);
16527 /* A late-specified return type is indicated by an initial '->'. */
16528 if (token
->type
!= CPP_DEREF
)
16531 /* Consume the ->. */
16532 cp_lexer_consume_token (parser
->lexer
);
16536 /* DR 1207: 'this' is in scope in the trailing return type. */
16537 gcc_assert (current_class_ptr
== NULL_TREE
);
16538 inject_this_parameter (current_class_type
, quals
);
16541 type
= cp_parser_trailing_type_id (parser
);
16544 current_class_ptr
= current_class_ref
= NULL_TREE
;
16549 /* Parse a declarator-id.
16553 :: [opt] nested-name-specifier [opt] type-name
16555 In the `id-expression' case, the value returned is as for
16556 cp_parser_id_expression if the id-expression was an unqualified-id.
16557 If the id-expression was a qualified-id, then a SCOPE_REF is
16558 returned. The first operand is the scope (either a NAMESPACE_DECL
16559 or TREE_TYPE), but the second is still just a representation of an
16563 cp_parser_declarator_id (cp_parser
* parser
, bool optional_p
)
16566 /* The expression must be an id-expression. Assume that qualified
16567 names are the names of types so that:
16570 int S<T>::R::i = 3;
16572 will work; we must treat `S<T>::R' as the name of a type.
16573 Similarly, assume that qualified names are templates, where
16577 int S<T>::R<T>::i = 3;
16580 id
= cp_parser_id_expression (parser
,
16581 /*template_keyword_p=*/false,
16582 /*check_dependency_p=*/false,
16583 /*template_p=*/NULL
,
16584 /*declarator_p=*/true,
16586 if (id
&& BASELINK_P (id
))
16587 id
= BASELINK_FUNCTIONS (id
);
16591 /* Parse a type-id.
16594 type-specifier-seq abstract-declarator [opt]
16596 Returns the TYPE specified. */
16599 cp_parser_type_id_1 (cp_parser
* parser
, bool is_template_arg
,
16600 bool is_trailing_return
)
16602 cp_decl_specifier_seq type_specifier_seq
;
16603 cp_declarator
*abstract_declarator
;
16605 /* Parse the type-specifier-seq. */
16606 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
16607 is_trailing_return
,
16608 &type_specifier_seq
);
16609 if (type_specifier_seq
.type
== error_mark_node
)
16610 return error_mark_node
;
16612 /* There might or might not be an abstract declarator. */
16613 cp_parser_parse_tentatively (parser
);
16614 /* Look for the declarator. */
16615 abstract_declarator
16616 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_ABSTRACT
, NULL
,
16617 /*parenthesized_p=*/NULL
,
16618 /*member_p=*/false);
16619 /* Check to see if there really was a declarator. */
16620 if (!cp_parser_parse_definitely (parser
))
16621 abstract_declarator
= NULL
;
16623 if (type_specifier_seq
.type
16624 && type_uses_auto (type_specifier_seq
.type
))
16626 /* A type-id with type 'auto' is only ok if the abstract declarator
16627 is a function declarator with a late-specified return type. */
16628 if (abstract_declarator
16629 && abstract_declarator
->kind
== cdk_function
16630 && abstract_declarator
->u
.function
.late_return_type
)
16634 error ("invalid use of %<auto%>");
16635 return error_mark_node
;
16639 return groktypename (&type_specifier_seq
, abstract_declarator
,
16643 static tree
cp_parser_type_id (cp_parser
*parser
)
16645 return cp_parser_type_id_1 (parser
, false, false);
16648 static tree
cp_parser_template_type_arg (cp_parser
*parser
)
16651 const char *saved_message
= parser
->type_definition_forbidden_message
;
16652 parser
->type_definition_forbidden_message
16653 = G_("types may not be defined in template arguments");
16654 r
= cp_parser_type_id_1 (parser
, true, false);
16655 parser
->type_definition_forbidden_message
= saved_message
;
16659 static tree
cp_parser_trailing_type_id (cp_parser
*parser
)
16661 return cp_parser_type_id_1 (parser
, false, true);
16664 /* Parse a type-specifier-seq.
16666 type-specifier-seq:
16667 type-specifier type-specifier-seq [opt]
16671 type-specifier-seq:
16672 attributes type-specifier-seq [opt]
16674 If IS_DECLARATION is true, we are at the start of a "condition" or
16675 exception-declaration, so we might be followed by a declarator-id.
16677 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16678 i.e. we've just seen "->".
16680 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16683 cp_parser_type_specifier_seq (cp_parser
* parser
,
16684 bool is_declaration
,
16685 bool is_trailing_return
,
16686 cp_decl_specifier_seq
*type_specifier_seq
)
16688 bool seen_type_specifier
= false;
16689 cp_parser_flags flags
= CP_PARSER_FLAGS_OPTIONAL
;
16690 cp_token
*start_token
= NULL
;
16692 /* Clear the TYPE_SPECIFIER_SEQ. */
16693 clear_decl_specs (type_specifier_seq
);
16695 /* In the context of a trailing return type, enum E { } is an
16696 elaborated-type-specifier followed by a function-body, not an
16698 if (is_trailing_return
)
16699 flags
|= CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
;
16701 /* Parse the type-specifiers and attributes. */
16704 tree type_specifier
;
16705 bool is_cv_qualifier
;
16707 /* Check for attributes first. */
16708 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
16710 type_specifier_seq
->attributes
=
16711 chainon (type_specifier_seq
->attributes
,
16712 cp_parser_attributes_opt (parser
));
16716 /* record the token of the beginning of the type specifier seq,
16717 for error reporting purposes*/
16719 start_token
= cp_lexer_peek_token (parser
->lexer
);
16721 /* Look for the type-specifier. */
16722 type_specifier
= cp_parser_type_specifier (parser
,
16724 type_specifier_seq
,
16725 /*is_declaration=*/false,
16728 if (!type_specifier
)
16730 /* If the first type-specifier could not be found, this is not a
16731 type-specifier-seq at all. */
16732 if (!seen_type_specifier
)
16734 cp_parser_error (parser
, "expected type-specifier");
16735 type_specifier_seq
->type
= error_mark_node
;
16738 /* If subsequent type-specifiers could not be found, the
16739 type-specifier-seq is complete. */
16743 seen_type_specifier
= true;
16744 /* The standard says that a condition can be:
16746 type-specifier-seq declarator = assignment-expression
16753 we should treat the "S" as a declarator, not as a
16754 type-specifier. The standard doesn't say that explicitly for
16755 type-specifier-seq, but it does say that for
16756 decl-specifier-seq in an ordinary declaration. Perhaps it
16757 would be clearer just to allow a decl-specifier-seq here, and
16758 then add a semantic restriction that if any decl-specifiers
16759 that are not type-specifiers appear, the program is invalid. */
16760 if (is_declaration
&& !is_cv_qualifier
)
16761 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
16764 cp_parser_check_decl_spec (type_specifier_seq
, start_token
->location
);
16767 /* Parse a parameter-declaration-clause.
16769 parameter-declaration-clause:
16770 parameter-declaration-list [opt] ... [opt]
16771 parameter-declaration-list , ...
16773 Returns a representation for the parameter declarations. A return
16774 value of NULL indicates a parameter-declaration-clause consisting
16775 only of an ellipsis. */
16778 cp_parser_parameter_declaration_clause (cp_parser
* parser
)
16785 /* Peek at the next token. */
16786 token
= cp_lexer_peek_token (parser
->lexer
);
16787 /* Check for trivial parameter-declaration-clauses. */
16788 if (token
->type
== CPP_ELLIPSIS
)
16790 /* Consume the `...' token. */
16791 cp_lexer_consume_token (parser
->lexer
);
16794 else if (token
->type
== CPP_CLOSE_PAREN
)
16795 /* There are no parameters. */
16797 #ifndef NO_IMPLICIT_EXTERN_C
16798 if (in_system_header
&& current_class_type
== NULL
16799 && current_lang_name
== lang_name_c
)
16803 return void_list_node
;
16805 /* Check for `(void)', too, which is a special case. */
16806 else if (token
->keyword
== RID_VOID
16807 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
16808 == CPP_CLOSE_PAREN
))
16810 /* Consume the `void' token. */
16811 cp_lexer_consume_token (parser
->lexer
);
16812 /* There are no parameters. */
16813 return void_list_node
;
16816 /* Parse the parameter-declaration-list. */
16817 parameters
= cp_parser_parameter_declaration_list (parser
, &is_error
);
16818 /* If a parse error occurred while parsing the
16819 parameter-declaration-list, then the entire
16820 parameter-declaration-clause is erroneous. */
16824 /* Peek at the next token. */
16825 token
= cp_lexer_peek_token (parser
->lexer
);
16826 /* If it's a `,', the clause should terminate with an ellipsis. */
16827 if (token
->type
== CPP_COMMA
)
16829 /* Consume the `,'. */
16830 cp_lexer_consume_token (parser
->lexer
);
16831 /* Expect an ellipsis. */
16833 = (cp_parser_require (parser
, CPP_ELLIPSIS
, RT_ELLIPSIS
) != NULL
);
16835 /* It might also be `...' if the optional trailing `,' was
16837 else if (token
->type
== CPP_ELLIPSIS
)
16839 /* Consume the `...' token. */
16840 cp_lexer_consume_token (parser
->lexer
);
16841 /* And remember that we saw it. */
16845 ellipsis_p
= false;
16847 /* Finish the parameter list. */
16849 parameters
= chainon (parameters
, void_list_node
);
16854 /* Parse a parameter-declaration-list.
16856 parameter-declaration-list:
16857 parameter-declaration
16858 parameter-declaration-list , parameter-declaration
16860 Returns a representation of the parameter-declaration-list, as for
16861 cp_parser_parameter_declaration_clause. However, the
16862 `void_list_node' is never appended to the list. Upon return,
16863 *IS_ERROR will be true iff an error occurred. */
16866 cp_parser_parameter_declaration_list (cp_parser
* parser
, bool *is_error
)
16868 tree parameters
= NULL_TREE
;
16869 tree
*tail
= ¶meters
;
16870 bool saved_in_unbraced_linkage_specification_p
;
16873 /* Assume all will go well. */
16875 /* The special considerations that apply to a function within an
16876 unbraced linkage specifications do not apply to the parameters
16877 to the function. */
16878 saved_in_unbraced_linkage_specification_p
16879 = parser
->in_unbraced_linkage_specification_p
;
16880 parser
->in_unbraced_linkage_specification_p
= false;
16882 /* Look for more parameters. */
16885 cp_parameter_declarator
*parameter
;
16886 tree decl
= error_mark_node
;
16887 bool parenthesized_p
= false;
16888 /* Parse the parameter. */
16890 = cp_parser_parameter_declaration (parser
,
16891 /*template_parm_p=*/false,
16894 /* We don't know yet if the enclosing context is deprecated, so wait
16895 and warn in grokparms if appropriate. */
16896 deprecated_state
= DEPRECATED_SUPPRESS
;
16899 decl
= grokdeclarator (parameter
->declarator
,
16900 ¶meter
->decl_specifiers
,
16902 parameter
->default_argument
!= NULL_TREE
,
16903 ¶meter
->decl_specifiers
.attributes
);
16905 deprecated_state
= DEPRECATED_NORMAL
;
16907 /* If a parse error occurred parsing the parameter declaration,
16908 then the entire parameter-declaration-list is erroneous. */
16909 if (decl
== error_mark_node
)
16912 parameters
= error_mark_node
;
16916 if (parameter
->decl_specifiers
.attributes
)
16917 cplus_decl_attributes (&decl
,
16918 parameter
->decl_specifiers
.attributes
,
16920 if (DECL_NAME (decl
))
16921 decl
= pushdecl (decl
);
16923 if (decl
!= error_mark_node
)
16925 retrofit_lang_decl (decl
);
16926 DECL_PARM_INDEX (decl
) = ++index
;
16927 DECL_PARM_LEVEL (decl
) = function_parm_depth ();
16930 /* Add the new parameter to the list. */
16931 *tail
= build_tree_list (parameter
->default_argument
, decl
);
16932 tail
= &TREE_CHAIN (*tail
);
16934 /* Peek at the next token. */
16935 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
16936 || cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
16937 /* These are for Objective-C++ */
16938 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
16939 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
16940 /* The parameter-declaration-list is complete. */
16942 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
16946 /* Peek at the next token. */
16947 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
16948 /* If it's an ellipsis, then the list is complete. */
16949 if (token
->type
== CPP_ELLIPSIS
)
16951 /* Otherwise, there must be more parameters. Consume the
16953 cp_lexer_consume_token (parser
->lexer
);
16954 /* When parsing something like:
16956 int i(float f, double d)
16958 we can tell after seeing the declaration for "f" that we
16959 are not looking at an initialization of a variable "i",
16960 but rather at the declaration of a function "i".
16962 Due to the fact that the parsing of template arguments
16963 (as specified to a template-id) requires backtracking we
16964 cannot use this technique when inside a template argument
16966 if (!parser
->in_template_argument_list_p
16967 && !parser
->in_type_id_in_expr_p
16968 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
16969 /* However, a parameter-declaration of the form
16970 "foat(f)" (which is a valid declaration of a
16971 parameter "f") can also be interpreted as an
16972 expression (the conversion of "f" to "float"). */
16973 && !parenthesized_p
)
16974 cp_parser_commit_to_tentative_parse (parser
);
16978 cp_parser_error (parser
, "expected %<,%> or %<...%>");
16979 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
16980 cp_parser_skip_to_closing_parenthesis (parser
,
16981 /*recovering=*/true,
16982 /*or_comma=*/false,
16983 /*consume_paren=*/false);
16988 parser
->in_unbraced_linkage_specification_p
16989 = saved_in_unbraced_linkage_specification_p
;
16994 /* Parse a parameter declaration.
16996 parameter-declaration:
16997 decl-specifier-seq ... [opt] declarator
16998 decl-specifier-seq declarator = assignment-expression
16999 decl-specifier-seq ... [opt] abstract-declarator [opt]
17000 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17002 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17003 declares a template parameter. (In that case, a non-nested `>'
17004 token encountered during the parsing of the assignment-expression
17005 is not interpreted as a greater-than operator.)
17007 Returns a representation of the parameter, or NULL if an error
17008 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17009 true iff the declarator is of the form "(p)". */
17011 static cp_parameter_declarator
*
17012 cp_parser_parameter_declaration (cp_parser
*parser
,
17013 bool template_parm_p
,
17014 bool *parenthesized_p
)
17016 int declares_class_or_enum
;
17017 cp_decl_specifier_seq decl_specifiers
;
17018 cp_declarator
*declarator
;
17019 tree default_argument
;
17020 cp_token
*token
= NULL
, *declarator_token_start
= NULL
;
17021 const char *saved_message
;
17023 /* In a template parameter, `>' is not an operator.
17027 When parsing a default template-argument for a non-type
17028 template-parameter, the first non-nested `>' is taken as the end
17029 of the template parameter-list rather than a greater-than
17032 /* Type definitions may not appear in parameter types. */
17033 saved_message
= parser
->type_definition_forbidden_message
;
17034 parser
->type_definition_forbidden_message
17035 = G_("types may not be defined in parameter types");
17037 /* Parse the declaration-specifiers. */
17038 cp_parser_decl_specifier_seq (parser
,
17039 CP_PARSER_FLAGS_NONE
,
17041 &declares_class_or_enum
);
17043 /* Complain about missing 'typename' or other invalid type names. */
17044 if (!decl_specifiers
.any_type_specifiers_p
)
17045 cp_parser_parse_and_diagnose_invalid_type_name (parser
);
17047 /* If an error occurred, there's no reason to attempt to parse the
17048 rest of the declaration. */
17049 if (cp_parser_error_occurred (parser
))
17051 parser
->type_definition_forbidden_message
= saved_message
;
17055 /* Peek at the next token. */
17056 token
= cp_lexer_peek_token (parser
->lexer
);
17058 /* If the next token is a `)', `,', `=', `>', or `...', then there
17059 is no declarator. However, when variadic templates are enabled,
17060 there may be a declarator following `...'. */
17061 if (token
->type
== CPP_CLOSE_PAREN
17062 || token
->type
== CPP_COMMA
17063 || token
->type
== CPP_EQ
17064 || token
->type
== CPP_GREATER
)
17067 if (parenthesized_p
)
17068 *parenthesized_p
= false;
17070 /* Otherwise, there should be a declarator. */
17073 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
17074 parser
->default_arg_ok_p
= false;
17076 /* After seeing a decl-specifier-seq, if the next token is not a
17077 "(", there is no possibility that the code is a valid
17078 expression. Therefore, if parsing tentatively, we commit at
17080 if (!parser
->in_template_argument_list_p
17081 /* In an expression context, having seen:
17085 we cannot be sure whether we are looking at a
17086 function-type (taking a "char" as a parameter) or a cast
17087 of some object of type "char" to "int". */
17088 && !parser
->in_type_id_in_expr_p
17089 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
17090 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
17091 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
17092 cp_parser_commit_to_tentative_parse (parser
);
17093 /* Parse the declarator. */
17094 declarator_token_start
= token
;
17095 declarator
= cp_parser_declarator (parser
,
17096 CP_PARSER_DECLARATOR_EITHER
,
17097 /*ctor_dtor_or_conv_p=*/NULL
,
17099 /*member_p=*/false);
17100 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
17101 /* After the declarator, allow more attributes. */
17102 decl_specifiers
.attributes
17103 = chainon (decl_specifiers
.attributes
,
17104 cp_parser_attributes_opt (parser
));
17107 /* If the next token is an ellipsis, and we have not seen a
17108 declarator name, and the type of the declarator contains parameter
17109 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17110 a parameter pack expansion expression. Otherwise, leave the
17111 ellipsis for a C-style variadic function. */
17112 token
= cp_lexer_peek_token (parser
->lexer
);
17113 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
17115 tree type
= decl_specifiers
.type
;
17117 if (type
&& DECL_P (type
))
17118 type
= TREE_TYPE (type
);
17121 && TREE_CODE (type
) != TYPE_PACK_EXPANSION
17122 && declarator_can_be_parameter_pack (declarator
)
17123 && (!declarator
|| !declarator
->parameter_pack_p
)
17124 && uses_parameter_packs (type
))
17126 /* Consume the `...'. */
17127 cp_lexer_consume_token (parser
->lexer
);
17128 maybe_warn_variadic_templates ();
17130 /* Build a pack expansion type */
17132 declarator
->parameter_pack_p
= true;
17134 decl_specifiers
.type
= make_pack_expansion (type
);
17138 /* The restriction on defining new types applies only to the type
17139 of the parameter, not to the default argument. */
17140 parser
->type_definition_forbidden_message
= saved_message
;
17142 /* If the next token is `=', then process a default argument. */
17143 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
17145 /* If we are defining a class, then the tokens that make up the
17146 default argument must be saved and processed later. */
17147 if (!template_parm_p
&& at_class_scope_p ()
17148 && TYPE_BEING_DEFINED (current_class_type
)
17149 && !LAMBDA_TYPE_P (current_class_type
))
17151 unsigned depth
= 0;
17152 int maybe_template_id
= 0;
17153 cp_token
*first_token
;
17156 /* Add tokens until we have processed the entire default
17157 argument. We add the range [first_token, token). */
17158 first_token
= cp_lexer_peek_token (parser
->lexer
);
17163 /* Peek at the next token. */
17164 token
= cp_lexer_peek_token (parser
->lexer
);
17165 /* What we do depends on what token we have. */
17166 switch (token
->type
)
17168 /* In valid code, a default argument must be
17169 immediately followed by a `,' `)', or `...'. */
17171 if (depth
== 0 && maybe_template_id
)
17173 /* If we've seen a '<', we might be in a
17174 template-argument-list. Until Core issue 325 is
17175 resolved, we don't know how this situation ought
17176 to be handled, so try to DTRT. We check whether
17177 what comes after the comma is a valid parameter
17178 declaration list. If it is, then the comma ends
17179 the default argument; otherwise the default
17180 argument continues. */
17181 bool error
= false;
17184 /* Set ITALP so cp_parser_parameter_declaration_list
17185 doesn't decide to commit to this parse. */
17186 bool saved_italp
= parser
->in_template_argument_list_p
;
17187 parser
->in_template_argument_list_p
= true;
17189 cp_parser_parse_tentatively (parser
);
17190 cp_lexer_consume_token (parser
->lexer
);
17191 begin_scope (sk_function_parms
, NULL_TREE
);
17192 cp_parser_parameter_declaration_list (parser
, &error
);
17193 for (t
= current_binding_level
->names
; t
; t
= DECL_CHAIN (t
))
17194 pop_binding (DECL_NAME (t
), t
);
17196 if (!cp_parser_error_occurred (parser
) && !error
)
17198 cp_parser_abort_tentative_parse (parser
);
17200 parser
->in_template_argument_list_p
= saved_italp
;
17203 case CPP_CLOSE_PAREN
:
17205 /* If we run into a non-nested `;', `}', or `]',
17206 then the code is invalid -- but the default
17207 argument is certainly over. */
17208 case CPP_SEMICOLON
:
17209 case CPP_CLOSE_BRACE
:
17210 case CPP_CLOSE_SQUARE
:
17213 /* Update DEPTH, if necessary. */
17214 else if (token
->type
== CPP_CLOSE_PAREN
17215 || token
->type
== CPP_CLOSE_BRACE
17216 || token
->type
== CPP_CLOSE_SQUARE
)
17220 case CPP_OPEN_PAREN
:
17221 case CPP_OPEN_SQUARE
:
17222 case CPP_OPEN_BRACE
:
17228 /* This might be the comparison operator, or it might
17229 start a template argument list. */
17230 ++maybe_template_id
;
17234 if (cxx_dialect
== cxx98
)
17236 /* Fall through for C++0x, which treats the `>>'
17237 operator like two `>' tokens in certain
17243 /* This might be an operator, or it might close a
17244 template argument list. But if a previous '<'
17245 started a template argument list, this will have
17246 closed it, so we can't be in one anymore. */
17247 maybe_template_id
-= 1 + (token
->type
== CPP_RSHIFT
);
17248 if (maybe_template_id
< 0)
17249 maybe_template_id
= 0;
17253 /* If we run out of tokens, issue an error message. */
17255 case CPP_PRAGMA_EOL
:
17256 error_at (token
->location
, "file ends in default argument");
17262 /* In these cases, we should look for template-ids.
17263 For example, if the default argument is
17264 `X<int, double>()', we need to do name lookup to
17265 figure out whether or not `X' is a template; if
17266 so, the `,' does not end the default argument.
17268 That is not yet done. */
17275 /* If we've reached the end, stop. */
17279 /* Add the token to the token block. */
17280 token
= cp_lexer_consume_token (parser
->lexer
);
17283 /* Create a DEFAULT_ARG to represent the unparsed default
17285 default_argument
= make_node (DEFAULT_ARG
);
17286 DEFARG_TOKENS (default_argument
)
17287 = cp_token_cache_new (first_token
, token
);
17288 DEFARG_INSTANTIATIONS (default_argument
) = NULL
;
17290 /* Outside of a class definition, we can just parse the
17291 assignment-expression. */
17294 token
= cp_lexer_peek_token (parser
->lexer
);
17296 = cp_parser_default_argument (parser
, template_parm_p
);
17299 if (!parser
->default_arg_ok_p
)
17301 if (flag_permissive
)
17302 warning (0, "deprecated use of default argument for parameter of non-function");
17305 error_at (token
->location
,
17306 "default arguments are only "
17307 "permitted for function parameters");
17308 default_argument
= NULL_TREE
;
17311 else if ((declarator
&& declarator
->parameter_pack_p
)
17312 || (decl_specifiers
.type
17313 && PACK_EXPANSION_P (decl_specifiers
.type
)))
17315 /* Find the name of the parameter pack. */
17316 cp_declarator
*id_declarator
= declarator
;
17317 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
17318 id_declarator
= id_declarator
->declarator
;
17320 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
17321 error_at (declarator_token_start
->location
,
17323 ? G_("template parameter pack %qD "
17324 "cannot have a default argument")
17325 : G_("parameter pack %qD cannot have "
17326 "a default argument"),
17327 id_declarator
->u
.id
.unqualified_name
);
17329 error_at (declarator_token_start
->location
,
17331 ? G_("template parameter pack cannot have "
17332 "a default argument")
17333 : G_("parameter pack cannot have a "
17334 "default argument"));
17336 default_argument
= NULL_TREE
;
17340 default_argument
= NULL_TREE
;
17342 return make_parameter_declarator (&decl_specifiers
,
17347 /* Parse a default argument and return it.
17349 TEMPLATE_PARM_P is true if this is a default argument for a
17350 non-type template parameter. */
17352 cp_parser_default_argument (cp_parser
*parser
, bool template_parm_p
)
17354 tree default_argument
= NULL_TREE
;
17355 bool saved_greater_than_is_operator_p
;
17356 bool saved_local_variables_forbidden_p
;
17357 bool non_constant_p
, is_direct_init
;
17359 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17361 saved_greater_than_is_operator_p
= parser
->greater_than_is_operator_p
;
17362 parser
->greater_than_is_operator_p
= !template_parm_p
;
17363 /* Local variable names (and the `this' keyword) may not
17364 appear in a default argument. */
17365 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
17366 parser
->local_variables_forbidden_p
= true;
17367 /* Parse the assignment-expression. */
17368 if (template_parm_p
)
17369 push_deferring_access_checks (dk_no_deferred
);
17371 = cp_parser_initializer (parser
, &is_direct_init
, &non_constant_p
);
17372 if (BRACE_ENCLOSED_INITIALIZER_P (default_argument
))
17373 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
17374 if (template_parm_p
)
17375 pop_deferring_access_checks ();
17376 parser
->greater_than_is_operator_p
= saved_greater_than_is_operator_p
;
17377 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
17379 return default_argument
;
17382 /* Parse a function-body.
17385 compound_statement */
17388 cp_parser_function_body (cp_parser
*parser
)
17390 cp_parser_compound_statement (parser
, NULL
, false, true);
17393 /* Parse a ctor-initializer-opt followed by a function-body. Return
17394 true if a ctor-initializer was present. */
17397 cp_parser_ctor_initializer_opt_and_function_body (cp_parser
*parser
)
17400 bool ctor_initializer_p
;
17401 const bool check_body_p
=
17402 DECL_CONSTRUCTOR_P (current_function_decl
)
17403 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
);
17406 /* Begin the function body. */
17407 body
= begin_function_body ();
17408 /* Parse the optional ctor-initializer. */
17409 ctor_initializer_p
= cp_parser_ctor_initializer_opt (parser
);
17411 /* If we're parsing a constexpr constructor definition, we need
17412 to check that the constructor body is indeed empty. However,
17413 before we get to cp_parser_function_body lot of junk has been
17414 generated, so we can't just check that we have an empty block.
17415 Rather we take a snapshot of the outermost block, and check whether
17416 cp_parser_function_body changed its state. */
17420 if (TREE_CODE (list
) == BIND_EXPR
)
17421 list
= BIND_EXPR_BODY (list
);
17422 if (TREE_CODE (list
) == STATEMENT_LIST
17423 && STATEMENT_LIST_TAIL (list
) != NULL
)
17424 last
= STATEMENT_LIST_TAIL (list
)->stmt
;
17426 /* Parse the function-body. */
17427 cp_parser_function_body (parser
);
17429 check_constexpr_ctor_body (last
, list
);
17430 /* Finish the function body. */
17431 finish_function_body (body
);
17433 return ctor_initializer_p
;
17436 /* Parse an initializer.
17439 = initializer-clause
17440 ( expression-list )
17442 Returns an expression representing the initializer. If no
17443 initializer is present, NULL_TREE is returned.
17445 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17446 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17447 set to TRUE if there is no initializer present. If there is an
17448 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17449 is set to true; otherwise it is set to false. */
17452 cp_parser_initializer (cp_parser
* parser
, bool* is_direct_init
,
17453 bool* non_constant_p
)
17458 /* Peek at the next token. */
17459 token
= cp_lexer_peek_token (parser
->lexer
);
17461 /* Let our caller know whether or not this initializer was
17463 *is_direct_init
= (token
->type
!= CPP_EQ
);
17464 /* Assume that the initializer is constant. */
17465 *non_constant_p
= false;
17467 if (token
->type
== CPP_EQ
)
17469 /* Consume the `='. */
17470 cp_lexer_consume_token (parser
->lexer
);
17471 /* Parse the initializer-clause. */
17472 init
= cp_parser_initializer_clause (parser
, non_constant_p
);
17474 else if (token
->type
== CPP_OPEN_PAREN
)
17477 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
17479 /*allow_expansion_p=*/true,
17482 return error_mark_node
;
17483 init
= build_tree_list_vec (vec
);
17484 release_tree_vector (vec
);
17486 else if (token
->type
== CPP_OPEN_BRACE
)
17488 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
17489 init
= cp_parser_braced_list (parser
, non_constant_p
);
17490 CONSTRUCTOR_IS_DIRECT_INIT (init
) = 1;
17494 /* Anything else is an error. */
17495 cp_parser_error (parser
, "expected initializer");
17496 init
= error_mark_node
;
17502 /* Parse an initializer-clause.
17504 initializer-clause:
17505 assignment-expression
17508 Returns an expression representing the initializer.
17510 If the `assignment-expression' production is used the value
17511 returned is simply a representation for the expression.
17513 Otherwise, calls cp_parser_braced_list. */
17516 cp_parser_initializer_clause (cp_parser
* parser
, bool* non_constant_p
)
17520 /* Assume the expression is constant. */
17521 *non_constant_p
= false;
17523 /* If it is not a `{', then we are looking at an
17524 assignment-expression. */
17525 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
17528 = cp_parser_constant_expression (parser
,
17529 /*allow_non_constant_p=*/true,
17533 initializer
= cp_parser_braced_list (parser
, non_constant_p
);
17535 return initializer
;
17538 /* Parse a brace-enclosed initializer list.
17541 { initializer-list , [opt] }
17544 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17545 the elements of the initializer-list (or NULL, if the last
17546 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17547 NULL_TREE. There is no way to detect whether or not the optional
17548 trailing `,' was provided. NON_CONSTANT_P is as for
17549 cp_parser_initializer. */
17552 cp_parser_braced_list (cp_parser
* parser
, bool* non_constant_p
)
17556 /* Consume the `{' token. */
17557 cp_lexer_consume_token (parser
->lexer
);
17558 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17559 initializer
= make_node (CONSTRUCTOR
);
17560 /* If it's not a `}', then there is a non-trivial initializer. */
17561 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
17563 /* Parse the initializer list. */
17564 CONSTRUCTOR_ELTS (initializer
)
17565 = cp_parser_initializer_list (parser
, non_constant_p
);
17566 /* A trailing `,' token is allowed. */
17567 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
17568 cp_lexer_consume_token (parser
->lexer
);
17570 /* Now, there should be a trailing `}'. */
17571 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
17572 TREE_TYPE (initializer
) = init_list_type_node
;
17573 return initializer
;
17576 /* Parse an initializer-list.
17579 initializer-clause ... [opt]
17580 initializer-list , initializer-clause ... [opt]
17585 designation initializer-clause ...[opt]
17586 initializer-list , designation initializer-clause ...[opt]
17591 [ constant-expression ] =
17593 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17594 for the initializer. If the INDEX of the elt is non-NULL, it is the
17595 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17596 as for cp_parser_initializer. */
17598 static VEC(constructor_elt
,gc
) *
17599 cp_parser_initializer_list (cp_parser
* parser
, bool* non_constant_p
)
17601 VEC(constructor_elt
,gc
) *v
= NULL
;
17603 /* Assume all of the expressions are constant. */
17604 *non_constant_p
= false;
17606 /* Parse the rest of the list. */
17612 bool clause_non_constant_p
;
17614 /* If the next token is an identifier and the following one is a
17615 colon, we are looking at the GNU designated-initializer
17617 if (cp_parser_allow_gnu_extensions_p (parser
)
17618 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
17619 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
17621 /* Warn the user that they are using an extension. */
17622 pedwarn (input_location
, OPT_pedantic
,
17623 "ISO C++ does not allow designated initializers");
17624 /* Consume the identifier. */
17625 designator
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
17626 /* Consume the `:'. */
17627 cp_lexer_consume_token (parser
->lexer
);
17629 /* Also handle the C99 syntax, '. id ='. */
17630 else if (cp_parser_allow_gnu_extensions_p (parser
)
17631 && cp_lexer_next_token_is (parser
->lexer
, CPP_DOT
)
17632 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_NAME
17633 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_EQ
)
17635 /* Warn the user that they are using an extension. */
17636 pedwarn (input_location
, OPT_pedantic
,
17637 "ISO C++ does not allow C99 designated initializers");
17638 /* Consume the `.'. */
17639 cp_lexer_consume_token (parser
->lexer
);
17640 /* Consume the identifier. */
17641 designator
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
17642 /* Consume the `='. */
17643 cp_lexer_consume_token (parser
->lexer
);
17645 /* Also handle C99 array designators, '[ const ] ='. */
17646 else if (cp_parser_allow_gnu_extensions_p (parser
)
17647 && !c_dialect_objc ()
17648 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
17650 /* In C++11, [ could start a lambda-introducer. */
17651 cp_parser_parse_tentatively (parser
);
17652 cp_lexer_consume_token (parser
->lexer
);
17653 designator
= cp_parser_constant_expression (parser
, false, NULL
);
17654 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
17655 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
17656 cp_parser_parse_definitely (parser
);
17659 designator
= NULL_TREE
;
17661 /* Parse the initializer. */
17662 initializer
= cp_parser_initializer_clause (parser
,
17663 &clause_non_constant_p
);
17664 /* If any clause is non-constant, so is the entire initializer. */
17665 if (clause_non_constant_p
)
17666 *non_constant_p
= true;
17668 /* If we have an ellipsis, this is an initializer pack
17670 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
17672 /* Consume the `...'. */
17673 cp_lexer_consume_token (parser
->lexer
);
17675 /* Turn the initializer into an initializer expansion. */
17676 initializer
= make_pack_expansion (initializer
);
17679 /* Add it to the vector. */
17680 CONSTRUCTOR_APPEND_ELT (v
, designator
, initializer
);
17682 /* If the next token is not a comma, we have reached the end of
17684 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
17687 /* Peek at the next token. */
17688 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
17689 /* If the next token is a `}', then we're still done. An
17690 initializer-clause can have a trailing `,' after the
17691 initializer-list and before the closing `}'. */
17692 if (token
->type
== CPP_CLOSE_BRACE
)
17695 /* Consume the `,' token. */
17696 cp_lexer_consume_token (parser
->lexer
);
17702 /* Classes [gram.class] */
17704 /* Parse a class-name.
17710 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17711 to indicate that names looked up in dependent types should be
17712 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17713 keyword has been used to indicate that the name that appears next
17714 is a template. TAG_TYPE indicates the explicit tag given before
17715 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17716 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17717 is the class being defined in a class-head.
17719 Returns the TYPE_DECL representing the class. */
17722 cp_parser_class_name (cp_parser
*parser
,
17723 bool typename_keyword_p
,
17724 bool template_keyword_p
,
17725 enum tag_types tag_type
,
17726 bool check_dependency_p
,
17728 bool is_declaration
)
17734 tree identifier
= NULL_TREE
;
17736 /* All class-names start with an identifier. */
17737 token
= cp_lexer_peek_token (parser
->lexer
);
17738 if (token
->type
!= CPP_NAME
&& token
->type
!= CPP_TEMPLATE_ID
)
17740 cp_parser_error (parser
, "expected class-name");
17741 return error_mark_node
;
17744 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17745 to a template-id, so we save it here. */
17746 scope
= parser
->scope
;
17747 if (scope
== error_mark_node
)
17748 return error_mark_node
;
17750 /* Any name names a type if we're following the `typename' keyword
17751 in a qualified name where the enclosing scope is type-dependent. */
17752 typename_p
= (typename_keyword_p
&& scope
&& TYPE_P (scope
)
17753 && dependent_type_p (scope
));
17754 /* Handle the common case (an identifier, but not a template-id)
17756 if (token
->type
== CPP_NAME
17757 && !cp_parser_nth_token_starts_template_argument_list_p (parser
, 2))
17759 cp_token
*identifier_token
;
17762 /* Look for the identifier. */
17763 identifier_token
= cp_lexer_peek_token (parser
->lexer
);
17764 ambiguous_p
= identifier_token
->ambiguous_p
;
17765 identifier
= cp_parser_identifier (parser
);
17766 /* If the next token isn't an identifier, we are certainly not
17767 looking at a class-name. */
17768 if (identifier
== error_mark_node
)
17769 decl
= error_mark_node
;
17770 /* If we know this is a type-name, there's no need to look it
17772 else if (typename_p
)
17776 tree ambiguous_decls
;
17777 /* If we already know that this lookup is ambiguous, then
17778 we've already issued an error message; there's no reason
17782 cp_parser_simulate_error (parser
);
17783 return error_mark_node
;
17785 /* If the next token is a `::', then the name must be a type
17788 [basic.lookup.qual]
17790 During the lookup for a name preceding the :: scope
17791 resolution operator, object, function, and enumerator
17792 names are ignored. */
17793 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
17794 tag_type
= typename_type
;
17795 /* Look up the name. */
17796 decl
= cp_parser_lookup_name (parser
, identifier
,
17798 /*is_template=*/false,
17799 /*is_namespace=*/false,
17800 check_dependency_p
,
17802 identifier_token
->location
);
17803 if (ambiguous_decls
)
17805 if (cp_parser_parsing_tentatively (parser
))
17806 cp_parser_simulate_error (parser
);
17807 return error_mark_node
;
17813 /* Try a template-id. */
17814 decl
= cp_parser_template_id (parser
, template_keyword_p
,
17815 check_dependency_p
,
17817 if (decl
== error_mark_node
)
17818 return error_mark_node
;
17821 decl
= cp_parser_maybe_treat_template_as_class (decl
, class_head_p
);
17823 /* If this is a typename, create a TYPENAME_TYPE. */
17824 if (typename_p
&& decl
!= error_mark_node
)
17826 decl
= make_typename_type (scope
, decl
, typename_type
,
17827 /*complain=*/tf_error
);
17828 if (decl
!= error_mark_node
)
17829 decl
= TYPE_NAME (decl
);
17832 /* Check to see that it is really the name of a class. */
17833 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
17834 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
17835 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
17836 /* Situations like this:
17838 template <typename T> struct A {
17839 typename T::template X<int>::I i;
17842 are problematic. Is `T::template X<int>' a class-name? The
17843 standard does not seem to be definitive, but there is no other
17844 valid interpretation of the following `::'. Therefore, those
17845 names are considered class-names. */
17847 decl
= make_typename_type (scope
, decl
, tag_type
, tf_error
);
17848 if (decl
!= error_mark_node
)
17849 decl
= TYPE_NAME (decl
);
17851 else if (TREE_CODE (decl
) != TYPE_DECL
17852 || TREE_TYPE (decl
) == error_mark_node
17853 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl
))
17854 /* In Objective-C 2.0, a classname followed by '.' starts a
17855 dot-syntax expression, and it's not a type-name. */
17856 || (c_dialect_objc ()
17857 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
17858 && objc_is_class_name (decl
)))
17859 decl
= error_mark_node
;
17861 if (decl
== error_mark_node
)
17862 cp_parser_error (parser
, "expected class-name");
17863 else if (identifier
&& !parser
->scope
)
17864 maybe_note_name_used_in_class (identifier
, decl
);
17869 /* Parse a class-specifier.
17872 class-head { member-specification [opt] }
17874 Returns the TREE_TYPE representing the class. */
17877 cp_parser_class_specifier_1 (cp_parser
* parser
)
17880 tree attributes
= NULL_TREE
;
17881 bool nested_name_specifier_p
;
17882 unsigned saved_num_template_parameter_lists
;
17883 bool saved_in_function_body
;
17884 unsigned char in_statement
;
17885 bool in_switch_statement_p
;
17886 bool saved_in_unbraced_linkage_specification_p
;
17887 tree old_scope
= NULL_TREE
;
17888 tree scope
= NULL_TREE
;
17890 cp_token
*closing_brace
;
17892 push_deferring_access_checks (dk_no_deferred
);
17894 /* Parse the class-head. */
17895 type
= cp_parser_class_head (parser
,
17896 &nested_name_specifier_p
,
17899 /* If the class-head was a semantic disaster, skip the entire body
17903 cp_parser_skip_to_end_of_block_or_statement (parser
);
17904 pop_deferring_access_checks ();
17905 return error_mark_node
;
17908 /* Look for the `{'. */
17909 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
17911 pop_deferring_access_checks ();
17912 return error_mark_node
;
17915 /* Process the base classes. If they're invalid, skip the
17916 entire class body. */
17917 if (!xref_basetypes (type
, bases
))
17919 /* Consuming the closing brace yields better error messages
17921 if (cp_parser_skip_to_closing_brace (parser
))
17922 cp_lexer_consume_token (parser
->lexer
);
17923 pop_deferring_access_checks ();
17924 return error_mark_node
;
17927 /* Issue an error message if type-definitions are forbidden here. */
17928 cp_parser_check_type_definition (parser
);
17929 /* Remember that we are defining one more class. */
17930 ++parser
->num_classes_being_defined
;
17931 /* Inside the class, surrounding template-parameter-lists do not
17933 saved_num_template_parameter_lists
17934 = parser
->num_template_parameter_lists
;
17935 parser
->num_template_parameter_lists
= 0;
17936 /* We are not in a function body. */
17937 saved_in_function_body
= parser
->in_function_body
;
17938 parser
->in_function_body
= false;
17939 /* Or in a loop. */
17940 in_statement
= parser
->in_statement
;
17941 parser
->in_statement
= 0;
17942 /* Or in a switch. */
17943 in_switch_statement_p
= parser
->in_switch_statement_p
;
17944 parser
->in_switch_statement_p
= false;
17945 /* We are not immediately inside an extern "lang" block. */
17946 saved_in_unbraced_linkage_specification_p
17947 = parser
->in_unbraced_linkage_specification_p
;
17948 parser
->in_unbraced_linkage_specification_p
= false;
17950 /* Start the class. */
17951 if (nested_name_specifier_p
)
17953 scope
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (type
));
17954 old_scope
= push_inner_scope (scope
);
17956 type
= begin_class_definition (type
, attributes
);
17958 if (type
== error_mark_node
)
17959 /* If the type is erroneous, skip the entire body of the class. */
17960 cp_parser_skip_to_closing_brace (parser
);
17962 /* Parse the member-specification. */
17963 cp_parser_member_specification_opt (parser
);
17965 /* Look for the trailing `}'. */
17966 closing_brace
= cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
17967 /* Look for trailing attributes to apply to this class. */
17968 if (cp_parser_allow_gnu_extensions_p (parser
))
17969 attributes
= cp_parser_attributes_opt (parser
);
17970 if (type
!= error_mark_node
)
17971 type
= finish_struct (type
, attributes
);
17972 if (nested_name_specifier_p
)
17973 pop_inner_scope (old_scope
, scope
);
17975 /* We've finished a type definition. Check for the common syntax
17976 error of forgetting a semicolon after the definition. We need to
17977 be careful, as we can't just check for not-a-semicolon and be done
17978 with it; the user might have typed:
17980 class X { } c = ...;
17981 class X { } *p = ...;
17983 and so forth. Instead, enumerate all the possible tokens that
17984 might follow this production; if we don't see one of them, then
17985 complain and silently insert the semicolon. */
17987 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17988 bool want_semicolon
= true;
17990 switch (token
->type
)
17993 case CPP_SEMICOLON
:
17996 case CPP_OPEN_PAREN
:
17997 case CPP_CLOSE_PAREN
:
17999 want_semicolon
= false;
18002 /* While it's legal for type qualifiers and storage class
18003 specifiers to follow type definitions in the grammar, only
18004 compiler testsuites contain code like that. Assume that if
18005 we see such code, then what we're really seeing is a case
18009 const <type> var = ...;
18014 static <type> func (...) ...
18016 i.e. the qualifier or specifier applies to the next
18017 declaration. To do so, however, we need to look ahead one
18018 more token to see if *that* token is a type specifier.
18020 This code could be improved to handle:
18023 static const <type> var = ...; */
18025 if (keyword_is_decl_specifier (token
->keyword
))
18027 cp_token
*lookahead
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
18029 /* Handling user-defined types here would be nice, but very
18032 = (lookahead
->type
== CPP_KEYWORD
18033 && keyword_begins_type_specifier (lookahead
->keyword
));
18040 /* If we don't have a type, then something is very wrong and we
18041 shouldn't try to do anything clever. Likewise for not seeing the
18043 if (closing_brace
&& TYPE_P (type
) && want_semicolon
)
18045 cp_token_position prev
18046 = cp_lexer_previous_token_position (parser
->lexer
);
18047 cp_token
*prev_token
= cp_lexer_token_at (parser
->lexer
, prev
);
18048 location_t loc
= prev_token
->location
;
18050 if (CLASSTYPE_DECLARED_CLASS (type
))
18051 error_at (loc
, "expected %<;%> after class definition");
18052 else if (TREE_CODE (type
) == RECORD_TYPE
)
18053 error_at (loc
, "expected %<;%> after struct definition");
18054 else if (TREE_CODE (type
) == UNION_TYPE
)
18055 error_at (loc
, "expected %<;%> after union definition");
18057 gcc_unreachable ();
18059 /* Unget one token and smash it to look as though we encountered
18060 a semicolon in the input stream. */
18061 cp_lexer_set_token_position (parser
->lexer
, prev
);
18062 token
= cp_lexer_peek_token (parser
->lexer
);
18063 token
->type
= CPP_SEMICOLON
;
18064 token
->keyword
= RID_MAX
;
18068 /* If this class is not itself within the scope of another class,
18069 then we need to parse the bodies of all of the queued function
18070 definitions. Note that the queued functions defined in a class
18071 are not always processed immediately following the
18072 class-specifier for that class. Consider:
18075 struct B { void f() { sizeof (A); } };
18078 If `f' were processed before the processing of `A' were
18079 completed, there would be no way to compute the size of `A'.
18080 Note that the nesting we are interested in here is lexical --
18081 not the semantic nesting given by TYPE_CONTEXT. In particular,
18084 struct A { struct B; };
18085 struct A::B { void f() { } };
18087 there is no need to delay the parsing of `A::B::f'. */
18088 if (--parser
->num_classes_being_defined
== 0)
18091 tree class_type
= NULL_TREE
;
18092 tree pushed_scope
= NULL_TREE
;
18094 cp_default_arg_entry
*e
;
18095 tree save_ccp
, save_ccr
;
18097 /* In a first pass, parse default arguments to the functions.
18098 Then, in a second pass, parse the bodies of the functions.
18099 This two-phased approach handles cases like:
18107 FOR_EACH_VEC_ELT (cp_default_arg_entry
, unparsed_funs_with_default_args
,
18111 /* If there are default arguments that have not yet been processed,
18112 take care of them now. */
18113 if (class_type
!= e
->class_type
)
18116 pop_scope (pushed_scope
);
18117 class_type
= e
->class_type
;
18118 pushed_scope
= push_scope (class_type
);
18120 /* Make sure that any template parameters are in scope. */
18121 maybe_begin_member_template_processing (decl
);
18122 /* Parse the default argument expressions. */
18123 cp_parser_late_parsing_default_args (parser
, decl
);
18124 /* Remove any template parameters from the symbol table. */
18125 maybe_end_member_template_processing ();
18127 VEC_truncate (cp_default_arg_entry
, unparsed_funs_with_default_args
, 0);
18128 /* Now parse any NSDMIs. */
18129 save_ccp
= current_class_ptr
;
18130 save_ccr
= current_class_ref
;
18131 FOR_EACH_VEC_ELT (tree
, unparsed_nsdmis
, ix
, decl
)
18133 if (class_type
!= DECL_CONTEXT (decl
))
18136 pop_scope (pushed_scope
);
18137 class_type
= DECL_CONTEXT (decl
);
18138 pushed_scope
= push_scope (class_type
);
18140 inject_this_parameter (class_type
, TYPE_UNQUALIFIED
);
18141 cp_parser_late_parsing_nsdmi (parser
, decl
);
18143 VEC_truncate (tree
, unparsed_nsdmis
, 0);
18144 current_class_ptr
= save_ccp
;
18145 current_class_ref
= save_ccr
;
18147 pop_scope (pushed_scope
);
18148 /* Now parse the body of the functions. */
18149 FOR_EACH_VEC_ELT (tree
, unparsed_funs_with_definitions
, ix
, decl
)
18150 cp_parser_late_parsing_for_member (parser
, decl
);
18151 VEC_truncate (tree
, unparsed_funs_with_definitions
, 0);
18154 /* Put back any saved access checks. */
18155 pop_deferring_access_checks ();
18157 /* Restore saved state. */
18158 parser
->in_switch_statement_p
= in_switch_statement_p
;
18159 parser
->in_statement
= in_statement
;
18160 parser
->in_function_body
= saved_in_function_body
;
18161 parser
->num_template_parameter_lists
18162 = saved_num_template_parameter_lists
;
18163 parser
->in_unbraced_linkage_specification_p
18164 = saved_in_unbraced_linkage_specification_p
;
18170 cp_parser_class_specifier (cp_parser
* parser
)
18173 timevar_push (TV_PARSE_STRUCT
);
18174 ret
= cp_parser_class_specifier_1 (parser
);
18175 timevar_pop (TV_PARSE_STRUCT
);
18179 /* Parse a class-head.
18182 class-key identifier [opt] base-clause [opt]
18183 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18184 class-key nested-name-specifier [opt] template-id
18187 class-virt-specifier:
18191 class-key attributes identifier [opt] base-clause [opt]
18192 class-key attributes nested-name-specifier identifier base-clause [opt]
18193 class-key attributes nested-name-specifier [opt] template-id
18196 Upon return BASES is initialized to the list of base classes (or
18197 NULL, if there are none) in the same form returned by
18198 cp_parser_base_clause.
18200 Returns the TYPE of the indicated class. Sets
18201 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18202 involving a nested-name-specifier was used, and FALSE otherwise.
18204 Returns error_mark_node if this is not a class-head.
18206 Returns NULL_TREE if the class-head is syntactically valid, but
18207 semantically invalid in a way that means we should skip the entire
18208 body of the class. */
18211 cp_parser_class_head (cp_parser
* parser
,
18212 bool* nested_name_specifier_p
,
18213 tree
*attributes_p
,
18216 tree nested_name_specifier
;
18217 enum tag_types class_key
;
18218 tree id
= NULL_TREE
;
18219 tree type
= NULL_TREE
;
18221 cp_virt_specifiers virt_specifiers
= VIRT_SPEC_UNSPECIFIED
;
18222 bool template_id_p
= false;
18223 bool qualified_p
= false;
18224 bool invalid_nested_name_p
= false;
18225 bool invalid_explicit_specialization_p
= false;
18226 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
18227 tree pushed_scope
= NULL_TREE
;
18228 unsigned num_templates
;
18229 cp_token
*type_start_token
= NULL
, *nested_name_specifier_token_start
= NULL
;
18230 /* Assume no nested-name-specifier will be present. */
18231 *nested_name_specifier_p
= false;
18232 /* Assume no template parameter lists will be used in defining the
18235 parser
->colon_corrects_to_scope_p
= false;
18237 *bases
= NULL_TREE
;
18239 /* Look for the class-key. */
18240 class_key
= cp_parser_class_key (parser
);
18241 if (class_key
== none_type
)
18242 return error_mark_node
;
18244 /* Parse the attributes. */
18245 attributes
= cp_parser_attributes_opt (parser
);
18247 /* If the next token is `::', that is invalid -- but sometimes
18248 people do try to write:
18252 Handle this gracefully by accepting the extra qualifier, and then
18253 issuing an error about it later if this really is a
18254 class-head. If it turns out just to be an elaborated type
18255 specifier, remain silent. */
18256 if (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false))
18257 qualified_p
= true;
18259 push_deferring_access_checks (dk_no_check
);
18261 /* Determine the name of the class. Begin by looking for an
18262 optional nested-name-specifier. */
18263 nested_name_specifier_token_start
= cp_lexer_peek_token (parser
->lexer
);
18264 nested_name_specifier
18265 = cp_parser_nested_name_specifier_opt (parser
,
18266 /*typename_keyword_p=*/false,
18267 /*check_dependency_p=*/false,
18269 /*is_declaration=*/false);
18270 /* If there was a nested-name-specifier, then there *must* be an
18272 if (nested_name_specifier
)
18274 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
18275 /* Although the grammar says `identifier', it really means
18276 `class-name' or `template-name'. You are only allowed to
18277 define a class that has already been declared with this
18280 The proposed resolution for Core Issue 180 says that wherever
18281 you see `class T::X' you should treat `X' as a type-name.
18283 It is OK to define an inaccessible class; for example:
18285 class A { class B; };
18288 We do not know if we will see a class-name, or a
18289 template-name. We look for a class-name first, in case the
18290 class-name is a template-id; if we looked for the
18291 template-name first we would stop after the template-name. */
18292 cp_parser_parse_tentatively (parser
);
18293 type
= cp_parser_class_name (parser
,
18294 /*typename_keyword_p=*/false,
18295 /*template_keyword_p=*/false,
18297 /*check_dependency_p=*/false,
18298 /*class_head_p=*/true,
18299 /*is_declaration=*/false);
18300 /* If that didn't work, ignore the nested-name-specifier. */
18301 if (!cp_parser_parse_definitely (parser
))
18303 invalid_nested_name_p
= true;
18304 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
18305 id
= cp_parser_identifier (parser
);
18306 if (id
== error_mark_node
)
18309 /* If we could not find a corresponding TYPE, treat this
18310 declaration like an unqualified declaration. */
18311 if (type
== error_mark_node
)
18312 nested_name_specifier
= NULL_TREE
;
18313 /* Otherwise, count the number of templates used in TYPE and its
18314 containing scopes. */
18319 for (scope
= TREE_TYPE (type
);
18320 scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
;
18321 scope
= (TYPE_P (scope
)
18322 ? TYPE_CONTEXT (scope
)
18323 : DECL_CONTEXT (scope
)))
18325 && CLASS_TYPE_P (scope
)
18326 && CLASSTYPE_TEMPLATE_INFO (scope
)
18327 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
))
18328 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope
))
18332 /* Otherwise, the identifier is optional. */
18335 /* We don't know whether what comes next is a template-id,
18336 an identifier, or nothing at all. */
18337 cp_parser_parse_tentatively (parser
);
18338 /* Check for a template-id. */
18339 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
18340 id
= cp_parser_template_id (parser
,
18341 /*template_keyword_p=*/false,
18342 /*check_dependency_p=*/true,
18343 /*is_declaration=*/true);
18344 /* If that didn't work, it could still be an identifier. */
18345 if (!cp_parser_parse_definitely (parser
))
18347 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
18349 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
18350 id
= cp_parser_identifier (parser
);
18357 template_id_p
= true;
18362 pop_deferring_access_checks ();
18366 cp_parser_check_for_invalid_template_id (parser
, id
,
18367 type_start_token
->location
);
18369 virt_specifiers
= cp_parser_virt_specifier_seq_opt (parser
);
18371 /* If it's not a `:' or a `{' then we can't really be looking at a
18372 class-head, since a class-head only appears as part of a
18373 class-specifier. We have to detect this situation before calling
18374 xref_tag, since that has irreversible side-effects. */
18375 if (!cp_parser_next_token_starts_class_definition_p (parser
))
18377 cp_parser_error (parser
, "expected %<{%> or %<:%>");
18378 type
= error_mark_node
;
18382 /* At this point, we're going ahead with the class-specifier, even
18383 if some other problem occurs. */
18384 cp_parser_commit_to_tentative_parse (parser
);
18385 if (virt_specifiers
& VIRT_SPEC_OVERRIDE
)
18387 cp_parser_error (parser
,
18388 "cannot specify %<override%> for a class");
18389 type
= error_mark_node
;
18392 /* Issue the error about the overly-qualified name now. */
18395 cp_parser_error (parser
,
18396 "global qualification of class name is invalid");
18397 type
= error_mark_node
;
18400 else if (invalid_nested_name_p
)
18402 cp_parser_error (parser
,
18403 "qualified name does not name a class");
18404 type
= error_mark_node
;
18407 else if (nested_name_specifier
)
18411 /* Reject typedef-names in class heads. */
18412 if (!DECL_IMPLICIT_TYPEDEF_P (type
))
18414 error_at (type_start_token
->location
,
18415 "invalid class name in declaration of %qD",
18421 /* Figure out in what scope the declaration is being placed. */
18422 scope
= current_scope ();
18423 /* If that scope does not contain the scope in which the
18424 class was originally declared, the program is invalid. */
18425 if (scope
&& !is_ancestor (scope
, nested_name_specifier
))
18427 if (at_namespace_scope_p ())
18428 error_at (type_start_token
->location
,
18429 "declaration of %qD in namespace %qD which does not "
18431 type
, scope
, nested_name_specifier
);
18433 error_at (type_start_token
->location
,
18434 "declaration of %qD in %qD which does not enclose %qD",
18435 type
, scope
, nested_name_specifier
);
18441 A declarator-id shall not be qualified except for the
18442 definition of a ... nested class outside of its class
18443 ... [or] the definition or explicit instantiation of a
18444 class member of a namespace outside of its namespace. */
18445 if (scope
== nested_name_specifier
)
18447 permerror (nested_name_specifier_token_start
->location
,
18448 "extra qualification not allowed");
18449 nested_name_specifier
= NULL_TREE
;
18453 /* An explicit-specialization must be preceded by "template <>". If
18454 it is not, try to recover gracefully. */
18455 if (at_namespace_scope_p ()
18456 && parser
->num_template_parameter_lists
== 0
18459 error_at (type_start_token
->location
,
18460 "an explicit specialization must be preceded by %<template <>%>");
18461 invalid_explicit_specialization_p
= true;
18462 /* Take the same action that would have been taken by
18463 cp_parser_explicit_specialization. */
18464 ++parser
->num_template_parameter_lists
;
18465 begin_specialization ();
18467 /* There must be no "return" statements between this point and the
18468 end of this function; set "type "to the correct return value and
18469 use "goto done;" to return. */
18470 /* Make sure that the right number of template parameters were
18472 if (!cp_parser_check_template_parameters (parser
, num_templates
,
18473 type_start_token
->location
,
18474 /*declarator=*/NULL
))
18476 /* If something went wrong, there is no point in even trying to
18477 process the class-definition. */
18482 /* Look up the type. */
18485 if (TREE_CODE (id
) == TEMPLATE_ID_EXPR
18486 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id
, 0))
18487 || TREE_CODE (TREE_OPERAND (id
, 0)) == OVERLOAD
))
18489 error_at (type_start_token
->location
,
18490 "function template %qD redeclared as a class template", id
);
18491 type
= error_mark_node
;
18495 type
= TREE_TYPE (id
);
18496 type
= maybe_process_partial_specialization (type
);
18498 if (nested_name_specifier
)
18499 pushed_scope
= push_scope (nested_name_specifier
);
18501 else if (nested_name_specifier
)
18507 template <typename T> struct S { struct T };
18508 template <typename T> struct S<T>::T { };
18510 we will get a TYPENAME_TYPE when processing the definition of
18511 `S::T'. We need to resolve it to the actual type before we
18512 try to define it. */
18513 if (TREE_CODE (TREE_TYPE (type
)) == TYPENAME_TYPE
)
18515 class_type
= resolve_typename_type (TREE_TYPE (type
),
18516 /*only_current_p=*/false);
18517 if (TREE_CODE (class_type
) != TYPENAME_TYPE
)
18518 type
= TYPE_NAME (class_type
);
18521 cp_parser_error (parser
, "could not resolve typename type");
18522 type
= error_mark_node
;
18526 if (maybe_process_partial_specialization (TREE_TYPE (type
))
18527 == error_mark_node
)
18533 class_type
= current_class_type
;
18534 /* Enter the scope indicated by the nested-name-specifier. */
18535 pushed_scope
= push_scope (nested_name_specifier
);
18536 /* Get the canonical version of this type. */
18537 type
= TYPE_MAIN_DECL (TREE_TYPE (type
));
18538 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
18539 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type
)))
18541 type
= push_template_decl (type
);
18542 if (type
== error_mark_node
)
18549 type
= TREE_TYPE (type
);
18550 *nested_name_specifier_p
= true;
18552 else /* The name is not a nested name. */
18554 /* If the class was unnamed, create a dummy name. */
18556 id
= make_anon_name ();
18557 type
= xref_tag (class_key
, id
, /*tag_scope=*/ts_current
,
18558 parser
->num_template_parameter_lists
);
18561 /* Indicate whether this class was declared as a `class' or as a
18563 if (TREE_CODE (type
) == RECORD_TYPE
)
18564 CLASSTYPE_DECLARED_CLASS (type
) = (class_key
== class_type
);
18565 cp_parser_check_class_key (class_key
, type
);
18567 /* If this type was already complete, and we see another definition,
18568 that's an error. */
18569 if (type
!= error_mark_node
&& COMPLETE_TYPE_P (type
))
18571 error_at (type_start_token
->location
, "redefinition of %q#T",
18573 error_at (type_start_token
->location
, "previous definition of %q+#T",
18578 else if (type
== error_mark_node
)
18581 /* We will have entered the scope containing the class; the names of
18582 base classes should be looked up in that context. For example:
18584 struct A { struct B {}; struct C; };
18585 struct A::C : B {};
18589 /* Get the list of base-classes, if there is one. */
18590 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
18591 *bases
= cp_parser_base_clause (parser
);
18594 /* Leave the scope given by the nested-name-specifier. We will
18595 enter the class scope itself while processing the members. */
18597 pop_scope (pushed_scope
);
18599 if (invalid_explicit_specialization_p
)
18601 end_specialization ();
18602 --parser
->num_template_parameter_lists
;
18606 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
18607 *attributes_p
= attributes
;
18608 if (type
&& (virt_specifiers
& VIRT_SPEC_FINAL
))
18609 CLASSTYPE_FINAL (type
) = 1;
18611 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
18615 /* Parse a class-key.
18622 Returns the kind of class-key specified, or none_type to indicate
18625 static enum tag_types
18626 cp_parser_class_key (cp_parser
* parser
)
18629 enum tag_types tag_type
;
18631 /* Look for the class-key. */
18632 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_KEY
);
18636 /* Check to see if the TOKEN is a class-key. */
18637 tag_type
= cp_parser_token_is_class_key (token
);
18639 cp_parser_error (parser
, "expected class-key");
18643 /* Parse an (optional) member-specification.
18645 member-specification:
18646 member-declaration member-specification [opt]
18647 access-specifier : member-specification [opt] */
18650 cp_parser_member_specification_opt (cp_parser
* parser
)
18657 /* Peek at the next token. */
18658 token
= cp_lexer_peek_token (parser
->lexer
);
18659 /* If it's a `}', or EOF then we've seen all the members. */
18660 if (token
->type
== CPP_CLOSE_BRACE
18661 || token
->type
== CPP_EOF
18662 || token
->type
== CPP_PRAGMA_EOL
)
18665 /* See if this token is a keyword. */
18666 keyword
= token
->keyword
;
18670 case RID_PROTECTED
:
18672 /* Consume the access-specifier. */
18673 cp_lexer_consume_token (parser
->lexer
);
18674 /* Remember which access-specifier is active. */
18675 current_access_specifier
= token
->u
.value
;
18676 /* Look for the `:'. */
18677 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
18681 /* Accept #pragmas at class scope. */
18682 if (token
->type
== CPP_PRAGMA
)
18684 cp_parser_pragma (parser
, pragma_external
);
18688 /* Otherwise, the next construction must be a
18689 member-declaration. */
18690 cp_parser_member_declaration (parser
);
18695 /* Parse a member-declaration.
18697 member-declaration:
18698 decl-specifier-seq [opt] member-declarator-list [opt] ;
18699 function-definition ; [opt]
18700 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18702 template-declaration
18705 member-declarator-list:
18707 member-declarator-list , member-declarator
18710 declarator pure-specifier [opt]
18711 declarator constant-initializer [opt]
18712 identifier [opt] : constant-expression
18716 member-declaration:
18717 __extension__ member-declaration
18720 declarator attributes [opt] pure-specifier [opt]
18721 declarator attributes [opt] constant-initializer [opt]
18722 identifier [opt] attributes [opt] : constant-expression
18726 member-declaration:
18727 static_assert-declaration */
18730 cp_parser_member_declaration (cp_parser
* parser
)
18732 cp_decl_specifier_seq decl_specifiers
;
18733 tree prefix_attributes
;
18735 int declares_class_or_enum
;
18737 cp_token
*token
= NULL
;
18738 cp_token
*decl_spec_token_start
= NULL
;
18739 cp_token
*initializer_token_start
= NULL
;
18740 int saved_pedantic
;
18741 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
18743 /* Check for the `__extension__' keyword. */
18744 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
18747 cp_parser_member_declaration (parser
);
18748 /* Restore the old value of the PEDANTIC flag. */
18749 pedantic
= saved_pedantic
;
18754 /* Check for a template-declaration. */
18755 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
18757 /* An explicit specialization here is an error condition, and we
18758 expect the specialization handler to detect and report this. */
18759 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
18760 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
18761 cp_parser_explicit_specialization (parser
);
18763 cp_parser_template_declaration (parser
, /*member_p=*/true);
18768 /* Check for a using-declaration. */
18769 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
18771 if (cxx_dialect
< cxx0x
)
18773 /* Parse the using-declaration. */
18774 cp_parser_using_declaration (parser
,
18775 /*access_declaration_p=*/false);
18781 cp_parser_parse_tentatively (parser
);
18782 decl
= cp_parser_alias_declaration (parser
);
18783 if (cp_parser_parse_definitely (parser
))
18784 finish_member_declaration (decl
);
18786 cp_parser_using_declaration (parser
,
18787 /*access_declaration_p=*/false);
18792 /* Check for @defs. */
18793 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_DEFS
))
18796 tree ivar_chains
= cp_parser_objc_defs_expression (parser
);
18797 ivar
= ivar_chains
;
18801 ivar
= TREE_CHAIN (member
);
18802 TREE_CHAIN (member
) = NULL_TREE
;
18803 finish_member_declaration (member
);
18808 /* If the next token is `static_assert' we have a static assertion. */
18809 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC_ASSERT
))
18811 cp_parser_static_assert (parser
, /*member_p=*/true);
18815 parser
->colon_corrects_to_scope_p
= false;
18817 if (cp_parser_using_declaration (parser
, /*access_declaration=*/true))
18820 /* Parse the decl-specifier-seq. */
18821 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
18822 cp_parser_decl_specifier_seq (parser
,
18823 CP_PARSER_FLAGS_OPTIONAL
,
18825 &declares_class_or_enum
);
18826 prefix_attributes
= decl_specifiers
.attributes
;
18827 decl_specifiers
.attributes
= NULL_TREE
;
18828 /* Check for an invalid type-name. */
18829 if (!decl_specifiers
.any_type_specifiers_p
18830 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
18832 /* If there is no declarator, then the decl-specifier-seq should
18834 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
18836 /* If there was no decl-specifier-seq, and the next token is a
18837 `;', then we have something like:
18843 Each member-declaration shall declare at least one member
18844 name of the class. */
18845 if (!decl_specifiers
.any_specifiers_p
)
18847 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
18848 if (!in_system_header_at (token
->location
))
18849 pedwarn (token
->location
, OPT_pedantic
, "extra %<;%>");
18855 /* See if this declaration is a friend. */
18856 friend_p
= cp_parser_friend_p (&decl_specifiers
);
18857 /* If there were decl-specifiers, check to see if there was
18858 a class-declaration. */
18859 type
= check_tag_decl (&decl_specifiers
);
18860 /* Nested classes have already been added to the class, but
18861 a `friend' needs to be explicitly registered. */
18864 /* If the `friend' keyword was present, the friend must
18865 be introduced with a class-key. */
18866 if (!declares_class_or_enum
&& cxx_dialect
< cxx0x
)
18867 pedwarn (decl_spec_token_start
->location
, OPT_pedantic
,
18868 "in C++03 a class-key must be used "
18869 "when declaring a friend");
18872 template <typename T> struct A {
18873 friend struct A<T>::B;
18876 A<T>::B will be represented by a TYPENAME_TYPE, and
18877 therefore not recognized by check_tag_decl. */
18880 type
= decl_specifiers
.type
;
18881 if (type
&& TREE_CODE (type
) == TYPE_DECL
)
18882 type
= TREE_TYPE (type
);
18884 if (!type
|| !TYPE_P (type
))
18885 error_at (decl_spec_token_start
->location
,
18886 "friend declaration does not name a class or "
18889 make_friend_class (current_class_type
, type
,
18890 /*complain=*/true);
18892 /* If there is no TYPE, an error message will already have
18894 else if (!type
|| type
== error_mark_node
)
18896 /* An anonymous aggregate has to be handled specially; such
18897 a declaration really declares a data member (with a
18898 particular type), as opposed to a nested class. */
18899 else if (ANON_AGGR_TYPE_P (type
))
18901 /* Remove constructors and such from TYPE, now that we
18902 know it is an anonymous aggregate. */
18903 fixup_anonymous_aggr (type
);
18904 /* And make the corresponding data member. */
18905 decl
= build_decl (decl_spec_token_start
->location
,
18906 FIELD_DECL
, NULL_TREE
, type
);
18907 /* Add it to the class. */
18908 finish_member_declaration (decl
);
18911 cp_parser_check_access_in_redeclaration
18913 decl_spec_token_start
->location
);
18918 bool assume_semicolon
= false;
18920 /* See if these declarations will be friends. */
18921 friend_p
= cp_parser_friend_p (&decl_specifiers
);
18923 /* Keep going until we hit the `;' at the end of the
18925 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
18927 tree attributes
= NULL_TREE
;
18928 tree first_attribute
;
18930 /* Peek at the next token. */
18931 token
= cp_lexer_peek_token (parser
->lexer
);
18933 /* Check for a bitfield declaration. */
18934 if (token
->type
== CPP_COLON
18935 || (token
->type
== CPP_NAME
18936 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
18942 /* Get the name of the bitfield. Note that we cannot just
18943 check TOKEN here because it may have been invalidated by
18944 the call to cp_lexer_peek_nth_token above. */
18945 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
18946 identifier
= cp_parser_identifier (parser
);
18948 identifier
= NULL_TREE
;
18950 /* Consume the `:' token. */
18951 cp_lexer_consume_token (parser
->lexer
);
18952 /* Get the width of the bitfield. */
18954 = cp_parser_constant_expression (parser
,
18955 /*allow_non_constant=*/false,
18958 /* Look for attributes that apply to the bitfield. */
18959 attributes
= cp_parser_attributes_opt (parser
);
18960 /* Remember which attributes are prefix attributes and
18962 first_attribute
= attributes
;
18963 /* Combine the attributes. */
18964 attributes
= chainon (prefix_attributes
, attributes
);
18966 /* Create the bitfield declaration. */
18967 decl
= grokbitfield (identifier
18968 ? make_id_declarator (NULL_TREE
,
18978 cp_declarator
*declarator
;
18980 tree asm_specification
;
18981 int ctor_dtor_or_conv_p
;
18983 /* Parse the declarator. */
18985 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
18986 &ctor_dtor_or_conv_p
,
18987 /*parenthesized_p=*/NULL
,
18988 /*member_p=*/true);
18990 /* If something went wrong parsing the declarator, make sure
18991 that we at least consume some tokens. */
18992 if (declarator
== cp_error_declarator
)
18994 /* Skip to the end of the statement. */
18995 cp_parser_skip_to_end_of_statement (parser
);
18996 /* If the next token is not a semicolon, that is
18997 probably because we just skipped over the body of
18998 a function. So, we consume a semicolon if
18999 present, but do not issue an error message if it
19001 if (cp_lexer_next_token_is (parser
->lexer
,
19003 cp_lexer_consume_token (parser
->lexer
);
19007 if (declares_class_or_enum
& 2)
19008 cp_parser_check_for_definition_in_return_type
19009 (declarator
, decl_specifiers
.type
,
19010 decl_specifiers
.type_location
);
19012 /* Look for an asm-specification. */
19013 asm_specification
= cp_parser_asm_specification_opt (parser
);
19014 /* Look for attributes that apply to the declaration. */
19015 attributes
= cp_parser_attributes_opt (parser
);
19016 /* Remember which attributes are prefix attributes and
19018 first_attribute
= attributes
;
19019 /* Combine the attributes. */
19020 attributes
= chainon (prefix_attributes
, attributes
);
19022 /* If it's an `=', then we have a constant-initializer or a
19023 pure-specifier. It is not correct to parse the
19024 initializer before registering the member declaration
19025 since the member declaration should be in scope while
19026 its initializer is processed. However, the rest of the
19027 front end does not yet provide an interface that allows
19028 us to handle this correctly. */
19029 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
19033 A pure-specifier shall be used only in the declaration of
19034 a virtual function.
19036 A member-declarator can contain a constant-initializer
19037 only if it declares a static member of integral or
19040 Therefore, if the DECLARATOR is for a function, we look
19041 for a pure-specifier; otherwise, we look for a
19042 constant-initializer. When we call `grokfield', it will
19043 perform more stringent semantics checks. */
19044 initializer_token_start
= cp_lexer_peek_token (parser
->lexer
);
19045 if (function_declarator_p (declarator
)
19046 || (decl_specifiers
.type
19047 && TREE_CODE (decl_specifiers
.type
) == TYPE_DECL
19048 && (TREE_CODE (TREE_TYPE (decl_specifiers
.type
))
19049 == FUNCTION_TYPE
)))
19050 initializer
= cp_parser_pure_specifier (parser
);
19051 else if (decl_specifiers
.storage_class
!= sc_static
)
19052 initializer
= cp_parser_save_nsdmi (parser
);
19053 else if (cxx_dialect
>= cxx0x
)
19056 /* Don't require a constant rvalue in C++11, since we
19057 might want a reference constant. We'll enforce
19058 constancy later. */
19059 cp_lexer_consume_token (parser
->lexer
);
19060 /* Parse the initializer. */
19061 initializer
= cp_parser_initializer_clause (parser
,
19065 /* Parse the initializer. */
19066 initializer
= cp_parser_constant_initializer (parser
);
19068 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
)
19069 && !function_declarator_p (declarator
))
19072 if (decl_specifiers
.storage_class
!= sc_static
)
19073 initializer
= cp_parser_save_nsdmi (parser
);
19075 initializer
= cp_parser_initializer (parser
, &x
, &x
);
19077 /* Otherwise, there is no initializer. */
19079 initializer
= NULL_TREE
;
19081 /* See if we are probably looking at a function
19082 definition. We are certainly not looking at a
19083 member-declarator. Calling `grokfield' has
19084 side-effects, so we must not do it unless we are sure
19085 that we are looking at a member-declarator. */
19086 if (cp_parser_token_starts_function_definition_p
19087 (cp_lexer_peek_token (parser
->lexer
)))
19089 /* The grammar does not allow a pure-specifier to be
19090 used when a member function is defined. (It is
19091 possible that this fact is an oversight in the
19092 standard, since a pure function may be defined
19093 outside of the class-specifier. */
19095 error_at (initializer_token_start
->location
,
19096 "pure-specifier on function-definition");
19097 decl
= cp_parser_save_member_function_body (parser
,
19101 /* If the member was not a friend, declare it here. */
19103 finish_member_declaration (decl
);
19104 /* Peek at the next token. */
19105 token
= cp_lexer_peek_token (parser
->lexer
);
19106 /* If the next token is a semicolon, consume it. */
19107 if (token
->type
== CPP_SEMICOLON
)
19108 cp_lexer_consume_token (parser
->lexer
);
19112 if (declarator
->kind
== cdk_function
)
19113 declarator
->id_loc
= token
->location
;
19114 /* Create the declaration. */
19115 decl
= grokfield (declarator
, &decl_specifiers
,
19116 initializer
, /*init_const_expr_p=*/true,
19121 /* Reset PREFIX_ATTRIBUTES. */
19122 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
19123 attributes
= TREE_CHAIN (attributes
);
19125 TREE_CHAIN (attributes
) = NULL_TREE
;
19127 /* If there is any qualification still in effect, clear it
19128 now; we will be starting fresh with the next declarator. */
19129 parser
->scope
= NULL_TREE
;
19130 parser
->qualifying_scope
= NULL_TREE
;
19131 parser
->object_scope
= NULL_TREE
;
19132 /* If it's a `,', then there are more declarators. */
19133 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
19134 cp_lexer_consume_token (parser
->lexer
);
19135 /* If the next token isn't a `;', then we have a parse error. */
19136 else if (cp_lexer_next_token_is_not (parser
->lexer
,
19139 /* The next token might be a ways away from where the
19140 actual semicolon is missing. Find the previous token
19141 and use that for our error position. */
19142 cp_token
*token
= cp_lexer_previous_token (parser
->lexer
);
19143 error_at (token
->location
,
19144 "expected %<;%> at end of member declaration");
19146 /* Assume that the user meant to provide a semicolon. If
19147 we were to cp_parser_skip_to_end_of_statement, we might
19148 skip to a semicolon inside a member function definition
19149 and issue nonsensical error messages. */
19150 assume_semicolon
= true;
19155 /* Add DECL to the list of members. */
19157 finish_member_declaration (decl
);
19159 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19160 cp_parser_save_default_args (parser
, decl
);
19161 else if (TREE_CODE (decl
) == FIELD_DECL
19162 && !DECL_C_BIT_FIELD (decl
)
19163 && DECL_INITIAL (decl
))
19164 /* Add DECL to the queue of NSDMI to be parsed later. */
19165 VEC_safe_push (tree
, gc
, unparsed_nsdmis
, decl
);
19168 if (assume_semicolon
)
19173 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
19175 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
19178 /* Parse a pure-specifier.
19183 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19184 Otherwise, ERROR_MARK_NODE is returned. */
19187 cp_parser_pure_specifier (cp_parser
* parser
)
19191 /* Look for the `=' token. */
19192 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
19193 return error_mark_node
;
19194 /* Look for the `0' token. */
19195 token
= cp_lexer_peek_token (parser
->lexer
);
19197 if (token
->type
== CPP_EOF
19198 || token
->type
== CPP_PRAGMA_EOL
)
19199 return error_mark_node
;
19201 cp_lexer_consume_token (parser
->lexer
);
19203 /* Accept = default or = delete in c++0x mode. */
19204 if (token
->keyword
== RID_DEFAULT
19205 || token
->keyword
== RID_DELETE
)
19207 maybe_warn_cpp0x (CPP0X_DEFAULTED_DELETED
);
19208 return token
->u
.value
;
19211 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19212 if (token
->type
!= CPP_NUMBER
|| !(token
->flags
& PURE_ZERO
))
19214 cp_parser_error (parser
,
19215 "invalid pure specifier (only %<= 0%> is allowed)");
19216 cp_parser_skip_to_end_of_statement (parser
);
19217 return error_mark_node
;
19219 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
19221 error_at (token
->location
, "templates may not be %<virtual%>");
19222 return error_mark_node
;
19225 return integer_zero_node
;
19228 /* Parse a constant-initializer.
19230 constant-initializer:
19231 = constant-expression
19233 Returns a representation of the constant-expression. */
19236 cp_parser_constant_initializer (cp_parser
* parser
)
19238 /* Look for the `=' token. */
19239 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
19240 return error_mark_node
;
19242 /* It is invalid to write:
19244 struct S { static const int i = { 7 }; };
19247 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
19249 cp_parser_error (parser
,
19250 "a brace-enclosed initializer is not allowed here");
19251 /* Consume the opening brace. */
19252 cp_lexer_consume_token (parser
->lexer
);
19253 /* Skip the initializer. */
19254 cp_parser_skip_to_closing_brace (parser
);
19255 /* Look for the trailing `}'. */
19256 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
19258 return error_mark_node
;
19261 return cp_parser_constant_expression (parser
,
19262 /*allow_non_constant=*/false,
19266 /* Derived classes [gram.class.derived] */
19268 /* Parse a base-clause.
19271 : base-specifier-list
19273 base-specifier-list:
19274 base-specifier ... [opt]
19275 base-specifier-list , base-specifier ... [opt]
19277 Returns a TREE_LIST representing the base-classes, in the order in
19278 which they were declared. The representation of each node is as
19279 described by cp_parser_base_specifier.
19281 In the case that no bases are specified, this function will return
19282 NULL_TREE, not ERROR_MARK_NODE. */
19285 cp_parser_base_clause (cp_parser
* parser
)
19287 tree bases
= NULL_TREE
;
19289 /* Look for the `:' that begins the list. */
19290 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
19292 /* Scan the base-specifier-list. */
19297 bool pack_expansion_p
= false;
19299 /* Look for the base-specifier. */
19300 base
= cp_parser_base_specifier (parser
);
19301 /* Look for the (optional) ellipsis. */
19302 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
19304 /* Consume the `...'. */
19305 cp_lexer_consume_token (parser
->lexer
);
19307 pack_expansion_p
= true;
19310 /* Add BASE to the front of the list. */
19311 if (base
&& base
!= error_mark_node
)
19313 if (pack_expansion_p
)
19314 /* Make this a pack expansion type. */
19315 TREE_VALUE (base
) = make_pack_expansion (TREE_VALUE (base
));
19317 if (!check_for_bare_parameter_packs (TREE_VALUE (base
)))
19319 TREE_CHAIN (base
) = bases
;
19323 /* Peek at the next token. */
19324 token
= cp_lexer_peek_token (parser
->lexer
);
19325 /* If it's not a comma, then the list is complete. */
19326 if (token
->type
!= CPP_COMMA
)
19328 /* Consume the `,'. */
19329 cp_lexer_consume_token (parser
->lexer
);
19332 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19333 base class had a qualified name. However, the next name that
19334 appears is certainly not qualified. */
19335 parser
->scope
= NULL_TREE
;
19336 parser
->qualifying_scope
= NULL_TREE
;
19337 parser
->object_scope
= NULL_TREE
;
19339 return nreverse (bases
);
19342 /* Parse a base-specifier.
19345 :: [opt] nested-name-specifier [opt] class-name
19346 virtual access-specifier [opt] :: [opt] nested-name-specifier
19348 access-specifier virtual [opt] :: [opt] nested-name-specifier
19351 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19352 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19353 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19354 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19357 cp_parser_base_specifier (cp_parser
* parser
)
19361 bool virtual_p
= false;
19362 bool duplicate_virtual_error_issued_p
= false;
19363 bool duplicate_access_error_issued_p
= false;
19364 bool class_scope_p
, template_p
;
19365 tree access
= access_default_node
;
19368 /* Process the optional `virtual' and `access-specifier'. */
19371 /* Peek at the next token. */
19372 token
= cp_lexer_peek_token (parser
->lexer
);
19373 /* Process `virtual'. */
19374 switch (token
->keyword
)
19377 /* If `virtual' appears more than once, issue an error. */
19378 if (virtual_p
&& !duplicate_virtual_error_issued_p
)
19380 cp_parser_error (parser
,
19381 "%<virtual%> specified more than once in base-specified");
19382 duplicate_virtual_error_issued_p
= true;
19387 /* Consume the `virtual' token. */
19388 cp_lexer_consume_token (parser
->lexer
);
19393 case RID_PROTECTED
:
19395 /* If more than one access specifier appears, issue an
19397 if (access
!= access_default_node
19398 && !duplicate_access_error_issued_p
)
19400 cp_parser_error (parser
,
19401 "more than one access specifier in base-specified");
19402 duplicate_access_error_issued_p
= true;
19405 access
= ridpointers
[(int) token
->keyword
];
19407 /* Consume the access-specifier. */
19408 cp_lexer_consume_token (parser
->lexer
);
19417 /* It is not uncommon to see programs mechanically, erroneously, use
19418 the 'typename' keyword to denote (dependent) qualified types
19419 as base classes. */
19420 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
19422 token
= cp_lexer_peek_token (parser
->lexer
);
19423 if (!processing_template_decl
)
19424 error_at (token
->location
,
19425 "keyword %<typename%> not allowed outside of templates");
19427 error_at (token
->location
,
19428 "keyword %<typename%> not allowed in this context "
19429 "(the base class is implicitly a type)");
19430 cp_lexer_consume_token (parser
->lexer
);
19433 /* Look for the optional `::' operator. */
19434 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
19435 /* Look for the nested-name-specifier. The simplest way to
19440 The keyword `typename' is not permitted in a base-specifier or
19441 mem-initializer; in these contexts a qualified name that
19442 depends on a template-parameter is implicitly assumed to be a
19445 is to pretend that we have seen the `typename' keyword at this
19447 cp_parser_nested_name_specifier_opt (parser
,
19448 /*typename_keyword_p=*/true,
19449 /*check_dependency_p=*/true,
19451 /*is_declaration=*/true);
19452 /* If the base class is given by a qualified name, assume that names
19453 we see are type names or templates, as appropriate. */
19454 class_scope_p
= (parser
->scope
&& TYPE_P (parser
->scope
));
19455 template_p
= class_scope_p
&& cp_parser_optional_template_keyword (parser
);
19458 && cp_lexer_next_token_is_decltype (parser
->lexer
))
19459 /* DR 950 allows decltype as a base-specifier. */
19460 type
= cp_parser_decltype (parser
);
19463 /* Otherwise, look for the class-name. */
19464 type
= cp_parser_class_name (parser
,
19468 /*check_dependency_p=*/true,
19469 /*class_head_p=*/false,
19470 /*is_declaration=*/true);
19471 type
= TREE_TYPE (type
);
19474 if (type
== error_mark_node
)
19475 return error_mark_node
;
19477 return finish_base_specifier (type
, access
, virtual_p
);
19480 /* Exception handling [gram.exception] */
19482 /* Parse an (optional) exception-specification.
19484 exception-specification:
19485 throw ( type-id-list [opt] )
19487 Returns a TREE_LIST representing the exception-specification. The
19488 TREE_VALUE of each node is a type. */
19491 cp_parser_exception_specification_opt (cp_parser
* parser
)
19495 const char *saved_message
;
19497 /* Peek at the next token. */
19498 token
= cp_lexer_peek_token (parser
->lexer
);
19500 /* Is it a noexcept-specification? */
19501 if (cp_parser_is_keyword (token
, RID_NOEXCEPT
))
19504 cp_lexer_consume_token (parser
->lexer
);
19506 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
19508 cp_lexer_consume_token (parser
->lexer
);
19510 /* Types may not be defined in an exception-specification. */
19511 saved_message
= parser
->type_definition_forbidden_message
;
19512 parser
->type_definition_forbidden_message
19513 = G_("types may not be defined in an exception-specification");
19515 expr
= cp_parser_constant_expression (parser
, false, NULL
);
19517 /* Restore the saved message. */
19518 parser
->type_definition_forbidden_message
= saved_message
;
19520 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
19523 expr
= boolean_true_node
;
19525 return build_noexcept_spec (expr
, tf_warning_or_error
);
19528 /* If it's not `throw', then there's no exception-specification. */
19529 if (!cp_parser_is_keyword (token
, RID_THROW
))
19533 /* Enable this once a lot of code has transitioned to noexcept? */
19534 if (cxx_dialect
== cxx0x
&& !in_system_header
)
19535 warning (OPT_Wdeprecated
, "dynamic exception specifications are "
19536 "deprecated in C++0x; use %<noexcept%> instead");
19539 /* Consume the `throw'. */
19540 cp_lexer_consume_token (parser
->lexer
);
19542 /* Look for the `('. */
19543 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
19545 /* Peek at the next token. */
19546 token
= cp_lexer_peek_token (parser
->lexer
);
19547 /* If it's not a `)', then there is a type-id-list. */
19548 if (token
->type
!= CPP_CLOSE_PAREN
)
19550 /* Types may not be defined in an exception-specification. */
19551 saved_message
= parser
->type_definition_forbidden_message
;
19552 parser
->type_definition_forbidden_message
19553 = G_("types may not be defined in an exception-specification");
19554 /* Parse the type-id-list. */
19555 type_id_list
= cp_parser_type_id_list (parser
);
19556 /* Restore the saved message. */
19557 parser
->type_definition_forbidden_message
= saved_message
;
19560 type_id_list
= empty_except_spec
;
19562 /* Look for the `)'. */
19563 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
19565 return type_id_list
;
19568 /* Parse an (optional) type-id-list.
19572 type-id-list , type-id ... [opt]
19574 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19575 in the order that the types were presented. */
19578 cp_parser_type_id_list (cp_parser
* parser
)
19580 tree types
= NULL_TREE
;
19587 /* Get the next type-id. */
19588 type
= cp_parser_type_id (parser
);
19589 /* Parse the optional ellipsis. */
19590 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
19592 /* Consume the `...'. */
19593 cp_lexer_consume_token (parser
->lexer
);
19595 /* Turn the type into a pack expansion expression. */
19596 type
= make_pack_expansion (type
);
19598 /* Add it to the list. */
19599 types
= add_exception_specifier (types
, type
, /*complain=*/1);
19600 /* Peek at the next token. */
19601 token
= cp_lexer_peek_token (parser
->lexer
);
19602 /* If it is not a `,', we are done. */
19603 if (token
->type
!= CPP_COMMA
)
19605 /* Consume the `,'. */
19606 cp_lexer_consume_token (parser
->lexer
);
19609 return nreverse (types
);
19612 /* Parse a try-block.
19615 try compound-statement handler-seq */
19618 cp_parser_try_block (cp_parser
* parser
)
19622 cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
);
19623 try_block
= begin_try_block ();
19624 cp_parser_compound_statement (parser
, NULL
, true, false);
19625 finish_try_block (try_block
);
19626 cp_parser_handler_seq (parser
);
19627 finish_handler_sequence (try_block
);
19632 /* Parse a function-try-block.
19634 function-try-block:
19635 try ctor-initializer [opt] function-body handler-seq */
19638 cp_parser_function_try_block (cp_parser
* parser
)
19640 tree compound_stmt
;
19642 bool ctor_initializer_p
;
19644 /* Look for the `try' keyword. */
19645 if (!cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
))
19647 /* Let the rest of the front end know where we are. */
19648 try_block
= begin_function_try_block (&compound_stmt
);
19649 /* Parse the function-body. */
19651 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
19652 /* We're done with the `try' part. */
19653 finish_function_try_block (try_block
);
19654 /* Parse the handlers. */
19655 cp_parser_handler_seq (parser
);
19656 /* We're done with the handlers. */
19657 finish_function_handler_sequence (try_block
, compound_stmt
);
19659 return ctor_initializer_p
;
19662 /* Parse a handler-seq.
19665 handler handler-seq [opt] */
19668 cp_parser_handler_seq (cp_parser
* parser
)
19674 /* Parse the handler. */
19675 cp_parser_handler (parser
);
19676 /* Peek at the next token. */
19677 token
= cp_lexer_peek_token (parser
->lexer
);
19678 /* If it's not `catch' then there are no more handlers. */
19679 if (!cp_parser_is_keyword (token
, RID_CATCH
))
19684 /* Parse a handler.
19687 catch ( exception-declaration ) compound-statement */
19690 cp_parser_handler (cp_parser
* parser
)
19695 cp_parser_require_keyword (parser
, RID_CATCH
, RT_CATCH
);
19696 handler
= begin_handler ();
19697 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
19698 declaration
= cp_parser_exception_declaration (parser
);
19699 finish_handler_parms (declaration
, handler
);
19700 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
19701 cp_parser_compound_statement (parser
, NULL
, false, false);
19702 finish_handler (handler
);
19705 /* Parse an exception-declaration.
19707 exception-declaration:
19708 type-specifier-seq declarator
19709 type-specifier-seq abstract-declarator
19713 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19714 ellipsis variant is used. */
19717 cp_parser_exception_declaration (cp_parser
* parser
)
19719 cp_decl_specifier_seq type_specifiers
;
19720 cp_declarator
*declarator
;
19721 const char *saved_message
;
19723 /* If it's an ellipsis, it's easy to handle. */
19724 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
19726 /* Consume the `...' token. */
19727 cp_lexer_consume_token (parser
->lexer
);
19731 /* Types may not be defined in exception-declarations. */
19732 saved_message
= parser
->type_definition_forbidden_message
;
19733 parser
->type_definition_forbidden_message
19734 = G_("types may not be defined in exception-declarations");
19736 /* Parse the type-specifier-seq. */
19737 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
19738 /*is_trailing_return=*/false,
19740 /* If it's a `)', then there is no declarator. */
19741 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
19744 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_EITHER
,
19745 /*ctor_dtor_or_conv_p=*/NULL
,
19746 /*parenthesized_p=*/NULL
,
19747 /*member_p=*/false);
19749 /* Restore the saved message. */
19750 parser
->type_definition_forbidden_message
= saved_message
;
19752 if (!type_specifiers
.any_specifiers_p
)
19753 return error_mark_node
;
19755 return grokdeclarator (declarator
, &type_specifiers
, CATCHPARM
, 1, NULL
);
19758 /* Parse a throw-expression.
19761 throw assignment-expression [opt]
19763 Returns a THROW_EXPR representing the throw-expression. */
19766 cp_parser_throw_expression (cp_parser
* parser
)
19771 cp_parser_require_keyword (parser
, RID_THROW
, RT_THROW
);
19772 token
= cp_lexer_peek_token (parser
->lexer
);
19773 /* Figure out whether or not there is an assignment-expression
19774 following the "throw" keyword. */
19775 if (token
->type
== CPP_COMMA
19776 || token
->type
== CPP_SEMICOLON
19777 || token
->type
== CPP_CLOSE_PAREN
19778 || token
->type
== CPP_CLOSE_SQUARE
19779 || token
->type
== CPP_CLOSE_BRACE
19780 || token
->type
== CPP_COLON
)
19781 expression
= NULL_TREE
;
19783 expression
= cp_parser_assignment_expression (parser
,
19784 /*cast_p=*/false, NULL
);
19786 return build_throw (expression
);
19789 /* GNU Extensions */
19791 /* Parse an (optional) asm-specification.
19794 asm ( string-literal )
19796 If the asm-specification is present, returns a STRING_CST
19797 corresponding to the string-literal. Otherwise, returns
19801 cp_parser_asm_specification_opt (cp_parser
* parser
)
19804 tree asm_specification
;
19806 /* Peek at the next token. */
19807 token
= cp_lexer_peek_token (parser
->lexer
);
19808 /* If the next token isn't the `asm' keyword, then there's no
19809 asm-specification. */
19810 if (!cp_parser_is_keyword (token
, RID_ASM
))
19813 /* Consume the `asm' token. */
19814 cp_lexer_consume_token (parser
->lexer
);
19815 /* Look for the `('. */
19816 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
19818 /* Look for the string-literal. */
19819 asm_specification
= cp_parser_string_literal (parser
, false, false);
19821 /* Look for the `)'. */
19822 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
19824 return asm_specification
;
19827 /* Parse an asm-operand-list.
19831 asm-operand-list , asm-operand
19834 string-literal ( expression )
19835 [ string-literal ] string-literal ( expression )
19837 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19838 each node is the expression. The TREE_PURPOSE is itself a
19839 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19840 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19841 is a STRING_CST for the string literal before the parenthesis. Returns
19842 ERROR_MARK_NODE if any of the operands are invalid. */
19845 cp_parser_asm_operand_list (cp_parser
* parser
)
19847 tree asm_operands
= NULL_TREE
;
19848 bool invalid_operands
= false;
19852 tree string_literal
;
19856 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
19858 /* Consume the `[' token. */
19859 cp_lexer_consume_token (parser
->lexer
);
19860 /* Read the operand name. */
19861 name
= cp_parser_identifier (parser
);
19862 if (name
!= error_mark_node
)
19863 name
= build_string (IDENTIFIER_LENGTH (name
),
19864 IDENTIFIER_POINTER (name
));
19865 /* Look for the closing `]'. */
19866 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
19870 /* Look for the string-literal. */
19871 string_literal
= cp_parser_string_literal (parser
, false, false);
19873 /* Look for the `('. */
19874 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
19875 /* Parse the expression. */
19876 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
19877 /* Look for the `)'. */
19878 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
19880 if (name
== error_mark_node
19881 || string_literal
== error_mark_node
19882 || expression
== error_mark_node
)
19883 invalid_operands
= true;
19885 /* Add this operand to the list. */
19886 asm_operands
= tree_cons (build_tree_list (name
, string_literal
),
19889 /* If the next token is not a `,', there are no more
19891 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
19893 /* Consume the `,'. */
19894 cp_lexer_consume_token (parser
->lexer
);
19897 return invalid_operands
? error_mark_node
: nreverse (asm_operands
);
19900 /* Parse an asm-clobber-list.
19904 asm-clobber-list , string-literal
19906 Returns a TREE_LIST, indicating the clobbers in the order that they
19907 appeared. The TREE_VALUE of each node is a STRING_CST. */
19910 cp_parser_asm_clobber_list (cp_parser
* parser
)
19912 tree clobbers
= NULL_TREE
;
19916 tree string_literal
;
19918 /* Look for the string literal. */
19919 string_literal
= cp_parser_string_literal (parser
, false, false);
19920 /* Add it to the list. */
19921 clobbers
= tree_cons (NULL_TREE
, string_literal
, clobbers
);
19922 /* If the next token is not a `,', then the list is
19924 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
19926 /* Consume the `,' token. */
19927 cp_lexer_consume_token (parser
->lexer
);
19933 /* Parse an asm-label-list.
19937 asm-label-list , identifier
19939 Returns a TREE_LIST, indicating the labels in the order that they
19940 appeared. The TREE_VALUE of each node is a label. */
19943 cp_parser_asm_label_list (cp_parser
* parser
)
19945 tree labels
= NULL_TREE
;
19949 tree identifier
, label
, name
;
19951 /* Look for the identifier. */
19952 identifier
= cp_parser_identifier (parser
);
19953 if (!error_operand_p (identifier
))
19955 label
= lookup_label (identifier
);
19956 if (TREE_CODE (label
) == LABEL_DECL
)
19958 TREE_USED (label
) = 1;
19959 check_goto (label
);
19960 name
= build_string (IDENTIFIER_LENGTH (identifier
),
19961 IDENTIFIER_POINTER (identifier
));
19962 labels
= tree_cons (name
, label
, labels
);
19965 /* If the next token is not a `,', then the list is
19967 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
19969 /* Consume the `,' token. */
19970 cp_lexer_consume_token (parser
->lexer
);
19973 return nreverse (labels
);
19976 /* Parse an (optional) series of attributes.
19979 attributes attribute
19982 __attribute__ (( attribute-list [opt] ))
19984 The return value is as for cp_parser_attribute_list. */
19987 cp_parser_attributes_opt (cp_parser
* parser
)
19989 tree attributes
= NULL_TREE
;
19994 tree attribute_list
;
19996 /* Peek at the next token. */
19997 token
= cp_lexer_peek_token (parser
->lexer
);
19998 /* If it's not `__attribute__', then we're done. */
19999 if (token
->keyword
!= RID_ATTRIBUTE
)
20002 /* Consume the `__attribute__' keyword. */
20003 cp_lexer_consume_token (parser
->lexer
);
20004 /* Look for the two `(' tokens. */
20005 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
20006 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
20008 /* Peek at the next token. */
20009 token
= cp_lexer_peek_token (parser
->lexer
);
20010 if (token
->type
!= CPP_CLOSE_PAREN
)
20011 /* Parse the attribute-list. */
20012 attribute_list
= cp_parser_attribute_list (parser
);
20014 /* If the next token is a `)', then there is no attribute
20016 attribute_list
= NULL
;
20018 /* Look for the two `)' tokens. */
20019 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
20020 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
20022 /* Add these new attributes to the list. */
20023 attributes
= chainon (attributes
, attribute_list
);
20029 /* Parse an attribute-list.
20033 attribute-list , attribute
20037 identifier ( identifier )
20038 identifier ( identifier , expression-list )
20039 identifier ( expression-list )
20041 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20042 to an attribute. The TREE_PURPOSE of each node is the identifier
20043 indicating which attribute is in use. The TREE_VALUE represents
20044 the arguments, if any. */
20047 cp_parser_attribute_list (cp_parser
* parser
)
20049 tree attribute_list
= NULL_TREE
;
20050 bool save_translate_strings_p
= parser
->translate_strings_p
;
20052 parser
->translate_strings_p
= false;
20059 /* Look for the identifier. We also allow keywords here; for
20060 example `__attribute__ ((const))' is legal. */
20061 token
= cp_lexer_peek_token (parser
->lexer
);
20062 if (token
->type
== CPP_NAME
20063 || token
->type
== CPP_KEYWORD
)
20065 tree arguments
= NULL_TREE
;
20067 /* Consume the token. */
20068 token
= cp_lexer_consume_token (parser
->lexer
);
20070 /* Save away the identifier that indicates which attribute
20072 identifier
= (token
->type
== CPP_KEYWORD
)
20073 /* For keywords, use the canonical spelling, not the
20074 parsed identifier. */
20075 ? ridpointers
[(int) token
->keyword
]
20078 attribute
= build_tree_list (identifier
, NULL_TREE
);
20080 /* Peek at the next token. */
20081 token
= cp_lexer_peek_token (parser
->lexer
);
20082 /* If it's an `(', then parse the attribute arguments. */
20083 if (token
->type
== CPP_OPEN_PAREN
)
20086 int attr_flag
= (attribute_takes_identifier_p (identifier
)
20087 ? id_attr
: normal_attr
);
20088 vec
= cp_parser_parenthesized_expression_list
20089 (parser
, attr_flag
, /*cast_p=*/false,
20090 /*allow_expansion_p=*/false,
20091 /*non_constant_p=*/NULL
);
20093 arguments
= error_mark_node
;
20096 arguments
= build_tree_list_vec (vec
);
20097 release_tree_vector (vec
);
20099 /* Save the arguments away. */
20100 TREE_VALUE (attribute
) = arguments
;
20103 if (arguments
!= error_mark_node
)
20105 /* Add this attribute to the list. */
20106 TREE_CHAIN (attribute
) = attribute_list
;
20107 attribute_list
= attribute
;
20110 token
= cp_lexer_peek_token (parser
->lexer
);
20112 /* Now, look for more attributes. If the next token isn't a
20113 `,', we're done. */
20114 if (token
->type
!= CPP_COMMA
)
20117 /* Consume the comma and keep going. */
20118 cp_lexer_consume_token (parser
->lexer
);
20120 parser
->translate_strings_p
= save_translate_strings_p
;
20122 /* We built up the list in reverse order. */
20123 return nreverse (attribute_list
);
20126 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20127 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20128 current value of the PEDANTIC flag, regardless of whether or not
20129 the `__extension__' keyword is present. The caller is responsible
20130 for restoring the value of the PEDANTIC flag. */
20133 cp_parser_extension_opt (cp_parser
* parser
, int* saved_pedantic
)
20135 /* Save the old value of the PEDANTIC flag. */
20136 *saved_pedantic
= pedantic
;
20138 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXTENSION
))
20140 /* Consume the `__extension__' token. */
20141 cp_lexer_consume_token (parser
->lexer
);
20142 /* We're not being pedantic while the `__extension__' keyword is
20152 /* Parse a label declaration.
20155 __label__ label-declarator-seq ;
20157 label-declarator-seq:
20158 identifier , label-declarator-seq
20162 cp_parser_label_declaration (cp_parser
* parser
)
20164 /* Look for the `__label__' keyword. */
20165 cp_parser_require_keyword (parser
, RID_LABEL
, RT_LABEL
);
20171 /* Look for an identifier. */
20172 identifier
= cp_parser_identifier (parser
);
20173 /* If we failed, stop. */
20174 if (identifier
== error_mark_node
)
20176 /* Declare it as a label. */
20177 finish_label_decl (identifier
);
20178 /* If the next token is a `;', stop. */
20179 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
20181 /* Look for the `,' separating the label declarations. */
20182 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
20185 /* Look for the final `;'. */
20186 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
20189 /* Support Functions */
20191 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20192 NAME should have one of the representations used for an
20193 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20194 is returned. If PARSER->SCOPE is a dependent type, then a
20195 SCOPE_REF is returned.
20197 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20198 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20199 was formed. Abstractly, such entities should not be passed to this
20200 function, because they do not need to be looked up, but it is
20201 simpler to check for this special case here, rather than at the
20204 In cases not explicitly covered above, this function returns a
20205 DECL, OVERLOAD, or baselink representing the result of the lookup.
20206 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20209 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20210 (e.g., "struct") that was used. In that case bindings that do not
20211 refer to types are ignored.
20213 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20216 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20219 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20222 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20223 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20224 NULL_TREE otherwise. */
20227 cp_parser_lookup_name (cp_parser
*parser
, tree name
,
20228 enum tag_types tag_type
,
20231 bool check_dependency
,
20232 tree
*ambiguous_decls
,
20233 location_t name_location
)
20237 tree object_type
= parser
->context
->object_type
;
20239 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
20240 flags
|= LOOKUP_COMPLAIN
;
20242 /* Assume that the lookup will be unambiguous. */
20243 if (ambiguous_decls
)
20244 *ambiguous_decls
= NULL_TREE
;
20246 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20247 no longer valid. Note that if we are parsing tentatively, and
20248 the parse fails, OBJECT_TYPE will be automatically restored. */
20249 parser
->context
->object_type
= NULL_TREE
;
20251 if (name
== error_mark_node
)
20252 return error_mark_node
;
20254 /* A template-id has already been resolved; there is no lookup to
20256 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
20258 if (BASELINK_P (name
))
20260 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name
))
20261 == TEMPLATE_ID_EXPR
);
20265 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20266 it should already have been checked to make sure that the name
20267 used matches the type being destroyed. */
20268 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
20272 /* Figure out to which type this destructor applies. */
20274 type
= parser
->scope
;
20275 else if (object_type
)
20276 type
= object_type
;
20278 type
= current_class_type
;
20279 /* If that's not a class type, there is no destructor. */
20280 if (!type
|| !CLASS_TYPE_P (type
))
20281 return error_mark_node
;
20282 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
20283 lazily_declare_fn (sfk_destructor
, type
);
20284 if (!CLASSTYPE_DESTRUCTORS (type
))
20285 return error_mark_node
;
20286 /* If it was a class type, return the destructor. */
20287 return CLASSTYPE_DESTRUCTORS (type
);
20290 /* By this point, the NAME should be an ordinary identifier. If
20291 the id-expression was a qualified name, the qualifying scope is
20292 stored in PARSER->SCOPE at this point. */
20293 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
20295 /* Perform the lookup. */
20300 if (parser
->scope
== error_mark_node
)
20301 return error_mark_node
;
20303 /* If the SCOPE is dependent, the lookup must be deferred until
20304 the template is instantiated -- unless we are explicitly
20305 looking up names in uninstantiated templates. Even then, we
20306 cannot look up the name if the scope is not a class type; it
20307 might, for example, be a template type parameter. */
20308 dependent_p
= (TYPE_P (parser
->scope
)
20309 && dependent_scope_p (parser
->scope
));
20310 if ((check_dependency
|| !CLASS_TYPE_P (parser
->scope
))
20312 /* Defer lookup. */
20313 decl
= error_mark_node
;
20316 tree pushed_scope
= NULL_TREE
;
20318 /* If PARSER->SCOPE is a dependent type, then it must be a
20319 class type, and we must not be checking dependencies;
20320 otherwise, we would have processed this lookup above. So
20321 that PARSER->SCOPE is not considered a dependent base by
20322 lookup_member, we must enter the scope here. */
20324 pushed_scope
= push_scope (parser
->scope
);
20326 /* If the PARSER->SCOPE is a template specialization, it
20327 may be instantiated during name lookup. In that case,
20328 errors may be issued. Even if we rollback the current
20329 tentative parse, those errors are valid. */
20330 decl
= lookup_qualified_name (parser
->scope
, name
,
20331 tag_type
!= none_type
,
20332 /*complain=*/true);
20334 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20335 lookup result and the nested-name-specifier nominates a class C:
20336 * if the name specified after the nested-name-specifier, when
20337 looked up in C, is the injected-class-name of C (Clause 9), or
20338 * if the name specified after the nested-name-specifier is the
20339 same as the identifier or the simple-template-id's template-
20340 name in the last component of the nested-name-specifier,
20341 the name is instead considered to name the constructor of
20342 class C. [ Note: for example, the constructor is not an
20343 acceptable lookup result in an elaborated-type-specifier so
20344 the constructor would not be used in place of the
20345 injected-class-name. --end note ] Such a constructor name
20346 shall be used only in the declarator-id of a declaration that
20347 names a constructor or in a using-declaration. */
20348 if (tag_type
== none_type
20349 && DECL_SELF_REFERENCE_P (decl
)
20350 && same_type_p (DECL_CONTEXT (decl
), parser
->scope
))
20351 decl
= lookup_qualified_name (parser
->scope
, ctor_identifier
,
20352 tag_type
!= none_type
,
20353 /*complain=*/true);
20355 /* If we have a single function from a using decl, pull it out. */
20356 if (TREE_CODE (decl
) == OVERLOAD
20357 && !really_overloaded_fn (decl
))
20358 decl
= OVL_FUNCTION (decl
);
20361 pop_scope (pushed_scope
);
20364 /* If the scope is a dependent type and either we deferred lookup or
20365 we did lookup but didn't find the name, rememeber the name. */
20366 if (decl
== error_mark_node
&& TYPE_P (parser
->scope
)
20367 && dependent_type_p (parser
->scope
))
20373 /* The resolution to Core Issue 180 says that `struct
20374 A::B' should be considered a type-name, even if `A'
20376 type
= make_typename_type (parser
->scope
, name
, tag_type
,
20377 /*complain=*/tf_error
);
20378 decl
= TYPE_NAME (type
);
20380 else if (is_template
20381 && (cp_parser_next_token_ends_template_argument_p (parser
)
20382 || cp_lexer_next_token_is (parser
->lexer
,
20384 decl
= make_unbound_class_template (parser
->scope
,
20386 /*complain=*/tf_error
);
20388 decl
= build_qualified_name (/*type=*/NULL_TREE
,
20389 parser
->scope
, name
,
20392 parser
->qualifying_scope
= parser
->scope
;
20393 parser
->object_scope
= NULL_TREE
;
20395 else if (object_type
)
20397 tree object_decl
= NULL_TREE
;
20398 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20399 OBJECT_TYPE is not a class. */
20400 if (CLASS_TYPE_P (object_type
))
20401 /* If the OBJECT_TYPE is a template specialization, it may
20402 be instantiated during name lookup. In that case, errors
20403 may be issued. Even if we rollback the current tentative
20404 parse, those errors are valid. */
20405 object_decl
= lookup_member (object_type
,
20408 tag_type
!= none_type
,
20409 tf_warning_or_error
);
20410 /* Look it up in the enclosing context, too. */
20411 decl
= lookup_name_real (name
, tag_type
!= none_type
,
20413 /*block_p=*/true, is_namespace
, flags
);
20414 parser
->object_scope
= object_type
;
20415 parser
->qualifying_scope
= NULL_TREE
;
20417 decl
= object_decl
;
20421 decl
= lookup_name_real (name
, tag_type
!= none_type
,
20423 /*block_p=*/true, is_namespace
, flags
);
20424 parser
->qualifying_scope
= NULL_TREE
;
20425 parser
->object_scope
= NULL_TREE
;
20428 /* If the lookup failed, let our caller know. */
20429 if (!decl
|| decl
== error_mark_node
)
20430 return error_mark_node
;
20432 /* Pull out the template from an injected-class-name (or multiple). */
20434 decl
= maybe_get_template_decl_from_type_decl (decl
);
20436 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20437 if (TREE_CODE (decl
) == TREE_LIST
)
20439 if (ambiguous_decls
)
20440 *ambiguous_decls
= decl
;
20441 /* The error message we have to print is too complicated for
20442 cp_parser_error, so we incorporate its actions directly. */
20443 if (!cp_parser_simulate_error (parser
))
20445 error_at (name_location
, "reference to %qD is ambiguous",
20447 print_candidates (decl
);
20449 return error_mark_node
;
20452 gcc_assert (DECL_P (decl
)
20453 || TREE_CODE (decl
) == OVERLOAD
20454 || TREE_CODE (decl
) == SCOPE_REF
20455 || TREE_CODE (decl
) == UNBOUND_CLASS_TEMPLATE
20456 || BASELINK_P (decl
));
20458 /* If we have resolved the name of a member declaration, check to
20459 see if the declaration is accessible. When the name resolves to
20460 set of overloaded functions, accessibility is checked when
20461 overload resolution is done.
20463 During an explicit instantiation, access is not checked at all,
20464 as per [temp.explicit]. */
20466 check_accessibility_of_qualified_id (decl
, object_type
, parser
->scope
);
20468 maybe_record_typedef_use (decl
);
20473 /* Like cp_parser_lookup_name, but for use in the typical case where
20474 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20475 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20478 cp_parser_lookup_name_simple (cp_parser
* parser
, tree name
, location_t location
)
20480 return cp_parser_lookup_name (parser
, name
,
20482 /*is_template=*/false,
20483 /*is_namespace=*/false,
20484 /*check_dependency=*/true,
20485 /*ambiguous_decls=*/NULL
,
20489 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20490 the current context, return the TYPE_DECL. If TAG_NAME_P is
20491 true, the DECL indicates the class being defined in a class-head,
20492 or declared in an elaborated-type-specifier.
20494 Otherwise, return DECL. */
20497 cp_parser_maybe_treat_template_as_class (tree decl
, bool tag_name_p
)
20499 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20500 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20503 template <typename T> struct B;
20506 template <typename T> struct A::B {};
20508 Similarly, in an elaborated-type-specifier:
20510 namespace N { struct X{}; }
20513 template <typename T> friend struct N::X;
20516 However, if the DECL refers to a class type, and we are in
20517 the scope of the class, then the name lookup automatically
20518 finds the TYPE_DECL created by build_self_reference rather
20519 than a TEMPLATE_DECL. For example, in:
20521 template <class T> struct S {
20525 there is no need to handle such case. */
20527 if (DECL_CLASS_TEMPLATE_P (decl
) && tag_name_p
)
20528 return DECL_TEMPLATE_RESULT (decl
);
20533 /* If too many, or too few, template-parameter lists apply to the
20534 declarator, issue an error message. Returns TRUE if all went well,
20535 and FALSE otherwise. */
20538 cp_parser_check_declarator_template_parameters (cp_parser
* parser
,
20539 cp_declarator
*declarator
,
20540 location_t declarator_location
)
20542 unsigned num_templates
;
20544 /* We haven't seen any classes that involve template parameters yet. */
20547 switch (declarator
->kind
)
20550 if (declarator
->u
.id
.qualifying_scope
)
20554 scope
= declarator
->u
.id
.qualifying_scope
;
20556 while (scope
&& CLASS_TYPE_P (scope
))
20558 /* You're supposed to have one `template <...>'
20559 for every template class, but you don't need one
20560 for a full specialization. For example:
20562 template <class T> struct S{};
20563 template <> struct S<int> { void f(); };
20564 void S<int>::f () {}
20566 is correct; there shouldn't be a `template <>' for
20567 the definition of `S<int>::f'. */
20568 if (!CLASSTYPE_TEMPLATE_INFO (scope
))
20569 /* If SCOPE does not have template information of any
20570 kind, then it is not a template, nor is it nested
20571 within a template. */
20573 if (explicit_class_specialization_p (scope
))
20575 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
)))
20578 scope
= TYPE_CONTEXT (scope
);
20581 else if (TREE_CODE (declarator
->u
.id
.unqualified_name
)
20582 == TEMPLATE_ID_EXPR
)
20583 /* If the DECLARATOR has the form `X<y>' then it uses one
20584 additional level of template parameters. */
20587 return cp_parser_check_template_parameters
20588 (parser
, num_templates
, declarator_location
, declarator
);
20594 case cdk_reference
:
20596 return (cp_parser_check_declarator_template_parameters
20597 (parser
, declarator
->declarator
, declarator_location
));
20603 gcc_unreachable ();
20608 /* NUM_TEMPLATES were used in the current declaration. If that is
20609 invalid, return FALSE and issue an error messages. Otherwise,
20610 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20611 declarator and we can print more accurate diagnostics. */
20614 cp_parser_check_template_parameters (cp_parser
* parser
,
20615 unsigned num_templates
,
20616 location_t location
,
20617 cp_declarator
*declarator
)
20619 /* If there are the same number of template classes and parameter
20620 lists, that's OK. */
20621 if (parser
->num_template_parameter_lists
== num_templates
)
20623 /* If there are more, but only one more, then we are referring to a
20624 member template. That's OK too. */
20625 if (parser
->num_template_parameter_lists
== num_templates
+ 1)
20627 /* If there are more template classes than parameter lists, we have
20630 template <class T> void S<T>::R<T>::f (); */
20631 if (parser
->num_template_parameter_lists
< num_templates
)
20633 if (declarator
&& !current_function_decl
)
20634 error_at (location
, "specializing member %<%T::%E%> "
20635 "requires %<template<>%> syntax",
20636 declarator
->u
.id
.qualifying_scope
,
20637 declarator
->u
.id
.unqualified_name
);
20638 else if (declarator
)
20639 error_at (location
, "invalid declaration of %<%T::%E%>",
20640 declarator
->u
.id
.qualifying_scope
,
20641 declarator
->u
.id
.unqualified_name
);
20643 error_at (location
, "too few template-parameter-lists");
20646 /* Otherwise, there are too many template parameter lists. We have
20649 template <class T> template <class U> void S::f(); */
20650 error_at (location
, "too many template-parameter-lists");
20654 /* Parse an optional `::' token indicating that the following name is
20655 from the global namespace. If so, PARSER->SCOPE is set to the
20656 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20657 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20658 Returns the new value of PARSER->SCOPE, if the `::' token is
20659 present, and NULL_TREE otherwise. */
20662 cp_parser_global_scope_opt (cp_parser
* parser
, bool current_scope_valid_p
)
20666 /* Peek at the next token. */
20667 token
= cp_lexer_peek_token (parser
->lexer
);
20668 /* If we're looking at a `::' token then we're starting from the
20669 global namespace, not our current location. */
20670 if (token
->type
== CPP_SCOPE
)
20672 /* Consume the `::' token. */
20673 cp_lexer_consume_token (parser
->lexer
);
20674 /* Set the SCOPE so that we know where to start the lookup. */
20675 parser
->scope
= global_namespace
;
20676 parser
->qualifying_scope
= global_namespace
;
20677 parser
->object_scope
= NULL_TREE
;
20679 return parser
->scope
;
20681 else if (!current_scope_valid_p
)
20683 parser
->scope
= NULL_TREE
;
20684 parser
->qualifying_scope
= NULL_TREE
;
20685 parser
->object_scope
= NULL_TREE
;
20691 /* Returns TRUE if the upcoming token sequence is the start of a
20692 constructor declarator. If FRIEND_P is true, the declarator is
20693 preceded by the `friend' specifier. */
20696 cp_parser_constructor_declarator_p (cp_parser
*parser
, bool friend_p
)
20698 bool constructor_p
;
20699 tree nested_name_specifier
;
20700 cp_token
*next_token
;
20702 /* The common case is that this is not a constructor declarator, so
20703 try to avoid doing lots of work if at all possible. It's not
20704 valid declare a constructor at function scope. */
20705 if (parser
->in_function_body
)
20707 /* And only certain tokens can begin a constructor declarator. */
20708 next_token
= cp_lexer_peek_token (parser
->lexer
);
20709 if (next_token
->type
!= CPP_NAME
20710 && next_token
->type
!= CPP_SCOPE
20711 && next_token
->type
!= CPP_NESTED_NAME_SPECIFIER
20712 && next_token
->type
!= CPP_TEMPLATE_ID
)
20715 /* Parse tentatively; we are going to roll back all of the tokens
20717 cp_parser_parse_tentatively (parser
);
20718 /* Assume that we are looking at a constructor declarator. */
20719 constructor_p
= true;
20721 /* Look for the optional `::' operator. */
20722 cp_parser_global_scope_opt (parser
,
20723 /*current_scope_valid_p=*/false);
20724 /* Look for the nested-name-specifier. */
20725 nested_name_specifier
20726 = (cp_parser_nested_name_specifier_opt (parser
,
20727 /*typename_keyword_p=*/false,
20728 /*check_dependency_p=*/false,
20730 /*is_declaration=*/false));
20731 /* Outside of a class-specifier, there must be a
20732 nested-name-specifier. */
20733 if (!nested_name_specifier
&&
20734 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type
)
20736 constructor_p
= false;
20737 else if (nested_name_specifier
== error_mark_node
)
20738 constructor_p
= false;
20740 /* If we have a class scope, this is easy; DR 147 says that S::S always
20741 names the constructor, and no other qualified name could. */
20742 if (constructor_p
&& nested_name_specifier
20743 && CLASS_TYPE_P (nested_name_specifier
))
20745 tree id
= cp_parser_unqualified_id (parser
,
20746 /*template_keyword_p=*/false,
20747 /*check_dependency_p=*/false,
20748 /*declarator_p=*/true,
20749 /*optional_p=*/false);
20750 if (is_overloaded_fn (id
))
20751 id
= DECL_NAME (get_first_fn (id
));
20752 if (!constructor_name_p (id
, nested_name_specifier
))
20753 constructor_p
= false;
20755 /* If we still think that this might be a constructor-declarator,
20756 look for a class-name. */
20757 else if (constructor_p
)
20761 template <typename T> struct S {
20765 we must recognize that the nested `S' names a class. */
20767 type_decl
= cp_parser_class_name (parser
,
20768 /*typename_keyword_p=*/false,
20769 /*template_keyword_p=*/false,
20771 /*check_dependency_p=*/false,
20772 /*class_head_p=*/false,
20773 /*is_declaration=*/false);
20774 /* If there was no class-name, then this is not a constructor. */
20775 constructor_p
= !cp_parser_error_occurred (parser
);
20777 /* If we're still considering a constructor, we have to see a `(',
20778 to begin the parameter-declaration-clause, followed by either a
20779 `)', an `...', or a decl-specifier. We need to check for a
20780 type-specifier to avoid being fooled into thinking that:
20784 is a constructor. (It is actually a function named `f' that
20785 takes one parameter (of type `int') and returns a value of type
20788 && !cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
20789 constructor_p
= false;
20792 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
20793 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
)
20794 /* A parameter declaration begins with a decl-specifier,
20795 which is either the "attribute" keyword, a storage class
20796 specifier, or (usually) a type-specifier. */
20797 && !cp_lexer_next_token_is_decl_specifier_keyword (parser
->lexer
))
20800 tree pushed_scope
= NULL_TREE
;
20801 unsigned saved_num_template_parameter_lists
;
20803 /* Names appearing in the type-specifier should be looked up
20804 in the scope of the class. */
20805 if (current_class_type
)
20809 type
= TREE_TYPE (type_decl
);
20810 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20812 type
= resolve_typename_type (type
,
20813 /*only_current_p=*/false);
20814 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20816 cp_parser_abort_tentative_parse (parser
);
20820 pushed_scope
= push_scope (type
);
20823 /* Inside the constructor parameter list, surrounding
20824 template-parameter-lists do not apply. */
20825 saved_num_template_parameter_lists
20826 = parser
->num_template_parameter_lists
;
20827 parser
->num_template_parameter_lists
= 0;
20829 /* Look for the type-specifier. */
20830 cp_parser_type_specifier (parser
,
20831 CP_PARSER_FLAGS_NONE
,
20832 /*decl_specs=*/NULL
,
20833 /*is_declarator=*/true,
20834 /*declares_class_or_enum=*/NULL
,
20835 /*is_cv_qualifier=*/NULL
);
20837 parser
->num_template_parameter_lists
20838 = saved_num_template_parameter_lists
;
20840 /* Leave the scope of the class. */
20842 pop_scope (pushed_scope
);
20844 constructor_p
= !cp_parser_error_occurred (parser
);
20848 /* We did not really want to consume any tokens. */
20849 cp_parser_abort_tentative_parse (parser
);
20851 return constructor_p
;
20854 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20855 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20856 they must be performed once we are in the scope of the function.
20858 Returns the function defined. */
20861 cp_parser_function_definition_from_specifiers_and_declarator
20862 (cp_parser
* parser
,
20863 cp_decl_specifier_seq
*decl_specifiers
,
20865 const cp_declarator
*declarator
)
20870 /* Begin the function-definition. */
20871 success_p
= start_function (decl_specifiers
, declarator
, attributes
);
20873 /* The things we're about to see are not directly qualified by any
20874 template headers we've seen thus far. */
20875 reset_specialization ();
20877 /* If there were names looked up in the decl-specifier-seq that we
20878 did not check, check them now. We must wait until we are in the
20879 scope of the function to perform the checks, since the function
20880 might be a friend. */
20881 perform_deferred_access_checks ();
20885 /* Skip the entire function. */
20886 cp_parser_skip_to_end_of_block_or_statement (parser
);
20887 fn
= error_mark_node
;
20889 else if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
20891 /* Seen already, skip it. An error message has already been output. */
20892 cp_parser_skip_to_end_of_block_or_statement (parser
);
20893 fn
= current_function_decl
;
20894 current_function_decl
= NULL_TREE
;
20895 /* If this is a function from a class, pop the nested class. */
20896 if (current_class_name
)
20897 pop_nested_class ();
20902 if (DECL_DECLARED_INLINE_P (current_function_decl
))
20903 tv
= TV_PARSE_INLINE
;
20905 tv
= TV_PARSE_FUNC
;
20907 fn
= cp_parser_function_definition_after_declarator (parser
,
20908 /*inline_p=*/false);
20915 /* Parse the part of a function-definition that follows the
20916 declarator. INLINE_P is TRUE iff this function is an inline
20917 function defined within a class-specifier.
20919 Returns the function defined. */
20922 cp_parser_function_definition_after_declarator (cp_parser
* parser
,
20926 bool ctor_initializer_p
= false;
20927 bool saved_in_unbraced_linkage_specification_p
;
20928 bool saved_in_function_body
;
20929 unsigned saved_num_template_parameter_lists
;
20932 saved_in_function_body
= parser
->in_function_body
;
20933 parser
->in_function_body
= true;
20934 /* If the next token is `return', then the code may be trying to
20935 make use of the "named return value" extension that G++ used to
20937 token
= cp_lexer_peek_token (parser
->lexer
);
20938 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_RETURN
))
20940 /* Consume the `return' keyword. */
20941 cp_lexer_consume_token (parser
->lexer
);
20942 /* Look for the identifier that indicates what value is to be
20944 cp_parser_identifier (parser
);
20945 /* Issue an error message. */
20946 error_at (token
->location
,
20947 "named return values are no longer supported");
20948 /* Skip tokens until we reach the start of the function body. */
20951 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
20952 if (token
->type
== CPP_OPEN_BRACE
20953 || token
->type
== CPP_EOF
20954 || token
->type
== CPP_PRAGMA_EOL
)
20956 cp_lexer_consume_token (parser
->lexer
);
20959 /* The `extern' in `extern "C" void f () { ... }' does not apply to
20960 anything declared inside `f'. */
20961 saved_in_unbraced_linkage_specification_p
20962 = parser
->in_unbraced_linkage_specification_p
;
20963 parser
->in_unbraced_linkage_specification_p
= false;
20964 /* Inside the function, surrounding template-parameter-lists do not
20966 saved_num_template_parameter_lists
20967 = parser
->num_template_parameter_lists
;
20968 parser
->num_template_parameter_lists
= 0;
20970 start_lambda_scope (current_function_decl
);
20972 /* If the next token is `try', `__transaction_atomic', or
20973 `__transaction_relaxed`, then we are looking at either function-try-block
20974 or function-transaction-block. Note that all of these include the
20976 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRANSACTION_ATOMIC
))
20977 ctor_initializer_p
= cp_parser_function_transaction (parser
,
20978 RID_TRANSACTION_ATOMIC
);
20979 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
20980 RID_TRANSACTION_RELAXED
))
20981 ctor_initializer_p
= cp_parser_function_transaction (parser
,
20982 RID_TRANSACTION_RELAXED
);
20983 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
20984 ctor_initializer_p
= cp_parser_function_try_block (parser
);
20987 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
20989 finish_lambda_scope ();
20991 /* Finish the function. */
20992 fn
= finish_function ((ctor_initializer_p
? 1 : 0) |
20993 (inline_p
? 2 : 0));
20994 /* Generate code for it, if necessary. */
20995 expand_or_defer_fn (fn
);
20996 /* Restore the saved values. */
20997 parser
->in_unbraced_linkage_specification_p
20998 = saved_in_unbraced_linkage_specification_p
;
20999 parser
->num_template_parameter_lists
21000 = saved_num_template_parameter_lists
;
21001 parser
->in_function_body
= saved_in_function_body
;
21006 /* Parse a template-declaration, assuming that the `export' (and
21007 `extern') keywords, if present, has already been scanned. MEMBER_P
21008 is as for cp_parser_template_declaration. */
21011 cp_parser_template_declaration_after_export (cp_parser
* parser
, bool member_p
)
21013 tree decl
= NULL_TREE
;
21014 VEC (deferred_access_check
,gc
) *checks
;
21015 tree parameter_list
;
21016 bool friend_p
= false;
21017 bool need_lang_pop
;
21020 /* Look for the `template' keyword. */
21021 token
= cp_lexer_peek_token (parser
->lexer
);
21022 if (!cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
))
21026 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
21028 if (at_class_scope_p () && current_function_decl
)
21030 /* 14.5.2.2 [temp.mem]
21032 A local class shall not have member templates. */
21033 error_at (token
->location
,
21034 "invalid declaration of member template in local class");
21035 cp_parser_skip_to_end_of_block_or_statement (parser
);
21040 A template ... shall not have C linkage. */
21041 if (current_lang_name
== lang_name_c
)
21043 error_at (token
->location
, "template with C linkage");
21044 /* Give it C++ linkage to avoid confusing other parts of the
21046 push_lang_context (lang_name_cplusplus
);
21047 need_lang_pop
= true;
21050 need_lang_pop
= false;
21052 /* We cannot perform access checks on the template parameter
21053 declarations until we know what is being declared, just as we
21054 cannot check the decl-specifier list. */
21055 push_deferring_access_checks (dk_deferred
);
21057 /* If the next token is `>', then we have an invalid
21058 specialization. Rather than complain about an invalid template
21059 parameter, issue an error message here. */
21060 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
))
21062 cp_parser_error (parser
, "invalid explicit specialization");
21063 begin_specialization ();
21064 parameter_list
= NULL_TREE
;
21068 /* Parse the template parameters. */
21069 parameter_list
= cp_parser_template_parameter_list (parser
);
21070 fixup_template_parms ();
21073 /* Get the deferred access checks from the parameter list. These
21074 will be checked once we know what is being declared, as for a
21075 member template the checks must be performed in the scope of the
21076 class containing the member. */
21077 checks
= get_deferred_access_checks ();
21079 /* Look for the `>'. */
21080 cp_parser_skip_to_end_of_template_parameter_list (parser
);
21081 /* We just processed one more parameter list. */
21082 ++parser
->num_template_parameter_lists
;
21083 /* If the next token is `template', there are more template
21085 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
21087 cp_parser_template_declaration_after_export (parser
, member_p
);
21088 else if (cxx_dialect
>= cxx0x
21089 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
21090 decl
= cp_parser_alias_declaration (parser
);
21093 /* There are no access checks when parsing a template, as we do not
21094 know if a specialization will be a friend. */
21095 push_deferring_access_checks (dk_no_check
);
21096 token
= cp_lexer_peek_token (parser
->lexer
);
21097 decl
= cp_parser_single_declaration (parser
,
21100 /*explicit_specialization_p=*/false,
21102 pop_deferring_access_checks ();
21104 /* If this is a member template declaration, let the front
21106 if (member_p
&& !friend_p
&& decl
)
21108 if (TREE_CODE (decl
) == TYPE_DECL
)
21109 cp_parser_check_access_in_redeclaration (decl
, token
->location
);
21111 decl
= finish_member_template_decl (decl
);
21113 else if (friend_p
&& decl
&& TREE_CODE (decl
) == TYPE_DECL
)
21114 make_friend_class (current_class_type
, TREE_TYPE (decl
),
21115 /*complain=*/true);
21117 /* We are done with the current parameter list. */
21118 --parser
->num_template_parameter_lists
;
21120 pop_deferring_access_checks ();
21123 finish_template_decl (parameter_list
);
21125 /* Check the template arguments for a literal operator template. */
21127 && (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_FUNCTION_TEMPLATE_P (decl
))
21128 && UDLIT_OPER_P (DECL_NAME (decl
)))
21131 if (parameter_list
== NULL_TREE
)
21135 int num_parms
= TREE_VEC_LENGTH (parameter_list
);
21136 if (num_parms
!= 1)
21140 tree parm_list
= TREE_VEC_ELT (parameter_list
, 0);
21141 tree parm
= INNERMOST_TEMPLATE_PARMS (parm_list
);
21142 if (TREE_TYPE (parm
) != char_type_node
21143 || !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
21148 error ("literal operator template %qD has invalid parameter list."
21149 " Expected non-type template argument pack <char...>",
21152 /* Register member declarations. */
21153 if (member_p
&& !friend_p
&& decl
&& !DECL_CLASS_TEMPLATE_P (decl
))
21154 finish_member_declaration (decl
);
21155 /* For the erroneous case of a template with C linkage, we pushed an
21156 implicit C++ linkage scope; exit that scope now. */
21158 pop_lang_context ();
21159 /* If DECL is a function template, we must return to parse it later.
21160 (Even though there is no definition, there might be default
21161 arguments that need handling.) */
21162 if (member_p
&& decl
21163 && (TREE_CODE (decl
) == FUNCTION_DECL
21164 || DECL_FUNCTION_TEMPLATE_P (decl
)))
21165 VEC_safe_push (tree
, gc
, unparsed_funs_with_definitions
, decl
);
21168 /* Perform the deferred access checks from a template-parameter-list.
21169 CHECKS is a TREE_LIST of access checks, as returned by
21170 get_deferred_access_checks. */
21173 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check
,gc
)* checks
)
21175 ++processing_template_parmlist
;
21176 perform_access_checks (checks
);
21177 --processing_template_parmlist
;
21180 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21181 `function-definition' sequence. MEMBER_P is true, this declaration
21182 appears in a class scope.
21184 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21185 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21188 cp_parser_single_declaration (cp_parser
* parser
,
21189 VEC (deferred_access_check
,gc
)* checks
,
21191 bool explicit_specialization_p
,
21194 int declares_class_or_enum
;
21195 tree decl
= NULL_TREE
;
21196 cp_decl_specifier_seq decl_specifiers
;
21197 bool function_definition_p
= false;
21198 cp_token
*decl_spec_token_start
;
21200 /* This function is only used when processing a template
21202 gcc_assert (innermost_scope_kind () == sk_template_parms
21203 || innermost_scope_kind () == sk_template_spec
);
21205 /* Defer access checks until we know what is being declared. */
21206 push_deferring_access_checks (dk_deferred
);
21208 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21210 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
21211 cp_parser_decl_specifier_seq (parser
,
21212 CP_PARSER_FLAGS_OPTIONAL
,
21214 &declares_class_or_enum
);
21216 *friend_p
= cp_parser_friend_p (&decl_specifiers
);
21218 /* There are no template typedefs. */
21219 if (decl_specifiers
.specs
[(int) ds_typedef
])
21221 error_at (decl_spec_token_start
->location
,
21222 "template declaration of %<typedef%>");
21223 decl
= error_mark_node
;
21226 /* Gather up the access checks that occurred the
21227 decl-specifier-seq. */
21228 stop_deferring_access_checks ();
21230 /* Check for the declaration of a template class. */
21231 if (declares_class_or_enum
)
21233 if (cp_parser_declares_only_class_p (parser
))
21235 decl
= shadow_tag (&decl_specifiers
);
21240 friend template <typename T> struct A<T>::B;
21243 A<T>::B will be represented by a TYPENAME_TYPE, and
21244 therefore not recognized by shadow_tag. */
21245 if (friend_p
&& *friend_p
21247 && decl_specifiers
.type
21248 && TYPE_P (decl_specifiers
.type
))
21249 decl
= decl_specifiers
.type
;
21251 if (decl
&& decl
!= error_mark_node
)
21252 decl
= TYPE_NAME (decl
);
21254 decl
= error_mark_node
;
21256 /* Perform access checks for template parameters. */
21257 cp_parser_perform_template_parameter_access_checks (checks
);
21261 /* Complain about missing 'typename' or other invalid type names. */
21262 if (!decl_specifiers
.any_type_specifiers_p
21263 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
21265 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21266 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21267 the rest of this declaration. */
21268 decl
= error_mark_node
;
21272 /* If it's not a template class, try for a template function. If
21273 the next token is a `;', then this declaration does not declare
21274 anything. But, if there were errors in the decl-specifiers, then
21275 the error might well have come from an attempted class-specifier.
21276 In that case, there's no need to warn about a missing declarator. */
21278 && (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
21279 || decl_specifiers
.type
!= error_mark_node
))
21281 decl
= cp_parser_init_declarator (parser
,
21284 /*function_definition_allowed_p=*/true,
21286 declares_class_or_enum
,
21287 &function_definition_p
,
21290 /* 7.1.1-1 [dcl.stc]
21292 A storage-class-specifier shall not be specified in an explicit
21293 specialization... */
21295 && explicit_specialization_p
21296 && decl_specifiers
.storage_class
!= sc_none
)
21298 error_at (decl_spec_token_start
->location
,
21299 "explicit template specialization cannot have a storage class");
21300 decl
= error_mark_node
;
21304 /* Look for a trailing `;' after the declaration. */
21305 if (!function_definition_p
21306 && (decl
== error_mark_node
21307 || !cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
)))
21308 cp_parser_skip_to_end_of_block_or_statement (parser
);
21311 pop_deferring_access_checks ();
21313 /* Clear any current qualification; whatever comes next is the start
21314 of something new. */
21315 parser
->scope
= NULL_TREE
;
21316 parser
->qualifying_scope
= NULL_TREE
;
21317 parser
->object_scope
= NULL_TREE
;
21322 /* Parse a cast-expression that is not the operand of a unary "&". */
21325 cp_parser_simple_cast_expression (cp_parser
*parser
)
21327 return cp_parser_cast_expression (parser
, /*address_p=*/false,
21328 /*cast_p=*/false, NULL
);
21331 /* Parse a functional cast to TYPE. Returns an expression
21332 representing the cast. */
21335 cp_parser_functional_cast (cp_parser
* parser
, tree type
)
21338 tree expression_list
;
21342 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
21344 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
21345 expression_list
= cp_parser_braced_list (parser
, &nonconst_p
);
21346 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
21347 if (TREE_CODE (type
) == TYPE_DECL
)
21348 type
= TREE_TYPE (type
);
21349 return finish_compound_literal (type
, expression_list
,
21350 tf_warning_or_error
);
21354 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
21356 /*allow_expansion_p=*/true,
21357 /*non_constant_p=*/NULL
);
21359 expression_list
= error_mark_node
;
21362 expression_list
= build_tree_list_vec (vec
);
21363 release_tree_vector (vec
);
21366 cast
= build_functional_cast (type
, expression_list
,
21367 tf_warning_or_error
);
21368 /* [expr.const]/1: In an integral constant expression "only type
21369 conversions to integral or enumeration type can be used". */
21370 if (TREE_CODE (type
) == TYPE_DECL
)
21371 type
= TREE_TYPE (type
);
21372 if (cast
!= error_mark_node
21373 && !cast_valid_in_integral_constant_expression_p (type
)
21374 && cp_parser_non_integral_constant_expression (parser
,
21376 return error_mark_node
;
21380 /* Save the tokens that make up the body of a member function defined
21381 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21382 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21383 specifiers applied to the declaration. Returns the FUNCTION_DECL
21384 for the member function. */
21387 cp_parser_save_member_function_body (cp_parser
* parser
,
21388 cp_decl_specifier_seq
*decl_specifiers
,
21389 cp_declarator
*declarator
,
21396 /* Create the FUNCTION_DECL. */
21397 fn
= grokmethod (decl_specifiers
, declarator
, attributes
);
21398 /* If something went badly wrong, bail out now. */
21399 if (fn
== error_mark_node
)
21401 /* If there's a function-body, skip it. */
21402 if (cp_parser_token_starts_function_definition_p
21403 (cp_lexer_peek_token (parser
->lexer
)))
21404 cp_parser_skip_to_end_of_block_or_statement (parser
);
21405 return error_mark_node
;
21408 /* Remember it, if there default args to post process. */
21409 cp_parser_save_default_args (parser
, fn
);
21411 /* Save away the tokens that make up the body of the
21413 first
= parser
->lexer
->next_token
;
21414 /* We can have braced-init-list mem-initializers before the fn body. */
21415 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
21417 cp_lexer_consume_token (parser
->lexer
);
21418 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
21419 && cp_lexer_next_token_is_not_keyword (parser
->lexer
, RID_TRY
))
21421 /* cache_group will stop after an un-nested { } pair, too. */
21422 if (cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, /*depth=*/0))
21425 /* variadic mem-inits have ... after the ')'. */
21426 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
21427 cp_lexer_consume_token (parser
->lexer
);
21430 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
21431 /* Handle function try blocks. */
21432 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CATCH
))
21433 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
21434 last
= parser
->lexer
->next_token
;
21436 /* Save away the inline definition; we will process it when the
21437 class is complete. */
21438 DECL_PENDING_INLINE_INFO (fn
) = cp_token_cache_new (first
, last
);
21439 DECL_PENDING_INLINE_P (fn
) = 1;
21441 /* We need to know that this was defined in the class, so that
21442 friend templates are handled correctly. */
21443 DECL_INITIALIZED_IN_CLASS_P (fn
) = 1;
21445 /* Add FN to the queue of functions to be parsed later. */
21446 VEC_safe_push (tree
, gc
, unparsed_funs_with_definitions
, fn
);
21451 /* Save the tokens that make up the in-class initializer for a non-static
21452 data member. Returns a DEFAULT_ARG. */
21455 cp_parser_save_nsdmi (cp_parser
* parser
)
21457 /* Save away the tokens that make up the body of the
21459 cp_token
*first
= parser
->lexer
->next_token
;
21463 /* Save tokens until the next comma or semicolon. */
21464 cp_parser_cache_group (parser
, CPP_COMMA
, /*depth=*/0);
21466 last
= parser
->lexer
->next_token
;
21468 node
= make_node (DEFAULT_ARG
);
21469 DEFARG_TOKENS (node
) = cp_token_cache_new (first
, last
);
21470 DEFARG_INSTANTIATIONS (node
) = NULL
;
21476 /* Parse a template-argument-list, as well as the trailing ">" (but
21477 not the opening "<"). See cp_parser_template_argument_list for the
21481 cp_parser_enclosed_template_argument_list (cp_parser
* parser
)
21485 tree saved_qualifying_scope
;
21486 tree saved_object_scope
;
21487 bool saved_greater_than_is_operator_p
;
21488 int saved_unevaluated_operand
;
21489 int saved_inhibit_evaluation_warnings
;
21493 When parsing a template-id, the first non-nested `>' is taken as
21494 the end of the template-argument-list rather than a greater-than
21496 saved_greater_than_is_operator_p
21497 = parser
->greater_than_is_operator_p
;
21498 parser
->greater_than_is_operator_p
= false;
21499 /* Parsing the argument list may modify SCOPE, so we save it
21501 saved_scope
= parser
->scope
;
21502 saved_qualifying_scope
= parser
->qualifying_scope
;
21503 saved_object_scope
= parser
->object_scope
;
21504 /* We need to evaluate the template arguments, even though this
21505 template-id may be nested within a "sizeof". */
21506 saved_unevaluated_operand
= cp_unevaluated_operand
;
21507 cp_unevaluated_operand
= 0;
21508 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21509 c_inhibit_evaluation_warnings
= 0;
21510 /* Parse the template-argument-list itself. */
21511 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
)
21512 || cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
21513 arguments
= NULL_TREE
;
21515 arguments
= cp_parser_template_argument_list (parser
);
21516 /* Look for the `>' that ends the template-argument-list. If we find
21517 a '>>' instead, it's probably just a typo. */
21518 if (cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
21520 if (cxx_dialect
!= cxx98
)
21522 /* In C++0x, a `>>' in a template argument list or cast
21523 expression is considered to be two separate `>'
21524 tokens. So, change the current token to a `>', but don't
21525 consume it: it will be consumed later when the outer
21526 template argument list (or cast expression) is parsed.
21527 Note that this replacement of `>' for `>>' is necessary
21528 even if we are parsing tentatively: in the tentative
21529 case, after calling
21530 cp_parser_enclosed_template_argument_list we will always
21531 throw away all of the template arguments and the first
21532 closing `>', either because the template argument list
21533 was erroneous or because we are replacing those tokens
21534 with a CPP_TEMPLATE_ID token. The second `>' (which will
21535 not have been thrown away) is needed either to close an
21536 outer template argument list or to complete a new-style
21538 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21539 token
->type
= CPP_GREATER
;
21541 else if (!saved_greater_than_is_operator_p
)
21543 /* If we're in a nested template argument list, the '>>' has
21544 to be a typo for '> >'. We emit the error message, but we
21545 continue parsing and we push a '>' as next token, so that
21546 the argument list will be parsed correctly. Note that the
21547 global source location is still on the token before the
21548 '>>', so we need to say explicitly where we want it. */
21549 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21550 error_at (token
->location
, "%<>>%> should be %<> >%> "
21551 "within a nested template argument list");
21553 token
->type
= CPP_GREATER
;
21557 /* If this is not a nested template argument list, the '>>'
21558 is a typo for '>'. Emit an error message and continue.
21559 Same deal about the token location, but here we can get it
21560 right by consuming the '>>' before issuing the diagnostic. */
21561 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
21562 error_at (token
->location
,
21563 "spurious %<>>%>, use %<>%> to terminate "
21564 "a template argument list");
21568 cp_parser_skip_to_end_of_template_parameter_list (parser
);
21569 /* The `>' token might be a greater-than operator again now. */
21570 parser
->greater_than_is_operator_p
21571 = saved_greater_than_is_operator_p
;
21572 /* Restore the SAVED_SCOPE. */
21573 parser
->scope
= saved_scope
;
21574 parser
->qualifying_scope
= saved_qualifying_scope
;
21575 parser
->object_scope
= saved_object_scope
;
21576 cp_unevaluated_operand
= saved_unevaluated_operand
;
21577 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21582 /* MEMBER_FUNCTION is a member function, or a friend. If default
21583 arguments, or the body of the function have not yet been parsed,
21587 cp_parser_late_parsing_for_member (cp_parser
* parser
, tree member_function
)
21589 timevar_push (TV_PARSE_INMETH
);
21590 /* If this member is a template, get the underlying
21592 if (DECL_FUNCTION_TEMPLATE_P (member_function
))
21593 member_function
= DECL_TEMPLATE_RESULT (member_function
);
21595 /* There should not be any class definitions in progress at this
21596 point; the bodies of members are only parsed outside of all class
21598 gcc_assert (parser
->num_classes_being_defined
== 0);
21599 /* While we're parsing the member functions we might encounter more
21600 classes. We want to handle them right away, but we don't want
21601 them getting mixed up with functions that are currently in the
21603 push_unparsed_function_queues (parser
);
21605 /* Make sure that any template parameters are in scope. */
21606 maybe_begin_member_template_processing (member_function
);
21608 /* If the body of the function has not yet been parsed, parse it
21610 if (DECL_PENDING_INLINE_P (member_function
))
21612 tree function_scope
;
21613 cp_token_cache
*tokens
;
21615 /* The function is no longer pending; we are processing it. */
21616 tokens
= DECL_PENDING_INLINE_INFO (member_function
);
21617 DECL_PENDING_INLINE_INFO (member_function
) = NULL
;
21618 DECL_PENDING_INLINE_P (member_function
) = 0;
21620 /* If this is a local class, enter the scope of the containing
21622 function_scope
= current_function_decl
;
21623 if (function_scope
)
21624 push_function_context ();
21626 /* Push the body of the function onto the lexer stack. */
21627 cp_parser_push_lexer_for_tokens (parser
, tokens
);
21629 /* Let the front end know that we going to be defining this
21631 start_preparsed_function (member_function
, NULL_TREE
,
21632 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
21634 /* Don't do access checking if it is a templated function. */
21635 if (processing_template_decl
)
21636 push_deferring_access_checks (dk_no_check
);
21638 /* Now, parse the body of the function. */
21639 cp_parser_function_definition_after_declarator (parser
,
21640 /*inline_p=*/true);
21642 if (processing_template_decl
)
21643 pop_deferring_access_checks ();
21645 /* Leave the scope of the containing function. */
21646 if (function_scope
)
21647 pop_function_context ();
21648 cp_parser_pop_lexer (parser
);
21651 /* Remove any template parameters from the symbol table. */
21652 maybe_end_member_template_processing ();
21654 /* Restore the queue. */
21655 pop_unparsed_function_queues (parser
);
21656 timevar_pop (TV_PARSE_INMETH
);
21659 /* If DECL contains any default args, remember it on the unparsed
21660 functions queue. */
21663 cp_parser_save_default_args (cp_parser
* parser
, tree decl
)
21667 for (probe
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
21669 probe
= TREE_CHAIN (probe
))
21670 if (TREE_PURPOSE (probe
))
21672 cp_default_arg_entry
*entry
21673 = VEC_safe_push (cp_default_arg_entry
, gc
,
21674 unparsed_funs_with_default_args
, NULL
);
21675 entry
->class_type
= current_class_type
;
21676 entry
->decl
= decl
;
21681 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21682 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21683 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21684 from the parameter-type-list. */
21687 cp_parser_late_parse_one_default_arg (cp_parser
*parser
, tree decl
,
21688 tree default_arg
, tree parmtype
)
21690 cp_token_cache
*tokens
;
21694 /* Push the saved tokens for the default argument onto the parser's
21696 tokens
= DEFARG_TOKENS (default_arg
);
21697 cp_parser_push_lexer_for_tokens (parser
, tokens
);
21699 start_lambda_scope (decl
);
21701 /* Parse the default argument. */
21702 parsed_arg
= cp_parser_initializer (parser
, &dummy
, &dummy
);
21703 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg
))
21704 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
21706 finish_lambda_scope ();
21708 if (!processing_template_decl
)
21710 /* In a non-template class, check conversions now. In a template,
21711 we'll wait and instantiate these as needed. */
21712 if (TREE_CODE (decl
) == PARM_DECL
)
21713 parsed_arg
= check_default_argument (parmtype
, parsed_arg
);
21716 int flags
= LOOKUP_IMPLICIT
;
21717 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg
)
21718 && CONSTRUCTOR_IS_DIRECT_INIT (parsed_arg
))
21719 flags
= LOOKUP_NORMAL
;
21720 parsed_arg
= digest_init_flags (TREE_TYPE (decl
), parsed_arg
, flags
);
21724 /* If the token stream has not been completely used up, then
21725 there was extra junk after the end of the default
21727 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
21729 if (TREE_CODE (decl
) == PARM_DECL
)
21730 cp_parser_error (parser
, "expected %<,%>");
21732 cp_parser_error (parser
, "expected %<;%>");
21735 /* Revert to the main lexer. */
21736 cp_parser_pop_lexer (parser
);
21741 /* FIELD is a non-static data member with an initializer which we saved for
21742 later; parse it now. */
21745 cp_parser_late_parsing_nsdmi (cp_parser
*parser
, tree field
)
21749 push_unparsed_function_queues (parser
);
21750 def
= cp_parser_late_parse_one_default_arg (parser
, field
,
21751 DECL_INITIAL (field
),
21753 pop_unparsed_function_queues (parser
);
21755 DECL_INITIAL (field
) = def
;
21758 /* FN is a FUNCTION_DECL which may contains a parameter with an
21759 unparsed DEFAULT_ARG. Parse the default args now. This function
21760 assumes that the current scope is the scope in which the default
21761 argument should be processed. */
21764 cp_parser_late_parsing_default_args (cp_parser
*parser
, tree fn
)
21766 bool saved_local_variables_forbidden_p
;
21767 tree parm
, parmdecl
;
21769 /* While we're parsing the default args, we might (due to the
21770 statement expression extension) encounter more classes. We want
21771 to handle them right away, but we don't want them getting mixed
21772 up with default args that are currently in the queue. */
21773 push_unparsed_function_queues (parser
);
21775 /* Local variable names (and the `this' keyword) may not appear
21776 in a default argument. */
21777 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
21778 parser
->local_variables_forbidden_p
= true;
21780 push_defarg_context (fn
);
21782 for (parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
)),
21783 parmdecl
= DECL_ARGUMENTS (fn
);
21784 parm
&& parm
!= void_list_node
;
21785 parm
= TREE_CHAIN (parm
),
21786 parmdecl
= DECL_CHAIN (parmdecl
))
21788 tree default_arg
= TREE_PURPOSE (parm
);
21790 VEC(tree
,gc
) *insts
;
21797 if (TREE_CODE (default_arg
) != DEFAULT_ARG
)
21798 /* This can happen for a friend declaration for a function
21799 already declared with default arguments. */
21803 = cp_parser_late_parse_one_default_arg (parser
, parmdecl
,
21805 TREE_VALUE (parm
));
21806 if (parsed_arg
== error_mark_node
)
21811 TREE_PURPOSE (parm
) = parsed_arg
;
21813 /* Update any instantiations we've already created. */
21814 for (insts
= DEFARG_INSTANTIATIONS (default_arg
), ix
= 0;
21815 VEC_iterate (tree
, insts
, ix
, copy
); ix
++)
21816 TREE_PURPOSE (copy
) = parsed_arg
;
21819 pop_defarg_context ();
21821 /* Make sure no default arg is missing. */
21822 check_default_args (fn
);
21824 /* Restore the state of local_variables_forbidden_p. */
21825 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
21827 /* Restore the queue. */
21828 pop_unparsed_function_queues (parser
);
21831 /* Parse the operand of `sizeof' (or a similar operator). Returns
21832 either a TYPE or an expression, depending on the form of the
21833 input. The KEYWORD indicates which kind of expression we have
21837 cp_parser_sizeof_operand (cp_parser
* parser
, enum rid keyword
)
21839 tree expr
= NULL_TREE
;
21840 const char *saved_message
;
21842 bool saved_integral_constant_expression_p
;
21843 bool saved_non_integral_constant_expression_p
;
21844 bool pack_expansion_p
= false;
21846 /* Types cannot be defined in a `sizeof' expression. Save away the
21848 saved_message
= parser
->type_definition_forbidden_message
;
21849 /* And create the new one. */
21850 tmp
= concat ("types may not be defined in %<",
21851 IDENTIFIER_POINTER (ridpointers
[keyword
]),
21852 "%> expressions", NULL
);
21853 parser
->type_definition_forbidden_message
= tmp
;
21855 /* The restrictions on constant-expressions do not apply inside
21856 sizeof expressions. */
21857 saved_integral_constant_expression_p
21858 = parser
->integral_constant_expression_p
;
21859 saved_non_integral_constant_expression_p
21860 = parser
->non_integral_constant_expression_p
;
21861 parser
->integral_constant_expression_p
= false;
21863 /* If it's a `...', then we are computing the length of a parameter
21865 if (keyword
== RID_SIZEOF
21866 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
21868 /* Consume the `...'. */
21869 cp_lexer_consume_token (parser
->lexer
);
21870 maybe_warn_variadic_templates ();
21872 /* Note that this is an expansion. */
21873 pack_expansion_p
= true;
21876 /* Do not actually evaluate the expression. */
21877 ++cp_unevaluated_operand
;
21878 ++c_inhibit_evaluation_warnings
;
21879 /* If it's a `(', then we might be looking at the type-id
21881 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
21884 bool saved_in_type_id_in_expr_p
;
21886 /* We can't be sure yet whether we're looking at a type-id or an
21888 cp_parser_parse_tentatively (parser
);
21889 /* Consume the `('. */
21890 cp_lexer_consume_token (parser
->lexer
);
21891 /* Parse the type-id. */
21892 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
21893 parser
->in_type_id_in_expr_p
= true;
21894 type
= cp_parser_type_id (parser
);
21895 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
21896 /* Now, look for the trailing `)'. */
21897 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
21898 /* If all went well, then we're done. */
21899 if (cp_parser_parse_definitely (parser
))
21901 cp_decl_specifier_seq decl_specs
;
21903 /* Build a trivial decl-specifier-seq. */
21904 clear_decl_specs (&decl_specs
);
21905 decl_specs
.type
= type
;
21907 /* Call grokdeclarator to figure out what type this is. */
21908 expr
= grokdeclarator (NULL
,
21912 /*attrlist=*/NULL
);
21916 /* If the type-id production did not work out, then we must be
21917 looking at the unary-expression production. */
21919 expr
= cp_parser_unary_expression (parser
, /*address_p=*/false,
21920 /*cast_p=*/false, NULL
);
21922 if (pack_expansion_p
)
21923 /* Build a pack expansion. */
21924 expr
= make_pack_expansion (expr
);
21926 /* Go back to evaluating expressions. */
21927 --cp_unevaluated_operand
;
21928 --c_inhibit_evaluation_warnings
;
21930 /* Free the message we created. */
21932 /* And restore the old one. */
21933 parser
->type_definition_forbidden_message
= saved_message
;
21934 parser
->integral_constant_expression_p
21935 = saved_integral_constant_expression_p
;
21936 parser
->non_integral_constant_expression_p
21937 = saved_non_integral_constant_expression_p
;
21942 /* If the current declaration has no declarator, return true. */
21945 cp_parser_declares_only_class_p (cp_parser
*parser
)
21947 /* If the next token is a `;' or a `,' then there is no
21949 return (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
21950 || cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
21953 /* Update the DECL_SPECS to reflect the storage class indicated by
21957 cp_parser_set_storage_class (cp_parser
*parser
,
21958 cp_decl_specifier_seq
*decl_specs
,
21960 location_t location
)
21962 cp_storage_class storage_class
;
21964 if (parser
->in_unbraced_linkage_specification_p
)
21966 error_at (location
, "invalid use of %qD in linkage specification",
21967 ridpointers
[keyword
]);
21970 else if (decl_specs
->storage_class
!= sc_none
)
21972 decl_specs
->conflicting_specifiers_p
= true;
21976 if ((keyword
== RID_EXTERN
|| keyword
== RID_STATIC
)
21977 && decl_specs
->specs
[(int) ds_thread
])
21979 error_at (location
, "%<__thread%> before %qD", ridpointers
[keyword
]);
21980 decl_specs
->specs
[(int) ds_thread
] = 0;
21986 storage_class
= sc_auto
;
21989 storage_class
= sc_register
;
21992 storage_class
= sc_static
;
21995 storage_class
= sc_extern
;
21998 storage_class
= sc_mutable
;
22001 gcc_unreachable ();
22003 decl_specs
->storage_class
= storage_class
;
22005 /* A storage class specifier cannot be applied alongside a typedef
22006 specifier. If there is a typedef specifier present then set
22007 conflicting_specifiers_p which will trigger an error later
22008 on in grokdeclarator. */
22009 if (decl_specs
->specs
[(int)ds_typedef
])
22010 decl_specs
->conflicting_specifiers_p
= true;
22013 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22014 is true, the type is a class or enum definition. */
22017 cp_parser_set_decl_spec_type (cp_decl_specifier_seq
*decl_specs
,
22019 location_t location
,
22020 bool type_definition_p
)
22022 decl_specs
->any_specifiers_p
= true;
22024 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22025 (with, for example, in "typedef int wchar_t;") we remember that
22026 this is what happened. In system headers, we ignore these
22027 declarations so that G++ can work with system headers that are not
22029 if (decl_specs
->specs
[(int) ds_typedef
]
22030 && !type_definition_p
22031 && (type_spec
== boolean_type_node
22032 || type_spec
== char16_type_node
22033 || type_spec
== char32_type_node
22034 || type_spec
== wchar_type_node
)
22035 && (decl_specs
->type
22036 || decl_specs
->specs
[(int) ds_long
]
22037 || decl_specs
->specs
[(int) ds_short
]
22038 || decl_specs
->specs
[(int) ds_unsigned
]
22039 || decl_specs
->specs
[(int) ds_signed
]))
22041 decl_specs
->redefined_builtin_type
= type_spec
;
22042 if (!decl_specs
->type
)
22044 decl_specs
->type
= type_spec
;
22045 decl_specs
->type_definition_p
= false;
22046 decl_specs
->type_location
= location
;
22049 else if (decl_specs
->type
)
22050 decl_specs
->multiple_types_p
= true;
22053 decl_specs
->type
= type_spec
;
22054 decl_specs
->type_definition_p
= type_definition_p
;
22055 decl_specs
->redefined_builtin_type
= NULL_TREE
;
22056 decl_specs
->type_location
= location
;
22060 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22061 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22064 cp_parser_friend_p (const cp_decl_specifier_seq
*decl_specifiers
)
22066 return decl_specifiers
->specs
[(int) ds_friend
] != 0;
22069 /* Issue an error message indicating that TOKEN_DESC was expected.
22070 If KEYWORD is true, it indicated this function is called by
22071 cp_parser_require_keword and the required token can only be
22072 a indicated keyword. */
22075 cp_parser_required_error (cp_parser
*parser
,
22076 required_token token_desc
,
22079 switch (token_desc
)
22082 cp_parser_error (parser
, "expected %<new%>");
22085 cp_parser_error (parser
, "expected %<delete%>");
22088 cp_parser_error (parser
, "expected %<return%>");
22091 cp_parser_error (parser
, "expected %<while%>");
22094 cp_parser_error (parser
, "expected %<extern%>");
22096 case RT_STATIC_ASSERT
:
22097 cp_parser_error (parser
, "expected %<static_assert%>");
22100 cp_parser_error (parser
, "expected %<decltype%>");
22103 cp_parser_error (parser
, "expected %<operator%>");
22106 cp_parser_error (parser
, "expected %<class%>");
22109 cp_parser_error (parser
, "expected %<template%>");
22112 cp_parser_error (parser
, "expected %<namespace%>");
22115 cp_parser_error (parser
, "expected %<using%>");
22118 cp_parser_error (parser
, "expected %<asm%>");
22121 cp_parser_error (parser
, "expected %<try%>");
22124 cp_parser_error (parser
, "expected %<catch%>");
22127 cp_parser_error (parser
, "expected %<throw%>");
22130 cp_parser_error (parser
, "expected %<__label__%>");
22133 cp_parser_error (parser
, "expected %<@try%>");
22135 case RT_AT_SYNCHRONIZED
:
22136 cp_parser_error (parser
, "expected %<@synchronized%>");
22139 cp_parser_error (parser
, "expected %<@throw%>");
22141 case RT_TRANSACTION_ATOMIC
:
22142 cp_parser_error (parser
, "expected %<__transaction_atomic%>");
22144 case RT_TRANSACTION_RELAXED
:
22145 cp_parser_error (parser
, "expected %<__transaction_relaxed%>");
22152 switch (token_desc
)
22155 cp_parser_error (parser
, "expected %<;%>");
22157 case RT_OPEN_PAREN
:
22158 cp_parser_error (parser
, "expected %<(%>");
22160 case RT_CLOSE_BRACE
:
22161 cp_parser_error (parser
, "expected %<}%>");
22163 case RT_OPEN_BRACE
:
22164 cp_parser_error (parser
, "expected %<{%>");
22166 case RT_CLOSE_SQUARE
:
22167 cp_parser_error (parser
, "expected %<]%>");
22169 case RT_OPEN_SQUARE
:
22170 cp_parser_error (parser
, "expected %<[%>");
22173 cp_parser_error (parser
, "expected %<,%>");
22176 cp_parser_error (parser
, "expected %<::%>");
22179 cp_parser_error (parser
, "expected %<<%>");
22182 cp_parser_error (parser
, "expected %<>%>");
22185 cp_parser_error (parser
, "expected %<=%>");
22188 cp_parser_error (parser
, "expected %<...%>");
22191 cp_parser_error (parser
, "expected %<*%>");
22194 cp_parser_error (parser
, "expected %<~%>");
22197 cp_parser_error (parser
, "expected %<:%>");
22199 case RT_COLON_SCOPE
:
22200 cp_parser_error (parser
, "expected %<:%> or %<::%>");
22202 case RT_CLOSE_PAREN
:
22203 cp_parser_error (parser
, "expected %<)%>");
22205 case RT_COMMA_CLOSE_PAREN
:
22206 cp_parser_error (parser
, "expected %<,%> or %<)%>");
22208 case RT_PRAGMA_EOL
:
22209 cp_parser_error (parser
, "expected end of line");
22212 cp_parser_error (parser
, "expected identifier");
22215 cp_parser_error (parser
, "expected selection-statement");
22217 case RT_INTERATION
:
22218 cp_parser_error (parser
, "expected iteration-statement");
22221 cp_parser_error (parser
, "expected jump-statement");
22224 cp_parser_error (parser
, "expected class-key");
22226 case RT_CLASS_TYPENAME_TEMPLATE
:
22227 cp_parser_error (parser
,
22228 "expected %<class%>, %<typename%>, or %<template%>");
22231 gcc_unreachable ();
22235 gcc_unreachable ();
22240 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22241 issue an error message indicating that TOKEN_DESC was expected.
22243 Returns the token consumed, if the token had the appropriate type.
22244 Otherwise, returns NULL. */
22247 cp_parser_require (cp_parser
* parser
,
22248 enum cpp_ttype type
,
22249 required_token token_desc
)
22251 if (cp_lexer_next_token_is (parser
->lexer
, type
))
22252 return cp_lexer_consume_token (parser
->lexer
);
22255 /* Output the MESSAGE -- unless we're parsing tentatively. */
22256 if (!cp_parser_simulate_error (parser
))
22257 cp_parser_required_error (parser
, token_desc
, /*keyword=*/false);
22262 /* An error message is produced if the next token is not '>'.
22263 All further tokens are skipped until the desired token is
22264 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22267 cp_parser_skip_to_end_of_template_parameter_list (cp_parser
* parser
)
22269 /* Current level of '< ... >'. */
22270 unsigned level
= 0;
22271 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22272 unsigned nesting_depth
= 0;
22274 /* Are we ready, yet? If not, issue error message. */
22275 if (cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
))
22278 /* Skip tokens until the desired token is found. */
22281 /* Peek at the next token. */
22282 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
22285 if (!nesting_depth
)
22290 if (cxx_dialect
== cxx98
)
22291 /* C++0x views the `>>' operator as two `>' tokens, but
22294 else if (!nesting_depth
&& level
-- == 0)
22296 /* We've hit a `>>' where the first `>' closes the
22297 template argument list, and the second `>' is
22298 spurious. Just consume the `>>' and stop; we've
22299 already produced at least one error. */
22300 cp_lexer_consume_token (parser
->lexer
);
22303 /* Fall through for C++0x, so we handle the second `>' in
22307 if (!nesting_depth
&& level
-- == 0)
22309 /* We've reached the token we want, consume it and stop. */
22310 cp_lexer_consume_token (parser
->lexer
);
22315 case CPP_OPEN_PAREN
:
22316 case CPP_OPEN_SQUARE
:
22320 case CPP_CLOSE_PAREN
:
22321 case CPP_CLOSE_SQUARE
:
22322 if (nesting_depth
-- == 0)
22327 case CPP_PRAGMA_EOL
:
22328 case CPP_SEMICOLON
:
22329 case CPP_OPEN_BRACE
:
22330 case CPP_CLOSE_BRACE
:
22331 /* The '>' was probably forgotten, don't look further. */
22338 /* Consume this token. */
22339 cp_lexer_consume_token (parser
->lexer
);
22343 /* If the next token is the indicated keyword, consume it. Otherwise,
22344 issue an error message indicating that TOKEN_DESC was expected.
22346 Returns the token consumed, if the token had the appropriate type.
22347 Otherwise, returns NULL. */
22350 cp_parser_require_keyword (cp_parser
* parser
,
22352 required_token token_desc
)
22354 cp_token
*token
= cp_parser_require (parser
, CPP_KEYWORD
, token_desc
);
22356 if (token
&& token
->keyword
!= keyword
)
22358 cp_parser_required_error (parser
, token_desc
, /*keyword=*/true);
22365 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22366 function-definition. */
22369 cp_parser_token_starts_function_definition_p (cp_token
* token
)
22371 return (/* An ordinary function-body begins with an `{'. */
22372 token
->type
== CPP_OPEN_BRACE
22373 /* A ctor-initializer begins with a `:'. */
22374 || token
->type
== CPP_COLON
22375 /* A function-try-block begins with `try'. */
22376 || token
->keyword
== RID_TRY
22377 /* A function-transaction-block begins with `__transaction_atomic'
22378 or `__transaction_relaxed'. */
22379 || token
->keyword
== RID_TRANSACTION_ATOMIC
22380 || token
->keyword
== RID_TRANSACTION_RELAXED
22381 /* The named return value extension begins with `return'. */
22382 || token
->keyword
== RID_RETURN
);
22385 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22389 cp_parser_next_token_starts_class_definition_p (cp_parser
*parser
)
22393 token
= cp_lexer_peek_token (parser
->lexer
);
22394 return (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_COLON
);
22397 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22398 C++0x) ending a template-argument. */
22401 cp_parser_next_token_ends_template_argument_p (cp_parser
*parser
)
22405 token
= cp_lexer_peek_token (parser
->lexer
);
22406 return (token
->type
== CPP_COMMA
22407 || token
->type
== CPP_GREATER
22408 || token
->type
== CPP_ELLIPSIS
22409 || ((cxx_dialect
!= cxx98
) && token
->type
== CPP_RSHIFT
));
22412 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22413 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22416 cp_parser_nth_token_starts_template_argument_list_p (cp_parser
* parser
,
22421 token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
22422 if (token
->type
== CPP_LESS
)
22424 /* Check for the sequence `<::' in the original code. It would be lexed as
22425 `[:', where `[' is a digraph, and there is no whitespace before
22427 if (token
->type
== CPP_OPEN_SQUARE
&& token
->flags
& DIGRAPH
)
22430 token2
= cp_lexer_peek_nth_token (parser
->lexer
, n
+1);
22431 if (token2
->type
== CPP_COLON
&& !(token2
->flags
& PREV_WHITE
))
22437 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22438 or none_type otherwise. */
22440 static enum tag_types
22441 cp_parser_token_is_class_key (cp_token
* token
)
22443 switch (token
->keyword
)
22448 return record_type
;
22457 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22460 cp_parser_check_class_key (enum tag_types class_key
, tree type
)
22462 if ((TREE_CODE (type
) == UNION_TYPE
) != (class_key
== union_type
))
22463 permerror (input_location
, "%qs tag used in naming %q#T",
22464 class_key
== union_type
? "union"
22465 : class_key
== record_type
? "struct" : "class",
22469 /* Issue an error message if DECL is redeclared with different
22470 access than its original declaration [class.access.spec/3].
22471 This applies to nested classes and nested class templates.
22475 cp_parser_check_access_in_redeclaration (tree decl
, location_t location
)
22477 if (!decl
|| !CLASS_TYPE_P (TREE_TYPE (decl
)))
22480 if ((TREE_PRIVATE (decl
)
22481 != (current_access_specifier
== access_private_node
))
22482 || (TREE_PROTECTED (decl
)
22483 != (current_access_specifier
== access_protected_node
)))
22484 error_at (location
, "%qD redeclared with different access", decl
);
22487 /* Look for the `template' keyword, as a syntactic disambiguator.
22488 Return TRUE iff it is present, in which case it will be
22492 cp_parser_optional_template_keyword (cp_parser
*parser
)
22494 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
22496 /* The `template' keyword can only be used within templates;
22497 outside templates the parser can always figure out what is a
22498 template and what is not. */
22499 if (!processing_template_decl
)
22501 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22502 error_at (token
->location
,
22503 "%<template%> (as a disambiguator) is only allowed "
22504 "within templates");
22505 /* If this part of the token stream is rescanned, the same
22506 error message would be generated. So, we purge the token
22507 from the stream. */
22508 cp_lexer_purge_token (parser
->lexer
);
22513 /* Consume the `template' keyword. */
22514 cp_lexer_consume_token (parser
->lexer
);
22522 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22523 set PARSER->SCOPE, and perform other related actions. */
22526 cp_parser_pre_parsed_nested_name_specifier (cp_parser
*parser
)
22529 struct tree_check
*check_value
;
22530 deferred_access_check
*chk
;
22531 VEC (deferred_access_check
,gc
) *checks
;
22533 /* Get the stored value. */
22534 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
22535 /* Perform any access checks that were deferred. */
22536 checks
= check_value
->checks
;
22539 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
22540 perform_or_defer_access_check (chk
->binfo
,
22544 /* Set the scope from the stored value. */
22545 parser
->scope
= check_value
->value
;
22546 parser
->qualifying_scope
= check_value
->qualifying_scope
;
22547 parser
->object_scope
= NULL_TREE
;
22550 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22551 encounter the end of a block before what we were looking for. */
22554 cp_parser_cache_group (cp_parser
*parser
,
22555 enum cpp_ttype end
,
22560 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22562 /* Abort a parenthesized expression if we encounter a semicolon. */
22563 if ((end
== CPP_CLOSE_PAREN
|| depth
== 0)
22564 && token
->type
== CPP_SEMICOLON
)
22566 /* If we've reached the end of the file, stop. */
22567 if (token
->type
== CPP_EOF
22568 || (end
!= CPP_PRAGMA_EOL
22569 && token
->type
== CPP_PRAGMA_EOL
))
22571 if (token
->type
== CPP_CLOSE_BRACE
&& depth
== 0)
22572 /* We've hit the end of an enclosing block, so there's been some
22573 kind of syntax error. */
22576 /* If we're caching something finished by a comma (or semicolon),
22577 such as an NSDMI, don't consume the comma. */
22578 if (end
== CPP_COMMA
22579 && (token
->type
== CPP_SEMICOLON
|| token
->type
== CPP_COMMA
))
22582 /* Consume the token. */
22583 cp_lexer_consume_token (parser
->lexer
);
22584 /* See if it starts a new group. */
22585 if (token
->type
== CPP_OPEN_BRACE
)
22587 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, depth
+ 1);
22588 /* In theory this should probably check end == '}', but
22589 cp_parser_save_member_function_body needs it to exit
22590 after either '}' or ')' when called with ')'. */
22594 else if (token
->type
== CPP_OPEN_PAREN
)
22596 cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, depth
+ 1);
22597 if (depth
== 0 && end
== CPP_CLOSE_PAREN
)
22600 else if (token
->type
== CPP_PRAGMA
)
22601 cp_parser_cache_group (parser
, CPP_PRAGMA_EOL
, depth
+ 1);
22602 else if (token
->type
== end
)
22607 /* Begin parsing tentatively. We always save tokens while parsing
22608 tentatively so that if the tentative parsing fails we can restore the
22612 cp_parser_parse_tentatively (cp_parser
* parser
)
22614 /* Enter a new parsing context. */
22615 parser
->context
= cp_parser_context_new (parser
->context
);
22616 /* Begin saving tokens. */
22617 cp_lexer_save_tokens (parser
->lexer
);
22618 /* In order to avoid repetitive access control error messages,
22619 access checks are queued up until we are no longer parsing
22621 push_deferring_access_checks (dk_deferred
);
22624 /* Commit to the currently active tentative parse. */
22627 cp_parser_commit_to_tentative_parse (cp_parser
* parser
)
22629 cp_parser_context
*context
;
22632 /* Mark all of the levels as committed. */
22633 lexer
= parser
->lexer
;
22634 for (context
= parser
->context
; context
->next
; context
= context
->next
)
22636 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
22638 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
22639 while (!cp_lexer_saving_tokens (lexer
))
22640 lexer
= lexer
->next
;
22641 cp_lexer_commit_tokens (lexer
);
22645 /* Abort the currently active tentative parse. All consumed tokens
22646 will be rolled back, and no diagnostics will be issued. */
22649 cp_parser_abort_tentative_parse (cp_parser
* parser
)
22651 gcc_assert (parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
22652 || errorcount
> 0);
22653 cp_parser_simulate_error (parser
);
22654 /* Now, pretend that we want to see if the construct was
22655 successfully parsed. */
22656 cp_parser_parse_definitely (parser
);
22659 /* Stop parsing tentatively. If a parse error has occurred, restore the
22660 token stream. Otherwise, commit to the tokens we have consumed.
22661 Returns true if no error occurred; false otherwise. */
22664 cp_parser_parse_definitely (cp_parser
* parser
)
22666 bool error_occurred
;
22667 cp_parser_context
*context
;
22669 /* Remember whether or not an error occurred, since we are about to
22670 destroy that information. */
22671 error_occurred
= cp_parser_error_occurred (parser
);
22672 /* Remove the topmost context from the stack. */
22673 context
= parser
->context
;
22674 parser
->context
= context
->next
;
22675 /* If no parse errors occurred, commit to the tentative parse. */
22676 if (!error_occurred
)
22678 /* Commit to the tokens read tentatively, unless that was
22680 if (context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
)
22681 cp_lexer_commit_tokens (parser
->lexer
);
22683 pop_to_parent_deferring_access_checks ();
22685 /* Otherwise, if errors occurred, roll back our state so that things
22686 are just as they were before we began the tentative parse. */
22689 cp_lexer_rollback_tokens (parser
->lexer
);
22690 pop_deferring_access_checks ();
22692 /* Add the context to the front of the free list. */
22693 context
->next
= cp_parser_context_free_list
;
22694 cp_parser_context_free_list
= context
;
22696 return !error_occurred
;
22699 /* Returns true if we are parsing tentatively and are not committed to
22700 this tentative parse. */
22703 cp_parser_uncommitted_to_tentative_parse_p (cp_parser
* parser
)
22705 return (cp_parser_parsing_tentatively (parser
)
22706 && parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
);
22709 /* Returns nonzero iff an error has occurred during the most recent
22710 tentative parse. */
22713 cp_parser_error_occurred (cp_parser
* parser
)
22715 return (cp_parser_parsing_tentatively (parser
)
22716 && parser
->context
->status
== CP_PARSER_STATUS_KIND_ERROR
);
22719 /* Returns nonzero if GNU extensions are allowed. */
22722 cp_parser_allow_gnu_extensions_p (cp_parser
* parser
)
22724 return parser
->allow_gnu_extensions_p
;
22727 /* Objective-C++ Productions */
22730 /* Parse an Objective-C expression, which feeds into a primary-expression
22734 objc-message-expression
22735 objc-string-literal
22736 objc-encode-expression
22737 objc-protocol-expression
22738 objc-selector-expression
22740 Returns a tree representation of the expression. */
22743 cp_parser_objc_expression (cp_parser
* parser
)
22745 /* Try to figure out what kind of declaration is present. */
22746 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
22750 case CPP_OPEN_SQUARE
:
22751 return cp_parser_objc_message_expression (parser
);
22753 case CPP_OBJC_STRING
:
22754 kwd
= cp_lexer_consume_token (parser
->lexer
);
22755 return objc_build_string_object (kwd
->u
.value
);
22758 switch (kwd
->keyword
)
22760 case RID_AT_ENCODE
:
22761 return cp_parser_objc_encode_expression (parser
);
22763 case RID_AT_PROTOCOL
:
22764 return cp_parser_objc_protocol_expression (parser
);
22766 case RID_AT_SELECTOR
:
22767 return cp_parser_objc_selector_expression (parser
);
22773 error_at (kwd
->location
,
22774 "misplaced %<@%D%> Objective-C++ construct",
22776 cp_parser_skip_to_end_of_block_or_statement (parser
);
22779 return error_mark_node
;
22782 /* Parse an Objective-C message expression.
22784 objc-message-expression:
22785 [ objc-message-receiver objc-message-args ]
22787 Returns a representation of an Objective-C message. */
22790 cp_parser_objc_message_expression (cp_parser
* parser
)
22792 tree receiver
, messageargs
;
22794 cp_lexer_consume_token (parser
->lexer
); /* Eat '['. */
22795 receiver
= cp_parser_objc_message_receiver (parser
);
22796 messageargs
= cp_parser_objc_message_args (parser
);
22797 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
22799 return objc_build_message_expr (receiver
, messageargs
);
22802 /* Parse an objc-message-receiver.
22804 objc-message-receiver:
22806 simple-type-specifier
22808 Returns a representation of the type or expression. */
22811 cp_parser_objc_message_receiver (cp_parser
* parser
)
22815 /* An Objective-C message receiver may be either (1) a type
22816 or (2) an expression. */
22817 cp_parser_parse_tentatively (parser
);
22818 rcv
= cp_parser_expression (parser
, false, NULL
);
22820 if (cp_parser_parse_definitely (parser
))
22823 rcv
= cp_parser_simple_type_specifier (parser
,
22824 /*decl_specs=*/NULL
,
22825 CP_PARSER_FLAGS_NONE
);
22827 return objc_get_class_reference (rcv
);
22830 /* Parse the arguments and selectors comprising an Objective-C message.
22835 objc-selector-args , objc-comma-args
22837 objc-selector-args:
22838 objc-selector [opt] : assignment-expression
22839 objc-selector-args objc-selector [opt] : assignment-expression
22842 assignment-expression
22843 objc-comma-args , assignment-expression
22845 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
22846 selector arguments and TREE_VALUE containing a list of comma
22850 cp_parser_objc_message_args (cp_parser
* parser
)
22852 tree sel_args
= NULL_TREE
, addl_args
= NULL_TREE
;
22853 bool maybe_unary_selector_p
= true;
22854 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22856 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
22858 tree selector
= NULL_TREE
, arg
;
22860 if (token
->type
!= CPP_COLON
)
22861 selector
= cp_parser_objc_selector (parser
);
22863 /* Detect if we have a unary selector. */
22864 if (maybe_unary_selector_p
22865 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
22866 return build_tree_list (selector
, NULL_TREE
);
22868 maybe_unary_selector_p
= false;
22869 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
22870 arg
= cp_parser_assignment_expression (parser
, false, NULL
);
22873 = chainon (sel_args
,
22874 build_tree_list (selector
, arg
));
22876 token
= cp_lexer_peek_token (parser
->lexer
);
22879 /* Handle non-selector arguments, if any. */
22880 while (token
->type
== CPP_COMMA
)
22884 cp_lexer_consume_token (parser
->lexer
);
22885 arg
= cp_parser_assignment_expression (parser
, false, NULL
);
22888 = chainon (addl_args
,
22889 build_tree_list (NULL_TREE
, arg
));
22891 token
= cp_lexer_peek_token (parser
->lexer
);
22894 if (sel_args
== NULL_TREE
&& addl_args
== NULL_TREE
)
22896 cp_parser_error (parser
, "objective-c++ message argument(s) are expected");
22897 return build_tree_list (error_mark_node
, error_mark_node
);
22900 return build_tree_list (sel_args
, addl_args
);
22903 /* Parse an Objective-C encode expression.
22905 objc-encode-expression:
22906 @encode objc-typename
22908 Returns an encoded representation of the type argument. */
22911 cp_parser_objc_encode_expression (cp_parser
* parser
)
22916 cp_lexer_consume_token (parser
->lexer
); /* Eat '@encode'. */
22917 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
22918 token
= cp_lexer_peek_token (parser
->lexer
);
22919 type
= complete_type (cp_parser_type_id (parser
));
22920 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
22924 error_at (token
->location
,
22925 "%<@encode%> must specify a type as an argument");
22926 return error_mark_node
;
22929 /* This happens if we find @encode(T) (where T is a template
22930 typename or something dependent on a template typename) when
22931 parsing a template. In that case, we can't compile it
22932 immediately, but we rather create an AT_ENCODE_EXPR which will
22933 need to be instantiated when the template is used.
22935 if (dependent_type_p (type
))
22937 tree value
= build_min (AT_ENCODE_EXPR
, size_type_node
, type
);
22938 TREE_READONLY (value
) = 1;
22942 return objc_build_encode_expr (type
);
22945 /* Parse an Objective-C @defs expression. */
22948 cp_parser_objc_defs_expression (cp_parser
*parser
)
22952 cp_lexer_consume_token (parser
->lexer
); /* Eat '@defs'. */
22953 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
22954 name
= cp_parser_identifier (parser
);
22955 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
22957 return objc_get_class_ivars (name
);
22960 /* Parse an Objective-C protocol expression.
22962 objc-protocol-expression:
22963 @protocol ( identifier )
22965 Returns a representation of the protocol expression. */
22968 cp_parser_objc_protocol_expression (cp_parser
* parser
)
22972 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
22973 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
22974 proto
= cp_parser_identifier (parser
);
22975 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
22977 return objc_build_protocol_expr (proto
);
22980 /* Parse an Objective-C selector expression.
22982 objc-selector-expression:
22983 @selector ( objc-method-signature )
22985 objc-method-signature:
22991 objc-selector-seq objc-selector :
22993 Returns a representation of the method selector. */
22996 cp_parser_objc_selector_expression (cp_parser
* parser
)
22998 tree sel_seq
= NULL_TREE
;
22999 bool maybe_unary_selector_p
= true;
23001 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
23003 cp_lexer_consume_token (parser
->lexer
); /* Eat '@selector'. */
23004 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
23005 token
= cp_lexer_peek_token (parser
->lexer
);
23007 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
23008 || token
->type
== CPP_SCOPE
)
23010 tree selector
= NULL_TREE
;
23012 if (token
->type
!= CPP_COLON
23013 || token
->type
== CPP_SCOPE
)
23014 selector
= cp_parser_objc_selector (parser
);
23016 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
)
23017 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
))
23019 /* Detect if we have a unary selector. */
23020 if (maybe_unary_selector_p
)
23022 sel_seq
= selector
;
23023 goto finish_selector
;
23027 cp_parser_error (parser
, "expected %<:%>");
23030 maybe_unary_selector_p
= false;
23031 token
= cp_lexer_consume_token (parser
->lexer
);
23033 if (token
->type
== CPP_SCOPE
)
23036 = chainon (sel_seq
,
23037 build_tree_list (selector
, NULL_TREE
));
23039 = chainon (sel_seq
,
23040 build_tree_list (NULL_TREE
, NULL_TREE
));
23044 = chainon (sel_seq
,
23045 build_tree_list (selector
, NULL_TREE
));
23047 token
= cp_lexer_peek_token (parser
->lexer
);
23051 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23053 return objc_build_selector_expr (loc
, sel_seq
);
23056 /* Parse a list of identifiers.
23058 objc-identifier-list:
23060 objc-identifier-list , identifier
23062 Returns a TREE_LIST of identifier nodes. */
23065 cp_parser_objc_identifier_list (cp_parser
* parser
)
23071 identifier
= cp_parser_identifier (parser
);
23072 if (identifier
== error_mark_node
)
23073 return error_mark_node
;
23075 list
= build_tree_list (NULL_TREE
, identifier
);
23076 sep
= cp_lexer_peek_token (parser
->lexer
);
23078 while (sep
->type
== CPP_COMMA
)
23080 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
23081 identifier
= cp_parser_identifier (parser
);
23082 if (identifier
== error_mark_node
)
23085 list
= chainon (list
, build_tree_list (NULL_TREE
,
23087 sep
= cp_lexer_peek_token (parser
->lexer
);
23093 /* Parse an Objective-C alias declaration.
23095 objc-alias-declaration:
23096 @compatibility_alias identifier identifier ;
23098 This function registers the alias mapping with the Objective-C front end.
23099 It returns nothing. */
23102 cp_parser_objc_alias_declaration (cp_parser
* parser
)
23106 cp_lexer_consume_token (parser
->lexer
); /* Eat '@compatibility_alias'. */
23107 alias
= cp_parser_identifier (parser
);
23108 orig
= cp_parser_identifier (parser
);
23109 objc_declare_alias (alias
, orig
);
23110 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23113 /* Parse an Objective-C class forward-declaration.
23115 objc-class-declaration:
23116 @class objc-identifier-list ;
23118 The function registers the forward declarations with the Objective-C
23119 front end. It returns nothing. */
23122 cp_parser_objc_class_declaration (cp_parser
* parser
)
23124 cp_lexer_consume_token (parser
->lexer
); /* Eat '@class'. */
23129 id
= cp_parser_identifier (parser
);
23130 if (id
== error_mark_node
)
23133 objc_declare_class (id
);
23135 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23136 cp_lexer_consume_token (parser
->lexer
);
23140 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23143 /* Parse a list of Objective-C protocol references.
23145 objc-protocol-refs-opt:
23146 objc-protocol-refs [opt]
23148 objc-protocol-refs:
23149 < objc-identifier-list >
23151 Returns a TREE_LIST of identifiers, if any. */
23154 cp_parser_objc_protocol_refs_opt (cp_parser
* parser
)
23156 tree protorefs
= NULL_TREE
;
23158 if(cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
23160 cp_lexer_consume_token (parser
->lexer
); /* Eat '<'. */
23161 protorefs
= cp_parser_objc_identifier_list (parser
);
23162 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
23168 /* Parse a Objective-C visibility specification. */
23171 cp_parser_objc_visibility_spec (cp_parser
* parser
)
23173 cp_token
*vis
= cp_lexer_peek_token (parser
->lexer
);
23175 switch (vis
->keyword
)
23177 case RID_AT_PRIVATE
:
23178 objc_set_visibility (OBJC_IVAR_VIS_PRIVATE
);
23180 case RID_AT_PROTECTED
:
23181 objc_set_visibility (OBJC_IVAR_VIS_PROTECTED
);
23183 case RID_AT_PUBLIC
:
23184 objc_set_visibility (OBJC_IVAR_VIS_PUBLIC
);
23186 case RID_AT_PACKAGE
:
23187 objc_set_visibility (OBJC_IVAR_VIS_PACKAGE
);
23193 /* Eat '@private'/'@protected'/'@public'. */
23194 cp_lexer_consume_token (parser
->lexer
);
23197 /* Parse an Objective-C method type. Return 'true' if it is a class
23198 (+) method, and 'false' if it is an instance (-) method. */
23201 cp_parser_objc_method_type (cp_parser
* parser
)
23203 if (cp_lexer_consume_token (parser
->lexer
)->type
== CPP_PLUS
)
23209 /* Parse an Objective-C protocol qualifier. */
23212 cp_parser_objc_protocol_qualifiers (cp_parser
* parser
)
23214 tree quals
= NULL_TREE
, node
;
23215 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23217 node
= token
->u
.value
;
23219 while (node
&& TREE_CODE (node
) == IDENTIFIER_NODE
23220 && (node
== ridpointers
[(int) RID_IN
]
23221 || node
== ridpointers
[(int) RID_OUT
]
23222 || node
== ridpointers
[(int) RID_INOUT
]
23223 || node
== ridpointers
[(int) RID_BYCOPY
]
23224 || node
== ridpointers
[(int) RID_BYREF
]
23225 || node
== ridpointers
[(int) RID_ONEWAY
]))
23227 quals
= tree_cons (NULL_TREE
, node
, quals
);
23228 cp_lexer_consume_token (parser
->lexer
);
23229 token
= cp_lexer_peek_token (parser
->lexer
);
23230 node
= token
->u
.value
;
23236 /* Parse an Objective-C typename. */
23239 cp_parser_objc_typename (cp_parser
* parser
)
23241 tree type_name
= NULL_TREE
;
23243 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
23245 tree proto_quals
, cp_type
= NULL_TREE
;
23247 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
23248 proto_quals
= cp_parser_objc_protocol_qualifiers (parser
);
23250 /* An ObjC type name may consist of just protocol qualifiers, in which
23251 case the type shall default to 'id'. */
23252 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
23254 cp_type
= cp_parser_type_id (parser
);
23256 /* If the type could not be parsed, an error has already
23257 been produced. For error recovery, behave as if it had
23258 not been specified, which will use the default type
23260 if (cp_type
== error_mark_node
)
23262 cp_type
= NULL_TREE
;
23263 /* We need to skip to the closing parenthesis as
23264 cp_parser_type_id() does not seem to do it for
23266 cp_parser_skip_to_closing_parenthesis (parser
,
23267 /*recovering=*/true,
23268 /*or_comma=*/false,
23269 /*consume_paren=*/false);
23273 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23274 type_name
= build_tree_list (proto_quals
, cp_type
);
23280 /* Check to see if TYPE refers to an Objective-C selector name. */
23283 cp_parser_objc_selector_p (enum cpp_ttype type
)
23285 return (type
== CPP_NAME
|| type
== CPP_KEYWORD
23286 || type
== CPP_AND_AND
|| type
== CPP_AND_EQ
|| type
== CPP_AND
23287 || type
== CPP_OR
|| type
== CPP_COMPL
|| type
== CPP_NOT
23288 || type
== CPP_NOT_EQ
|| type
== CPP_OR_OR
|| type
== CPP_OR_EQ
23289 || type
== CPP_XOR
|| type
== CPP_XOR_EQ
);
23292 /* Parse an Objective-C selector. */
23295 cp_parser_objc_selector (cp_parser
* parser
)
23297 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
23299 if (!cp_parser_objc_selector_p (token
->type
))
23301 error_at (token
->location
, "invalid Objective-C++ selector name");
23302 return error_mark_node
;
23305 /* C++ operator names are allowed to appear in ObjC selectors. */
23306 switch (token
->type
)
23308 case CPP_AND_AND
: return get_identifier ("and");
23309 case CPP_AND_EQ
: return get_identifier ("and_eq");
23310 case CPP_AND
: return get_identifier ("bitand");
23311 case CPP_OR
: return get_identifier ("bitor");
23312 case CPP_COMPL
: return get_identifier ("compl");
23313 case CPP_NOT
: return get_identifier ("not");
23314 case CPP_NOT_EQ
: return get_identifier ("not_eq");
23315 case CPP_OR_OR
: return get_identifier ("or");
23316 case CPP_OR_EQ
: return get_identifier ("or_eq");
23317 case CPP_XOR
: return get_identifier ("xor");
23318 case CPP_XOR_EQ
: return get_identifier ("xor_eq");
23319 default: return token
->u
.value
;
23323 /* Parse an Objective-C params list. */
23326 cp_parser_objc_method_keyword_params (cp_parser
* parser
, tree
* attributes
)
23328 tree params
= NULL_TREE
;
23329 bool maybe_unary_selector_p
= true;
23330 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23332 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
23334 tree selector
= NULL_TREE
, type_name
, identifier
;
23335 tree parm_attr
= NULL_TREE
;
23337 if (token
->keyword
== RID_ATTRIBUTE
)
23340 if (token
->type
!= CPP_COLON
)
23341 selector
= cp_parser_objc_selector (parser
);
23343 /* Detect if we have a unary selector. */
23344 if (maybe_unary_selector_p
23345 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
23347 params
= selector
; /* Might be followed by attributes. */
23351 maybe_unary_selector_p
= false;
23352 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
23354 /* Something went quite wrong. There should be a colon
23355 here, but there is not. Stop parsing parameters. */
23358 type_name
= cp_parser_objc_typename (parser
);
23359 /* New ObjC allows attributes on parameters too. */
23360 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
23361 parm_attr
= cp_parser_attributes_opt (parser
);
23362 identifier
= cp_parser_identifier (parser
);
23366 objc_build_keyword_decl (selector
,
23371 token
= cp_lexer_peek_token (parser
->lexer
);
23374 if (params
== NULL_TREE
)
23376 cp_parser_error (parser
, "objective-c++ method declaration is expected");
23377 return error_mark_node
;
23380 /* We allow tail attributes for the method. */
23381 if (token
->keyword
== RID_ATTRIBUTE
)
23383 *attributes
= cp_parser_attributes_opt (parser
);
23384 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
23385 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
23387 cp_parser_error (parser
,
23388 "method attributes must be specified at the end");
23389 return error_mark_node
;
23392 if (params
== NULL_TREE
)
23394 cp_parser_error (parser
, "objective-c++ method declaration is expected");
23395 return error_mark_node
;
23400 /* Parse the non-keyword Objective-C params. */
23403 cp_parser_objc_method_tail_params_opt (cp_parser
* parser
, bool *ellipsisp
,
23406 tree params
= make_node (TREE_LIST
);
23407 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23408 *ellipsisp
= false; /* Initially, assume no ellipsis. */
23410 while (token
->type
== CPP_COMMA
)
23412 cp_parameter_declarator
*parmdecl
;
23415 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
23416 token
= cp_lexer_peek_token (parser
->lexer
);
23418 if (token
->type
== CPP_ELLIPSIS
)
23420 cp_lexer_consume_token (parser
->lexer
); /* Eat '...'. */
23422 token
= cp_lexer_peek_token (parser
->lexer
);
23426 /* TODO: parse attributes for tail parameters. */
23427 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
23428 parm
= grokdeclarator (parmdecl
->declarator
,
23429 &parmdecl
->decl_specifiers
,
23430 PARM
, /*initialized=*/0,
23431 /*attrlist=*/NULL
);
23433 chainon (params
, build_tree_list (NULL_TREE
, parm
));
23434 token
= cp_lexer_peek_token (parser
->lexer
);
23437 /* We allow tail attributes for the method. */
23438 if (token
->keyword
== RID_ATTRIBUTE
)
23440 if (*attributes
== NULL_TREE
)
23442 *attributes
= cp_parser_attributes_opt (parser
);
23443 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
23444 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
23448 /* We have an error, but parse the attributes, so that we can
23450 *attributes
= cp_parser_attributes_opt (parser
);
23452 cp_parser_error (parser
,
23453 "method attributes must be specified at the end");
23454 return error_mark_node
;
23460 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23463 cp_parser_objc_interstitial_code (cp_parser
* parser
)
23465 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23467 /* If the next token is `extern' and the following token is a string
23468 literal, then we have a linkage specification. */
23469 if (token
->keyword
== RID_EXTERN
23470 && cp_parser_is_pure_string_literal
23471 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
23472 cp_parser_linkage_specification (parser
);
23473 /* Handle #pragma, if any. */
23474 else if (token
->type
== CPP_PRAGMA
)
23475 cp_parser_pragma (parser
, pragma_external
);
23476 /* Allow stray semicolons. */
23477 else if (token
->type
== CPP_SEMICOLON
)
23478 cp_lexer_consume_token (parser
->lexer
);
23479 /* Mark methods as optional or required, when building protocols. */
23480 else if (token
->keyword
== RID_AT_OPTIONAL
)
23482 cp_lexer_consume_token (parser
->lexer
);
23483 objc_set_method_opt (true);
23485 else if (token
->keyword
== RID_AT_REQUIRED
)
23487 cp_lexer_consume_token (parser
->lexer
);
23488 objc_set_method_opt (false);
23490 else if (token
->keyword
== RID_NAMESPACE
)
23491 cp_parser_namespace_definition (parser
);
23492 /* Other stray characters must generate errors. */
23493 else if (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_CLOSE_BRACE
)
23495 cp_lexer_consume_token (parser
->lexer
);
23496 error ("stray %qs between Objective-C++ methods",
23497 token
->type
== CPP_OPEN_BRACE
? "{" : "}");
23499 /* Finally, try to parse a block-declaration, or a function-definition. */
23501 cp_parser_block_declaration (parser
, /*statement_p=*/false);
23504 /* Parse a method signature. */
23507 cp_parser_objc_method_signature (cp_parser
* parser
, tree
* attributes
)
23509 tree rettype
, kwdparms
, optparms
;
23510 bool ellipsis
= false;
23511 bool is_class_method
;
23513 is_class_method
= cp_parser_objc_method_type (parser
);
23514 rettype
= cp_parser_objc_typename (parser
);
23515 *attributes
= NULL_TREE
;
23516 kwdparms
= cp_parser_objc_method_keyword_params (parser
, attributes
);
23517 if (kwdparms
== error_mark_node
)
23518 return error_mark_node
;
23519 optparms
= cp_parser_objc_method_tail_params_opt (parser
, &ellipsis
, attributes
);
23520 if (optparms
== error_mark_node
)
23521 return error_mark_node
;
23523 return objc_build_method_signature (is_class_method
, rettype
, kwdparms
, optparms
, ellipsis
);
23527 cp_parser_objc_method_maybe_bad_prefix_attributes (cp_parser
* parser
)
23530 cp_lexer_save_tokens (parser
->lexer
);
23531 tattr
= cp_parser_attributes_opt (parser
);
23532 gcc_assert (tattr
) ;
23534 /* If the attributes are followed by a method introducer, this is not allowed.
23535 Dump the attributes and flag the situation. */
23536 if (cp_lexer_next_token_is (parser
->lexer
, CPP_PLUS
)
23537 || cp_lexer_next_token_is (parser
->lexer
, CPP_MINUS
))
23540 /* Otherwise, the attributes introduce some interstitial code, possibly so
23541 rewind to allow that check. */
23542 cp_lexer_rollback_tokens (parser
->lexer
);
23546 /* Parse an Objective-C method prototype list. */
23549 cp_parser_objc_method_prototype_list (cp_parser
* parser
)
23551 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23553 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
23555 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
23557 tree attributes
, sig
;
23558 bool is_class_method
;
23559 if (token
->type
== CPP_PLUS
)
23560 is_class_method
= true;
23562 is_class_method
= false;
23563 sig
= cp_parser_objc_method_signature (parser
, &attributes
);
23564 if (sig
== error_mark_node
)
23566 cp_parser_skip_to_end_of_block_or_statement (parser
);
23567 token
= cp_lexer_peek_token (parser
->lexer
);
23570 objc_add_method_declaration (is_class_method
, sig
, attributes
);
23571 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23573 else if (token
->keyword
== RID_AT_PROPERTY
)
23574 cp_parser_objc_at_property_declaration (parser
);
23575 else if (token
->keyword
== RID_ATTRIBUTE
23576 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
23577 warning_at (cp_lexer_peek_token (parser
->lexer
)->location
,
23579 "prefix attributes are ignored for methods");
23581 /* Allow for interspersed non-ObjC++ code. */
23582 cp_parser_objc_interstitial_code (parser
);
23584 token
= cp_lexer_peek_token (parser
->lexer
);
23587 if (token
->type
!= CPP_EOF
)
23588 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
23590 cp_parser_error (parser
, "expected %<@end%>");
23592 objc_finish_interface ();
23595 /* Parse an Objective-C method definition list. */
23598 cp_parser_objc_method_definition_list (cp_parser
* parser
)
23600 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23602 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
23606 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
23609 tree sig
, attribute
;
23610 bool is_class_method
;
23611 if (token
->type
== CPP_PLUS
)
23612 is_class_method
= true;
23614 is_class_method
= false;
23615 push_deferring_access_checks (dk_deferred
);
23616 sig
= cp_parser_objc_method_signature (parser
, &attribute
);
23617 if (sig
== error_mark_node
)
23619 cp_parser_skip_to_end_of_block_or_statement (parser
);
23620 token
= cp_lexer_peek_token (parser
->lexer
);
23623 objc_start_method_definition (is_class_method
, sig
, attribute
,
23626 /* For historical reasons, we accept an optional semicolon. */
23627 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
23628 cp_lexer_consume_token (parser
->lexer
);
23630 ptk
= cp_lexer_peek_token (parser
->lexer
);
23631 if (!(ptk
->type
== CPP_PLUS
|| ptk
->type
== CPP_MINUS
23632 || ptk
->type
== CPP_EOF
|| ptk
->keyword
== RID_AT_END
))
23634 perform_deferred_access_checks ();
23635 stop_deferring_access_checks ();
23636 meth
= cp_parser_function_definition_after_declarator (parser
,
23638 pop_deferring_access_checks ();
23639 objc_finish_method_definition (meth
);
23642 /* The following case will be removed once @synthesize is
23643 completely implemented. */
23644 else if (token
->keyword
== RID_AT_PROPERTY
)
23645 cp_parser_objc_at_property_declaration (parser
);
23646 else if (token
->keyword
== RID_AT_SYNTHESIZE
)
23647 cp_parser_objc_at_synthesize_declaration (parser
);
23648 else if (token
->keyword
== RID_AT_DYNAMIC
)
23649 cp_parser_objc_at_dynamic_declaration (parser
);
23650 else if (token
->keyword
== RID_ATTRIBUTE
23651 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
23652 warning_at (token
->location
, OPT_Wattributes
,
23653 "prefix attributes are ignored for methods");
23655 /* Allow for interspersed non-ObjC++ code. */
23656 cp_parser_objc_interstitial_code (parser
);
23658 token
= cp_lexer_peek_token (parser
->lexer
);
23661 if (token
->type
!= CPP_EOF
)
23662 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
23664 cp_parser_error (parser
, "expected %<@end%>");
23666 objc_finish_implementation ();
23669 /* Parse Objective-C ivars. */
23672 cp_parser_objc_class_ivars (cp_parser
* parser
)
23674 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23676 if (token
->type
!= CPP_OPEN_BRACE
)
23677 return; /* No ivars specified. */
23679 cp_lexer_consume_token (parser
->lexer
); /* Eat '{'. */
23680 token
= cp_lexer_peek_token (parser
->lexer
);
23682 while (token
->type
!= CPP_CLOSE_BRACE
23683 && token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
23685 cp_decl_specifier_seq declspecs
;
23686 int decl_class_or_enum_p
;
23687 tree prefix_attributes
;
23689 cp_parser_objc_visibility_spec (parser
);
23691 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
23694 cp_parser_decl_specifier_seq (parser
,
23695 CP_PARSER_FLAGS_OPTIONAL
,
23697 &decl_class_or_enum_p
);
23699 /* auto, register, static, extern, mutable. */
23700 if (declspecs
.storage_class
!= sc_none
)
23702 cp_parser_error (parser
, "invalid type for instance variable");
23703 declspecs
.storage_class
= sc_none
;
23707 if (declspecs
.specs
[(int) ds_thread
])
23709 cp_parser_error (parser
, "invalid type for instance variable");
23710 declspecs
.specs
[(int) ds_thread
] = 0;
23714 if (declspecs
.specs
[(int) ds_typedef
])
23716 cp_parser_error (parser
, "invalid type for instance variable");
23717 declspecs
.specs
[(int) ds_typedef
] = 0;
23720 prefix_attributes
= declspecs
.attributes
;
23721 declspecs
.attributes
= NULL_TREE
;
23723 /* Keep going until we hit the `;' at the end of the
23725 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
23727 tree width
= NULL_TREE
, attributes
, first_attribute
, decl
;
23728 cp_declarator
*declarator
= NULL
;
23729 int ctor_dtor_or_conv_p
;
23731 /* Check for a (possibly unnamed) bitfield declaration. */
23732 token
= cp_lexer_peek_token (parser
->lexer
);
23733 if (token
->type
== CPP_COLON
)
23736 if (token
->type
== CPP_NAME
23737 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
23740 /* Get the name of the bitfield. */
23741 declarator
= make_id_declarator (NULL_TREE
,
23742 cp_parser_identifier (parser
),
23746 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
23747 /* Get the width of the bitfield. */
23749 = cp_parser_constant_expression (parser
,
23750 /*allow_non_constant=*/false,
23755 /* Parse the declarator. */
23757 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
23758 &ctor_dtor_or_conv_p
,
23759 /*parenthesized_p=*/NULL
,
23760 /*member_p=*/false);
23763 /* Look for attributes that apply to the ivar. */
23764 attributes
= cp_parser_attributes_opt (parser
);
23765 /* Remember which attributes are prefix attributes and
23767 first_attribute
= attributes
;
23768 /* Combine the attributes. */
23769 attributes
= chainon (prefix_attributes
, attributes
);
23772 /* Create the bitfield declaration. */
23773 decl
= grokbitfield (declarator
, &declspecs
,
23777 decl
= grokfield (declarator
, &declspecs
,
23778 NULL_TREE
, /*init_const_expr_p=*/false,
23779 NULL_TREE
, attributes
);
23781 /* Add the instance variable. */
23782 if (decl
!= error_mark_node
&& decl
!= NULL_TREE
)
23783 objc_add_instance_variable (decl
);
23785 /* Reset PREFIX_ATTRIBUTES. */
23786 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
23787 attributes
= TREE_CHAIN (attributes
);
23789 TREE_CHAIN (attributes
) = NULL_TREE
;
23791 token
= cp_lexer_peek_token (parser
->lexer
);
23793 if (token
->type
== CPP_COMMA
)
23795 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
23801 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23802 token
= cp_lexer_peek_token (parser
->lexer
);
23805 if (token
->keyword
== RID_AT_END
)
23806 cp_parser_error (parser
, "expected %<}%>");
23808 /* Do not consume the RID_AT_END, so it will be read again as terminating
23809 the @interface of @implementation. */
23810 if (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
23811 cp_lexer_consume_token (parser
->lexer
); /* Eat '}'. */
23813 /* For historical reasons, we accept an optional semicolon. */
23814 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
23815 cp_lexer_consume_token (parser
->lexer
);
23818 /* Parse an Objective-C protocol declaration. */
23821 cp_parser_objc_protocol_declaration (cp_parser
* parser
, tree attributes
)
23823 tree proto
, protorefs
;
23826 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
23827 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
23829 tok
= cp_lexer_peek_token (parser
->lexer
);
23830 error_at (tok
->location
, "identifier expected after %<@protocol%>");
23831 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23835 /* See if we have a forward declaration or a definition. */
23836 tok
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
23838 /* Try a forward declaration first. */
23839 if (tok
->type
== CPP_COMMA
|| tok
->type
== CPP_SEMICOLON
)
23845 id
= cp_parser_identifier (parser
);
23846 if (id
== error_mark_node
)
23849 objc_declare_protocol (id
, attributes
);
23851 if(cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23852 cp_lexer_consume_token (parser
->lexer
);
23856 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23859 /* Ok, we got a full-fledged definition (or at least should). */
23862 proto
= cp_parser_identifier (parser
);
23863 protorefs
= cp_parser_objc_protocol_refs_opt (parser
);
23864 objc_start_protocol (proto
, protorefs
, attributes
);
23865 cp_parser_objc_method_prototype_list (parser
);
23869 /* Parse an Objective-C superclass or category. */
23872 cp_parser_objc_superclass_or_category (cp_parser
*parser
,
23875 tree
*categ
, bool *is_class_extension
)
23877 cp_token
*next
= cp_lexer_peek_token (parser
->lexer
);
23879 *super
= *categ
= NULL_TREE
;
23880 *is_class_extension
= false;
23881 if (next
->type
== CPP_COLON
)
23883 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
23884 *super
= cp_parser_identifier (parser
);
23886 else if (next
->type
== CPP_OPEN_PAREN
)
23888 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
23890 /* If there is no category name, and this is an @interface, we
23891 have a class extension. */
23892 if (iface_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
23894 *categ
= NULL_TREE
;
23895 *is_class_extension
= true;
23898 *categ
= cp_parser_identifier (parser
);
23900 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23904 /* Parse an Objective-C class interface. */
23907 cp_parser_objc_class_interface (cp_parser
* parser
, tree attributes
)
23909 tree name
, super
, categ
, protos
;
23910 bool is_class_extension
;
23912 cp_lexer_consume_token (parser
->lexer
); /* Eat '@interface'. */
23913 name
= cp_parser_identifier (parser
);
23914 if (name
== error_mark_node
)
23916 /* It's hard to recover because even if valid @interface stuff
23917 is to follow, we can't compile it (or validate it) if we
23918 don't even know which class it refers to. Let's assume this
23919 was a stray '@interface' token in the stream and skip it.
23923 cp_parser_objc_superclass_or_category (parser
, true, &super
, &categ
,
23924 &is_class_extension
);
23925 protos
= cp_parser_objc_protocol_refs_opt (parser
);
23927 /* We have either a class or a category on our hands. */
23928 if (categ
|| is_class_extension
)
23929 objc_start_category_interface (name
, categ
, protos
, attributes
);
23932 objc_start_class_interface (name
, super
, protos
, attributes
);
23933 /* Handle instance variable declarations, if any. */
23934 cp_parser_objc_class_ivars (parser
);
23935 objc_continue_interface ();
23938 cp_parser_objc_method_prototype_list (parser
);
23941 /* Parse an Objective-C class implementation. */
23944 cp_parser_objc_class_implementation (cp_parser
* parser
)
23946 tree name
, super
, categ
;
23947 bool is_class_extension
;
23949 cp_lexer_consume_token (parser
->lexer
); /* Eat '@implementation'. */
23950 name
= cp_parser_identifier (parser
);
23951 if (name
== error_mark_node
)
23953 /* It's hard to recover because even if valid @implementation
23954 stuff is to follow, we can't compile it (or validate it) if
23955 we don't even know which class it refers to. Let's assume
23956 this was a stray '@implementation' token in the stream and
23961 cp_parser_objc_superclass_or_category (parser
, false, &super
, &categ
,
23962 &is_class_extension
);
23964 /* We have either a class or a category on our hands. */
23966 objc_start_category_implementation (name
, categ
);
23969 objc_start_class_implementation (name
, super
);
23970 /* Handle instance variable declarations, if any. */
23971 cp_parser_objc_class_ivars (parser
);
23972 objc_continue_implementation ();
23975 cp_parser_objc_method_definition_list (parser
);
23978 /* Consume the @end token and finish off the implementation. */
23981 cp_parser_objc_end_implementation (cp_parser
* parser
)
23983 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
23984 objc_finish_implementation ();
23987 /* Parse an Objective-C declaration. */
23990 cp_parser_objc_declaration (cp_parser
* parser
, tree attributes
)
23992 /* Try to figure out what kind of declaration is present. */
23993 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
23996 switch (kwd
->keyword
)
24001 error_at (kwd
->location
, "attributes may not be specified before"
24002 " the %<@%D%> Objective-C++ keyword",
24006 case RID_AT_IMPLEMENTATION
:
24007 warning_at (kwd
->location
, OPT_Wattributes
,
24008 "prefix attributes are ignored before %<@%D%>",
24015 switch (kwd
->keyword
)
24018 cp_parser_objc_alias_declaration (parser
);
24021 cp_parser_objc_class_declaration (parser
);
24023 case RID_AT_PROTOCOL
:
24024 cp_parser_objc_protocol_declaration (parser
, attributes
);
24026 case RID_AT_INTERFACE
:
24027 cp_parser_objc_class_interface (parser
, attributes
);
24029 case RID_AT_IMPLEMENTATION
:
24030 cp_parser_objc_class_implementation (parser
);
24033 cp_parser_objc_end_implementation (parser
);
24036 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
24038 cp_parser_skip_to_end_of_block_or_statement (parser
);
24042 /* Parse an Objective-C try-catch-finally statement.
24044 objc-try-catch-finally-stmt:
24045 @try compound-statement objc-catch-clause-seq [opt]
24046 objc-finally-clause [opt]
24048 objc-catch-clause-seq:
24049 objc-catch-clause objc-catch-clause-seq [opt]
24052 @catch ( objc-exception-declaration ) compound-statement
24054 objc-finally-clause:
24055 @finally compound-statement
24057 objc-exception-declaration:
24058 parameter-declaration
24061 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24065 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24066 for C. Keep them in sync. */
24069 cp_parser_objc_try_catch_finally_statement (cp_parser
*parser
)
24071 location_t location
;
24074 cp_parser_require_keyword (parser
, RID_AT_TRY
, RT_AT_TRY
);
24075 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
24076 objc_maybe_warn_exceptions (location
);
24077 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24078 node, lest it get absorbed into the surrounding block. */
24079 stmt
= push_stmt_list ();
24080 cp_parser_compound_statement (parser
, NULL
, false, false);
24081 objc_begin_try_stmt (location
, pop_stmt_list (stmt
));
24083 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_CATCH
))
24085 cp_parameter_declarator
*parm
;
24086 tree parameter_declaration
= error_mark_node
;
24087 bool seen_open_paren
= false;
24089 cp_lexer_consume_token (parser
->lexer
);
24090 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24091 seen_open_paren
= true;
24092 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
24094 /* We have "@catch (...)" (where the '...' are literally
24095 what is in the code). Skip the '...'.
24096 parameter_declaration is set to NULL_TREE, and
24097 objc_being_catch_clauses() knows that that means
24099 cp_lexer_consume_token (parser
->lexer
);
24100 parameter_declaration
= NULL_TREE
;
24104 /* We have "@catch (NSException *exception)" or something
24105 like that. Parse the parameter declaration. */
24106 parm
= cp_parser_parameter_declaration (parser
, false, NULL
);
24108 parameter_declaration
= error_mark_node
;
24110 parameter_declaration
= grokdeclarator (parm
->declarator
,
24111 &parm
->decl_specifiers
,
24112 PARM
, /*initialized=*/0,
24113 /*attrlist=*/NULL
);
24115 if (seen_open_paren
)
24116 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
24119 /* If there was no open parenthesis, we are recovering from
24120 an error, and we are trying to figure out what mistake
24121 the user has made. */
24123 /* If there is an immediate closing parenthesis, the user
24124 probably forgot the opening one (ie, they typed "@catch
24125 NSException *e)". Parse the closing parenthesis and keep
24127 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
24128 cp_lexer_consume_token (parser
->lexer
);
24130 /* If these is no immediate closing parenthesis, the user
24131 probably doesn't know that parenthesis are required at
24132 all (ie, they typed "@catch NSException *e"). So, just
24133 forget about the closing parenthesis and keep going. */
24135 objc_begin_catch_clause (parameter_declaration
);
24136 cp_parser_compound_statement (parser
, NULL
, false, false);
24137 objc_finish_catch_clause ();
24139 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_FINALLY
))
24141 cp_lexer_consume_token (parser
->lexer
);
24142 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
24143 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24144 node, lest it get absorbed into the surrounding block. */
24145 stmt
= push_stmt_list ();
24146 cp_parser_compound_statement (parser
, NULL
, false, false);
24147 objc_build_finally_clause (location
, pop_stmt_list (stmt
));
24150 return objc_finish_try_stmt ();
24153 /* Parse an Objective-C synchronized statement.
24155 objc-synchronized-stmt:
24156 @synchronized ( expression ) compound-statement
24158 Returns NULL_TREE. */
24161 cp_parser_objc_synchronized_statement (cp_parser
*parser
)
24163 location_t location
;
24166 cp_parser_require_keyword (parser
, RID_AT_SYNCHRONIZED
, RT_AT_SYNCHRONIZED
);
24168 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
24169 objc_maybe_warn_exceptions (location
);
24170 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
24171 lock
= cp_parser_expression (parser
, false, NULL
);
24172 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
24174 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24175 node, lest it get absorbed into the surrounding block. */
24176 stmt
= push_stmt_list ();
24177 cp_parser_compound_statement (parser
, NULL
, false, false);
24179 return objc_build_synchronized (location
, lock
, pop_stmt_list (stmt
));
24182 /* Parse an Objective-C throw statement.
24185 @throw assignment-expression [opt] ;
24187 Returns a constructed '@throw' statement. */
24190 cp_parser_objc_throw_statement (cp_parser
*parser
)
24192 tree expr
= NULL_TREE
;
24193 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24195 cp_parser_require_keyword (parser
, RID_AT_THROW
, RT_AT_THROW
);
24197 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
24198 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
24200 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24202 return objc_build_throw_stmt (loc
, expr
);
24205 /* Parse an Objective-C statement. */
24208 cp_parser_objc_statement (cp_parser
* parser
)
24210 /* Try to figure out what kind of declaration is present. */
24211 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
24213 switch (kwd
->keyword
)
24216 return cp_parser_objc_try_catch_finally_statement (parser
);
24217 case RID_AT_SYNCHRONIZED
:
24218 return cp_parser_objc_synchronized_statement (parser
);
24220 return cp_parser_objc_throw_statement (parser
);
24222 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
24224 cp_parser_skip_to_end_of_block_or_statement (parser
);
24227 return error_mark_node
;
24230 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24231 look ahead to see if an objc keyword follows the attributes. This
24232 is to detect the use of prefix attributes on ObjC @interface and
24236 cp_parser_objc_valid_prefix_attributes (cp_parser
* parser
, tree
*attrib
)
24238 cp_lexer_save_tokens (parser
->lexer
);
24239 *attrib
= cp_parser_attributes_opt (parser
);
24240 gcc_assert (*attrib
);
24241 if (OBJC_IS_AT_KEYWORD (cp_lexer_peek_token (parser
->lexer
)->keyword
))
24243 cp_lexer_commit_tokens (parser
->lexer
);
24246 cp_lexer_rollback_tokens (parser
->lexer
);
24250 /* This routine is a minimal replacement for
24251 c_parser_struct_declaration () used when parsing the list of
24252 types/names or ObjC++ properties. For example, when parsing the
24255 @property (readonly) int a, b, c;
24257 this function is responsible for parsing "int a, int b, int c" and
24258 returning the declarations as CHAIN of DECLs.
24260 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24261 similar parsing. */
24263 cp_parser_objc_struct_declaration (cp_parser
*parser
)
24265 tree decls
= NULL_TREE
;
24266 cp_decl_specifier_seq declspecs
;
24267 int decl_class_or_enum_p
;
24268 tree prefix_attributes
;
24270 cp_parser_decl_specifier_seq (parser
,
24271 CP_PARSER_FLAGS_NONE
,
24273 &decl_class_or_enum_p
);
24275 if (declspecs
.type
== error_mark_node
)
24276 return error_mark_node
;
24278 /* auto, register, static, extern, mutable. */
24279 if (declspecs
.storage_class
!= sc_none
)
24281 cp_parser_error (parser
, "invalid type for property");
24282 declspecs
.storage_class
= sc_none
;
24286 if (declspecs
.specs
[(int) ds_thread
])
24288 cp_parser_error (parser
, "invalid type for property");
24289 declspecs
.specs
[(int) ds_thread
] = 0;
24293 if (declspecs
.specs
[(int) ds_typedef
])
24295 cp_parser_error (parser
, "invalid type for property");
24296 declspecs
.specs
[(int) ds_typedef
] = 0;
24299 prefix_attributes
= declspecs
.attributes
;
24300 declspecs
.attributes
= NULL_TREE
;
24302 /* Keep going until we hit the `;' at the end of the declaration. */
24303 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
24305 tree attributes
, first_attribute
, decl
;
24306 cp_declarator
*declarator
;
24309 /* Parse the declarator. */
24310 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
24311 NULL
, NULL
, false);
24313 /* Look for attributes that apply to the ivar. */
24314 attributes
= cp_parser_attributes_opt (parser
);
24315 /* Remember which attributes are prefix attributes and
24317 first_attribute
= attributes
;
24318 /* Combine the attributes. */
24319 attributes
= chainon (prefix_attributes
, attributes
);
24321 decl
= grokfield (declarator
, &declspecs
,
24322 NULL_TREE
, /*init_const_expr_p=*/false,
24323 NULL_TREE
, attributes
);
24325 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
24326 return error_mark_node
;
24328 /* Reset PREFIX_ATTRIBUTES. */
24329 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
24330 attributes
= TREE_CHAIN (attributes
);
24332 TREE_CHAIN (attributes
) = NULL_TREE
;
24334 DECL_CHAIN (decl
) = decls
;
24337 token
= cp_lexer_peek_token (parser
->lexer
);
24338 if (token
->type
== CPP_COMMA
)
24340 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
24349 /* Parse an Objective-C @property declaration. The syntax is:
24351 objc-property-declaration:
24352 '@property' objc-property-attributes[opt] struct-declaration ;
24354 objc-property-attributes:
24355 '(' objc-property-attribute-list ')'
24357 objc-property-attribute-list:
24358 objc-property-attribute
24359 objc-property-attribute-list, objc-property-attribute
24361 objc-property-attribute
24362 'getter' = identifier
24363 'setter' = identifier
24372 @property NSString *name;
24373 @property (readonly) id object;
24374 @property (retain, nonatomic, getter=getTheName) id name;
24375 @property int a, b, c;
24377 PS: This function is identical to
24378 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24380 cp_parser_objc_at_property_declaration (cp_parser
*parser
)
24382 /* The following variables hold the attributes of the properties as
24383 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24384 seen. When we see an attribute, we set them to 'true' (if they
24385 are boolean properties) or to the identifier (if they have an
24386 argument, ie, for getter and setter). Note that here we only
24387 parse the list of attributes, check the syntax and accumulate the
24388 attributes that we find. objc_add_property_declaration() will
24389 then process the information. */
24390 bool property_assign
= false;
24391 bool property_copy
= false;
24392 tree property_getter_ident
= NULL_TREE
;
24393 bool property_nonatomic
= false;
24394 bool property_readonly
= false;
24395 bool property_readwrite
= false;
24396 bool property_retain
= false;
24397 tree property_setter_ident
= NULL_TREE
;
24399 /* 'properties' is the list of properties that we read. Usually a
24400 single one, but maybe more (eg, in "@property int a, b, c;" there
24405 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24407 cp_lexer_consume_token (parser
->lexer
); /* Eat '@property'. */
24409 /* Parse the optional attribute list... */
24410 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
24413 cp_lexer_consume_token (parser
->lexer
);
24417 bool syntax_error
= false;
24418 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
24421 if (token
->type
!= CPP_NAME
)
24423 cp_parser_error (parser
, "expected identifier");
24426 keyword
= C_RID_CODE (token
->u
.value
);
24427 cp_lexer_consume_token (parser
->lexer
);
24430 case RID_ASSIGN
: property_assign
= true; break;
24431 case RID_COPY
: property_copy
= true; break;
24432 case RID_NONATOMIC
: property_nonatomic
= true; break;
24433 case RID_READONLY
: property_readonly
= true; break;
24434 case RID_READWRITE
: property_readwrite
= true; break;
24435 case RID_RETAIN
: property_retain
= true; break;
24439 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
24441 if (keyword
== RID_GETTER
)
24442 cp_parser_error (parser
,
24443 "missing %<=%> (after %<getter%> attribute)");
24445 cp_parser_error (parser
,
24446 "missing %<=%> (after %<setter%> attribute)");
24447 syntax_error
= true;
24450 cp_lexer_consume_token (parser
->lexer
); /* eat the = */
24451 if (!cp_parser_objc_selector_p (cp_lexer_peek_token (parser
->lexer
)->type
))
24453 cp_parser_error (parser
, "expected identifier");
24454 syntax_error
= true;
24457 if (keyword
== RID_SETTER
)
24459 if (property_setter_ident
!= NULL_TREE
)
24461 cp_parser_error (parser
, "the %<setter%> attribute may only be specified once");
24462 cp_lexer_consume_token (parser
->lexer
);
24465 property_setter_ident
= cp_parser_objc_selector (parser
);
24466 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
24467 cp_parser_error (parser
, "setter name must terminate with %<:%>");
24469 cp_lexer_consume_token (parser
->lexer
);
24473 if (property_getter_ident
!= NULL_TREE
)
24475 cp_parser_error (parser
, "the %<getter%> attribute may only be specified once");
24476 cp_lexer_consume_token (parser
->lexer
);
24479 property_getter_ident
= cp_parser_objc_selector (parser
);
24483 cp_parser_error (parser
, "unknown property attribute");
24484 syntax_error
= true;
24491 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
24492 cp_lexer_consume_token (parser
->lexer
);
24497 /* FIXME: "@property (setter, assign);" will generate a spurious
24498 "error: expected ‘)’ before ‘,’ token". This is because
24499 cp_parser_require, unlike the C counterpart, will produce an
24500 error even if we are in error recovery. */
24501 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24503 cp_parser_skip_to_closing_parenthesis (parser
,
24504 /*recovering=*/true,
24505 /*or_comma=*/false,
24506 /*consume_paren=*/true);
24510 /* ... and the property declaration(s). */
24511 properties
= cp_parser_objc_struct_declaration (parser
);
24513 if (properties
== error_mark_node
)
24515 cp_parser_skip_to_end_of_statement (parser
);
24516 /* If the next token is now a `;', consume it. */
24517 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
24518 cp_lexer_consume_token (parser
->lexer
);
24522 if (properties
== NULL_TREE
)
24523 cp_parser_error (parser
, "expected identifier");
24526 /* Comma-separated properties are chained together in
24527 reverse order; add them one by one. */
24528 properties
= nreverse (properties
);
24530 for (; properties
; properties
= TREE_CHAIN (properties
))
24531 objc_add_property_declaration (loc
, copy_node (properties
),
24532 property_readonly
, property_readwrite
,
24533 property_assign
, property_retain
,
24534 property_copy
, property_nonatomic
,
24535 property_getter_ident
, property_setter_ident
);
24538 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24541 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24543 objc-synthesize-declaration:
24544 @synthesize objc-synthesize-identifier-list ;
24546 objc-synthesize-identifier-list:
24547 objc-synthesize-identifier
24548 objc-synthesize-identifier-list, objc-synthesize-identifier
24550 objc-synthesize-identifier
24552 identifier = identifier
24555 @synthesize MyProperty;
24556 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24558 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24559 for C. Keep them in sync.
24562 cp_parser_objc_at_synthesize_declaration (cp_parser
*parser
)
24564 tree list
= NULL_TREE
;
24566 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24568 cp_lexer_consume_token (parser
->lexer
); /* Eat '@synthesize'. */
24571 tree property
, ivar
;
24572 property
= cp_parser_identifier (parser
);
24573 if (property
== error_mark_node
)
24575 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24578 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
24580 cp_lexer_consume_token (parser
->lexer
);
24581 ivar
= cp_parser_identifier (parser
);
24582 if (ivar
== error_mark_node
)
24584 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24590 list
= chainon (list
, build_tree_list (ivar
, property
));
24591 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
24592 cp_lexer_consume_token (parser
->lexer
);
24596 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24597 objc_add_synthesize_declaration (loc
, list
);
24600 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24602 objc-dynamic-declaration:
24603 @dynamic identifier-list ;
24606 @dynamic MyProperty;
24607 @dynamic MyProperty, AnotherProperty;
24609 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24610 for C. Keep them in sync.
24613 cp_parser_objc_at_dynamic_declaration (cp_parser
*parser
)
24615 tree list
= NULL_TREE
;
24617 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24619 cp_lexer_consume_token (parser
->lexer
); /* Eat '@dynamic'. */
24623 property
= cp_parser_identifier (parser
);
24624 if (property
== error_mark_node
)
24626 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24629 list
= chainon (list
, build_tree_list (NULL
, property
));
24630 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
24631 cp_lexer_consume_token (parser
->lexer
);
24635 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24636 objc_add_dynamic_declaration (loc
, list
);
24640 /* OpenMP 2.5 parsing routines. */
24642 /* Returns name of the next clause.
24643 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
24644 the token is not consumed. Otherwise appropriate pragma_omp_clause is
24645 returned and the token is consumed. */
24647 static pragma_omp_clause
24648 cp_parser_omp_clause_name (cp_parser
*parser
)
24650 pragma_omp_clause result
= PRAGMA_OMP_CLAUSE_NONE
;
24652 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_IF
))
24653 result
= PRAGMA_OMP_CLAUSE_IF
;
24654 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DEFAULT
))
24655 result
= PRAGMA_OMP_CLAUSE_DEFAULT
;
24656 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_PRIVATE
))
24657 result
= PRAGMA_OMP_CLAUSE_PRIVATE
;
24658 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
24660 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
24661 const char *p
= IDENTIFIER_POINTER (id
);
24666 if (!strcmp ("collapse", p
))
24667 result
= PRAGMA_OMP_CLAUSE_COLLAPSE
;
24668 else if (!strcmp ("copyin", p
))
24669 result
= PRAGMA_OMP_CLAUSE_COPYIN
;
24670 else if (!strcmp ("copyprivate", p
))
24671 result
= PRAGMA_OMP_CLAUSE_COPYPRIVATE
;
24674 if (!strcmp ("final", p
))
24675 result
= PRAGMA_OMP_CLAUSE_FINAL
;
24676 else if (!strcmp ("firstprivate", p
))
24677 result
= PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
;
24680 if (!strcmp ("lastprivate", p
))
24681 result
= PRAGMA_OMP_CLAUSE_LASTPRIVATE
;
24684 if (!strcmp ("mergeable", p
))
24685 result
= PRAGMA_OMP_CLAUSE_MERGEABLE
;
24688 if (!strcmp ("nowait", p
))
24689 result
= PRAGMA_OMP_CLAUSE_NOWAIT
;
24690 else if (!strcmp ("num_threads", p
))
24691 result
= PRAGMA_OMP_CLAUSE_NUM_THREADS
;
24694 if (!strcmp ("ordered", p
))
24695 result
= PRAGMA_OMP_CLAUSE_ORDERED
;
24698 if (!strcmp ("reduction", p
))
24699 result
= PRAGMA_OMP_CLAUSE_REDUCTION
;
24702 if (!strcmp ("schedule", p
))
24703 result
= PRAGMA_OMP_CLAUSE_SCHEDULE
;
24704 else if (!strcmp ("shared", p
))
24705 result
= PRAGMA_OMP_CLAUSE_SHARED
;
24708 if (!strcmp ("untied", p
))
24709 result
= PRAGMA_OMP_CLAUSE_UNTIED
;
24714 if (result
!= PRAGMA_OMP_CLAUSE_NONE
)
24715 cp_lexer_consume_token (parser
->lexer
);
24720 /* Validate that a clause of the given type does not already exist. */
24723 check_no_duplicate_clause (tree clauses
, enum omp_clause_code code
,
24724 const char *name
, location_t location
)
24728 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
24729 if (OMP_CLAUSE_CODE (c
) == code
)
24731 error_at (location
, "too many %qs clauses", name
);
24739 variable-list , identifier
24741 In addition, we match a closing parenthesis. An opening parenthesis
24742 will have been consumed by the caller.
24744 If KIND is nonzero, create the appropriate node and install the decl
24745 in OMP_CLAUSE_DECL and add the node to the head of the list.
24747 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
24748 return the list created. */
24751 cp_parser_omp_var_list_no_open (cp_parser
*parser
, enum omp_clause_code kind
,
24759 token
= cp_lexer_peek_token (parser
->lexer
);
24760 name
= cp_parser_id_expression (parser
, /*template_p=*/false,
24761 /*check_dependency_p=*/true,
24762 /*template_p=*/NULL
,
24763 /*declarator_p=*/false,
24764 /*optional_p=*/false);
24765 if (name
== error_mark_node
)
24768 decl
= cp_parser_lookup_name_simple (parser
, name
, token
->location
);
24769 if (decl
== error_mark_node
)
24770 cp_parser_name_lookup_error (parser
, name
, decl
, NLE_NULL
,
24772 else if (kind
!= 0)
24774 tree u
= build_omp_clause (token
->location
, kind
);
24775 OMP_CLAUSE_DECL (u
) = decl
;
24776 OMP_CLAUSE_CHAIN (u
) = list
;
24780 list
= tree_cons (decl
, NULL_TREE
, list
);
24783 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
24785 cp_lexer_consume_token (parser
->lexer
);
24788 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24792 /* Try to resync to an unnested comma. Copied from
24793 cp_parser_parenthesized_expression_list. */
24795 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
24796 /*recovering=*/true,
24798 /*consume_paren=*/true);
24806 /* Similarly, but expect leading and trailing parenthesis. This is a very
24807 common case for omp clauses. */
24810 cp_parser_omp_var_list (cp_parser
*parser
, enum omp_clause_code kind
, tree list
)
24812 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24813 return cp_parser_omp_var_list_no_open (parser
, kind
, list
);
24818 collapse ( constant-expression ) */
24821 cp_parser_omp_clause_collapse (cp_parser
*parser
, tree list
, location_t location
)
24827 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24828 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24831 num
= cp_parser_constant_expression (parser
, false, NULL
);
24833 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24834 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
24835 /*or_comma=*/false,
24836 /*consume_paren=*/true);
24838 if (num
== error_mark_node
)
24840 num
= fold_non_dependent_expr (num
);
24841 if (!INTEGRAL_TYPE_P (TREE_TYPE (num
))
24842 || !host_integerp (num
, 0)
24843 || (n
= tree_low_cst (num
, 0)) <= 0
24846 error_at (loc
, "collapse argument needs positive constant integer expression");
24850 check_no_duplicate_clause (list
, OMP_CLAUSE_COLLAPSE
, "collapse", location
);
24851 c
= build_omp_clause (loc
, OMP_CLAUSE_COLLAPSE
);
24852 OMP_CLAUSE_CHAIN (c
) = list
;
24853 OMP_CLAUSE_COLLAPSE_EXPR (c
) = num
;
24859 default ( shared | none ) */
24862 cp_parser_omp_clause_default (cp_parser
*parser
, tree list
, location_t location
)
24864 enum omp_clause_default_kind kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
24867 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24869 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
24871 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
24872 const char *p
= IDENTIFIER_POINTER (id
);
24877 if (strcmp ("none", p
) != 0)
24879 kind
= OMP_CLAUSE_DEFAULT_NONE
;
24883 if (strcmp ("shared", p
) != 0)
24885 kind
= OMP_CLAUSE_DEFAULT_SHARED
;
24892 cp_lexer_consume_token (parser
->lexer
);
24897 cp_parser_error (parser
, "expected %<none%> or %<shared%>");
24900 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24901 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
24902 /*or_comma=*/false,
24903 /*consume_paren=*/true);
24905 if (kind
== OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
24908 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULT
, "default", location
);
24909 c
= build_omp_clause (location
, OMP_CLAUSE_DEFAULT
);
24910 OMP_CLAUSE_CHAIN (c
) = list
;
24911 OMP_CLAUSE_DEFAULT_KIND (c
) = kind
;
24917 final ( expression ) */
24920 cp_parser_omp_clause_final (cp_parser
*parser
, tree list
, location_t location
)
24924 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24927 t
= cp_parser_condition (parser
);
24929 if (t
== error_mark_node
24930 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24931 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
24932 /*or_comma=*/false,
24933 /*consume_paren=*/true);
24935 check_no_duplicate_clause (list
, OMP_CLAUSE_FINAL
, "final", location
);
24937 c
= build_omp_clause (location
, OMP_CLAUSE_FINAL
);
24938 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
24939 OMP_CLAUSE_CHAIN (c
) = list
;
24945 if ( expression ) */
24948 cp_parser_omp_clause_if (cp_parser
*parser
, tree list
, location_t location
)
24952 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24955 t
= cp_parser_condition (parser
);
24957 if (t
== error_mark_node
24958 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24959 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
24960 /*or_comma=*/false,
24961 /*consume_paren=*/true);
24963 check_no_duplicate_clause (list
, OMP_CLAUSE_IF
, "if", location
);
24965 c
= build_omp_clause (location
, OMP_CLAUSE_IF
);
24966 OMP_CLAUSE_IF_EXPR (c
) = t
;
24967 OMP_CLAUSE_CHAIN (c
) = list
;
24976 cp_parser_omp_clause_mergeable (cp_parser
*parser ATTRIBUTE_UNUSED
,
24977 tree list
, location_t location
)
24981 check_no_duplicate_clause (list
, OMP_CLAUSE_MERGEABLE
, "mergeable",
24984 c
= build_omp_clause (location
, OMP_CLAUSE_MERGEABLE
);
24985 OMP_CLAUSE_CHAIN (c
) = list
;
24993 cp_parser_omp_clause_nowait (cp_parser
*parser ATTRIBUTE_UNUSED
,
24994 tree list
, location_t location
)
24998 check_no_duplicate_clause (list
, OMP_CLAUSE_NOWAIT
, "nowait", location
);
25000 c
= build_omp_clause (location
, OMP_CLAUSE_NOWAIT
);
25001 OMP_CLAUSE_CHAIN (c
) = list
;
25006 num_threads ( expression ) */
25009 cp_parser_omp_clause_num_threads (cp_parser
*parser
, tree list
,
25010 location_t location
)
25014 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
25017 t
= cp_parser_expression (parser
, false, NULL
);
25019 if (t
== error_mark_node
25020 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
25021 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
25022 /*or_comma=*/false,
25023 /*consume_paren=*/true);
25025 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_THREADS
,
25026 "num_threads", location
);
25028 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_THREADS
);
25029 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
25030 OMP_CLAUSE_CHAIN (c
) = list
;
25039 cp_parser_omp_clause_ordered (cp_parser
*parser ATTRIBUTE_UNUSED
,
25040 tree list
, location_t location
)
25044 check_no_duplicate_clause (list
, OMP_CLAUSE_ORDERED
,
25045 "ordered", location
);
25047 c
= build_omp_clause (location
, OMP_CLAUSE_ORDERED
);
25048 OMP_CLAUSE_CHAIN (c
) = list
;
25053 reduction ( reduction-operator : variable-list )
25055 reduction-operator:
25056 One of: + * - & ^ | && ||
25060 reduction-operator:
25061 One of: + * - & ^ | && || min max */
25064 cp_parser_omp_clause_reduction (cp_parser
*parser
, tree list
)
25066 enum tree_code code
;
25069 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
25072 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
25084 code
= BIT_AND_EXPR
;
25087 code
= BIT_XOR_EXPR
;
25090 code
= BIT_IOR_EXPR
;
25093 code
= TRUTH_ANDIF_EXPR
;
25096 code
= TRUTH_ORIF_EXPR
;
25100 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
25101 const char *p
= IDENTIFIER_POINTER (id
);
25103 if (strcmp (p
, "min") == 0)
25108 if (strcmp (p
, "max") == 0)
25116 cp_parser_error (parser
, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
25117 "%<|%>, %<&&%>, %<||%>, %<min%> or %<max%>");
25119 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
25120 /*or_comma=*/false,
25121 /*consume_paren=*/true);
25124 cp_lexer_consume_token (parser
->lexer
);
25126 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
25129 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_REDUCTION
, list
);
25130 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
25131 OMP_CLAUSE_REDUCTION_CODE (c
) = code
;
25137 schedule ( schedule-kind )
25138 schedule ( schedule-kind , expression )
25141 static | dynamic | guided | runtime | auto */
25144 cp_parser_omp_clause_schedule (cp_parser
*parser
, tree list
, location_t location
)
25148 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
25151 c
= build_omp_clause (location
, OMP_CLAUSE_SCHEDULE
);
25153 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
25155 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
25156 const char *p
= IDENTIFIER_POINTER (id
);
25161 if (strcmp ("dynamic", p
) != 0)
25163 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_DYNAMIC
;
25167 if (strcmp ("guided", p
) != 0)
25169 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_GUIDED
;
25173 if (strcmp ("runtime", p
) != 0)
25175 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_RUNTIME
;
25182 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
25183 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_STATIC
;
25184 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
25185 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_AUTO
;
25188 cp_lexer_consume_token (parser
->lexer
);
25190 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
25193 cp_lexer_consume_token (parser
->lexer
);
25195 token
= cp_lexer_peek_token (parser
->lexer
);
25196 t
= cp_parser_assignment_expression (parser
, false, NULL
);
25198 if (t
== error_mark_node
)
25200 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_RUNTIME
)
25201 error_at (token
->location
, "schedule %<runtime%> does not take "
25202 "a %<chunk_size%> parameter");
25203 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_AUTO
)
25204 error_at (token
->location
, "schedule %<auto%> does not take "
25205 "a %<chunk_size%> parameter");
25207 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
25209 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
25212 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
25215 check_no_duplicate_clause (list
, OMP_CLAUSE_SCHEDULE
, "schedule", location
);
25216 OMP_CLAUSE_CHAIN (c
) = list
;
25220 cp_parser_error (parser
, "invalid schedule kind");
25222 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
25223 /*or_comma=*/false,
25224 /*consume_paren=*/true);
25232 cp_parser_omp_clause_untied (cp_parser
*parser ATTRIBUTE_UNUSED
,
25233 tree list
, location_t location
)
25237 check_no_duplicate_clause (list
, OMP_CLAUSE_UNTIED
, "untied", location
);
25239 c
= build_omp_clause (location
, OMP_CLAUSE_UNTIED
);
25240 OMP_CLAUSE_CHAIN (c
) = list
;
25244 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25245 is a bitmask in MASK. Return the list of clauses found; the result
25246 of clause default goes in *pdefault. */
25249 cp_parser_omp_all_clauses (cp_parser
*parser
, unsigned int mask
,
25250 const char *where
, cp_token
*pragma_tok
)
25252 tree clauses
= NULL
;
25254 cp_token
*token
= NULL
;
25256 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
25258 pragma_omp_clause c_kind
;
25259 const char *c_name
;
25260 tree prev
= clauses
;
25262 if (!first
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
25263 cp_lexer_consume_token (parser
->lexer
);
25265 token
= cp_lexer_peek_token (parser
->lexer
);
25266 c_kind
= cp_parser_omp_clause_name (parser
);
25271 case PRAGMA_OMP_CLAUSE_COLLAPSE
:
25272 clauses
= cp_parser_omp_clause_collapse (parser
, clauses
,
25274 c_name
= "collapse";
25276 case PRAGMA_OMP_CLAUSE_COPYIN
:
25277 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYIN
, clauses
);
25280 case PRAGMA_OMP_CLAUSE_COPYPRIVATE
:
25281 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYPRIVATE
,
25283 c_name
= "copyprivate";
25285 case PRAGMA_OMP_CLAUSE_DEFAULT
:
25286 clauses
= cp_parser_omp_clause_default (parser
, clauses
,
25288 c_name
= "default";
25290 case PRAGMA_OMP_CLAUSE_FINAL
:
25291 clauses
= cp_parser_omp_clause_final (parser
, clauses
, token
->location
);
25294 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
:
25295 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
25297 c_name
= "firstprivate";
25299 case PRAGMA_OMP_CLAUSE_IF
:
25300 clauses
= cp_parser_omp_clause_if (parser
, clauses
, token
->location
);
25303 case PRAGMA_OMP_CLAUSE_LASTPRIVATE
:
25304 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
25306 c_name
= "lastprivate";
25308 case PRAGMA_OMP_CLAUSE_MERGEABLE
:
25309 clauses
= cp_parser_omp_clause_mergeable (parser
, clauses
,
25311 c_name
= "mergeable";
25313 case PRAGMA_OMP_CLAUSE_NOWAIT
:
25314 clauses
= cp_parser_omp_clause_nowait (parser
, clauses
, token
->location
);
25317 case PRAGMA_OMP_CLAUSE_NUM_THREADS
:
25318 clauses
= cp_parser_omp_clause_num_threads (parser
, clauses
,
25320 c_name
= "num_threads";
25322 case PRAGMA_OMP_CLAUSE_ORDERED
:
25323 clauses
= cp_parser_omp_clause_ordered (parser
, clauses
,
25325 c_name
= "ordered";
25327 case PRAGMA_OMP_CLAUSE_PRIVATE
:
25328 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
25330 c_name
= "private";
25332 case PRAGMA_OMP_CLAUSE_REDUCTION
:
25333 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
25334 c_name
= "reduction";
25336 case PRAGMA_OMP_CLAUSE_SCHEDULE
:
25337 clauses
= cp_parser_omp_clause_schedule (parser
, clauses
,
25339 c_name
= "schedule";
25341 case PRAGMA_OMP_CLAUSE_SHARED
:
25342 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_SHARED
,
25346 case PRAGMA_OMP_CLAUSE_UNTIED
:
25347 clauses
= cp_parser_omp_clause_untied (parser
, clauses
,
25352 cp_parser_error (parser
, "expected %<#pragma omp%> clause");
25356 if (((mask
>> c_kind
) & 1) == 0)
25358 /* Remove the invalid clause(s) from the list to avoid
25359 confusing the rest of the compiler. */
25361 error_at (token
->location
, "%qs is not valid for %qs", c_name
, where
);
25365 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
25366 return finish_omp_clauses (clauses
);
25373 In practice, we're also interested in adding the statement to an
25374 outer node. So it is convenient if we work around the fact that
25375 cp_parser_statement calls add_stmt. */
25378 cp_parser_begin_omp_structured_block (cp_parser
*parser
)
25380 unsigned save
= parser
->in_statement
;
25382 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25383 This preserves the "not within loop or switch" style error messages
25384 for nonsense cases like
25390 if (parser
->in_statement
)
25391 parser
->in_statement
= IN_OMP_BLOCK
;
25397 cp_parser_end_omp_structured_block (cp_parser
*parser
, unsigned save
)
25399 parser
->in_statement
= save
;
25403 cp_parser_omp_structured_block (cp_parser
*parser
)
25405 tree stmt
= begin_omp_structured_block ();
25406 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
25408 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
25410 cp_parser_end_omp_structured_block (parser
, save
);
25411 return finish_omp_structured_block (stmt
);
25415 # pragma omp atomic new-line
25419 x binop= expr | x++ | ++x | x-- | --x
25421 +, *, -, /, &, ^, |, <<, >>
25423 where x is an lvalue expression with scalar type.
25426 # pragma omp atomic new-line
25429 # pragma omp atomic read new-line
25432 # pragma omp atomic write new-line
25435 # pragma omp atomic update new-line
25438 # pragma omp atomic capture new-line
25441 # pragma omp atomic capture new-line
25449 expression-stmt | x = x binop expr
25451 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25453 { v = x; update-stmt; } | { update-stmt; v = x; }
25455 where x and v are lvalue expressions with scalar type. */
25458 cp_parser_omp_atomic (cp_parser
*parser
, cp_token
*pragma_tok
)
25460 tree lhs
= NULL_TREE
, rhs
= NULL_TREE
, v
= NULL_TREE
, lhs1
= NULL_TREE
;
25461 tree rhs1
= NULL_TREE
, orig_lhs
;
25462 enum tree_code code
= OMP_ATOMIC
, opcode
= NOP_EXPR
;
25463 bool structured_block
= false;
25465 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
25467 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
25468 const char *p
= IDENTIFIER_POINTER (id
);
25470 if (!strcmp (p
, "read"))
25471 code
= OMP_ATOMIC_READ
;
25472 else if (!strcmp (p
, "write"))
25474 else if (!strcmp (p
, "update"))
25476 else if (!strcmp (p
, "capture"))
25477 code
= OMP_ATOMIC_CAPTURE_NEW
;
25481 cp_lexer_consume_token (parser
->lexer
);
25483 cp_parser_require_pragma_eol (parser
, pragma_tok
);
25487 case OMP_ATOMIC_READ
:
25488 case NOP_EXPR
: /* atomic write */
25489 v
= cp_parser_unary_expression (parser
, /*address_p=*/false,
25490 /*cast_p=*/false, NULL
);
25491 if (v
== error_mark_node
)
25493 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
25495 if (code
== NOP_EXPR
)
25496 lhs
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
25498 lhs
= cp_parser_unary_expression (parser
, /*address_p=*/false,
25499 /*cast_p=*/false, NULL
);
25500 if (lhs
== error_mark_node
)
25502 if (code
== NOP_EXPR
)
25504 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25512 case OMP_ATOMIC_CAPTURE_NEW
:
25513 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
25515 cp_lexer_consume_token (parser
->lexer
);
25516 structured_block
= true;
25520 v
= cp_parser_unary_expression (parser
, /*address_p=*/false,
25521 /*cast_p=*/false, NULL
);
25522 if (v
== error_mark_node
)
25524 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
25532 lhs
= cp_parser_unary_expression (parser
, /*address_p=*/false,
25533 /*cast_p=*/false, NULL
);
25535 switch (TREE_CODE (lhs
))
25540 case POSTINCREMENT_EXPR
:
25541 if (code
== OMP_ATOMIC_CAPTURE_NEW
&& !structured_block
)
25542 code
= OMP_ATOMIC_CAPTURE_OLD
;
25544 case PREINCREMENT_EXPR
:
25545 lhs
= TREE_OPERAND (lhs
, 0);
25546 opcode
= PLUS_EXPR
;
25547 rhs
= integer_one_node
;
25550 case POSTDECREMENT_EXPR
:
25551 if (code
== OMP_ATOMIC_CAPTURE_NEW
&& !structured_block
)
25552 code
= OMP_ATOMIC_CAPTURE_OLD
;
25554 case PREDECREMENT_EXPR
:
25555 lhs
= TREE_OPERAND (lhs
, 0);
25556 opcode
= MINUS_EXPR
;
25557 rhs
= integer_one_node
;
25560 case COMPOUND_EXPR
:
25561 if (TREE_CODE (TREE_OPERAND (lhs
, 0)) == SAVE_EXPR
25562 && TREE_CODE (TREE_OPERAND (lhs
, 1)) == COMPOUND_EXPR
25563 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0)) == MODIFY_EXPR
25564 && TREE_OPERAND (TREE_OPERAND (lhs
, 1), 1) == TREE_OPERAND (lhs
, 0)
25565 && TREE_CODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND
25566 (TREE_OPERAND (lhs
, 1), 0), 0)))
25568 /* Undo effects of boolean_increment for post {in,de}crement. */
25569 lhs
= TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0);
25572 if (TREE_CODE (lhs
) == MODIFY_EXPR
25573 && TREE_CODE (TREE_TYPE (TREE_OPERAND (lhs
, 0))) == BOOLEAN_TYPE
)
25575 /* Undo effects of boolean_increment. */
25576 if (integer_onep (TREE_OPERAND (lhs
, 1)))
25578 /* This is pre or post increment. */
25579 rhs
= TREE_OPERAND (lhs
, 1);
25580 lhs
= TREE_OPERAND (lhs
, 0);
25582 if (code
== OMP_ATOMIC_CAPTURE_NEW
25583 && !structured_block
25584 && TREE_CODE (orig_lhs
) == COMPOUND_EXPR
)
25585 code
= OMP_ATOMIC_CAPTURE_OLD
;
25591 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
25594 opcode
= MULT_EXPR
;
25597 opcode
= TRUNC_DIV_EXPR
;
25600 opcode
= PLUS_EXPR
;
25603 opcode
= MINUS_EXPR
;
25605 case CPP_LSHIFT_EQ
:
25606 opcode
= LSHIFT_EXPR
;
25608 case CPP_RSHIFT_EQ
:
25609 opcode
= RSHIFT_EXPR
;
25612 opcode
= BIT_AND_EXPR
;
25615 opcode
= BIT_IOR_EXPR
;
25618 opcode
= BIT_XOR_EXPR
;
25621 if (structured_block
|| code
== OMP_ATOMIC
)
25623 enum cp_parser_prec oprec
;
25625 cp_lexer_consume_token (parser
->lexer
);
25626 rhs1
= cp_parser_unary_expression (parser
, /*address_p=*/false,
25627 /*cast_p=*/false, NULL
);
25628 if (rhs1
== error_mark_node
)
25630 token
= cp_lexer_peek_token (parser
->lexer
);
25631 switch (token
->type
)
25633 case CPP_SEMICOLON
:
25634 if (code
== OMP_ATOMIC_CAPTURE_NEW
)
25636 code
= OMP_ATOMIC_CAPTURE_OLD
;
25641 cp_lexer_consume_token (parser
->lexer
);
25644 cp_parser_error (parser
,
25645 "invalid form of %<#pragma omp atomic%>");
25648 opcode
= MULT_EXPR
;
25651 opcode
= TRUNC_DIV_EXPR
;
25654 opcode
= PLUS_EXPR
;
25657 opcode
= MINUS_EXPR
;
25660 opcode
= LSHIFT_EXPR
;
25663 opcode
= RSHIFT_EXPR
;
25666 opcode
= BIT_AND_EXPR
;
25669 opcode
= BIT_IOR_EXPR
;
25672 opcode
= BIT_XOR_EXPR
;
25675 cp_parser_error (parser
,
25676 "invalid operator for %<#pragma omp atomic%>");
25679 oprec
= TOKEN_PRECEDENCE (token
);
25680 gcc_assert (oprec
!= PREC_NOT_OPERATOR
);
25681 if (commutative_tree_code (opcode
))
25682 oprec
= (enum cp_parser_prec
) (oprec
- 1);
25683 cp_lexer_consume_token (parser
->lexer
);
25684 rhs
= cp_parser_binary_expression (parser
, false, false,
25686 if (rhs
== error_mark_node
)
25692 cp_parser_error (parser
,
25693 "invalid operator for %<#pragma omp atomic%>");
25696 cp_lexer_consume_token (parser
->lexer
);
25698 rhs
= cp_parser_expression (parser
, false, NULL
);
25699 if (rhs
== error_mark_node
)
25704 if (structured_block
&& code
== OMP_ATOMIC_CAPTURE_NEW
)
25706 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
25708 v
= cp_parser_unary_expression (parser
, /*address_p=*/false,
25709 /*cast_p=*/false, NULL
);
25710 if (v
== error_mark_node
)
25712 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
25714 lhs1
= cp_parser_unary_expression (parser
, /*address_p=*/false,
25715 /*cast_p=*/false, NULL
);
25716 if (lhs1
== error_mark_node
)
25719 if (structured_block
)
25721 cp_parser_consume_semicolon_at_end_of_statement (parser
);
25722 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
25725 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
);
25726 if (!structured_block
)
25727 cp_parser_consume_semicolon_at_end_of_statement (parser
);
25731 cp_parser_skip_to_end_of_block_or_statement (parser
);
25732 if (structured_block
)
25734 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
25735 cp_lexer_consume_token (parser
->lexer
);
25736 else if (code
== OMP_ATOMIC_CAPTURE_NEW
)
25738 cp_parser_skip_to_end_of_block_or_statement (parser
);
25739 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
25740 cp_lexer_consume_token (parser
->lexer
);
25747 # pragma omp barrier new-line */
25750 cp_parser_omp_barrier (cp_parser
*parser
, cp_token
*pragma_tok
)
25752 cp_parser_require_pragma_eol (parser
, pragma_tok
);
25753 finish_omp_barrier ();
25757 # pragma omp critical [(name)] new-line
25758 structured-block */
25761 cp_parser_omp_critical (cp_parser
*parser
, cp_token
*pragma_tok
)
25763 tree stmt
, name
= NULL
;
25765 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
25767 cp_lexer_consume_token (parser
->lexer
);
25769 name
= cp_parser_identifier (parser
);
25771 if (name
== error_mark_node
25772 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
25773 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
25774 /*or_comma=*/false,
25775 /*consume_paren=*/true);
25776 if (name
== error_mark_node
)
25779 cp_parser_require_pragma_eol (parser
, pragma_tok
);
25781 stmt
= cp_parser_omp_structured_block (parser
);
25782 return c_finish_omp_critical (input_location
, stmt
, name
);
25786 # pragma omp flush flush-vars[opt] new-line
25789 ( variable-list ) */
25792 cp_parser_omp_flush (cp_parser
*parser
, cp_token
*pragma_tok
)
25794 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
25795 (void) cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
25796 cp_parser_require_pragma_eol (parser
, pragma_tok
);
25798 finish_omp_flush ();
25801 /* Helper function, to parse omp for increment expression. */
25804 cp_parser_omp_for_cond (cp_parser
*parser
, tree decl
)
25806 tree cond
= cp_parser_binary_expression (parser
, false, true,
25807 PREC_NOT_OPERATOR
, NULL
);
25808 if (cond
== error_mark_node
25809 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
25811 cp_parser_skip_to_end_of_statement (parser
);
25812 return error_mark_node
;
25815 switch (TREE_CODE (cond
))
25823 return error_mark_node
;
25826 /* If decl is an iterator, preserve LHS and RHS of the relational
25827 expr until finish_omp_for. */
25829 && (type_dependent_expression_p (decl
)
25830 || CLASS_TYPE_P (TREE_TYPE (decl
))))
25833 return build_x_binary_op (TREE_CODE (cond
),
25834 TREE_OPERAND (cond
, 0), ERROR_MARK
,
25835 TREE_OPERAND (cond
, 1), ERROR_MARK
,
25836 /*overload=*/NULL
, tf_warning_or_error
);
25839 /* Helper function, to parse omp for increment expression. */
25842 cp_parser_omp_for_incr (cp_parser
*parser
, tree decl
)
25844 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
25850 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
25852 op
= (token
->type
== CPP_PLUS_PLUS
25853 ? PREINCREMENT_EXPR
: PREDECREMENT_EXPR
);
25854 cp_lexer_consume_token (parser
->lexer
);
25855 lhs
= cp_parser_cast_expression (parser
, false, false, NULL
);
25857 return error_mark_node
;
25858 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
25861 lhs
= cp_parser_primary_expression (parser
, false, false, false, &idk
);
25863 return error_mark_node
;
25865 token
= cp_lexer_peek_token (parser
->lexer
);
25866 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
25868 op
= (token
->type
== CPP_PLUS_PLUS
25869 ? POSTINCREMENT_EXPR
: POSTDECREMENT_EXPR
);
25870 cp_lexer_consume_token (parser
->lexer
);
25871 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
25874 op
= cp_parser_assignment_operator_opt (parser
);
25875 if (op
== ERROR_MARK
)
25876 return error_mark_node
;
25878 if (op
!= NOP_EXPR
)
25880 rhs
= cp_parser_assignment_expression (parser
, false, NULL
);
25881 rhs
= build2 (op
, TREE_TYPE (decl
), decl
, rhs
);
25882 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
25885 lhs
= cp_parser_binary_expression (parser
, false, false,
25886 PREC_ADDITIVE_EXPRESSION
, NULL
);
25887 token
= cp_lexer_peek_token (parser
->lexer
);
25888 decl_first
= lhs
== decl
;
25891 if (token
->type
!= CPP_PLUS
25892 && token
->type
!= CPP_MINUS
)
25893 return error_mark_node
;
25897 op
= token
->type
== CPP_PLUS
? PLUS_EXPR
: MINUS_EXPR
;
25898 cp_lexer_consume_token (parser
->lexer
);
25899 rhs
= cp_parser_binary_expression (parser
, false, false,
25900 PREC_ADDITIVE_EXPRESSION
, NULL
);
25901 token
= cp_lexer_peek_token (parser
->lexer
);
25902 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
|| decl_first
)
25904 if (lhs
== NULL_TREE
)
25906 if (op
== PLUS_EXPR
)
25909 lhs
= build_x_unary_op (NEGATE_EXPR
, rhs
, tf_warning_or_error
);
25912 lhs
= build_x_binary_op (op
, lhs
, ERROR_MARK
, rhs
, ERROR_MARK
,
25913 NULL
, tf_warning_or_error
);
25916 while (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
);
25920 if (rhs
!= decl
|| op
== MINUS_EXPR
)
25921 return error_mark_node
;
25922 rhs
= build2 (op
, TREE_TYPE (decl
), lhs
, decl
);
25925 rhs
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, lhs
);
25927 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
25930 /* Parse the restricted form of the for statement allowed by OpenMP. */
25933 cp_parser_omp_for_loop (cp_parser
*parser
, tree clauses
, tree
*par_clauses
)
25935 tree init
, cond
, incr
, body
, decl
, pre_body
= NULL_TREE
, ret
;
25936 tree real_decl
, initv
, condv
, incrv
, declv
;
25937 tree this_pre_body
, cl
;
25938 location_t loc_first
;
25939 bool collapse_err
= false;
25940 int i
, collapse
= 1, nbraces
= 0;
25941 VEC(tree
,gc
) *for_block
= make_tree_vector ();
25943 for (cl
= clauses
; cl
; cl
= OMP_CLAUSE_CHAIN (cl
))
25944 if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_COLLAPSE
)
25945 collapse
= tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl
), 0);
25947 gcc_assert (collapse
>= 1);
25949 declv
= make_tree_vec (collapse
);
25950 initv
= make_tree_vec (collapse
);
25951 condv
= make_tree_vec (collapse
);
25952 incrv
= make_tree_vec (collapse
);
25954 loc_first
= cp_lexer_peek_token (parser
->lexer
)->location
;
25956 for (i
= 0; i
< collapse
; i
++)
25958 int bracecount
= 0;
25959 bool add_private_clause
= false;
25962 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
25964 cp_parser_error (parser
, "for statement expected");
25967 loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
25969 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
25972 init
= decl
= real_decl
= NULL
;
25973 this_pre_body
= push_stmt_list ();
25974 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
25976 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
25980 integer-type var = lb
25981 random-access-iterator-type var = lb
25982 pointer-type var = lb
25984 cp_decl_specifier_seq type_specifiers
;
25986 /* First, try to parse as an initialized declaration. See
25987 cp_parser_condition, from whence the bulk of this is copied. */
25989 cp_parser_parse_tentatively (parser
);
25990 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
25991 /*is_trailing_return=*/false,
25993 if (cp_parser_parse_definitely (parser
))
25995 /* If parsing a type specifier seq succeeded, then this
25996 MUST be a initialized declaration. */
25997 tree asm_specification
, attributes
;
25998 cp_declarator
*declarator
;
26000 declarator
= cp_parser_declarator (parser
,
26001 CP_PARSER_DECLARATOR_NAMED
,
26002 /*ctor_dtor_or_conv_p=*/NULL
,
26003 /*parenthesized_p=*/NULL
,
26004 /*member_p=*/false);
26005 attributes
= cp_parser_attributes_opt (parser
);
26006 asm_specification
= cp_parser_asm_specification_opt (parser
);
26008 if (declarator
== cp_error_declarator
)
26009 cp_parser_skip_to_end_of_statement (parser
);
26013 tree pushed_scope
, auto_node
;
26015 decl
= start_decl (declarator
, &type_specifiers
,
26016 SD_INITIALIZED
, attributes
,
26017 /*prefix_attributes=*/NULL_TREE
,
26020 auto_node
= type_uses_auto (TREE_TYPE (decl
));
26021 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
26023 if (cp_lexer_next_token_is (parser
->lexer
,
26025 error ("parenthesized initialization is not allowed in "
26026 "OpenMP %<for%> loop");
26028 /* Trigger an error. */
26029 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
26031 init
= error_mark_node
;
26032 cp_parser_skip_to_end_of_statement (parser
);
26034 else if (CLASS_TYPE_P (TREE_TYPE (decl
))
26035 || type_dependent_expression_p (decl
)
26038 bool is_direct_init
, is_non_constant_init
;
26040 init
= cp_parser_initializer (parser
,
26042 &is_non_constant_init
);
26047 = do_auto_deduction (TREE_TYPE (decl
), init
,
26050 if (!CLASS_TYPE_P (TREE_TYPE (decl
))
26051 && !type_dependent_expression_p (decl
))
26055 cp_finish_decl (decl
, init
, !is_non_constant_init
,
26057 LOOKUP_ONLYCONVERTING
);
26058 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
26060 VEC_safe_push (tree
, gc
, for_block
, this_pre_body
);
26064 init
= pop_stmt_list (this_pre_body
);
26065 this_pre_body
= NULL_TREE
;
26070 cp_lexer_consume_token (parser
->lexer
);
26071 init
= cp_parser_assignment_expression (parser
, false, NULL
);
26074 if (TREE_CODE (TREE_TYPE (decl
)) == REFERENCE_TYPE
)
26075 init
= error_mark_node
;
26077 cp_finish_decl (decl
, NULL_TREE
,
26078 /*init_const_expr_p=*/false,
26080 LOOKUP_ONLYCONVERTING
);
26084 pop_scope (pushed_scope
);
26090 /* If parsing a type specifier sequence failed, then
26091 this MUST be a simple expression. */
26092 cp_parser_parse_tentatively (parser
);
26093 decl
= cp_parser_primary_expression (parser
, false, false,
26095 if (!cp_parser_error_occurred (parser
)
26098 && CLASS_TYPE_P (TREE_TYPE (decl
)))
26102 cp_parser_parse_definitely (parser
);
26103 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
26104 rhs
= cp_parser_assignment_expression (parser
, false, NULL
);
26105 finish_expr_stmt (build_x_modify_expr (decl
, NOP_EXPR
,
26107 tf_warning_or_error
));
26108 add_private_clause
= true;
26113 cp_parser_abort_tentative_parse (parser
);
26114 init
= cp_parser_expression (parser
, false, NULL
);
26117 if (TREE_CODE (init
) == MODIFY_EXPR
26118 || TREE_CODE (init
) == MODOP_EXPR
)
26119 real_decl
= TREE_OPERAND (init
, 0);
26124 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
26127 this_pre_body
= pop_stmt_list (this_pre_body
);
26131 pre_body
= push_stmt_list ();
26133 add_stmt (this_pre_body
);
26134 pre_body
= pop_stmt_list (pre_body
);
26137 pre_body
= this_pre_body
;
26142 if (par_clauses
!= NULL
&& real_decl
!= NULL_TREE
)
26145 for (c
= par_clauses
; *c
; )
26146 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_FIRSTPRIVATE
26147 && OMP_CLAUSE_DECL (*c
) == real_decl
)
26149 error_at (loc
, "iteration variable %qD"
26150 " should not be firstprivate", real_decl
);
26151 *c
= OMP_CLAUSE_CHAIN (*c
);
26153 else if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_LASTPRIVATE
26154 && OMP_CLAUSE_DECL (*c
) == real_decl
)
26156 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26157 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26158 tree l
= build_omp_clause (loc
, OMP_CLAUSE_LASTPRIVATE
);
26159 OMP_CLAUSE_DECL (l
) = real_decl
;
26160 OMP_CLAUSE_CHAIN (l
) = clauses
;
26161 CP_OMP_CLAUSE_INFO (l
) = CP_OMP_CLAUSE_INFO (*c
);
26163 OMP_CLAUSE_SET_CODE (*c
, OMP_CLAUSE_SHARED
);
26164 CP_OMP_CLAUSE_INFO (*c
) = NULL
;
26165 add_private_clause
= false;
26169 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_PRIVATE
26170 && OMP_CLAUSE_DECL (*c
) == real_decl
)
26171 add_private_clause
= false;
26172 c
= &OMP_CLAUSE_CHAIN (*c
);
26176 if (add_private_clause
)
26179 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
26181 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
26182 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
26183 && OMP_CLAUSE_DECL (c
) == decl
)
26185 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
26186 && OMP_CLAUSE_DECL (c
) == decl
)
26187 error_at (loc
, "iteration variable %qD "
26188 "should not be firstprivate",
26190 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
26191 && OMP_CLAUSE_DECL (c
) == decl
)
26192 error_at (loc
, "iteration variable %qD should not be reduction",
26197 c
= build_omp_clause (loc
, OMP_CLAUSE_PRIVATE
);
26198 OMP_CLAUSE_DECL (c
) = decl
;
26199 c
= finish_omp_clauses (c
);
26202 OMP_CLAUSE_CHAIN (c
) = clauses
;
26209 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
26210 cond
= cp_parser_omp_for_cond (parser
, decl
);
26211 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
26214 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
26216 /* If decl is an iterator, preserve the operator on decl
26217 until finish_omp_for. */
26219 && ((type_dependent_expression_p (decl
)
26220 && !POINTER_TYPE_P (TREE_TYPE (decl
)))
26221 || CLASS_TYPE_P (TREE_TYPE (decl
))))
26222 incr
= cp_parser_omp_for_incr (parser
, decl
);
26224 incr
= cp_parser_expression (parser
, false, NULL
);
26227 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
26228 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
26229 /*or_comma=*/false,
26230 /*consume_paren=*/true);
26232 TREE_VEC_ELT (declv
, i
) = decl
;
26233 TREE_VEC_ELT (initv
, i
) = init
;
26234 TREE_VEC_ELT (condv
, i
) = cond
;
26235 TREE_VEC_ELT (incrv
, i
) = incr
;
26237 if (i
== collapse
- 1)
26240 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26241 in between the collapsed for loops to be still considered perfectly
26242 nested. Hopefully the final version clarifies this.
26243 For now handle (multiple) {'s and empty statements. */
26244 cp_parser_parse_tentatively (parser
);
26247 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
26249 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
26251 cp_lexer_consume_token (parser
->lexer
);
26254 else if (bracecount
26255 && cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
26256 cp_lexer_consume_token (parser
->lexer
);
26259 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
26260 error_at (loc
, "not enough collapsed for loops");
26261 collapse_err
= true;
26262 cp_parser_abort_tentative_parse (parser
);
26271 cp_parser_parse_definitely (parser
);
26272 nbraces
+= bracecount
;
26276 /* Note that we saved the original contents of this flag when we entered
26277 the structured block, and so we don't need to re-save it here. */
26278 parser
->in_statement
= IN_OMP_FOR
;
26280 /* Note that the grammar doesn't call for a structured block here,
26281 though the loop as a whole is a structured block. */
26282 body
= push_stmt_list ();
26283 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
26284 body
= pop_stmt_list (body
);
26286 if (declv
== NULL_TREE
)
26289 ret
= finish_omp_for (loc_first
, declv
, initv
, condv
, incrv
, body
,
26290 pre_body
, clauses
);
26294 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
26296 cp_lexer_consume_token (parser
->lexer
);
26299 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
26300 cp_lexer_consume_token (parser
->lexer
);
26305 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
26306 "collapsed loops not perfectly nested");
26308 collapse_err
= true;
26309 cp_parser_statement_seq_opt (parser
, NULL
);
26310 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
26315 while (!VEC_empty (tree
, for_block
))
26316 add_stmt (pop_stmt_list (VEC_pop (tree
, for_block
)));
26317 release_tree_vector (for_block
);
26323 #pragma omp for for-clause[optseq] new-line
26326 #define OMP_FOR_CLAUSE_MASK \
26327 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26328 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26329 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26330 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26331 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26332 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26333 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26334 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26337 cp_parser_omp_for (cp_parser
*parser
, cp_token
*pragma_tok
)
26339 tree clauses
, sb
, ret
;
26342 clauses
= cp_parser_omp_all_clauses (parser
, OMP_FOR_CLAUSE_MASK
,
26343 "#pragma omp for", pragma_tok
);
26345 sb
= begin_omp_structured_block ();
26346 save
= cp_parser_begin_omp_structured_block (parser
);
26348 ret
= cp_parser_omp_for_loop (parser
, clauses
, NULL
);
26350 cp_parser_end_omp_structured_block (parser
, save
);
26351 add_stmt (finish_omp_structured_block (sb
));
26357 # pragma omp master new-line
26358 structured-block */
26361 cp_parser_omp_master (cp_parser
*parser
, cp_token
*pragma_tok
)
26363 cp_parser_require_pragma_eol (parser
, pragma_tok
);
26364 return c_finish_omp_master (input_location
,
26365 cp_parser_omp_structured_block (parser
));
26369 # pragma omp ordered new-line
26370 structured-block */
26373 cp_parser_omp_ordered (cp_parser
*parser
, cp_token
*pragma_tok
)
26375 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
26376 cp_parser_require_pragma_eol (parser
, pragma_tok
);
26377 return c_finish_omp_ordered (loc
, cp_parser_omp_structured_block (parser
));
26383 { section-sequence }
26386 section-directive[opt] structured-block
26387 section-sequence section-directive structured-block */
26390 cp_parser_omp_sections_scope (cp_parser
*parser
)
26392 tree stmt
, substmt
;
26393 bool error_suppress
= false;
26396 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
26399 stmt
= push_stmt_list ();
26401 if (cp_lexer_peek_token (parser
->lexer
)->pragma_kind
!= PRAGMA_OMP_SECTION
)
26405 substmt
= begin_omp_structured_block ();
26406 save
= cp_parser_begin_omp_structured_block (parser
);
26410 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
26412 tok
= cp_lexer_peek_token (parser
->lexer
);
26413 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
26415 if (tok
->type
== CPP_CLOSE_BRACE
)
26417 if (tok
->type
== CPP_EOF
)
26421 cp_parser_end_omp_structured_block (parser
, save
);
26422 substmt
= finish_omp_structured_block (substmt
);
26423 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
26424 add_stmt (substmt
);
26429 tok
= cp_lexer_peek_token (parser
->lexer
);
26430 if (tok
->type
== CPP_CLOSE_BRACE
)
26432 if (tok
->type
== CPP_EOF
)
26435 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
26437 cp_lexer_consume_token (parser
->lexer
);
26438 cp_parser_require_pragma_eol (parser
, tok
);
26439 error_suppress
= false;
26441 else if (!error_suppress
)
26443 cp_parser_error (parser
, "expected %<#pragma omp section%> or %<}%>");
26444 error_suppress
= true;
26447 substmt
= cp_parser_omp_structured_block (parser
);
26448 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
26449 add_stmt (substmt
);
26451 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
26453 substmt
= pop_stmt_list (stmt
);
26455 stmt
= make_node (OMP_SECTIONS
);
26456 TREE_TYPE (stmt
) = void_type_node
;
26457 OMP_SECTIONS_BODY (stmt
) = substmt
;
26464 # pragma omp sections sections-clause[optseq] newline
26467 #define OMP_SECTIONS_CLAUSE_MASK \
26468 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26469 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26470 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26471 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26472 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26475 cp_parser_omp_sections (cp_parser
*parser
, cp_token
*pragma_tok
)
26479 clauses
= cp_parser_omp_all_clauses (parser
, OMP_SECTIONS_CLAUSE_MASK
,
26480 "#pragma omp sections", pragma_tok
);
26482 ret
= cp_parser_omp_sections_scope (parser
);
26484 OMP_SECTIONS_CLAUSES (ret
) = clauses
;
26490 # pragma parallel parallel-clause new-line
26491 # pragma parallel for parallel-for-clause new-line
26492 # pragma parallel sections parallel-sections-clause new-line */
26494 #define OMP_PARALLEL_CLAUSE_MASK \
26495 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26496 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26497 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26498 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26499 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26500 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26501 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26502 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26505 cp_parser_omp_parallel (cp_parser
*parser
, cp_token
*pragma_tok
)
26507 enum pragma_kind p_kind
= PRAGMA_OMP_PARALLEL
;
26508 const char *p_name
= "#pragma omp parallel";
26509 tree stmt
, clauses
, par_clause
, ws_clause
, block
;
26510 unsigned int mask
= OMP_PARALLEL_CLAUSE_MASK
;
26512 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
26514 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
26516 cp_lexer_consume_token (parser
->lexer
);
26517 p_kind
= PRAGMA_OMP_PARALLEL_FOR
;
26518 p_name
= "#pragma omp parallel for";
26519 mask
|= OMP_FOR_CLAUSE_MASK
;
26520 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
26522 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
26524 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
26525 const char *p
= IDENTIFIER_POINTER (id
);
26526 if (strcmp (p
, "sections") == 0)
26528 cp_lexer_consume_token (parser
->lexer
);
26529 p_kind
= PRAGMA_OMP_PARALLEL_SECTIONS
;
26530 p_name
= "#pragma omp parallel sections";
26531 mask
|= OMP_SECTIONS_CLAUSE_MASK
;
26532 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
26536 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
);
26537 block
= begin_omp_parallel ();
26538 save
= cp_parser_begin_omp_structured_block (parser
);
26542 case PRAGMA_OMP_PARALLEL
:
26543 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
26544 par_clause
= clauses
;
26547 case PRAGMA_OMP_PARALLEL_FOR
:
26548 c_split_parallel_clauses (loc
, clauses
, &par_clause
, &ws_clause
);
26549 cp_parser_omp_for_loop (parser
, ws_clause
, &par_clause
);
26552 case PRAGMA_OMP_PARALLEL_SECTIONS
:
26553 c_split_parallel_clauses (loc
, clauses
, &par_clause
, &ws_clause
);
26554 stmt
= cp_parser_omp_sections_scope (parser
);
26556 OMP_SECTIONS_CLAUSES (stmt
) = ws_clause
;
26560 gcc_unreachable ();
26563 cp_parser_end_omp_structured_block (parser
, save
);
26564 stmt
= finish_omp_parallel (par_clause
, block
);
26565 if (p_kind
!= PRAGMA_OMP_PARALLEL
)
26566 OMP_PARALLEL_COMBINED (stmt
) = 1;
26571 # pragma omp single single-clause[optseq] new-line
26572 structured-block */
26574 #define OMP_SINGLE_CLAUSE_MASK \
26575 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26576 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26577 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26578 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26581 cp_parser_omp_single (cp_parser
*parser
, cp_token
*pragma_tok
)
26583 tree stmt
= make_node (OMP_SINGLE
);
26584 TREE_TYPE (stmt
) = void_type_node
;
26586 OMP_SINGLE_CLAUSES (stmt
)
26587 = cp_parser_omp_all_clauses (parser
, OMP_SINGLE_CLAUSE_MASK
,
26588 "#pragma omp single", pragma_tok
);
26589 OMP_SINGLE_BODY (stmt
) = cp_parser_omp_structured_block (parser
);
26591 return add_stmt (stmt
);
26595 # pragma omp task task-clause[optseq] new-line
26596 structured-block */
26598 #define OMP_TASK_CLAUSE_MASK \
26599 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26600 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26601 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26602 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26603 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26604 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26605 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26606 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26609 cp_parser_omp_task (cp_parser
*parser
, cp_token
*pragma_tok
)
26611 tree clauses
, block
;
26614 clauses
= cp_parser_omp_all_clauses (parser
, OMP_TASK_CLAUSE_MASK
,
26615 "#pragma omp task", pragma_tok
);
26616 block
= begin_omp_task ();
26617 save
= cp_parser_begin_omp_structured_block (parser
);
26618 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
26619 cp_parser_end_omp_structured_block (parser
, save
);
26620 return finish_omp_task (clauses
, block
);
26624 # pragma omp taskwait new-line */
26627 cp_parser_omp_taskwait (cp_parser
*parser
, cp_token
*pragma_tok
)
26629 cp_parser_require_pragma_eol (parser
, pragma_tok
);
26630 finish_omp_taskwait ();
26634 # pragma omp taskyield new-line */
26637 cp_parser_omp_taskyield (cp_parser
*parser
, cp_token
*pragma_tok
)
26639 cp_parser_require_pragma_eol (parser
, pragma_tok
);
26640 finish_omp_taskyield ();
26644 # pragma omp threadprivate (variable-list) */
26647 cp_parser_omp_threadprivate (cp_parser
*parser
, cp_token
*pragma_tok
)
26651 vars
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
26652 cp_parser_require_pragma_eol (parser
, pragma_tok
);
26654 finish_omp_threadprivate (vars
);
26657 /* Main entry point to OpenMP statement pragmas. */
26660 cp_parser_omp_construct (cp_parser
*parser
, cp_token
*pragma_tok
)
26664 switch (pragma_tok
->pragma_kind
)
26666 case PRAGMA_OMP_ATOMIC
:
26667 cp_parser_omp_atomic (parser
, pragma_tok
);
26669 case PRAGMA_OMP_CRITICAL
:
26670 stmt
= cp_parser_omp_critical (parser
, pragma_tok
);
26672 case PRAGMA_OMP_FOR
:
26673 stmt
= cp_parser_omp_for (parser
, pragma_tok
);
26675 case PRAGMA_OMP_MASTER
:
26676 stmt
= cp_parser_omp_master (parser
, pragma_tok
);
26678 case PRAGMA_OMP_ORDERED
:
26679 stmt
= cp_parser_omp_ordered (parser
, pragma_tok
);
26681 case PRAGMA_OMP_PARALLEL
:
26682 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
);
26684 case PRAGMA_OMP_SECTIONS
:
26685 stmt
= cp_parser_omp_sections (parser
, pragma_tok
);
26687 case PRAGMA_OMP_SINGLE
:
26688 stmt
= cp_parser_omp_single (parser
, pragma_tok
);
26690 case PRAGMA_OMP_TASK
:
26691 stmt
= cp_parser_omp_task (parser
, pragma_tok
);
26694 gcc_unreachable ();
26698 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
26701 /* Transactional Memory parsing routines. */
26703 /* Parse a transaction attribute.
26709 ??? Simplify this when C++0x bracket attributes are
26710 implemented properly. */
26713 cp_parser_txn_attribute_opt (cp_parser
*parser
)
26716 tree attr_name
, attr
= NULL
;
26718 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
26719 return cp_parser_attributes_opt (parser
);
26721 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
26723 cp_lexer_consume_token (parser
->lexer
);
26724 if (!cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
))
26727 token
= cp_lexer_peek_token (parser
->lexer
);
26728 if (token
->type
== CPP_NAME
|| token
->type
== CPP_KEYWORD
)
26730 token
= cp_lexer_consume_token (parser
->lexer
);
26732 attr_name
= (token
->type
== CPP_KEYWORD
26733 /* For keywords, use the canonical spelling,
26734 not the parsed identifier. */
26735 ? ridpointers
[(int) token
->keyword
]
26737 attr
= build_tree_list (attr_name
, NULL_TREE
);
26740 cp_parser_error (parser
, "expected identifier");
26742 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
26744 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
26748 /* Parse a __transaction_atomic or __transaction_relaxed statement.
26750 transaction-statement:
26751 __transaction_atomic txn-attribute[opt] txn-exception-spec[opt]
26753 __transaction_relaxed txn-exception-spec[opt] compound-statement
26755 ??? The exception specification is not yet implemented.
26759 cp_parser_transaction (cp_parser
*parser
, enum rid keyword
)
26761 unsigned char old_in
= parser
->in_transaction
;
26762 unsigned char this_in
= 1, new_in
;
26766 gcc_assert (keyword
== RID_TRANSACTION_ATOMIC
26767 || keyword
== RID_TRANSACTION_RELAXED
);
26768 token
= cp_parser_require_keyword (parser
, keyword
,
26769 (keyword
== RID_TRANSACTION_ATOMIC
? RT_TRANSACTION_ATOMIC
26770 : RT_TRANSACTION_RELAXED
));
26771 gcc_assert (token
!= NULL
);
26773 if (keyword
== RID_TRANSACTION_RELAXED
)
26774 this_in
|= TM_STMT_ATTR_RELAXED
;
26777 attrs
= cp_parser_txn_attribute_opt (parser
);
26779 this_in
|= parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
);
26782 /* Keep track if we're in the lexical scope of an outer transaction. */
26783 new_in
= this_in
| (old_in
& TM_STMT_ATTR_OUTER
);
26785 stmt
= begin_transaction_stmt (token
->location
, NULL
, this_in
);
26787 parser
->in_transaction
= new_in
;
26788 cp_parser_compound_statement (parser
, NULL
, false, false);
26789 parser
->in_transaction
= old_in
;
26791 finish_transaction_stmt (stmt
, NULL
, this_in
);
26796 /* Parse a __transaction_atomic or __transaction_relaxed expression.
26798 transaction-expression:
26799 __transaction_atomic txn-exception-spec[opt] ( expression )
26800 __transaction_relaxed txn-exception-spec[opt] ( expression )
26802 ??? The exception specification is not yet implemented.
26806 cp_parser_transaction_expression (cp_parser
*parser
, enum rid keyword
)
26808 unsigned char old_in
= parser
->in_transaction
;
26809 unsigned char this_in
= 1;
26813 gcc_assert (keyword
== RID_TRANSACTION_ATOMIC
26814 || keyword
== RID_TRANSACTION_RELAXED
);
26817 error (keyword
== RID_TRANSACTION_RELAXED
26818 ? G_("%<__transaction_relaxed%> without transactional memory "
26820 : G_("%<__transaction_atomic%> without transactional memory "
26821 "support enabled"));
26823 token
= cp_parser_require_keyword (parser
, keyword
,
26824 (keyword
== RID_TRANSACTION_ATOMIC
? RT_TRANSACTION_ATOMIC
26825 : RT_TRANSACTION_RELAXED
));
26826 gcc_assert (token
!= NULL
);
26828 if (keyword
== RID_TRANSACTION_RELAXED
)
26829 this_in
|= TM_STMT_ATTR_RELAXED
;
26831 parser
->in_transaction
= this_in
;
26832 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
26834 tree expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
26835 ret
= build_transaction_expr (token
->location
, expr
, this_in
);
26839 cp_parser_error (parser
, "expected %<(%>");
26840 ret
= error_mark_node
;
26842 parser
->in_transaction
= old_in
;
26844 if (cp_parser_non_integral_constant_expression (parser
, NIC_TRANSACTION
))
26845 return error_mark_node
;
26847 return (flag_tm
? ret
: error_mark_node
);
26850 /* Parse a function-transaction-block.
26852 function-transaction-block:
26853 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
26855 __transaction_atomic txn-attribute[opt] function-try-block
26856 __transaction_relaxed ctor-initializer[opt] function-body
26857 __transaction_relaxed function-try-block
26861 cp_parser_function_transaction (cp_parser
*parser
, enum rid keyword
)
26863 unsigned char old_in
= parser
->in_transaction
;
26864 unsigned char new_in
= 1;
26865 tree compound_stmt
, stmt
, attrs
;
26866 bool ctor_initializer_p
;
26869 gcc_assert (keyword
== RID_TRANSACTION_ATOMIC
26870 || keyword
== RID_TRANSACTION_RELAXED
);
26871 token
= cp_parser_require_keyword (parser
, keyword
,
26872 (keyword
== RID_TRANSACTION_ATOMIC
? RT_TRANSACTION_ATOMIC
26873 : RT_TRANSACTION_RELAXED
));
26874 gcc_assert (token
!= NULL
);
26876 if (keyword
== RID_TRANSACTION_RELAXED
)
26877 new_in
|= TM_STMT_ATTR_RELAXED
;
26880 attrs
= cp_parser_txn_attribute_opt (parser
);
26882 new_in
|= parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
);
26885 stmt
= begin_transaction_stmt (token
->location
, &compound_stmt
, new_in
);
26887 parser
->in_transaction
= new_in
;
26889 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
26890 ctor_initializer_p
= cp_parser_function_try_block (parser
);
26893 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
26895 parser
->in_transaction
= old_in
;
26897 finish_transaction_stmt (stmt
, compound_stmt
, new_in
);
26899 return ctor_initializer_p
;
26902 /* Parse a __transaction_cancel statement.
26905 __transaction_cancel txn-attribute[opt] ;
26906 __transaction_cancel txn-attribute[opt] throw-expression ;
26908 ??? Cancel and throw is not yet implemented. */
26911 cp_parser_transaction_cancel (cp_parser
*parser
)
26914 bool is_outer
= false;
26917 token
= cp_parser_require_keyword (parser
, RID_TRANSACTION_CANCEL
,
26918 RT_TRANSACTION_CANCEL
);
26919 gcc_assert (token
!= NULL
);
26921 attrs
= cp_parser_txn_attribute_opt (parser
);
26923 is_outer
= (parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
) != 0);
26925 /* ??? Parse cancel-and-throw here. */
26927 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
26931 error_at (token
->location
, "%<__transaction_cancel%> without "
26932 "transactional memory support enabled");
26933 return error_mark_node
;
26935 else if (parser
->in_transaction
& TM_STMT_ATTR_RELAXED
)
26937 error_at (token
->location
, "%<__transaction_cancel%> within a "
26938 "%<__transaction_relaxed%>");
26939 return error_mark_node
;
26943 if ((parser
->in_transaction
& TM_STMT_ATTR_OUTER
) == 0
26944 && !is_tm_may_cancel_outer (current_function_decl
))
26946 error_at (token
->location
, "outer %<__transaction_cancel%> not "
26947 "within outer %<__transaction_atomic%>");
26948 error_at (token
->location
,
26949 " or a %<transaction_may_cancel_outer%> function");
26950 return error_mark_node
;
26953 else if (parser
->in_transaction
== 0)
26955 error_at (token
->location
, "%<__transaction_cancel%> not within "
26956 "%<__transaction_atomic%>");
26957 return error_mark_node
;
26960 stmt
= build_tm_abort_call (token
->location
, is_outer
);
26969 static GTY (()) cp_parser
*the_parser
;
26972 /* Special handling for the first token or line in the file. The first
26973 thing in the file might be #pragma GCC pch_preprocess, which loads a
26974 PCH file, which is a GC collection point. So we need to handle this
26975 first pragma without benefit of an existing lexer structure.
26977 Always returns one token to the caller in *FIRST_TOKEN. This is
26978 either the true first token of the file, or the first token after
26979 the initial pragma. */
26982 cp_parser_initial_pragma (cp_token
*first_token
)
26986 cp_lexer_get_preprocessor_token (NULL
, first_token
);
26987 if (first_token
->pragma_kind
!= PRAGMA_GCC_PCH_PREPROCESS
)
26990 cp_lexer_get_preprocessor_token (NULL
, first_token
);
26991 if (first_token
->type
== CPP_STRING
)
26993 name
= first_token
->u
.value
;
26995 cp_lexer_get_preprocessor_token (NULL
, first_token
);
26996 if (first_token
->type
!= CPP_PRAGMA_EOL
)
26997 error_at (first_token
->location
,
26998 "junk at end of %<#pragma GCC pch_preprocess%>");
27001 error_at (first_token
->location
, "expected string literal");
27003 /* Skip to the end of the pragma. */
27004 while (first_token
->type
!= CPP_PRAGMA_EOL
&& first_token
->type
!= CPP_EOF
)
27005 cp_lexer_get_preprocessor_token (NULL
, first_token
);
27007 /* Now actually load the PCH file. */
27009 c_common_pch_pragma (parse_in
, TREE_STRING_POINTER (name
));
27011 /* Read one more token to return to our caller. We have to do this
27012 after reading the PCH file in, since its pointers have to be
27014 cp_lexer_get_preprocessor_token (NULL
, first_token
);
27017 /* Normal parsing of a pragma token. Here we can (and must) use the
27021 cp_parser_pragma (cp_parser
*parser
, enum pragma_context context
)
27023 cp_token
*pragma_tok
;
27026 pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
27027 gcc_assert (pragma_tok
->type
== CPP_PRAGMA
);
27028 parser
->lexer
->in_pragma
= true;
27030 id
= pragma_tok
->pragma_kind
;
27033 case PRAGMA_GCC_PCH_PREPROCESS
:
27034 error_at (pragma_tok
->location
,
27035 "%<#pragma GCC pch_preprocess%> must be first");
27038 case PRAGMA_OMP_BARRIER
:
27041 case pragma_compound
:
27042 cp_parser_omp_barrier (parser
, pragma_tok
);
27045 error_at (pragma_tok
->location
, "%<#pragma omp barrier%> may only be "
27046 "used in compound statements");
27053 case PRAGMA_OMP_FLUSH
:
27056 case pragma_compound
:
27057 cp_parser_omp_flush (parser
, pragma_tok
);
27060 error_at (pragma_tok
->location
, "%<#pragma omp flush%> may only be "
27061 "used in compound statements");
27068 case PRAGMA_OMP_TASKWAIT
:
27071 case pragma_compound
:
27072 cp_parser_omp_taskwait (parser
, pragma_tok
);
27075 error_at (pragma_tok
->location
,
27076 "%<#pragma omp taskwait%> may only be "
27077 "used in compound statements");
27084 case PRAGMA_OMP_TASKYIELD
:
27087 case pragma_compound
:
27088 cp_parser_omp_taskyield (parser
, pragma_tok
);
27091 error_at (pragma_tok
->location
,
27092 "%<#pragma omp taskyield%> may only be "
27093 "used in compound statements");
27100 case PRAGMA_OMP_THREADPRIVATE
:
27101 cp_parser_omp_threadprivate (parser
, pragma_tok
);
27104 case PRAGMA_OMP_ATOMIC
:
27105 case PRAGMA_OMP_CRITICAL
:
27106 case PRAGMA_OMP_FOR
:
27107 case PRAGMA_OMP_MASTER
:
27108 case PRAGMA_OMP_ORDERED
:
27109 case PRAGMA_OMP_PARALLEL
:
27110 case PRAGMA_OMP_SECTIONS
:
27111 case PRAGMA_OMP_SINGLE
:
27112 case PRAGMA_OMP_TASK
:
27113 if (context
== pragma_external
)
27115 cp_parser_omp_construct (parser
, pragma_tok
);
27118 case PRAGMA_OMP_SECTION
:
27119 error_at (pragma_tok
->location
,
27120 "%<#pragma omp section%> may only be used in "
27121 "%<#pragma omp sections%> construct");
27125 gcc_assert (id
>= PRAGMA_FIRST_EXTERNAL
);
27126 c_invoke_pragma_handler (id
);
27130 cp_parser_error (parser
, "expected declaration specifiers");
27134 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
27138 /* The interface the pragma parsers have to the lexer. */
27141 pragma_lex (tree
*value
)
27144 enum cpp_ttype ret
;
27146 tok
= cp_lexer_peek_token (the_parser
->lexer
);
27149 *value
= tok
->u
.value
;
27151 if (ret
== CPP_PRAGMA_EOL
|| ret
== CPP_EOF
)
27153 else if (ret
== CPP_STRING
)
27154 *value
= cp_parser_string_literal (the_parser
, false, false);
27157 cp_lexer_consume_token (the_parser
->lexer
);
27158 if (ret
== CPP_KEYWORD
)
27166 /* External interface. */
27168 /* Parse one entire translation unit. */
27171 c_parse_file (void)
27173 static bool already_called
= false;
27175 if (already_called
)
27177 sorry ("inter-module optimizations not implemented for C++");
27180 already_called
= true;
27182 the_parser
= cp_parser_new ();
27183 push_deferring_access_checks (flag_access_control
27184 ? dk_no_deferred
: dk_no_check
);
27185 cp_parser_translation_unit (the_parser
);
27189 #include "gt-cp-parser.h"