2 Copyright (C) 2000-2017 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
25 #include "c-family/c-common.h"
27 #include "stringpool.h"
29 #include "print-tree.h"
31 #include "trans-mem.h"
34 #include "c-family/c-objc.h"
36 #include "tree-pretty-print.h"
38 #include "gomp-constants.h"
39 #include "omp-general.h"
40 #include "omp-offload.h"
41 #include "c-family/c-indentation.h"
43 #include "cp-cilkplus.h"
44 #include "gcc-rich-location.h"
45 #include "tree-iterator.h"
50 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
51 and c-lex.c) and the C++ parser. */
53 static cp_token eof_token
=
55 CPP_EOF
, RID_MAX
, 0, false, false, false, 0, { NULL
}
58 /* The various kinds of non integral constant we encounter. */
59 enum non_integral_constant
{
61 /* floating-point literal */
65 /* %<__FUNCTION__%> */
67 /* %<__PRETTY_FUNCTION__%> */
75 /* %<typeid%> operator */
77 /* non-constant compound literals */
85 /* an array reference */
91 /* the address of a label */
105 /* calls to overloaded operators */
109 /* a comma operator */
111 /* a call to a constructor */
113 /* a transaction expression */
117 /* The various kinds of errors about name-lookup failing. */
118 enum name_lookup_error
{
123 /* is not a class or namespace */
125 /* is not a class, namespace, or enumeration */
129 /* The various kinds of required token */
130 enum required_token
{
132 RT_SEMICOLON
, /* ';' */
133 RT_OPEN_PAREN
, /* '(' */
134 RT_CLOSE_BRACE
, /* '}' */
135 RT_OPEN_BRACE
, /* '{' */
136 RT_CLOSE_SQUARE
, /* ']' */
137 RT_OPEN_SQUARE
, /* '[' */
141 RT_GREATER
, /* '>' */
143 RT_ELLIPSIS
, /* '...' */
147 RT_COLON_SCOPE
, /* ':' or '::' */
148 RT_CLOSE_PAREN
, /* ')' */
149 RT_COMMA_CLOSE_PAREN
, /* ',' or ')' */
150 RT_PRAGMA_EOL
, /* end of line */
151 RT_NAME
, /* identifier */
153 /* The type is CPP_KEYWORD */
155 RT_DELETE
, /* delete */
156 RT_RETURN
, /* return */
157 RT_WHILE
, /* while */
158 RT_EXTERN
, /* extern */
159 RT_STATIC_ASSERT
, /* static_assert */
160 RT_DECLTYPE
, /* decltype */
161 RT_OPERATOR
, /* operator */
162 RT_CLASS
, /* class */
163 RT_TEMPLATE
, /* template */
164 RT_NAMESPACE
, /* namespace */
165 RT_USING
, /* using */
168 RT_CATCH
, /* catch */
169 RT_THROW
, /* throw */
170 RT_LABEL
, /* __label__ */
171 RT_AT_TRY
, /* @try */
172 RT_AT_SYNCHRONIZED
, /* @synchronized */
173 RT_AT_THROW
, /* @throw */
175 RT_SELECT
, /* selection-statement */
176 RT_ITERATION
, /* iteration-statement */
177 RT_JUMP
, /* jump-statement */
178 RT_CLASS_KEY
, /* class-key */
179 RT_CLASS_TYPENAME_TEMPLATE
, /* class, typename, or template */
180 RT_TRANSACTION_ATOMIC
, /* __transaction_atomic */
181 RT_TRANSACTION_RELAXED
, /* __transaction_relaxed */
182 RT_TRANSACTION_CANCEL
/* __transaction_cancel */
185 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
186 reverting it on destruction. */
188 class type_id_in_expr_sentinel
193 type_id_in_expr_sentinel (cp_parser
*parser
, bool set
= true)
195 saved (parser
->in_type_id_in_expr_p
)
196 { parser
->in_type_id_in_expr_p
= set
; }
197 ~type_id_in_expr_sentinel ()
198 { parser
->in_type_id_in_expr_p
= saved
; }
203 static cp_lexer
*cp_lexer_new_main
205 static cp_lexer
*cp_lexer_new_from_tokens
206 (cp_token_cache
*tokens
);
207 static void cp_lexer_destroy
209 static int cp_lexer_saving_tokens
211 static cp_token
*cp_lexer_token_at
212 (cp_lexer
*, cp_token_position
);
213 static void cp_lexer_get_preprocessor_token
214 (cp_lexer
*, cp_token
*);
215 static inline cp_token
*cp_lexer_peek_token
217 static cp_token
*cp_lexer_peek_nth_token
218 (cp_lexer
*, size_t);
219 static inline bool cp_lexer_next_token_is
220 (cp_lexer
*, enum cpp_ttype
);
221 static bool cp_lexer_next_token_is_not
222 (cp_lexer
*, enum cpp_ttype
);
223 static bool cp_lexer_next_token_is_keyword
224 (cp_lexer
*, enum rid
);
225 static cp_token
*cp_lexer_consume_token
227 static void cp_lexer_purge_token
229 static void cp_lexer_purge_tokens_after
230 (cp_lexer
*, cp_token_position
);
231 static void cp_lexer_save_tokens
233 static void cp_lexer_commit_tokens
235 static void cp_lexer_rollback_tokens
237 static void cp_lexer_print_token
238 (FILE *, cp_token
*);
239 static inline bool cp_lexer_debugging_p
241 static void cp_lexer_start_debugging
242 (cp_lexer
*) ATTRIBUTE_UNUSED
;
243 static void cp_lexer_stop_debugging
244 (cp_lexer
*) ATTRIBUTE_UNUSED
;
246 static cp_token_cache
*cp_token_cache_new
247 (cp_token
*, cp_token
*);
249 static void cp_parser_initial_pragma
252 static void cp_parser_cilk_simd
253 (cp_parser
*, cp_token
*, bool *);
254 static tree cp_parser_cilk_for
255 (cp_parser
*, tree
, bool *);
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
259 (cp_parser
*, tree
, bool);
260 static void cp_finalize_oacc_routine
261 (cp_parser
*, tree
, bool);
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
269 /* The stream to which debugging output should be written. */
270 static FILE *cp_lexer_debug_stream
;
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
274 int cp_unevaluated_operand
;
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
283 cp_lexer_dump_tokens (FILE *file
, vec
<cp_token
, va_gc
> *buffer
,
284 cp_token
*start_token
, unsigned num
,
285 cp_token
*curr_token
)
287 unsigned i
, nprinted
;
291 fprintf (file
, "%u tokens\n", vec_safe_length (buffer
));
297 num
= buffer
->length ();
299 if (start_token
== NULL
)
300 start_token
= buffer
->address ();
302 if (start_token
> buffer
->address ())
304 cp_lexer_print_token (file
, &(*buffer
)[0]);
305 fprintf (file
, " ... ");
310 for (i
= 0; buffer
->iterate (i
, &token
) && nprinted
< num
; i
++)
312 if (token
== start_token
)
319 if (token
== curr_token
)
320 fprintf (file
, "[[");
322 cp_lexer_print_token (file
, token
);
324 if (token
== curr_token
)
325 fprintf (file
, "]]");
331 case CPP_CLOSE_BRACE
:
341 if (i
== num
&& i
< buffer
->length ())
343 fprintf (file
, " ... ");
344 cp_lexer_print_token (file
, &buffer
->last ());
347 fprintf (file
, "\n");
351 /* Dump all tokens in BUFFER to stderr. */
354 cp_lexer_debug_tokens (vec
<cp_token
, va_gc
> *buffer
)
356 cp_lexer_dump_tokens (stderr
, buffer
, NULL
, 0, NULL
);
360 debug (vec
<cp_token
, va_gc
> &ref
)
362 cp_lexer_dump_tokens (stderr
, &ref
, NULL
, 0, NULL
);
366 debug (vec
<cp_token
, va_gc
> *ptr
)
371 fprintf (stderr
, "<nil>\n");
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
379 cp_debug_print_tree_if_set (FILE *file
, const char *desc
, tree t
)
383 fprintf (file
, "%s: ", desc
);
384 print_node_brief (file
, "", t
, 0);
389 /* Dump parser context C to FILE. */
392 cp_debug_print_context (FILE *file
, cp_parser_context
*c
)
394 const char *status_s
[] = { "OK", "ERROR", "COMMITTED" };
395 fprintf (file
, "{ status = %s, scope = ", status_s
[c
->status
]);
396 print_node_brief (file
, "", c
->object_type
, 0);
397 fprintf (file
, "}\n");
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
404 cp_debug_print_context_stack (FILE *file
, cp_parser_context
*first
)
407 cp_parser_context
*c
;
409 fprintf (file
, "Parsing context stack:\n");
410 for (i
= 0, c
= first
; c
; c
= c
->next
, i
++)
412 fprintf (file
, "\t#%u: ", i
);
413 cp_debug_print_context (file
, c
);
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
421 cp_debug_print_flag (FILE *file
, const char *desc
, bool flag
)
424 fprintf (file
, "%s: true\n", desc
);
428 /* Print an unparsed function entry UF to FILE. */
431 cp_debug_print_unparsed_function (FILE *file
, cp_unparsed_functions_entry
*uf
)
434 cp_default_arg_entry
*default_arg_fn
;
437 fprintf (file
, "\tFunctions with default args:\n");
439 vec_safe_iterate (uf
->funs_with_default_args
, i
, &default_arg_fn
);
442 fprintf (file
, "\t\tClass type: ");
443 print_node_brief (file
, "", default_arg_fn
->class_type
, 0);
444 fprintf (file
, "\t\tDeclaration: ");
445 print_node_brief (file
, "", default_arg_fn
->decl
, 0);
446 fprintf (file
, "\n");
449 fprintf (file
, "\n\tFunctions with definitions that require "
450 "post-processing\n\t\t");
451 for (i
= 0; vec_safe_iterate (uf
->funs_with_definitions
, i
, &fn
); i
++)
453 print_node_brief (file
, "", fn
, 0);
456 fprintf (file
, "\n");
458 fprintf (file
, "\n\tNon-static data members with initializers that require "
459 "post-processing\n\t\t");
460 for (i
= 0; vec_safe_iterate (uf
->nsdmis
, i
, &fn
); i
++)
462 print_node_brief (file
, "", fn
, 0);
465 fprintf (file
, "\n");
469 /* Print the stack of unparsed member functions S to FILE. */
472 cp_debug_print_unparsed_queues (FILE *file
,
473 vec
<cp_unparsed_functions_entry
, va_gc
> *s
)
476 cp_unparsed_functions_entry
*uf
;
478 fprintf (file
, "Unparsed functions\n");
479 for (i
= 0; vec_safe_iterate (s
, i
, &uf
); i
++)
481 fprintf (file
, "#%u:\n", i
);
482 cp_debug_print_unparsed_function (file
, uf
);
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
491 cp_debug_parser_tokens (FILE *file
, cp_parser
*parser
, int window_size
)
493 cp_token
*next_token
, *first_token
, *start_token
;
498 next_token
= parser
->lexer
->next_token
;
499 first_token
= parser
->lexer
->buffer
->address ();
500 start_token
= (next_token
> first_token
+ window_size
/ 2)
501 ? next_token
- window_size
/ 2
503 cp_lexer_dump_tokens (file
, parser
->lexer
->buffer
, start_token
, window_size
,
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
512 cp_debug_parser (FILE *file
, cp_parser
*parser
)
514 const size_t window_size
= 20;
516 expanded_location eloc
;
521 fprintf (file
, "Parser state\n\n");
522 fprintf (file
, "Number of tokens: %u\n",
523 vec_safe_length (parser
->lexer
->buffer
));
524 cp_debug_print_tree_if_set (file
, "Lookup scope", parser
->scope
);
525 cp_debug_print_tree_if_set (file
, "Object scope",
526 parser
->object_scope
);
527 cp_debug_print_tree_if_set (file
, "Qualifying scope",
528 parser
->qualifying_scope
);
529 cp_debug_print_context_stack (file
, parser
->context
);
530 cp_debug_print_flag (file
, "Allow GNU extensions",
531 parser
->allow_gnu_extensions_p
);
532 cp_debug_print_flag (file
, "'>' token is greater-than",
533 parser
->greater_than_is_operator_p
);
534 cp_debug_print_flag (file
, "Default args allowed in current "
535 "parameter list", parser
->default_arg_ok_p
);
536 cp_debug_print_flag (file
, "Parsing integral constant-expression",
537 parser
->integral_constant_expression_p
);
538 cp_debug_print_flag (file
, "Allow non-constant expression in current "
539 "constant-expression",
540 parser
->allow_non_integral_constant_expression_p
);
541 cp_debug_print_flag (file
, "Seen non-constant expression",
542 parser
->non_integral_constant_expression_p
);
543 cp_debug_print_flag (file
, "Local names and 'this' forbidden in "
545 parser
->local_variables_forbidden_p
);
546 cp_debug_print_flag (file
, "In unbraced linkage specification",
547 parser
->in_unbraced_linkage_specification_p
);
548 cp_debug_print_flag (file
, "Parsing a declarator",
549 parser
->in_declarator_p
);
550 cp_debug_print_flag (file
, "In template argument list",
551 parser
->in_template_argument_list_p
);
552 cp_debug_print_flag (file
, "Parsing an iteration statement",
553 parser
->in_statement
& IN_ITERATION_STMT
);
554 cp_debug_print_flag (file
, "Parsing a switch statement",
555 parser
->in_statement
& IN_SWITCH_STMT
);
556 cp_debug_print_flag (file
, "Parsing a structured OpenMP block",
557 parser
->in_statement
& IN_OMP_BLOCK
);
558 cp_debug_print_flag (file
, "Parsing a Cilk Plus for loop",
559 parser
->in_statement
& IN_CILK_SIMD_FOR
);
560 cp_debug_print_flag (file
, "Parsing a an OpenMP loop",
561 parser
->in_statement
& IN_OMP_FOR
);
562 cp_debug_print_flag (file
, "Parsing an if statement",
563 parser
->in_statement
& IN_IF_STMT
);
564 cp_debug_print_flag (file
, "Parsing a type-id in an expression "
565 "context", parser
->in_type_id_in_expr_p
);
566 cp_debug_print_flag (file
, "Declarations are implicitly extern \"C\"",
567 parser
->implicit_extern_c
);
568 cp_debug_print_flag (file
, "String expressions should be translated "
569 "to execution character set",
570 parser
->translate_strings_p
);
571 cp_debug_print_flag (file
, "Parsing function body outside of a "
572 "local class", parser
->in_function_body
);
573 cp_debug_print_flag (file
, "Auto correct a colon to a scope operator",
574 parser
->colon_corrects_to_scope_p
);
575 cp_debug_print_flag (file
, "Colon doesn't start a class definition",
576 parser
->colon_doesnt_start_class_def_p
);
577 if (parser
->type_definition_forbidden_message
)
578 fprintf (file
, "Error message for forbidden type definitions: %s\n",
579 parser
->type_definition_forbidden_message
);
580 cp_debug_print_unparsed_queues (file
, parser
->unparsed_queues
);
581 fprintf (file
, "Number of class definitions in progress: %u\n",
582 parser
->num_classes_being_defined
);
583 fprintf (file
, "Number of template parameter lists for the current "
584 "declaration: %u\n", parser
->num_template_parameter_lists
);
585 cp_debug_parser_tokens (file
, parser
, window_size
);
586 token
= parser
->lexer
->next_token
;
587 fprintf (file
, "Next token to parse:\n");
588 fprintf (file
, "\tToken: ");
589 cp_lexer_print_token (file
, token
);
590 eloc
= expand_location (token
->location
);
591 fprintf (file
, "\n\tFile: %s\n", eloc
.file
);
592 fprintf (file
, "\tLine: %d\n", eloc
.line
);
593 fprintf (file
, "\tColumn: %d\n", eloc
.column
);
597 debug (cp_parser
&ref
)
599 cp_debug_parser (stderr
, &ref
);
603 debug (cp_parser
*ptr
)
608 fprintf (stderr
, "<nil>\n");
611 /* Allocate memory for a new lexer object and return it. */
614 cp_lexer_alloc (void)
618 c_common_no_more_pch ();
620 /* Allocate the memory. */
621 lexer
= ggc_cleared_alloc
<cp_lexer
> ();
623 /* Initially we are not debugging. */
624 lexer
->debugging_p
= false;
626 lexer
->saved_tokens
.create (CP_SAVED_TOKEN_STACK
);
628 /* Create the buffer. */
629 vec_alloc (lexer
->buffer
, CP_LEXER_BUFFER_SIZE
);
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
639 cp_lexer_new_main (void)
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
647 cp_parser_initial_pragma (&token
);
649 lexer
= cp_lexer_alloc ();
651 /* Put the first token in the buffer. */
652 lexer
->buffer
->quick_push (token
);
654 /* Get the remaining tokens from the preprocessor. */
655 while (token
.type
!= CPP_EOF
)
657 cp_lexer_get_preprocessor_token (lexer
, &token
);
658 vec_safe_push (lexer
->buffer
, token
);
661 lexer
->last_token
= lexer
->buffer
->address ()
662 + lexer
->buffer
->length ()
664 lexer
->next_token
= lexer
->buffer
->length ()
665 ? lexer
->buffer
->address ()
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
672 gcc_assert (!lexer
->next_token
->purged_p
);
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
680 cp_lexer_new_from_tokens (cp_token_cache
*cache
)
682 cp_token
*first
= cache
->first
;
683 cp_token
*last
= cache
->last
;
684 cp_lexer
*lexer
= ggc_cleared_alloc
<cp_lexer
> ();
686 /* We do not own the buffer. */
687 lexer
->buffer
= NULL
;
688 lexer
->next_token
= first
== last
? &eof_token
: first
;
689 lexer
->last_token
= last
;
691 lexer
->saved_tokens
.create (CP_SAVED_TOKEN_STACK
);
693 /* Initially we are not debugging. */
694 lexer
->debugging_p
= false;
696 gcc_assert (!lexer
->next_token
->purged_p
);
700 /* Frees all resources associated with LEXER. */
703 cp_lexer_destroy (cp_lexer
*lexer
)
705 vec_free (lexer
->buffer
);
706 lexer
->saved_tokens
.release ();
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
720 cp_lexer_debugging_p (cp_lexer
*lexer
)
722 if (!LEXER_DEBUGGING_ENABLED_P
)
725 return lexer
->debugging_p
;
729 static inline cp_token_position
730 cp_lexer_token_position (cp_lexer
*lexer
, bool previous_p
)
732 gcc_assert (!previous_p
|| lexer
->next_token
!= &eof_token
);
734 return lexer
->next_token
- previous_p
;
737 static inline cp_token
*
738 cp_lexer_token_at (cp_lexer
* /*lexer*/, cp_token_position pos
)
744 cp_lexer_set_token_position (cp_lexer
*lexer
, cp_token_position pos
)
746 lexer
->next_token
= cp_lexer_token_at (lexer
, pos
);
749 static inline cp_token_position
750 cp_lexer_previous_token_position (cp_lexer
*lexer
)
752 if (lexer
->next_token
== &eof_token
)
753 return lexer
->last_token
- 1;
755 return cp_lexer_token_position (lexer
, true);
758 static inline cp_token
*
759 cp_lexer_previous_token (cp_lexer
*lexer
)
761 cp_token_position tp
= cp_lexer_previous_token_position (lexer
);
763 /* Skip past purged tokens. */
766 gcc_assert (tp
!= vec_safe_address (lexer
->buffer
));
770 return cp_lexer_token_at (lexer
, tp
);
773 /* nonzero if we are presently saving tokens. */
776 cp_lexer_saving_tokens (const cp_lexer
* lexer
)
778 return lexer
->saved_tokens
.length () != 0;
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
787 cp_lexer_get_preprocessor_token (cp_lexer
*lexer
, cp_token
*token
)
789 static int is_extern_c
= 0;
791 /* Get a new token from the preprocessor. */
793 = c_lex_with_flags (&token
->u
.value
, &token
->location
, &token
->flags
,
794 lexer
== NULL
? 0 : C_LEX_STRING_NO_JOIN
);
795 token
->keyword
= RID_MAX
;
796 token
->purged_p
= false;
797 token
->error_reported
= false;
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
802 is_extern_c
+= pending_lang_change
;
803 pending_lang_change
= 0;
804 token
->implicit_extern_c
= is_extern_c
> 0;
806 /* Check to see if this token is a keyword. */
807 if (token
->type
== CPP_NAME
)
809 if (IDENTIFIER_KEYWORD_P (token
->u
.value
))
811 /* Mark this token as a keyword. */
812 token
->type
= CPP_KEYWORD
;
813 /* Record which keyword. */
814 token
->keyword
= C_RID_CODE (token
->u
.value
);
818 if (warn_cxx11_compat
819 && C_RID_CODE (token
->u
.value
) >= RID_FIRST_CXX11
820 && C_RID_CODE (token
->u
.value
) <= RID_LAST_CXX11
)
822 /* Warn about the C++0x keyword (but still treat it as
824 warning (OPT_Wc__11_compat
,
825 "identifier %qE is a keyword in C++11",
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
830 C_SET_RID_CODE (token
->u
.value
, RID_MAX
);
833 token
->keyword
= RID_MAX
;
836 else if (token
->type
== CPP_AT_NAME
)
838 /* This only happens in Objective-C++; it must be a keyword. */
839 token
->type
= CPP_KEYWORD
;
840 switch (C_RID_CODE (token
->u
.value
))
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
850 case RID_CLASS
: token
->keyword
= RID_AT_CLASS
; break;
851 case RID_PRIVATE
: token
->keyword
= RID_AT_PRIVATE
; break;
852 case RID_PROTECTED
: token
->keyword
= RID_AT_PROTECTED
; break;
853 case RID_PUBLIC
: token
->keyword
= RID_AT_PUBLIC
; break;
854 case RID_THROW
: token
->keyword
= RID_AT_THROW
; break;
855 case RID_TRY
: token
->keyword
= RID_AT_TRY
; break;
856 case RID_CATCH
: token
->keyword
= RID_AT_CATCH
; break;
857 case RID_SYNCHRONIZED
: token
->keyword
= RID_AT_SYNCHRONIZED
; break;
858 default: token
->keyword
= C_RID_CODE (token
->u
.value
);
863 /* Update the globals input_location and the input file stack from TOKEN. */
865 cp_lexer_set_source_position_from_token (cp_token
*token
)
867 if (token
->type
!= CPP_EOF
)
869 input_location
= token
->location
;
873 /* Update the globals input_location and the input file stack from LEXER. */
875 cp_lexer_set_source_position (cp_lexer
*lexer
)
877 cp_token
*token
= cp_lexer_peek_token (lexer
);
878 cp_lexer_set_source_position_from_token (token
);
881 /* Return a pointer to the next token in the token stream, but do not
884 static inline cp_token
*
885 cp_lexer_peek_token (cp_lexer
*lexer
)
887 if (cp_lexer_debugging_p (lexer
))
889 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream
);
890 cp_lexer_print_token (cp_lexer_debug_stream
, lexer
->next_token
);
891 putc ('\n', cp_lexer_debug_stream
);
893 return lexer
->next_token
;
896 /* Return true if the next token has the indicated TYPE. */
899 cp_lexer_next_token_is (cp_lexer
* lexer
, enum cpp_ttype type
)
901 return cp_lexer_peek_token (lexer
)->type
== type
;
904 /* Return true if the next token does not have the indicated TYPE. */
907 cp_lexer_next_token_is_not (cp_lexer
* lexer
, enum cpp_ttype type
)
909 return !cp_lexer_next_token_is (lexer
, type
);
912 /* Return true if the next token is the indicated KEYWORD. */
915 cp_lexer_next_token_is_keyword (cp_lexer
* lexer
, enum rid keyword
)
917 return cp_lexer_peek_token (lexer
)->keyword
== keyword
;
921 cp_lexer_nth_token_is (cp_lexer
* lexer
, size_t n
, enum cpp_ttype type
)
923 return cp_lexer_peek_nth_token (lexer
, n
)->type
== type
;
927 cp_lexer_nth_token_is_keyword (cp_lexer
* lexer
, size_t n
, enum rid keyword
)
929 return cp_lexer_peek_nth_token (lexer
, n
)->keyword
== keyword
;
932 /* Return true if the next token is not the indicated KEYWORD. */
935 cp_lexer_next_token_is_not_keyword (cp_lexer
* lexer
, enum rid keyword
)
937 return cp_lexer_peek_token (lexer
)->keyword
!= keyword
;
940 /* Return true if KEYWORD can start a decl-specifier. */
943 cp_keyword_starts_decl_specifier_p (enum rid keyword
)
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
981 case RID_UNDERLYING_TYPE
:
986 if (keyword
>= RID_FIRST_INT_N
987 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
988 && int_n_enabled_p
[keyword
- RID_FIRST_INT_N
])
994 /* Return true if the next token is a keyword for a decl-specifier. */
997 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer
*lexer
)
1001 token
= cp_lexer_peek_token (lexer
);
1002 return cp_keyword_starts_decl_specifier_p (token
->keyword
);
1005 /* Returns TRUE iff the token T begins a decltype type. */
1008 token_is_decltype (cp_token
*t
)
1010 return (t
->keyword
== RID_DECLTYPE
1011 || t
->type
== CPP_DECLTYPE
);
1014 /* Returns TRUE iff the next token begins a decltype type. */
1017 cp_lexer_next_token_is_decltype (cp_lexer
*lexer
)
1019 cp_token
*t
= cp_lexer_peek_token (lexer
);
1020 return token_is_decltype (t
);
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1027 saved_checks_value (struct tree_check
*check_value
)
1029 /* Perform any access checks that were deferred. */
1030 vec
<deferred_access_check
, va_gc
> *checks
;
1031 deferred_access_check
*chk
;
1032 checks
= check_value
->checks
;
1036 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
1037 perform_or_defer_access_check (chk
->binfo
,
1039 chk
->diag_decl
, tf_warning_or_error
);
1041 /* Return the stored value. */
1042 return check_value
->value
;
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1052 cp_lexer_peek_nth_token (cp_lexer
* lexer
, size_t n
)
1056 /* N is 1-based, not zero-based. */
1059 if (cp_lexer_debugging_p (lexer
))
1060 fprintf (cp_lexer_debug_stream
,
1061 "cp_lexer: peeking ahead %ld at token: ", (long)n
);
1064 token
= lexer
->next_token
;
1065 gcc_assert (!n
|| token
!= &eof_token
);
1069 if (token
== lexer
->last_token
)
1075 if (!token
->purged_p
)
1079 if (cp_lexer_debugging_p (lexer
))
1081 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
1082 putc ('\n', cp_lexer_debug_stream
);
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1092 cp_lexer_consume_token (cp_lexer
* lexer
)
1094 cp_token
*token
= lexer
->next_token
;
1096 gcc_assert (token
!= &eof_token
);
1097 gcc_assert (!lexer
->in_pragma
|| token
->type
!= CPP_PRAGMA_EOL
);
1101 lexer
->next_token
++;
1102 if (lexer
->next_token
== lexer
->last_token
)
1104 lexer
->next_token
= &eof_token
;
1109 while (lexer
->next_token
->purged_p
);
1111 cp_lexer_set_source_position_from_token (token
);
1113 /* Provide debugging output. */
1114 if (cp_lexer_debugging_p (lexer
))
1116 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream
);
1117 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
1118 putc ('\n', cp_lexer_debug_stream
);
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1129 cp_lexer_purge_token (cp_lexer
*lexer
)
1131 cp_token
*tok
= lexer
->next_token
;
1133 gcc_assert (tok
!= &eof_token
);
1134 tok
->purged_p
= true;
1135 tok
->location
= UNKNOWN_LOCATION
;
1136 tok
->u
.value
= NULL_TREE
;
1137 tok
->keyword
= RID_MAX
;
1142 if (tok
== lexer
->last_token
)
1148 while (tok
->purged_p
);
1149 lexer
->next_token
= tok
;
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1157 cp_lexer_purge_tokens_after (cp_lexer
*lexer
, cp_token
*tok
)
1159 cp_token
*peek
= lexer
->next_token
;
1161 if (peek
== &eof_token
)
1162 peek
= lexer
->last_token
;
1164 gcc_assert (tok
< peek
);
1166 for ( tok
+= 1; tok
!= peek
; tok
+= 1)
1168 tok
->purged_p
= true;
1169 tok
->location
= UNKNOWN_LOCATION
;
1170 tok
->u
.value
= NULL_TREE
;
1171 tok
->keyword
= RID_MAX
;
1175 /* Begin saving tokens. All tokens consumed after this point will be
1179 cp_lexer_save_tokens (cp_lexer
* lexer
)
1181 /* Provide debugging output. */
1182 if (cp_lexer_debugging_p (lexer
))
1183 fprintf (cp_lexer_debug_stream
, "cp_lexer: saving tokens\n");
1185 lexer
->saved_tokens
.safe_push (lexer
->next_token
);
1188 /* Commit to the portion of the token stream most recently saved. */
1191 cp_lexer_commit_tokens (cp_lexer
* lexer
)
1193 /* Provide debugging output. */
1194 if (cp_lexer_debugging_p (lexer
))
1195 fprintf (cp_lexer_debug_stream
, "cp_lexer: committing tokens\n");
1197 lexer
->saved_tokens
.pop ();
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1204 cp_lexer_rollback_tokens (cp_lexer
* lexer
)
1206 /* Provide debugging output. */
1207 if (cp_lexer_debugging_p (lexer
))
1208 fprintf (cp_lexer_debug_stream
, "cp_lexer: restoring tokens\n");
1210 lexer
->next_token
= lexer
->saved_tokens
.pop ();
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1218 struct saved_token_sentinel
1223 saved_token_sentinel(cp_lexer
*lexer
): lexer(lexer
), commit(true)
1225 len
= lexer
->saved_tokens
.length ();
1226 cp_lexer_save_tokens (lexer
);
1230 cp_lexer_rollback_tokens (lexer
);
1233 ~saved_token_sentinel()
1236 cp_lexer_commit_tokens (lexer
);
1237 gcc_assert (lexer
->saved_tokens
.length () == len
);
1241 /* Print a representation of the TOKEN on the STREAM. */
1244 cp_lexer_print_token (FILE * stream
, cp_token
*token
)
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1248 static const char *const token_names
[] = {
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1255 /* C++ parser token types - see "Manifest constants", above. */
1258 "NESTED_NAME_SPECIFIER",
1261 /* For some tokens, print the associated data. */
1262 switch (token
->type
)
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1267 if (!identifier_p (token
->u
.value
))
1271 fputs (IDENTIFIER_POINTER (token
->u
.value
), stream
);
1278 case CPP_UTF8STRING
:
1279 fprintf (stream
, " \"%s\"", TREE_STRING_POINTER (token
->u
.value
));
1283 print_generic_expr (stream
, token
->u
.value
);
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1289 if (token
->type
< ARRAY_SIZE(token_names
))
1290 fputs (token_names
[token
->type
], stream
);
1292 fprintf (stream
, "[%d]", token
->type
);
1298 debug (cp_token
&ref
)
1300 cp_lexer_print_token (stderr
, &ref
);
1301 fprintf (stderr
, "\n");
1305 debug (cp_token
*ptr
)
1310 fprintf (stderr
, "<nil>\n");
1314 /* Start emitting debugging information. */
1317 cp_lexer_start_debugging (cp_lexer
* lexer
)
1319 if (!LEXER_DEBUGGING_ENABLED_P
)
1320 fatal_error (input_location
,
1321 "LEXER_DEBUGGING_ENABLED_P is not set to true");
1323 lexer
->debugging_p
= true;
1324 cp_lexer_debug_stream
= stderr
;
1327 /* Stop emitting debugging information. */
1330 cp_lexer_stop_debugging (cp_lexer
* lexer
)
1332 if (!LEXER_DEBUGGING_ENABLED_P
)
1333 fatal_error (input_location
,
1334 "LEXER_DEBUGGING_ENABLED_P is not set to true");
1336 lexer
->debugging_p
= false;
1337 cp_lexer_debug_stream
= NULL
;
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1342 static cp_token_cache
*
1343 cp_token_cache_new (cp_token
*first
, cp_token
*last
)
1345 cp_token_cache
*cache
= ggc_alloc
<cp_token_cache
> ();
1346 cache
->first
= first
;
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1355 cp_ensure_no_omp_declare_simd (cp_parser
*parser
)
1357 if (parser
->omp_declare_simd
&& !parser
->omp_declare_simd
->error_seen
)
1359 error ("%<#pragma omp declare simd%> not immediately followed by "
1360 "function declaration or definition");
1361 parser
->omp_declare_simd
= NULL
;
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1369 cp_finalize_omp_declare_simd (cp_parser
*parser
, tree fndecl
)
1371 if (__builtin_expect (parser
->omp_declare_simd
!= NULL
, 0))
1373 if (fndecl
== error_mark_node
)
1375 parser
->omp_declare_simd
= NULL
;
1378 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
1380 cp_ensure_no_omp_declare_simd (parser
);
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1390 cp_ensure_no_oacc_routine (cp_parser
*parser
)
1392 if (parser
->oacc_routine
&& !parser
->oacc_routine
->error_seen
)
1394 error_at (parser
->oacc_routine
->loc
,
1395 "%<#pragma acc routine%> not immediately followed by "
1396 "function declaration or definition");
1397 parser
->oacc_routine
= NULL
;
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1406 clear_decl_specs (cp_decl_specifier_seq
*decl_specs
)
1408 memset (decl_specs
, 0, sizeof (cp_decl_specifier_seq
));
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1418 static cp_declarator
*make_call_declarator
1419 (cp_declarator
*, tree
, cp_cv_quals
, cp_virt_specifiers
, cp_ref_qualifier
, tree
, tree
, tree
, tree
);
1420 static cp_declarator
*make_array_declarator
1421 (cp_declarator
*, tree
);
1422 static cp_declarator
*make_pointer_declarator
1423 (cp_cv_quals
, cp_declarator
*, tree
);
1424 static cp_declarator
*make_reference_declarator
1425 (cp_cv_quals
, cp_declarator
*, bool, tree
);
1426 static cp_declarator
*make_ptrmem_declarator
1427 (cp_cv_quals
, tree
, cp_declarator
*, tree
);
1429 /* An erroneous declarator. */
1430 static cp_declarator
*cp_error_declarator
;
1432 /* The obstack on which declarators and related data structures are
1434 static struct obstack declarator_obstack
;
1436 /* Alloc BYTES from the declarator memory pool. */
1438 static inline void *
1439 alloc_declarator (size_t bytes
)
1441 return obstack_alloc (&declarator_obstack
, bytes
);
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1447 static cp_declarator
*
1448 make_declarator (cp_declarator_kind kind
)
1450 cp_declarator
*declarator
;
1452 declarator
= (cp_declarator
*) alloc_declarator (sizeof (cp_declarator
));
1453 declarator
->kind
= kind
;
1454 declarator
->attributes
= NULL_TREE
;
1455 declarator
->std_attributes
= NULL_TREE
;
1456 declarator
->declarator
= NULL
;
1457 declarator
->parameter_pack_p
= false;
1458 declarator
->id_loc
= UNKNOWN_LOCATION
;
1463 /* Make a declarator for a generalized identifier. If
1464 QUALIFYING_SCOPE is non-NULL, the identifier is
1465 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1466 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1469 static cp_declarator
*
1470 make_id_declarator (tree qualifying_scope
, tree unqualified_name
,
1471 special_function_kind sfk
)
1473 cp_declarator
*declarator
;
1475 /* It is valid to write:
1477 class C { void f(); };
1481 The standard is not clear about whether `typedef const C D' is
1482 legal; as of 2002-09-15 the committee is considering that
1483 question. EDG 3.0 allows that syntax. Therefore, we do as
1485 if (qualifying_scope
&& TYPE_P (qualifying_scope
))
1486 qualifying_scope
= TYPE_MAIN_VARIANT (qualifying_scope
);
1488 gcc_assert (identifier_p (unqualified_name
)
1489 || TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
1490 || TREE_CODE (unqualified_name
) == TEMPLATE_ID_EXPR
);
1492 declarator
= make_declarator (cdk_id
);
1493 declarator
->u
.id
.qualifying_scope
= qualifying_scope
;
1494 declarator
->u
.id
.unqualified_name
= unqualified_name
;
1495 declarator
->u
.id
.sfk
= sfk
;
1500 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1501 of modifiers such as const or volatile to apply to the pointer
1502 type, represented as identifiers. ATTRIBUTES represent the attributes that
1503 appertain to the pointer or reference. */
1506 make_pointer_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
,
1509 cp_declarator
*declarator
;
1511 declarator
= make_declarator (cdk_pointer
);
1512 declarator
->declarator
= target
;
1513 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1514 declarator
->u
.pointer
.class_type
= NULL_TREE
;
1517 declarator
->id_loc
= target
->id_loc
;
1518 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1519 target
->parameter_pack_p
= false;
1522 declarator
->parameter_pack_p
= false;
1524 declarator
->std_attributes
= attributes
;
1529 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1530 represent the attributes that appertain to the pointer or
1534 make_reference_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
,
1535 bool rvalue_ref
, tree attributes
)
1537 cp_declarator
*declarator
;
1539 declarator
= make_declarator (cdk_reference
);
1540 declarator
->declarator
= target
;
1541 declarator
->u
.reference
.qualifiers
= cv_qualifiers
;
1542 declarator
->u
.reference
.rvalue_ref
= rvalue_ref
;
1545 declarator
->id_loc
= target
->id_loc
;
1546 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1547 target
->parameter_pack_p
= false;
1550 declarator
->parameter_pack_p
= false;
1552 declarator
->std_attributes
= attributes
;
1557 /* Like make_pointer_declarator -- but for a pointer to a non-static
1558 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1559 appertain to the pointer or reference. */
1562 make_ptrmem_declarator (cp_cv_quals cv_qualifiers
, tree class_type
,
1563 cp_declarator
*pointee
,
1566 cp_declarator
*declarator
;
1568 declarator
= make_declarator (cdk_ptrmem
);
1569 declarator
->declarator
= pointee
;
1570 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1571 declarator
->u
.pointer
.class_type
= class_type
;
1575 declarator
->parameter_pack_p
= pointee
->parameter_pack_p
;
1576 pointee
->parameter_pack_p
= false;
1579 declarator
->parameter_pack_p
= false;
1581 declarator
->std_attributes
= attributes
;
1586 /* Make a declarator for the function given by TARGET, with the
1587 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1588 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1589 indicates what exceptions can be thrown. */
1592 make_call_declarator (cp_declarator
*target
,
1594 cp_cv_quals cv_qualifiers
,
1595 cp_virt_specifiers virt_specifiers
,
1596 cp_ref_qualifier ref_qualifier
,
1598 tree exception_specification
,
1599 tree late_return_type
,
1600 tree requires_clause
)
1602 cp_declarator
*declarator
;
1604 declarator
= make_declarator (cdk_function
);
1605 declarator
->declarator
= target
;
1606 declarator
->u
.function
.parameters
= parms
;
1607 declarator
->u
.function
.qualifiers
= cv_qualifiers
;
1608 declarator
->u
.function
.virt_specifiers
= virt_specifiers
;
1609 declarator
->u
.function
.ref_qualifier
= ref_qualifier
;
1610 declarator
->u
.function
.tx_qualifier
= tx_qualifier
;
1611 declarator
->u
.function
.exception_specification
= exception_specification
;
1612 declarator
->u
.function
.late_return_type
= late_return_type
;
1613 declarator
->u
.function
.requires_clause
= requires_clause
;
1616 declarator
->id_loc
= target
->id_loc
;
1617 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1618 target
->parameter_pack_p
= false;
1621 declarator
->parameter_pack_p
= false;
1626 /* Make a declarator for an array of BOUNDS elements, each of which is
1627 defined by ELEMENT. */
1630 make_array_declarator (cp_declarator
*element
, tree bounds
)
1632 cp_declarator
*declarator
;
1634 declarator
= make_declarator (cdk_array
);
1635 declarator
->declarator
= element
;
1636 declarator
->u
.array
.bounds
= bounds
;
1639 declarator
->id_loc
= element
->id_loc
;
1640 declarator
->parameter_pack_p
= element
->parameter_pack_p
;
1641 element
->parameter_pack_p
= false;
1644 declarator
->parameter_pack_p
= false;
1649 /* Determine whether the declarator we've seen so far can be a
1650 parameter pack, when followed by an ellipsis. */
1652 declarator_can_be_parameter_pack (cp_declarator
*declarator
)
1654 if (declarator
&& declarator
->parameter_pack_p
)
1655 /* We already saw an ellipsis. */
1658 /* Search for a declarator name, or any other declarator that goes
1659 after the point where the ellipsis could appear in a parameter
1660 pack. If we find any of these, then this declarator can not be
1661 made into a parameter pack. */
1663 while (declarator
&& !found
)
1665 switch ((int)declarator
->kind
)
1677 declarator
= declarator
->declarator
;
1685 cp_parameter_declarator
*no_parameters
;
1687 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1688 DECLARATOR and DEFAULT_ARGUMENT. */
1690 cp_parameter_declarator
*
1691 make_parameter_declarator (cp_decl_specifier_seq
*decl_specifiers
,
1692 cp_declarator
*declarator
,
1693 tree default_argument
,
1694 bool template_parameter_pack_p
= false)
1696 cp_parameter_declarator
*parameter
;
1698 parameter
= ((cp_parameter_declarator
*)
1699 alloc_declarator (sizeof (cp_parameter_declarator
)));
1700 parameter
->next
= NULL
;
1701 if (decl_specifiers
)
1702 parameter
->decl_specifiers
= *decl_specifiers
;
1704 clear_decl_specs (¶meter
->decl_specifiers
);
1705 parameter
->declarator
= declarator
;
1706 parameter
->default_argument
= default_argument
;
1707 parameter
->template_parameter_pack_p
= template_parameter_pack_p
;
1712 /* Returns true iff DECLARATOR is a declaration for a function. */
1715 function_declarator_p (const cp_declarator
*declarator
)
1719 if (declarator
->kind
== cdk_function
1720 && declarator
->declarator
->kind
== cdk_id
)
1722 if (declarator
->kind
== cdk_id
1723 || declarator
->kind
== cdk_decomp
1724 || declarator
->kind
== cdk_error
)
1726 declarator
= declarator
->declarator
;
1736 A cp_parser parses the token stream as specified by the C++
1737 grammar. Its job is purely parsing, not semantic analysis. For
1738 example, the parser breaks the token stream into declarators,
1739 expressions, statements, and other similar syntactic constructs.
1740 It does not check that the types of the expressions on either side
1741 of an assignment-statement are compatible, or that a function is
1742 not declared with a parameter of type `void'.
1744 The parser invokes routines elsewhere in the compiler to perform
1745 semantic analysis and to build up the abstract syntax tree for the
1748 The parser (and the template instantiation code, which is, in a
1749 way, a close relative of parsing) are the only parts of the
1750 compiler that should be calling push_scope and pop_scope, or
1751 related functions. The parser (and template instantiation code)
1752 keeps track of what scope is presently active; everything else
1753 should simply honor that. (The code that generates static
1754 initializers may also need to set the scope, in order to check
1755 access control correctly when emitting the initializers.)
1760 The parser is of the standard recursive-descent variety. Upcoming
1761 tokens in the token stream are examined in order to determine which
1762 production to use when parsing a non-terminal. Some C++ constructs
1763 require arbitrary look ahead to disambiguate. For example, it is
1764 impossible, in the general case, to tell whether a statement is an
1765 expression or declaration without scanning the entire statement.
1766 Therefore, the parser is capable of "parsing tentatively." When the
1767 parser is not sure what construct comes next, it enters this mode.
1768 Then, while we attempt to parse the construct, the parser queues up
1769 error messages, rather than issuing them immediately, and saves the
1770 tokens it consumes. If the construct is parsed successfully, the
1771 parser "commits", i.e., it issues any queued error messages and
1772 the tokens that were being preserved are permanently discarded.
1773 If, however, the construct is not parsed successfully, the parser
1774 rolls back its state completely so that it can resume parsing using
1775 a different alternative.
1780 The performance of the parser could probably be improved substantially.
1781 We could often eliminate the need to parse tentatively by looking ahead
1782 a little bit. In some places, this approach might not entirely eliminate
1783 the need to parse tentatively, but it might still speed up the average
1786 /* Flags that are passed to some parsing functions. These values can
1787 be bitwise-ored together. */
1792 CP_PARSER_FLAGS_NONE
= 0x0,
1793 /* The construct is optional. If it is not present, then no error
1794 should be issued. */
1795 CP_PARSER_FLAGS_OPTIONAL
= 0x1,
1796 /* When parsing a type-specifier, treat user-defined type-names
1797 as non-type identifiers. */
1798 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
= 0x2,
1799 /* When parsing a type-specifier, do not try to parse a class-specifier
1800 or enum-specifier. */
1801 CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
= 0x4,
1802 /* When parsing a decl-specifier-seq, only allow type-specifier or
1804 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
= 0x8,
1805 /* When parsing a decl-specifier-seq, only allow mutable or constexpr. */
1806 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR
= 0x10
1809 /* This type is used for parameters and variables which hold
1810 combinations of the above flags. */
1811 typedef int cp_parser_flags
;
1813 /* The different kinds of declarators we want to parse. */
1815 enum cp_parser_declarator_kind
1817 /* We want an abstract declarator. */
1818 CP_PARSER_DECLARATOR_ABSTRACT
,
1819 /* We want a named declarator. */
1820 CP_PARSER_DECLARATOR_NAMED
,
1821 /* We don't mind, but the name must be an unqualified-id. */
1822 CP_PARSER_DECLARATOR_EITHER
1825 /* The precedence values used to parse binary expressions. The minimum value
1826 of PREC must be 1, because zero is reserved to quickly discriminate
1827 binary operators from other tokens. */
1832 PREC_LOGICAL_OR_EXPRESSION
,
1833 PREC_LOGICAL_AND_EXPRESSION
,
1834 PREC_INCLUSIVE_OR_EXPRESSION
,
1835 PREC_EXCLUSIVE_OR_EXPRESSION
,
1836 PREC_AND_EXPRESSION
,
1837 PREC_EQUALITY_EXPRESSION
,
1838 PREC_RELATIONAL_EXPRESSION
,
1839 PREC_SHIFT_EXPRESSION
,
1840 PREC_ADDITIVE_EXPRESSION
,
1841 PREC_MULTIPLICATIVE_EXPRESSION
,
1843 NUM_PREC_VALUES
= PREC_PM_EXPRESSION
1846 /* A mapping from a token type to a corresponding tree node type, with a
1847 precedence value. */
1849 struct cp_parser_binary_operations_map_node
1851 /* The token type. */
1852 enum cpp_ttype token_type
;
1853 /* The corresponding tree code. */
1854 enum tree_code tree_type
;
1855 /* The precedence of this operator. */
1856 enum cp_parser_prec prec
;
1859 struct cp_parser_expression_stack_entry
1861 /* Left hand side of the binary operation we are currently
1864 /* Original tree code for left hand side, if it was a binary
1865 expression itself (used for -Wparentheses). */
1866 enum tree_code lhs_type
;
1867 /* Tree code for the binary operation we are parsing. */
1868 enum tree_code tree_type
;
1869 /* Precedence of the binary operation we are parsing. */
1870 enum cp_parser_prec prec
;
1871 /* Location of the binary operation we are parsing. */
1875 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1876 entries because precedence levels on the stack are monotonically
1878 typedef struct cp_parser_expression_stack_entry
1879 cp_parser_expression_stack
[NUM_PREC_VALUES
];
1883 /* Constructors and destructors. */
1885 static cp_parser_context
*cp_parser_context_new
1886 (cp_parser_context
*);
1888 /* Class variables. */
1890 static GTY((deletable
)) cp_parser_context
* cp_parser_context_free_list
;
1892 /* The operator-precedence table used by cp_parser_binary_expression.
1893 Transformed into an associative array (binops_by_token) by
1896 static const cp_parser_binary_operations_map_node binops
[] = {
1897 { CPP_DEREF_STAR
, MEMBER_REF
, PREC_PM_EXPRESSION
},
1898 { CPP_DOT_STAR
, DOTSTAR_EXPR
, PREC_PM_EXPRESSION
},
1900 { CPP_MULT
, MULT_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1901 { CPP_DIV
, TRUNC_DIV_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1902 { CPP_MOD
, TRUNC_MOD_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1904 { CPP_PLUS
, PLUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1905 { CPP_MINUS
, MINUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1907 { CPP_LSHIFT
, LSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1908 { CPP_RSHIFT
, RSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1910 { CPP_LESS
, LT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1911 { CPP_GREATER
, GT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1912 { CPP_LESS_EQ
, LE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1913 { CPP_GREATER_EQ
, GE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1915 { CPP_EQ_EQ
, EQ_EXPR
, PREC_EQUALITY_EXPRESSION
},
1916 { CPP_NOT_EQ
, NE_EXPR
, PREC_EQUALITY_EXPRESSION
},
1918 { CPP_AND
, BIT_AND_EXPR
, PREC_AND_EXPRESSION
},
1920 { CPP_XOR
, BIT_XOR_EXPR
, PREC_EXCLUSIVE_OR_EXPRESSION
},
1922 { CPP_OR
, BIT_IOR_EXPR
, PREC_INCLUSIVE_OR_EXPRESSION
},
1924 { CPP_AND_AND
, TRUTH_ANDIF_EXPR
, PREC_LOGICAL_AND_EXPRESSION
},
1926 { CPP_OR_OR
, TRUTH_ORIF_EXPR
, PREC_LOGICAL_OR_EXPRESSION
}
1929 /* The same as binops, but initialized by cp_parser_new so that
1930 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1932 static cp_parser_binary_operations_map_node binops_by_token
[N_CP_TTYPES
];
1934 /* Constructors and destructors. */
1936 /* Construct a new context. The context below this one on the stack
1937 is given by NEXT. */
1939 static cp_parser_context
*
1940 cp_parser_context_new (cp_parser_context
* next
)
1942 cp_parser_context
*context
;
1944 /* Allocate the storage. */
1945 if (cp_parser_context_free_list
!= NULL
)
1947 /* Pull the first entry from the free list. */
1948 context
= cp_parser_context_free_list
;
1949 cp_parser_context_free_list
= context
->next
;
1950 memset (context
, 0, sizeof (*context
));
1953 context
= ggc_cleared_alloc
<cp_parser_context
> ();
1955 /* No errors have occurred yet in this context. */
1956 context
->status
= CP_PARSER_STATUS_KIND_NO_ERROR
;
1957 /* If this is not the bottommost context, copy information that we
1958 need from the previous context. */
1961 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1962 expression, then we are parsing one in this context, too. */
1963 context
->object_type
= next
->object_type
;
1964 /* Thread the stack. */
1965 context
->next
= next
;
1971 /* Managing the unparsed function queues. */
1973 #define unparsed_funs_with_default_args \
1974 parser->unparsed_queues->last ().funs_with_default_args
1975 #define unparsed_funs_with_definitions \
1976 parser->unparsed_queues->last ().funs_with_definitions
1977 #define unparsed_nsdmis \
1978 parser->unparsed_queues->last ().nsdmis
1979 #define unparsed_classes \
1980 parser->unparsed_queues->last ().classes
1983 push_unparsed_function_queues (cp_parser
*parser
)
1985 cp_unparsed_functions_entry e
= {NULL
, make_tree_vector (), NULL
, NULL
};
1986 vec_safe_push (parser
->unparsed_queues
, e
);
1990 pop_unparsed_function_queues (cp_parser
*parser
)
1992 release_tree_vector (unparsed_funs_with_definitions
);
1993 parser
->unparsed_queues
->pop ();
1998 /* Constructors and destructors. */
2000 static cp_parser
*cp_parser_new
2003 /* Routines to parse various constructs.
2005 Those that return `tree' will return the error_mark_node (rather
2006 than NULL_TREE) if a parse error occurs, unless otherwise noted.
2007 Sometimes, they will return an ordinary node if error-recovery was
2008 attempted, even though a parse error occurred. So, to check
2009 whether or not a parse error occurred, you should always use
2010 cp_parser_error_occurred. If the construct is optional (indicated
2011 either by an `_opt' in the name of the function that does the
2012 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2013 the construct is not present. */
2015 /* Lexical conventions [gram.lex] */
2017 static cp_expr cp_parser_identifier
2019 static cp_expr cp_parser_string_literal
2020 (cp_parser
*, bool, bool, bool);
2021 static cp_expr cp_parser_userdef_char_literal
2023 static tree cp_parser_userdef_string_literal
2025 static cp_expr cp_parser_userdef_numeric_literal
2028 /* Basic concepts [gram.basic] */
2030 static bool cp_parser_translation_unit
2033 /* Expressions [gram.expr] */
2035 static cp_expr cp_parser_primary_expression
2036 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
2037 static cp_expr cp_parser_id_expression
2038 (cp_parser
*, bool, bool, bool *, bool, bool);
2039 static cp_expr cp_parser_unqualified_id
2040 (cp_parser
*, bool, bool, bool, bool);
2041 static tree cp_parser_nested_name_specifier_opt
2042 (cp_parser
*, bool, bool, bool, bool, bool = false);
2043 static tree cp_parser_nested_name_specifier
2044 (cp_parser
*, bool, bool, bool, bool);
2045 static tree cp_parser_qualifying_entity
2046 (cp_parser
*, bool, bool, bool, bool, bool);
2047 static cp_expr cp_parser_postfix_expression
2048 (cp_parser
*, bool, bool, bool, bool, cp_id_kind
*);
2049 static tree cp_parser_postfix_open_square_expression
2050 (cp_parser
*, tree
, bool, bool);
2051 static tree cp_parser_postfix_dot_deref_expression
2052 (cp_parser
*, enum cpp_ttype
, cp_expr
, bool, cp_id_kind
*, location_t
);
2053 static vec
<tree
, va_gc
> *cp_parser_parenthesized_expression_list
2054 (cp_parser
*, int, bool, bool, bool *, location_t
* = NULL
);
2055 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2056 enum { non_attr
= 0, normal_attr
= 1, id_attr
= 2 };
2057 static void cp_parser_pseudo_destructor_name
2058 (cp_parser
*, tree
, tree
*, tree
*);
2059 static cp_expr cp_parser_unary_expression
2060 (cp_parser
*, cp_id_kind
* = NULL
, bool = false, bool = false, bool = false);
2061 static enum tree_code cp_parser_unary_operator
2063 static tree cp_parser_new_expression
2065 static vec
<tree
, va_gc
> *cp_parser_new_placement
2067 static tree cp_parser_new_type_id
2068 (cp_parser
*, tree
*);
2069 static cp_declarator
*cp_parser_new_declarator_opt
2071 static cp_declarator
*cp_parser_direct_new_declarator
2073 static vec
<tree
, va_gc
> *cp_parser_new_initializer
2075 static tree cp_parser_delete_expression
2077 static cp_expr cp_parser_cast_expression
2078 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
2079 static cp_expr cp_parser_binary_expression
2080 (cp_parser
*, bool, bool, enum cp_parser_prec
, cp_id_kind
*);
2081 static tree cp_parser_question_colon_clause
2082 (cp_parser
*, cp_expr
);
2083 static cp_expr cp_parser_assignment_expression
2084 (cp_parser
*, cp_id_kind
* = NULL
, bool = false, bool = false);
2085 static enum tree_code cp_parser_assignment_operator_opt
2087 static cp_expr cp_parser_expression
2088 (cp_parser
*, cp_id_kind
* = NULL
, bool = false, bool = false);
2089 static cp_expr cp_parser_constant_expression
2090 (cp_parser
*, bool = false, bool * = NULL
);
2091 static cp_expr cp_parser_builtin_offsetof
2093 static cp_expr cp_parser_lambda_expression
2095 static void cp_parser_lambda_introducer
2096 (cp_parser
*, tree
);
2097 static bool cp_parser_lambda_declarator_opt
2098 (cp_parser
*, tree
);
2099 static void cp_parser_lambda_body
2100 (cp_parser
*, tree
);
2102 /* Statements [gram.stmt.stmt] */
2104 static void cp_parser_statement
2105 (cp_parser
*, tree
, bool, bool *, vec
<tree
> * = NULL
, location_t
* = NULL
);
2106 static void cp_parser_label_for_labeled_statement
2107 (cp_parser
*, tree
);
2108 static tree cp_parser_expression_statement
2109 (cp_parser
*, tree
);
2110 static tree cp_parser_compound_statement
2111 (cp_parser
*, tree
, int, bool);
2112 static void cp_parser_statement_seq_opt
2113 (cp_parser
*, tree
);
2114 static tree cp_parser_selection_statement
2115 (cp_parser
*, bool *, vec
<tree
> *);
2116 static tree cp_parser_condition
2118 static tree cp_parser_iteration_statement
2119 (cp_parser
*, bool *, bool);
2120 static bool cp_parser_init_statement
2121 (cp_parser
*, tree
*decl
);
2122 static tree cp_parser_for
2123 (cp_parser
*, bool);
2124 static tree cp_parser_c_for
2125 (cp_parser
*, tree
, tree
, bool);
2126 static tree cp_parser_range_for
2127 (cp_parser
*, tree
, tree
, tree
, bool);
2128 static void do_range_for_auto_deduction
2130 static tree cp_parser_perform_range_for_lookup
2131 (tree
, tree
*, tree
*);
2132 static tree cp_parser_range_for_member_function
2134 static tree cp_parser_jump_statement
2136 static void cp_parser_declaration_statement
2139 static tree cp_parser_implicitly_scoped_statement
2140 (cp_parser
*, bool *, const token_indent_info
&, vec
<tree
> * = NULL
);
2141 static void cp_parser_already_scoped_statement
2142 (cp_parser
*, bool *, const token_indent_info
&);
2144 /* Declarations [gram.dcl.dcl] */
2146 static void cp_parser_declaration_seq_opt
2148 static void cp_parser_declaration
2150 static void cp_parser_block_declaration
2151 (cp_parser
*, bool);
2152 static void cp_parser_simple_declaration
2153 (cp_parser
*, bool, tree
*);
2154 static void cp_parser_decl_specifier_seq
2155 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, int *);
2156 static tree cp_parser_storage_class_specifier_opt
2158 static tree cp_parser_function_specifier_opt
2159 (cp_parser
*, cp_decl_specifier_seq
*);
2160 static tree cp_parser_type_specifier
2161 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, bool,
2163 static tree cp_parser_simple_type_specifier
2164 (cp_parser
*, cp_decl_specifier_seq
*, cp_parser_flags
);
2165 static tree cp_parser_type_name
2166 (cp_parser
*, bool);
2167 static tree cp_parser_type_name
2169 static tree cp_parser_nonclass_name
2170 (cp_parser
* parser
);
2171 static tree cp_parser_elaborated_type_specifier
2172 (cp_parser
*, bool, bool);
2173 static tree cp_parser_enum_specifier
2175 static void cp_parser_enumerator_list
2176 (cp_parser
*, tree
);
2177 static void cp_parser_enumerator_definition
2178 (cp_parser
*, tree
);
2179 static tree cp_parser_namespace_name
2181 static void cp_parser_namespace_definition
2183 static void cp_parser_namespace_body
2185 static tree cp_parser_qualified_namespace_specifier
2187 static void cp_parser_namespace_alias_definition
2189 static bool cp_parser_using_declaration
2190 (cp_parser
*, bool);
2191 static void cp_parser_using_directive
2193 static tree cp_parser_alias_declaration
2195 static void cp_parser_asm_definition
2197 static void cp_parser_linkage_specification
2199 static void cp_parser_static_assert
2200 (cp_parser
*, bool);
2201 static tree cp_parser_decltype
2203 static tree cp_parser_decomposition_declaration
2204 (cp_parser
*, cp_decl_specifier_seq
*, tree
*, location_t
*);
2206 /* Declarators [gram.dcl.decl] */
2208 static tree cp_parser_init_declarator
2209 (cp_parser
*, cp_decl_specifier_seq
*, vec
<deferred_access_check
, va_gc
> *,
2210 bool, bool, int, bool *, tree
*, location_t
*, tree
*);
2211 static cp_declarator
*cp_parser_declarator
2212 (cp_parser
*, cp_parser_declarator_kind
, int *, bool *, bool, bool);
2213 static cp_declarator
*cp_parser_direct_declarator
2214 (cp_parser
*, cp_parser_declarator_kind
, int *, bool, bool);
2215 static enum tree_code cp_parser_ptr_operator
2216 (cp_parser
*, tree
*, cp_cv_quals
*, tree
*);
2217 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2219 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2221 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2223 static tree cp_parser_tx_qualifier_opt
2225 static tree cp_parser_late_return_type_opt
2226 (cp_parser
*, cp_declarator
*, tree
&, cp_cv_quals
);
2227 static tree cp_parser_declarator_id
2228 (cp_parser
*, bool);
2229 static tree cp_parser_type_id
2231 static tree cp_parser_template_type_arg
2233 static tree
cp_parser_trailing_type_id (cp_parser
*);
2234 static tree cp_parser_type_id_1
2235 (cp_parser
*, bool, bool);
2236 static void cp_parser_type_specifier_seq
2237 (cp_parser
*, bool, bool, cp_decl_specifier_seq
*);
2238 static tree cp_parser_parameter_declaration_clause
2240 static tree cp_parser_parameter_declaration_list
2241 (cp_parser
*, bool *);
2242 static cp_parameter_declarator
*cp_parser_parameter_declaration
2243 (cp_parser
*, bool, bool *);
2244 static tree cp_parser_default_argument
2245 (cp_parser
*, bool);
2246 static void cp_parser_function_body
2247 (cp_parser
*, bool);
2248 static tree cp_parser_initializer
2249 (cp_parser
*, bool *, bool *);
2250 static cp_expr cp_parser_initializer_clause
2251 (cp_parser
*, bool *);
2252 static cp_expr cp_parser_braced_list
2253 (cp_parser
*, bool*);
2254 static vec
<constructor_elt
, va_gc
> *cp_parser_initializer_list
2255 (cp_parser
*, bool *);
2257 static bool cp_parser_ctor_initializer_opt_and_function_body
2258 (cp_parser
*, bool);
2260 static tree cp_parser_late_parsing_omp_declare_simd
2261 (cp_parser
*, tree
);
2263 static tree cp_parser_late_parsing_cilk_simd_fn_info
2264 (cp_parser
*, tree
);
2266 static tree cp_parser_late_parsing_oacc_routine
2267 (cp_parser
*, tree
);
2269 static tree synthesize_implicit_template_parm
2270 (cp_parser
*, tree
);
2271 static tree finish_fully_implicit_template
2272 (cp_parser
*, tree
);
2274 /* Classes [gram.class] */
2276 static tree cp_parser_class_name
2277 (cp_parser
*, bool, bool, enum tag_types
, bool, bool, bool, bool = false);
2278 static tree cp_parser_class_specifier
2280 static tree cp_parser_class_head
2281 (cp_parser
*, bool *);
2282 static enum tag_types cp_parser_class_key
2284 static void cp_parser_type_parameter_key
2285 (cp_parser
* parser
);
2286 static void cp_parser_member_specification_opt
2288 static void cp_parser_member_declaration
2290 static tree cp_parser_pure_specifier
2292 static tree cp_parser_constant_initializer
2295 /* Derived classes [gram.class.derived] */
2297 static tree cp_parser_base_clause
2299 static tree cp_parser_base_specifier
2302 /* Special member functions [gram.special] */
2304 static tree cp_parser_conversion_function_id
2306 static tree cp_parser_conversion_type_id
2308 static cp_declarator
*cp_parser_conversion_declarator_opt
2310 static bool cp_parser_ctor_initializer_opt
2312 static void cp_parser_mem_initializer_list
2314 static tree cp_parser_mem_initializer
2316 static tree cp_parser_mem_initializer_id
2319 /* Overloading [gram.over] */
2321 static cp_expr cp_parser_operator_function_id
2323 static cp_expr cp_parser_operator
2326 /* Templates [gram.temp] */
2328 static void cp_parser_template_declaration
2329 (cp_parser
*, bool);
2330 static tree cp_parser_template_parameter_list
2332 static tree cp_parser_template_parameter
2333 (cp_parser
*, bool *, bool *);
2334 static tree cp_parser_type_parameter
2335 (cp_parser
*, bool *);
2336 static tree cp_parser_template_id
2337 (cp_parser
*, bool, bool, enum tag_types
, bool);
2338 static tree cp_parser_template_name
2339 (cp_parser
*, bool, bool, bool, enum tag_types
, bool *);
2340 static tree cp_parser_template_argument_list
2342 static tree cp_parser_template_argument
2344 static void cp_parser_explicit_instantiation
2346 static void cp_parser_explicit_specialization
2349 /* Exception handling [gram.exception] */
2351 static tree cp_parser_try_block
2353 static bool cp_parser_function_try_block
2355 static void cp_parser_handler_seq
2357 static void cp_parser_handler
2359 static tree cp_parser_exception_declaration
2361 static tree cp_parser_throw_expression
2363 static tree cp_parser_exception_specification_opt
2365 static tree cp_parser_type_id_list
2368 /* GNU Extensions */
2370 static tree cp_parser_asm_specification_opt
2372 static tree cp_parser_asm_operand_list
2374 static tree cp_parser_asm_clobber_list
2376 static tree cp_parser_asm_label_list
2378 static bool cp_next_tokens_can_be_attribute_p
2380 static bool cp_next_tokens_can_be_gnu_attribute_p
2382 static bool cp_next_tokens_can_be_std_attribute_p
2384 static bool cp_nth_tokens_can_be_std_attribute_p
2385 (cp_parser
*, size_t);
2386 static bool cp_nth_tokens_can_be_gnu_attribute_p
2387 (cp_parser
*, size_t);
2388 static bool cp_nth_tokens_can_be_attribute_p
2389 (cp_parser
*, size_t);
2390 static tree cp_parser_attributes_opt
2392 static tree cp_parser_gnu_attributes_opt
2394 static tree cp_parser_gnu_attribute_list
2396 static tree cp_parser_std_attribute
2397 (cp_parser
*, tree
);
2398 static tree cp_parser_std_attribute_spec
2400 static tree cp_parser_std_attribute_spec_seq
2402 static bool cp_parser_extension_opt
2403 (cp_parser
*, int *);
2404 static void cp_parser_label_declaration
2407 /* Concept Extensions */
2409 static tree cp_parser_requires_clause
2411 static tree cp_parser_requires_clause_opt
2413 static tree cp_parser_requires_expression
2415 static tree cp_parser_requirement_parameter_list
2417 static tree cp_parser_requirement_body
2419 static tree cp_parser_requirement_list
2421 static tree cp_parser_requirement
2423 static tree cp_parser_simple_requirement
2425 static tree cp_parser_compound_requirement
2427 static tree cp_parser_type_requirement
2429 static tree cp_parser_nested_requirement
2432 /* Transactional Memory Extensions */
2434 static tree cp_parser_transaction
2435 (cp_parser
*, cp_token
*);
2436 static tree cp_parser_transaction_expression
2437 (cp_parser
*, enum rid
);
2438 static bool cp_parser_function_transaction
2439 (cp_parser
*, enum rid
);
2440 static tree cp_parser_transaction_cancel
2443 enum pragma_context
{
2450 static bool cp_parser_pragma
2451 (cp_parser
*, enum pragma_context
, bool *);
2453 /* Objective-C++ Productions */
2455 static tree cp_parser_objc_message_receiver
2457 static tree cp_parser_objc_message_args
2459 static tree cp_parser_objc_message_expression
2461 static cp_expr cp_parser_objc_encode_expression
2463 static tree cp_parser_objc_defs_expression
2465 static tree cp_parser_objc_protocol_expression
2467 static tree cp_parser_objc_selector_expression
2469 static cp_expr cp_parser_objc_expression
2471 static bool cp_parser_objc_selector_p
2473 static tree cp_parser_objc_selector
2475 static tree cp_parser_objc_protocol_refs_opt
2477 static void cp_parser_objc_declaration
2478 (cp_parser
*, tree
);
2479 static tree cp_parser_objc_statement
2481 static bool cp_parser_objc_valid_prefix_attributes
2482 (cp_parser
*, tree
*);
2483 static void cp_parser_objc_at_property_declaration
2485 static void cp_parser_objc_at_synthesize_declaration
2487 static void cp_parser_objc_at_dynamic_declaration
2489 static tree cp_parser_objc_struct_declaration
2492 /* Utility Routines */
2494 static cp_expr cp_parser_lookup_name
2495 (cp_parser
*, tree
, enum tag_types
, bool, bool, bool, tree
*, location_t
);
2496 static tree cp_parser_lookup_name_simple
2497 (cp_parser
*, tree
, location_t
);
2498 static tree cp_parser_maybe_treat_template_as_class
2500 static bool cp_parser_check_declarator_template_parameters
2501 (cp_parser
*, cp_declarator
*, location_t
);
2502 static bool cp_parser_check_template_parameters
2503 (cp_parser
*, unsigned, location_t
, cp_declarator
*);
2504 static cp_expr cp_parser_simple_cast_expression
2506 static tree cp_parser_global_scope_opt
2507 (cp_parser
*, bool);
2508 static bool cp_parser_constructor_declarator_p
2509 (cp_parser
*, bool);
2510 static tree cp_parser_function_definition_from_specifiers_and_declarator
2511 (cp_parser
*, cp_decl_specifier_seq
*, tree
, const cp_declarator
*);
2512 static tree cp_parser_function_definition_after_declarator
2513 (cp_parser
*, bool);
2514 static bool cp_parser_template_declaration_after_export
2515 (cp_parser
*, bool);
2516 static void cp_parser_perform_template_parameter_access_checks
2517 (vec
<deferred_access_check
, va_gc
> *);
2518 static tree cp_parser_single_declaration
2519 (cp_parser
*, vec
<deferred_access_check
, va_gc
> *, bool, bool, bool *);
2520 static cp_expr cp_parser_functional_cast
2521 (cp_parser
*, tree
);
2522 static tree cp_parser_save_member_function_body
2523 (cp_parser
*, cp_decl_specifier_seq
*, cp_declarator
*, tree
);
2524 static tree cp_parser_save_nsdmi
2526 static tree cp_parser_enclosed_template_argument_list
2528 static void cp_parser_save_default_args
2529 (cp_parser
*, tree
);
2530 static void cp_parser_late_parsing_for_member
2531 (cp_parser
*, tree
);
2532 static tree cp_parser_late_parse_one_default_arg
2533 (cp_parser
*, tree
, tree
, tree
);
2534 static void cp_parser_late_parsing_nsdmi
2535 (cp_parser
*, tree
);
2536 static void cp_parser_late_parsing_default_args
2537 (cp_parser
*, tree
);
2538 static tree cp_parser_sizeof_operand
2539 (cp_parser
*, enum rid
);
2540 static tree cp_parser_trait_expr
2541 (cp_parser
*, enum rid
);
2542 static bool cp_parser_declares_only_class_p
2544 static void cp_parser_set_storage_class
2545 (cp_parser
*, cp_decl_specifier_seq
*, enum rid
, cp_token
*);
2546 static void cp_parser_set_decl_spec_type
2547 (cp_decl_specifier_seq
*, tree
, cp_token
*, bool);
2548 static void set_and_check_decl_spec_loc
2549 (cp_decl_specifier_seq
*decl_specs
,
2550 cp_decl_spec ds
, cp_token
*);
2551 static bool cp_parser_friend_p
2552 (const cp_decl_specifier_seq
*);
2553 static void cp_parser_required_error
2554 (cp_parser
*, required_token
, bool);
2555 static cp_token
*cp_parser_require
2556 (cp_parser
*, enum cpp_ttype
, required_token
);
2557 static cp_token
*cp_parser_require_keyword
2558 (cp_parser
*, enum rid
, required_token
);
2559 static bool cp_parser_token_starts_function_definition_p
2561 static bool cp_parser_next_token_starts_class_definition_p
2563 static bool cp_parser_next_token_ends_template_argument_p
2565 static bool cp_parser_nth_token_starts_template_argument_list_p
2566 (cp_parser
*, size_t);
2567 static enum tag_types cp_parser_token_is_class_key
2569 static enum tag_types cp_parser_token_is_type_parameter_key
2571 static void cp_parser_check_class_key
2572 (enum tag_types
, tree type
);
2573 static void cp_parser_check_access_in_redeclaration
2574 (tree type
, location_t location
);
2575 static bool cp_parser_optional_template_keyword
2577 static void cp_parser_pre_parsed_nested_name_specifier
2579 static bool cp_parser_cache_group
2580 (cp_parser
*, enum cpp_ttype
, unsigned);
2581 static tree cp_parser_cache_defarg
2582 (cp_parser
*parser
, bool nsdmi
);
2583 static void cp_parser_parse_tentatively
2585 static void cp_parser_commit_to_tentative_parse
2587 static void cp_parser_commit_to_topmost_tentative_parse
2589 static void cp_parser_abort_tentative_parse
2591 static bool cp_parser_parse_definitely
2593 static inline bool cp_parser_parsing_tentatively
2595 static bool cp_parser_uncommitted_to_tentative_parse_p
2597 static void cp_parser_error
2598 (cp_parser
*, const char *);
2599 static void cp_parser_name_lookup_error
2600 (cp_parser
*, tree
, tree
, name_lookup_error
, location_t
);
2601 static bool cp_parser_simulate_error
2603 static bool cp_parser_check_type_definition
2605 static void cp_parser_check_for_definition_in_return_type
2606 (cp_declarator
*, tree
, location_t type_location
);
2607 static void cp_parser_check_for_invalid_template_id
2608 (cp_parser
*, tree
, enum tag_types
, location_t location
);
2609 static bool cp_parser_non_integral_constant_expression
2610 (cp_parser
*, non_integral_constant
);
2611 static void cp_parser_diagnose_invalid_type_name
2612 (cp_parser
*, tree
, location_t
);
2613 static bool cp_parser_parse_and_diagnose_invalid_type_name
2615 static int cp_parser_skip_to_closing_parenthesis
2616 (cp_parser
*, bool, bool, bool);
2617 static void cp_parser_skip_to_end_of_statement
2619 static void cp_parser_consume_semicolon_at_end_of_statement
2621 static void cp_parser_skip_to_end_of_block_or_statement
2623 static bool cp_parser_skip_to_closing_brace
2625 static void cp_parser_skip_to_end_of_template_parameter_list
2627 static void cp_parser_skip_to_pragma_eol
2628 (cp_parser
*, cp_token
*);
2629 static bool cp_parser_error_occurred
2631 static bool cp_parser_allow_gnu_extensions_p
2633 static bool cp_parser_is_pure_string_literal
2635 static bool cp_parser_is_string_literal
2637 static bool cp_parser_is_keyword
2638 (cp_token
*, enum rid
);
2639 static tree cp_parser_make_typename_type
2640 (cp_parser
*, tree
, location_t location
);
2641 static cp_declarator
* cp_parser_make_indirect_declarator
2642 (enum tree_code
, tree
, cp_cv_quals
, cp_declarator
*, tree
);
2643 static bool cp_parser_compound_literal_p
2645 static bool cp_parser_array_designator_p
2647 static bool cp_parser_init_statement_p
2649 static bool cp_parser_skip_to_closing_square_bracket
2652 /* Concept-related syntactic transformations */
2654 static tree
cp_parser_maybe_concept_name (cp_parser
*, tree
);
2655 static tree
cp_parser_maybe_partial_concept_id (cp_parser
*, tree
, tree
);
2657 // -------------------------------------------------------------------------- //
2658 // Unevaluated Operand Guard
2660 // Implementation of an RAII helper for unevaluated operand parsing.
2661 cp_unevaluated::cp_unevaluated ()
2663 ++cp_unevaluated_operand
;
2664 ++c_inhibit_evaluation_warnings
;
2667 cp_unevaluated::~cp_unevaluated ()
2669 --c_inhibit_evaluation_warnings
;
2670 --cp_unevaluated_operand
;
2673 // -------------------------------------------------------------------------- //
2674 // Tentative Parsing
2676 /* Returns nonzero if we are parsing tentatively. */
2679 cp_parser_parsing_tentatively (cp_parser
* parser
)
2681 return parser
->context
->next
!= NULL
;
2684 /* Returns nonzero if TOKEN is a string literal. */
2687 cp_parser_is_pure_string_literal (cp_token
* token
)
2689 return (token
->type
== CPP_STRING
||
2690 token
->type
== CPP_STRING16
||
2691 token
->type
== CPP_STRING32
||
2692 token
->type
== CPP_WSTRING
||
2693 token
->type
== CPP_UTF8STRING
);
2696 /* Returns nonzero if TOKEN is a string literal
2697 of a user-defined string literal. */
2700 cp_parser_is_string_literal (cp_token
* token
)
2702 return (cp_parser_is_pure_string_literal (token
) ||
2703 token
->type
== CPP_STRING_USERDEF
||
2704 token
->type
== CPP_STRING16_USERDEF
||
2705 token
->type
== CPP_STRING32_USERDEF
||
2706 token
->type
== CPP_WSTRING_USERDEF
||
2707 token
->type
== CPP_UTF8STRING_USERDEF
);
2710 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2713 cp_parser_is_keyword (cp_token
* token
, enum rid keyword
)
2715 return token
->keyword
== keyword
;
2718 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2721 static enum pragma_kind
2722 cp_parser_pragma_kind (cp_token
*token
)
2724 if (token
->type
!= CPP_PRAGMA
)
2726 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2727 return (enum pragma_kind
) TREE_INT_CST_LOW (token
->u
.value
);
2730 /* Helper function for cp_parser_error.
2731 Having peeked a token of kind TOK1_KIND that might signify
2732 a conflict marker, peek successor tokens to determine
2733 if we actually do have a conflict marker.
2734 Specifically, we consider a run of 7 '<', '=' or '>' characters
2735 at the start of a line as a conflict marker.
2736 These come through the lexer as three pairs and a single,
2737 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2738 If it returns true, *OUT_LOC is written to with the location/range
2742 cp_lexer_peek_conflict_marker (cp_lexer
*lexer
, enum cpp_ttype tok1_kind
,
2743 location_t
*out_loc
)
2745 cp_token
*token2
= cp_lexer_peek_nth_token (lexer
, 2);
2746 if (token2
->type
!= tok1_kind
)
2748 cp_token
*token3
= cp_lexer_peek_nth_token (lexer
, 3);
2749 if (token3
->type
!= tok1_kind
)
2751 cp_token
*token4
= cp_lexer_peek_nth_token (lexer
, 4);
2752 if (token4
->type
!= conflict_marker_get_final_tok_kind (tok1_kind
))
2755 /* It must be at the start of the line. */
2756 location_t start_loc
= cp_lexer_peek_token (lexer
)->location
;
2757 if (LOCATION_COLUMN (start_loc
) != 1)
2760 /* We have a conflict marker. Construct a location of the form:
2763 with start == caret, finishing at the end of the marker. */
2764 location_t finish_loc
= get_finish (token4
->location
);
2765 *out_loc
= make_location (start_loc
, start_loc
, finish_loc
);
2770 /* If not parsing tentatively, issue a diagnostic of the form
2771 FILE:LINE: MESSAGE before TOKEN
2772 where TOKEN is the next token in the input stream. MESSAGE
2773 (specified by the caller) is usually of the form "expected
2777 cp_parser_error (cp_parser
* parser
, const char* gmsgid
)
2779 if (!cp_parser_simulate_error (parser
))
2781 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2782 /* This diagnostic makes more sense if it is tagged to the line
2783 of the token we just peeked at. */
2784 cp_lexer_set_source_position_from_token (token
);
2786 if (token
->type
== CPP_PRAGMA
)
2788 error_at (token
->location
,
2789 "%<#pragma%> is not allowed here");
2790 cp_parser_skip_to_pragma_eol (parser
, token
);
2794 /* If this is actually a conflict marker, report it as such. */
2795 if (token
->type
== CPP_LSHIFT
2796 || token
->type
== CPP_RSHIFT
2797 || token
->type
== CPP_EQ_EQ
)
2800 if (cp_lexer_peek_conflict_marker (parser
->lexer
, token
->type
, &loc
))
2802 error_at (loc
, "version control conflict marker in file");
2807 c_parse_error (gmsgid
,
2808 /* Because c_parser_error does not understand
2809 CPP_KEYWORD, keywords are treated like
2811 (token
->type
== CPP_KEYWORD
? CPP_NAME
: token
->type
),
2812 token
->u
.value
, token
->flags
);
2816 /* Issue an error about name-lookup failing. NAME is the
2817 IDENTIFIER_NODE DECL is the result of
2818 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2819 the thing that we hoped to find. */
2822 cp_parser_name_lookup_error (cp_parser
* parser
,
2825 name_lookup_error desired
,
2826 location_t location
)
2828 /* If name lookup completely failed, tell the user that NAME was not
2830 if (decl
== error_mark_node
)
2832 if (parser
->scope
&& parser
->scope
!= global_namespace
)
2833 error_at (location
, "%<%E::%E%> has not been declared",
2834 parser
->scope
, name
);
2835 else if (parser
->scope
== global_namespace
)
2836 error_at (location
, "%<::%E%> has not been declared", name
);
2837 else if (parser
->object_scope
2838 && !CLASS_TYPE_P (parser
->object_scope
))
2839 error_at (location
, "request for member %qE in non-class type %qT",
2840 name
, parser
->object_scope
);
2841 else if (parser
->object_scope
)
2842 error_at (location
, "%<%T::%E%> has not been declared",
2843 parser
->object_scope
, name
);
2845 error_at (location
, "%qE has not been declared", name
);
2847 else if (parser
->scope
&& parser
->scope
!= global_namespace
)
2852 error_at (location
, "%<%E::%E%> is not a type",
2853 parser
->scope
, name
);
2856 error_at (location
, "%<%E::%E%> is not a class or namespace",
2857 parser
->scope
, name
);
2861 "%<%E::%E%> is not a class, namespace, or enumeration",
2862 parser
->scope
, name
);
2869 else if (parser
->scope
== global_namespace
)
2874 error_at (location
, "%<::%E%> is not a type", name
);
2877 error_at (location
, "%<::%E%> is not a class or namespace", name
);
2881 "%<::%E%> is not a class, namespace, or enumeration",
2893 error_at (location
, "%qE is not a type", name
);
2896 error_at (location
, "%qE is not a class or namespace", name
);
2900 "%qE is not a class, namespace, or enumeration", name
);
2908 /* If we are parsing tentatively, remember that an error has occurred
2909 during this tentative parse. Returns true if the error was
2910 simulated; false if a message should be issued by the caller. */
2913 cp_parser_simulate_error (cp_parser
* parser
)
2915 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2917 parser
->context
->status
= CP_PARSER_STATUS_KIND_ERROR
;
2923 /* This function is called when a type is defined. If type
2924 definitions are forbidden at this point, an error message is
2928 cp_parser_check_type_definition (cp_parser
* parser
)
2930 /* If types are forbidden here, issue a message. */
2931 if (parser
->type_definition_forbidden_message
)
2933 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2934 in the message need to be interpreted. */
2935 error (parser
->type_definition_forbidden_message
);
2941 /* This function is called when the DECLARATOR is processed. The TYPE
2942 was a type defined in the decl-specifiers. If it is invalid to
2943 define a type in the decl-specifiers for DECLARATOR, an error is
2944 issued. TYPE_LOCATION is the location of TYPE and is used
2945 for error reporting. */
2948 cp_parser_check_for_definition_in_return_type (cp_declarator
*declarator
,
2949 tree type
, location_t type_location
)
2951 /* [dcl.fct] forbids type definitions in return types.
2952 Unfortunately, it's not easy to know whether or not we are
2953 processing a return type until after the fact. */
2955 && (declarator
->kind
== cdk_pointer
2956 || declarator
->kind
== cdk_reference
2957 || declarator
->kind
== cdk_ptrmem
))
2958 declarator
= declarator
->declarator
;
2960 && declarator
->kind
== cdk_function
)
2962 error_at (type_location
,
2963 "new types may not be defined in a return type");
2964 inform (type_location
,
2965 "(perhaps a semicolon is missing after the definition of %qT)",
2970 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2971 "<" in any valid C++ program. If the next token is indeed "<",
2972 issue a message warning the user about what appears to be an
2973 invalid attempt to form a template-id. LOCATION is the location
2974 of the type-specifier (TYPE) */
2977 cp_parser_check_for_invalid_template_id (cp_parser
* parser
,
2979 enum tag_types tag_type
,
2980 location_t location
)
2982 cp_token_position start
= 0;
2984 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2986 if (TREE_CODE (type
) == TYPE_DECL
)
2987 type
= TREE_TYPE (type
);
2988 if (TYPE_P (type
) && !template_placeholder_p (type
))
2989 error_at (location
, "%qT is not a template", type
);
2990 else if (identifier_p (type
))
2992 if (tag_type
!= none_type
)
2993 error_at (location
, "%qE is not a class template", type
);
2995 error_at (location
, "%qE is not a template", type
);
2998 error_at (location
, "invalid template-id");
2999 /* Remember the location of the invalid "<". */
3000 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
3001 start
= cp_lexer_token_position (parser
->lexer
, true);
3002 /* Consume the "<". */
3003 cp_lexer_consume_token (parser
->lexer
);
3004 /* Parse the template arguments. */
3005 cp_parser_enclosed_template_argument_list (parser
);
3006 /* Permanently remove the invalid template arguments so that
3007 this error message is not issued again. */
3009 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
3013 /* If parsing an integral constant-expression, issue an error message
3014 about the fact that THING appeared and return true. Otherwise,
3015 return false. In either case, set
3016 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3019 cp_parser_non_integral_constant_expression (cp_parser
*parser
,
3020 non_integral_constant thing
)
3022 parser
->non_integral_constant_expression_p
= true;
3023 if (parser
->integral_constant_expression_p
)
3025 if (!parser
->allow_non_integral_constant_expression_p
)
3027 const char *msg
= NULL
;
3031 pedwarn (input_location
, OPT_Wpedantic
,
3032 "ISO C++ forbids using a floating-point literal "
3033 "in a constant-expression");
3036 error ("a cast to a type other than an integral or "
3037 "enumeration type cannot appear in a "
3038 "constant-expression");
3041 error ("%<typeid%> operator "
3042 "cannot appear in a constant-expression");
3045 error ("non-constant compound literals "
3046 "cannot appear in a constant-expression");
3049 error ("a function call "
3050 "cannot appear in a constant-expression");
3053 error ("an increment "
3054 "cannot appear in a constant-expression");
3057 error ("an decrement "
3058 "cannot appear in a constant-expression");
3061 error ("an array reference "
3062 "cannot appear in a constant-expression");
3064 case NIC_ADDR_LABEL
:
3065 error ("the address of a label "
3066 "cannot appear in a constant-expression");
3068 case NIC_OVERLOADED
:
3069 error ("calls to overloaded operators "
3070 "cannot appear in a constant-expression");
3072 case NIC_ASSIGNMENT
:
3073 error ("an assignment cannot appear in a constant-expression");
3076 error ("a comma operator "
3077 "cannot appear in a constant-expression");
3079 case NIC_CONSTRUCTOR
:
3080 error ("a call to a constructor "
3081 "cannot appear in a constant-expression");
3083 case NIC_TRANSACTION
:
3084 error ("a transaction expression "
3085 "cannot appear in a constant-expression");
3091 msg
= "__FUNCTION__";
3093 case NIC_PRETTY_FUNC
:
3094 msg
= "__PRETTY_FUNCTION__";
3114 case NIC_PREINCREMENT
:
3117 case NIC_PREDECREMENT
:
3130 error ("%qs cannot appear in a constant-expression", msg
);
3137 /* Emit a diagnostic for an invalid type name. This function commits
3138 to the current active tentative parse, if any. (Otherwise, the
3139 problematic construct might be encountered again later, resulting
3140 in duplicate error messages.) LOCATION is the location of ID. */
3143 cp_parser_diagnose_invalid_type_name (cp_parser
*parser
, tree id
,
3144 location_t location
)
3146 tree decl
, ambiguous_decls
;
3147 cp_parser_commit_to_tentative_parse (parser
);
3148 /* Try to lookup the identifier. */
3149 decl
= cp_parser_lookup_name (parser
, id
, none_type
,
3150 /*is_template=*/false,
3151 /*is_namespace=*/false,
3152 /*check_dependency=*/true,
3153 &ambiguous_decls
, location
);
3154 if (ambiguous_decls
)
3155 /* If the lookup was ambiguous, an error will already have
3158 /* If the lookup found a template-name, it means that the user forgot
3159 to specify an argument list. Emit a useful error message. */
3160 if (DECL_TYPE_TEMPLATE_P (decl
))
3163 "invalid use of template-name %qE without an argument list",
3165 if (DECL_CLASS_TEMPLATE_P (decl
) && cxx_dialect
< cxx1z
)
3166 inform (location
, "class template argument deduction is only available "
3167 "with -std=c++1z or -std=gnu++1z");
3168 inform (DECL_SOURCE_LOCATION (decl
), "%qD declared here", decl
);
3170 else if (TREE_CODE (id
) == BIT_NOT_EXPR
)
3171 error_at (location
, "invalid use of destructor %qD as a type", id
);
3172 else if (TREE_CODE (decl
) == TYPE_DECL
)
3173 /* Something like 'unsigned A a;' */
3174 error_at (location
, "invalid combination of multiple type-specifiers");
3175 else if (!parser
->scope
)
3177 /* Issue an error message. */
3178 const char *suggestion
= NULL
;
3179 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
3180 suggestion
= lookup_name_fuzzy (id
, FUZZY_LOOKUP_TYPENAME
);
3183 gcc_rich_location
richloc (location
);
3184 richloc
.add_fixit_replace (suggestion
);
3185 error_at_rich_loc (&richloc
,
3186 "%qE does not name a type; did you mean %qs?",
3190 error_at (location
, "%qE does not name a type", id
);
3191 /* If we're in a template class, it's possible that the user was
3192 referring to a type from a base class. For example:
3194 template <typename T> struct A { typedef T X; };
3195 template <typename T> struct B : public A<T> { X x; };
3197 The user should have said "typename A<T>::X". */
3198 if (cxx_dialect
< cxx11
&& id
== ridpointers
[(int)RID_CONSTEXPR
])
3199 inform (location
, "C++11 %<constexpr%> only available with "
3200 "-std=c++11 or -std=gnu++11");
3201 else if (cxx_dialect
< cxx11
&& id
== ridpointers
[(int)RID_NOEXCEPT
])
3202 inform (location
, "C++11 %<noexcept%> only available with "
3203 "-std=c++11 or -std=gnu++11");
3204 else if (cxx_dialect
< cxx11
3205 && TREE_CODE (id
) == IDENTIFIER_NODE
3206 && id_equal (id
, "thread_local"))
3207 inform (location
, "C++11 %<thread_local%> only available with "
3208 "-std=c++11 or -std=gnu++11");
3209 else if (!flag_concepts
&& id
== ridpointers
[(int)RID_CONCEPT
])
3210 inform (location
, "%<concept%> only available with -fconcepts");
3211 else if (processing_template_decl
&& current_class_type
3212 && TYPE_BINFO (current_class_type
))
3216 for (b
= TREE_CHAIN (TYPE_BINFO (current_class_type
));
3220 tree base_type
= BINFO_TYPE (b
);
3221 if (CLASS_TYPE_P (base_type
)
3222 && dependent_type_p (base_type
))
3225 /* Go from a particular instantiation of the
3226 template (which will have an empty TYPE_FIELDs),
3227 to the main version. */
3228 base_type
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type
);
3229 for (field
= TYPE_FIELDS (base_type
);
3231 field
= DECL_CHAIN (field
))
3232 if (TREE_CODE (field
) == TYPE_DECL
3233 && DECL_NAME (field
) == id
)
3236 "(perhaps %<typename %T::%E%> was intended)",
3237 BINFO_TYPE (b
), id
);
3246 /* Here we diagnose qualified-ids where the scope is actually correct,
3247 but the identifier does not resolve to a valid type name. */
3248 else if (parser
->scope
!= error_mark_node
)
3250 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
3252 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
3253 error_at (location_of (id
),
3254 "%qE in namespace %qE does not name a template type",
3256 else if (TREE_CODE (id
) == TEMPLATE_ID_EXPR
)
3257 error_at (location_of (id
),
3258 "%qE in namespace %qE does not name a template type",
3259 TREE_OPERAND (id
, 0), parser
->scope
);
3261 error_at (location_of (id
),
3262 "%qE in namespace %qE does not name a type",
3265 inform (DECL_SOURCE_LOCATION (decl
), "%qD declared here", decl
);
3267 else if (CLASS_TYPE_P (parser
->scope
)
3268 && constructor_name_p (id
, parser
->scope
))
3271 error_at (location
, "%<%T::%E%> names the constructor, not"
3272 " the type", parser
->scope
, id
);
3273 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
3274 error_at (location
, "and %qT has no template constructors",
3277 else if (TYPE_P (parser
->scope
)
3278 && dependent_scope_p (parser
->scope
))
3280 if (TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
3282 "need %<typename%> before %<%T::%D::%E%> because "
3283 "%<%T::%D%> is a dependent scope",
3284 TYPE_CONTEXT (parser
->scope
),
3285 TYPENAME_TYPE_FULLNAME (parser
->scope
),
3287 TYPE_CONTEXT (parser
->scope
),
3288 TYPENAME_TYPE_FULLNAME (parser
->scope
));
3290 error_at (location
, "need %<typename%> before %<%T::%E%> because "
3291 "%qT is a dependent scope",
3292 parser
->scope
, id
, parser
->scope
);
3294 else if (TYPE_P (parser
->scope
))
3296 if (!COMPLETE_TYPE_P (parser
->scope
))
3297 cxx_incomplete_type_error (location_of (id
), NULL_TREE
,
3299 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
3300 error_at (location_of (id
),
3301 "%qE in %q#T does not name a template type",
3303 else if (TREE_CODE (id
) == TEMPLATE_ID_EXPR
)
3304 error_at (location_of (id
),
3305 "%qE in %q#T does not name a template type",
3306 TREE_OPERAND (id
, 0), parser
->scope
);
3308 error_at (location_of (id
),
3309 "%qE in %q#T does not name a type",
3312 inform (DECL_SOURCE_LOCATION (decl
), "%qD declared here", decl
);
3319 /* Check for a common situation where a type-name should be present,
3320 but is not, and issue a sensible error message. Returns true if an
3321 invalid type-name was detected.
3323 The situation handled by this function are variable declarations of the
3324 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3325 Usually, `ID' should name a type, but if we got here it means that it
3326 does not. We try to emit the best possible error message depending on
3327 how exactly the id-expression looks like. */
3330 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser
*parser
)
3333 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3335 /* Avoid duplicate error about ambiguous lookup. */
3336 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
3338 cp_token
*next
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
3339 if (next
->type
== CPP_NAME
&& next
->error_reported
)
3343 cp_parser_parse_tentatively (parser
);
3344 id
= cp_parser_id_expression (parser
,
3345 /*template_keyword_p=*/false,
3346 /*check_dependency_p=*/true,
3347 /*template_p=*/NULL
,
3348 /*declarator_p=*/true,
3349 /*optional_p=*/false);
3350 /* If the next token is a (, this is a function with no explicit return
3351 type, i.e. constructor, destructor or conversion op. */
3352 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
3353 || TREE_CODE (id
) == TYPE_DECL
)
3355 cp_parser_abort_tentative_parse (parser
);
3358 if (!cp_parser_parse_definitely (parser
))
3361 /* Emit a diagnostic for the invalid type. */
3362 cp_parser_diagnose_invalid_type_name (parser
, id
, token
->location
);
3364 /* If we aren't in the middle of a declarator (i.e. in a
3365 parameter-declaration-clause), skip to the end of the declaration;
3366 there's no point in trying to process it. */
3367 if (!parser
->in_declarator_p
)
3368 cp_parser_skip_to_end_of_block_or_statement (parser
);
3372 /* Consume tokens up to, and including, the next non-nested closing `)'.
3373 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3374 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3375 found an unnested token of that type. */
3378 cp_parser_skip_to_closing_parenthesis_1 (cp_parser
*parser
,
3383 unsigned paren_depth
= 0;
3384 unsigned brace_depth
= 0;
3385 unsigned square_depth
= 0;
3387 if (recovering
&& or_ttype
== CPP_EOF
3388 && cp_parser_uncommitted_to_tentative_parse_p (parser
))
3393 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
3395 /* Have we found what we're looking for before the closing paren? */
3396 if (token
->type
== or_ttype
&& or_ttype
!= CPP_EOF
3397 && !brace_depth
&& !paren_depth
&& !square_depth
)
3400 switch (token
->type
)
3403 case CPP_PRAGMA_EOL
:
3404 /* If we've run out of tokens, then there is no closing `)'. */
3407 /* This is good for lambda expression capture-lists. */
3408 case CPP_OPEN_SQUARE
:
3411 case CPP_CLOSE_SQUARE
:
3412 if (!square_depth
--)
3417 /* This matches the processing in skip_to_end_of_statement. */
3422 case CPP_OPEN_BRACE
:
3425 case CPP_CLOSE_BRACE
:
3430 case CPP_OPEN_PAREN
:
3435 case CPP_CLOSE_PAREN
:
3436 if (!brace_depth
&& !paren_depth
--)
3439 cp_lexer_consume_token (parser
->lexer
);
3448 /* Consume the token. */
3449 cp_lexer_consume_token (parser
->lexer
);
3453 /* Consume tokens up to, and including, the next non-nested closing `)'.
3454 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3455 are doing error recovery. Returns -1 if OR_COMMA is true and we
3456 found an unnested token of that type. */
3459 cp_parser_skip_to_closing_parenthesis (cp_parser
*parser
,
3464 cpp_ttype ttype
= or_comma
? CPP_COMMA
: CPP_EOF
;
3465 return cp_parser_skip_to_closing_parenthesis_1 (parser
, recovering
,
3466 ttype
, consume_paren
);
3469 /* Consume tokens until we reach the end of the current statement.
3470 Normally, that will be just before consuming a `;'. However, if a
3471 non-nested `}' comes first, then we stop before consuming that. */
3474 cp_parser_skip_to_end_of_statement (cp_parser
* parser
)
3476 unsigned nesting_depth
= 0;
3478 /* Unwind generic function template scope if necessary. */
3479 if (parser
->fully_implicit_function_template_p
)
3480 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
3484 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3486 switch (token
->type
)
3489 case CPP_PRAGMA_EOL
:
3490 /* If we've run out of tokens, stop. */
3494 /* If the next token is a `;', we have reached the end of the
3500 case CPP_CLOSE_BRACE
:
3501 /* If this is a non-nested '}', stop before consuming it.
3502 That way, when confronted with something like:
3506 we stop before consuming the closing '}', even though we
3507 have not yet reached a `;'. */
3508 if (nesting_depth
== 0)
3511 /* If it is the closing '}' for a block that we have
3512 scanned, stop -- but only after consuming the token.
3518 we will stop after the body of the erroneously declared
3519 function, but before consuming the following `typedef'
3521 if (--nesting_depth
== 0)
3523 cp_lexer_consume_token (parser
->lexer
);
3528 case CPP_OPEN_BRACE
:
3536 /* Consume the token. */
3537 cp_lexer_consume_token (parser
->lexer
);
3541 /* This function is called at the end of a statement or declaration.
3542 If the next token is a semicolon, it is consumed; otherwise, error
3543 recovery is attempted. */
3546 cp_parser_consume_semicolon_at_end_of_statement (cp_parser
*parser
)
3548 /* Look for the trailing `;'. */
3549 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
3551 /* If there is additional (erroneous) input, skip to the end of
3553 cp_parser_skip_to_end_of_statement (parser
);
3554 /* If the next token is now a `;', consume it. */
3555 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
3556 cp_lexer_consume_token (parser
->lexer
);
3560 /* Skip tokens until we have consumed an entire block, or until we
3561 have consumed a non-nested `;'. */
3564 cp_parser_skip_to_end_of_block_or_statement (cp_parser
* parser
)
3566 int nesting_depth
= 0;
3568 /* Unwind generic function template scope if necessary. */
3569 if (parser
->fully_implicit_function_template_p
)
3570 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
3572 while (nesting_depth
>= 0)
3574 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3576 switch (token
->type
)
3579 case CPP_PRAGMA_EOL
:
3580 /* If we've run out of tokens, stop. */
3584 /* Stop if this is an unnested ';'. */
3589 case CPP_CLOSE_BRACE
:
3590 /* Stop if this is an unnested '}', or closes the outermost
3593 if (nesting_depth
< 0)
3599 case CPP_OPEN_BRACE
:
3608 /* Consume the token. */
3609 cp_lexer_consume_token (parser
->lexer
);
3613 /* Skip tokens until a non-nested closing curly brace is the next
3614 token, or there are no more tokens. Return true in the first case,
3618 cp_parser_skip_to_closing_brace (cp_parser
*parser
)
3620 unsigned nesting_depth
= 0;
3624 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3626 switch (token
->type
)
3629 case CPP_PRAGMA_EOL
:
3630 /* If we've run out of tokens, stop. */
3633 case CPP_CLOSE_BRACE
:
3634 /* If the next token is a non-nested `}', then we have reached
3635 the end of the current block. */
3636 if (nesting_depth
-- == 0)
3640 case CPP_OPEN_BRACE
:
3641 /* If it the next token is a `{', then we are entering a new
3642 block. Consume the entire block. */
3650 /* Consume the token. */
3651 cp_lexer_consume_token (parser
->lexer
);
3655 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3656 parameter is the PRAGMA token, allowing us to purge the entire pragma
3660 cp_parser_skip_to_pragma_eol (cp_parser
* parser
, cp_token
*pragma_tok
)
3664 parser
->lexer
->in_pragma
= false;
3667 token
= cp_lexer_consume_token (parser
->lexer
);
3668 while (token
->type
!= CPP_PRAGMA_EOL
&& token
->type
!= CPP_EOF
);
3670 /* Ensure that the pragma is not parsed again. */
3671 cp_lexer_purge_tokens_after (parser
->lexer
, pragma_tok
);
3674 /* Require pragma end of line, resyncing with it as necessary. The
3675 arguments are as for cp_parser_skip_to_pragma_eol. */
3678 cp_parser_require_pragma_eol (cp_parser
*parser
, cp_token
*pragma_tok
)
3680 parser
->lexer
->in_pragma
= false;
3681 if (!cp_parser_require (parser
, CPP_PRAGMA_EOL
, RT_PRAGMA_EOL
))
3682 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
3685 /* This is a simple wrapper around make_typename_type. When the id is
3686 an unresolved identifier node, we can provide a superior diagnostic
3687 using cp_parser_diagnose_invalid_type_name. */
3690 cp_parser_make_typename_type (cp_parser
*parser
, tree id
,
3691 location_t id_location
)
3694 if (identifier_p (id
))
3696 result
= make_typename_type (parser
->scope
, id
, typename_type
,
3697 /*complain=*/tf_none
);
3698 if (result
== error_mark_node
)
3699 cp_parser_diagnose_invalid_type_name (parser
, id
, id_location
);
3702 return make_typename_type (parser
->scope
, id
, typename_type
, tf_error
);
3705 /* This is a wrapper around the
3706 make_{pointer,ptrmem,reference}_declarator functions that decides
3707 which one to call based on the CODE and CLASS_TYPE arguments. The
3708 CODE argument should be one of the values returned by
3709 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3710 appertain to the pointer or reference. */
3712 static cp_declarator
*
3713 cp_parser_make_indirect_declarator (enum tree_code code
, tree class_type
,
3714 cp_cv_quals cv_qualifiers
,
3715 cp_declarator
*target
,
3718 if (code
== ERROR_MARK
)
3719 return cp_error_declarator
;
3721 if (code
== INDIRECT_REF
)
3722 if (class_type
== NULL_TREE
)
3723 return make_pointer_declarator (cv_qualifiers
, target
, attributes
);
3725 return make_ptrmem_declarator (cv_qualifiers
, class_type
,
3726 target
, attributes
);
3727 else if (code
== ADDR_EXPR
&& class_type
== NULL_TREE
)
3728 return make_reference_declarator (cv_qualifiers
, target
,
3730 else if (code
== NON_LVALUE_EXPR
&& class_type
== NULL_TREE
)
3731 return make_reference_declarator (cv_qualifiers
, target
,
3736 /* Create a new C++ parser. */
3739 cp_parser_new (void)
3745 /* cp_lexer_new_main is called before doing GC allocation because
3746 cp_lexer_new_main might load a PCH file. */
3747 lexer
= cp_lexer_new_main ();
3749 /* Initialize the binops_by_token so that we can get the tree
3750 directly from the token. */
3751 for (i
= 0; i
< sizeof (binops
) / sizeof (binops
[0]); i
++)
3752 binops_by_token
[binops
[i
].token_type
] = binops
[i
];
3754 parser
= ggc_cleared_alloc
<cp_parser
> ();
3755 parser
->lexer
= lexer
;
3756 parser
->context
= cp_parser_context_new (NULL
);
3758 /* For now, we always accept GNU extensions. */
3759 parser
->allow_gnu_extensions_p
= 1;
3761 /* The `>' token is a greater-than operator, not the end of a
3763 parser
->greater_than_is_operator_p
= true;
3765 parser
->default_arg_ok_p
= true;
3767 /* We are not parsing a constant-expression. */
3768 parser
->integral_constant_expression_p
= false;
3769 parser
->allow_non_integral_constant_expression_p
= false;
3770 parser
->non_integral_constant_expression_p
= false;
3772 /* Local variable names are not forbidden. */
3773 parser
->local_variables_forbidden_p
= false;
3775 /* We are not processing an `extern "C"' declaration. */
3776 parser
->in_unbraced_linkage_specification_p
= false;
3778 /* We are not processing a declarator. */
3779 parser
->in_declarator_p
= false;
3781 /* We are not processing a template-argument-list. */
3782 parser
->in_template_argument_list_p
= false;
3784 /* We are not in an iteration statement. */
3785 parser
->in_statement
= 0;
3787 /* We are not in a switch statement. */
3788 parser
->in_switch_statement_p
= false;
3790 /* We are not parsing a type-id inside an expression. */
3791 parser
->in_type_id_in_expr_p
= false;
3793 /* Declarations aren't implicitly extern "C". */
3794 parser
->implicit_extern_c
= false;
3796 /* String literals should be translated to the execution character set. */
3797 parser
->translate_strings_p
= true;
3799 /* We are not parsing a function body. */
3800 parser
->in_function_body
= false;
3802 /* We can correct until told otherwise. */
3803 parser
->colon_corrects_to_scope_p
= true;
3805 /* The unparsed function queue is empty. */
3806 push_unparsed_function_queues (parser
);
3808 /* There are no classes being defined. */
3809 parser
->num_classes_being_defined
= 0;
3811 /* No template parameters apply. */
3812 parser
->num_template_parameter_lists
= 0;
3814 /* Special parsing data structures. */
3815 parser
->omp_declare_simd
= NULL
;
3816 parser
->cilk_simd_fn_info
= NULL
;
3817 parser
->oacc_routine
= NULL
;
3819 /* Not declaring an implicit function template. */
3820 parser
->auto_is_implicit_function_template_parm_p
= false;
3821 parser
->fully_implicit_function_template_p
= false;
3822 parser
->implicit_template_parms
= 0;
3823 parser
->implicit_template_scope
= 0;
3825 /* Allow constrained-type-specifiers. */
3826 parser
->prevent_constrained_type_specifiers
= 0;
3831 /* Create a cp_lexer structure which will emit the tokens in CACHE
3832 and push it onto the parser's lexer stack. This is used for delayed
3833 parsing of in-class method bodies and default arguments, and should
3834 not be confused with tentative parsing. */
3836 cp_parser_push_lexer_for_tokens (cp_parser
*parser
, cp_token_cache
*cache
)
3838 cp_lexer
*lexer
= cp_lexer_new_from_tokens (cache
);
3839 lexer
->next
= parser
->lexer
;
3840 parser
->lexer
= lexer
;
3842 /* Move the current source position to that of the first token in the
3844 cp_lexer_set_source_position_from_token (lexer
->next_token
);
3847 /* Pop the top lexer off the parser stack. This is never used for the
3848 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3850 cp_parser_pop_lexer (cp_parser
*parser
)
3852 cp_lexer
*lexer
= parser
->lexer
;
3853 parser
->lexer
= lexer
->next
;
3854 cp_lexer_destroy (lexer
);
3856 /* Put the current source position back where it was before this
3857 lexer was pushed. */
3858 cp_lexer_set_source_position_from_token (parser
->lexer
->next_token
);
3861 /* Lexical conventions [gram.lex] */
3863 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3867 cp_parser_identifier (cp_parser
* parser
)
3871 /* Look for the identifier. */
3872 token
= cp_parser_require (parser
, CPP_NAME
, RT_NAME
);
3873 /* Return the value. */
3875 return cp_expr (token
->u
.value
, token
->location
);
3877 return error_mark_node
;
3880 /* Parse a sequence of adjacent string constants. Returns a
3881 TREE_STRING representing the combined, nul-terminated string
3882 constant. If TRANSLATE is true, translate the string to the
3883 execution character set. If WIDE_OK is true, a wide string is
3886 C++98 [lex.string] says that if a narrow string literal token is
3887 adjacent to a wide string literal token, the behavior is undefined.
3888 However, C99 6.4.5p4 says that this results in a wide string literal.
3889 We follow C99 here, for consistency with the C front end.
3891 This code is largely lifted from lex_string() in c-lex.c.
3893 FUTURE: ObjC++ will need to handle @-strings here. */
3895 cp_parser_string_literal (cp_parser
*parser
, bool translate
, bool wide_ok
,
3896 bool lookup_udlit
= true)
3900 struct obstack str_ob
;
3901 cpp_string str
, istr
, *strs
;
3903 enum cpp_ttype type
, curr_type
;
3904 int have_suffix_p
= 0;
3906 tree suffix_id
= NULL_TREE
;
3907 bool curr_tok_is_userdef_p
= false;
3909 tok
= cp_lexer_peek_token (parser
->lexer
);
3910 if (!cp_parser_is_string_literal (tok
))
3912 cp_parser_error (parser
, "expected string-literal");
3913 return error_mark_node
;
3916 location_t loc
= tok
->location
;
3918 if (cpp_userdef_string_p (tok
->type
))
3920 string_tree
= USERDEF_LITERAL_VALUE (tok
->u
.value
);
3921 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3922 curr_tok_is_userdef_p
= true;
3926 string_tree
= tok
->u
.value
;
3927 curr_type
= tok
->type
;
3931 /* Try to avoid the overhead of creating and destroying an obstack
3932 for the common case of just one string. */
3933 if (!cp_parser_is_string_literal
3934 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
3936 cp_lexer_consume_token (parser
->lexer
);
3938 str
.text
= (const unsigned char *)TREE_STRING_POINTER (string_tree
);
3939 str
.len
= TREE_STRING_LENGTH (string_tree
);
3942 if (curr_tok_is_userdef_p
)
3944 suffix_id
= USERDEF_LITERAL_SUFFIX_ID (tok
->u
.value
);
3946 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3949 curr_type
= tok
->type
;
3955 location_t last_tok_loc
= tok
->location
;
3956 gcc_obstack_init (&str_ob
);
3961 cp_lexer_consume_token (parser
->lexer
);
3963 str
.text
= (const unsigned char *)TREE_STRING_POINTER (string_tree
);
3964 str
.len
= TREE_STRING_LENGTH (string_tree
);
3966 if (curr_tok_is_userdef_p
)
3968 tree curr_suffix_id
= USERDEF_LITERAL_SUFFIX_ID (tok
->u
.value
);
3969 if (have_suffix_p
== 0)
3971 suffix_id
= curr_suffix_id
;
3974 else if (have_suffix_p
== 1
3975 && curr_suffix_id
!= suffix_id
)
3977 error ("inconsistent user-defined literal suffixes"
3978 " %qD and %qD in string literal",
3979 suffix_id
, curr_suffix_id
);
3982 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3985 curr_type
= tok
->type
;
3987 if (type
!= curr_type
)
3989 if (type
== CPP_STRING
)
3991 else if (curr_type
!= CPP_STRING
)
3993 rich_location
rich_loc (line_table
, tok
->location
);
3994 rich_loc
.add_range (last_tok_loc
, false);
3995 error_at_rich_loc (&rich_loc
,
3996 "unsupported non-standard concatenation "
3997 "of string literals");
4001 obstack_grow (&str_ob
, &str
, sizeof (cpp_string
));
4003 last_tok_loc
= tok
->location
;
4005 tok
= cp_lexer_peek_token (parser
->lexer
);
4006 if (cpp_userdef_string_p (tok
->type
))
4008 string_tree
= USERDEF_LITERAL_VALUE (tok
->u
.value
);
4009 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
4010 curr_tok_is_userdef_p
= true;
4014 string_tree
= tok
->u
.value
;
4015 curr_type
= tok
->type
;
4016 curr_tok_is_userdef_p
= false;
4019 while (cp_parser_is_string_literal (tok
));
4021 /* A string literal built by concatenation has its caret=start at
4022 the start of the initial string, and its finish at the finish of
4023 the final string literal. */
4024 loc
= make_location (loc
, loc
, get_finish (last_tok_loc
));
4026 strs
= (cpp_string
*) obstack_finish (&str_ob
);
4029 if (type
!= CPP_STRING
&& !wide_ok
)
4031 cp_parser_error (parser
, "a wide string is invalid in this context");
4035 if ((translate
? cpp_interpret_string
: cpp_interpret_string_notranslate
)
4036 (parse_in
, strs
, count
, &istr
, type
))
4038 value
= build_string (istr
.len
, (const char *)istr
.text
);
4039 free (CONST_CAST (unsigned char *, istr
.text
));
4045 case CPP_UTF8STRING
:
4046 TREE_TYPE (value
) = char_array_type_node
;
4049 TREE_TYPE (value
) = char16_array_type_node
;
4052 TREE_TYPE (value
) = char32_array_type_node
;
4055 TREE_TYPE (value
) = wchar_array_type_node
;
4059 value
= fix_string_type (value
);
4063 tree literal
= build_userdef_literal (suffix_id
, value
,
4064 OT_NONE
, NULL_TREE
);
4066 value
= cp_parser_userdef_string_literal (literal
);
4072 /* cpp_interpret_string has issued an error. */
4073 value
= error_mark_node
;
4076 obstack_free (&str_ob
, 0);
4078 return cp_expr (value
, loc
);
4081 /* Look up a literal operator with the name and the exact arguments. */
4084 lookup_literal_operator (tree name
, vec
<tree
, va_gc
> *args
)
4087 decl
= lookup_name (name
);
4088 if (!decl
|| !is_overloaded_fn (decl
))
4089 return error_mark_node
;
4091 for (lkp_iterator
iter (decl
); iter
; ++iter
)
4096 tree parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
4097 if (parmtypes
!= NULL_TREE
)
4099 for (ix
= 0; ix
< vec_safe_length (args
) && parmtypes
!= NULL_TREE
;
4100 ++ix
, parmtypes
= TREE_CHAIN (parmtypes
))
4102 tree tparm
= TREE_VALUE (parmtypes
);
4103 tree targ
= TREE_TYPE ((*args
)[ix
]);
4104 bool ptr
= TYPE_PTR_P (tparm
);
4105 bool arr
= TREE_CODE (targ
) == ARRAY_TYPE
;
4106 if ((ptr
|| arr
|| !same_type_p (tparm
, targ
))
4108 || !same_type_p (TREE_TYPE (tparm
),
4113 && ix
== vec_safe_length (args
)
4114 /* May be this should be sufficient_parms_p instead,
4115 depending on how exactly should user-defined literals
4116 work in presence of default arguments on the literal
4117 operator parameters. */
4118 && parmtypes
== void_list_node
)
4123 return error_mark_node
;
4126 /* Parse a user-defined char constant. Returns a call to a user-defined
4127 literal operator taking the character as an argument. */
4130 cp_parser_userdef_char_literal (cp_parser
*parser
)
4132 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
4133 tree literal
= token
->u
.value
;
4134 tree suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
4135 tree value
= USERDEF_LITERAL_VALUE (literal
);
4136 tree name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
4139 /* Build up a call to the user-defined operator */
4140 /* Lookup the name we got back from the id-expression. */
4141 vec
<tree
, va_gc
> *args
= make_tree_vector ();
4142 vec_safe_push (args
, value
);
4143 decl
= lookup_literal_operator (name
, args
);
4144 if (!decl
|| decl
== error_mark_node
)
4146 error ("unable to find character literal operator %qD with %qT argument",
4147 name
, TREE_TYPE (value
));
4148 release_tree_vector (args
);
4149 return error_mark_node
;
4151 result
= finish_call_expr (decl
, &args
, false, true, tf_warning_or_error
);
4152 release_tree_vector (args
);
4156 /* A subroutine of cp_parser_userdef_numeric_literal to
4157 create a char... template parameter pack from a string node. */
4160 make_char_string_pack (tree value
)
4163 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
4164 const char *str
= TREE_STRING_POINTER (value
);
4165 int i
, len
= TREE_STRING_LENGTH (value
) - 1;
4166 tree argvec
= make_tree_vec (1);
4168 /* Fill in CHARVEC with all of the parameters. */
4169 charvec
= make_tree_vec (len
);
4170 for (i
= 0; i
< len
; ++i
)
4171 TREE_VEC_ELT (charvec
, i
) = build_int_cst (char_type_node
, str
[i
]);
4173 /* Build the argument packs. */
4174 SET_ARGUMENT_PACK_ARGS (argpack
, charvec
);
4176 TREE_VEC_ELT (argvec
, 0) = argpack
;
4181 /* A subroutine of cp_parser_userdef_numeric_literal to
4182 create a char... template parameter pack from a string node. */
4185 make_string_pack (tree value
)
4188 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
4189 const unsigned char *str
4190 = (const unsigned char *) TREE_STRING_POINTER (value
);
4191 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (value
))));
4192 int len
= TREE_STRING_LENGTH (value
) / sz
- 1;
4193 tree argvec
= make_tree_vec (2);
4195 tree str_char_type_node
= TREE_TYPE (TREE_TYPE (value
));
4196 str_char_type_node
= TYPE_MAIN_VARIANT (str_char_type_node
);
4198 /* First template parm is character type. */
4199 TREE_VEC_ELT (argvec
, 0) = str_char_type_node
;
4201 /* Fill in CHARVEC with all of the parameters. */
4202 charvec
= make_tree_vec (len
);
4203 for (int i
= 0; i
< len
; ++i
)
4204 TREE_VEC_ELT (charvec
, i
)
4205 = double_int_to_tree (str_char_type_node
,
4206 double_int::from_buffer (str
+ i
* sz
, sz
));
4208 /* Build the argument packs. */
4209 SET_ARGUMENT_PACK_ARGS (argpack
, charvec
);
4211 TREE_VEC_ELT (argvec
, 1) = argpack
;
4216 /* Parse a user-defined numeric constant. returns a call to a user-defined
4217 literal operator. */
4220 cp_parser_userdef_numeric_literal (cp_parser
*parser
)
4222 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
4223 tree literal
= token
->u
.value
;
4224 tree suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
4225 tree value
= USERDEF_LITERAL_VALUE (literal
);
4226 int overflow
= USERDEF_LITERAL_OVERFLOW (literal
);
4227 tree num_string
= USERDEF_LITERAL_NUM_STRING (literal
);
4228 tree name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
4230 vec
<tree
, va_gc
> *args
;
4232 /* Look for a literal operator taking the exact type of numeric argument
4233 as the literal value. */
4234 args
= make_tree_vector ();
4235 vec_safe_push (args
, value
);
4236 decl
= lookup_literal_operator (name
, args
);
4237 if (decl
&& decl
!= error_mark_node
)
4239 result
= finish_call_expr (decl
, &args
, false, true,
4240 tf_warning_or_error
);
4242 if (TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
&& overflow
> 0)
4244 warning_at (token
->location
, OPT_Woverflow
,
4245 "integer literal exceeds range of %qT type",
4246 long_long_unsigned_type_node
);
4251 warning_at (token
->location
, OPT_Woverflow
,
4252 "floating literal exceeds range of %qT type",
4253 long_double_type_node
);
4254 else if (overflow
< 0)
4255 warning_at (token
->location
, OPT_Woverflow
,
4256 "floating literal truncated to zero");
4259 release_tree_vector (args
);
4262 release_tree_vector (args
);
4264 /* If the numeric argument didn't work, look for a raw literal
4265 operator taking a const char* argument consisting of the number
4266 in string format. */
4267 args
= make_tree_vector ();
4268 vec_safe_push (args
, num_string
);
4269 decl
= lookup_literal_operator (name
, args
);
4270 if (decl
&& decl
!= error_mark_node
)
4272 result
= finish_call_expr (decl
, &args
, false, true,
4273 tf_warning_or_error
);
4274 release_tree_vector (args
);
4277 release_tree_vector (args
);
4279 /* If the raw literal didn't work, look for a non-type template
4280 function with parameter pack char.... Call the function with
4281 template parameter characters representing the number. */
4282 args
= make_tree_vector ();
4283 decl
= lookup_literal_operator (name
, args
);
4284 if (decl
&& decl
!= error_mark_node
)
4286 tree tmpl_args
= make_char_string_pack (num_string
);
4287 decl
= lookup_template_function (decl
, tmpl_args
);
4288 result
= finish_call_expr (decl
, &args
, false, true,
4289 tf_warning_or_error
);
4290 release_tree_vector (args
);
4294 release_tree_vector (args
);
4296 error ("unable to find numeric literal operator %qD", name
);
4297 if (!cpp_get_options (parse_in
)->ext_numeric_literals
)
4298 inform (token
->location
, "use -std=gnu++11 or -fext-numeric-literals "
4299 "to enable more built-in suffixes");
4300 return error_mark_node
;
4303 /* Parse a user-defined string constant. Returns a call to a user-defined
4304 literal operator taking a character pointer and the length of the string
4308 cp_parser_userdef_string_literal (tree literal
)
4310 tree suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
4311 tree name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
4312 tree value
= USERDEF_LITERAL_VALUE (literal
);
4313 int len
= TREE_STRING_LENGTH (value
)
4314 / TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (value
)))) - 1;
4316 vec
<tree
, va_gc
> *args
;
4318 /* Build up a call to the user-defined operator. */
4319 /* Lookup the name we got back from the id-expression. */
4320 args
= make_tree_vector ();
4321 vec_safe_push (args
, value
);
4322 vec_safe_push (args
, build_int_cst (size_type_node
, len
));
4323 decl
= lookup_literal_operator (name
, args
);
4325 if (decl
&& decl
!= error_mark_node
)
4327 result
= finish_call_expr (decl
, &args
, false, true,
4328 tf_warning_or_error
);
4329 release_tree_vector (args
);
4332 release_tree_vector (args
);
4334 /* Look for a template function with typename parameter CharT
4335 and parameter pack CharT... Call the function with
4336 template parameter characters representing the string. */
4337 args
= make_tree_vector ();
4338 decl
= lookup_literal_operator (name
, args
);
4339 if (decl
&& decl
!= error_mark_node
)
4341 tree tmpl_args
= make_string_pack (value
);
4342 decl
= lookup_template_function (decl
, tmpl_args
);
4343 result
= finish_call_expr (decl
, &args
, false, true,
4344 tf_warning_or_error
);
4345 release_tree_vector (args
);
4348 release_tree_vector (args
);
4350 error ("unable to find string literal operator %qD with %qT, %qT arguments",
4351 name
, TREE_TYPE (value
), size_type_node
);
4352 return error_mark_node
;
4356 /* Basic concepts [gram.basic] */
4358 /* Parse a translation-unit.
4361 declaration-seq [opt]
4363 Returns TRUE if all went well. */
4366 cp_parser_translation_unit (cp_parser
* parser
)
4368 /* The address of the first non-permanent object on the declarator
4370 static void *declarator_obstack_base
;
4374 /* Create the declarator obstack, if necessary. */
4375 if (!cp_error_declarator
)
4377 gcc_obstack_init (&declarator_obstack
);
4378 /* Create the error declarator. */
4379 cp_error_declarator
= make_declarator (cdk_error
);
4380 /* Create the empty parameter list. */
4381 no_parameters
= make_parameter_declarator (NULL
, NULL
, NULL_TREE
);
4382 /* Remember where the base of the declarator obstack lies. */
4383 declarator_obstack_base
= obstack_next_free (&declarator_obstack
);
4386 cp_parser_declaration_seq_opt (parser
);
4388 /* If there are no tokens left then all went well. */
4389 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
4391 /* Get rid of the token array; we don't need it any more. */
4392 cp_lexer_destroy (parser
->lexer
);
4393 parser
->lexer
= NULL
;
4395 /* This file might have been a context that's implicitly extern
4396 "C". If so, pop the lang context. (Only relevant for PCH.) */
4397 if (parser
->implicit_extern_c
)
4399 pop_lang_context ();
4400 parser
->implicit_extern_c
= false;
4404 finish_translation_unit ();
4410 cp_parser_error (parser
, "expected declaration");
4414 /* Make sure the declarator obstack was fully cleaned up. */
4415 gcc_assert (obstack_next_free (&declarator_obstack
)
4416 == declarator_obstack_base
);
4418 /* All went well. */
4422 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4423 decltype context. */
4425 static inline tsubst_flags_t
4426 complain_flags (bool decltype_p
)
4428 tsubst_flags_t complain
= tf_warning_or_error
;
4430 complain
|= tf_decltype
;
4434 /* We're about to parse a collection of statements. If we're currently
4435 parsing tentatively, set up a firewall so that any nested
4436 cp_parser_commit_to_tentative_parse won't affect the current context. */
4438 static cp_token_position
4439 cp_parser_start_tentative_firewall (cp_parser
*parser
)
4441 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
4444 cp_parser_parse_tentatively (parser
);
4445 cp_parser_commit_to_topmost_tentative_parse (parser
);
4446 return cp_lexer_token_position (parser
->lexer
, false);
4449 /* We've finished parsing the collection of statements. Wrap up the
4450 firewall and replace the relevant tokens with the parsed form. */
4453 cp_parser_end_tentative_firewall (cp_parser
*parser
, cp_token_position start
,
4459 /* Finish the firewall level. */
4460 cp_parser_parse_definitely (parser
);
4461 /* And remember the result of the parse for when we try again. */
4462 cp_token
*token
= cp_lexer_token_at (parser
->lexer
, start
);
4463 token
->type
= CPP_PREPARSED_EXPR
;
4464 token
->u
.value
= expr
;
4465 token
->keyword
= RID_MAX
;
4466 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
4469 /* Like the above functions, but let the user modify the tokens. Used by
4470 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4471 later parses, so it makes sense to localize the effects of
4472 cp_parser_commit_to_tentative_parse. */
4474 struct tentative_firewall
4479 tentative_firewall (cp_parser
*p
): parser(p
)
4481 /* If we're currently parsing tentatively, start a committed level as a
4482 firewall and then an inner tentative parse. */
4483 if ((set
= cp_parser_uncommitted_to_tentative_parse_p (parser
)))
4485 cp_parser_parse_tentatively (parser
);
4486 cp_parser_commit_to_topmost_tentative_parse (parser
);
4487 cp_parser_parse_tentatively (parser
);
4491 ~tentative_firewall()
4495 /* Finish the inner tentative parse and the firewall, propagating any
4496 uncommitted error state to the outer tentative parse. */
4497 bool err
= cp_parser_error_occurred (parser
);
4498 cp_parser_parse_definitely (parser
);
4499 cp_parser_parse_definitely (parser
);
4501 cp_parser_simulate_error (parser
);
4506 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4507 enclosing parentheses. */
4510 cp_parser_statement_expr (cp_parser
*parser
)
4512 cp_token_position start
= cp_parser_start_tentative_firewall (parser
);
4514 /* Consume the '('. */
4515 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
4516 cp_lexer_consume_token (parser
->lexer
);
4517 /* Start the statement-expression. */
4518 tree expr
= begin_stmt_expr ();
4519 /* Parse the compound-statement. */
4520 cp_parser_compound_statement (parser
, expr
, BCS_NORMAL
, false);
4522 expr
= finish_stmt_expr (expr
, false);
4523 /* Consume the ')'. */
4524 location_t finish_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
4525 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
4526 cp_parser_skip_to_end_of_statement (parser
);
4528 cp_parser_end_tentative_firewall (parser
, start
, expr
);
4529 location_t combined_loc
= make_location (start_loc
, start_loc
, finish_loc
);
4530 return cp_expr (expr
, combined_loc
);
4533 /* Expressions [gram.expr] */
4535 /* Parse a fold-operator.
4538 - * / % ^ & | = < > << >>
4539 = -= *= /= %= ^= &= |= <<= >>=
4540 == != <= >= && || , .* ->*
4542 This returns the tree code corresponding to the matched operator
4543 as an int. When the current token matches a compound assignment
4544 opertor, the resulting tree code is the negative value of the
4545 non-assignment operator. */
4548 cp_parser_fold_operator (cp_token
*token
)
4550 switch (token
->type
)
4552 case CPP_PLUS
: return PLUS_EXPR
;
4553 case CPP_MINUS
: return MINUS_EXPR
;
4554 case CPP_MULT
: return MULT_EXPR
;
4555 case CPP_DIV
: return TRUNC_DIV_EXPR
;
4556 case CPP_MOD
: return TRUNC_MOD_EXPR
;
4557 case CPP_XOR
: return BIT_XOR_EXPR
;
4558 case CPP_AND
: return BIT_AND_EXPR
;
4559 case CPP_OR
: return BIT_IOR_EXPR
;
4560 case CPP_LSHIFT
: return LSHIFT_EXPR
;
4561 case CPP_RSHIFT
: return RSHIFT_EXPR
;
4563 case CPP_EQ
: return -NOP_EXPR
;
4564 case CPP_PLUS_EQ
: return -PLUS_EXPR
;
4565 case CPP_MINUS_EQ
: return -MINUS_EXPR
;
4566 case CPP_MULT_EQ
: return -MULT_EXPR
;
4567 case CPP_DIV_EQ
: return -TRUNC_DIV_EXPR
;
4568 case CPP_MOD_EQ
: return -TRUNC_MOD_EXPR
;
4569 case CPP_XOR_EQ
: return -BIT_XOR_EXPR
;
4570 case CPP_AND_EQ
: return -BIT_AND_EXPR
;
4571 case CPP_OR_EQ
: return -BIT_IOR_EXPR
;
4572 case CPP_LSHIFT_EQ
: return -LSHIFT_EXPR
;
4573 case CPP_RSHIFT_EQ
: return -RSHIFT_EXPR
;
4575 case CPP_EQ_EQ
: return EQ_EXPR
;
4576 case CPP_NOT_EQ
: return NE_EXPR
;
4577 case CPP_LESS
: return LT_EXPR
;
4578 case CPP_GREATER
: return GT_EXPR
;
4579 case CPP_LESS_EQ
: return LE_EXPR
;
4580 case CPP_GREATER_EQ
: return GE_EXPR
;
4582 case CPP_AND_AND
: return TRUTH_ANDIF_EXPR
;
4583 case CPP_OR_OR
: return TRUTH_ORIF_EXPR
;
4585 case CPP_COMMA
: return COMPOUND_EXPR
;
4587 case CPP_DOT_STAR
: return DOTSTAR_EXPR
;
4588 case CPP_DEREF_STAR
: return MEMBER_REF
;
4590 default: return ERROR_MARK
;
4594 /* Returns true if CODE indicates a binary expression, which is not allowed in
4595 the LHS of a fold-expression. More codes will need to be added to use this
4596 function in other contexts. */
4599 is_binary_op (tree_code code
)
4604 case POINTER_PLUS_EXPR
:
4607 case TRUNC_DIV_EXPR
:
4608 case TRUNC_MOD_EXPR
:
4624 case TRUTH_ANDIF_EXPR
:
4625 case TRUTH_ORIF_EXPR
:
4638 /* If the next token is a suitable fold operator, consume it and return as
4639 the function above. */
4642 cp_parser_fold_operator (cp_parser
*parser
)
4644 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
4645 int code
= cp_parser_fold_operator (token
);
4646 if (code
!= ERROR_MARK
)
4647 cp_lexer_consume_token (parser
->lexer
);
4651 /* Parse a fold-expression.
4654 ( ... folding-operator cast-expression)
4655 ( cast-expression folding-operator ... )
4656 ( cast-expression folding operator ... folding-operator cast-expression)
4658 Note that the '(' and ')' are matched in primary expression. */
4661 cp_parser_fold_expression (cp_parser
*parser
, tree expr1
)
4666 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
4668 cp_lexer_consume_token (parser
->lexer
);
4669 int op
= cp_parser_fold_operator (parser
);
4670 if (op
== ERROR_MARK
)
4672 cp_parser_error (parser
, "expected binary operator");
4673 return error_mark_node
;
4676 tree expr
= cp_parser_cast_expression (parser
, false, false,
4678 if (expr
== error_mark_node
)
4679 return error_mark_node
;
4680 return finish_left_unary_fold_expr (expr
, op
);
4683 const cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
4684 int op
= cp_parser_fold_operator (parser
);
4685 if (op
== ERROR_MARK
)
4687 cp_parser_error (parser
, "expected binary operator");
4688 return error_mark_node
;
4691 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
))
4693 cp_parser_error (parser
, "expected ...");
4694 return error_mark_node
;
4696 cp_lexer_consume_token (parser
->lexer
);
4698 /* The operands of a fold-expression are cast-expressions, so binary or
4699 conditional expressions are not allowed. We check this here to avoid
4700 tentative parsing. */
4701 if (EXPR_P (expr1
) && TREE_NO_WARNING (expr1
))
4702 /* OK, the expression was parenthesized. */;
4703 else if (is_binary_op (TREE_CODE (expr1
)))
4704 error_at (location_of (expr1
),
4705 "binary expression in operand of fold-expression");
4706 else if (TREE_CODE (expr1
) == COND_EXPR
)
4707 error_at (location_of (expr1
),
4708 "conditional expression in operand of fold-expression");
4711 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
4712 return finish_right_unary_fold_expr (expr1
, op
);
4714 if (cp_lexer_next_token_is_not (parser
->lexer
, token
->type
))
4716 cp_parser_error (parser
, "mismatched operator in fold-expression");
4717 return error_mark_node
;
4719 cp_lexer_consume_token (parser
->lexer
);
4721 // Binary left or right fold.
4722 tree expr2
= cp_parser_cast_expression (parser
, false, false, false, &pidk
);
4723 if (expr2
== error_mark_node
)
4724 return error_mark_node
;
4725 return finish_binary_fold_expr (expr1
, expr2
, op
);
4728 /* Parse a primary-expression.
4735 lambda-expression (C++11)
4740 ( compound-statement )
4741 __builtin_va_arg ( assignment-expression , type-id )
4742 __builtin_offsetof ( type-id , offsetof-expression )
4745 __has_nothrow_assign ( type-id )
4746 __has_nothrow_constructor ( type-id )
4747 __has_nothrow_copy ( type-id )
4748 __has_trivial_assign ( type-id )
4749 __has_trivial_constructor ( type-id )
4750 __has_trivial_copy ( type-id )
4751 __has_trivial_destructor ( type-id )
4752 __has_virtual_destructor ( type-id )
4753 __is_abstract ( type-id )
4754 __is_base_of ( type-id , type-id )
4755 __is_class ( type-id )
4756 __is_empty ( type-id )
4757 __is_enum ( type-id )
4758 __is_final ( type-id )
4759 __is_literal_type ( type-id )
4760 __is_pod ( type-id )
4761 __is_polymorphic ( type-id )
4762 __is_std_layout ( type-id )
4763 __is_trivial ( type-id )
4764 __is_union ( type-id )
4766 Objective-C++ Extension:
4774 ADDRESS_P is true iff this expression was immediately preceded by
4775 "&" and therefore might denote a pointer-to-member. CAST_P is true
4776 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4777 true iff this expression is a template argument.
4779 Returns a representation of the expression. Upon return, *IDK
4780 indicates what kind of id-expression (if any) was present. */
4783 cp_parser_primary_expression (cp_parser
*parser
,
4786 bool template_arg_p
,
4790 cp_token
*token
= NULL
;
4792 /* Assume the primary expression is not an id-expression. */
4793 *idk
= CP_ID_KIND_NONE
;
4795 /* Peek at the next token. */
4796 token
= cp_lexer_peek_token (parser
->lexer
);
4797 switch ((int) token
->type
)
4806 user-defined-literal */
4813 case CPP_PREPARSED_EXPR
:
4814 if (TREE_CODE (token
->u
.value
) == USERDEF_LITERAL
)
4815 return cp_parser_userdef_numeric_literal (parser
);
4816 token
= cp_lexer_consume_token (parser
->lexer
);
4817 if (TREE_CODE (token
->u
.value
) == FIXED_CST
)
4819 error_at (token
->location
,
4820 "fixed-point types not supported in C++");
4821 return error_mark_node
;
4823 /* Floating-point literals are only allowed in an integral
4824 constant expression if they are cast to an integral or
4825 enumeration type. */
4826 if (TREE_CODE (token
->u
.value
) == REAL_CST
4827 && parser
->integral_constant_expression_p
4830 /* CAST_P will be set even in invalid code like "int(2.7 +
4831 ...)". Therefore, we have to check that the next token
4832 is sure to end the cast. */
4835 cp_token
*next_token
;
4837 next_token
= cp_lexer_peek_token (parser
->lexer
);
4838 if (/* The comma at the end of an
4839 enumerator-definition. */
4840 next_token
->type
!= CPP_COMMA
4841 /* The curly brace at the end of an enum-specifier. */
4842 && next_token
->type
!= CPP_CLOSE_BRACE
4843 /* The end of a statement. */
4844 && next_token
->type
!= CPP_SEMICOLON
4845 /* The end of the cast-expression. */
4846 && next_token
->type
!= CPP_CLOSE_PAREN
4847 /* The end of an array bound. */
4848 && next_token
->type
!= CPP_CLOSE_SQUARE
4849 /* The closing ">" in a template-argument-list. */
4850 && (next_token
->type
!= CPP_GREATER
4851 || parser
->greater_than_is_operator_p
)
4852 /* C++0x only: A ">>" treated like two ">" tokens,
4853 in a template-argument-list. */
4854 && (next_token
->type
!= CPP_RSHIFT
4855 || (cxx_dialect
== cxx98
)
4856 || parser
->greater_than_is_operator_p
))
4860 /* If we are within a cast, then the constraint that the
4861 cast is to an integral or enumeration type will be
4862 checked at that point. If we are not within a cast, then
4863 this code is invalid. */
4865 cp_parser_non_integral_constant_expression (parser
, NIC_FLOAT
);
4867 return cp_expr (token
->u
.value
, token
->location
);
4869 case CPP_CHAR_USERDEF
:
4870 case CPP_CHAR16_USERDEF
:
4871 case CPP_CHAR32_USERDEF
:
4872 case CPP_WCHAR_USERDEF
:
4873 case CPP_UTF8CHAR_USERDEF
:
4874 return cp_parser_userdef_char_literal (parser
);
4880 case CPP_UTF8STRING
:
4881 case CPP_STRING_USERDEF
:
4882 case CPP_STRING16_USERDEF
:
4883 case CPP_STRING32_USERDEF
:
4884 case CPP_WSTRING_USERDEF
:
4885 case CPP_UTF8STRING_USERDEF
:
4886 /* ??? Should wide strings be allowed when parser->translate_strings_p
4887 is false (i.e. in attributes)? If not, we can kill the third
4888 argument to cp_parser_string_literal. */
4889 return cp_parser_string_literal (parser
,
4890 parser
->translate_strings_p
,
4893 case CPP_OPEN_PAREN
:
4894 /* If we see `( { ' then we are looking at the beginning of
4895 a GNU statement-expression. */
4896 if (cp_parser_allow_gnu_extensions_p (parser
)
4897 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_OPEN_BRACE
))
4899 /* Statement-expressions are not allowed by the standard. */
4900 pedwarn (token
->location
, OPT_Wpedantic
,
4901 "ISO C++ forbids braced-groups within expressions");
4903 /* And they're not allowed outside of a function-body; you
4904 cannot, for example, write:
4906 int i = ({ int j = 3; j + 1; });
4908 at class or namespace scope. */
4909 if (!parser
->in_function_body
4910 || parser
->in_template_argument_list_p
)
4912 error_at (token
->location
,
4913 "statement-expressions are not allowed outside "
4914 "functions nor in template-argument lists");
4915 cp_parser_skip_to_end_of_block_or_statement (parser
);
4916 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
4917 cp_lexer_consume_token (parser
->lexer
);
4918 return error_mark_node
;
4921 return cp_parser_statement_expr (parser
);
4923 /* Otherwise it's a normal parenthesized expression. */
4926 bool saved_greater_than_is_operator_p
;
4928 location_t open_paren_loc
= token
->location
;
4930 /* Consume the `('. */
4931 cp_lexer_consume_token (parser
->lexer
);
4932 /* Within a parenthesized expression, a `>' token is always
4933 the greater-than operator. */
4934 saved_greater_than_is_operator_p
4935 = parser
->greater_than_is_operator_p
;
4936 parser
->greater_than_is_operator_p
= true;
4938 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
4939 /* Left fold expression. */
4942 /* Parse the parenthesized expression. */
4943 expr
= cp_parser_expression (parser
, idk
, cast_p
, decltype_p
);
4945 token
= cp_lexer_peek_token (parser
->lexer
);
4946 if (token
->type
== CPP_ELLIPSIS
|| cp_parser_fold_operator (token
))
4948 expr
= cp_parser_fold_expression (parser
, expr
);
4949 if (expr
!= error_mark_node
4950 && cxx_dialect
< cxx1z
4951 && !in_system_header_at (input_location
))
4952 pedwarn (input_location
, 0, "fold-expressions only available "
4953 "with -std=c++1z or -std=gnu++1z");
4956 /* Let the front end know that this expression was
4957 enclosed in parentheses. This matters in case, for
4958 example, the expression is of the form `A::B', since
4959 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4961 expr
= finish_parenthesized_expr (expr
);
4963 /* DR 705: Wrapping an unqualified name in parentheses
4964 suppresses arg-dependent lookup. We want to pass back
4965 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4966 (c++/37862), but none of the others. */
4967 if (*idk
!= CP_ID_KIND_QUALIFIED
)
4968 *idk
= CP_ID_KIND_NONE
;
4970 /* The `>' token might be the end of a template-id or
4971 template-parameter-list now. */
4972 parser
->greater_than_is_operator_p
4973 = saved_greater_than_is_operator_p
;
4975 /* Consume the `)'. */
4976 token
= cp_lexer_peek_token (parser
->lexer
);
4977 location_t close_paren_loc
= token
->location
;
4978 expr
.set_range (open_paren_loc
, close_paren_loc
);
4979 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
)
4980 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
4981 cp_parser_skip_to_end_of_statement (parser
);
4986 case CPP_OPEN_SQUARE
:
4988 if (c_dialect_objc ())
4990 /* We might have an Objective-C++ message. */
4991 cp_parser_parse_tentatively (parser
);
4992 tree msg
= cp_parser_objc_message_expression (parser
);
4993 /* If that works out, we're done ... */
4994 if (cp_parser_parse_definitely (parser
))
4996 /* ... else, fall though to see if it's a lambda. */
4998 cp_expr lam
= cp_parser_lambda_expression (parser
);
4999 /* Don't warn about a failed tentative parse. */
5000 if (cp_parser_error_occurred (parser
))
5001 return error_mark_node
;
5002 maybe_warn_cpp0x (CPP0X_LAMBDA_EXPR
);
5006 case CPP_OBJC_STRING
:
5007 if (c_dialect_objc ())
5008 /* We have an Objective-C++ string literal. */
5009 return cp_parser_objc_expression (parser
);
5010 cp_parser_error (parser
, "expected primary-expression");
5011 return error_mark_node
;
5014 switch (token
->keyword
)
5016 /* These two are the boolean literals. */
5018 cp_lexer_consume_token (parser
->lexer
);
5019 return cp_expr (boolean_true_node
, token
->location
);
5021 cp_lexer_consume_token (parser
->lexer
);
5022 return cp_expr (boolean_false_node
, token
->location
);
5024 /* The `__null' literal. */
5026 cp_lexer_consume_token (parser
->lexer
);
5027 return cp_expr (null_node
, token
->location
);
5029 /* The `nullptr' literal. */
5031 cp_lexer_consume_token (parser
->lexer
);
5032 return cp_expr (nullptr_node
, token
->location
);
5034 /* Recognize the `this' keyword. */
5036 cp_lexer_consume_token (parser
->lexer
);
5037 if (parser
->local_variables_forbidden_p
)
5039 error_at (token
->location
,
5040 "%<this%> may not be used in this context");
5041 return error_mark_node
;
5043 /* Pointers cannot appear in constant-expressions. */
5044 if (cp_parser_non_integral_constant_expression (parser
, NIC_THIS
))
5045 return error_mark_node
;
5046 return cp_expr (finish_this_expr (), token
->location
);
5048 /* The `operator' keyword can be the beginning of an
5053 case RID_FUNCTION_NAME
:
5054 case RID_PRETTY_FUNCTION_NAME
:
5055 case RID_C99_FUNCTION_NAME
:
5057 non_integral_constant name
;
5059 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5060 __func__ are the names of variables -- but they are
5061 treated specially. Therefore, they are handled here,
5062 rather than relying on the generic id-expression logic
5063 below. Grammatically, these names are id-expressions.
5065 Consume the token. */
5066 token
= cp_lexer_consume_token (parser
->lexer
);
5068 switch (token
->keyword
)
5070 case RID_FUNCTION_NAME
:
5071 name
= NIC_FUNC_NAME
;
5073 case RID_PRETTY_FUNCTION_NAME
:
5074 name
= NIC_PRETTY_FUNC
;
5076 case RID_C99_FUNCTION_NAME
:
5077 name
= NIC_C99_FUNC
;
5083 if (cp_parser_non_integral_constant_expression (parser
, name
))
5084 return error_mark_node
;
5086 /* Look up the name. */
5087 return finish_fname (token
->u
.value
);
5094 source_location type_location
;
5095 location_t start_loc
5096 = cp_lexer_peek_token (parser
->lexer
)->location
;
5097 /* The `__builtin_va_arg' construct is used to handle
5098 `va_arg'. Consume the `__builtin_va_arg' token. */
5099 cp_lexer_consume_token (parser
->lexer
);
5100 /* Look for the opening `('. */
5101 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
5102 /* Now, parse the assignment-expression. */
5103 expression
= cp_parser_assignment_expression (parser
);
5104 /* Look for the `,'. */
5105 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
5106 type_location
= cp_lexer_peek_token (parser
->lexer
)->location
;
5107 /* Parse the type-id. */
5109 type_id_in_expr_sentinel
s (parser
);
5110 type
= cp_parser_type_id (parser
);
5112 /* Look for the closing `)'. */
5113 location_t finish_loc
5114 = cp_lexer_peek_token (parser
->lexer
)->location
;
5115 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5116 /* Using `va_arg' in a constant-expression is not
5118 if (cp_parser_non_integral_constant_expression (parser
,
5120 return error_mark_node
;
5121 /* Construct a location of the form:
5122 __builtin_va_arg (v, int)
5123 ~~~~~~~~~~~~~~~~~~~~~^~~~
5124 with the caret at the type, ranging from the start of the
5125 "__builtin_va_arg" token to the close paren. */
5126 location_t combined_loc
5127 = make_location (type_location
, start_loc
, finish_loc
);
5128 return build_x_va_arg (combined_loc
, expression
, type
);
5132 return cp_parser_builtin_offsetof (parser
);
5134 case RID_HAS_NOTHROW_ASSIGN
:
5135 case RID_HAS_NOTHROW_CONSTRUCTOR
:
5136 case RID_HAS_NOTHROW_COPY
:
5137 case RID_HAS_TRIVIAL_ASSIGN
:
5138 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
5139 case RID_HAS_TRIVIAL_COPY
:
5140 case RID_HAS_TRIVIAL_DESTRUCTOR
:
5141 case RID_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
5142 case RID_HAS_VIRTUAL_DESTRUCTOR
:
5143 case RID_IS_ABSTRACT
:
5144 case RID_IS_AGGREGATE
:
5145 case RID_IS_BASE_OF
:
5150 case RID_IS_LITERAL_TYPE
:
5152 case RID_IS_POLYMORPHIC
:
5153 case RID_IS_SAME_AS
:
5154 case RID_IS_STD_LAYOUT
:
5155 case RID_IS_TRIVIAL
:
5156 case RID_IS_TRIVIALLY_ASSIGNABLE
:
5157 case RID_IS_TRIVIALLY_CONSTRUCTIBLE
:
5158 case RID_IS_TRIVIALLY_COPYABLE
:
5160 case RID_IS_ASSIGNABLE
:
5161 case RID_IS_CONSTRUCTIBLE
:
5162 return cp_parser_trait_expr (parser
, token
->keyword
);
5166 return cp_parser_requires_expression (parser
);
5168 /* Objective-C++ expressions. */
5170 case RID_AT_PROTOCOL
:
5171 case RID_AT_SELECTOR
:
5172 return cp_parser_objc_expression (parser
);
5175 if (parser
->in_function_body
5176 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
5179 error_at (token
->location
,
5180 "a template declaration cannot appear at block scope");
5181 cp_parser_skip_to_end_of_block_or_statement (parser
);
5182 return error_mark_node
;
5186 cp_parser_error (parser
, "expected primary-expression");
5187 return error_mark_node
;
5190 /* An id-expression can start with either an identifier, a
5191 `::' as the beginning of a qualified-id, or the "operator"
5195 case CPP_TEMPLATE_ID
:
5196 case CPP_NESTED_NAME_SPECIFIER
:
5199 cp_expr id_expression
;
5201 const char *error_msg
;
5204 cp_token
*id_expr_token
;
5206 /* Parse the id-expression. */
5208 = cp_parser_id_expression (parser
,
5209 /*template_keyword_p=*/false,
5210 /*check_dependency_p=*/true,
5212 /*declarator_p=*/false,
5213 /*optional_p=*/false);
5214 if (id_expression
== error_mark_node
)
5215 return error_mark_node
;
5216 id_expr_token
= token
;
5217 token
= cp_lexer_peek_token (parser
->lexer
);
5218 done
= (token
->type
!= CPP_OPEN_SQUARE
5219 && token
->type
!= CPP_OPEN_PAREN
5220 && token
->type
!= CPP_DOT
5221 && token
->type
!= CPP_DEREF
5222 && token
->type
!= CPP_PLUS_PLUS
5223 && token
->type
!= CPP_MINUS_MINUS
);
5224 /* If we have a template-id, then no further lookup is
5225 required. If the template-id was for a template-class, we
5226 will sometimes have a TYPE_DECL at this point. */
5227 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
5228 || TREE_CODE (id_expression
) == TYPE_DECL
)
5229 decl
= id_expression
;
5230 /* Look up the name. */
5233 tree ambiguous_decls
;
5235 /* If we already know that this lookup is ambiguous, then
5236 we've already issued an error message; there's no reason
5238 if (id_expr_token
->type
== CPP_NAME
5239 && id_expr_token
->error_reported
)
5241 cp_parser_simulate_error (parser
);
5242 return error_mark_node
;
5245 decl
= cp_parser_lookup_name (parser
, id_expression
,
5248 /*is_namespace=*/false,
5249 /*check_dependency=*/true,
5251 id_expr_token
->location
);
5252 /* If the lookup was ambiguous, an error will already have
5254 if (ambiguous_decls
)
5255 return error_mark_node
;
5257 /* In Objective-C++, we may have an Objective-C 2.0
5258 dot-syntax for classes here. */
5259 if (c_dialect_objc ()
5260 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
5261 && TREE_CODE (decl
) == TYPE_DECL
5262 && objc_is_class_name (decl
))
5265 cp_lexer_consume_token (parser
->lexer
);
5266 component
= cp_parser_identifier (parser
);
5267 if (component
== error_mark_node
)
5268 return error_mark_node
;
5270 tree result
= objc_build_class_component_ref (id_expression
,
5272 /* Build a location of the form:
5275 with caret at the start of the component name (at
5276 input_location), ranging from the start of the id_expression
5277 to the end of the component name. */
5278 location_t combined_loc
5279 = make_location (input_location
, id_expression
.get_start (),
5280 get_finish (input_location
));
5281 protected_set_expr_location (result
, combined_loc
);
5285 /* In Objective-C++, an instance variable (ivar) may be preferred
5286 to whatever cp_parser_lookup_name() found.
5287 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5288 rest of c-family, we have to do a little extra work to preserve
5289 any location information in cp_expr "decl". Given that
5290 objc_lookup_ivar is implemented in "c-family" and "objc", we
5291 have a trip through the pure "tree" type, rather than cp_expr.
5292 Naively copying it back to "decl" would implicitly give the
5293 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5294 store an EXPR_LOCATION. Hence we only update "decl" (and
5295 hence its location_t) if we get back a different tree node. */
5296 tree decl_tree
= objc_lookup_ivar (decl
.get_value (),
5298 if (decl_tree
!= decl
.get_value ())
5299 decl
= cp_expr (decl_tree
);
5301 /* If name lookup gives us a SCOPE_REF, then the
5302 qualifying scope was dependent. */
5303 if (TREE_CODE (decl
) == SCOPE_REF
)
5305 /* At this point, we do not know if DECL is a valid
5306 integral constant expression. We assume that it is
5307 in fact such an expression, so that code like:
5309 template <int N> struct A {
5313 is accepted. At template-instantiation time, we
5314 will check that B<N>::i is actually a constant. */
5317 /* Check to see if DECL is a local variable in a context
5318 where that is forbidden. */
5319 if (parser
->local_variables_forbidden_p
5320 && local_variable_p (decl
))
5322 /* It might be that we only found DECL because we are
5323 trying to be generous with pre-ISO scoping rules.
5324 For example, consider:
5328 for (int i = 0; i < 10; ++i) {}
5329 extern void f(int j = i);
5332 Here, name look up will originally find the out
5333 of scope `i'. We need to issue a warning message,
5334 but then use the global `i'. */
5335 decl
= check_for_out_of_scope_variable (decl
);
5336 if (local_variable_p (decl
))
5338 error_at (id_expr_token
->location
,
5339 "local variable %qD may not appear in this context",
5341 return error_mark_node
;
5346 decl
= (finish_id_expression
5347 (id_expression
, decl
, parser
->scope
,
5349 parser
->integral_constant_expression_p
,
5350 parser
->allow_non_integral_constant_expression_p
,
5351 &parser
->non_integral_constant_expression_p
,
5352 template_p
, done
, address_p
,
5355 id_expression
.get_location ()));
5357 cp_parser_error (parser
, error_msg
);
5358 decl
.set_location (id_expr_token
->location
);
5362 /* Anything else is an error. */
5364 cp_parser_error (parser
, "expected primary-expression");
5365 return error_mark_node
;
5369 static inline cp_expr
5370 cp_parser_primary_expression (cp_parser
*parser
,
5373 bool template_arg_p
,
5376 return cp_parser_primary_expression (parser
, address_p
, cast_p
, template_arg_p
,
5377 /*decltype*/false, idk
);
5380 /* Parse an id-expression.
5387 :: [opt] nested-name-specifier template [opt] unqualified-id
5389 :: operator-function-id
5392 Return a representation of the unqualified portion of the
5393 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5394 a `::' or nested-name-specifier.
5396 Often, if the id-expression was a qualified-id, the caller will
5397 want to make a SCOPE_REF to represent the qualified-id. This
5398 function does not do this in order to avoid wastefully creating
5399 SCOPE_REFs when they are not required.
5401 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5404 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5405 uninstantiated templates.
5407 If *TEMPLATE_P is non-NULL, it is set to true iff the
5408 `template' keyword is used to explicitly indicate that the entity
5409 named is a template.
5411 If DECLARATOR_P is true, the id-expression is appearing as part of
5412 a declarator, rather than as part of an expression. */
5415 cp_parser_id_expression (cp_parser
*parser
,
5416 bool template_keyword_p
,
5417 bool check_dependency_p
,
5422 bool global_scope_p
;
5423 bool nested_name_specifier_p
;
5425 /* Assume the `template' keyword was not used. */
5427 *template_p
= template_keyword_p
;
5429 /* Look for the optional `::' operator. */
5431 = (!template_keyword_p
5432 && (cp_parser_global_scope_opt (parser
,
5433 /*current_scope_valid_p=*/false)
5436 /* Look for the optional nested-name-specifier. */
5437 nested_name_specifier_p
5438 = (cp_parser_nested_name_specifier_opt (parser
,
5439 /*typename_keyword_p=*/false,
5446 /* If there is a nested-name-specifier, then we are looking at
5447 the first qualified-id production. */
5448 if (nested_name_specifier_p
)
5451 tree saved_object_scope
;
5452 tree saved_qualifying_scope
;
5453 cp_expr unqualified_id
;
5456 /* See if the next token is the `template' keyword. */
5458 template_p
= &is_template
;
5459 *template_p
= cp_parser_optional_template_keyword (parser
);
5460 /* Name lookup we do during the processing of the
5461 unqualified-id might obliterate SCOPE. */
5462 saved_scope
= parser
->scope
;
5463 saved_object_scope
= parser
->object_scope
;
5464 saved_qualifying_scope
= parser
->qualifying_scope
;
5465 /* Process the final unqualified-id. */
5466 unqualified_id
= cp_parser_unqualified_id (parser
, *template_p
,
5469 /*optional_p=*/false);
5470 /* Restore the SAVED_SCOPE for our caller. */
5471 parser
->scope
= saved_scope
;
5472 parser
->object_scope
= saved_object_scope
;
5473 parser
->qualifying_scope
= saved_qualifying_scope
;
5475 return unqualified_id
;
5477 /* Otherwise, if we are in global scope, then we are looking at one
5478 of the other qualified-id productions. */
5479 else if (global_scope_p
)
5484 /* Peek at the next token. */
5485 token
= cp_lexer_peek_token (parser
->lexer
);
5487 /* If it's an identifier, and the next token is not a "<", then
5488 we can avoid the template-id case. This is an optimization
5489 for this common case. */
5490 if (token
->type
== CPP_NAME
5491 && !cp_parser_nth_token_starts_template_argument_list_p
5493 return cp_parser_identifier (parser
);
5495 cp_parser_parse_tentatively (parser
);
5496 /* Try a template-id. */
5497 id
= cp_parser_template_id (parser
,
5498 /*template_keyword_p=*/false,
5499 /*check_dependency_p=*/true,
5502 /* If that worked, we're done. */
5503 if (cp_parser_parse_definitely (parser
))
5506 /* Peek at the next token. (Changes in the token buffer may
5507 have invalidated the pointer obtained above.) */
5508 token
= cp_lexer_peek_token (parser
->lexer
);
5510 switch (token
->type
)
5513 return cp_parser_identifier (parser
);
5516 if (token
->keyword
== RID_OPERATOR
)
5517 return cp_parser_operator_function_id (parser
);
5521 cp_parser_error (parser
, "expected id-expression");
5522 return error_mark_node
;
5526 return cp_parser_unqualified_id (parser
, template_keyword_p
,
5527 /*check_dependency_p=*/true,
5532 /* Parse an unqualified-id.
5536 operator-function-id
5537 conversion-function-id
5541 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5542 keyword, in a construct like `A::template ...'.
5544 Returns a representation of unqualified-id. For the `identifier'
5545 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5546 production a BIT_NOT_EXPR is returned; the operand of the
5547 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5548 other productions, see the documentation accompanying the
5549 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5550 names are looked up in uninstantiated templates. If DECLARATOR_P
5551 is true, the unqualified-id is appearing as part of a declarator,
5552 rather than as part of an expression. */
5555 cp_parser_unqualified_id (cp_parser
* parser
,
5556 bool template_keyword_p
,
5557 bool check_dependency_p
,
5563 /* Peek at the next token. */
5564 token
= cp_lexer_peek_token (parser
->lexer
);
5566 switch ((int) token
->type
)
5572 /* We don't know yet whether or not this will be a
5574 cp_parser_parse_tentatively (parser
);
5575 /* Try a template-id. */
5576 id
= cp_parser_template_id (parser
, template_keyword_p
,
5580 /* If it worked, we're done. */
5581 if (cp_parser_parse_definitely (parser
))
5583 /* Otherwise, it's an ordinary identifier. */
5584 return cp_parser_identifier (parser
);
5587 case CPP_TEMPLATE_ID
:
5588 return cp_parser_template_id (parser
, template_keyword_p
,
5596 tree qualifying_scope
;
5601 /* Consume the `~' token. */
5602 cp_lexer_consume_token (parser
->lexer
);
5603 /* Parse the class-name. The standard, as written, seems to
5606 template <typename T> struct S { ~S (); };
5607 template <typename T> S<T>::~S() {}
5609 is invalid, since `~' must be followed by a class-name, but
5610 `S<T>' is dependent, and so not known to be a class.
5611 That's not right; we need to look in uninstantiated
5612 templates. A further complication arises from:
5614 template <typename T> void f(T t) {
5618 Here, it is not possible to look up `T' in the scope of `T'
5619 itself. We must look in both the current scope, and the
5620 scope of the containing complete expression.
5622 Yet another issue is:
5631 The standard does not seem to say that the `S' in `~S'
5632 should refer to the type `S' and not the data member
5635 /* DR 244 says that we look up the name after the "~" in the
5636 same scope as we looked up the qualifying name. That idea
5637 isn't fully worked out; it's more complicated than that. */
5638 scope
= parser
->scope
;
5639 object_scope
= parser
->object_scope
;
5640 qualifying_scope
= parser
->qualifying_scope
;
5642 /* Check for invalid scopes. */
5643 if (scope
== error_mark_node
)
5645 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
5646 cp_lexer_consume_token (parser
->lexer
);
5647 return error_mark_node
;
5649 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
5651 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
5652 error_at (token
->location
,
5653 "scope %qT before %<~%> is not a class-name",
5655 cp_parser_simulate_error (parser
);
5656 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
5657 cp_lexer_consume_token (parser
->lexer
);
5658 return error_mark_node
;
5660 gcc_assert (!scope
|| TYPE_P (scope
));
5662 /* If the name is of the form "X::~X" it's OK even if X is a
5664 token
= cp_lexer_peek_token (parser
->lexer
);
5666 && token
->type
== CPP_NAME
5667 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
5669 && (token
->u
.value
== TYPE_IDENTIFIER (scope
)
5670 || (CLASS_TYPE_P (scope
)
5671 && constructor_name_p (token
->u
.value
, scope
))))
5673 cp_lexer_consume_token (parser
->lexer
);
5674 return build_nt (BIT_NOT_EXPR
, scope
);
5677 /* ~auto means the destructor of whatever the object is. */
5678 if (cp_parser_is_keyword (token
, RID_AUTO
))
5680 if (cxx_dialect
< cxx14
)
5681 pedwarn (input_location
, 0,
5682 "%<~auto%> only available with "
5683 "-std=c++14 or -std=gnu++14");
5684 cp_lexer_consume_token (parser
->lexer
);
5685 return build_nt (BIT_NOT_EXPR
, make_auto ());
5688 /* If there was an explicit qualification (S::~T), first look
5689 in the scope given by the qualification (i.e., S).
5691 Note: in the calls to cp_parser_class_name below we pass
5692 typename_type so that lookup finds the injected-class-name
5693 rather than the constructor. */
5695 type_decl
= NULL_TREE
;
5698 cp_parser_parse_tentatively (parser
);
5699 type_decl
= cp_parser_class_name (parser
,
5700 /*typename_keyword_p=*/false,
5701 /*template_keyword_p=*/false,
5703 /*check_dependency=*/false,
5704 /*class_head_p=*/false,
5706 if (cp_parser_parse_definitely (parser
))
5709 /* In "N::S::~S", look in "N" as well. */
5710 if (!done
&& scope
&& qualifying_scope
)
5712 cp_parser_parse_tentatively (parser
);
5713 parser
->scope
= qualifying_scope
;
5714 parser
->object_scope
= NULL_TREE
;
5715 parser
->qualifying_scope
= NULL_TREE
;
5717 = cp_parser_class_name (parser
,
5718 /*typename_keyword_p=*/false,
5719 /*template_keyword_p=*/false,
5721 /*check_dependency=*/false,
5722 /*class_head_p=*/false,
5724 if (cp_parser_parse_definitely (parser
))
5727 /* In "p->S::~T", look in the scope given by "*p" as well. */
5728 else if (!done
&& object_scope
)
5730 cp_parser_parse_tentatively (parser
);
5731 parser
->scope
= object_scope
;
5732 parser
->object_scope
= NULL_TREE
;
5733 parser
->qualifying_scope
= NULL_TREE
;
5735 = cp_parser_class_name (parser
,
5736 /*typename_keyword_p=*/false,
5737 /*template_keyword_p=*/false,
5739 /*check_dependency=*/false,
5740 /*class_head_p=*/false,
5742 if (cp_parser_parse_definitely (parser
))
5745 /* Look in the surrounding context. */
5748 parser
->scope
= NULL_TREE
;
5749 parser
->object_scope
= NULL_TREE
;
5750 parser
->qualifying_scope
= NULL_TREE
;
5751 if (processing_template_decl
)
5752 cp_parser_parse_tentatively (parser
);
5754 = cp_parser_class_name (parser
,
5755 /*typename_keyword_p=*/false,
5756 /*template_keyword_p=*/false,
5758 /*check_dependency=*/false,
5759 /*class_head_p=*/false,
5761 if (processing_template_decl
5762 && ! cp_parser_parse_definitely (parser
))
5764 /* We couldn't find a type with this name. If we're parsing
5765 tentatively, fail and try something else. */
5766 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
5768 cp_parser_simulate_error (parser
);
5769 return error_mark_node
;
5771 /* Otherwise, accept it and check for a match at instantiation
5773 type_decl
= cp_parser_identifier (parser
);
5774 if (type_decl
!= error_mark_node
)
5775 type_decl
= build_nt (BIT_NOT_EXPR
, type_decl
);
5779 /* If an error occurred, assume that the name of the
5780 destructor is the same as the name of the qualifying
5781 class. That allows us to keep parsing after running
5782 into ill-formed destructor names. */
5783 if (type_decl
== error_mark_node
&& scope
)
5784 return build_nt (BIT_NOT_EXPR
, scope
);
5785 else if (type_decl
== error_mark_node
)
5786 return error_mark_node
;
5788 /* Check that destructor name and scope match. */
5789 if (declarator_p
&& scope
&& !check_dtor_name (scope
, type_decl
))
5791 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
5792 error_at (token
->location
,
5793 "declaration of %<~%T%> as member of %qT",
5795 cp_parser_simulate_error (parser
);
5796 return error_mark_node
;
5801 A typedef-name that names a class shall not be used as the
5802 identifier in the declarator for a destructor declaration. */
5804 && !DECL_IMPLICIT_TYPEDEF_P (type_decl
)
5805 && !DECL_SELF_REFERENCE_P (type_decl
)
5806 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
5807 error_at (token
->location
,
5808 "typedef-name %qD used as destructor declarator",
5811 return build_nt (BIT_NOT_EXPR
, TREE_TYPE (type_decl
));
5815 if (token
->keyword
== RID_OPERATOR
)
5819 /* This could be a template-id, so we try that first. */
5820 cp_parser_parse_tentatively (parser
);
5821 /* Try a template-id. */
5822 id
= cp_parser_template_id (parser
, template_keyword_p
,
5823 /*check_dependency_p=*/true,
5826 /* If that worked, we're done. */
5827 if (cp_parser_parse_definitely (parser
))
5829 /* We still don't know whether we're looking at an
5830 operator-function-id or a conversion-function-id. */
5831 cp_parser_parse_tentatively (parser
);
5832 /* Try an operator-function-id. */
5833 id
= cp_parser_operator_function_id (parser
);
5834 /* If that didn't work, try a conversion-function-id. */
5835 if (!cp_parser_parse_definitely (parser
))
5836 id
= cp_parser_conversion_function_id (parser
);
5837 else if (UDLIT_OPER_P (id
))
5840 const char *name
= UDLIT_OP_SUFFIX (id
);
5841 if (name
[0] != '_' && !in_system_header_at (input_location
)
5843 warning (OPT_Wliteral_suffix
,
5844 "literal operator suffixes not preceded by %<_%>"
5845 " are reserved for future standardization");
5855 cp_parser_error (parser
, "expected unqualified-id");
5856 return error_mark_node
;
5860 /* Parse an (optional) nested-name-specifier.
5862 nested-name-specifier: [C++98]
5863 class-or-namespace-name :: nested-name-specifier [opt]
5864 class-or-namespace-name :: template nested-name-specifier [opt]
5866 nested-name-specifier: [C++0x]
5869 nested-name-specifier identifier ::
5870 nested-name-specifier template [opt] simple-template-id ::
5872 PARSER->SCOPE should be set appropriately before this function is
5873 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5874 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5877 Sets PARSER->SCOPE to the class (TYPE) or namespace
5878 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5879 it unchanged if there is no nested-name-specifier. Returns the new
5880 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5882 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5883 part of a declaration and/or decl-specifier. */
5886 cp_parser_nested_name_specifier_opt (cp_parser
*parser
,
5887 bool typename_keyword_p
,
5888 bool check_dependency_p
,
5890 bool is_declaration
,
5891 bool template_keyword_p
/* = false */)
5893 bool success
= false;
5894 cp_token_position start
= 0;
5897 /* Remember where the nested-name-specifier starts. */
5898 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
5900 start
= cp_lexer_token_position (parser
->lexer
, false);
5901 push_deferring_access_checks (dk_deferred
);
5908 tree saved_qualifying_scope
;
5910 /* Spot cases that cannot be the beginning of a
5911 nested-name-specifier. */
5912 token
= cp_lexer_peek_token (parser
->lexer
);
5914 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5915 the already parsed nested-name-specifier. */
5916 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
5918 /* Grab the nested-name-specifier and continue the loop. */
5919 cp_parser_pre_parsed_nested_name_specifier (parser
);
5920 /* If we originally encountered this nested-name-specifier
5921 with IS_DECLARATION set to false, we will not have
5922 resolved TYPENAME_TYPEs, so we must do so here. */
5924 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
5926 new_scope
= resolve_typename_type (parser
->scope
,
5927 /*only_current_p=*/false);
5928 if (TREE_CODE (new_scope
) != TYPENAME_TYPE
)
5929 parser
->scope
= new_scope
;
5935 /* Spot cases that cannot be the beginning of a
5936 nested-name-specifier. On the second and subsequent times
5937 through the loop, we look for the `template' keyword. */
5938 if (success
&& token
->keyword
== RID_TEMPLATE
)
5940 /* A template-id can start a nested-name-specifier. */
5941 else if (token
->type
== CPP_TEMPLATE_ID
)
5943 /* DR 743: decltype can be used in a nested-name-specifier. */
5944 else if (token_is_decltype (token
))
5948 /* If the next token is not an identifier, then it is
5949 definitely not a type-name or namespace-name. */
5950 if (token
->type
!= CPP_NAME
)
5952 /* If the following token is neither a `<' (to begin a
5953 template-id), nor a `::', then we are not looking at a
5954 nested-name-specifier. */
5955 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
5957 if (token
->type
== CPP_COLON
5958 && parser
->colon_corrects_to_scope_p
5959 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_NAME
)
5961 gcc_rich_location
richloc (token
->location
);
5962 richloc
.add_fixit_replace ("::");
5963 error_at_rich_loc (&richloc
,
5964 "found %<:%> in nested-name-specifier, "
5966 token
->type
= CPP_SCOPE
;
5969 if (token
->type
!= CPP_SCOPE
5970 && !cp_parser_nth_token_starts_template_argument_list_p
5975 /* The nested-name-specifier is optional, so we parse
5977 cp_parser_parse_tentatively (parser
);
5979 /* Look for the optional `template' keyword, if this isn't the
5980 first time through the loop. */
5982 template_keyword_p
= cp_parser_optional_template_keyword (parser
);
5984 /* Save the old scope since the name lookup we are about to do
5985 might destroy it. */
5986 old_scope
= parser
->scope
;
5987 saved_qualifying_scope
= parser
->qualifying_scope
;
5988 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5989 look up names in "X<T>::I" in order to determine that "Y" is
5990 a template. So, if we have a typename at this point, we make
5991 an effort to look through it. */
5993 && !typename_keyword_p
5995 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
5996 parser
->scope
= resolve_typename_type (parser
->scope
,
5997 /*only_current_p=*/false);
5998 /* Parse the qualifying entity. */
6000 = cp_parser_qualifying_entity (parser
,
6006 /* Look for the `::' token. */
6007 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
6009 /* If we found what we wanted, we keep going; otherwise, we're
6011 if (!cp_parser_parse_definitely (parser
))
6013 bool error_p
= false;
6015 /* Restore the OLD_SCOPE since it was valid before the
6016 failed attempt at finding the last
6017 class-or-namespace-name. */
6018 parser
->scope
= old_scope
;
6019 parser
->qualifying_scope
= saved_qualifying_scope
;
6021 /* If the next token is a decltype, and the one after that is a
6022 `::', then the decltype has failed to resolve to a class or
6023 enumeration type. Give this error even when parsing
6024 tentatively since it can't possibly be valid--and we're going
6025 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6026 won't get another chance.*/
6027 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DECLTYPE
)
6028 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
6031 token
= cp_lexer_consume_token (parser
->lexer
);
6032 error_at (token
->location
, "decltype evaluates to %qT, "
6033 "which is not a class or enumeration type",
6034 token
->u
.tree_check_value
->value
);
6035 parser
->scope
= error_mark_node
;
6039 cp_lexer_consume_token (parser
->lexer
);
6042 if (cp_lexer_next_token_is (parser
->lexer
, CPP_TEMPLATE_ID
)
6043 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_SCOPE
))
6045 /* If we have a non-type template-id followed by ::, it can't
6046 possibly be valid. */
6047 token
= cp_lexer_peek_token (parser
->lexer
);
6048 tree tid
= token
->u
.tree_check_value
->value
;
6049 if (TREE_CODE (tid
) == TEMPLATE_ID_EXPR
6050 && TREE_CODE (TREE_OPERAND (tid
, 0)) != IDENTIFIER_NODE
)
6052 tree tmpl
= NULL_TREE
;
6053 if (is_overloaded_fn (tid
))
6055 tree fns
= get_fns (tid
);
6056 if (OVL_SINGLE_P (fns
))
6057 tmpl
= OVL_FIRST (fns
);
6058 error_at (token
->location
, "function template-id %qD "
6059 "in nested-name-specifier", tid
);
6063 /* Variable template. */
6064 tmpl
= TREE_OPERAND (tid
, 0);
6065 gcc_assert (variable_template_p (tmpl
));
6066 error_at (token
->location
, "variable template-id %qD "
6067 "in nested-name-specifier", tid
);
6070 inform (DECL_SOURCE_LOCATION (tmpl
),
6071 "%qD declared here", tmpl
);
6073 parser
->scope
= error_mark_node
;
6077 cp_lexer_consume_token (parser
->lexer
);
6078 cp_lexer_consume_token (parser
->lexer
);
6082 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
6084 /* If the next token is an identifier, and the one after
6085 that is a `::', then any valid interpretation would have
6086 found a class-or-namespace-name. */
6087 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
6088 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
6090 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
6093 token
= cp_lexer_consume_token (parser
->lexer
);
6096 if (!token
->error_reported
)
6099 tree ambiguous_decls
;
6101 decl
= cp_parser_lookup_name (parser
, token
->u
.value
,
6103 /*is_template=*/false,
6104 /*is_namespace=*/false,
6105 /*check_dependency=*/true,
6108 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
6109 error_at (token
->location
,
6110 "%qD used without template parameters",
6112 else if (ambiguous_decls
)
6114 // cp_parser_lookup_name has the same diagnostic,
6115 // thus make sure to emit it at most once.
6116 if (cp_parser_uncommitted_to_tentative_parse_p
6119 error_at (token
->location
,
6120 "reference to %qD is ambiguous",
6122 print_candidates (ambiguous_decls
);
6124 decl
= error_mark_node
;
6128 if (cxx_dialect
!= cxx98
)
6129 cp_parser_name_lookup_error
6130 (parser
, token
->u
.value
, decl
, NLE_NOT_CXX98
,
6133 cp_parser_name_lookup_error
6134 (parser
, token
->u
.value
, decl
, NLE_CXX98
,
6138 parser
->scope
= error_mark_node
;
6140 /* Treat this as a successful nested-name-specifier
6145 If the name found is not a class-name (clause
6146 _class_) or namespace-name (_namespace.def_), the
6147 program is ill-formed. */
6150 cp_lexer_consume_token (parser
->lexer
);
6154 /* We've found one valid nested-name-specifier. */
6156 /* Name lookup always gives us a DECL. */
6157 if (TREE_CODE (new_scope
) == TYPE_DECL
)
6158 new_scope
= TREE_TYPE (new_scope
);
6159 /* Uses of "template" must be followed by actual templates. */
6160 if (template_keyword_p
6161 && !(CLASS_TYPE_P (new_scope
)
6162 && ((CLASSTYPE_USE_TEMPLATE (new_scope
)
6163 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope
)))
6164 || CLASSTYPE_IS_TEMPLATE (new_scope
)))
6165 && !(TREE_CODE (new_scope
) == TYPENAME_TYPE
6166 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope
))
6167 == TEMPLATE_ID_EXPR
)))
6168 permerror (input_location
, TYPE_P (new_scope
)
6169 ? G_("%qT is not a template")
6170 : G_("%qD is not a template"),
6172 /* If it is a class scope, try to complete it; we are about to
6173 be looking up names inside the class. */
6174 if (TYPE_P (new_scope
)
6175 /* Since checking types for dependency can be expensive,
6176 avoid doing it if the type is already complete. */
6177 && !COMPLETE_TYPE_P (new_scope
)
6178 /* Do not try to complete dependent types. */
6179 && !dependent_type_p (new_scope
))
6181 new_scope
= complete_type (new_scope
);
6182 /* If it is a typedef to current class, use the current
6183 class instead, as the typedef won't have any names inside
6185 if (!COMPLETE_TYPE_P (new_scope
)
6186 && currently_open_class (new_scope
))
6187 new_scope
= TYPE_MAIN_VARIANT (new_scope
);
6189 /* Make sure we look in the right scope the next time through
6191 parser
->scope
= new_scope
;
6194 /* If parsing tentatively, replace the sequence of tokens that makes
6195 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6196 token. That way, should we re-parse the token stream, we will
6197 not have to repeat the effort required to do the parse, nor will
6198 we issue duplicate error messages. */
6199 if (success
&& start
)
6203 token
= cp_lexer_token_at (parser
->lexer
, start
);
6204 /* Reset the contents of the START token. */
6205 token
->type
= CPP_NESTED_NAME_SPECIFIER
;
6206 /* Retrieve any deferred checks. Do not pop this access checks yet
6207 so the memory will not be reclaimed during token replacing below. */
6208 token
->u
.tree_check_value
= ggc_cleared_alloc
<struct tree_check
> ();
6209 token
->u
.tree_check_value
->value
= parser
->scope
;
6210 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
6211 token
->u
.tree_check_value
->qualifying_scope
=
6212 parser
->qualifying_scope
;
6213 token
->keyword
= RID_MAX
;
6215 /* Purge all subsequent tokens. */
6216 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
6220 pop_to_parent_deferring_access_checks ();
6222 return success
? parser
->scope
: NULL_TREE
;
6225 /* Parse a nested-name-specifier. See
6226 cp_parser_nested_name_specifier_opt for details. This function
6227 behaves identically, except that it will an issue an error if no
6228 nested-name-specifier is present. */
6231 cp_parser_nested_name_specifier (cp_parser
*parser
,
6232 bool typename_keyword_p
,
6233 bool check_dependency_p
,
6235 bool is_declaration
)
6239 /* Look for the nested-name-specifier. */
6240 scope
= cp_parser_nested_name_specifier_opt (parser
,
6245 /* If it was not present, issue an error message. */
6248 cp_parser_error (parser
, "expected nested-name-specifier");
6249 parser
->scope
= NULL_TREE
;
6255 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6256 this is either a class-name or a namespace-name (which corresponds
6257 to the class-or-namespace-name production in the grammar). For
6258 C++0x, it can also be a type-name that refers to an enumeration
6259 type or a simple-template-id.
6261 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6262 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6263 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6264 TYPE_P is TRUE iff the next name should be taken as a class-name,
6265 even the same name is declared to be another entity in the same
6268 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6269 specified by the class-or-namespace-name. If neither is found the
6270 ERROR_MARK_NODE is returned. */
6273 cp_parser_qualifying_entity (cp_parser
*parser
,
6274 bool typename_keyword_p
,
6275 bool template_keyword_p
,
6276 bool check_dependency_p
,
6278 bool is_declaration
)
6281 tree saved_qualifying_scope
;
6282 tree saved_object_scope
;
6285 bool successful_parse_p
;
6287 /* DR 743: decltype can appear in a nested-name-specifier. */
6288 if (cp_lexer_next_token_is_decltype (parser
->lexer
))
6290 scope
= cp_parser_decltype (parser
);
6291 if (TREE_CODE (scope
) != ENUMERAL_TYPE
6292 && !MAYBE_CLASS_TYPE_P (scope
))
6294 cp_parser_simulate_error (parser
);
6295 return error_mark_node
;
6297 if (TYPE_NAME (scope
))
6298 scope
= TYPE_NAME (scope
);
6302 /* Before we try to parse the class-name, we must save away the
6303 current PARSER->SCOPE since cp_parser_class_name will destroy
6305 saved_scope
= parser
->scope
;
6306 saved_qualifying_scope
= parser
->qualifying_scope
;
6307 saved_object_scope
= parser
->object_scope
;
6308 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6309 there is no need to look for a namespace-name. */
6310 only_class_p
= template_keyword_p
6311 || (saved_scope
&& TYPE_P (saved_scope
) && cxx_dialect
== cxx98
);
6313 cp_parser_parse_tentatively (parser
);
6314 scope
= cp_parser_class_name (parser
,
6317 type_p
? class_type
: none_type
,
6319 /*class_head_p=*/false,
6321 /*enum_ok=*/cxx_dialect
> cxx98
);
6322 successful_parse_p
= only_class_p
|| cp_parser_parse_definitely (parser
);
6323 /* If that didn't work, try for a namespace-name. */
6324 if (!only_class_p
&& !successful_parse_p
)
6326 /* Restore the saved scope. */
6327 parser
->scope
= saved_scope
;
6328 parser
->qualifying_scope
= saved_qualifying_scope
;
6329 parser
->object_scope
= saved_object_scope
;
6330 /* If we are not looking at an identifier followed by the scope
6331 resolution operator, then this is not part of a
6332 nested-name-specifier. (Note that this function is only used
6333 to parse the components of a nested-name-specifier.) */
6334 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
)
6335 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
6336 return error_mark_node
;
6337 scope
= cp_parser_namespace_name (parser
);
6343 /* Return true if we are looking at a compound-literal, false otherwise. */
6346 cp_parser_compound_literal_p (cp_parser
*parser
)
6348 /* Consume the `('. */
6349 cp_lexer_consume_token (parser
->lexer
);
6351 cp_lexer_save_tokens (parser
->lexer
);
6353 /* Skip tokens until the next token is a closing parenthesis.
6354 If we find the closing `)', and the next token is a `{', then
6355 we are looking at a compound-literal. */
6356 bool compound_literal_p
6357 = (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
6358 /*consume_paren=*/true)
6359 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
));
6361 /* Roll back the tokens we skipped. */
6362 cp_lexer_rollback_tokens (parser
->lexer
);
6364 return compound_literal_p
;
6367 /* Parse a postfix-expression.
6371 postfix-expression [ expression ]
6372 postfix-expression ( expression-list [opt] )
6373 simple-type-specifier ( expression-list [opt] )
6374 typename :: [opt] nested-name-specifier identifier
6375 ( expression-list [opt] )
6376 typename :: [opt] nested-name-specifier template [opt] template-id
6377 ( expression-list [opt] )
6378 postfix-expression . template [opt] id-expression
6379 postfix-expression -> template [opt] id-expression
6380 postfix-expression . pseudo-destructor-name
6381 postfix-expression -> pseudo-destructor-name
6382 postfix-expression ++
6383 postfix-expression --
6384 dynamic_cast < type-id > ( expression )
6385 static_cast < type-id > ( expression )
6386 reinterpret_cast < type-id > ( expression )
6387 const_cast < type-id > ( expression )
6388 typeid ( expression )
6394 ( type-id ) { initializer-list , [opt] }
6396 This extension is a GNU version of the C99 compound-literal
6397 construct. (The C99 grammar uses `type-name' instead of `type-id',
6398 but they are essentially the same concept.)
6400 If ADDRESS_P is true, the postfix expression is the operand of the
6401 `&' operator. CAST_P is true if this expression is the target of a
6404 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6405 class member access expressions [expr.ref].
6407 Returns a representation of the expression. */
6410 cp_parser_postfix_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
6411 bool member_access_only_p
, bool decltype_p
,
6412 cp_id_kind
* pidk_return
)
6417 cp_id_kind idk
= CP_ID_KIND_NONE
;
6418 cp_expr postfix_expression
= NULL_TREE
;
6419 bool is_member_access
= false;
6420 int saved_in_statement
= -1;
6422 /* Peek at the next token. */
6423 token
= cp_lexer_peek_token (parser
->lexer
);
6424 loc
= token
->location
;
6425 location_t start_loc
= get_range_from_loc (line_table
, loc
).m_start
;
6427 /* Some of the productions are determined by keywords. */
6428 keyword
= token
->keyword
;
6438 const char *saved_message
;
6439 bool saved_in_type_id_in_expr_p
;
6441 /* All of these can be handled in the same way from the point
6442 of view of parsing. Begin by consuming the token
6443 identifying the cast. */
6444 cp_lexer_consume_token (parser
->lexer
);
6446 /* New types cannot be defined in the cast. */
6447 saved_message
= parser
->type_definition_forbidden_message
;
6448 parser
->type_definition_forbidden_message
6449 = G_("types may not be defined in casts");
6451 /* Look for the opening `<'. */
6452 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
6453 /* Parse the type to which we are casting. */
6454 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6455 parser
->in_type_id_in_expr_p
= true;
6456 type
= cp_parser_type_id (parser
);
6457 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6458 /* Look for the closing `>'. */
6459 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
6460 /* Restore the old message. */
6461 parser
->type_definition_forbidden_message
= saved_message
;
6463 bool saved_greater_than_is_operator_p
6464 = parser
->greater_than_is_operator_p
;
6465 parser
->greater_than_is_operator_p
= true;
6467 /* And the expression which is being cast. */
6468 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
6469 expression
= cp_parser_expression (parser
, & idk
, /*cast_p=*/true);
6470 cp_token
*close_paren
= cp_parser_require (parser
, CPP_CLOSE_PAREN
,
6472 location_t end_loc
= close_paren
?
6473 close_paren
->location
: UNKNOWN_LOCATION
;
6475 parser
->greater_than_is_operator_p
6476 = saved_greater_than_is_operator_p
;
6478 /* Only type conversions to integral or enumeration types
6479 can be used in constant-expressions. */
6480 if (!cast_valid_in_integral_constant_expression_p (type
)
6481 && cp_parser_non_integral_constant_expression (parser
, NIC_CAST
))
6483 postfix_expression
= error_mark_node
;
6491 = build_dynamic_cast (type
, expression
, tf_warning_or_error
);
6495 = build_static_cast (type
, expression
, tf_warning_or_error
);
6499 = build_reinterpret_cast (type
, expression
,
6500 tf_warning_or_error
);
6504 = build_const_cast (type
, expression
, tf_warning_or_error
);
6510 /* Construct a location e.g. :
6511 reinterpret_cast <int *> (expr)
6512 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6513 ranging from the start of the "*_cast" token to the final closing
6514 paren, with the caret at the start. */
6515 location_t cp_cast_loc
= make_location (start_loc
, start_loc
, end_loc
);
6516 postfix_expression
.set_location (cp_cast_loc
);
6523 const char *saved_message
;
6524 bool saved_in_type_id_in_expr_p
;
6526 /* Consume the `typeid' token. */
6527 cp_lexer_consume_token (parser
->lexer
);
6528 /* Look for the `(' token. */
6529 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
6530 /* Types cannot be defined in a `typeid' expression. */
6531 saved_message
= parser
->type_definition_forbidden_message
;
6532 parser
->type_definition_forbidden_message
6533 = G_("types may not be defined in a %<typeid%> expression");
6534 /* We can't be sure yet whether we're looking at a type-id or an
6536 cp_parser_parse_tentatively (parser
);
6537 /* Try a type-id first. */
6538 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6539 parser
->in_type_id_in_expr_p
= true;
6540 type
= cp_parser_type_id (parser
);
6541 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6542 /* Look for the `)' token. Otherwise, we can't be sure that
6543 we're not looking at an expression: consider `typeid (int
6544 (3))', for example. */
6545 cp_token
*close_paren
= cp_parser_require (parser
, CPP_CLOSE_PAREN
,
6547 /* If all went well, simply lookup the type-id. */
6548 if (cp_parser_parse_definitely (parser
))
6549 postfix_expression
= get_typeid (type
, tf_warning_or_error
);
6550 /* Otherwise, fall back to the expression variant. */
6555 /* Look for an expression. */
6556 expression
= cp_parser_expression (parser
, & idk
);
6557 /* Compute its typeid. */
6558 postfix_expression
= build_typeid (expression
, tf_warning_or_error
);
6559 /* Look for the `)' token. */
6561 = cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6563 /* Restore the saved message. */
6564 parser
->type_definition_forbidden_message
= saved_message
;
6565 /* `typeid' may not appear in an integral constant expression. */
6566 if (cp_parser_non_integral_constant_expression (parser
, NIC_TYPEID
))
6567 postfix_expression
= error_mark_node
;
6569 /* Construct a location e.g. :
6572 ranging from the start of the "typeid" token to the final closing
6573 paren, with the caret at the start. */
6576 location_t typeid_loc
6577 = make_location (start_loc
, start_loc
, close_paren
->location
);
6578 postfix_expression
.set_location (typeid_loc
);
6586 /* The syntax permitted here is the same permitted for an
6587 elaborated-type-specifier. */
6588 ++parser
->prevent_constrained_type_specifiers
;
6589 type
= cp_parser_elaborated_type_specifier (parser
,
6590 /*is_friend=*/false,
6591 /*is_declaration=*/false);
6592 --parser
->prevent_constrained_type_specifiers
;
6593 postfix_expression
= cp_parser_functional_cast (parser
, type
);
6597 case RID_CILK_SPAWN
:
6599 location_t cilk_spawn_loc
6600 = cp_lexer_peek_token (parser
->lexer
)->location
;
6601 cp_lexer_consume_token (parser
->lexer
);
6602 token
= cp_lexer_peek_token (parser
->lexer
);
6603 if (token
->type
== CPP_SEMICOLON
)
6605 error_at (token
->location
, "%<_Cilk_spawn%> must be followed by "
6607 postfix_expression
= error_mark_node
;
6610 else if (!current_function_decl
)
6612 error_at (token
->location
, "%<_Cilk_spawn%> may only be used "
6613 "inside a function");
6614 postfix_expression
= error_mark_node
;
6619 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6620 saved_in_statement
= parser
->in_statement
;
6621 parser
->in_statement
|= IN_CILK_SPAWN
;
6623 cfun
->calls_cilk_spawn
= 1;
6624 postfix_expression
=
6625 cp_parser_postfix_expression (parser
, false, false,
6626 false, false, &idk
);
6629 error_at (token
->location
, "-fcilkplus must be enabled to use"
6630 " %<_Cilk_spawn%>");
6631 cfun
->calls_cilk_spawn
= 0;
6633 else if (saved_in_statement
& IN_CILK_SPAWN
)
6635 error_at (token
->location
, "consecutive %<_Cilk_spawn%> keywords "
6636 "are not permitted");
6637 postfix_expression
= error_mark_node
;
6638 cfun
->calls_cilk_spawn
= 0;
6642 location_t loc
= postfix_expression
.get_location ();
6643 postfix_expression
= build_cilk_spawn (token
->location
,
6644 postfix_expression
);
6645 /* Build a location of the form:
6648 with caret at the expr, ranging from the start of the
6649 _Cilk_spawn token to the end of the expression. */
6650 location_t combined_loc
=
6651 make_location (loc
, cilk_spawn_loc
, get_finish (loc
));
6652 postfix_expression
.set_location (combined_loc
);
6653 if (postfix_expression
!= error_mark_node
)
6654 SET_EXPR_LOCATION (postfix_expression
, input_location
);
6655 parser
->in_statement
= parser
->in_statement
& ~IN_CILK_SPAWN
;
6661 case RID_BUILTIN_SHUFFLE
:
6662 case RID_BUILTIN_LAUNDER
:
6664 vec
<tree
, va_gc
> *vec
;
6668 cp_lexer_consume_token (parser
->lexer
);
6669 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
6670 /*cast_p=*/false, /*allow_expansion_p=*/true,
6671 /*non_constant_p=*/NULL
);
6674 postfix_expression
= error_mark_node
;
6678 FOR_EACH_VEC_ELT (*vec
, i
, p
)
6684 if (vec
->length () == 1)
6686 = cp_build_addressof (loc
, (*vec
)[0], tf_warning_or_error
);
6689 error_at (loc
, "wrong number of arguments to "
6690 "%<__builtin_addressof%>");
6691 postfix_expression
= error_mark_node
;
6695 case RID_BUILTIN_LAUNDER
:
6696 if (vec
->length () == 1)
6697 postfix_expression
= finish_builtin_launder (loc
, (*vec
)[0],
6698 tf_warning_or_error
);
6701 error_at (loc
, "wrong number of arguments to "
6702 "%<__builtin_launder%>");
6703 postfix_expression
= error_mark_node
;
6707 case RID_BUILTIN_SHUFFLE
:
6708 if (vec
->length () == 2)
6710 = build_x_vec_perm_expr (loc
, (*vec
)[0], NULL_TREE
,
6711 (*vec
)[1], tf_warning_or_error
);
6712 else if (vec
->length () == 3)
6714 = build_x_vec_perm_expr (loc
, (*vec
)[0], (*vec
)[1],
6715 (*vec
)[2], tf_warning_or_error
);
6718 error_at (loc
, "wrong number of arguments to "
6719 "%<__builtin_shuffle%>");
6720 postfix_expression
= error_mark_node
;
6734 /* If the next thing is a simple-type-specifier, we may be
6735 looking at a functional cast. We could also be looking at
6736 an id-expression. So, we try the functional cast, and if
6737 that doesn't work we fall back to the primary-expression. */
6738 cp_parser_parse_tentatively (parser
);
6739 /* Look for the simple-type-specifier. */
6740 ++parser
->prevent_constrained_type_specifiers
;
6741 type
= cp_parser_simple_type_specifier (parser
,
6742 /*decl_specs=*/NULL
,
6743 CP_PARSER_FLAGS_NONE
);
6744 --parser
->prevent_constrained_type_specifiers
;
6745 /* Parse the cast itself. */
6746 if (!cp_parser_error_occurred (parser
))
6748 = cp_parser_functional_cast (parser
, type
);
6749 /* If that worked, we're done. */
6750 if (cp_parser_parse_definitely (parser
))
6753 /* If the functional-cast didn't work out, try a
6754 compound-literal. */
6755 if (cp_parser_allow_gnu_extensions_p (parser
)
6756 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
6758 cp_expr initializer
= NULL_TREE
;
6760 cp_parser_parse_tentatively (parser
);
6762 /* Avoid calling cp_parser_type_id pointlessly, see comment
6763 in cp_parser_cast_expression about c++/29234. */
6764 if (!cp_parser_compound_literal_p (parser
))
6765 cp_parser_simulate_error (parser
);
6768 /* Parse the type. */
6769 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6770 parser
->in_type_id_in_expr_p
= true;
6771 type
= cp_parser_type_id (parser
);
6772 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6773 /* Look for the `)'. */
6774 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6777 /* If things aren't going well, there's no need to
6779 if (!cp_parser_error_occurred (parser
))
6781 bool non_constant_p
;
6782 /* Parse the brace-enclosed initializer list. */
6783 initializer
= cp_parser_braced_list (parser
,
6786 /* If that worked, we're definitely looking at a
6787 compound-literal expression. */
6788 if (cp_parser_parse_definitely (parser
))
6790 /* Warn the user that a compound literal is not
6791 allowed in standard C++. */
6792 pedwarn (input_location
, OPT_Wpedantic
,
6793 "ISO C++ forbids compound-literals");
6794 /* For simplicity, we disallow compound literals in
6795 constant-expressions. We could
6796 allow compound literals of integer type, whose
6797 initializer was a constant, in constant
6798 expressions. Permitting that usage, as a further
6799 extension, would not change the meaning of any
6800 currently accepted programs. (Of course, as
6801 compound literals are not part of ISO C++, the
6802 standard has nothing to say.) */
6803 if (cp_parser_non_integral_constant_expression (parser
,
6806 postfix_expression
= error_mark_node
;
6809 /* Form the representation of the compound-literal. */
6811 = finish_compound_literal (type
, initializer
,
6812 tf_warning_or_error
, fcl_c99
);
6813 postfix_expression
.set_location (initializer
.get_location ());
6818 /* It must be a primary-expression. */
6820 = cp_parser_primary_expression (parser
, address_p
, cast_p
,
6821 /*template_arg_p=*/false,
6828 /* Note that we don't need to worry about calling build_cplus_new on a
6829 class-valued CALL_EXPR in decltype when it isn't the end of the
6830 postfix-expression; unary_complex_lvalue will take care of that for
6833 /* Keep looping until the postfix-expression is complete. */
6836 if (idk
== CP_ID_KIND_UNQUALIFIED
6837 && identifier_p (postfix_expression
)
6838 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
6839 /* It is not a Koenig lookup function call. */
6841 = unqualified_name_lookup_error (postfix_expression
);
6843 /* Peek at the next token. */
6844 token
= cp_lexer_peek_token (parser
->lexer
);
6846 switch (token
->type
)
6848 case CPP_OPEN_SQUARE
:
6849 if (cp_next_tokens_can_be_std_attribute_p (parser
))
6851 cp_parser_error (parser
,
6852 "two consecutive %<[%> shall "
6853 "only introduce an attribute");
6854 return error_mark_node
;
6857 = cp_parser_postfix_open_square_expression (parser
,
6861 postfix_expression
.set_range (start_loc
,
6862 postfix_expression
.get_location ());
6864 idk
= CP_ID_KIND_NONE
;
6865 is_member_access
= false;
6868 case CPP_OPEN_PAREN
:
6869 /* postfix-expression ( expression-list [opt] ) */
6872 bool is_builtin_constant_p
;
6873 bool saved_integral_constant_expression_p
= false;
6874 bool saved_non_integral_constant_expression_p
= false;
6875 tsubst_flags_t complain
= complain_flags (decltype_p
);
6876 vec
<tree
, va_gc
> *args
;
6877 location_t close_paren_loc
= UNKNOWN_LOCATION
;
6879 is_member_access
= false;
6881 is_builtin_constant_p
6882 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression
);
6883 if (is_builtin_constant_p
)
6885 /* The whole point of __builtin_constant_p is to allow
6886 non-constant expressions to appear as arguments. */
6887 saved_integral_constant_expression_p
6888 = parser
->integral_constant_expression_p
;
6889 saved_non_integral_constant_expression_p
6890 = parser
->non_integral_constant_expression_p
;
6891 parser
->integral_constant_expression_p
= false;
6893 args
= (cp_parser_parenthesized_expression_list
6895 /*cast_p=*/false, /*allow_expansion_p=*/true,
6896 /*non_constant_p=*/NULL
,
6897 /*close_paren_loc=*/&close_paren_loc
));
6898 if (is_builtin_constant_p
)
6900 parser
->integral_constant_expression_p
6901 = saved_integral_constant_expression_p
;
6902 parser
->non_integral_constant_expression_p
6903 = saved_non_integral_constant_expression_p
;
6908 postfix_expression
= error_mark_node
;
6912 /* Function calls are not permitted in
6913 constant-expressions. */
6914 if (! builtin_valid_in_constant_expr_p (postfix_expression
)
6915 && cp_parser_non_integral_constant_expression (parser
,
6918 postfix_expression
= error_mark_node
;
6919 release_tree_vector (args
);
6924 if (idk
== CP_ID_KIND_UNQUALIFIED
6925 || idk
== CP_ID_KIND_TEMPLATE_ID
)
6927 if (identifier_p (postfix_expression
))
6929 if (!args
->is_empty ())
6932 if (!any_type_dependent_arguments_p (args
))
6934 = perform_koenig_lookup (postfix_expression
, args
,
6939 = unqualified_fn_lookup_error (postfix_expression
);
6941 /* We do not perform argument-dependent lookup if
6942 normal lookup finds a non-function, in accordance
6943 with the expected resolution of DR 218. */
6944 else if (!args
->is_empty ()
6945 && is_overloaded_fn (postfix_expression
))
6947 tree fn
= get_first_fn (postfix_expression
);
6948 fn
= STRIP_TEMPLATE (fn
);
6950 /* Do not do argument dependent lookup if regular
6951 lookup finds a member function or a block-scope
6952 function declaration. [basic.lookup.argdep]/3 */
6953 if (!DECL_FUNCTION_MEMBER_P (fn
)
6954 && !DECL_LOCAL_FUNCTION_P (fn
))
6957 if (!any_type_dependent_arguments_p (args
))
6959 = perform_koenig_lookup (postfix_expression
, args
,
6965 if (TREE_CODE (postfix_expression
) == FUNCTION_DECL
6966 && DECL_BUILT_IN_CLASS (postfix_expression
) == BUILT_IN_NORMAL
6967 && DECL_FUNCTION_CODE (postfix_expression
) == BUILT_IN_MEMSET
6968 && vec_safe_length (args
) == 3)
6970 tree arg0
= (*args
)[0];
6971 tree arg1
= (*args
)[1];
6972 tree arg2
= (*args
)[2];
6973 int literal_mask
= ((!!integer_zerop (arg1
) << 1)
6974 | (!!integer_zerop (arg2
) << 2));
6975 if (TREE_CODE (arg2
) == CONST_DECL
)
6976 arg2
= DECL_INITIAL (arg2
);
6977 warn_for_memset (input_location
, arg0
, arg2
, literal_mask
);
6980 if (TREE_CODE (postfix_expression
) == COMPONENT_REF
)
6982 tree instance
= TREE_OPERAND (postfix_expression
, 0);
6983 tree fn
= TREE_OPERAND (postfix_expression
, 1);
6985 if (processing_template_decl
6986 && (type_dependent_object_expression_p (instance
)
6987 || (!BASELINK_P (fn
)
6988 && TREE_CODE (fn
) != FIELD_DECL
)
6989 || type_dependent_expression_p (fn
)
6990 || any_type_dependent_arguments_p (args
)))
6992 maybe_generic_this_capture (instance
, fn
);
6994 = build_min_nt_call_vec (postfix_expression
, args
);
6995 release_tree_vector (args
);
6999 if (BASELINK_P (fn
))
7002 = (build_new_method_call
7003 (instance
, fn
, &args
, NULL_TREE
,
7004 (idk
== CP_ID_KIND_QUALIFIED
7005 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
7012 = finish_call_expr (postfix_expression
, &args
,
7013 /*disallow_virtual=*/false,
7017 else if (TREE_CODE (postfix_expression
) == OFFSET_REF
7018 || TREE_CODE (postfix_expression
) == MEMBER_REF
7019 || TREE_CODE (postfix_expression
) == DOTSTAR_EXPR
)
7020 postfix_expression
= (build_offset_ref_call_from_tree
7021 (postfix_expression
, &args
,
7023 else if (idk
== CP_ID_KIND_QUALIFIED
)
7024 /* A call to a static class member, or a namespace-scope
7027 = finish_call_expr (postfix_expression
, &args
,
7028 /*disallow_virtual=*/true,
7032 /* All other function calls. */
7034 = finish_call_expr (postfix_expression
, &args
,
7035 /*disallow_virtual=*/false,
7039 if (close_paren_loc
!= UNKNOWN_LOCATION
)
7041 location_t combined_loc
= make_location (token
->location
,
7044 postfix_expression
.set_location (combined_loc
);
7047 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7048 idk
= CP_ID_KIND_NONE
;
7050 release_tree_vector (args
);
7056 /* postfix-expression . template [opt] id-expression
7057 postfix-expression . pseudo-destructor-name
7058 postfix-expression -> template [opt] id-expression
7059 postfix-expression -> pseudo-destructor-name */
7061 /* Consume the `.' or `->' operator. */
7062 cp_lexer_consume_token (parser
->lexer
);
7065 = cp_parser_postfix_dot_deref_expression (parser
, token
->type
,
7069 is_member_access
= true;
7073 /* postfix-expression ++ */
7074 /* Consume the `++' token. */
7075 cp_lexer_consume_token (parser
->lexer
);
7076 /* Generate a representation for the complete expression. */
7078 = finish_increment_expr (postfix_expression
,
7079 POSTINCREMENT_EXPR
);
7080 /* Increments may not appear in constant-expressions. */
7081 if (cp_parser_non_integral_constant_expression (parser
, NIC_INC
))
7082 postfix_expression
= error_mark_node
;
7083 idk
= CP_ID_KIND_NONE
;
7084 is_member_access
= false;
7087 case CPP_MINUS_MINUS
:
7088 /* postfix-expression -- */
7089 /* Consume the `--' token. */
7090 cp_lexer_consume_token (parser
->lexer
);
7091 /* Generate a representation for the complete expression. */
7093 = finish_increment_expr (postfix_expression
,
7094 POSTDECREMENT_EXPR
);
7095 /* Decrements may not appear in constant-expressions. */
7096 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEC
))
7097 postfix_expression
= error_mark_node
;
7098 idk
= CP_ID_KIND_NONE
;
7099 is_member_access
= false;
7103 if (pidk_return
!= NULL
)
7104 * pidk_return
= idk
;
7105 if (member_access_only_p
)
7106 return is_member_access
7107 ? postfix_expression
7108 : cp_expr (error_mark_node
);
7110 return postfix_expression
;
7114 /* We should never get here. */
7116 return error_mark_node
;
7119 /* This function parses Cilk Plus array notations. If a normal array expr. is
7120 parsed then the array index is passed back to the caller through *INIT_INDEX
7121 and the function returns a NULL_TREE. If array notation expr. is parsed,
7122 then *INIT_INDEX is ignored by the caller and the function returns
7123 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7127 cp_parser_array_notation (location_t loc
, cp_parser
*parser
, tree
*init_index
,
7130 cp_token
*token
= NULL
;
7131 tree length_index
, stride
= NULL_TREE
, value_tree
, array_type
;
7132 if (!array_value
|| array_value
== error_mark_node
)
7134 cp_parser_skip_to_end_of_statement (parser
);
7135 return error_mark_node
;
7138 array_type
= TREE_TYPE (array_value
);
7140 bool saved_colon_corrects
= parser
->colon_corrects_to_scope_p
;
7141 parser
->colon_corrects_to_scope_p
= false;
7142 token
= cp_lexer_peek_token (parser
->lexer
);
7146 cp_parser_error (parser
, "expected %<:%> or numeral");
7147 return error_mark_node
;
7149 else if (token
->type
== CPP_COLON
)
7151 /* Consume the ':'. */
7152 cp_lexer_consume_token (parser
->lexer
);
7154 /* If we are here, then we have a case like this A[:]. */
7155 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_CLOSE_SQUARE
)
7157 cp_parser_error (parser
, "expected %<]%>");
7158 cp_parser_skip_to_end_of_statement (parser
);
7159 return error_mark_node
;
7161 *init_index
= NULL_TREE
;
7163 length_index
= NULL_TREE
;
7167 /* If we are here, then there are three valid possibilities:
7169 2. ARRAY [ EXP : EXP ]
7170 3. ARRAY [ EXP : EXP : EXP ] */
7172 *init_index
= cp_parser_expression (parser
);
7173 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
7175 /* This indicates that we have a normal array expression. */
7176 parser
->colon_corrects_to_scope_p
= saved_colon_corrects
;
7180 /* Consume the ':'. */
7181 cp_lexer_consume_token (parser
->lexer
);
7182 length_index
= cp_parser_expression (parser
);
7183 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_COLON
)
7185 cp_lexer_consume_token (parser
->lexer
);
7186 stride
= cp_parser_expression (parser
);
7189 parser
->colon_corrects_to_scope_p
= saved_colon_corrects
;
7191 if (*init_index
== error_mark_node
|| length_index
== error_mark_node
7192 || stride
== error_mark_node
|| array_type
== error_mark_node
)
7194 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_SQUARE
)
7195 cp_lexer_consume_token (parser
->lexer
);
7196 return error_mark_node
;
7198 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
7200 value_tree
= build_array_notation_ref (loc
, array_value
, *init_index
,
7201 length_index
, stride
, array_type
);
7205 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7206 by cp_parser_builtin_offsetof. We're looking for
7208 postfix-expression [ expression ]
7209 postfix-expression [ braced-init-list ] (C++11)
7211 FOR_OFFSETOF is set if we're being called in that context, which
7212 changes how we deal with integer constant expressions. */
7215 cp_parser_postfix_open_square_expression (cp_parser
*parser
,
7216 tree postfix_expression
,
7220 tree index
= NULL_TREE
;
7221 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
7222 bool saved_greater_than_is_operator_p
;
7224 /* Consume the `[' token. */
7225 cp_lexer_consume_token (parser
->lexer
);
7227 saved_greater_than_is_operator_p
= parser
->greater_than_is_operator_p
;
7228 parser
->greater_than_is_operator_p
= true;
7230 /* Parse the index expression. */
7231 /* ??? For offsetof, there is a question of what to allow here. If
7232 offsetof is not being used in an integral constant expression context,
7233 then we *could* get the right answer by computing the value at runtime.
7234 If we are in an integral constant expression context, then we might
7235 could accept any constant expression; hard to say without analysis.
7236 Rather than open the barn door too wide right away, allow only integer
7237 constant expressions here. */
7239 index
= cp_parser_constant_expression (parser
);
7242 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7244 bool expr_nonconst_p
;
7245 cp_lexer_set_source_position (parser
->lexer
);
7246 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
7247 index
= cp_parser_braced_list (parser
, &expr_nonconst_p
);
7249 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_COLON
)
7251 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
7252 "braced list index is not allowed with array "
7254 cp_parser_skip_to_end_of_statement (parser
);
7255 return error_mark_node
;
7258 else if (flag_cilkplus
)
7260 /* Here are have these two options:
7261 ARRAY[EXP : EXP] - Array notation expr with default
7263 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7265 tree an_exp
= cp_parser_array_notation (loc
, parser
, &index
,
7266 postfix_expression
);
7271 index
= cp_parser_expression (parser
);
7274 parser
->greater_than_is_operator_p
= saved_greater_than_is_operator_p
;
7276 /* Look for the closing `]'. */
7277 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
7279 /* Build the ARRAY_REF. */
7280 postfix_expression
= grok_array_decl (loc
, postfix_expression
,
7283 /* When not doing offsetof, array references are not permitted in
7284 constant-expressions. */
7286 && (cp_parser_non_integral_constant_expression (parser
, NIC_ARRAY_REF
)))
7287 postfix_expression
= error_mark_node
;
7289 return postfix_expression
;
7292 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7293 by cp_parser_builtin_offsetof. We're looking for
7295 postfix-expression . template [opt] id-expression
7296 postfix-expression . pseudo-destructor-name
7297 postfix-expression -> template [opt] id-expression
7298 postfix-expression -> pseudo-destructor-name
7300 FOR_OFFSETOF is set if we're being called in that context. That sorta
7301 limits what of the above we'll actually accept, but nevermind.
7302 TOKEN_TYPE is the "." or "->" token, which will already have been
7303 removed from the stream. */
7306 cp_parser_postfix_dot_deref_expression (cp_parser
*parser
,
7307 enum cpp_ttype token_type
,
7308 cp_expr postfix_expression
,
7309 bool for_offsetof
, cp_id_kind
*idk
,
7310 location_t location
)
7314 bool pseudo_destructor_p
;
7315 tree scope
= NULL_TREE
;
7316 location_t start_loc
= postfix_expression
.get_start ();
7318 /* If this is a `->' operator, dereference the pointer. */
7319 if (token_type
== CPP_DEREF
)
7320 postfix_expression
= build_x_arrow (location
, postfix_expression
,
7321 tf_warning_or_error
);
7322 /* Check to see whether or not the expression is type-dependent and
7323 not the current instantiation. */
7324 dependent_p
= type_dependent_object_expression_p (postfix_expression
);
7325 /* The identifier following the `->' or `.' is not qualified. */
7326 parser
->scope
= NULL_TREE
;
7327 parser
->qualifying_scope
= NULL_TREE
;
7328 parser
->object_scope
= NULL_TREE
;
7329 *idk
= CP_ID_KIND_NONE
;
7331 /* Enter the scope corresponding to the type of the object
7332 given by the POSTFIX_EXPRESSION. */
7335 scope
= TREE_TYPE (postfix_expression
);
7336 /* According to the standard, no expression should ever have
7337 reference type. Unfortunately, we do not currently match
7338 the standard in this respect in that our internal representation
7339 of an expression may have reference type even when the standard
7340 says it does not. Therefore, we have to manually obtain the
7341 underlying type here. */
7342 scope
= non_reference (scope
);
7343 /* The type of the POSTFIX_EXPRESSION must be complete. */
7344 /* Unlike the object expression in other contexts, *this is not
7345 required to be of complete type for purposes of class member
7346 access (5.2.5) outside the member function body. */
7347 if (postfix_expression
!= current_class_ref
7348 && scope
!= error_mark_node
7349 && !(processing_template_decl
7350 && current_class_type
7351 && (same_type_ignoring_top_level_qualifiers_p
7352 (scope
, current_class_type
))))
7354 scope
= complete_type (scope
);
7355 if (!COMPLETE_TYPE_P (scope
)
7356 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7357 && EXPR_P (postfix_expression
))
7359 /* In a template, be permissive by treating an object expression
7360 of incomplete type as dependent (after a pedwarn). */
7361 diagnostic_t kind
= (processing_template_decl
7364 cxx_incomplete_type_diagnostic
7365 (location_of (postfix_expression
),
7366 postfix_expression
, scope
, kind
);
7367 if (processing_template_decl
)
7370 scope
= TREE_TYPE (postfix_expression
) = NULL_TREE
;
7377 /* Let the name lookup machinery know that we are processing a
7378 class member access expression. */
7379 parser
->context
->object_type
= scope
;
7380 /* If something went wrong, we want to be able to discern that case,
7381 as opposed to the case where there was no SCOPE due to the type
7382 of expression being dependent. */
7384 scope
= error_mark_node
;
7385 /* If the SCOPE was erroneous, make the various semantic analysis
7386 functions exit quickly -- and without issuing additional error
7388 if (scope
== error_mark_node
)
7389 postfix_expression
= error_mark_node
;
7394 /* Tell cp_parser_lookup_name that there was an object, even though it's
7396 parser
->context
->object_type
= unknown_type_node
;
7398 /* Assume this expression is not a pseudo-destructor access. */
7399 pseudo_destructor_p
= false;
7401 /* If the SCOPE is a scalar type, then, if this is a valid program,
7402 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7403 is type dependent, it can be pseudo-destructor-name or something else.
7404 Try to parse it as pseudo-destructor-name first. */
7405 if ((scope
&& SCALAR_TYPE_P (scope
)) || dependent_p
)
7410 cp_parser_parse_tentatively (parser
);
7411 /* Parse the pseudo-destructor-name. */
7413 cp_parser_pseudo_destructor_name (parser
, postfix_expression
,
7416 && (cp_parser_error_occurred (parser
)
7417 || !SCALAR_TYPE_P (type
)))
7418 cp_parser_abort_tentative_parse (parser
);
7419 else if (cp_parser_parse_definitely (parser
))
7421 pseudo_destructor_p
= true;
7423 = finish_pseudo_destructor_expr (postfix_expression
,
7428 if (!pseudo_destructor_p
)
7430 /* If the SCOPE is not a scalar type, we are looking at an
7431 ordinary class member access expression, rather than a
7432 pseudo-destructor-name. */
7434 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
7435 /* Parse the id-expression. */
7436 name
= (cp_parser_id_expression
7438 cp_parser_optional_template_keyword (parser
),
7439 /*check_dependency_p=*/true,
7441 /*declarator_p=*/false,
7442 /*optional_p=*/false));
7443 /* In general, build a SCOPE_REF if the member name is qualified.
7444 However, if the name was not dependent and has already been
7445 resolved; there is no need to build the SCOPE_REF. For example;
7447 struct X { void f(); };
7448 template <typename T> void f(T* t) { t->X::f(); }
7450 Even though "t" is dependent, "X::f" is not and has been resolved
7451 to a BASELINK; there is no need to include scope information. */
7453 /* But we do need to remember that there was an explicit scope for
7454 virtual function calls. */
7456 *idk
= CP_ID_KIND_QUALIFIED
;
7458 /* If the name is a template-id that names a type, we will get a
7459 TYPE_DECL here. That is invalid code. */
7460 if (TREE_CODE (name
) == TYPE_DECL
)
7462 error_at (token
->location
, "invalid use of %qD", name
);
7463 postfix_expression
= error_mark_node
;
7467 if (name
!= error_mark_node
&& !BASELINK_P (name
) && parser
->scope
)
7469 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
7471 error_at (token
->location
, "%<%D::%D%> is not a class member",
7472 parser
->scope
, name
);
7473 postfix_expression
= error_mark_node
;
7476 name
= build_qualified_name (/*type=*/NULL_TREE
,
7480 parser
->scope
= NULL_TREE
;
7481 parser
->qualifying_scope
= NULL_TREE
;
7482 parser
->object_scope
= NULL_TREE
;
7484 if (parser
->scope
&& name
&& BASELINK_P (name
))
7485 adjust_result_of_qualified_name_lookup
7486 (name
, parser
->scope
, scope
);
7488 = finish_class_member_access_expr (postfix_expression
, name
,
7490 tf_warning_or_error
);
7491 /* Build a location e.g.:
7494 where the caret is at the deref token, ranging from
7495 the start of postfix_expression to the end of the access expr. */
7497 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
7498 location_t combined_loc
7499 = make_location (input_location
, start_loc
, end_loc
);
7500 protected_set_expr_location (postfix_expression
, combined_loc
);
7504 /* We no longer need to look up names in the scope of the object on
7505 the left-hand side of the `.' or `->' operator. */
7506 parser
->context
->object_type
= NULL_TREE
;
7508 /* Outside of offsetof, these operators may not appear in
7509 constant-expressions. */
7511 && (cp_parser_non_integral_constant_expression
7512 (parser
, token_type
== CPP_DEREF
? NIC_ARROW
: NIC_POINT
)))
7513 postfix_expression
= error_mark_node
;
7515 return postfix_expression
;
7518 /* Parse a parenthesized expression-list.
7521 assignment-expression
7522 expression-list, assignment-expression
7527 identifier, expression-list
7529 CAST_P is true if this expression is the target of a cast.
7531 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7534 Returns a vector of trees. Each element is a representation of an
7535 assignment-expression. NULL is returned if the ( and or ) are
7536 missing. An empty, but allocated, vector is returned on no
7537 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7538 if we are parsing an attribute list for an attribute that wants a
7539 plain identifier argument, normal_attr for an attribute that wants
7540 an expression, or non_attr if we aren't parsing an attribute list. If
7541 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7542 not all of the expressions in the list were constant.
7543 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7544 will be written to with the location of the closing parenthesis. If
7545 an error occurs, it may or may not be written to. */
7547 static vec
<tree
, va_gc
> *
7548 cp_parser_parenthesized_expression_list (cp_parser
* parser
,
7549 int is_attribute_list
,
7551 bool allow_expansion_p
,
7552 bool *non_constant_p
,
7553 location_t
*close_paren_loc
)
7555 vec
<tree
, va_gc
> *expression_list
;
7556 bool fold_expr_p
= is_attribute_list
!= non_attr
;
7557 tree identifier
= NULL_TREE
;
7558 bool saved_greater_than_is_operator_p
;
7560 /* Assume all the expressions will be constant. */
7562 *non_constant_p
= false;
7564 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
7567 expression_list
= make_tree_vector ();
7569 /* Within a parenthesized expression, a `>' token is always
7570 the greater-than operator. */
7571 saved_greater_than_is_operator_p
7572 = parser
->greater_than_is_operator_p
;
7573 parser
->greater_than_is_operator_p
= true;
7575 /* Consume expressions until there are no more. */
7576 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
7581 /* At the beginning of attribute lists, check to see if the
7582 next token is an identifier. */
7583 if (is_attribute_list
== id_attr
7584 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_NAME
)
7588 /* Consume the identifier. */
7589 token
= cp_lexer_consume_token (parser
->lexer
);
7590 /* Save the identifier. */
7591 identifier
= token
->u
.value
;
7595 bool expr_non_constant_p
;
7597 /* Parse the next assignment-expression. */
7598 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7600 /* A braced-init-list. */
7601 cp_lexer_set_source_position (parser
->lexer
);
7602 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
7603 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
7604 if (non_constant_p
&& expr_non_constant_p
)
7605 *non_constant_p
= true;
7607 else if (non_constant_p
)
7609 expr
= (cp_parser_constant_expression
7610 (parser
, /*allow_non_constant_p=*/true,
7611 &expr_non_constant_p
));
7612 if (expr_non_constant_p
)
7613 *non_constant_p
= true;
7616 expr
= cp_parser_assignment_expression (parser
, /*pidk=*/NULL
,
7620 expr
= instantiate_non_dependent_expr (expr
);
7622 /* If we have an ellipsis, then this is an expression
7624 if (allow_expansion_p
7625 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
7627 /* Consume the `...'. */
7628 cp_lexer_consume_token (parser
->lexer
);
7630 /* Build the argument pack. */
7631 expr
= make_pack_expansion (expr
);
7634 /* Add it to the list. We add error_mark_node
7635 expressions to the list, so that we can still tell if
7636 the correct form for a parenthesized expression-list
7637 is found. That gives better errors. */
7638 vec_safe_push (expression_list
, expr
);
7640 if (expr
== error_mark_node
)
7644 /* After the first item, attribute lists look the same as
7645 expression lists. */
7646 is_attribute_list
= non_attr
;
7649 /* If the next token isn't a `,', then we are done. */
7650 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
7653 /* Otherwise, consume the `,' and keep going. */
7654 cp_lexer_consume_token (parser
->lexer
);
7657 if (close_paren_loc
)
7658 *close_paren_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
7660 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
7665 /* We try and resync to an unnested comma, as that will give the
7666 user better diagnostics. */
7667 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
7668 /*recovering=*/true,
7670 /*consume_paren=*/true);
7675 parser
->greater_than_is_operator_p
7676 = saved_greater_than_is_operator_p
;
7681 parser
->greater_than_is_operator_p
7682 = saved_greater_than_is_operator_p
;
7685 vec_safe_insert (expression_list
, 0, identifier
);
7687 return expression_list
;
7690 /* Parse a pseudo-destructor-name.
7692 pseudo-destructor-name:
7693 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7694 :: [opt] nested-name-specifier template template-id :: ~ type-name
7695 :: [opt] nested-name-specifier [opt] ~ type-name
7697 If either of the first two productions is used, sets *SCOPE to the
7698 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7699 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7700 or ERROR_MARK_NODE if the parse fails. */
7703 cp_parser_pseudo_destructor_name (cp_parser
* parser
,
7708 bool nested_name_specifier_p
;
7711 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMPL
)
7712 && cp_lexer_nth_token_is_keyword (parser
->lexer
, 2, RID_AUTO
)
7713 && !type_dependent_expression_p (object
))
7715 if (cxx_dialect
< cxx14
)
7716 pedwarn (input_location
, 0,
7717 "%<~auto%> only available with "
7718 "-std=c++14 or -std=gnu++14");
7719 cp_lexer_consume_token (parser
->lexer
);
7720 cp_lexer_consume_token (parser
->lexer
);
7722 *type
= TREE_TYPE (object
);
7726 /* Assume that things will not work out. */
7727 *type
= error_mark_node
;
7729 /* Look for the optional `::' operator. */
7730 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
7731 /* Look for the optional nested-name-specifier. */
7732 nested_name_specifier_p
7733 = (cp_parser_nested_name_specifier_opt (parser
,
7734 /*typename_keyword_p=*/false,
7735 /*check_dependency_p=*/true,
7737 /*is_declaration=*/false)
7739 /* Now, if we saw a nested-name-specifier, we might be doing the
7740 second production. */
7741 if (nested_name_specifier_p
7742 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
7744 /* Consume the `template' keyword. */
7745 cp_lexer_consume_token (parser
->lexer
);
7746 /* Parse the template-id. */
7747 cp_parser_template_id (parser
,
7748 /*template_keyword_p=*/true,
7749 /*check_dependency_p=*/false,
7751 /*is_declaration=*/true);
7752 /* Look for the `::' token. */
7753 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
7755 /* If the next token is not a `~', then there might be some
7756 additional qualification. */
7757 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMPL
))
7759 /* At this point, we're looking for "type-name :: ~". The type-name
7760 must not be a class-name, since this is a pseudo-destructor. So,
7761 it must be either an enum-name, or a typedef-name -- both of which
7762 are just identifiers. So, we peek ahead to check that the "::"
7763 and "~" tokens are present; if they are not, then we can avoid
7764 calling type_name. */
7765 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_NAME
7766 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
7767 || cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_COMPL
)
7769 cp_parser_error (parser
, "non-scalar type");
7773 /* Look for the type-name. */
7774 *scope
= TREE_TYPE (cp_parser_nonclass_name (parser
));
7775 if (*scope
== error_mark_node
)
7778 /* Look for the `::' token. */
7779 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
7784 /* Look for the `~'. */
7785 cp_parser_require (parser
, CPP_COMPL
, RT_COMPL
);
7787 /* Once we see the ~, this has to be a pseudo-destructor. */
7788 if (!processing_template_decl
&& !cp_parser_error_occurred (parser
))
7789 cp_parser_commit_to_topmost_tentative_parse (parser
);
7791 /* Look for the type-name again. We are not responsible for
7792 checking that it matches the first type-name. */
7793 *type
= TREE_TYPE (cp_parser_nonclass_name (parser
));
7796 /* Parse a unary-expression.
7802 unary-operator cast-expression
7803 sizeof unary-expression
7805 alignof ( type-id ) [C++0x]
7812 __extension__ cast-expression
7813 __alignof__ unary-expression
7814 __alignof__ ( type-id )
7815 alignof unary-expression [C++0x]
7816 __real__ cast-expression
7817 __imag__ cast-expression
7819 sizeof ( type-id ) { initializer-list , [opt] }
7820 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7821 __alignof__ ( type-id ) { initializer-list , [opt] }
7823 ADDRESS_P is true iff the unary-expression is appearing as the
7824 operand of the `&' operator. CAST_P is true if this expression is
7825 the target of a cast.
7827 Returns a representation of the expression. */
7830 cp_parser_unary_expression (cp_parser
*parser
, cp_id_kind
* pidk
,
7831 bool address_p
, bool cast_p
, bool decltype_p
)
7834 enum tree_code unary_operator
;
7836 /* Peek at the next token. */
7837 token
= cp_lexer_peek_token (parser
->lexer
);
7838 /* Some keywords give away the kind of expression. */
7839 if (token
->type
== CPP_KEYWORD
)
7841 enum rid keyword
= token
->keyword
;
7850 location_t start_loc
= token
->location
;
7852 op
= keyword
== RID_ALIGNOF
? ALIGNOF_EXPR
: SIZEOF_EXPR
;
7853 /* Consume the token. */
7854 cp_lexer_consume_token (parser
->lexer
);
7855 /* Parse the operand. */
7856 operand
= cp_parser_sizeof_operand (parser
, keyword
);
7858 if (TYPE_P (operand
))
7859 ret
= cxx_sizeof_or_alignof_type (operand
, op
, true);
7862 /* ISO C++ defines alignof only with types, not with
7863 expressions. So pedwarn if alignof is used with a non-
7864 type expression. However, __alignof__ is ok. */
7865 if (id_equal (token
->u
.value
, "alignof"))
7866 pedwarn (token
->location
, OPT_Wpedantic
,
7867 "ISO C++ does not allow %<alignof%> "
7870 ret
= cxx_sizeof_or_alignof_expr (operand
, op
, true);
7872 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7873 SIZEOF_EXPR with the original operand. */
7874 if (op
== SIZEOF_EXPR
&& ret
!= error_mark_node
)
7876 if (TREE_CODE (ret
) != SIZEOF_EXPR
|| TYPE_P (operand
))
7878 if (!processing_template_decl
&& TYPE_P (operand
))
7880 ret
= build_min (SIZEOF_EXPR
, size_type_node
,
7881 build1 (NOP_EXPR
, operand
,
7883 SIZEOF_EXPR_TYPE_P (ret
) = 1;
7886 ret
= build_min (SIZEOF_EXPR
, size_type_node
, operand
);
7887 TREE_SIDE_EFFECTS (ret
) = 0;
7888 TREE_READONLY (ret
) = 1;
7892 /* Construct a location e.g. :
7895 with start == caret at the start of the "alignof"/"sizeof"
7896 token, with the endpoint at the final closing paren. */
7897 location_t finish_loc
7898 = cp_lexer_previous_token (parser
->lexer
)->location
;
7899 location_t compound_loc
7900 = make_location (start_loc
, start_loc
, finish_loc
);
7902 cp_expr
ret_expr (ret
);
7903 ret_expr
.set_location (compound_loc
);
7908 return cp_parser_new_expression (parser
);
7911 return cp_parser_delete_expression (parser
);
7915 /* The saved value of the PEDANTIC flag. */
7919 /* Save away the PEDANTIC flag. */
7920 cp_parser_extension_opt (parser
, &saved_pedantic
);
7921 /* Parse the cast-expression. */
7922 expr
= cp_parser_simple_cast_expression (parser
);
7923 /* Restore the PEDANTIC flag. */
7924 pedantic
= saved_pedantic
;
7934 /* Consume the `__real__' or `__imag__' token. */
7935 cp_lexer_consume_token (parser
->lexer
);
7936 /* Parse the cast-expression. */
7937 expression
= cp_parser_simple_cast_expression (parser
);
7938 /* Create the complete representation. */
7939 return build_x_unary_op (token
->location
,
7940 (keyword
== RID_REALPART
7941 ? REALPART_EXPR
: IMAGPART_EXPR
),
7943 tf_warning_or_error
);
7947 case RID_TRANSACTION_ATOMIC
:
7948 case RID_TRANSACTION_RELAXED
:
7949 return cp_parser_transaction_expression (parser
, keyword
);
7954 const char *saved_message
;
7955 bool saved_integral_constant_expression_p
;
7956 bool saved_non_integral_constant_expression_p
;
7957 bool saved_greater_than_is_operator_p
;
7959 cp_lexer_consume_token (parser
->lexer
);
7960 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
7962 saved_message
= parser
->type_definition_forbidden_message
;
7963 parser
->type_definition_forbidden_message
7964 = G_("types may not be defined in %<noexcept%> expressions");
7966 saved_integral_constant_expression_p
7967 = parser
->integral_constant_expression_p
;
7968 saved_non_integral_constant_expression_p
7969 = parser
->non_integral_constant_expression_p
;
7970 parser
->integral_constant_expression_p
= false;
7972 saved_greater_than_is_operator_p
7973 = parser
->greater_than_is_operator_p
;
7974 parser
->greater_than_is_operator_p
= true;
7976 ++cp_unevaluated_operand
;
7977 ++c_inhibit_evaluation_warnings
;
7978 ++cp_noexcept_operand
;
7979 expr
= cp_parser_expression (parser
);
7980 --cp_noexcept_operand
;
7981 --c_inhibit_evaluation_warnings
;
7982 --cp_unevaluated_operand
;
7984 parser
->greater_than_is_operator_p
7985 = saved_greater_than_is_operator_p
;
7987 parser
->integral_constant_expression_p
7988 = saved_integral_constant_expression_p
;
7989 parser
->non_integral_constant_expression_p
7990 = saved_non_integral_constant_expression_p
;
7992 parser
->type_definition_forbidden_message
= saved_message
;
7994 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7995 return finish_noexcept_expr (expr
, tf_warning_or_error
);
8003 /* Look for the `:: new' and `:: delete', which also signal the
8004 beginning of a new-expression, or delete-expression,
8005 respectively. If the next token is `::', then it might be one of
8007 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
8011 /* See if the token after the `::' is one of the keywords in
8012 which we're interested. */
8013 keyword
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->keyword
;
8014 /* If it's `new', we have a new-expression. */
8015 if (keyword
== RID_NEW
)
8016 return cp_parser_new_expression (parser
);
8017 /* Similarly, for `delete'. */
8018 else if (keyword
== RID_DELETE
)
8019 return cp_parser_delete_expression (parser
);
8022 /* Look for a unary operator. */
8023 unary_operator
= cp_parser_unary_operator (token
);
8024 /* The `++' and `--' operators can be handled similarly, even though
8025 they are not technically unary-operators in the grammar. */
8026 if (unary_operator
== ERROR_MARK
)
8028 if (token
->type
== CPP_PLUS_PLUS
)
8029 unary_operator
= PREINCREMENT_EXPR
;
8030 else if (token
->type
== CPP_MINUS_MINUS
)
8031 unary_operator
= PREDECREMENT_EXPR
;
8032 /* Handle the GNU address-of-label extension. */
8033 else if (cp_parser_allow_gnu_extensions_p (parser
)
8034 && token
->type
== CPP_AND_AND
)
8038 location_t start_loc
= token
->location
;
8040 /* Consume the '&&' token. */
8041 cp_lexer_consume_token (parser
->lexer
);
8042 /* Look for the identifier. */
8043 location_t finish_loc
8044 = get_finish (cp_lexer_peek_token (parser
->lexer
)->location
);
8045 identifier
= cp_parser_identifier (parser
);
8046 /* Construct a location of the form:
8049 with caret==start at the "&&", finish at the end of the label. */
8050 location_t combined_loc
8051 = make_location (start_loc
, start_loc
, finish_loc
);
8052 /* Create an expression representing the address. */
8053 expression
= finish_label_address_expr (identifier
, combined_loc
);
8054 if (cp_parser_non_integral_constant_expression (parser
,
8056 expression
= error_mark_node
;
8060 if (unary_operator
!= ERROR_MARK
)
8062 cp_expr cast_expression
;
8063 cp_expr expression
= error_mark_node
;
8064 non_integral_constant non_constant_p
= NIC_NONE
;
8065 location_t loc
= token
->location
;
8066 tsubst_flags_t complain
= complain_flags (decltype_p
);
8068 /* Consume the operator token. */
8069 token
= cp_lexer_consume_token (parser
->lexer
);
8070 enum cpp_ttype op_ttype
= cp_lexer_peek_token (parser
->lexer
)->type
;
8072 /* Parse the cast-expression. */
8074 = cp_parser_cast_expression (parser
,
8075 unary_operator
== ADDR_EXPR
,
8081 OP_TOKEN CAST_EXPRESSION
8082 ^~~~~~~~~~~~~~~~~~~~~~~~~
8083 with start==caret at the operator token, and
8084 extending to the end of the cast_expression. */
8085 loc
= make_location (loc
, loc
, cast_expression
.get_finish ());
8087 /* Now, build an appropriate representation. */
8088 switch (unary_operator
)
8091 non_constant_p
= NIC_STAR
;
8092 expression
= build_x_indirect_ref (loc
, cast_expression
,
8095 /* TODO: build_x_indirect_ref does not always honor the
8096 location, so ensure it is set. */
8097 expression
.set_location (loc
);
8101 non_constant_p
= NIC_ADDR
;
8104 expression
= build_x_unary_op (loc
, unary_operator
,
8107 /* TODO: build_x_unary_op does not always honor the location,
8108 so ensure it is set. */
8109 expression
.set_location (loc
);
8112 case PREINCREMENT_EXPR
:
8113 case PREDECREMENT_EXPR
:
8114 non_constant_p
= unary_operator
== PREINCREMENT_EXPR
8115 ? NIC_PREINCREMENT
: NIC_PREDECREMENT
;
8118 /* Immediately fold negation of a constant, unless the constant is 0
8119 (since -0 == 0) or it would overflow. */
8120 if (unary_operator
== NEGATE_EXPR
&& op_ttype
== CPP_NUMBER
8121 && CONSTANT_CLASS_P (cast_expression
)
8122 && !integer_zerop (cast_expression
)
8123 && !TREE_OVERFLOW (cast_expression
))
8125 tree folded
= fold_build1 (unary_operator
,
8126 TREE_TYPE (cast_expression
),
8128 if (CONSTANT_CLASS_P (folded
) && !TREE_OVERFLOW (folded
))
8130 expression
= cp_expr (folded
, loc
);
8135 case UNARY_PLUS_EXPR
:
8136 case TRUTH_NOT_EXPR
:
8137 expression
= finish_unary_op_expr (loc
, unary_operator
,
8138 cast_expression
, complain
);
8145 if (non_constant_p
!= NIC_NONE
8146 && cp_parser_non_integral_constant_expression (parser
,
8148 expression
= error_mark_node
;
8153 return cp_parser_postfix_expression (parser
, address_p
, cast_p
,
8154 /*member_access_only_p=*/false,
8159 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8160 unary-operator, the corresponding tree code is returned. */
8162 static enum tree_code
8163 cp_parser_unary_operator (cp_token
* token
)
8165 switch (token
->type
)
8168 return INDIRECT_REF
;
8174 return UNARY_PLUS_EXPR
;
8180 return TRUTH_NOT_EXPR
;
8183 return BIT_NOT_EXPR
;
8190 /* Parse a new-expression.
8193 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8194 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8196 Returns a representation of the expression. */
8199 cp_parser_new_expression (cp_parser
* parser
)
8201 bool global_scope_p
;
8202 vec
<tree
, va_gc
> *placement
;
8204 vec
<tree
, va_gc
> *initializer
;
8205 tree nelts
= NULL_TREE
;
8208 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
8210 /* Look for the optional `::' operator. */
8212 = (cp_parser_global_scope_opt (parser
,
8213 /*current_scope_valid_p=*/false)
8215 /* Look for the `new' operator. */
8216 cp_parser_require_keyword (parser
, RID_NEW
, RT_NEW
);
8217 /* There's no easy way to tell a new-placement from the
8218 `( type-id )' construct. */
8219 cp_parser_parse_tentatively (parser
);
8220 /* Look for a new-placement. */
8221 placement
= cp_parser_new_placement (parser
);
8222 /* If that didn't work out, there's no new-placement. */
8223 if (!cp_parser_parse_definitely (parser
))
8225 if (placement
!= NULL
)
8226 release_tree_vector (placement
);
8230 /* If the next token is a `(', then we have a parenthesized
8232 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
8235 const char *saved_message
= parser
->type_definition_forbidden_message
;
8237 /* Consume the `('. */
8238 cp_lexer_consume_token (parser
->lexer
);
8240 /* Parse the type-id. */
8241 parser
->type_definition_forbidden_message
8242 = G_("types may not be defined in a new-expression");
8244 type_id_in_expr_sentinel
s (parser
);
8245 type
= cp_parser_type_id (parser
);
8247 parser
->type_definition_forbidden_message
= saved_message
;
8249 /* Look for the closing `)'. */
8250 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
8251 token
= cp_lexer_peek_token (parser
->lexer
);
8252 /* There should not be a direct-new-declarator in this production,
8253 but GCC used to allowed this, so we check and emit a sensible error
8254 message for this case. */
8255 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
8257 error_at (token
->location
,
8258 "array bound forbidden after parenthesized type-id");
8259 inform (token
->location
,
8260 "try removing the parentheses around the type-id");
8261 cp_parser_direct_new_declarator (parser
);
8264 /* Otherwise, there must be a new-type-id. */
8266 type
= cp_parser_new_type_id (parser
, &nelts
);
8268 /* If the next token is a `(' or '{', then we have a new-initializer. */
8269 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8270 if (token
->type
== CPP_OPEN_PAREN
8271 || token
->type
== CPP_OPEN_BRACE
)
8272 initializer
= cp_parser_new_initializer (parser
);
8276 /* A new-expression may not appear in an integral constant
8278 if (cp_parser_non_integral_constant_expression (parser
, NIC_NEW
))
8279 ret
= error_mark_node
;
8280 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8281 of a new-type-id or type-id of a new-expression, the new-expression shall
8282 contain a new-initializer of the form ( assignment-expression )".
8283 Additionally, consistently with the spirit of DR 1467, we want to accept
8284 'new auto { 2 }' too. */
8285 else if ((ret
= type_uses_auto (type
))
8286 && !CLASS_PLACEHOLDER_TEMPLATE (ret
)
8287 && (vec_safe_length (initializer
) != 1
8288 || (BRACE_ENCLOSED_INITIALIZER_P ((*initializer
)[0])
8289 && CONSTRUCTOR_NELTS ((*initializer
)[0]) != 1)))
8291 error_at (token
->location
,
8292 "initialization of new-expression for type %<auto%> "
8293 "requires exactly one element");
8294 ret
= error_mark_node
;
8298 /* Construct a location e.g.:
8301 with caret == start at the start of the "new" token, and the end
8302 at the end of the final token we consumed. */
8303 cp_token
*end_tok
= cp_lexer_previous_token (parser
->lexer
);
8304 location_t end_loc
= get_finish (end_tok
->location
);
8305 location_t combined_loc
= make_location (start_loc
, start_loc
, end_loc
);
8307 /* Create a representation of the new-expression. */
8308 ret
= build_new (&placement
, type
, nelts
, &initializer
, global_scope_p
,
8309 tf_warning_or_error
);
8310 protected_set_expr_location (ret
, combined_loc
);
8313 if (placement
!= NULL
)
8314 release_tree_vector (placement
);
8315 if (initializer
!= NULL
)
8316 release_tree_vector (initializer
);
8321 /* Parse a new-placement.
8326 Returns the same representation as for an expression-list. */
8328 static vec
<tree
, va_gc
> *
8329 cp_parser_new_placement (cp_parser
* parser
)
8331 vec
<tree
, va_gc
> *expression_list
;
8333 /* Parse the expression-list. */
8334 expression_list
= (cp_parser_parenthesized_expression_list
8335 (parser
, non_attr
, /*cast_p=*/false,
8336 /*allow_expansion_p=*/true,
8337 /*non_constant_p=*/NULL
));
8339 if (expression_list
&& expression_list
->is_empty ())
8340 error ("expected expression-list or type-id");
8342 return expression_list
;
8345 /* Parse a new-type-id.
8348 type-specifier-seq new-declarator [opt]
8350 Returns the TYPE allocated. If the new-type-id indicates an array
8351 type, *NELTS is set to the number of elements in the last array
8352 bound; the TYPE will not include the last array bound. */
8355 cp_parser_new_type_id (cp_parser
* parser
, tree
*nelts
)
8357 cp_decl_specifier_seq type_specifier_seq
;
8358 cp_declarator
*new_declarator
;
8359 cp_declarator
*declarator
;
8360 cp_declarator
*outer_declarator
;
8361 const char *saved_message
;
8363 /* The type-specifier sequence must not contain type definitions.
8364 (It cannot contain declarations of new types either, but if they
8365 are not definitions we will catch that because they are not
8367 saved_message
= parser
->type_definition_forbidden_message
;
8368 parser
->type_definition_forbidden_message
8369 = G_("types may not be defined in a new-type-id");
8370 /* Parse the type-specifier-seq. */
8371 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
8372 /*is_trailing_return=*/false,
8373 &type_specifier_seq
);
8374 /* Restore the old message. */
8375 parser
->type_definition_forbidden_message
= saved_message
;
8377 if (type_specifier_seq
.type
== error_mark_node
)
8378 return error_mark_node
;
8380 /* Parse the new-declarator. */
8381 new_declarator
= cp_parser_new_declarator_opt (parser
);
8383 /* Determine the number of elements in the last array dimension, if
8386 /* Skip down to the last array dimension. */
8387 declarator
= new_declarator
;
8388 outer_declarator
= NULL
;
8389 while (declarator
&& (declarator
->kind
== cdk_pointer
8390 || declarator
->kind
== cdk_ptrmem
))
8392 outer_declarator
= declarator
;
8393 declarator
= declarator
->declarator
;
8396 && declarator
->kind
== cdk_array
8397 && declarator
->declarator
8398 && declarator
->declarator
->kind
== cdk_array
)
8400 outer_declarator
= declarator
;
8401 declarator
= declarator
->declarator
;
8404 if (declarator
&& declarator
->kind
== cdk_array
)
8406 *nelts
= declarator
->u
.array
.bounds
;
8407 if (*nelts
== error_mark_node
)
8408 *nelts
= integer_one_node
;
8410 if (outer_declarator
)
8411 outer_declarator
->declarator
= declarator
->declarator
;
8413 new_declarator
= NULL
;
8416 return groktypename (&type_specifier_seq
, new_declarator
, false);
8419 /* Parse an (optional) new-declarator.
8422 ptr-operator new-declarator [opt]
8423 direct-new-declarator
8425 Returns the declarator. */
8427 static cp_declarator
*
8428 cp_parser_new_declarator_opt (cp_parser
* parser
)
8430 enum tree_code code
;
8431 tree type
, std_attributes
= NULL_TREE
;
8432 cp_cv_quals cv_quals
;
8434 /* We don't know if there's a ptr-operator next, or not. */
8435 cp_parser_parse_tentatively (parser
);
8436 /* Look for a ptr-operator. */
8437 code
= cp_parser_ptr_operator (parser
, &type
, &cv_quals
, &std_attributes
);
8438 /* If that worked, look for more new-declarators. */
8439 if (cp_parser_parse_definitely (parser
))
8441 cp_declarator
*declarator
;
8443 /* Parse another optional declarator. */
8444 declarator
= cp_parser_new_declarator_opt (parser
);
8446 declarator
= cp_parser_make_indirect_declarator
8447 (code
, type
, cv_quals
, declarator
, std_attributes
);
8452 /* If the next token is a `[', there is a direct-new-declarator. */
8453 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
8454 return cp_parser_direct_new_declarator (parser
);
8459 /* Parse a direct-new-declarator.
8461 direct-new-declarator:
8463 direct-new-declarator [constant-expression]
8467 static cp_declarator
*
8468 cp_parser_direct_new_declarator (cp_parser
* parser
)
8470 cp_declarator
*declarator
= NULL
;
8477 /* Look for the opening `['. */
8478 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
8480 token
= cp_lexer_peek_token (parser
->lexer
);
8481 expression
= cp_parser_expression (parser
);
8482 /* The standard requires that the expression have integral
8483 type. DR 74 adds enumeration types. We believe that the
8484 real intent is that these expressions be handled like the
8485 expression in a `switch' condition, which also allows
8486 classes with a single conversion to integral or
8487 enumeration type. */
8488 if (!processing_template_decl
)
8491 = build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
8496 error_at (token
->location
,
8497 "expression in new-declarator must have integral "
8498 "or enumeration type");
8499 expression
= error_mark_node
;
8503 /* Look for the closing `]'. */
8504 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
8506 /* Add this bound to the declarator. */
8507 declarator
= make_array_declarator (declarator
, expression
);
8509 /* If the next token is not a `[', then there are no more
8511 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
8518 /* Parse a new-initializer.
8521 ( expression-list [opt] )
8524 Returns a representation of the expression-list. */
8526 static vec
<tree
, va_gc
> *
8527 cp_parser_new_initializer (cp_parser
* parser
)
8529 vec
<tree
, va_gc
> *expression_list
;
8531 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
8534 bool expr_non_constant_p
;
8535 cp_lexer_set_source_position (parser
->lexer
);
8536 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
8537 t
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
8538 CONSTRUCTOR_IS_DIRECT_INIT (t
) = 1;
8539 expression_list
= make_tree_vector_single (t
);
8542 expression_list
= (cp_parser_parenthesized_expression_list
8543 (parser
, non_attr
, /*cast_p=*/false,
8544 /*allow_expansion_p=*/true,
8545 /*non_constant_p=*/NULL
));
8547 return expression_list
;
8550 /* Parse a delete-expression.
8553 :: [opt] delete cast-expression
8554 :: [opt] delete [ ] cast-expression
8556 Returns a representation of the expression. */
8559 cp_parser_delete_expression (cp_parser
* parser
)
8561 bool global_scope_p
;
8565 /* Look for the optional `::' operator. */
8567 = (cp_parser_global_scope_opt (parser
,
8568 /*current_scope_valid_p=*/false)
8570 /* Look for the `delete' keyword. */
8571 cp_parser_require_keyword (parser
, RID_DELETE
, RT_DELETE
);
8572 /* See if the array syntax is in use. */
8573 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
8575 /* Consume the `[' token. */
8576 cp_lexer_consume_token (parser
->lexer
);
8577 /* Look for the `]' token. */
8578 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
8579 /* Remember that this is the `[]' construct. */
8585 /* Parse the cast-expression. */
8586 expression
= cp_parser_simple_cast_expression (parser
);
8588 /* A delete-expression may not appear in an integral constant
8590 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEL
))
8591 return error_mark_node
;
8593 return delete_sanity (expression
, NULL_TREE
, array_p
, global_scope_p
,
8594 tf_warning_or_error
);
8597 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8598 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8602 cp_parser_tokens_start_cast_expression (cp_parser
*parser
)
8604 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8605 switch (token
->type
)
8611 case CPP_CLOSE_SQUARE
:
8612 case CPP_CLOSE_PAREN
:
8613 case CPP_CLOSE_BRACE
:
8614 case CPP_OPEN_BRACE
:
8618 case CPP_DEREF_STAR
:
8626 case CPP_GREATER_EQ
:
8647 case CPP_OPEN_PAREN
:
8648 /* In ((type ()) () the last () isn't a valid cast-expression,
8649 so the whole must be parsed as postfix-expression. */
8650 return cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
8653 case CPP_OPEN_SQUARE
:
8654 /* '[' may start a primary-expression in obj-c++ and in C++11,
8655 as a lambda-expression, eg, '(void)[]{}'. */
8656 if (cxx_dialect
>= cxx11
)
8658 return c_dialect_objc ();
8661 case CPP_MINUS_MINUS
:
8662 /* '++' and '--' may or may not start a cast-expression:
8664 struct T { void operator++(int); };
8665 void f() { (T())++; }
8678 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8679 in the order: const_cast, static_cast, reinterpret_cast.
8681 Don't suggest dynamic_cast.
8683 Return the first legal cast kind found, or NULL otherwise. */
8686 get_cast_suggestion (tree dst_type
, tree orig_expr
)
8690 /* Reuse the parser logic by attempting to build the various kinds of
8691 cast, with "complain" disabled.
8692 Identify the first such cast that is valid. */
8694 /* Don't attempt to run such logic within template processing. */
8695 if (processing_template_decl
)
8698 /* First try const_cast. */
8699 trial
= build_const_cast (dst_type
, orig_expr
, tf_none
);
8700 if (trial
!= error_mark_node
)
8701 return "const_cast";
8703 /* If that fails, try static_cast. */
8704 trial
= build_static_cast (dst_type
, orig_expr
, tf_none
);
8705 if (trial
!= error_mark_node
)
8706 return "static_cast";
8708 /* Finally, try reinterpret_cast. */
8709 trial
= build_reinterpret_cast (dst_type
, orig_expr
, tf_none
);
8710 if (trial
!= error_mark_node
)
8711 return "reinterpret_cast";
8713 /* No such cast possible. */
8717 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8718 suggesting how to convert a C-style cast of the form:
8722 to a C++-style cast.
8724 The primary range of RICHLOC is asssumed to be that of the original
8725 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8726 of the parens in the C-style cast. */
8729 maybe_add_cast_fixit (rich_location
*rich_loc
, location_t open_paren_loc
,
8730 location_t close_paren_loc
, tree orig_expr
,
8733 /* This function is non-trivial, so bail out now if the warning isn't
8734 going to be emitted. */
8735 if (!warn_old_style_cast
)
8738 /* Try to find a legal C++ cast, trying them in order:
8739 const_cast, static_cast, reinterpret_cast. */
8740 const char *cast_suggestion
= get_cast_suggestion (dst_type
, orig_expr
);
8741 if (!cast_suggestion
)
8744 /* Replace the open paren with "CAST_SUGGESTION<". */
8746 pp_printf (&pp
, "%s<", cast_suggestion
);
8747 rich_loc
->add_fixit_replace (open_paren_loc
, pp_formatted_text (&pp
));
8749 /* Replace the close paren with "> (". */
8750 rich_loc
->add_fixit_replace (close_paren_loc
, "> (");
8752 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8753 rich_loc
->add_fixit_insert_after (")");
8757 /* Parse a cast-expression.
8761 ( type-id ) cast-expression
8763 ADDRESS_P is true iff the unary-expression is appearing as the
8764 operand of the `&' operator. CAST_P is true if this expression is
8765 the target of a cast.
8767 Returns a representation of the expression. */
8770 cp_parser_cast_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
8771 bool decltype_p
, cp_id_kind
* pidk
)
8773 /* If it's a `(', then we might be looking at a cast. */
8774 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
8776 tree type
= NULL_TREE
;
8777 cp_expr
expr (NULL_TREE
);
8778 int cast_expression
= 0;
8779 const char *saved_message
;
8781 /* There's no way to know yet whether or not this is a cast.
8782 For example, `(int (3))' is a unary-expression, while `(int)
8783 3' is a cast. So, we resort to parsing tentatively. */
8784 cp_parser_parse_tentatively (parser
);
8785 /* Types may not be defined in a cast. */
8786 saved_message
= parser
->type_definition_forbidden_message
;
8787 parser
->type_definition_forbidden_message
8788 = G_("types may not be defined in casts");
8789 /* Consume the `('. */
8790 cp_token
*open_paren
= cp_lexer_consume_token (parser
->lexer
);
8791 location_t open_paren_loc
= open_paren
->location
;
8792 location_t close_paren_loc
= UNKNOWN_LOCATION
;
8794 /* A very tricky bit is that `(struct S) { 3 }' is a
8795 compound-literal (which we permit in C++ as an extension).
8796 But, that construct is not a cast-expression -- it is a
8797 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8798 is legal; if the compound-literal were a cast-expression,
8799 you'd need an extra set of parentheses.) But, if we parse
8800 the type-id, and it happens to be a class-specifier, then we
8801 will commit to the parse at that point, because we cannot
8802 undo the action that is done when creating a new class. So,
8803 then we cannot back up and do a postfix-expression.
8805 Another tricky case is the following (c++/29234):
8807 struct S { void operator () (); };
8814 As a type-id we parse the parenthesized S()() as a function
8815 returning a function, groktypename complains and we cannot
8816 back up in this case either.
8818 Therefore, we scan ahead to the closing `)', and check to see
8819 if the tokens after the `)' can start a cast-expression. Otherwise
8820 we are dealing with an unary-expression, a postfix-expression
8823 Yet another tricky case, in C++11, is the following (c++/54891):
8827 The issue is that usually, besides the case of lambda-expressions,
8828 the parenthesized type-id cannot be followed by '[', and, eg, we
8829 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8830 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8831 we don't commit, we try a cast-expression, then an unary-expression.
8833 Save tokens so that we can put them back. */
8834 cp_lexer_save_tokens (parser
->lexer
);
8836 /* We may be looking at a cast-expression. */
8837 if (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
8838 /*consume_paren=*/true))
8840 = cp_parser_tokens_start_cast_expression (parser
);
8842 /* Roll back the tokens we skipped. */
8843 cp_lexer_rollback_tokens (parser
->lexer
);
8844 /* If we aren't looking at a cast-expression, simulate an error so
8845 that the call to cp_parser_error_occurred below returns true. */
8846 if (!cast_expression
)
8847 cp_parser_simulate_error (parser
);
8850 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
8851 parser
->in_type_id_in_expr_p
= true;
8852 /* Look for the type-id. */
8853 type
= cp_parser_type_id (parser
);
8854 /* Look for the closing `)'. */
8855 cp_token
*close_paren
8856 = cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
8858 close_paren_loc
= close_paren
->location
;
8859 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
8862 /* Restore the saved message. */
8863 parser
->type_definition_forbidden_message
= saved_message
;
8865 /* At this point this can only be either a cast or a
8866 parenthesized ctor such as `(T ())' that looks like a cast to
8867 function returning T. */
8868 if (!cp_parser_error_occurred (parser
))
8870 /* Only commit if the cast-expression doesn't start with
8871 '++', '--', or '[' in C++11. */
8872 if (cast_expression
> 0)
8873 cp_parser_commit_to_topmost_tentative_parse (parser
);
8875 expr
= cp_parser_cast_expression (parser
,
8876 /*address_p=*/false,
8878 /*decltype_p=*/false,
8881 if (cp_parser_parse_definitely (parser
))
8883 /* Warn about old-style casts, if so requested. */
8884 if (warn_old_style_cast
8885 && !in_system_header_at (input_location
)
8886 && !VOID_TYPE_P (type
)
8887 && current_lang_name
!= lang_name_c
)
8889 gcc_rich_location
rich_loc (input_location
);
8890 maybe_add_cast_fixit (&rich_loc
, open_paren_loc
, close_paren_loc
,
8892 warning_at_rich_loc (&rich_loc
, OPT_Wold_style_cast
,
8893 "use of old-style cast to %qT", type
);
8896 /* Only type conversions to integral or enumeration types
8897 can be used in constant-expressions. */
8898 if (!cast_valid_in_integral_constant_expression_p (type
)
8899 && cp_parser_non_integral_constant_expression (parser
,
8901 return error_mark_node
;
8903 /* Perform the cast. */
8907 with start==caret at the open paren, extending to the
8909 location_t cast_loc
= make_location (open_paren_loc
,
8911 expr
.get_finish ());
8912 expr
= build_c_cast (cast_loc
, type
, expr
);
8917 cp_parser_abort_tentative_parse (parser
);
8920 /* If we get here, then it's not a cast, so it must be a
8921 unary-expression. */
8922 return cp_parser_unary_expression (parser
, pidk
, address_p
,
8923 cast_p
, decltype_p
);
8926 /* Parse a binary expression of the general form:
8930 pm-expression .* cast-expression
8931 pm-expression ->* cast-expression
8933 multiplicative-expression:
8935 multiplicative-expression * pm-expression
8936 multiplicative-expression / pm-expression
8937 multiplicative-expression % pm-expression
8939 additive-expression:
8940 multiplicative-expression
8941 additive-expression + multiplicative-expression
8942 additive-expression - multiplicative-expression
8946 shift-expression << additive-expression
8947 shift-expression >> additive-expression
8949 relational-expression:
8951 relational-expression < shift-expression
8952 relational-expression > shift-expression
8953 relational-expression <= shift-expression
8954 relational-expression >= shift-expression
8958 relational-expression:
8959 relational-expression <? shift-expression
8960 relational-expression >? shift-expression
8962 equality-expression:
8963 relational-expression
8964 equality-expression == relational-expression
8965 equality-expression != relational-expression
8969 and-expression & equality-expression
8971 exclusive-or-expression:
8973 exclusive-or-expression ^ and-expression
8975 inclusive-or-expression:
8976 exclusive-or-expression
8977 inclusive-or-expression | exclusive-or-expression
8979 logical-and-expression:
8980 inclusive-or-expression
8981 logical-and-expression && inclusive-or-expression
8983 logical-or-expression:
8984 logical-and-expression
8985 logical-or-expression || logical-and-expression
8987 All these are implemented with a single function like:
8990 simple-cast-expression
8991 binary-expression <token> binary-expression
8993 CAST_P is true if this expression is the target of a cast.
8995 The binops_by_token map is used to get the tree codes for each <token> type.
8996 binary-expressions are associated according to a precedence table. */
8998 #define TOKEN_PRECEDENCE(token) \
8999 (((token->type == CPP_GREATER \
9000 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9001 && !parser->greater_than_is_operator_p) \
9002 ? PREC_NOT_OPERATOR \
9003 : binops_by_token[token->type].prec)
9006 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
,
9007 bool no_toplevel_fold_p
,
9009 enum cp_parser_prec prec
,
9012 cp_parser_expression_stack stack
;
9013 cp_parser_expression_stack_entry
*sp
= &stack
[0];
9014 cp_parser_expression_stack_entry current
;
9017 enum tree_code rhs_type
;
9018 enum cp_parser_prec new_prec
, lookahead_prec
;
9021 /* Parse the first expression. */
9022 current
.lhs_type
= (cp_lexer_next_token_is (parser
->lexer
, CPP_NOT
)
9023 ? TRUTH_NOT_EXPR
: ERROR_MARK
);
9024 current
.lhs
= cp_parser_cast_expression (parser
, /*address_p=*/false,
9025 cast_p
, decltype_p
, pidk
);
9026 current
.prec
= prec
;
9028 if (cp_parser_error_occurred (parser
))
9029 return error_mark_node
;
9033 /* Get an operator token. */
9034 token
= cp_lexer_peek_token (parser
->lexer
);
9036 if (warn_cxx11_compat
9037 && token
->type
== CPP_RSHIFT
9038 && !parser
->greater_than_is_operator_p
)
9040 if (warning_at (token
->location
, OPT_Wc__11_compat
,
9041 "%<>>%> operator is treated"
9042 " as two right angle brackets in C++11"))
9043 inform (token
->location
,
9044 "suggest parentheses around %<>>%> expression");
9047 new_prec
= TOKEN_PRECEDENCE (token
);
9048 if (new_prec
!= PREC_NOT_OPERATOR
9049 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
9050 /* This is a fold-expression; handle it later. */
9051 new_prec
= PREC_NOT_OPERATOR
;
9053 /* Popping an entry off the stack means we completed a subexpression:
9054 - either we found a token which is not an operator (`>' where it is not
9055 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9056 will happen repeatedly;
9057 - or, we found an operator which has lower priority. This is the case
9058 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9060 if (new_prec
<= current
.prec
)
9069 current
.tree_type
= binops_by_token
[token
->type
].tree_type
;
9070 current
.loc
= token
->location
;
9072 /* We used the operator token. */
9073 cp_lexer_consume_token (parser
->lexer
);
9075 /* For "false && x" or "true || x", x will never be executed;
9076 disable warnings while evaluating it. */
9077 if (current
.tree_type
== TRUTH_ANDIF_EXPR
)
9078 c_inhibit_evaluation_warnings
+=
9079 cp_fully_fold (current
.lhs
) == truthvalue_false_node
;
9080 else if (current
.tree_type
== TRUTH_ORIF_EXPR
)
9081 c_inhibit_evaluation_warnings
+=
9082 cp_fully_fold (current
.lhs
) == truthvalue_true_node
;
9084 /* Extract another operand. It may be the RHS of this expression
9085 or the LHS of a new, higher priority expression. */
9086 rhs_type
= (cp_lexer_next_token_is (parser
->lexer
, CPP_NOT
)
9087 ? TRUTH_NOT_EXPR
: ERROR_MARK
);
9088 rhs
= cp_parser_simple_cast_expression (parser
);
9090 /* Get another operator token. Look up its precedence to avoid
9091 building a useless (immediately popped) stack entry for common
9092 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9093 token
= cp_lexer_peek_token (parser
->lexer
);
9094 lookahead_prec
= TOKEN_PRECEDENCE (token
);
9095 if (lookahead_prec
!= PREC_NOT_OPERATOR
9096 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
9097 lookahead_prec
= PREC_NOT_OPERATOR
;
9098 if (lookahead_prec
> new_prec
)
9100 /* ... and prepare to parse the RHS of the new, higher priority
9101 expression. Since precedence levels on the stack are
9102 monotonically increasing, we do not have to care about
9107 current
.lhs_type
= rhs_type
;
9108 current
.prec
= new_prec
;
9109 new_prec
= lookahead_prec
;
9113 lookahead_prec
= new_prec
;
9114 /* If the stack is not empty, we have parsed into LHS the right side
9115 (`4' in the example above) of an expression we had suspended.
9116 We can use the information on the stack to recover the LHS (`3')
9117 from the stack together with the tree code (`MULT_EXPR'), and
9118 the precedence of the higher level subexpression
9119 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9120 which will be used to actually build the additive expression. */
9122 rhs_type
= current
.lhs_type
;
9127 /* Undo the disabling of warnings done above. */
9128 if (current
.tree_type
== TRUTH_ANDIF_EXPR
)
9129 c_inhibit_evaluation_warnings
-=
9130 cp_fully_fold (current
.lhs
) == truthvalue_false_node
;
9131 else if (current
.tree_type
== TRUTH_ORIF_EXPR
)
9132 c_inhibit_evaluation_warnings
-=
9133 cp_fully_fold (current
.lhs
) == truthvalue_true_node
;
9135 if (warn_logical_not_paren
9136 && TREE_CODE_CLASS (current
.tree_type
) == tcc_comparison
9137 && current
.lhs_type
== TRUTH_NOT_EXPR
9138 /* Avoid warning for !!x == y. */
9139 && (TREE_CODE (current
.lhs
) != NE_EXPR
9140 || !integer_zerop (TREE_OPERAND (current
.lhs
, 1)))
9141 && (TREE_CODE (current
.lhs
) != TRUTH_NOT_EXPR
9142 || (TREE_CODE (TREE_OPERAND (current
.lhs
, 0)) != TRUTH_NOT_EXPR
9143 /* Avoid warning for !b == y where b is boolean. */
9144 && (TREE_TYPE (TREE_OPERAND (current
.lhs
, 0)) == NULL_TREE
9145 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (current
.lhs
, 0)))
9147 /* Avoid warning for !!b == y where b is boolean. */
9148 && (!DECL_P (current
.lhs
)
9149 || TREE_TYPE (current
.lhs
) == NULL_TREE
9150 || TREE_CODE (TREE_TYPE (current
.lhs
)) != BOOLEAN_TYPE
))
9151 warn_logical_not_parentheses (current
.loc
, current
.tree_type
,
9152 current
.lhs
, maybe_constant_value (rhs
));
9156 location_t combined_loc
= make_location (current
.loc
,
9157 current
.lhs
.get_start (),
9160 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9161 ERROR_MARK for everything that is not a binary expression.
9162 This makes warn_about_parentheses miss some warnings that
9163 involve unary operators. For unary expressions we should
9164 pass the correct tree_code unless the unary expression was
9165 surrounded by parentheses.
9167 if (no_toplevel_fold_p
9168 && lookahead_prec
<= current
.prec
9170 current
.lhs
= build2_loc (combined_loc
,
9172 TREE_CODE_CLASS (current
.tree_type
)
9174 ? boolean_type_node
: TREE_TYPE (current
.lhs
),
9178 current
.lhs
= build_x_binary_op (combined_loc
, current
.tree_type
,
9179 current
.lhs
, current
.lhs_type
,
9180 rhs
, rhs_type
, &overload
,
9181 complain_flags (decltype_p
));
9182 /* TODO: build_x_binary_op doesn't always honor the location. */
9183 current
.lhs
.set_location (combined_loc
);
9185 current
.lhs_type
= current
.tree_type
;
9187 /* If the binary operator required the use of an overloaded operator,
9188 then this expression cannot be an integral constant-expression.
9189 An overloaded operator can be used even if both operands are
9190 otherwise permissible in an integral constant-expression if at
9191 least one of the operands is of enumeration type. */
9194 && cp_parser_non_integral_constant_expression (parser
,
9196 return error_mark_node
;
9203 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
,
9204 bool no_toplevel_fold_p
,
9205 enum cp_parser_prec prec
,
9208 return cp_parser_binary_expression (parser
, cast_p
, no_toplevel_fold_p
,
9209 /*decltype*/false, prec
, pidk
);
9212 /* Parse the `? expression : assignment-expression' part of a
9213 conditional-expression. The LOGICAL_OR_EXPR is the
9214 logical-or-expression that started the conditional-expression.
9215 Returns a representation of the entire conditional-expression.
9217 This routine is used by cp_parser_assignment_expression.
9219 ? expression : assignment-expression
9223 ? : assignment-expression */
9226 cp_parser_question_colon_clause (cp_parser
* parser
, cp_expr logical_or_expr
)
9228 tree expr
, folded_logical_or_expr
= cp_fully_fold (logical_or_expr
);
9229 cp_expr assignment_expr
;
9230 struct cp_token
*token
;
9231 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9233 /* Consume the `?' token. */
9234 cp_lexer_consume_token (parser
->lexer
);
9235 token
= cp_lexer_peek_token (parser
->lexer
);
9236 if (cp_parser_allow_gnu_extensions_p (parser
)
9237 && token
->type
== CPP_COLON
)
9239 pedwarn (token
->location
, OPT_Wpedantic
,
9240 "ISO C++ does not allow ?: with omitted middle operand");
9241 /* Implicit true clause. */
9243 c_inhibit_evaluation_warnings
+=
9244 folded_logical_or_expr
== truthvalue_true_node
;
9245 warn_for_omitted_condop (token
->location
, logical_or_expr
);
9249 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
9250 parser
->colon_corrects_to_scope_p
= false;
9251 /* Parse the expression. */
9252 c_inhibit_evaluation_warnings
+=
9253 folded_logical_or_expr
== truthvalue_false_node
;
9254 expr
= cp_parser_expression (parser
);
9255 c_inhibit_evaluation_warnings
+=
9256 ((folded_logical_or_expr
== truthvalue_true_node
)
9257 - (folded_logical_or_expr
== truthvalue_false_node
));
9258 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
9261 /* The next token should be a `:'. */
9262 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
9263 /* Parse the assignment-expression. */
9264 assignment_expr
= cp_parser_assignment_expression (parser
);
9265 c_inhibit_evaluation_warnings
-=
9266 folded_logical_or_expr
== truthvalue_true_node
;
9269 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9270 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9271 with the caret at the "?", ranging from the start of
9272 the logical_or_expr to the end of the assignment_expr. */
9273 loc
= make_location (loc
,
9274 logical_or_expr
.get_start (),
9275 assignment_expr
.get_finish ());
9277 /* Build the conditional-expression. */
9278 return build_x_conditional_expr (loc
, logical_or_expr
,
9281 tf_warning_or_error
);
9284 /* Parse an assignment-expression.
9286 assignment-expression:
9287 conditional-expression
9288 logical-or-expression assignment-operator assignment_expression
9291 CAST_P is true if this expression is the target of a cast.
9292 DECLTYPE_P is true if this expression is the operand of decltype.
9294 Returns a representation for the expression. */
9297 cp_parser_assignment_expression (cp_parser
* parser
, cp_id_kind
* pidk
,
9298 bool cast_p
, bool decltype_p
)
9302 /* If the next token is the `throw' keyword, then we're looking at
9303 a throw-expression. */
9304 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THROW
))
9305 expr
= cp_parser_throw_expression (parser
);
9306 /* Otherwise, it must be that we are looking at a
9307 logical-or-expression. */
9310 /* Parse the binary expressions (logical-or-expression). */
9311 expr
= cp_parser_binary_expression (parser
, cast_p
, false,
9313 PREC_NOT_OPERATOR
, pidk
);
9314 /* If the next token is a `?' then we're actually looking at a
9315 conditional-expression. */
9316 if (cp_lexer_next_token_is (parser
->lexer
, CPP_QUERY
))
9317 return cp_parser_question_colon_clause (parser
, expr
);
9320 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9322 /* If it's an assignment-operator, we're using the second
9324 enum tree_code assignment_operator
9325 = cp_parser_assignment_operator_opt (parser
);
9326 if (assignment_operator
!= ERROR_MARK
)
9328 bool non_constant_p
;
9330 /* Parse the right-hand side of the assignment. */
9331 cp_expr rhs
= cp_parser_initializer_clause (parser
,
9334 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
9335 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
9337 /* An assignment may not appear in a
9338 constant-expression. */
9339 if (cp_parser_non_integral_constant_expression (parser
,
9341 return error_mark_node
;
9342 /* Build the assignment expression. Its default
9346 is the location of the '=' token as the
9347 caret, ranging from the start of the lhs to the
9349 loc
= make_location (loc
,
9352 expr
= build_x_modify_expr (loc
, expr
,
9353 assignment_operator
,
9355 complain_flags (decltype_p
));
9356 /* TODO: build_x_modify_expr doesn't honor the location,
9357 so we must set it here. */
9358 expr
.set_location (loc
);
9366 /* Parse an (optional) assignment-operator.
9368 assignment-operator: one of
9369 = *= /= %= += -= >>= <<= &= ^= |=
9373 assignment-operator: one of
9376 If the next token is an assignment operator, the corresponding tree
9377 code is returned, and the token is consumed. For example, for
9378 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9379 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9380 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9381 operator, ERROR_MARK is returned. */
9383 static enum tree_code
9384 cp_parser_assignment_operator_opt (cp_parser
* parser
)
9389 /* Peek at the next token. */
9390 token
= cp_lexer_peek_token (parser
->lexer
);
9392 switch (token
->type
)
9403 op
= TRUNC_DIV_EXPR
;
9407 op
= TRUNC_MOD_EXPR
;
9439 /* Nothing else is an assignment operator. */
9443 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9444 if (op
!= ERROR_MARK
9445 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
9448 /* If it was an assignment operator, consume it. */
9449 if (op
!= ERROR_MARK
)
9450 cp_lexer_consume_token (parser
->lexer
);
9455 /* Parse an expression.
9458 assignment-expression
9459 expression , assignment-expression
9461 CAST_P is true if this expression is the target of a cast.
9462 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9463 except possibly parenthesized or on the RHS of a comma (N3276).
9465 Returns a representation of the expression. */
9468 cp_parser_expression (cp_parser
* parser
, cp_id_kind
* pidk
,
9469 bool cast_p
, bool decltype_p
)
9471 cp_expr expression
= NULL_TREE
;
9472 location_t loc
= UNKNOWN_LOCATION
;
9476 cp_expr assignment_expression
;
9478 /* Parse the next assignment-expression. */
9479 assignment_expression
9480 = cp_parser_assignment_expression (parser
, pidk
, cast_p
, decltype_p
);
9482 /* We don't create a temporary for a call that is the immediate operand
9483 of decltype or on the RHS of a comma. But when we see a comma, we
9484 need to create a temporary for a call on the LHS. */
9485 if (decltype_p
&& !processing_template_decl
9486 && TREE_CODE (assignment_expression
) == CALL_EXPR
9487 && CLASS_TYPE_P (TREE_TYPE (assignment_expression
))
9488 && cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
9489 assignment_expression
9490 = build_cplus_new (TREE_TYPE (assignment_expression
),
9491 assignment_expression
, tf_warning_or_error
);
9493 /* If this is the first assignment-expression, we can just
9496 expression
= assignment_expression
;
9499 /* Create a location with caret at the comma, ranging
9500 from the start of the LHS to the end of the RHS. */
9501 loc
= make_location (loc
,
9502 expression
.get_start (),
9503 assignment_expression
.get_finish ());
9504 expression
= build_x_compound_expr (loc
, expression
,
9505 assignment_expression
,
9506 complain_flags (decltype_p
));
9507 expression
.set_location (loc
);
9509 /* If the next token is not a comma, or we're in a fold-expression, then
9510 we are done with the expression. */
9511 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
)
9512 || cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
9514 /* Consume the `,'. */
9515 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9516 cp_lexer_consume_token (parser
->lexer
);
9517 /* A comma operator cannot appear in a constant-expression. */
9518 if (cp_parser_non_integral_constant_expression (parser
, NIC_COMMA
))
9519 expression
= error_mark_node
;
9525 /* Parse a constant-expression.
9527 constant-expression:
9528 conditional-expression
9530 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9531 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9532 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9533 is false, NON_CONSTANT_P should be NULL. */
9536 cp_parser_constant_expression (cp_parser
* parser
,
9537 bool allow_non_constant_p
,
9538 bool *non_constant_p
)
9540 bool saved_integral_constant_expression_p
;
9541 bool saved_allow_non_integral_constant_expression_p
;
9542 bool saved_non_integral_constant_expression_p
;
9545 /* It might seem that we could simply parse the
9546 conditional-expression, and then check to see if it were
9547 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9548 one that the compiler can figure out is constant, possibly after
9549 doing some simplifications or optimizations. The standard has a
9550 precise definition of constant-expression, and we must honor
9551 that, even though it is somewhat more restrictive.
9557 is not a legal declaration, because `(2, 3)' is not a
9558 constant-expression. The `,' operator is forbidden in a
9559 constant-expression. However, GCC's constant-folding machinery
9560 will fold this operation to an INTEGER_CST for `3'. */
9562 /* Save the old settings. */
9563 saved_integral_constant_expression_p
= parser
->integral_constant_expression_p
;
9564 saved_allow_non_integral_constant_expression_p
9565 = parser
->allow_non_integral_constant_expression_p
;
9566 saved_non_integral_constant_expression_p
= parser
->non_integral_constant_expression_p
;
9567 /* We are now parsing a constant-expression. */
9568 parser
->integral_constant_expression_p
= true;
9569 parser
->allow_non_integral_constant_expression_p
9570 = (allow_non_constant_p
|| cxx_dialect
>= cxx11
);
9571 parser
->non_integral_constant_expression_p
= false;
9572 /* Although the grammar says "conditional-expression", we parse an
9573 "assignment-expression", which also permits "throw-expression"
9574 and the use of assignment operators. In the case that
9575 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9576 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9577 actually essential that we look for an assignment-expression.
9578 For example, cp_parser_initializer_clauses uses this function to
9579 determine whether a particular assignment-expression is in fact
9581 expression
= cp_parser_assignment_expression (parser
);
9582 /* Restore the old settings. */
9583 parser
->integral_constant_expression_p
9584 = saved_integral_constant_expression_p
;
9585 parser
->allow_non_integral_constant_expression_p
9586 = saved_allow_non_integral_constant_expression_p
;
9587 if (cxx_dialect
>= cxx11
)
9589 /* Require an rvalue constant expression here; that's what our
9590 callers expect. Reference constant expressions are handled
9591 separately in e.g. cp_parser_template_argument. */
9592 tree decay
= expression
;
9593 if (TREE_TYPE (expression
)
9594 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
)
9595 decay
= build_address (expression
);
9596 bool is_const
= potential_rvalue_constant_expression (decay
);
9597 parser
->non_integral_constant_expression_p
= !is_const
;
9598 if (!is_const
&& !allow_non_constant_p
)
9599 require_potential_rvalue_constant_expression (decay
);
9601 if (allow_non_constant_p
)
9602 *non_constant_p
= parser
->non_integral_constant_expression_p
;
9603 parser
->non_integral_constant_expression_p
9604 = saved_non_integral_constant_expression_p
;
9609 /* Parse __builtin_offsetof.
9611 offsetof-expression:
9612 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9614 offsetof-member-designator:
9616 | offsetof-member-designator "." id-expression
9617 | offsetof-member-designator "[" expression "]"
9618 | offsetof-member-designator "->" id-expression */
9621 cp_parser_builtin_offsetof (cp_parser
*parser
)
9623 int save_ice_p
, save_non_ice_p
;
9628 location_t finish_loc
;
9630 /* We're about to accept non-integral-constant things, but will
9631 definitely yield an integral constant expression. Save and
9632 restore these values around our local parsing. */
9633 save_ice_p
= parser
->integral_constant_expression_p
;
9634 save_non_ice_p
= parser
->non_integral_constant_expression_p
;
9636 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9638 /* Consume the "__builtin_offsetof" token. */
9639 cp_lexer_consume_token (parser
->lexer
);
9640 /* Consume the opening `('. */
9641 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9642 /* Parse the type-id. */
9643 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9644 type
= cp_parser_type_id (parser
);
9645 /* Look for the `,'. */
9646 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
9647 token
= cp_lexer_peek_token (parser
->lexer
);
9649 /* Build the (type *)null that begins the traditional offsetof macro. */
9651 = build_static_cast (build_pointer_type (type
), null_pointer_node
,
9652 tf_warning_or_error
);
9654 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9655 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DEREF
, object_ptr
,
9656 true, &dummy
, token
->location
);
9659 token
= cp_lexer_peek_token (parser
->lexer
);
9660 switch (token
->type
)
9662 case CPP_OPEN_SQUARE
:
9663 /* offsetof-member-designator "[" expression "]" */
9664 expr
= cp_parser_postfix_open_square_expression (parser
, expr
,
9669 /* offsetof-member-designator "->" identifier */
9670 expr
= grok_array_decl (token
->location
, expr
,
9671 integer_zero_node
, false);
9675 /* offsetof-member-designator "." identifier */
9676 cp_lexer_consume_token (parser
->lexer
);
9677 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
,
9682 case CPP_CLOSE_PAREN
:
9683 /* Consume the ")" token. */
9684 finish_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9685 cp_lexer_consume_token (parser
->lexer
);
9689 /* Error. We know the following require will fail, but
9690 that gives the proper error message. */
9691 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9692 cp_parser_skip_to_closing_parenthesis (parser
, true, false, true);
9693 expr
= error_mark_node
;
9699 /* Make a location of the form:
9700 __builtin_offsetof (struct s, f)
9701 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9702 with caret at the type-id, ranging from the start of the
9703 "_builtin_offsetof" token to the close paren. */
9704 loc
= make_location (loc
, start_loc
, finish_loc
);
9705 /* The result will be an INTEGER_CST, so we need to explicitly
9706 preserve the location. */
9707 expr
= cp_expr (finish_offsetof (object_ptr
, expr
, loc
), loc
);
9710 parser
->integral_constant_expression_p
= save_ice_p
;
9711 parser
->non_integral_constant_expression_p
= save_non_ice_p
;
9716 /* Parse a trait expression.
9718 Returns a representation of the expression, the underlying type
9719 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9722 cp_parser_trait_expr (cp_parser
* parser
, enum rid keyword
)
9725 tree type1
, type2
= NULL_TREE
;
9726 bool binary
= false;
9727 bool variadic
= false;
9731 case RID_HAS_NOTHROW_ASSIGN
:
9732 kind
= CPTK_HAS_NOTHROW_ASSIGN
;
9734 case RID_HAS_NOTHROW_CONSTRUCTOR
:
9735 kind
= CPTK_HAS_NOTHROW_CONSTRUCTOR
;
9737 case RID_HAS_NOTHROW_COPY
:
9738 kind
= CPTK_HAS_NOTHROW_COPY
;
9740 case RID_HAS_TRIVIAL_ASSIGN
:
9741 kind
= CPTK_HAS_TRIVIAL_ASSIGN
;
9743 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
9744 kind
= CPTK_HAS_TRIVIAL_CONSTRUCTOR
;
9746 case RID_HAS_TRIVIAL_COPY
:
9747 kind
= CPTK_HAS_TRIVIAL_COPY
;
9749 case RID_HAS_TRIVIAL_DESTRUCTOR
:
9750 kind
= CPTK_HAS_TRIVIAL_DESTRUCTOR
;
9752 case RID_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9753 kind
= CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
;
9755 case RID_HAS_VIRTUAL_DESTRUCTOR
:
9756 kind
= CPTK_HAS_VIRTUAL_DESTRUCTOR
;
9758 case RID_IS_ABSTRACT
:
9759 kind
= CPTK_IS_ABSTRACT
;
9761 case RID_IS_AGGREGATE
:
9762 kind
= CPTK_IS_AGGREGATE
;
9764 case RID_IS_BASE_OF
:
9765 kind
= CPTK_IS_BASE_OF
;
9769 kind
= CPTK_IS_CLASS
;
9772 kind
= CPTK_IS_EMPTY
;
9775 kind
= CPTK_IS_ENUM
;
9778 kind
= CPTK_IS_FINAL
;
9780 case RID_IS_LITERAL_TYPE
:
9781 kind
= CPTK_IS_LITERAL_TYPE
;
9786 case RID_IS_POLYMORPHIC
:
9787 kind
= CPTK_IS_POLYMORPHIC
;
9789 case RID_IS_SAME_AS
:
9790 kind
= CPTK_IS_SAME_AS
;
9793 case RID_IS_STD_LAYOUT
:
9794 kind
= CPTK_IS_STD_LAYOUT
;
9796 case RID_IS_TRIVIAL
:
9797 kind
= CPTK_IS_TRIVIAL
;
9799 case RID_IS_TRIVIALLY_ASSIGNABLE
:
9800 kind
= CPTK_IS_TRIVIALLY_ASSIGNABLE
;
9803 case RID_IS_TRIVIALLY_CONSTRUCTIBLE
:
9804 kind
= CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
;
9807 case RID_IS_TRIVIALLY_COPYABLE
:
9808 kind
= CPTK_IS_TRIVIALLY_COPYABLE
;
9811 kind
= CPTK_IS_UNION
;
9813 case RID_UNDERLYING_TYPE
:
9814 kind
= CPTK_UNDERLYING_TYPE
;
9819 case RID_DIRECT_BASES
:
9820 kind
= CPTK_DIRECT_BASES
;
9822 case RID_IS_ASSIGNABLE
:
9823 kind
= CPTK_IS_ASSIGNABLE
;
9826 case RID_IS_CONSTRUCTIBLE
:
9827 kind
= CPTK_IS_CONSTRUCTIBLE
;
9834 /* Consume the token. */
9835 cp_lexer_consume_token (parser
->lexer
);
9837 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9840 type_id_in_expr_sentinel
s (parser
);
9841 type1
= cp_parser_type_id (parser
);
9844 if (type1
== error_mark_node
)
9845 return error_mark_node
;
9849 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
9852 type_id_in_expr_sentinel
s (parser
);
9853 type2
= cp_parser_type_id (parser
);
9856 if (type2
== error_mark_node
)
9857 return error_mark_node
;
9861 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
9863 cp_lexer_consume_token (parser
->lexer
);
9864 tree elt
= cp_parser_type_id (parser
);
9865 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
9867 cp_lexer_consume_token (parser
->lexer
);
9868 elt
= make_pack_expansion (elt
);
9870 if (elt
== error_mark_node
)
9871 return error_mark_node
;
9872 type2
= tree_cons (NULL_TREE
, elt
, type2
);
9876 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9878 /* Complete the trait expression, which may mean either processing
9879 the trait expr now or saving it for template instantiation. */
9882 case CPTK_UNDERLYING_TYPE
:
9883 return finish_underlying_type (type1
);
9885 return finish_bases (type1
, false);
9886 case CPTK_DIRECT_BASES
:
9887 return finish_bases (type1
, true);
9889 return finish_trait_expr (kind
, type1
, type2
);
9893 /* Lambdas that appear in variable initializer or default argument scope
9894 get that in their mangling, so we need to record it. We might as well
9895 use the count for function and namespace scopes as well. */
9896 static GTY(()) tree lambda_scope
;
9897 static GTY(()) int lambda_count
;
9898 struct GTY(()) tree_int
9903 static GTY(()) vec
<tree_int
, va_gc
> *lambda_scope_stack
;
9906 start_lambda_scope (tree decl
)
9910 /* Once we're inside a function, we ignore other scopes and just push
9911 the function again so that popping works properly. */
9912 if (current_function_decl
&& TREE_CODE (decl
) != FUNCTION_DECL
)
9913 decl
= current_function_decl
;
9914 ti
.t
= lambda_scope
;
9915 ti
.i
= lambda_count
;
9916 vec_safe_push (lambda_scope_stack
, ti
);
9917 if (lambda_scope
!= decl
)
9919 /* Don't reset the count if we're still in the same function. */
9920 lambda_scope
= decl
;
9926 record_lambda_scope (tree lambda
)
9928 LAMBDA_EXPR_EXTRA_SCOPE (lambda
) = lambda_scope
;
9929 LAMBDA_EXPR_DISCRIMINATOR (lambda
) = lambda_count
++;
9933 finish_lambda_scope (void)
9935 tree_int
*p
= &lambda_scope_stack
->last ();
9936 if (lambda_scope
!= p
->t
)
9938 lambda_scope
= p
->t
;
9939 lambda_count
= p
->i
;
9941 lambda_scope_stack
->pop ();
9944 /* Parse a lambda expression.
9947 lambda-introducer lambda-declarator [opt] compound-statement
9949 Returns a representation of the expression. */
9952 cp_parser_lambda_expression (cp_parser
* parser
)
9954 tree lambda_expr
= build_lambda_expr ();
9957 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
9958 cp_token_position start
= 0;
9960 LAMBDA_EXPR_LOCATION (lambda_expr
) = token
->location
;
9962 if (cp_unevaluated_operand
)
9964 if (!token
->error_reported
)
9966 error_at (LAMBDA_EXPR_LOCATION (lambda_expr
),
9967 "lambda-expression in unevaluated context");
9968 token
->error_reported
= true;
9972 else if (parser
->in_template_argument_list_p
)
9974 if (!token
->error_reported
)
9976 error_at (token
->location
, "lambda-expression in template-argument");
9977 token
->error_reported
= true;
9982 /* We may be in the middle of deferred access check. Disable
9984 push_deferring_access_checks (dk_no_deferred
);
9986 cp_parser_lambda_introducer (parser
, lambda_expr
);
9988 type
= begin_lambda_type (lambda_expr
);
9989 if (type
== error_mark_node
)
9990 return error_mark_node
;
9992 record_lambda_scope (lambda_expr
);
9994 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9995 determine_visibility (TYPE_NAME (type
));
9997 /* Now that we've started the type, add the capture fields for any
9998 explicit captures. */
9999 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
));
10002 /* Inside the class, surrounding template-parameter-lists do not apply. */
10003 unsigned int saved_num_template_parameter_lists
10004 = parser
->num_template_parameter_lists
;
10005 unsigned char in_statement
= parser
->in_statement
;
10006 bool in_switch_statement_p
= parser
->in_switch_statement_p
;
10007 bool fully_implicit_function_template_p
10008 = parser
->fully_implicit_function_template_p
;
10009 tree implicit_template_parms
= parser
->implicit_template_parms
;
10010 cp_binding_level
* implicit_template_scope
= parser
->implicit_template_scope
;
10011 bool auto_is_implicit_function_template_parm_p
10012 = parser
->auto_is_implicit_function_template_parm_p
;
10014 parser
->num_template_parameter_lists
= 0;
10015 parser
->in_statement
= 0;
10016 parser
->in_switch_statement_p
= false;
10017 parser
->fully_implicit_function_template_p
= false;
10018 parser
->implicit_template_parms
= 0;
10019 parser
->implicit_template_scope
= 0;
10020 parser
->auto_is_implicit_function_template_parm_p
= false;
10022 /* By virtue of defining a local class, a lambda expression has access to
10023 the private variables of enclosing classes. */
10025 ok
&= cp_parser_lambda_declarator_opt (parser
, lambda_expr
);
10027 if (ok
&& cp_parser_error_occurred (parser
))
10032 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
)
10033 && cp_parser_start_tentative_firewall (parser
))
10035 cp_parser_lambda_body (parser
, lambda_expr
);
10037 else if (cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
10039 if (cp_parser_skip_to_closing_brace (parser
))
10040 cp_lexer_consume_token (parser
->lexer
);
10043 /* The capture list was built up in reverse order; fix that now. */
10044 LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
)
10045 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
));
10048 maybe_add_lambda_conv_op (type
);
10050 type
= finish_struct (type
, /*attributes=*/NULL_TREE
);
10052 parser
->num_template_parameter_lists
= saved_num_template_parameter_lists
;
10053 parser
->in_statement
= in_statement
;
10054 parser
->in_switch_statement_p
= in_switch_statement_p
;
10055 parser
->fully_implicit_function_template_p
10056 = fully_implicit_function_template_p
;
10057 parser
->implicit_template_parms
= implicit_template_parms
;
10058 parser
->implicit_template_scope
= implicit_template_scope
;
10059 parser
->auto_is_implicit_function_template_parm_p
10060 = auto_is_implicit_function_template_parm_p
;
10063 /* This field is only used during parsing of the lambda. */
10064 LAMBDA_EXPR_THIS_CAPTURE (lambda_expr
) = NULL_TREE
;
10066 /* This lambda shouldn't have any proxies left at this point. */
10067 gcc_assert (LAMBDA_EXPR_PENDING_PROXIES (lambda_expr
) == NULL
);
10068 /* And now that we're done, push proxies for an enclosing lambda. */
10069 insert_pending_capture_proxies ();
10072 lambda_expr
= build_lambda_object (lambda_expr
);
10074 lambda_expr
= error_mark_node
;
10076 cp_parser_end_tentative_firewall (parser
, start
, lambda_expr
);
10078 pop_deferring_access_checks ();
10080 return lambda_expr
;
10083 /* Parse the beginning of a lambda expression.
10086 [ lambda-capture [opt] ]
10088 LAMBDA_EXPR is the current representation of the lambda expression. */
10091 cp_parser_lambda_introducer (cp_parser
* parser
, tree lambda_expr
)
10093 /* Need commas after the first capture. */
10096 /* Eat the leading `['. */
10097 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
10099 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10100 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
)
10101 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_NAME
)
10102 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_REFERENCE
;
10103 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
10104 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_COPY
;
10106 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) != CPLD_NONE
)
10108 cp_lexer_consume_token (parser
->lexer
);
10112 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_SQUARE
))
10114 cp_token
* capture_token
;
10116 tree capture_init_expr
;
10117 cp_id_kind idk
= CP_ID_KIND_NONE
;
10118 bool explicit_init_p
= false;
10120 enum capture_kind_type
10125 enum capture_kind_type capture_kind
= BY_COPY
;
10127 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
10129 error ("expected end of capture-list");
10136 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
10138 /* Possibly capture `this'. */
10139 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THIS
))
10141 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
10142 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_COPY
)
10143 pedwarn (loc
, 0, "explicit by-copy capture of %<this%> redundant "
10144 "with by-copy capture default");
10145 cp_lexer_consume_token (parser
->lexer
);
10146 add_capture (lambda_expr
,
10147 /*id=*/this_identifier
,
10148 /*initializer=*/finish_this_expr (),
10149 /*by_reference_p=*/true,
10154 /* Possibly capture `*this'. */
10155 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
)
10156 && cp_lexer_nth_token_is_keyword (parser
->lexer
, 2, RID_THIS
))
10158 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
10159 if (cxx_dialect
< cxx1z
)
10160 pedwarn (loc
, 0, "%<*this%> capture only available with "
10161 "-std=c++1z or -std=gnu++1z");
10162 cp_lexer_consume_token (parser
->lexer
);
10163 cp_lexer_consume_token (parser
->lexer
);
10164 add_capture (lambda_expr
,
10165 /*id=*/this_identifier
,
10166 /*initializer=*/finish_this_expr (),
10167 /*by_reference_p=*/false,
10172 /* Remember whether we want to capture as a reference or not. */
10173 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
))
10175 capture_kind
= BY_REFERENCE
;
10176 cp_lexer_consume_token (parser
->lexer
);
10179 /* Get the identifier. */
10180 capture_token
= cp_lexer_peek_token (parser
->lexer
);
10181 capture_id
= cp_parser_identifier (parser
);
10183 if (capture_id
== error_mark_node
)
10184 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10185 delimiters, but I modified this to stop on unnested ']' as well. It
10186 was already changed to stop on unnested '}', so the
10187 "closing_parenthesis" name is no more misleading with my change. */
10189 cp_parser_skip_to_closing_parenthesis (parser
,
10190 /*recovering=*/true,
10192 /*consume_paren=*/true);
10196 /* Find the initializer for this capture. */
10197 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
)
10198 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
10199 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
10201 bool direct
, non_constant
;
10202 /* An explicit initializer exists. */
10203 if (cxx_dialect
< cxx14
)
10204 pedwarn (input_location
, 0,
10205 "lambda capture initializers "
10206 "only available with -std=c++14 or -std=gnu++14");
10207 capture_init_expr
= cp_parser_initializer (parser
, &direct
,
10209 explicit_init_p
= true;
10210 if (capture_init_expr
== NULL_TREE
)
10212 error ("empty initializer for lambda init-capture");
10213 capture_init_expr
= error_mark_node
;
10218 const char* error_msg
;
10220 /* Turn the identifier into an id-expression. */
10222 = cp_parser_lookup_name_simple (parser
, capture_id
,
10223 capture_token
->location
);
10225 if (capture_init_expr
== error_mark_node
)
10227 unqualified_name_lookup_error (capture_id
);
10230 else if (DECL_P (capture_init_expr
)
10231 && (!VAR_P (capture_init_expr
)
10232 && TREE_CODE (capture_init_expr
) != PARM_DECL
))
10234 error_at (capture_token
->location
,
10235 "capture of non-variable %qD ",
10236 capture_init_expr
);
10237 inform (DECL_SOURCE_LOCATION (capture_init_expr
),
10238 "%q#D declared here", capture_init_expr
);
10241 if (VAR_P (capture_init_expr
)
10242 && decl_storage_duration (capture_init_expr
) != dk_auto
)
10244 if (pedwarn (capture_token
->location
, 0, "capture of variable "
10245 "%qD with non-automatic storage duration",
10246 capture_init_expr
))
10247 inform (DECL_SOURCE_LOCATION (capture_init_expr
),
10248 "%q#D declared here", capture_init_expr
);
10253 = finish_id_expression
10258 /*integral_constant_expression_p=*/false,
10259 /*allow_non_integral_constant_expression_p=*/false,
10260 /*non_integral_constant_expression_p=*/NULL
,
10261 /*template_p=*/false,
10263 /*address_p=*/false,
10264 /*template_arg_p=*/false,
10266 capture_token
->location
);
10268 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
10270 cp_lexer_consume_token (parser
->lexer
);
10271 capture_init_expr
= make_pack_expansion (capture_init_expr
);
10274 check_for_bare_parameter_packs (capture_init_expr
);
10277 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) != CPLD_NONE
10278 && !explicit_init_p
)
10280 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_COPY
10281 && capture_kind
== BY_COPY
)
10282 pedwarn (capture_token
->location
, 0, "explicit by-copy capture "
10283 "of %qD redundant with by-copy capture default",
10285 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_REFERENCE
10286 && capture_kind
== BY_REFERENCE
)
10287 pedwarn (capture_token
->location
, 0, "explicit by-reference "
10288 "capture of %qD redundant with by-reference capture "
10289 "default", capture_id
);
10292 add_capture (lambda_expr
,
10295 /*by_reference_p=*/capture_kind
== BY_REFERENCE
,
10299 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
10302 /* Parse the (optional) middle of a lambda expression.
10305 < template-parameter-list [opt] >
10306 ( parameter-declaration-clause [opt] )
10307 attribute-specifier [opt]
10308 decl-specifier-seq [opt]
10309 exception-specification [opt]
10310 lambda-return-type-clause [opt]
10312 LAMBDA_EXPR is the current representation of the lambda expression. */
10315 cp_parser_lambda_declarator_opt (cp_parser
* parser
, tree lambda_expr
)
10317 /* 5.1.1.4 of the standard says:
10318 If a lambda-expression does not include a lambda-declarator, it is as if
10319 the lambda-declarator were ().
10320 This means an empty parameter list, no attributes, and no exception
10322 tree param_list
= void_list_node
;
10323 tree attributes
= NULL_TREE
;
10324 tree exception_spec
= NULL_TREE
;
10325 tree template_param_list
= NULL_TREE
;
10326 tree tx_qual
= NULL_TREE
;
10327 cp_decl_specifier_seq lambda_specs
;
10328 clear_decl_specs (&lambda_specs
);
10330 /* The template-parameter-list is optional, but must begin with
10331 an opening angle if present. */
10332 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
10334 if (cxx_dialect
< cxx14
)
10335 pedwarn (parser
->lexer
->next_token
->location
, 0,
10336 "lambda templates are only available with "
10337 "-std=c++14 or -std=gnu++14");
10339 pedwarn (parser
->lexer
->next_token
->location
, OPT_Wpedantic
,
10340 "ISO C++ does not support lambda templates");
10342 cp_lexer_consume_token (parser
->lexer
);
10344 template_param_list
= cp_parser_template_parameter_list (parser
);
10346 cp_parser_skip_to_end_of_template_parameter_list (parser
);
10348 /* We just processed one more parameter list. */
10349 ++parser
->num_template_parameter_lists
;
10352 /* The parameter-declaration-clause is optional (unless
10353 template-parameter-list was given), but must begin with an
10354 opening parenthesis if present. */
10355 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
10357 cp_lexer_consume_token (parser
->lexer
);
10359 begin_scope (sk_function_parms
, /*entity=*/NULL_TREE
);
10361 /* Parse parameters. */
10362 param_list
= cp_parser_parameter_declaration_clause (parser
);
10364 /* Default arguments shall not be specified in the
10365 parameter-declaration-clause of a lambda-declarator. */
10366 if (cxx_dialect
< cxx14
)
10367 for (tree t
= param_list
; t
; t
= TREE_CHAIN (t
))
10368 if (TREE_PURPOSE (t
) && DECL_P (TREE_VALUE (t
)))
10369 pedwarn (DECL_SOURCE_LOCATION (TREE_VALUE (t
)), OPT_Wpedantic
,
10370 "default argument specified for lambda parameter");
10372 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
10374 attributes
= cp_parser_attributes_opt (parser
);
10376 /* In the decl-specifier-seq of the lambda-declarator, each
10377 decl-specifier shall either be mutable or constexpr. */
10378 int declares_class_or_enum
;
10379 if (cp_lexer_next_token_is_decl_specifier_keyword (parser
->lexer
))
10380 cp_parser_decl_specifier_seq (parser
,
10381 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR
,
10382 &lambda_specs
, &declares_class_or_enum
);
10383 if (lambda_specs
.storage_class
== sc_mutable
)
10385 LAMBDA_EXPR_MUTABLE_P (lambda_expr
) = 1;
10386 if (lambda_specs
.conflicting_specifiers_p
)
10387 error_at (lambda_specs
.locations
[ds_storage_class
],
10388 "duplicate %<mutable%>");
10391 tx_qual
= cp_parser_tx_qualifier_opt (parser
);
10393 /* Parse optional exception specification. */
10394 exception_spec
= cp_parser_exception_specification_opt (parser
);
10396 /* Parse optional trailing return type. */
10397 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
10399 cp_lexer_consume_token (parser
->lexer
);
10400 LAMBDA_EXPR_RETURN_TYPE (lambda_expr
)
10401 = cp_parser_trailing_type_id (parser
);
10404 /* The function parameters must be in scope all the way until after the
10405 trailing-return-type in case of decltype. */
10406 pop_bindings_and_leave_scope ();
10408 else if (template_param_list
!= NULL_TREE
) // generate diagnostic
10409 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
10411 /* Create the function call operator.
10413 Messing with declarators like this is no uglier than building up the
10414 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10417 cp_decl_specifier_seq return_type_specs
;
10418 cp_declarator
* declarator
;
10423 clear_decl_specs (&return_type_specs
);
10424 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
10425 return_type_specs
.type
= LAMBDA_EXPR_RETURN_TYPE (lambda_expr
);
10427 /* Maybe we will deduce the return type later. */
10428 return_type_specs
.type
= make_auto ();
10430 if (lambda_specs
.locations
[ds_constexpr
])
10432 if (cxx_dialect
>= cxx1z
)
10433 return_type_specs
.locations
[ds_constexpr
]
10434 = lambda_specs
.locations
[ds_constexpr
];
10436 error_at (lambda_specs
.locations
[ds_constexpr
], "%<constexpr%> "
10437 "lambda only available with -std=c++1z or -std=gnu++1z");
10440 p
= obstack_alloc (&declarator_obstack
, 0);
10442 declarator
= make_id_declarator (NULL_TREE
, cp_operator_id (CALL_EXPR
),
10445 quals
= (LAMBDA_EXPR_MUTABLE_P (lambda_expr
)
10446 ? TYPE_UNQUALIFIED
: TYPE_QUAL_CONST
);
10447 declarator
= make_call_declarator (declarator
, param_list
, quals
,
10448 VIRT_SPEC_UNSPECIFIED
,
10452 /*late_return_type=*/NULL_TREE
,
10453 /*requires_clause*/NULL_TREE
);
10454 declarator
->id_loc
= LAMBDA_EXPR_LOCATION (lambda_expr
);
10456 fco
= grokmethod (&return_type_specs
,
10459 if (fco
!= error_mark_node
)
10461 DECL_INITIALIZED_IN_CLASS_P (fco
) = 1;
10462 DECL_ARTIFICIAL (fco
) = 1;
10463 /* Give the object parameter a different name. */
10464 DECL_NAME (DECL_ARGUMENTS (fco
)) = get_identifier ("__closure");
10465 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
10466 TYPE_HAS_LATE_RETURN_TYPE (TREE_TYPE (fco
)) = 1;
10468 if (template_param_list
)
10470 fco
= finish_member_template_decl (fco
);
10471 finish_template_decl (template_param_list
);
10472 --parser
->num_template_parameter_lists
;
10474 else if (parser
->fully_implicit_function_template_p
)
10475 fco
= finish_fully_implicit_template (parser
, fco
);
10477 finish_member_declaration (fco
);
10479 obstack_free (&declarator_obstack
, p
);
10481 return (fco
!= error_mark_node
);
10485 /* Parse the body of a lambda expression, which is simply
10489 but which requires special handling.
10490 LAMBDA_EXPR is the current representation of the lambda expression. */
10493 cp_parser_lambda_body (cp_parser
* parser
, tree lambda_expr
)
10495 bool nested
= (current_function_decl
!= NULL_TREE
);
10496 bool local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
10498 push_function_context ();
10500 /* Still increment function_depth so that we don't GC in the
10501 middle of an expression. */
10503 vec
<tree
> omp_privatization_save
;
10504 save_omp_privatization_clauses (omp_privatization_save
);
10505 /* Clear this in case we're in the middle of a default argument. */
10506 parser
->local_variables_forbidden_p
= false;
10508 /* Finish the function call operator
10510 + late_parsing_for_member
10511 + function_definition_after_declarator
10512 + ctor_initializer_opt_and_function_body */
10514 tree fco
= lambda_function (lambda_expr
);
10517 tree compound_stmt
;
10520 /* Let the front end know that we are going to be defining this
10522 start_preparsed_function (fco
,
10524 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
10526 start_lambda_scope (fco
);
10527 body
= begin_function_body ();
10529 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
10532 /* Push the proxies for any explicit captures. */
10533 for (cap
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
); cap
;
10534 cap
= TREE_CHAIN (cap
))
10535 build_capture_proxy (TREE_PURPOSE (cap
));
10537 compound_stmt
= begin_compound_stmt (0);
10539 /* 5.1.1.4 of the standard says:
10540 If a lambda-expression does not include a trailing-return-type, it
10541 is as if the trailing-return-type denotes the following type:
10542 * if the compound-statement is of the form
10543 { return attribute-specifier [opt] expression ; }
10544 the type of the returned expression after lvalue-to-rvalue
10545 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10546 (_conv.array_ 4.2), and function-to-pointer conversion
10548 * otherwise, void. */
10550 /* In a lambda that has neither a lambda-return-type-clause
10551 nor a deducible form, errors should be reported for return statements
10552 in the body. Since we used void as the placeholder return type, parsing
10553 the body as usual will give such desired behavior. */
10554 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr
)
10555 && cp_lexer_peek_nth_token (parser
->lexer
, 1)->keyword
== RID_RETURN
10556 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SEMICOLON
)
10558 tree expr
= NULL_TREE
;
10559 cp_id_kind idk
= CP_ID_KIND_NONE
;
10561 /* Parse tentatively in case there's more after the initial return
10563 cp_parser_parse_tentatively (parser
);
10565 cp_parser_require_keyword (parser
, RID_RETURN
, RT_RETURN
);
10567 expr
= cp_parser_expression (parser
, &idk
);
10569 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
10570 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
10572 if (cp_parser_parse_definitely (parser
))
10574 if (!processing_template_decl
)
10576 tree type
= lambda_return_type (expr
);
10577 apply_deduced_return_type (fco
, type
);
10578 if (type
== error_mark_node
)
10579 expr
= error_mark_node
;
10582 /* Will get error here if type not deduced yet. */
10583 finish_return_stmt (expr
);
10591 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
10592 cp_parser_label_declaration (parser
);
10593 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
10594 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
10597 finish_compound_stmt (compound_stmt
);
10600 finish_function_body (body
);
10601 finish_lambda_scope ();
10603 /* Finish the function and generate code for it if necessary. */
10604 tree fn
= finish_function (/*inline*/2);
10606 /* Only expand if the call op is not a template. */
10607 if (!DECL_TEMPLATE_INFO (fco
))
10608 expand_or_defer_fn (fn
);
10611 restore_omp_privatization_clauses (omp_privatization_save
);
10612 parser
->local_variables_forbidden_p
= local_variables_forbidden_p
;
10614 pop_function_context();
10619 /* Statements [gram.stmt.stmt] */
10621 /* Parse a statement.
10625 expression-statement
10627 selection-statement
10628 iteration-statement
10630 declaration-statement
10637 attribute-specifier-seq (opt) expression-statement
10638 attribute-specifier-seq (opt) compound-statement
10639 attribute-specifier-seq (opt) selection-statement
10640 attribute-specifier-seq (opt) iteration-statement
10641 attribute-specifier-seq (opt) jump-statement
10642 declaration-statement
10643 attribute-specifier-seq (opt) try-block
10646 expression-statement
10654 IN_COMPOUND is true when the statement is nested inside a
10655 cp_parser_compound_statement; this matters for certain pragmas.
10657 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10658 is a (possibly labeled) if statement which is not enclosed in braces
10659 and has an else clause. This is used to implement -Wparentheses.
10661 CHAIN is a vector of if-else-if conditions. */
10664 cp_parser_statement (cp_parser
* parser
, tree in_statement_expr
,
10665 bool in_compound
, bool *if_p
, vec
<tree
> *chain
,
10666 location_t
*loc_after_labels
)
10668 tree statement
, std_attrs
= NULL_TREE
;
10670 location_t statement_location
, attrs_location
;
10675 /* There is no statement yet. */
10676 statement
= NULL_TREE
;
10678 saved_token_sentinel
saved_tokens (parser
->lexer
);
10679 attrs_location
= cp_lexer_peek_token (parser
->lexer
)->location
;
10680 if (c_dialect_objc ())
10681 /* In obj-c++, seeing '[[' might be the either the beginning of
10682 c++11 attributes, or a nested objc-message-expression. So
10683 let's parse the c++11 attributes tentatively. */
10684 cp_parser_parse_tentatively (parser
);
10685 std_attrs
= cp_parser_std_attribute_spec_seq (parser
);
10686 if (c_dialect_objc ())
10688 if (!cp_parser_parse_definitely (parser
))
10689 std_attrs
= NULL_TREE
;
10692 /* Peek at the next token. */
10693 token
= cp_lexer_peek_token (parser
->lexer
);
10694 /* Remember the location of the first token in the statement. */
10695 statement_location
= token
->location
;
10696 /* If this is a keyword, then that will often determine what kind of
10697 statement we have. */
10698 if (token
->type
== CPP_KEYWORD
)
10700 enum rid keyword
= token
->keyword
;
10706 /* Looks like a labeled-statement with a case label.
10707 Parse the label, and then use tail recursion to parse
10709 cp_parser_label_for_labeled_statement (parser
, std_attrs
);
10710 in_compound
= false;
10715 statement
= cp_parser_selection_statement (parser
, if_p
, chain
);
10721 statement
= cp_parser_iteration_statement (parser
, if_p
, false);
10725 if (!flag_cilkplus
)
10727 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
10728 "-fcilkplus must be enabled to use %<_Cilk_for%>");
10729 cp_lexer_consume_token (parser
->lexer
);
10730 statement
= error_mark_node
;
10733 statement
= cp_parser_cilk_for (parser
, integer_zero_node
, if_p
);
10740 statement
= cp_parser_jump_statement (parser
);
10743 case RID_CILK_SYNC
:
10744 cp_lexer_consume_token (parser
->lexer
);
10747 tree sync_expr
= build_cilk_sync ();
10748 SET_EXPR_LOCATION (sync_expr
,
10750 statement
= finish_expr_stmt (sync_expr
);
10754 error_at (token
->location
, "-fcilkplus must be enabled to use"
10755 " %<_Cilk_sync%>");
10756 statement
= error_mark_node
;
10758 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
10761 /* Objective-C++ exception-handling constructs. */
10764 case RID_AT_FINALLY
:
10765 case RID_AT_SYNCHRONIZED
:
10767 statement
= cp_parser_objc_statement (parser
);
10771 statement
= cp_parser_try_block (parser
);
10774 case RID_NAMESPACE
:
10775 /* This must be a namespace alias definition. */
10776 cp_parser_declaration_statement (parser
);
10779 case RID_TRANSACTION_ATOMIC
:
10780 case RID_TRANSACTION_RELAXED
:
10781 case RID_SYNCHRONIZED
:
10782 case RID_ATOMIC_NOEXCEPT
:
10783 case RID_ATOMIC_CANCEL
:
10784 statement
= cp_parser_transaction (parser
, token
);
10786 case RID_TRANSACTION_CANCEL
:
10787 statement
= cp_parser_transaction_cancel (parser
);
10791 /* It might be a keyword like `int' that can start a
10792 declaration-statement. */
10796 else if (token
->type
== CPP_NAME
)
10798 /* If the next token is a `:', then we are looking at a
10799 labeled-statement. */
10800 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
10801 if (token
->type
== CPP_COLON
)
10803 /* Looks like a labeled-statement with an ordinary label.
10804 Parse the label, and then use tail recursion to parse
10807 cp_parser_label_for_labeled_statement (parser
, std_attrs
);
10808 in_compound
= false;
10812 /* Anything that starts with a `{' must be a compound-statement. */
10813 else if (token
->type
== CPP_OPEN_BRACE
)
10814 statement
= cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
10815 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10816 a statement all its own. */
10817 else if (token
->type
== CPP_PRAGMA
)
10819 /* Only certain OpenMP pragmas are attached to statements, and thus
10820 are considered statements themselves. All others are not. In
10821 the context of a compound, accept the pragma as a "statement" and
10822 return so that we can check for a close brace. Otherwise we
10823 require a real statement and must go back and read one. */
10825 cp_parser_pragma (parser
, pragma_compound
, if_p
);
10826 else if (!cp_parser_pragma (parser
, pragma_stmt
, if_p
))
10830 else if (token
->type
== CPP_EOF
)
10832 cp_parser_error (parser
, "expected statement");
10836 /* Everything else must be a declaration-statement or an
10837 expression-statement. Try for the declaration-statement
10838 first, unless we are looking at a `;', in which case we know that
10839 we have an expression-statement. */
10842 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
10844 if (std_attrs
!= NULL_TREE
)
10846 /* Attributes should be parsed as part of the the
10847 declaration, so let's un-parse them. */
10848 saved_tokens
.rollback();
10849 std_attrs
= NULL_TREE
;
10852 cp_parser_parse_tentatively (parser
);
10853 /* Try to parse the declaration-statement. */
10854 cp_parser_declaration_statement (parser
);
10855 /* If that worked, we're done. */
10856 if (cp_parser_parse_definitely (parser
))
10859 /* All preceding labels have been parsed at this point. */
10860 if (loc_after_labels
!= NULL
)
10861 *loc_after_labels
= statement_location
;
10863 /* Look for an expression-statement instead. */
10864 statement
= cp_parser_expression_statement (parser
, in_statement_expr
);
10866 /* Handle [[fallthrough]];. */
10867 if (attribute_fallthrough_p (std_attrs
))
10869 /* The next token after the fallthrough attribute is ';'. */
10870 if (statement
== NULL_TREE
)
10872 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
10873 statement
= build_call_expr_internal_loc (statement_location
,
10875 void_type_node
, 0);
10876 finish_expr_stmt (statement
);
10879 warning_at (statement_location
, OPT_Wattributes
,
10880 "%<fallthrough%> attribute not followed by %<;%>");
10881 std_attrs
= NULL_TREE
;
10885 /* Set the line number for the statement. */
10886 if (statement
&& STATEMENT_CODE_P (TREE_CODE (statement
)))
10887 SET_EXPR_LOCATION (statement
, statement_location
);
10889 /* Allow "[[fallthrough]];", but warn otherwise. */
10890 if (std_attrs
!= NULL_TREE
)
10891 warning_at (attrs_location
,
10893 "attributes at the beginning of statement are ignored");
10896 /* Parse the label for a labeled-statement, i.e.
10899 case constant-expression :
10903 case constant-expression ... constant-expression : statement
10905 When a label is parsed without errors, the label is added to the
10906 parse tree by the finish_* functions, so this function doesn't
10907 have to return the label. */
10910 cp_parser_label_for_labeled_statement (cp_parser
* parser
, tree attributes
)
10913 tree label
= NULL_TREE
;
10914 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
10916 /* The next token should be an identifier. */
10917 token
= cp_lexer_peek_token (parser
->lexer
);
10918 if (token
->type
!= CPP_NAME
10919 && token
->type
!= CPP_KEYWORD
)
10921 cp_parser_error (parser
, "expected labeled-statement");
10925 /* Remember whether this case or a user-defined label is allowed to fall
10927 bool fallthrough_p
= token
->flags
& PREV_FALLTHROUGH
;
10929 parser
->colon_corrects_to_scope_p
= false;
10930 switch (token
->keyword
)
10934 tree expr
, expr_hi
;
10935 cp_token
*ellipsis
;
10937 /* Consume the `case' token. */
10938 cp_lexer_consume_token (parser
->lexer
);
10939 /* Parse the constant-expression. */
10940 expr
= cp_parser_constant_expression (parser
);
10941 if (check_for_bare_parameter_packs (expr
))
10942 expr
= error_mark_node
;
10944 ellipsis
= cp_lexer_peek_token (parser
->lexer
);
10945 if (ellipsis
->type
== CPP_ELLIPSIS
)
10947 /* Consume the `...' token. */
10948 cp_lexer_consume_token (parser
->lexer
);
10949 expr_hi
= cp_parser_constant_expression (parser
);
10950 if (check_for_bare_parameter_packs (expr_hi
))
10951 expr_hi
= error_mark_node
;
10953 /* We don't need to emit warnings here, as the common code
10954 will do this for us. */
10957 expr_hi
= NULL_TREE
;
10959 if (parser
->in_switch_statement_p
)
10961 tree l
= finish_case_label (token
->location
, expr
, expr_hi
);
10962 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
10963 FALLTHROUGH_LABEL_P (CASE_LABEL (l
)) = fallthrough_p
;
10966 error_at (token
->location
,
10967 "case label %qE not within a switch statement",
10973 /* Consume the `default' token. */
10974 cp_lexer_consume_token (parser
->lexer
);
10976 if (parser
->in_switch_statement_p
)
10978 tree l
= finish_case_label (token
->location
, NULL_TREE
, NULL_TREE
);
10979 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
10980 FALLTHROUGH_LABEL_P (CASE_LABEL (l
)) = fallthrough_p
;
10983 error_at (token
->location
, "case label not within a switch statement");
10987 /* Anything else must be an ordinary label. */
10988 label
= finish_label_stmt (cp_parser_identifier (parser
));
10989 if (label
&& TREE_CODE (label
) == LABEL_DECL
)
10990 FALLTHROUGH_LABEL_P (label
) = fallthrough_p
;
10994 /* Require the `:' token. */
10995 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
10997 /* An ordinary label may optionally be followed by attributes.
10998 However, this is only permitted if the attributes are then
10999 followed by a semicolon. This is because, for backward
11000 compatibility, when parsing
11001 lab: __attribute__ ((unused)) int i;
11002 we want the attribute to attach to "i", not "lab". */
11003 if (label
!= NULL_TREE
11004 && cp_next_tokens_can_be_gnu_attribute_p (parser
))
11007 cp_parser_parse_tentatively (parser
);
11008 attrs
= cp_parser_gnu_attributes_opt (parser
);
11009 if (attrs
== NULL_TREE
11010 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
11011 cp_parser_abort_tentative_parse (parser
);
11012 else if (!cp_parser_parse_definitely (parser
))
11015 attributes
= chainon (attributes
, attrs
);
11018 if (attributes
!= NULL_TREE
)
11019 cplus_decl_attributes (&label
, attributes
, 0);
11021 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
11024 /* Parse an expression-statement.
11026 expression-statement:
11029 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11030 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11031 indicates whether this expression-statement is part of an
11032 expression statement. */
11035 cp_parser_expression_statement (cp_parser
* parser
, tree in_statement_expr
)
11037 tree statement
= NULL_TREE
;
11038 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11039 location_t loc
= token
->location
;
11041 /* There might be attribute fallthrough. */
11042 tree attr
= cp_parser_gnu_attributes_opt (parser
);
11044 /* If the next token is a ';', then there is no expression
11046 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
11048 statement
= cp_parser_expression (parser
);
11049 if (statement
== error_mark_node
11050 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
11052 cp_parser_skip_to_end_of_block_or_statement (parser
);
11053 return error_mark_node
;
11057 /* Handle [[fallthrough]];. */
11058 if (attribute_fallthrough_p (attr
))
11060 /* The next token after the fallthrough attribute is ';'. */
11061 if (statement
== NULL_TREE
)
11062 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11063 statement
= build_call_expr_internal_loc (loc
, IFN_FALLTHROUGH
,
11064 void_type_node
, 0);
11066 warning_at (loc
, OPT_Wattributes
,
11067 "%<fallthrough%> attribute not followed by %<;%>");
11071 /* Allow "[[fallthrough]];", but warn otherwise. */
11072 if (attr
!= NULL_TREE
)
11073 warning_at (loc
, OPT_Wattributes
,
11074 "attributes at the beginning of statement are ignored");
11076 /* Give a helpful message for "A<T>::type t;" and the like. */
11077 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
11078 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
11080 if (TREE_CODE (statement
) == SCOPE_REF
)
11081 error_at (token
->location
, "need %<typename%> before %qE because "
11082 "%qT is a dependent scope",
11083 statement
, TREE_OPERAND (statement
, 0));
11084 else if (is_overloaded_fn (statement
)
11085 && DECL_CONSTRUCTOR_P (get_first_fn (statement
)))
11088 tree fn
= get_first_fn (statement
);
11089 error_at (token
->location
,
11090 "%<%T::%D%> names the constructor, not the type",
11091 DECL_CONTEXT (fn
), DECL_NAME (fn
));
11095 /* Consume the final `;'. */
11096 cp_parser_consume_semicolon_at_end_of_statement (parser
);
11098 if (in_statement_expr
11099 && cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
11100 /* This is the final expression statement of a statement
11102 statement
= finish_stmt_expr_expr (statement
, in_statement_expr
);
11103 else if (statement
)
11104 statement
= finish_expr_stmt (statement
);
11109 /* Parse a compound-statement.
11111 compound-statement:
11112 { statement-seq [opt] }
11116 compound-statement:
11117 { label-declaration-seq [opt] statement-seq [opt] }
11119 label-declaration-seq:
11121 label-declaration-seq label-declaration
11123 Returns a tree representing the statement. */
11126 cp_parser_compound_statement (cp_parser
*parser
, tree in_statement_expr
,
11127 int bcs_flags
, bool function_body
)
11129 tree compound_stmt
;
11131 /* Consume the `{'. */
11132 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
11133 return error_mark_node
;
11134 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl
)
11135 && !function_body
&& cxx_dialect
< cxx14
)
11136 pedwarn (input_location
, OPT_Wpedantic
,
11137 "compound-statement in constexpr function");
11138 /* Begin the compound-statement. */
11139 compound_stmt
= begin_compound_stmt (bcs_flags
);
11140 /* If the next keyword is `__label__' we have a label declaration. */
11141 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
11142 cp_parser_label_declaration (parser
);
11143 /* Parse an (optional) statement-seq. */
11144 cp_parser_statement_seq_opt (parser
, in_statement_expr
);
11145 /* Finish the compound-statement. */
11146 finish_compound_stmt (compound_stmt
);
11147 /* Consume the `}'. */
11148 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
11150 return compound_stmt
;
11153 /* Parse an (optional) statement-seq.
11157 statement-seq [opt] statement */
11160 cp_parser_statement_seq_opt (cp_parser
* parser
, tree in_statement_expr
)
11162 /* Scan statements until there aren't any more. */
11165 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11167 /* If we are looking at a `}', then we have run out of
11168 statements; the same is true if we have reached the end
11169 of file, or have stumbled upon a stray '@end'. */
11170 if (token
->type
== CPP_CLOSE_BRACE
11171 || token
->type
== CPP_EOF
11172 || token
->type
== CPP_PRAGMA_EOL
11173 || (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_AT_END
))
11176 /* If we are in a compound statement and find 'else' then
11177 something went wrong. */
11178 else if (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ELSE
)
11180 if (parser
->in_statement
& IN_IF_STMT
)
11184 token
= cp_lexer_consume_token (parser
->lexer
);
11185 error_at (token
->location
, "%<else%> without a previous %<if%>");
11189 /* Parse the statement. */
11190 cp_parser_statement (parser
, in_statement_expr
, true, NULL
);
11194 /* Return true if we're looking at (init; cond), false otherwise. */
11197 cp_parser_init_statement_p (cp_parser
*parser
)
11199 /* Save tokens so that we can put them back. */
11200 cp_lexer_save_tokens (parser
->lexer
);
11202 /* Look for ';' that is not nested in () or {}. */
11203 int ret
= cp_parser_skip_to_closing_parenthesis_1 (parser
,
11204 /*recovering=*/false,
11206 /*consume_paren=*/false);
11208 /* Roll back the tokens we skipped. */
11209 cp_lexer_rollback_tokens (parser
->lexer
);
11214 /* Parse a selection-statement.
11216 selection-statement:
11217 if ( init-statement [opt] condition ) statement
11218 if ( init-statement [opt] condition ) statement else statement
11219 switch ( init-statement [opt] condition ) statement
11221 Returns the new IF_STMT or SWITCH_STMT.
11223 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11224 is a (possibly labeled) if statement which is not enclosed in
11225 braces and has an else clause. This is used to implement
11228 CHAIN is a vector of if-else-if conditions. This is used to implement
11229 -Wduplicated-cond. */
11232 cp_parser_selection_statement (cp_parser
* parser
, bool *if_p
,
11237 token_indent_info guard_tinfo
;
11242 /* Peek at the next token. */
11243 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_SELECT
);
11244 guard_tinfo
= get_token_indent_info (token
);
11246 /* See what kind of keyword it is. */
11247 keyword
= token
->keyword
;
11257 if (keyword
== RID_IF
11258 && cp_lexer_next_token_is_keyword (parser
->lexer
,
11262 cp_token
*tok
= cp_lexer_consume_token (parser
->lexer
);
11263 if (cxx_dialect
< cxx1z
&& !in_system_header_at (tok
->location
))
11264 pedwarn (tok
->location
, 0, "%<if constexpr%> only available "
11265 "with -std=c++1z or -std=gnu++1z");
11268 /* Look for the `('. */
11269 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
11271 cp_parser_skip_to_end_of_statement (parser
);
11272 return error_mark_node
;
11275 /* Begin the selection-statement. */
11276 if (keyword
== RID_IF
)
11278 statement
= begin_if_stmt ();
11279 IF_STMT_CONSTEXPR_P (statement
) = cx
;
11282 statement
= begin_switch_stmt ();
11284 /* Parse the optional init-statement. */
11285 if (cp_parser_init_statement_p (parser
))
11288 if (cxx_dialect
< cxx1z
)
11289 pedwarn (cp_lexer_peek_token (parser
->lexer
)->location
, 0,
11290 "init-statement in selection statements only available "
11291 "with -std=c++1z or -std=gnu++1z");
11292 cp_parser_init_statement (parser
, &decl
);
11295 /* Parse the condition. */
11296 condition
= cp_parser_condition (parser
);
11297 /* Look for the `)'. */
11298 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
11299 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
11300 /*consume_paren=*/true);
11302 if (keyword
== RID_IF
)
11305 unsigned char in_statement
;
11307 /* Add the condition. */
11308 condition
= finish_if_stmt_cond (condition
, statement
);
11310 if (warn_duplicated_cond
)
11311 warn_duplicated_cond_add_or_warn (token
->location
, condition
,
11314 /* Parse the then-clause. */
11315 in_statement
= parser
->in_statement
;
11316 parser
->in_statement
|= IN_IF_STMT
;
11318 /* Outside a template, the non-selected branch of a constexpr
11319 if is a 'discarded statement', i.e. unevaluated. */
11320 bool was_discarded
= in_discarded_stmt
;
11321 bool discard_then
= (cx
&& !processing_template_decl
11322 && integer_zerop (condition
));
11325 in_discarded_stmt
= true;
11326 ++c_inhibit_evaluation_warnings
;
11329 cp_parser_implicitly_scoped_statement (parser
, &nested_if
,
11332 parser
->in_statement
= in_statement
;
11334 finish_then_clause (statement
);
11338 THEN_CLAUSE (statement
) = NULL_TREE
;
11339 in_discarded_stmt
= was_discarded
;
11340 --c_inhibit_evaluation_warnings
;
11343 /* If the next token is `else', parse the else-clause. */
11344 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
11347 bool discard_else
= (cx
&& !processing_template_decl
11348 && integer_nonzerop (condition
));
11351 in_discarded_stmt
= true;
11352 ++c_inhibit_evaluation_warnings
;
11356 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
11357 /* Consume the `else' keyword. */
11358 cp_lexer_consume_token (parser
->lexer
);
11359 if (warn_duplicated_cond
)
11361 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
11365 /* We've got "if (COND) else if (COND2)". Start
11366 the condition chain and add COND as the first
11368 chain
= new vec
<tree
> ();
11369 if (!CONSTANT_CLASS_P (condition
)
11370 && !TREE_SIDE_EFFECTS (condition
))
11372 /* Wrap it in a NOP_EXPR so that we can set the
11373 location of the condition. */
11374 tree e
= build1 (NOP_EXPR
, TREE_TYPE (condition
),
11376 SET_EXPR_LOCATION (e
, token
->location
);
11377 chain
->safe_push (e
);
11380 else if (!cp_lexer_next_token_is_keyword (parser
->lexer
,
11383 /* This is if-else without subsequent if. Zap the
11384 condition chain; we would have already warned at
11390 begin_else_clause (statement
);
11391 /* Parse the else-clause. */
11392 cp_parser_implicitly_scoped_statement (parser
, NULL
,
11393 guard_tinfo
, chain
);
11395 finish_else_clause (statement
);
11397 /* If we are currently parsing a then-clause, then
11398 IF_P will not be NULL. We set it to true to
11399 indicate that this if statement has an else clause.
11400 This may trigger the Wparentheses warning below
11401 when we get back up to the parent if statement. */
11407 ELSE_CLAUSE (statement
) = NULL_TREE
;
11408 in_discarded_stmt
= was_discarded
;
11409 --c_inhibit_evaluation_warnings
;
11414 /* This if statement does not have an else clause. If
11415 NESTED_IF is true, then the then-clause has an if
11416 statement which does have an else clause. We warn
11417 about the potential ambiguity. */
11419 warning_at (EXPR_LOCATION (statement
), OPT_Wdangling_else
,
11420 "suggest explicit braces to avoid ambiguous"
11422 if (warn_duplicated_cond
)
11424 /* We don't need the condition chain anymore. */
11430 /* Now we're all done with the if-statement. */
11431 finish_if_stmt (statement
);
11435 bool in_switch_statement_p
;
11436 unsigned char in_statement
;
11438 /* Add the condition. */
11439 finish_switch_cond (condition
, statement
);
11441 /* Parse the body of the switch-statement. */
11442 in_switch_statement_p
= parser
->in_switch_statement_p
;
11443 in_statement
= parser
->in_statement
;
11444 parser
->in_switch_statement_p
= true;
11445 parser
->in_statement
|= IN_SWITCH_STMT
;
11446 cp_parser_implicitly_scoped_statement (parser
, if_p
,
11448 parser
->in_switch_statement_p
= in_switch_statement_p
;
11449 parser
->in_statement
= in_statement
;
11451 /* Now we're all done with the switch-statement. */
11452 finish_switch_stmt (statement
);
11460 cp_parser_error (parser
, "expected selection-statement");
11461 return error_mark_node
;
11465 /* Parse a condition.
11469 type-specifier-seq declarator = initializer-clause
11470 type-specifier-seq declarator braced-init-list
11475 type-specifier-seq declarator asm-specification [opt]
11476 attributes [opt] = assignment-expression
11478 Returns the expression that should be tested. */
11481 cp_parser_condition (cp_parser
* parser
)
11483 cp_decl_specifier_seq type_specifiers
;
11484 const char *saved_message
;
11485 int declares_class_or_enum
;
11487 /* Try the declaration first. */
11488 cp_parser_parse_tentatively (parser
);
11489 /* New types are not allowed in the type-specifier-seq for a
11491 saved_message
= parser
->type_definition_forbidden_message
;
11492 parser
->type_definition_forbidden_message
11493 = G_("types may not be defined in conditions");
11494 /* Parse the type-specifier-seq. */
11495 cp_parser_decl_specifier_seq (parser
,
11496 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
,
11498 &declares_class_or_enum
);
11499 /* Restore the saved message. */
11500 parser
->type_definition_forbidden_message
= saved_message
;
11501 /* If all is well, we might be looking at a declaration. */
11502 if (!cp_parser_error_occurred (parser
))
11505 tree asm_specification
;
11507 cp_declarator
*declarator
;
11508 tree initializer
= NULL_TREE
;
11510 /* Parse the declarator. */
11511 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
11512 /*ctor_dtor_or_conv_p=*/NULL
,
11513 /*parenthesized_p=*/NULL
,
11514 /*member_p=*/false,
11515 /*friend_p=*/false);
11516 /* Parse the attributes. */
11517 attributes
= cp_parser_attributes_opt (parser
);
11518 /* Parse the asm-specification. */
11519 asm_specification
= cp_parser_asm_specification_opt (parser
);
11520 /* If the next token is not an `=' or '{', then we might still be
11521 looking at an expression. For example:
11525 looks like a decl-specifier-seq and a declarator -- but then
11526 there is no `=', so this is an expression. */
11527 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
11528 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
11529 cp_parser_simulate_error (parser
);
11531 /* If we did see an `=' or '{', then we are looking at a declaration
11533 if (cp_parser_parse_definitely (parser
))
11536 bool non_constant_p
;
11537 int flags
= LOOKUP_ONLYCONVERTING
;
11539 /* Create the declaration. */
11540 decl
= start_decl (declarator
, &type_specifiers
,
11541 /*initialized_p=*/true,
11542 attributes
, /*prefix_attributes=*/NULL_TREE
,
11545 /* Parse the initializer. */
11546 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11548 initializer
= cp_parser_braced_list (parser
, &non_constant_p
);
11549 CONSTRUCTOR_IS_DIRECT_INIT (initializer
) = 1;
11554 /* Consume the `='. */
11555 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
11556 initializer
= cp_parser_initializer_clause (parser
, &non_constant_p
);
11558 if (BRACE_ENCLOSED_INITIALIZER_P (initializer
))
11559 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
11561 /* Process the initializer. */
11562 cp_finish_decl (decl
,
11563 initializer
, !non_constant_p
,
11568 pop_scope (pushed_scope
);
11570 return convert_from_reference (decl
);
11573 /* If we didn't even get past the declarator successfully, we are
11574 definitely not looking at a declaration. */
11576 cp_parser_abort_tentative_parse (parser
);
11578 /* Otherwise, we are looking at an expression. */
11579 return cp_parser_expression (parser
);
11582 /* Parses a for-statement or range-for-statement until the closing ')',
11586 cp_parser_for (cp_parser
*parser
, bool ivdep
)
11588 tree init
, scope
, decl
;
11591 /* Begin the for-statement. */
11592 scope
= begin_for_scope (&init
);
11594 /* Parse the initialization. */
11595 is_range_for
= cp_parser_init_statement (parser
, &decl
);
11598 return cp_parser_range_for (parser
, scope
, init
, decl
, ivdep
);
11600 return cp_parser_c_for (parser
, scope
, init
, ivdep
);
11604 cp_parser_c_for (cp_parser
*parser
, tree scope
, tree init
, bool ivdep
)
11606 /* Normal for loop */
11607 tree condition
= NULL_TREE
;
11608 tree expression
= NULL_TREE
;
11611 stmt
= begin_for_stmt (scope
, init
);
11612 /* The init-statement has already been parsed in
11613 cp_parser_init_statement, so no work is needed here. */
11614 finish_init_stmt (stmt
);
11616 /* If there's a condition, process it. */
11617 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
11618 condition
= cp_parser_condition (parser
);
11621 cp_parser_error (parser
, "missing loop condition in loop with "
11622 "%<GCC ivdep%> pragma");
11623 condition
= error_mark_node
;
11625 finish_for_cond (condition
, stmt
, ivdep
);
11626 /* Look for the `;'. */
11627 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11629 /* If there's an expression, process it. */
11630 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
11631 expression
= cp_parser_expression (parser
);
11632 finish_for_expr (expression
, stmt
);
11637 /* Tries to parse a range-based for-statement:
11640 decl-specifier-seq declarator : expression
11642 The decl-specifier-seq declarator and the `:' are already parsed by
11643 cp_parser_init_statement. If processing_template_decl it returns a
11644 newly created RANGE_FOR_STMT; if not, it is converted to a
11645 regular FOR_STMT. */
11648 cp_parser_range_for (cp_parser
*parser
, tree scope
, tree init
, tree range_decl
,
11651 tree stmt
, range_expr
;
11652 auto_vec
<cxx_binding
*, 16> bindings
;
11653 auto_vec
<tree
, 16> names
;
11654 tree decomp_first_name
= NULL_TREE
;
11655 unsigned int decomp_cnt
= 0;
11657 /* Get the range declaration momentarily out of the way so that
11658 the range expression doesn't clash with it. */
11659 if (range_decl
!= error_mark_node
)
11661 if (DECL_HAS_VALUE_EXPR_P (range_decl
))
11663 tree v
= DECL_VALUE_EXPR (range_decl
);
11664 /* For decomposition declaration get all of the corresponding
11665 declarations out of the way. */
11666 if (TREE_CODE (v
) == ARRAY_REF
11667 && VAR_P (TREE_OPERAND (v
, 0))
11668 && DECL_DECOMPOSITION_P (TREE_OPERAND (v
, 0)))
11670 tree d
= range_decl
;
11671 range_decl
= TREE_OPERAND (v
, 0);
11672 decomp_cnt
= tree_to_uhwi (TREE_OPERAND (v
, 1)) + 1;
11673 decomp_first_name
= d
;
11674 for (unsigned int i
= 0; i
< decomp_cnt
; i
++, d
= DECL_CHAIN (d
))
11676 tree name
= DECL_NAME (d
);
11677 names
.safe_push (name
);
11678 bindings
.safe_push (IDENTIFIER_BINDING (name
));
11679 IDENTIFIER_BINDING (name
)
11680 = IDENTIFIER_BINDING (name
)->previous
;
11684 if (names
.is_empty ())
11686 tree name
= DECL_NAME (range_decl
);
11687 names
.safe_push (name
);
11688 bindings
.safe_push (IDENTIFIER_BINDING (name
));
11689 IDENTIFIER_BINDING (name
) = IDENTIFIER_BINDING (name
)->previous
;
11693 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11695 bool expr_non_constant_p
;
11696 range_expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
11699 range_expr
= cp_parser_expression (parser
);
11701 /* Put the range declaration(s) back into scope. */
11702 for (unsigned int i
= 0; i
< names
.length (); i
++)
11704 cxx_binding
*binding
= bindings
[i
];
11705 binding
->previous
= IDENTIFIER_BINDING (names
[i
]);
11706 IDENTIFIER_BINDING (names
[i
]) = binding
;
11709 /* If in template, STMT is converted to a normal for-statement
11710 at instantiation. If not, it is done just ahead. */
11711 if (processing_template_decl
)
11713 if (check_for_bare_parameter_packs (range_expr
))
11714 range_expr
= error_mark_node
;
11715 stmt
= begin_range_for_stmt (scope
, init
);
11717 RANGE_FOR_IVDEP (stmt
) = 1;
11718 finish_range_for_decl (stmt
, range_decl
, range_expr
);
11719 if (!type_dependent_expression_p (range_expr
)
11720 /* do_auto_deduction doesn't mess with template init-lists. */
11721 && !BRACE_ENCLOSED_INITIALIZER_P (range_expr
))
11722 do_range_for_auto_deduction (range_decl
, range_expr
);
11726 stmt
= begin_for_stmt (scope
, init
);
11727 stmt
= cp_convert_range_for (stmt
, range_decl
, range_expr
,
11728 decomp_first_name
, decomp_cnt
, ivdep
);
11733 /* Subroutine of cp_convert_range_for: given the initializer expression,
11734 builds up the range temporary. */
11737 build_range_temp (tree range_expr
)
11739 tree range_type
, range_temp
;
11741 /* Find out the type deduced by the declaration
11742 `auto &&__range = range_expr'. */
11743 range_type
= cp_build_reference_type (make_auto (), true);
11744 range_type
= do_auto_deduction (range_type
, range_expr
,
11745 type_uses_auto (range_type
));
11747 /* Create the __range variable. */
11748 range_temp
= build_decl (input_location
, VAR_DECL
,
11749 get_identifier ("__for_range"), range_type
);
11750 TREE_USED (range_temp
) = 1;
11751 DECL_ARTIFICIAL (range_temp
) = 1;
11756 /* Used by cp_parser_range_for in template context: we aren't going to
11757 do a full conversion yet, but we still need to resolve auto in the
11758 type of the for-range-declaration if present. This is basically
11759 a shortcut version of cp_convert_range_for. */
11762 do_range_for_auto_deduction (tree decl
, tree range_expr
)
11764 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
11767 tree begin_dummy
, end_dummy
, range_temp
, iter_type
, iter_decl
;
11768 range_temp
= convert_from_reference (build_range_temp (range_expr
));
11769 iter_type
= (cp_parser_perform_range_for_lookup
11770 (range_temp
, &begin_dummy
, &end_dummy
));
11773 iter_decl
= build_decl (input_location
, VAR_DECL
, NULL_TREE
,
11775 iter_decl
= build_x_indirect_ref (input_location
, iter_decl
, RO_NULL
,
11776 tf_warning_or_error
);
11777 TREE_TYPE (decl
) = do_auto_deduction (TREE_TYPE (decl
),
11778 iter_decl
, auto_node
);
11783 /* Converts a range-based for-statement into a normal
11784 for-statement, as per the definition.
11786 for (RANGE_DECL : RANGE_EXPR)
11789 should be equivalent to:
11792 auto &&__range = RANGE_EXPR;
11793 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11797 RANGE_DECL = *__begin;
11802 If RANGE_EXPR is an array:
11803 BEGIN_EXPR = __range
11804 END_EXPR = __range + ARRAY_SIZE(__range)
11805 Else if RANGE_EXPR has a member 'begin' or 'end':
11806 BEGIN_EXPR = __range.begin()
11807 END_EXPR = __range.end()
11809 BEGIN_EXPR = begin(__range)
11810 END_EXPR = end(__range);
11812 If __range has a member 'begin' but not 'end', or vice versa, we must
11813 still use the second alternative (it will surely fail, however).
11814 When calling begin()/end() in the third alternative we must use
11815 argument dependent lookup, but always considering 'std' as an associated
11819 cp_convert_range_for (tree statement
, tree range_decl
, tree range_expr
,
11820 tree decomp_first_name
, unsigned int decomp_cnt
,
11824 tree iter_type
, begin_expr
, end_expr
;
11825 tree condition
, expression
;
11827 if (range_decl
== error_mark_node
|| range_expr
== error_mark_node
)
11828 /* If an error happened previously do nothing or else a lot of
11829 unhelpful errors would be issued. */
11830 begin_expr
= end_expr
= iter_type
= error_mark_node
;
11835 if (VAR_P (range_expr
)
11836 && array_of_runtime_bound_p (TREE_TYPE (range_expr
)))
11837 /* Can't bind a reference to an array of runtime bound. */
11838 range_temp
= range_expr
;
11841 range_temp
= build_range_temp (range_expr
);
11842 pushdecl (range_temp
);
11843 cp_finish_decl (range_temp
, range_expr
,
11844 /*is_constant_init*/false, NULL_TREE
,
11845 LOOKUP_ONLYCONVERTING
);
11846 range_temp
= convert_from_reference (range_temp
);
11848 iter_type
= cp_parser_perform_range_for_lookup (range_temp
,
11849 &begin_expr
, &end_expr
);
11852 /* The new for initialization statement. */
11853 begin
= build_decl (input_location
, VAR_DECL
,
11854 get_identifier ("__for_begin"), iter_type
);
11855 TREE_USED (begin
) = 1;
11856 DECL_ARTIFICIAL (begin
) = 1;
11858 cp_finish_decl (begin
, begin_expr
,
11859 /*is_constant_init*/false, NULL_TREE
,
11860 LOOKUP_ONLYCONVERTING
);
11862 if (cxx_dialect
>= cxx1z
)
11863 iter_type
= cv_unqualified (TREE_TYPE (end_expr
));
11864 end
= build_decl (input_location
, VAR_DECL
,
11865 get_identifier ("__for_end"), iter_type
);
11866 TREE_USED (end
) = 1;
11867 DECL_ARTIFICIAL (end
) = 1;
11869 cp_finish_decl (end
, end_expr
,
11870 /*is_constant_init*/false, NULL_TREE
,
11871 LOOKUP_ONLYCONVERTING
);
11873 finish_init_stmt (statement
);
11875 /* The new for condition. */
11876 condition
= build_x_binary_op (input_location
, NE_EXPR
,
11879 NULL
, tf_warning_or_error
);
11880 finish_for_cond (condition
, statement
, ivdep
);
11882 /* The new increment expression. */
11883 expression
= finish_unary_op_expr (input_location
,
11884 PREINCREMENT_EXPR
, begin
,
11885 tf_warning_or_error
);
11886 finish_for_expr (expression
, statement
);
11888 /* The declaration is initialized with *__begin inside the loop body. */
11889 cp_finish_decl (range_decl
,
11890 build_x_indirect_ref (input_location
, begin
, RO_NULL
,
11891 tf_warning_or_error
),
11892 /*is_constant_init*/false, NULL_TREE
,
11893 LOOKUP_ONLYCONVERTING
);
11894 if (VAR_P (range_decl
) && DECL_DECOMPOSITION_P (range_decl
))
11895 cp_finish_decomp (range_decl
, decomp_first_name
, decomp_cnt
);
11900 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11901 We need to solve both at the same time because the method used
11902 depends on the existence of members begin or end.
11903 Returns the type deduced for the iterator expression. */
11906 cp_parser_perform_range_for_lookup (tree range
, tree
*begin
, tree
*end
)
11908 if (error_operand_p (range
))
11910 *begin
= *end
= error_mark_node
;
11911 return error_mark_node
;
11914 if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (range
))))
11916 error ("range-based %<for%> expression of type %qT "
11917 "has incomplete type", TREE_TYPE (range
));
11918 *begin
= *end
= error_mark_node
;
11919 return error_mark_node
;
11921 if (TREE_CODE (TREE_TYPE (range
)) == ARRAY_TYPE
)
11923 /* If RANGE is an array, we will use pointer arithmetic. */
11924 *begin
= decay_conversion (range
, tf_warning_or_error
);
11925 *end
= build_binary_op (input_location
, PLUS_EXPR
,
11927 array_type_nelts_top (TREE_TYPE (range
)),
11929 return TREE_TYPE (*begin
);
11933 /* If it is not an array, we must do a bit of magic. */
11934 tree id_begin
, id_end
;
11935 tree member_begin
, member_end
;
11937 *begin
= *end
= error_mark_node
;
11939 id_begin
= get_identifier ("begin");
11940 id_end
= get_identifier ("end");
11941 member_begin
= lookup_member (TREE_TYPE (range
), id_begin
,
11942 /*protect=*/2, /*want_type=*/false,
11943 tf_warning_or_error
);
11944 member_end
= lookup_member (TREE_TYPE (range
), id_end
,
11945 /*protect=*/2, /*want_type=*/false,
11946 tf_warning_or_error
);
11948 if (member_begin
!= NULL_TREE
|| member_end
!= NULL_TREE
)
11950 /* Use the member functions. */
11951 if (member_begin
!= NULL_TREE
)
11952 *begin
= cp_parser_range_for_member_function (range
, id_begin
);
11954 error ("range-based %<for%> expression of type %qT has an "
11955 "%<end%> member but not a %<begin%>", TREE_TYPE (range
));
11957 if (member_end
!= NULL_TREE
)
11958 *end
= cp_parser_range_for_member_function (range
, id_end
);
11960 error ("range-based %<for%> expression of type %qT has a "
11961 "%<begin%> member but not an %<end%>", TREE_TYPE (range
));
11965 /* Use global functions with ADL. */
11966 vec
<tree
, va_gc
> *vec
;
11967 vec
= make_tree_vector ();
11969 vec_safe_push (vec
, range
);
11971 member_begin
= perform_koenig_lookup (id_begin
, vec
,
11972 tf_warning_or_error
);
11973 *begin
= finish_call_expr (member_begin
, &vec
, false, true,
11974 tf_warning_or_error
);
11975 member_end
= perform_koenig_lookup (id_end
, vec
,
11976 tf_warning_or_error
);
11977 *end
= finish_call_expr (member_end
, &vec
, false, true,
11978 tf_warning_or_error
);
11980 release_tree_vector (vec
);
11983 /* Last common checks. */
11984 if (*begin
== error_mark_node
|| *end
== error_mark_node
)
11986 /* If one of the expressions is an error do no more checks. */
11987 *begin
= *end
= error_mark_node
;
11988 return error_mark_node
;
11990 else if (type_dependent_expression_p (*begin
)
11991 || type_dependent_expression_p (*end
))
11992 /* Can happen, when, eg, in a template context, Koenig lookup
11993 can't resolve begin/end (c++/58503). */
11997 tree iter_type
= cv_unqualified (TREE_TYPE (*begin
));
11998 /* The unqualified type of the __begin and __end temporaries should
11999 be the same, as required by the multiple auto declaration. */
12000 if (!same_type_p (iter_type
, cv_unqualified (TREE_TYPE (*end
))))
12002 if (cxx_dialect
>= cxx1z
12003 && (build_x_binary_op (input_location
, NE_EXPR
,
12004 *begin
, ERROR_MARK
,
12007 != error_mark_node
))
12008 /* P0184R0 allows __begin and __end to have different types,
12009 but make sure they are comparable so we can give a better
12012 error ("inconsistent begin/end types in range-based %<for%> "
12013 "statement: %qT and %qT",
12014 TREE_TYPE (*begin
), TREE_TYPE (*end
));
12021 /* Helper function for cp_parser_perform_range_for_lookup.
12022 Builds a tree for RANGE.IDENTIFIER(). */
12025 cp_parser_range_for_member_function (tree range
, tree identifier
)
12028 vec
<tree
, va_gc
> *vec
;
12030 member
= finish_class_member_access_expr (range
, identifier
,
12031 false, tf_warning_or_error
);
12032 if (member
== error_mark_node
)
12033 return error_mark_node
;
12035 vec
= make_tree_vector ();
12036 res
= finish_call_expr (member
, &vec
,
12037 /*disallow_virtual=*/false,
12038 /*koenig_p=*/false,
12039 tf_warning_or_error
);
12040 release_tree_vector (vec
);
12044 /* Parse an iteration-statement.
12046 iteration-statement:
12047 while ( condition ) statement
12048 do statement while ( expression ) ;
12049 for ( init-statement condition [opt] ; expression [opt] )
12052 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12055 cp_parser_iteration_statement (cp_parser
* parser
, bool *if_p
, bool ivdep
)
12060 unsigned char in_statement
;
12061 token_indent_info guard_tinfo
;
12063 /* Peek at the next token. */
12064 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_ITERATION
);
12066 return error_mark_node
;
12068 guard_tinfo
= get_token_indent_info (token
);
12070 /* Remember whether or not we are already within an iteration
12072 in_statement
= parser
->in_statement
;
12074 /* See what kind of keyword it is. */
12075 keyword
= token
->keyword
;
12082 /* Begin the while-statement. */
12083 statement
= begin_while_stmt ();
12084 /* Look for the `('. */
12085 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
12086 /* Parse the condition. */
12087 condition
= cp_parser_condition (parser
);
12088 finish_while_stmt_cond (condition
, statement
, ivdep
);
12089 /* Look for the `)'. */
12090 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
12091 /* Parse the dependent statement. */
12092 parser
->in_statement
= IN_ITERATION_STMT
;
12093 cp_parser_already_scoped_statement (parser
, if_p
, guard_tinfo
);
12094 parser
->in_statement
= in_statement
;
12095 /* We're done with the while-statement. */
12096 finish_while_stmt (statement
);
12104 /* Begin the do-statement. */
12105 statement
= begin_do_stmt ();
12106 /* Parse the body of the do-statement. */
12107 parser
->in_statement
= IN_ITERATION_STMT
;
12108 cp_parser_implicitly_scoped_statement (parser
, NULL
, guard_tinfo
);
12109 parser
->in_statement
= in_statement
;
12110 finish_do_body (statement
);
12111 /* Look for the `while' keyword. */
12112 cp_parser_require_keyword (parser
, RID_WHILE
, RT_WHILE
);
12113 /* Look for the `('. */
12114 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
12115 /* Parse the expression. */
12116 expression
= cp_parser_expression (parser
);
12117 /* We're done with the do-statement. */
12118 finish_do_stmt (expression
, statement
, ivdep
);
12119 /* Look for the `)'. */
12120 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
12121 /* Look for the `;'. */
12122 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
12128 /* Look for the `('. */
12129 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
12131 statement
= cp_parser_for (parser
, ivdep
);
12133 /* Look for the `)'. */
12134 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
12136 /* Parse the body of the for-statement. */
12137 parser
->in_statement
= IN_ITERATION_STMT
;
12138 cp_parser_already_scoped_statement (parser
, if_p
, guard_tinfo
);
12139 parser
->in_statement
= in_statement
;
12141 /* We're done with the for-statement. */
12142 finish_for_stmt (statement
);
12147 cp_parser_error (parser
, "expected iteration-statement");
12148 statement
= error_mark_node
;
12155 /* Parse a init-statement or the declarator of a range-based-for.
12156 Returns true if a range-based-for declaration is seen.
12159 expression-statement
12160 simple-declaration */
12163 cp_parser_init_statement (cp_parser
* parser
, tree
*decl
)
12165 /* If the next token is a `;', then we have an empty
12166 expression-statement. Grammatically, this is also a
12167 simple-declaration, but an invalid one, because it does not
12168 declare anything. Therefore, if we did not handle this case
12169 specially, we would issue an error message about an invalid
12171 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
12173 bool is_range_for
= false;
12174 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
12176 /* A colon is used in range-based for. */
12177 parser
->colon_corrects_to_scope_p
= false;
12179 /* We're going to speculatively look for a declaration, falling back
12180 to an expression, if necessary. */
12181 cp_parser_parse_tentatively (parser
);
12182 /* Parse the declaration. */
12183 cp_parser_simple_declaration (parser
,
12184 /*function_definition_allowed_p=*/false,
12186 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
12187 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
12189 /* It is a range-for, consume the ':' */
12190 cp_lexer_consume_token (parser
->lexer
);
12191 is_range_for
= true;
12192 if (cxx_dialect
< cxx11
)
12194 pedwarn (cp_lexer_peek_token (parser
->lexer
)->location
, 0,
12195 "range-based %<for%> loops only available with "
12196 "-std=c++11 or -std=gnu++11");
12197 *decl
= error_mark_node
;
12201 /* The ';' is not consumed yet because we told
12202 cp_parser_simple_declaration not to. */
12203 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
12205 if (cp_parser_parse_definitely (parser
))
12206 return is_range_for
;
12207 /* If the tentative parse failed, then we shall need to look for an
12208 expression-statement. */
12210 /* If we are here, it is an expression-statement. */
12211 cp_parser_expression_statement (parser
, NULL_TREE
);
12215 /* Parse a jump-statement.
12220 return expression [opt] ;
12221 return braced-init-list ;
12227 goto * expression ;
12229 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12232 cp_parser_jump_statement (cp_parser
* parser
)
12234 tree statement
= error_mark_node
;
12237 unsigned char in_statement
;
12239 /* Peek at the next token. */
12240 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_JUMP
);
12242 return error_mark_node
;
12244 /* See what kind of keyword it is. */
12245 keyword
= token
->keyword
;
12249 in_statement
= parser
->in_statement
& ~IN_IF_STMT
;
12250 switch (in_statement
)
12253 error_at (token
->location
, "break statement not within loop or switch");
12256 gcc_assert ((in_statement
& IN_SWITCH_STMT
)
12257 || in_statement
== IN_ITERATION_STMT
);
12258 statement
= finish_break_stmt ();
12259 if (in_statement
== IN_ITERATION_STMT
)
12260 break_maybe_infinite_loop ();
12263 error_at (token
->location
, "invalid exit from OpenMP structured block");
12266 error_at (token
->location
, "break statement used with OpenMP for loop");
12268 case IN_CILK_SIMD_FOR
:
12269 error_at (token
->location
, "break statement used with Cilk Plus for loop");
12272 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
12276 switch (parser
->in_statement
& ~(IN_SWITCH_STMT
| IN_IF_STMT
))
12279 error_at (token
->location
, "continue statement not within a loop");
12281 case IN_CILK_SIMD_FOR
:
12282 error_at (token
->location
,
12283 "continue statement within %<#pragma simd%> loop body");
12284 /* Fall through. */
12285 case IN_ITERATION_STMT
:
12287 statement
= finish_continue_stmt ();
12290 error_at (token
->location
, "invalid exit from OpenMP structured block");
12293 gcc_unreachable ();
12295 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
12301 bool expr_non_constant_p
;
12303 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
12305 cp_lexer_set_source_position (parser
->lexer
);
12306 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
12307 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
12309 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
12310 expr
= cp_parser_expression (parser
);
12312 /* If the next token is a `;', then there is no
12315 /* Build the return-statement. */
12316 if (current_function_auto_return_pattern
&& in_discarded_stmt
)
12317 /* Don't deduce from a discarded return statement. */;
12319 statement
= finish_return_stmt (expr
);
12320 /* Look for the final `;'. */
12321 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
12326 if (parser
->in_function_body
12327 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
12329 error ("%<goto%> in %<constexpr%> function");
12330 cp_function_chain
->invalid_constexpr
= true;
12333 /* Create the goto-statement. */
12334 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
))
12336 /* Issue a warning about this use of a GNU extension. */
12337 pedwarn (token
->location
, OPT_Wpedantic
, "ISO C++ forbids computed gotos");
12338 /* Consume the '*' token. */
12339 cp_lexer_consume_token (parser
->lexer
);
12340 /* Parse the dependent expression. */
12341 finish_goto_stmt (cp_parser_expression (parser
));
12344 finish_goto_stmt (cp_parser_identifier (parser
));
12345 /* Look for the final `;'. */
12346 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
12350 cp_parser_error (parser
, "expected jump-statement");
12357 /* Parse a declaration-statement.
12359 declaration-statement:
12360 block-declaration */
12363 cp_parser_declaration_statement (cp_parser
* parser
)
12367 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12368 p
= obstack_alloc (&declarator_obstack
, 0);
12370 /* Parse the block-declaration. */
12371 cp_parser_block_declaration (parser
, /*statement_p=*/true);
12373 /* Free any declarators allocated. */
12374 obstack_free (&declarator_obstack
, p
);
12377 /* Some dependent statements (like `if (cond) statement'), are
12378 implicitly in their own scope. In other words, if the statement is
12379 a single statement (as opposed to a compound-statement), it is
12380 none-the-less treated as if it were enclosed in braces. Any
12381 declarations appearing in the dependent statement are out of scope
12382 after control passes that point. This function parses a statement,
12383 but ensures that is in its own scope, even if it is not a
12384 compound-statement.
12386 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12387 is a (possibly labeled) if statement which is not enclosed in
12388 braces and has an else clause. This is used to implement
12391 CHAIN is a vector of if-else-if conditions. This is used to implement
12394 Returns the new statement. */
12397 cp_parser_implicitly_scoped_statement (cp_parser
* parser
, bool *if_p
,
12398 const token_indent_info
&guard_tinfo
,
12402 location_t body_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
12403 location_t body_loc_after_labels
= UNKNOWN_LOCATION
;
12404 token_indent_info body_tinfo
12405 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
12410 /* Mark if () ; with a special NOP_EXPR. */
12411 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
12413 cp_lexer_consume_token (parser
->lexer
);
12414 statement
= add_stmt (build_empty_stmt (body_loc
));
12416 if (guard_tinfo
.keyword
== RID_IF
12417 && !cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ELSE
))
12418 warning_at (body_loc
, OPT_Wempty_body
,
12419 "suggest braces around empty body in an %<if%> statement");
12420 else if (guard_tinfo
.keyword
== RID_ELSE
)
12421 warning_at (body_loc
, OPT_Wempty_body
,
12422 "suggest braces around empty body in an %<else%> statement");
12424 /* if a compound is opened, we simply parse the statement directly. */
12425 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
12426 statement
= cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
12427 /* If the token is not a `{', then we must take special action. */
12430 /* Create a compound-statement. */
12431 statement
= begin_compound_stmt (0);
12432 /* Parse the dependent-statement. */
12433 cp_parser_statement (parser
, NULL_TREE
, false, if_p
, chain
,
12434 &body_loc_after_labels
);
12435 /* Finish the dummy compound-statement. */
12436 finish_compound_stmt (statement
);
12439 token_indent_info next_tinfo
12440 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
12441 warn_for_misleading_indentation (guard_tinfo
, body_tinfo
, next_tinfo
);
12443 if (body_loc_after_labels
!= UNKNOWN_LOCATION
12444 && next_tinfo
.type
!= CPP_SEMICOLON
)
12445 warn_for_multistatement_macros (body_loc_after_labels
, next_tinfo
.location
,
12446 guard_tinfo
.location
, guard_tinfo
.keyword
);
12448 /* Return the statement. */
12452 /* For some dependent statements (like `while (cond) statement'), we
12453 have already created a scope. Therefore, even if the dependent
12454 statement is a compound-statement, we do not want to create another
12458 cp_parser_already_scoped_statement (cp_parser
* parser
, bool *if_p
,
12459 const token_indent_info
&guard_tinfo
)
12461 /* If the token is a `{', then we must take special action. */
12462 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
12464 token_indent_info body_tinfo
12465 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
12466 location_t loc_after_labels
= UNKNOWN_LOCATION
;
12468 cp_parser_statement (parser
, NULL_TREE
, false, if_p
, NULL
,
12469 &loc_after_labels
);
12470 token_indent_info next_tinfo
12471 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
12472 warn_for_misleading_indentation (guard_tinfo
, body_tinfo
, next_tinfo
);
12474 if (loc_after_labels
!= UNKNOWN_LOCATION
12475 && next_tinfo
.type
!= CPP_SEMICOLON
)
12476 warn_for_multistatement_macros (loc_after_labels
, next_tinfo
.location
,
12477 guard_tinfo
.location
,
12478 guard_tinfo
.keyword
);
12482 /* Avoid calling cp_parser_compound_statement, so that we
12483 don't create a new scope. Do everything else by hand. */
12484 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
12485 /* If the next keyword is `__label__' we have a label declaration. */
12486 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
12487 cp_parser_label_declaration (parser
);
12488 /* Parse an (optional) statement-seq. */
12489 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
12490 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
12494 /* Declarations [gram.dcl.dcl] */
12496 /* Parse an optional declaration-sequence.
12500 declaration-seq declaration */
12503 cp_parser_declaration_seq_opt (cp_parser
* parser
)
12509 token
= cp_lexer_peek_token (parser
->lexer
);
12511 if (token
->type
== CPP_CLOSE_BRACE
12512 || token
->type
== CPP_EOF
12513 || token
->type
== CPP_PRAGMA_EOL
)
12516 if (token
->type
== CPP_SEMICOLON
)
12518 /* A declaration consisting of a single semicolon is
12519 invalid. Allow it unless we're being pedantic. */
12520 cp_lexer_consume_token (parser
->lexer
);
12521 if (!in_system_header_at (input_location
))
12522 pedwarn (input_location
, OPT_Wpedantic
, "extra %<;%>");
12526 /* If we're entering or exiting a region that's implicitly
12527 extern "C", modify the lang context appropriately. */
12528 if (!parser
->implicit_extern_c
&& token
->implicit_extern_c
)
12530 push_lang_context (lang_name_c
);
12531 parser
->implicit_extern_c
= true;
12533 else if (parser
->implicit_extern_c
&& !token
->implicit_extern_c
)
12535 pop_lang_context ();
12536 parser
->implicit_extern_c
= false;
12539 if (token
->type
== CPP_PRAGMA
)
12541 /* A top-level declaration can consist solely of a #pragma.
12542 A nested declaration cannot, so this is done here and not
12543 in cp_parser_declaration. (A #pragma at block scope is
12544 handled in cp_parser_statement.) */
12545 cp_parser_pragma (parser
, pragma_external
, NULL
);
12549 /* Parse the declaration itself. */
12550 cp_parser_declaration (parser
);
12554 /* Parse a declaration.
12558 function-definition
12559 template-declaration
12560 explicit-instantiation
12561 explicit-specialization
12562 linkage-specification
12563 namespace-definition
12571 __extension__ declaration */
12574 cp_parser_declaration (cp_parser
* parser
)
12578 int saved_pedantic
;
12580 tree attributes
= NULL_TREE
;
12582 /* Check for the `__extension__' keyword. */
12583 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
12585 /* Parse the qualified declaration. */
12586 cp_parser_declaration (parser
);
12587 /* Restore the PEDANTIC flag. */
12588 pedantic
= saved_pedantic
;
12593 /* Try to figure out what kind of declaration is present. */
12594 token1
= *cp_lexer_peek_token (parser
->lexer
);
12596 if (token1
.type
!= CPP_EOF
)
12597 token2
= *cp_lexer_peek_nth_token (parser
->lexer
, 2);
12600 token2
.type
= CPP_EOF
;
12601 token2
.keyword
= RID_MAX
;
12604 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12605 p
= obstack_alloc (&declarator_obstack
, 0);
12607 /* If the next token is `extern' and the following token is a string
12608 literal, then we have a linkage specification. */
12609 if (token1
.keyword
== RID_EXTERN
12610 && cp_parser_is_pure_string_literal (&token2
))
12611 cp_parser_linkage_specification (parser
);
12612 /* If the next token is `template', then we have either a template
12613 declaration, an explicit instantiation, or an explicit
12615 else if (token1
.keyword
== RID_TEMPLATE
)
12617 /* `template <>' indicates a template specialization. */
12618 if (token2
.type
== CPP_LESS
12619 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
12620 cp_parser_explicit_specialization (parser
);
12621 /* `template <' indicates a template declaration. */
12622 else if (token2
.type
== CPP_LESS
)
12623 cp_parser_template_declaration (parser
, /*member_p=*/false);
12624 /* Anything else must be an explicit instantiation. */
12626 cp_parser_explicit_instantiation (parser
);
12628 /* If the next token is `export', then we have a template
12630 else if (token1
.keyword
== RID_EXPORT
)
12631 cp_parser_template_declaration (parser
, /*member_p=*/false);
12632 /* If the next token is `extern', 'static' or 'inline' and the one
12633 after that is `template', we have a GNU extended explicit
12634 instantiation directive. */
12635 else if (cp_parser_allow_gnu_extensions_p (parser
)
12636 && (token1
.keyword
== RID_EXTERN
12637 || token1
.keyword
== RID_STATIC
12638 || token1
.keyword
== RID_INLINE
)
12639 && token2
.keyword
== RID_TEMPLATE
)
12640 cp_parser_explicit_instantiation (parser
);
12641 /* If the next token is `namespace', check for a named or unnamed
12642 namespace definition. */
12643 else if (token1
.keyword
== RID_NAMESPACE
12644 && (/* A named namespace definition. */
12645 (token2
.type
== CPP_NAME
12646 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
12648 || (token2
.type
== CPP_OPEN_SQUARE
12649 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
12650 == CPP_OPEN_SQUARE
)
12651 /* An unnamed namespace definition. */
12652 || token2
.type
== CPP_OPEN_BRACE
12653 || token2
.keyword
== RID_ATTRIBUTE
))
12654 cp_parser_namespace_definition (parser
);
12655 /* An inline (associated) namespace definition. */
12656 else if (token1
.keyword
== RID_INLINE
12657 && token2
.keyword
== RID_NAMESPACE
)
12658 cp_parser_namespace_definition (parser
);
12659 /* Objective-C++ declaration/definition. */
12660 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1
.keyword
))
12661 cp_parser_objc_declaration (parser
, NULL_TREE
);
12662 else if (c_dialect_objc ()
12663 && token1
.keyword
== RID_ATTRIBUTE
12664 && cp_parser_objc_valid_prefix_attributes (parser
, &attributes
))
12665 cp_parser_objc_declaration (parser
, attributes
);
12666 /* At this point we may have a template declared by a concept
12668 else if (flag_concepts
12669 && cp_parser_template_declaration_after_export (parser
,
12670 /*member_p=*/false))
12673 /* Try to parse a block-declaration, or a function-definition. */
12674 cp_parser_block_declaration (parser
, /*statement_p=*/false);
12676 /* Free any declarators allocated. */
12677 obstack_free (&declarator_obstack
, p
);
12680 /* Parse a block-declaration.
12685 namespace-alias-definition
12692 __extension__ block-declaration
12697 static_assert-declaration
12699 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12700 part of a declaration-statement. */
12703 cp_parser_block_declaration (cp_parser
*parser
,
12707 int saved_pedantic
;
12709 /* Check for the `__extension__' keyword. */
12710 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
12712 /* Parse the qualified declaration. */
12713 cp_parser_block_declaration (parser
, statement_p
);
12714 /* Restore the PEDANTIC flag. */
12715 pedantic
= saved_pedantic
;
12720 /* Peek at the next token to figure out which kind of declaration is
12722 token1
= cp_lexer_peek_token (parser
->lexer
);
12724 /* If the next keyword is `asm', we have an asm-definition. */
12725 if (token1
->keyword
== RID_ASM
)
12728 cp_parser_commit_to_tentative_parse (parser
);
12729 cp_parser_asm_definition (parser
);
12731 /* If the next keyword is `namespace', we have a
12732 namespace-alias-definition. */
12733 else if (token1
->keyword
== RID_NAMESPACE
)
12734 cp_parser_namespace_alias_definition (parser
);
12735 /* If the next keyword is `using', we have a
12736 using-declaration, a using-directive, or an alias-declaration. */
12737 else if (token1
->keyword
== RID_USING
)
12742 cp_parser_commit_to_tentative_parse (parser
);
12743 /* If the token after `using' is `namespace', then we have a
12744 using-directive. */
12745 token2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
12746 if (token2
->keyword
== RID_NAMESPACE
)
12747 cp_parser_using_directive (parser
);
12748 /* If the second token after 'using' is '=', then we have an
12749 alias-declaration. */
12750 else if (cxx_dialect
>= cxx11
12751 && token2
->type
== CPP_NAME
12752 && ((cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_EQ
)
12753 || (cp_nth_tokens_can_be_attribute_p (parser
, 3))))
12754 cp_parser_alias_declaration (parser
);
12755 /* Otherwise, it's a using-declaration. */
12757 cp_parser_using_declaration (parser
,
12758 /*access_declaration_p=*/false);
12760 /* If the next keyword is `__label__' we have a misplaced label
12762 else if (token1
->keyword
== RID_LABEL
)
12764 cp_lexer_consume_token (parser
->lexer
);
12765 error_at (token1
->location
, "%<__label__%> not at the beginning of a block");
12766 cp_parser_skip_to_end_of_statement (parser
);
12767 /* If the next token is now a `;', consume it. */
12768 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
12769 cp_lexer_consume_token (parser
->lexer
);
12771 /* If the next token is `static_assert' we have a static assertion. */
12772 else if (token1
->keyword
== RID_STATIC_ASSERT
)
12773 cp_parser_static_assert (parser
, /*member_p=*/false);
12774 /* Anything else must be a simple-declaration. */
12776 cp_parser_simple_declaration (parser
, !statement_p
,
12777 /*maybe_range_for_decl*/NULL
);
12780 /* Parse a simple-declaration.
12782 simple-declaration:
12783 decl-specifier-seq [opt] init-declarator-list [opt] ;
12784 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12785 brace-or-equal-initializer ;
12787 init-declarator-list:
12789 init-declarator-list , init-declarator
12791 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12792 function-definition as a simple-declaration.
12794 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12795 parsed declaration if it is an uninitialized single declarator not followed
12796 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12797 if present, will not be consumed. */
12800 cp_parser_simple_declaration (cp_parser
* parser
,
12801 bool function_definition_allowed_p
,
12802 tree
*maybe_range_for_decl
)
12804 cp_decl_specifier_seq decl_specifiers
;
12805 int declares_class_or_enum
;
12806 bool saw_declarator
;
12807 location_t comma_loc
= UNKNOWN_LOCATION
;
12808 location_t init_loc
= UNKNOWN_LOCATION
;
12810 if (maybe_range_for_decl
)
12811 *maybe_range_for_decl
= NULL_TREE
;
12813 /* Defer access checks until we know what is being declared; the
12814 checks for names appearing in the decl-specifier-seq should be
12815 done as if we were in the scope of the thing being declared. */
12816 push_deferring_access_checks (dk_deferred
);
12818 /* Parse the decl-specifier-seq. We have to keep track of whether
12819 or not the decl-specifier-seq declares a named class or
12820 enumeration type, since that is the only case in which the
12821 init-declarator-list is allowed to be empty.
12825 In a simple-declaration, the optional init-declarator-list can be
12826 omitted only when declaring a class or enumeration, that is when
12827 the decl-specifier-seq contains either a class-specifier, an
12828 elaborated-type-specifier, or an enum-specifier. */
12829 cp_parser_decl_specifier_seq (parser
,
12830 CP_PARSER_FLAGS_OPTIONAL
,
12832 &declares_class_or_enum
);
12833 /* We no longer need to defer access checks. */
12834 stop_deferring_access_checks ();
12836 /* In a block scope, a valid declaration must always have a
12837 decl-specifier-seq. By not trying to parse declarators, we can
12838 resolve the declaration/expression ambiguity more quickly. */
12839 if (!function_definition_allowed_p
12840 && !decl_specifiers
.any_specifiers_p
)
12842 cp_parser_error (parser
, "expected declaration");
12846 /* If the next two tokens are both identifiers, the code is
12847 erroneous. The usual cause of this situation is code like:
12851 where "T" should name a type -- but does not. */
12852 if (!decl_specifiers
.any_type_specifiers_p
12853 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
12855 /* If parsing tentatively, we should commit; we really are
12856 looking at a declaration. */
12857 cp_parser_commit_to_tentative_parse (parser
);
12862 /* If we have seen at least one decl-specifier, and the next token
12863 is not a parenthesis, then we must be looking at a declaration.
12864 (After "int (" we might be looking at a functional cast.) */
12865 if (decl_specifiers
.any_specifiers_p
12866 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
)
12867 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
12868 && !cp_parser_error_occurred (parser
))
12869 cp_parser_commit_to_tentative_parse (parser
);
12871 /* Look for C++17 decomposition declaration. */
12872 for (size_t n
= 1; ; n
++)
12873 if (cp_lexer_nth_token_is (parser
->lexer
, n
, CPP_AND
)
12874 || cp_lexer_nth_token_is (parser
->lexer
, n
, CPP_AND_AND
))
12876 else if (cp_lexer_nth_token_is (parser
->lexer
, n
, CPP_OPEN_SQUARE
)
12877 && !cp_lexer_nth_token_is (parser
->lexer
, n
+ 1, CPP_OPEN_SQUARE
)
12878 && decl_specifiers
.any_specifiers_p
)
12881 = cp_parser_decomposition_declaration (parser
, &decl_specifiers
,
12882 maybe_range_for_decl
,
12885 /* The next token should be either a `,' or a `;'. */
12886 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12887 /* If it's a `;', we are done. */
12888 if (token
->type
== CPP_SEMICOLON
|| maybe_range_for_decl
)
12890 /* Anything else is an error. */
12893 /* If we have already issued an error message we don't need
12894 to issue another one. */
12895 if ((decl
!= error_mark_node
12896 && DECL_INITIAL (decl
) != error_mark_node
)
12897 || cp_parser_uncommitted_to_tentative_parse_p (parser
))
12898 cp_parser_error (parser
, "expected %<,%> or %<;%>");
12899 /* Skip tokens until we reach the end of the statement. */
12900 cp_parser_skip_to_end_of_statement (parser
);
12901 /* If the next token is now a `;', consume it. */
12902 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
12903 cp_lexer_consume_token (parser
->lexer
);
12911 bool auto_specifier_p
;
12912 /* NULL_TREE if both variable and function declaration are allowed,
12913 error_mark_node if function declaration are not allowed and
12914 a FUNCTION_DECL that should be diagnosed if it is followed by
12915 variable declarations. */
12916 tree auto_function_declaration
;
12918 last_type
= NULL_TREE
;
12920 = decl_specifiers
.type
&& type_uses_auto (decl_specifiers
.type
);
12921 auto_function_declaration
= NULL_TREE
;
12923 /* Keep going until we hit the `;' at the end of the simple
12925 saw_declarator
= false;
12926 while (cp_lexer_next_token_is_not (parser
->lexer
,
12930 bool function_definition_p
;
12932 tree auto_result
= NULL_TREE
;
12934 if (saw_declarator
)
12936 /* If we are processing next declarator, comma is expected */
12937 token
= cp_lexer_peek_token (parser
->lexer
);
12938 gcc_assert (token
->type
== CPP_COMMA
);
12939 cp_lexer_consume_token (parser
->lexer
);
12940 if (maybe_range_for_decl
)
12942 *maybe_range_for_decl
= error_mark_node
;
12943 if (comma_loc
== UNKNOWN_LOCATION
)
12944 comma_loc
= token
->location
;
12948 saw_declarator
= true;
12950 /* Parse the init-declarator. */
12951 decl
= cp_parser_init_declarator (parser
, &decl_specifiers
,
12953 function_definition_allowed_p
,
12954 /*member_p=*/false,
12955 declares_class_or_enum
,
12956 &function_definition_p
,
12957 maybe_range_for_decl
,
12960 /* If an error occurred while parsing tentatively, exit quickly.
12961 (That usually happens when in the body of a function; each
12962 statement is treated as a declaration-statement until proven
12964 if (cp_parser_error_occurred (parser
))
12967 if (auto_specifier_p
&& cxx_dialect
>= cxx14
)
12969 /* If the init-declarator-list contains more than one
12970 init-declarator, they shall all form declarations of
12972 if (auto_function_declaration
== NULL_TREE
)
12973 auto_function_declaration
12974 = TREE_CODE (decl
) == FUNCTION_DECL
? decl
: error_mark_node
;
12975 else if (TREE_CODE (decl
) == FUNCTION_DECL
12976 || auto_function_declaration
!= error_mark_node
)
12978 error_at (decl_specifiers
.locations
[ds_type_spec
],
12979 "non-variable %qD in declaration with more than one "
12980 "declarator with placeholder type",
12981 TREE_CODE (decl
) == FUNCTION_DECL
12982 ? decl
: auto_function_declaration
);
12983 auto_function_declaration
= error_mark_node
;
12988 && (!processing_template_decl
|| !type_uses_auto (auto_result
)))
12991 && last_type
!= error_mark_node
12992 && !same_type_p (auto_result
, last_type
))
12994 /* If the list of declarators contains more than one declarator,
12995 the type of each declared variable is determined as described
12996 above. If the type deduced for the template parameter U is not
12997 the same in each deduction, the program is ill-formed. */
12998 error_at (decl_specifiers
.locations
[ds_type_spec
],
12999 "inconsistent deduction for %qT: %qT and then %qT",
13000 decl_specifiers
.type
, last_type
, auto_result
);
13001 last_type
= error_mark_node
;
13004 last_type
= auto_result
;
13007 /* Handle function definitions specially. */
13008 if (function_definition_p
)
13010 /* If the next token is a `,', then we are probably
13011 processing something like:
13015 which is erroneous. */
13016 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
13018 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13019 error_at (token
->location
,
13021 " declarations and function-definitions is forbidden");
13023 /* Otherwise, we're done with the list of declarators. */
13026 pop_deferring_access_checks ();
13030 if (maybe_range_for_decl
&& *maybe_range_for_decl
== NULL_TREE
)
13031 *maybe_range_for_decl
= decl
;
13032 /* The next token should be either a `,' or a `;'. */
13033 token
= cp_lexer_peek_token (parser
->lexer
);
13034 /* If it's a `,', there are more declarators to come. */
13035 if (token
->type
== CPP_COMMA
)
13036 /* will be consumed next time around */;
13037 /* If it's a `;', we are done. */
13038 else if (token
->type
== CPP_SEMICOLON
)
13040 else if (maybe_range_for_decl
)
13042 if ((declares_class_or_enum
& 2) && token
->type
== CPP_COLON
)
13043 permerror (decl_specifiers
.locations
[ds_type_spec
],
13044 "types may not be defined in a for-range-declaration");
13047 /* Anything else is an error. */
13050 /* If we have already issued an error message we don't need
13051 to issue another one. */
13052 if ((decl
!= error_mark_node
13053 && DECL_INITIAL (decl
) != error_mark_node
)
13054 || cp_parser_uncommitted_to_tentative_parse_p (parser
))
13055 cp_parser_error (parser
, "expected %<,%> or %<;%>");
13056 /* Skip tokens until we reach the end of the statement. */
13057 cp_parser_skip_to_end_of_statement (parser
);
13058 /* If the next token is now a `;', consume it. */
13059 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
13060 cp_lexer_consume_token (parser
->lexer
);
13063 /* After the first time around, a function-definition is not
13064 allowed -- even if it was OK at first. For example:
13069 function_definition_allowed_p
= false;
13072 /* Issue an error message if no declarators are present, and the
13073 decl-specifier-seq does not itself declare a class or
13074 enumeration: [dcl.dcl]/3. */
13075 if (!saw_declarator
)
13077 if (cp_parser_declares_only_class_p (parser
))
13079 if (!declares_class_or_enum
13080 && decl_specifiers
.type
13081 && OVERLOAD_TYPE_P (decl_specifiers
.type
))
13082 /* Ensure an error is issued anyway when finish_decltype_type,
13083 called via cp_parser_decl_specifier_seq, returns a class or
13084 an enumeration (c++/51786). */
13085 decl_specifiers
.type
= NULL_TREE
;
13086 shadow_tag (&decl_specifiers
);
13088 /* Perform any deferred access checks. */
13089 perform_deferred_access_checks (tf_warning_or_error
);
13092 /* Consume the `;'. */
13094 if (!maybe_range_for_decl
)
13095 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
13096 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
13098 if (init_loc
!= UNKNOWN_LOCATION
)
13099 error_at (init_loc
, "initializer in range-based %<for%> loop");
13100 if (comma_loc
!= UNKNOWN_LOCATION
)
13101 error_at (comma_loc
,
13102 "multiple declarations in range-based %<for%> loop");
13106 pop_deferring_access_checks ();
13109 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13110 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13114 cp_parser_decomposition_declaration (cp_parser
*parser
,
13115 cp_decl_specifier_seq
*decl_specifiers
,
13116 tree
*maybe_range_for_decl
,
13117 location_t
*init_loc
)
13119 cp_ref_qualifier ref_qual
= cp_parser_ref_qualifier_opt (parser
);
13120 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
13121 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
13123 /* Parse the identifier-list. */
13124 auto_vec
<cp_expr
, 10> v
;
13125 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_SQUARE
))
13128 cp_expr e
= cp_parser_identifier (parser
);
13129 if (e
.get_value () == error_mark_node
)
13132 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
13134 cp_lexer_consume_token (parser
->lexer
);
13137 location_t end_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
13138 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
13140 end_loc
= UNKNOWN_LOCATION
;
13141 cp_parser_skip_to_closing_parenthesis_1 (parser
, true, CPP_CLOSE_SQUARE
,
13143 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_SQUARE
))
13144 cp_lexer_consume_token (parser
->lexer
);
13147 cp_parser_skip_to_end_of_statement (parser
);
13148 return error_mark_node
;
13152 if (cxx_dialect
< cxx1z
)
13153 pedwarn (loc
, 0, "decomposition declaration only available with "
13154 "-std=c++1z or -std=gnu++1z");
13157 cp_declarator
*declarator
= make_declarator (cdk_decomp
);
13158 loc
= end_loc
== UNKNOWN_LOCATION
? loc
: make_location (loc
, loc
, end_loc
);
13159 declarator
->id_loc
= loc
;
13160 if (ref_qual
!= REF_QUAL_NONE
)
13161 declarator
= make_reference_declarator (TYPE_UNQUALIFIED
, declarator
,
13162 ref_qual
== REF_QUAL_RVALUE
,
13164 tree decl
= start_decl (declarator
, decl_specifiers
, SD_INITIALIZED
,
13165 NULL_TREE
, decl_specifiers
->attributes
,
13167 tree orig_decl
= decl
;
13171 cp_decl_specifier_seq decl_specs
;
13172 clear_decl_specs (&decl_specs
);
13173 decl_specs
.type
= make_auto ();
13175 FOR_EACH_VEC_ELT (v
, i
, e
)
13178 declarator
= make_id_declarator (NULL_TREE
, e
.get_value (), sfk_none
);
13180 declarator
->u
.id
.unqualified_name
= e
.get_value ();
13181 declarator
->id_loc
= e
.get_location ();
13182 tree elt_pushed_scope
;
13183 tree decl2
= start_decl (declarator
, &decl_specs
, SD_INITIALIZED
,
13184 NULL_TREE
, NULL_TREE
, &elt_pushed_scope
);
13185 if (decl2
== error_mark_node
)
13186 decl
= error_mark_node
;
13187 else if (decl
!= error_mark_node
&& DECL_CHAIN (decl2
) != prev
)
13189 /* Ensure we've diagnosed redeclaration if we aren't creating
13191 gcc_assert (errorcount
);
13192 decl
= error_mark_node
;
13196 if (elt_pushed_scope
)
13197 pop_scope (elt_pushed_scope
);
13202 error_at (loc
, "empty decomposition declaration");
13203 decl
= error_mark_node
;
13206 if (maybe_range_for_decl
== NULL
13207 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
13209 bool non_constant_p
= false, is_direct_init
= false;
13210 *init_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
13211 tree initializer
= cp_parser_initializer (parser
, &is_direct_init
,
13214 if (decl
!= error_mark_node
)
13216 cp_finish_decl (decl
, initializer
, non_constant_p
, NULL_TREE
,
13217 is_direct_init
? LOOKUP_NORMAL
: LOOKUP_IMPLICIT
);
13218 cp_finish_decomp (decl
, prev
, v
.length ());
13221 else if (decl
!= error_mark_node
)
13223 *maybe_range_for_decl
= prev
;
13224 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13225 the underlying DECL. */
13226 cp_finish_decomp (decl
, prev
, v
.length ());
13230 pop_scope (pushed_scope
);
13232 if (decl
== error_mark_node
&& DECL_P (orig_decl
))
13234 if (DECL_NAMESPACE_SCOPE_P (orig_decl
))
13235 SET_DECL_ASSEMBLER_NAME (orig_decl
, get_identifier ("<decomp>"));
13241 /* Parse a decl-specifier-seq.
13243 decl-specifier-seq:
13244 decl-specifier-seq [opt] decl-specifier
13245 decl-specifier attribute-specifier-seq [opt] (C++11)
13248 storage-class-specifier
13259 Concepts Extension:
13264 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13266 The parser flags FLAGS is used to control type-specifier parsing.
13268 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13271 1: one of the decl-specifiers is an elaborated-type-specifier
13272 (i.e., a type declaration)
13273 2: one of the decl-specifiers is an enum-specifier or a
13274 class-specifier (i.e., a type definition)
13279 cp_parser_decl_specifier_seq (cp_parser
* parser
,
13280 cp_parser_flags flags
,
13281 cp_decl_specifier_seq
*decl_specs
,
13282 int* declares_class_or_enum
)
13284 bool constructor_possible_p
= !parser
->in_declarator_p
;
13285 bool found_decl_spec
= false;
13286 cp_token
*start_token
= NULL
;
13289 /* Clear DECL_SPECS. */
13290 clear_decl_specs (decl_specs
);
13292 /* Assume no class or enumeration type is declared. */
13293 *declares_class_or_enum
= 0;
13295 /* Keep reading specifiers until there are no more to read. */
13298 bool constructor_p
;
13302 /* Peek at the next token. */
13303 token
= cp_lexer_peek_token (parser
->lexer
);
13305 /* Save the first token of the decl spec list for error
13308 start_token
= token
;
13309 /* Handle attributes. */
13310 if (cp_next_tokens_can_be_attribute_p (parser
))
13312 /* Parse the attributes. */
13313 tree attrs
= cp_parser_attributes_opt (parser
);
13315 /* In a sequence of declaration specifiers, c++11 attributes
13316 appertain to the type that precede them. In that case
13319 The attribute-specifier-seq affects the type only for
13320 the declaration it appears in, not other declarations
13321 involving the same type.
13323 But for now let's force the user to position the
13324 attribute either at the beginning of the declaration or
13325 after the declarator-id, which would clearly mean that it
13326 applies to the declarator. */
13327 if (cxx11_attribute_p (attrs
))
13329 if (!found_decl_spec
)
13330 /* The c++11 attribute is at the beginning of the
13331 declaration. It appertains to the entity being
13335 if (decl_specs
->type
&& CLASS_TYPE_P (decl_specs
->type
))
13337 /* This is an attribute following a
13338 class-specifier. */
13339 if (decl_specs
->type_definition_p
)
13340 warn_misplaced_attr_for_class_type (token
->location
,
13346 decl_specs
->std_attributes
13347 = chainon (decl_specs
->std_attributes
,
13349 if (decl_specs
->locations
[ds_std_attribute
] == 0)
13350 decl_specs
->locations
[ds_std_attribute
] = token
->location
;
13356 decl_specs
->attributes
13357 = chainon (decl_specs
->attributes
,
13359 if (decl_specs
->locations
[ds_attribute
] == 0)
13360 decl_specs
->locations
[ds_attribute
] = token
->location
;
13363 /* Assume we will find a decl-specifier keyword. */
13364 found_decl_spec
= true;
13365 /* If the next token is an appropriate keyword, we can simply
13366 add it to the list. */
13367 switch (token
->keyword
)
13373 if (!at_class_scope_p ())
13375 error_at (token
->location
, "%<friend%> used outside of class");
13376 cp_lexer_purge_token (parser
->lexer
);
13381 /* Consume the token. */
13382 cp_lexer_consume_token (parser
->lexer
);
13386 case RID_CONSTEXPR
:
13388 cp_lexer_consume_token (parser
->lexer
);
13393 cp_lexer_consume_token (parser
->lexer
);
13396 /* function-specifier:
13403 cp_parser_function_specifier_opt (parser
, decl_specs
);
13410 /* Consume the token. */
13411 cp_lexer_consume_token (parser
->lexer
);
13412 /* A constructor declarator cannot appear in a typedef. */
13413 constructor_possible_p
= false;
13414 /* The "typedef" keyword can only occur in a declaration; we
13415 may as well commit at this point. */
13416 cp_parser_commit_to_tentative_parse (parser
);
13418 if (decl_specs
->storage_class
!= sc_none
)
13419 decl_specs
->conflicting_specifiers_p
= true;
13422 /* storage-class-specifier:
13432 if (cxx_dialect
== cxx98
)
13434 /* Consume the token. */
13435 cp_lexer_consume_token (parser
->lexer
);
13437 /* Complain about `auto' as a storage specifier, if
13438 we're complaining about C++0x compatibility. */
13439 warning_at (token
->location
, OPT_Wc__11_compat
, "%<auto%>"
13440 " changes meaning in C++11; please remove it");
13442 /* Set the storage class anyway. */
13443 cp_parser_set_storage_class (parser
, decl_specs
, RID_AUTO
,
13447 /* C++0x auto type-specifier. */
13448 found_decl_spec
= false;
13455 /* Consume the token. */
13456 cp_lexer_consume_token (parser
->lexer
);
13457 cp_parser_set_storage_class (parser
, decl_specs
, token
->keyword
,
13461 /* Consume the token. */
13463 cp_lexer_consume_token (parser
->lexer
);
13467 /* We did not yet find a decl-specifier yet. */
13468 found_decl_spec
= false;
13472 if (found_decl_spec
13473 && (flags
& CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
)
13474 && token
->keyword
!= RID_CONSTEXPR
)
13475 error ("decl-specifier invalid in condition");
13477 if (found_decl_spec
13478 && (flags
& CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR
)
13479 && token
->keyword
!= RID_MUTABLE
13480 && token
->keyword
!= RID_CONSTEXPR
)
13481 error_at (token
->location
, "%qD invalid in lambda",
13482 ridpointers
[token
->keyword
]);
13485 set_and_check_decl_spec_loc (decl_specs
, ds
, token
);
13487 /* Constructors are a special case. The `S' in `S()' is not a
13488 decl-specifier; it is the beginning of the declarator. */
13490 = (!found_decl_spec
13491 && constructor_possible_p
13492 && (cp_parser_constructor_declarator_p
13493 (parser
, decl_spec_seq_has_spec_p (decl_specs
, ds_friend
))));
13495 /* If we don't have a DECL_SPEC yet, then we must be looking at
13496 a type-specifier. */
13497 if (!found_decl_spec
&& !constructor_p
)
13499 int decl_spec_declares_class_or_enum
;
13500 bool is_cv_qualifier
;
13504 = cp_parser_type_specifier (parser
, flags
,
13506 /*is_declaration=*/true,
13507 &decl_spec_declares_class_or_enum
,
13509 *declares_class_or_enum
|= decl_spec_declares_class_or_enum
;
13511 /* If this type-specifier referenced a user-defined type
13512 (a typedef, class-name, etc.), then we can't allow any
13513 more such type-specifiers henceforth.
13517 The longest sequence of decl-specifiers that could
13518 possibly be a type name is taken as the
13519 decl-specifier-seq of a declaration. The sequence shall
13520 be self-consistent as described below.
13524 As a general rule, at most one type-specifier is allowed
13525 in the complete decl-specifier-seq of a declaration. The
13526 only exceptions are the following:
13528 -- const or volatile can be combined with any other
13531 -- signed or unsigned can be combined with char, long,
13539 void g (const int Pc);
13541 Here, Pc is *not* part of the decl-specifier seq; it's
13542 the declarator. Therefore, once we see a type-specifier
13543 (other than a cv-qualifier), we forbid any additional
13544 user-defined types. We *do* still allow things like `int
13545 int' to be considered a decl-specifier-seq, and issue the
13546 error message later. */
13547 if (type_spec
&& !is_cv_qualifier
)
13548 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
13549 /* A constructor declarator cannot follow a type-specifier. */
13552 constructor_possible_p
= false;
13553 found_decl_spec
= true;
13554 if (!is_cv_qualifier
)
13555 decl_specs
->any_type_specifiers_p
= true;
13559 /* If we still do not have a DECL_SPEC, then there are no more
13560 decl-specifiers. */
13561 if (!found_decl_spec
)
13564 decl_specs
->any_specifiers_p
= true;
13565 /* After we see one decl-specifier, further decl-specifiers are
13566 always optional. */
13567 flags
|= CP_PARSER_FLAGS_OPTIONAL
;
13570 /* Don't allow a friend specifier with a class definition. */
13571 if (decl_spec_seq_has_spec_p (decl_specs
, ds_friend
)
13572 && (*declares_class_or_enum
& 2))
13573 error_at (decl_specs
->locations
[ds_friend
],
13574 "class definition may not be declared a friend");
13577 /* Parse an (optional) storage-class-specifier.
13579 storage-class-specifier:
13588 storage-class-specifier:
13591 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13594 cp_parser_storage_class_specifier_opt (cp_parser
* parser
)
13596 switch (cp_lexer_peek_token (parser
->lexer
)->keyword
)
13599 if (cxx_dialect
!= cxx98
)
13601 /* Fall through for C++98. */
13602 gcc_fallthrough ();
13609 /* Consume the token. */
13610 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
13617 /* Parse an (optional) function-specifier.
13619 function-specifier:
13624 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13625 Updates DECL_SPECS, if it is non-NULL. */
13628 cp_parser_function_specifier_opt (cp_parser
* parser
,
13629 cp_decl_specifier_seq
*decl_specs
)
13631 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13632 switch (token
->keyword
)
13635 set_and_check_decl_spec_loc (decl_specs
, ds_inline
, token
);
13639 /* 14.5.2.3 [temp.mem]
13641 A member function template shall not be virtual. */
13642 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
13643 && current_class_type
)
13644 error_at (token
->location
, "templates may not be %<virtual%>");
13646 set_and_check_decl_spec_loc (decl_specs
, ds_virtual
, token
);
13650 set_and_check_decl_spec_loc (decl_specs
, ds_explicit
, token
);
13657 /* Consume the token. */
13658 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
13661 /* Parse a linkage-specification.
13663 linkage-specification:
13664 extern string-literal { declaration-seq [opt] }
13665 extern string-literal declaration */
13668 cp_parser_linkage_specification (cp_parser
* parser
)
13672 /* Look for the `extern' keyword. */
13673 cp_parser_require_keyword (parser
, RID_EXTERN
, RT_EXTERN
);
13675 /* Look for the string-literal. */
13676 linkage
= cp_parser_string_literal (parser
, false, false);
13678 /* Transform the literal into an identifier. If the literal is a
13679 wide-character string, or contains embedded NULs, then we can't
13680 handle it as the user wants. */
13681 if (strlen (TREE_STRING_POINTER (linkage
))
13682 != (size_t) (TREE_STRING_LENGTH (linkage
) - 1))
13684 cp_parser_error (parser
, "invalid linkage-specification");
13685 /* Assume C++ linkage. */
13686 linkage
= lang_name_cplusplus
;
13689 linkage
= get_identifier (TREE_STRING_POINTER (linkage
));
13691 /* We're now using the new linkage. */
13692 push_lang_context (linkage
);
13694 /* If the next token is a `{', then we're using the first
13696 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
13698 cp_ensure_no_omp_declare_simd (parser
);
13699 cp_ensure_no_oacc_routine (parser
);
13701 /* Consume the `{' token. */
13702 cp_lexer_consume_token (parser
->lexer
);
13703 /* Parse the declarations. */
13704 cp_parser_declaration_seq_opt (parser
);
13705 /* Look for the closing `}'. */
13706 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
13708 /* Otherwise, there's just one declaration. */
13711 bool saved_in_unbraced_linkage_specification_p
;
13713 saved_in_unbraced_linkage_specification_p
13714 = parser
->in_unbraced_linkage_specification_p
;
13715 parser
->in_unbraced_linkage_specification_p
= true;
13716 cp_parser_declaration (parser
);
13717 parser
->in_unbraced_linkage_specification_p
13718 = saved_in_unbraced_linkage_specification_p
;
13721 /* We're done with the linkage-specification. */
13722 pop_lang_context ();
13725 /* Parse a static_assert-declaration.
13727 static_assert-declaration:
13728 static_assert ( constant-expression , string-literal ) ;
13729 static_assert ( constant-expression ) ; (C++1Z)
13731 If MEMBER_P, this static_assert is a class member. */
13734 cp_parser_static_assert(cp_parser
*parser
, bool member_p
)
13739 location_t saved_loc
;
13742 /* Peek at the `static_assert' token so we can keep track of exactly
13743 where the static assertion started. */
13744 token
= cp_lexer_peek_token (parser
->lexer
);
13745 saved_loc
= token
->location
;
13747 /* Look for the `static_assert' keyword. */
13748 if (!cp_parser_require_keyword (parser
, RID_STATIC_ASSERT
,
13752 /* We know we are in a static assertion; commit to any tentative
13754 if (cp_parser_parsing_tentatively (parser
))
13755 cp_parser_commit_to_tentative_parse (parser
);
13757 /* Parse the `(' starting the static assertion condition. */
13758 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
13760 /* Parse the constant-expression. Allow a non-constant expression
13761 here in order to give better diagnostics in finish_static_assert. */
13763 cp_parser_constant_expression (parser
,
13764 /*allow_non_constant_p=*/true,
13765 /*non_constant_p=*/&dummy
);
13767 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13769 if (cxx_dialect
< cxx1z
)
13770 pedwarn (input_location
, OPT_Wpedantic
,
13771 "static_assert without a message "
13772 "only available with -std=c++1z or -std=gnu++1z");
13774 cp_lexer_consume_token (parser
->lexer
);
13775 message
= build_string (1, "");
13776 TREE_TYPE (message
) = char_array_type_node
;
13777 fix_string_type (message
);
13781 /* Parse the separating `,'. */
13782 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
13784 /* Parse the string-literal message. */
13785 message
= cp_parser_string_literal (parser
,
13786 /*translate=*/false,
13789 /* A `)' completes the static assertion. */
13790 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
13791 cp_parser_skip_to_closing_parenthesis (parser
,
13792 /*recovering=*/true,
13793 /*or_comma=*/false,
13794 /*consume_paren=*/true);
13797 /* A semicolon terminates the declaration. */
13798 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
13800 /* Complete the static assertion, which may mean either processing
13801 the static assert now or saving it for template instantiation. */
13802 finish_static_assert (condition
, message
, saved_loc
, member_p
);
13805 /* Parse the expression in decltype ( expression ). */
13808 cp_parser_decltype_expr (cp_parser
*parser
,
13809 bool &id_expression_or_member_access_p
)
13811 cp_token
*id_expr_start_token
;
13814 /* Since we're going to preserve any side-effects from this parse, set up a
13815 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13816 in the expression. */
13817 tentative_firewall
firewall (parser
);
13819 /* First, try parsing an id-expression. */
13820 id_expr_start_token
= cp_lexer_peek_token (parser
->lexer
);
13821 cp_parser_parse_tentatively (parser
);
13822 expr
= cp_parser_id_expression (parser
,
13823 /*template_keyword_p=*/false,
13824 /*check_dependency_p=*/true,
13825 /*template_p=*/NULL
,
13826 /*declarator_p=*/false,
13827 /*optional_p=*/false);
13829 if (!cp_parser_error_occurred (parser
) && expr
!= error_mark_node
)
13831 bool non_integral_constant_expression_p
= false;
13832 tree id_expression
= expr
;
13834 const char *error_msg
;
13836 if (identifier_p (expr
))
13837 /* Lookup the name we got back from the id-expression. */
13838 expr
= cp_parser_lookup_name_simple (parser
, expr
,
13839 id_expr_start_token
->location
);
13842 && expr
!= error_mark_node
13843 && TREE_CODE (expr
) != TYPE_DECL
13844 && (TREE_CODE (expr
) != BIT_NOT_EXPR
13845 || !TYPE_P (TREE_OPERAND (expr
, 0)))
13846 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13848 /* Complete lookup of the id-expression. */
13849 expr
= (finish_id_expression
13850 (id_expression
, expr
, parser
->scope
, &idk
,
13851 /*integral_constant_expression_p=*/false,
13852 /*allow_non_integral_constant_expression_p=*/true,
13853 &non_integral_constant_expression_p
,
13854 /*template_p=*/false,
13856 /*address_p=*/false,
13857 /*template_arg_p=*/false,
13859 id_expr_start_token
->location
));
13861 if (expr
== error_mark_node
)
13862 /* We found an id-expression, but it was something that we
13863 should not have found. This is an error, not something
13864 we can recover from, so note that we found an
13865 id-expression and we'll recover as gracefully as
13867 id_expression_or_member_access_p
= true;
13871 && expr
!= error_mark_node
13872 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13873 /* We have an id-expression. */
13874 id_expression_or_member_access_p
= true;
13877 if (!id_expression_or_member_access_p
)
13879 /* Abort the id-expression parse. */
13880 cp_parser_abort_tentative_parse (parser
);
13882 /* Parsing tentatively, again. */
13883 cp_parser_parse_tentatively (parser
);
13885 /* Parse a class member access. */
13886 expr
= cp_parser_postfix_expression (parser
, /*address_p=*/false,
13887 /*cast_p=*/false, /*decltype*/true,
13888 /*member_access_only_p=*/true, NULL
);
13891 && expr
!= error_mark_node
13892 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13893 /* We have an id-expression. */
13894 id_expression_or_member_access_p
= true;
13897 if (id_expression_or_member_access_p
)
13898 /* We have parsed the complete id-expression or member access. */
13899 cp_parser_parse_definitely (parser
);
13902 /* Abort our attempt to parse an id-expression or member access
13904 cp_parser_abort_tentative_parse (parser
);
13906 /* Parse a full expression. */
13907 expr
= cp_parser_expression (parser
, /*pidk=*/NULL
, /*cast_p=*/false,
13908 /*decltype_p=*/true);
13914 /* Parse a `decltype' type. Returns the type.
13916 simple-type-specifier:
13917 decltype ( expression )
13919 decltype ( auto ) */
13922 cp_parser_decltype (cp_parser
*parser
)
13925 bool id_expression_or_member_access_p
= false;
13926 const char *saved_message
;
13927 bool saved_integral_constant_expression_p
;
13928 bool saved_non_integral_constant_expression_p
;
13929 bool saved_greater_than_is_operator_p
;
13930 cp_token
*start_token
= cp_lexer_peek_token (parser
->lexer
);
13932 if (start_token
->type
== CPP_DECLTYPE
)
13934 /* Already parsed. */
13935 cp_lexer_consume_token (parser
->lexer
);
13936 return saved_checks_value (start_token
->u
.tree_check_value
);
13939 /* Look for the `decltype' token. */
13940 if (!cp_parser_require_keyword (parser
, RID_DECLTYPE
, RT_DECLTYPE
))
13941 return error_mark_node
;
13943 /* Parse the opening `('. */
13944 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
13945 return error_mark_node
;
13947 /* decltype (auto) */
13948 if (cxx_dialect
>= cxx14
13949 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
13951 cp_lexer_consume_token (parser
->lexer
);
13952 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
13953 return error_mark_node
;
13954 expr
= make_decltype_auto ();
13955 AUTO_IS_DECLTYPE (expr
) = true;
13959 /* Types cannot be defined in a `decltype' expression. Save away the
13961 saved_message
= parser
->type_definition_forbidden_message
;
13963 /* And create the new one. */
13964 parser
->type_definition_forbidden_message
13965 = G_("types may not be defined in %<decltype%> expressions");
13967 /* The restrictions on constant-expressions do not apply inside
13968 decltype expressions. */
13969 saved_integral_constant_expression_p
13970 = parser
->integral_constant_expression_p
;
13971 saved_non_integral_constant_expression_p
13972 = parser
->non_integral_constant_expression_p
;
13973 parser
->integral_constant_expression_p
= false;
13975 /* Within a parenthesized expression, a `>' token is always
13976 the greater-than operator. */
13977 saved_greater_than_is_operator_p
13978 = parser
->greater_than_is_operator_p
;
13979 parser
->greater_than_is_operator_p
= true;
13981 /* Do not actually evaluate the expression. */
13982 ++cp_unevaluated_operand
;
13984 /* Do not warn about problems with the expression. */
13985 ++c_inhibit_evaluation_warnings
;
13987 expr
= cp_parser_decltype_expr (parser
, id_expression_or_member_access_p
);
13989 /* Go back to evaluating expressions. */
13990 --cp_unevaluated_operand
;
13991 --c_inhibit_evaluation_warnings
;
13993 /* The `>' token might be the end of a template-id or
13994 template-parameter-list now. */
13995 parser
->greater_than_is_operator_p
13996 = saved_greater_than_is_operator_p
;
13998 /* Restore the old message and the integral constant expression
14000 parser
->type_definition_forbidden_message
= saved_message
;
14001 parser
->integral_constant_expression_p
14002 = saved_integral_constant_expression_p
;
14003 parser
->non_integral_constant_expression_p
14004 = saved_non_integral_constant_expression_p
;
14006 /* Parse to the closing `)'. */
14007 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
14009 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
14010 /*consume_paren=*/true);
14011 return error_mark_node
;
14014 expr
= finish_decltype_type (expr
, id_expression_or_member_access_p
,
14015 tf_warning_or_error
);
14018 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14020 start_token
->type
= CPP_DECLTYPE
;
14021 start_token
->u
.tree_check_value
= ggc_cleared_alloc
<struct tree_check
> ();
14022 start_token
->u
.tree_check_value
->value
= expr
;
14023 start_token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
14024 start_token
->keyword
= RID_MAX
;
14025 cp_lexer_purge_tokens_after (parser
->lexer
, start_token
);
14030 /* Special member functions [gram.special] */
14032 /* Parse a conversion-function-id.
14034 conversion-function-id:
14035 operator conversion-type-id
14037 Returns an IDENTIFIER_NODE representing the operator. */
14040 cp_parser_conversion_function_id (cp_parser
* parser
)
14044 tree saved_qualifying_scope
;
14045 tree saved_object_scope
;
14046 tree pushed_scope
= NULL_TREE
;
14048 /* Look for the `operator' token. */
14049 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
14050 return error_mark_node
;
14051 /* When we parse the conversion-type-id, the current scope will be
14052 reset. However, we need that information in able to look up the
14053 conversion function later, so we save it here. */
14054 saved_scope
= parser
->scope
;
14055 saved_qualifying_scope
= parser
->qualifying_scope
;
14056 saved_object_scope
= parser
->object_scope
;
14057 /* We must enter the scope of the class so that the names of
14058 entities declared within the class are available in the
14059 conversion-type-id. For example, consider:
14066 S::operator I() { ... }
14068 In order to see that `I' is a type-name in the definition, we
14069 must be in the scope of `S'. */
14071 pushed_scope
= push_scope (saved_scope
);
14072 /* Parse the conversion-type-id. */
14073 type
= cp_parser_conversion_type_id (parser
);
14074 /* Leave the scope of the class, if any. */
14076 pop_scope (pushed_scope
);
14077 /* Restore the saved scope. */
14078 parser
->scope
= saved_scope
;
14079 parser
->qualifying_scope
= saved_qualifying_scope
;
14080 parser
->object_scope
= saved_object_scope
;
14081 /* If the TYPE is invalid, indicate failure. */
14082 if (type
== error_mark_node
)
14083 return error_mark_node
;
14084 return make_conv_op_name (type
);
14087 /* Parse a conversion-type-id:
14089 conversion-type-id:
14090 type-specifier-seq conversion-declarator [opt]
14092 Returns the TYPE specified. */
14095 cp_parser_conversion_type_id (cp_parser
* parser
)
14098 cp_decl_specifier_seq type_specifiers
;
14099 cp_declarator
*declarator
;
14100 tree type_specified
;
14101 const char *saved_message
;
14103 /* Parse the attributes. */
14104 attributes
= cp_parser_attributes_opt (parser
);
14106 saved_message
= parser
->type_definition_forbidden_message
;
14107 parser
->type_definition_forbidden_message
14108 = G_("types may not be defined in a conversion-type-id");
14110 /* Parse the type-specifiers. */
14111 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
14112 /*is_trailing_return=*/false,
14115 parser
->type_definition_forbidden_message
= saved_message
;
14117 /* If that didn't work, stop. */
14118 if (type_specifiers
.type
== error_mark_node
)
14119 return error_mark_node
;
14120 /* Parse the conversion-declarator. */
14121 declarator
= cp_parser_conversion_declarator_opt (parser
);
14123 type_specified
= grokdeclarator (declarator
, &type_specifiers
, TYPENAME
,
14124 /*initialized=*/0, &attributes
);
14126 cplus_decl_attributes (&type_specified
, attributes
, /*flags=*/0);
14128 /* Don't give this error when parsing tentatively. This happens to
14129 work because we always parse this definitively once. */
14130 if (! cp_parser_uncommitted_to_tentative_parse_p (parser
)
14131 && type_uses_auto (type_specified
))
14133 if (cxx_dialect
< cxx14
)
14135 error ("invalid use of %<auto%> in conversion operator");
14136 return error_mark_node
;
14138 else if (template_parm_scope_p ())
14139 warning (0, "use of %<auto%> in member template "
14140 "conversion operator can never be deduced");
14143 return type_specified
;
14146 /* Parse an (optional) conversion-declarator.
14148 conversion-declarator:
14149 ptr-operator conversion-declarator [opt]
14153 static cp_declarator
*
14154 cp_parser_conversion_declarator_opt (cp_parser
* parser
)
14156 enum tree_code code
;
14157 tree class_type
, std_attributes
= NULL_TREE
;
14158 cp_cv_quals cv_quals
;
14160 /* We don't know if there's a ptr-operator next, or not. */
14161 cp_parser_parse_tentatively (parser
);
14162 /* Try the ptr-operator. */
14163 code
= cp_parser_ptr_operator (parser
, &class_type
, &cv_quals
,
14165 /* If it worked, look for more conversion-declarators. */
14166 if (cp_parser_parse_definitely (parser
))
14168 cp_declarator
*declarator
;
14170 /* Parse another optional declarator. */
14171 declarator
= cp_parser_conversion_declarator_opt (parser
);
14173 declarator
= cp_parser_make_indirect_declarator
14174 (code
, class_type
, cv_quals
, declarator
, std_attributes
);
14182 /* Parse an (optional) ctor-initializer.
14185 : mem-initializer-list
14187 Returns TRUE iff the ctor-initializer was actually present. */
14190 cp_parser_ctor_initializer_opt (cp_parser
* parser
)
14192 /* If the next token is not a `:', then there is no
14193 ctor-initializer. */
14194 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
14196 /* Do default initialization of any bases and members. */
14197 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14198 finish_mem_initializers (NULL_TREE
);
14203 /* Consume the `:' token. */
14204 cp_lexer_consume_token (parser
->lexer
);
14205 /* And the mem-initializer-list. */
14206 cp_parser_mem_initializer_list (parser
);
14211 /* Parse a mem-initializer-list.
14213 mem-initializer-list:
14214 mem-initializer ... [opt]
14215 mem-initializer ... [opt] , mem-initializer-list */
14218 cp_parser_mem_initializer_list (cp_parser
* parser
)
14220 tree mem_initializer_list
= NULL_TREE
;
14221 tree target_ctor
= error_mark_node
;
14222 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
14224 /* Let the semantic analysis code know that we are starting the
14225 mem-initializer-list. */
14226 if (!DECL_CONSTRUCTOR_P (current_function_decl
))
14227 error_at (token
->location
,
14228 "only constructors take member initializers");
14230 /* Loop through the list. */
14233 tree mem_initializer
;
14235 token
= cp_lexer_peek_token (parser
->lexer
);
14236 /* Parse the mem-initializer. */
14237 mem_initializer
= cp_parser_mem_initializer (parser
);
14238 /* If the next token is a `...', we're expanding member initializers. */
14239 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
14241 /* Consume the `...'. */
14242 cp_lexer_consume_token (parser
->lexer
);
14244 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14245 can be expanded but members cannot. */
14246 if (mem_initializer
!= error_mark_node
14247 && !TYPE_P (TREE_PURPOSE (mem_initializer
)))
14249 error_at (token
->location
,
14250 "cannot expand initializer for member %qD",
14251 TREE_PURPOSE (mem_initializer
));
14252 mem_initializer
= error_mark_node
;
14255 /* Construct the pack expansion type. */
14256 if (mem_initializer
!= error_mark_node
)
14257 mem_initializer
= make_pack_expansion (mem_initializer
);
14259 if (target_ctor
!= error_mark_node
14260 && mem_initializer
!= error_mark_node
)
14262 error ("mem-initializer for %qD follows constructor delegation",
14263 TREE_PURPOSE (mem_initializer
));
14264 mem_initializer
= error_mark_node
;
14266 /* Look for a target constructor. */
14267 if (mem_initializer
!= error_mark_node
14268 && CLASS_TYPE_P (TREE_PURPOSE (mem_initializer
))
14269 && same_type_p (TREE_PURPOSE (mem_initializer
), current_class_type
))
14271 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
14272 if (mem_initializer_list
)
14274 error ("constructor delegation follows mem-initializer for %qD",
14275 TREE_PURPOSE (mem_initializer_list
));
14276 mem_initializer
= error_mark_node
;
14278 target_ctor
= mem_initializer
;
14280 /* Add it to the list, unless it was erroneous. */
14281 if (mem_initializer
!= error_mark_node
)
14283 TREE_CHAIN (mem_initializer
) = mem_initializer_list
;
14284 mem_initializer_list
= mem_initializer
;
14286 /* If the next token is not a `,', we're done. */
14287 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14289 /* Consume the `,' token. */
14290 cp_lexer_consume_token (parser
->lexer
);
14293 /* Perform semantic analysis. */
14294 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14295 finish_mem_initializers (mem_initializer_list
);
14298 /* Parse a mem-initializer.
14301 mem-initializer-id ( expression-list [opt] )
14302 mem-initializer-id braced-init-list
14307 ( expression-list [opt] )
14309 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14310 class) or FIELD_DECL (for a non-static data member) to initialize;
14311 the TREE_VALUE is the expression-list. An empty initialization
14312 list is represented by void_list_node. */
14315 cp_parser_mem_initializer (cp_parser
* parser
)
14317 tree mem_initializer_id
;
14318 tree expression_list
;
14320 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
14322 /* Find out what is being initialized. */
14323 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
14325 permerror (token
->location
,
14326 "anachronistic old-style base class initializer");
14327 mem_initializer_id
= NULL_TREE
;
14331 mem_initializer_id
= cp_parser_mem_initializer_id (parser
);
14332 if (mem_initializer_id
== error_mark_node
)
14333 return mem_initializer_id
;
14335 member
= expand_member_init (mem_initializer_id
);
14336 if (member
&& !DECL_P (member
))
14337 in_base_initializer
= 1;
14339 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
14341 bool expr_non_constant_p
;
14342 cp_lexer_set_source_position (parser
->lexer
);
14343 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
14344 expression_list
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
14345 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
14346 expression_list
= build_tree_list (NULL_TREE
, expression_list
);
14350 vec
<tree
, va_gc
> *vec
;
14351 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
14353 /*allow_expansion_p=*/true,
14354 /*non_constant_p=*/NULL
);
14356 return error_mark_node
;
14357 expression_list
= build_tree_list_vec (vec
);
14358 release_tree_vector (vec
);
14361 if (expression_list
== error_mark_node
)
14362 return error_mark_node
;
14363 if (!expression_list
)
14364 expression_list
= void_type_node
;
14366 in_base_initializer
= 0;
14368 return member
? build_tree_list (member
, expression_list
) : error_mark_node
;
14371 /* Parse a mem-initializer-id.
14373 mem-initializer-id:
14374 :: [opt] nested-name-specifier [opt] class-name
14375 decltype-specifier (C++11)
14378 Returns a TYPE indicating the class to be initialized for the first
14379 production (and the second in C++11). Returns an IDENTIFIER_NODE
14380 indicating the data member to be initialized for the last production. */
14383 cp_parser_mem_initializer_id (cp_parser
* parser
)
14385 bool global_scope_p
;
14386 bool nested_name_specifier_p
;
14387 bool template_p
= false;
14390 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
14392 /* `typename' is not allowed in this context ([temp.res]). */
14393 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
14395 error_at (token
->location
,
14396 "keyword %<typename%> not allowed in this context (a qualified "
14397 "member initializer is implicitly a type)");
14398 cp_lexer_consume_token (parser
->lexer
);
14400 /* Look for the optional `::' operator. */
14402 = (cp_parser_global_scope_opt (parser
,
14403 /*current_scope_valid_p=*/false)
14405 /* Look for the optional nested-name-specifier. The simplest way to
14410 The keyword `typename' is not permitted in a base-specifier or
14411 mem-initializer; in these contexts a qualified name that
14412 depends on a template-parameter is implicitly assumed to be a
14415 is to assume that we have seen the `typename' keyword at this
14417 nested_name_specifier_p
14418 = (cp_parser_nested_name_specifier_opt (parser
,
14419 /*typename_keyword_p=*/true,
14420 /*check_dependency_p=*/true,
14422 /*is_declaration=*/true)
14424 if (nested_name_specifier_p
)
14425 template_p
= cp_parser_optional_template_keyword (parser
);
14426 /* If there is a `::' operator or a nested-name-specifier, then we
14427 are definitely looking for a class-name. */
14428 if (global_scope_p
|| nested_name_specifier_p
)
14429 return cp_parser_class_name (parser
,
14430 /*typename_keyword_p=*/true,
14431 /*template_keyword_p=*/template_p
,
14433 /*check_dependency_p=*/true,
14434 /*class_head_p=*/false,
14435 /*is_declaration=*/true);
14436 /* Otherwise, we could also be looking for an ordinary identifier. */
14437 cp_parser_parse_tentatively (parser
);
14438 if (cp_lexer_next_token_is_decltype (parser
->lexer
))
14439 /* Try a decltype-specifier. */
14440 id
= cp_parser_decltype (parser
);
14442 /* Otherwise, try a class-name. */
14443 id
= cp_parser_class_name (parser
,
14444 /*typename_keyword_p=*/true,
14445 /*template_keyword_p=*/false,
14447 /*check_dependency_p=*/true,
14448 /*class_head_p=*/false,
14449 /*is_declaration=*/true);
14450 /* If we found one, we're done. */
14451 if (cp_parser_parse_definitely (parser
))
14453 /* Otherwise, look for an ordinary identifier. */
14454 return cp_parser_identifier (parser
);
14457 /* Overloading [gram.over] */
14459 /* Parse an operator-function-id.
14461 operator-function-id:
14464 Returns an IDENTIFIER_NODE for the operator which is a
14465 human-readable spelling of the identifier, e.g., `operator +'. */
14468 cp_parser_operator_function_id (cp_parser
* parser
)
14470 /* Look for the `operator' keyword. */
14471 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
14472 return error_mark_node
;
14473 /* And then the name of the operator itself. */
14474 return cp_parser_operator (parser
);
14477 /* Return an identifier node for a user-defined literal operator.
14478 The suffix identifier is chained to the operator name identifier. */
14481 cp_literal_operator_id (const char* name
)
14484 char *buffer
= XNEWVEC (char, strlen (UDLIT_OP_ANSI_PREFIX
)
14485 + strlen (name
) + 10);
14486 sprintf (buffer
, UDLIT_OP_ANSI_FORMAT
, name
);
14487 identifier
= get_identifier (buffer
);
14492 /* Parse an operator.
14495 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14496 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14497 || ++ -- , ->* -> () []
14504 Returns an IDENTIFIER_NODE for the operator which is a
14505 human-readable spelling of the identifier, e.g., `operator +'. */
14508 cp_parser_operator (cp_parser
* parser
)
14510 tree id
= NULL_TREE
;
14514 /* Peek at the next token. */
14515 token
= cp_lexer_peek_token (parser
->lexer
);
14517 location_t start_loc
= token
->location
;
14519 /* Figure out which operator we have. */
14520 switch (token
->type
)
14526 /* The keyword should be either `new' or `delete'. */
14527 if (token
->keyword
== RID_NEW
)
14529 else if (token
->keyword
== RID_DELETE
)
14534 /* Consume the `new' or `delete' token. */
14535 location_t end_loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
14537 /* Peek at the next token. */
14538 token
= cp_lexer_peek_token (parser
->lexer
);
14539 /* If it's a `[' token then this is the array variant of the
14541 if (token
->type
== CPP_OPEN_SQUARE
)
14543 /* Consume the `[' token. */
14544 cp_lexer_consume_token (parser
->lexer
);
14545 /* Look for the `]' token. */
14546 if (cp_token
*close_token
14547 = cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
14548 end_loc
= close_token
->location
;
14549 id
= cp_operator_id (op
== NEW_EXPR
14550 ? VEC_NEW_EXPR
: VEC_DELETE_EXPR
);
14552 /* Otherwise, we have the non-array variant. */
14554 id
= cp_operator_id (op
);
14556 location_t loc
= make_location (start_loc
, start_loc
, end_loc
);
14558 return cp_expr (id
, loc
);
14562 id
= cp_operator_id (PLUS_EXPR
);
14566 id
= cp_operator_id (MINUS_EXPR
);
14570 id
= cp_operator_id (MULT_EXPR
);
14574 id
= cp_operator_id (TRUNC_DIV_EXPR
);
14578 id
= cp_operator_id (TRUNC_MOD_EXPR
);
14582 id
= cp_operator_id (BIT_XOR_EXPR
);
14586 id
= cp_operator_id (BIT_AND_EXPR
);
14590 id
= cp_operator_id (BIT_IOR_EXPR
);
14594 id
= cp_operator_id (BIT_NOT_EXPR
);
14598 id
= cp_operator_id (TRUTH_NOT_EXPR
);
14602 id
= cp_assignment_operator_id (NOP_EXPR
);
14606 id
= cp_operator_id (LT_EXPR
);
14610 id
= cp_operator_id (GT_EXPR
);
14614 id
= cp_assignment_operator_id (PLUS_EXPR
);
14618 id
= cp_assignment_operator_id (MINUS_EXPR
);
14622 id
= cp_assignment_operator_id (MULT_EXPR
);
14626 id
= cp_assignment_operator_id (TRUNC_DIV_EXPR
);
14630 id
= cp_assignment_operator_id (TRUNC_MOD_EXPR
);
14634 id
= cp_assignment_operator_id (BIT_XOR_EXPR
);
14638 id
= cp_assignment_operator_id (BIT_AND_EXPR
);
14642 id
= cp_assignment_operator_id (BIT_IOR_EXPR
);
14646 id
= cp_operator_id (LSHIFT_EXPR
);
14650 id
= cp_operator_id (RSHIFT_EXPR
);
14653 case CPP_LSHIFT_EQ
:
14654 id
= cp_assignment_operator_id (LSHIFT_EXPR
);
14657 case CPP_RSHIFT_EQ
:
14658 id
= cp_assignment_operator_id (RSHIFT_EXPR
);
14662 id
= cp_operator_id (EQ_EXPR
);
14666 id
= cp_operator_id (NE_EXPR
);
14670 id
= cp_operator_id (LE_EXPR
);
14673 case CPP_GREATER_EQ
:
14674 id
= cp_operator_id (GE_EXPR
);
14678 id
= cp_operator_id (TRUTH_ANDIF_EXPR
);
14682 id
= cp_operator_id (TRUTH_ORIF_EXPR
);
14685 case CPP_PLUS_PLUS
:
14686 id
= cp_operator_id (POSTINCREMENT_EXPR
);
14689 case CPP_MINUS_MINUS
:
14690 id
= cp_operator_id (PREDECREMENT_EXPR
);
14694 id
= cp_operator_id (COMPOUND_EXPR
);
14697 case CPP_DEREF_STAR
:
14698 id
= cp_operator_id (MEMBER_REF
);
14702 id
= cp_operator_id (COMPONENT_REF
);
14705 case CPP_OPEN_PAREN
:
14706 /* Consume the `('. */
14707 cp_lexer_consume_token (parser
->lexer
);
14708 /* Look for the matching `)'. */
14709 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
14710 return cp_operator_id (CALL_EXPR
);
14712 case CPP_OPEN_SQUARE
:
14713 /* Consume the `['. */
14714 cp_lexer_consume_token (parser
->lexer
);
14715 /* Look for the matching `]'. */
14716 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
14717 return cp_operator_id (ARRAY_REF
);
14719 case CPP_UTF8STRING
:
14720 case CPP_UTF8STRING_USERDEF
:
14727 case CPP_STRING_USERDEF
:
14728 case CPP_WSTRING_USERDEF
:
14729 case CPP_STRING16_USERDEF
:
14730 case CPP_STRING32_USERDEF
:
14732 tree str
, string_tree
;
14735 if (cxx_dialect
== cxx98
)
14736 maybe_warn_cpp0x (CPP0X_USER_DEFINED_LITERALS
);
14738 /* Consume the string. */
14739 str
= cp_parser_string_literal (parser
, /*translate=*/true,
14740 /*wide_ok=*/true, /*lookup_udlit=*/false);
14741 if (str
== error_mark_node
)
14742 return error_mark_node
;
14743 else if (TREE_CODE (str
) == USERDEF_LITERAL
)
14745 string_tree
= USERDEF_LITERAL_VALUE (str
);
14746 id
= USERDEF_LITERAL_SUFFIX_ID (str
);
14751 /* Look for the suffix identifier. */
14752 token
= cp_lexer_peek_token (parser
->lexer
);
14753 if (token
->type
== CPP_NAME
)
14754 id
= cp_parser_identifier (parser
);
14755 else if (token
->type
== CPP_KEYWORD
)
14757 error ("unexpected keyword;"
14758 " remove space between quotes and suffix identifier");
14759 return error_mark_node
;
14763 error ("expected suffix identifier");
14764 return error_mark_node
;
14767 sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
14768 (TREE_TYPE (TREE_TYPE (string_tree
))));
14769 len
= TREE_STRING_LENGTH (string_tree
) / sz
- 1;
14772 error ("expected empty string after %<operator%> keyword");
14773 return error_mark_node
;
14775 if (utf8
|| TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (string_tree
)))
14778 error ("invalid encoding prefix in literal operator");
14779 return error_mark_node
;
14781 if (id
!= error_mark_node
)
14783 const char *name
= IDENTIFIER_POINTER (id
);
14784 id
= cp_literal_operator_id (name
);
14790 /* Anything else is an error. */
14794 /* If we have selected an identifier, we need to consume the
14797 cp_lexer_consume_token (parser
->lexer
);
14798 /* Otherwise, no valid operator name was present. */
14801 cp_parser_error (parser
, "expected operator");
14802 id
= error_mark_node
;
14805 return cp_expr (id
, start_loc
);
14808 /* Parse a template-declaration.
14810 template-declaration:
14811 export [opt] template < template-parameter-list > declaration
14813 If MEMBER_P is TRUE, this template-declaration occurs within a
14816 The grammar rule given by the standard isn't correct. What
14817 is really meant is:
14819 template-declaration:
14820 export [opt] template-parameter-list-seq
14821 decl-specifier-seq [opt] init-declarator [opt] ;
14822 export [opt] template-parameter-list-seq
14823 function-definition
14825 template-parameter-list-seq:
14826 template-parameter-list-seq [opt]
14827 template < template-parameter-list >
14829 Concept Extensions:
14831 template-parameter-list-seq:
14832 template < template-parameter-list > requires-clause [opt]
14835 requires logical-or-expression */
14838 cp_parser_template_declaration (cp_parser
* parser
, bool member_p
)
14840 /* Check for `export'. */
14841 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXPORT
))
14843 /* Consume the `export' token. */
14844 cp_lexer_consume_token (parser
->lexer
);
14845 /* Warn that we do not support `export'. */
14846 warning (0, "keyword %<export%> not implemented, and will be ignored");
14849 cp_parser_template_declaration_after_export (parser
, member_p
);
14852 /* Parse a template-parameter-list.
14854 template-parameter-list:
14856 template-parameter-list , template-parameter
14858 Returns a TREE_LIST. Each node represents a template parameter.
14859 The nodes are connected via their TREE_CHAINs. */
14862 cp_parser_template_parameter_list (cp_parser
* parser
)
14864 tree parameter_list
= NULL_TREE
;
14866 begin_template_parm_list ();
14868 /* The loop below parses the template parms. We first need to know
14869 the total number of template parms to be able to compute proper
14870 canonical types of each dependent type. So after the loop, when
14871 we know the total number of template parms,
14872 end_template_parm_list computes the proper canonical types and
14873 fixes up the dependent types accordingly. */
14878 bool is_parameter_pack
;
14879 location_t parm_loc
;
14881 /* Parse the template-parameter. */
14882 parm_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
14883 parameter
= cp_parser_template_parameter (parser
,
14885 &is_parameter_pack
);
14886 /* Add it to the list. */
14887 if (parameter
!= error_mark_node
)
14888 parameter_list
= process_template_parm (parameter_list
,
14892 is_parameter_pack
);
14895 tree err_parm
= build_tree_list (parameter
, parameter
);
14896 parameter_list
= chainon (parameter_list
, err_parm
);
14899 /* If the next token is not a `,', we're done. */
14900 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14902 /* Otherwise, consume the `,' token. */
14903 cp_lexer_consume_token (parser
->lexer
);
14906 return end_template_parm_list (parameter_list
);
14909 /* Parse a introduction-list.
14912 introduced-parameter
14913 introduction-list , introduced-parameter
14915 introduced-parameter:
14916 ...[opt] identifier
14918 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14919 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14920 WILDCARD_DECL will also have DECL_NAME set and token location in
14921 DECL_SOURCE_LOCATION. */
14924 cp_parser_introduction_list (cp_parser
*parser
)
14926 vec
<tree
, va_gc
> *introduction_vec
= make_tree_vector ();
14930 bool is_pack
= cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
);
14932 cp_lexer_consume_token (parser
->lexer
);
14934 /* Build placeholder. */
14935 tree parm
= build_nt (WILDCARD_DECL
);
14936 DECL_SOURCE_LOCATION (parm
)
14937 = cp_lexer_peek_token (parser
->lexer
)->location
;
14938 DECL_NAME (parm
) = cp_parser_identifier (parser
);
14939 WILDCARD_PACK_P (parm
) = is_pack
;
14940 vec_safe_push (introduction_vec
, parm
);
14942 /* If the next token is not a `,', we're done. */
14943 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14945 /* Otherwise, consume the `,' token. */
14946 cp_lexer_consume_token (parser
->lexer
);
14949 /* Convert the vec into a TREE_VEC. */
14950 tree introduction_list
= make_tree_vec (introduction_vec
->length ());
14953 FOR_EACH_VEC_ELT (*introduction_vec
, n
, parm
)
14954 TREE_VEC_ELT (introduction_list
, n
) = parm
;
14956 release_tree_vector (introduction_vec
);
14957 return introduction_list
;
14960 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14961 is an abstract declarator. */
14963 static inline cp_declarator
*
14964 get_id_declarator (cp_declarator
*declarator
)
14966 cp_declarator
*d
= declarator
;
14967 while (d
&& d
->kind
!= cdk_id
)
14972 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14973 is an abstract declarator. */
14976 get_unqualified_id (cp_declarator
*declarator
)
14978 declarator
= get_id_declarator (declarator
);
14980 return declarator
->u
.id
.unqualified_name
;
14985 /* Returns true if DECL represents a constrained-parameter. */
14988 is_constrained_parameter (tree decl
)
14991 && TREE_CODE (decl
) == TYPE_DECL
14992 && CONSTRAINED_PARM_CONCEPT (decl
)
14993 && DECL_P (CONSTRAINED_PARM_CONCEPT (decl
)));
14996 /* Returns true if PARM declares a constrained-parameter. */
14999 is_constrained_parameter (cp_parameter_declarator
*parm
)
15001 return is_constrained_parameter (parm
->decl_specifiers
.type
);
15004 /* Check that the type parameter is only a declarator-id, and that its
15005 type is not cv-qualified. */
15008 cp_parser_check_constrained_type_parm (cp_parser
*parser
,
15009 cp_parameter_declarator
*parm
)
15011 if (!parm
->declarator
)
15014 if (parm
->declarator
->kind
!= cdk_id
)
15016 cp_parser_error (parser
, "invalid constrained type parameter");
15020 /* Don't allow cv-qualified type parameters. */
15021 if (decl_spec_seq_has_spec_p (&parm
->decl_specifiers
, ds_const
)
15022 || decl_spec_seq_has_spec_p (&parm
->decl_specifiers
, ds_volatile
))
15024 cp_parser_error (parser
, "cv-qualified type parameter");
15031 /* Finish parsing/processing a template type parameter and checking
15032 various restrictions. */
15035 cp_parser_constrained_type_template_parm (cp_parser
*parser
,
15037 cp_parameter_declarator
* parmdecl
)
15039 if (cp_parser_check_constrained_type_parm (parser
, parmdecl
))
15040 return finish_template_type_parm (class_type_node
, id
);
15042 return error_mark_node
;
15046 finish_constrained_template_template_parm (tree proto
, tree id
)
15048 /* FIXME: This should probably be copied, and we may need to adjust
15049 the template parameter depths. */
15050 tree saved_parms
= current_template_parms
;
15051 begin_template_parm_list ();
15052 current_template_parms
= DECL_TEMPLATE_PARMS (proto
);
15053 end_template_parm_list ();
15055 tree parm
= finish_template_template_parm (class_type_node
, id
);
15056 current_template_parms
= saved_parms
;
15061 /* Finish parsing/processing a template template parameter by borrowing
15062 the template parameter list from the prototype parameter. */
15065 cp_parser_constrained_template_template_parm (cp_parser
*parser
,
15068 cp_parameter_declarator
*parmdecl
)
15070 if (!cp_parser_check_constrained_type_parm (parser
, parmdecl
))
15071 return error_mark_node
;
15072 return finish_constrained_template_template_parm (proto
, id
);
15075 /* Create a new non-type template parameter from the given PARM
15079 constrained_non_type_template_parm (bool *is_non_type
,
15080 cp_parameter_declarator
*parm
)
15082 *is_non_type
= true;
15083 cp_declarator
*decl
= parm
->declarator
;
15084 cp_decl_specifier_seq
*specs
= &parm
->decl_specifiers
;
15085 specs
->type
= TREE_TYPE (DECL_INITIAL (specs
->type
));
15086 return grokdeclarator (decl
, specs
, TPARM
, 0, NULL
);
15089 /* Build a constrained template parameter based on the PARMDECL
15090 declarator. The type of PARMDECL is the constrained type, which
15091 refers to the prototype template parameter that ultimately
15092 specifies the type of the declared parameter. */
15095 finish_constrained_parameter (cp_parser
*parser
,
15096 cp_parameter_declarator
*parmdecl
,
15098 bool *is_parameter_pack
)
15100 tree decl
= parmdecl
->decl_specifiers
.type
;
15101 tree id
= get_unqualified_id (parmdecl
->declarator
);
15102 tree def
= parmdecl
->default_argument
;
15103 tree proto
= DECL_INITIAL (decl
);
15105 /* A template parameter constrained by a variadic concept shall also
15106 be declared as a template parameter pack. */
15107 bool is_variadic
= template_parameter_pack_p (proto
);
15108 if (is_variadic
&& !*is_parameter_pack
)
15109 cp_parser_error (parser
, "variadic constraint introduced without %<...%>");
15111 /* Build the parameter. Return an error if the declarator was invalid. */
15113 if (TREE_CODE (proto
) == TYPE_DECL
)
15114 parm
= cp_parser_constrained_type_template_parm (parser
, id
, parmdecl
);
15115 else if (TREE_CODE (proto
) == TEMPLATE_DECL
)
15116 parm
= cp_parser_constrained_template_template_parm (parser
, proto
, id
,
15119 parm
= constrained_non_type_template_parm (is_non_type
, parmdecl
);
15120 if (parm
== error_mark_node
)
15121 return error_mark_node
;
15123 /* Finish the parameter decl and create a node attaching the
15124 default argument and constraint. */
15125 parm
= build_tree_list (def
, parm
);
15126 TEMPLATE_PARM_CONSTRAINTS (parm
) = decl
;
15131 /* Returns true if the parsed type actually represents the declaration
15132 of a type template-parameter. */
15135 declares_constrained_type_template_parameter (tree type
)
15137 return (is_constrained_parameter (type
)
15138 && TREE_CODE (TREE_TYPE (type
)) == TEMPLATE_TYPE_PARM
);
15142 /* Returns true if the parsed type actually represents the declaration of
15143 a template template-parameter. */
15146 declares_constrained_template_template_parameter (tree type
)
15148 return (is_constrained_parameter (type
)
15149 && TREE_CODE (TREE_TYPE (type
)) == TEMPLATE_TEMPLATE_PARM
);
15152 /* Parse a default argument for a type template-parameter.
15153 Note that diagnostics are handled in cp_parser_template_parameter. */
15156 cp_parser_default_type_template_argument (cp_parser
*parser
)
15158 gcc_assert (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
));
15160 /* Consume the `=' token. */
15161 cp_lexer_consume_token (parser
->lexer
);
15163 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15165 /* Parse the default-argument. */
15166 push_deferring_access_checks (dk_no_deferred
);
15167 tree default_argument
= cp_parser_type_id (parser
);
15168 pop_deferring_access_checks ();
15170 if (flag_concepts
&& type_uses_auto (default_argument
))
15172 error_at (token
->location
,
15173 "invalid use of %<auto%> in default template argument");
15174 return error_mark_node
;
15177 return default_argument
;
15180 /* Parse a default argument for a template template-parameter. */
15183 cp_parser_default_template_template_argument (cp_parser
*parser
)
15185 gcc_assert (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
));
15189 /* Consume the `='. */
15190 cp_lexer_consume_token (parser
->lexer
);
15191 /* Parse the id-expression. */
15192 push_deferring_access_checks (dk_no_deferred
);
15193 /* save token before parsing the id-expression, for error
15195 const cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
15196 tree default_argument
15197 = cp_parser_id_expression (parser
,
15198 /*template_keyword_p=*/false,
15199 /*check_dependency_p=*/true,
15200 /*template_p=*/&is_template
,
15201 /*declarator_p=*/false,
15202 /*optional_p=*/false);
15203 if (TREE_CODE (default_argument
) == TYPE_DECL
)
15204 /* If the id-expression was a template-id that refers to
15205 a template-class, we already have the declaration here,
15206 so no further lookup is needed. */
15209 /* Look up the name. */
15211 = cp_parser_lookup_name (parser
, default_argument
,
15213 /*is_template=*/is_template
,
15214 /*is_namespace=*/false,
15215 /*check_dependency=*/true,
15216 /*ambiguous_decls=*/NULL
,
15218 /* See if the default argument is valid. */
15219 default_argument
= check_template_template_default_arg (default_argument
);
15220 pop_deferring_access_checks ();
15221 return default_argument
;
15224 /* Parse a template-parameter.
15226 template-parameter:
15228 parameter-declaration
15230 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15231 the parameter. The TREE_PURPOSE is the default value, if any.
15232 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15233 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15234 set to true iff this parameter is a parameter pack. */
15237 cp_parser_template_parameter (cp_parser
* parser
, bool *is_non_type
,
15238 bool *is_parameter_pack
)
15241 cp_parameter_declarator
*parameter_declarator
;
15244 /* Assume it is a type parameter or a template parameter. */
15245 *is_non_type
= false;
15246 /* Assume it not a parameter pack. */
15247 *is_parameter_pack
= false;
15248 /* Peek at the next token. */
15249 token
= cp_lexer_peek_token (parser
->lexer
);
15250 /* If it is `template', we have a type-parameter. */
15251 if (token
->keyword
== RID_TEMPLATE
)
15252 return cp_parser_type_parameter (parser
, is_parameter_pack
);
15253 /* If it is `class' or `typename' we do not know yet whether it is a
15254 type parameter or a non-type parameter. Consider:
15256 template <typename T, typename T::X X> ...
15260 template <class C, class D*> ...
15262 Here, the first parameter is a type parameter, and the second is
15263 a non-type parameter. We can tell by looking at the token after
15264 the identifier -- if it is a `,', `=', or `>' then we have a type
15266 if (token
->keyword
== RID_TYPENAME
|| token
->keyword
== RID_CLASS
)
15268 /* Peek at the token after `class' or `typename'. */
15269 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
15270 /* If it's an ellipsis, we have a template type parameter
15272 if (token
->type
== CPP_ELLIPSIS
)
15273 return cp_parser_type_parameter (parser
, is_parameter_pack
);
15274 /* If it's an identifier, skip it. */
15275 if (token
->type
== CPP_NAME
)
15276 token
= cp_lexer_peek_nth_token (parser
->lexer
, 3);
15277 /* Now, see if the token looks like the end of a template
15279 if (token
->type
== CPP_COMMA
15280 || token
->type
== CPP_EQ
15281 || token
->type
== CPP_GREATER
)
15282 return cp_parser_type_parameter (parser
, is_parameter_pack
);
15285 /* Otherwise, it is a non-type parameter or a constrained parameter.
15289 When parsing a default template-argument for a non-type
15290 template-parameter, the first non-nested `>' is taken as the end
15291 of the template parameter-list rather than a greater-than
15293 parameter_declarator
15294 = cp_parser_parameter_declaration (parser
, /*template_parm_p=*/true,
15295 /*parenthesized_p=*/NULL
);
15297 if (!parameter_declarator
)
15298 return error_mark_node
;
15300 /* If the parameter declaration is marked as a parameter pack, set
15301 *IS_PARAMETER_PACK to notify the caller. */
15302 if (parameter_declarator
->template_parameter_pack_p
)
15303 *is_parameter_pack
= true;
15305 if (parameter_declarator
->default_argument
)
15307 /* Can happen in some cases of erroneous input (c++/34892). */
15308 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
15309 /* Consume the `...' for better error recovery. */
15310 cp_lexer_consume_token (parser
->lexer
);
15313 // The parameter may have been constrained.
15314 if (is_constrained_parameter (parameter_declarator
))
15315 return finish_constrained_parameter (parser
,
15316 parameter_declarator
,
15318 is_parameter_pack
);
15320 // Now we're sure that the parameter is a non-type parameter.
15321 *is_non_type
= true;
15323 parm
= grokdeclarator (parameter_declarator
->declarator
,
15324 ¶meter_declarator
->decl_specifiers
,
15325 TPARM
, /*initialized=*/0,
15326 /*attrlist=*/NULL
);
15327 if (parm
== error_mark_node
)
15328 return error_mark_node
;
15330 return build_tree_list (parameter_declarator
->default_argument
, parm
);
15333 /* Parse a type-parameter.
15336 class identifier [opt]
15337 class identifier [opt] = type-id
15338 typename identifier [opt]
15339 typename identifier [opt] = type-id
15340 template < template-parameter-list > class identifier [opt]
15341 template < template-parameter-list > class identifier [opt]
15344 GNU Extension (variadic templates):
15347 class ... identifier [opt]
15348 typename ... identifier [opt]
15350 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15351 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15352 the declaration of the parameter.
15354 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15357 cp_parser_type_parameter (cp_parser
* parser
, bool *is_parameter_pack
)
15362 /* Look for a keyword to tell us what kind of parameter this is. */
15363 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_TYPENAME_TEMPLATE
);
15365 return error_mark_node
;
15367 switch (token
->keyword
)
15373 tree default_argument
;
15375 /* If the next token is an ellipsis, we have a template
15377 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
15379 /* Consume the `...' token. */
15380 cp_lexer_consume_token (parser
->lexer
);
15381 maybe_warn_variadic_templates ();
15383 *is_parameter_pack
= true;
15386 /* If the next token is an identifier, then it names the
15388 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
15389 identifier
= cp_parser_identifier (parser
);
15391 identifier
= NULL_TREE
;
15393 /* Create the parameter. */
15394 parameter
= finish_template_type_parm (class_type_node
, identifier
);
15396 /* If the next token is an `=', we have a default argument. */
15397 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
15400 = cp_parser_default_type_template_argument (parser
);
15402 /* Template parameter packs cannot have default
15404 if (*is_parameter_pack
)
15407 error_at (token
->location
,
15408 "template parameter pack %qD cannot have a "
15409 "default argument", identifier
);
15411 error_at (token
->location
,
15412 "template parameter packs cannot have "
15413 "default arguments");
15414 default_argument
= NULL_TREE
;
15416 else if (check_for_bare_parameter_packs (default_argument
))
15417 default_argument
= error_mark_node
;
15420 default_argument
= NULL_TREE
;
15422 /* Create the combined representation of the parameter and the
15423 default argument. */
15424 parameter
= build_tree_list (default_argument
, parameter
);
15431 tree default_argument
;
15433 /* Look for the `<'. */
15434 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
15435 /* Parse the template-parameter-list. */
15436 cp_parser_template_parameter_list (parser
);
15437 /* Look for the `>'. */
15438 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
15440 // If template requirements are present, parse them.
15443 tree reqs
= get_shorthand_constraints (current_template_parms
);
15444 if (tree r
= cp_parser_requires_clause_opt (parser
))
15445 reqs
= conjoin_constraints (reqs
, normalize_expression (r
));
15446 TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
) = reqs
;
15449 /* Look for the `class' or 'typename' keywords. */
15450 cp_parser_type_parameter_key (parser
);
15451 /* If the next token is an ellipsis, we have a template
15453 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
15455 /* Consume the `...' token. */
15456 cp_lexer_consume_token (parser
->lexer
);
15457 maybe_warn_variadic_templates ();
15459 *is_parameter_pack
= true;
15461 /* If the next token is an `=', then there is a
15462 default-argument. If the next token is a `>', we are at
15463 the end of the parameter-list. If the next token is a `,',
15464 then we are at the end of this parameter. */
15465 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
15466 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_GREATER
)
15467 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
15469 identifier
= cp_parser_identifier (parser
);
15470 /* Treat invalid names as if the parameter were nameless. */
15471 if (identifier
== error_mark_node
)
15472 identifier
= NULL_TREE
;
15475 identifier
= NULL_TREE
;
15477 /* Create the template parameter. */
15478 parameter
= finish_template_template_parm (class_type_node
,
15481 /* If the next token is an `=', then there is a
15482 default-argument. */
15483 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
15486 = cp_parser_default_template_template_argument (parser
);
15488 /* Template parameter packs cannot have default
15490 if (*is_parameter_pack
)
15493 error_at (token
->location
,
15494 "template parameter pack %qD cannot "
15495 "have a default argument",
15498 error_at (token
->location
, "template parameter packs cannot "
15499 "have default arguments");
15500 default_argument
= NULL_TREE
;
15504 default_argument
= NULL_TREE
;
15506 /* Create the combined representation of the parameter and the
15507 default argument. */
15508 parameter
= build_tree_list (default_argument
, parameter
);
15513 gcc_unreachable ();
15520 /* Parse a template-id.
15523 template-name < template-argument-list [opt] >
15525 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15526 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15527 returned. Otherwise, if the template-name names a function, or set
15528 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15529 names a class, returns a TYPE_DECL for the specialization.
15531 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15532 uninstantiated templates. */
15535 cp_parser_template_id (cp_parser
*parser
,
15536 bool template_keyword_p
,
15537 bool check_dependency_p
,
15538 enum tag_types tag_type
,
15539 bool is_declaration
)
15544 cp_token_position start_of_id
= 0;
15545 cp_token
*next_token
= NULL
, *next_token_2
= NULL
;
15546 bool is_identifier
;
15548 /* If the next token corresponds to a template-id, there is no need
15550 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15551 if (token
->type
== CPP_TEMPLATE_ID
)
15553 cp_lexer_consume_token (parser
->lexer
);
15554 return saved_checks_value (token
->u
.tree_check_value
);
15557 /* Avoid performing name lookup if there is no possibility of
15558 finding a template-id. */
15559 if ((token
->type
!= CPP_NAME
&& token
->keyword
!= RID_OPERATOR
)
15560 || (token
->type
== CPP_NAME
15561 && !cp_parser_nth_token_starts_template_argument_list_p
15564 cp_parser_error (parser
, "expected template-id");
15565 return error_mark_node
;
15568 /* Remember where the template-id starts. */
15569 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
15570 start_of_id
= cp_lexer_token_position (parser
->lexer
, false);
15572 push_deferring_access_checks (dk_deferred
);
15574 /* Parse the template-name. */
15575 is_identifier
= false;
15576 templ
= cp_parser_template_name (parser
, template_keyword_p
,
15577 check_dependency_p
,
15581 if (templ
== error_mark_node
|| is_identifier
)
15583 pop_deferring_access_checks ();
15587 /* Since we're going to preserve any side-effects from this parse, set up a
15588 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15589 in the template arguments. */
15590 tentative_firewall
firewall (parser
);
15592 /* If we find the sequence `[:' after a template-name, it's probably
15593 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15594 parse correctly the argument list. */
15595 if (((next_token
= cp_lexer_peek_token (parser
->lexer
))->type
15596 == CPP_OPEN_SQUARE
)
15597 && next_token
->flags
& DIGRAPH
15598 && ((next_token_2
= cp_lexer_peek_nth_token (parser
->lexer
, 2))->type
15600 && !(next_token_2
->flags
& PREV_WHITE
))
15602 cp_parser_parse_tentatively (parser
);
15603 /* Change `:' into `::'. */
15604 next_token_2
->type
= CPP_SCOPE
;
15605 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15607 cp_lexer_consume_token (parser
->lexer
);
15609 /* Parse the arguments. */
15610 arguments
= cp_parser_enclosed_template_argument_list (parser
);
15611 if (!cp_parser_parse_definitely (parser
))
15613 /* If we couldn't parse an argument list, then we revert our changes
15614 and return simply an error. Maybe this is not a template-id
15616 next_token_2
->type
= CPP_COLON
;
15617 cp_parser_error (parser
, "expected %<<%>");
15618 pop_deferring_access_checks ();
15619 return error_mark_node
;
15621 /* Otherwise, emit an error about the invalid digraph, but continue
15622 parsing because we got our argument list. */
15623 if (permerror (next_token
->location
,
15624 "%<<::%> cannot begin a template-argument list"))
15626 static bool hint
= false;
15627 inform (next_token
->location
,
15628 "%<<:%> is an alternate spelling for %<[%>."
15629 " Insert whitespace between %<<%> and %<::%>");
15630 if (!hint
&& !flag_permissive
)
15632 inform (next_token
->location
, "(if you use %<-fpermissive%> "
15633 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15634 "accept your code)");
15641 /* Look for the `<' that starts the template-argument-list. */
15642 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
15644 pop_deferring_access_checks ();
15645 return error_mark_node
;
15647 /* Parse the arguments. */
15648 arguments
= cp_parser_enclosed_template_argument_list (parser
);
15651 /* Set the location to be of the form:
15652 template-name < template-argument-list [opt] >
15653 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15654 with caret == start at the start of the template-name,
15655 ranging until the closing '>'. */
15656 location_t finish_loc
15657 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
15658 location_t combined_loc
15659 = make_location (token
->location
, token
->location
, finish_loc
);
15661 /* Build a representation of the specialization. */
15662 if (identifier_p (templ
))
15663 template_id
= build_min_nt_loc (combined_loc
,
15666 else if (DECL_TYPE_TEMPLATE_P (templ
)
15667 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
15669 bool entering_scope
;
15670 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15671 template (rather than some instantiation thereof) only if
15672 is not nested within some other construct. For example, in
15673 "template <typename T> void f(T) { A<T>::", A<T> is just an
15674 instantiation of A. */
15675 entering_scope
= (template_parm_scope_p ()
15676 && cp_lexer_next_token_is (parser
->lexer
,
15679 = finish_template_type (templ
, arguments
, entering_scope
);
15681 /* A template-like identifier may be a partial concept id. */
15682 else if (flag_concepts
15683 && (template_id
= (cp_parser_maybe_partial_concept_id
15684 (parser
, templ
, arguments
))))
15685 return template_id
;
15686 else if (variable_template_p (templ
))
15688 template_id
= lookup_template_variable (templ
, arguments
);
15689 if (TREE_CODE (template_id
) == TEMPLATE_ID_EXPR
)
15690 SET_EXPR_LOCATION (template_id
, combined_loc
);
15694 /* If it's not a class-template or a template-template, it should be
15695 a function-template. */
15696 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ
)
15697 || TREE_CODE (templ
) == OVERLOAD
15698 || BASELINK_P (templ
)));
15700 template_id
= lookup_template_function (templ
, arguments
);
15701 if (TREE_CODE (template_id
) == TEMPLATE_ID_EXPR
)
15702 SET_EXPR_LOCATION (template_id
, combined_loc
);
15705 /* If parsing tentatively, replace the sequence of tokens that makes
15706 up the template-id with a CPP_TEMPLATE_ID token. That way,
15707 should we re-parse the token stream, we will not have to repeat
15708 the effort required to do the parse, nor will we issue duplicate
15709 error messages about problems during instantiation of the
15712 /* Don't do this if we had a parse error in a declarator; re-parsing
15713 might succeed if a name changes meaning (60361). */
15714 && !(cp_parser_error_occurred (parser
)
15715 && cp_parser_parsing_tentatively (parser
)
15716 && parser
->in_declarator_p
))
15718 /* Reset the contents of the START_OF_ID token. */
15719 token
->type
= CPP_TEMPLATE_ID
;
15720 token
->location
= combined_loc
;
15722 /* We must mark the lookup as kept, so we don't throw it away on
15723 the first parse. */
15724 if (is_overloaded_fn (template_id
))
15725 lookup_keep (get_fns (template_id
), true);
15727 /* Retrieve any deferred checks. Do not pop this access checks yet
15728 so the memory will not be reclaimed during token replacing below. */
15729 token
->u
.tree_check_value
= ggc_cleared_alloc
<struct tree_check
> ();
15730 token
->u
.tree_check_value
->value
= template_id
;
15731 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
15732 token
->keyword
= RID_MAX
;
15734 /* Purge all subsequent tokens. */
15735 cp_lexer_purge_tokens_after (parser
->lexer
, start_of_id
);
15737 /* ??? Can we actually assume that, if template_id ==
15738 error_mark_node, we will have issued a diagnostic to the
15739 user, as opposed to simply marking the tentative parse as
15741 if (cp_parser_error_occurred (parser
) && template_id
!= error_mark_node
)
15742 error_at (token
->location
, "parse error in template argument list");
15745 pop_to_parent_deferring_access_checks ();
15746 return template_id
;
15749 /* Parse a template-name.
15754 The standard should actually say:
15758 operator-function-id
15760 A defect report has been filed about this issue.
15762 A conversion-function-id cannot be a template name because they cannot
15763 be part of a template-id. In fact, looking at this code:
15765 a.operator K<int>()
15767 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15768 It is impossible to call a templated conversion-function-id with an
15769 explicit argument list, since the only allowed template parameter is
15770 the type to which it is converting.
15772 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15773 `template' keyword, in a construction like:
15777 In that case `f' is taken to be a template-name, even though there
15778 is no way of knowing for sure.
15780 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15781 name refers to a set of overloaded functions, at least one of which
15782 is a template, or an IDENTIFIER_NODE with the name of the template,
15783 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15784 names are looked up inside uninstantiated templates. */
15787 cp_parser_template_name (cp_parser
* parser
,
15788 bool template_keyword_p
,
15789 bool check_dependency_p
,
15790 bool is_declaration
,
15791 enum tag_types tag_type
,
15792 bool *is_identifier
)
15796 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15798 /* If the next token is `operator', then we have either an
15799 operator-function-id or a conversion-function-id. */
15800 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_OPERATOR
))
15802 /* We don't know whether we're looking at an
15803 operator-function-id or a conversion-function-id. */
15804 cp_parser_parse_tentatively (parser
);
15805 /* Try an operator-function-id. */
15806 identifier
= cp_parser_operator_function_id (parser
);
15807 /* If that didn't work, try a conversion-function-id. */
15808 if (!cp_parser_parse_definitely (parser
))
15810 cp_parser_error (parser
, "expected template-name");
15811 return error_mark_node
;
15814 /* Look for the identifier. */
15816 identifier
= cp_parser_identifier (parser
);
15818 /* If we didn't find an identifier, we don't have a template-id. */
15819 if (identifier
== error_mark_node
)
15820 return error_mark_node
;
15822 /* If the name immediately followed the `template' keyword, then it
15823 is a template-name. However, if the next token is not `<', then
15824 we do not treat it as a template-name, since it is not being used
15825 as part of a template-id. This enables us to handle constructs
15828 template <typename T> struct S { S(); };
15829 template <typename T> S<T>::S();
15831 correctly. We would treat `S' as a template -- if it were `S<T>'
15832 -- but we do not if there is no `<'. */
15834 if (processing_template_decl
15835 && cp_parser_nth_token_starts_template_argument_list_p (parser
, 1))
15837 /* In a declaration, in a dependent context, we pretend that the
15838 "template" keyword was present in order to improve error
15839 recovery. For example, given:
15841 template <typename T> void f(T::X<int>);
15843 we want to treat "X<int>" as a template-id. */
15845 && !template_keyword_p
15846 && parser
->scope
&& TYPE_P (parser
->scope
)
15847 && check_dependency_p
15848 && dependent_scope_p (parser
->scope
)
15849 /* Do not do this for dtors (or ctors), since they never
15850 need the template keyword before their name. */
15851 && !constructor_name_p (identifier
, parser
->scope
))
15853 cp_token_position start
= 0;
15855 /* Explain what went wrong. */
15856 error_at (token
->location
, "non-template %qD used as template",
15858 inform (token
->location
, "use %<%T::template %D%> to indicate that it is a template",
15859 parser
->scope
, identifier
);
15860 /* If parsing tentatively, find the location of the "<" token. */
15861 if (cp_parser_simulate_error (parser
))
15862 start
= cp_lexer_token_position (parser
->lexer
, true);
15863 /* Parse the template arguments so that we can issue error
15864 messages about them. */
15865 cp_lexer_consume_token (parser
->lexer
);
15866 cp_parser_enclosed_template_argument_list (parser
);
15867 /* Skip tokens until we find a good place from which to
15868 continue parsing. */
15869 cp_parser_skip_to_closing_parenthesis (parser
,
15870 /*recovering=*/true,
15872 /*consume_paren=*/false);
15873 /* If parsing tentatively, permanently remove the
15874 template argument list. That will prevent duplicate
15875 error messages from being issued about the missing
15876 "template" keyword. */
15878 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
15880 *is_identifier
= true;
15881 parser
->context
->object_type
= NULL_TREE
;
15885 /* If the "template" keyword is present, then there is generally
15886 no point in doing name-lookup, so we just return IDENTIFIER.
15887 But, if the qualifying scope is non-dependent then we can
15888 (and must) do name-lookup normally. */
15889 if (template_keyword_p
)
15891 tree scope
= (parser
->scope
? parser
->scope
15892 : parser
->context
->object_type
);
15893 if (scope
&& TYPE_P (scope
)
15894 && (!CLASS_TYPE_P (scope
)
15895 || (check_dependency_p
&& dependent_type_p (scope
))))
15897 /* We're optimizing away the call to cp_parser_lookup_name, but
15898 we still need to do this. */
15899 parser
->context
->object_type
= NULL_TREE
;
15905 /* Look up the name. */
15906 decl
= cp_parser_lookup_name (parser
, identifier
,
15908 /*is_template=*/true,
15909 /*is_namespace=*/false,
15910 check_dependency_p
,
15911 /*ambiguous_decls=*/NULL
,
15914 decl
= strip_using_decl (decl
);
15916 /* If DECL is a template, then the name was a template-name. */
15917 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
15919 if (TREE_DEPRECATED (decl
)
15920 && deprecated_state
!= DEPRECATED_SUPPRESS
)
15921 warn_deprecated_use (decl
, NULL_TREE
);
15925 /* The standard does not explicitly indicate whether a name that
15926 names a set of overloaded declarations, some of which are
15927 templates, is a template-name. However, such a name should
15928 be a template-name; otherwise, there is no way to form a
15929 template-id for the overloaded templates. */
15930 bool found
= false;
15932 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (decl
));
15933 !found
&& iter
; ++iter
)
15934 if (TREE_CODE (*iter
) == TEMPLATE_DECL
)
15939 /* The name does not name a template. */
15940 cp_parser_error (parser
, "expected template-name");
15941 return error_mark_node
;
15945 /* If DECL is dependent, and refers to a function, then just return
15946 its name; we will look it up again during template instantiation. */
15947 if (DECL_FUNCTION_TEMPLATE_P (decl
) || !DECL_P (decl
))
15949 tree scope
= ovl_scope (decl
);
15950 if (TYPE_P (scope
) && dependent_type_p (scope
))
15957 /* Parse a template-argument-list.
15959 template-argument-list:
15960 template-argument ... [opt]
15961 template-argument-list , template-argument ... [opt]
15963 Returns a TREE_VEC containing the arguments. */
15966 cp_parser_template_argument_list (cp_parser
* parser
)
15968 tree fixed_args
[10];
15969 unsigned n_args
= 0;
15970 unsigned alloced
= 10;
15971 tree
*arg_ary
= fixed_args
;
15973 bool saved_in_template_argument_list_p
;
15975 bool saved_non_ice_p
;
15977 saved_in_template_argument_list_p
= parser
->in_template_argument_list_p
;
15978 parser
->in_template_argument_list_p
= true;
15979 /* Even if the template-id appears in an integral
15980 constant-expression, the contents of the argument list do
15982 saved_ice_p
= parser
->integral_constant_expression_p
;
15983 parser
->integral_constant_expression_p
= false;
15984 saved_non_ice_p
= parser
->non_integral_constant_expression_p
;
15985 parser
->non_integral_constant_expression_p
= false;
15987 /* Parse the arguments. */
15993 /* Consume the comma. */
15994 cp_lexer_consume_token (parser
->lexer
);
15996 /* Parse the template-argument. */
15997 argument
= cp_parser_template_argument (parser
);
15999 /* If the next token is an ellipsis, we're expanding a template
16001 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
16003 if (argument
== error_mark_node
)
16005 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
16006 error_at (token
->location
,
16007 "expected parameter pack before %<...%>");
16009 /* Consume the `...' token. */
16010 cp_lexer_consume_token (parser
->lexer
);
16012 /* Make the argument into a TYPE_PACK_EXPANSION or
16013 EXPR_PACK_EXPANSION. */
16014 argument
= make_pack_expansion (argument
);
16017 if (n_args
== alloced
)
16021 if (arg_ary
== fixed_args
)
16023 arg_ary
= XNEWVEC (tree
, alloced
);
16024 memcpy (arg_ary
, fixed_args
, sizeof (tree
) * n_args
);
16027 arg_ary
= XRESIZEVEC (tree
, arg_ary
, alloced
);
16029 arg_ary
[n_args
++] = argument
;
16031 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
16033 vec
= make_tree_vec (n_args
);
16036 TREE_VEC_ELT (vec
, n_args
) = arg_ary
[n_args
];
16038 if (arg_ary
!= fixed_args
)
16040 parser
->non_integral_constant_expression_p
= saved_non_ice_p
;
16041 parser
->integral_constant_expression_p
= saved_ice_p
;
16042 parser
->in_template_argument_list_p
= saved_in_template_argument_list_p
;
16044 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
16048 /* Parse a template-argument.
16051 assignment-expression
16055 The representation is that of an assignment-expression, type-id, or
16056 id-expression -- except that the qualified id-expression is
16057 evaluated, so that the value returned is either a DECL or an
16060 Although the standard says "assignment-expression", it forbids
16061 throw-expressions or assignments in the template argument.
16062 Therefore, we use "conditional-expression" instead. */
16065 cp_parser_template_argument (cp_parser
* parser
)
16070 bool maybe_type_id
= false;
16071 cp_token
*token
= NULL
, *argument_start_token
= NULL
;
16072 location_t loc
= 0;
16075 /* There's really no way to know what we're looking at, so we just
16076 try each alternative in order.
16080 In a template-argument, an ambiguity between a type-id and an
16081 expression is resolved to a type-id, regardless of the form of
16082 the corresponding template-parameter.
16084 Therefore, we try a type-id first. */
16085 cp_parser_parse_tentatively (parser
);
16086 argument
= cp_parser_template_type_arg (parser
);
16087 /* If there was no error parsing the type-id but the next token is a
16088 '>>', our behavior depends on which dialect of C++ we're
16089 parsing. In C++98, we probably found a typo for '> >'. But there
16090 are type-id which are also valid expressions. For instance:
16092 struct X { int operator >> (int); };
16093 template <int V> struct Foo {};
16096 Here 'X()' is a valid type-id of a function type, but the user just
16097 wanted to write the expression "X() >> 5". Thus, we remember that we
16098 found a valid type-id, but we still try to parse the argument as an
16099 expression to see what happens.
16101 In C++0x, the '>>' will be considered two separate '>'
16103 if (!cp_parser_error_occurred (parser
)
16104 && cxx_dialect
== cxx98
16105 && cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
16107 maybe_type_id
= true;
16108 cp_parser_abort_tentative_parse (parser
);
16112 /* If the next token isn't a `,' or a `>', then this argument wasn't
16113 really finished. This means that the argument is not a valid
16115 if (!cp_parser_next_token_ends_template_argument_p (parser
))
16116 cp_parser_error (parser
, "expected template-argument");
16117 /* If that worked, we're done. */
16118 if (cp_parser_parse_definitely (parser
))
16121 /* We're still not sure what the argument will be. */
16122 cp_parser_parse_tentatively (parser
);
16123 /* Try a template. */
16124 argument_start_token
= cp_lexer_peek_token (parser
->lexer
);
16125 argument
= cp_parser_id_expression (parser
,
16126 /*template_keyword_p=*/false,
16127 /*check_dependency_p=*/true,
16129 /*declarator_p=*/false,
16130 /*optional_p=*/false);
16131 /* If the next token isn't a `,' or a `>', then this argument wasn't
16132 really finished. */
16133 if (!cp_parser_next_token_ends_template_argument_p (parser
))
16134 cp_parser_error (parser
, "expected template-argument");
16135 if (!cp_parser_error_occurred (parser
))
16137 /* Figure out what is being referred to. If the id-expression
16138 was for a class template specialization, then we will have a
16139 TYPE_DECL at this point. There is no need to do name lookup
16140 at this point in that case. */
16141 if (TREE_CODE (argument
) != TYPE_DECL
)
16142 argument
= cp_parser_lookup_name (parser
, argument
,
16144 /*is_template=*/template_p
,
16145 /*is_namespace=*/false,
16146 /*check_dependency=*/true,
16147 /*ambiguous_decls=*/NULL
,
16148 argument_start_token
->location
);
16149 /* Handle a constrained-type-specifier for a non-type template
16151 if (tree decl
= cp_parser_maybe_concept_name (parser
, argument
))
16153 else if (TREE_CODE (argument
) != TEMPLATE_DECL
16154 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
16155 cp_parser_error (parser
, "expected template-name");
16157 if (cp_parser_parse_definitely (parser
))
16159 if (TREE_DEPRECATED (argument
))
16160 warn_deprecated_use (argument
, NULL_TREE
);
16163 /* It must be a non-type argument. In C++17 any constant-expression is
16165 if (cxx_dialect
> cxx14
)
16168 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16170 -- an integral constant-expression of integral or enumeration
16173 -- the name of a non-type template-parameter; or
16175 -- the name of an object or function with external linkage...
16177 -- the address of an object or function with external linkage...
16179 -- a pointer to member... */
16180 /* Look for a non-type template parameter. */
16181 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
16183 cp_parser_parse_tentatively (parser
);
16184 argument
= cp_parser_primary_expression (parser
,
16185 /*address_p=*/false,
16187 /*template_arg_p=*/true,
16189 if (TREE_CODE (argument
) != TEMPLATE_PARM_INDEX
16190 || !cp_parser_next_token_ends_template_argument_p (parser
))
16191 cp_parser_simulate_error (parser
);
16192 if (cp_parser_parse_definitely (parser
))
16196 /* If the next token is "&", the argument must be the address of an
16197 object or function with external linkage. */
16198 address_p
= cp_lexer_next_token_is (parser
->lexer
, CPP_AND
);
16201 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
16202 cp_lexer_consume_token (parser
->lexer
);
16204 /* See if we might have an id-expression. */
16205 token
= cp_lexer_peek_token (parser
->lexer
);
16206 if (token
->type
== CPP_NAME
16207 || token
->keyword
== RID_OPERATOR
16208 || token
->type
== CPP_SCOPE
16209 || token
->type
== CPP_TEMPLATE_ID
16210 || token
->type
== CPP_NESTED_NAME_SPECIFIER
)
16212 cp_parser_parse_tentatively (parser
);
16213 argument
= cp_parser_primary_expression (parser
,
16216 /*template_arg_p=*/true,
16218 if (cp_parser_error_occurred (parser
)
16219 || !cp_parser_next_token_ends_template_argument_p (parser
))
16220 cp_parser_abort_tentative_parse (parser
);
16225 if (INDIRECT_REF_P (argument
))
16227 /* Strip the dereference temporarily. */
16228 gcc_assert (REFERENCE_REF_P (argument
));
16229 argument
= TREE_OPERAND (argument
, 0);
16232 /* If we're in a template, we represent a qualified-id referring
16233 to a static data member as a SCOPE_REF even if the scope isn't
16234 dependent so that we can check access control later. */
16236 if (TREE_CODE (probe
) == SCOPE_REF
)
16237 probe
= TREE_OPERAND (probe
, 1);
16240 /* A variable without external linkage might still be a
16241 valid constant-expression, so no error is issued here
16242 if the external-linkage check fails. */
16243 if (!address_p
&& !DECL_EXTERNAL_LINKAGE_P (probe
))
16244 cp_parser_simulate_error (parser
);
16246 else if (is_overloaded_fn (argument
))
16247 /* All overloaded functions are allowed; if the external
16248 linkage test does not pass, an error will be issued
16252 && (TREE_CODE (argument
) == OFFSET_REF
16253 || TREE_CODE (argument
) == SCOPE_REF
))
16254 /* A pointer-to-member. */
16256 else if (TREE_CODE (argument
) == TEMPLATE_PARM_INDEX
)
16259 cp_parser_simulate_error (parser
);
16261 if (cp_parser_parse_definitely (parser
))
16264 argument
= build_x_unary_op (loc
, ADDR_EXPR
, argument
,
16265 tf_warning_or_error
);
16267 argument
= convert_from_reference (argument
);
16272 /* If the argument started with "&", there are no other valid
16273 alternatives at this point. */
16276 cp_parser_error (parser
, "invalid non-type template argument");
16277 return error_mark_node
;
16281 /* If the argument wasn't successfully parsed as a type-id followed
16282 by '>>', the argument can only be a constant expression now.
16283 Otherwise, we try parsing the constant-expression tentatively,
16284 because the argument could really be a type-id. */
16286 cp_parser_parse_tentatively (parser
);
16288 if (cxx_dialect
<= cxx14
)
16289 argument
= cp_parser_constant_expression (parser
);
16292 /* With C++17 generalized non-type template arguments we need to handle
16293 lvalue constant expressions, too. */
16294 argument
= cp_parser_assignment_expression (parser
);
16295 require_potential_constant_expression (argument
);
16298 if (!maybe_type_id
)
16300 if (!cp_parser_next_token_ends_template_argument_p (parser
))
16301 cp_parser_error (parser
, "expected template-argument");
16302 if (cp_parser_parse_definitely (parser
))
16304 /* We did our best to parse the argument as a non type-id, but that
16305 was the only alternative that matched (albeit with a '>' after
16306 it). We can assume it's just a typo from the user, and a
16307 diagnostic will then be issued. */
16308 return cp_parser_template_type_arg (parser
);
16311 /* Parse an explicit-instantiation.
16313 explicit-instantiation:
16314 template declaration
16316 Although the standard says `declaration', what it really means is:
16318 explicit-instantiation:
16319 template decl-specifier-seq [opt] declarator [opt] ;
16321 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16322 supposed to be allowed. A defect report has been filed about this
16327 explicit-instantiation:
16328 storage-class-specifier template
16329 decl-specifier-seq [opt] declarator [opt] ;
16330 function-specifier template
16331 decl-specifier-seq [opt] declarator [opt] ; */
16334 cp_parser_explicit_instantiation (cp_parser
* parser
)
16336 int declares_class_or_enum
;
16337 cp_decl_specifier_seq decl_specifiers
;
16338 tree extension_specifier
= NULL_TREE
;
16340 timevar_push (TV_TEMPLATE_INST
);
16342 /* Look for an (optional) storage-class-specifier or
16343 function-specifier. */
16344 if (cp_parser_allow_gnu_extensions_p (parser
))
16346 extension_specifier
16347 = cp_parser_storage_class_specifier_opt (parser
);
16348 if (!extension_specifier
)
16349 extension_specifier
16350 = cp_parser_function_specifier_opt (parser
,
16351 /*decl_specs=*/NULL
);
16354 /* Look for the `template' keyword. */
16355 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
16356 /* Let the front end know that we are processing an explicit
16358 begin_explicit_instantiation ();
16359 /* [temp.explicit] says that we are supposed to ignore access
16360 control while processing explicit instantiation directives. */
16361 push_deferring_access_checks (dk_no_check
);
16362 /* Parse a decl-specifier-seq. */
16363 cp_parser_decl_specifier_seq (parser
,
16364 CP_PARSER_FLAGS_OPTIONAL
,
16366 &declares_class_or_enum
);
16367 /* If there was exactly one decl-specifier, and it declared a class,
16368 and there's no declarator, then we have an explicit type
16370 if (declares_class_or_enum
&& cp_parser_declares_only_class_p (parser
))
16374 type
= check_tag_decl (&decl_specifiers
,
16375 /*explicit_type_instantiation_p=*/true);
16376 /* Turn access control back on for names used during
16377 template instantiation. */
16378 pop_deferring_access_checks ();
16380 do_type_instantiation (type
, extension_specifier
,
16381 /*complain=*/tf_error
);
16385 cp_declarator
*declarator
;
16388 /* Parse the declarator. */
16390 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
16391 /*ctor_dtor_or_conv_p=*/NULL
,
16392 /*parenthesized_p=*/NULL
,
16393 /*member_p=*/false,
16394 /*friend_p=*/false);
16395 if (declares_class_or_enum
& 2)
16396 cp_parser_check_for_definition_in_return_type (declarator
,
16397 decl_specifiers
.type
,
16398 decl_specifiers
.locations
[ds_type_spec
]);
16399 if (declarator
!= cp_error_declarator
)
16401 if (decl_spec_seq_has_spec_p (&decl_specifiers
, ds_inline
))
16402 permerror (decl_specifiers
.locations
[ds_inline
],
16403 "explicit instantiation shall not use"
16404 " %<inline%> specifier");
16405 if (decl_spec_seq_has_spec_p (&decl_specifiers
, ds_constexpr
))
16406 permerror (decl_specifiers
.locations
[ds_constexpr
],
16407 "explicit instantiation shall not use"
16408 " %<constexpr%> specifier");
16410 decl
= grokdeclarator (declarator
, &decl_specifiers
,
16411 NORMAL
, 0, &decl_specifiers
.attributes
);
16412 /* Turn access control back on for names used during
16413 template instantiation. */
16414 pop_deferring_access_checks ();
16415 /* Do the explicit instantiation. */
16416 do_decl_instantiation (decl
, extension_specifier
);
16420 pop_deferring_access_checks ();
16421 /* Skip the body of the explicit instantiation. */
16422 cp_parser_skip_to_end_of_statement (parser
);
16425 /* We're done with the instantiation. */
16426 end_explicit_instantiation ();
16428 cp_parser_consume_semicolon_at_end_of_statement (parser
);
16430 timevar_pop (TV_TEMPLATE_INST
);
16433 /* Parse an explicit-specialization.
16435 explicit-specialization:
16436 template < > declaration
16438 Although the standard says `declaration', what it really means is:
16440 explicit-specialization:
16441 template <> decl-specifier [opt] init-declarator [opt] ;
16442 template <> function-definition
16443 template <> explicit-specialization
16444 template <> template-declaration */
16447 cp_parser_explicit_specialization (cp_parser
* parser
)
16449 bool need_lang_pop
;
16450 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
16452 /* Look for the `template' keyword. */
16453 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
16454 /* Look for the `<'. */
16455 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
16456 /* Look for the `>'. */
16457 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
16458 /* We have processed another parameter list. */
16459 ++parser
->num_template_parameter_lists
;
16462 A template ... explicit specialization ... shall not have C
16464 if (current_lang_name
== lang_name_c
)
16466 error_at (token
->location
, "template specialization with C linkage");
16467 /* Give it C++ linkage to avoid confusing other parts of the
16469 push_lang_context (lang_name_cplusplus
);
16470 need_lang_pop
= true;
16473 need_lang_pop
= false;
16474 /* Let the front end know that we are beginning a specialization. */
16475 if (!begin_specialization ())
16477 end_specialization ();
16481 /* If the next keyword is `template', we need to figure out whether
16482 or not we're looking a template-declaration. */
16483 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
16485 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
16486 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_GREATER
)
16487 cp_parser_template_declaration_after_export (parser
,
16488 /*member_p=*/false);
16490 cp_parser_explicit_specialization (parser
);
16493 /* Parse the dependent declaration. */
16494 cp_parser_single_declaration (parser
,
16496 /*member_p=*/false,
16497 /*explicit_specialization_p=*/true,
16498 /*friend_p=*/NULL
);
16499 /* We're done with the specialization. */
16500 end_specialization ();
16501 /* For the erroneous case of a template with C linkage, we pushed an
16502 implicit C++ linkage scope; exit that scope now. */
16504 pop_lang_context ();
16505 /* We're done with this parameter list. */
16506 --parser
->num_template_parameter_lists
;
16509 /* Parse a type-specifier.
16512 simple-type-specifier
16515 elaborated-type-specifier
16523 Returns a representation of the type-specifier. For a
16524 class-specifier, enum-specifier, or elaborated-type-specifier, a
16525 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16527 The parser flags FLAGS is used to control type-specifier parsing.
16529 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16530 in a decl-specifier-seq.
16532 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16533 class-specifier, enum-specifier, or elaborated-type-specifier, then
16534 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16535 if a type is declared; 2 if it is defined. Otherwise, it is set to
16538 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16539 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16540 is set to FALSE. */
16543 cp_parser_type_specifier (cp_parser
* parser
,
16544 cp_parser_flags flags
,
16545 cp_decl_specifier_seq
*decl_specs
,
16546 bool is_declaration
,
16547 int* declares_class_or_enum
,
16548 bool* is_cv_qualifier
)
16550 tree type_spec
= NULL_TREE
;
16553 cp_decl_spec ds
= ds_last
;
16555 /* Assume this type-specifier does not declare a new type. */
16556 if (declares_class_or_enum
)
16557 *declares_class_or_enum
= 0;
16558 /* And that it does not specify a cv-qualifier. */
16559 if (is_cv_qualifier
)
16560 *is_cv_qualifier
= false;
16561 /* Peek at the next token. */
16562 token
= cp_lexer_peek_token (parser
->lexer
);
16564 /* If we're looking at a keyword, we can use that to guide the
16565 production we choose. */
16566 keyword
= token
->keyword
;
16570 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
16571 goto elaborated_type_specifier
;
16573 /* Look for the enum-specifier. */
16574 type_spec
= cp_parser_enum_specifier (parser
);
16575 /* If that worked, we're done. */
16578 if (declares_class_or_enum
)
16579 *declares_class_or_enum
= 2;
16581 cp_parser_set_decl_spec_type (decl_specs
,
16584 /*type_definition_p=*/true);
16588 goto elaborated_type_specifier
;
16590 /* Any of these indicate either a class-specifier, or an
16591 elaborated-type-specifier. */
16595 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
16596 goto elaborated_type_specifier
;
16598 /* Parse tentatively so that we can back up if we don't find a
16599 class-specifier. */
16600 cp_parser_parse_tentatively (parser
);
16601 /* Look for the class-specifier. */
16602 type_spec
= cp_parser_class_specifier (parser
);
16603 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE
, type_spec
);
16604 /* If that worked, we're done. */
16605 if (cp_parser_parse_definitely (parser
))
16607 if (declares_class_or_enum
)
16608 *declares_class_or_enum
= 2;
16610 cp_parser_set_decl_spec_type (decl_specs
,
16613 /*type_definition_p=*/true);
16617 /* Fall through. */
16618 elaborated_type_specifier
:
16619 /* We're declaring (not defining) a class or enum. */
16620 if (declares_class_or_enum
)
16621 *declares_class_or_enum
= 1;
16623 /* Fall through. */
16625 /* Look for an elaborated-type-specifier. */
16627 = (cp_parser_elaborated_type_specifier
16629 decl_spec_seq_has_spec_p (decl_specs
, ds_friend
),
16632 cp_parser_set_decl_spec_type (decl_specs
,
16635 /*type_definition_p=*/false);
16640 if (is_cv_qualifier
)
16641 *is_cv_qualifier
= true;
16646 if (is_cv_qualifier
)
16647 *is_cv_qualifier
= true;
16652 if (is_cv_qualifier
)
16653 *is_cv_qualifier
= true;
16657 /* The `__complex__' keyword is a GNU extension. */
16665 /* Handle simple keywords. */
16670 set_and_check_decl_spec_loc (decl_specs
, ds
, token
);
16671 decl_specs
->any_specifiers_p
= true;
16673 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
16676 /* If we do not already have a type-specifier, assume we are looking
16677 at a simple-type-specifier. */
16678 type_spec
= cp_parser_simple_type_specifier (parser
,
16682 /* If we didn't find a type-specifier, and a type-specifier was not
16683 optional in this context, issue an error message. */
16684 if (!type_spec
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
16686 cp_parser_error (parser
, "expected type specifier");
16687 return error_mark_node
;
16693 /* Parse a simple-type-specifier.
16695 simple-type-specifier:
16696 :: [opt] nested-name-specifier [opt] type-name
16697 :: [opt] nested-name-specifier template template-id
16712 simple-type-specifier:
16714 decltype ( expression )
16717 __underlying_type ( type-id )
16721 nested-name-specifier(opt) template-name
16725 simple-type-specifier:
16727 __typeof__ unary-expression
16728 __typeof__ ( type-id )
16729 __typeof__ ( type-id ) { initializer-list , [opt] }
16731 Concepts Extension:
16733 simple-type-specifier:
16734 constrained-type-specifier
16736 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16737 appropriately updated. */
16740 cp_parser_simple_type_specifier (cp_parser
* parser
,
16741 cp_decl_specifier_seq
*decl_specs
,
16742 cp_parser_flags flags
)
16744 tree type
= NULL_TREE
;
16748 /* Peek at the next token. */
16749 token
= cp_lexer_peek_token (parser
->lexer
);
16751 /* If we're looking at a keyword, things are easy. */
16752 switch (token
->keyword
)
16756 decl_specs
->explicit_char_p
= true;
16757 type
= char_type_node
;
16760 type
= char16_type_node
;
16763 type
= char32_type_node
;
16766 type
= wchar_type_node
;
16769 type
= boolean_type_node
;
16772 set_and_check_decl_spec_loc (decl_specs
, ds_short
, token
);
16773 type
= short_integer_type_node
;
16777 decl_specs
->explicit_int_p
= true;
16778 type
= integer_type_node
;
16784 idx
= token
->keyword
- RID_INT_N_0
;
16785 if (! int_n_enabled_p
[idx
])
16789 decl_specs
->explicit_intN_p
= true;
16790 decl_specs
->int_n_idx
= idx
;
16792 type
= int_n_trees
[idx
].signed_type
;
16796 set_and_check_decl_spec_loc (decl_specs
, ds_long
, token
);
16797 type
= long_integer_type_node
;
16800 set_and_check_decl_spec_loc (decl_specs
, ds_signed
, token
);
16801 type
= integer_type_node
;
16804 set_and_check_decl_spec_loc (decl_specs
, ds_unsigned
, token
);
16805 type
= unsigned_type_node
;
16808 type
= float_type_node
;
16811 type
= double_type_node
;
16814 type
= void_type_node
;
16818 maybe_warn_cpp0x (CPP0X_AUTO
);
16819 if (parser
->auto_is_implicit_function_template_parm_p
)
16821 /* The 'auto' might be the placeholder return type for a function decl
16822 with trailing return type. */
16823 bool have_trailing_return_fn_decl
= false;
16825 cp_parser_parse_tentatively (parser
);
16826 cp_lexer_consume_token (parser
->lexer
);
16827 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
16828 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
)
16829 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
16830 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
16832 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
16834 cp_lexer_consume_token (parser
->lexer
);
16835 cp_parser_skip_to_closing_parenthesis (parser
,
16836 /*recovering*/false,
16838 /*consume_paren*/true);
16842 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
16844 have_trailing_return_fn_decl
= true;
16848 cp_lexer_consume_token (parser
->lexer
);
16850 cp_parser_abort_tentative_parse (parser
);
16852 if (have_trailing_return_fn_decl
)
16854 type
= make_auto ();
16858 if (cxx_dialect
>= cxx14
)
16860 type
= synthesize_implicit_template_parm (parser
, NULL_TREE
);
16861 type
= TREE_TYPE (type
);
16864 type
= error_mark_node
;
16866 if (current_class_type
&& LAMBDA_TYPE_P (current_class_type
))
16868 if (cxx_dialect
< cxx14
)
16869 error_at (token
->location
,
16870 "use of %<auto%> in lambda parameter declaration "
16871 "only available with "
16872 "-std=c++14 or -std=gnu++14");
16874 else if (cxx_dialect
< cxx14
)
16875 error_at (token
->location
,
16876 "use of %<auto%> in parameter declaration "
16877 "only available with "
16878 "-std=c++14 or -std=gnu++14");
16879 else if (!flag_concepts
)
16880 pedwarn (token
->location
, OPT_Wpedantic
,
16881 "ISO C++ forbids use of %<auto%> in parameter "
16885 type
= make_auto ();
16889 /* Since DR 743, decltype can either be a simple-type-specifier by
16890 itself or begin a nested-name-specifier. Parsing it will replace
16891 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16892 handling below decide what to do. */
16893 cp_parser_decltype (parser
);
16894 cp_lexer_set_token_position (parser
->lexer
, token
);
16898 /* Consume the `typeof' token. */
16899 cp_lexer_consume_token (parser
->lexer
);
16900 /* Parse the operand to `typeof'. */
16901 type
= cp_parser_sizeof_operand (parser
, RID_TYPEOF
);
16902 /* If it is not already a TYPE, take its type. */
16903 if (!TYPE_P (type
))
16904 type
= finish_typeof (type
);
16907 cp_parser_set_decl_spec_type (decl_specs
, type
,
16909 /*type_definition_p=*/false);
16913 case RID_UNDERLYING_TYPE
:
16914 type
= cp_parser_trait_expr (parser
, RID_UNDERLYING_TYPE
);
16916 cp_parser_set_decl_spec_type (decl_specs
, type
,
16918 /*type_definition_p=*/false);
16923 case RID_DIRECT_BASES
:
16924 type
= cp_parser_trait_expr (parser
, token
->keyword
);
16926 cp_parser_set_decl_spec_type (decl_specs
, type
,
16928 /*type_definition_p=*/false);
16934 /* If token is an already-parsed decltype not followed by ::,
16935 it's a simple-type-specifier. */
16936 if (token
->type
== CPP_DECLTYPE
16937 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
16939 type
= saved_checks_value (token
->u
.tree_check_value
);
16942 cp_parser_set_decl_spec_type (decl_specs
, type
,
16944 /*type_definition_p=*/false);
16945 /* Remember that we are handling a decltype in order to
16946 implement the resolution of DR 1510 when the argument
16947 isn't instantiation dependent. */
16948 decl_specs
->decltype_p
= true;
16950 cp_lexer_consume_token (parser
->lexer
);
16954 /* If the type-specifier was for a built-in type, we're done. */
16957 /* Record the type. */
16959 && (token
->keyword
!= RID_SIGNED
16960 && token
->keyword
!= RID_UNSIGNED
16961 && token
->keyword
!= RID_SHORT
16962 && token
->keyword
!= RID_LONG
))
16963 cp_parser_set_decl_spec_type (decl_specs
,
16966 /*type_definition_p=*/false);
16968 decl_specs
->any_specifiers_p
= true;
16970 /* Consume the token. */
16971 cp_lexer_consume_token (parser
->lexer
);
16973 if (type
== error_mark_node
)
16974 return error_mark_node
;
16976 /* There is no valid C++ program where a non-template type is
16977 followed by a "<". That usually indicates that the user thought
16978 that the type was a template. */
16979 cp_parser_check_for_invalid_template_id (parser
, type
, none_type
,
16982 return TYPE_NAME (type
);
16985 /* The type-specifier must be a user-defined type. */
16986 if (!(flags
& CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
))
16991 /* Don't gobble tokens or issue error messages if this is an
16992 optional type-specifier. */
16993 if ((flags
& CP_PARSER_FLAGS_OPTIONAL
) || cxx_dialect
>= cxx1z
)
16994 cp_parser_parse_tentatively (parser
);
16996 token
= cp_lexer_peek_token (parser
->lexer
);
16998 /* Look for the optional `::' operator. */
17000 = (cp_parser_global_scope_opt (parser
,
17001 /*current_scope_valid_p=*/false)
17003 /* Look for the nested-name specifier. */
17005 = (cp_parser_nested_name_specifier_opt (parser
,
17006 /*typename_keyword_p=*/false,
17007 /*check_dependency_p=*/true,
17009 /*is_declaration=*/false)
17011 /* If we have seen a nested-name-specifier, and the next token
17012 is `template', then we are using the template-id production. */
17014 && cp_parser_optional_template_keyword (parser
))
17016 /* Look for the template-id. */
17017 type
= cp_parser_template_id (parser
,
17018 /*template_keyword_p=*/true,
17019 /*check_dependency_p=*/true,
17021 /*is_declaration=*/false);
17022 /* If the template-id did not name a type, we are out of
17024 if (TREE_CODE (type
) != TYPE_DECL
)
17026 cp_parser_error (parser
, "expected template-id for type");
17030 /* Otherwise, look for a type-name. */
17032 type
= cp_parser_type_name (parser
);
17033 /* Keep track of all name-lookups performed in class scopes. */
17037 && TREE_CODE (type
) == TYPE_DECL
17038 && identifier_p (DECL_NAME (type
)))
17039 maybe_note_name_used_in_class (DECL_NAME (type
), type
);
17040 /* If it didn't work out, we don't have a TYPE. */
17041 if (((flags
& CP_PARSER_FLAGS_OPTIONAL
) || cxx_dialect
>= cxx1z
)
17042 && !cp_parser_parse_definitely (parser
))
17044 if (!type
&& cxx_dialect
>= cxx1z
)
17046 if (flags
& CP_PARSER_FLAGS_OPTIONAL
)
17047 cp_parser_parse_tentatively (parser
);
17049 cp_parser_global_scope_opt (parser
,
17050 /*current_scope_valid_p=*/false);
17051 cp_parser_nested_name_specifier_opt (parser
,
17052 /*typename_keyword_p=*/false,
17053 /*check_dependency_p=*/true,
17055 /*is_declaration=*/false);
17056 tree name
= cp_parser_identifier (parser
);
17057 if (name
&& TREE_CODE (name
) == IDENTIFIER_NODE
17058 && parser
->scope
!= error_mark_node
)
17060 tree tmpl
= cp_parser_lookup_name (parser
, name
,
17062 /*is_template=*/false,
17063 /*is_namespace=*/false,
17064 /*check_dependency=*/true,
17065 /*ambiguous_decls=*/NULL
,
17067 if (tmpl
&& tmpl
!= error_mark_node
17068 && (DECL_CLASS_TEMPLATE_P (tmpl
)
17069 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))
17070 type
= make_template_placeholder (tmpl
);
17073 type
= error_mark_node
;
17074 if (!cp_parser_simulate_error (parser
))
17075 cp_parser_name_lookup_error (parser
, name
, tmpl
,
17076 NLE_TYPE
, token
->location
);
17080 type
= error_mark_node
;
17082 if ((flags
& CP_PARSER_FLAGS_OPTIONAL
)
17083 && !cp_parser_parse_definitely (parser
))
17086 if (type
&& decl_specs
)
17087 cp_parser_set_decl_spec_type (decl_specs
, type
,
17089 /*type_definition_p=*/false);
17092 /* If we didn't get a type-name, issue an error message. */
17093 if (!type
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
17095 cp_parser_error (parser
, "expected type-name");
17096 return error_mark_node
;
17099 if (type
&& type
!= error_mark_node
)
17101 /* See if TYPE is an Objective-C type, and if so, parse and
17102 accept any protocol references following it. Do this before
17103 the cp_parser_check_for_invalid_template_id() call, because
17104 Objective-C types can be followed by '<...>' which would
17105 enclose protocol names rather than template arguments, and so
17106 everything is fine. */
17107 if (c_dialect_objc () && !parser
->scope
17108 && (objc_is_id (type
) || objc_is_class_name (type
)))
17110 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
17111 tree qual_type
= objc_get_protocol_qualified_type (type
, protos
);
17113 /* Clobber the "unqualified" type previously entered into
17114 DECL_SPECS with the new, improved protocol-qualified version. */
17116 decl_specs
->type
= qual_type
;
17121 /* There is no valid C++ program where a non-template type is
17122 followed by a "<". That usually indicates that the user
17123 thought that the type was a template. */
17124 cp_parser_check_for_invalid_template_id (parser
, type
,
17132 /* Parse a type-name.
17138 simple-template-id [in c++0x]
17155 Returns a TYPE_DECL for the type. */
17158 cp_parser_type_name (cp_parser
* parser
)
17160 return cp_parser_type_name (parser
, /*typename_keyword_p=*/false);
17165 cp_parser_type_name (cp_parser
* parser
, bool typename_keyword_p
)
17169 /* We can't know yet whether it is a class-name or not. */
17170 cp_parser_parse_tentatively (parser
);
17171 /* Try a class-name. */
17172 type_decl
= cp_parser_class_name (parser
,
17173 typename_keyword_p
,
17174 /*template_keyword_p=*/false,
17176 /*check_dependency_p=*/true,
17177 /*class_head_p=*/false,
17178 /*is_declaration=*/false);
17179 /* If it's not a class-name, keep looking. */
17180 if (!cp_parser_parse_definitely (parser
))
17182 if (cxx_dialect
< cxx11
)
17183 /* It must be a typedef-name or an enum-name. */
17184 return cp_parser_nonclass_name (parser
);
17186 cp_parser_parse_tentatively (parser
);
17187 /* It is either a simple-template-id representing an
17188 instantiation of an alias template... */
17189 type_decl
= cp_parser_template_id (parser
,
17190 /*template_keyword_p=*/false,
17191 /*check_dependency_p=*/true,
17193 /*is_declaration=*/false);
17194 /* Note that this must be an instantiation of an alias template
17195 because [temp.names]/6 says:
17197 A template-id that names an alias template specialization
17200 Whereas [temp.names]/7 says:
17202 A simple-template-id that names a class template
17203 specialization is a class-name.
17205 With concepts, this could also be a partial-concept-id that
17206 declares a non-type template parameter. */
17207 if (type_decl
!= NULL_TREE
17208 && TREE_CODE (type_decl
) == TYPE_DECL
17209 && TYPE_DECL_ALIAS_P (type_decl
))
17210 gcc_assert (DECL_TEMPLATE_INSTANTIATION (type_decl
));
17211 else if (is_constrained_parameter (type_decl
))
17212 /* Don't do anything. */ ;
17214 cp_parser_simulate_error (parser
);
17216 if (!cp_parser_parse_definitely (parser
))
17217 /* ... Or a typedef-name or an enum-name. */
17218 return cp_parser_nonclass_name (parser
);
17224 /* Check if DECL and ARGS can form a constrained-type-specifier.
17225 If ARGS is non-null, we try to form a concept check of the
17226 form DECL<?, ARGS> where ? is a wildcard that matches any
17227 kind of template argument. If ARGS is NULL, then we try to
17228 form a concept check of the form DECL<?>. */
17231 cp_parser_maybe_constrained_type_specifier (cp_parser
*parser
,
17232 tree decl
, tree args
)
17234 gcc_assert (args
? TREE_CODE (args
) == TREE_VEC
: true);
17236 /* If we a constrained-type-specifier cannot be deduced. */
17237 if (parser
->prevent_constrained_type_specifiers
)
17240 /* A constrained type specifier can only be found in an
17241 overload set or as a reference to a template declaration.
17243 FIXME: This might be masking a bug. It's possible that
17244 that the deduction below is causing template specializations
17245 to be formed with the wildcard as an argument. */
17246 if (TREE_CODE (decl
) != OVERLOAD
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
17249 /* Try to build a call expression that evaluates the
17250 concept. This can fail if the overload set refers
17251 only to non-templates. */
17252 tree placeholder
= build_nt (WILDCARD_DECL
);
17253 tree check
= build_concept_check (decl
, placeholder
, args
);
17254 if (check
== error_mark_node
)
17257 /* Deduce the checked constraint and the prototype parameter.
17259 FIXME: In certain cases, failure to deduce should be a
17260 diagnosable error. */
17263 if (!deduce_constrained_parameter (check
, conc
, proto
))
17266 /* In template parameter scope, this results in a constrained
17267 parameter. Return a descriptor of that parm. */
17268 if (processing_template_parmlist
)
17269 return build_constrained_parameter (conc
, proto
, args
);
17271 /* In a parameter-declaration-clause, constrained-type
17272 specifiers result in invented template parameters. */
17273 if (parser
->auto_is_implicit_function_template_parm_p
)
17275 tree x
= build_constrained_parameter (conc
, proto
, args
);
17276 return synthesize_implicit_template_parm (parser
, x
);
17280 /* Otherwise, we're in a context where the constrained
17281 type name is deduced and the constraint applies
17282 after deduction. */
17283 return make_constrained_auto (conc
, args
);
17289 /* If DECL refers to a concept, return a TYPE_DECL representing
17290 the result of using the constrained type specifier in the
17291 current context. DECL refers to a concept if
17293 - it is an overload set containing a function concept taking a single
17296 - it is a variable concept taking a single type argument. */
17299 cp_parser_maybe_concept_name (cp_parser
* parser
, tree decl
)
17302 && (TREE_CODE (decl
) == OVERLOAD
17303 || BASELINK_P (decl
)
17304 || variable_concept_p (decl
)))
17305 return cp_parser_maybe_constrained_type_specifier (parser
, decl
, NULL_TREE
);
17310 /* Check if DECL and ARGS form a partial-concept-id. If so,
17311 assign ID to the resulting constrained placeholder.
17313 Returns true if the partial-concept-id designates a placeholder
17314 and false otherwise. Note that *id is set to NULL_TREE in
17318 cp_parser_maybe_partial_concept_id (cp_parser
*parser
, tree decl
, tree args
)
17320 return cp_parser_maybe_constrained_type_specifier (parser
, decl
, args
);
17323 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17335 Returns a TYPE_DECL for the type. */
17338 cp_parser_nonclass_name (cp_parser
* parser
)
17343 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17344 identifier
= cp_parser_identifier (parser
);
17345 if (identifier
== error_mark_node
)
17346 return error_mark_node
;
17348 /* Look up the type-name. */
17349 type_decl
= cp_parser_lookup_name_simple (parser
, identifier
, token
->location
);
17351 type_decl
= strip_using_decl (type_decl
);
17353 /* If we found an overload set, then it may refer to a concept-name. */
17354 if (tree decl
= cp_parser_maybe_concept_name (parser
, type_decl
))
17357 if (TREE_CODE (type_decl
) != TYPE_DECL
17358 && (objc_is_id (identifier
) || objc_is_class_name (identifier
)))
17360 /* See if this is an Objective-C type. */
17361 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
17362 tree type
= objc_get_protocol_qualified_type (identifier
, protos
);
17364 type_decl
= TYPE_NAME (type
);
17367 /* Issue an error if we did not find a type-name. */
17368 if (TREE_CODE (type_decl
) != TYPE_DECL
17369 /* In Objective-C, we have the complication that class names are
17370 normally type names and start declarations (eg, the
17371 "NSObject" in "NSObject *object;"), but can be used in an
17372 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17373 is an expression. So, a classname followed by a dot is not a
17374 valid type-name. */
17375 || (objc_is_class_name (TREE_TYPE (type_decl
))
17376 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
))
17378 if (!cp_parser_simulate_error (parser
))
17379 cp_parser_name_lookup_error (parser
, identifier
, type_decl
,
17380 NLE_TYPE
, token
->location
);
17381 return error_mark_node
;
17383 /* Remember that the name was used in the definition of the
17384 current class so that we can check later to see if the
17385 meaning would have been different after the class was
17386 entirely defined. */
17387 else if (type_decl
!= error_mark_node
17389 maybe_note_name_used_in_class (identifier
, type_decl
);
17394 /* Parse an elaborated-type-specifier. Note that the grammar given
17395 here incorporates the resolution to DR68.
17397 elaborated-type-specifier:
17398 class-key :: [opt] nested-name-specifier [opt] identifier
17399 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17400 enum-key :: [opt] nested-name-specifier [opt] identifier
17401 typename :: [opt] nested-name-specifier identifier
17402 typename :: [opt] nested-name-specifier template [opt]
17407 elaborated-type-specifier:
17408 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17409 class-key attributes :: [opt] nested-name-specifier [opt]
17410 template [opt] template-id
17411 enum attributes :: [opt] nested-name-specifier [opt] identifier
17413 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17414 declared `friend'. If IS_DECLARATION is TRUE, then this
17415 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17416 something is being declared.
17418 Returns the TYPE specified. */
17421 cp_parser_elaborated_type_specifier (cp_parser
* parser
,
17423 bool is_declaration
)
17425 enum tag_types tag_type
;
17427 tree type
= NULL_TREE
;
17428 tree attributes
= NULL_TREE
;
17430 cp_token
*token
= NULL
;
17432 /* See if we're looking at the `enum' keyword. */
17433 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ENUM
))
17435 /* Consume the `enum' token. */
17436 cp_lexer_consume_token (parser
->lexer
);
17437 /* Remember that it's an enumeration type. */
17438 tag_type
= enum_type
;
17439 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17440 enums) is used here. */
17441 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17442 if (cp_parser_is_keyword (token
, RID_CLASS
)
17443 || cp_parser_is_keyword (token
, RID_STRUCT
))
17445 gcc_rich_location
richloc (token
->location
);
17446 richloc
.add_range (input_location
, false);
17447 richloc
.add_fixit_remove ();
17448 pedwarn_at_rich_loc (&richloc
, 0, "elaborated-type-specifier for "
17449 "a scoped enum must not use the %qD keyword",
17451 /* Consume the `struct' or `class' and parse it anyway. */
17452 cp_lexer_consume_token (parser
->lexer
);
17454 /* Parse the attributes. */
17455 attributes
= cp_parser_attributes_opt (parser
);
17457 /* Or, it might be `typename'. */
17458 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
17461 /* Consume the `typename' token. */
17462 cp_lexer_consume_token (parser
->lexer
);
17463 /* Remember that it's a `typename' type. */
17464 tag_type
= typename_type
;
17466 /* Otherwise it must be a class-key. */
17469 tag_type
= cp_parser_class_key (parser
);
17470 if (tag_type
== none_type
)
17471 return error_mark_node
;
17472 /* Parse the attributes. */
17473 attributes
= cp_parser_attributes_opt (parser
);
17476 /* Look for the `::' operator. */
17477 globalscope
= cp_parser_global_scope_opt (parser
,
17478 /*current_scope_valid_p=*/false);
17479 /* Look for the nested-name-specifier. */
17480 tree nested_name_specifier
;
17481 if (tag_type
== typename_type
&& !globalscope
)
17483 nested_name_specifier
17484 = cp_parser_nested_name_specifier (parser
,
17485 /*typename_keyword_p=*/true,
17486 /*check_dependency_p=*/true,
17489 if (!nested_name_specifier
)
17490 return error_mark_node
;
17493 /* Even though `typename' is not present, the proposed resolution
17494 to Core Issue 180 says that in `class A<T>::B', `B' should be
17495 considered a type-name, even if `A<T>' is dependent. */
17496 nested_name_specifier
17497 = cp_parser_nested_name_specifier_opt (parser
,
17498 /*typename_keyword_p=*/true,
17499 /*check_dependency_p=*/true,
17502 /* For everything but enumeration types, consider a template-id.
17503 For an enumeration type, consider only a plain identifier. */
17504 if (tag_type
!= enum_type
)
17506 bool template_p
= false;
17509 /* Allow the `template' keyword. */
17510 template_p
= cp_parser_optional_template_keyword (parser
);
17511 /* If we didn't see `template', we don't know if there's a
17512 template-id or not. */
17514 cp_parser_parse_tentatively (parser
);
17515 /* Parse the template-id. */
17516 token
= cp_lexer_peek_token (parser
->lexer
);
17517 decl
= cp_parser_template_id (parser
, template_p
,
17518 /*check_dependency_p=*/true,
17521 /* If we didn't find a template-id, look for an ordinary
17523 if (!template_p
&& !cp_parser_parse_definitely (parser
))
17525 /* We can get here when cp_parser_template_id, called by
17526 cp_parser_class_name with tag_type == none_type, succeeds
17527 and caches a BASELINK. Then, when called again here,
17528 instead of failing and returning an error_mark_node
17529 returns it (see template/typename17.C in C++11).
17530 ??? Could we diagnose this earlier? */
17531 else if (tag_type
== typename_type
&& BASELINK_P (decl
))
17533 cp_parser_diagnose_invalid_type_name (parser
, decl
, token
->location
);
17534 type
= error_mark_node
;
17536 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17537 in effect, then we must assume that, upon instantiation, the
17538 template will correspond to a class. */
17539 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
17540 && tag_type
== typename_type
)
17541 type
= make_typename_type (parser
->scope
, decl
,
17543 /*complain=*/tf_error
);
17544 /* If the `typename' keyword is in effect and DECL is not a type
17545 decl, then type is non existent. */
17546 else if (tag_type
== typename_type
&& TREE_CODE (decl
) != TYPE_DECL
)
17548 else if (TREE_CODE (decl
) == TYPE_DECL
)
17550 type
= check_elaborated_type_specifier (tag_type
, decl
,
17551 /*allow_template_p=*/true);
17553 /* If the next token is a semicolon, this must be a specialization,
17554 instantiation, or friend declaration. Check the scope while we
17555 still know whether or not we had a nested-name-specifier. */
17556 if (type
!= error_mark_node
17557 && !nested_name_specifier
&& !is_friend
17558 && cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
17559 check_unqualified_spec_or_inst (type
, token
->location
);
17561 else if (decl
== error_mark_node
)
17562 type
= error_mark_node
;
17567 token
= cp_lexer_peek_token (parser
->lexer
);
17568 identifier
= cp_parser_identifier (parser
);
17570 if (identifier
== error_mark_node
)
17572 parser
->scope
= NULL_TREE
;
17573 return error_mark_node
;
17576 /* For a `typename', we needn't call xref_tag. */
17577 if (tag_type
== typename_type
17578 && TREE_CODE (parser
->scope
) != NAMESPACE_DECL
)
17579 return cp_parser_make_typename_type (parser
, identifier
,
17582 /* Template parameter lists apply only if we are not within a
17583 function parameter list. */
17584 bool template_parm_lists_apply
17585 = parser
->num_template_parameter_lists
;
17586 if (template_parm_lists_apply
)
17587 for (cp_binding_level
*s
= current_binding_level
;
17588 s
&& s
->kind
!= sk_template_parms
;
17589 s
= s
->level_chain
)
17590 if (s
->kind
== sk_function_parms
)
17591 template_parm_lists_apply
= false;
17593 /* Look up a qualified name in the usual way. */
17597 tree ambiguous_decls
;
17599 decl
= cp_parser_lookup_name (parser
, identifier
,
17601 /*is_template=*/false,
17602 /*is_namespace=*/false,
17603 /*check_dependency=*/true,
17607 /* If the lookup was ambiguous, an error will already have been
17609 if (ambiguous_decls
)
17610 return error_mark_node
;
17612 /* If we are parsing friend declaration, DECL may be a
17613 TEMPLATE_DECL tree node here. However, we need to check
17614 whether this TEMPLATE_DECL results in valid code. Consider
17615 the following example:
17618 template <class T> class C {};
17621 template <class T> friend class N::C; // #1, valid code
17623 template <class T> class Y {
17624 friend class N::C; // #2, invalid code
17627 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17628 name lookup of `N::C'. We see that friend declaration must
17629 be template for the code to be valid. Note that
17630 processing_template_decl does not work here since it is
17631 always 1 for the above two cases. */
17633 decl
= (cp_parser_maybe_treat_template_as_class
17634 (decl
, /*tag_name_p=*/is_friend
17635 && template_parm_lists_apply
));
17637 if (TREE_CODE (decl
) != TYPE_DECL
)
17639 cp_parser_diagnose_invalid_type_name (parser
,
17642 return error_mark_node
;
17645 if (TREE_CODE (TREE_TYPE (decl
)) != TYPENAME_TYPE
)
17647 bool allow_template
= (template_parm_lists_apply
17648 || DECL_SELF_REFERENCE_P (decl
));
17649 type
= check_elaborated_type_specifier (tag_type
, decl
,
17652 if (type
== error_mark_node
)
17653 return error_mark_node
;
17656 /* Forward declarations of nested types, such as
17661 are invalid unless all components preceding the final '::'
17662 are complete. If all enclosing types are complete, these
17663 declarations become merely pointless.
17665 Invalid forward declarations of nested types are errors
17666 caught elsewhere in parsing. Those that are pointless arrive
17669 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
17670 && !is_friend
&& !processing_explicit_instantiation
)
17671 warning (0, "declaration %qD does not declare anything", decl
);
17673 type
= TREE_TYPE (decl
);
17677 /* An elaborated-type-specifier sometimes introduces a new type and
17678 sometimes names an existing type. Normally, the rule is that it
17679 introduces a new type only if there is not an existing type of
17680 the same name already in scope. For example, given:
17683 void f() { struct S s; }
17685 the `struct S' in the body of `f' is the same `struct S' as in
17686 the global scope; the existing definition is used. However, if
17687 there were no global declaration, this would introduce a new
17688 local class named `S'.
17690 An exception to this rule applies to the following code:
17692 namespace N { struct S; }
17694 Here, the elaborated-type-specifier names a new type
17695 unconditionally; even if there is already an `S' in the
17696 containing scope this declaration names a new type.
17697 This exception only applies if the elaborated-type-specifier
17698 forms the complete declaration:
17702 A declaration consisting solely of `class-key identifier ;' is
17703 either a redeclaration of the name in the current scope or a
17704 forward declaration of the identifier as a class name. It
17705 introduces the name into the current scope.
17707 We are in this situation precisely when the next token is a `;'.
17709 An exception to the exception is that a `friend' declaration does
17710 *not* name a new type; i.e., given:
17712 struct S { friend struct T; };
17714 `T' is not a new type in the scope of `S'.
17716 Also, `new struct S' or `sizeof (struct S)' never results in the
17717 definition of a new type; a new type can only be declared in a
17718 declaration context. */
17724 /* Friends have special name lookup rules. */
17725 ts
= ts_within_enclosing_non_class
;
17726 else if (is_declaration
17727 && cp_lexer_next_token_is (parser
->lexer
,
17729 /* This is a `class-key identifier ;' */
17735 (template_parm_lists_apply
17736 && (cp_parser_next_token_starts_class_definition_p (parser
)
17737 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)));
17738 /* An unqualified name was used to reference this type, so
17739 there were no qualifying templates. */
17740 if (template_parm_lists_apply
17741 && !cp_parser_check_template_parameters (parser
,
17742 /*num_templates=*/0,
17744 /*declarator=*/NULL
))
17745 return error_mark_node
;
17746 type
= xref_tag (tag_type
, identifier
, ts
, template_p
);
17750 if (type
== error_mark_node
)
17751 return error_mark_node
;
17753 /* Allow attributes on forward declarations of classes. */
17756 if (TREE_CODE (type
) == TYPENAME_TYPE
)
17757 warning (OPT_Wattributes
,
17758 "attributes ignored on uninstantiated type");
17759 else if (tag_type
!= enum_type
&& CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
17760 && ! processing_explicit_instantiation
)
17761 warning (OPT_Wattributes
,
17762 "attributes ignored on template instantiation");
17763 else if (is_declaration
&& cp_parser_declares_only_class_p (parser
))
17764 cplus_decl_attributes (&type
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
17766 warning (OPT_Wattributes
,
17767 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
17770 if (tag_type
!= enum_type
)
17772 /* Indicate whether this class was declared as a `class' or as a
17774 if (CLASS_TYPE_P (type
))
17775 CLASSTYPE_DECLARED_CLASS (type
) = (tag_type
== class_type
);
17776 cp_parser_check_class_key (tag_type
, type
);
17779 /* A "<" cannot follow an elaborated type specifier. If that
17780 happens, the user was probably trying to form a template-id. */
17781 cp_parser_check_for_invalid_template_id (parser
, type
, tag_type
,
17787 /* Parse an enum-specifier.
17790 enum-head { enumerator-list [opt] }
17791 enum-head { enumerator-list , } [C++0x]
17794 enum-key identifier [opt] enum-base [opt]
17795 enum-key nested-name-specifier identifier enum-base [opt]
17800 enum struct [C++0x]
17803 : type-specifier-seq
17805 opaque-enum-specifier:
17806 enum-key identifier enum-base [opt] ;
17809 enum-key attributes[opt] identifier [opt] enum-base [opt]
17810 { enumerator-list [opt] }attributes[opt]
17811 enum-key attributes[opt] identifier [opt] enum-base [opt]
17812 { enumerator-list, }attributes[opt] [C++0x]
17814 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
17815 if the token stream isn't an enum-specifier after all. */
17818 cp_parser_enum_specifier (cp_parser
* parser
)
17821 tree type
= NULL_TREE
;
17823 tree nested_name_specifier
= NULL_TREE
;
17825 bool scoped_enum_p
= false;
17826 bool has_underlying_type
= false;
17827 bool nested_being_defined
= false;
17828 bool new_value_list
= false;
17829 bool is_new_type
= false;
17830 bool is_unnamed
= false;
17831 tree underlying_type
= NULL_TREE
;
17832 cp_token
*type_start_token
= NULL
;
17833 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
17835 parser
->colon_corrects_to_scope_p
= false;
17837 /* Parse tentatively so that we can back up if we don't find a
17839 cp_parser_parse_tentatively (parser
);
17841 /* Caller guarantees that the current token is 'enum', an identifier
17842 possibly follows, and the token after that is an opening brace.
17843 If we don't have an identifier, fabricate an anonymous name for
17844 the enumeration being defined. */
17845 cp_lexer_consume_token (parser
->lexer
);
17847 /* Parse the "class" or "struct", which indicates a scoped
17848 enumeration type in C++0x. */
17849 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
17850 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
17852 if (cxx_dialect
< cxx11
)
17853 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
17855 /* Consume the `struct' or `class' token. */
17856 cp_lexer_consume_token (parser
->lexer
);
17858 scoped_enum_p
= true;
17861 attributes
= cp_parser_attributes_opt (parser
);
17863 /* Clear the qualification. */
17864 parser
->scope
= NULL_TREE
;
17865 parser
->qualifying_scope
= NULL_TREE
;
17866 parser
->object_scope
= NULL_TREE
;
17868 /* Figure out in what scope the declaration is being placed. */
17869 prev_scope
= current_scope ();
17871 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
17873 push_deferring_access_checks (dk_no_check
);
17874 nested_name_specifier
17875 = cp_parser_nested_name_specifier_opt (parser
,
17876 /*typename_keyword_p=*/true,
17877 /*check_dependency_p=*/false,
17879 /*is_declaration=*/false);
17881 if (nested_name_specifier
)
17885 identifier
= cp_parser_identifier (parser
);
17886 name
= cp_parser_lookup_name (parser
, identifier
,
17888 /*is_template=*/false,
17889 /*is_namespace=*/false,
17890 /*check_dependency=*/true,
17891 /*ambiguous_decls=*/NULL
,
17893 if (name
&& name
!= error_mark_node
)
17895 type
= TREE_TYPE (name
);
17896 if (TREE_CODE (type
) == TYPENAME_TYPE
)
17898 /* Are template enums allowed in ISO? */
17899 if (template_parm_scope_p ())
17900 pedwarn (type_start_token
->location
, OPT_Wpedantic
,
17901 "%qD is an enumeration template", name
);
17902 /* ignore a typename reference, for it will be solved by name
17907 else if (nested_name_specifier
== error_mark_node
)
17908 /* We already issued an error. */;
17911 error_at (type_start_token
->location
,
17912 "%qD does not name an enumeration in %qT",
17913 identifier
, nested_name_specifier
);
17914 nested_name_specifier
= error_mark_node
;
17919 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
17920 identifier
= cp_parser_identifier (parser
);
17923 identifier
= make_anon_name ();
17926 error_at (type_start_token
->location
,
17927 "unnamed scoped enum is not allowed");
17930 pop_deferring_access_checks ();
17932 /* Check for the `:' that denotes a specified underlying type in C++0x.
17933 Note that a ':' could also indicate a bitfield width, however. */
17934 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
17936 cp_decl_specifier_seq type_specifiers
;
17938 /* Consume the `:'. */
17939 cp_lexer_consume_token (parser
->lexer
);
17941 /* Parse the type-specifier-seq. */
17942 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
17943 /*is_trailing_return=*/false,
17946 /* At this point this is surely not elaborated type specifier. */
17947 if (!cp_parser_parse_definitely (parser
))
17950 if (cxx_dialect
< cxx11
)
17951 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
17953 has_underlying_type
= true;
17955 /* If that didn't work, stop. */
17956 if (type_specifiers
.type
!= error_mark_node
)
17958 underlying_type
= grokdeclarator (NULL
, &type_specifiers
, TYPENAME
,
17959 /*initialized=*/0, NULL
);
17960 if (underlying_type
== error_mark_node
17961 || check_for_bare_parameter_packs (underlying_type
))
17962 underlying_type
= NULL_TREE
;
17966 /* Look for the `{' but don't consume it yet. */
17967 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
17969 if (cxx_dialect
< cxx11
|| (!scoped_enum_p
&& !underlying_type
))
17971 cp_parser_error (parser
, "expected %<{%>");
17972 if (has_underlying_type
)
17978 /* An opaque-enum-specifier must have a ';' here. */
17979 if ((scoped_enum_p
|| underlying_type
)
17980 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
17982 cp_parser_error (parser
, "expected %<;%> or %<{%>");
17983 if (has_underlying_type
)
17991 if (!has_underlying_type
&& !cp_parser_parse_definitely (parser
))
17994 if (nested_name_specifier
)
17996 if (CLASS_TYPE_P (nested_name_specifier
))
17998 nested_being_defined
= TYPE_BEING_DEFINED (nested_name_specifier
);
17999 TYPE_BEING_DEFINED (nested_name_specifier
) = 1;
18000 push_scope (nested_name_specifier
);
18002 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
18004 push_nested_namespace (nested_name_specifier
);
18008 /* Issue an error message if type-definitions are forbidden here. */
18009 if (!cp_parser_check_type_definition (parser
))
18010 type
= error_mark_node
;
18012 /* Create the new type. We do this before consuming the opening
18013 brace so the enum will be recorded as being on the line of its
18014 tag (or the 'enum' keyword, if there is no tag). */
18015 type
= start_enum (identifier
, type
, underlying_type
,
18016 attributes
, scoped_enum_p
, &is_new_type
);
18018 /* If the next token is not '{' it is an opaque-enum-specifier or an
18019 elaborated-type-specifier. */
18020 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
18022 timevar_push (TV_PARSE_ENUM
);
18023 if (nested_name_specifier
18024 && nested_name_specifier
!= error_mark_node
)
18026 /* The following catches invalid code such as:
18027 enum class S<int>::E { A, B, C }; */
18028 if (!processing_specialization
18029 && CLASS_TYPE_P (nested_name_specifier
)
18030 && CLASSTYPE_USE_TEMPLATE (nested_name_specifier
))
18031 error_at (type_start_token
->location
, "cannot add an enumerator "
18032 "list to a template instantiation");
18034 if (TREE_CODE (nested_name_specifier
) == TYPENAME_TYPE
)
18036 error_at (type_start_token
->location
,
18037 "%<%T::%E%> has not been declared",
18038 TYPE_CONTEXT (nested_name_specifier
),
18039 nested_name_specifier
);
18040 type
= error_mark_node
;
18042 else if (TREE_CODE (nested_name_specifier
) != NAMESPACE_DECL
18043 && !CLASS_TYPE_P (nested_name_specifier
))
18045 error_at (type_start_token
->location
, "nested name specifier "
18046 "%qT for enum declaration does not name a class "
18047 "or namespace", nested_name_specifier
);
18048 type
= error_mark_node
;
18050 /* If that scope does not contain the scope in which the
18051 class was originally declared, the program is invalid. */
18052 else if (prev_scope
&& !is_ancestor (prev_scope
,
18053 nested_name_specifier
))
18055 if (at_namespace_scope_p ())
18056 error_at (type_start_token
->location
,
18057 "declaration of %qD in namespace %qD which does not "
18059 type
, prev_scope
, nested_name_specifier
);
18061 error_at (type_start_token
->location
,
18062 "declaration of %qD in %qD which does not "
18064 type
, prev_scope
, nested_name_specifier
);
18065 type
= error_mark_node
;
18067 /* If that scope is the scope where the declaration is being placed
18068 the program is invalid. */
18069 else if (CLASS_TYPE_P (nested_name_specifier
)
18070 && CLASS_TYPE_P (prev_scope
)
18071 && same_type_p (nested_name_specifier
, prev_scope
))
18073 permerror (type_start_token
->location
,
18074 "extra qualification not allowed");
18075 nested_name_specifier
= NULL_TREE
;
18080 begin_scope (sk_scoped_enum
, type
);
18082 /* Consume the opening brace. */
18083 cp_lexer_consume_token (parser
->lexer
);
18085 if (type
== error_mark_node
)
18086 ; /* Nothing to add */
18087 else if (OPAQUE_ENUM_P (type
)
18088 || (cxx_dialect
> cxx98
&& processing_specialization
))
18090 new_value_list
= true;
18091 SET_OPAQUE_ENUM_P (type
, false);
18092 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
18096 error_at (type_start_token
->location
,
18097 "multiple definition of %q#T", type
);
18098 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)),
18099 "previous definition here");
18100 type
= error_mark_node
;
18103 if (type
== error_mark_node
)
18104 cp_parser_skip_to_end_of_block_or_statement (parser
);
18105 /* If the next token is not '}', then there are some enumerators. */
18106 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
18108 if (is_unnamed
&& !scoped_enum_p
)
18109 pedwarn (type_start_token
->location
, OPT_Wpedantic
,
18110 "ISO C++ forbids empty unnamed enum");
18113 cp_parser_enumerator_list (parser
, type
);
18115 /* Consume the final '}'. */
18116 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
18120 timevar_pop (TV_PARSE_ENUM
);
18124 /* If a ';' follows, then it is an opaque-enum-specifier
18125 and additional restrictions apply. */
18126 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
18129 error_at (type_start_token
->location
,
18130 "opaque-enum-specifier without name");
18131 else if (nested_name_specifier
)
18132 error_at (type_start_token
->location
,
18133 "opaque-enum-specifier must use a simple identifier");
18137 /* Look for trailing attributes to apply to this enumeration, and
18138 apply them if appropriate. */
18139 if (cp_parser_allow_gnu_extensions_p (parser
))
18141 tree trailing_attr
= cp_parser_gnu_attributes_opt (parser
);
18142 cplus_decl_attributes (&type
,
18144 (int) ATTR_FLAG_TYPE_IN_PLACE
);
18147 /* Finish up the enumeration. */
18148 if (type
!= error_mark_node
)
18150 if (new_value_list
)
18151 finish_enum_value_list (type
);
18153 finish_enum (type
);
18156 if (nested_name_specifier
)
18158 if (CLASS_TYPE_P (nested_name_specifier
))
18160 TYPE_BEING_DEFINED (nested_name_specifier
) = nested_being_defined
;
18161 pop_scope (nested_name_specifier
);
18163 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
18165 pop_nested_namespace (nested_name_specifier
);
18169 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
18173 /* Parse an enumerator-list. The enumerators all have the indicated
18177 enumerator-definition
18178 enumerator-list , enumerator-definition */
18181 cp_parser_enumerator_list (cp_parser
* parser
, tree type
)
18185 /* Parse an enumerator-definition. */
18186 cp_parser_enumerator_definition (parser
, type
);
18188 /* If the next token is not a ',', we've reached the end of
18190 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
18192 /* Otherwise, consume the `,' and keep going. */
18193 cp_lexer_consume_token (parser
->lexer
);
18194 /* If the next token is a `}', there is a trailing comma. */
18195 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
18197 if (cxx_dialect
< cxx11
&& !in_system_header_at (input_location
))
18198 pedwarn (input_location
, OPT_Wpedantic
,
18199 "comma at end of enumerator list");
18205 /* Parse an enumerator-definition. The enumerator has the indicated
18208 enumerator-definition:
18210 enumerator = constant-expression
18217 enumerator-definition:
18218 enumerator attributes [opt]
18219 enumerator attributes [opt] = constant-expression */
18222 cp_parser_enumerator_definition (cp_parser
* parser
, tree type
)
18228 /* Save the input location because we are interested in the location
18229 of the identifier and not the location of the explicit value. */
18230 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
18232 /* Look for the identifier. */
18233 identifier
= cp_parser_identifier (parser
);
18234 if (identifier
== error_mark_node
)
18237 /* Parse any specified attributes. */
18238 tree attrs
= cp_parser_attributes_opt (parser
);
18240 /* If the next token is an '=', then there is an explicit value. */
18241 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
18243 /* Consume the `=' token. */
18244 cp_lexer_consume_token (parser
->lexer
);
18245 /* Parse the value. */
18246 value
= cp_parser_constant_expression (parser
);
18251 /* If we are processing a template, make sure the initializer of the
18252 enumerator doesn't contain any bare template parameter pack. */
18253 if (check_for_bare_parameter_packs (value
))
18254 value
= error_mark_node
;
18256 /* Create the enumerator. */
18257 build_enumerator (identifier
, value
, type
, attrs
, loc
);
18260 /* Parse a namespace-name.
18263 original-namespace-name
18266 Returns the NAMESPACE_DECL for the namespace. */
18269 cp_parser_namespace_name (cp_parser
* parser
)
18272 tree namespace_decl
;
18274 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
18276 /* Get the name of the namespace. */
18277 identifier
= cp_parser_identifier (parser
);
18278 if (identifier
== error_mark_node
)
18279 return error_mark_node
;
18281 /* Look up the identifier in the currently active scope. Look only
18282 for namespaces, due to:
18284 [basic.lookup.udir]
18286 When looking up a namespace-name in a using-directive or alias
18287 definition, only namespace names are considered.
18291 [basic.lookup.qual]
18293 During the lookup of a name preceding the :: scope resolution
18294 operator, object, function, and enumerator names are ignored.
18296 (Note that cp_parser_qualifying_entity only calls this
18297 function if the token after the name is the scope resolution
18299 namespace_decl
= cp_parser_lookup_name (parser
, identifier
,
18301 /*is_template=*/false,
18302 /*is_namespace=*/true,
18303 /*check_dependency=*/true,
18304 /*ambiguous_decls=*/NULL
,
18306 /* If it's not a namespace, issue an error. */
18307 if (namespace_decl
== error_mark_node
18308 || TREE_CODE (namespace_decl
) != NAMESPACE_DECL
)
18310 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
18311 error_at (token
->location
, "%qD is not a namespace-name", identifier
);
18312 cp_parser_error (parser
, "expected namespace-name");
18313 namespace_decl
= error_mark_node
;
18316 return namespace_decl
;
18319 /* Parse a namespace-definition.
18321 namespace-definition:
18322 named-namespace-definition
18323 unnamed-namespace-definition
18325 named-namespace-definition:
18326 original-namespace-definition
18327 extension-namespace-definition
18329 original-namespace-definition:
18330 namespace identifier { namespace-body }
18332 extension-namespace-definition:
18333 namespace original-namespace-name { namespace-body }
18335 unnamed-namespace-definition:
18336 namespace { namespace-body } */
18339 cp_parser_namespace_definition (cp_parser
* parser
)
18342 int nested_definition_count
= 0;
18344 cp_ensure_no_omp_declare_simd (parser
);
18345 cp_ensure_no_oacc_routine (parser
);
18347 bool is_inline
= cp_lexer_next_token_is_keyword (parser
->lexer
, RID_INLINE
);
18351 maybe_warn_cpp0x (CPP0X_INLINE_NAMESPACES
);
18352 cp_lexer_consume_token (parser
->lexer
);
18355 /* Look for the `namespace' keyword. */
18357 = cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
18359 /* Parse any specified attributes before the identifier. */
18360 tree attribs
= cp_parser_attributes_opt (parser
);
18364 identifier
= NULL_TREE
;
18366 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
18368 identifier
= cp_parser_identifier (parser
);
18370 /* Parse any attributes specified after the identifier. */
18371 attribs
= chainon (attribs
, cp_parser_attributes_opt (parser
));
18374 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
))
18377 if (!nested_definition_count
&& cxx_dialect
< cxx1z
)
18378 pedwarn (input_location
, OPT_Wpedantic
,
18379 "nested namespace definitions only available with "
18380 "-std=c++1z or -std=gnu++1z");
18382 /* Nested namespace names can create new namespaces (unlike
18383 other qualified-ids). */
18384 if (int count
= identifier
? push_namespace (identifier
) : 0)
18385 nested_definition_count
+= count
;
18387 cp_parser_error (parser
, "nested namespace name required");
18388 cp_lexer_consume_token (parser
->lexer
);
18391 if (nested_definition_count
&& !identifier
)
18392 cp_parser_error (parser
, "namespace name required");
18394 if (nested_definition_count
&& attribs
)
18395 error_at (token
->location
,
18396 "a nested namespace definition cannot have attributes");
18397 if (nested_definition_count
&& is_inline
)
18398 error_at (token
->location
,
18399 "a nested namespace definition cannot be inline");
18401 /* Start the namespace. */
18402 nested_definition_count
+= push_namespace (identifier
, is_inline
);
18404 bool has_visibility
= handle_namespace_attrs (current_namespace
, attribs
);
18406 warning (OPT_Wnamespaces
, "namespace %qD entered", current_namespace
);
18408 /* Look for the `{' to validate starting the namespace. */
18409 if (cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
18411 /* Parse the body of the namespace. */
18412 cp_parser_namespace_body (parser
);
18414 /* Look for the final `}'. */
18415 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
18418 if (has_visibility
)
18419 pop_visibility (1);
18421 /* Pop the nested namespace definitions. */
18422 while (nested_definition_count
--)
18426 /* Parse a namespace-body.
18429 declaration-seq [opt] */
18432 cp_parser_namespace_body (cp_parser
* parser
)
18434 cp_parser_declaration_seq_opt (parser
);
18437 /* Parse a namespace-alias-definition.
18439 namespace-alias-definition:
18440 namespace identifier = qualified-namespace-specifier ; */
18443 cp_parser_namespace_alias_definition (cp_parser
* parser
)
18446 tree namespace_specifier
;
18448 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
18450 /* Look for the `namespace' keyword. */
18451 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
18452 /* Look for the identifier. */
18453 identifier
= cp_parser_identifier (parser
);
18454 if (identifier
== error_mark_node
)
18456 /* Look for the `=' token. */
18457 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
)
18458 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
18460 error_at (token
->location
, "%<namespace%> definition is not allowed here");
18461 /* Skip the definition. */
18462 cp_lexer_consume_token (parser
->lexer
);
18463 if (cp_parser_skip_to_closing_brace (parser
))
18464 cp_lexer_consume_token (parser
->lexer
);
18467 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
18468 /* Look for the qualified-namespace-specifier. */
18469 namespace_specifier
18470 = cp_parser_qualified_namespace_specifier (parser
);
18471 /* Look for the `;' token. */
18472 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18474 /* Register the alias in the symbol table. */
18475 do_namespace_alias (identifier
, namespace_specifier
);
18478 /* Parse a qualified-namespace-specifier.
18480 qualified-namespace-specifier:
18481 :: [opt] nested-name-specifier [opt] namespace-name
18483 Returns a NAMESPACE_DECL corresponding to the specified
18487 cp_parser_qualified_namespace_specifier (cp_parser
* parser
)
18489 /* Look for the optional `::'. */
18490 cp_parser_global_scope_opt (parser
,
18491 /*current_scope_valid_p=*/false);
18493 /* Look for the optional nested-name-specifier. */
18494 cp_parser_nested_name_specifier_opt (parser
,
18495 /*typename_keyword_p=*/false,
18496 /*check_dependency_p=*/true,
18498 /*is_declaration=*/true);
18500 return cp_parser_namespace_name (parser
);
18503 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18504 access declaration.
18507 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18508 using :: unqualified-id ;
18510 access-declaration:
18516 cp_parser_using_declaration (cp_parser
* parser
,
18517 bool access_declaration_p
)
18520 bool typename_p
= false;
18521 bool global_scope_p
;
18525 int oldcount
= errorcount
;
18526 cp_token
*diag_token
= NULL
;
18528 if (access_declaration_p
)
18530 diag_token
= cp_lexer_peek_token (parser
->lexer
);
18531 cp_parser_parse_tentatively (parser
);
18535 /* Look for the `using' keyword. */
18536 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
18539 /* Peek at the next token. */
18540 token
= cp_lexer_peek_token (parser
->lexer
);
18541 /* See if it's `typename'. */
18542 if (token
->keyword
== RID_TYPENAME
)
18544 /* Remember that we've seen it. */
18546 /* Consume the `typename' token. */
18547 cp_lexer_consume_token (parser
->lexer
);
18551 /* Look for the optional global scope qualification. */
18553 = (cp_parser_global_scope_opt (parser
,
18554 /*current_scope_valid_p=*/false)
18557 /* If we saw `typename', or didn't see `::', then there must be a
18558 nested-name-specifier present. */
18559 if (typename_p
|| !global_scope_p
)
18561 qscope
= cp_parser_nested_name_specifier (parser
, typename_p
,
18562 /*check_dependency_p=*/true,
18564 /*is_declaration=*/true);
18565 if (!qscope
&& !cp_parser_uncommitted_to_tentative_parse_p (parser
))
18567 cp_parser_skip_to_end_of_block_or_statement (parser
);
18571 /* Otherwise, we could be in either of the two productions. In that
18572 case, treat the nested-name-specifier as optional. */
18574 qscope
= cp_parser_nested_name_specifier_opt (parser
,
18575 /*typename_keyword_p=*/false,
18576 /*check_dependency_p=*/true,
18578 /*is_declaration=*/true);
18580 qscope
= global_namespace
;
18581 else if (UNSCOPED_ENUM_P (qscope
))
18582 qscope
= CP_TYPE_CONTEXT (qscope
);
18584 if (access_declaration_p
&& cp_parser_error_occurred (parser
))
18585 /* Something has already gone wrong; there's no need to parse
18586 further. Since an error has occurred, the return value of
18587 cp_parser_parse_definitely will be false, as required. */
18588 return cp_parser_parse_definitely (parser
);
18590 token
= cp_lexer_peek_token (parser
->lexer
);
18591 /* Parse the unqualified-id. */
18592 identifier
= cp_parser_unqualified_id (parser
,
18593 /*template_keyword_p=*/false,
18594 /*check_dependency_p=*/true,
18595 /*declarator_p=*/true,
18596 /*optional_p=*/false);
18598 if (access_declaration_p
)
18600 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
18601 cp_parser_simulate_error (parser
);
18602 if (!cp_parser_parse_definitely (parser
))
18605 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
18607 cp_token
*ell
= cp_lexer_consume_token (parser
->lexer
);
18608 if (cxx_dialect
< cxx1z
18609 && !in_system_header_at (ell
->location
))
18610 pedwarn (ell
->location
, 0,
18611 "pack expansion in using-declaration only available "
18612 "with -std=c++1z or -std=gnu++1z");
18613 qscope
= make_pack_expansion (qscope
);
18616 /* The function we call to handle a using-declaration is different
18617 depending on what scope we are in. */
18618 if (qscope
== error_mark_node
|| identifier
== error_mark_node
)
18620 else if (!identifier_p (identifier
)
18621 && TREE_CODE (identifier
) != BIT_NOT_EXPR
)
18622 /* [namespace.udecl]
18624 A using declaration shall not name a template-id. */
18625 error_at (token
->location
,
18626 "a template-id may not appear in a using-declaration");
18629 if (at_class_scope_p ())
18631 /* Create the USING_DECL. */
18632 decl
= do_class_using_decl (qscope
, identifier
);
18634 if (decl
&& typename_p
)
18635 USING_DECL_TYPENAME_P (decl
) = 1;
18637 if (check_for_bare_parameter_packs (decl
))
18639 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18643 /* Add it to the list of members in this class. */
18644 finish_member_declaration (decl
);
18648 decl
= cp_parser_lookup_name_simple (parser
,
18651 if (decl
== error_mark_node
)
18652 cp_parser_name_lookup_error (parser
, identifier
,
18655 else if (check_for_bare_parameter_packs (decl
))
18657 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18660 else if (!at_namespace_scope_p ())
18661 finish_local_using_decl (decl
, qscope
, identifier
);
18663 finish_namespace_using_decl (decl
, qscope
, identifier
);
18667 if (!access_declaration_p
18668 && cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
18670 cp_token
*comma
= cp_lexer_consume_token (parser
->lexer
);
18671 if (cxx_dialect
< cxx1z
)
18672 pedwarn (comma
->location
, 0,
18673 "comma-separated list in using-declaration only available "
18674 "with -std=c++1z or -std=gnu++1z");
18678 /* Look for the final `;'. */
18679 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18681 if (access_declaration_p
&& errorcount
== oldcount
)
18682 warning_at (diag_token
->location
, OPT_Wdeprecated
,
18683 "access declarations are deprecated "
18684 "in favour of using-declarations; "
18685 "suggestion: add the %<using%> keyword");
18690 /* Parse an alias-declaration.
18693 using identifier attribute-specifier-seq [opt] = type-id */
18696 cp_parser_alias_declaration (cp_parser
* parser
)
18698 tree id
, type
, decl
, pushed_scope
= NULL_TREE
, attributes
;
18699 location_t id_location
;
18700 cp_declarator
*declarator
;
18701 cp_decl_specifier_seq decl_specs
;
18703 const char *saved_message
= NULL
;
18705 /* Look for the `using' keyword. */
18706 cp_token
*using_token
18707 = cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
18708 if (using_token
== NULL
)
18709 return error_mark_node
;
18711 id_location
= cp_lexer_peek_token (parser
->lexer
)->location
;
18712 id
= cp_parser_identifier (parser
);
18713 if (id
== error_mark_node
)
18714 return error_mark_node
;
18716 cp_token
*attrs_token
= cp_lexer_peek_token (parser
->lexer
);
18717 attributes
= cp_parser_attributes_opt (parser
);
18718 if (attributes
== error_mark_node
)
18719 return error_mark_node
;
18721 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
18723 if (cp_parser_error_occurred (parser
))
18724 return error_mark_node
;
18726 cp_parser_commit_to_tentative_parse (parser
);
18728 /* Now we are going to parse the type-id of the declaration. */
18733 "A type-specifier-seq shall not define a class or enumeration
18734 unless it appears in the type-id of an alias-declaration (7.1.3) that
18735 is not the declaration of a template-declaration."
18737 In other words, if we currently are in an alias template, the
18738 type-id should not define a type.
18740 So let's set parser->type_definition_forbidden_message in that
18741 case; cp_parser_check_type_definition (called by
18742 cp_parser_class_specifier) will then emit an error if a type is
18743 defined in the type-id. */
18744 if (parser
->num_template_parameter_lists
)
18746 saved_message
= parser
->type_definition_forbidden_message
;
18747 parser
->type_definition_forbidden_message
=
18748 G_("types may not be defined in alias template declarations");
18751 type
= cp_parser_type_id (parser
);
18753 /* Restore the error message if need be. */
18754 if (parser
->num_template_parameter_lists
)
18755 parser
->type_definition_forbidden_message
= saved_message
;
18757 if (type
== error_mark_node
18758 || !cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
18760 cp_parser_skip_to_end_of_block_or_statement (parser
);
18761 return error_mark_node
;
18764 /* A typedef-name can also be introduced by an alias-declaration. The
18765 identifier following the using keyword becomes a typedef-name. It has
18766 the same semantics as if it were introduced by the typedef
18767 specifier. In particular, it does not define a new type and it shall
18768 not appear in the type-id. */
18770 clear_decl_specs (&decl_specs
);
18771 decl_specs
.type
= type
;
18772 if (attributes
!= NULL_TREE
)
18774 decl_specs
.attributes
= attributes
;
18775 set_and_check_decl_spec_loc (&decl_specs
,
18779 set_and_check_decl_spec_loc (&decl_specs
,
18782 set_and_check_decl_spec_loc (&decl_specs
,
18786 declarator
= make_id_declarator (NULL_TREE
, id
, sfk_none
);
18787 declarator
->id_loc
= id_location
;
18789 member_p
= at_class_scope_p ();
18791 decl
= grokfield (declarator
, &decl_specs
, NULL_TREE
, false,
18792 NULL_TREE
, attributes
);
18794 decl
= start_decl (declarator
, &decl_specs
, 0,
18795 attributes
, NULL_TREE
, &pushed_scope
);
18796 if (decl
== error_mark_node
)
18799 // Attach constraints to the alias declaration.
18800 if (flag_concepts
&& current_template_parms
)
18802 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
18803 tree constr
= build_constraints (reqs
, NULL_TREE
);
18804 set_constraints (decl
, constr
);
18807 cp_finish_decl (decl
, NULL_TREE
, 0, NULL_TREE
, 0);
18810 pop_scope (pushed_scope
);
18812 /* If decl is a template, return its TEMPLATE_DECL so that it gets
18813 added into the symbol table; otherwise, return the TYPE_DECL. */
18814 if (DECL_LANG_SPECIFIC (decl
)
18815 && DECL_TEMPLATE_INFO (decl
)
18816 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
18818 decl
= DECL_TI_TEMPLATE (decl
);
18820 check_member_template (decl
);
18826 /* Parse a using-directive.
18829 using namespace :: [opt] nested-name-specifier [opt]
18830 namespace-name ; */
18833 cp_parser_using_directive (cp_parser
* parser
)
18835 tree namespace_decl
;
18838 /* Look for the `using' keyword. */
18839 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
18840 /* And the `namespace' keyword. */
18841 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
18842 /* Look for the optional `::' operator. */
18843 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
18844 /* And the optional nested-name-specifier. */
18845 cp_parser_nested_name_specifier_opt (parser
,
18846 /*typename_keyword_p=*/false,
18847 /*check_dependency_p=*/true,
18849 /*is_declaration=*/true);
18850 /* Get the namespace being used. */
18851 namespace_decl
= cp_parser_namespace_name (parser
);
18852 /* And any specified attributes. */
18853 attribs
= cp_parser_attributes_opt (parser
);
18855 /* Update the symbol table. */
18856 if (namespace_bindings_p ())
18857 finish_namespace_using_directive (namespace_decl
, attribs
);
18859 finish_local_using_directive (namespace_decl
, attribs
);
18861 /* Look for the final `;'. */
18862 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18865 /* Parse an asm-definition.
18868 asm ( string-literal ) ;
18873 asm volatile [opt] ( string-literal ) ;
18874 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18875 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18876 : asm-operand-list [opt] ) ;
18877 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18878 : asm-operand-list [opt]
18879 : asm-clobber-list [opt] ) ;
18880 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18881 : asm-clobber-list [opt]
18882 : asm-goto-list ) ; */
18885 cp_parser_asm_definition (cp_parser
* parser
)
18888 tree outputs
= NULL_TREE
;
18889 tree inputs
= NULL_TREE
;
18890 tree clobbers
= NULL_TREE
;
18891 tree labels
= NULL_TREE
;
18893 bool volatile_p
= false;
18894 bool extended_p
= false;
18895 bool invalid_inputs_p
= false;
18896 bool invalid_outputs_p
= false;
18897 bool goto_p
= false;
18898 required_token missing
= RT_NONE
;
18900 /* Look for the `asm' keyword. */
18901 cp_parser_require_keyword (parser
, RID_ASM
, RT_ASM
);
18903 if (parser
->in_function_body
18904 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
18906 error ("%<asm%> in %<constexpr%> function");
18907 cp_function_chain
->invalid_constexpr
= true;
18910 /* See if the next token is `volatile'. */
18911 if (cp_parser_allow_gnu_extensions_p (parser
)
18912 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_VOLATILE
))
18914 /* Remember that we saw the `volatile' keyword. */
18916 /* Consume the token. */
18917 cp_lexer_consume_token (parser
->lexer
);
18919 if (cp_parser_allow_gnu_extensions_p (parser
)
18920 && parser
->in_function_body
18921 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_GOTO
))
18923 /* Remember that we saw the `goto' keyword. */
18925 /* Consume the token. */
18926 cp_lexer_consume_token (parser
->lexer
);
18928 /* Look for the opening `('. */
18929 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
18931 /* Look for the string. */
18932 string
= cp_parser_string_literal (parser
, false, false);
18933 if (string
== error_mark_node
)
18935 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
18936 /*consume_paren=*/true);
18940 /* If we're allowing GNU extensions, check for the extended assembly
18941 syntax. Unfortunately, the `:' tokens need not be separated by
18942 a space in C, and so, for compatibility, we tolerate that here
18943 too. Doing that means that we have to treat the `::' operator as
18945 if (cp_parser_allow_gnu_extensions_p (parser
)
18946 && parser
->in_function_body
18947 && (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)
18948 || cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
)))
18950 bool inputs_p
= false;
18951 bool clobbers_p
= false;
18952 bool labels_p
= false;
18954 /* The extended syntax was used. */
18957 /* Look for outputs. */
18958 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
18960 /* Consume the `:'. */
18961 cp_lexer_consume_token (parser
->lexer
);
18962 /* Parse the output-operands. */
18963 if (cp_lexer_next_token_is_not (parser
->lexer
,
18965 && cp_lexer_next_token_is_not (parser
->lexer
,
18967 && cp_lexer_next_token_is_not (parser
->lexer
,
18971 outputs
= cp_parser_asm_operand_list (parser
);
18972 if (outputs
== error_mark_node
)
18973 invalid_outputs_p
= true;
18976 /* If the next token is `::', there are no outputs, and the
18977 next token is the beginning of the inputs. */
18978 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
18979 /* The inputs are coming next. */
18982 /* Look for inputs. */
18984 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
18986 /* Consume the `:' or `::'. */
18987 cp_lexer_consume_token (parser
->lexer
);
18988 /* Parse the output-operands. */
18989 if (cp_lexer_next_token_is_not (parser
->lexer
,
18991 && cp_lexer_next_token_is_not (parser
->lexer
,
18993 && cp_lexer_next_token_is_not (parser
->lexer
,
18996 inputs
= cp_parser_asm_operand_list (parser
);
18997 if (inputs
== error_mark_node
)
18998 invalid_inputs_p
= true;
19001 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
19002 /* The clobbers are coming next. */
19005 /* Look for clobbers. */
19007 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
19010 /* Consume the `:' or `::'. */
19011 cp_lexer_consume_token (parser
->lexer
);
19012 /* Parse the clobbers. */
19013 if (cp_lexer_next_token_is_not (parser
->lexer
,
19015 && cp_lexer_next_token_is_not (parser
->lexer
,
19017 clobbers
= cp_parser_asm_clobber_list (parser
);
19020 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
19021 /* The labels are coming next. */
19024 /* Look for labels. */
19026 || (goto_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)))
19029 /* Consume the `:' or `::'. */
19030 cp_lexer_consume_token (parser
->lexer
);
19031 /* Parse the labels. */
19032 labels
= cp_parser_asm_label_list (parser
);
19035 if (goto_p
&& !labels_p
)
19036 missing
= clobbers_p
? RT_COLON
: RT_COLON_SCOPE
;
19039 missing
= RT_COLON_SCOPE
;
19041 /* Look for the closing `)'. */
19042 if (!cp_parser_require (parser
, missing
? CPP_COLON
: CPP_CLOSE_PAREN
,
19043 missing
? missing
: RT_CLOSE_PAREN
))
19044 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
19045 /*consume_paren=*/true);
19046 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
19048 if (!invalid_inputs_p
&& !invalid_outputs_p
)
19050 /* Create the ASM_EXPR. */
19051 if (parser
->in_function_body
)
19053 asm_stmt
= finish_asm_stmt (volatile_p
, string
, outputs
,
19054 inputs
, clobbers
, labels
);
19055 /* If the extended syntax was not used, mark the ASM_EXPR. */
19058 tree temp
= asm_stmt
;
19059 if (TREE_CODE (temp
) == CLEANUP_POINT_EXPR
)
19060 temp
= TREE_OPERAND (temp
, 0);
19062 ASM_INPUT_P (temp
) = 1;
19066 symtab
->finalize_toplevel_asm (string
);
19070 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19071 type that comes from the decl-specifier-seq. */
19074 strip_declarator_types (tree type
, cp_declarator
*declarator
)
19076 for (cp_declarator
*d
= declarator
; d
;)
19086 if (TYPE_PTRMEMFUNC_P (type
))
19087 type
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
19088 type
= TREE_TYPE (type
);
19096 /* Declarators [gram.dcl.decl] */
19098 /* Parse an init-declarator.
19101 declarator initializer [opt]
19106 declarator asm-specification [opt] attributes [opt] initializer [opt]
19108 function-definition:
19109 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19111 decl-specifier-seq [opt] declarator function-try-block
19115 function-definition:
19116 __extension__ function-definition
19120 function-definition:
19121 decl-specifier-seq [opt] declarator function-transaction-block
19123 The DECL_SPECIFIERS apply to this declarator. Returns a
19124 representation of the entity declared. If MEMBER_P is TRUE, then
19125 this declarator appears in a class scope. The new DECL created by
19126 this declarator is returned.
19128 The CHECKS are access checks that should be performed once we know
19129 what entity is being declared (and, therefore, what classes have
19132 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19133 for a function-definition here as well. If the declarator is a
19134 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19135 be TRUE upon return. By that point, the function-definition will
19136 have been completely parsed.
19138 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19141 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19142 parsed declaration if it is an uninitialized single declarator not followed
19143 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19144 if present, will not be consumed. If returned, this declarator will be
19145 created with SD_INITIALIZED but will not call cp_finish_decl.
19147 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19148 and there is an initializer, the pointed location_t is set to the
19149 location of the '=' or `(', or '{' in C++11 token introducing the
19153 cp_parser_init_declarator (cp_parser
* parser
,
19154 cp_decl_specifier_seq
*decl_specifiers
,
19155 vec
<deferred_access_check
, va_gc
> *checks
,
19156 bool function_definition_allowed_p
,
19158 int declares_class_or_enum
,
19159 bool* function_definition_p
,
19160 tree
* maybe_range_for_decl
,
19161 location_t
* init_loc
,
19164 cp_token
*token
= NULL
, *asm_spec_start_token
= NULL
,
19165 *attributes_start_token
= NULL
;
19166 cp_declarator
*declarator
;
19167 tree prefix_attributes
;
19168 tree attributes
= NULL
;
19169 tree asm_specification
;
19171 tree decl
= NULL_TREE
;
19173 int is_initialized
;
19174 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19175 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19177 enum cpp_ttype initialization_kind
;
19178 bool is_direct_init
= false;
19179 bool is_non_constant_init
;
19180 int ctor_dtor_or_conv_p
;
19181 bool friend_p
= cp_parser_friend_p (decl_specifiers
);
19182 tree pushed_scope
= NULL_TREE
;
19183 bool range_for_decl_p
= false;
19184 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
19185 location_t tmp_init_loc
= UNKNOWN_LOCATION
;
19187 /* Gather the attributes that were provided with the
19188 decl-specifiers. */
19189 prefix_attributes
= decl_specifiers
->attributes
;
19191 /* Assume that this is not the declarator for a function
19193 if (function_definition_p
)
19194 *function_definition_p
= false;
19196 /* Default arguments are only permitted for function parameters. */
19197 if (decl_spec_seq_has_spec_p (decl_specifiers
, ds_typedef
))
19198 parser
->default_arg_ok_p
= false;
19200 /* Defer access checks while parsing the declarator; we cannot know
19201 what names are accessible until we know what is being
19203 resume_deferring_access_checks ();
19205 token
= cp_lexer_peek_token (parser
->lexer
);
19207 /* Parse the declarator. */
19209 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
19210 &ctor_dtor_or_conv_p
,
19211 /*parenthesized_p=*/NULL
,
19212 member_p
, friend_p
);
19213 /* Gather up the deferred checks. */
19214 stop_deferring_access_checks ();
19216 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
19218 /* If the DECLARATOR was erroneous, there's no need to go
19220 if (declarator
== cp_error_declarator
)
19221 return error_mark_node
;
19223 /* Check that the number of template-parameter-lists is OK. */
19224 if (!cp_parser_check_declarator_template_parameters (parser
, declarator
,
19226 return error_mark_node
;
19228 if (declares_class_or_enum
& 2)
19229 cp_parser_check_for_definition_in_return_type (declarator
,
19230 decl_specifiers
->type
,
19231 decl_specifiers
->locations
[ds_type_spec
]);
19233 /* Figure out what scope the entity declared by the DECLARATOR is
19234 located in. `grokdeclarator' sometimes changes the scope, so
19235 we compute it now. */
19236 scope
= get_scope_of_declarator (declarator
);
19238 /* Perform any lookups in the declared type which were thought to be
19239 dependent, but are not in the scope of the declarator. */
19240 decl_specifiers
->type
19241 = maybe_update_decl_type (decl_specifiers
->type
, scope
);
19243 /* If we're allowing GNU extensions, look for an
19244 asm-specification. */
19245 if (cp_parser_allow_gnu_extensions_p (parser
))
19247 /* Look for an asm-specification. */
19248 asm_spec_start_token
= cp_lexer_peek_token (parser
->lexer
);
19249 asm_specification
= cp_parser_asm_specification_opt (parser
);
19252 asm_specification
= NULL_TREE
;
19254 /* Look for attributes. */
19255 attributes_start_token
= cp_lexer_peek_token (parser
->lexer
);
19256 attributes
= cp_parser_attributes_opt (parser
);
19258 /* Peek at the next token. */
19259 token
= cp_lexer_peek_token (parser
->lexer
);
19261 bool bogus_implicit_tmpl
= false;
19263 if (function_declarator_p (declarator
))
19265 /* Handle C++17 deduction guides. */
19266 if (!decl_specifiers
->type
19267 && ctor_dtor_or_conv_p
<= 0
19268 && cxx_dialect
>= cxx1z
)
19270 cp_declarator
*id
= get_id_declarator (declarator
);
19271 tree name
= id
->u
.id
.unqualified_name
;
19272 parser
->scope
= id
->u
.id
.qualifying_scope
;
19273 tree tmpl
= cp_parser_lookup_name_simple (parser
, name
, id
->id_loc
);
19275 && (DECL_CLASS_TEMPLATE_P (tmpl
)
19276 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))
19278 id
->u
.id
.unqualified_name
= dguide_name (tmpl
);
19279 id
->u
.id
.sfk
= sfk_deduction_guide
;
19280 ctor_dtor_or_conv_p
= 1;
19284 /* Check to see if the token indicates the start of a
19285 function-definition. */
19286 if (cp_parser_token_starts_function_definition_p (token
))
19288 if (!function_definition_allowed_p
)
19290 /* If a function-definition should not appear here, issue an
19292 cp_parser_error (parser
,
19293 "a function-definition is not allowed here");
19294 return error_mark_node
;
19297 location_t func_brace_location
19298 = cp_lexer_peek_token (parser
->lexer
)->location
;
19300 /* Neither attributes nor an asm-specification are allowed
19301 on a function-definition. */
19302 if (asm_specification
)
19303 error_at (asm_spec_start_token
->location
,
19304 "an asm-specification is not allowed "
19305 "on a function-definition");
19307 error_at (attributes_start_token
->location
,
19308 "attributes are not allowed "
19309 "on a function-definition");
19310 /* This is a function-definition. */
19311 *function_definition_p
= true;
19313 /* Parse the function definition. */
19315 decl
= cp_parser_save_member_function_body (parser
,
19318 prefix_attributes
);
19321 (cp_parser_function_definition_from_specifiers_and_declarator
19322 (parser
, decl_specifiers
, prefix_attributes
, declarator
));
19324 if (decl
!= error_mark_node
&& DECL_STRUCT_FUNCTION (decl
))
19326 /* This is where the prologue starts... */
19327 DECL_STRUCT_FUNCTION (decl
)->function_start_locus
19328 = func_brace_location
;
19334 else if (parser
->fully_implicit_function_template_p
)
19336 /* A non-template declaration involving a function parameter list
19337 containing an implicit template parameter will be made into a
19338 template. If the resulting declaration is not going to be an
19339 actual function then finish the template scope here to prevent it.
19340 An error message will be issued once we have a decl to talk about.
19342 FIXME probably we should do type deduction rather than create an
19343 implicit template, but the standard currently doesn't allow it. */
19344 bogus_implicit_tmpl
= true;
19345 finish_fully_implicit_template (parser
, NULL_TREE
);
19350 Only in function declarations for constructors, destructors, type
19351 conversions, and deduction guides can the decl-specifier-seq be omitted.
19353 We explicitly postpone this check past the point where we handle
19354 function-definitions because we tolerate function-definitions
19355 that are missing their return types in some modes. */
19356 if (!decl_specifiers
->any_specifiers_p
&& ctor_dtor_or_conv_p
<= 0)
19358 cp_parser_error (parser
,
19359 "expected constructor, destructor, or type conversion");
19360 return error_mark_node
;
19363 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19364 if (token
->type
== CPP_EQ
19365 || token
->type
== CPP_OPEN_PAREN
19366 || token
->type
== CPP_OPEN_BRACE
)
19368 is_initialized
= SD_INITIALIZED
;
19369 initialization_kind
= token
->type
;
19370 if (maybe_range_for_decl
)
19371 *maybe_range_for_decl
= error_mark_node
;
19372 tmp_init_loc
= token
->location
;
19373 if (init_loc
&& *init_loc
== UNKNOWN_LOCATION
)
19374 *init_loc
= tmp_init_loc
;
19376 if (token
->type
== CPP_EQ
19377 && function_declarator_p (declarator
))
19379 cp_token
*t2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
19380 if (t2
->keyword
== RID_DEFAULT
)
19381 is_initialized
= SD_DEFAULTED
;
19382 else if (t2
->keyword
== RID_DELETE
)
19383 is_initialized
= SD_DELETED
;
19388 /* If the init-declarator isn't initialized and isn't followed by a
19389 `,' or `;', it's not a valid init-declarator. */
19390 if (token
->type
!= CPP_COMMA
19391 && token
->type
!= CPP_SEMICOLON
)
19393 if (maybe_range_for_decl
&& *maybe_range_for_decl
!= error_mark_node
)
19394 range_for_decl_p
= true;
19397 if (!maybe_range_for_decl
)
19398 cp_parser_error (parser
, "expected initializer");
19399 return error_mark_node
;
19402 is_initialized
= SD_UNINITIALIZED
;
19403 initialization_kind
= CPP_EOF
;
19406 /* Because start_decl has side-effects, we should only call it if we
19407 know we're going ahead. By this point, we know that we cannot
19408 possibly be looking at any other construct. */
19409 cp_parser_commit_to_tentative_parse (parser
);
19411 /* Enter the newly declared entry in the symbol table. If we're
19412 processing a declaration in a class-specifier, we wait until
19413 after processing the initializer. */
19416 if (parser
->in_unbraced_linkage_specification_p
)
19417 decl_specifiers
->storage_class
= sc_extern
;
19418 decl
= start_decl (declarator
, decl_specifiers
,
19419 range_for_decl_p
? SD_INITIALIZED
: is_initialized
,
19420 attributes
, prefix_attributes
, &pushed_scope
);
19421 cp_finalize_omp_declare_simd (parser
, decl
);
19422 cp_finalize_oacc_routine (parser
, decl
, false);
19423 /* Adjust location of decl if declarator->id_loc is more appropriate:
19424 set, and decl wasn't merged with another decl, in which case its
19425 location would be different from input_location, and more accurate. */
19427 && declarator
->id_loc
!= UNKNOWN_LOCATION
19428 && DECL_SOURCE_LOCATION (decl
) == input_location
)
19429 DECL_SOURCE_LOCATION (decl
) = declarator
->id_loc
;
19432 /* Enter the SCOPE. That way unqualified names appearing in the
19433 initializer will be looked up in SCOPE. */
19434 pushed_scope
= push_scope (scope
);
19436 /* Perform deferred access control checks, now that we know in which
19437 SCOPE the declared entity resides. */
19438 if (!member_p
&& decl
)
19440 tree saved_current_function_decl
= NULL_TREE
;
19442 /* If the entity being declared is a function, pretend that we
19443 are in its scope. If it is a `friend', it may have access to
19444 things that would not otherwise be accessible. */
19445 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19447 saved_current_function_decl
= current_function_decl
;
19448 current_function_decl
= decl
;
19451 /* Perform access checks for template parameters. */
19452 cp_parser_perform_template_parameter_access_checks (checks
);
19454 /* Perform the access control checks for the declarator and the
19455 decl-specifiers. */
19456 perform_deferred_access_checks (tf_warning_or_error
);
19458 /* Restore the saved value. */
19459 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19460 current_function_decl
= saved_current_function_decl
;
19463 /* Parse the initializer. */
19464 initializer
= NULL_TREE
;
19465 is_direct_init
= false;
19466 is_non_constant_init
= true;
19467 if (is_initialized
)
19469 if (function_declarator_p (declarator
))
19471 if (initialization_kind
== CPP_EQ
)
19472 initializer
= cp_parser_pure_specifier (parser
);
19475 /* If the declaration was erroneous, we don't really
19476 know what the user intended, so just silently
19477 consume the initializer. */
19478 if (decl
!= error_mark_node
)
19479 error_at (tmp_init_loc
, "initializer provided for function");
19480 cp_parser_skip_to_closing_parenthesis (parser
,
19481 /*recovering=*/true,
19482 /*or_comma=*/false,
19483 /*consume_paren=*/true);
19488 /* We want to record the extra mangling scope for in-class
19489 initializers of class members and initializers of static data
19490 member templates. The former involves deferring
19491 parsing of the initializer until end of class as with default
19492 arguments. So right here we only handle the latter. */
19493 if (!member_p
&& processing_template_decl
)
19494 start_lambda_scope (decl
);
19495 initializer
= cp_parser_initializer (parser
,
19497 &is_non_constant_init
);
19498 if (!member_p
&& processing_template_decl
)
19499 finish_lambda_scope ();
19500 if (initializer
== error_mark_node
)
19501 cp_parser_skip_to_end_of_statement (parser
);
19505 /* The old parser allows attributes to appear after a parenthesized
19506 initializer. Mark Mitchell proposed removing this functionality
19507 on the GCC mailing lists on 2002-08-13. This parser accepts the
19508 attributes -- but ignores them. */
19509 if (cp_parser_allow_gnu_extensions_p (parser
)
19510 && initialization_kind
== CPP_OPEN_PAREN
)
19511 if (cp_parser_attributes_opt (parser
))
19512 warning (OPT_Wattributes
,
19513 "attributes after parenthesized initializer ignored");
19515 /* And now complain about a non-function implicit template. */
19516 if (bogus_implicit_tmpl
&& decl
!= error_mark_node
)
19517 error_at (DECL_SOURCE_LOCATION (decl
),
19518 "non-function %qD declared as implicit template", decl
);
19520 /* For an in-class declaration, use `grokfield' to create the
19526 pop_scope (pushed_scope
);
19527 pushed_scope
= NULL_TREE
;
19529 decl
= grokfield (declarator
, decl_specifiers
,
19530 initializer
, !is_non_constant_init
,
19531 /*asmspec=*/NULL_TREE
,
19532 chainon (attributes
, prefix_attributes
));
19533 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
19534 cp_parser_save_default_args (parser
, decl
);
19535 cp_finalize_omp_declare_simd (parser
, decl
);
19536 cp_finalize_oacc_routine (parser
, decl
, false);
19539 /* Finish processing the declaration. But, skip member
19541 if (!member_p
&& decl
&& decl
!= error_mark_node
&& !range_for_decl_p
)
19543 cp_finish_decl (decl
,
19544 initializer
, !is_non_constant_init
,
19546 /* If the initializer is in parentheses, then this is
19547 a direct-initialization, which means that an
19548 `explicit' constructor is OK. Otherwise, an
19549 `explicit' constructor cannot be used. */
19550 ((is_direct_init
|| !is_initialized
)
19551 ? LOOKUP_NORMAL
: LOOKUP_IMPLICIT
));
19553 else if ((cxx_dialect
!= cxx98
) && friend_p
19554 && decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
19555 /* Core issue #226 (C++0x only): A default template-argument
19556 shall not be specified in a friend class template
19558 check_default_tmpl_args (decl
, current_template_parms
, /*is_primary=*/true,
19559 /*is_partial=*/false, /*is_friend_decl=*/1);
19561 if (!friend_p
&& pushed_scope
)
19562 pop_scope (pushed_scope
);
19564 if (function_declarator_p (declarator
)
19565 && parser
->fully_implicit_function_template_p
)
19568 decl
= finish_fully_implicit_template (parser
, decl
);
19570 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
19573 if (auto_result
&& is_initialized
&& decl_specifiers
->type
19574 && type_uses_auto (decl_specifiers
->type
))
19575 *auto_result
= strip_declarator_types (TREE_TYPE (decl
), declarator
);
19580 /* Parse a declarator.
19584 ptr-operator declarator
19586 abstract-declarator:
19587 ptr-operator abstract-declarator [opt]
19588 direct-abstract-declarator
19593 attributes [opt] direct-declarator
19594 attributes [opt] ptr-operator declarator
19596 abstract-declarator:
19597 attributes [opt] ptr-operator abstract-declarator [opt]
19598 attributes [opt] direct-abstract-declarator
19600 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19601 detect constructors, destructors, deduction guides, or conversion operators.
19602 It is set to -1 if the declarator is a name, and +1 if it is a
19603 function. Otherwise it is set to zero. Usually you just want to
19604 test for >0, but internally the negative value is used.
19606 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19607 a decl-specifier-seq unless it declares a constructor, destructor,
19608 or conversion. It might seem that we could check this condition in
19609 semantic analysis, rather than parsing, but that makes it difficult
19610 to handle something like `f()'. We want to notice that there are
19611 no decl-specifiers, and therefore realize that this is an
19612 expression, not a declaration.)
19614 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19615 the declarator is a direct-declarator of the form "(...)".
19617 MEMBER_P is true iff this declarator is a member-declarator.
19619 FRIEND_P is true iff this declarator is a friend. */
19621 static cp_declarator
*
19622 cp_parser_declarator (cp_parser
* parser
,
19623 cp_parser_declarator_kind dcl_kind
,
19624 int* ctor_dtor_or_conv_p
,
19625 bool* parenthesized_p
,
19626 bool member_p
, bool friend_p
)
19628 cp_declarator
*declarator
;
19629 enum tree_code code
;
19630 cp_cv_quals cv_quals
;
19632 tree gnu_attributes
= NULL_TREE
, std_attributes
= NULL_TREE
;
19634 /* Assume this is not a constructor, destructor, or type-conversion
19636 if (ctor_dtor_or_conv_p
)
19637 *ctor_dtor_or_conv_p
= 0;
19639 if (cp_parser_allow_gnu_extensions_p (parser
))
19640 gnu_attributes
= cp_parser_gnu_attributes_opt (parser
);
19642 /* Check for the ptr-operator production. */
19643 cp_parser_parse_tentatively (parser
);
19644 /* Parse the ptr-operator. */
19645 code
= cp_parser_ptr_operator (parser
,
19650 /* If that worked, then we have a ptr-operator. */
19651 if (cp_parser_parse_definitely (parser
))
19653 /* If a ptr-operator was found, then this declarator was not
19655 if (parenthesized_p
)
19656 *parenthesized_p
= true;
19657 /* The dependent declarator is optional if we are parsing an
19658 abstract-declarator. */
19659 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
19660 cp_parser_parse_tentatively (parser
);
19662 /* Parse the dependent declarator. */
19663 declarator
= cp_parser_declarator (parser
, dcl_kind
,
19664 /*ctor_dtor_or_conv_p=*/NULL
,
19665 /*parenthesized_p=*/NULL
,
19666 /*member_p=*/false,
19669 /* If we are parsing an abstract-declarator, we must handle the
19670 case where the dependent declarator is absent. */
19671 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
19672 && !cp_parser_parse_definitely (parser
))
19675 declarator
= cp_parser_make_indirect_declarator
19676 (code
, class_type
, cv_quals
, declarator
, std_attributes
);
19678 /* Everything else is a direct-declarator. */
19681 if (parenthesized_p
)
19682 *parenthesized_p
= cp_lexer_next_token_is (parser
->lexer
,
19684 declarator
= cp_parser_direct_declarator (parser
, dcl_kind
,
19685 ctor_dtor_or_conv_p
,
19686 member_p
, friend_p
);
19689 if (gnu_attributes
&& declarator
&& declarator
!= cp_error_declarator
)
19690 declarator
->attributes
= gnu_attributes
;
19694 /* Parse a direct-declarator or direct-abstract-declarator.
19698 direct-declarator ( parameter-declaration-clause )
19699 cv-qualifier-seq [opt]
19700 ref-qualifier [opt]
19701 exception-specification [opt]
19702 direct-declarator [ constant-expression [opt] ]
19705 direct-abstract-declarator:
19706 direct-abstract-declarator [opt]
19707 ( parameter-declaration-clause )
19708 cv-qualifier-seq [opt]
19709 ref-qualifier [opt]
19710 exception-specification [opt]
19711 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19712 ( abstract-declarator )
19714 Returns a representation of the declarator. DCL_KIND is
19715 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19716 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19717 we are parsing a direct-declarator. It is
19718 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19719 of ambiguity we prefer an abstract declarator, as per
19720 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19721 as for cp_parser_declarator. */
19723 static cp_declarator
*
19724 cp_parser_direct_declarator (cp_parser
* parser
,
19725 cp_parser_declarator_kind dcl_kind
,
19726 int* ctor_dtor_or_conv_p
,
19727 bool member_p
, bool friend_p
)
19730 cp_declarator
*declarator
= NULL
;
19731 tree scope
= NULL_TREE
;
19732 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
19733 bool saved_in_declarator_p
= parser
->in_declarator_p
;
19735 tree pushed_scope
= NULL_TREE
;
19739 /* Peek at the next token. */
19740 token
= cp_lexer_peek_token (parser
->lexer
);
19741 if (token
->type
== CPP_OPEN_PAREN
)
19743 /* This is either a parameter-declaration-clause, or a
19744 parenthesized declarator. When we know we are parsing a
19745 named declarator, it must be a parenthesized declarator
19746 if FIRST is true. For instance, `(int)' is a
19747 parameter-declaration-clause, with an omitted
19748 direct-abstract-declarator. But `((*))', is a
19749 parenthesized abstract declarator. Finally, when T is a
19750 template parameter `(T)' is a
19751 parameter-declaration-clause, and not a parenthesized
19754 We first try and parse a parameter-declaration-clause,
19755 and then try a nested declarator (if FIRST is true).
19757 It is not an error for it not to be a
19758 parameter-declaration-clause, even when FIRST is
19764 The first is the declaration of a function while the
19765 second is the definition of a variable, including its
19768 Having seen only the parenthesis, we cannot know which of
19769 these two alternatives should be selected. Even more
19770 complex are examples like:
19775 The former is a function-declaration; the latter is a
19776 variable initialization.
19778 Thus again, we try a parameter-declaration-clause, and if
19779 that fails, we back out and return. */
19781 if (!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
19784 bool is_declarator
= false;
19786 /* In a member-declarator, the only valid interpretation
19787 of a parenthesis is the start of a
19788 parameter-declaration-clause. (It is invalid to
19789 initialize a static data member with a parenthesized
19790 initializer; only the "=" form of initialization is
19793 cp_parser_parse_tentatively (parser
);
19795 /* Consume the `('. */
19796 cp_lexer_consume_token (parser
->lexer
);
19799 /* If this is going to be an abstract declarator, we're
19800 in a declarator and we can't have default args. */
19801 parser
->default_arg_ok_p
= false;
19802 parser
->in_declarator_p
= true;
19805 begin_scope (sk_function_parms
, NULL_TREE
);
19807 /* Parse the parameter-declaration-clause. */
19808 params
= cp_parser_parameter_declaration_clause (parser
);
19810 /* Consume the `)'. */
19811 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
19813 /* If all went well, parse the cv-qualifier-seq,
19814 ref-qualifier and the exception-specification. */
19815 if (member_p
|| cp_parser_parse_definitely (parser
))
19817 cp_cv_quals cv_quals
;
19818 cp_virt_specifiers virt_specifiers
;
19819 cp_ref_qualifier ref_qual
;
19820 tree exception_specification
;
19823 bool memfn
= (member_p
|| (pushed_scope
19824 && CLASS_TYPE_P (pushed_scope
)));
19826 is_declarator
= true;
19828 if (ctor_dtor_or_conv_p
)
19829 *ctor_dtor_or_conv_p
= *ctor_dtor_or_conv_p
< 0;
19832 /* Parse the cv-qualifier-seq. */
19833 cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
19834 /* Parse the ref-qualifier. */
19835 ref_qual
= cp_parser_ref_qualifier_opt (parser
);
19836 /* Parse the tx-qualifier. */
19837 tree tx_qual
= cp_parser_tx_qualifier_opt (parser
);
19838 /* And the exception-specification. */
19839 exception_specification
19840 = cp_parser_exception_specification_opt (parser
);
19842 attrs
= cp_parser_std_attribute_spec_seq (parser
);
19844 /* In here, we handle cases where attribute is used after
19845 the function declaration. For example:
19846 void func (int x) __attribute__((vector(..))); */
19847 tree gnu_attrs
= NULL_TREE
;
19849 && cp_next_tokens_can_be_gnu_attribute_p (parser
))
19851 cp_parser_parse_tentatively (parser
);
19852 tree attr
= cp_parser_gnu_attributes_opt (parser
);
19853 if (cp_lexer_next_token_is_not (parser
->lexer
,
19855 && cp_lexer_next_token_is_not (parser
->lexer
,
19857 cp_parser_abort_tentative_parse (parser
);
19858 else if (!cp_parser_parse_definitely (parser
))
19863 tree requires_clause
= NULL_TREE
;
19864 late_return
= (cp_parser_late_return_type_opt
19865 (parser
, declarator
, requires_clause
,
19866 memfn
? cv_quals
: -1));
19868 /* Parse the virt-specifier-seq. */
19869 virt_specifiers
= cp_parser_virt_specifier_seq_opt (parser
);
19871 /* Create the function-declarator. */
19872 declarator
= make_call_declarator (declarator
,
19878 exception_specification
,
19881 declarator
->std_attributes
= attrs
;
19882 declarator
->attributes
= gnu_attrs
;
19883 /* Any subsequent parameter lists are to do with
19884 return type, so are not those of the declared
19886 parser
->default_arg_ok_p
= false;
19889 /* Remove the function parms from scope. */
19890 pop_bindings_and_leave_scope ();
19893 /* Repeat the main loop. */
19897 /* If this is the first, we can try a parenthesized
19901 bool saved_in_type_id_in_expr_p
;
19903 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
19904 parser
->in_declarator_p
= saved_in_declarator_p
;
19906 /* Consume the `('. */
19907 cp_lexer_consume_token (parser
->lexer
);
19908 /* Parse the nested declarator. */
19909 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
19910 parser
->in_type_id_in_expr_p
= true;
19912 = cp_parser_declarator (parser
, dcl_kind
, ctor_dtor_or_conv_p
,
19913 /*parenthesized_p=*/NULL
,
19914 member_p
, friend_p
);
19915 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
19917 /* Expect a `)'. */
19918 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
19919 declarator
= cp_error_declarator
;
19920 if (declarator
== cp_error_declarator
)
19923 goto handle_declarator
;
19925 /* Otherwise, we must be done. */
19929 else if ((!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
19930 && token
->type
== CPP_OPEN_SQUARE
19931 && !cp_next_tokens_can_be_attribute_p (parser
))
19933 /* Parse an array-declarator. */
19934 tree bounds
, attrs
;
19936 if (ctor_dtor_or_conv_p
)
19937 *ctor_dtor_or_conv_p
= 0;
19940 parser
->default_arg_ok_p
= false;
19941 parser
->in_declarator_p
= true;
19942 /* Consume the `['. */
19943 cp_lexer_consume_token (parser
->lexer
);
19944 /* Peek at the next token. */
19945 token
= cp_lexer_peek_token (parser
->lexer
);
19946 /* If the next token is `]', then there is no
19947 constant-expression. */
19948 if (token
->type
!= CPP_CLOSE_SQUARE
)
19950 bool non_constant_p
;
19952 = cp_parser_constant_expression (parser
,
19953 /*allow_non_constant=*/true,
19955 if (!non_constant_p
)
19957 else if (error_operand_p (bounds
))
19958 /* Already gave an error. */;
19959 else if (!parser
->in_function_body
19960 || current_binding_level
->kind
== sk_function_parms
)
19962 /* Normally, the array bound must be an integral constant
19963 expression. However, as an extension, we allow VLAs
19964 in function scopes as long as they aren't part of a
19965 parameter declaration. */
19966 cp_parser_error (parser
,
19967 "array bound is not an integer constant");
19968 bounds
= error_mark_node
;
19970 else if (processing_template_decl
19971 && !type_dependent_expression_p (bounds
))
19973 /* Remember this wasn't a constant-expression. */
19974 bounds
= build_nop (TREE_TYPE (bounds
), bounds
);
19975 TREE_SIDE_EFFECTS (bounds
) = 1;
19979 bounds
= NULL_TREE
;
19980 /* Look for the closing `]'. */
19981 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
19983 declarator
= cp_error_declarator
;
19987 attrs
= cp_parser_std_attribute_spec_seq (parser
);
19988 declarator
= make_array_declarator (declarator
, bounds
);
19989 declarator
->std_attributes
= attrs
;
19991 else if (first
&& dcl_kind
!= CP_PARSER_DECLARATOR_ABSTRACT
)
19994 tree qualifying_scope
;
19995 tree unqualified_name
;
19997 special_function_kind sfk
;
19999 bool pack_expansion_p
= false;
20000 cp_token
*declarator_id_start_token
;
20002 /* Parse a declarator-id */
20003 abstract_ok
= (dcl_kind
== CP_PARSER_DECLARATOR_EITHER
);
20006 cp_parser_parse_tentatively (parser
);
20008 /* If we see an ellipsis, we should be looking at a
20010 if (token
->type
== CPP_ELLIPSIS
)
20012 /* Consume the `...' */
20013 cp_lexer_consume_token (parser
->lexer
);
20015 pack_expansion_p
= true;
20019 declarator_id_start_token
= cp_lexer_peek_token (parser
->lexer
);
20021 = cp_parser_declarator_id (parser
, /*optional_p=*/abstract_ok
);
20022 qualifying_scope
= parser
->scope
;
20027 if (!unqualified_name
&& pack_expansion_p
)
20029 /* Check whether an error occurred. */
20030 okay
= !cp_parser_error_occurred (parser
);
20032 /* We already consumed the ellipsis to mark a
20033 parameter pack, but we have no way to report it,
20034 so abort the tentative parse. We will be exiting
20035 immediately anyway. */
20036 cp_parser_abort_tentative_parse (parser
);
20039 okay
= cp_parser_parse_definitely (parser
);
20042 unqualified_name
= error_mark_node
;
20043 else if (unqualified_name
20044 && (qualifying_scope
20045 || (!identifier_p (unqualified_name
))))
20047 cp_parser_error (parser
, "expected unqualified-id");
20048 unqualified_name
= error_mark_node
;
20052 if (!unqualified_name
)
20054 if (unqualified_name
== error_mark_node
)
20056 declarator
= cp_error_declarator
;
20057 pack_expansion_p
= false;
20058 declarator
->parameter_pack_p
= false;
20062 attrs
= cp_parser_std_attribute_spec_seq (parser
);
20064 if (qualifying_scope
&& at_namespace_scope_p ()
20065 && TREE_CODE (qualifying_scope
) == TYPENAME_TYPE
)
20067 /* In the declaration of a member of a template class
20068 outside of the class itself, the SCOPE will sometimes
20069 be a TYPENAME_TYPE. For example, given:
20071 template <typename T>
20072 int S<T>::R::i = 3;
20074 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20075 this context, we must resolve S<T>::R to an ordinary
20076 type, rather than a typename type.
20078 The reason we normally avoid resolving TYPENAME_TYPEs
20079 is that a specialization of `S' might render
20080 `S<T>::R' not a type. However, if `S' is
20081 specialized, then this `i' will not be used, so there
20082 is no harm in resolving the types here. */
20085 /* Resolve the TYPENAME_TYPE. */
20086 type
= resolve_typename_type (qualifying_scope
,
20087 /*only_current_p=*/false);
20088 /* If that failed, the declarator is invalid. */
20089 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20091 if (typedef_variant_p (type
))
20092 error_at (declarator_id_start_token
->location
,
20093 "cannot define member of dependent typedef "
20096 error_at (declarator_id_start_token
->location
,
20097 "%<%T::%E%> is not a type",
20098 TYPE_CONTEXT (qualifying_scope
),
20099 TYPE_IDENTIFIER (qualifying_scope
));
20101 qualifying_scope
= type
;
20106 if (unqualified_name
)
20110 if (qualifying_scope
20111 && CLASS_TYPE_P (qualifying_scope
))
20112 class_type
= qualifying_scope
;
20114 class_type
= current_class_type
;
20116 if (TREE_CODE (unqualified_name
) == TYPE_DECL
)
20118 tree name_type
= TREE_TYPE (unqualified_name
);
20120 if (!class_type
|| !same_type_p (name_type
, class_type
))
20122 /* We do not attempt to print the declarator
20123 here because we do not have enough
20124 information about its original syntactic
20126 cp_parser_error (parser
, "invalid declarator");
20127 declarator
= cp_error_declarator
;
20130 else if (qualifying_scope
20131 && CLASSTYPE_USE_TEMPLATE (name_type
))
20133 error_at (declarator_id_start_token
->location
,
20134 "invalid use of constructor as a template");
20135 inform (declarator_id_start_token
->location
,
20136 "use %<%T::%D%> instead of %<%T::%D%> to "
20137 "name the constructor in a qualified name",
20139 DECL_NAME (TYPE_TI_TEMPLATE (class_type
)),
20140 class_type
, name_type
);
20141 declarator
= cp_error_declarator
;
20144 unqualified_name
= constructor_name (class_type
);
20149 if (TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
)
20150 sfk
= sfk_destructor
;
20151 else if (identifier_p (unqualified_name
)
20152 && IDENTIFIER_CONV_OP_P (unqualified_name
))
20153 sfk
= sfk_conversion
;
20154 else if (/* There's no way to declare a constructor
20155 for an unnamed type, even if the type
20156 got a name for linkage purposes. */
20157 !TYPE_WAS_UNNAMED (class_type
)
20158 /* Handle correctly (c++/19200):
20172 friend void N::S();
20174 && (!friend_p
|| class_type
== qualifying_scope
)
20175 && constructor_name_p (unqualified_name
,
20177 sfk
= sfk_constructor
;
20178 else if (is_overloaded_fn (unqualified_name
)
20179 && DECL_CONSTRUCTOR_P (get_first_fn
20180 (unqualified_name
)))
20181 sfk
= sfk_constructor
;
20183 if (ctor_dtor_or_conv_p
&& sfk
!= sfk_none
)
20184 *ctor_dtor_or_conv_p
= -1;
20187 declarator
= make_id_declarator (qualifying_scope
,
20190 declarator
->std_attributes
= attrs
;
20191 declarator
->id_loc
= token
->location
;
20192 declarator
->parameter_pack_p
= pack_expansion_p
;
20194 if (pack_expansion_p
)
20195 maybe_warn_variadic_templates ();
20198 handle_declarator
:;
20199 scope
= get_scope_of_declarator (declarator
);
20202 /* Any names that appear after the declarator-id for a
20203 member are looked up in the containing scope. */
20204 if (at_function_scope_p ())
20206 /* But declarations with qualified-ids can't appear in a
20208 cp_parser_error (parser
, "qualified-id in declaration");
20209 declarator
= cp_error_declarator
;
20212 pushed_scope
= push_scope (scope
);
20214 parser
->in_declarator_p
= true;
20215 if ((ctor_dtor_or_conv_p
&& *ctor_dtor_or_conv_p
)
20216 || (declarator
&& declarator
->kind
== cdk_id
))
20217 /* Default args are only allowed on function
20219 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
20221 parser
->default_arg_ok_p
= false;
20230 /* For an abstract declarator, we might wind up with nothing at this
20231 point. That's an error; the declarator is not optional. */
20233 cp_parser_error (parser
, "expected declarator");
20235 /* If we entered a scope, we must exit it now. */
20237 pop_scope (pushed_scope
);
20239 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
20240 parser
->in_declarator_p
= saved_in_declarator_p
;
20245 /* Parse a ptr-operator.
20248 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20249 * cv-qualifier-seq [opt]
20251 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20252 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20257 & cv-qualifier-seq [opt]
20259 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20260 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20261 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20262 filled in with the TYPE containing the member. *CV_QUALS is
20263 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20264 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20265 Note that the tree codes returned by this function have nothing
20266 to do with the types of trees that will be eventually be created
20267 to represent the pointer or reference type being parsed. They are
20268 just constants with suggestive names. */
20269 static enum tree_code
20270 cp_parser_ptr_operator (cp_parser
* parser
,
20272 cp_cv_quals
*cv_quals
,
20275 enum tree_code code
= ERROR_MARK
;
20277 tree attrs
= NULL_TREE
;
20279 /* Assume that it's not a pointer-to-member. */
20281 /* And that there are no cv-qualifiers. */
20282 *cv_quals
= TYPE_UNQUALIFIED
;
20284 /* Peek at the next token. */
20285 token
= cp_lexer_peek_token (parser
->lexer
);
20287 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20288 if (token
->type
== CPP_MULT
)
20289 code
= INDIRECT_REF
;
20290 else if (token
->type
== CPP_AND
)
20292 else if ((cxx_dialect
!= cxx98
) &&
20293 token
->type
== CPP_AND_AND
) /* C++0x only */
20294 code
= NON_LVALUE_EXPR
;
20296 if (code
!= ERROR_MARK
)
20298 /* Consume the `*', `&' or `&&'. */
20299 cp_lexer_consume_token (parser
->lexer
);
20301 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20302 `&', if we are allowing GNU extensions. (The only qualifier
20303 that can legally appear after `&' is `restrict', but that is
20304 enforced during semantic analysis. */
20305 if (code
== INDIRECT_REF
20306 || cp_parser_allow_gnu_extensions_p (parser
))
20307 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
20309 attrs
= cp_parser_std_attribute_spec_seq (parser
);
20310 if (attributes
!= NULL
)
20311 *attributes
= attrs
;
20315 /* Try the pointer-to-member case. */
20316 cp_parser_parse_tentatively (parser
);
20317 /* Look for the optional `::' operator. */
20318 cp_parser_global_scope_opt (parser
,
20319 /*current_scope_valid_p=*/false);
20320 /* Look for the nested-name specifier. */
20321 token
= cp_lexer_peek_token (parser
->lexer
);
20322 cp_parser_nested_name_specifier (parser
,
20323 /*typename_keyword_p=*/false,
20324 /*check_dependency_p=*/true,
20326 /*is_declaration=*/false);
20327 /* If we found it, and the next token is a `*', then we are
20328 indeed looking at a pointer-to-member operator. */
20329 if (!cp_parser_error_occurred (parser
)
20330 && cp_parser_require (parser
, CPP_MULT
, RT_MULT
))
20332 /* Indicate that the `*' operator was used. */
20333 code
= INDIRECT_REF
;
20335 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
20336 error_at (token
->location
, "%qD is a namespace", parser
->scope
);
20337 else if (TREE_CODE (parser
->scope
) == ENUMERAL_TYPE
)
20338 error_at (token
->location
, "cannot form pointer to member of "
20339 "non-class %q#T", parser
->scope
);
20342 /* The type of which the member is a member is given by the
20344 *type
= parser
->scope
;
20345 /* The next name will not be qualified. */
20346 parser
->scope
= NULL_TREE
;
20347 parser
->qualifying_scope
= NULL_TREE
;
20348 parser
->object_scope
= NULL_TREE
;
20349 /* Look for optional c++11 attributes. */
20350 attrs
= cp_parser_std_attribute_spec_seq (parser
);
20351 if (attributes
!= NULL
)
20352 *attributes
= attrs
;
20353 /* Look for the optional cv-qualifier-seq. */
20354 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
20357 /* If that didn't work we don't have a ptr-operator. */
20358 if (!cp_parser_parse_definitely (parser
))
20359 cp_parser_error (parser
, "expected ptr-operator");
20365 /* Parse an (optional) cv-qualifier-seq.
20368 cv-qualifier cv-qualifier-seq [opt]
20379 Returns a bitmask representing the cv-qualifiers. */
20382 cp_parser_cv_qualifier_seq_opt (cp_parser
* parser
)
20384 cp_cv_quals cv_quals
= TYPE_UNQUALIFIED
;
20389 cp_cv_quals cv_qualifier
;
20391 /* Peek at the next token. */
20392 token
= cp_lexer_peek_token (parser
->lexer
);
20393 /* See if it's a cv-qualifier. */
20394 switch (token
->keyword
)
20397 cv_qualifier
= TYPE_QUAL_CONST
;
20401 cv_qualifier
= TYPE_QUAL_VOLATILE
;
20405 cv_qualifier
= TYPE_QUAL_RESTRICT
;
20409 cv_qualifier
= TYPE_UNQUALIFIED
;
20416 if (cv_quals
& cv_qualifier
)
20418 gcc_rich_location
richloc (token
->location
);
20419 richloc
.add_fixit_remove ();
20420 error_at_rich_loc (&richloc
, "duplicate cv-qualifier");
20421 cp_lexer_purge_token (parser
->lexer
);
20425 cp_lexer_consume_token (parser
->lexer
);
20426 cv_quals
|= cv_qualifier
;
20433 /* Parse an (optional) ref-qualifier
20439 Returns cp_ref_qualifier representing ref-qualifier. */
20441 static cp_ref_qualifier
20442 cp_parser_ref_qualifier_opt (cp_parser
* parser
)
20444 cp_ref_qualifier ref_qual
= REF_QUAL_NONE
;
20446 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20447 if (cxx_dialect
< cxx11
&& cp_parser_parsing_tentatively (parser
))
20452 cp_ref_qualifier curr_ref_qual
= REF_QUAL_NONE
;
20453 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
20455 switch (token
->type
)
20458 curr_ref_qual
= REF_QUAL_LVALUE
;
20462 curr_ref_qual
= REF_QUAL_RVALUE
;
20466 curr_ref_qual
= REF_QUAL_NONE
;
20470 if (!curr_ref_qual
)
20474 error_at (token
->location
, "multiple ref-qualifiers");
20475 cp_lexer_purge_token (parser
->lexer
);
20479 ref_qual
= curr_ref_qual
;
20480 cp_lexer_consume_token (parser
->lexer
);
20487 /* Parse an optional tx-qualifier.
20491 transaction_safe_dynamic */
20494 cp_parser_tx_qualifier_opt (cp_parser
*parser
)
20496 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
20497 if (token
->type
== CPP_NAME
)
20499 tree name
= token
->u
.value
;
20500 const char *p
= IDENTIFIER_POINTER (name
);
20501 const int len
= strlen ("transaction_safe");
20502 if (!strncmp (p
, "transaction_safe", len
))
20506 || !strcmp (p
, "_dynamic"))
20508 cp_lexer_consume_token (parser
->lexer
);
20511 error ("%qE requires %<-fgnu-tm%>", name
);
20522 /* Parse an (optional) virt-specifier-seq.
20524 virt-specifier-seq:
20525 virt-specifier virt-specifier-seq [opt]
20531 Returns a bitmask representing the virt-specifiers. */
20533 static cp_virt_specifiers
20534 cp_parser_virt_specifier_seq_opt (cp_parser
* parser
)
20536 cp_virt_specifiers virt_specifiers
= VIRT_SPEC_UNSPECIFIED
;
20541 cp_virt_specifiers virt_specifier
;
20543 /* Peek at the next token. */
20544 token
= cp_lexer_peek_token (parser
->lexer
);
20545 /* See if it's a virt-specifier-qualifier. */
20546 if (token
->type
!= CPP_NAME
)
20548 if (id_equal (token
->u
.value
, "override"))
20550 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS
);
20551 virt_specifier
= VIRT_SPEC_OVERRIDE
;
20553 else if (id_equal (token
->u
.value
, "final"))
20555 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS
);
20556 virt_specifier
= VIRT_SPEC_FINAL
;
20558 else if (id_equal (token
->u
.value
, "__final"))
20560 virt_specifier
= VIRT_SPEC_FINAL
;
20565 if (virt_specifiers
& virt_specifier
)
20567 gcc_rich_location
richloc (token
->location
);
20568 richloc
.add_fixit_remove ();
20569 error_at_rich_loc (&richloc
, "duplicate virt-specifier");
20570 cp_lexer_purge_token (parser
->lexer
);
20574 cp_lexer_consume_token (parser
->lexer
);
20575 virt_specifiers
|= virt_specifier
;
20578 return virt_specifiers
;
20581 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20582 is in scope even though it isn't real. */
20585 inject_this_parameter (tree ctype
, cp_cv_quals quals
)
20589 if (current_class_ptr
)
20591 /* We don't clear this between NSDMIs. Is it already what we want? */
20592 tree type
= TREE_TYPE (TREE_TYPE (current_class_ptr
));
20593 if (same_type_ignoring_top_level_qualifiers_p (ctype
, type
)
20594 && cp_type_quals (type
) == quals
)
20598 this_parm
= build_this_parm (NULL_TREE
, ctype
, quals
);
20599 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20600 current_class_ptr
= NULL_TREE
;
20602 = cp_build_indirect_ref (this_parm
, RO_NULL
, tf_warning_or_error
);
20603 current_class_ptr
= this_parm
;
20606 /* Return true iff our current scope is a non-static data member
20610 parsing_nsdmi (void)
20612 /* We recognize NSDMI context by the context-less 'this' pointer set up
20613 by the function above. */
20614 if (current_class_ptr
20615 && TREE_CODE (current_class_ptr
) == PARM_DECL
20616 && DECL_CONTEXT (current_class_ptr
) == NULL_TREE
)
20621 /* Return true iff our current scope is a default capturing generic lambda
20622 defined within a template. FIXME: This is part of a workaround (see
20623 semantics.c) to handle building lambda closure types correctly in templates
20624 which we ultimately want to defer to instantiation time. */
20627 parsing_default_capturing_generic_lambda_in_template (void)
20629 if (!processing_template_decl
|| !current_class_type
)
20632 tree lam
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
20633 if (!lam
|| LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
) == CPLD_NONE
)
20636 tree callop
= lambda_function (lam
);
20640 return (DECL_TEMPLATE_INFO (callop
)
20641 && (DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (callop
)) == callop
)
20642 && ((current_nonlambda_class_type ()
20643 && CLASSTYPE_TEMPLATE_INFO (current_nonlambda_class_type ()))
20644 || ((current_nonlambda_function ()
20645 && DECL_TEMPLATE_INFO (current_nonlambda_function ())))));
20648 /* Parse a late-specified return type, if any. This is not a separate
20649 non-terminal, but part of a function declarator, which looks like
20651 -> trailing-type-specifier-seq abstract-declarator(opt)
20653 Returns the type indicated by the type-id.
20655 In addition to this, parse any queued up #pragma omp declare simd
20656 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20657 #pragma acc routine clauses.
20659 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20663 cp_parser_late_return_type_opt (cp_parser
* parser
, cp_declarator
*declarator
,
20664 tree
& requires_clause
, cp_cv_quals quals
)
20667 tree type
= NULL_TREE
;
20668 bool declare_simd_p
= (parser
->omp_declare_simd
20670 && declarator
->kind
== cdk_id
);
20672 bool cilk_simd_fn_vector_p
= (parser
->cilk_simd_fn_info
20673 && declarator
&& declarator
->kind
== cdk_id
);
20675 bool oacc_routine_p
= (parser
->oacc_routine
20677 && declarator
->kind
== cdk_id
);
20679 /* Peek at the next token. */
20680 token
= cp_lexer_peek_token (parser
->lexer
);
20681 /* A late-specified return type is indicated by an initial '->'. */
20682 if (token
->type
!= CPP_DEREF
20683 && token
->keyword
!= RID_REQUIRES
20684 && !(token
->type
== CPP_NAME
20685 && token
->u
.value
== ridpointers
[RID_REQUIRES
])
20686 && !(declare_simd_p
|| cilk_simd_fn_vector_p
|| oacc_routine_p
))
20689 tree save_ccp
= current_class_ptr
;
20690 tree save_ccr
= current_class_ref
;
20693 /* DR 1207: 'this' is in scope in the trailing return type. */
20694 inject_this_parameter (current_class_type
, quals
);
20697 if (token
->type
== CPP_DEREF
)
20699 /* Consume the ->. */
20700 cp_lexer_consume_token (parser
->lexer
);
20702 type
= cp_parser_trailing_type_id (parser
);
20705 /* Function declarations may be followed by a trailing
20706 requires-clause. */
20707 requires_clause
= cp_parser_requires_clause_opt (parser
);
20709 if (cilk_simd_fn_vector_p
)
20710 declarator
->attributes
20711 = cp_parser_late_parsing_cilk_simd_fn_info (parser
,
20712 declarator
->attributes
);
20713 if (declare_simd_p
)
20714 declarator
->attributes
20715 = cp_parser_late_parsing_omp_declare_simd (parser
,
20716 declarator
->attributes
);
20717 if (oacc_routine_p
)
20718 declarator
->attributes
20719 = cp_parser_late_parsing_oacc_routine (parser
,
20720 declarator
->attributes
);
20724 current_class_ptr
= save_ccp
;
20725 current_class_ref
= save_ccr
;
20731 /* Parse a declarator-id.
20735 :: [opt] nested-name-specifier [opt] type-name
20737 In the `id-expression' case, the value returned is as for
20738 cp_parser_id_expression if the id-expression was an unqualified-id.
20739 If the id-expression was a qualified-id, then a SCOPE_REF is
20740 returned. The first operand is the scope (either a NAMESPACE_DECL
20741 or TREE_TYPE), but the second is still just a representation of an
20745 cp_parser_declarator_id (cp_parser
* parser
, bool optional_p
)
20748 /* The expression must be an id-expression. Assume that qualified
20749 names are the names of types so that:
20752 int S<T>::R::i = 3;
20754 will work; we must treat `S<T>::R' as the name of a type.
20755 Similarly, assume that qualified names are templates, where
20759 int S<T>::R<T>::i = 3;
20762 id
= cp_parser_id_expression (parser
,
20763 /*template_keyword_p=*/false,
20764 /*check_dependency_p=*/false,
20765 /*template_p=*/NULL
,
20766 /*declarator_p=*/true,
20768 if (id
&& BASELINK_P (id
))
20769 id
= BASELINK_FUNCTIONS (id
);
20773 /* Parse a type-id.
20776 type-specifier-seq abstract-declarator [opt]
20778 Returns the TYPE specified. */
20781 cp_parser_type_id_1 (cp_parser
* parser
, bool is_template_arg
,
20782 bool is_trailing_return
)
20784 cp_decl_specifier_seq type_specifier_seq
;
20785 cp_declarator
*abstract_declarator
;
20787 /* Parse the type-specifier-seq. */
20788 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
20789 is_trailing_return
,
20790 &type_specifier_seq
);
20791 if (is_template_arg
&& type_specifier_seq
.type
20792 && TREE_CODE (type_specifier_seq
.type
) == TEMPLATE_TYPE_PARM
20793 && CLASS_PLACEHOLDER_TEMPLATE (type_specifier_seq
.type
))
20794 /* A bare template name as a template argument is a template template
20795 argument, not a placeholder, so fail parsing it as a type argument. */
20797 gcc_assert (cp_parser_uncommitted_to_tentative_parse_p (parser
));
20798 cp_parser_simulate_error (parser
);
20799 return error_mark_node
;
20801 if (type_specifier_seq
.type
== error_mark_node
)
20802 return error_mark_node
;
20804 /* There might or might not be an abstract declarator. */
20805 cp_parser_parse_tentatively (parser
);
20806 /* Look for the declarator. */
20807 abstract_declarator
20808 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_ABSTRACT
, NULL
,
20809 /*parenthesized_p=*/NULL
,
20810 /*member_p=*/false,
20811 /*friend_p=*/false);
20812 /* Check to see if there really was a declarator. */
20813 if (!cp_parser_parse_definitely (parser
))
20814 abstract_declarator
= NULL
;
20816 if (type_specifier_seq
.type
20817 /* The concepts TS allows 'auto' as a type-id. */
20818 && (!flag_concepts
|| parser
->in_type_id_in_expr_p
)
20819 /* None of the valid uses of 'auto' in C++14 involve the type-id
20820 nonterminal, but it is valid in a trailing-return-type. */
20821 && !(cxx_dialect
>= cxx14
&& is_trailing_return
))
20822 if (tree auto_node
= type_uses_auto (type_specifier_seq
.type
))
20824 /* A type-id with type 'auto' is only ok if the abstract declarator
20825 is a function declarator with a late-specified return type.
20827 A type-id with 'auto' is also valid in a trailing-return-type
20828 in a compound-requirement. */
20829 if (abstract_declarator
20830 && abstract_declarator
->kind
== cdk_function
20831 && abstract_declarator
->u
.function
.late_return_type
)
20833 else if (parser
->in_result_type_constraint_p
)
20837 location_t loc
= type_specifier_seq
.locations
[ds_type_spec
];
20838 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
20840 error_at (loc
, "missing template arguments after %qT",
20842 inform (DECL_SOURCE_LOCATION (tmpl
), "%qD declared here",
20846 error_at (loc
, "invalid use of %qT", auto_node
);
20847 return error_mark_node
;
20851 return groktypename (&type_specifier_seq
, abstract_declarator
,
20856 cp_parser_type_id (cp_parser
*parser
)
20858 return cp_parser_type_id_1 (parser
, false, false);
20862 cp_parser_template_type_arg (cp_parser
*parser
)
20865 const char *saved_message
= parser
->type_definition_forbidden_message
;
20866 parser
->type_definition_forbidden_message
20867 = G_("types may not be defined in template arguments");
20868 r
= cp_parser_type_id_1 (parser
, true, false);
20869 parser
->type_definition_forbidden_message
= saved_message
;
20870 if (cxx_dialect
>= cxx14
&& !flag_concepts
&& type_uses_auto (r
))
20872 error ("invalid use of %<auto%> in template argument");
20873 r
= error_mark_node
;
20879 cp_parser_trailing_type_id (cp_parser
*parser
)
20881 return cp_parser_type_id_1 (parser
, false, true);
20884 /* Parse a type-specifier-seq.
20886 type-specifier-seq:
20887 type-specifier type-specifier-seq [opt]
20891 type-specifier-seq:
20892 attributes type-specifier-seq [opt]
20894 If IS_DECLARATION is true, we are at the start of a "condition" or
20895 exception-declaration, so we might be followed by a declarator-id.
20897 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
20898 i.e. we've just seen "->".
20900 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20903 cp_parser_type_specifier_seq (cp_parser
* parser
,
20904 bool is_declaration
,
20905 bool is_trailing_return
,
20906 cp_decl_specifier_seq
*type_specifier_seq
)
20908 bool seen_type_specifier
= false;
20909 cp_parser_flags flags
= CP_PARSER_FLAGS_OPTIONAL
;
20910 cp_token
*start_token
= NULL
;
20912 /* Clear the TYPE_SPECIFIER_SEQ. */
20913 clear_decl_specs (type_specifier_seq
);
20915 /* In the context of a trailing return type, enum E { } is an
20916 elaborated-type-specifier followed by a function-body, not an
20918 if (is_trailing_return
)
20919 flags
|= CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
;
20921 /* Parse the type-specifiers and attributes. */
20924 tree type_specifier
;
20925 bool is_cv_qualifier
;
20927 /* Check for attributes first. */
20928 if (cp_next_tokens_can_be_attribute_p (parser
))
20930 type_specifier_seq
->attributes
=
20931 chainon (type_specifier_seq
->attributes
,
20932 cp_parser_attributes_opt (parser
));
20936 /* record the token of the beginning of the type specifier seq,
20937 for error reporting purposes*/
20939 start_token
= cp_lexer_peek_token (parser
->lexer
);
20941 /* Look for the type-specifier. */
20942 type_specifier
= cp_parser_type_specifier (parser
,
20944 type_specifier_seq
,
20945 /*is_declaration=*/false,
20948 if (!type_specifier
)
20950 /* If the first type-specifier could not be found, this is not a
20951 type-specifier-seq at all. */
20952 if (!seen_type_specifier
)
20954 /* Set in_declarator_p to avoid skipping to the semicolon. */
20955 int in_decl
= parser
->in_declarator_p
;
20956 parser
->in_declarator_p
= true;
20958 if (cp_parser_uncommitted_to_tentative_parse_p (parser
)
20959 || !cp_parser_parse_and_diagnose_invalid_type_name (parser
))
20960 cp_parser_error (parser
, "expected type-specifier");
20962 parser
->in_declarator_p
= in_decl
;
20964 type_specifier_seq
->type
= error_mark_node
;
20967 /* If subsequent type-specifiers could not be found, the
20968 type-specifier-seq is complete. */
20972 seen_type_specifier
= true;
20973 /* The standard says that a condition can be:
20975 type-specifier-seq declarator = assignment-expression
20982 we should treat the "S" as a declarator, not as a
20983 type-specifier. The standard doesn't say that explicitly for
20984 type-specifier-seq, but it does say that for
20985 decl-specifier-seq in an ordinary declaration. Perhaps it
20986 would be clearer just to allow a decl-specifier-seq here, and
20987 then add a semantic restriction that if any decl-specifiers
20988 that are not type-specifiers appear, the program is invalid. */
20989 if (is_declaration
&& !is_cv_qualifier
)
20990 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
20994 /* Return whether the function currently being declared has an associated
20995 template parameter list. */
20998 function_being_declared_is_template_p (cp_parser
* parser
)
21000 if (!current_template_parms
|| processing_template_parmlist
)
21003 if (parser
->implicit_template_scope
)
21006 if (at_class_scope_p ()
21007 && TYPE_BEING_DEFINED (current_class_type
))
21008 return parser
->num_template_parameter_lists
!= 0;
21010 return ((int) parser
->num_template_parameter_lists
> template_class_depth
21011 (current_class_type
));
21014 /* Parse a parameter-declaration-clause.
21016 parameter-declaration-clause:
21017 parameter-declaration-list [opt] ... [opt]
21018 parameter-declaration-list , ...
21020 Returns a representation for the parameter declarations. A return
21021 value of NULL indicates a parameter-declaration-clause consisting
21022 only of an ellipsis. */
21025 cp_parser_parameter_declaration_clause (cp_parser
* parser
)
21034 int auto_is_implicit_function_template_parm_p
;
21036 parser
->auto_is_implicit_function_template_parm_p
21037 = auto_is_implicit_function_template_parm_p
;
21039 } cleanup
= { parser
, parser
->auto_is_implicit_function_template_parm_p
};
21043 if (!processing_specialization
21044 && !processing_template_parmlist
21045 && !processing_explicit_instantiation
)
21046 if (!current_function_decl
21047 || (current_class_type
&& LAMBDA_TYPE_P (current_class_type
)))
21048 parser
->auto_is_implicit_function_template_parm_p
= true;
21050 /* Peek at the next token. */
21051 token
= cp_lexer_peek_token (parser
->lexer
);
21052 /* Check for trivial parameter-declaration-clauses. */
21053 if (token
->type
== CPP_ELLIPSIS
)
21055 /* Consume the `...' token. */
21056 cp_lexer_consume_token (parser
->lexer
);
21059 else if (token
->type
== CPP_CLOSE_PAREN
)
21060 /* There are no parameters. */
21062 #ifndef NO_IMPLICIT_EXTERN_C
21063 if (in_system_header_at (input_location
)
21064 && current_class_type
== NULL
21065 && current_lang_name
== lang_name_c
)
21069 return void_list_node
;
21071 /* Check for `(void)', too, which is a special case. */
21072 else if (token
->keyword
== RID_VOID
21073 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
21074 == CPP_CLOSE_PAREN
))
21076 /* Consume the `void' token. */
21077 cp_lexer_consume_token (parser
->lexer
);
21078 /* There are no parameters. */
21079 return void_list_node
;
21082 /* Parse the parameter-declaration-list. */
21083 parameters
= cp_parser_parameter_declaration_list (parser
, &is_error
);
21084 /* If a parse error occurred while parsing the
21085 parameter-declaration-list, then the entire
21086 parameter-declaration-clause is erroneous. */
21090 /* Peek at the next token. */
21091 token
= cp_lexer_peek_token (parser
->lexer
);
21092 /* If it's a `,', the clause should terminate with an ellipsis. */
21093 if (token
->type
== CPP_COMMA
)
21095 /* Consume the `,'. */
21096 cp_lexer_consume_token (parser
->lexer
);
21097 /* Expect an ellipsis. */
21099 = (cp_parser_require (parser
, CPP_ELLIPSIS
, RT_ELLIPSIS
) != NULL
);
21101 /* It might also be `...' if the optional trailing `,' was
21103 else if (token
->type
== CPP_ELLIPSIS
)
21105 /* Consume the `...' token. */
21106 cp_lexer_consume_token (parser
->lexer
);
21107 /* And remember that we saw it. */
21111 ellipsis_p
= false;
21113 /* Finish the parameter list. */
21115 parameters
= chainon (parameters
, void_list_node
);
21120 /* Parse a parameter-declaration-list.
21122 parameter-declaration-list:
21123 parameter-declaration
21124 parameter-declaration-list , parameter-declaration
21126 Returns a representation of the parameter-declaration-list, as for
21127 cp_parser_parameter_declaration_clause. However, the
21128 `void_list_node' is never appended to the list. Upon return,
21129 *IS_ERROR will be true iff an error occurred. */
21132 cp_parser_parameter_declaration_list (cp_parser
* parser
, bool *is_error
)
21134 tree parameters
= NULL_TREE
;
21135 tree
*tail
= ¶meters
;
21136 bool saved_in_unbraced_linkage_specification_p
;
21139 /* Assume all will go well. */
21141 /* The special considerations that apply to a function within an
21142 unbraced linkage specifications do not apply to the parameters
21143 to the function. */
21144 saved_in_unbraced_linkage_specification_p
21145 = parser
->in_unbraced_linkage_specification_p
;
21146 parser
->in_unbraced_linkage_specification_p
= false;
21148 /* Look for more parameters. */
21151 cp_parameter_declarator
*parameter
;
21152 tree decl
= error_mark_node
;
21153 bool parenthesized_p
= false;
21154 int template_parm_idx
= (function_being_declared_is_template_p (parser
)?
21155 TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
21156 (current_template_parms
)) : 0);
21158 /* Parse the parameter. */
21160 = cp_parser_parameter_declaration (parser
,
21161 /*template_parm_p=*/false,
21164 /* We don't know yet if the enclosing context is deprecated, so wait
21165 and warn in grokparms if appropriate. */
21166 deprecated_state
= DEPRECATED_SUPPRESS
;
21170 /* If a function parameter pack was specified and an implicit template
21171 parameter was introduced during cp_parser_parameter_declaration,
21172 change any implicit parameters introduced into packs. */
21173 if (parser
->implicit_template_parms
21174 && parameter
->declarator
21175 && parameter
->declarator
->parameter_pack_p
)
21177 int latest_template_parm_idx
= TREE_VEC_LENGTH
21178 (INNERMOST_TEMPLATE_PARMS (current_template_parms
));
21180 if (latest_template_parm_idx
!= template_parm_idx
)
21181 parameter
->decl_specifiers
.type
= convert_generic_types_to_packs
21182 (parameter
->decl_specifiers
.type
,
21183 template_parm_idx
, latest_template_parm_idx
);
21186 decl
= grokdeclarator (parameter
->declarator
,
21187 ¶meter
->decl_specifiers
,
21189 parameter
->default_argument
!= NULL_TREE
,
21190 ¶meter
->decl_specifiers
.attributes
);
21193 deprecated_state
= DEPRECATED_NORMAL
;
21195 /* If a parse error occurred parsing the parameter declaration,
21196 then the entire parameter-declaration-list is erroneous. */
21197 if (decl
== error_mark_node
)
21200 parameters
= error_mark_node
;
21204 if (parameter
->decl_specifiers
.attributes
)
21205 cplus_decl_attributes (&decl
,
21206 parameter
->decl_specifiers
.attributes
,
21208 if (DECL_NAME (decl
))
21209 decl
= pushdecl (decl
);
21211 if (decl
!= error_mark_node
)
21213 retrofit_lang_decl (decl
);
21214 DECL_PARM_INDEX (decl
) = ++index
;
21215 DECL_PARM_LEVEL (decl
) = function_parm_depth ();
21218 /* Add the new parameter to the list. */
21219 *tail
= build_tree_list (parameter
->default_argument
, decl
);
21220 tail
= &TREE_CHAIN (*tail
);
21222 /* Peek at the next token. */
21223 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
21224 || cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
21225 /* These are for Objective-C++ */
21226 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
21227 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
21228 /* The parameter-declaration-list is complete. */
21230 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
21234 /* Peek at the next token. */
21235 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
21236 /* If it's an ellipsis, then the list is complete. */
21237 if (token
->type
== CPP_ELLIPSIS
)
21239 /* Otherwise, there must be more parameters. Consume the
21241 cp_lexer_consume_token (parser
->lexer
);
21242 /* When parsing something like:
21244 int i(float f, double d)
21246 we can tell after seeing the declaration for "f" that we
21247 are not looking at an initialization of a variable "i",
21248 but rather at the declaration of a function "i".
21250 Due to the fact that the parsing of template arguments
21251 (as specified to a template-id) requires backtracking we
21252 cannot use this technique when inside a template argument
21254 if (!parser
->in_template_argument_list_p
21255 && !parser
->in_type_id_in_expr_p
21256 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
21257 /* However, a parameter-declaration of the form
21258 "float(f)" (which is a valid declaration of a
21259 parameter "f") can also be interpreted as an
21260 expression (the conversion of "f" to "float"). */
21261 && !parenthesized_p
)
21262 cp_parser_commit_to_tentative_parse (parser
);
21266 cp_parser_error (parser
, "expected %<,%> or %<...%>");
21267 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
21268 cp_parser_skip_to_closing_parenthesis (parser
,
21269 /*recovering=*/true,
21270 /*or_comma=*/false,
21271 /*consume_paren=*/false);
21276 parser
->in_unbraced_linkage_specification_p
21277 = saved_in_unbraced_linkage_specification_p
;
21279 /* Reset implicit_template_scope if we are about to leave the function
21280 parameter list that introduced it. Note that for out-of-line member
21281 definitions, there will be one or more class scopes before we get to
21282 the template parameter scope. */
21284 if (cp_binding_level
*its
= parser
->implicit_template_scope
)
21285 if (cp_binding_level
*maybe_its
= current_binding_level
->level_chain
)
21287 while (maybe_its
->kind
== sk_class
)
21288 maybe_its
= maybe_its
->level_chain
;
21289 if (maybe_its
== its
)
21291 parser
->implicit_template_parms
= 0;
21292 parser
->implicit_template_scope
= 0;
21299 /* Parse a parameter declaration.
21301 parameter-declaration:
21302 decl-specifier-seq ... [opt] declarator
21303 decl-specifier-seq declarator = assignment-expression
21304 decl-specifier-seq ... [opt] abstract-declarator [opt]
21305 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21307 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21308 declares a template parameter. (In that case, a non-nested `>'
21309 token encountered during the parsing of the assignment-expression
21310 is not interpreted as a greater-than operator.)
21312 Returns a representation of the parameter, or NULL if an error
21313 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21314 true iff the declarator is of the form "(p)". */
21316 static cp_parameter_declarator
*
21317 cp_parser_parameter_declaration (cp_parser
*parser
,
21318 bool template_parm_p
,
21319 bool *parenthesized_p
)
21321 int declares_class_or_enum
;
21322 cp_decl_specifier_seq decl_specifiers
;
21323 cp_declarator
*declarator
;
21324 tree default_argument
;
21325 cp_token
*token
= NULL
, *declarator_token_start
= NULL
;
21326 const char *saved_message
;
21327 bool template_parameter_pack_p
= false;
21329 /* In a template parameter, `>' is not an operator.
21333 When parsing a default template-argument for a non-type
21334 template-parameter, the first non-nested `>' is taken as the end
21335 of the template parameter-list rather than a greater-than
21338 /* Type definitions may not appear in parameter types. */
21339 saved_message
= parser
->type_definition_forbidden_message
;
21340 parser
->type_definition_forbidden_message
21341 = G_("types may not be defined in parameter types");
21343 /* Parse the declaration-specifiers. */
21344 cp_parser_decl_specifier_seq (parser
,
21345 CP_PARSER_FLAGS_NONE
,
21347 &declares_class_or_enum
);
21349 /* Complain about missing 'typename' or other invalid type names. */
21350 if (!decl_specifiers
.any_type_specifiers_p
21351 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
21352 decl_specifiers
.type
= error_mark_node
;
21354 /* If an error occurred, there's no reason to attempt to parse the
21355 rest of the declaration. */
21356 if (cp_parser_error_occurred (parser
))
21358 parser
->type_definition_forbidden_message
= saved_message
;
21362 /* Peek at the next token. */
21363 token
= cp_lexer_peek_token (parser
->lexer
);
21365 /* If the next token is a `)', `,', `=', `>', or `...', then there
21366 is no declarator. However, when variadic templates are enabled,
21367 there may be a declarator following `...'. */
21368 if (token
->type
== CPP_CLOSE_PAREN
21369 || token
->type
== CPP_COMMA
21370 || token
->type
== CPP_EQ
21371 || token
->type
== CPP_GREATER
)
21374 if (parenthesized_p
)
21375 *parenthesized_p
= false;
21377 /* Otherwise, there should be a declarator. */
21380 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
21381 parser
->default_arg_ok_p
= false;
21383 /* After seeing a decl-specifier-seq, if the next token is not a
21384 "(", there is no possibility that the code is a valid
21385 expression. Therefore, if parsing tentatively, we commit at
21387 if (!parser
->in_template_argument_list_p
21388 /* In an expression context, having seen:
21392 we cannot be sure whether we are looking at a
21393 function-type (taking a "char" as a parameter) or a cast
21394 of some object of type "char" to "int". */
21395 && !parser
->in_type_id_in_expr_p
21396 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
21397 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
21398 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
21399 cp_parser_commit_to_tentative_parse (parser
);
21400 /* Parse the declarator. */
21401 declarator_token_start
= token
;
21402 declarator
= cp_parser_declarator (parser
,
21403 CP_PARSER_DECLARATOR_EITHER
,
21404 /*ctor_dtor_or_conv_p=*/NULL
,
21406 /*member_p=*/false,
21407 /*friend_p=*/false);
21408 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
21409 /* After the declarator, allow more attributes. */
21410 decl_specifiers
.attributes
21411 = chainon (decl_specifiers
.attributes
,
21412 cp_parser_attributes_opt (parser
));
21414 /* If the declarator is a template parameter pack, remember that and
21415 clear the flag in the declarator itself so we don't get errors
21416 from grokdeclarator. */
21417 if (template_parm_p
&& declarator
&& declarator
->parameter_pack_p
)
21419 declarator
->parameter_pack_p
= false;
21420 template_parameter_pack_p
= true;
21424 /* If the next token is an ellipsis, and we have not seen a declarator
21425 name, and if either the type of the declarator contains parameter
21426 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21427 for, eg, abbreviated integral type names), then we actually have a
21428 parameter pack expansion expression. Otherwise, leave the ellipsis
21429 for a C-style variadic function. */
21430 token
= cp_lexer_peek_token (parser
->lexer
);
21431 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
21433 tree type
= decl_specifiers
.type
;
21435 if (type
&& DECL_P (type
))
21436 type
= TREE_TYPE (type
);
21439 && TREE_CODE (type
) != TYPE_PACK_EXPANSION
21440 && (template_parm_p
|| uses_parameter_packs (type
)))
21441 || (!type
&& template_parm_p
))
21442 && declarator_can_be_parameter_pack (declarator
))
21444 /* Consume the `...'. */
21445 cp_lexer_consume_token (parser
->lexer
);
21446 maybe_warn_variadic_templates ();
21448 /* Build a pack expansion type */
21449 if (template_parm_p
)
21450 template_parameter_pack_p
= true;
21451 else if (declarator
)
21452 declarator
->parameter_pack_p
= true;
21454 decl_specifiers
.type
= make_pack_expansion (type
);
21458 /* The restriction on defining new types applies only to the type
21459 of the parameter, not to the default argument. */
21460 parser
->type_definition_forbidden_message
= saved_message
;
21462 /* If the next token is `=', then process a default argument. */
21463 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
21465 tree type
= decl_specifiers
.type
;
21466 token
= cp_lexer_peek_token (parser
->lexer
);
21467 /* If we are defining a class, then the tokens that make up the
21468 default argument must be saved and processed later. */
21469 if (!template_parm_p
&& at_class_scope_p ()
21470 && TYPE_BEING_DEFINED (current_class_type
)
21471 && !LAMBDA_TYPE_P (current_class_type
))
21472 default_argument
= cp_parser_cache_defarg (parser
, /*nsdmi=*/false);
21474 // A constrained-type-specifier may declare a type template-parameter.
21475 else if (declares_constrained_type_template_parameter (type
))
21477 = cp_parser_default_type_template_argument (parser
);
21479 // A constrained-type-specifier may declare a template-template-parameter.
21480 else if (declares_constrained_template_template_parameter (type
))
21482 = cp_parser_default_template_template_argument (parser
);
21484 /* Outside of a class definition, we can just parse the
21485 assignment-expression. */
21488 = cp_parser_default_argument (parser
, template_parm_p
);
21490 if (!parser
->default_arg_ok_p
)
21492 permerror (token
->location
,
21493 "default arguments are only "
21494 "permitted for function parameters");
21496 else if ((declarator
&& declarator
->parameter_pack_p
)
21497 || template_parameter_pack_p
21498 || (decl_specifiers
.type
21499 && PACK_EXPANSION_P (decl_specifiers
.type
)))
21501 /* Find the name of the parameter pack. */
21502 cp_declarator
*id_declarator
= declarator
;
21503 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
21504 id_declarator
= id_declarator
->declarator
;
21506 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
21507 error_at (declarator_token_start
->location
,
21509 ? G_("template parameter pack %qD "
21510 "cannot have a default argument")
21511 : G_("parameter pack %qD cannot have "
21512 "a default argument"),
21513 id_declarator
->u
.id
.unqualified_name
);
21515 error_at (declarator_token_start
->location
,
21517 ? G_("template parameter pack cannot have "
21518 "a default argument")
21519 : G_("parameter pack cannot have a "
21520 "default argument"));
21522 default_argument
= NULL_TREE
;
21526 default_argument
= NULL_TREE
;
21528 return make_parameter_declarator (&decl_specifiers
,
21531 template_parameter_pack_p
);
21534 /* Parse a default argument and return it.
21536 TEMPLATE_PARM_P is true if this is a default argument for a
21537 non-type template parameter. */
21539 cp_parser_default_argument (cp_parser
*parser
, bool template_parm_p
)
21541 tree default_argument
= NULL_TREE
;
21542 bool saved_greater_than_is_operator_p
;
21543 bool saved_local_variables_forbidden_p
;
21544 bool non_constant_p
, is_direct_init
;
21546 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21548 saved_greater_than_is_operator_p
= parser
->greater_than_is_operator_p
;
21549 parser
->greater_than_is_operator_p
= !template_parm_p
;
21550 /* Local variable names (and the `this' keyword) may not
21551 appear in a default argument. */
21552 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
21553 parser
->local_variables_forbidden_p
= true;
21554 /* Parse the assignment-expression. */
21555 if (template_parm_p
)
21556 push_deferring_access_checks (dk_no_deferred
);
21557 tree saved_class_ptr
= NULL_TREE
;
21558 tree saved_class_ref
= NULL_TREE
;
21559 /* The "this" pointer is not valid in a default argument. */
21562 saved_class_ptr
= current_class_ptr
;
21563 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
21564 saved_class_ref
= current_class_ref
;
21565 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
21568 = cp_parser_initializer (parser
, &is_direct_init
, &non_constant_p
);
21569 /* Restore the "this" pointer. */
21572 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
21573 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
21575 if (BRACE_ENCLOSED_INITIALIZER_P (default_argument
))
21576 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
21577 if (template_parm_p
)
21578 pop_deferring_access_checks ();
21579 parser
->greater_than_is_operator_p
= saved_greater_than_is_operator_p
;
21580 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
21582 return default_argument
;
21585 /* Parse a function-body.
21588 compound_statement */
21591 cp_parser_function_body (cp_parser
*parser
, bool in_function_try_block
)
21593 cp_parser_compound_statement (parser
, NULL
, (in_function_try_block
21594 ? BCS_TRY_BLOCK
: BCS_NORMAL
),
21598 /* Parse a ctor-initializer-opt followed by a function-body. Return
21599 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21600 is true we are parsing a function-try-block. */
21603 cp_parser_ctor_initializer_opt_and_function_body (cp_parser
*parser
,
21604 bool in_function_try_block
)
21607 bool ctor_initializer_p
;
21608 const bool check_body_p
=
21609 DECL_CONSTRUCTOR_P (current_function_decl
)
21610 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
);
21613 /* Begin the function body. */
21614 body
= begin_function_body ();
21615 /* Parse the optional ctor-initializer. */
21616 ctor_initializer_p
= cp_parser_ctor_initializer_opt (parser
);
21618 /* If we're parsing a constexpr constructor definition, we need
21619 to check that the constructor body is indeed empty. However,
21620 before we get to cp_parser_function_body lot of junk has been
21621 generated, so we can't just check that we have an empty block.
21622 Rather we take a snapshot of the outermost block, and check whether
21623 cp_parser_function_body changed its state. */
21626 list
= cur_stmt_list
;
21627 if (STATEMENT_LIST_TAIL (list
))
21628 last
= STATEMENT_LIST_TAIL (list
)->stmt
;
21630 /* Parse the function-body. */
21631 cp_parser_function_body (parser
, in_function_try_block
);
21633 check_constexpr_ctor_body (last
, list
, /*complain=*/true);
21634 /* Finish the function body. */
21635 finish_function_body (body
);
21637 return ctor_initializer_p
;
21640 /* Parse an initializer.
21643 = initializer-clause
21644 ( expression-list )
21646 Returns an expression representing the initializer. If no
21647 initializer is present, NULL_TREE is returned.
21649 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21650 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21651 set to TRUE if there is no initializer present. If there is an
21652 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21653 is set to true; otherwise it is set to false. */
21656 cp_parser_initializer (cp_parser
* parser
, bool* is_direct_init
,
21657 bool* non_constant_p
)
21662 /* Peek at the next token. */
21663 token
= cp_lexer_peek_token (parser
->lexer
);
21665 /* Let our caller know whether or not this initializer was
21667 *is_direct_init
= (token
->type
!= CPP_EQ
);
21668 /* Assume that the initializer is constant. */
21669 *non_constant_p
= false;
21671 if (token
->type
== CPP_EQ
)
21673 /* Consume the `='. */
21674 cp_lexer_consume_token (parser
->lexer
);
21675 /* Parse the initializer-clause. */
21676 init
= cp_parser_initializer_clause (parser
, non_constant_p
);
21678 else if (token
->type
== CPP_OPEN_PAREN
)
21680 vec
<tree
, va_gc
> *vec
;
21681 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
21683 /*allow_expansion_p=*/true,
21686 return error_mark_node
;
21687 init
= build_tree_list_vec (vec
);
21688 release_tree_vector (vec
);
21690 else if (token
->type
== CPP_OPEN_BRACE
)
21692 cp_lexer_set_source_position (parser
->lexer
);
21693 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
21694 init
= cp_parser_braced_list (parser
, non_constant_p
);
21695 CONSTRUCTOR_IS_DIRECT_INIT (init
) = 1;
21699 /* Anything else is an error. */
21700 cp_parser_error (parser
, "expected initializer");
21701 init
= error_mark_node
;
21704 if (check_for_bare_parameter_packs (init
))
21705 init
= error_mark_node
;
21710 /* Parse an initializer-clause.
21712 initializer-clause:
21713 assignment-expression
21716 Returns an expression representing the initializer.
21718 If the `assignment-expression' production is used the value
21719 returned is simply a representation for the expression.
21721 Otherwise, calls cp_parser_braced_list. */
21724 cp_parser_initializer_clause (cp_parser
* parser
, bool* non_constant_p
)
21726 cp_expr initializer
;
21728 /* Assume the expression is constant. */
21729 *non_constant_p
= false;
21731 /* If it is not a `{', then we are looking at an
21732 assignment-expression. */
21733 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
21736 = cp_parser_constant_expression (parser
,
21737 /*allow_non_constant_p=*/true,
21741 initializer
= cp_parser_braced_list (parser
, non_constant_p
);
21743 return initializer
;
21746 /* Parse a brace-enclosed initializer list.
21749 { initializer-list , [opt] }
21752 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21753 the elements of the initializer-list (or NULL, if the last
21754 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21755 NULL_TREE. There is no way to detect whether or not the optional
21756 trailing `,' was provided. NON_CONSTANT_P is as for
21757 cp_parser_initializer. */
21760 cp_parser_braced_list (cp_parser
* parser
, bool* non_constant_p
)
21763 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
21765 /* Consume the `{' token. */
21766 cp_lexer_consume_token (parser
->lexer
);
21767 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21768 initializer
= make_node (CONSTRUCTOR
);
21769 /* If it's not a `}', then there is a non-trivial initializer. */
21770 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
21772 /* Parse the initializer list. */
21773 CONSTRUCTOR_ELTS (initializer
)
21774 = cp_parser_initializer_list (parser
, non_constant_p
);
21775 /* A trailing `,' token is allowed. */
21776 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
21777 cp_lexer_consume_token (parser
->lexer
);
21780 *non_constant_p
= false;
21781 /* Now, there should be a trailing `}'. */
21782 location_t finish_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
21783 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
21784 TREE_TYPE (initializer
) = init_list_type_node
;
21786 cp_expr
result (initializer
);
21787 /* Build a location of the form:
21790 with caret==start at the open brace, finish at the close brace. */
21791 location_t combined_loc
= make_location (start_loc
, start_loc
, finish_loc
);
21792 result
.set_location (combined_loc
);
21796 /* Consume tokens up to, and including, the next non-nested closing `]'.
21797 Returns true iff we found a closing `]'. */
21800 cp_parser_skip_to_closing_square_bracket (cp_parser
*parser
)
21802 unsigned square_depth
= 0;
21806 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
21808 switch (token
->type
)
21811 case CPP_PRAGMA_EOL
:
21812 /* If we've run out of tokens, then there is no closing `]'. */
21815 case CPP_OPEN_SQUARE
:
21819 case CPP_CLOSE_SQUARE
:
21820 if (!square_depth
--)
21822 cp_lexer_consume_token (parser
->lexer
);
21831 /* Consume the token. */
21832 cp_lexer_consume_token (parser
->lexer
);
21836 /* Return true if we are looking at an array-designator, false otherwise. */
21839 cp_parser_array_designator_p (cp_parser
*parser
)
21841 /* Consume the `['. */
21842 cp_lexer_consume_token (parser
->lexer
);
21844 cp_lexer_save_tokens (parser
->lexer
);
21846 /* Skip tokens until the next token is a closing square bracket.
21847 If we find the closing `]', and the next token is a `=', then
21848 we are looking at an array designator. */
21849 bool array_designator_p
21850 = (cp_parser_skip_to_closing_square_bracket (parser
)
21851 && cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
));
21853 /* Roll back the tokens we skipped. */
21854 cp_lexer_rollback_tokens (parser
->lexer
);
21856 return array_designator_p
;
21859 /* Parse an initializer-list.
21862 initializer-clause ... [opt]
21863 initializer-list , initializer-clause ... [opt]
21868 designation initializer-clause ...[opt]
21869 initializer-list , designation initializer-clause ...[opt]
21874 [ constant-expression ] =
21876 Returns a vec of constructor_elt. The VALUE of each elt is an expression
21877 for the initializer. If the INDEX of the elt is non-NULL, it is the
21878 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
21879 as for cp_parser_initializer. */
21881 static vec
<constructor_elt
, va_gc
> *
21882 cp_parser_initializer_list (cp_parser
* parser
, bool* non_constant_p
)
21884 vec
<constructor_elt
, va_gc
> *v
= NULL
;
21886 /* Assume all of the expressions are constant. */
21887 *non_constant_p
= false;
21889 /* Parse the rest of the list. */
21895 bool clause_non_constant_p
;
21897 /* If the next token is an identifier and the following one is a
21898 colon, we are looking at the GNU designated-initializer
21900 if (cp_parser_allow_gnu_extensions_p (parser
)
21901 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
21902 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
21904 /* Warn the user that they are using an extension. */
21905 pedwarn (input_location
, OPT_Wpedantic
,
21906 "ISO C++ does not allow designated initializers");
21907 /* Consume the identifier. */
21908 designator
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
21909 /* Consume the `:'. */
21910 cp_lexer_consume_token (parser
->lexer
);
21912 /* Also handle the C99 syntax, '. id ='. */
21913 else if (cp_parser_allow_gnu_extensions_p (parser
)
21914 && cp_lexer_next_token_is (parser
->lexer
, CPP_DOT
)
21915 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_NAME
21916 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_EQ
)
21918 /* Warn the user that they are using an extension. */
21919 pedwarn (input_location
, OPT_Wpedantic
,
21920 "ISO C++ does not allow C99 designated initializers");
21921 /* Consume the `.'. */
21922 cp_lexer_consume_token (parser
->lexer
);
21923 /* Consume the identifier. */
21924 designator
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
21925 /* Consume the `='. */
21926 cp_lexer_consume_token (parser
->lexer
);
21928 /* Also handle C99 array designators, '[ const ] ='. */
21929 else if (cp_parser_allow_gnu_extensions_p (parser
)
21930 && !c_dialect_objc ()
21931 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
21933 /* In C++11, [ could start a lambda-introducer. */
21934 bool non_const
= false;
21936 cp_parser_parse_tentatively (parser
);
21938 if (!cp_parser_array_designator_p (parser
))
21940 cp_parser_simulate_error (parser
);
21941 designator
= NULL_TREE
;
21945 designator
= cp_parser_constant_expression (parser
, true,
21947 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
21948 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
21951 if (!cp_parser_parse_definitely (parser
))
21952 designator
= NULL_TREE
;
21953 else if (non_const
)
21954 require_potential_rvalue_constant_expression (designator
);
21957 designator
= NULL_TREE
;
21959 /* Parse the initializer. */
21960 initializer
= cp_parser_initializer_clause (parser
,
21961 &clause_non_constant_p
);
21962 /* If any clause is non-constant, so is the entire initializer. */
21963 if (clause_non_constant_p
)
21964 *non_constant_p
= true;
21966 /* If we have an ellipsis, this is an initializer pack
21968 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
21970 /* Consume the `...'. */
21971 cp_lexer_consume_token (parser
->lexer
);
21973 /* Turn the initializer into an initializer expansion. */
21974 initializer
= make_pack_expansion (initializer
);
21977 /* Add it to the vector. */
21978 CONSTRUCTOR_APPEND_ELT (v
, designator
, initializer
);
21980 /* If the next token is not a comma, we have reached the end of
21982 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
21985 /* Peek at the next token. */
21986 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
21987 /* If the next token is a `}', then we're still done. An
21988 initializer-clause can have a trailing `,' after the
21989 initializer-list and before the closing `}'. */
21990 if (token
->type
== CPP_CLOSE_BRACE
)
21993 /* Consume the `,' token. */
21994 cp_lexer_consume_token (parser
->lexer
);
22000 /* Classes [gram.class] */
22002 /* Parse a class-name.
22008 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22009 to indicate that names looked up in dependent types should be
22010 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22011 keyword has been used to indicate that the name that appears next
22012 is a template. TAG_TYPE indicates the explicit tag given before
22013 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22014 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22015 is the class being defined in a class-head. If ENUM_OK is TRUE,
22016 enum-names are also accepted.
22018 Returns the TYPE_DECL representing the class. */
22021 cp_parser_class_name (cp_parser
*parser
,
22022 bool typename_keyword_p
,
22023 bool template_keyword_p
,
22024 enum tag_types tag_type
,
22025 bool check_dependency_p
,
22027 bool is_declaration
,
22034 tree identifier
= NULL_TREE
;
22036 /* All class-names start with an identifier. */
22037 token
= cp_lexer_peek_token (parser
->lexer
);
22038 if (token
->type
!= CPP_NAME
&& token
->type
!= CPP_TEMPLATE_ID
)
22040 cp_parser_error (parser
, "expected class-name");
22041 return error_mark_node
;
22044 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22045 to a template-id, so we save it here. */
22046 scope
= parser
->scope
;
22047 if (scope
== error_mark_node
)
22048 return error_mark_node
;
22050 /* Any name names a type if we're following the `typename' keyword
22051 in a qualified name where the enclosing scope is type-dependent. */
22052 typename_p
= (typename_keyword_p
&& scope
&& TYPE_P (scope
)
22053 && dependent_type_p (scope
));
22054 /* Handle the common case (an identifier, but not a template-id)
22056 if (token
->type
== CPP_NAME
22057 && !cp_parser_nth_token_starts_template_argument_list_p (parser
, 2))
22059 cp_token
*identifier_token
;
22062 /* Look for the identifier. */
22063 identifier_token
= cp_lexer_peek_token (parser
->lexer
);
22064 ambiguous_p
= identifier_token
->error_reported
;
22065 identifier
= cp_parser_identifier (parser
);
22066 /* If the next token isn't an identifier, we are certainly not
22067 looking at a class-name. */
22068 if (identifier
== error_mark_node
)
22069 decl
= error_mark_node
;
22070 /* If we know this is a type-name, there's no need to look it
22072 else if (typename_p
)
22076 tree ambiguous_decls
;
22077 /* If we already know that this lookup is ambiguous, then
22078 we've already issued an error message; there's no reason
22082 cp_parser_simulate_error (parser
);
22083 return error_mark_node
;
22085 /* If the next token is a `::', then the name must be a type
22088 [basic.lookup.qual]
22090 During the lookup for a name preceding the :: scope
22091 resolution operator, object, function, and enumerator
22092 names are ignored. */
22093 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
22094 tag_type
= scope_type
;
22095 /* Look up the name. */
22096 decl
= cp_parser_lookup_name (parser
, identifier
,
22098 /*is_template=*/false,
22099 /*is_namespace=*/false,
22100 check_dependency_p
,
22102 identifier_token
->location
);
22103 if (ambiguous_decls
)
22105 if (cp_parser_parsing_tentatively (parser
))
22106 cp_parser_simulate_error (parser
);
22107 return error_mark_node
;
22113 /* Try a template-id. */
22114 decl
= cp_parser_template_id (parser
, template_keyword_p
,
22115 check_dependency_p
,
22118 if (decl
== error_mark_node
)
22119 return error_mark_node
;
22122 decl
= cp_parser_maybe_treat_template_as_class (decl
, class_head_p
);
22124 /* If this is a typename, create a TYPENAME_TYPE. */
22125 if (typename_p
&& decl
!= error_mark_node
)
22127 decl
= make_typename_type (scope
, decl
, typename_type
,
22128 /*complain=*/tf_error
);
22129 if (decl
!= error_mark_node
)
22130 decl
= TYPE_NAME (decl
);
22133 decl
= strip_using_decl (decl
);
22135 /* Check to see that it is really the name of a class. */
22136 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
22137 && identifier_p (TREE_OPERAND (decl
, 0))
22138 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
22139 /* Situations like this:
22141 template <typename T> struct A {
22142 typename T::template X<int>::I i;
22145 are problematic. Is `T::template X<int>' a class-name? The
22146 standard does not seem to be definitive, but there is no other
22147 valid interpretation of the following `::'. Therefore, those
22148 names are considered class-names. */
22150 decl
= make_typename_type (scope
, decl
, tag_type
, tf_error
);
22151 if (decl
!= error_mark_node
)
22152 decl
= TYPE_NAME (decl
);
22154 else if (TREE_CODE (decl
) != TYPE_DECL
22155 || TREE_TYPE (decl
) == error_mark_node
22156 || !(MAYBE_CLASS_TYPE_P (TREE_TYPE (decl
))
22157 || (enum_ok
&& TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
))
22158 /* In Objective-C 2.0, a classname followed by '.' starts a
22159 dot-syntax expression, and it's not a type-name. */
22160 || (c_dialect_objc ()
22161 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
22162 && objc_is_class_name (decl
)))
22163 decl
= error_mark_node
;
22165 if (decl
== error_mark_node
)
22166 cp_parser_error (parser
, "expected class-name");
22167 else if (identifier
&& !parser
->scope
)
22168 maybe_note_name_used_in_class (identifier
, decl
);
22173 /* Parse a class-specifier.
22176 class-head { member-specification [opt] }
22178 Returns the TREE_TYPE representing the class. */
22181 cp_parser_class_specifier_1 (cp_parser
* parser
)
22184 tree attributes
= NULL_TREE
;
22185 bool nested_name_specifier_p
;
22186 unsigned saved_num_template_parameter_lists
;
22187 bool saved_in_function_body
;
22188 unsigned char in_statement
;
22189 bool in_switch_statement_p
;
22190 bool saved_in_unbraced_linkage_specification_p
;
22191 tree old_scope
= NULL_TREE
;
22192 tree scope
= NULL_TREE
;
22193 cp_token
*closing_brace
;
22195 push_deferring_access_checks (dk_no_deferred
);
22197 /* Parse the class-head. */
22198 type
= cp_parser_class_head (parser
,
22199 &nested_name_specifier_p
);
22200 /* If the class-head was a semantic disaster, skip the entire body
22204 cp_parser_skip_to_end_of_block_or_statement (parser
);
22205 pop_deferring_access_checks ();
22206 return error_mark_node
;
22209 /* Look for the `{'. */
22210 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
22212 pop_deferring_access_checks ();
22213 return error_mark_node
;
22216 cp_ensure_no_omp_declare_simd (parser
);
22217 cp_ensure_no_oacc_routine (parser
);
22219 /* Issue an error message if type-definitions are forbidden here. */
22220 cp_parser_check_type_definition (parser
);
22221 /* Remember that we are defining one more class. */
22222 ++parser
->num_classes_being_defined
;
22223 /* Inside the class, surrounding template-parameter-lists do not
22225 saved_num_template_parameter_lists
22226 = parser
->num_template_parameter_lists
;
22227 parser
->num_template_parameter_lists
= 0;
22228 /* We are not in a function body. */
22229 saved_in_function_body
= parser
->in_function_body
;
22230 parser
->in_function_body
= false;
22231 /* Or in a loop. */
22232 in_statement
= parser
->in_statement
;
22233 parser
->in_statement
= 0;
22234 /* Or in a switch. */
22235 in_switch_statement_p
= parser
->in_switch_statement_p
;
22236 parser
->in_switch_statement_p
= false;
22237 /* We are not immediately inside an extern "lang" block. */
22238 saved_in_unbraced_linkage_specification_p
22239 = parser
->in_unbraced_linkage_specification_p
;
22240 parser
->in_unbraced_linkage_specification_p
= false;
22242 // Associate constraints with the type.
22244 type
= associate_classtype_constraints (type
);
22246 /* Start the class. */
22247 if (nested_name_specifier_p
)
22249 scope
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (type
));
22250 old_scope
= push_inner_scope (scope
);
22252 type
= begin_class_definition (type
);
22254 if (type
== error_mark_node
)
22255 /* If the type is erroneous, skip the entire body of the class. */
22256 cp_parser_skip_to_closing_brace (parser
);
22258 /* Parse the member-specification. */
22259 cp_parser_member_specification_opt (parser
);
22261 /* Look for the trailing `}'. */
22262 closing_brace
= cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
22263 /* Look for trailing attributes to apply to this class. */
22264 if (cp_parser_allow_gnu_extensions_p (parser
))
22265 attributes
= cp_parser_gnu_attributes_opt (parser
);
22266 if (type
!= error_mark_node
)
22267 type
= finish_struct (type
, attributes
);
22268 if (nested_name_specifier_p
)
22269 pop_inner_scope (old_scope
, scope
);
22271 /* We've finished a type definition. Check for the common syntax
22272 error of forgetting a semicolon after the definition. We need to
22273 be careful, as we can't just check for not-a-semicolon and be done
22274 with it; the user might have typed:
22276 class X { } c = ...;
22277 class X { } *p = ...;
22279 and so forth. Instead, enumerate all the possible tokens that
22280 might follow this production; if we don't see one of them, then
22281 complain and silently insert the semicolon. */
22283 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22284 bool want_semicolon
= true;
22286 if (cp_next_tokens_can_be_std_attribute_p (parser
))
22287 /* Don't try to parse c++11 attributes here. As per the
22288 grammar, that should be a task for
22289 cp_parser_decl_specifier_seq. */
22290 want_semicolon
= false;
22292 switch (token
->type
)
22295 case CPP_SEMICOLON
:
22298 case CPP_OPEN_PAREN
:
22299 case CPP_CLOSE_PAREN
:
22301 want_semicolon
= false;
22304 /* While it's legal for type qualifiers and storage class
22305 specifiers to follow type definitions in the grammar, only
22306 compiler testsuites contain code like that. Assume that if
22307 we see such code, then what we're really seeing is a case
22311 const <type> var = ...;
22316 static <type> func (...) ...
22318 i.e. the qualifier or specifier applies to the next
22319 declaration. To do so, however, we need to look ahead one
22320 more token to see if *that* token is a type specifier.
22322 This code could be improved to handle:
22325 static const <type> var = ...; */
22327 if (keyword_is_decl_specifier (token
->keyword
))
22329 cp_token
*lookahead
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
22331 /* Handling user-defined types here would be nice, but very
22334 = (lookahead
->type
== CPP_KEYWORD
22335 && keyword_begins_type_specifier (lookahead
->keyword
));
22342 /* If we don't have a type, then something is very wrong and we
22343 shouldn't try to do anything clever. Likewise for not seeing the
22345 if (closing_brace
&& TYPE_P (type
) && want_semicolon
)
22347 /* Locate the closing brace. */
22348 cp_token_position prev
22349 = cp_lexer_previous_token_position (parser
->lexer
);
22350 cp_token
*prev_token
= cp_lexer_token_at (parser
->lexer
, prev
);
22351 location_t loc
= prev_token
->location
;
22353 /* We want to suggest insertion of a ';' immediately *after* the
22354 closing brace, so, if we can, offset the location by 1 column. */
22355 location_t next_loc
= loc
;
22356 if (!linemap_location_from_macro_expansion_p (line_table
, loc
))
22357 next_loc
= linemap_position_for_loc_and_offset (line_table
, loc
, 1);
22359 rich_location
richloc (line_table
, next_loc
);
22361 /* If we successfully offset the location, suggest the fix-it. */
22362 if (next_loc
!= loc
)
22363 richloc
.add_fixit_insert_before (next_loc
, ";");
22365 if (CLASSTYPE_DECLARED_CLASS (type
))
22366 error_at_rich_loc (&richloc
,
22367 "expected %<;%> after class definition");
22368 else if (TREE_CODE (type
) == RECORD_TYPE
)
22369 error_at_rich_loc (&richloc
,
22370 "expected %<;%> after struct definition");
22371 else if (TREE_CODE (type
) == UNION_TYPE
)
22372 error_at_rich_loc (&richloc
,
22373 "expected %<;%> after union definition");
22375 gcc_unreachable ();
22377 /* Unget one token and smash it to look as though we encountered
22378 a semicolon in the input stream. */
22379 cp_lexer_set_token_position (parser
->lexer
, prev
);
22380 token
= cp_lexer_peek_token (parser
->lexer
);
22381 token
->type
= CPP_SEMICOLON
;
22382 token
->keyword
= RID_MAX
;
22386 /* If this class is not itself within the scope of another class,
22387 then we need to parse the bodies of all of the queued function
22388 definitions. Note that the queued functions defined in a class
22389 are not always processed immediately following the
22390 class-specifier for that class. Consider:
22393 struct B { void f() { sizeof (A); } };
22396 If `f' were processed before the processing of `A' were
22397 completed, there would be no way to compute the size of `A'.
22398 Note that the nesting we are interested in here is lexical --
22399 not the semantic nesting given by TYPE_CONTEXT. In particular,
22402 struct A { struct B; };
22403 struct A::B { void f() { } };
22405 there is no need to delay the parsing of `A::B::f'. */
22406 if (--parser
->num_classes_being_defined
== 0)
22409 tree class_type
= NULL_TREE
;
22410 tree pushed_scope
= NULL_TREE
;
22412 cp_default_arg_entry
*e
;
22413 tree save_ccp
, save_ccr
;
22415 /* In a first pass, parse default arguments to the functions.
22416 Then, in a second pass, parse the bodies of the functions.
22417 This two-phased approach handles cases like:
22425 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_default_args
, ix
, e
)
22428 /* If there are default arguments that have not yet been processed,
22429 take care of them now. */
22430 if (class_type
!= e
->class_type
)
22433 pop_scope (pushed_scope
);
22434 class_type
= e
->class_type
;
22435 pushed_scope
= push_scope (class_type
);
22437 /* Make sure that any template parameters are in scope. */
22438 maybe_begin_member_template_processing (decl
);
22439 /* Parse the default argument expressions. */
22440 cp_parser_late_parsing_default_args (parser
, decl
);
22441 /* Remove any template parameters from the symbol table. */
22442 maybe_end_member_template_processing ();
22444 vec_safe_truncate (unparsed_funs_with_default_args
, 0);
22445 /* Now parse any NSDMIs. */
22446 save_ccp
= current_class_ptr
;
22447 save_ccr
= current_class_ref
;
22448 FOR_EACH_VEC_SAFE_ELT (unparsed_nsdmis
, ix
, decl
)
22450 if (class_type
!= DECL_CONTEXT (decl
))
22453 pop_scope (pushed_scope
);
22454 class_type
= DECL_CONTEXT (decl
);
22455 pushed_scope
= push_scope (class_type
);
22457 inject_this_parameter (class_type
, TYPE_UNQUALIFIED
);
22458 cp_parser_late_parsing_nsdmi (parser
, decl
);
22460 vec_safe_truncate (unparsed_nsdmis
, 0);
22461 current_class_ptr
= save_ccp
;
22462 current_class_ref
= save_ccr
;
22464 pop_scope (pushed_scope
);
22466 /* Now do some post-NSDMI bookkeeping. */
22467 FOR_EACH_VEC_SAFE_ELT (unparsed_classes
, ix
, class_type
)
22468 after_nsdmi_defaulted_late_checks (class_type
);
22469 vec_safe_truncate (unparsed_classes
, 0);
22470 after_nsdmi_defaulted_late_checks (type
);
22472 /* Now parse the body of the functions. */
22475 /* OpenMP UDRs need to be parsed before all other functions. */
22476 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_definitions
, ix
, decl
)
22477 if (DECL_OMP_DECLARE_REDUCTION_P (decl
))
22478 cp_parser_late_parsing_for_member (parser
, decl
);
22479 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_definitions
, ix
, decl
)
22480 if (!DECL_OMP_DECLARE_REDUCTION_P (decl
))
22481 cp_parser_late_parsing_for_member (parser
, decl
);
22484 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_definitions
, ix
, decl
)
22485 cp_parser_late_parsing_for_member (parser
, decl
);
22486 vec_safe_truncate (unparsed_funs_with_definitions
, 0);
22489 vec_safe_push (unparsed_classes
, type
);
22491 /* Put back any saved access checks. */
22492 pop_deferring_access_checks ();
22494 /* Restore saved state. */
22495 parser
->in_switch_statement_p
= in_switch_statement_p
;
22496 parser
->in_statement
= in_statement
;
22497 parser
->in_function_body
= saved_in_function_body
;
22498 parser
->num_template_parameter_lists
22499 = saved_num_template_parameter_lists
;
22500 parser
->in_unbraced_linkage_specification_p
22501 = saved_in_unbraced_linkage_specification_p
;
22507 cp_parser_class_specifier (cp_parser
* parser
)
22510 timevar_push (TV_PARSE_STRUCT
);
22511 ret
= cp_parser_class_specifier_1 (parser
);
22512 timevar_pop (TV_PARSE_STRUCT
);
22516 /* Parse a class-head.
22519 class-key identifier [opt] base-clause [opt]
22520 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22521 class-key nested-name-specifier [opt] template-id
22524 class-virt-specifier:
22528 class-key attributes identifier [opt] base-clause [opt]
22529 class-key attributes nested-name-specifier identifier base-clause [opt]
22530 class-key attributes nested-name-specifier [opt] template-id
22533 Upon return BASES is initialized to the list of base classes (or
22534 NULL, if there are none) in the same form returned by
22535 cp_parser_base_clause.
22537 Returns the TYPE of the indicated class. Sets
22538 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22539 involving a nested-name-specifier was used, and FALSE otherwise.
22541 Returns error_mark_node if this is not a class-head.
22543 Returns NULL_TREE if the class-head is syntactically valid, but
22544 semantically invalid in a way that means we should skip the entire
22545 body of the class. */
22548 cp_parser_class_head (cp_parser
* parser
,
22549 bool* nested_name_specifier_p
)
22551 tree nested_name_specifier
;
22552 enum tag_types class_key
;
22553 tree id
= NULL_TREE
;
22554 tree type
= NULL_TREE
;
22557 cp_virt_specifiers virt_specifiers
= VIRT_SPEC_UNSPECIFIED
;
22558 bool template_id_p
= false;
22559 bool qualified_p
= false;
22560 bool invalid_nested_name_p
= false;
22561 bool invalid_explicit_specialization_p
= false;
22562 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
22563 tree pushed_scope
= NULL_TREE
;
22564 unsigned num_templates
;
22565 cp_token
*type_start_token
= NULL
, *nested_name_specifier_token_start
= NULL
;
22566 /* Assume no nested-name-specifier will be present. */
22567 *nested_name_specifier_p
= false;
22568 /* Assume no template parameter lists will be used in defining the
22571 parser
->colon_corrects_to_scope_p
= false;
22573 /* Look for the class-key. */
22574 class_key
= cp_parser_class_key (parser
);
22575 if (class_key
== none_type
)
22576 return error_mark_node
;
22578 location_t class_head_start_location
= input_location
;
22580 /* Parse the attributes. */
22581 attributes
= cp_parser_attributes_opt (parser
);
22583 /* If the next token is `::', that is invalid -- but sometimes
22584 people do try to write:
22588 Handle this gracefully by accepting the extra qualifier, and then
22589 issuing an error about it later if this really is a
22590 class-head. If it turns out just to be an elaborated type
22591 specifier, remain silent. */
22592 if (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false))
22593 qualified_p
= true;
22595 push_deferring_access_checks (dk_no_check
);
22597 /* Determine the name of the class. Begin by looking for an
22598 optional nested-name-specifier. */
22599 nested_name_specifier_token_start
= cp_lexer_peek_token (parser
->lexer
);
22600 nested_name_specifier
22601 = cp_parser_nested_name_specifier_opt (parser
,
22602 /*typename_keyword_p=*/false,
22603 /*check_dependency_p=*/false,
22605 /*is_declaration=*/false);
22606 /* If there was a nested-name-specifier, then there *must* be an
22609 cp_token
*bad_template_keyword
= NULL
;
22611 if (nested_name_specifier
)
22613 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
22614 /* Although the grammar says `identifier', it really means
22615 `class-name' or `template-name'. You are only allowed to
22616 define a class that has already been declared with this
22619 The proposed resolution for Core Issue 180 says that wherever
22620 you see `class T::X' you should treat `X' as a type-name.
22622 It is OK to define an inaccessible class; for example:
22624 class A { class B; };
22627 We do not know if we will see a class-name, or a
22628 template-name. We look for a class-name first, in case the
22629 class-name is a template-id; if we looked for the
22630 template-name first we would stop after the template-name. */
22631 cp_parser_parse_tentatively (parser
);
22632 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
22633 bad_template_keyword
= cp_lexer_consume_token (parser
->lexer
);
22634 type
= cp_parser_class_name (parser
,
22635 /*typename_keyword_p=*/false,
22636 /*template_keyword_p=*/false,
22638 /*check_dependency_p=*/false,
22639 /*class_head_p=*/true,
22640 /*is_declaration=*/false);
22641 /* If that didn't work, ignore the nested-name-specifier. */
22642 if (!cp_parser_parse_definitely (parser
))
22644 invalid_nested_name_p
= true;
22645 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
22646 id
= cp_parser_identifier (parser
);
22647 if (id
== error_mark_node
)
22650 /* If we could not find a corresponding TYPE, treat this
22651 declaration like an unqualified declaration. */
22652 if (type
== error_mark_node
)
22653 nested_name_specifier
= NULL_TREE
;
22654 /* Otherwise, count the number of templates used in TYPE and its
22655 containing scopes. */
22660 for (scope
= TREE_TYPE (type
);
22661 scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
;
22662 scope
= get_containing_scope (scope
))
22664 && CLASS_TYPE_P (scope
)
22665 && CLASSTYPE_TEMPLATE_INFO (scope
)
22666 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
))
22667 && (!CLASSTYPE_TEMPLATE_SPECIALIZATION (scope
)
22668 || uses_template_parms (CLASSTYPE_TI_ARGS (scope
))))
22672 /* Otherwise, the identifier is optional. */
22675 /* We don't know whether what comes next is a template-id,
22676 an identifier, or nothing at all. */
22677 cp_parser_parse_tentatively (parser
);
22678 /* Check for a template-id. */
22679 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
22680 id
= cp_parser_template_id (parser
,
22681 /*template_keyword_p=*/false,
22682 /*check_dependency_p=*/true,
22684 /*is_declaration=*/true);
22685 /* If that didn't work, it could still be an identifier. */
22686 if (!cp_parser_parse_definitely (parser
))
22688 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
22690 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
22691 id
= cp_parser_identifier (parser
);
22698 template_id_p
= true;
22703 pop_deferring_access_checks ();
22707 cp_parser_check_for_invalid_template_id (parser
, id
,
22709 type_start_token
->location
);
22711 virt_specifiers
= cp_parser_virt_specifier_seq_opt (parser
);
22713 /* If it's not a `:' or a `{' then we can't really be looking at a
22714 class-head, since a class-head only appears as part of a
22715 class-specifier. We have to detect this situation before calling
22716 xref_tag, since that has irreversible side-effects. */
22717 if (!cp_parser_next_token_starts_class_definition_p (parser
))
22719 cp_parser_error (parser
, "expected %<{%> or %<:%>");
22720 type
= error_mark_node
;
22724 /* At this point, we're going ahead with the class-specifier, even
22725 if some other problem occurs. */
22726 cp_parser_commit_to_tentative_parse (parser
);
22727 if (virt_specifiers
& VIRT_SPEC_OVERRIDE
)
22729 cp_parser_error (parser
,
22730 "cannot specify %<override%> for a class");
22731 type
= error_mark_node
;
22734 /* Issue the error about the overly-qualified name now. */
22737 cp_parser_error (parser
,
22738 "global qualification of class name is invalid");
22739 type
= error_mark_node
;
22742 else if (invalid_nested_name_p
)
22744 cp_parser_error (parser
,
22745 "qualified name does not name a class");
22746 type
= error_mark_node
;
22749 else if (nested_name_specifier
)
22753 if (bad_template_keyword
)
22754 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22755 keyword template shall not appear at the top level. */
22756 pedwarn (bad_template_keyword
->location
, OPT_Wpedantic
,
22757 "keyword %<template%> not allowed in class-head-name");
22759 /* Reject typedef-names in class heads. */
22760 if (!DECL_IMPLICIT_TYPEDEF_P (type
))
22762 error_at (type_start_token
->location
,
22763 "invalid class name in declaration of %qD",
22769 /* Figure out in what scope the declaration is being placed. */
22770 scope
= current_scope ();
22771 /* If that scope does not contain the scope in which the
22772 class was originally declared, the program is invalid. */
22773 if (scope
&& !is_ancestor (scope
, nested_name_specifier
))
22775 if (at_namespace_scope_p ())
22776 error_at (type_start_token
->location
,
22777 "declaration of %qD in namespace %qD which does not "
22779 type
, scope
, nested_name_specifier
);
22781 error_at (type_start_token
->location
,
22782 "declaration of %qD in %qD which does not enclose %qD",
22783 type
, scope
, nested_name_specifier
);
22789 A declarator-id shall not be qualified except for the
22790 definition of a ... nested class outside of its class
22791 ... [or] the definition or explicit instantiation of a
22792 class member of a namespace outside of its namespace. */
22793 if (scope
== nested_name_specifier
)
22795 permerror (nested_name_specifier_token_start
->location
,
22796 "extra qualification not allowed");
22797 nested_name_specifier
= NULL_TREE
;
22801 /* An explicit-specialization must be preceded by "template <>". If
22802 it is not, try to recover gracefully. */
22803 if (at_namespace_scope_p ()
22804 && parser
->num_template_parameter_lists
== 0
22805 && !processing_template_parmlist
22808 /* Build a location of this form:
22809 struct typename <ARGS>
22810 ^~~~~~~~~~~~~~~~~~~~~~
22811 with caret==start at the start token, and
22812 finishing at the end of the type. */
22813 location_t reported_loc
22814 = make_location (class_head_start_location
,
22815 class_head_start_location
,
22816 get_finish (type_start_token
->location
));
22817 rich_location
richloc (line_table
, reported_loc
);
22818 richloc
.add_fixit_insert_before (class_head_start_location
,
22822 "an explicit specialization must be preceded by %<template <>%>");
22823 invalid_explicit_specialization_p
= true;
22824 /* Take the same action that would have been taken by
22825 cp_parser_explicit_specialization. */
22826 ++parser
->num_template_parameter_lists
;
22827 begin_specialization ();
22829 /* There must be no "return" statements between this point and the
22830 end of this function; set "type "to the correct return value and
22831 use "goto done;" to return. */
22832 /* Make sure that the right number of template parameters were
22834 if (!cp_parser_check_template_parameters (parser
, num_templates
,
22835 type_start_token
->location
,
22836 /*declarator=*/NULL
))
22838 /* If something went wrong, there is no point in even trying to
22839 process the class-definition. */
22844 /* Look up the type. */
22847 if (TREE_CODE (id
) == TEMPLATE_ID_EXPR
22848 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id
, 0))
22849 || TREE_CODE (TREE_OPERAND (id
, 0)) == OVERLOAD
))
22851 error_at (type_start_token
->location
,
22852 "function template %qD redeclared as a class template", id
);
22853 type
= error_mark_node
;
22857 type
= TREE_TYPE (id
);
22858 type
= maybe_process_partial_specialization (type
);
22860 /* Check the scope while we still know whether or not we had a
22861 nested-name-specifier. */
22862 if (type
!= error_mark_node
)
22863 check_unqualified_spec_or_inst (type
, type_start_token
->location
);
22865 if (nested_name_specifier
)
22866 pushed_scope
= push_scope (nested_name_specifier
);
22868 else if (nested_name_specifier
)
22874 template <typename T> struct S { struct T };
22875 template <typename T> struct S<T>::T { };
22877 we will get a TYPENAME_TYPE when processing the definition of
22878 `S::T'. We need to resolve it to the actual type before we
22879 try to define it. */
22880 if (TREE_CODE (TREE_TYPE (type
)) == TYPENAME_TYPE
)
22882 class_type
= resolve_typename_type (TREE_TYPE (type
),
22883 /*only_current_p=*/false);
22884 if (TREE_CODE (class_type
) != TYPENAME_TYPE
)
22885 type
= TYPE_NAME (class_type
);
22888 cp_parser_error (parser
, "could not resolve typename type");
22889 type
= error_mark_node
;
22893 if (maybe_process_partial_specialization (TREE_TYPE (type
))
22894 == error_mark_node
)
22900 class_type
= current_class_type
;
22901 /* Enter the scope indicated by the nested-name-specifier. */
22902 pushed_scope
= push_scope (nested_name_specifier
);
22903 /* Get the canonical version of this type. */
22904 type
= TYPE_MAIN_DECL (TREE_TYPE (type
));
22905 /* Call push_template_decl if it seems like we should be defining a
22906 template either from the template headers or the type we're
22907 defining, so that we diagnose both extra and missing headers. */
22908 if ((PROCESSING_REAL_TEMPLATE_DECL_P ()
22909 || CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (type
)))
22910 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type
)))
22912 type
= push_template_decl (type
);
22913 if (type
== error_mark_node
)
22920 type
= TREE_TYPE (type
);
22921 *nested_name_specifier_p
= true;
22923 else /* The name is not a nested name. */
22925 /* If the class was unnamed, create a dummy name. */
22927 id
= make_anon_name ();
22928 tag_scope tag_scope
= (parser
->in_type_id_in_expr_p
22929 ? ts_within_enclosing_non_class
22931 type
= xref_tag (class_key
, id
, tag_scope
,
22932 parser
->num_template_parameter_lists
);
22935 /* Indicate whether this class was declared as a `class' or as a
22937 if (TREE_CODE (type
) == RECORD_TYPE
)
22938 CLASSTYPE_DECLARED_CLASS (type
) = (class_key
== class_type
);
22939 cp_parser_check_class_key (class_key
, type
);
22941 /* If this type was already complete, and we see another definition,
22942 that's an error. */
22943 if (type
!= error_mark_node
&& COMPLETE_TYPE_P (type
))
22945 error_at (type_start_token
->location
, "redefinition of %q#T",
22947 inform (location_of (type
), "previous definition of %q#T",
22952 else if (type
== error_mark_node
)
22957 /* Apply attributes now, before any use of the class as a template
22958 argument in its base list. */
22959 cplus_decl_attributes (&type
, attributes
, (int)ATTR_FLAG_TYPE_IN_PLACE
);
22960 fixup_attribute_variants (type
);
22963 /* We will have entered the scope containing the class; the names of
22964 base classes should be looked up in that context. For example:
22966 struct A { struct B {}; struct C; };
22967 struct A::C : B {};
22971 /* Get the list of base-classes, if there is one. */
22972 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
22974 /* PR59482: enter the class scope so that base-specifiers are looked
22978 bases
= cp_parser_base_clause (parser
);
22979 /* PR59482: get out of the previously pushed class scope so that the
22980 subsequent pops pop the right thing. */
22987 /* If we're really defining a class, process the base classes.
22988 If they're invalid, fail. */
22989 if (type
&& cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
22990 xref_basetypes (type
, bases
);
22993 /* Leave the scope given by the nested-name-specifier. We will
22994 enter the class scope itself while processing the members. */
22996 pop_scope (pushed_scope
);
22998 if (invalid_explicit_specialization_p
)
23000 end_specialization ();
23001 --parser
->num_template_parameter_lists
;
23005 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
23006 if (type
&& (virt_specifiers
& VIRT_SPEC_FINAL
))
23007 CLASSTYPE_FINAL (type
) = 1;
23009 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
23013 /* Parse a class-key.
23020 Returns the kind of class-key specified, or none_type to indicate
23023 static enum tag_types
23024 cp_parser_class_key (cp_parser
* parser
)
23027 enum tag_types tag_type
;
23029 /* Look for the class-key. */
23030 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_KEY
);
23034 /* Check to see if the TOKEN is a class-key. */
23035 tag_type
= cp_parser_token_is_class_key (token
);
23037 cp_parser_error (parser
, "expected class-key");
23041 /* Parse a type-parameter-key.
23043 type-parameter-key:
23049 cp_parser_type_parameter_key (cp_parser
* parser
)
23051 /* Look for the type-parameter-key. */
23052 enum tag_types tag_type
= none_type
;
23053 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23054 if ((tag_type
= cp_parser_token_is_type_parameter_key (token
)) != none_type
)
23056 cp_lexer_consume_token (parser
->lexer
);
23057 if (pedantic
&& tag_type
== typename_type
&& cxx_dialect
< cxx1z
)
23058 /* typename is not allowed in a template template parameter
23059 by the standard until C++1Z. */
23060 pedwarn (token
->location
, OPT_Wpedantic
,
23061 "ISO C++ forbids typename key in template template parameter;"
23062 " use -std=c++1z or -std=gnu++1z");
23065 cp_parser_error (parser
, "expected %<class%> or %<typename%>");
23070 /* Parse an (optional) member-specification.
23072 member-specification:
23073 member-declaration member-specification [opt]
23074 access-specifier : member-specification [opt] */
23077 cp_parser_member_specification_opt (cp_parser
* parser
)
23084 /* Peek at the next token. */
23085 token
= cp_lexer_peek_token (parser
->lexer
);
23086 /* If it's a `}', or EOF then we've seen all the members. */
23087 if (token
->type
== CPP_CLOSE_BRACE
23088 || token
->type
== CPP_EOF
23089 || token
->type
== CPP_PRAGMA_EOL
)
23092 /* See if this token is a keyword. */
23093 keyword
= token
->keyword
;
23097 case RID_PROTECTED
:
23099 /* Consume the access-specifier. */
23100 cp_lexer_consume_token (parser
->lexer
);
23101 /* Remember which access-specifier is active. */
23102 current_access_specifier
= token
->u
.value
;
23103 /* Look for the `:'. */
23104 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
23108 /* Accept #pragmas at class scope. */
23109 if (token
->type
== CPP_PRAGMA
)
23111 cp_parser_pragma (parser
, pragma_member
, NULL
);
23115 /* Otherwise, the next construction must be a
23116 member-declaration. */
23117 cp_parser_member_declaration (parser
);
23122 /* Parse a member-declaration.
23124 member-declaration:
23125 decl-specifier-seq [opt] member-declarator-list [opt] ;
23126 function-definition ; [opt]
23127 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23129 template-declaration
23132 member-declarator-list:
23134 member-declarator-list , member-declarator
23137 declarator pure-specifier [opt]
23138 declarator constant-initializer [opt]
23139 identifier [opt] : constant-expression
23143 member-declaration:
23144 __extension__ member-declaration
23147 declarator attributes [opt] pure-specifier [opt]
23148 declarator attributes [opt] constant-initializer [opt]
23149 identifier [opt] attributes [opt] : constant-expression
23153 member-declaration:
23154 static_assert-declaration */
23157 cp_parser_member_declaration (cp_parser
* parser
)
23159 cp_decl_specifier_seq decl_specifiers
;
23160 tree prefix_attributes
;
23162 int declares_class_or_enum
;
23164 cp_token
*token
= NULL
;
23165 cp_token
*decl_spec_token_start
= NULL
;
23166 cp_token
*initializer_token_start
= NULL
;
23167 int saved_pedantic
;
23168 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
23170 /* Check for the `__extension__' keyword. */
23171 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
23174 cp_parser_member_declaration (parser
);
23175 /* Restore the old value of the PEDANTIC flag. */
23176 pedantic
= saved_pedantic
;
23181 /* Check for a template-declaration. */
23182 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
23184 /* An explicit specialization here is an error condition, and we
23185 expect the specialization handler to detect and report this. */
23186 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
23187 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
23188 cp_parser_explicit_specialization (parser
);
23190 cp_parser_template_declaration (parser
, /*member_p=*/true);
23194 /* Check for a template introduction. */
23195 else if (cp_parser_template_declaration_after_export (parser
, true))
23198 /* Check for a using-declaration. */
23199 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
23201 if (cxx_dialect
< cxx11
)
23203 /* Parse the using-declaration. */
23204 cp_parser_using_declaration (parser
,
23205 /*access_declaration_p=*/false);
23211 bool alias_decl_expected
;
23212 cp_parser_parse_tentatively (parser
);
23213 decl
= cp_parser_alias_declaration (parser
);
23214 /* Note that if we actually see the '=' token after the
23215 identifier, cp_parser_alias_declaration commits the
23216 tentative parse. In that case, we really expect an
23217 alias-declaration. Otherwise, we expect a using
23219 alias_decl_expected
=
23220 !cp_parser_uncommitted_to_tentative_parse_p (parser
);
23221 cp_parser_parse_definitely (parser
);
23223 if (alias_decl_expected
)
23224 finish_member_declaration (decl
);
23226 cp_parser_using_declaration (parser
,
23227 /*access_declaration_p=*/false);
23232 /* Check for @defs. */
23233 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_DEFS
))
23236 tree ivar_chains
= cp_parser_objc_defs_expression (parser
);
23237 ivar
= ivar_chains
;
23241 ivar
= TREE_CHAIN (member
);
23242 TREE_CHAIN (member
) = NULL_TREE
;
23243 finish_member_declaration (member
);
23248 /* If the next token is `static_assert' we have a static assertion. */
23249 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC_ASSERT
))
23251 cp_parser_static_assert (parser
, /*member_p=*/true);
23255 parser
->colon_corrects_to_scope_p
= false;
23257 if (cp_parser_using_declaration (parser
, /*access_declaration=*/true))
23260 /* Parse the decl-specifier-seq. */
23261 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
23262 cp_parser_decl_specifier_seq (parser
,
23263 CP_PARSER_FLAGS_OPTIONAL
,
23265 &declares_class_or_enum
);
23266 /* Check for an invalid type-name. */
23267 if (!decl_specifiers
.any_type_specifiers_p
23268 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
23270 /* If there is no declarator, then the decl-specifier-seq should
23272 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
23274 /* If there was no decl-specifier-seq, and the next token is a
23275 `;', then we have something like:
23281 Each member-declaration shall declare at least one member
23282 name of the class. */
23283 if (!decl_specifiers
.any_specifiers_p
)
23285 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23286 if (!in_system_header_at (token
->location
))
23288 gcc_rich_location
richloc (token
->location
);
23289 richloc
.add_fixit_remove ();
23290 pedwarn_at_rich_loc (&richloc
, OPT_Wpedantic
, "extra %<;%>");
23297 /* See if this declaration is a friend. */
23298 friend_p
= cp_parser_friend_p (&decl_specifiers
);
23299 /* If there were decl-specifiers, check to see if there was
23300 a class-declaration. */
23301 type
= check_tag_decl (&decl_specifiers
,
23302 /*explicit_type_instantiation_p=*/false);
23303 /* Nested classes have already been added to the class, but
23304 a `friend' needs to be explicitly registered. */
23307 /* If the `friend' keyword was present, the friend must
23308 be introduced with a class-key. */
23309 if (!declares_class_or_enum
&& cxx_dialect
< cxx11
)
23310 pedwarn (decl_spec_token_start
->location
, OPT_Wpedantic
,
23311 "in C++03 a class-key must be used "
23312 "when declaring a friend");
23315 template <typename T> struct A {
23316 friend struct A<T>::B;
23319 A<T>::B will be represented by a TYPENAME_TYPE, and
23320 therefore not recognized by check_tag_decl. */
23323 type
= decl_specifiers
.type
;
23324 if (type
&& TREE_CODE (type
) == TYPE_DECL
)
23325 type
= TREE_TYPE (type
);
23327 if (!type
|| !TYPE_P (type
))
23328 error_at (decl_spec_token_start
->location
,
23329 "friend declaration does not name a class or "
23332 make_friend_class (current_class_type
, type
,
23333 /*complain=*/true);
23335 /* If there is no TYPE, an error message will already have
23337 else if (!type
|| type
== error_mark_node
)
23339 /* An anonymous aggregate has to be handled specially; such
23340 a declaration really declares a data member (with a
23341 particular type), as opposed to a nested class. */
23342 else if (ANON_AGGR_TYPE_P (type
))
23345 if (decl_specifiers
.storage_class
!= sc_none
)
23346 error_at (decl_spec_token_start
->location
,
23347 "a storage class on an anonymous aggregate "
23348 "in class scope is not allowed");
23350 /* Remove constructors and such from TYPE, now that we
23351 know it is an anonymous aggregate. */
23352 fixup_anonymous_aggr (type
);
23353 /* And make the corresponding data member. */
23354 decl
= build_decl (decl_spec_token_start
->location
,
23355 FIELD_DECL
, NULL_TREE
, type
);
23356 /* Add it to the class. */
23357 finish_member_declaration (decl
);
23360 cp_parser_check_access_in_redeclaration
23362 decl_spec_token_start
->location
);
23367 bool assume_semicolon
= false;
23369 /* Clear attributes from the decl_specifiers but keep them
23370 around as prefix attributes that apply them to the entity
23372 prefix_attributes
= decl_specifiers
.attributes
;
23373 decl_specifiers
.attributes
= NULL_TREE
;
23375 /* See if these declarations will be friends. */
23376 friend_p
= cp_parser_friend_p (&decl_specifiers
);
23378 /* Keep going until we hit the `;' at the end of the
23380 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
23382 tree attributes
= NULL_TREE
;
23383 tree first_attribute
;
23385 /* Peek at the next token. */
23386 token
= cp_lexer_peek_token (parser
->lexer
);
23388 /* Check for a bitfield declaration. */
23389 if (token
->type
== CPP_COLON
23390 || (token
->type
== CPP_NAME
23391 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
23397 /* Get the name of the bitfield. Note that we cannot just
23398 check TOKEN here because it may have been invalidated by
23399 the call to cp_lexer_peek_nth_token above. */
23400 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
23401 identifier
= cp_parser_identifier (parser
);
23403 identifier
= NULL_TREE
;
23405 /* Consume the `:' token. */
23406 cp_lexer_consume_token (parser
->lexer
);
23407 /* Get the width of the bitfield. */
23409 = cp_parser_constant_expression (parser
);
23411 /* Look for attributes that apply to the bitfield. */
23412 attributes
= cp_parser_attributes_opt (parser
);
23413 /* Remember which attributes are prefix attributes and
23415 first_attribute
= attributes
;
23416 /* Combine the attributes. */
23417 attributes
= chainon (prefix_attributes
, attributes
);
23419 /* Create the bitfield declaration. */
23420 decl
= grokbitfield (identifier
23421 ? make_id_declarator (NULL_TREE
,
23431 cp_declarator
*declarator
;
23433 tree asm_specification
;
23434 int ctor_dtor_or_conv_p
;
23436 /* Parse the declarator. */
23438 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
23439 &ctor_dtor_or_conv_p
,
23440 /*parenthesized_p=*/NULL
,
23444 /* If something went wrong parsing the declarator, make sure
23445 that we at least consume some tokens. */
23446 if (declarator
== cp_error_declarator
)
23448 /* Skip to the end of the statement. */
23449 cp_parser_skip_to_end_of_statement (parser
);
23450 /* If the next token is not a semicolon, that is
23451 probably because we just skipped over the body of
23452 a function. So, we consume a semicolon if
23453 present, but do not issue an error message if it
23455 if (cp_lexer_next_token_is (parser
->lexer
,
23457 cp_lexer_consume_token (parser
->lexer
);
23461 if (declares_class_or_enum
& 2)
23462 cp_parser_check_for_definition_in_return_type
23463 (declarator
, decl_specifiers
.type
,
23464 decl_specifiers
.locations
[ds_type_spec
]);
23466 /* Look for an asm-specification. */
23467 asm_specification
= cp_parser_asm_specification_opt (parser
);
23468 /* Look for attributes that apply to the declaration. */
23469 attributes
= cp_parser_attributes_opt (parser
);
23470 /* Remember which attributes are prefix attributes and
23472 first_attribute
= attributes
;
23473 /* Combine the attributes. */
23474 attributes
= chainon (prefix_attributes
, attributes
);
23476 /* If it's an `=', then we have a constant-initializer or a
23477 pure-specifier. It is not correct to parse the
23478 initializer before registering the member declaration
23479 since the member declaration should be in scope while
23480 its initializer is processed. However, the rest of the
23481 front end does not yet provide an interface that allows
23482 us to handle this correctly. */
23483 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
23487 A pure-specifier shall be used only in the declaration of
23488 a virtual function.
23490 A member-declarator can contain a constant-initializer
23491 only if it declares a static member of integral or
23494 Therefore, if the DECLARATOR is for a function, we look
23495 for a pure-specifier; otherwise, we look for a
23496 constant-initializer. When we call `grokfield', it will
23497 perform more stringent semantics checks. */
23498 initializer_token_start
= cp_lexer_peek_token (parser
->lexer
);
23499 if (function_declarator_p (declarator
)
23500 || (decl_specifiers
.type
23501 && TREE_CODE (decl_specifiers
.type
) == TYPE_DECL
23502 && declarator
->kind
== cdk_id
23503 && (TREE_CODE (TREE_TYPE (decl_specifiers
.type
))
23504 == FUNCTION_TYPE
)))
23505 initializer
= cp_parser_pure_specifier (parser
);
23506 else if (decl_specifiers
.storage_class
!= sc_static
)
23507 initializer
= cp_parser_save_nsdmi (parser
);
23508 else if (cxx_dialect
>= cxx11
)
23511 /* Don't require a constant rvalue in C++11, since we
23512 might want a reference constant. We'll enforce
23513 constancy later. */
23514 cp_lexer_consume_token (parser
->lexer
);
23515 /* Parse the initializer. */
23516 initializer
= cp_parser_initializer_clause (parser
,
23520 /* Parse the initializer. */
23521 initializer
= cp_parser_constant_initializer (parser
);
23523 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
)
23524 && !function_declarator_p (declarator
))
23527 if (decl_specifiers
.storage_class
!= sc_static
)
23528 initializer
= cp_parser_save_nsdmi (parser
);
23530 initializer
= cp_parser_initializer (parser
, &x
, &x
);
23532 /* Otherwise, there is no initializer. */
23534 initializer
= NULL_TREE
;
23536 /* See if we are probably looking at a function
23537 definition. We are certainly not looking at a
23538 member-declarator. Calling `grokfield' has
23539 side-effects, so we must not do it unless we are sure
23540 that we are looking at a member-declarator. */
23541 if (cp_parser_token_starts_function_definition_p
23542 (cp_lexer_peek_token (parser
->lexer
)))
23544 /* The grammar does not allow a pure-specifier to be
23545 used when a member function is defined. (It is
23546 possible that this fact is an oversight in the
23547 standard, since a pure function may be defined
23548 outside of the class-specifier. */
23549 if (initializer
&& initializer_token_start
)
23550 error_at (initializer_token_start
->location
,
23551 "pure-specifier on function-definition");
23552 decl
= cp_parser_save_member_function_body (parser
,
23556 if (parser
->fully_implicit_function_template_p
)
23557 decl
= finish_fully_implicit_template (parser
, decl
);
23558 /* If the member was not a friend, declare it here. */
23560 finish_member_declaration (decl
);
23561 /* Peek at the next token. */
23562 token
= cp_lexer_peek_token (parser
->lexer
);
23563 /* If the next token is a semicolon, consume it. */
23564 if (token
->type
== CPP_SEMICOLON
)
23566 location_t semicolon_loc
23567 = cp_lexer_consume_token (parser
->lexer
)->location
;
23568 gcc_rich_location
richloc (semicolon_loc
);
23569 richloc
.add_fixit_remove ();
23570 warning_at_rich_loc (&richloc
, OPT_Wextra_semi
,
23571 "extra %<;%> after in-class "
23572 "function definition");
23577 if (declarator
->kind
== cdk_function
)
23578 declarator
->id_loc
= token
->location
;
23579 /* Create the declaration. */
23580 decl
= grokfield (declarator
, &decl_specifiers
,
23581 initializer
, /*init_const_expr_p=*/true,
23582 asm_specification
, attributes
);
23583 if (parser
->fully_implicit_function_template_p
)
23586 finish_fully_implicit_template (parser
, 0);
23588 decl
= finish_fully_implicit_template (parser
, decl
);
23592 cp_finalize_omp_declare_simd (parser
, decl
);
23593 cp_finalize_oacc_routine (parser
, decl
, false);
23595 /* Reset PREFIX_ATTRIBUTES. */
23596 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
23597 attributes
= TREE_CHAIN (attributes
);
23599 TREE_CHAIN (attributes
) = NULL_TREE
;
23601 /* If there is any qualification still in effect, clear it
23602 now; we will be starting fresh with the next declarator. */
23603 parser
->scope
= NULL_TREE
;
23604 parser
->qualifying_scope
= NULL_TREE
;
23605 parser
->object_scope
= NULL_TREE
;
23606 /* If it's a `,', then there are more declarators. */
23607 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23609 cp_lexer_consume_token (parser
->lexer
);
23610 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
23612 cp_token
*token
= cp_lexer_previous_token (parser
->lexer
);
23613 gcc_rich_location
richloc (token
->location
);
23614 richloc
.add_fixit_remove ();
23615 error_at_rich_loc (&richloc
, "stray %<,%> at end of "
23616 "member declaration");
23619 /* If the next token isn't a `;', then we have a parse error. */
23620 else if (cp_lexer_next_token_is_not (parser
->lexer
,
23623 /* The next token might be a ways away from where the
23624 actual semicolon is missing. Find the previous token
23625 and use that for our error position. */
23626 cp_token
*token
= cp_lexer_previous_token (parser
->lexer
);
23627 gcc_rich_location
richloc (token
->location
);
23628 richloc
.add_fixit_insert_after (";");
23629 error_at_rich_loc (&richloc
, "expected %<;%> at end of "
23630 "member declaration");
23632 /* Assume that the user meant to provide a semicolon. If
23633 we were to cp_parser_skip_to_end_of_statement, we might
23634 skip to a semicolon inside a member function definition
23635 and issue nonsensical error messages. */
23636 assume_semicolon
= true;
23641 /* Add DECL to the list of members. */
23643 /* Explicitly include, eg, NSDMIs, for better error
23644 recovery (c++/58650). */
23645 || !DECL_DECLARES_FUNCTION_P (decl
))
23646 finish_member_declaration (decl
);
23648 if (TREE_CODE (decl
) == FUNCTION_DECL
)
23649 cp_parser_save_default_args (parser
, decl
);
23650 else if (TREE_CODE (decl
) == FIELD_DECL
23651 && !DECL_C_BIT_FIELD (decl
)
23652 && DECL_INITIAL (decl
))
23653 /* Add DECL to the queue of NSDMI to be parsed later. */
23654 vec_safe_push (unparsed_nsdmis
, decl
);
23657 if (assume_semicolon
)
23662 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
23664 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
23667 /* Parse a pure-specifier.
23672 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23673 Otherwise, ERROR_MARK_NODE is returned. */
23676 cp_parser_pure_specifier (cp_parser
* parser
)
23680 /* Look for the `=' token. */
23681 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
23682 return error_mark_node
;
23683 /* Look for the `0' token. */
23684 token
= cp_lexer_peek_token (parser
->lexer
);
23686 if (token
->type
== CPP_EOF
23687 || token
->type
== CPP_PRAGMA_EOL
)
23688 return error_mark_node
;
23690 cp_lexer_consume_token (parser
->lexer
);
23692 /* Accept = default or = delete in c++0x mode. */
23693 if (token
->keyword
== RID_DEFAULT
23694 || token
->keyword
== RID_DELETE
)
23696 maybe_warn_cpp0x (CPP0X_DEFAULTED_DELETED
);
23697 return token
->u
.value
;
23700 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23701 if (token
->type
!= CPP_NUMBER
|| !(token
->flags
& PURE_ZERO
))
23703 cp_parser_error (parser
,
23704 "invalid pure specifier (only %<= 0%> is allowed)");
23705 cp_parser_skip_to_end_of_statement (parser
);
23706 return error_mark_node
;
23708 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
23710 error_at (token
->location
, "templates may not be %<virtual%>");
23711 return error_mark_node
;
23714 return integer_zero_node
;
23717 /* Parse a constant-initializer.
23719 constant-initializer:
23720 = constant-expression
23722 Returns a representation of the constant-expression. */
23725 cp_parser_constant_initializer (cp_parser
* parser
)
23727 /* Look for the `=' token. */
23728 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
23729 return error_mark_node
;
23731 /* It is invalid to write:
23733 struct S { static const int i = { 7 }; };
23736 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
23738 cp_parser_error (parser
,
23739 "a brace-enclosed initializer is not allowed here");
23740 /* Consume the opening brace. */
23741 cp_lexer_consume_token (parser
->lexer
);
23742 /* Skip the initializer. */
23743 cp_parser_skip_to_closing_brace (parser
);
23744 /* Look for the trailing `}'. */
23745 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
23747 return error_mark_node
;
23750 return cp_parser_constant_expression (parser
);
23753 /* Derived classes [gram.class.derived] */
23755 /* Parse a base-clause.
23758 : base-specifier-list
23760 base-specifier-list:
23761 base-specifier ... [opt]
23762 base-specifier-list , base-specifier ... [opt]
23764 Returns a TREE_LIST representing the base-classes, in the order in
23765 which they were declared. The representation of each node is as
23766 described by cp_parser_base_specifier.
23768 In the case that no bases are specified, this function will return
23769 NULL_TREE, not ERROR_MARK_NODE. */
23772 cp_parser_base_clause (cp_parser
* parser
)
23774 tree bases
= NULL_TREE
;
23776 /* Look for the `:' that begins the list. */
23777 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
23779 /* Scan the base-specifier-list. */
23784 bool pack_expansion_p
= false;
23786 /* Look for the base-specifier. */
23787 base
= cp_parser_base_specifier (parser
);
23788 /* Look for the (optional) ellipsis. */
23789 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
23791 /* Consume the `...'. */
23792 cp_lexer_consume_token (parser
->lexer
);
23794 pack_expansion_p
= true;
23797 /* Add BASE to the front of the list. */
23798 if (base
&& base
!= error_mark_node
)
23800 if (pack_expansion_p
)
23801 /* Make this a pack expansion type. */
23802 TREE_VALUE (base
) = make_pack_expansion (TREE_VALUE (base
));
23804 if (!check_for_bare_parameter_packs (TREE_VALUE (base
)))
23806 TREE_CHAIN (base
) = bases
;
23810 /* Peek at the next token. */
23811 token
= cp_lexer_peek_token (parser
->lexer
);
23812 /* If it's not a comma, then the list is complete. */
23813 if (token
->type
!= CPP_COMMA
)
23815 /* Consume the `,'. */
23816 cp_lexer_consume_token (parser
->lexer
);
23819 /* PARSER->SCOPE may still be non-NULL at this point, if the last
23820 base class had a qualified name. However, the next name that
23821 appears is certainly not qualified. */
23822 parser
->scope
= NULL_TREE
;
23823 parser
->qualifying_scope
= NULL_TREE
;
23824 parser
->object_scope
= NULL_TREE
;
23826 return nreverse (bases
);
23829 /* Parse a base-specifier.
23832 :: [opt] nested-name-specifier [opt] class-name
23833 virtual access-specifier [opt] :: [opt] nested-name-specifier
23835 access-specifier virtual [opt] :: [opt] nested-name-specifier
23838 Returns a TREE_LIST. The TREE_PURPOSE will be one of
23839 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
23840 indicate the specifiers provided. The TREE_VALUE will be a TYPE
23841 (or the ERROR_MARK_NODE) indicating the type that was specified. */
23844 cp_parser_base_specifier (cp_parser
* parser
)
23848 bool virtual_p
= false;
23849 bool duplicate_virtual_error_issued_p
= false;
23850 bool duplicate_access_error_issued_p
= false;
23851 bool class_scope_p
, template_p
;
23852 tree access
= access_default_node
;
23855 /* Process the optional `virtual' and `access-specifier'. */
23858 /* Peek at the next token. */
23859 token
= cp_lexer_peek_token (parser
->lexer
);
23860 /* Process `virtual'. */
23861 switch (token
->keyword
)
23864 /* If `virtual' appears more than once, issue an error. */
23865 if (virtual_p
&& !duplicate_virtual_error_issued_p
)
23867 cp_parser_error (parser
,
23868 "%<virtual%> specified more than once in base-specifier");
23869 duplicate_virtual_error_issued_p
= true;
23874 /* Consume the `virtual' token. */
23875 cp_lexer_consume_token (parser
->lexer
);
23880 case RID_PROTECTED
:
23882 /* If more than one access specifier appears, issue an
23884 if (access
!= access_default_node
23885 && !duplicate_access_error_issued_p
)
23887 cp_parser_error (parser
,
23888 "more than one access specifier in base-specifier");
23889 duplicate_access_error_issued_p
= true;
23892 access
= ridpointers
[(int) token
->keyword
];
23894 /* Consume the access-specifier. */
23895 cp_lexer_consume_token (parser
->lexer
);
23904 /* It is not uncommon to see programs mechanically, erroneously, use
23905 the 'typename' keyword to denote (dependent) qualified types
23906 as base classes. */
23907 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
23909 token
= cp_lexer_peek_token (parser
->lexer
);
23910 if (!processing_template_decl
)
23911 error_at (token
->location
,
23912 "keyword %<typename%> not allowed outside of templates");
23914 error_at (token
->location
,
23915 "keyword %<typename%> not allowed in this context "
23916 "(the base class is implicitly a type)");
23917 cp_lexer_consume_token (parser
->lexer
);
23920 /* Look for the optional `::' operator. */
23921 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
23922 /* Look for the nested-name-specifier. The simplest way to
23927 The keyword `typename' is not permitted in a base-specifier or
23928 mem-initializer; in these contexts a qualified name that
23929 depends on a template-parameter is implicitly assumed to be a
23932 is to pretend that we have seen the `typename' keyword at this
23934 cp_parser_nested_name_specifier_opt (parser
,
23935 /*typename_keyword_p=*/true,
23936 /*check_dependency_p=*/true,
23938 /*is_declaration=*/true);
23939 /* If the base class is given by a qualified name, assume that names
23940 we see are type names or templates, as appropriate. */
23941 class_scope_p
= (parser
->scope
&& TYPE_P (parser
->scope
));
23942 template_p
= class_scope_p
&& cp_parser_optional_template_keyword (parser
);
23945 && cp_lexer_next_token_is_decltype (parser
->lexer
))
23946 /* DR 950 allows decltype as a base-specifier. */
23947 type
= cp_parser_decltype (parser
);
23950 /* Otherwise, look for the class-name. */
23951 type
= cp_parser_class_name (parser
,
23955 /*check_dependency_p=*/true,
23956 /*class_head_p=*/false,
23957 /*is_declaration=*/true);
23958 type
= TREE_TYPE (type
);
23961 if (type
== error_mark_node
)
23962 return error_mark_node
;
23964 return finish_base_specifier (type
, access
, virtual_p
);
23967 /* Exception handling [gram.exception] */
23969 /* Parse an (optional) noexcept-specification.
23971 noexcept-specification:
23972 noexcept ( constant-expression ) [opt]
23974 If no noexcept-specification is present, returns NULL_TREE.
23975 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23976 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23977 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23978 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23979 in which case a boolean condition is returned instead. */
23982 cp_parser_noexcept_specification_opt (cp_parser
* parser
,
23983 bool require_constexpr
,
23984 bool* consumed_expr
,
23988 const char *saved_message
;
23990 /* Peek at the next token. */
23991 token
= cp_lexer_peek_token (parser
->lexer
);
23993 /* Is it a noexcept-specification? */
23994 if (cp_parser_is_keyword (token
, RID_NOEXCEPT
))
23997 cp_lexer_consume_token (parser
->lexer
);
23999 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
24001 cp_lexer_consume_token (parser
->lexer
);
24003 if (require_constexpr
)
24005 /* Types may not be defined in an exception-specification. */
24006 saved_message
= parser
->type_definition_forbidden_message
;
24007 parser
->type_definition_forbidden_message
24008 = G_("types may not be defined in an exception-specification");
24010 expr
= cp_parser_constant_expression (parser
);
24012 /* Restore the saved message. */
24013 parser
->type_definition_forbidden_message
= saved_message
;
24017 expr
= cp_parser_expression (parser
);
24018 *consumed_expr
= true;
24021 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
24025 expr
= boolean_true_node
;
24026 if (!require_constexpr
)
24027 *consumed_expr
= false;
24030 /* We cannot build a noexcept-spec right away because this will check
24031 that expr is a constexpr. */
24033 return build_noexcept_spec (expr
, tf_warning_or_error
);
24041 /* Parse an (optional) exception-specification.
24043 exception-specification:
24044 throw ( type-id-list [opt] )
24046 Returns a TREE_LIST representing the exception-specification. The
24047 TREE_VALUE of each node is a type. */
24050 cp_parser_exception_specification_opt (cp_parser
* parser
)
24054 const char *saved_message
;
24056 /* Peek at the next token. */
24057 token
= cp_lexer_peek_token (parser
->lexer
);
24059 /* Is it a noexcept-specification? */
24060 type_id_list
= cp_parser_noexcept_specification_opt (parser
, true, NULL
,
24062 if (type_id_list
!= NULL_TREE
)
24063 return type_id_list
;
24065 /* If it's not `throw', then there's no exception-specification. */
24066 if (!cp_parser_is_keyword (token
, RID_THROW
))
24069 location_t loc
= token
->location
;
24071 /* Consume the `throw'. */
24072 cp_lexer_consume_token (parser
->lexer
);
24074 /* Look for the `('. */
24075 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
24077 /* Peek at the next token. */
24078 token
= cp_lexer_peek_token (parser
->lexer
);
24079 /* If it's not a `)', then there is a type-id-list. */
24080 if (token
->type
!= CPP_CLOSE_PAREN
)
24082 /* Types may not be defined in an exception-specification. */
24083 saved_message
= parser
->type_definition_forbidden_message
;
24084 parser
->type_definition_forbidden_message
24085 = G_("types may not be defined in an exception-specification");
24086 /* Parse the type-id-list. */
24087 type_id_list
= cp_parser_type_id_list (parser
);
24088 /* Restore the saved message. */
24089 parser
->type_definition_forbidden_message
= saved_message
;
24091 if (cxx_dialect
>= cxx1z
)
24093 error_at (loc
, "ISO C++1z does not allow dynamic exception "
24095 type_id_list
= NULL_TREE
;
24097 else if (cxx_dialect
>= cxx11
&& !in_system_header_at (loc
))
24098 warning_at (loc
, OPT_Wdeprecated
,
24099 "dynamic exception specifications are deprecated in "
24102 /* In C++17, throw() is equivalent to noexcept (true). throw()
24103 is deprecated in C++11 and above as well, but is still widely used,
24104 so don't warn about it yet. */
24105 else if (cxx_dialect
>= cxx1z
)
24106 type_id_list
= noexcept_true_spec
;
24108 type_id_list
= empty_except_spec
;
24110 /* Look for the `)'. */
24111 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
24113 return type_id_list
;
24116 /* Parse an (optional) type-id-list.
24120 type-id-list , type-id ... [opt]
24122 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24123 in the order that the types were presented. */
24126 cp_parser_type_id_list (cp_parser
* parser
)
24128 tree types
= NULL_TREE
;
24135 token
= cp_lexer_peek_token (parser
->lexer
);
24137 /* Get the next type-id. */
24138 type
= cp_parser_type_id (parser
);
24139 /* Check for invalid 'auto'. */
24140 if (flag_concepts
&& type_uses_auto (type
))
24142 error_at (token
->location
,
24143 "invalid use of %<auto%> in exception-specification");
24144 type
= error_mark_node
;
24146 /* Parse the optional ellipsis. */
24147 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
24149 /* Consume the `...'. */
24150 cp_lexer_consume_token (parser
->lexer
);
24152 /* Turn the type into a pack expansion expression. */
24153 type
= make_pack_expansion (type
);
24155 /* Add it to the list. */
24156 types
= add_exception_specifier (types
, type
, /*complain=*/1);
24157 /* Peek at the next token. */
24158 token
= cp_lexer_peek_token (parser
->lexer
);
24159 /* If it is not a `,', we are done. */
24160 if (token
->type
!= CPP_COMMA
)
24162 /* Consume the `,'. */
24163 cp_lexer_consume_token (parser
->lexer
);
24166 return nreverse (types
);
24169 /* Parse a try-block.
24172 try compound-statement handler-seq */
24175 cp_parser_try_block (cp_parser
* parser
)
24179 cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
);
24180 if (parser
->in_function_body
24181 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
24182 error ("%<try%> in %<constexpr%> function");
24184 try_block
= begin_try_block ();
24185 cp_parser_compound_statement (parser
, NULL
, BCS_TRY_BLOCK
, false);
24186 finish_try_block (try_block
);
24187 cp_parser_handler_seq (parser
);
24188 finish_handler_sequence (try_block
);
24193 /* Parse a function-try-block.
24195 function-try-block:
24196 try ctor-initializer [opt] function-body handler-seq */
24199 cp_parser_function_try_block (cp_parser
* parser
)
24201 tree compound_stmt
;
24203 bool ctor_initializer_p
;
24205 /* Look for the `try' keyword. */
24206 if (!cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
))
24208 /* Let the rest of the front end know where we are. */
24209 try_block
= begin_function_try_block (&compound_stmt
);
24210 /* Parse the function-body. */
24211 ctor_initializer_p
= cp_parser_ctor_initializer_opt_and_function_body
24212 (parser
, /*in_function_try_block=*/true);
24213 /* We're done with the `try' part. */
24214 finish_function_try_block (try_block
);
24215 /* Parse the handlers. */
24216 cp_parser_handler_seq (parser
);
24217 /* We're done with the handlers. */
24218 finish_function_handler_sequence (try_block
, compound_stmt
);
24220 return ctor_initializer_p
;
24223 /* Parse a handler-seq.
24226 handler handler-seq [opt] */
24229 cp_parser_handler_seq (cp_parser
* parser
)
24235 /* Parse the handler. */
24236 cp_parser_handler (parser
);
24237 /* Peek at the next token. */
24238 token
= cp_lexer_peek_token (parser
->lexer
);
24239 /* If it's not `catch' then there are no more handlers. */
24240 if (!cp_parser_is_keyword (token
, RID_CATCH
))
24245 /* Parse a handler.
24248 catch ( exception-declaration ) compound-statement */
24251 cp_parser_handler (cp_parser
* parser
)
24256 cp_parser_require_keyword (parser
, RID_CATCH
, RT_CATCH
);
24257 handler
= begin_handler ();
24258 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
24259 declaration
= cp_parser_exception_declaration (parser
);
24260 finish_handler_parms (declaration
, handler
);
24261 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
24262 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
24263 finish_handler (handler
);
24266 /* Parse an exception-declaration.
24268 exception-declaration:
24269 type-specifier-seq declarator
24270 type-specifier-seq abstract-declarator
24274 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24275 ellipsis variant is used. */
24278 cp_parser_exception_declaration (cp_parser
* parser
)
24280 cp_decl_specifier_seq type_specifiers
;
24281 cp_declarator
*declarator
;
24282 const char *saved_message
;
24284 /* If it's an ellipsis, it's easy to handle. */
24285 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
24287 /* Consume the `...' token. */
24288 cp_lexer_consume_token (parser
->lexer
);
24292 /* Types may not be defined in exception-declarations. */
24293 saved_message
= parser
->type_definition_forbidden_message
;
24294 parser
->type_definition_forbidden_message
24295 = G_("types may not be defined in exception-declarations");
24297 /* Parse the type-specifier-seq. */
24298 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
24299 /*is_trailing_return=*/false,
24301 /* If it's a `)', then there is no declarator. */
24302 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
24305 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_EITHER
,
24306 /*ctor_dtor_or_conv_p=*/NULL
,
24307 /*parenthesized_p=*/NULL
,
24308 /*member_p=*/false,
24309 /*friend_p=*/false);
24311 /* Restore the saved message. */
24312 parser
->type_definition_forbidden_message
= saved_message
;
24314 if (!type_specifiers
.any_specifiers_p
)
24315 return error_mark_node
;
24317 return grokdeclarator (declarator
, &type_specifiers
, CATCHPARM
, 1, NULL
);
24320 /* Parse a throw-expression.
24323 throw assignment-expression [opt]
24325 Returns a THROW_EXPR representing the throw-expression. */
24328 cp_parser_throw_expression (cp_parser
* parser
)
24333 cp_parser_require_keyword (parser
, RID_THROW
, RT_THROW
);
24334 token
= cp_lexer_peek_token (parser
->lexer
);
24335 /* Figure out whether or not there is an assignment-expression
24336 following the "throw" keyword. */
24337 if (token
->type
== CPP_COMMA
24338 || token
->type
== CPP_SEMICOLON
24339 || token
->type
== CPP_CLOSE_PAREN
24340 || token
->type
== CPP_CLOSE_SQUARE
24341 || token
->type
== CPP_CLOSE_BRACE
24342 || token
->type
== CPP_COLON
)
24343 expression
= NULL_TREE
;
24345 expression
= cp_parser_assignment_expression (parser
);
24347 return build_throw (expression
);
24350 /* GNU Extensions */
24352 /* Parse an (optional) asm-specification.
24355 asm ( string-literal )
24357 If the asm-specification is present, returns a STRING_CST
24358 corresponding to the string-literal. Otherwise, returns
24362 cp_parser_asm_specification_opt (cp_parser
* parser
)
24365 tree asm_specification
;
24367 /* Peek at the next token. */
24368 token
= cp_lexer_peek_token (parser
->lexer
);
24369 /* If the next token isn't the `asm' keyword, then there's no
24370 asm-specification. */
24371 if (!cp_parser_is_keyword (token
, RID_ASM
))
24374 /* Consume the `asm' token. */
24375 cp_lexer_consume_token (parser
->lexer
);
24376 /* Look for the `('. */
24377 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
24379 /* Look for the string-literal. */
24380 asm_specification
= cp_parser_string_literal (parser
, false, false);
24382 /* Look for the `)'. */
24383 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
24385 return asm_specification
;
24388 /* Parse an asm-operand-list.
24392 asm-operand-list , asm-operand
24395 string-literal ( expression )
24396 [ string-literal ] string-literal ( expression )
24398 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24399 each node is the expression. The TREE_PURPOSE is itself a
24400 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24401 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24402 is a STRING_CST for the string literal before the parenthesis. Returns
24403 ERROR_MARK_NODE if any of the operands are invalid. */
24406 cp_parser_asm_operand_list (cp_parser
* parser
)
24408 tree asm_operands
= NULL_TREE
;
24409 bool invalid_operands
= false;
24413 tree string_literal
;
24417 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
24419 /* Consume the `[' token. */
24420 cp_lexer_consume_token (parser
->lexer
);
24421 /* Read the operand name. */
24422 name
= cp_parser_identifier (parser
);
24423 if (name
!= error_mark_node
)
24424 name
= build_string (IDENTIFIER_LENGTH (name
),
24425 IDENTIFIER_POINTER (name
));
24426 /* Look for the closing `]'. */
24427 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
24431 /* Look for the string-literal. */
24432 string_literal
= cp_parser_string_literal (parser
, false, false);
24434 /* Look for the `('. */
24435 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
24436 /* Parse the expression. */
24437 expression
= cp_parser_expression (parser
);
24438 /* Look for the `)'. */
24439 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
24441 if (name
== error_mark_node
24442 || string_literal
== error_mark_node
24443 || expression
== error_mark_node
)
24444 invalid_operands
= true;
24446 /* Add this operand to the list. */
24447 asm_operands
= tree_cons (build_tree_list (name
, string_literal
),
24450 /* If the next token is not a `,', there are no more
24452 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
24454 /* Consume the `,'. */
24455 cp_lexer_consume_token (parser
->lexer
);
24458 return invalid_operands
? error_mark_node
: nreverse (asm_operands
);
24461 /* Parse an asm-clobber-list.
24465 asm-clobber-list , string-literal
24467 Returns a TREE_LIST, indicating the clobbers in the order that they
24468 appeared. The TREE_VALUE of each node is a STRING_CST. */
24471 cp_parser_asm_clobber_list (cp_parser
* parser
)
24473 tree clobbers
= NULL_TREE
;
24477 tree string_literal
;
24479 /* Look for the string literal. */
24480 string_literal
= cp_parser_string_literal (parser
, false, false);
24481 /* Add it to the list. */
24482 clobbers
= tree_cons (NULL_TREE
, string_literal
, clobbers
);
24483 /* If the next token is not a `,', then the list is
24485 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
24487 /* Consume the `,' token. */
24488 cp_lexer_consume_token (parser
->lexer
);
24494 /* Parse an asm-label-list.
24498 asm-label-list , identifier
24500 Returns a TREE_LIST, indicating the labels in the order that they
24501 appeared. The TREE_VALUE of each node is a label. */
24504 cp_parser_asm_label_list (cp_parser
* parser
)
24506 tree labels
= NULL_TREE
;
24510 tree identifier
, label
, name
;
24512 /* Look for the identifier. */
24513 identifier
= cp_parser_identifier (parser
);
24514 if (!error_operand_p (identifier
))
24516 label
= lookup_label (identifier
);
24517 if (TREE_CODE (label
) == LABEL_DECL
)
24519 TREE_USED (label
) = 1;
24520 check_goto (label
);
24521 name
= build_string (IDENTIFIER_LENGTH (identifier
),
24522 IDENTIFIER_POINTER (identifier
));
24523 labels
= tree_cons (name
, label
, labels
);
24526 /* If the next token is not a `,', then the list is
24528 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
24530 /* Consume the `,' token. */
24531 cp_lexer_consume_token (parser
->lexer
);
24534 return nreverse (labels
);
24537 /* Return TRUE iff the next tokens in the stream are possibly the
24538 beginning of a GNU extension attribute. */
24541 cp_next_tokens_can_be_gnu_attribute_p (cp_parser
*parser
)
24543 return cp_nth_tokens_can_be_gnu_attribute_p (parser
, 1);
24546 /* Return TRUE iff the next tokens in the stream are possibly the
24547 beginning of a standard C++-11 attribute specifier. */
24550 cp_next_tokens_can_be_std_attribute_p (cp_parser
*parser
)
24552 return cp_nth_tokens_can_be_std_attribute_p (parser
, 1);
24555 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24556 beginning of a standard C++-11 attribute specifier. */
24559 cp_nth_tokens_can_be_std_attribute_p (cp_parser
*parser
, size_t n
)
24561 cp_token
*token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
24563 return (cxx_dialect
>= cxx11
24564 && ((token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ALIGNAS
)
24565 || (token
->type
== CPP_OPEN_SQUARE
24566 && (token
= cp_lexer_peek_nth_token (parser
->lexer
, n
+ 1))
24567 && token
->type
== CPP_OPEN_SQUARE
)));
24570 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24571 beginning of a GNU extension attribute. */
24574 cp_nth_tokens_can_be_gnu_attribute_p (cp_parser
*parser
, size_t n
)
24576 cp_token
*token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
24578 return token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ATTRIBUTE
;
24581 /* Return true iff the next tokens can be the beginning of either a
24582 GNU attribute list, or a standard C++11 attribute sequence. */
24585 cp_next_tokens_can_be_attribute_p (cp_parser
*parser
)
24587 return (cp_next_tokens_can_be_gnu_attribute_p (parser
)
24588 || cp_next_tokens_can_be_std_attribute_p (parser
));
24591 /* Return true iff the next Nth tokens can be the beginning of either
24592 a GNU attribute list, or a standard C++11 attribute sequence. */
24595 cp_nth_tokens_can_be_attribute_p (cp_parser
*parser
, size_t n
)
24597 return (cp_nth_tokens_can_be_gnu_attribute_p (parser
, n
)
24598 || cp_nth_tokens_can_be_std_attribute_p (parser
, n
));
24601 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24602 of GNU attributes, or return NULL. */
24605 cp_parser_attributes_opt (cp_parser
*parser
)
24607 if (cp_next_tokens_can_be_gnu_attribute_p (parser
))
24608 return cp_parser_gnu_attributes_opt (parser
);
24609 return cp_parser_std_attribute_spec_seq (parser
);
24612 #define CILK_SIMD_FN_CLAUSE_MASK \
24613 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24614 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24615 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24616 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24617 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24619 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24620 vector [(<clauses>)] */
24623 cp_parser_cilk_simd_fn_vector_attrs (cp_parser
*parser
, cp_token
*v_token
)
24625 bool first_p
= parser
->cilk_simd_fn_info
== NULL
;
24626 cp_token
*token
= v_token
;
24629 parser
->cilk_simd_fn_info
= XNEW (cp_omp_declare_simd_data
);
24630 parser
->cilk_simd_fn_info
->error_seen
= false;
24631 parser
->cilk_simd_fn_info
->fndecl_seen
= false;
24632 parser
->cilk_simd_fn_info
->tokens
= vNULL
;
24633 parser
->cilk_simd_fn_info
->clauses
= NULL_TREE
;
24635 int paren_scope
= 0;
24636 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
24638 cp_lexer_consume_token (parser
->lexer
);
24639 v_token
= cp_lexer_peek_token (parser
->lexer
);
24642 while (paren_scope
> 0)
24644 token
= cp_lexer_peek_token (parser
->lexer
);
24645 if (token
->type
== CPP_OPEN_PAREN
)
24647 else if (token
->type
== CPP_CLOSE_PAREN
)
24649 /* Do not push the last ')' */
24650 if (!(token
->type
== CPP_CLOSE_PAREN
&& paren_scope
== 0))
24651 cp_lexer_consume_token (parser
->lexer
);
24654 token
->type
= CPP_PRAGMA_EOL
;
24655 parser
->lexer
->next_token
= token
;
24656 cp_lexer_consume_token (parser
->lexer
);
24658 struct cp_token_cache
*cp
24659 = cp_token_cache_new (v_token
, cp_lexer_peek_token (parser
->lexer
));
24660 parser
->cilk_simd_fn_info
->tokens
.safe_push (cp
);
24663 /* Parse an (optional) series of attributes.
24666 attributes attribute
24669 __attribute__ (( attribute-list [opt] ))
24671 The return value is as for cp_parser_gnu_attribute_list. */
24674 cp_parser_gnu_attributes_opt (cp_parser
* parser
)
24676 tree attributes
= NULL_TREE
;
24681 tree attribute_list
;
24684 /* Peek at the next token. */
24685 token
= cp_lexer_peek_token (parser
->lexer
);
24686 /* If it's not `__attribute__', then we're done. */
24687 if (token
->keyword
!= RID_ATTRIBUTE
)
24690 /* Consume the `__attribute__' keyword. */
24691 cp_lexer_consume_token (parser
->lexer
);
24692 /* Look for the two `(' tokens. */
24693 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
24694 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
24696 /* Peek at the next token. */
24697 token
= cp_lexer_peek_token (parser
->lexer
);
24698 if (token
->type
!= CPP_CLOSE_PAREN
)
24699 /* Parse the attribute-list. */
24700 attribute_list
= cp_parser_gnu_attribute_list (parser
);
24702 /* If the next token is a `)', then there is no attribute
24704 attribute_list
= NULL
;
24706 /* Look for the two `)' tokens. */
24707 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24709 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24712 cp_parser_skip_to_end_of_statement (parser
);
24714 /* Add these new attributes to the list. */
24715 attributes
= chainon (attributes
, attribute_list
);
24721 /* Parse a GNU attribute-list.
24725 attribute-list , attribute
24729 identifier ( identifier )
24730 identifier ( identifier , expression-list )
24731 identifier ( expression-list )
24733 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
24734 to an attribute. The TREE_PURPOSE of each node is the identifier
24735 indicating which attribute is in use. The TREE_VALUE represents
24736 the arguments, if any. */
24739 cp_parser_gnu_attribute_list (cp_parser
* parser
)
24741 tree attribute_list
= NULL_TREE
;
24742 bool save_translate_strings_p
= parser
->translate_strings_p
;
24744 parser
->translate_strings_p
= false;
24751 /* Look for the identifier. We also allow keywords here; for
24752 example `__attribute__ ((const))' is legal. */
24753 token
= cp_lexer_peek_token (parser
->lexer
);
24754 if (token
->type
== CPP_NAME
24755 || token
->type
== CPP_KEYWORD
)
24757 tree arguments
= NULL_TREE
;
24759 /* Consume the token, but save it since we need it for the
24760 SIMD enabled function parsing. */
24761 cp_token
*id_token
= cp_lexer_consume_token (parser
->lexer
);
24763 /* Save away the identifier that indicates which attribute
24765 identifier
= (token
->type
== CPP_KEYWORD
)
24766 /* For keywords, use the canonical spelling, not the
24767 parsed identifier. */
24768 ? ridpointers
[(int) token
->keyword
]
24769 : id_token
->u
.value
;
24771 attribute
= build_tree_list (identifier
, NULL_TREE
);
24773 /* Peek at the next token. */
24774 token
= cp_lexer_peek_token (parser
->lexer
);
24775 /* If it's an `(', then parse the attribute arguments. */
24776 if (token
->type
== CPP_OPEN_PAREN
)
24778 vec
<tree
, va_gc
> *vec
;
24779 int attr_flag
= (attribute_takes_identifier_p (identifier
)
24780 ? id_attr
: normal_attr
);
24781 if (is_cilkplus_vector_p (identifier
))
24783 cp_parser_cilk_simd_fn_vector_attrs (parser
, id_token
);
24787 vec
= cp_parser_parenthesized_expression_list
24788 (parser
, attr_flag
, /*cast_p=*/false,
24789 /*allow_expansion_p=*/false,
24790 /*non_constant_p=*/NULL
);
24792 arguments
= error_mark_node
;
24795 arguments
= build_tree_list_vec (vec
);
24796 release_tree_vector (vec
);
24798 /* Save the arguments away. */
24799 TREE_VALUE (attribute
) = arguments
;
24801 else if (is_cilkplus_vector_p (identifier
))
24803 cp_parser_cilk_simd_fn_vector_attrs (parser
, id_token
);
24807 if (arguments
!= error_mark_node
)
24809 /* Add this attribute to the list. */
24810 TREE_CHAIN (attribute
) = attribute_list
;
24811 attribute_list
= attribute
;
24814 token
= cp_lexer_peek_token (parser
->lexer
);
24816 /* Now, look for more attributes. If the next token isn't a
24817 `,', we're done. */
24818 if (token
->type
!= CPP_COMMA
)
24821 /* Consume the comma and keep going. */
24822 cp_lexer_consume_token (parser
->lexer
);
24824 parser
->translate_strings_p
= save_translate_strings_p
;
24826 /* We built up the list in reverse order. */
24827 return nreverse (attribute_list
);
24830 /* Parse a standard C++11 attribute.
24832 The returned representation is a TREE_LIST which TREE_PURPOSE is
24833 the scoped name of the attribute, and the TREE_VALUE is its
24836 Note that the scoped name of the attribute is itself a TREE_LIST
24837 which TREE_PURPOSE is the namespace of the attribute, and
24838 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
24839 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
24840 and which TREE_PURPOSE is directly the attribute name.
24842 Clients of the attribute code should use get_attribute_namespace
24843 and get_attribute_name to get the actual namespace and name of
24844 attributes, regardless of their being GNU or C++11 attributes.
24847 attribute-token attribute-argument-clause [opt]
24851 attribute-scoped-token
24853 attribute-scoped-token:
24854 attribute-namespace :: identifier
24856 attribute-namespace:
24859 attribute-argument-clause:
24860 ( balanced-token-seq )
24862 balanced-token-seq:
24863 balanced-token [opt]
24864 balanced-token-seq balanced-token
24867 ( balanced-token-seq )
24868 [ balanced-token-seq ]
24869 { balanced-token-seq }. */
24872 cp_parser_std_attribute (cp_parser
*parser
, tree attr_ns
)
24874 tree attribute
, attr_id
= NULL_TREE
, arguments
;
24877 /* First, parse name of the attribute, a.k.a attribute-token. */
24879 token
= cp_lexer_peek_token (parser
->lexer
);
24880 if (token
->type
== CPP_NAME
)
24881 attr_id
= token
->u
.value
;
24882 else if (token
->type
== CPP_KEYWORD
)
24883 attr_id
= ridpointers
[(int) token
->keyword
];
24884 else if (token
->flags
& NAMED_OP
)
24885 attr_id
= get_identifier (cpp_type2name (token
->type
, token
->flags
));
24887 if (attr_id
== NULL_TREE
)
24890 cp_lexer_consume_token (parser
->lexer
);
24892 token
= cp_lexer_peek_token (parser
->lexer
);
24893 if (token
->type
== CPP_SCOPE
)
24895 /* We are seeing a scoped attribute token. */
24897 cp_lexer_consume_token (parser
->lexer
);
24899 error_at (token
->location
, "attribute using prefix used together "
24900 "with scoped attribute token");
24903 token
= cp_lexer_consume_token (parser
->lexer
);
24904 if (token
->type
== CPP_NAME
)
24905 attr_id
= token
->u
.value
;
24906 else if (token
->type
== CPP_KEYWORD
)
24907 attr_id
= ridpointers
[(int) token
->keyword
];
24908 else if (token
->flags
& NAMED_OP
)
24909 attr_id
= get_identifier (cpp_type2name (token
->type
, token
->flags
));
24912 error_at (token
->location
,
24913 "expected an identifier for the attribute name");
24914 return error_mark_node
;
24916 attribute
= build_tree_list (build_tree_list (attr_ns
, attr_id
),
24918 token
= cp_lexer_peek_token (parser
->lexer
);
24921 attribute
= build_tree_list (build_tree_list (attr_ns
, attr_id
),
24925 attribute
= build_tree_list (build_tree_list (NULL_TREE
, attr_id
),
24927 /* C++11 noreturn attribute is equivalent to GNU's. */
24928 if (is_attribute_p ("noreturn", attr_id
))
24929 TREE_PURPOSE (TREE_PURPOSE (attribute
)) = get_identifier ("gnu");
24930 /* C++14 deprecated attribute is equivalent to GNU's. */
24931 else if (is_attribute_p ("deprecated", attr_id
))
24932 TREE_PURPOSE (TREE_PURPOSE (attribute
)) = get_identifier ("gnu");
24933 /* C++17 fallthrough attribute is equivalent to GNU's. */
24934 else if (is_attribute_p ("fallthrough", attr_id
))
24935 TREE_PURPOSE (TREE_PURPOSE (attribute
)) = get_identifier ("gnu");
24936 /* Transactional Memory TS optimize_for_synchronized attribute is
24937 equivalent to GNU transaction_callable. */
24938 else if (is_attribute_p ("optimize_for_synchronized", attr_id
))
24939 TREE_PURPOSE (attribute
)
24940 = get_identifier ("transaction_callable");
24941 /* Transactional Memory attributes are GNU attributes. */
24942 else if (tm_attr_to_mask (attr_id
))
24943 TREE_PURPOSE (attribute
) = attr_id
;
24946 /* Now parse the optional argument clause of the attribute. */
24948 if (token
->type
!= CPP_OPEN_PAREN
)
24952 vec
<tree
, va_gc
> *vec
;
24953 int attr_flag
= normal_attr
;
24955 if (attr_ns
== get_identifier ("gnu")
24956 && attribute_takes_identifier_p (attr_id
))
24957 /* A GNU attribute that takes an identifier in parameter. */
24958 attr_flag
= id_attr
;
24960 vec
= cp_parser_parenthesized_expression_list
24961 (parser
, attr_flag
, /*cast_p=*/false,
24962 /*allow_expansion_p=*/true,
24963 /*non_constant_p=*/NULL
);
24965 arguments
= error_mark_node
;
24968 arguments
= build_tree_list_vec (vec
);
24969 release_tree_vector (vec
);
24972 if (arguments
== error_mark_node
)
24973 attribute
= error_mark_node
;
24975 TREE_VALUE (attribute
) = arguments
;
24981 /* Check that the attribute ATTRIBUTE appears at most once in the
24982 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24983 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24984 isn't implemented yet in GCC. */
24987 cp_parser_check_std_attribute (tree attributes
, tree attribute
)
24991 tree name
= get_attribute_name (attribute
);
24992 if (is_attribute_p ("noreturn", name
)
24993 && lookup_attribute ("noreturn", attributes
))
24994 error ("attribute %<noreturn%> can appear at most once "
24995 "in an attribute-list");
24996 else if (is_attribute_p ("deprecated", name
)
24997 && lookup_attribute ("deprecated", attributes
))
24998 error ("attribute %<deprecated%> can appear at most once "
24999 "in an attribute-list");
25003 /* Parse a list of standard C++-11 attributes.
25007 attribute-list , attribute[opt]
25009 attribute-list , attribute ...
25013 cp_parser_std_attribute_list (cp_parser
*parser
, tree attr_ns
)
25015 tree attributes
= NULL_TREE
, attribute
= NULL_TREE
;
25016 cp_token
*token
= NULL
;
25020 attribute
= cp_parser_std_attribute (parser
, attr_ns
);
25021 if (attribute
== error_mark_node
)
25023 if (attribute
!= NULL_TREE
)
25025 cp_parser_check_std_attribute (attributes
, attribute
);
25026 TREE_CHAIN (attribute
) = attributes
;
25027 attributes
= attribute
;
25029 token
= cp_lexer_peek_token (parser
->lexer
);
25030 if (token
->type
== CPP_ELLIPSIS
)
25032 cp_lexer_consume_token (parser
->lexer
);
25033 if (attribute
== NULL_TREE
)
25034 error_at (token
->location
,
25035 "expected attribute before %<...%>");
25038 tree pack
= make_pack_expansion (TREE_VALUE (attribute
));
25039 if (pack
== error_mark_node
)
25040 return error_mark_node
;
25041 TREE_VALUE (attribute
) = pack
;
25043 token
= cp_lexer_peek_token (parser
->lexer
);
25045 if (token
->type
!= CPP_COMMA
)
25047 cp_lexer_consume_token (parser
->lexer
);
25049 attributes
= nreverse (attributes
);
25053 /* Parse a standard C++-11 attribute specifier.
25055 attribute-specifier:
25056 [ [ attribute-using-prefix [opt] attribute-list ] ]
25057 alignment-specifier
25059 attribute-using-prefix:
25060 using attribute-namespace :
25062 alignment-specifier:
25063 alignas ( type-id ... [opt] )
25064 alignas ( alignment-expression ... [opt] ). */
25067 cp_parser_std_attribute_spec (cp_parser
*parser
)
25069 tree attributes
= NULL_TREE
;
25070 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
25072 if (token
->type
== CPP_OPEN_SQUARE
25073 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_OPEN_SQUARE
)
25075 tree attr_ns
= NULL_TREE
;
25077 cp_lexer_consume_token (parser
->lexer
);
25078 cp_lexer_consume_token (parser
->lexer
);
25080 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
25082 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
25083 if (token
->type
== CPP_NAME
)
25084 attr_ns
= token
->u
.value
;
25085 else if (token
->type
== CPP_KEYWORD
)
25086 attr_ns
= ridpointers
[(int) token
->keyword
];
25087 else if (token
->flags
& NAMED_OP
)
25088 attr_ns
= get_identifier (cpp_type2name (token
->type
,
25091 && cp_lexer_nth_token_is (parser
->lexer
, 3, CPP_COLON
))
25093 if (cxx_dialect
< cxx1z
25094 && !in_system_header_at (input_location
))
25095 pedwarn (input_location
, 0,
25096 "attribute using prefix only available "
25097 "with -std=c++1z or -std=gnu++1z");
25099 cp_lexer_consume_token (parser
->lexer
);
25100 cp_lexer_consume_token (parser
->lexer
);
25101 cp_lexer_consume_token (parser
->lexer
);
25104 attr_ns
= NULL_TREE
;
25107 attributes
= cp_parser_std_attribute_list (parser
, attr_ns
);
25109 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
)
25110 || !cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
25111 cp_parser_skip_to_end_of_statement (parser
);
25113 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25114 when we are sure that we have actually parsed them. */
25115 maybe_warn_cpp0x (CPP0X_ATTRIBUTES
);
25121 /* Look for an alignment-specifier. */
25123 token
= cp_lexer_peek_token (parser
->lexer
);
25125 if (token
->type
!= CPP_KEYWORD
25126 || token
->keyword
!= RID_ALIGNAS
)
25129 cp_lexer_consume_token (parser
->lexer
);
25130 maybe_warn_cpp0x (CPP0X_ATTRIBUTES
);
25132 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
) == NULL
)
25134 cp_parser_error (parser
, "expected %<(%>");
25135 return error_mark_node
;
25138 cp_parser_parse_tentatively (parser
);
25139 alignas_expr
= cp_parser_type_id (parser
);
25141 if (!cp_parser_parse_definitely (parser
))
25143 alignas_expr
= cp_parser_assignment_expression (parser
);
25144 if (alignas_expr
== error_mark_node
)
25145 cp_parser_skip_to_end_of_statement (parser
);
25146 if (alignas_expr
== NULL_TREE
25147 || alignas_expr
== error_mark_node
)
25148 return alignas_expr
;
25151 alignas_expr
= cxx_alignas_expr (alignas_expr
);
25152 alignas_expr
= build_tree_list (NULL_TREE
, alignas_expr
);
25154 /* Handle alignas (pack...). */
25155 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
25157 cp_lexer_consume_token (parser
->lexer
);
25158 alignas_expr
= make_pack_expansion (alignas_expr
);
25161 /* Something went wrong, so don't build the attribute. */
25162 if (alignas_expr
== error_mark_node
)
25163 return error_mark_node
;
25165 if (cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
) == NULL
)
25167 cp_parser_error (parser
, "expected %<)%>");
25168 return error_mark_node
;
25171 /* Build the C++-11 representation of an 'aligned'
25174 build_tree_list (build_tree_list (get_identifier ("gnu"),
25175 get_identifier ("aligned")),
25182 /* Parse a standard C++-11 attribute-specifier-seq.
25184 attribute-specifier-seq:
25185 attribute-specifier-seq [opt] attribute-specifier
25189 cp_parser_std_attribute_spec_seq (cp_parser
*parser
)
25191 tree attr_specs
= NULL_TREE
;
25192 tree attr_last
= NULL_TREE
;
25196 tree attr_spec
= cp_parser_std_attribute_spec (parser
);
25197 if (attr_spec
== NULL_TREE
)
25199 if (attr_spec
== error_mark_node
)
25200 return error_mark_node
;
25203 TREE_CHAIN (attr_last
) = attr_spec
;
25205 attr_specs
= attr_last
= attr_spec
;
25206 attr_last
= tree_last (attr_last
);
25212 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25213 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25214 current value of the PEDANTIC flag, regardless of whether or not
25215 the `__extension__' keyword is present. The caller is responsible
25216 for restoring the value of the PEDANTIC flag. */
25219 cp_parser_extension_opt (cp_parser
* parser
, int* saved_pedantic
)
25221 /* Save the old value of the PEDANTIC flag. */
25222 *saved_pedantic
= pedantic
;
25224 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXTENSION
))
25226 /* Consume the `__extension__' token. */
25227 cp_lexer_consume_token (parser
->lexer
);
25228 /* We're not being pedantic while the `__extension__' keyword is
25238 /* Parse a label declaration.
25241 __label__ label-declarator-seq ;
25243 label-declarator-seq:
25244 identifier , label-declarator-seq
25248 cp_parser_label_declaration (cp_parser
* parser
)
25250 /* Look for the `__label__' keyword. */
25251 cp_parser_require_keyword (parser
, RID_LABEL
, RT_LABEL
);
25257 /* Look for an identifier. */
25258 identifier
= cp_parser_identifier (parser
);
25259 /* If we failed, stop. */
25260 if (identifier
== error_mark_node
)
25262 /* Declare it as a label. */
25263 finish_label_decl (identifier
);
25264 /* If the next token is a `;', stop. */
25265 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
25267 /* Look for the `,' separating the label declarations. */
25268 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
25271 /* Look for the final `;'. */
25272 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
25275 // -------------------------------------------------------------------------- //
25278 // Parse a requires clause.
25280 // requires-clause:
25281 // 'requires' logical-or-expression
25283 // The required logical-or-expression must be a constant expression. Note
25284 // that we don't check that the expression is constepxr here. We defer until
25285 // we analyze constraints and then, we only check atomic constraints.
25287 cp_parser_requires_clause (cp_parser
*parser
)
25289 // Parse the requires clause so that it is not automatically folded.
25290 ++processing_template_decl
;
25291 tree expr
= cp_parser_binary_expression (parser
, false, false,
25292 PREC_NOT_OPERATOR
, NULL
);
25293 if (check_for_bare_parameter_packs (expr
))
25294 expr
= error_mark_node
;
25295 --processing_template_decl
;
25299 // Optionally parse a requires clause:
25301 cp_parser_requires_clause_opt (cp_parser
*parser
)
25303 cp_token
*tok
= cp_lexer_peek_token (parser
->lexer
);
25304 if (tok
->keyword
!= RID_REQUIRES
)
25306 if (!flag_concepts
&& tok
->type
== CPP_NAME
25307 && tok
->u
.value
== ridpointers
[RID_REQUIRES
])
25309 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
25310 "%<requires%> only available with -fconcepts");
25311 /* Parse and discard the requires-clause. */
25312 cp_lexer_consume_token (parser
->lexer
);
25313 cp_parser_requires_clause (parser
);
25317 cp_lexer_consume_token (parser
->lexer
);
25318 return cp_parser_requires_clause (parser
);
25322 /*---------------------------------------------------------------------------
25323 Requires expressions
25324 ---------------------------------------------------------------------------*/
25326 /* Parse a requires expression
25328 requirement-expression:
25329 'requires' requirement-parameter-list [opt] requirement-body */
25331 cp_parser_requires_expression (cp_parser
*parser
)
25333 gcc_assert (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_REQUIRES
));
25334 location_t loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
25336 /* A requires-expression shall appear only within a concept
25337 definition or a requires-clause.
25339 TODO: Implement this diagnostic correctly. */
25340 if (!processing_template_decl
)
25342 error_at (loc
, "a requires expression cannot appear outside a template");
25343 cp_parser_skip_to_end_of_statement (parser
);
25344 return error_mark_node
;
25349 /* Local parameters are delared as variables within the scope
25350 of the expression. They are not visible past the end of
25351 the expression. Expressions within the requires-expression
25352 are unevaluated. */
25353 struct scope_sentinel
25357 ++cp_unevaluated_operand
;
25358 begin_scope (sk_block
, NULL_TREE
);
25363 pop_bindings_and_leave_scope ();
25364 --cp_unevaluated_operand
;
25368 /* Parse the optional parameter list. */
25369 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
25371 parms
= cp_parser_requirement_parameter_list (parser
);
25372 if (parms
== error_mark_node
)
25373 return error_mark_node
;
25378 /* Parse the requirement body. */
25379 reqs
= cp_parser_requirement_body (parser
);
25380 if (reqs
== error_mark_node
)
25381 return error_mark_node
;
25384 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25386 grokparms (parms
, &parms
);
25387 return finish_requires_expr (parms
, reqs
);
25390 /* Parse a parameterized requirement.
25392 requirement-parameter-list:
25393 '(' parameter-declaration-clause ')' */
25395 cp_parser_requirement_parameter_list (cp_parser
*parser
)
25397 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
25398 return error_mark_node
;
25400 tree parms
= cp_parser_parameter_declaration_clause (parser
);
25402 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
25403 return error_mark_node
;
25408 /* Parse the body of a requirement.
25411 '{' requirement-list '}' */
25413 cp_parser_requirement_body (cp_parser
*parser
)
25415 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
25416 return error_mark_node
;
25418 tree reqs
= cp_parser_requirement_list (parser
);
25420 if (!cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
))
25421 return error_mark_node
;
25426 /* Parse a list of requirements.
25430 requirement-list ';' requirement[opt] */
25432 cp_parser_requirement_list (cp_parser
*parser
)
25434 tree result
= NULL_TREE
;
25437 tree req
= cp_parser_requirement (parser
);
25438 if (req
== error_mark_node
)
25439 return error_mark_node
;
25441 result
= tree_cons (NULL_TREE
, req
, result
);
25443 /* If we see a semi-colon, consume it. */
25444 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
25445 cp_lexer_consume_token (parser
->lexer
);
25447 /* Stop processing at the end of the list. */
25448 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
25452 /* Reverse the order of requirements so they are analyzed in
25453 declaration order. */
25454 return nreverse (result
);
25457 /* Parse a syntactic requirement or type requirement.
25461 compound-requirement
25463 nested-requirement */
25465 cp_parser_requirement (cp_parser
*parser
)
25467 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
25468 return cp_parser_compound_requirement (parser
);
25469 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
25470 return cp_parser_type_requirement (parser
);
25471 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_REQUIRES
))
25472 return cp_parser_nested_requirement (parser
);
25474 return cp_parser_simple_requirement (parser
);
25477 /* Parse a simple requirement.
25479 simple-requirement:
25482 cp_parser_simple_requirement (cp_parser
*parser
)
25484 tree expr
= cp_parser_expression (parser
, NULL
, false, false);
25485 if (!expr
|| expr
== error_mark_node
)
25486 return error_mark_node
;
25488 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
25489 return error_mark_node
;
25491 return finish_simple_requirement (expr
);
25494 /* Parse a type requirement
25497 nested-name-specifier [opt] required-type-name ';'
25499 required-type-name:
25501 'template' [opt] simple-template-id */
25503 cp_parser_type_requirement (cp_parser
*parser
)
25505 cp_lexer_consume_token (parser
->lexer
);
25507 // Save the scope before parsing name specifiers.
25508 tree saved_scope
= parser
->scope
;
25509 tree saved_object_scope
= parser
->object_scope
;
25510 tree saved_qualifying_scope
= parser
->qualifying_scope
;
25511 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
25512 cp_parser_nested_name_specifier_opt (parser
,
25513 /*typename_keyword_p=*/true,
25514 /*check_dependency_p=*/false,
25516 /*is_declaration=*/false);
25519 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
25521 cp_lexer_consume_token (parser
->lexer
);
25522 type
= cp_parser_template_id (parser
,
25523 /*template_keyword_p=*/true,
25524 /*check_dependency=*/false,
25525 /*tag_type=*/none_type
,
25526 /*is_declaration=*/false);
25527 type
= make_typename_type (parser
->scope
, type
, typename_type
,
25528 /*complain=*/tf_error
);
25531 type
= cp_parser_type_name (parser
, /*typename_keyword_p=*/true);
25533 if (TREE_CODE (type
) == TYPE_DECL
)
25534 type
= TREE_TYPE (type
);
25536 parser
->scope
= saved_scope
;
25537 parser
->object_scope
= saved_object_scope
;
25538 parser
->qualifying_scope
= saved_qualifying_scope
;
25540 if (type
== error_mark_node
)
25541 cp_parser_skip_to_end_of_statement (parser
);
25543 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
25544 return error_mark_node
;
25545 if (type
== error_mark_node
)
25546 return error_mark_node
;
25548 return finish_type_requirement (type
);
25551 /* Parse a compound requirement
25553 compound-requirement:
25554 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25556 cp_parser_compound_requirement (cp_parser
*parser
)
25558 /* Parse an expression enclosed in '{ }'s. */
25559 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
25560 return error_mark_node
;
25562 tree expr
= cp_parser_expression (parser
, NULL
, false, false);
25563 if (!expr
|| expr
== error_mark_node
)
25564 return error_mark_node
;
25566 if (!cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
))
25567 return error_mark_node
;
25569 /* Parse the optional noexcept. */
25570 bool noexcept_p
= false;
25571 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_NOEXCEPT
))
25573 cp_lexer_consume_token (parser
->lexer
);
25577 /* Parse the optional trailing return type. */
25578 tree type
= NULL_TREE
;
25579 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
25581 cp_lexer_consume_token (parser
->lexer
);
25582 bool saved_result_type_constraint_p
= parser
->in_result_type_constraint_p
;
25583 parser
->in_result_type_constraint_p
= true;
25584 type
= cp_parser_trailing_type_id (parser
);
25585 parser
->in_result_type_constraint_p
= saved_result_type_constraint_p
;
25586 if (type
== error_mark_node
)
25587 return error_mark_node
;
25590 return finish_compound_requirement (expr
, type
, noexcept_p
);
25593 /* Parse a nested requirement. This is the same as a requires clause.
25595 nested-requirement:
25598 cp_parser_nested_requirement (cp_parser
*parser
)
25600 cp_lexer_consume_token (parser
->lexer
);
25601 tree req
= cp_parser_requires_clause (parser
);
25602 if (req
== error_mark_node
)
25603 return error_mark_node
;
25604 return finish_nested_requirement (req
);
25607 /* Support Functions */
25609 /* Return the appropriate prefer_type argument for lookup_name_real based on
25610 tag_type and template_mem_access. */
25613 prefer_type_arg (tag_types tag_type
, bool template_mem_access
= false)
25615 /* DR 141: When looking in the current enclosing context for a template-name
25616 after -> or ., only consider class templates. */
25617 if (template_mem_access
)
25621 case none_type
: return 0; // No preference.
25622 case scope_type
: return 1; // Type or namespace.
25623 default: return 2; // Type only.
25627 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25628 NAME should have one of the representations used for an
25629 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25630 is returned. If PARSER->SCOPE is a dependent type, then a
25631 SCOPE_REF is returned.
25633 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25634 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25635 was formed. Abstractly, such entities should not be passed to this
25636 function, because they do not need to be looked up, but it is
25637 simpler to check for this special case here, rather than at the
25640 In cases not explicitly covered above, this function returns a
25641 DECL, OVERLOAD, or baselink representing the result of the lookup.
25642 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25645 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25646 (e.g., "struct") that was used. In that case bindings that do not
25647 refer to types are ignored.
25649 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25652 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25655 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25658 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25659 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25660 NULL_TREE otherwise. */
25663 cp_parser_lookup_name (cp_parser
*parser
, tree name
,
25664 enum tag_types tag_type
,
25667 bool check_dependency
,
25668 tree
*ambiguous_decls
,
25669 location_t name_location
)
25672 tree object_type
= parser
->context
->object_type
;
25674 /* Assume that the lookup will be unambiguous. */
25675 if (ambiguous_decls
)
25676 *ambiguous_decls
= NULL_TREE
;
25678 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25679 no longer valid. Note that if we are parsing tentatively, and
25680 the parse fails, OBJECT_TYPE will be automatically restored. */
25681 parser
->context
->object_type
= NULL_TREE
;
25683 if (name
== error_mark_node
)
25684 return error_mark_node
;
25686 /* A template-id has already been resolved; there is no lookup to
25688 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
25690 if (BASELINK_P (name
))
25692 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name
))
25693 == TEMPLATE_ID_EXPR
);
25697 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
25698 it should already have been checked to make sure that the name
25699 used matches the type being destroyed. */
25700 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
25704 /* Figure out to which type this destructor applies. */
25706 type
= parser
->scope
;
25707 else if (object_type
)
25708 type
= object_type
;
25710 type
= current_class_type
;
25711 /* If that's not a class type, there is no destructor. */
25712 if (!type
|| !CLASS_TYPE_P (type
))
25713 return error_mark_node
;
25715 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
25716 lazily_declare_fn (sfk_destructor
, type
);
25718 if (tree dtor
= CLASSTYPE_DESTRUCTOR (type
))
25721 return error_mark_node
;
25724 /* By this point, the NAME should be an ordinary identifier. If
25725 the id-expression was a qualified name, the qualifying scope is
25726 stored in PARSER->SCOPE at this point. */
25727 gcc_assert (identifier_p (name
));
25729 /* Perform the lookup. */
25734 if (parser
->scope
== error_mark_node
)
25735 return error_mark_node
;
25737 /* If the SCOPE is dependent, the lookup must be deferred until
25738 the template is instantiated -- unless we are explicitly
25739 looking up names in uninstantiated templates. Even then, we
25740 cannot look up the name if the scope is not a class type; it
25741 might, for example, be a template type parameter. */
25742 dependent_p
= (TYPE_P (parser
->scope
)
25743 && dependent_scope_p (parser
->scope
));
25744 if ((check_dependency
|| !CLASS_TYPE_P (parser
->scope
))
25746 /* Defer lookup. */
25747 decl
= error_mark_node
;
25750 tree pushed_scope
= NULL_TREE
;
25752 /* If PARSER->SCOPE is a dependent type, then it must be a
25753 class type, and we must not be checking dependencies;
25754 otherwise, we would have processed this lookup above. So
25755 that PARSER->SCOPE is not considered a dependent base by
25756 lookup_member, we must enter the scope here. */
25758 pushed_scope
= push_scope (parser
->scope
);
25760 /* If the PARSER->SCOPE is a template specialization, it
25761 may be instantiated during name lookup. In that case,
25762 errors may be issued. Even if we rollback the current
25763 tentative parse, those errors are valid. */
25764 decl
= lookup_qualified_name (parser
->scope
, name
,
25765 prefer_type_arg (tag_type
),
25766 /*complain=*/true);
25768 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
25769 lookup result and the nested-name-specifier nominates a class C:
25770 * if the name specified after the nested-name-specifier, when
25771 looked up in C, is the injected-class-name of C (Clause 9), or
25772 * if the name specified after the nested-name-specifier is the
25773 same as the identifier or the simple-template-id's template-
25774 name in the last component of the nested-name-specifier,
25775 the name is instead considered to name the constructor of
25776 class C. [ Note: for example, the constructor is not an
25777 acceptable lookup result in an elaborated-type-specifier so
25778 the constructor would not be used in place of the
25779 injected-class-name. --end note ] Such a constructor name
25780 shall be used only in the declarator-id of a declaration that
25781 names a constructor or in a using-declaration. */
25782 if (tag_type
== none_type
25783 && DECL_SELF_REFERENCE_P (decl
)
25784 && same_type_p (DECL_CONTEXT (decl
), parser
->scope
))
25785 decl
= lookup_qualified_name (parser
->scope
, ctor_identifier
,
25786 prefer_type_arg (tag_type
),
25787 /*complain=*/true);
25789 /* If we have a single function from a using decl, pull it out. */
25790 if (TREE_CODE (decl
) == OVERLOAD
25791 && !really_overloaded_fn (decl
))
25792 decl
= OVL_FUNCTION (decl
);
25795 pop_scope (pushed_scope
);
25798 /* If the scope is a dependent type and either we deferred lookup or
25799 we did lookup but didn't find the name, rememeber the name. */
25800 if (decl
== error_mark_node
&& TYPE_P (parser
->scope
)
25801 && dependent_type_p (parser
->scope
))
25807 /* The resolution to Core Issue 180 says that `struct
25808 A::B' should be considered a type-name, even if `A'
25810 type
= make_typename_type (parser
->scope
, name
, tag_type
,
25811 /*complain=*/tf_error
);
25812 if (type
!= error_mark_node
)
25813 decl
= TYPE_NAME (type
);
25815 else if (is_template
25816 && (cp_parser_next_token_ends_template_argument_p (parser
)
25817 || cp_lexer_next_token_is (parser
->lexer
,
25819 decl
= make_unbound_class_template (parser
->scope
,
25821 /*complain=*/tf_error
);
25823 decl
= build_qualified_name (/*type=*/NULL_TREE
,
25824 parser
->scope
, name
,
25827 parser
->qualifying_scope
= parser
->scope
;
25828 parser
->object_scope
= NULL_TREE
;
25830 else if (object_type
)
25832 /* Look up the name in the scope of the OBJECT_TYPE, unless the
25833 OBJECT_TYPE is not a class. */
25834 if (CLASS_TYPE_P (object_type
))
25835 /* If the OBJECT_TYPE is a template specialization, it may
25836 be instantiated during name lookup. In that case, errors
25837 may be issued. Even if we rollback the current tentative
25838 parse, those errors are valid. */
25839 decl
= lookup_member (object_type
,
25842 prefer_type_arg (tag_type
),
25843 tf_warning_or_error
);
25849 /* Look it up in the enclosing context. */
25850 decl
= lookup_name_real (name
, prefer_type_arg (tag_type
),
25852 /*block_p=*/true, is_namespace
, 0);
25853 /* DR 141 says when looking for a template-name after -> or ., only
25854 consider class templates. */
25855 if (decl
&& is_template
&& !DECL_TYPE_TEMPLATE_P (decl
))
25858 if (is_overloaded_fn (d
))
25859 d
= get_first_fn (d
);
25860 if (DECL_P (d
) && !DECL_CLASS_SCOPE_P (d
))
25864 if (object_type
== unknown_type_node
)
25865 /* The object is type-dependent, so we can't look anything up; we used
25866 this to get the DR 141 behavior. */
25867 object_type
= NULL_TREE
;
25868 parser
->object_scope
= object_type
;
25869 parser
->qualifying_scope
= NULL_TREE
;
25873 decl
= lookup_name_real (name
, prefer_type_arg (tag_type
),
25875 /*block_p=*/true, is_namespace
, 0);
25876 parser
->qualifying_scope
= NULL_TREE
;
25877 parser
->object_scope
= NULL_TREE
;
25880 /* If the lookup failed, let our caller know. */
25881 if (!decl
|| decl
== error_mark_node
)
25882 return error_mark_node
;
25884 /* Pull out the template from an injected-class-name (or multiple). */
25886 decl
= maybe_get_template_decl_from_type_decl (decl
);
25888 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
25889 if (TREE_CODE (decl
) == TREE_LIST
)
25891 if (ambiguous_decls
)
25892 *ambiguous_decls
= decl
;
25893 /* The error message we have to print is too complicated for
25894 cp_parser_error, so we incorporate its actions directly. */
25895 if (!cp_parser_simulate_error (parser
))
25897 error_at (name_location
, "reference to %qD is ambiguous",
25899 print_candidates (decl
);
25901 return error_mark_node
;
25904 gcc_assert (DECL_P (decl
)
25905 || TREE_CODE (decl
) == OVERLOAD
25906 || TREE_CODE (decl
) == SCOPE_REF
25907 || TREE_CODE (decl
) == UNBOUND_CLASS_TEMPLATE
25908 || BASELINK_P (decl
));
25910 /* If we have resolved the name of a member declaration, check to
25911 see if the declaration is accessible. When the name resolves to
25912 set of overloaded functions, accessibility is checked when
25913 overload resolution is done.
25915 During an explicit instantiation, access is not checked at all,
25916 as per [temp.explicit]. */
25918 check_accessibility_of_qualified_id (decl
, object_type
, parser
->scope
);
25920 maybe_record_typedef_use (decl
);
25922 return cp_expr (decl
, name_location
);
25925 /* Like cp_parser_lookup_name, but for use in the typical case where
25926 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
25927 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
25930 cp_parser_lookup_name_simple (cp_parser
* parser
, tree name
, location_t location
)
25932 return cp_parser_lookup_name (parser
, name
,
25934 /*is_template=*/false,
25935 /*is_namespace=*/false,
25936 /*check_dependency=*/true,
25937 /*ambiguous_decls=*/NULL
,
25941 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
25942 the current context, return the TYPE_DECL. If TAG_NAME_P is
25943 true, the DECL indicates the class being defined in a class-head,
25944 or declared in an elaborated-type-specifier.
25946 Otherwise, return DECL. */
25949 cp_parser_maybe_treat_template_as_class (tree decl
, bool tag_name_p
)
25951 /* If the TEMPLATE_DECL is being declared as part of a class-head,
25952 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
25955 template <typename T> struct B;
25958 template <typename T> struct A::B {};
25960 Similarly, in an elaborated-type-specifier:
25962 namespace N { struct X{}; }
25965 template <typename T> friend struct N::X;
25968 However, if the DECL refers to a class type, and we are in
25969 the scope of the class, then the name lookup automatically
25970 finds the TYPE_DECL created by build_self_reference rather
25971 than a TEMPLATE_DECL. For example, in:
25973 template <class T> struct S {
25977 there is no need to handle such case. */
25979 if (DECL_CLASS_TEMPLATE_P (decl
) && tag_name_p
)
25980 return DECL_TEMPLATE_RESULT (decl
);
25985 /* If too many, or too few, template-parameter lists apply to the
25986 declarator, issue an error message. Returns TRUE if all went well,
25987 and FALSE otherwise. */
25990 cp_parser_check_declarator_template_parameters (cp_parser
* parser
,
25991 cp_declarator
*declarator
,
25992 location_t declarator_location
)
25994 switch (declarator
->kind
)
25998 unsigned num_templates
= 0;
25999 tree scope
= declarator
->u
.id
.qualifying_scope
;
26002 num_templates
= num_template_headers_for_class (scope
);
26003 else if (TREE_CODE (declarator
->u
.id
.unqualified_name
)
26004 == TEMPLATE_ID_EXPR
)
26005 /* If the DECLARATOR has the form `X<y>' then it uses one
26006 additional level of template parameters. */
26009 return cp_parser_check_template_parameters
26010 (parser
, num_templates
, declarator_location
, declarator
);
26016 case cdk_reference
:
26018 return (cp_parser_check_declarator_template_parameters
26019 (parser
, declarator
->declarator
, declarator_location
));
26026 gcc_unreachable ();
26031 /* NUM_TEMPLATES were used in the current declaration. If that is
26032 invalid, return FALSE and issue an error messages. Otherwise,
26033 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26034 declarator and we can print more accurate diagnostics. */
26037 cp_parser_check_template_parameters (cp_parser
* parser
,
26038 unsigned num_templates
,
26039 location_t location
,
26040 cp_declarator
*declarator
)
26042 /* If there are the same number of template classes and parameter
26043 lists, that's OK. */
26044 if (parser
->num_template_parameter_lists
== num_templates
)
26046 /* If there are more, but only one more, then we are referring to a
26047 member template. That's OK too. */
26048 if (parser
->num_template_parameter_lists
== num_templates
+ 1)
26050 /* If there are more template classes than parameter lists, we have
26053 template <class T> void S<T>::R<T>::f (); */
26054 if (parser
->num_template_parameter_lists
< num_templates
)
26056 if (declarator
&& !current_function_decl
)
26057 error_at (location
, "specializing member %<%T::%E%> "
26058 "requires %<template<>%> syntax",
26059 declarator
->u
.id
.qualifying_scope
,
26060 declarator
->u
.id
.unqualified_name
);
26061 else if (declarator
)
26062 error_at (location
, "invalid declaration of %<%T::%E%>",
26063 declarator
->u
.id
.qualifying_scope
,
26064 declarator
->u
.id
.unqualified_name
);
26066 error_at (location
, "too few template-parameter-lists");
26069 /* Otherwise, there are too many template parameter lists. We have
26072 template <class T> template <class U> void S::f(); */
26073 error_at (location
, "too many template-parameter-lists");
26077 /* Parse an optional `::' token indicating that the following name is
26078 from the global namespace. If so, PARSER->SCOPE is set to the
26079 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26080 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26081 Returns the new value of PARSER->SCOPE, if the `::' token is
26082 present, and NULL_TREE otherwise. */
26085 cp_parser_global_scope_opt (cp_parser
* parser
, bool current_scope_valid_p
)
26089 /* Peek at the next token. */
26090 token
= cp_lexer_peek_token (parser
->lexer
);
26091 /* If we're looking at a `::' token then we're starting from the
26092 global namespace, not our current location. */
26093 if (token
->type
== CPP_SCOPE
)
26095 /* Consume the `::' token. */
26096 cp_lexer_consume_token (parser
->lexer
);
26097 /* Set the SCOPE so that we know where to start the lookup. */
26098 parser
->scope
= global_namespace
;
26099 parser
->qualifying_scope
= global_namespace
;
26100 parser
->object_scope
= NULL_TREE
;
26102 return parser
->scope
;
26104 else if (!current_scope_valid_p
)
26106 parser
->scope
= NULL_TREE
;
26107 parser
->qualifying_scope
= NULL_TREE
;
26108 parser
->object_scope
= NULL_TREE
;
26114 /* Returns TRUE if the upcoming token sequence is the start of a
26115 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26116 declarator is preceded by the `friend' specifier. */
26119 cp_parser_constructor_declarator_p (cp_parser
*parser
, bool friend_p
)
26121 bool constructor_p
;
26122 bool outside_class_specifier_p
;
26123 tree nested_name_specifier
;
26124 cp_token
*next_token
;
26126 /* The common case is that this is not a constructor declarator, so
26127 try to avoid doing lots of work if at all possible. It's not
26128 valid declare a constructor at function scope. */
26129 if (parser
->in_function_body
)
26131 /* And only certain tokens can begin a constructor declarator. */
26132 next_token
= cp_lexer_peek_token (parser
->lexer
);
26133 if (next_token
->type
!= CPP_NAME
26134 && next_token
->type
!= CPP_SCOPE
26135 && next_token
->type
!= CPP_NESTED_NAME_SPECIFIER
26136 && next_token
->type
!= CPP_TEMPLATE_ID
)
26139 /* Parse tentatively; we are going to roll back all of the tokens
26141 cp_parser_parse_tentatively (parser
);
26142 /* Assume that we are looking at a constructor declarator. */
26143 constructor_p
= true;
26145 /* Look for the optional `::' operator. */
26146 cp_parser_global_scope_opt (parser
,
26147 /*current_scope_valid_p=*/false);
26148 /* Look for the nested-name-specifier. */
26149 nested_name_specifier
26150 = (cp_parser_nested_name_specifier_opt (parser
,
26151 /*typename_keyword_p=*/false,
26152 /*check_dependency_p=*/false,
26154 /*is_declaration=*/false));
26156 outside_class_specifier_p
= (!at_class_scope_p ()
26157 || !TYPE_BEING_DEFINED (current_class_type
)
26160 /* Outside of a class-specifier, there must be a
26161 nested-name-specifier. Except in C++17 mode, where we
26162 might be declaring a guiding declaration. */
26163 if (!nested_name_specifier
&& outside_class_specifier_p
26164 && cxx_dialect
< cxx1z
)
26165 constructor_p
= false;
26166 else if (nested_name_specifier
== error_mark_node
)
26167 constructor_p
= false;
26169 /* If we have a class scope, this is easy; DR 147 says that S::S always
26170 names the constructor, and no other qualified name could. */
26171 if (constructor_p
&& nested_name_specifier
26172 && CLASS_TYPE_P (nested_name_specifier
))
26174 tree id
= cp_parser_unqualified_id (parser
,
26175 /*template_keyword_p=*/false,
26176 /*check_dependency_p=*/false,
26177 /*declarator_p=*/true,
26178 /*optional_p=*/false);
26179 if (is_overloaded_fn (id
))
26180 id
= DECL_NAME (get_first_fn (id
));
26181 if (!constructor_name_p (id
, nested_name_specifier
))
26182 constructor_p
= false;
26184 /* If we still think that this might be a constructor-declarator,
26185 look for a class-name. */
26186 else if (constructor_p
)
26190 template <typename T> struct S {
26194 we must recognize that the nested `S' names a class. */
26195 if (cxx_dialect
>= cxx1z
)
26196 cp_parser_parse_tentatively (parser
);
26199 type_decl
= cp_parser_class_name (parser
,
26200 /*typename_keyword_p=*/false,
26201 /*template_keyword_p=*/false,
26203 /*check_dependency_p=*/false,
26204 /*class_head_p=*/false,
26205 /*is_declaration=*/false);
26207 if (cxx_dialect
>= cxx1z
26208 && !cp_parser_parse_definitely (parser
))
26210 type_decl
= NULL_TREE
;
26211 tree tmpl
= cp_parser_template_name (parser
,
26212 /*template_keyword*/false,
26213 /*check_dependency_p*/false,
26214 /*is_declaration*/false,
26216 /*is_identifier*/NULL
);
26217 if (DECL_CLASS_TEMPLATE_P (tmpl
)
26218 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
26219 /* It's a deduction guide, return true. */;
26221 cp_parser_simulate_error (parser
);
26224 /* If there was no class-name, then this is not a constructor.
26225 Otherwise, if we are in a class-specifier and we aren't
26226 handling a friend declaration, check that its type matches
26227 current_class_type (c++/38313). Note: error_mark_node
26228 is left alone for error recovery purposes. */
26229 constructor_p
= (!cp_parser_error_occurred (parser
)
26230 && (outside_class_specifier_p
26231 || type_decl
== NULL_TREE
26232 || type_decl
== error_mark_node
26233 || same_type_p (current_class_type
,
26234 TREE_TYPE (type_decl
))));
26236 /* If we're still considering a constructor, we have to see a `(',
26237 to begin the parameter-declaration-clause, followed by either a
26238 `)', an `...', or a decl-specifier. We need to check for a
26239 type-specifier to avoid being fooled into thinking that:
26243 is a constructor. (It is actually a function named `f' that
26244 takes one parameter (of type `int') and returns a value of type
26247 && !cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
26248 constructor_p
= false;
26251 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
26252 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
)
26253 /* A parameter declaration begins with a decl-specifier,
26254 which is either the "attribute" keyword, a storage class
26255 specifier, or (usually) a type-specifier. */
26256 && !cp_lexer_next_token_is_decl_specifier_keyword (parser
->lexer
))
26259 tree pushed_scope
= NULL_TREE
;
26260 unsigned saved_num_template_parameter_lists
;
26262 /* Names appearing in the type-specifier should be looked up
26263 in the scope of the class. */
26264 if (current_class_type
)
26266 else if (type_decl
)
26268 type
= TREE_TYPE (type_decl
);
26269 if (TREE_CODE (type
) == TYPENAME_TYPE
)
26271 type
= resolve_typename_type (type
,
26272 /*only_current_p=*/false);
26273 if (TREE_CODE (type
) == TYPENAME_TYPE
)
26275 cp_parser_abort_tentative_parse (parser
);
26279 pushed_scope
= push_scope (type
);
26282 /* Inside the constructor parameter list, surrounding
26283 template-parameter-lists do not apply. */
26284 saved_num_template_parameter_lists
26285 = parser
->num_template_parameter_lists
;
26286 parser
->num_template_parameter_lists
= 0;
26288 /* Look for the type-specifier. */
26289 cp_parser_type_specifier (parser
,
26290 CP_PARSER_FLAGS_NONE
,
26291 /*decl_specs=*/NULL
,
26292 /*is_declarator=*/true,
26293 /*declares_class_or_enum=*/NULL
,
26294 /*is_cv_qualifier=*/NULL
);
26296 parser
->num_template_parameter_lists
26297 = saved_num_template_parameter_lists
;
26299 /* Leave the scope of the class. */
26301 pop_scope (pushed_scope
);
26303 constructor_p
= !cp_parser_error_occurred (parser
);
26307 /* We did not really want to consume any tokens. */
26308 cp_parser_abort_tentative_parse (parser
);
26310 return constructor_p
;
26313 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26314 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26315 they must be performed once we are in the scope of the function.
26317 Returns the function defined. */
26320 cp_parser_function_definition_from_specifiers_and_declarator
26321 (cp_parser
* parser
,
26322 cp_decl_specifier_seq
*decl_specifiers
,
26324 const cp_declarator
*declarator
)
26329 /* Begin the function-definition. */
26330 success_p
= start_function (decl_specifiers
, declarator
, attributes
);
26332 /* The things we're about to see are not directly qualified by any
26333 template headers we've seen thus far. */
26334 reset_specialization ();
26336 /* If there were names looked up in the decl-specifier-seq that we
26337 did not check, check them now. We must wait until we are in the
26338 scope of the function to perform the checks, since the function
26339 might be a friend. */
26340 perform_deferred_access_checks (tf_warning_or_error
);
26344 cp_finalize_omp_declare_simd (parser
, current_function_decl
);
26345 parser
->omp_declare_simd
= NULL
;
26346 cp_finalize_oacc_routine (parser
, current_function_decl
, true);
26347 parser
->oacc_routine
= NULL
;
26352 /* Skip the entire function. */
26353 cp_parser_skip_to_end_of_block_or_statement (parser
);
26354 fn
= error_mark_node
;
26356 else if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
26358 /* Seen already, skip it. An error message has already been output. */
26359 cp_parser_skip_to_end_of_block_or_statement (parser
);
26360 fn
= current_function_decl
;
26361 current_function_decl
= NULL_TREE
;
26362 /* If this is a function from a class, pop the nested class. */
26363 if (current_class_name
)
26364 pop_nested_class ();
26369 if (DECL_DECLARED_INLINE_P (current_function_decl
))
26370 tv
= TV_PARSE_INLINE
;
26372 tv
= TV_PARSE_FUNC
;
26374 fn
= cp_parser_function_definition_after_declarator (parser
,
26375 /*inline_p=*/false);
26382 /* Parse the part of a function-definition that follows the
26383 declarator. INLINE_P is TRUE iff this function is an inline
26384 function defined within a class-specifier.
26386 Returns the function defined. */
26389 cp_parser_function_definition_after_declarator (cp_parser
* parser
,
26393 bool ctor_initializer_p
= false;
26394 bool saved_in_unbraced_linkage_specification_p
;
26395 bool saved_in_function_body
;
26396 unsigned saved_num_template_parameter_lists
;
26398 bool fully_implicit_function_template_p
26399 = parser
->fully_implicit_function_template_p
;
26400 parser
->fully_implicit_function_template_p
= false;
26401 tree implicit_template_parms
26402 = parser
->implicit_template_parms
;
26403 parser
->implicit_template_parms
= 0;
26404 cp_binding_level
* implicit_template_scope
26405 = parser
->implicit_template_scope
;
26406 parser
->implicit_template_scope
= 0;
26408 saved_in_function_body
= parser
->in_function_body
;
26409 parser
->in_function_body
= true;
26410 /* If the next token is `return', then the code may be trying to
26411 make use of the "named return value" extension that G++ used to
26413 token
= cp_lexer_peek_token (parser
->lexer
);
26414 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_RETURN
))
26416 /* Consume the `return' keyword. */
26417 cp_lexer_consume_token (parser
->lexer
);
26418 /* Look for the identifier that indicates what value is to be
26420 cp_parser_identifier (parser
);
26421 /* Issue an error message. */
26422 error_at (token
->location
,
26423 "named return values are no longer supported");
26424 /* Skip tokens until we reach the start of the function body. */
26427 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
26428 if (token
->type
== CPP_OPEN_BRACE
26429 || token
->type
== CPP_EOF
26430 || token
->type
== CPP_PRAGMA_EOL
)
26432 cp_lexer_consume_token (parser
->lexer
);
26435 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26436 anything declared inside `f'. */
26437 saved_in_unbraced_linkage_specification_p
26438 = parser
->in_unbraced_linkage_specification_p
;
26439 parser
->in_unbraced_linkage_specification_p
= false;
26440 /* Inside the function, surrounding template-parameter-lists do not
26442 saved_num_template_parameter_lists
26443 = parser
->num_template_parameter_lists
;
26444 parser
->num_template_parameter_lists
= 0;
26446 start_lambda_scope (current_function_decl
);
26448 /* If the next token is `try', `__transaction_atomic', or
26449 `__transaction_relaxed`, then we are looking at either function-try-block
26450 or function-transaction-block. Note that all of these include the
26452 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRANSACTION_ATOMIC
))
26453 ctor_initializer_p
= cp_parser_function_transaction (parser
,
26454 RID_TRANSACTION_ATOMIC
);
26455 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
26456 RID_TRANSACTION_RELAXED
))
26457 ctor_initializer_p
= cp_parser_function_transaction (parser
,
26458 RID_TRANSACTION_RELAXED
);
26459 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
26460 ctor_initializer_p
= cp_parser_function_try_block (parser
);
26462 ctor_initializer_p
= cp_parser_ctor_initializer_opt_and_function_body
26463 (parser
, /*in_function_try_block=*/false);
26465 finish_lambda_scope ();
26467 /* Finish the function. */
26468 fn
= finish_function ((ctor_initializer_p
? 1 : 0) |
26469 (inline_p
? 2 : 0));
26470 /* Generate code for it, if necessary. */
26471 expand_or_defer_fn (fn
);
26472 /* Restore the saved values. */
26473 parser
->in_unbraced_linkage_specification_p
26474 = saved_in_unbraced_linkage_specification_p
;
26475 parser
->num_template_parameter_lists
26476 = saved_num_template_parameter_lists
;
26477 parser
->in_function_body
= saved_in_function_body
;
26479 parser
->fully_implicit_function_template_p
26480 = fully_implicit_function_template_p
;
26481 parser
->implicit_template_parms
26482 = implicit_template_parms
;
26483 parser
->implicit_template_scope
26484 = implicit_template_scope
;
26486 if (parser
->fully_implicit_function_template_p
)
26487 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
26492 /* Parse a template-declaration body (following argument list). */
26495 cp_parser_template_declaration_after_parameters (cp_parser
* parser
,
26496 tree parameter_list
,
26499 tree decl
= NULL_TREE
;
26500 bool friend_p
= false;
26502 /* We just processed one more parameter list. */
26503 ++parser
->num_template_parameter_lists
;
26505 /* Get the deferred access checks from the parameter list. These
26506 will be checked once we know what is being declared, as for a
26507 member template the checks must be performed in the scope of the
26508 class containing the member. */
26509 vec
<deferred_access_check
, va_gc
> *checks
= get_deferred_access_checks ();
26511 /* Tentatively parse for a new template parameter list, which can either be
26512 the template keyword or a template introduction. */
26513 if (cp_parser_template_declaration_after_export (parser
, member_p
))
26515 else if (cxx_dialect
>= cxx11
26516 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
26517 decl
= cp_parser_alias_declaration (parser
);
26520 /* There are no access checks when parsing a template, as we do not
26521 know if a specialization will be a friend. */
26522 push_deferring_access_checks (dk_no_check
);
26523 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
26524 decl
= cp_parser_single_declaration (parser
,
26527 /*explicit_specialization_p=*/false,
26529 pop_deferring_access_checks ();
26531 /* If this is a member template declaration, let the front
26533 if (member_p
&& !friend_p
&& decl
)
26535 if (TREE_CODE (decl
) == TYPE_DECL
)
26536 cp_parser_check_access_in_redeclaration (decl
, token
->location
);
26538 decl
= finish_member_template_decl (decl
);
26540 else if (friend_p
&& decl
26541 && DECL_DECLARES_TYPE_P (decl
))
26542 make_friend_class (current_class_type
, TREE_TYPE (decl
),
26543 /*complain=*/true);
26545 /* We are done with the current parameter list. */
26546 --parser
->num_template_parameter_lists
;
26548 pop_deferring_access_checks ();
26551 finish_template_decl (parameter_list
);
26553 /* Check the template arguments for a literal operator template. */
26555 && DECL_DECLARES_FUNCTION_P (decl
)
26556 && UDLIT_OPER_P (DECL_NAME (decl
)))
26559 if (parameter_list
== NULL_TREE
)
26563 int num_parms
= TREE_VEC_LENGTH (parameter_list
);
26564 if (num_parms
== 1)
26566 tree parm_list
= TREE_VEC_ELT (parameter_list
, 0);
26567 tree parm
= INNERMOST_TEMPLATE_PARMS (parm_list
);
26568 if (TREE_TYPE (parm
) != char_type_node
26569 || !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
26572 else if (num_parms
== 2 && cxx_dialect
>= cxx14
)
26574 tree parm_type
= TREE_VEC_ELT (parameter_list
, 0);
26575 tree type
= INNERMOST_TEMPLATE_PARMS (parm_type
);
26576 tree parm_list
= TREE_VEC_ELT (parameter_list
, 1);
26577 tree parm
= INNERMOST_TEMPLATE_PARMS (parm_list
);
26578 if (parm
== error_mark_node
26579 || TREE_TYPE (parm
) != TREE_TYPE (type
)
26580 || !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
26588 if (cxx_dialect
>= cxx14
)
26589 error ("literal operator template %qD has invalid parameter list."
26590 " Expected non-type template argument pack <char...>"
26591 " or <typename CharT, CharT...>",
26594 error ("literal operator template %qD has invalid parameter list."
26595 " Expected non-type template argument pack <char...>",
26600 /* Register member declarations. */
26601 if (member_p
&& !friend_p
&& decl
&& !DECL_CLASS_TEMPLATE_P (decl
))
26602 finish_member_declaration (decl
);
26603 /* If DECL is a function template, we must return to parse it later.
26604 (Even though there is no definition, there might be default
26605 arguments that need handling.) */
26606 if (member_p
&& decl
26607 && DECL_DECLARES_FUNCTION_P (decl
))
26608 vec_safe_push (unparsed_funs_with_definitions
, decl
);
26611 /* Parse a template introduction header for a template-declaration. Returns
26612 false if tentative parse fails. */
26615 cp_parser_template_introduction (cp_parser
* parser
, bool member_p
)
26617 cp_parser_parse_tentatively (parser
);
26619 tree saved_scope
= parser
->scope
;
26620 tree saved_object_scope
= parser
->object_scope
;
26621 tree saved_qualifying_scope
= parser
->qualifying_scope
;
26623 /* Look for the optional `::' operator. */
26624 cp_parser_global_scope_opt (parser
,
26625 /*current_scope_valid_p=*/false);
26626 /* Look for the nested-name-specifier. */
26627 cp_parser_nested_name_specifier_opt (parser
,
26628 /*typename_keyword_p=*/false,
26629 /*check_dependency_p=*/true,
26631 /*is_declaration=*/false);
26633 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
26634 tree concept_name
= cp_parser_identifier (parser
);
26636 /* Look up the concept for which we will be matching
26637 template parameters. */
26638 tree tmpl_decl
= cp_parser_lookup_name_simple (parser
, concept_name
,
26640 parser
->scope
= saved_scope
;
26641 parser
->object_scope
= saved_object_scope
;
26642 parser
->qualifying_scope
= saved_qualifying_scope
;
26644 if (concept_name
== error_mark_node
)
26645 cp_parser_simulate_error (parser
);
26647 /* Look for opening brace for introduction. */
26648 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
26650 if (!cp_parser_parse_definitely (parser
))
26653 push_deferring_access_checks (dk_deferred
);
26655 /* Build vector of placeholder parameters and grab
26656 matching identifiers. */
26657 tree introduction_list
= cp_parser_introduction_list (parser
);
26659 /* The introduction-list shall not be empty. */
26660 int nargs
= TREE_VEC_LENGTH (introduction_list
);
26663 error ("empty introduction-list");
26667 /* Look for closing brace for introduction. */
26668 if (!cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
))
26671 if (tmpl_decl
== error_mark_node
)
26673 cp_parser_name_lookup_error (parser
, concept_name
, tmpl_decl
, NLE_NULL
,
26678 /* Build and associate the constraint. */
26679 tree parms
= finish_template_introduction (tmpl_decl
, introduction_list
);
26680 if (parms
&& parms
!= error_mark_node
)
26682 cp_parser_template_declaration_after_parameters (parser
, parms
,
26687 error_at (token
->location
, "no matching concept for template-introduction");
26691 /* Parse a normal template-declaration following the template keyword. */
26694 cp_parser_explicit_template_declaration (cp_parser
* parser
, bool member_p
)
26696 tree parameter_list
;
26697 bool need_lang_pop
;
26698 location_t location
= input_location
;
26700 /* Look for the `<' token. */
26701 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
26703 if (at_class_scope_p () && current_function_decl
)
26705 /* 14.5.2.2 [temp.mem]
26707 A local class shall not have member templates. */
26708 error_at (location
,
26709 "invalid declaration of member template in local class");
26710 cp_parser_skip_to_end_of_block_or_statement (parser
);
26715 A template ... shall not have C linkage. */
26716 if (current_lang_name
== lang_name_c
)
26718 error_at (location
, "template with C linkage");
26719 /* Give it C++ linkage to avoid confusing other parts of the
26721 push_lang_context (lang_name_cplusplus
);
26722 need_lang_pop
= true;
26725 need_lang_pop
= false;
26727 /* We cannot perform access checks on the template parameter
26728 declarations until we know what is being declared, just as we
26729 cannot check the decl-specifier list. */
26730 push_deferring_access_checks (dk_deferred
);
26732 /* If the next token is `>', then we have an invalid
26733 specialization. Rather than complain about an invalid template
26734 parameter, issue an error message here. */
26735 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
))
26737 cp_parser_error (parser
, "invalid explicit specialization");
26738 begin_specialization ();
26739 parameter_list
= NULL_TREE
;
26743 /* Parse the template parameters. */
26744 parameter_list
= cp_parser_template_parameter_list (parser
);
26747 /* Look for the `>'. */
26748 cp_parser_skip_to_end_of_template_parameter_list (parser
);
26750 /* Manage template requirements */
26753 tree reqs
= get_shorthand_constraints (current_template_parms
);
26754 if (tree r
= cp_parser_requires_clause_opt (parser
))
26755 reqs
= conjoin_constraints (reqs
, normalize_expression (r
));
26756 TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
) = reqs
;
26759 cp_parser_template_declaration_after_parameters (parser
, parameter_list
,
26762 /* For the erroneous case of a template with C linkage, we pushed an
26763 implicit C++ linkage scope; exit that scope now. */
26765 pop_lang_context ();
26768 /* Parse a template-declaration, assuming that the `export' (and
26769 `extern') keywords, if present, has already been scanned. MEMBER_P
26770 is as for cp_parser_template_declaration. */
26773 cp_parser_template_declaration_after_export (cp_parser
* parser
, bool member_p
)
26775 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
26777 cp_lexer_consume_token (parser
->lexer
);
26778 cp_parser_explicit_template_declaration (parser
, member_p
);
26781 else if (flag_concepts
)
26782 return cp_parser_template_introduction (parser
, member_p
);
26787 /* Perform the deferred access checks from a template-parameter-list.
26788 CHECKS is a TREE_LIST of access checks, as returned by
26789 get_deferred_access_checks. */
26792 cp_parser_perform_template_parameter_access_checks (vec
<deferred_access_check
, va_gc
> *checks
)
26794 ++processing_template_parmlist
;
26795 perform_access_checks (checks
, tf_warning_or_error
);
26796 --processing_template_parmlist
;
26799 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
26800 `function-definition' sequence that follows a template header.
26801 If MEMBER_P is true, this declaration appears in a class scope.
26803 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
26804 *FRIEND_P is set to TRUE iff the declaration is a friend. */
26807 cp_parser_single_declaration (cp_parser
* parser
,
26808 vec
<deferred_access_check
, va_gc
> *checks
,
26810 bool explicit_specialization_p
,
26813 int declares_class_or_enum
;
26814 tree decl
= NULL_TREE
;
26815 cp_decl_specifier_seq decl_specifiers
;
26816 bool function_definition_p
= false;
26817 cp_token
*decl_spec_token_start
;
26819 /* This function is only used when processing a template
26821 gcc_assert (innermost_scope_kind () == sk_template_parms
26822 || innermost_scope_kind () == sk_template_spec
);
26824 /* Defer access checks until we know what is being declared. */
26825 push_deferring_access_checks (dk_deferred
);
26827 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
26829 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
26830 cp_parser_decl_specifier_seq (parser
,
26831 CP_PARSER_FLAGS_OPTIONAL
,
26833 &declares_class_or_enum
);
26835 *friend_p
= cp_parser_friend_p (&decl_specifiers
);
26837 /* There are no template typedefs. */
26838 if (decl_spec_seq_has_spec_p (&decl_specifiers
, ds_typedef
))
26840 error_at (decl_spec_token_start
->location
,
26841 "template declaration of %<typedef%>");
26842 decl
= error_mark_node
;
26845 /* Gather up the access checks that occurred the
26846 decl-specifier-seq. */
26847 stop_deferring_access_checks ();
26849 /* Check for the declaration of a template class. */
26850 if (declares_class_or_enum
)
26852 if (cp_parser_declares_only_class_p (parser
)
26853 || (declares_class_or_enum
& 2))
26855 // If this is a declaration, but not a definition, associate
26856 // any constraints with the type declaration. Constraints
26857 // are associated with definitions in cp_parser_class_specifier.
26858 if (declares_class_or_enum
== 1)
26859 associate_classtype_constraints (decl_specifiers
.type
);
26861 decl
= shadow_tag (&decl_specifiers
);
26866 friend template <typename T> struct A<T>::B;
26869 A<T>::B will be represented by a TYPENAME_TYPE, and
26870 therefore not recognized by shadow_tag. */
26871 if (friend_p
&& *friend_p
26873 && decl_specifiers
.type
26874 && TYPE_P (decl_specifiers
.type
))
26875 decl
= decl_specifiers
.type
;
26877 if (decl
&& decl
!= error_mark_node
)
26878 decl
= TYPE_NAME (decl
);
26880 decl
= error_mark_node
;
26882 /* Perform access checks for template parameters. */
26883 cp_parser_perform_template_parameter_access_checks (checks
);
26885 /* Give a helpful diagnostic for
26886 template <class T> struct A { } a;
26887 if we aren't already recovering from an error. */
26888 if (!cp_parser_declares_only_class_p (parser
)
26891 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
26892 "a class template declaration must not declare "
26894 cp_parser_skip_to_end_of_block_or_statement (parser
);
26900 /* Complain about missing 'typename' or other invalid type names. */
26901 if (!decl_specifiers
.any_type_specifiers_p
26902 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
26904 /* cp_parser_parse_and_diagnose_invalid_type_name calls
26905 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
26906 the rest of this declaration. */
26907 decl
= error_mark_node
;
26911 /* If it's not a template class, try for a template function. If
26912 the next token is a `;', then this declaration does not declare
26913 anything. But, if there were errors in the decl-specifiers, then
26914 the error might well have come from an attempted class-specifier.
26915 In that case, there's no need to warn about a missing declarator. */
26917 && (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
26918 || decl_specifiers
.type
!= error_mark_node
))
26920 decl
= cp_parser_init_declarator (parser
,
26923 /*function_definition_allowed_p=*/true,
26925 declares_class_or_enum
,
26926 &function_definition_p
,
26929 /* 7.1.1-1 [dcl.stc]
26931 A storage-class-specifier shall not be specified in an explicit
26932 specialization... */
26934 && explicit_specialization_p
26935 && decl_specifiers
.storage_class
!= sc_none
)
26937 error_at (decl_spec_token_start
->location
,
26938 "explicit template specialization cannot have a storage class");
26939 decl
= error_mark_node
;
26942 if (decl
&& VAR_P (decl
))
26943 check_template_variable (decl
);
26946 /* Look for a trailing `;' after the declaration. */
26947 if (!function_definition_p
26948 && (decl
== error_mark_node
26949 || !cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
)))
26950 cp_parser_skip_to_end_of_block_or_statement (parser
);
26953 pop_deferring_access_checks ();
26955 /* Clear any current qualification; whatever comes next is the start
26956 of something new. */
26957 parser
->scope
= NULL_TREE
;
26958 parser
->qualifying_scope
= NULL_TREE
;
26959 parser
->object_scope
= NULL_TREE
;
26964 /* Parse a cast-expression that is not the operand of a unary "&". */
26967 cp_parser_simple_cast_expression (cp_parser
*parser
)
26969 return cp_parser_cast_expression (parser
, /*address_p=*/false,
26970 /*cast_p=*/false, /*decltype*/false, NULL
);
26973 /* Parse a functional cast to TYPE. Returns an expression
26974 representing the cast. */
26977 cp_parser_functional_cast (cp_parser
* parser
, tree type
)
26979 vec
<tree
, va_gc
> *vec
;
26980 tree expression_list
;
26984 location_t start_loc
= input_location
;
26987 type
= error_mark_node
;
26989 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
26991 cp_lexer_set_source_position (parser
->lexer
);
26992 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
26993 expression_list
= cp_parser_braced_list (parser
, &nonconst_p
);
26994 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
26995 if (TREE_CODE (type
) == TYPE_DECL
)
26996 type
= TREE_TYPE (type
);
26998 cast
= finish_compound_literal (type
, expression_list
,
26999 tf_warning_or_error
, fcl_functional
);
27000 /* Create a location of the form:
27003 with caret == start at the start of the type name,
27004 finishing at the closing brace. */
27005 location_t finish_loc
27006 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
27007 location_t combined_loc
= make_location (start_loc
, start_loc
,
27009 cast
.set_location (combined_loc
);
27014 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
27016 /*allow_expansion_p=*/true,
27017 /*non_constant_p=*/NULL
);
27019 expression_list
= error_mark_node
;
27022 expression_list
= build_tree_list_vec (vec
);
27023 release_tree_vector (vec
);
27026 cast
= build_functional_cast (type
, expression_list
,
27027 tf_warning_or_error
);
27028 /* [expr.const]/1: In an integral constant expression "only type
27029 conversions to integral or enumeration type can be used". */
27030 if (TREE_CODE (type
) == TYPE_DECL
)
27031 type
= TREE_TYPE (type
);
27032 if (cast
!= error_mark_node
27033 && !cast_valid_in_integral_constant_expression_p (type
)
27034 && cp_parser_non_integral_constant_expression (parser
,
27036 return error_mark_node
;
27038 /* Create a location of the form:
27041 with caret == start at the start of the type name,
27042 finishing at the closing paren. */
27043 location_t finish_loc
27044 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
27045 location_t combined_loc
= make_location (start_loc
, start_loc
, finish_loc
);
27046 cast
.set_location (combined_loc
);
27050 /* Save the tokens that make up the body of a member function defined
27051 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27052 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27053 specifiers applied to the declaration. Returns the FUNCTION_DECL
27054 for the member function. */
27057 cp_parser_save_member_function_body (cp_parser
* parser
,
27058 cp_decl_specifier_seq
*decl_specifiers
,
27059 cp_declarator
*declarator
,
27065 bool function_try_block
= false;
27067 /* Create the FUNCTION_DECL. */
27068 fn
= grokmethod (decl_specifiers
, declarator
, attributes
);
27069 cp_finalize_omp_declare_simd (parser
, fn
);
27070 cp_finalize_oacc_routine (parser
, fn
, true);
27071 /* If something went badly wrong, bail out now. */
27072 if (fn
== error_mark_node
)
27074 /* If there's a function-body, skip it. */
27075 if (cp_parser_token_starts_function_definition_p
27076 (cp_lexer_peek_token (parser
->lexer
)))
27077 cp_parser_skip_to_end_of_block_or_statement (parser
);
27078 return error_mark_node
;
27081 /* Remember it, if there default args to post process. */
27082 cp_parser_save_default_args (parser
, fn
);
27084 /* Save away the tokens that make up the body of the
27086 first
= parser
->lexer
->next_token
;
27088 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRANSACTION_RELAXED
))
27089 cp_lexer_consume_token (parser
->lexer
);
27090 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
27091 RID_TRANSACTION_ATOMIC
))
27093 cp_lexer_consume_token (parser
->lexer
);
27094 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27095 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
)
27096 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_OPEN_SQUARE
)
27097 && (cp_lexer_nth_token_is (parser
->lexer
, 3, CPP_NAME
)
27098 || cp_lexer_nth_token_is (parser
->lexer
, 3, CPP_KEYWORD
))
27099 && cp_lexer_nth_token_is (parser
->lexer
, 4, CPP_CLOSE_SQUARE
)
27100 && cp_lexer_nth_token_is (parser
->lexer
, 5, CPP_CLOSE_SQUARE
))
27102 cp_lexer_consume_token (parser
->lexer
);
27103 cp_lexer_consume_token (parser
->lexer
);
27104 cp_lexer_consume_token (parser
->lexer
);
27105 cp_lexer_consume_token (parser
->lexer
);
27106 cp_lexer_consume_token (parser
->lexer
);
27109 while (cp_next_tokens_can_be_gnu_attribute_p (parser
)
27110 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_OPEN_PAREN
))
27112 cp_lexer_consume_token (parser
->lexer
);
27113 if (cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, /*depth=*/0))
27118 /* Handle function try blocks. */
27119 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
27121 cp_lexer_consume_token (parser
->lexer
);
27122 function_try_block
= true;
27124 /* We can have braced-init-list mem-initializers before the fn body. */
27125 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
27127 cp_lexer_consume_token (parser
->lexer
);
27128 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
27130 /* cache_group will stop after an un-nested { } pair, too. */
27131 if (cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, /*depth=*/0))
27134 /* variadic mem-inits have ... after the ')'. */
27135 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
27136 cp_lexer_consume_token (parser
->lexer
);
27139 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
27140 /* Handle function try blocks. */
27141 if (function_try_block
)
27142 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CATCH
))
27143 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
27144 last
= parser
->lexer
->next_token
;
27146 /* Save away the inline definition; we will process it when the
27147 class is complete. */
27148 DECL_PENDING_INLINE_INFO (fn
) = cp_token_cache_new (first
, last
);
27149 DECL_PENDING_INLINE_P (fn
) = 1;
27151 /* We need to know that this was defined in the class, so that
27152 friend templates are handled correctly. */
27153 DECL_INITIALIZED_IN_CLASS_P (fn
) = 1;
27155 /* Add FN to the queue of functions to be parsed later. */
27156 vec_safe_push (unparsed_funs_with_definitions
, fn
);
27161 /* Save the tokens that make up the in-class initializer for a non-static
27162 data member. Returns a DEFAULT_ARG. */
27165 cp_parser_save_nsdmi (cp_parser
* parser
)
27167 return cp_parser_cache_defarg (parser
, /*nsdmi=*/true);
27170 /* Parse a template-argument-list, as well as the trailing ">" (but
27171 not the opening "<"). See cp_parser_template_argument_list for the
27175 cp_parser_enclosed_template_argument_list (cp_parser
* parser
)
27179 tree saved_qualifying_scope
;
27180 tree saved_object_scope
;
27181 bool saved_greater_than_is_operator_p
;
27182 int saved_unevaluated_operand
;
27183 int saved_inhibit_evaluation_warnings
;
27187 When parsing a template-id, the first non-nested `>' is taken as
27188 the end of the template-argument-list rather than a greater-than
27190 saved_greater_than_is_operator_p
27191 = parser
->greater_than_is_operator_p
;
27192 parser
->greater_than_is_operator_p
= false;
27193 /* Parsing the argument list may modify SCOPE, so we save it
27195 saved_scope
= parser
->scope
;
27196 saved_qualifying_scope
= parser
->qualifying_scope
;
27197 saved_object_scope
= parser
->object_scope
;
27198 /* We need to evaluate the template arguments, even though this
27199 template-id may be nested within a "sizeof". */
27200 saved_unevaluated_operand
= cp_unevaluated_operand
;
27201 cp_unevaluated_operand
= 0;
27202 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
27203 c_inhibit_evaluation_warnings
= 0;
27204 /* Parse the template-argument-list itself. */
27205 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
)
27206 || cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
27207 arguments
= NULL_TREE
;
27209 arguments
= cp_parser_template_argument_list (parser
);
27210 /* Look for the `>' that ends the template-argument-list. If we find
27211 a '>>' instead, it's probably just a typo. */
27212 if (cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
27214 if (cxx_dialect
!= cxx98
)
27216 /* In C++0x, a `>>' in a template argument list or cast
27217 expression is considered to be two separate `>'
27218 tokens. So, change the current token to a `>', but don't
27219 consume it: it will be consumed later when the outer
27220 template argument list (or cast expression) is parsed.
27221 Note that this replacement of `>' for `>>' is necessary
27222 even if we are parsing tentatively: in the tentative
27223 case, after calling
27224 cp_parser_enclosed_template_argument_list we will always
27225 throw away all of the template arguments and the first
27226 closing `>', either because the template argument list
27227 was erroneous or because we are replacing those tokens
27228 with a CPP_TEMPLATE_ID token. The second `>' (which will
27229 not have been thrown away) is needed either to close an
27230 outer template argument list or to complete a new-style
27232 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
27233 token
->type
= CPP_GREATER
;
27235 else if (!saved_greater_than_is_operator_p
)
27237 /* If we're in a nested template argument list, the '>>' has
27238 to be a typo for '> >'. We emit the error message, but we
27239 continue parsing and we push a '>' as next token, so that
27240 the argument list will be parsed correctly. Note that the
27241 global source location is still on the token before the
27242 '>>', so we need to say explicitly where we want it. */
27243 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
27244 gcc_rich_location
richloc (token
->location
);
27245 richloc
.add_fixit_replace ("> >");
27246 error_at_rich_loc (&richloc
, "%<>>%> should be %<> >%> "
27247 "within a nested template argument list");
27249 token
->type
= CPP_GREATER
;
27253 /* If this is not a nested template argument list, the '>>'
27254 is a typo for '>'. Emit an error message and continue.
27255 Same deal about the token location, but here we can get it
27256 right by consuming the '>>' before issuing the diagnostic. */
27257 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
27258 error_at (token
->location
,
27259 "spurious %<>>%>, use %<>%> to terminate "
27260 "a template argument list");
27264 cp_parser_skip_to_end_of_template_parameter_list (parser
);
27265 /* The `>' token might be a greater-than operator again now. */
27266 parser
->greater_than_is_operator_p
27267 = saved_greater_than_is_operator_p
;
27268 /* Restore the SAVED_SCOPE. */
27269 parser
->scope
= saved_scope
;
27270 parser
->qualifying_scope
= saved_qualifying_scope
;
27271 parser
->object_scope
= saved_object_scope
;
27272 cp_unevaluated_operand
= saved_unevaluated_operand
;
27273 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
27278 /* MEMBER_FUNCTION is a member function, or a friend. If default
27279 arguments, or the body of the function have not yet been parsed,
27283 cp_parser_late_parsing_for_member (cp_parser
* parser
, tree member_function
)
27285 timevar_push (TV_PARSE_INMETH
);
27286 /* If this member is a template, get the underlying
27288 if (DECL_FUNCTION_TEMPLATE_P (member_function
))
27289 member_function
= DECL_TEMPLATE_RESULT (member_function
);
27291 /* There should not be any class definitions in progress at this
27292 point; the bodies of members are only parsed outside of all class
27294 gcc_assert (parser
->num_classes_being_defined
== 0);
27295 /* While we're parsing the member functions we might encounter more
27296 classes. We want to handle them right away, but we don't want
27297 them getting mixed up with functions that are currently in the
27299 push_unparsed_function_queues (parser
);
27301 /* Make sure that any template parameters are in scope. */
27302 maybe_begin_member_template_processing (member_function
);
27304 /* If the body of the function has not yet been parsed, parse it
27306 if (DECL_PENDING_INLINE_P (member_function
))
27308 tree function_scope
;
27309 cp_token_cache
*tokens
;
27311 /* The function is no longer pending; we are processing it. */
27312 tokens
= DECL_PENDING_INLINE_INFO (member_function
);
27313 DECL_PENDING_INLINE_INFO (member_function
) = NULL
;
27314 DECL_PENDING_INLINE_P (member_function
) = 0;
27316 /* If this is a local class, enter the scope of the containing
27318 function_scope
= current_function_decl
;
27319 if (function_scope
)
27320 push_function_context ();
27322 /* Push the body of the function onto the lexer stack. */
27323 cp_parser_push_lexer_for_tokens (parser
, tokens
);
27325 /* Let the front end know that we going to be defining this
27327 start_preparsed_function (member_function
, NULL_TREE
,
27328 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
27330 /* Don't do access checking if it is a templated function. */
27331 if (processing_template_decl
)
27332 push_deferring_access_checks (dk_no_check
);
27334 /* #pragma omp declare reduction needs special parsing. */
27335 if (DECL_OMP_DECLARE_REDUCTION_P (member_function
))
27337 parser
->lexer
->in_pragma
= true;
27338 cp_parser_omp_declare_reduction_exprs (member_function
, parser
);
27339 finish_function (/*inline*/2);
27340 cp_check_omp_declare_reduction (member_function
);
27343 /* Now, parse the body of the function. */
27344 cp_parser_function_definition_after_declarator (parser
,
27345 /*inline_p=*/true);
27347 if (processing_template_decl
)
27348 pop_deferring_access_checks ();
27350 /* Leave the scope of the containing function. */
27351 if (function_scope
)
27352 pop_function_context ();
27353 cp_parser_pop_lexer (parser
);
27356 /* Remove any template parameters from the symbol table. */
27357 maybe_end_member_template_processing ();
27359 /* Restore the queue. */
27360 pop_unparsed_function_queues (parser
);
27361 timevar_pop (TV_PARSE_INMETH
);
27364 /* If DECL contains any default args, remember it on the unparsed
27365 functions queue. */
27368 cp_parser_save_default_args (cp_parser
* parser
, tree decl
)
27372 for (probe
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
27374 probe
= TREE_CHAIN (probe
))
27375 if (TREE_PURPOSE (probe
))
27377 cp_default_arg_entry entry
= {current_class_type
, decl
};
27378 vec_safe_push (unparsed_funs_with_default_args
, entry
);
27383 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27384 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27385 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27386 from the parameter-type-list. */
27389 cp_parser_late_parse_one_default_arg (cp_parser
*parser
, tree decl
,
27390 tree default_arg
, tree parmtype
)
27392 cp_token_cache
*tokens
;
27396 if (default_arg
== error_mark_node
)
27397 return error_mark_node
;
27399 /* Push the saved tokens for the default argument onto the parser's
27401 tokens
= DEFARG_TOKENS (default_arg
);
27402 cp_parser_push_lexer_for_tokens (parser
, tokens
);
27404 start_lambda_scope (decl
);
27406 /* Parse the default argument. */
27407 parsed_arg
= cp_parser_initializer (parser
, &dummy
, &dummy
);
27408 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg
))
27409 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
27411 finish_lambda_scope ();
27413 if (parsed_arg
== error_mark_node
)
27414 cp_parser_skip_to_end_of_statement (parser
);
27416 if (!processing_template_decl
)
27418 /* In a non-template class, check conversions now. In a template,
27419 we'll wait and instantiate these as needed. */
27420 if (TREE_CODE (decl
) == PARM_DECL
)
27421 parsed_arg
= check_default_argument (parmtype
, parsed_arg
,
27422 tf_warning_or_error
);
27423 else if (maybe_reject_flexarray_init (decl
, parsed_arg
))
27424 parsed_arg
= error_mark_node
;
27426 parsed_arg
= digest_nsdmi_init (decl
, parsed_arg
);
27429 /* If the token stream has not been completely used up, then
27430 there was extra junk after the end of the default
27432 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
27434 if (TREE_CODE (decl
) == PARM_DECL
)
27435 cp_parser_error (parser
, "expected %<,%>");
27437 cp_parser_error (parser
, "expected %<;%>");
27440 /* Revert to the main lexer. */
27441 cp_parser_pop_lexer (parser
);
27446 /* FIELD is a non-static data member with an initializer which we saved for
27447 later; parse it now. */
27450 cp_parser_late_parsing_nsdmi (cp_parser
*parser
, tree field
)
27454 maybe_begin_member_template_processing (field
);
27456 push_unparsed_function_queues (parser
);
27457 def
= cp_parser_late_parse_one_default_arg (parser
, field
,
27458 DECL_INITIAL (field
),
27460 pop_unparsed_function_queues (parser
);
27462 maybe_end_member_template_processing ();
27464 DECL_INITIAL (field
) = def
;
27467 /* FN is a FUNCTION_DECL which may contains a parameter with an
27468 unparsed DEFAULT_ARG. Parse the default args now. This function
27469 assumes that the current scope is the scope in which the default
27470 argument should be processed. */
27473 cp_parser_late_parsing_default_args (cp_parser
*parser
, tree fn
)
27475 bool saved_local_variables_forbidden_p
;
27476 tree parm
, parmdecl
;
27478 /* While we're parsing the default args, we might (due to the
27479 statement expression extension) encounter more classes. We want
27480 to handle them right away, but we don't want them getting mixed
27481 up with default args that are currently in the queue. */
27482 push_unparsed_function_queues (parser
);
27484 /* Local variable names (and the `this' keyword) may not appear
27485 in a default argument. */
27486 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
27487 parser
->local_variables_forbidden_p
= true;
27489 push_defarg_context (fn
);
27491 for (parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
)),
27492 parmdecl
= DECL_ARGUMENTS (fn
);
27493 parm
&& parm
!= void_list_node
;
27494 parm
= TREE_CHAIN (parm
),
27495 parmdecl
= DECL_CHAIN (parmdecl
))
27497 tree default_arg
= TREE_PURPOSE (parm
);
27499 vec
<tree
, va_gc
> *insts
;
27506 if (TREE_CODE (default_arg
) != DEFAULT_ARG
)
27507 /* This can happen for a friend declaration for a function
27508 already declared with default arguments. */
27512 = cp_parser_late_parse_one_default_arg (parser
, parmdecl
,
27514 TREE_VALUE (parm
));
27515 if (parsed_arg
== error_mark_node
)
27520 TREE_PURPOSE (parm
) = parsed_arg
;
27522 /* Update any instantiations we've already created. */
27523 for (insts
= DEFARG_INSTANTIATIONS (default_arg
), ix
= 0;
27524 vec_safe_iterate (insts
, ix
, ©
); ix
++)
27525 TREE_PURPOSE (copy
) = parsed_arg
;
27528 pop_defarg_context ();
27530 /* Make sure no default arg is missing. */
27531 check_default_args (fn
);
27533 /* Restore the state of local_variables_forbidden_p. */
27534 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
27536 /* Restore the queue. */
27537 pop_unparsed_function_queues (parser
);
27540 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27542 sizeof ... ( identifier )
27544 where the 'sizeof' token has already been consumed. */
27547 cp_parser_sizeof_pack (cp_parser
*parser
)
27549 /* Consume the `...'. */
27550 cp_lexer_consume_token (parser
->lexer
);
27551 maybe_warn_variadic_templates ();
27553 bool paren
= cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
);
27555 cp_lexer_consume_token (parser
->lexer
);
27557 permerror (cp_lexer_peek_token (parser
->lexer
)->location
,
27558 "%<sizeof...%> argument must be surrounded by parentheses");
27560 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
27561 tree name
= cp_parser_identifier (parser
);
27562 if (name
== error_mark_node
)
27563 return error_mark_node
;
27564 /* The name is not qualified. */
27565 parser
->scope
= NULL_TREE
;
27566 parser
->qualifying_scope
= NULL_TREE
;
27567 parser
->object_scope
= NULL_TREE
;
27568 tree expr
= cp_parser_lookup_name_simple (parser
, name
, token
->location
);
27569 if (expr
== error_mark_node
)
27570 cp_parser_name_lookup_error (parser
, name
, expr
, NLE_NULL
,
27572 if (TREE_CODE (expr
) == TYPE_DECL
|| TREE_CODE (expr
) == TEMPLATE_DECL
)
27573 expr
= TREE_TYPE (expr
);
27574 else if (TREE_CODE (expr
) == CONST_DECL
)
27575 expr
= DECL_INITIAL (expr
);
27576 expr
= make_pack_expansion (expr
);
27577 PACK_EXPANSION_SIZEOF_P (expr
) = true;
27580 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
27585 /* Parse the operand of `sizeof' (or a similar operator). Returns
27586 either a TYPE or an expression, depending on the form of the
27587 input. The KEYWORD indicates which kind of expression we have
27591 cp_parser_sizeof_operand (cp_parser
* parser
, enum rid keyword
)
27593 tree expr
= NULL_TREE
;
27594 const char *saved_message
;
27596 bool saved_integral_constant_expression_p
;
27597 bool saved_non_integral_constant_expression_p
;
27599 /* If it's a `...', then we are computing the length of a parameter
27601 if (keyword
== RID_SIZEOF
27602 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
27603 return cp_parser_sizeof_pack (parser
);
27605 /* Types cannot be defined in a `sizeof' expression. Save away the
27607 saved_message
= parser
->type_definition_forbidden_message
;
27608 /* And create the new one. */
27609 tmp
= concat ("types may not be defined in %<",
27610 IDENTIFIER_POINTER (ridpointers
[keyword
]),
27611 "%> expressions", NULL
);
27612 parser
->type_definition_forbidden_message
= tmp
;
27614 /* The restrictions on constant-expressions do not apply inside
27615 sizeof expressions. */
27616 saved_integral_constant_expression_p
27617 = parser
->integral_constant_expression_p
;
27618 saved_non_integral_constant_expression_p
27619 = parser
->non_integral_constant_expression_p
;
27620 parser
->integral_constant_expression_p
= false;
27622 /* Do not actually evaluate the expression. */
27623 ++cp_unevaluated_operand
;
27624 ++c_inhibit_evaluation_warnings
;
27625 /* If it's a `(', then we might be looking at the type-id
27627 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
27629 tree type
= NULL_TREE
;
27631 /* We can't be sure yet whether we're looking at a type-id or an
27633 cp_parser_parse_tentatively (parser
);
27634 /* Note: as a GNU Extension, compound literals are considered
27635 postfix-expressions as they are in C99, so they are valid
27636 arguments to sizeof. See comment in cp_parser_cast_expression
27638 if (cp_parser_compound_literal_p (parser
))
27639 cp_parser_simulate_error (parser
);
27642 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
27643 parser
->in_type_id_in_expr_p
= true;
27644 /* Look for the type-id. */
27645 type
= cp_parser_type_id (parser
);
27646 /* Look for the closing `)'. */
27647 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
27648 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
27651 /* If all went well, then we're done. */
27652 if (cp_parser_parse_definitely (parser
))
27654 cp_decl_specifier_seq decl_specs
;
27656 /* Build a trivial decl-specifier-seq. */
27657 clear_decl_specs (&decl_specs
);
27658 decl_specs
.type
= type
;
27660 /* Call grokdeclarator to figure out what type this is. */
27661 expr
= grokdeclarator (NULL
,
27665 /*attrlist=*/NULL
);
27669 /* If the type-id production did not work out, then we must be
27670 looking at the unary-expression production. */
27672 expr
= cp_parser_unary_expression (parser
);
27674 /* Go back to evaluating expressions. */
27675 --cp_unevaluated_operand
;
27676 --c_inhibit_evaluation_warnings
;
27678 /* Free the message we created. */
27680 /* And restore the old one. */
27681 parser
->type_definition_forbidden_message
= saved_message
;
27682 parser
->integral_constant_expression_p
27683 = saved_integral_constant_expression_p
;
27684 parser
->non_integral_constant_expression_p
27685 = saved_non_integral_constant_expression_p
;
27690 /* If the current declaration has no declarator, return true. */
27693 cp_parser_declares_only_class_p (cp_parser
*parser
)
27695 /* If the next token is a `;' or a `,' then there is no
27697 return (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
27698 || cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
27701 /* Update the DECL_SPECS to reflect the storage class indicated by
27705 cp_parser_set_storage_class (cp_parser
*parser
,
27706 cp_decl_specifier_seq
*decl_specs
,
27710 cp_storage_class storage_class
;
27712 if (parser
->in_unbraced_linkage_specification_p
)
27714 error_at (token
->location
, "invalid use of %qD in linkage specification",
27715 ridpointers
[keyword
]);
27718 else if (decl_specs
->storage_class
!= sc_none
)
27720 decl_specs
->conflicting_specifiers_p
= true;
27724 if ((keyword
== RID_EXTERN
|| keyword
== RID_STATIC
)
27725 && decl_spec_seq_has_spec_p (decl_specs
, ds_thread
)
27726 && decl_specs
->gnu_thread_keyword_p
)
27728 pedwarn (decl_specs
->locations
[ds_thread
], 0,
27729 "%<__thread%> before %qD", ridpointers
[keyword
]);
27735 storage_class
= sc_auto
;
27738 storage_class
= sc_register
;
27741 storage_class
= sc_static
;
27744 storage_class
= sc_extern
;
27747 storage_class
= sc_mutable
;
27750 gcc_unreachable ();
27752 decl_specs
->storage_class
= storage_class
;
27753 set_and_check_decl_spec_loc (decl_specs
, ds_storage_class
, token
);
27755 /* A storage class specifier cannot be applied alongside a typedef
27756 specifier. If there is a typedef specifier present then set
27757 conflicting_specifiers_p which will trigger an error later
27758 on in grokdeclarator. */
27759 if (decl_spec_seq_has_spec_p (decl_specs
, ds_typedef
))
27760 decl_specs
->conflicting_specifiers_p
= true;
27763 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
27764 is true, the type is a class or enum definition. */
27767 cp_parser_set_decl_spec_type (cp_decl_specifier_seq
*decl_specs
,
27770 bool type_definition_p
)
27772 decl_specs
->any_specifiers_p
= true;
27774 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
27775 (with, for example, in "typedef int wchar_t;") we remember that
27776 this is what happened. In system headers, we ignore these
27777 declarations so that G++ can work with system headers that are not
27779 if (decl_spec_seq_has_spec_p (decl_specs
, ds_typedef
)
27780 && !type_definition_p
27781 && (type_spec
== boolean_type_node
27782 || type_spec
== char16_type_node
27783 || type_spec
== char32_type_node
27784 || type_spec
== wchar_type_node
)
27785 && (decl_specs
->type
27786 || decl_spec_seq_has_spec_p (decl_specs
, ds_long
)
27787 || decl_spec_seq_has_spec_p (decl_specs
, ds_short
)
27788 || decl_spec_seq_has_spec_p (decl_specs
, ds_unsigned
)
27789 || decl_spec_seq_has_spec_p (decl_specs
, ds_signed
)))
27791 decl_specs
->redefined_builtin_type
= type_spec
;
27792 set_and_check_decl_spec_loc (decl_specs
,
27793 ds_redefined_builtin_type_spec
,
27795 if (!decl_specs
->type
)
27797 decl_specs
->type
= type_spec
;
27798 decl_specs
->type_definition_p
= false;
27799 set_and_check_decl_spec_loc (decl_specs
,ds_type_spec
, token
);
27802 else if (decl_specs
->type
)
27803 decl_specs
->multiple_types_p
= true;
27806 decl_specs
->type
= type_spec
;
27807 decl_specs
->type_definition_p
= type_definition_p
;
27808 decl_specs
->redefined_builtin_type
= NULL_TREE
;
27809 set_and_check_decl_spec_loc (decl_specs
, ds_type_spec
, token
);
27813 /* True iff TOKEN is the GNU keyword __thread. */
27816 token_is__thread (cp_token
*token
)
27818 gcc_assert (token
->keyword
== RID_THREAD
);
27819 return id_equal (token
->u
.value
, "__thread");
27822 /* Set the location for a declarator specifier and check if it is
27825 DECL_SPECS is the sequence of declarator specifiers onto which to
27828 DS is the single declarator specifier to set which location is to
27829 be set onto the existing sequence of declarators.
27831 LOCATION is the location for the declarator specifier to
27835 set_and_check_decl_spec_loc (cp_decl_specifier_seq
*decl_specs
,
27836 cp_decl_spec ds
, cp_token
*token
)
27838 gcc_assert (ds
< ds_last
);
27840 if (decl_specs
== NULL
)
27843 source_location location
= token
->location
;
27845 if (decl_specs
->locations
[ds
] == 0)
27847 decl_specs
->locations
[ds
] = location
;
27848 if (ds
== ds_thread
)
27849 decl_specs
->gnu_thread_keyword_p
= token_is__thread (token
);
27855 if (decl_specs
->locations
[ds_long_long
] != 0)
27856 error_at (location
,
27857 "%<long long long%> is too long for GCC");
27860 decl_specs
->locations
[ds_long_long
] = location
;
27861 pedwarn_cxx98 (location
,
27863 "ISO C++ 1998 does not support %<long long%>");
27866 else if (ds
== ds_thread
)
27868 bool gnu
= token_is__thread (token
);
27869 if (gnu
!= decl_specs
->gnu_thread_keyword_p
)
27870 error_at (location
,
27871 "both %<__thread%> and %<thread_local%> specified");
27874 gcc_rich_location
richloc (location
);
27875 richloc
.add_fixit_remove ();
27876 error_at_rich_loc (&richloc
, "duplicate %qD", token
->u
.value
);
27881 static const char *const decl_spec_names
[] = {
27898 gcc_rich_location
richloc (location
);
27899 richloc
.add_fixit_remove ();
27900 error_at_rich_loc (&richloc
, "duplicate %qs", decl_spec_names
[ds
]);
27905 /* Return true iff the declarator specifier DS is present in the
27906 sequence of declarator specifiers DECL_SPECS. */
27909 decl_spec_seq_has_spec_p (const cp_decl_specifier_seq
* decl_specs
,
27912 gcc_assert (ds
< ds_last
);
27914 if (decl_specs
== NULL
)
27917 return decl_specs
->locations
[ds
] != 0;
27920 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
27921 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
27924 cp_parser_friend_p (const cp_decl_specifier_seq
*decl_specifiers
)
27926 return decl_spec_seq_has_spec_p (decl_specifiers
, ds_friend
);
27929 /* Issue an error message indicating that TOKEN_DESC was expected.
27930 If KEYWORD is true, it indicated this function is called by
27931 cp_parser_require_keword and the required token can only be
27932 a indicated keyword. */
27935 cp_parser_required_error (cp_parser
*parser
,
27936 required_token token_desc
,
27939 switch (token_desc
)
27942 cp_parser_error (parser
, "expected %<new%>");
27945 cp_parser_error (parser
, "expected %<delete%>");
27948 cp_parser_error (parser
, "expected %<return%>");
27951 cp_parser_error (parser
, "expected %<while%>");
27954 cp_parser_error (parser
, "expected %<extern%>");
27956 case RT_STATIC_ASSERT
:
27957 cp_parser_error (parser
, "expected %<static_assert%>");
27960 cp_parser_error (parser
, "expected %<decltype%>");
27963 cp_parser_error (parser
, "expected %<operator%>");
27966 cp_parser_error (parser
, "expected %<class%>");
27969 cp_parser_error (parser
, "expected %<template%>");
27972 cp_parser_error (parser
, "expected %<namespace%>");
27975 cp_parser_error (parser
, "expected %<using%>");
27978 cp_parser_error (parser
, "expected %<asm%>");
27981 cp_parser_error (parser
, "expected %<try%>");
27984 cp_parser_error (parser
, "expected %<catch%>");
27987 cp_parser_error (parser
, "expected %<throw%>");
27990 cp_parser_error (parser
, "expected %<__label__%>");
27993 cp_parser_error (parser
, "expected %<@try%>");
27995 case RT_AT_SYNCHRONIZED
:
27996 cp_parser_error (parser
, "expected %<@synchronized%>");
27999 cp_parser_error (parser
, "expected %<@throw%>");
28001 case RT_TRANSACTION_ATOMIC
:
28002 cp_parser_error (parser
, "expected %<__transaction_atomic%>");
28004 case RT_TRANSACTION_RELAXED
:
28005 cp_parser_error (parser
, "expected %<__transaction_relaxed%>");
28012 switch (token_desc
)
28015 cp_parser_error (parser
, "expected %<;%>");
28017 case RT_OPEN_PAREN
:
28018 cp_parser_error (parser
, "expected %<(%>");
28020 case RT_CLOSE_BRACE
:
28021 cp_parser_error (parser
, "expected %<}%>");
28023 case RT_OPEN_BRACE
:
28024 cp_parser_error (parser
, "expected %<{%>");
28026 case RT_CLOSE_SQUARE
:
28027 cp_parser_error (parser
, "expected %<]%>");
28029 case RT_OPEN_SQUARE
:
28030 cp_parser_error (parser
, "expected %<[%>");
28033 cp_parser_error (parser
, "expected %<,%>");
28036 cp_parser_error (parser
, "expected %<::%>");
28039 cp_parser_error (parser
, "expected %<<%>");
28042 cp_parser_error (parser
, "expected %<>%>");
28045 cp_parser_error (parser
, "expected %<=%>");
28048 cp_parser_error (parser
, "expected %<...%>");
28051 cp_parser_error (parser
, "expected %<*%>");
28054 cp_parser_error (parser
, "expected %<~%>");
28057 cp_parser_error (parser
, "expected %<:%>");
28059 case RT_COLON_SCOPE
:
28060 cp_parser_error (parser
, "expected %<:%> or %<::%>");
28062 case RT_CLOSE_PAREN
:
28063 cp_parser_error (parser
, "expected %<)%>");
28065 case RT_COMMA_CLOSE_PAREN
:
28066 cp_parser_error (parser
, "expected %<,%> or %<)%>");
28068 case RT_PRAGMA_EOL
:
28069 cp_parser_error (parser
, "expected end of line");
28072 cp_parser_error (parser
, "expected identifier");
28075 cp_parser_error (parser
, "expected selection-statement");
28078 cp_parser_error (parser
, "expected iteration-statement");
28081 cp_parser_error (parser
, "expected jump-statement");
28084 cp_parser_error (parser
, "expected class-key");
28086 case RT_CLASS_TYPENAME_TEMPLATE
:
28087 cp_parser_error (parser
,
28088 "expected %<class%>, %<typename%>, or %<template%>");
28091 gcc_unreachable ();
28095 gcc_unreachable ();
28100 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28101 issue an error message indicating that TOKEN_DESC was expected.
28103 Returns the token consumed, if the token had the appropriate type.
28104 Otherwise, returns NULL. */
28107 cp_parser_require (cp_parser
* parser
,
28108 enum cpp_ttype type
,
28109 required_token token_desc
)
28111 if (cp_lexer_next_token_is (parser
->lexer
, type
))
28112 return cp_lexer_consume_token (parser
->lexer
);
28115 /* Output the MESSAGE -- unless we're parsing tentatively. */
28116 if (!cp_parser_simulate_error (parser
))
28117 cp_parser_required_error (parser
, token_desc
, /*keyword=*/false);
28122 /* An error message is produced if the next token is not '>'.
28123 All further tokens are skipped until the desired token is
28124 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28127 cp_parser_skip_to_end_of_template_parameter_list (cp_parser
* parser
)
28129 /* Current level of '< ... >'. */
28130 unsigned level
= 0;
28131 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28132 unsigned nesting_depth
= 0;
28134 /* Are we ready, yet? If not, issue error message. */
28135 if (cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
))
28138 /* Skip tokens until the desired token is found. */
28141 /* Peek at the next token. */
28142 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
28145 if (!nesting_depth
)
28150 if (cxx_dialect
== cxx98
)
28151 /* C++0x views the `>>' operator as two `>' tokens, but
28154 else if (!nesting_depth
&& level
-- == 0)
28156 /* We've hit a `>>' where the first `>' closes the
28157 template argument list, and the second `>' is
28158 spurious. Just consume the `>>' and stop; we've
28159 already produced at least one error. */
28160 cp_lexer_consume_token (parser
->lexer
);
28163 /* Fall through for C++0x, so we handle the second `>' in
28165 gcc_fallthrough ();
28168 if (!nesting_depth
&& level
-- == 0)
28170 /* We've reached the token we want, consume it and stop. */
28171 cp_lexer_consume_token (parser
->lexer
);
28176 case CPP_OPEN_PAREN
:
28177 case CPP_OPEN_SQUARE
:
28181 case CPP_CLOSE_PAREN
:
28182 case CPP_CLOSE_SQUARE
:
28183 if (nesting_depth
-- == 0)
28188 case CPP_PRAGMA_EOL
:
28189 case CPP_SEMICOLON
:
28190 case CPP_OPEN_BRACE
:
28191 case CPP_CLOSE_BRACE
:
28192 /* The '>' was probably forgotten, don't look further. */
28199 /* Consume this token. */
28200 cp_lexer_consume_token (parser
->lexer
);
28204 /* If the next token is the indicated keyword, consume it. Otherwise,
28205 issue an error message indicating that TOKEN_DESC was expected.
28207 Returns the token consumed, if the token had the appropriate type.
28208 Otherwise, returns NULL. */
28211 cp_parser_require_keyword (cp_parser
* parser
,
28213 required_token token_desc
)
28215 cp_token
*token
= cp_parser_require (parser
, CPP_KEYWORD
, token_desc
);
28217 if (token
&& token
->keyword
!= keyword
)
28219 cp_parser_required_error (parser
, token_desc
, /*keyword=*/true);
28226 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28227 function-definition. */
28230 cp_parser_token_starts_function_definition_p (cp_token
* token
)
28232 return (/* An ordinary function-body begins with an `{'. */
28233 token
->type
== CPP_OPEN_BRACE
28234 /* A ctor-initializer begins with a `:'. */
28235 || token
->type
== CPP_COLON
28236 /* A function-try-block begins with `try'. */
28237 || token
->keyword
== RID_TRY
28238 /* A function-transaction-block begins with `__transaction_atomic'
28239 or `__transaction_relaxed'. */
28240 || token
->keyword
== RID_TRANSACTION_ATOMIC
28241 || token
->keyword
== RID_TRANSACTION_RELAXED
28242 /* The named return value extension begins with `return'. */
28243 || token
->keyword
== RID_RETURN
);
28246 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28250 cp_parser_next_token_starts_class_definition_p (cp_parser
*parser
)
28254 token
= cp_lexer_peek_token (parser
->lexer
);
28255 return (token
->type
== CPP_OPEN_BRACE
28256 || (token
->type
== CPP_COLON
28257 && !parser
->colon_doesnt_start_class_def_p
));
28260 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28261 C++0x) ending a template-argument. */
28264 cp_parser_next_token_ends_template_argument_p (cp_parser
*parser
)
28268 token
= cp_lexer_peek_token (parser
->lexer
);
28269 return (token
->type
== CPP_COMMA
28270 || token
->type
== CPP_GREATER
28271 || token
->type
== CPP_ELLIPSIS
28272 || ((cxx_dialect
!= cxx98
) && token
->type
== CPP_RSHIFT
));
28275 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28276 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28279 cp_parser_nth_token_starts_template_argument_list_p (cp_parser
* parser
,
28284 token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
28285 if (token
->type
== CPP_LESS
)
28287 /* Check for the sequence `<::' in the original code. It would be lexed as
28288 `[:', where `[' is a digraph, and there is no whitespace before
28290 if (token
->type
== CPP_OPEN_SQUARE
&& token
->flags
& DIGRAPH
)
28293 token2
= cp_lexer_peek_nth_token (parser
->lexer
, n
+1);
28294 if (token2
->type
== CPP_COLON
&& !(token2
->flags
& PREV_WHITE
))
28300 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28301 or none_type otherwise. */
28303 static enum tag_types
28304 cp_parser_token_is_class_key (cp_token
* token
)
28306 switch (token
->keyword
)
28311 return record_type
;
28320 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28321 or none_type otherwise or if the token is null. */
28323 static enum tag_types
28324 cp_parser_token_is_type_parameter_key (cp_token
* token
)
28329 switch (token
->keyword
)
28334 return typename_type
;
28341 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28344 cp_parser_check_class_key (enum tag_types class_key
, tree type
)
28346 if (type
== error_mark_node
)
28348 if ((TREE_CODE (type
) == UNION_TYPE
) != (class_key
== union_type
))
28350 if (permerror (input_location
, "%qs tag used in naming %q#T",
28351 class_key
== union_type
? "union"
28352 : class_key
== record_type
? "struct" : "class",
28354 inform (DECL_SOURCE_LOCATION (TYPE_NAME (type
)),
28355 "%q#T was previously declared here", type
);
28359 /* Issue an error message if DECL is redeclared with different
28360 access than its original declaration [class.access.spec/3].
28361 This applies to nested classes, nested class templates and
28362 enumerations [class.mem/1]. */
28365 cp_parser_check_access_in_redeclaration (tree decl
, location_t location
)
28368 || (!CLASS_TYPE_P (TREE_TYPE (decl
))
28369 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
))
28372 if ((TREE_PRIVATE (decl
)
28373 != (current_access_specifier
== access_private_node
))
28374 || (TREE_PROTECTED (decl
)
28375 != (current_access_specifier
== access_protected_node
)))
28376 error_at (location
, "%qD redeclared with different access", decl
);
28379 /* Look for the `template' keyword, as a syntactic disambiguator.
28380 Return TRUE iff it is present, in which case it will be
28384 cp_parser_optional_template_keyword (cp_parser
*parser
)
28386 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
28388 /* In C++98 the `template' keyword can only be used within templates;
28389 outside templates the parser can always figure out what is a
28390 template and what is not. In C++11, per the resolution of DR 468,
28391 `template' is allowed in cases where it is not strictly necessary. */
28392 if (!processing_template_decl
28393 && pedantic
&& cxx_dialect
== cxx98
)
28395 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28396 pedwarn (token
->location
, OPT_Wpedantic
,
28397 "in C++98 %<template%> (as a disambiguator) is only "
28398 "allowed within templates");
28399 /* If this part of the token stream is rescanned, the same
28400 error message would be generated. So, we purge the token
28401 from the stream. */
28402 cp_lexer_purge_token (parser
->lexer
);
28407 /* Consume the `template' keyword. */
28408 cp_lexer_consume_token (parser
->lexer
);
28415 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28416 set PARSER->SCOPE, and perform other related actions. */
28419 cp_parser_pre_parsed_nested_name_specifier (cp_parser
*parser
)
28421 struct tree_check
*check_value
;
28423 /* Get the stored value. */
28424 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
28425 /* Set the scope from the stored value. */
28426 parser
->scope
= saved_checks_value (check_value
);
28427 parser
->qualifying_scope
= check_value
->qualifying_scope
;
28428 parser
->object_scope
= NULL_TREE
;
28431 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28432 encounter the end of a block before what we were looking for. */
28435 cp_parser_cache_group (cp_parser
*parser
,
28436 enum cpp_ttype end
,
28441 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28443 /* Abort a parenthesized expression if we encounter a semicolon. */
28444 if ((end
== CPP_CLOSE_PAREN
|| depth
== 0)
28445 && token
->type
== CPP_SEMICOLON
)
28447 /* If we've reached the end of the file, stop. */
28448 if (token
->type
== CPP_EOF
28449 || (end
!= CPP_PRAGMA_EOL
28450 && token
->type
== CPP_PRAGMA_EOL
))
28452 if (token
->type
== CPP_CLOSE_BRACE
&& depth
== 0)
28453 /* We've hit the end of an enclosing block, so there's been some
28454 kind of syntax error. */
28457 /* Consume the token. */
28458 cp_lexer_consume_token (parser
->lexer
);
28459 /* See if it starts a new group. */
28460 if (token
->type
== CPP_OPEN_BRACE
)
28462 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, depth
+ 1);
28463 /* In theory this should probably check end == '}', but
28464 cp_parser_save_member_function_body needs it to exit
28465 after either '}' or ')' when called with ')'. */
28469 else if (token
->type
== CPP_OPEN_PAREN
)
28471 cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, depth
+ 1);
28472 if (depth
== 0 && end
== CPP_CLOSE_PAREN
)
28475 else if (token
->type
== CPP_PRAGMA
)
28476 cp_parser_cache_group (parser
, CPP_PRAGMA_EOL
, depth
+ 1);
28477 else if (token
->type
== end
)
28482 /* Like above, for caching a default argument or NSDMI. Both of these are
28483 terminated by a non-nested comma, but it can be unclear whether or not a
28484 comma is nested in a template argument list unless we do more parsing.
28485 In order to handle this ambiguity, when we encounter a ',' after a '<'
28486 we try to parse what follows as a parameter-declaration-list (in the
28487 case of a default argument) or a member-declarator (in the case of an
28488 NSDMI). If that succeeds, then we stop caching. */
28491 cp_parser_cache_defarg (cp_parser
*parser
, bool nsdmi
)
28493 unsigned depth
= 0;
28494 int maybe_template_id
= 0;
28495 cp_token
*first_token
;
28497 tree default_argument
;
28499 /* Add tokens until we have processed the entire default
28500 argument. We add the range [first_token, token). */
28501 first_token
= cp_lexer_peek_token (parser
->lexer
);
28502 if (first_token
->type
== CPP_OPEN_BRACE
)
28504 /* For list-initialization, this is straightforward. */
28505 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
28506 token
= cp_lexer_peek_token (parser
->lexer
);
28512 /* Peek at the next token. */
28513 token
= cp_lexer_peek_token (parser
->lexer
);
28514 /* What we do depends on what token we have. */
28515 switch (token
->type
)
28517 /* In valid code, a default argument must be
28518 immediately followed by a `,' `)', or `...'. */
28520 if (depth
== 0 && maybe_template_id
)
28522 /* If we've seen a '<', we might be in a
28523 template-argument-list. Until Core issue 325 is
28524 resolved, we don't know how this situation ought
28525 to be handled, so try to DTRT. We check whether
28526 what comes after the comma is a valid parameter
28527 declaration list. If it is, then the comma ends
28528 the default argument; otherwise the default
28529 argument continues. */
28530 bool error
= false;
28533 /* Set ITALP so cp_parser_parameter_declaration_list
28534 doesn't decide to commit to this parse. */
28535 bool saved_italp
= parser
->in_template_argument_list_p
;
28536 parser
->in_template_argument_list_p
= true;
28538 cp_parser_parse_tentatively (parser
);
28542 /* Parse declarators until we reach a non-comma or
28543 somthing that cannot be an initializer.
28544 Just checking whether we're looking at a single
28545 declarator is insufficient. Consider:
28546 int var = tuple<T,U>::x;
28547 The template parameter 'U' looks exactly like a
28551 int ctor_dtor_or_conv_p
;
28552 cp_lexer_consume_token (parser
->lexer
);
28553 cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
28554 &ctor_dtor_or_conv_p
,
28555 /*parenthesized_p=*/NULL
,
28557 /*friend_p=*/false);
28558 peek
= cp_lexer_peek_token (parser
->lexer
);
28559 if (cp_parser_error_occurred (parser
))
28562 while (peek
->type
== CPP_COMMA
);
28563 /* If we met an '=' or ';' then the original comma
28564 was the end of the NSDMI. Otherwise assume
28565 we're still in the NSDMI. */
28566 error
= (peek
->type
!= CPP_EQ
28567 && peek
->type
!= CPP_SEMICOLON
);
28571 cp_lexer_consume_token (parser
->lexer
);
28572 begin_scope (sk_function_parms
, NULL_TREE
);
28573 cp_parser_parameter_declaration_list (parser
, &error
);
28574 pop_bindings_and_leave_scope ();
28576 if (!cp_parser_error_occurred (parser
) && !error
)
28578 cp_parser_abort_tentative_parse (parser
);
28580 parser
->in_template_argument_list_p
= saved_italp
;
28584 case CPP_CLOSE_PAREN
:
28586 /* If we run into a non-nested `;', `}', or `]',
28587 then the code is invalid -- but the default
28588 argument is certainly over. */
28589 case CPP_SEMICOLON
:
28590 case CPP_CLOSE_BRACE
:
28591 case CPP_CLOSE_SQUARE
:
28593 /* Handle correctly int n = sizeof ... ( p ); */
28594 && token
->type
!= CPP_ELLIPSIS
)
28596 /* Update DEPTH, if necessary. */
28597 else if (token
->type
== CPP_CLOSE_PAREN
28598 || token
->type
== CPP_CLOSE_BRACE
28599 || token
->type
== CPP_CLOSE_SQUARE
)
28603 case CPP_OPEN_PAREN
:
28604 case CPP_OPEN_SQUARE
:
28605 case CPP_OPEN_BRACE
:
28611 /* This might be the comparison operator, or it might
28612 start a template argument list. */
28613 ++maybe_template_id
;
28617 if (cxx_dialect
== cxx98
)
28619 /* Fall through for C++0x, which treats the `>>'
28620 operator like two `>' tokens in certain
28622 gcc_fallthrough ();
28627 /* This might be an operator, or it might close a
28628 template argument list. But if a previous '<'
28629 started a template argument list, this will have
28630 closed it, so we can't be in one anymore. */
28631 maybe_template_id
-= 1 + (token
->type
== CPP_RSHIFT
);
28632 if (maybe_template_id
< 0)
28633 maybe_template_id
= 0;
28637 /* If we run out of tokens, issue an error message. */
28639 case CPP_PRAGMA_EOL
:
28640 error_at (token
->location
, "file ends in default argument");
28641 return error_mark_node
;
28645 /* In these cases, we should look for template-ids.
28646 For example, if the default argument is
28647 `X<int, double>()', we need to do name lookup to
28648 figure out whether or not `X' is a template; if
28649 so, the `,' does not end the default argument.
28651 That is not yet done. */
28658 /* If we've reached the end, stop. */
28662 /* Add the token to the token block. */
28663 token
= cp_lexer_consume_token (parser
->lexer
);
28666 /* Create a DEFAULT_ARG to represent the unparsed default
28668 default_argument
= make_node (DEFAULT_ARG
);
28669 DEFARG_TOKENS (default_argument
)
28670 = cp_token_cache_new (first_token
, token
);
28671 DEFARG_INSTANTIATIONS (default_argument
) = NULL
;
28673 return default_argument
;
28676 /* Begin parsing tentatively. We always save tokens while parsing
28677 tentatively so that if the tentative parsing fails we can restore the
28681 cp_parser_parse_tentatively (cp_parser
* parser
)
28683 /* Enter a new parsing context. */
28684 parser
->context
= cp_parser_context_new (parser
->context
);
28685 /* Begin saving tokens. */
28686 cp_lexer_save_tokens (parser
->lexer
);
28687 /* In order to avoid repetitive access control error messages,
28688 access checks are queued up until we are no longer parsing
28690 push_deferring_access_checks (dk_deferred
);
28693 /* Commit to the currently active tentative parse. */
28696 cp_parser_commit_to_tentative_parse (cp_parser
* parser
)
28698 cp_parser_context
*context
;
28701 /* Mark all of the levels as committed. */
28702 lexer
= parser
->lexer
;
28703 for (context
= parser
->context
; context
->next
; context
= context
->next
)
28705 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
28707 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
28708 while (!cp_lexer_saving_tokens (lexer
))
28709 lexer
= lexer
->next
;
28710 cp_lexer_commit_tokens (lexer
);
28714 /* Commit to the topmost currently active tentative parse.
28716 Note that this function shouldn't be called when there are
28717 irreversible side-effects while in a tentative state. For
28718 example, we shouldn't create a permanent entry in the symbol
28719 table, or issue an error message that might not apply if the
28720 tentative parse is aborted. */
28723 cp_parser_commit_to_topmost_tentative_parse (cp_parser
* parser
)
28725 cp_parser_context
*context
= parser
->context
;
28726 cp_lexer
*lexer
= parser
->lexer
;
28730 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
28732 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
28734 while (!cp_lexer_saving_tokens (lexer
))
28735 lexer
= lexer
->next
;
28736 cp_lexer_commit_tokens (lexer
);
28740 /* Abort the currently active tentative parse. All consumed tokens
28741 will be rolled back, and no diagnostics will be issued. */
28744 cp_parser_abort_tentative_parse (cp_parser
* parser
)
28746 gcc_assert (parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
28747 || errorcount
> 0);
28748 cp_parser_simulate_error (parser
);
28749 /* Now, pretend that we want to see if the construct was
28750 successfully parsed. */
28751 cp_parser_parse_definitely (parser
);
28754 /* Stop parsing tentatively. If a parse error has occurred, restore the
28755 token stream. Otherwise, commit to the tokens we have consumed.
28756 Returns true if no error occurred; false otherwise. */
28759 cp_parser_parse_definitely (cp_parser
* parser
)
28761 bool error_occurred
;
28762 cp_parser_context
*context
;
28764 /* Remember whether or not an error occurred, since we are about to
28765 destroy that information. */
28766 error_occurred
= cp_parser_error_occurred (parser
);
28767 /* Remove the topmost context from the stack. */
28768 context
= parser
->context
;
28769 parser
->context
= context
->next
;
28770 /* If no parse errors occurred, commit to the tentative parse. */
28771 if (!error_occurred
)
28773 /* Commit to the tokens read tentatively, unless that was
28775 if (context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
)
28776 cp_lexer_commit_tokens (parser
->lexer
);
28778 pop_to_parent_deferring_access_checks ();
28780 /* Otherwise, if errors occurred, roll back our state so that things
28781 are just as they were before we began the tentative parse. */
28784 cp_lexer_rollback_tokens (parser
->lexer
);
28785 pop_deferring_access_checks ();
28787 /* Add the context to the front of the free list. */
28788 context
->next
= cp_parser_context_free_list
;
28789 cp_parser_context_free_list
= context
;
28791 return !error_occurred
;
28794 /* Returns true if we are parsing tentatively and are not committed to
28795 this tentative parse. */
28798 cp_parser_uncommitted_to_tentative_parse_p (cp_parser
* parser
)
28800 return (cp_parser_parsing_tentatively (parser
)
28801 && parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
);
28804 /* Returns nonzero iff an error has occurred during the most recent
28805 tentative parse. */
28808 cp_parser_error_occurred (cp_parser
* parser
)
28810 return (cp_parser_parsing_tentatively (parser
)
28811 && parser
->context
->status
== CP_PARSER_STATUS_KIND_ERROR
);
28814 /* Returns nonzero if GNU extensions are allowed. */
28817 cp_parser_allow_gnu_extensions_p (cp_parser
* parser
)
28819 return parser
->allow_gnu_extensions_p
;
28822 /* Objective-C++ Productions */
28825 /* Parse an Objective-C expression, which feeds into a primary-expression
28829 objc-message-expression
28830 objc-string-literal
28831 objc-encode-expression
28832 objc-protocol-expression
28833 objc-selector-expression
28835 Returns a tree representation of the expression. */
28838 cp_parser_objc_expression (cp_parser
* parser
)
28840 /* Try to figure out what kind of declaration is present. */
28841 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
28845 case CPP_OPEN_SQUARE
:
28846 return cp_parser_objc_message_expression (parser
);
28848 case CPP_OBJC_STRING
:
28849 kwd
= cp_lexer_consume_token (parser
->lexer
);
28850 return objc_build_string_object (kwd
->u
.value
);
28853 switch (kwd
->keyword
)
28855 case RID_AT_ENCODE
:
28856 return cp_parser_objc_encode_expression (parser
);
28858 case RID_AT_PROTOCOL
:
28859 return cp_parser_objc_protocol_expression (parser
);
28861 case RID_AT_SELECTOR
:
28862 return cp_parser_objc_selector_expression (parser
);
28868 error_at (kwd
->location
,
28869 "misplaced %<@%D%> Objective-C++ construct",
28871 cp_parser_skip_to_end_of_block_or_statement (parser
);
28874 return error_mark_node
;
28877 /* Parse an Objective-C message expression.
28879 objc-message-expression:
28880 [ objc-message-receiver objc-message-args ]
28882 Returns a representation of an Objective-C message. */
28885 cp_parser_objc_message_expression (cp_parser
* parser
)
28887 tree receiver
, messageargs
;
28889 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
28890 cp_lexer_consume_token (parser
->lexer
); /* Eat '['. */
28891 receiver
= cp_parser_objc_message_receiver (parser
);
28892 messageargs
= cp_parser_objc_message_args (parser
);
28893 location_t end_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
28894 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
28896 tree result
= objc_build_message_expr (receiver
, messageargs
);
28898 /* Construct a location e.g.
28901 ranging from the '[' to the ']', with the caret at the start. */
28902 location_t combined_loc
= make_location (start_loc
, start_loc
, end_loc
);
28903 protected_set_expr_location (result
, combined_loc
);
28908 /* Parse an objc-message-receiver.
28910 objc-message-receiver:
28912 simple-type-specifier
28914 Returns a representation of the type or expression. */
28917 cp_parser_objc_message_receiver (cp_parser
* parser
)
28921 /* An Objective-C message receiver may be either (1) a type
28922 or (2) an expression. */
28923 cp_parser_parse_tentatively (parser
);
28924 rcv
= cp_parser_expression (parser
);
28926 /* If that worked out, fine. */
28927 if (cp_parser_parse_definitely (parser
))
28930 cp_parser_parse_tentatively (parser
);
28931 rcv
= cp_parser_simple_type_specifier (parser
,
28932 /*decl_specs=*/NULL
,
28933 CP_PARSER_FLAGS_NONE
);
28935 if (cp_parser_parse_definitely (parser
))
28936 return objc_get_class_reference (rcv
);
28938 cp_parser_error (parser
, "objective-c++ message receiver expected");
28939 return error_mark_node
;
28942 /* Parse the arguments and selectors comprising an Objective-C message.
28947 objc-selector-args , objc-comma-args
28949 objc-selector-args:
28950 objc-selector [opt] : assignment-expression
28951 objc-selector-args objc-selector [opt] : assignment-expression
28954 assignment-expression
28955 objc-comma-args , assignment-expression
28957 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
28958 selector arguments and TREE_VALUE containing a list of comma
28962 cp_parser_objc_message_args (cp_parser
* parser
)
28964 tree sel_args
= NULL_TREE
, addl_args
= NULL_TREE
;
28965 bool maybe_unary_selector_p
= true;
28966 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28968 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
28970 tree selector
= NULL_TREE
, arg
;
28972 if (token
->type
!= CPP_COLON
)
28973 selector
= cp_parser_objc_selector (parser
);
28975 /* Detect if we have a unary selector. */
28976 if (maybe_unary_selector_p
28977 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
28978 return build_tree_list (selector
, NULL_TREE
);
28980 maybe_unary_selector_p
= false;
28981 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
28982 arg
= cp_parser_assignment_expression (parser
);
28985 = chainon (sel_args
,
28986 build_tree_list (selector
, arg
));
28988 token
= cp_lexer_peek_token (parser
->lexer
);
28991 /* Handle non-selector arguments, if any. */
28992 while (token
->type
== CPP_COMMA
)
28996 cp_lexer_consume_token (parser
->lexer
);
28997 arg
= cp_parser_assignment_expression (parser
);
29000 = chainon (addl_args
,
29001 build_tree_list (NULL_TREE
, arg
));
29003 token
= cp_lexer_peek_token (parser
->lexer
);
29006 if (sel_args
== NULL_TREE
&& addl_args
== NULL_TREE
)
29008 cp_parser_error (parser
, "objective-c++ message argument(s) are expected");
29009 return build_tree_list (error_mark_node
, error_mark_node
);
29012 return build_tree_list (sel_args
, addl_args
);
29015 /* Parse an Objective-C encode expression.
29017 objc-encode-expression:
29018 @encode objc-typename
29020 Returns an encoded representation of the type argument. */
29023 cp_parser_objc_encode_expression (cp_parser
* parser
)
29027 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
29029 cp_lexer_consume_token (parser
->lexer
); /* Eat '@encode'. */
29030 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
29031 token
= cp_lexer_peek_token (parser
->lexer
);
29032 type
= complete_type (cp_parser_type_id (parser
));
29033 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
29037 error_at (token
->location
,
29038 "%<@encode%> must specify a type as an argument");
29039 return error_mark_node
;
29042 /* This happens if we find @encode(T) (where T is a template
29043 typename or something dependent on a template typename) when
29044 parsing a template. In that case, we can't compile it
29045 immediately, but we rather create an AT_ENCODE_EXPR which will
29046 need to be instantiated when the template is used.
29048 if (dependent_type_p (type
))
29050 tree value
= build_min (AT_ENCODE_EXPR
, size_type_node
, type
);
29051 TREE_READONLY (value
) = 1;
29056 /* Build a location of the form:
29059 with caret==start at the @ token, finishing at the close paren. */
29060 location_t combined_loc
29061 = make_location (start_loc
, start_loc
,
29062 cp_lexer_previous_token (parser
->lexer
)->location
);
29064 return cp_expr (objc_build_encode_expr (type
), combined_loc
);
29067 /* Parse an Objective-C @defs expression. */
29070 cp_parser_objc_defs_expression (cp_parser
*parser
)
29074 cp_lexer_consume_token (parser
->lexer
); /* Eat '@defs'. */
29075 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
29076 name
= cp_parser_identifier (parser
);
29077 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
29079 return objc_get_class_ivars (name
);
29082 /* Parse an Objective-C protocol expression.
29084 objc-protocol-expression:
29085 @protocol ( identifier )
29087 Returns a representation of the protocol expression. */
29090 cp_parser_objc_protocol_expression (cp_parser
* parser
)
29093 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
29095 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
29096 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
29097 proto
= cp_parser_identifier (parser
);
29098 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
29100 /* Build a location of the form:
29103 with caret==start at the @ token, finishing at the close paren. */
29104 location_t combined_loc
29105 = make_location (start_loc
, start_loc
,
29106 cp_lexer_previous_token (parser
->lexer
)->location
);
29107 tree result
= objc_build_protocol_expr (proto
);
29108 protected_set_expr_location (result
, combined_loc
);
29112 /* Parse an Objective-C selector expression.
29114 objc-selector-expression:
29115 @selector ( objc-method-signature )
29117 objc-method-signature:
29123 objc-selector-seq objc-selector :
29125 Returns a representation of the method selector. */
29128 cp_parser_objc_selector_expression (cp_parser
* parser
)
29130 tree sel_seq
= NULL_TREE
;
29131 bool maybe_unary_selector_p
= true;
29133 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
29135 cp_lexer_consume_token (parser
->lexer
); /* Eat '@selector'. */
29136 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
29137 token
= cp_lexer_peek_token (parser
->lexer
);
29139 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
29140 || token
->type
== CPP_SCOPE
)
29142 tree selector
= NULL_TREE
;
29144 if (token
->type
!= CPP_COLON
29145 || token
->type
== CPP_SCOPE
)
29146 selector
= cp_parser_objc_selector (parser
);
29148 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
)
29149 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
))
29151 /* Detect if we have a unary selector. */
29152 if (maybe_unary_selector_p
)
29154 sel_seq
= selector
;
29155 goto finish_selector
;
29159 cp_parser_error (parser
, "expected %<:%>");
29162 maybe_unary_selector_p
= false;
29163 token
= cp_lexer_consume_token (parser
->lexer
);
29165 if (token
->type
== CPP_SCOPE
)
29168 = chainon (sel_seq
,
29169 build_tree_list (selector
, NULL_TREE
));
29171 = chainon (sel_seq
,
29172 build_tree_list (NULL_TREE
, NULL_TREE
));
29176 = chainon (sel_seq
,
29177 build_tree_list (selector
, NULL_TREE
));
29179 token
= cp_lexer_peek_token (parser
->lexer
);
29183 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
29186 /* Build a location of the form:
29189 with caret==start at the @ token, finishing at the close paren. */
29190 location_t combined_loc
29191 = make_location (loc
, loc
,
29192 cp_lexer_previous_token (parser
->lexer
)->location
);
29193 tree result
= objc_build_selector_expr (combined_loc
, sel_seq
);
29194 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29195 protected_set_expr_location (result
, combined_loc
);
29199 /* Parse a list of identifiers.
29201 objc-identifier-list:
29203 objc-identifier-list , identifier
29205 Returns a TREE_LIST of identifier nodes. */
29208 cp_parser_objc_identifier_list (cp_parser
* parser
)
29214 identifier
= cp_parser_identifier (parser
);
29215 if (identifier
== error_mark_node
)
29216 return error_mark_node
;
29218 list
= build_tree_list (NULL_TREE
, identifier
);
29219 sep
= cp_lexer_peek_token (parser
->lexer
);
29221 while (sep
->type
== CPP_COMMA
)
29223 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
29224 identifier
= cp_parser_identifier (parser
);
29225 if (identifier
== error_mark_node
)
29228 list
= chainon (list
, build_tree_list (NULL_TREE
,
29230 sep
= cp_lexer_peek_token (parser
->lexer
);
29236 /* Parse an Objective-C alias declaration.
29238 objc-alias-declaration:
29239 @compatibility_alias identifier identifier ;
29241 This function registers the alias mapping with the Objective-C front end.
29242 It returns nothing. */
29245 cp_parser_objc_alias_declaration (cp_parser
* parser
)
29249 cp_lexer_consume_token (parser
->lexer
); /* Eat '@compatibility_alias'. */
29250 alias
= cp_parser_identifier (parser
);
29251 orig
= cp_parser_identifier (parser
);
29252 objc_declare_alias (alias
, orig
);
29253 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29256 /* Parse an Objective-C class forward-declaration.
29258 objc-class-declaration:
29259 @class objc-identifier-list ;
29261 The function registers the forward declarations with the Objective-C
29262 front end. It returns nothing. */
29265 cp_parser_objc_class_declaration (cp_parser
* parser
)
29267 cp_lexer_consume_token (parser
->lexer
); /* Eat '@class'. */
29272 id
= cp_parser_identifier (parser
);
29273 if (id
== error_mark_node
)
29276 objc_declare_class (id
);
29278 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
29279 cp_lexer_consume_token (parser
->lexer
);
29283 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29286 /* Parse a list of Objective-C protocol references.
29288 objc-protocol-refs-opt:
29289 objc-protocol-refs [opt]
29291 objc-protocol-refs:
29292 < objc-identifier-list >
29294 Returns a TREE_LIST of identifiers, if any. */
29297 cp_parser_objc_protocol_refs_opt (cp_parser
* parser
)
29299 tree protorefs
= NULL_TREE
;
29301 if(cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
29303 cp_lexer_consume_token (parser
->lexer
); /* Eat '<'. */
29304 protorefs
= cp_parser_objc_identifier_list (parser
);
29305 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
29311 /* Parse a Objective-C visibility specification. */
29314 cp_parser_objc_visibility_spec (cp_parser
* parser
)
29316 cp_token
*vis
= cp_lexer_peek_token (parser
->lexer
);
29318 switch (vis
->keyword
)
29320 case RID_AT_PRIVATE
:
29321 objc_set_visibility (OBJC_IVAR_VIS_PRIVATE
);
29323 case RID_AT_PROTECTED
:
29324 objc_set_visibility (OBJC_IVAR_VIS_PROTECTED
);
29326 case RID_AT_PUBLIC
:
29327 objc_set_visibility (OBJC_IVAR_VIS_PUBLIC
);
29329 case RID_AT_PACKAGE
:
29330 objc_set_visibility (OBJC_IVAR_VIS_PACKAGE
);
29336 /* Eat '@private'/'@protected'/'@public'. */
29337 cp_lexer_consume_token (parser
->lexer
);
29340 /* Parse an Objective-C method type. Return 'true' if it is a class
29341 (+) method, and 'false' if it is an instance (-) method. */
29344 cp_parser_objc_method_type (cp_parser
* parser
)
29346 if (cp_lexer_consume_token (parser
->lexer
)->type
== CPP_PLUS
)
29352 /* Parse an Objective-C protocol qualifier. */
29355 cp_parser_objc_protocol_qualifiers (cp_parser
* parser
)
29357 tree quals
= NULL_TREE
, node
;
29358 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29360 node
= token
->u
.value
;
29362 while (node
&& identifier_p (node
)
29363 && (node
== ridpointers
[(int) RID_IN
]
29364 || node
== ridpointers
[(int) RID_OUT
]
29365 || node
== ridpointers
[(int) RID_INOUT
]
29366 || node
== ridpointers
[(int) RID_BYCOPY
]
29367 || node
== ridpointers
[(int) RID_BYREF
]
29368 || node
== ridpointers
[(int) RID_ONEWAY
]))
29370 quals
= tree_cons (NULL_TREE
, node
, quals
);
29371 cp_lexer_consume_token (parser
->lexer
);
29372 token
= cp_lexer_peek_token (parser
->lexer
);
29373 node
= token
->u
.value
;
29379 /* Parse an Objective-C typename. */
29382 cp_parser_objc_typename (cp_parser
* parser
)
29384 tree type_name
= NULL_TREE
;
29386 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
29388 tree proto_quals
, cp_type
= NULL_TREE
;
29390 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
29391 proto_quals
= cp_parser_objc_protocol_qualifiers (parser
);
29393 /* An ObjC type name may consist of just protocol qualifiers, in which
29394 case the type shall default to 'id'. */
29395 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
29397 cp_type
= cp_parser_type_id (parser
);
29399 /* If the type could not be parsed, an error has already
29400 been produced. For error recovery, behave as if it had
29401 not been specified, which will use the default type
29403 if (cp_type
== error_mark_node
)
29405 cp_type
= NULL_TREE
;
29406 /* We need to skip to the closing parenthesis as
29407 cp_parser_type_id() does not seem to do it for
29409 cp_parser_skip_to_closing_parenthesis (parser
,
29410 /*recovering=*/true,
29411 /*or_comma=*/false,
29412 /*consume_paren=*/false);
29416 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
29417 type_name
= build_tree_list (proto_quals
, cp_type
);
29423 /* Check to see if TYPE refers to an Objective-C selector name. */
29426 cp_parser_objc_selector_p (enum cpp_ttype type
)
29428 return (type
== CPP_NAME
|| type
== CPP_KEYWORD
29429 || type
== CPP_AND_AND
|| type
== CPP_AND_EQ
|| type
== CPP_AND
29430 || type
== CPP_OR
|| type
== CPP_COMPL
|| type
== CPP_NOT
29431 || type
== CPP_NOT_EQ
|| type
== CPP_OR_OR
|| type
== CPP_OR_EQ
29432 || type
== CPP_XOR
|| type
== CPP_XOR_EQ
);
29435 /* Parse an Objective-C selector. */
29438 cp_parser_objc_selector (cp_parser
* parser
)
29440 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
29442 if (!cp_parser_objc_selector_p (token
->type
))
29444 error_at (token
->location
, "invalid Objective-C++ selector name");
29445 return error_mark_node
;
29448 /* C++ operator names are allowed to appear in ObjC selectors. */
29449 switch (token
->type
)
29451 case CPP_AND_AND
: return get_identifier ("and");
29452 case CPP_AND_EQ
: return get_identifier ("and_eq");
29453 case CPP_AND
: return get_identifier ("bitand");
29454 case CPP_OR
: return get_identifier ("bitor");
29455 case CPP_COMPL
: return get_identifier ("compl");
29456 case CPP_NOT
: return get_identifier ("not");
29457 case CPP_NOT_EQ
: return get_identifier ("not_eq");
29458 case CPP_OR_OR
: return get_identifier ("or");
29459 case CPP_OR_EQ
: return get_identifier ("or_eq");
29460 case CPP_XOR
: return get_identifier ("xor");
29461 case CPP_XOR_EQ
: return get_identifier ("xor_eq");
29462 default: return token
->u
.value
;
29466 /* Parse an Objective-C params list. */
29469 cp_parser_objc_method_keyword_params (cp_parser
* parser
, tree
* attributes
)
29471 tree params
= NULL_TREE
;
29472 bool maybe_unary_selector_p
= true;
29473 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29475 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
29477 tree selector
= NULL_TREE
, type_name
, identifier
;
29478 tree parm_attr
= NULL_TREE
;
29480 if (token
->keyword
== RID_ATTRIBUTE
)
29483 if (token
->type
!= CPP_COLON
)
29484 selector
= cp_parser_objc_selector (parser
);
29486 /* Detect if we have a unary selector. */
29487 if (maybe_unary_selector_p
29488 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
29490 params
= selector
; /* Might be followed by attributes. */
29494 maybe_unary_selector_p
= false;
29495 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
29497 /* Something went quite wrong. There should be a colon
29498 here, but there is not. Stop parsing parameters. */
29501 type_name
= cp_parser_objc_typename (parser
);
29502 /* New ObjC allows attributes on parameters too. */
29503 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
29504 parm_attr
= cp_parser_attributes_opt (parser
);
29505 identifier
= cp_parser_identifier (parser
);
29509 objc_build_keyword_decl (selector
,
29514 token
= cp_lexer_peek_token (parser
->lexer
);
29517 if (params
== NULL_TREE
)
29519 cp_parser_error (parser
, "objective-c++ method declaration is expected");
29520 return error_mark_node
;
29523 /* We allow tail attributes for the method. */
29524 if (token
->keyword
== RID_ATTRIBUTE
)
29526 *attributes
= cp_parser_attributes_opt (parser
);
29527 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
29528 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
29530 cp_parser_error (parser
,
29531 "method attributes must be specified at the end");
29532 return error_mark_node
;
29535 if (params
== NULL_TREE
)
29537 cp_parser_error (parser
, "objective-c++ method declaration is expected");
29538 return error_mark_node
;
29543 /* Parse the non-keyword Objective-C params. */
29546 cp_parser_objc_method_tail_params_opt (cp_parser
* parser
, bool *ellipsisp
,
29549 tree params
= make_node (TREE_LIST
);
29550 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29551 *ellipsisp
= false; /* Initially, assume no ellipsis. */
29553 while (token
->type
== CPP_COMMA
)
29555 cp_parameter_declarator
*parmdecl
;
29558 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
29559 token
= cp_lexer_peek_token (parser
->lexer
);
29561 if (token
->type
== CPP_ELLIPSIS
)
29563 cp_lexer_consume_token (parser
->lexer
); /* Eat '...'. */
29565 token
= cp_lexer_peek_token (parser
->lexer
);
29569 /* TODO: parse attributes for tail parameters. */
29570 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
29571 parm
= grokdeclarator (parmdecl
->declarator
,
29572 &parmdecl
->decl_specifiers
,
29573 PARM
, /*initialized=*/0,
29574 /*attrlist=*/NULL
);
29576 chainon (params
, build_tree_list (NULL_TREE
, parm
));
29577 token
= cp_lexer_peek_token (parser
->lexer
);
29580 /* We allow tail attributes for the method. */
29581 if (token
->keyword
== RID_ATTRIBUTE
)
29583 if (*attributes
== NULL_TREE
)
29585 *attributes
= cp_parser_attributes_opt (parser
);
29586 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
29587 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
29591 /* We have an error, but parse the attributes, so that we can
29593 *attributes
= cp_parser_attributes_opt (parser
);
29595 cp_parser_error (parser
,
29596 "method attributes must be specified at the end");
29597 return error_mark_node
;
29603 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29606 cp_parser_objc_interstitial_code (cp_parser
* parser
)
29608 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29610 /* If the next token is `extern' and the following token is a string
29611 literal, then we have a linkage specification. */
29612 if (token
->keyword
== RID_EXTERN
29613 && cp_parser_is_pure_string_literal
29614 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
29615 cp_parser_linkage_specification (parser
);
29616 /* Handle #pragma, if any. */
29617 else if (token
->type
== CPP_PRAGMA
)
29618 cp_parser_pragma (parser
, pragma_objc_icode
, NULL
);
29619 /* Allow stray semicolons. */
29620 else if (token
->type
== CPP_SEMICOLON
)
29621 cp_lexer_consume_token (parser
->lexer
);
29622 /* Mark methods as optional or required, when building protocols. */
29623 else if (token
->keyword
== RID_AT_OPTIONAL
)
29625 cp_lexer_consume_token (parser
->lexer
);
29626 objc_set_method_opt (true);
29628 else if (token
->keyword
== RID_AT_REQUIRED
)
29630 cp_lexer_consume_token (parser
->lexer
);
29631 objc_set_method_opt (false);
29633 else if (token
->keyword
== RID_NAMESPACE
)
29634 cp_parser_namespace_definition (parser
);
29635 /* Other stray characters must generate errors. */
29636 else if (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_CLOSE_BRACE
)
29638 cp_lexer_consume_token (parser
->lexer
);
29639 error ("stray %qs between Objective-C++ methods",
29640 token
->type
== CPP_OPEN_BRACE
? "{" : "}");
29642 /* Finally, try to parse a block-declaration, or a function-definition. */
29644 cp_parser_block_declaration (parser
, /*statement_p=*/false);
29647 /* Parse a method signature. */
29650 cp_parser_objc_method_signature (cp_parser
* parser
, tree
* attributes
)
29652 tree rettype
, kwdparms
, optparms
;
29653 bool ellipsis
= false;
29654 bool is_class_method
;
29656 is_class_method
= cp_parser_objc_method_type (parser
);
29657 rettype
= cp_parser_objc_typename (parser
);
29658 *attributes
= NULL_TREE
;
29659 kwdparms
= cp_parser_objc_method_keyword_params (parser
, attributes
);
29660 if (kwdparms
== error_mark_node
)
29661 return error_mark_node
;
29662 optparms
= cp_parser_objc_method_tail_params_opt (parser
, &ellipsis
, attributes
);
29663 if (optparms
== error_mark_node
)
29664 return error_mark_node
;
29666 return objc_build_method_signature (is_class_method
, rettype
, kwdparms
, optparms
, ellipsis
);
29670 cp_parser_objc_method_maybe_bad_prefix_attributes (cp_parser
* parser
)
29673 cp_lexer_save_tokens (parser
->lexer
);
29674 tattr
= cp_parser_attributes_opt (parser
);
29675 gcc_assert (tattr
) ;
29677 /* If the attributes are followed by a method introducer, this is not allowed.
29678 Dump the attributes and flag the situation. */
29679 if (cp_lexer_next_token_is (parser
->lexer
, CPP_PLUS
)
29680 || cp_lexer_next_token_is (parser
->lexer
, CPP_MINUS
))
29683 /* Otherwise, the attributes introduce some interstitial code, possibly so
29684 rewind to allow that check. */
29685 cp_lexer_rollback_tokens (parser
->lexer
);
29689 /* Parse an Objective-C method prototype list. */
29692 cp_parser_objc_method_prototype_list (cp_parser
* parser
)
29694 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29696 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
29698 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
29700 tree attributes
, sig
;
29701 bool is_class_method
;
29702 if (token
->type
== CPP_PLUS
)
29703 is_class_method
= true;
29705 is_class_method
= false;
29706 sig
= cp_parser_objc_method_signature (parser
, &attributes
);
29707 if (sig
== error_mark_node
)
29709 cp_parser_skip_to_end_of_block_or_statement (parser
);
29710 token
= cp_lexer_peek_token (parser
->lexer
);
29713 objc_add_method_declaration (is_class_method
, sig
, attributes
);
29714 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29716 else if (token
->keyword
== RID_AT_PROPERTY
)
29717 cp_parser_objc_at_property_declaration (parser
);
29718 else if (token
->keyword
== RID_ATTRIBUTE
29719 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
29720 warning_at (cp_lexer_peek_token (parser
->lexer
)->location
,
29722 "prefix attributes are ignored for methods");
29724 /* Allow for interspersed non-ObjC++ code. */
29725 cp_parser_objc_interstitial_code (parser
);
29727 token
= cp_lexer_peek_token (parser
->lexer
);
29730 if (token
->type
!= CPP_EOF
)
29731 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
29733 cp_parser_error (parser
, "expected %<@end%>");
29735 objc_finish_interface ();
29738 /* Parse an Objective-C method definition list. */
29741 cp_parser_objc_method_definition_list (cp_parser
* parser
)
29743 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29745 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
29749 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
29752 tree sig
, attribute
;
29753 bool is_class_method
;
29754 if (token
->type
== CPP_PLUS
)
29755 is_class_method
= true;
29757 is_class_method
= false;
29758 push_deferring_access_checks (dk_deferred
);
29759 sig
= cp_parser_objc_method_signature (parser
, &attribute
);
29760 if (sig
== error_mark_node
)
29762 cp_parser_skip_to_end_of_block_or_statement (parser
);
29763 token
= cp_lexer_peek_token (parser
->lexer
);
29766 objc_start_method_definition (is_class_method
, sig
, attribute
,
29769 /* For historical reasons, we accept an optional semicolon. */
29770 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
29771 cp_lexer_consume_token (parser
->lexer
);
29773 ptk
= cp_lexer_peek_token (parser
->lexer
);
29774 if (!(ptk
->type
== CPP_PLUS
|| ptk
->type
== CPP_MINUS
29775 || ptk
->type
== CPP_EOF
|| ptk
->keyword
== RID_AT_END
))
29777 perform_deferred_access_checks (tf_warning_or_error
);
29778 stop_deferring_access_checks ();
29779 meth
= cp_parser_function_definition_after_declarator (parser
,
29781 pop_deferring_access_checks ();
29782 objc_finish_method_definition (meth
);
29785 /* The following case will be removed once @synthesize is
29786 completely implemented. */
29787 else if (token
->keyword
== RID_AT_PROPERTY
)
29788 cp_parser_objc_at_property_declaration (parser
);
29789 else if (token
->keyword
== RID_AT_SYNTHESIZE
)
29790 cp_parser_objc_at_synthesize_declaration (parser
);
29791 else if (token
->keyword
== RID_AT_DYNAMIC
)
29792 cp_parser_objc_at_dynamic_declaration (parser
);
29793 else if (token
->keyword
== RID_ATTRIBUTE
29794 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
29795 warning_at (token
->location
, OPT_Wattributes
,
29796 "prefix attributes are ignored for methods");
29798 /* Allow for interspersed non-ObjC++ code. */
29799 cp_parser_objc_interstitial_code (parser
);
29801 token
= cp_lexer_peek_token (parser
->lexer
);
29804 if (token
->type
!= CPP_EOF
)
29805 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
29807 cp_parser_error (parser
, "expected %<@end%>");
29809 objc_finish_implementation ();
29812 /* Parse Objective-C ivars. */
29815 cp_parser_objc_class_ivars (cp_parser
* parser
)
29817 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29819 if (token
->type
!= CPP_OPEN_BRACE
)
29820 return; /* No ivars specified. */
29822 cp_lexer_consume_token (parser
->lexer
); /* Eat '{'. */
29823 token
= cp_lexer_peek_token (parser
->lexer
);
29825 while (token
->type
!= CPP_CLOSE_BRACE
29826 && token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
29828 cp_decl_specifier_seq declspecs
;
29829 int decl_class_or_enum_p
;
29830 tree prefix_attributes
;
29832 cp_parser_objc_visibility_spec (parser
);
29834 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
29837 cp_parser_decl_specifier_seq (parser
,
29838 CP_PARSER_FLAGS_OPTIONAL
,
29840 &decl_class_or_enum_p
);
29842 /* auto, register, static, extern, mutable. */
29843 if (declspecs
.storage_class
!= sc_none
)
29845 cp_parser_error (parser
, "invalid type for instance variable");
29846 declspecs
.storage_class
= sc_none
;
29849 /* thread_local. */
29850 if (decl_spec_seq_has_spec_p (&declspecs
, ds_thread
))
29852 cp_parser_error (parser
, "invalid type for instance variable");
29853 declspecs
.locations
[ds_thread
] = 0;
29857 if (decl_spec_seq_has_spec_p (&declspecs
, ds_typedef
))
29859 cp_parser_error (parser
, "invalid type for instance variable");
29860 declspecs
.locations
[ds_typedef
] = 0;
29863 prefix_attributes
= declspecs
.attributes
;
29864 declspecs
.attributes
= NULL_TREE
;
29866 /* Keep going until we hit the `;' at the end of the
29868 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
29870 tree width
= NULL_TREE
, attributes
, first_attribute
, decl
;
29871 cp_declarator
*declarator
= NULL
;
29872 int ctor_dtor_or_conv_p
;
29874 /* Check for a (possibly unnamed) bitfield declaration. */
29875 token
= cp_lexer_peek_token (parser
->lexer
);
29876 if (token
->type
== CPP_COLON
)
29879 if (token
->type
== CPP_NAME
29880 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
29883 /* Get the name of the bitfield. */
29884 declarator
= make_id_declarator (NULL_TREE
,
29885 cp_parser_identifier (parser
),
29889 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
29890 /* Get the width of the bitfield. */
29892 = cp_parser_constant_expression (parser
);
29896 /* Parse the declarator. */
29898 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
29899 &ctor_dtor_or_conv_p
,
29900 /*parenthesized_p=*/NULL
,
29901 /*member_p=*/false,
29902 /*friend_p=*/false);
29905 /* Look for attributes that apply to the ivar. */
29906 attributes
= cp_parser_attributes_opt (parser
);
29907 /* Remember which attributes are prefix attributes and
29909 first_attribute
= attributes
;
29910 /* Combine the attributes. */
29911 attributes
= chainon (prefix_attributes
, attributes
);
29914 /* Create the bitfield declaration. */
29915 decl
= grokbitfield (declarator
, &declspecs
,
29919 decl
= grokfield (declarator
, &declspecs
,
29920 NULL_TREE
, /*init_const_expr_p=*/false,
29921 NULL_TREE
, attributes
);
29923 /* Add the instance variable. */
29924 if (decl
!= error_mark_node
&& decl
!= NULL_TREE
)
29925 objc_add_instance_variable (decl
);
29927 /* Reset PREFIX_ATTRIBUTES. */
29928 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
29929 attributes
= TREE_CHAIN (attributes
);
29931 TREE_CHAIN (attributes
) = NULL_TREE
;
29933 token
= cp_lexer_peek_token (parser
->lexer
);
29935 if (token
->type
== CPP_COMMA
)
29937 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
29943 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29944 token
= cp_lexer_peek_token (parser
->lexer
);
29947 if (token
->keyword
== RID_AT_END
)
29948 cp_parser_error (parser
, "expected %<}%>");
29950 /* Do not consume the RID_AT_END, so it will be read again as terminating
29951 the @interface of @implementation. */
29952 if (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
29953 cp_lexer_consume_token (parser
->lexer
); /* Eat '}'. */
29955 /* For historical reasons, we accept an optional semicolon. */
29956 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
29957 cp_lexer_consume_token (parser
->lexer
);
29960 /* Parse an Objective-C protocol declaration. */
29963 cp_parser_objc_protocol_declaration (cp_parser
* parser
, tree attributes
)
29965 tree proto
, protorefs
;
29968 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
29969 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
29971 tok
= cp_lexer_peek_token (parser
->lexer
);
29972 error_at (tok
->location
, "identifier expected after %<@protocol%>");
29973 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29977 /* See if we have a forward declaration or a definition. */
29978 tok
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
29980 /* Try a forward declaration first. */
29981 if (tok
->type
== CPP_COMMA
|| tok
->type
== CPP_SEMICOLON
)
29987 id
= cp_parser_identifier (parser
);
29988 if (id
== error_mark_node
)
29991 objc_declare_protocol (id
, attributes
);
29993 if(cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
29994 cp_lexer_consume_token (parser
->lexer
);
29998 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30001 /* Ok, we got a full-fledged definition (or at least should). */
30004 proto
= cp_parser_identifier (parser
);
30005 protorefs
= cp_parser_objc_protocol_refs_opt (parser
);
30006 objc_start_protocol (proto
, protorefs
, attributes
);
30007 cp_parser_objc_method_prototype_list (parser
);
30011 /* Parse an Objective-C superclass or category. */
30014 cp_parser_objc_superclass_or_category (cp_parser
*parser
,
30017 tree
*categ
, bool *is_class_extension
)
30019 cp_token
*next
= cp_lexer_peek_token (parser
->lexer
);
30021 *super
= *categ
= NULL_TREE
;
30022 *is_class_extension
= false;
30023 if (next
->type
== CPP_COLON
)
30025 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
30026 *super
= cp_parser_identifier (parser
);
30028 else if (next
->type
== CPP_OPEN_PAREN
)
30030 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
30032 /* If there is no category name, and this is an @interface, we
30033 have a class extension. */
30034 if (iface_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
30036 *categ
= NULL_TREE
;
30037 *is_class_extension
= true;
30040 *categ
= cp_parser_identifier (parser
);
30042 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
30046 /* Parse an Objective-C class interface. */
30049 cp_parser_objc_class_interface (cp_parser
* parser
, tree attributes
)
30051 tree name
, super
, categ
, protos
;
30052 bool is_class_extension
;
30054 cp_lexer_consume_token (parser
->lexer
); /* Eat '@interface'. */
30055 name
= cp_parser_identifier (parser
);
30056 if (name
== error_mark_node
)
30058 /* It's hard to recover because even if valid @interface stuff
30059 is to follow, we can't compile it (or validate it) if we
30060 don't even know which class it refers to. Let's assume this
30061 was a stray '@interface' token in the stream and skip it.
30065 cp_parser_objc_superclass_or_category (parser
, true, &super
, &categ
,
30066 &is_class_extension
);
30067 protos
= cp_parser_objc_protocol_refs_opt (parser
);
30069 /* We have either a class or a category on our hands. */
30070 if (categ
|| is_class_extension
)
30071 objc_start_category_interface (name
, categ
, protos
, attributes
);
30074 objc_start_class_interface (name
, super
, protos
, attributes
);
30075 /* Handle instance variable declarations, if any. */
30076 cp_parser_objc_class_ivars (parser
);
30077 objc_continue_interface ();
30080 cp_parser_objc_method_prototype_list (parser
);
30083 /* Parse an Objective-C class implementation. */
30086 cp_parser_objc_class_implementation (cp_parser
* parser
)
30088 tree name
, super
, categ
;
30089 bool is_class_extension
;
30091 cp_lexer_consume_token (parser
->lexer
); /* Eat '@implementation'. */
30092 name
= cp_parser_identifier (parser
);
30093 if (name
== error_mark_node
)
30095 /* It's hard to recover because even if valid @implementation
30096 stuff is to follow, we can't compile it (or validate it) if
30097 we don't even know which class it refers to. Let's assume
30098 this was a stray '@implementation' token in the stream and
30103 cp_parser_objc_superclass_or_category (parser
, false, &super
, &categ
,
30104 &is_class_extension
);
30106 /* We have either a class or a category on our hands. */
30108 objc_start_category_implementation (name
, categ
);
30111 objc_start_class_implementation (name
, super
);
30112 /* Handle instance variable declarations, if any. */
30113 cp_parser_objc_class_ivars (parser
);
30114 objc_continue_implementation ();
30117 cp_parser_objc_method_definition_list (parser
);
30120 /* Consume the @end token and finish off the implementation. */
30123 cp_parser_objc_end_implementation (cp_parser
* parser
)
30125 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
30126 objc_finish_implementation ();
30129 /* Parse an Objective-C declaration. */
30132 cp_parser_objc_declaration (cp_parser
* parser
, tree attributes
)
30134 /* Try to figure out what kind of declaration is present. */
30135 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
30138 switch (kwd
->keyword
)
30143 error_at (kwd
->location
, "attributes may not be specified before"
30144 " the %<@%D%> Objective-C++ keyword",
30148 case RID_AT_IMPLEMENTATION
:
30149 warning_at (kwd
->location
, OPT_Wattributes
,
30150 "prefix attributes are ignored before %<@%D%>",
30157 switch (kwd
->keyword
)
30160 cp_parser_objc_alias_declaration (parser
);
30163 cp_parser_objc_class_declaration (parser
);
30165 case RID_AT_PROTOCOL
:
30166 cp_parser_objc_protocol_declaration (parser
, attributes
);
30168 case RID_AT_INTERFACE
:
30169 cp_parser_objc_class_interface (parser
, attributes
);
30171 case RID_AT_IMPLEMENTATION
:
30172 cp_parser_objc_class_implementation (parser
);
30175 cp_parser_objc_end_implementation (parser
);
30178 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
30180 cp_parser_skip_to_end_of_block_or_statement (parser
);
30184 /* Parse an Objective-C try-catch-finally statement.
30186 objc-try-catch-finally-stmt:
30187 @try compound-statement objc-catch-clause-seq [opt]
30188 objc-finally-clause [opt]
30190 objc-catch-clause-seq:
30191 objc-catch-clause objc-catch-clause-seq [opt]
30194 @catch ( objc-exception-declaration ) compound-statement
30196 objc-finally-clause:
30197 @finally compound-statement
30199 objc-exception-declaration:
30200 parameter-declaration
30203 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30207 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30208 for C. Keep them in sync. */
30211 cp_parser_objc_try_catch_finally_statement (cp_parser
*parser
)
30213 location_t location
;
30216 cp_parser_require_keyword (parser
, RID_AT_TRY
, RT_AT_TRY
);
30217 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
30218 objc_maybe_warn_exceptions (location
);
30219 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30220 node, lest it get absorbed into the surrounding block. */
30221 stmt
= push_stmt_list ();
30222 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
30223 objc_begin_try_stmt (location
, pop_stmt_list (stmt
));
30225 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_CATCH
))
30227 cp_parameter_declarator
*parm
;
30228 tree parameter_declaration
= error_mark_node
;
30229 bool seen_open_paren
= false;
30231 cp_lexer_consume_token (parser
->lexer
);
30232 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30233 seen_open_paren
= true;
30234 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
30236 /* We have "@catch (...)" (where the '...' are literally
30237 what is in the code). Skip the '...'.
30238 parameter_declaration is set to NULL_TREE, and
30239 objc_being_catch_clauses() knows that that means
30241 cp_lexer_consume_token (parser
->lexer
);
30242 parameter_declaration
= NULL_TREE
;
30246 /* We have "@catch (NSException *exception)" or something
30247 like that. Parse the parameter declaration. */
30248 parm
= cp_parser_parameter_declaration (parser
, false, NULL
);
30250 parameter_declaration
= error_mark_node
;
30252 parameter_declaration
= grokdeclarator (parm
->declarator
,
30253 &parm
->decl_specifiers
,
30254 PARM
, /*initialized=*/0,
30255 /*attrlist=*/NULL
);
30257 if (seen_open_paren
)
30258 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
30261 /* If there was no open parenthesis, we are recovering from
30262 an error, and we are trying to figure out what mistake
30263 the user has made. */
30265 /* If there is an immediate closing parenthesis, the user
30266 probably forgot the opening one (ie, they typed "@catch
30267 NSException *e)". Parse the closing parenthesis and keep
30269 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
30270 cp_lexer_consume_token (parser
->lexer
);
30272 /* If these is no immediate closing parenthesis, the user
30273 probably doesn't know that parenthesis are required at
30274 all (ie, they typed "@catch NSException *e"). So, just
30275 forget about the closing parenthesis and keep going. */
30277 objc_begin_catch_clause (parameter_declaration
);
30278 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
30279 objc_finish_catch_clause ();
30281 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_FINALLY
))
30283 cp_lexer_consume_token (parser
->lexer
);
30284 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
30285 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30286 node, lest it get absorbed into the surrounding block. */
30287 stmt
= push_stmt_list ();
30288 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
30289 objc_build_finally_clause (location
, pop_stmt_list (stmt
));
30292 return objc_finish_try_stmt ();
30295 /* Parse an Objective-C synchronized statement.
30297 objc-synchronized-stmt:
30298 @synchronized ( expression ) compound-statement
30300 Returns NULL_TREE. */
30303 cp_parser_objc_synchronized_statement (cp_parser
*parser
)
30305 location_t location
;
30308 cp_parser_require_keyword (parser
, RID_AT_SYNCHRONIZED
, RT_AT_SYNCHRONIZED
);
30310 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
30311 objc_maybe_warn_exceptions (location
);
30312 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
30313 lock
= cp_parser_expression (parser
);
30314 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
30316 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30317 node, lest it get absorbed into the surrounding block. */
30318 stmt
= push_stmt_list ();
30319 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
30321 return objc_build_synchronized (location
, lock
, pop_stmt_list (stmt
));
30324 /* Parse an Objective-C throw statement.
30327 @throw assignment-expression [opt] ;
30329 Returns a constructed '@throw' statement. */
30332 cp_parser_objc_throw_statement (cp_parser
*parser
)
30334 tree expr
= NULL_TREE
;
30335 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
30337 cp_parser_require_keyword (parser
, RID_AT_THROW
, RT_AT_THROW
);
30339 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
30340 expr
= cp_parser_expression (parser
);
30342 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30344 return objc_build_throw_stmt (loc
, expr
);
30347 /* Parse an Objective-C statement. */
30350 cp_parser_objc_statement (cp_parser
* parser
)
30352 /* Try to figure out what kind of declaration is present. */
30353 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
30355 switch (kwd
->keyword
)
30358 return cp_parser_objc_try_catch_finally_statement (parser
);
30359 case RID_AT_SYNCHRONIZED
:
30360 return cp_parser_objc_synchronized_statement (parser
);
30362 return cp_parser_objc_throw_statement (parser
);
30364 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
30366 cp_parser_skip_to_end_of_block_or_statement (parser
);
30369 return error_mark_node
;
30372 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30373 look ahead to see if an objc keyword follows the attributes. This
30374 is to detect the use of prefix attributes on ObjC @interface and
30378 cp_parser_objc_valid_prefix_attributes (cp_parser
* parser
, tree
*attrib
)
30380 cp_lexer_save_tokens (parser
->lexer
);
30381 *attrib
= cp_parser_attributes_opt (parser
);
30382 gcc_assert (*attrib
);
30383 if (OBJC_IS_AT_KEYWORD (cp_lexer_peek_token (parser
->lexer
)->keyword
))
30385 cp_lexer_commit_tokens (parser
->lexer
);
30388 cp_lexer_rollback_tokens (parser
->lexer
);
30392 /* This routine is a minimal replacement for
30393 c_parser_struct_declaration () used when parsing the list of
30394 types/names or ObjC++ properties. For example, when parsing the
30397 @property (readonly) int a, b, c;
30399 this function is responsible for parsing "int a, int b, int c" and
30400 returning the declarations as CHAIN of DECLs.
30402 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30403 similar parsing. */
30405 cp_parser_objc_struct_declaration (cp_parser
*parser
)
30407 tree decls
= NULL_TREE
;
30408 cp_decl_specifier_seq declspecs
;
30409 int decl_class_or_enum_p
;
30410 tree prefix_attributes
;
30412 cp_parser_decl_specifier_seq (parser
,
30413 CP_PARSER_FLAGS_NONE
,
30415 &decl_class_or_enum_p
);
30417 if (declspecs
.type
== error_mark_node
)
30418 return error_mark_node
;
30420 /* auto, register, static, extern, mutable. */
30421 if (declspecs
.storage_class
!= sc_none
)
30423 cp_parser_error (parser
, "invalid type for property");
30424 declspecs
.storage_class
= sc_none
;
30427 /* thread_local. */
30428 if (decl_spec_seq_has_spec_p (&declspecs
, ds_thread
))
30430 cp_parser_error (parser
, "invalid type for property");
30431 declspecs
.locations
[ds_thread
] = 0;
30435 if (decl_spec_seq_has_spec_p (&declspecs
, ds_typedef
))
30437 cp_parser_error (parser
, "invalid type for property");
30438 declspecs
.locations
[ds_typedef
] = 0;
30441 prefix_attributes
= declspecs
.attributes
;
30442 declspecs
.attributes
= NULL_TREE
;
30444 /* Keep going until we hit the `;' at the end of the declaration. */
30445 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
30447 tree attributes
, first_attribute
, decl
;
30448 cp_declarator
*declarator
;
30451 /* Parse the declarator. */
30452 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
30453 NULL
, NULL
, false, false);
30455 /* Look for attributes that apply to the ivar. */
30456 attributes
= cp_parser_attributes_opt (parser
);
30457 /* Remember which attributes are prefix attributes and
30459 first_attribute
= attributes
;
30460 /* Combine the attributes. */
30461 attributes
= chainon (prefix_attributes
, attributes
);
30463 decl
= grokfield (declarator
, &declspecs
,
30464 NULL_TREE
, /*init_const_expr_p=*/false,
30465 NULL_TREE
, attributes
);
30467 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
30468 return error_mark_node
;
30470 /* Reset PREFIX_ATTRIBUTES. */
30471 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
30472 attributes
= TREE_CHAIN (attributes
);
30474 TREE_CHAIN (attributes
) = NULL_TREE
;
30476 DECL_CHAIN (decl
) = decls
;
30479 token
= cp_lexer_peek_token (parser
->lexer
);
30480 if (token
->type
== CPP_COMMA
)
30482 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
30491 /* Parse an Objective-C @property declaration. The syntax is:
30493 objc-property-declaration:
30494 '@property' objc-property-attributes[opt] struct-declaration ;
30496 objc-property-attributes:
30497 '(' objc-property-attribute-list ')'
30499 objc-property-attribute-list:
30500 objc-property-attribute
30501 objc-property-attribute-list, objc-property-attribute
30503 objc-property-attribute
30504 'getter' = identifier
30505 'setter' = identifier
30514 @property NSString *name;
30515 @property (readonly) id object;
30516 @property (retain, nonatomic, getter=getTheName) id name;
30517 @property int a, b, c;
30519 PS: This function is identical to
30520 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30522 cp_parser_objc_at_property_declaration (cp_parser
*parser
)
30524 /* The following variables hold the attributes of the properties as
30525 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30526 seen. When we see an attribute, we set them to 'true' (if they
30527 are boolean properties) or to the identifier (if they have an
30528 argument, ie, for getter and setter). Note that here we only
30529 parse the list of attributes, check the syntax and accumulate the
30530 attributes that we find. objc_add_property_declaration() will
30531 then process the information. */
30532 bool property_assign
= false;
30533 bool property_copy
= false;
30534 tree property_getter_ident
= NULL_TREE
;
30535 bool property_nonatomic
= false;
30536 bool property_readonly
= false;
30537 bool property_readwrite
= false;
30538 bool property_retain
= false;
30539 tree property_setter_ident
= NULL_TREE
;
30541 /* 'properties' is the list of properties that we read. Usually a
30542 single one, but maybe more (eg, in "@property int a, b, c;" there
30547 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
30549 cp_lexer_consume_token (parser
->lexer
); /* Eat '@property'. */
30551 /* Parse the optional attribute list... */
30552 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
30555 cp_lexer_consume_token (parser
->lexer
);
30559 bool syntax_error
= false;
30560 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
30563 if (token
->type
!= CPP_NAME
)
30565 cp_parser_error (parser
, "expected identifier");
30568 keyword
= C_RID_CODE (token
->u
.value
);
30569 cp_lexer_consume_token (parser
->lexer
);
30572 case RID_ASSIGN
: property_assign
= true; break;
30573 case RID_COPY
: property_copy
= true; break;
30574 case RID_NONATOMIC
: property_nonatomic
= true; break;
30575 case RID_READONLY
: property_readonly
= true; break;
30576 case RID_READWRITE
: property_readwrite
= true; break;
30577 case RID_RETAIN
: property_retain
= true; break;
30581 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
30583 if (keyword
== RID_GETTER
)
30584 cp_parser_error (parser
,
30585 "missing %<=%> (after %<getter%> attribute)");
30587 cp_parser_error (parser
,
30588 "missing %<=%> (after %<setter%> attribute)");
30589 syntax_error
= true;
30592 cp_lexer_consume_token (parser
->lexer
); /* eat the = */
30593 if (!cp_parser_objc_selector_p (cp_lexer_peek_token (parser
->lexer
)->type
))
30595 cp_parser_error (parser
, "expected identifier");
30596 syntax_error
= true;
30599 if (keyword
== RID_SETTER
)
30601 if (property_setter_ident
!= NULL_TREE
)
30603 cp_parser_error (parser
, "the %<setter%> attribute may only be specified once");
30604 cp_lexer_consume_token (parser
->lexer
);
30607 property_setter_ident
= cp_parser_objc_selector (parser
);
30608 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
30609 cp_parser_error (parser
, "setter name must terminate with %<:%>");
30611 cp_lexer_consume_token (parser
->lexer
);
30615 if (property_getter_ident
!= NULL_TREE
)
30617 cp_parser_error (parser
, "the %<getter%> attribute may only be specified once");
30618 cp_lexer_consume_token (parser
->lexer
);
30621 property_getter_ident
= cp_parser_objc_selector (parser
);
30625 cp_parser_error (parser
, "unknown property attribute");
30626 syntax_error
= true;
30633 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
30634 cp_lexer_consume_token (parser
->lexer
);
30639 /* FIXME: "@property (setter, assign);" will generate a spurious
30640 "error: expected ‘)’ before ‘,’ token". This is because
30641 cp_parser_require, unlike the C counterpart, will produce an
30642 error even if we are in error recovery. */
30643 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30645 cp_parser_skip_to_closing_parenthesis (parser
,
30646 /*recovering=*/true,
30647 /*or_comma=*/false,
30648 /*consume_paren=*/true);
30652 /* ... and the property declaration(s). */
30653 properties
= cp_parser_objc_struct_declaration (parser
);
30655 if (properties
== error_mark_node
)
30657 cp_parser_skip_to_end_of_statement (parser
);
30658 /* If the next token is now a `;', consume it. */
30659 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
30660 cp_lexer_consume_token (parser
->lexer
);
30664 if (properties
== NULL_TREE
)
30665 cp_parser_error (parser
, "expected identifier");
30668 /* Comma-separated properties are chained together in
30669 reverse order; add them one by one. */
30670 properties
= nreverse (properties
);
30672 for (; properties
; properties
= TREE_CHAIN (properties
))
30673 objc_add_property_declaration (loc
, copy_node (properties
),
30674 property_readonly
, property_readwrite
,
30675 property_assign
, property_retain
,
30676 property_copy
, property_nonatomic
,
30677 property_getter_ident
, property_setter_ident
);
30680 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30683 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
30685 objc-synthesize-declaration:
30686 @synthesize objc-synthesize-identifier-list ;
30688 objc-synthesize-identifier-list:
30689 objc-synthesize-identifier
30690 objc-synthesize-identifier-list, objc-synthesize-identifier
30692 objc-synthesize-identifier
30694 identifier = identifier
30697 @synthesize MyProperty;
30698 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
30700 PS: This function is identical to c_parser_objc_at_synthesize_declaration
30701 for C. Keep them in sync.
30704 cp_parser_objc_at_synthesize_declaration (cp_parser
*parser
)
30706 tree list
= NULL_TREE
;
30708 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
30710 cp_lexer_consume_token (parser
->lexer
); /* Eat '@synthesize'. */
30713 tree property
, ivar
;
30714 property
= cp_parser_identifier (parser
);
30715 if (property
== error_mark_node
)
30717 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30720 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
30722 cp_lexer_consume_token (parser
->lexer
);
30723 ivar
= cp_parser_identifier (parser
);
30724 if (ivar
== error_mark_node
)
30726 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30732 list
= chainon (list
, build_tree_list (ivar
, property
));
30733 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
30734 cp_lexer_consume_token (parser
->lexer
);
30738 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30739 objc_add_synthesize_declaration (loc
, list
);
30742 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
30744 objc-dynamic-declaration:
30745 @dynamic identifier-list ;
30748 @dynamic MyProperty;
30749 @dynamic MyProperty, AnotherProperty;
30751 PS: This function is identical to c_parser_objc_at_dynamic_declaration
30752 for C. Keep them in sync.
30755 cp_parser_objc_at_dynamic_declaration (cp_parser
*parser
)
30757 tree list
= NULL_TREE
;
30759 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
30761 cp_lexer_consume_token (parser
->lexer
); /* Eat '@dynamic'. */
30765 property
= cp_parser_identifier (parser
);
30766 if (property
== error_mark_node
)
30768 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30771 list
= chainon (list
, build_tree_list (NULL
, property
));
30772 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
30773 cp_lexer_consume_token (parser
->lexer
);
30777 cp_parser_consume_semicolon_at_end_of_statement (parser
);
30778 objc_add_dynamic_declaration (loc
, list
);
30782 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
30784 /* Returns name of the next clause.
30785 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
30786 the token is not consumed. Otherwise appropriate pragma_omp_clause is
30787 returned and the token is consumed. */
30789 static pragma_omp_clause
30790 cp_parser_omp_clause_name (cp_parser
*parser
)
30792 pragma_omp_clause result
= PRAGMA_OMP_CLAUSE_NONE
;
30794 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
30795 result
= PRAGMA_OACC_CLAUSE_AUTO
;
30796 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_IF
))
30797 result
= PRAGMA_OMP_CLAUSE_IF
;
30798 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DEFAULT
))
30799 result
= PRAGMA_OMP_CLAUSE_DEFAULT
;
30800 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DELETE
))
30801 result
= PRAGMA_OACC_CLAUSE_DELETE
;
30802 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_PRIVATE
))
30803 result
= PRAGMA_OMP_CLAUSE_PRIVATE
;
30804 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
30805 result
= PRAGMA_OMP_CLAUSE_FOR
;
30806 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
30808 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
30809 const char *p
= IDENTIFIER_POINTER (id
);
30814 if (!strcmp ("aligned", p
))
30815 result
= PRAGMA_OMP_CLAUSE_ALIGNED
;
30816 else if (!strcmp ("async", p
))
30817 result
= PRAGMA_OACC_CLAUSE_ASYNC
;
30820 if (!strcmp ("collapse", p
))
30821 result
= PRAGMA_OMP_CLAUSE_COLLAPSE
;
30822 else if (!strcmp ("copy", p
))
30823 result
= PRAGMA_OACC_CLAUSE_COPY
;
30824 else if (!strcmp ("copyin", p
))
30825 result
= PRAGMA_OMP_CLAUSE_COPYIN
;
30826 else if (!strcmp ("copyout", p
))
30827 result
= PRAGMA_OACC_CLAUSE_COPYOUT
;
30828 else if (!strcmp ("copyprivate", p
))
30829 result
= PRAGMA_OMP_CLAUSE_COPYPRIVATE
;
30830 else if (!strcmp ("create", p
))
30831 result
= PRAGMA_OACC_CLAUSE_CREATE
;
30834 if (!strcmp ("defaultmap", p
))
30835 result
= PRAGMA_OMP_CLAUSE_DEFAULTMAP
;
30836 else if (!strcmp ("depend", p
))
30837 result
= PRAGMA_OMP_CLAUSE_DEPEND
;
30838 else if (!strcmp ("device", p
))
30839 result
= PRAGMA_OMP_CLAUSE_DEVICE
;
30840 else if (!strcmp ("deviceptr", p
))
30841 result
= PRAGMA_OACC_CLAUSE_DEVICEPTR
;
30842 else if (!strcmp ("device_resident", p
))
30843 result
= PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT
;
30844 else if (!strcmp ("dist_schedule", p
))
30845 result
= PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
;
30848 if (!strcmp ("final", p
))
30849 result
= PRAGMA_OMP_CLAUSE_FINAL
;
30850 else if (!strcmp ("firstprivate", p
))
30851 result
= PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
;
30852 else if (!strcmp ("from", p
))
30853 result
= PRAGMA_OMP_CLAUSE_FROM
;
30856 if (!strcmp ("gang", p
))
30857 result
= PRAGMA_OACC_CLAUSE_GANG
;
30858 else if (!strcmp ("grainsize", p
))
30859 result
= PRAGMA_OMP_CLAUSE_GRAINSIZE
;
30862 if (!strcmp ("hint", p
))
30863 result
= PRAGMA_OMP_CLAUSE_HINT
;
30864 else if (!strcmp ("host", p
))
30865 result
= PRAGMA_OACC_CLAUSE_HOST
;
30868 if (!strcmp ("inbranch", p
))
30869 result
= PRAGMA_OMP_CLAUSE_INBRANCH
;
30870 else if (!strcmp ("independent", p
))
30871 result
= PRAGMA_OACC_CLAUSE_INDEPENDENT
;
30872 else if (!strcmp ("is_device_ptr", p
))
30873 result
= PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR
;
30876 if (!strcmp ("lastprivate", p
))
30877 result
= PRAGMA_OMP_CLAUSE_LASTPRIVATE
;
30878 else if (!strcmp ("linear", p
))
30879 result
= PRAGMA_OMP_CLAUSE_LINEAR
;
30880 else if (!strcmp ("link", p
))
30881 result
= PRAGMA_OMP_CLAUSE_LINK
;
30884 if (!strcmp ("map", p
))
30885 result
= PRAGMA_OMP_CLAUSE_MAP
;
30886 else if (!strcmp ("mergeable", p
))
30887 result
= PRAGMA_OMP_CLAUSE_MERGEABLE
;
30888 else if (flag_cilkplus
&& !strcmp ("mask", p
))
30889 result
= PRAGMA_CILK_CLAUSE_MASK
;
30892 if (!strcmp ("nogroup", p
))
30893 result
= PRAGMA_OMP_CLAUSE_NOGROUP
;
30894 else if (!strcmp ("notinbranch", p
))
30895 result
= PRAGMA_OMP_CLAUSE_NOTINBRANCH
;
30896 else if (!strcmp ("nowait", p
))
30897 result
= PRAGMA_OMP_CLAUSE_NOWAIT
;
30898 else if (flag_cilkplus
&& !strcmp ("nomask", p
))
30899 result
= PRAGMA_CILK_CLAUSE_NOMASK
;
30900 else if (!strcmp ("num_gangs", p
))
30901 result
= PRAGMA_OACC_CLAUSE_NUM_GANGS
;
30902 else if (!strcmp ("num_tasks", p
))
30903 result
= PRAGMA_OMP_CLAUSE_NUM_TASKS
;
30904 else if (!strcmp ("num_teams", p
))
30905 result
= PRAGMA_OMP_CLAUSE_NUM_TEAMS
;
30906 else if (!strcmp ("num_threads", p
))
30907 result
= PRAGMA_OMP_CLAUSE_NUM_THREADS
;
30908 else if (!strcmp ("num_workers", p
))
30909 result
= PRAGMA_OACC_CLAUSE_NUM_WORKERS
;
30912 if (!strcmp ("ordered", p
))
30913 result
= PRAGMA_OMP_CLAUSE_ORDERED
;
30916 if (!strcmp ("parallel", p
))
30917 result
= PRAGMA_OMP_CLAUSE_PARALLEL
;
30918 else if (!strcmp ("present", p
))
30919 result
= PRAGMA_OACC_CLAUSE_PRESENT
;
30920 else if (!strcmp ("present_or_copy", p
)
30921 || !strcmp ("pcopy", p
))
30922 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY
;
30923 else if (!strcmp ("present_or_copyin", p
)
30924 || !strcmp ("pcopyin", p
))
30925 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN
;
30926 else if (!strcmp ("present_or_copyout", p
)
30927 || !strcmp ("pcopyout", p
))
30928 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT
;
30929 else if (!strcmp ("present_or_create", p
)
30930 || !strcmp ("pcreate", p
))
30931 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE
;
30932 else if (!strcmp ("priority", p
))
30933 result
= PRAGMA_OMP_CLAUSE_PRIORITY
;
30934 else if (!strcmp ("proc_bind", p
))
30935 result
= PRAGMA_OMP_CLAUSE_PROC_BIND
;
30938 if (!strcmp ("reduction", p
))
30939 result
= PRAGMA_OMP_CLAUSE_REDUCTION
;
30942 if (!strcmp ("safelen", p
))
30943 result
= PRAGMA_OMP_CLAUSE_SAFELEN
;
30944 else if (!strcmp ("schedule", p
))
30945 result
= PRAGMA_OMP_CLAUSE_SCHEDULE
;
30946 else if (!strcmp ("sections", p
))
30947 result
= PRAGMA_OMP_CLAUSE_SECTIONS
;
30948 else if (!strcmp ("self", p
))
30949 result
= PRAGMA_OACC_CLAUSE_SELF
;
30950 else if (!strcmp ("seq", p
))
30951 result
= PRAGMA_OACC_CLAUSE_SEQ
;
30952 else if (!strcmp ("shared", p
))
30953 result
= PRAGMA_OMP_CLAUSE_SHARED
;
30954 else if (!strcmp ("simd", p
))
30955 result
= PRAGMA_OMP_CLAUSE_SIMD
;
30956 else if (!strcmp ("simdlen", p
))
30957 result
= PRAGMA_OMP_CLAUSE_SIMDLEN
;
30960 if (!strcmp ("taskgroup", p
))
30961 result
= PRAGMA_OMP_CLAUSE_TASKGROUP
;
30962 else if (!strcmp ("thread_limit", p
))
30963 result
= PRAGMA_OMP_CLAUSE_THREAD_LIMIT
;
30964 else if (!strcmp ("threads", p
))
30965 result
= PRAGMA_OMP_CLAUSE_THREADS
;
30966 else if (!strcmp ("tile", p
))
30967 result
= PRAGMA_OACC_CLAUSE_TILE
;
30968 else if (!strcmp ("to", p
))
30969 result
= PRAGMA_OMP_CLAUSE_TO
;
30972 if (!strcmp ("uniform", p
))
30973 result
= PRAGMA_OMP_CLAUSE_UNIFORM
;
30974 else if (!strcmp ("untied", p
))
30975 result
= PRAGMA_OMP_CLAUSE_UNTIED
;
30976 else if (!strcmp ("use_device", p
))
30977 result
= PRAGMA_OACC_CLAUSE_USE_DEVICE
;
30978 else if (!strcmp ("use_device_ptr", p
))
30979 result
= PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR
;
30982 if (!strcmp ("vector", p
))
30983 result
= PRAGMA_OACC_CLAUSE_VECTOR
;
30984 else if (!strcmp ("vector_length", p
))
30985 result
= PRAGMA_OACC_CLAUSE_VECTOR_LENGTH
;
30986 else if (flag_cilkplus
&& !strcmp ("vectorlength", p
))
30987 result
= PRAGMA_CILK_CLAUSE_VECTORLENGTH
;
30990 if (!strcmp ("wait", p
))
30991 result
= PRAGMA_OACC_CLAUSE_WAIT
;
30992 else if (!strcmp ("worker", p
))
30993 result
= PRAGMA_OACC_CLAUSE_WORKER
;
30998 if (result
!= PRAGMA_OMP_CLAUSE_NONE
)
30999 cp_lexer_consume_token (parser
->lexer
);
31004 /* Validate that a clause of the given type does not already exist. */
31007 check_no_duplicate_clause (tree clauses
, enum omp_clause_code code
,
31008 const char *name
, location_t location
)
31012 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
31013 if (OMP_CLAUSE_CODE (c
) == code
)
31015 error_at (location
, "too many %qs clauses", name
);
31023 variable-list , identifier
31025 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31026 colon). An opening parenthesis will have been consumed by the caller.
31028 If KIND is nonzero, create the appropriate node and install the decl
31029 in OMP_CLAUSE_DECL and add the node to the head of the list.
31031 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31032 return the list created.
31034 COLON can be NULL if only closing parenthesis should end the list,
31035 or pointer to bool which will receive false if the list is terminated
31036 by closing parenthesis or true if the list is terminated by colon. */
31039 cp_parser_omp_var_list_no_open (cp_parser
*parser
, enum omp_clause_code kind
,
31040 tree list
, bool *colon
)
31043 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
31046 parser
->colon_corrects_to_scope_p
= false;
31053 token
= cp_lexer_peek_token (parser
->lexer
);
31055 && current_class_ptr
31056 && cp_parser_is_keyword (token
, RID_THIS
))
31058 decl
= finish_this_expr ();
31059 if (TREE_CODE (decl
) == NON_LVALUE_EXPR
31060 || CONVERT_EXPR_P (decl
))
31061 decl
= TREE_OPERAND (decl
, 0);
31062 cp_lexer_consume_token (parser
->lexer
);
31066 name
= cp_parser_id_expression (parser
, /*template_p=*/false,
31067 /*check_dependency_p=*/true,
31068 /*template_p=*/NULL
,
31069 /*declarator_p=*/false,
31070 /*optional_p=*/false);
31071 if (name
== error_mark_node
)
31074 decl
= cp_parser_lookup_name_simple (parser
, name
, token
->location
);
31075 if (decl
== error_mark_node
)
31076 cp_parser_name_lookup_error (parser
, name
, decl
, NLE_NULL
,
31079 if (decl
== error_mark_node
)
31081 else if (kind
!= 0)
31085 case OMP_CLAUSE__CACHE_
:
31086 /* The OpenACC cache directive explicitly only allows "array
31087 elements or subarrays". */
31088 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_OPEN_SQUARE
)
31090 error_at (token
->location
, "expected %<[%>");
31091 decl
= error_mark_node
;
31095 case OMP_CLAUSE_MAP
:
31096 case OMP_CLAUSE_FROM
:
31097 case OMP_CLAUSE_TO
:
31098 while (cp_lexer_next_token_is (parser
->lexer
, CPP_DOT
))
31101 = cp_lexer_peek_token (parser
->lexer
)->location
;
31102 cp_id_kind idk
= CP_ID_KIND_NONE
;
31103 cp_lexer_consume_token (parser
->lexer
);
31104 decl
= convert_from_reference (decl
);
31106 = cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
,
31111 case OMP_CLAUSE_DEPEND
:
31112 case OMP_CLAUSE_REDUCTION
:
31113 while (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
31115 tree low_bound
= NULL_TREE
, length
= NULL_TREE
;
31117 parser
->colon_corrects_to_scope_p
= false;
31118 cp_lexer_consume_token (parser
->lexer
);
31119 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
31120 low_bound
= cp_parser_expression (parser
);
31122 parser
->colon_corrects_to_scope_p
31123 = saved_colon_corrects_to_scope_p
;
31124 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_SQUARE
))
31125 length
= integer_one_node
;
31128 /* Look for `:'. */
31129 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
31131 if (!cp_lexer_next_token_is (parser
->lexer
,
31133 length
= cp_parser_expression (parser
);
31135 /* Look for the closing `]'. */
31136 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
,
31140 decl
= tree_cons (low_bound
, length
, decl
);
31147 tree u
= build_omp_clause (token
->location
, kind
);
31148 OMP_CLAUSE_DECL (u
) = decl
;
31149 OMP_CLAUSE_CHAIN (u
) = list
;
31153 list
= tree_cons (decl
, NULL_TREE
, list
);
31156 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
31158 cp_lexer_consume_token (parser
->lexer
);
31162 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
31164 if (colon
!= NULL
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
31167 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
31171 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31175 /* Try to resync to an unnested comma. Copied from
31176 cp_parser_parenthesized_expression_list. */
31179 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
31180 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
31181 /*recovering=*/true,
31183 /*consume_paren=*/true);
31191 /* Similarly, but expect leading and trailing parenthesis. This is a very
31192 common case for omp clauses. */
31195 cp_parser_omp_var_list (cp_parser
*parser
, enum omp_clause_code kind
, tree list
)
31197 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31198 return cp_parser_omp_var_list_no_open (parser
, kind
, list
, NULL
);
31203 copy ( variable-list )
31204 copyin ( variable-list )
31205 copyout ( variable-list )
31206 create ( variable-list )
31207 delete ( variable-list )
31208 present ( variable-list )
31209 present_or_copy ( variable-list )
31210 pcopy ( variable-list )
31211 present_or_copyin ( variable-list )
31212 pcopyin ( variable-list )
31213 present_or_copyout ( variable-list )
31214 pcopyout ( variable-list )
31215 present_or_create ( variable-list )
31216 pcreate ( variable-list ) */
31219 cp_parser_oacc_data_clause (cp_parser
*parser
, pragma_omp_clause c_kind
,
31222 enum gomp_map_kind kind
;
31225 case PRAGMA_OACC_CLAUSE_COPY
:
31226 kind
= GOMP_MAP_FORCE_TOFROM
;
31228 case PRAGMA_OACC_CLAUSE_COPYIN
:
31229 kind
= GOMP_MAP_FORCE_TO
;
31231 case PRAGMA_OACC_CLAUSE_COPYOUT
:
31232 kind
= GOMP_MAP_FORCE_FROM
;
31234 case PRAGMA_OACC_CLAUSE_CREATE
:
31235 kind
= GOMP_MAP_FORCE_ALLOC
;
31237 case PRAGMA_OACC_CLAUSE_DELETE
:
31238 kind
= GOMP_MAP_DELETE
;
31240 case PRAGMA_OACC_CLAUSE_DEVICE
:
31241 kind
= GOMP_MAP_FORCE_TO
;
31243 case PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT
:
31244 kind
= GOMP_MAP_DEVICE_RESIDENT
;
31246 case PRAGMA_OACC_CLAUSE_HOST
:
31247 case PRAGMA_OACC_CLAUSE_SELF
:
31248 kind
= GOMP_MAP_FORCE_FROM
;
31250 case PRAGMA_OACC_CLAUSE_LINK
:
31251 kind
= GOMP_MAP_LINK
;
31253 case PRAGMA_OACC_CLAUSE_PRESENT
:
31254 kind
= GOMP_MAP_FORCE_PRESENT
;
31256 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY
:
31257 kind
= GOMP_MAP_TOFROM
;
31259 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN
:
31260 kind
= GOMP_MAP_TO
;
31262 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT
:
31263 kind
= GOMP_MAP_FROM
;
31265 case PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE
:
31266 kind
= GOMP_MAP_ALLOC
;
31269 gcc_unreachable ();
31272 nl
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_MAP
, list
);
31274 for (c
= nl
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
31275 OMP_CLAUSE_SET_MAP_KIND (c
, kind
);
31281 deviceptr ( variable-list ) */
31284 cp_parser_oacc_data_clause_deviceptr (cp_parser
*parser
, tree list
)
31286 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
31289 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31290 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31291 variable-list must only allow for pointer variables. */
31292 vars
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
31293 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
31295 tree v
= TREE_PURPOSE (t
);
31296 tree u
= build_omp_clause (loc
, OMP_CLAUSE_MAP
);
31297 OMP_CLAUSE_SET_MAP_KIND (u
, GOMP_MAP_FORCE_DEVICEPTR
);
31298 OMP_CLAUSE_DECL (u
) = v
;
31299 OMP_CLAUSE_CHAIN (u
) = list
;
31313 cp_parser_oacc_simple_clause (cp_parser
* /* parser */,
31314 enum omp_clause_code code
,
31315 tree list
, location_t location
)
31317 check_no_duplicate_clause (list
, code
, omp_clause_code_name
[code
], location
);
31318 tree c
= build_omp_clause (location
, code
);
31319 OMP_CLAUSE_CHAIN (c
) = list
;
31324 num_gangs ( expression )
31325 num_workers ( expression )
31326 vector_length ( expression ) */
31329 cp_parser_oacc_single_int_clause (cp_parser
*parser
, omp_clause_code code
,
31330 const char *str
, tree list
)
31332 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
31334 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31337 tree t
= cp_parser_assignment_expression (parser
, NULL
, false, false);
31339 if (t
== error_mark_node
31340 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31342 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31343 /*or_comma=*/false,
31344 /*consume_paren=*/true);
31348 check_no_duplicate_clause (list
, code
, str
, loc
);
31350 tree c
= build_omp_clause (loc
, code
);
31351 OMP_CLAUSE_OPERAND (c
, 0) = t
;
31352 OMP_CLAUSE_CHAIN (c
) = list
;
31358 gang [( gang-arg-list )]
31359 worker [( [num:] int-expr )]
31360 vector [( [length:] int-expr )]
31362 where gang-arg is one of:
31367 and size-expr may be:
31374 cp_parser_oacc_shape_clause (cp_parser
*parser
, omp_clause_code kind
,
31375 const char *str
, tree list
)
31377 const char *id
= "num";
31378 cp_lexer
*lexer
= parser
->lexer
;
31379 tree ops
[2] = { NULL_TREE
, NULL_TREE
}, c
;
31380 location_t loc
= cp_lexer_peek_token (lexer
)->location
;
31382 if (kind
== OMP_CLAUSE_VECTOR
)
31385 if (cp_lexer_next_token_is (lexer
, CPP_OPEN_PAREN
))
31387 cp_lexer_consume_token (lexer
);
31391 cp_token
*next
= cp_lexer_peek_token (lexer
);
31394 /* Gang static argument. */
31395 if (kind
== OMP_CLAUSE_GANG
31396 && cp_lexer_next_token_is_keyword (lexer
, RID_STATIC
))
31398 cp_lexer_consume_token (lexer
);
31400 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
31401 goto cleanup_error
;
31404 if (ops
[idx
] != NULL
)
31406 cp_parser_error (parser
, "too many %<static%> arguments");
31407 goto cleanup_error
;
31410 /* Check for the '*' argument. */
31411 if (cp_lexer_next_token_is (lexer
, CPP_MULT
)
31412 && (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_COMMA
)
31413 || cp_lexer_nth_token_is (parser
->lexer
, 2,
31416 cp_lexer_consume_token (lexer
);
31417 ops
[idx
] = integer_minus_one_node
;
31419 if (cp_lexer_next_token_is (lexer
, CPP_COMMA
))
31421 cp_lexer_consume_token (lexer
);
31427 /* Worker num: argument and vector length: arguments. */
31428 else if (cp_lexer_next_token_is (lexer
, CPP_NAME
)
31429 && id_equal (next
->u
.value
, id
)
31430 && cp_lexer_nth_token_is (lexer
, 2, CPP_COLON
))
31432 cp_lexer_consume_token (lexer
); /* id */
31433 cp_lexer_consume_token (lexer
); /* ':' */
31436 /* Now collect the actual argument. */
31437 if (ops
[idx
] != NULL_TREE
)
31439 cp_parser_error (parser
, "unexpected argument");
31440 goto cleanup_error
;
31443 tree expr
= cp_parser_assignment_expression (parser
, NULL
, false,
31445 if (expr
== error_mark_node
)
31446 goto cleanup_error
;
31448 mark_exp_read (expr
);
31451 if (kind
== OMP_CLAUSE_GANG
31452 && cp_lexer_next_token_is (lexer
, CPP_COMMA
))
31454 cp_lexer_consume_token (lexer
);
31461 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31462 goto cleanup_error
;
31465 check_no_duplicate_clause (list
, kind
, str
, loc
);
31467 c
= build_omp_clause (loc
, kind
);
31470 OMP_CLAUSE_OPERAND (c
, 1) = ops
[1];
31472 OMP_CLAUSE_OPERAND (c
, 0) = ops
[0];
31473 OMP_CLAUSE_CHAIN (c
) = list
;
31478 cp_parser_skip_to_closing_parenthesis (parser
, false, false, true);
31483 tile ( size-expr-list ) */
31486 cp_parser_oacc_clause_tile (cp_parser
*parser
, location_t clause_loc
, tree list
)
31488 tree c
, expr
= error_mark_node
;
31489 tree tile
= NULL_TREE
;
31491 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31492 so, but the spec authors never considered such a case and have
31493 differing opinions on what it might mean, including 'not
31495 check_no_duplicate_clause (list
, OMP_CLAUSE_TILE
, "tile", clause_loc
);
31496 check_no_duplicate_clause (list
, OMP_CLAUSE_COLLAPSE
, "collapse",
31499 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31504 if (tile
&& !cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
))
31507 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
)
31508 && (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_COMMA
)
31509 || cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_CLOSE_PAREN
)))
31511 cp_lexer_consume_token (parser
->lexer
);
31512 expr
= integer_zero_node
;
31515 expr
= cp_parser_constant_expression (parser
);
31517 tile
= tree_cons (NULL_TREE
, expr
, tile
);
31519 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
));
31521 /* Consume the trailing ')'. */
31522 cp_lexer_consume_token (parser
->lexer
);
31524 c
= build_omp_clause (clause_loc
, OMP_CLAUSE_TILE
);
31525 tile
= nreverse (tile
);
31526 OMP_CLAUSE_TILE_LIST (c
) = tile
;
31527 OMP_CLAUSE_CHAIN (c
) = list
;
31532 Parse wait clause or directive parameters. */
31535 cp_parser_oacc_wait_list (cp_parser
*parser
, location_t clause_loc
, tree list
)
31537 vec
<tree
, va_gc
> *args
;
31540 args
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
31542 /*allow_expansion_p=*/true,
31543 /*non_constant_p=*/NULL
);
31545 if (args
== NULL
|| args
->length () == 0)
31547 cp_parser_error (parser
, "expected integer expression before ')'");
31549 release_tree_vector (args
);
31553 args_tree
= build_tree_list_vec (args
);
31555 release_tree_vector (args
);
31557 for (t
= args_tree
; t
; t
= TREE_CHAIN (t
))
31559 tree targ
= TREE_VALUE (t
);
31561 if (targ
!= error_mark_node
)
31563 if (!INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
31564 error ("%<wait%> expression must be integral");
31567 tree c
= build_omp_clause (clause_loc
, OMP_CLAUSE_WAIT
);
31569 mark_rvalue_use (targ
);
31570 OMP_CLAUSE_DECL (c
) = targ
;
31571 OMP_CLAUSE_CHAIN (c
) = list
;
31581 wait ( int-expr-list ) */
31584 cp_parser_oacc_clause_wait (cp_parser
*parser
, tree list
)
31586 location_t location
= cp_lexer_peek_token (parser
->lexer
)->location
;
31588 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_OPEN_PAREN
)
31591 list
= cp_parser_oacc_wait_list (parser
, location
, list
);
31597 collapse ( constant-expression ) */
31600 cp_parser_omp_clause_collapse (cp_parser
*parser
, tree list
, location_t location
)
31606 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
31607 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31610 num
= cp_parser_constant_expression (parser
);
31612 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31613 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31614 /*or_comma=*/false,
31615 /*consume_paren=*/true);
31617 if (num
== error_mark_node
)
31619 num
= fold_non_dependent_expr (num
);
31620 if (!tree_fits_shwi_p (num
)
31621 || !INTEGRAL_TYPE_P (TREE_TYPE (num
))
31622 || (n
= tree_to_shwi (num
)) <= 0
31625 error_at (loc
, "collapse argument needs positive constant integer expression");
31629 check_no_duplicate_clause (list
, OMP_CLAUSE_COLLAPSE
, "collapse", location
);
31630 check_no_duplicate_clause (list
, OMP_CLAUSE_TILE
, "tile", location
);
31631 c
= build_omp_clause (loc
, OMP_CLAUSE_COLLAPSE
);
31632 OMP_CLAUSE_CHAIN (c
) = list
;
31633 OMP_CLAUSE_COLLAPSE_EXPR (c
) = num
;
31639 default ( none | shared )
31642 default ( none | present ) */
31645 cp_parser_omp_clause_default (cp_parser
*parser
, tree list
,
31646 location_t location
, bool is_oacc
)
31648 enum omp_clause_default_kind kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
31651 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31653 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31655 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31656 const char *p
= IDENTIFIER_POINTER (id
);
31661 if (strcmp ("none", p
) != 0)
31663 kind
= OMP_CLAUSE_DEFAULT_NONE
;
31667 if (strcmp ("present", p
) != 0 || !is_oacc
)
31669 kind
= OMP_CLAUSE_DEFAULT_PRESENT
;
31673 if (strcmp ("shared", p
) != 0 || is_oacc
)
31675 kind
= OMP_CLAUSE_DEFAULT_SHARED
;
31682 cp_lexer_consume_token (parser
->lexer
);
31688 cp_parser_error (parser
, "expected %<none%> or %<present%>");
31690 cp_parser_error (parser
, "expected %<none%> or %<shared%>");
31693 if (kind
== OMP_CLAUSE_DEFAULT_UNSPECIFIED
31694 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31695 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31696 /*or_comma=*/false,
31697 /*consume_paren=*/true);
31699 if (kind
== OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
31702 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULT
, "default", location
);
31703 c
= build_omp_clause (location
, OMP_CLAUSE_DEFAULT
);
31704 OMP_CLAUSE_CHAIN (c
) = list
;
31705 OMP_CLAUSE_DEFAULT_KIND (c
) = kind
;
31711 final ( expression ) */
31714 cp_parser_omp_clause_final (cp_parser
*parser
, tree list
, location_t location
)
31718 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31721 t
= cp_parser_condition (parser
);
31723 if (t
== error_mark_node
31724 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31725 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31726 /*or_comma=*/false,
31727 /*consume_paren=*/true);
31729 check_no_duplicate_clause (list
, OMP_CLAUSE_FINAL
, "final", location
);
31731 c
= build_omp_clause (location
, OMP_CLAUSE_FINAL
);
31732 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
31733 OMP_CLAUSE_CHAIN (c
) = list
;
31742 if ( directive-name-modifier : expression )
31744 directive-name-modifier:
31745 parallel | task | taskloop | target data | target | target update
31746 | target enter data | target exit data */
31749 cp_parser_omp_clause_if (cp_parser
*parser
, tree list
, location_t location
,
31753 enum tree_code if_modifier
= ERROR_MARK
;
31755 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31758 if (is_omp
&& cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31760 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31761 const char *p
= IDENTIFIER_POINTER (id
);
31764 if (strcmp ("parallel", p
) == 0)
31765 if_modifier
= OMP_PARALLEL
;
31766 else if (strcmp ("task", p
) == 0)
31767 if_modifier
= OMP_TASK
;
31768 else if (strcmp ("taskloop", p
) == 0)
31769 if_modifier
= OMP_TASKLOOP
;
31770 else if (strcmp ("target", p
) == 0)
31772 if_modifier
= OMP_TARGET
;
31773 if (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_NAME
))
31775 id
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->u
.value
;
31776 p
= IDENTIFIER_POINTER (id
);
31777 if (strcmp ("data", p
) == 0)
31778 if_modifier
= OMP_TARGET_DATA
;
31779 else if (strcmp ("update", p
) == 0)
31780 if_modifier
= OMP_TARGET_UPDATE
;
31781 else if (strcmp ("enter", p
) == 0)
31782 if_modifier
= OMP_TARGET_ENTER_DATA
;
31783 else if (strcmp ("exit", p
) == 0)
31784 if_modifier
= OMP_TARGET_EXIT_DATA
;
31785 if (if_modifier
!= OMP_TARGET
)
31790 = cp_lexer_peek_nth_token (parser
->lexer
, 2)->location
;
31791 error_at (loc
, "expected %<data%>, %<update%>, %<enter%> "
31793 if_modifier
= ERROR_MARK
;
31795 if (if_modifier
== OMP_TARGET_ENTER_DATA
31796 || if_modifier
== OMP_TARGET_EXIT_DATA
)
31798 if (cp_lexer_nth_token_is (parser
->lexer
, 3, CPP_NAME
))
31800 id
= cp_lexer_peek_nth_token (parser
->lexer
, 3)->u
.value
;
31801 p
= IDENTIFIER_POINTER (id
);
31802 if (strcmp ("data", p
) == 0)
31808 = cp_lexer_peek_nth_token (parser
->lexer
, 3)->location
;
31809 error_at (loc
, "expected %<data%>");
31810 if_modifier
= ERROR_MARK
;
31815 if (if_modifier
!= ERROR_MARK
)
31817 if (cp_lexer_nth_token_is (parser
->lexer
, n
, CPP_COLON
))
31820 cp_lexer_consume_token (parser
->lexer
);
31827 = cp_lexer_peek_nth_token (parser
->lexer
, n
)->location
;
31828 error_at (loc
, "expected %<:%>");
31830 if_modifier
= ERROR_MARK
;
31835 t
= cp_parser_condition (parser
);
31837 if (t
== error_mark_node
31838 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31839 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31840 /*or_comma=*/false,
31841 /*consume_paren=*/true);
31843 for (c
= list
; c
; c
= OMP_CLAUSE_CHAIN (c
))
31844 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IF
)
31846 if (if_modifier
!= ERROR_MARK
31847 && OMP_CLAUSE_IF_MODIFIER (c
) == if_modifier
)
31849 const char *p
= NULL
;
31850 switch (if_modifier
)
31852 case OMP_PARALLEL
: p
= "parallel"; break;
31853 case OMP_TASK
: p
= "task"; break;
31854 case OMP_TASKLOOP
: p
= "taskloop"; break;
31855 case OMP_TARGET_DATA
: p
= "target data"; break;
31856 case OMP_TARGET
: p
= "target"; break;
31857 case OMP_TARGET_UPDATE
: p
= "target update"; break;
31858 case OMP_TARGET_ENTER_DATA
: p
= "enter data"; break;
31859 case OMP_TARGET_EXIT_DATA
: p
= "exit data"; break;
31860 default: gcc_unreachable ();
31862 error_at (location
, "too many %<if%> clauses with %qs modifier",
31866 else if (OMP_CLAUSE_IF_MODIFIER (c
) == if_modifier
)
31869 error_at (location
, "too many %<if%> clauses");
31871 error_at (location
, "too many %<if%> clauses without modifier");
31874 else if (if_modifier
== ERROR_MARK
31875 || OMP_CLAUSE_IF_MODIFIER (c
) == ERROR_MARK
)
31877 error_at (location
, "if any %<if%> clause has modifier, then all "
31878 "%<if%> clauses have to use modifier");
31883 c
= build_omp_clause (location
, OMP_CLAUSE_IF
);
31884 OMP_CLAUSE_IF_MODIFIER (c
) = if_modifier
;
31885 OMP_CLAUSE_IF_EXPR (c
) = t
;
31886 OMP_CLAUSE_CHAIN (c
) = list
;
31895 cp_parser_omp_clause_mergeable (cp_parser
* /*parser*/,
31896 tree list
, location_t location
)
31900 check_no_duplicate_clause (list
, OMP_CLAUSE_MERGEABLE
, "mergeable",
31903 c
= build_omp_clause (location
, OMP_CLAUSE_MERGEABLE
);
31904 OMP_CLAUSE_CHAIN (c
) = list
;
31912 cp_parser_omp_clause_nowait (cp_parser
* /*parser*/,
31913 tree list
, location_t location
)
31917 check_no_duplicate_clause (list
, OMP_CLAUSE_NOWAIT
, "nowait", location
);
31919 c
= build_omp_clause (location
, OMP_CLAUSE_NOWAIT
);
31920 OMP_CLAUSE_CHAIN (c
) = list
;
31925 num_threads ( expression ) */
31928 cp_parser_omp_clause_num_threads (cp_parser
*parser
, tree list
,
31929 location_t location
)
31933 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31936 t
= cp_parser_expression (parser
);
31938 if (t
== error_mark_node
31939 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31940 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31941 /*or_comma=*/false,
31942 /*consume_paren=*/true);
31944 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_THREADS
,
31945 "num_threads", location
);
31947 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_THREADS
);
31948 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
31949 OMP_CLAUSE_CHAIN (c
) = list
;
31955 num_tasks ( expression ) */
31958 cp_parser_omp_clause_num_tasks (cp_parser
*parser
, tree list
,
31959 location_t location
)
31963 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31966 t
= cp_parser_expression (parser
);
31968 if (t
== error_mark_node
31969 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31970 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31971 /*or_comma=*/false,
31972 /*consume_paren=*/true);
31974 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_TASKS
,
31975 "num_tasks", location
);
31977 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_TASKS
);
31978 OMP_CLAUSE_NUM_TASKS_EXPR (c
) = t
;
31979 OMP_CLAUSE_CHAIN (c
) = list
;
31985 grainsize ( expression ) */
31988 cp_parser_omp_clause_grainsize (cp_parser
*parser
, tree list
,
31989 location_t location
)
31993 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31996 t
= cp_parser_expression (parser
);
31998 if (t
== error_mark_node
31999 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32000 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32001 /*or_comma=*/false,
32002 /*consume_paren=*/true);
32004 check_no_duplicate_clause (list
, OMP_CLAUSE_GRAINSIZE
,
32005 "grainsize", location
);
32007 c
= build_omp_clause (location
, OMP_CLAUSE_GRAINSIZE
);
32008 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
32009 OMP_CLAUSE_CHAIN (c
) = list
;
32015 priority ( expression ) */
32018 cp_parser_omp_clause_priority (cp_parser
*parser
, tree list
,
32019 location_t location
)
32023 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32026 t
= cp_parser_expression (parser
);
32028 if (t
== error_mark_node
32029 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32030 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32031 /*or_comma=*/false,
32032 /*consume_paren=*/true);
32034 check_no_duplicate_clause (list
, OMP_CLAUSE_PRIORITY
,
32035 "priority", location
);
32037 c
= build_omp_clause (location
, OMP_CLAUSE_PRIORITY
);
32038 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
32039 OMP_CLAUSE_CHAIN (c
) = list
;
32045 hint ( expression ) */
32048 cp_parser_omp_clause_hint (cp_parser
*parser
, tree list
,
32049 location_t location
)
32053 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32056 t
= cp_parser_expression (parser
);
32058 if (t
== error_mark_node
32059 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32060 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32061 /*or_comma=*/false,
32062 /*consume_paren=*/true);
32064 check_no_duplicate_clause (list
, OMP_CLAUSE_HINT
, "hint", location
);
32066 c
= build_omp_clause (location
, OMP_CLAUSE_HINT
);
32067 OMP_CLAUSE_HINT_EXPR (c
) = t
;
32068 OMP_CLAUSE_CHAIN (c
) = list
;
32074 defaultmap ( tofrom : scalar ) */
32077 cp_parser_omp_clause_defaultmap (cp_parser
*parser
, tree list
,
32078 location_t location
)
32083 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32086 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32088 cp_parser_error (parser
, "expected %<tofrom%>");
32091 id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32092 p
= IDENTIFIER_POINTER (id
);
32093 if (strcmp (p
, "tofrom") != 0)
32095 cp_parser_error (parser
, "expected %<tofrom%>");
32098 cp_lexer_consume_token (parser
->lexer
);
32099 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
32102 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32104 cp_parser_error (parser
, "expected %<scalar%>");
32107 id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32108 p
= IDENTIFIER_POINTER (id
);
32109 if (strcmp (p
, "scalar") != 0)
32111 cp_parser_error (parser
, "expected %<scalar%>");
32114 cp_lexer_consume_token (parser
->lexer
);
32115 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32118 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULTMAP
, "defaultmap",
32121 c
= build_omp_clause (location
, OMP_CLAUSE_DEFAULTMAP
);
32122 OMP_CLAUSE_CHAIN (c
) = list
;
32126 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32127 /*or_comma=*/false,
32128 /*consume_paren=*/true);
32136 ordered ( constant-expression ) */
32139 cp_parser_omp_clause_ordered (cp_parser
*parser
,
32140 tree list
, location_t location
)
32142 tree c
, num
= NULL_TREE
;
32145 check_no_duplicate_clause (list
, OMP_CLAUSE_ORDERED
,
32146 "ordered", location
);
32148 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
32150 cp_lexer_consume_token (parser
->lexer
);
32152 num
= cp_parser_constant_expression (parser
);
32154 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32155 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32156 /*or_comma=*/false,
32157 /*consume_paren=*/true);
32159 if (num
== error_mark_node
)
32161 num
= fold_non_dependent_expr (num
);
32162 if (!tree_fits_shwi_p (num
)
32163 || !INTEGRAL_TYPE_P (TREE_TYPE (num
))
32164 || (n
= tree_to_shwi (num
)) <= 0
32167 error_at (location
,
32168 "ordered argument needs positive constant integer "
32174 c
= build_omp_clause (location
, OMP_CLAUSE_ORDERED
);
32175 OMP_CLAUSE_ORDERED_EXPR (c
) = num
;
32176 OMP_CLAUSE_CHAIN (c
) = list
;
32181 reduction ( reduction-operator : variable-list )
32183 reduction-operator:
32184 One of: + * - & ^ | && ||
32188 reduction-operator:
32189 One of: + * - & ^ | && || min max
32193 reduction-operator:
32194 One of: + * - & ^ | && ||
32198 cp_parser_omp_clause_reduction (cp_parser
*parser
, tree list
)
32200 enum tree_code code
= ERROR_MARK
;
32201 tree nlist
, c
, id
= NULL_TREE
;
32203 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32206 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
32208 case CPP_PLUS
: code
= PLUS_EXPR
; break;
32209 case CPP_MULT
: code
= MULT_EXPR
; break;
32210 case CPP_MINUS
: code
= MINUS_EXPR
; break;
32211 case CPP_AND
: code
= BIT_AND_EXPR
; break;
32212 case CPP_XOR
: code
= BIT_XOR_EXPR
; break;
32213 case CPP_OR
: code
= BIT_IOR_EXPR
; break;
32214 case CPP_AND_AND
: code
= TRUTH_ANDIF_EXPR
; break;
32215 case CPP_OR_OR
: code
= TRUTH_ORIF_EXPR
; break;
32219 if (code
!= ERROR_MARK
)
32220 cp_lexer_consume_token (parser
->lexer
);
32223 bool saved_colon_corrects_to_scope_p
;
32224 saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
32225 parser
->colon_corrects_to_scope_p
= false;
32226 id
= cp_parser_id_expression (parser
, /*template_p=*/false,
32227 /*check_dependency_p=*/true,
32228 /*template_p=*/NULL
,
32229 /*declarator_p=*/false,
32230 /*optional_p=*/false);
32231 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
32232 if (identifier_p (id
))
32234 const char *p
= IDENTIFIER_POINTER (id
);
32236 if (strcmp (p
, "min") == 0)
32238 else if (strcmp (p
, "max") == 0)
32240 else if (id
== cp_operator_id (PLUS_EXPR
))
32242 else if (id
== cp_operator_id (MULT_EXPR
))
32244 else if (id
== cp_operator_id (MINUS_EXPR
))
32246 else if (id
== cp_operator_id (BIT_AND_EXPR
))
32247 code
= BIT_AND_EXPR
;
32248 else if (id
== cp_operator_id (BIT_IOR_EXPR
))
32249 code
= BIT_IOR_EXPR
;
32250 else if (id
== cp_operator_id (BIT_XOR_EXPR
))
32251 code
= BIT_XOR_EXPR
;
32252 else if (id
== cp_operator_id (TRUTH_ANDIF_EXPR
))
32253 code
= TRUTH_ANDIF_EXPR
;
32254 else if (id
== cp_operator_id (TRUTH_ORIF_EXPR
))
32255 code
= TRUTH_ORIF_EXPR
;
32256 id
= omp_reduction_id (code
, id
, NULL_TREE
);
32257 tree scope
= parser
->scope
;
32259 id
= build_qualified_name (NULL_TREE
, scope
, id
, false);
32260 parser
->scope
= NULL_TREE
;
32261 parser
->qualifying_scope
= NULL_TREE
;
32262 parser
->object_scope
= NULL_TREE
;
32266 error ("invalid reduction-identifier");
32268 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32269 /*or_comma=*/false,
32270 /*consume_paren=*/true);
32275 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
32278 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_REDUCTION
, list
,
32280 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
32282 OMP_CLAUSE_REDUCTION_CODE (c
) = code
;
32283 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = id
;
32290 schedule ( schedule-kind )
32291 schedule ( schedule-kind , expression )
32294 static | dynamic | guided | runtime | auto
32297 schedule ( schedule-modifier : schedule-kind )
32298 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32306 cp_parser_omp_clause_schedule (cp_parser
*parser
, tree list
, location_t location
)
32309 int modifiers
= 0, nmodifiers
= 0;
32311 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32314 c
= build_omp_clause (location
, OMP_CLAUSE_SCHEDULE
);
32316 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32318 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32319 const char *p
= IDENTIFIER_POINTER (id
);
32320 if (strcmp ("simd", p
) == 0)
32321 OMP_CLAUSE_SCHEDULE_SIMD (c
) = 1;
32322 else if (strcmp ("monotonic", p
) == 0)
32323 modifiers
|= OMP_CLAUSE_SCHEDULE_MONOTONIC
;
32324 else if (strcmp ("nonmonotonic", p
) == 0)
32325 modifiers
|= OMP_CLAUSE_SCHEDULE_NONMONOTONIC
;
32328 cp_lexer_consume_token (parser
->lexer
);
32329 if (nmodifiers
++ == 0
32330 && cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
32331 cp_lexer_consume_token (parser
->lexer
);
32334 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
32339 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32341 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32342 const char *p
= IDENTIFIER_POINTER (id
);
32347 if (strcmp ("dynamic", p
) != 0)
32349 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_DYNAMIC
;
32353 if (strcmp ("guided", p
) != 0)
32355 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_GUIDED
;
32359 if (strcmp ("runtime", p
) != 0)
32361 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_RUNTIME
;
32368 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
32369 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_STATIC
;
32370 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
32371 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_AUTO
;
32374 cp_lexer_consume_token (parser
->lexer
);
32376 if ((modifiers
& (OMP_CLAUSE_SCHEDULE_MONOTONIC
32377 | OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
32378 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32379 | OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
32381 error_at (location
, "both %<monotonic%> and %<nonmonotonic%> modifiers "
32386 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
32389 cp_lexer_consume_token (parser
->lexer
);
32391 token
= cp_lexer_peek_token (parser
->lexer
);
32392 t
= cp_parser_assignment_expression (parser
);
32394 if (t
== error_mark_node
)
32396 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_RUNTIME
)
32397 error_at (token
->location
, "schedule %<runtime%> does not take "
32398 "a %<chunk_size%> parameter");
32399 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_AUTO
)
32400 error_at (token
->location
, "schedule %<auto%> does not take "
32401 "a %<chunk_size%> parameter");
32403 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
32405 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32408 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
32411 OMP_CLAUSE_SCHEDULE_KIND (c
)
32412 = (enum omp_clause_schedule_kind
)
32413 (OMP_CLAUSE_SCHEDULE_KIND (c
) | modifiers
);
32415 check_no_duplicate_clause (list
, OMP_CLAUSE_SCHEDULE
, "schedule", location
);
32416 OMP_CLAUSE_CHAIN (c
) = list
;
32420 cp_parser_error (parser
, "invalid schedule kind");
32422 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32423 /*or_comma=*/false,
32424 /*consume_paren=*/true);
32432 cp_parser_omp_clause_untied (cp_parser
* /*parser*/,
32433 tree list
, location_t location
)
32437 check_no_duplicate_clause (list
, OMP_CLAUSE_UNTIED
, "untied", location
);
32439 c
= build_omp_clause (location
, OMP_CLAUSE_UNTIED
);
32440 OMP_CLAUSE_CHAIN (c
) = list
;
32449 cp_parser_omp_clause_branch (cp_parser
* /*parser*/, enum omp_clause_code code
,
32450 tree list
, location_t location
)
32452 check_no_duplicate_clause (list
, code
, omp_clause_code_name
[code
], location
);
32453 tree c
= build_omp_clause (location
, code
);
32454 OMP_CLAUSE_CHAIN (c
) = list
;
32465 cp_parser_omp_clause_cancelkind (cp_parser
* /*parser*/,
32466 enum omp_clause_code code
,
32467 tree list
, location_t location
)
32469 tree c
= build_omp_clause (location
, code
);
32470 OMP_CLAUSE_CHAIN (c
) = list
;
32478 cp_parser_omp_clause_nogroup (cp_parser
* /*parser*/,
32479 tree list
, location_t location
)
32481 check_no_duplicate_clause (list
, OMP_CLAUSE_NOGROUP
, "nogroup", location
);
32482 tree c
= build_omp_clause (location
, OMP_CLAUSE_NOGROUP
);
32483 OMP_CLAUSE_CHAIN (c
) = list
;
32492 cp_parser_omp_clause_orderedkind (cp_parser
* /*parser*/,
32493 enum omp_clause_code code
,
32494 tree list
, location_t location
)
32496 check_no_duplicate_clause (list
, code
, omp_clause_code_name
[code
], location
);
32497 tree c
= build_omp_clause (location
, code
);
32498 OMP_CLAUSE_CHAIN (c
) = list
;
32503 num_teams ( expression ) */
32506 cp_parser_omp_clause_num_teams (cp_parser
*parser
, tree list
,
32507 location_t location
)
32511 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32514 t
= cp_parser_expression (parser
);
32516 if (t
== error_mark_node
32517 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32518 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32519 /*or_comma=*/false,
32520 /*consume_paren=*/true);
32522 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_TEAMS
,
32523 "num_teams", location
);
32525 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_TEAMS
);
32526 OMP_CLAUSE_NUM_TEAMS_EXPR (c
) = t
;
32527 OMP_CLAUSE_CHAIN (c
) = list
;
32533 thread_limit ( expression ) */
32536 cp_parser_omp_clause_thread_limit (cp_parser
*parser
, tree list
,
32537 location_t location
)
32541 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32544 t
= cp_parser_expression (parser
);
32546 if (t
== error_mark_node
32547 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32548 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32549 /*or_comma=*/false,
32550 /*consume_paren=*/true);
32552 check_no_duplicate_clause (list
, OMP_CLAUSE_THREAD_LIMIT
,
32553 "thread_limit", location
);
32555 c
= build_omp_clause (location
, OMP_CLAUSE_THREAD_LIMIT
);
32556 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
32557 OMP_CLAUSE_CHAIN (c
) = list
;
32563 aligned ( variable-list )
32564 aligned ( variable-list : constant-expression ) */
32567 cp_parser_omp_clause_aligned (cp_parser
*parser
, tree list
)
32569 tree nlist
, c
, alignment
= NULL_TREE
;
32572 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32575 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_ALIGNED
, list
,
32580 alignment
= cp_parser_constant_expression (parser
);
32582 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32583 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32584 /*or_comma=*/false,
32585 /*consume_paren=*/true);
32587 if (alignment
== error_mark_node
)
32588 alignment
= NULL_TREE
;
32591 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
32592 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = alignment
;
32598 linear ( variable-list )
32599 linear ( variable-list : expression )
32602 linear ( modifier ( variable-list ) )
32603 linear ( modifier ( variable-list ) : expression ) */
32606 cp_parser_omp_clause_linear (cp_parser
*parser
, tree list
,
32607 bool is_cilk_simd_fn
, bool declare_simd
)
32609 tree nlist
, c
, step
= integer_one_node
;
32611 enum omp_clause_linear_kind kind
= OMP_CLAUSE_LINEAR_DEFAULT
;
32613 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32616 if (!is_cilk_simd_fn
32617 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32619 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32620 const char *p
= IDENTIFIER_POINTER (id
);
32622 if (strcmp ("ref", p
) == 0)
32623 kind
= OMP_CLAUSE_LINEAR_REF
;
32624 else if (strcmp ("val", p
) == 0)
32625 kind
= OMP_CLAUSE_LINEAR_VAL
;
32626 else if (strcmp ("uval", p
) == 0)
32627 kind
= OMP_CLAUSE_LINEAR_UVAL
;
32628 if (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_OPEN_PAREN
))
32629 cp_lexer_consume_token (parser
->lexer
);
32631 kind
= OMP_CLAUSE_LINEAR_DEFAULT
;
32634 if (kind
== OMP_CLAUSE_LINEAR_DEFAULT
)
32635 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_LINEAR
, list
,
32639 nlist
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LINEAR
, list
);
32640 colon
= cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
);
32642 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
32643 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32644 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32645 /*or_comma=*/false,
32646 /*consume_paren=*/true);
32653 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
32654 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_CLOSE_PAREN
))
32656 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
32657 cp_parser_parse_tentatively (parser
);
32658 step
= cp_parser_id_expression (parser
, /*template_p=*/false,
32659 /*check_dependency_p=*/true,
32660 /*template_p=*/NULL
,
32661 /*declarator_p=*/false,
32662 /*optional_p=*/false);
32663 if (step
!= error_mark_node
)
32664 step
= cp_parser_lookup_name_simple (parser
, step
, token
->location
);
32665 if (step
== error_mark_node
)
32668 cp_parser_abort_tentative_parse (parser
);
32670 else if (!cp_parser_parse_definitely (parser
))
32674 step
= cp_parser_expression (parser
);
32676 if (is_cilk_simd_fn
&& TREE_CODE (step
) == PARM_DECL
)
32678 sorry ("using parameters for %<linear%> step is not supported yet");
32679 step
= integer_one_node
;
32681 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32682 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32683 /*or_comma=*/false,
32684 /*consume_paren=*/true);
32686 if (step
== error_mark_node
)
32690 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
32692 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
32693 OMP_CLAUSE_LINEAR_KIND (c
) = kind
;
32700 safelen ( constant-expression ) */
32703 cp_parser_omp_clause_safelen (cp_parser
*parser
, tree list
,
32704 location_t location
)
32708 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32711 t
= cp_parser_constant_expression (parser
);
32713 if (t
== error_mark_node
32714 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32715 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32716 /*or_comma=*/false,
32717 /*consume_paren=*/true);
32719 check_no_duplicate_clause (list
, OMP_CLAUSE_SAFELEN
, "safelen", location
);
32721 c
= build_omp_clause (location
, OMP_CLAUSE_SAFELEN
);
32722 OMP_CLAUSE_SAFELEN_EXPR (c
) = t
;
32723 OMP_CLAUSE_CHAIN (c
) = list
;
32729 simdlen ( constant-expression ) */
32732 cp_parser_omp_clause_simdlen (cp_parser
*parser
, tree list
,
32733 location_t location
)
32737 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32740 t
= cp_parser_constant_expression (parser
);
32742 if (t
== error_mark_node
32743 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32744 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32745 /*or_comma=*/false,
32746 /*consume_paren=*/true);
32748 check_no_duplicate_clause (list
, OMP_CLAUSE_SIMDLEN
, "simdlen", location
);
32750 c
= build_omp_clause (location
, OMP_CLAUSE_SIMDLEN
);
32751 OMP_CLAUSE_SIMDLEN_EXPR (c
) = t
;
32752 OMP_CLAUSE_CHAIN (c
) = list
;
32759 identifier [+/- integer]
32760 vec , identifier [+/- integer]
32764 cp_parser_omp_clause_depend_sink (cp_parser
*parser
, location_t clause_loc
,
32769 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
32771 cp_parser_error (parser
, "expected identifier");
32775 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32777 location_t id_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
32778 tree t
, identifier
= cp_parser_identifier (parser
);
32779 tree addend
= NULL
;
32781 if (identifier
== error_mark_node
)
32782 t
= error_mark_node
;
32785 t
= cp_parser_lookup_name_simple
32786 (parser
, identifier
,
32787 cp_lexer_peek_token (parser
->lexer
)->location
);
32788 if (t
== error_mark_node
)
32789 cp_parser_name_lookup_error (parser
, identifier
, t
, NLE_NULL
,
32794 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MINUS
))
32796 else if (!cp_lexer_next_token_is (parser
->lexer
, CPP_PLUS
))
32798 addend
= integer_zero_node
;
32799 goto add_to_vector
;
32801 cp_lexer_consume_token (parser
->lexer
);
32803 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NUMBER
))
32805 cp_parser_error (parser
, "expected integer");
32809 addend
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32810 if (TREE_CODE (addend
) != INTEGER_CST
)
32812 cp_parser_error (parser
, "expected integer");
32815 cp_lexer_consume_token (parser
->lexer
);
32818 if (t
!= error_mark_node
)
32820 vec
= tree_cons (addend
, t
, vec
);
32822 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (vec
) = 1;
32825 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
32828 cp_lexer_consume_token (parser
->lexer
);
32831 if (cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
) && vec
)
32833 tree u
= build_omp_clause (clause_loc
, OMP_CLAUSE_DEPEND
);
32834 OMP_CLAUSE_DEPEND_KIND (u
) = OMP_CLAUSE_DEPEND_SINK
;
32835 OMP_CLAUSE_DECL (u
) = nreverse (vec
);
32836 OMP_CLAUSE_CHAIN (u
) = list
;
32843 depend ( depend-kind : variable-list )
32851 depend ( sink : vec ) */
32854 cp_parser_omp_clause_depend (cp_parser
*parser
, tree list
, location_t loc
)
32857 enum omp_clause_depend_kind kind
= OMP_CLAUSE_DEPEND_INOUT
;
32859 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32862 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32864 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32865 const char *p
= IDENTIFIER_POINTER (id
);
32867 if (strcmp ("in", p
) == 0)
32868 kind
= OMP_CLAUSE_DEPEND_IN
;
32869 else if (strcmp ("inout", p
) == 0)
32870 kind
= OMP_CLAUSE_DEPEND_INOUT
;
32871 else if (strcmp ("out", p
) == 0)
32872 kind
= OMP_CLAUSE_DEPEND_OUT
;
32873 else if (strcmp ("source", p
) == 0)
32874 kind
= OMP_CLAUSE_DEPEND_SOURCE
;
32875 else if (strcmp ("sink", p
) == 0)
32876 kind
= OMP_CLAUSE_DEPEND_SINK
;
32883 cp_lexer_consume_token (parser
->lexer
);
32885 if (kind
== OMP_CLAUSE_DEPEND_SOURCE
)
32887 c
= build_omp_clause (loc
, OMP_CLAUSE_DEPEND
);
32888 OMP_CLAUSE_DEPEND_KIND (c
) = kind
;
32889 OMP_CLAUSE_DECL (c
) = NULL_TREE
;
32890 OMP_CLAUSE_CHAIN (c
) = list
;
32891 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32892 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32893 /*or_comma=*/false,
32894 /*consume_paren=*/true);
32898 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
32901 if (kind
== OMP_CLAUSE_DEPEND_SINK
)
32902 nlist
= cp_parser_omp_clause_depend_sink (parser
, loc
, list
);
32905 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_DEPEND
,
32908 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
32909 OMP_CLAUSE_DEPEND_KIND (c
) = kind
;
32914 cp_parser_error (parser
, "invalid depend kind");
32916 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32917 /*or_comma=*/false,
32918 /*consume_paren=*/true);
32923 map ( map-kind : variable-list )
32924 map ( variable-list )
32927 alloc | to | from | tofrom
32931 alloc | to | from | tofrom | release | delete
32933 map ( always [,] map-kind: variable-list ) */
32936 cp_parser_omp_clause_map (cp_parser
*parser
, tree list
)
32939 enum gomp_map_kind kind
= GOMP_MAP_TOFROM
;
32940 bool always
= false;
32942 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
32945 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32947 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32948 const char *p
= IDENTIFIER_POINTER (id
);
32950 if (strcmp ("always", p
) == 0)
32953 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COMMA
)
32955 if ((cp_lexer_peek_nth_token (parser
->lexer
, nth
)->type
== CPP_NAME
32956 || (cp_lexer_peek_nth_token (parser
->lexer
, nth
)->keyword
32958 && (cp_lexer_peek_nth_token (parser
->lexer
, nth
+ 1)->type
32962 cp_lexer_consume_token (parser
->lexer
);
32964 cp_lexer_consume_token (parser
->lexer
);
32969 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
32970 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
32972 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32973 const char *p
= IDENTIFIER_POINTER (id
);
32975 if (strcmp ("alloc", p
) == 0)
32976 kind
= GOMP_MAP_ALLOC
;
32977 else if (strcmp ("to", p
) == 0)
32978 kind
= always
? GOMP_MAP_ALWAYS_TO
: GOMP_MAP_TO
;
32979 else if (strcmp ("from", p
) == 0)
32980 kind
= always
? GOMP_MAP_ALWAYS_FROM
: GOMP_MAP_FROM
;
32981 else if (strcmp ("tofrom", p
) == 0)
32982 kind
= always
? GOMP_MAP_ALWAYS_TOFROM
: GOMP_MAP_TOFROM
;
32983 else if (strcmp ("release", p
) == 0)
32984 kind
= GOMP_MAP_RELEASE
;
32987 cp_parser_error (parser
, "invalid map kind");
32988 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32989 /*or_comma=*/false,
32990 /*consume_paren=*/true);
32993 cp_lexer_consume_token (parser
->lexer
);
32994 cp_lexer_consume_token (parser
->lexer
);
32996 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DELETE
)
32997 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
32999 kind
= GOMP_MAP_DELETE
;
33000 cp_lexer_consume_token (parser
->lexer
);
33001 cp_lexer_consume_token (parser
->lexer
);
33004 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_MAP
, list
,
33007 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
33008 OMP_CLAUSE_SET_MAP_KIND (c
, kind
);
33014 device ( expression ) */
33017 cp_parser_omp_clause_device (cp_parser
*parser
, tree list
,
33018 location_t location
)
33022 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
33025 t
= cp_parser_expression (parser
);
33027 if (t
== error_mark_node
33028 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
33029 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
33030 /*or_comma=*/false,
33031 /*consume_paren=*/true);
33033 check_no_duplicate_clause (list
, OMP_CLAUSE_DEVICE
,
33034 "device", location
);
33036 c
= build_omp_clause (location
, OMP_CLAUSE_DEVICE
);
33037 OMP_CLAUSE_DEVICE_ID (c
) = t
;
33038 OMP_CLAUSE_CHAIN (c
) = list
;
33044 dist_schedule ( static )
33045 dist_schedule ( static , expression ) */
33048 cp_parser_omp_clause_dist_schedule (cp_parser
*parser
, tree list
,
33049 location_t location
)
33053 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
33056 c
= build_omp_clause (location
, OMP_CLAUSE_DIST_SCHEDULE
);
33058 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
33060 cp_lexer_consume_token (parser
->lexer
);
33062 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
33064 cp_lexer_consume_token (parser
->lexer
);
33066 t
= cp_parser_assignment_expression (parser
);
33068 if (t
== error_mark_node
)
33070 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
33072 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
33075 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
33078 check_no_duplicate_clause (list
, OMP_CLAUSE_DIST_SCHEDULE
, "dist_schedule",
33080 OMP_CLAUSE_CHAIN (c
) = list
;
33084 cp_parser_error (parser
, "invalid dist_schedule kind");
33086 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
33087 /*or_comma=*/false,
33088 /*consume_paren=*/true);
33093 proc_bind ( proc-bind-kind )
33096 master | close | spread */
33099 cp_parser_omp_clause_proc_bind (cp_parser
*parser
, tree list
,
33100 location_t location
)
33103 enum omp_clause_proc_bind_kind kind
;
33105 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
33108 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
33110 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
33111 const char *p
= IDENTIFIER_POINTER (id
);
33113 if (strcmp ("master", p
) == 0)
33114 kind
= OMP_CLAUSE_PROC_BIND_MASTER
;
33115 else if (strcmp ("close", p
) == 0)
33116 kind
= OMP_CLAUSE_PROC_BIND_CLOSE
;
33117 else if (strcmp ("spread", p
) == 0)
33118 kind
= OMP_CLAUSE_PROC_BIND_SPREAD
;
33125 cp_lexer_consume_token (parser
->lexer
);
33126 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
33129 c
= build_omp_clause (location
, OMP_CLAUSE_PROC_BIND
);
33130 check_no_duplicate_clause (list
, OMP_CLAUSE_PROC_BIND
, "proc_bind",
33132 OMP_CLAUSE_PROC_BIND_KIND (c
) = kind
;
33133 OMP_CLAUSE_CHAIN (c
) = list
;
33137 cp_parser_error (parser
, "invalid depend kind");
33139 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
33140 /*or_comma=*/false,
33141 /*consume_paren=*/true);
33146 async [( int-expr )] */
33149 cp_parser_oacc_clause_async (cp_parser
*parser
, tree list
)
33152 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
33154 t
= build_int_cst (integer_type_node
, GOMP_ASYNC_NOVAL
);
33156 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
33158 cp_lexer_consume_token (parser
->lexer
);
33160 t
= cp_parser_expression (parser
);
33161 if (t
== error_mark_node
33162 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
33163 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
33164 /*or_comma=*/false,
33165 /*consume_paren=*/true);
33168 check_no_duplicate_clause (list
, OMP_CLAUSE_ASYNC
, "async", loc
);
33170 c
= build_omp_clause (loc
, OMP_CLAUSE_ASYNC
);
33171 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
33172 OMP_CLAUSE_CHAIN (c
) = list
;
33178 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33179 is a bitmask in MASK. Return the list of clauses found. */
33182 cp_parser_oacc_all_clauses (cp_parser
*parser
, omp_clause_mask mask
,
33183 const char *where
, cp_token
*pragma_tok
,
33184 bool finish_p
= true)
33186 tree clauses
= NULL
;
33189 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
33192 pragma_omp_clause c_kind
;
33193 omp_clause_code code
;
33194 const char *c_name
;
33195 tree prev
= clauses
;
33197 if (!first
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
33198 cp_lexer_consume_token (parser
->lexer
);
33200 here
= cp_lexer_peek_token (parser
->lexer
)->location
;
33201 c_kind
= cp_parser_omp_clause_name (parser
);
33205 case PRAGMA_OACC_CLAUSE_ASYNC
:
33206 clauses
= cp_parser_oacc_clause_async (parser
, clauses
);
33209 case PRAGMA_OACC_CLAUSE_AUTO
:
33210 clauses
= cp_parser_oacc_simple_clause (parser
, OMP_CLAUSE_AUTO
,
33214 case PRAGMA_OACC_CLAUSE_COLLAPSE
:
33215 clauses
= cp_parser_omp_clause_collapse (parser
, clauses
, here
);
33216 c_name
= "collapse";
33218 case PRAGMA_OACC_CLAUSE_COPY
:
33219 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33222 case PRAGMA_OACC_CLAUSE_COPYIN
:
33223 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33226 case PRAGMA_OACC_CLAUSE_COPYOUT
:
33227 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33228 c_name
= "copyout";
33230 case PRAGMA_OACC_CLAUSE_CREATE
:
33231 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33234 case PRAGMA_OACC_CLAUSE_DELETE
:
33235 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33238 case PRAGMA_OMP_CLAUSE_DEFAULT
:
33239 clauses
= cp_parser_omp_clause_default (parser
, clauses
, here
, true);
33240 c_name
= "default";
33242 case PRAGMA_OACC_CLAUSE_DEVICE
:
33243 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33246 case PRAGMA_OACC_CLAUSE_DEVICEPTR
:
33247 clauses
= cp_parser_oacc_data_clause_deviceptr (parser
, clauses
);
33248 c_name
= "deviceptr";
33250 case PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT
:
33251 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33252 c_name
= "device_resident";
33254 case PRAGMA_OACC_CLAUSE_FIRSTPRIVATE
:
33255 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
33257 c_name
= "firstprivate";
33259 case PRAGMA_OACC_CLAUSE_GANG
:
33261 clauses
= cp_parser_oacc_shape_clause (parser
, OMP_CLAUSE_GANG
,
33264 case PRAGMA_OACC_CLAUSE_HOST
:
33265 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33268 case PRAGMA_OACC_CLAUSE_IF
:
33269 clauses
= cp_parser_omp_clause_if (parser
, clauses
, here
, false);
33272 case PRAGMA_OACC_CLAUSE_INDEPENDENT
:
33273 clauses
= cp_parser_oacc_simple_clause (parser
,
33274 OMP_CLAUSE_INDEPENDENT
,
33276 c_name
= "independent";
33278 case PRAGMA_OACC_CLAUSE_LINK
:
33279 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33282 case PRAGMA_OACC_CLAUSE_NUM_GANGS
:
33283 code
= OMP_CLAUSE_NUM_GANGS
;
33284 c_name
= "num_gangs";
33285 clauses
= cp_parser_oacc_single_int_clause (parser
, code
, c_name
,
33288 case PRAGMA_OACC_CLAUSE_NUM_WORKERS
:
33289 c_name
= "num_workers";
33290 code
= OMP_CLAUSE_NUM_WORKERS
;
33291 clauses
= cp_parser_oacc_single_int_clause (parser
, code
, c_name
,
33294 case PRAGMA_OACC_CLAUSE_PRESENT
:
33295 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33296 c_name
= "present";
33298 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY
:
33299 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33300 c_name
= "present_or_copy";
33302 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN
:
33303 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33304 c_name
= "present_or_copyin";
33306 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT
:
33307 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33308 c_name
= "present_or_copyout";
33310 case PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE
:
33311 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33312 c_name
= "present_or_create";
33314 case PRAGMA_OACC_CLAUSE_PRIVATE
:
33315 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
33317 c_name
= "private";
33319 case PRAGMA_OACC_CLAUSE_REDUCTION
:
33320 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
33321 c_name
= "reduction";
33323 case PRAGMA_OACC_CLAUSE_SELF
:
33324 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
33327 case PRAGMA_OACC_CLAUSE_SEQ
:
33328 clauses
= cp_parser_oacc_simple_clause (parser
, OMP_CLAUSE_SEQ
,
33332 case PRAGMA_OACC_CLAUSE_TILE
:
33333 clauses
= cp_parser_oacc_clause_tile (parser
, here
, clauses
);
33336 case PRAGMA_OACC_CLAUSE_USE_DEVICE
:
33337 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_USE_DEVICE_PTR
,
33339 c_name
= "use_device";
33341 case PRAGMA_OACC_CLAUSE_VECTOR
:
33343 clauses
= cp_parser_oacc_shape_clause (parser
, OMP_CLAUSE_VECTOR
,
33346 case PRAGMA_OACC_CLAUSE_VECTOR_LENGTH
:
33347 c_name
= "vector_length";
33348 code
= OMP_CLAUSE_VECTOR_LENGTH
;
33349 clauses
= cp_parser_oacc_single_int_clause (parser
, code
, c_name
,
33352 case PRAGMA_OACC_CLAUSE_WAIT
:
33353 clauses
= cp_parser_oacc_clause_wait (parser
, clauses
);
33356 case PRAGMA_OACC_CLAUSE_WORKER
:
33358 clauses
= cp_parser_oacc_shape_clause (parser
, OMP_CLAUSE_WORKER
,
33362 cp_parser_error (parser
, "expected %<#pragma acc%> clause");
33368 if (((mask
>> c_kind
) & 1) == 0)
33370 /* Remove the invalid clause(s) from the list to avoid
33371 confusing the rest of the compiler. */
33373 error_at (here
, "%qs is not valid for %qs", c_name
, where
);
33378 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
33381 return finish_omp_clauses (clauses
, C_ORT_ACC
);
33386 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33387 is a bitmask in MASK. Return the list of clauses found; the result
33388 of clause default goes in *pdefault. */
33391 cp_parser_omp_all_clauses (cp_parser
*parser
, omp_clause_mask mask
,
33392 const char *where
, cp_token
*pragma_tok
,
33393 bool finish_p
= true)
33395 tree clauses
= NULL
;
33397 cp_token
*token
= NULL
;
33399 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
33401 pragma_omp_clause c_kind
;
33402 const char *c_name
;
33403 tree prev
= clauses
;
33405 if (!first
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
33406 cp_lexer_consume_token (parser
->lexer
);
33408 token
= cp_lexer_peek_token (parser
->lexer
);
33409 c_kind
= cp_parser_omp_clause_name (parser
);
33413 case PRAGMA_OMP_CLAUSE_COLLAPSE
:
33414 clauses
= cp_parser_omp_clause_collapse (parser
, clauses
,
33416 c_name
= "collapse";
33418 case PRAGMA_OMP_CLAUSE_COPYIN
:
33419 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYIN
, clauses
);
33422 case PRAGMA_OMP_CLAUSE_COPYPRIVATE
:
33423 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYPRIVATE
,
33425 c_name
= "copyprivate";
33427 case PRAGMA_OMP_CLAUSE_DEFAULT
:
33428 clauses
= cp_parser_omp_clause_default (parser
, clauses
,
33429 token
->location
, false);
33430 c_name
= "default";
33432 case PRAGMA_OMP_CLAUSE_FINAL
:
33433 clauses
= cp_parser_omp_clause_final (parser
, clauses
, token
->location
);
33436 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
:
33437 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
33439 c_name
= "firstprivate";
33441 case PRAGMA_OMP_CLAUSE_GRAINSIZE
:
33442 clauses
= cp_parser_omp_clause_grainsize (parser
, clauses
,
33444 c_name
= "grainsize";
33446 case PRAGMA_OMP_CLAUSE_HINT
:
33447 clauses
= cp_parser_omp_clause_hint (parser
, clauses
,
33451 case PRAGMA_OMP_CLAUSE_DEFAULTMAP
:
33452 clauses
= cp_parser_omp_clause_defaultmap (parser
, clauses
,
33454 c_name
= "defaultmap";
33456 case PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR
:
33457 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_USE_DEVICE_PTR
,
33459 c_name
= "use_device_ptr";
33461 case PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR
:
33462 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_IS_DEVICE_PTR
,
33464 c_name
= "is_device_ptr";
33466 case PRAGMA_OMP_CLAUSE_IF
:
33467 clauses
= cp_parser_omp_clause_if (parser
, clauses
, token
->location
,
33471 case PRAGMA_OMP_CLAUSE_LASTPRIVATE
:
33472 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
33474 c_name
= "lastprivate";
33476 case PRAGMA_OMP_CLAUSE_MERGEABLE
:
33477 clauses
= cp_parser_omp_clause_mergeable (parser
, clauses
,
33479 c_name
= "mergeable";
33481 case PRAGMA_OMP_CLAUSE_NOWAIT
:
33482 clauses
= cp_parser_omp_clause_nowait (parser
, clauses
, token
->location
);
33485 case PRAGMA_OMP_CLAUSE_NUM_TASKS
:
33486 clauses
= cp_parser_omp_clause_num_tasks (parser
, clauses
,
33488 c_name
= "num_tasks";
33490 case PRAGMA_OMP_CLAUSE_NUM_THREADS
:
33491 clauses
= cp_parser_omp_clause_num_threads (parser
, clauses
,
33493 c_name
= "num_threads";
33495 case PRAGMA_OMP_CLAUSE_ORDERED
:
33496 clauses
= cp_parser_omp_clause_ordered (parser
, clauses
,
33498 c_name
= "ordered";
33500 case PRAGMA_OMP_CLAUSE_PRIORITY
:
33501 clauses
= cp_parser_omp_clause_priority (parser
, clauses
,
33503 c_name
= "priority";
33505 case PRAGMA_OMP_CLAUSE_PRIVATE
:
33506 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
33508 c_name
= "private";
33510 case PRAGMA_OMP_CLAUSE_REDUCTION
:
33511 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
33512 c_name
= "reduction";
33514 case PRAGMA_OMP_CLAUSE_SCHEDULE
:
33515 clauses
= cp_parser_omp_clause_schedule (parser
, clauses
,
33517 c_name
= "schedule";
33519 case PRAGMA_OMP_CLAUSE_SHARED
:
33520 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_SHARED
,
33524 case PRAGMA_OMP_CLAUSE_UNTIED
:
33525 clauses
= cp_parser_omp_clause_untied (parser
, clauses
,
33529 case PRAGMA_OMP_CLAUSE_INBRANCH
:
33530 case PRAGMA_CILK_CLAUSE_MASK
:
33531 clauses
= cp_parser_omp_clause_branch (parser
, OMP_CLAUSE_INBRANCH
,
33532 clauses
, token
->location
);
33533 c_name
= "inbranch";
33535 case PRAGMA_OMP_CLAUSE_NOTINBRANCH
:
33536 case PRAGMA_CILK_CLAUSE_NOMASK
:
33537 clauses
= cp_parser_omp_clause_branch (parser
,
33538 OMP_CLAUSE_NOTINBRANCH
,
33539 clauses
, token
->location
);
33540 c_name
= "notinbranch";
33542 case PRAGMA_OMP_CLAUSE_PARALLEL
:
33543 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_PARALLEL
,
33544 clauses
, token
->location
);
33545 c_name
= "parallel";
33549 error_at (token
->location
, "%qs must be the first clause of %qs",
33554 case PRAGMA_OMP_CLAUSE_FOR
:
33555 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_FOR
,
33556 clauses
, token
->location
);
33559 goto clause_not_first
;
33561 case PRAGMA_OMP_CLAUSE_SECTIONS
:
33562 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_SECTIONS
,
33563 clauses
, token
->location
);
33564 c_name
= "sections";
33566 goto clause_not_first
;
33568 case PRAGMA_OMP_CLAUSE_TASKGROUP
:
33569 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_TASKGROUP
,
33570 clauses
, token
->location
);
33571 c_name
= "taskgroup";
33573 goto clause_not_first
;
33575 case PRAGMA_OMP_CLAUSE_LINK
:
33576 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LINK
, clauses
);
33579 case PRAGMA_OMP_CLAUSE_TO
:
33580 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_LINK
)) != 0)
33581 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_TO_DECLARE
,
33584 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_TO
, clauses
);
33587 case PRAGMA_OMP_CLAUSE_FROM
:
33588 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FROM
, clauses
);
33591 case PRAGMA_OMP_CLAUSE_UNIFORM
:
33592 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_UNIFORM
,
33594 c_name
= "uniform";
33596 case PRAGMA_OMP_CLAUSE_NUM_TEAMS
:
33597 clauses
= cp_parser_omp_clause_num_teams (parser
, clauses
,
33599 c_name
= "num_teams";
33601 case PRAGMA_OMP_CLAUSE_THREAD_LIMIT
:
33602 clauses
= cp_parser_omp_clause_thread_limit (parser
, clauses
,
33604 c_name
= "thread_limit";
33606 case PRAGMA_OMP_CLAUSE_ALIGNED
:
33607 clauses
= cp_parser_omp_clause_aligned (parser
, clauses
);
33608 c_name
= "aligned";
33610 case PRAGMA_OMP_CLAUSE_LINEAR
:
33612 bool cilk_simd_fn
= false, declare_simd
= false;
33613 if (((mask
>> PRAGMA_CILK_CLAUSE_VECTORLENGTH
) & 1) != 0)
33614 cilk_simd_fn
= true;
33615 else if (((mask
>> PRAGMA_OMP_CLAUSE_UNIFORM
) & 1) != 0)
33616 declare_simd
= true;
33617 clauses
= cp_parser_omp_clause_linear (parser
, clauses
,
33618 cilk_simd_fn
, declare_simd
);
33622 case PRAGMA_OMP_CLAUSE_DEPEND
:
33623 clauses
= cp_parser_omp_clause_depend (parser
, clauses
,
33627 case PRAGMA_OMP_CLAUSE_MAP
:
33628 clauses
= cp_parser_omp_clause_map (parser
, clauses
);
33631 case PRAGMA_OMP_CLAUSE_DEVICE
:
33632 clauses
= cp_parser_omp_clause_device (parser
, clauses
,
33636 case PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
:
33637 clauses
= cp_parser_omp_clause_dist_schedule (parser
, clauses
,
33639 c_name
= "dist_schedule";
33641 case PRAGMA_OMP_CLAUSE_PROC_BIND
:
33642 clauses
= cp_parser_omp_clause_proc_bind (parser
, clauses
,
33644 c_name
= "proc_bind";
33646 case PRAGMA_OMP_CLAUSE_SAFELEN
:
33647 clauses
= cp_parser_omp_clause_safelen (parser
, clauses
,
33649 c_name
= "safelen";
33651 case PRAGMA_OMP_CLAUSE_SIMDLEN
:
33652 clauses
= cp_parser_omp_clause_simdlen (parser
, clauses
,
33654 c_name
= "simdlen";
33656 case PRAGMA_OMP_CLAUSE_NOGROUP
:
33657 clauses
= cp_parser_omp_clause_nogroup (parser
, clauses
,
33659 c_name
= "nogroup";
33661 case PRAGMA_OMP_CLAUSE_THREADS
:
33663 = cp_parser_omp_clause_orderedkind (parser
, OMP_CLAUSE_THREADS
,
33664 clauses
, token
->location
);
33665 c_name
= "threads";
33667 case PRAGMA_OMP_CLAUSE_SIMD
:
33669 = cp_parser_omp_clause_orderedkind (parser
, OMP_CLAUSE_SIMD
,
33670 clauses
, token
->location
);
33673 case PRAGMA_CILK_CLAUSE_VECTORLENGTH
:
33674 clauses
= cp_parser_cilk_simd_vectorlength (parser
, clauses
, true);
33675 c_name
= "simdlen";
33678 cp_parser_error (parser
, "expected %<#pragma omp%> clause");
33684 if (((mask
>> c_kind
) & 1) == 0)
33686 /* Remove the invalid clause(s) from the list to avoid
33687 confusing the rest of the compiler. */
33689 error_at (token
->location
, "%qs is not valid for %qs", c_name
, where
);
33693 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
33694 no reason to skip to the end. */
33695 if (!(flag_cilkplus
&& pragma_tok
== NULL
))
33696 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
33699 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_UNIFORM
)) != 0)
33700 return finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
33702 return finish_omp_clauses (clauses
, C_ORT_OMP
);
33711 In practice, we're also interested in adding the statement to an
33712 outer node. So it is convenient if we work around the fact that
33713 cp_parser_statement calls add_stmt. */
33716 cp_parser_begin_omp_structured_block (cp_parser
*parser
)
33718 unsigned save
= parser
->in_statement
;
33720 /* Only move the values to IN_OMP_BLOCK if they weren't false.
33721 This preserves the "not within loop or switch" style error messages
33722 for nonsense cases like
33728 if (parser
->in_statement
)
33729 parser
->in_statement
= IN_OMP_BLOCK
;
33735 cp_parser_end_omp_structured_block (cp_parser
*parser
, unsigned save
)
33737 parser
->in_statement
= save
;
33741 cp_parser_omp_structured_block (cp_parser
*parser
, bool *if_p
)
33743 tree stmt
= begin_omp_structured_block ();
33744 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
33746 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
33748 cp_parser_end_omp_structured_block (parser
, save
);
33749 return finish_omp_structured_block (stmt
);
33753 # pragma omp atomic new-line
33757 x binop= expr | x++ | ++x | x-- | --x
33759 +, *, -, /, &, ^, |, <<, >>
33761 where x is an lvalue expression with scalar type.
33764 # pragma omp atomic new-line
33767 # pragma omp atomic read new-line
33770 # pragma omp atomic write new-line
33773 # pragma omp atomic update new-line
33776 # pragma omp atomic capture new-line
33779 # pragma omp atomic capture new-line
33787 expression-stmt | x = x binop expr
33789 v = expression-stmt
33791 { v = x; update-stmt; } | { update-stmt; v = x; }
33795 expression-stmt | x = x binop expr | x = expr binop x
33799 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
33801 where x and v are lvalue expressions with scalar type. */
33804 cp_parser_omp_atomic (cp_parser
*parser
, cp_token
*pragma_tok
)
33806 tree lhs
= NULL_TREE
, rhs
= NULL_TREE
, v
= NULL_TREE
, lhs1
= NULL_TREE
;
33807 tree rhs1
= NULL_TREE
, orig_lhs
;
33808 enum tree_code code
= OMP_ATOMIC
, opcode
= NOP_EXPR
;
33809 bool structured_block
= false;
33810 bool seq_cst
= false;
33812 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
33814 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
33815 const char *p
= IDENTIFIER_POINTER (id
);
33817 if (!strcmp (p
, "seq_cst"))
33820 cp_lexer_consume_token (parser
->lexer
);
33821 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
)
33822 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_NAME
)
33823 cp_lexer_consume_token (parser
->lexer
);
33826 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
33828 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
33829 const char *p
= IDENTIFIER_POINTER (id
);
33831 if (!strcmp (p
, "read"))
33832 code
= OMP_ATOMIC_READ
;
33833 else if (!strcmp (p
, "write"))
33835 else if (!strcmp (p
, "update"))
33837 else if (!strcmp (p
, "capture"))
33838 code
= OMP_ATOMIC_CAPTURE_NEW
;
33842 cp_lexer_consume_token (parser
->lexer
);
33846 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
)
33847 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_NAME
)
33848 cp_lexer_consume_token (parser
->lexer
);
33850 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
33852 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
33853 const char *p
= IDENTIFIER_POINTER (id
);
33855 if (!strcmp (p
, "seq_cst"))
33858 cp_lexer_consume_token (parser
->lexer
);
33862 cp_parser_require_pragma_eol (parser
, pragma_tok
);
33866 case OMP_ATOMIC_READ
:
33867 case NOP_EXPR
: /* atomic write */
33868 v
= cp_parser_unary_expression (parser
);
33869 if (v
== error_mark_node
)
33871 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
33873 if (code
== NOP_EXPR
)
33874 lhs
= cp_parser_expression (parser
);
33876 lhs
= cp_parser_unary_expression (parser
);
33877 if (lhs
== error_mark_node
)
33879 if (code
== NOP_EXPR
)
33881 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
33889 case OMP_ATOMIC_CAPTURE_NEW
:
33890 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
33892 cp_lexer_consume_token (parser
->lexer
);
33893 structured_block
= true;
33897 v
= cp_parser_unary_expression (parser
);
33898 if (v
== error_mark_node
)
33900 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
33908 lhs
= cp_parser_unary_expression (parser
);
33910 switch (TREE_CODE (lhs
))
33915 case POSTINCREMENT_EXPR
:
33916 if (code
== OMP_ATOMIC_CAPTURE_NEW
&& !structured_block
)
33917 code
= OMP_ATOMIC_CAPTURE_OLD
;
33919 case PREINCREMENT_EXPR
:
33920 lhs
= TREE_OPERAND (lhs
, 0);
33921 opcode
= PLUS_EXPR
;
33922 rhs
= integer_one_node
;
33925 case POSTDECREMENT_EXPR
:
33926 if (code
== OMP_ATOMIC_CAPTURE_NEW
&& !structured_block
)
33927 code
= OMP_ATOMIC_CAPTURE_OLD
;
33929 case PREDECREMENT_EXPR
:
33930 lhs
= TREE_OPERAND (lhs
, 0);
33931 opcode
= MINUS_EXPR
;
33932 rhs
= integer_one_node
;
33935 case COMPOUND_EXPR
:
33936 if (TREE_CODE (TREE_OPERAND (lhs
, 0)) == SAVE_EXPR
33937 && TREE_CODE (TREE_OPERAND (lhs
, 1)) == COMPOUND_EXPR
33938 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0)) == MODIFY_EXPR
33939 && TREE_OPERAND (TREE_OPERAND (lhs
, 1), 1) == TREE_OPERAND (lhs
, 0)
33940 && TREE_CODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND
33941 (TREE_OPERAND (lhs
, 1), 0), 0)))
33943 /* Undo effects of boolean_increment for post {in,de}crement. */
33944 lhs
= TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0);
33947 if (TREE_CODE (lhs
) == MODIFY_EXPR
33948 && TREE_CODE (TREE_TYPE (TREE_OPERAND (lhs
, 0))) == BOOLEAN_TYPE
)
33950 /* Undo effects of boolean_increment. */
33951 if (integer_onep (TREE_OPERAND (lhs
, 1)))
33953 /* This is pre or post increment. */
33954 rhs
= TREE_OPERAND (lhs
, 1);
33955 lhs
= TREE_OPERAND (lhs
, 0);
33957 if (code
== OMP_ATOMIC_CAPTURE_NEW
33958 && !structured_block
33959 && TREE_CODE (orig_lhs
) == COMPOUND_EXPR
)
33960 code
= OMP_ATOMIC_CAPTURE_OLD
;
33966 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
33969 opcode
= MULT_EXPR
;
33972 opcode
= TRUNC_DIV_EXPR
;
33975 opcode
= PLUS_EXPR
;
33978 opcode
= MINUS_EXPR
;
33980 case CPP_LSHIFT_EQ
:
33981 opcode
= LSHIFT_EXPR
;
33983 case CPP_RSHIFT_EQ
:
33984 opcode
= RSHIFT_EXPR
;
33987 opcode
= BIT_AND_EXPR
;
33990 opcode
= BIT_IOR_EXPR
;
33993 opcode
= BIT_XOR_EXPR
;
33996 enum cp_parser_prec oprec
;
33998 cp_lexer_consume_token (parser
->lexer
);
33999 cp_parser_parse_tentatively (parser
);
34000 rhs1
= cp_parser_simple_cast_expression (parser
);
34001 if (rhs1
== error_mark_node
)
34003 cp_parser_abort_tentative_parse (parser
);
34004 cp_parser_simple_cast_expression (parser
);
34007 token
= cp_lexer_peek_token (parser
->lexer
);
34008 if (token
->type
!= CPP_SEMICOLON
&& !cp_tree_equal (lhs
, rhs1
))
34010 cp_parser_abort_tentative_parse (parser
);
34011 cp_parser_parse_tentatively (parser
);
34012 rhs
= cp_parser_binary_expression (parser
, false, true,
34013 PREC_NOT_OPERATOR
, NULL
);
34014 if (rhs
== error_mark_node
)
34016 cp_parser_abort_tentative_parse (parser
);
34017 cp_parser_binary_expression (parser
, false, true,
34018 PREC_NOT_OPERATOR
, NULL
);
34021 switch (TREE_CODE (rhs
))
34024 case TRUNC_DIV_EXPR
:
34033 if (cp_tree_equal (lhs
, TREE_OPERAND (rhs
, 1)))
34035 if (cp_parser_parse_definitely (parser
))
34037 opcode
= TREE_CODE (rhs
);
34038 rhs1
= TREE_OPERAND (rhs
, 0);
34039 rhs
= TREE_OPERAND (rhs
, 1);
34049 cp_parser_abort_tentative_parse (parser
);
34050 if (structured_block
&& code
== OMP_ATOMIC_CAPTURE_OLD
)
34052 rhs
= cp_parser_expression (parser
);
34053 if (rhs
== error_mark_node
)
34059 cp_parser_error (parser
,
34060 "invalid form of %<#pragma omp atomic%>");
34063 if (!cp_parser_parse_definitely (parser
))
34065 switch (token
->type
)
34067 case CPP_SEMICOLON
:
34068 if (structured_block
&& code
== OMP_ATOMIC_CAPTURE_NEW
)
34070 code
= OMP_ATOMIC_CAPTURE_OLD
;
34075 cp_lexer_consume_token (parser
->lexer
);
34078 else if (structured_block
)
34085 cp_parser_error (parser
,
34086 "invalid form of %<#pragma omp atomic%>");
34089 opcode
= MULT_EXPR
;
34092 opcode
= TRUNC_DIV_EXPR
;
34095 opcode
= PLUS_EXPR
;
34098 opcode
= MINUS_EXPR
;
34101 opcode
= LSHIFT_EXPR
;
34104 opcode
= RSHIFT_EXPR
;
34107 opcode
= BIT_AND_EXPR
;
34110 opcode
= BIT_IOR_EXPR
;
34113 opcode
= BIT_XOR_EXPR
;
34116 cp_parser_error (parser
,
34117 "invalid operator for %<#pragma omp atomic%>");
34120 oprec
= TOKEN_PRECEDENCE (token
);
34121 gcc_assert (oprec
!= PREC_NOT_OPERATOR
);
34122 if (commutative_tree_code (opcode
))
34123 oprec
= (enum cp_parser_prec
) (oprec
- 1);
34124 cp_lexer_consume_token (parser
->lexer
);
34125 rhs
= cp_parser_binary_expression (parser
, false, false,
34127 if (rhs
== error_mark_node
)
34132 cp_parser_error (parser
,
34133 "invalid operator for %<#pragma omp atomic%>");
34136 cp_lexer_consume_token (parser
->lexer
);
34138 rhs
= cp_parser_expression (parser
);
34139 if (rhs
== error_mark_node
)
34144 if (structured_block
&& code
== OMP_ATOMIC_CAPTURE_NEW
)
34146 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
34148 v
= cp_parser_unary_expression (parser
);
34149 if (v
== error_mark_node
)
34151 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
34153 lhs1
= cp_parser_unary_expression (parser
);
34154 if (lhs1
== error_mark_node
)
34157 if (structured_block
)
34159 cp_parser_consume_semicolon_at_end_of_statement (parser
);
34160 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
34163 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
, seq_cst
);
34164 if (!structured_block
)
34165 cp_parser_consume_semicolon_at_end_of_statement (parser
);
34169 cp_parser_skip_to_end_of_block_or_statement (parser
);
34170 if (structured_block
)
34172 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
34173 cp_lexer_consume_token (parser
->lexer
);
34174 else if (code
== OMP_ATOMIC_CAPTURE_NEW
)
34176 cp_parser_skip_to_end_of_block_or_statement (parser
);
34177 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
34178 cp_lexer_consume_token (parser
->lexer
);
34185 # pragma omp barrier new-line */
34188 cp_parser_omp_barrier (cp_parser
*parser
, cp_token
*pragma_tok
)
34190 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34191 finish_omp_barrier ();
34195 # pragma omp critical [(name)] new-line
34199 # pragma omp critical [(name) [hint(expression)]] new-line
34200 structured-block */
34202 #define OMP_CRITICAL_CLAUSE_MASK \
34203 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34206 cp_parser_omp_critical (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
34208 tree stmt
, name
= NULL_TREE
, clauses
= NULL_TREE
;
34210 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
34212 cp_lexer_consume_token (parser
->lexer
);
34214 name
= cp_parser_identifier (parser
);
34216 if (name
== error_mark_node
34217 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
34218 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
34219 /*or_comma=*/false,
34220 /*consume_paren=*/true);
34221 if (name
== error_mark_node
)
34224 clauses
= cp_parser_omp_all_clauses (parser
,
34225 OMP_CRITICAL_CLAUSE_MASK
,
34226 "#pragma omp critical", pragma_tok
);
34229 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34231 stmt
= cp_parser_omp_structured_block (parser
, if_p
);
34232 return c_finish_omp_critical (input_location
, stmt
, name
, clauses
);
34236 # pragma omp flush flush-vars[opt] new-line
34239 ( variable-list ) */
34242 cp_parser_omp_flush (cp_parser
*parser
, cp_token
*pragma_tok
)
34244 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
34245 (void) cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
34246 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34248 finish_omp_flush ();
34251 /* Helper function, to parse omp for increment expression. */
34254 cp_parser_omp_for_cond (cp_parser
*parser
, tree decl
, enum tree_code code
)
34256 tree cond
= cp_parser_binary_expression (parser
, false, true,
34257 PREC_NOT_OPERATOR
, NULL
);
34258 if (cond
== error_mark_node
34259 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
34261 cp_parser_skip_to_end_of_statement (parser
);
34262 return error_mark_node
;
34265 switch (TREE_CODE (cond
))
34273 if (code
== CILK_SIMD
|| code
== CILK_FOR
)
34275 /* Fall through: OpenMP disallows NE_EXPR. */
34276 gcc_fallthrough ();
34278 return error_mark_node
;
34281 /* If decl is an iterator, preserve LHS and RHS of the relational
34282 expr until finish_omp_for. */
34284 && (type_dependent_expression_p (decl
)
34285 || CLASS_TYPE_P (TREE_TYPE (decl
))))
34288 return build_x_binary_op (EXPR_LOC_OR_LOC (cond
, input_location
),
34290 TREE_OPERAND (cond
, 0), ERROR_MARK
,
34291 TREE_OPERAND (cond
, 1), ERROR_MARK
,
34292 /*overload=*/NULL
, tf_warning_or_error
);
34295 /* Helper function, to parse omp for increment expression. */
34298 cp_parser_omp_for_incr (cp_parser
*parser
, tree decl
)
34300 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
34306 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
34308 op
= (token
->type
== CPP_PLUS_PLUS
34309 ? PREINCREMENT_EXPR
: PREDECREMENT_EXPR
);
34310 cp_lexer_consume_token (parser
->lexer
);
34311 lhs
= cp_parser_simple_cast_expression (parser
);
34313 && (!processing_template_decl
|| !cp_tree_equal (lhs
, decl
)))
34314 return error_mark_node
;
34315 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
34318 lhs
= cp_parser_primary_expression (parser
, false, false, false, &idk
);
34320 && (!processing_template_decl
|| !cp_tree_equal (lhs
, decl
)))
34321 return error_mark_node
;
34323 token
= cp_lexer_peek_token (parser
->lexer
);
34324 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
34326 op
= (token
->type
== CPP_PLUS_PLUS
34327 ? POSTINCREMENT_EXPR
: POSTDECREMENT_EXPR
);
34328 cp_lexer_consume_token (parser
->lexer
);
34329 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
34332 op
= cp_parser_assignment_operator_opt (parser
);
34333 if (op
== ERROR_MARK
)
34334 return error_mark_node
;
34336 if (op
!= NOP_EXPR
)
34338 rhs
= cp_parser_assignment_expression (parser
);
34339 rhs
= build2 (op
, TREE_TYPE (decl
), decl
, rhs
);
34340 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
34343 lhs
= cp_parser_binary_expression (parser
, false, false,
34344 PREC_ADDITIVE_EXPRESSION
, NULL
);
34345 token
= cp_lexer_peek_token (parser
->lexer
);
34346 decl_first
= (lhs
== decl
34347 || (processing_template_decl
&& cp_tree_equal (lhs
, decl
)));
34350 if (token
->type
!= CPP_PLUS
34351 && token
->type
!= CPP_MINUS
)
34352 return error_mark_node
;
34356 op
= token
->type
== CPP_PLUS
? PLUS_EXPR
: MINUS_EXPR
;
34357 cp_lexer_consume_token (parser
->lexer
);
34358 rhs
= cp_parser_binary_expression (parser
, false, false,
34359 PREC_ADDITIVE_EXPRESSION
, NULL
);
34360 token
= cp_lexer_peek_token (parser
->lexer
);
34361 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
|| decl_first
)
34363 if (lhs
== NULL_TREE
)
34365 if (op
== PLUS_EXPR
)
34368 lhs
= build_x_unary_op (input_location
, NEGATE_EXPR
, rhs
,
34369 tf_warning_or_error
);
34372 lhs
= build_x_binary_op (input_location
, op
, lhs
, ERROR_MARK
, rhs
,
34373 ERROR_MARK
, NULL
, tf_warning_or_error
);
34376 while (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
);
34381 && (!processing_template_decl
|| !cp_tree_equal (rhs
, decl
)))
34382 || op
== MINUS_EXPR
)
34383 return error_mark_node
;
34384 rhs
= build2 (op
, TREE_TYPE (decl
), lhs
, decl
);
34387 rhs
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, lhs
);
34389 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
34392 /* Parse the initialization statement of either an OpenMP for loop or
34393 a Cilk Plus for loop.
34395 Return true if the resulting construct should have an
34396 OMP_CLAUSE_PRIVATE added to it. */
34399 cp_parser_omp_for_loop_init (cp_parser
*parser
,
34400 enum tree_code code
,
34401 tree
&this_pre_body
,
34402 vec
<tree
, va_gc
> *for_block
,
34408 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
34411 tree add_private_clause
= NULL_TREE
;
34413 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34417 integer-type var = lb
34418 random-access-iterator-type var = lb
34419 pointer-type var = lb
34421 cp_decl_specifier_seq type_specifiers
;
34423 /* First, try to parse as an initialized declaration. See
34424 cp_parser_condition, from whence the bulk of this is copied. */
34426 cp_parser_parse_tentatively (parser
);
34427 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
34428 /*is_trailing_return=*/false,
34430 if (cp_parser_parse_definitely (parser
))
34432 /* If parsing a type specifier seq succeeded, then this
34433 MUST be a initialized declaration. */
34434 tree asm_specification
, attributes
;
34435 cp_declarator
*declarator
;
34437 declarator
= cp_parser_declarator (parser
,
34438 CP_PARSER_DECLARATOR_NAMED
,
34439 /*ctor_dtor_or_conv_p=*/NULL
,
34440 /*parenthesized_p=*/NULL
,
34441 /*member_p=*/false,
34442 /*friend_p=*/false);
34443 attributes
= cp_parser_attributes_opt (parser
);
34444 asm_specification
= cp_parser_asm_specification_opt (parser
);
34446 if (declarator
== cp_error_declarator
)
34447 cp_parser_skip_to_end_of_statement (parser
);
34451 tree pushed_scope
, auto_node
;
34453 decl
= start_decl (declarator
, &type_specifiers
,
34454 SD_INITIALIZED
, attributes
,
34455 /*prefix_attributes=*/NULL_TREE
,
34458 auto_node
= type_uses_auto (TREE_TYPE (decl
));
34459 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
34461 if (cp_lexer_next_token_is (parser
->lexer
,
34464 if (code
!= CILK_SIMD
&& code
!= CILK_FOR
)
34465 error ("parenthesized initialization is not allowed in "
34466 "OpenMP %<for%> loop");
34468 error ("parenthesized initialization is "
34469 "not allowed in for-loop");
34472 /* Trigger an error. */
34473 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
34475 init
= error_mark_node
;
34476 cp_parser_skip_to_end_of_statement (parser
);
34478 else if (CLASS_TYPE_P (TREE_TYPE (decl
))
34479 || type_dependent_expression_p (decl
)
34482 bool is_direct_init
, is_non_constant_init
;
34484 init
= cp_parser_initializer (parser
,
34486 &is_non_constant_init
);
34491 = do_auto_deduction (TREE_TYPE (decl
), init
,
34494 if (!CLASS_TYPE_P (TREE_TYPE (decl
))
34495 && !type_dependent_expression_p (decl
))
34499 cp_finish_decl (decl
, init
, !is_non_constant_init
,
34501 LOOKUP_ONLYCONVERTING
);
34503 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
34505 vec_safe_push (for_block
, this_pre_body
);
34510 init
= pop_stmt_list (this_pre_body
);
34511 if (init
&& TREE_CODE (init
) == STATEMENT_LIST
)
34513 tree_stmt_iterator i
= tsi_start (init
);
34514 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34515 while (!tsi_end_p (i
))
34517 tree t
= tsi_stmt (i
);
34518 if (TREE_CODE (t
) == DECL_EXPR
34519 && TREE_CODE (DECL_EXPR_DECL (t
)) == TYPE_DECL
)
34522 vec_safe_push (for_block
, t
);
34527 if (tsi_one_before_end_p (i
))
34529 tree t
= tsi_stmt (i
);
34531 free_stmt_list (init
);
34536 this_pre_body
= NULL_TREE
;
34541 cp_lexer_consume_token (parser
->lexer
);
34542 init
= cp_parser_assignment_expression (parser
);
34545 if (TREE_CODE (TREE_TYPE (decl
)) == REFERENCE_TYPE
)
34546 init
= error_mark_node
;
34548 cp_finish_decl (decl
, NULL_TREE
,
34549 /*init_const_expr_p=*/false,
34551 LOOKUP_ONLYCONVERTING
);
34555 pop_scope (pushed_scope
);
34561 /* If parsing a type specifier sequence failed, then
34562 this MUST be a simple expression. */
34563 if (code
== CILK_FOR
)
34564 error ("%<_Cilk_for%> allows expression instead of declaration only "
34565 "in C, not in C++");
34566 cp_parser_parse_tentatively (parser
);
34567 decl
= cp_parser_primary_expression (parser
, false, false,
34569 cp_token
*last_tok
= cp_lexer_peek_token (parser
->lexer
);
34570 if (!cp_parser_error_occurred (parser
)
34572 && (TREE_CODE (decl
) == COMPONENT_REF
34573 || (TREE_CODE (decl
) == SCOPE_REF
&& TREE_TYPE (decl
))))
34575 cp_parser_abort_tentative_parse (parser
);
34576 cp_parser_parse_tentatively (parser
);
34577 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
34578 tree name
= cp_parser_id_expression (parser
, /*template_p=*/false,
34579 /*check_dependency_p=*/true,
34580 /*template_p=*/NULL
,
34581 /*declarator_p=*/false,
34582 /*optional_p=*/false);
34583 if (name
!= error_mark_node
34584 && last_tok
== cp_lexer_peek_token (parser
->lexer
))
34586 decl
= cp_parser_lookup_name_simple (parser
, name
,
34588 if (TREE_CODE (decl
) == FIELD_DECL
)
34589 add_private_clause
= omp_privatize_field (decl
, false);
34591 cp_parser_abort_tentative_parse (parser
);
34592 cp_parser_parse_tentatively (parser
);
34593 decl
= cp_parser_primary_expression (parser
, false, false,
34596 if (!cp_parser_error_occurred (parser
)
34599 && CLASS_TYPE_P (TREE_TYPE (decl
)))
34603 cp_parser_parse_definitely (parser
);
34604 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
34605 rhs
= cp_parser_assignment_expression (parser
);
34607 finish_expr_stmt (build_x_modify_expr (EXPR_LOCATION (rhs
),
34610 tf_warning_or_error
));
34611 if (!add_private_clause
)
34612 add_private_clause
= decl
;
34617 cp_parser_abort_tentative_parse (parser
);
34618 init
= cp_parser_expression (parser
);
34621 if (TREE_CODE (init
) == MODIFY_EXPR
34622 || TREE_CODE (init
) == MODOP_EXPR
)
34623 real_decl
= TREE_OPERAND (init
, 0);
34627 return add_private_clause
;
34630 /* Parse the restricted form of the for statement allowed by OpenMP. */
34633 cp_parser_omp_for_loop (cp_parser
*parser
, enum tree_code code
, tree clauses
,
34634 tree
*cclauses
, bool *if_p
)
34636 tree init
, orig_init
, cond
, incr
, body
, decl
, pre_body
= NULL_TREE
, ret
;
34637 tree real_decl
, initv
, condv
, incrv
, declv
;
34638 tree this_pre_body
, cl
, ordered_cl
= NULL_TREE
;
34639 location_t loc_first
;
34640 bool collapse_err
= false;
34641 int i
, collapse
= 1, ordered
= 0, count
, nbraces
= 0;
34642 vec
<tree
, va_gc
> *for_block
= make_tree_vector ();
34643 auto_vec
<tree
, 4> orig_inits
;
34644 bool tiling
= false;
34646 for (cl
= clauses
; cl
; cl
= OMP_CLAUSE_CHAIN (cl
))
34647 if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_COLLAPSE
)
34648 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (cl
));
34649 else if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_TILE
)
34652 collapse
= list_length (OMP_CLAUSE_TILE_LIST (cl
));
34654 else if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_ORDERED
34655 && OMP_CLAUSE_ORDERED_EXPR (cl
))
34658 ordered
= tree_to_shwi (OMP_CLAUSE_ORDERED_EXPR (cl
));
34661 if (ordered
&& ordered
< collapse
)
34663 error_at (OMP_CLAUSE_LOCATION (ordered_cl
),
34664 "%<ordered%> clause parameter is less than %<collapse%>");
34665 OMP_CLAUSE_ORDERED_EXPR (ordered_cl
)
34666 = build_int_cst (NULL_TREE
, collapse
);
34667 ordered
= collapse
;
34671 for (tree
*pc
= &clauses
; *pc
; )
34672 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LINEAR
)
34674 error_at (OMP_CLAUSE_LOCATION (*pc
),
34675 "%<linear%> clause may not be specified together "
34676 "with %<ordered%> clause with a parameter");
34677 *pc
= OMP_CLAUSE_CHAIN (*pc
);
34680 pc
= &OMP_CLAUSE_CHAIN (*pc
);
34683 gcc_assert (tiling
|| (collapse
>= 1 && ordered
>= 0));
34684 count
= ordered
? ordered
: collapse
;
34686 declv
= make_tree_vec (count
);
34687 initv
= make_tree_vec (count
);
34688 condv
= make_tree_vec (count
);
34689 incrv
= make_tree_vec (count
);
34691 loc_first
= cp_lexer_peek_token (parser
->lexer
)->location
;
34693 for (i
= 0; i
< count
; i
++)
34695 int bracecount
= 0;
34696 tree add_private_clause
= NULL_TREE
;
34699 if (code
!= CILK_FOR
34700 && !cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
34703 cp_parser_error (parser
, "for statement expected");
34706 if (code
== CILK_FOR
34707 && !cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CILK_FOR
))
34710 cp_parser_error (parser
, "_Cilk_for statement expected");
34713 loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
34715 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
34718 init
= orig_init
= decl
= real_decl
= NULL
;
34719 this_pre_body
= push_stmt_list ();
34722 = cp_parser_omp_for_loop_init (parser
, code
,
34723 this_pre_body
, for_block
,
34724 init
, orig_init
, decl
, real_decl
);
34726 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
34729 this_pre_body
= pop_stmt_list (this_pre_body
);
34733 pre_body
= push_stmt_list ();
34735 add_stmt (this_pre_body
);
34736 pre_body
= pop_stmt_list (pre_body
);
34739 pre_body
= this_pre_body
;
34744 if (cclauses
!= NULL
34745 && cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
] != NULL
34746 && real_decl
!= NULL_TREE
)
34749 for (c
= &cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
]; *c
; )
34750 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_FIRSTPRIVATE
34751 && OMP_CLAUSE_DECL (*c
) == real_decl
)
34753 error_at (loc
, "iteration variable %qD"
34754 " should not be firstprivate", real_decl
);
34755 *c
= OMP_CLAUSE_CHAIN (*c
);
34757 else if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_LASTPRIVATE
34758 && OMP_CLAUSE_DECL (*c
) == real_decl
)
34760 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
34762 *c
= OMP_CLAUSE_CHAIN (*c
);
34763 if (code
== OMP_SIMD
)
34765 OMP_CLAUSE_CHAIN (l
) = cclauses
[C_OMP_CLAUSE_SPLIT_FOR
];
34766 cclauses
[C_OMP_CLAUSE_SPLIT_FOR
] = l
;
34770 OMP_CLAUSE_CHAIN (l
) = clauses
;
34773 add_private_clause
= NULL_TREE
;
34777 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_PRIVATE
34778 && OMP_CLAUSE_DECL (*c
) == real_decl
)
34779 add_private_clause
= NULL_TREE
;
34780 c
= &OMP_CLAUSE_CHAIN (*c
);
34784 if (add_private_clause
)
34787 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
34789 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
34790 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
34791 && OMP_CLAUSE_DECL (c
) == decl
)
34793 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
34794 && OMP_CLAUSE_DECL (c
) == decl
)
34795 error_at (loc
, "iteration variable %qD "
34796 "should not be firstprivate",
34798 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
34799 && OMP_CLAUSE_DECL (c
) == decl
)
34800 error_at (loc
, "iteration variable %qD should not be reduction",
34805 if (code
!= OMP_SIMD
)
34806 c
= build_omp_clause (loc
, OMP_CLAUSE_PRIVATE
);
34807 else if (collapse
== 1)
34808 c
= build_omp_clause (loc
, OMP_CLAUSE_LINEAR
);
34810 c
= build_omp_clause (loc
, OMP_CLAUSE_LASTPRIVATE
);
34811 OMP_CLAUSE_DECL (c
) = add_private_clause
;
34812 c
= finish_omp_clauses (c
, C_ORT_OMP
);
34815 OMP_CLAUSE_CHAIN (c
) = clauses
;
34817 /* For linear, signal that we need to fill up
34818 the so far unknown linear step. */
34819 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
)
34820 OMP_CLAUSE_LINEAR_STEP (c
) = NULL_TREE
;
34826 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
34827 cond
= cp_parser_omp_for_cond (parser
, decl
, code
);
34828 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
34831 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
34833 /* If decl is an iterator, preserve the operator on decl
34834 until finish_omp_for. */
34836 && ((processing_template_decl
34837 && (TREE_TYPE (real_decl
) == NULL_TREE
34838 || !POINTER_TYPE_P (TREE_TYPE (real_decl
))))
34839 || CLASS_TYPE_P (TREE_TYPE (real_decl
))))
34840 incr
= cp_parser_omp_for_incr (parser
, real_decl
);
34842 incr
= cp_parser_expression (parser
);
34843 if (!EXPR_HAS_LOCATION (incr
))
34844 protected_set_expr_location (incr
, input_location
);
34847 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
34848 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
34849 /*or_comma=*/false,
34850 /*consume_paren=*/true);
34852 TREE_VEC_ELT (declv
, i
) = decl
;
34853 TREE_VEC_ELT (initv
, i
) = init
;
34854 TREE_VEC_ELT (condv
, i
) = cond
;
34855 TREE_VEC_ELT (incrv
, i
) = incr
;
34858 orig_inits
.safe_grow_cleared (i
+ 1);
34859 orig_inits
[i
] = orig_init
;
34862 if (i
== count
- 1)
34865 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
34866 in between the collapsed for loops to be still considered perfectly
34867 nested. Hopefully the final version clarifies this.
34868 For now handle (multiple) {'s and empty statements. */
34869 cp_parser_parse_tentatively (parser
);
34872 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
34874 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
34876 cp_lexer_consume_token (parser
->lexer
);
34879 else if (bracecount
34880 && cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
34881 cp_lexer_consume_token (parser
->lexer
);
34884 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
34885 error_at (loc
, "not enough for loops to collapse");
34886 collapse_err
= true;
34887 cp_parser_abort_tentative_parse (parser
);
34895 cp_parser_parse_definitely (parser
);
34896 nbraces
+= bracecount
;
34903 /* Note that we saved the original contents of this flag when we entered
34904 the structured block, and so we don't need to re-save it here. */
34905 if (code
== CILK_SIMD
|| code
== CILK_FOR
)
34906 parser
->in_statement
= IN_CILK_SIMD_FOR
;
34908 parser
->in_statement
= IN_OMP_FOR
;
34910 /* Note that the grammar doesn't call for a structured block here,
34911 though the loop as a whole is a structured block. */
34912 body
= push_stmt_list ();
34913 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
34914 body
= pop_stmt_list (body
);
34916 if (declv
== NULL_TREE
)
34919 ret
= finish_omp_for (loc_first
, code
, declv
, NULL
, initv
, condv
, incrv
,
34920 body
, pre_body
, &orig_inits
, clauses
);
34924 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
34926 cp_lexer_consume_token (parser
->lexer
);
34929 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
34930 cp_lexer_consume_token (parser
->lexer
);
34935 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
34936 "collapsed loops not perfectly nested");
34938 collapse_err
= true;
34939 cp_parser_statement_seq_opt (parser
, NULL
);
34940 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
34945 while (!for_block
->is_empty ())
34947 tree t
= for_block
->pop ();
34948 if (TREE_CODE (t
) == STATEMENT_LIST
)
34949 add_stmt (pop_stmt_list (t
));
34953 release_tree_vector (for_block
);
34958 /* Helper function for OpenMP parsing, split clauses and call
34959 finish_omp_clauses on each of the set of clauses afterwards. */
34962 cp_omp_split_clauses (location_t loc
, enum tree_code code
,
34963 omp_clause_mask mask
, tree clauses
, tree
*cclauses
)
34966 c_omp_split_clauses (loc
, code
, mask
, clauses
, cclauses
);
34967 for (i
= 0; i
< C_OMP_CLAUSE_SPLIT_COUNT
; i
++)
34969 cclauses
[i
] = finish_omp_clauses (cclauses
[i
], C_ORT_OMP
);
34973 #pragma omp simd simd-clause[optseq] new-line
34976 #define OMP_SIMD_CLAUSE_MASK \
34977 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
34978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
34979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
34980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
34981 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34982 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34983 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34987 cp_parser_omp_simd (cp_parser
*parser
, cp_token
*pragma_tok
,
34988 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
34991 tree clauses
, sb
, ret
;
34993 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
34995 strcat (p_name
, " simd");
34996 mask
|= OMP_SIMD_CLAUSE_MASK
;
34998 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
35002 cp_omp_split_clauses (loc
, OMP_SIMD
, mask
, clauses
, cclauses
);
35003 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_SIMD
];
35004 tree c
= omp_find_clause (cclauses
[C_OMP_CLAUSE_SPLIT_FOR
],
35005 OMP_CLAUSE_ORDERED
);
35006 if (c
&& OMP_CLAUSE_ORDERED_EXPR (c
))
35008 error_at (OMP_CLAUSE_LOCATION (c
),
35009 "%<ordered%> clause with parameter may not be specified "
35010 "on %qs construct", p_name
);
35011 OMP_CLAUSE_ORDERED_EXPR (c
) = NULL_TREE
;
35015 sb
= begin_omp_structured_block ();
35016 save
= cp_parser_begin_omp_structured_block (parser
);
35018 ret
= cp_parser_omp_for_loop (parser
, OMP_SIMD
, clauses
, cclauses
, if_p
);
35020 cp_parser_end_omp_structured_block (parser
, save
);
35021 add_stmt (finish_omp_structured_block (sb
));
35027 #pragma omp for for-clause[optseq] new-line
35031 #pragma omp for simd for-simd-clause[optseq] new-line
35034 #define OMP_FOR_CLAUSE_MASK \
35035 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35046 cp_parser_omp_for (cp_parser
*parser
, cp_token
*pragma_tok
,
35047 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
35050 tree clauses
, sb
, ret
;
35052 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
35054 strcat (p_name
, " for");
35055 mask
|= OMP_FOR_CLAUSE_MASK
;
35056 /* parallel for{, simd} disallows nowait clause, but for
35057 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35058 if (cclauses
&& (mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_MAP
)) == 0)
35059 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_NOWAIT
);
35060 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35061 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) != 0)
35062 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_ORDERED
);
35064 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35066 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35067 const char *p
= IDENTIFIER_POINTER (id
);
35069 if (strcmp (p
, "simd") == 0)
35071 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
35072 if (cclauses
== NULL
)
35073 cclauses
= cclauses_buf
;
35075 cp_lexer_consume_token (parser
->lexer
);
35076 if (!flag_openmp
) /* flag_openmp_simd */
35077 return cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
35079 sb
= begin_omp_structured_block ();
35080 save
= cp_parser_begin_omp_structured_block (parser
);
35081 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
35083 cp_parser_end_omp_structured_block (parser
, save
);
35084 tree body
= finish_omp_structured_block (sb
);
35087 ret
= make_node (OMP_FOR
);
35088 TREE_TYPE (ret
) = void_type_node
;
35089 OMP_FOR_BODY (ret
) = body
;
35090 OMP_FOR_CLAUSES (ret
) = cclauses
[C_OMP_CLAUSE_SPLIT_FOR
];
35091 SET_EXPR_LOCATION (ret
, loc
);
35096 if (!flag_openmp
) /* flag_openmp_simd */
35098 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35102 /* Composite distribute parallel for disallows linear clause. */
35103 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) != 0)
35104 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_LINEAR
);
35106 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
35110 cp_omp_split_clauses (loc
, OMP_FOR
, mask
, clauses
, cclauses
);
35111 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_FOR
];
35114 sb
= begin_omp_structured_block ();
35115 save
= cp_parser_begin_omp_structured_block (parser
);
35117 ret
= cp_parser_omp_for_loop (parser
, OMP_FOR
, clauses
, cclauses
, if_p
);
35119 cp_parser_end_omp_structured_block (parser
, save
);
35120 add_stmt (finish_omp_structured_block (sb
));
35126 # pragma omp master new-line
35127 structured-block */
35130 cp_parser_omp_master (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
35132 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35133 return c_finish_omp_master (input_location
,
35134 cp_parser_omp_structured_block (parser
, if_p
));
35138 # pragma omp ordered new-line
35142 # pragma omp ordered ordered-clauses new-line
35143 structured-block */
35145 #define OMP_ORDERED_CLAUSE_MASK \
35146 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35147 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35149 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35150 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35153 cp_parser_omp_ordered (cp_parser
*parser
, cp_token
*pragma_tok
,
35154 enum pragma_context context
, bool *if_p
)
35156 location_t loc
= pragma_tok
->location
;
35158 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35160 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35161 const char *p
= IDENTIFIER_POINTER (id
);
35163 if (strcmp (p
, "depend") == 0)
35165 if (context
== pragma_stmt
)
35167 error_at (pragma_tok
->location
, "%<#pragma omp ordered%> with "
35168 "%<depend%> clause may only be used in compound "
35170 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35174 = cp_parser_omp_all_clauses (parser
,
35175 OMP_ORDERED_DEPEND_CLAUSE_MASK
,
35176 "#pragma omp ordered", pragma_tok
);
35177 c_finish_omp_ordered (loc
, clauses
, NULL_TREE
);
35183 = cp_parser_omp_all_clauses (parser
, OMP_ORDERED_CLAUSE_MASK
,
35184 "#pragma omp ordered", pragma_tok
);
35185 c_finish_omp_ordered (loc
, clauses
,
35186 cp_parser_omp_structured_block (parser
, if_p
));
35193 { section-sequence }
35196 section-directive[opt] structured-block
35197 section-sequence section-directive structured-block */
35200 cp_parser_omp_sections_scope (cp_parser
*parser
)
35202 tree stmt
, substmt
;
35203 bool error_suppress
= false;
35206 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
35209 stmt
= push_stmt_list ();
35211 if (cp_parser_pragma_kind (cp_lexer_peek_token (parser
->lexer
))
35212 != PRAGMA_OMP_SECTION
)
35214 substmt
= cp_parser_omp_structured_block (parser
, NULL
);
35215 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
35216 add_stmt (substmt
);
35221 tok
= cp_lexer_peek_token (parser
->lexer
);
35222 if (tok
->type
== CPP_CLOSE_BRACE
)
35224 if (tok
->type
== CPP_EOF
)
35227 if (cp_parser_pragma_kind (tok
) == PRAGMA_OMP_SECTION
)
35229 cp_lexer_consume_token (parser
->lexer
);
35230 cp_parser_require_pragma_eol (parser
, tok
);
35231 error_suppress
= false;
35233 else if (!error_suppress
)
35235 cp_parser_error (parser
, "expected %<#pragma omp section%> or %<}%>");
35236 error_suppress
= true;
35239 substmt
= cp_parser_omp_structured_block (parser
, NULL
);
35240 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
35241 add_stmt (substmt
);
35243 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
35245 substmt
= pop_stmt_list (stmt
);
35247 stmt
= make_node (OMP_SECTIONS
);
35248 TREE_TYPE (stmt
) = void_type_node
;
35249 OMP_SECTIONS_BODY (stmt
) = substmt
;
35256 # pragma omp sections sections-clause[optseq] newline
35259 #define OMP_SECTIONS_CLAUSE_MASK \
35260 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35267 cp_parser_omp_sections (cp_parser
*parser
, cp_token
*pragma_tok
,
35268 char *p_name
, omp_clause_mask mask
, tree
*cclauses
)
35271 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
35273 strcat (p_name
, " sections");
35274 mask
|= OMP_SECTIONS_CLAUSE_MASK
;
35276 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_NOWAIT
);
35278 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
35282 cp_omp_split_clauses (loc
, OMP_SECTIONS
, mask
, clauses
, cclauses
);
35283 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_SECTIONS
];
35286 ret
= cp_parser_omp_sections_scope (parser
);
35288 OMP_SECTIONS_CLAUSES (ret
) = clauses
;
35294 # pragma omp parallel parallel-clause[optseq] new-line
35296 # pragma omp parallel for parallel-for-clause[optseq] new-line
35298 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35302 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35303 structured-block */
35305 #define OMP_PARALLEL_CLAUSE_MASK \
35306 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35312 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35313 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35314 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35317 cp_parser_omp_parallel (cp_parser
*parser
, cp_token
*pragma_tok
,
35318 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
35321 tree stmt
, clauses
, block
;
35323 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
35325 strcat (p_name
, " parallel");
35326 mask
|= OMP_PARALLEL_CLAUSE_MASK
;
35327 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35328 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_MAP
)) != 0
35329 && (mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) == 0)
35330 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_COPYIN
);
35332 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
35334 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
35335 if (cclauses
== NULL
)
35336 cclauses
= cclauses_buf
;
35338 cp_lexer_consume_token (parser
->lexer
);
35339 if (!flag_openmp
) /* flag_openmp_simd */
35340 return cp_parser_omp_for (parser
, pragma_tok
, p_name
, mask
, cclauses
,
35342 block
= begin_omp_parallel ();
35343 save
= cp_parser_begin_omp_structured_block (parser
);
35344 tree ret
= cp_parser_omp_for (parser
, pragma_tok
, p_name
, mask
, cclauses
,
35346 cp_parser_end_omp_structured_block (parser
, save
);
35347 stmt
= finish_omp_parallel (cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
],
35349 if (ret
== NULL_TREE
)
35351 OMP_PARALLEL_COMBINED (stmt
) = 1;
35354 /* When combined with distribute, parallel has to be followed by for.
35355 #pragma omp target parallel is allowed though. */
35357 && (mask
& (OMP_CLAUSE_MASK_1
35358 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) != 0)
35360 error_at (loc
, "expected %<for%> after %qs", p_name
);
35361 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35364 else if (!flag_openmp
) /* flag_openmp_simd */
35366 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35369 else if (cclauses
== NULL
&& cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35371 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35372 const char *p
= IDENTIFIER_POINTER (id
);
35373 if (strcmp (p
, "sections") == 0)
35375 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
35376 cclauses
= cclauses_buf
;
35378 cp_lexer_consume_token (parser
->lexer
);
35379 block
= begin_omp_parallel ();
35380 save
= cp_parser_begin_omp_structured_block (parser
);
35381 cp_parser_omp_sections (parser
, pragma_tok
, p_name
, mask
, cclauses
);
35382 cp_parser_end_omp_structured_block (parser
, save
);
35383 stmt
= finish_omp_parallel (cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
],
35385 OMP_PARALLEL_COMBINED (stmt
) = 1;
35390 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
35394 cp_omp_split_clauses (loc
, OMP_PARALLEL
, mask
, clauses
, cclauses
);
35395 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
];
35398 block
= begin_omp_parallel ();
35399 save
= cp_parser_begin_omp_structured_block (parser
);
35400 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
35401 cp_parser_end_omp_structured_block (parser
, save
);
35402 stmt
= finish_omp_parallel (clauses
, block
);
35407 # pragma omp single single-clause[optseq] new-line
35408 structured-block */
35410 #define OMP_SINGLE_CLAUSE_MASK \
35411 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35417 cp_parser_omp_single (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
35419 tree stmt
= make_node (OMP_SINGLE
);
35420 TREE_TYPE (stmt
) = void_type_node
;
35422 OMP_SINGLE_CLAUSES (stmt
)
35423 = cp_parser_omp_all_clauses (parser
, OMP_SINGLE_CLAUSE_MASK
,
35424 "#pragma omp single", pragma_tok
);
35425 OMP_SINGLE_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
35427 return add_stmt (stmt
);
35431 # pragma omp task task-clause[optseq] new-line
35432 structured-block */
35434 #define OMP_TASK_CLAUSE_MASK \
35435 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35436 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35447 cp_parser_omp_task (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
35449 tree clauses
, block
;
35452 clauses
= cp_parser_omp_all_clauses (parser
, OMP_TASK_CLAUSE_MASK
,
35453 "#pragma omp task", pragma_tok
);
35454 block
= begin_omp_task ();
35455 save
= cp_parser_begin_omp_structured_block (parser
);
35456 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
35457 cp_parser_end_omp_structured_block (parser
, save
);
35458 return finish_omp_task (clauses
, block
);
35462 # pragma omp taskwait new-line */
35465 cp_parser_omp_taskwait (cp_parser
*parser
, cp_token
*pragma_tok
)
35467 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35468 finish_omp_taskwait ();
35472 # pragma omp taskyield new-line */
35475 cp_parser_omp_taskyield (cp_parser
*parser
, cp_token
*pragma_tok
)
35477 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35478 finish_omp_taskyield ();
35482 # pragma omp taskgroup new-line
35483 structured-block */
35486 cp_parser_omp_taskgroup (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
35488 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35489 return c_finish_omp_taskgroup (input_location
,
35490 cp_parser_omp_structured_block (parser
,
35496 # pragma omp threadprivate (variable-list) */
35499 cp_parser_omp_threadprivate (cp_parser
*parser
, cp_token
*pragma_tok
)
35503 vars
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
35504 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35506 finish_omp_threadprivate (vars
);
35510 # pragma omp cancel cancel-clause[optseq] new-line */
35512 #define OMP_CANCEL_CLAUSE_MASK \
35513 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35520 cp_parser_omp_cancel (cp_parser
*parser
, cp_token
*pragma_tok
)
35522 tree clauses
= cp_parser_omp_all_clauses (parser
, OMP_CANCEL_CLAUSE_MASK
,
35523 "#pragma omp cancel", pragma_tok
);
35524 finish_omp_cancel (clauses
);
35528 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35530 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35531 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35532 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35537 cp_parser_omp_cancellation_point (cp_parser
*parser
, cp_token
*pragma_tok
,
35538 enum pragma_context context
)
35541 bool point_seen
= false;
35543 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35545 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35546 const char *p
= IDENTIFIER_POINTER (id
);
35548 if (strcmp (p
, "point") == 0)
35550 cp_lexer_consume_token (parser
->lexer
);
35556 cp_parser_error (parser
, "expected %<point%>");
35557 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35561 if (context
!= pragma_compound
)
35563 if (context
== pragma_stmt
)
35564 error_at (pragma_tok
->location
,
35565 "%<#pragma %s%> may only be used in compound statements",
35566 "omp cancellation point");
35568 cp_parser_error (parser
, "expected declaration specifiers");
35569 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35573 clauses
= cp_parser_omp_all_clauses (parser
,
35574 OMP_CANCELLATION_POINT_CLAUSE_MASK
,
35575 "#pragma omp cancellation point",
35577 finish_omp_cancellation_point (clauses
);
35581 #pragma omp distribute distribute-clause[optseq] new-line
35584 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35585 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35586 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35587 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35592 cp_parser_omp_distribute (cp_parser
*parser
, cp_token
*pragma_tok
,
35593 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
35596 tree clauses
, sb
, ret
;
35598 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
35600 strcat (p_name
, " distribute");
35601 mask
|= OMP_DISTRIBUTE_CLAUSE_MASK
;
35603 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35605 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35606 const char *p
= IDENTIFIER_POINTER (id
);
35608 bool parallel
= false;
35610 if (strcmp (p
, "simd") == 0)
35613 parallel
= strcmp (p
, "parallel") == 0;
35614 if (parallel
|| simd
)
35616 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
35617 if (cclauses
== NULL
)
35618 cclauses
= cclauses_buf
;
35619 cp_lexer_consume_token (parser
->lexer
);
35620 if (!flag_openmp
) /* flag_openmp_simd */
35623 return cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
35626 return cp_parser_omp_parallel (parser
, pragma_tok
, p_name
, mask
,
35629 sb
= begin_omp_structured_block ();
35630 save
= cp_parser_begin_omp_structured_block (parser
);
35632 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
35635 ret
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
, mask
,
35637 cp_parser_end_omp_structured_block (parser
, save
);
35638 tree body
= finish_omp_structured_block (sb
);
35641 ret
= make_node (OMP_DISTRIBUTE
);
35642 TREE_TYPE (ret
) = void_type_node
;
35643 OMP_FOR_BODY (ret
) = body
;
35644 OMP_FOR_CLAUSES (ret
) = cclauses
[C_OMP_CLAUSE_SPLIT_DISTRIBUTE
];
35645 SET_EXPR_LOCATION (ret
, loc
);
35650 if (!flag_openmp
) /* flag_openmp_simd */
35652 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35656 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
35660 cp_omp_split_clauses (loc
, OMP_DISTRIBUTE
, mask
, clauses
, cclauses
);
35661 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_DISTRIBUTE
];
35664 sb
= begin_omp_structured_block ();
35665 save
= cp_parser_begin_omp_structured_block (parser
);
35667 ret
= cp_parser_omp_for_loop (parser
, OMP_DISTRIBUTE
, clauses
, NULL
, if_p
);
35669 cp_parser_end_omp_structured_block (parser
, save
);
35670 add_stmt (finish_omp_structured_block (sb
));
35676 # pragma omp teams teams-clause[optseq] new-line
35677 structured-block */
35679 #define OMP_TEAMS_CLAUSE_MASK \
35680 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
35685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
35686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
35689 cp_parser_omp_teams (cp_parser
*parser
, cp_token
*pragma_tok
,
35690 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
35693 tree clauses
, sb
, ret
;
35695 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
35697 strcat (p_name
, " teams");
35698 mask
|= OMP_TEAMS_CLAUSE_MASK
;
35700 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35702 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35703 const char *p
= IDENTIFIER_POINTER (id
);
35704 if (strcmp (p
, "distribute") == 0)
35706 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
35707 if (cclauses
== NULL
)
35708 cclauses
= cclauses_buf
;
35710 cp_lexer_consume_token (parser
->lexer
);
35711 if (!flag_openmp
) /* flag_openmp_simd */
35712 return cp_parser_omp_distribute (parser
, pragma_tok
, p_name
, mask
,
35714 sb
= begin_omp_structured_block ();
35715 save
= cp_parser_begin_omp_structured_block (parser
);
35716 ret
= cp_parser_omp_distribute (parser
, pragma_tok
, p_name
, mask
,
35718 cp_parser_end_omp_structured_block (parser
, save
);
35719 tree body
= finish_omp_structured_block (sb
);
35722 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_TEAMS
];
35723 ret
= make_node (OMP_TEAMS
);
35724 TREE_TYPE (ret
) = void_type_node
;
35725 OMP_TEAMS_CLAUSES (ret
) = clauses
;
35726 OMP_TEAMS_BODY (ret
) = body
;
35727 OMP_TEAMS_COMBINED (ret
) = 1;
35728 SET_EXPR_LOCATION (ret
, loc
);
35729 return add_stmt (ret
);
35732 if (!flag_openmp
) /* flag_openmp_simd */
35734 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35738 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
35742 cp_omp_split_clauses (loc
, OMP_TEAMS
, mask
, clauses
, cclauses
);
35743 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_TEAMS
];
35746 tree stmt
= make_node (OMP_TEAMS
);
35747 TREE_TYPE (stmt
) = void_type_node
;
35748 OMP_TEAMS_CLAUSES (stmt
) = clauses
;
35749 OMP_TEAMS_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
35750 SET_EXPR_LOCATION (stmt
, loc
);
35752 return add_stmt (stmt
);
35756 # pragma omp target data target-data-clause[optseq] new-line
35757 structured-block */
35759 #define OMP_TARGET_DATA_CLAUSE_MASK \
35760 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
35766 cp_parser_omp_target_data (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
35769 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_DATA_CLAUSE_MASK
,
35770 "#pragma omp target data", pragma_tok
);
35772 for (tree
*pc
= &clauses
; *pc
;)
35774 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
35775 switch (OMP_CLAUSE_MAP_KIND (*pc
))
35778 case GOMP_MAP_ALWAYS_TO
:
35779 case GOMP_MAP_FROM
:
35780 case GOMP_MAP_ALWAYS_FROM
:
35781 case GOMP_MAP_TOFROM
:
35782 case GOMP_MAP_ALWAYS_TOFROM
:
35783 case GOMP_MAP_ALLOC
:
35786 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
35787 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
35788 case GOMP_MAP_ALWAYS_POINTER
:
35792 error_at (OMP_CLAUSE_LOCATION (*pc
),
35793 "%<#pragma omp target data%> with map-type other "
35794 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35795 "on %<map%> clause");
35796 *pc
= OMP_CLAUSE_CHAIN (*pc
);
35799 pc
= &OMP_CLAUSE_CHAIN (*pc
);
35805 error_at (pragma_tok
->location
,
35806 "%<#pragma omp target data%> must contain at least "
35807 "one %<map%> clause");
35811 tree stmt
= make_node (OMP_TARGET_DATA
);
35812 TREE_TYPE (stmt
) = void_type_node
;
35813 OMP_TARGET_DATA_CLAUSES (stmt
) = clauses
;
35815 keep_next_level (true);
35816 OMP_TARGET_DATA_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
35818 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35819 return add_stmt (stmt
);
35823 # pragma omp target enter data target-enter-data-clause[optseq] new-line
35824 structured-block */
35826 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
35827 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35834 cp_parser_omp_target_enter_data (cp_parser
*parser
, cp_token
*pragma_tok
,
35835 enum pragma_context context
)
35837 bool data_seen
= false;
35838 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35840 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35841 const char *p
= IDENTIFIER_POINTER (id
);
35843 if (strcmp (p
, "data") == 0)
35845 cp_lexer_consume_token (parser
->lexer
);
35851 cp_parser_error (parser
, "expected %<data%>");
35852 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35856 if (context
== pragma_stmt
)
35858 error_at (pragma_tok
->location
,
35859 "%<#pragma %s%> may only be used in compound statements",
35860 "omp target enter data");
35861 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35866 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_ENTER_DATA_CLAUSE_MASK
,
35867 "#pragma omp target enter data", pragma_tok
);
35869 for (tree
*pc
= &clauses
; *pc
;)
35871 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
35872 switch (OMP_CLAUSE_MAP_KIND (*pc
))
35875 case GOMP_MAP_ALWAYS_TO
:
35876 case GOMP_MAP_ALLOC
:
35879 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
35880 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
35881 case GOMP_MAP_ALWAYS_POINTER
:
35885 error_at (OMP_CLAUSE_LOCATION (*pc
),
35886 "%<#pragma omp target enter data%> with map-type other "
35887 "than %<to%> or %<alloc%> on %<map%> clause");
35888 *pc
= OMP_CLAUSE_CHAIN (*pc
);
35891 pc
= &OMP_CLAUSE_CHAIN (*pc
);
35897 error_at (pragma_tok
->location
,
35898 "%<#pragma omp target enter data%> must contain at least "
35899 "one %<map%> clause");
35903 tree stmt
= make_node (OMP_TARGET_ENTER_DATA
);
35904 TREE_TYPE (stmt
) = void_type_node
;
35905 OMP_TARGET_ENTER_DATA_CLAUSES (stmt
) = clauses
;
35906 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35907 return add_stmt (stmt
);
35911 # pragma omp target exit data target-enter-data-clause[optseq] new-line
35912 structured-block */
35914 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
35915 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
35916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
35917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35922 cp_parser_omp_target_exit_data (cp_parser
*parser
, cp_token
*pragma_tok
,
35923 enum pragma_context context
)
35925 bool data_seen
= false;
35926 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35928 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35929 const char *p
= IDENTIFIER_POINTER (id
);
35931 if (strcmp (p
, "data") == 0)
35933 cp_lexer_consume_token (parser
->lexer
);
35939 cp_parser_error (parser
, "expected %<data%>");
35940 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35944 if (context
== pragma_stmt
)
35946 error_at (pragma_tok
->location
,
35947 "%<#pragma %s%> may only be used in compound statements",
35948 "omp target exit data");
35949 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35954 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_EXIT_DATA_CLAUSE_MASK
,
35955 "#pragma omp target exit data", pragma_tok
);
35957 for (tree
*pc
= &clauses
; *pc
;)
35959 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
35960 switch (OMP_CLAUSE_MAP_KIND (*pc
))
35962 case GOMP_MAP_FROM
:
35963 case GOMP_MAP_ALWAYS_FROM
:
35964 case GOMP_MAP_RELEASE
:
35965 case GOMP_MAP_DELETE
:
35968 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
35969 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
35970 case GOMP_MAP_ALWAYS_POINTER
:
35974 error_at (OMP_CLAUSE_LOCATION (*pc
),
35975 "%<#pragma omp target exit data%> with map-type other "
35976 "than %<from%>, %<release%> or %<delete%> on %<map%>"
35978 *pc
= OMP_CLAUSE_CHAIN (*pc
);
35981 pc
= &OMP_CLAUSE_CHAIN (*pc
);
35987 error_at (pragma_tok
->location
,
35988 "%<#pragma omp target exit data%> must contain at least "
35989 "one %<map%> clause");
35993 tree stmt
= make_node (OMP_TARGET_EXIT_DATA
);
35994 TREE_TYPE (stmt
) = void_type_node
;
35995 OMP_TARGET_EXIT_DATA_CLAUSES (stmt
) = clauses
;
35996 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35997 return add_stmt (stmt
);
36001 # pragma omp target update target-update-clause[optseq] new-line */
36003 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36004 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36012 cp_parser_omp_target_update (cp_parser
*parser
, cp_token
*pragma_tok
,
36013 enum pragma_context context
)
36015 if (context
== pragma_stmt
)
36017 error_at (pragma_tok
->location
,
36018 "%<#pragma %s%> may only be used in compound statements",
36019 "omp target update");
36020 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36025 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_UPDATE_CLAUSE_MASK
,
36026 "#pragma omp target update", pragma_tok
);
36027 if (omp_find_clause (clauses
, OMP_CLAUSE_TO
) == NULL_TREE
36028 && omp_find_clause (clauses
, OMP_CLAUSE_FROM
) == NULL_TREE
)
36030 error_at (pragma_tok
->location
,
36031 "%<#pragma omp target update%> must contain at least one "
36032 "%<from%> or %<to%> clauses");
36036 tree stmt
= make_node (OMP_TARGET_UPDATE
);
36037 TREE_TYPE (stmt
) = void_type_node
;
36038 OMP_TARGET_UPDATE_CLAUSES (stmt
) = clauses
;
36039 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
36045 # pragma omp target target-clause[optseq] new-line
36046 structured-block */
36048 #define OMP_TARGET_CLAUSE_MASK \
36049 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36060 cp_parser_omp_target (cp_parser
*parser
, cp_token
*pragma_tok
,
36061 enum pragma_context context
, bool *if_p
)
36063 tree
*pc
= NULL
, stmt
;
36065 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
36067 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
36068 const char *p
= IDENTIFIER_POINTER (id
);
36069 enum tree_code ccode
= ERROR_MARK
;
36071 if (strcmp (p
, "teams") == 0)
36073 else if (strcmp (p
, "parallel") == 0)
36074 ccode
= OMP_PARALLEL
;
36075 else if (strcmp (p
, "simd") == 0)
36077 if (ccode
!= ERROR_MARK
)
36079 tree cclauses
[C_OMP_CLAUSE_SPLIT_COUNT
];
36080 char p_name
[sizeof ("#pragma omp target teams distribute "
36081 "parallel for simd")];
36083 cp_lexer_consume_token (parser
->lexer
);
36084 strcpy (p_name
, "#pragma omp target");
36085 if (!flag_openmp
) /* flag_openmp_simd */
36091 stmt
= cp_parser_omp_teams (parser
, pragma_tok
, p_name
,
36092 OMP_TARGET_CLAUSE_MASK
,
36096 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
,
36097 OMP_TARGET_CLAUSE_MASK
,
36101 stmt
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
,
36102 OMP_TARGET_CLAUSE_MASK
,
36106 gcc_unreachable ();
36108 return stmt
!= NULL_TREE
;
36110 keep_next_level (true);
36111 tree sb
= begin_omp_structured_block (), ret
;
36112 unsigned save
= cp_parser_begin_omp_structured_block (parser
);
36116 ret
= cp_parser_omp_teams (parser
, pragma_tok
, p_name
,
36117 OMP_TARGET_CLAUSE_MASK
, cclauses
,
36121 ret
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
,
36122 OMP_TARGET_CLAUSE_MASK
, cclauses
,
36126 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
,
36127 OMP_TARGET_CLAUSE_MASK
, cclauses
,
36131 gcc_unreachable ();
36133 cp_parser_end_omp_structured_block (parser
, save
);
36134 tree body
= finish_omp_structured_block (sb
);
36135 if (ret
== NULL_TREE
)
36137 if (ccode
== OMP_TEAMS
&& !processing_template_decl
)
36139 /* For combined target teams, ensure the num_teams and
36140 thread_limit clause expressions are evaluated on the host,
36141 before entering the target construct. */
36143 for (c
= cclauses
[C_OMP_CLAUSE_SPLIT_TEAMS
];
36144 c
; c
= OMP_CLAUSE_CHAIN (c
))
36145 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
36146 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
36147 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
36149 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
36150 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
36151 if (expr
== error_mark_node
)
36153 tree tmp
= TARGET_EXPR_SLOT (expr
);
36155 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
36156 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
36157 OMP_CLAUSE_FIRSTPRIVATE
);
36158 OMP_CLAUSE_DECL (tc
) = tmp
;
36159 OMP_CLAUSE_CHAIN (tc
)
36160 = cclauses
[C_OMP_CLAUSE_SPLIT_TARGET
];
36161 cclauses
[C_OMP_CLAUSE_SPLIT_TARGET
] = tc
;
36164 tree stmt
= make_node (OMP_TARGET
);
36165 TREE_TYPE (stmt
) = void_type_node
;
36166 OMP_TARGET_CLAUSES (stmt
) = cclauses
[C_OMP_CLAUSE_SPLIT_TARGET
];
36167 OMP_TARGET_BODY (stmt
) = body
;
36168 OMP_TARGET_COMBINED (stmt
) = 1;
36169 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
36171 pc
= &OMP_TARGET_CLAUSES (stmt
);
36172 goto check_clauses
;
36174 else if (!flag_openmp
) /* flag_openmp_simd */
36176 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36179 else if (strcmp (p
, "data") == 0)
36181 cp_lexer_consume_token (parser
->lexer
);
36182 cp_parser_omp_target_data (parser
, pragma_tok
, if_p
);
36185 else if (strcmp (p
, "enter") == 0)
36187 cp_lexer_consume_token (parser
->lexer
);
36188 cp_parser_omp_target_enter_data (parser
, pragma_tok
, context
);
36191 else if (strcmp (p
, "exit") == 0)
36193 cp_lexer_consume_token (parser
->lexer
);
36194 cp_parser_omp_target_exit_data (parser
, pragma_tok
, context
);
36197 else if (strcmp (p
, "update") == 0)
36199 cp_lexer_consume_token (parser
->lexer
);
36200 return cp_parser_omp_target_update (parser
, pragma_tok
, context
);
36203 if (!flag_openmp
) /* flag_openmp_simd */
36205 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36209 stmt
= make_node (OMP_TARGET
);
36210 TREE_TYPE (stmt
) = void_type_node
;
36212 OMP_TARGET_CLAUSES (stmt
)
36213 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_CLAUSE_MASK
,
36214 "#pragma omp target", pragma_tok
);
36215 pc
= &OMP_TARGET_CLAUSES (stmt
);
36216 keep_next_level (true);
36217 OMP_TARGET_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
36219 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
36225 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
36226 switch (OMP_CLAUSE_MAP_KIND (*pc
))
36229 case GOMP_MAP_ALWAYS_TO
:
36230 case GOMP_MAP_FROM
:
36231 case GOMP_MAP_ALWAYS_FROM
:
36232 case GOMP_MAP_TOFROM
:
36233 case GOMP_MAP_ALWAYS_TOFROM
:
36234 case GOMP_MAP_ALLOC
:
36235 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
36236 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
36237 case GOMP_MAP_ALWAYS_POINTER
:
36240 error_at (OMP_CLAUSE_LOCATION (*pc
),
36241 "%<#pragma omp target%> with map-type other "
36242 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36243 "on %<map%> clause");
36244 *pc
= OMP_CLAUSE_CHAIN (*pc
);
36247 pc
= &OMP_CLAUSE_CHAIN (*pc
);
36253 # pragma acc cache (variable-list) new-line
36257 cp_parser_oacc_cache (cp_parser
*parser
, cp_token
*pragma_tok
)
36259 tree stmt
, clauses
;
36261 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE__CACHE_
, NULL_TREE
);
36262 clauses
= finish_omp_clauses (clauses
, C_ORT_ACC
);
36264 cp_parser_require_pragma_eol (parser
, cp_lexer_peek_token (parser
->lexer
));
36266 stmt
= make_node (OACC_CACHE
);
36267 TREE_TYPE (stmt
) = void_type_node
;
36268 OACC_CACHE_CLAUSES (stmt
) = clauses
;
36269 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
36276 # pragma acc data oacc-data-clause[optseq] new-line
36277 structured-block */
36279 #define OACC_DATA_CLAUSE_MASK \
36280 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36283 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36288 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36289 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36293 cp_parser_oacc_data (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
36295 tree stmt
, clauses
, block
;
36298 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_DATA_CLAUSE_MASK
,
36299 "#pragma acc data", pragma_tok
);
36301 block
= begin_omp_parallel ();
36302 save
= cp_parser_begin_omp_structured_block (parser
);
36303 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
36304 cp_parser_end_omp_structured_block (parser
, save
);
36305 stmt
= finish_oacc_data (clauses
, block
);
36310 # pragma acc host_data <clauses> new-line
36311 structured-block */
36313 #define OACC_HOST_DATA_CLAUSE_MASK \
36314 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36317 cp_parser_oacc_host_data (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
36319 tree stmt
, clauses
, block
;
36322 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_HOST_DATA_CLAUSE_MASK
,
36323 "#pragma acc host_data", pragma_tok
);
36325 block
= begin_omp_parallel ();
36326 save
= cp_parser_begin_omp_structured_block (parser
);
36327 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
36328 cp_parser_end_omp_structured_block (parser
, save
);
36329 stmt
= finish_oacc_host_data (clauses
, block
);
36334 # pragma acc declare oacc-data-clause[optseq] new-line
36337 #define OACC_DECLARE_CLAUSE_MASK \
36338 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36352 cp_parser_oacc_declare (cp_parser
*parser
, cp_token
*pragma_tok
)
36354 tree clauses
, stmt
;
36355 bool error
= false;
36357 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_DECLARE_CLAUSE_MASK
,
36358 "#pragma acc declare", pragma_tok
, true);
36361 if (omp_find_clause (clauses
, OMP_CLAUSE_MAP
) == NULL_TREE
)
36363 error_at (pragma_tok
->location
,
36364 "no valid clauses specified in %<#pragma acc declare%>");
36368 for (tree t
= clauses
; t
; t
= OMP_CLAUSE_CHAIN (t
))
36370 location_t loc
= OMP_CLAUSE_LOCATION (t
);
36371 tree decl
= OMP_CLAUSE_DECL (t
);
36372 if (!DECL_P (decl
))
36374 error_at (loc
, "array section in %<#pragma acc declare%>");
36378 gcc_assert (OMP_CLAUSE_CODE (t
) == OMP_CLAUSE_MAP
);
36379 switch (OMP_CLAUSE_MAP_KIND (t
))
36381 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
36382 case GOMP_MAP_FORCE_ALLOC
:
36383 case GOMP_MAP_FORCE_TO
:
36384 case GOMP_MAP_FORCE_DEVICEPTR
:
36385 case GOMP_MAP_DEVICE_RESIDENT
:
36388 case GOMP_MAP_LINK
:
36389 if (!global_bindings_p ()
36390 && (TREE_STATIC (decl
)
36391 || !DECL_EXTERNAL (decl
)))
36394 "%qD must be a global variable in "
36395 "%<#pragma acc declare link%>",
36403 if (global_bindings_p ())
36405 error_at (loc
, "invalid OpenACC clause at file scope");
36409 if (DECL_EXTERNAL (decl
))
36412 "invalid use of %<extern%> variable %qD "
36413 "in %<#pragma acc declare%>", decl
);
36417 else if (TREE_PUBLIC (decl
))
36420 "invalid use of %<global%> variable %qD "
36421 "in %<#pragma acc declare%>", decl
);
36428 if (lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
))
36429 || lookup_attribute ("omp declare target link",
36430 DECL_ATTRIBUTES (decl
)))
36432 error_at (loc
, "variable %qD used more than once with "
36433 "%<#pragma acc declare%>", decl
);
36442 if (OMP_CLAUSE_MAP_KIND (t
) == GOMP_MAP_LINK
)
36443 id
= get_identifier ("omp declare target link");
36445 id
= get_identifier ("omp declare target");
36447 DECL_ATTRIBUTES (decl
)
36448 = tree_cons (id
, NULL_TREE
, DECL_ATTRIBUTES (decl
));
36449 if (global_bindings_p ())
36451 symtab_node
*node
= symtab_node::get (decl
);
36454 node
->offloadable
= 1;
36455 if (ENABLE_OFFLOADING
)
36457 g
->have_offload
= true;
36458 if (is_a
<varpool_node
*> (node
))
36459 vec_safe_push (offload_vars
, decl
);
36466 if (error
|| global_bindings_p ())
36469 stmt
= make_node (OACC_DECLARE
);
36470 TREE_TYPE (stmt
) = void_type_node
;
36471 OACC_DECLARE_CLAUSES (stmt
) = clauses
;
36472 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
36480 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36484 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36486 LOC is the location of the #pragma token.
36489 #define OACC_ENTER_DATA_CLAUSE_MASK \
36490 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36493 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36498 #define OACC_EXIT_DATA_CLAUSE_MASK \
36499 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36500 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36501 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36506 cp_parser_oacc_enter_exit_data (cp_parser
*parser
, cp_token
*pragma_tok
,
36509 location_t loc
= pragma_tok
->location
;
36510 tree stmt
, clauses
;
36511 const char *p
= "";
36513 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
36514 p
= IDENTIFIER_POINTER (cp_lexer_peek_token (parser
->lexer
)->u
.value
);
36516 if (strcmp (p
, "data") != 0)
36518 error_at (loc
, "expected %<data%> after %<#pragma acc %s%>",
36519 enter
? "enter" : "exit");
36520 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36524 cp_lexer_consume_token (parser
->lexer
);
36527 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_ENTER_DATA_CLAUSE_MASK
,
36528 "#pragma acc enter data", pragma_tok
);
36530 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_EXIT_DATA_CLAUSE_MASK
,
36531 "#pragma acc exit data", pragma_tok
);
36533 if (omp_find_clause (clauses
, OMP_CLAUSE_MAP
) == NULL_TREE
)
36535 error_at (loc
, "%<#pragma acc %s data%> has no data movement clause",
36536 enter
? "enter" : "exit");
36540 stmt
= enter
? make_node (OACC_ENTER_DATA
) : make_node (OACC_EXIT_DATA
);
36541 TREE_TYPE (stmt
) = void_type_node
;
36542 OMP_STANDALONE_CLAUSES (stmt
) = clauses
;
36543 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
36549 # pragma acc loop oacc-loop-clause[optseq] new-line
36550 structured-block */
36552 #define OACC_LOOP_CLAUSE_MASK \
36553 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36554 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36555 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36556 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36557 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36560 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36561 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36562 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36565 cp_parser_oacc_loop (cp_parser
*parser
, cp_token
*pragma_tok
, char *p_name
,
36566 omp_clause_mask mask
, tree
*cclauses
, bool *if_p
)
36568 bool is_parallel
= ((mask
>> PRAGMA_OACC_CLAUSE_REDUCTION
) & 1) == 1;
36570 strcat (p_name
, " loop");
36571 mask
|= OACC_LOOP_CLAUSE_MASK
;
36573 tree clauses
= cp_parser_oacc_all_clauses (parser
, mask
, p_name
, pragma_tok
,
36577 clauses
= c_oacc_split_loop_clauses (clauses
, cclauses
, is_parallel
);
36579 *cclauses
= finish_omp_clauses (*cclauses
, C_ORT_ACC
);
36581 clauses
= finish_omp_clauses (clauses
, C_ORT_ACC
);
36584 tree block
= begin_omp_structured_block ();
36585 int save
= cp_parser_begin_omp_structured_block (parser
);
36586 tree stmt
= cp_parser_omp_for_loop (parser
, OACC_LOOP
, clauses
, NULL
, if_p
);
36587 cp_parser_end_omp_structured_block (parser
, save
);
36588 add_stmt (finish_omp_structured_block (block
));
36594 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36599 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36603 #define OACC_KERNELS_CLAUSE_MASK \
36604 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36605 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36606 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36607 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36611 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36612 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36613 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36614 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36620 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36622 #define OACC_PARALLEL_CLAUSE_MASK \
36623 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36626 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36627 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36628 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36629 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36630 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36631 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36632 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36633 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36634 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36635 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36640 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36641 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36645 cp_parser_oacc_kernels_parallel (cp_parser
*parser
, cp_token
*pragma_tok
,
36646 char *p_name
, bool *if_p
)
36648 omp_clause_mask mask
;
36649 enum tree_code code
;
36650 switch (cp_parser_pragma_kind (pragma_tok
))
36652 case PRAGMA_OACC_KERNELS
:
36653 strcat (p_name
, " kernels");
36654 mask
= OACC_KERNELS_CLAUSE_MASK
;
36655 code
= OACC_KERNELS
;
36657 case PRAGMA_OACC_PARALLEL
:
36658 strcat (p_name
, " parallel");
36659 mask
= OACC_PARALLEL_CLAUSE_MASK
;
36660 code
= OACC_PARALLEL
;
36663 gcc_unreachable ();
36666 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
36669 = IDENTIFIER_POINTER (cp_lexer_peek_token (parser
->lexer
)->u
.value
);
36670 if (strcmp (p
, "loop") == 0)
36672 cp_lexer_consume_token (parser
->lexer
);
36673 tree block
= begin_omp_parallel ();
36675 cp_parser_oacc_loop (parser
, pragma_tok
, p_name
, mask
, &clauses
,
36677 return finish_omp_construct (code
, block
, clauses
);
36681 tree clauses
= cp_parser_oacc_all_clauses (parser
, mask
, p_name
, pragma_tok
);
36683 tree block
= begin_omp_parallel ();
36684 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
36685 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
36686 cp_parser_end_omp_structured_block (parser
, save
);
36687 return finish_omp_construct (code
, block
, clauses
);
36691 # pragma acc update oacc-update-clause[optseq] new-line
36694 #define OACC_UPDATE_CLAUSE_MASK \
36695 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
36697 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
36698 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36699 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
36700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
36703 cp_parser_oacc_update (cp_parser
*parser
, cp_token
*pragma_tok
)
36705 tree stmt
, clauses
;
36707 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_UPDATE_CLAUSE_MASK
,
36708 "#pragma acc update", pragma_tok
);
36710 if (omp_find_clause (clauses
, OMP_CLAUSE_MAP
) == NULL_TREE
)
36712 error_at (pragma_tok
->location
,
36713 "%<#pragma acc update%> must contain at least one "
36714 "%<device%> or %<host%> or %<self%> clause");
36718 stmt
= make_node (OACC_UPDATE
);
36719 TREE_TYPE (stmt
) = void_type_node
;
36720 OACC_UPDATE_CLAUSES (stmt
) = clauses
;
36721 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
36727 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
36729 LOC is the location of the #pragma token.
36732 #define OACC_WAIT_CLAUSE_MASK \
36733 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
36736 cp_parser_oacc_wait (cp_parser
*parser
, cp_token
*pragma_tok
)
36738 tree clauses
, list
= NULL_TREE
, stmt
= NULL_TREE
;
36739 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
36741 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
36742 list
= cp_parser_oacc_wait_list (parser
, loc
, list
);
36744 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_WAIT_CLAUSE_MASK
,
36745 "#pragma acc wait", pragma_tok
);
36747 stmt
= c_finish_oacc_wait (loc
, list
, clauses
);
36748 stmt
= finish_expr_stmt (stmt
);
36754 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
36756 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
36757 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
36758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
36759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
36760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
36761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
36762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
36765 cp_parser_omp_declare_simd (cp_parser
*parser
, cp_token
*pragma_tok
,
36766 enum pragma_context context
)
36768 bool first_p
= parser
->omp_declare_simd
== NULL
;
36769 cp_omp_declare_simd_data data
;
36772 data
.error_seen
= false;
36773 data
.fndecl_seen
= false;
36774 data
.tokens
= vNULL
;
36775 data
.clauses
= NULL_TREE
;
36776 /* It is safe to take the address of a local variable; it will only be
36777 used while this scope is live. */
36778 parser
->omp_declare_simd
= &data
;
36781 /* Store away all pragma tokens. */
36782 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
36783 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
36784 cp_lexer_consume_token (parser
->lexer
);
36785 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
36786 parser
->omp_declare_simd
->error_seen
= true;
36787 cp_parser_require_pragma_eol (parser
, pragma_tok
);
36788 struct cp_token_cache
*cp
36789 = cp_token_cache_new (pragma_tok
, cp_lexer_peek_token (parser
->lexer
));
36790 parser
->omp_declare_simd
->tokens
.safe_push (cp
);
36794 while (cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA
))
36795 cp_parser_pragma (parser
, context
, NULL
);
36798 case pragma_external
:
36799 cp_parser_declaration (parser
);
36801 case pragma_member
:
36802 cp_parser_member_declaration (parser
);
36804 case pragma_objc_icode
:
36805 cp_parser_block_declaration (parser
, /*statement_p=*/false);
36808 cp_parser_declaration_statement (parser
);
36811 if (parser
->omp_declare_simd
36812 && !parser
->omp_declare_simd
->error_seen
36813 && !parser
->omp_declare_simd
->fndecl_seen
)
36814 error_at (pragma_tok
->location
,
36815 "%<#pragma omp declare simd%> not immediately followed by "
36816 "function declaration or definition");
36817 data
.tokens
.release ();
36818 parser
->omp_declare_simd
= NULL
;
36822 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
36823 This function is modelled similar to the late parsing of omp declare
36827 cp_parser_late_parsing_cilk_simd_fn_info (cp_parser
*parser
, tree attrs
)
36829 struct cp_token_cache
*ce
;
36830 cp_omp_declare_simd_data
*info
= parser
->cilk_simd_fn_info
;
36833 if (parser
->omp_declare_simd
!= NULL
36834 || lookup_attribute ("simd", attrs
))
36836 error ("%<#pragma omp declare simd%> or %<simd%> attribute cannot be "
36837 "used in the same function marked as a Cilk Plus SIMD-enabled "
36839 parser
->cilk_simd_fn_info
->tokens
.release ();
36840 XDELETE (parser
->cilk_simd_fn_info
);
36841 parser
->cilk_simd_fn_info
= NULL
;
36844 if (!info
->error_seen
&& info
->fndecl_seen
)
36846 error ("vector attribute not immediately followed by a single function"
36847 " declaration or definition");
36848 info
->error_seen
= true;
36850 if (info
->error_seen
)
36853 FOR_EACH_VEC_ELT (info
->tokens
, ii
, ce
)
36857 cp_parser_push_lexer_for_tokens (parser
, ce
);
36858 parser
->lexer
->in_pragma
= true;
36859 cl
= cp_parser_omp_all_clauses (parser
, CILK_SIMD_FN_CLAUSE_MASK
,
36860 "SIMD-enabled functions attribute",
36862 cp_parser_pop_lexer (parser
);
36864 cl
= tree_cons (NULL_TREE
, cl
, NULL_TREE
);
36866 c
= build_tree_list (get_identifier ("cilk simd function"), NULL_TREE
);
36867 TREE_CHAIN (c
) = attrs
;
36870 c
= build_tree_list (get_identifier ("omp declare simd"), cl
);
36871 TREE_CHAIN (c
) = attrs
;
36872 if (processing_template_decl
)
36873 ATTR_IS_DEPENDENT (c
) = 1;
36876 info
->fndecl_seen
= true;
36877 parser
->cilk_simd_fn_info
->tokens
.release ();
36878 XDELETE (parser
->cilk_simd_fn_info
);
36879 parser
->cilk_simd_fn_info
= NULL
;
36883 /* Finalize #pragma omp declare simd clauses after direct declarator has
36884 been parsed, and put that into "omp declare simd" attribute. */
36887 cp_parser_late_parsing_omp_declare_simd (cp_parser
*parser
, tree attrs
)
36889 struct cp_token_cache
*ce
;
36890 cp_omp_declare_simd_data
*data
= parser
->omp_declare_simd
;
36893 if (!data
->error_seen
&& data
->fndecl_seen
)
36895 error ("%<#pragma omp declare simd%> not immediately followed by "
36896 "a single function declaration or definition");
36897 data
->error_seen
= true;
36899 if (data
->error_seen
)
36902 FOR_EACH_VEC_ELT (data
->tokens
, i
, ce
)
36906 cp_parser_push_lexer_for_tokens (parser
, ce
);
36907 parser
->lexer
->in_pragma
= true;
36908 gcc_assert (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_PRAGMA
);
36909 cp_token
*pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
36910 cp_lexer_consume_token (parser
->lexer
);
36911 cl
= cp_parser_omp_all_clauses (parser
, OMP_DECLARE_SIMD_CLAUSE_MASK
,
36912 "#pragma omp declare simd", pragma_tok
);
36913 cp_parser_pop_lexer (parser
);
36915 cl
= tree_cons (NULL_TREE
, cl
, NULL_TREE
);
36916 c
= build_tree_list (get_identifier ("omp declare simd"), cl
);
36917 TREE_CHAIN (c
) = attrs
;
36918 if (processing_template_decl
)
36919 ATTR_IS_DEPENDENT (c
) = 1;
36923 data
->fndecl_seen
= true;
36929 # pragma omp declare target new-line
36930 declarations and definitions
36931 # pragma omp end declare target new-line
36934 # pragma omp declare target ( extended-list ) new-line
36936 # pragma omp declare target declare-target-clauses[seq] new-line */
36938 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
36939 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
36943 cp_parser_omp_declare_target (cp_parser
*parser
, cp_token
*pragma_tok
)
36945 tree clauses
= NULL_TREE
;
36946 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
36948 = cp_parser_omp_all_clauses (parser
, OMP_DECLARE_TARGET_CLAUSE_MASK
,
36949 "#pragma omp declare target", pragma_tok
);
36950 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
36952 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_TO_DECLARE
,
36954 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP
);
36955 cp_parser_require_pragma_eol (parser
, pragma_tok
);
36959 cp_parser_require_pragma_eol (parser
, pragma_tok
);
36960 scope_chain
->omp_declare_target_attribute
++;
36963 if (scope_chain
->omp_declare_target_attribute
)
36964 error_at (pragma_tok
->location
,
36965 "%<#pragma omp declare target%> with clauses in between "
36966 "%<#pragma omp declare target%> without clauses and "
36967 "%<#pragma omp end declare target%>");
36968 for (tree c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
36970 tree t
= OMP_CLAUSE_DECL (c
), id
;
36971 tree at1
= lookup_attribute ("omp declare target", DECL_ATTRIBUTES (t
));
36972 tree at2
= lookup_attribute ("omp declare target link",
36973 DECL_ATTRIBUTES (t
));
36974 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINK
)
36976 id
= get_identifier ("omp declare target link");
36977 std::swap (at1
, at2
);
36980 id
= get_identifier ("omp declare target");
36983 error_at (OMP_CLAUSE_LOCATION (c
),
36984 "%qD specified both in declare target %<link%> and %<to%>"
36990 DECL_ATTRIBUTES (t
) = tree_cons (id
, NULL_TREE
, DECL_ATTRIBUTES (t
));
36991 if (TREE_CODE (t
) != FUNCTION_DECL
&& !is_global_var (t
))
36994 symtab_node
*node
= symtab_node::get (t
);
36997 node
->offloadable
= 1;
36998 if (ENABLE_OFFLOADING
)
37000 g
->have_offload
= true;
37001 if (is_a
<varpool_node
*> (node
))
37002 vec_safe_push (offload_vars
, t
);
37010 cp_parser_omp_end_declare_target (cp_parser
*parser
, cp_token
*pragma_tok
)
37012 const char *p
= "";
37013 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
37015 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
37016 p
= IDENTIFIER_POINTER (id
);
37018 if (strcmp (p
, "declare") == 0)
37020 cp_lexer_consume_token (parser
->lexer
);
37022 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
37024 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
37025 p
= IDENTIFIER_POINTER (id
);
37027 if (strcmp (p
, "target") == 0)
37028 cp_lexer_consume_token (parser
->lexer
);
37031 cp_parser_error (parser
, "expected %<target%>");
37032 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37038 cp_parser_error (parser
, "expected %<declare%>");
37039 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37042 cp_parser_require_pragma_eol (parser
, pragma_tok
);
37043 if (!scope_chain
->omp_declare_target_attribute
)
37044 error_at (pragma_tok
->location
,
37045 "%<#pragma omp end declare target%> without corresponding "
37046 "%<#pragma omp declare target%>");
37048 scope_chain
->omp_declare_target_attribute
--;
37051 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37052 expression and optional initializer clause of
37053 #pragma omp declare reduction. We store the expression(s) as
37054 either 3, 6 or 7 special statements inside of the artificial function's
37055 body. The first two statements are DECL_EXPRs for the artificial
37056 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37057 expression that uses those variables.
37058 If there was any INITIALIZER clause, this is followed by further statements,
37059 the fourth and fifth statements are DECL_EXPRs for the artificial
37060 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37061 constructor variant (first token after open paren is not omp_priv),
37062 then the sixth statement is a statement with the function call expression
37063 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37064 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37065 to initialize the OMP_PRIV artificial variable and there is seventh
37066 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37069 cp_parser_omp_declare_reduction_exprs (tree fndecl
, cp_parser
*parser
)
37071 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
37072 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
37073 type
= TREE_TYPE (type
);
37074 tree omp_out
= build_lang_decl (VAR_DECL
, get_identifier ("omp_out"), type
);
37075 DECL_ARTIFICIAL (omp_out
) = 1;
37076 pushdecl (omp_out
);
37077 add_decl_expr (omp_out
);
37078 tree omp_in
= build_lang_decl (VAR_DECL
, get_identifier ("omp_in"), type
);
37079 DECL_ARTIFICIAL (omp_in
) = 1;
37081 add_decl_expr (omp_in
);
37083 tree omp_priv
= NULL_TREE
, omp_orig
= NULL_TREE
, initializer
= NULL_TREE
;
37085 keep_next_level (true);
37086 tree block
= begin_omp_structured_block ();
37087 combiner
= cp_parser_expression (parser
);
37088 finish_expr_stmt (combiner
);
37089 block
= finish_omp_structured_block (block
);
37092 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
37095 const char *p
= "";
37096 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
37098 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
37099 p
= IDENTIFIER_POINTER (id
);
37102 if (strcmp (p
, "initializer") == 0)
37104 cp_lexer_consume_token (parser
->lexer
);
37105 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
37109 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
37111 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
37112 p
= IDENTIFIER_POINTER (id
);
37115 omp_priv
= build_lang_decl (VAR_DECL
, get_identifier ("omp_priv"), type
);
37116 DECL_ARTIFICIAL (omp_priv
) = 1;
37117 pushdecl (omp_priv
);
37118 add_decl_expr (omp_priv
);
37119 omp_orig
= build_lang_decl (VAR_DECL
, get_identifier ("omp_orig"), type
);
37120 DECL_ARTIFICIAL (omp_orig
) = 1;
37121 pushdecl (omp_orig
);
37122 add_decl_expr (omp_orig
);
37124 keep_next_level (true);
37125 block
= begin_omp_structured_block ();
37128 if (strcmp (p
, "omp_priv") == 0)
37130 bool is_direct_init
, is_non_constant_init
;
37132 cp_lexer_consume_token (parser
->lexer
);
37133 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37134 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
37135 || (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
37136 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
37138 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
37139 == CPP_CLOSE_PAREN
))
37141 finish_omp_structured_block (block
);
37142 error ("invalid initializer clause");
37145 initializer
= cp_parser_initializer (parser
, &is_direct_init
,
37146 &is_non_constant_init
);
37147 cp_finish_decl (omp_priv
, initializer
, !is_non_constant_init
,
37148 NULL_TREE
, LOOKUP_ONLYCONVERTING
);
37152 cp_parser_parse_tentatively (parser
);
37153 tree fn_name
= cp_parser_id_expression (parser
, /*template_p=*/false,
37154 /*check_dependency_p=*/true,
37155 /*template_p=*/NULL
,
37156 /*declarator_p=*/false,
37157 /*optional_p=*/false);
37158 vec
<tree
, va_gc
> *args
;
37159 if (fn_name
== error_mark_node
37160 || cp_parser_error_occurred (parser
)
37161 || !cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
37162 || ((args
= cp_parser_parenthesized_expression_list
37163 (parser
, non_attr
, /*cast_p=*/false,
37164 /*allow_expansion_p=*/true,
37165 /*non_constant_p=*/NULL
)),
37166 cp_parser_error_occurred (parser
)))
37168 finish_omp_structured_block (block
);
37169 cp_parser_abort_tentative_parse (parser
);
37170 cp_parser_error (parser
, "expected id-expression (arguments)");
37175 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
37176 if (arg
== omp_priv
37177 || (TREE_CODE (arg
) == ADDR_EXPR
37178 && TREE_OPERAND (arg
, 0) == omp_priv
))
37180 cp_parser_abort_tentative_parse (parser
);
37181 if (arg
== NULL_TREE
)
37182 error ("one of the initializer call arguments should be %<omp_priv%>"
37183 " or %<&omp_priv%>");
37184 initializer
= cp_parser_postfix_expression (parser
, false, false, false,
37186 finish_expr_stmt (initializer
);
37189 block
= finish_omp_structured_block (block
);
37190 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
37194 add_decl_expr (omp_orig
);
37196 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
37200 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA_EOL
))
37201 cp_parser_required_error (parser
, RT_PRAGMA_EOL
, /*keyword=*/false);
37207 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37208 initializer-clause[opt] new-line
37210 initializer-clause:
37211 initializer (omp_priv initializer)
37212 initializer (function-name (argument-list)) */
37215 cp_parser_omp_declare_reduction (cp_parser
*parser
, cp_token
*pragma_tok
,
37216 enum pragma_context
)
37218 auto_vec
<tree
> types
;
37219 enum tree_code reduc_code
= ERROR_MARK
;
37220 tree reduc_id
= NULL_TREE
, orig_reduc_id
= NULL_TREE
, type
;
37222 cp_token
*first_token
;
37223 cp_token_cache
*cp
;
37227 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37228 p
= obstack_alloc (&declarator_obstack
, 0);
37230 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
37233 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
37236 reduc_code
= PLUS_EXPR
;
37239 reduc_code
= MULT_EXPR
;
37242 reduc_code
= MINUS_EXPR
;
37245 reduc_code
= BIT_AND_EXPR
;
37248 reduc_code
= BIT_XOR_EXPR
;
37251 reduc_code
= BIT_IOR_EXPR
;
37254 reduc_code
= TRUTH_ANDIF_EXPR
;
37257 reduc_code
= TRUTH_ORIF_EXPR
;
37260 reduc_id
= orig_reduc_id
= cp_parser_identifier (parser
);
37263 cp_parser_error (parser
, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
37264 "%<|%>, %<&&%>, %<||%> or identifier");
37268 if (reduc_code
!= ERROR_MARK
)
37269 cp_lexer_consume_token (parser
->lexer
);
37271 reduc_id
= omp_reduction_id (reduc_code
, reduc_id
, NULL_TREE
);
37272 if (reduc_id
== error_mark_node
)
37275 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
37278 /* Types may not be defined in declare reduction type list. */
37279 const char *saved_message
;
37280 saved_message
= parser
->type_definition_forbidden_message
;
37281 parser
->type_definition_forbidden_message
37282 = G_("types may not be defined in declare reduction type list");
37283 bool saved_colon_corrects_to_scope_p
;
37284 saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
37285 parser
->colon_corrects_to_scope_p
= false;
37286 bool saved_colon_doesnt_start_class_def_p
;
37287 saved_colon_doesnt_start_class_def_p
37288 = parser
->colon_doesnt_start_class_def_p
;
37289 parser
->colon_doesnt_start_class_def_p
= true;
37293 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
37294 type
= cp_parser_type_id (parser
);
37295 if (type
== error_mark_node
)
37297 else if (ARITHMETIC_TYPE_P (type
)
37298 && (orig_reduc_id
== NULL_TREE
37299 || (TREE_CODE (type
) != COMPLEX_TYPE
37300 && (id_equal (orig_reduc_id
, "min")
37301 || id_equal (orig_reduc_id
, "max")))))
37302 error_at (loc
, "predeclared arithmetic type %qT in "
37303 "%<#pragma omp declare reduction%>", type
);
37304 else if (TREE_CODE (type
) == FUNCTION_TYPE
37305 || TREE_CODE (type
) == METHOD_TYPE
37306 || TREE_CODE (type
) == ARRAY_TYPE
)
37307 error_at (loc
, "function or array type %qT in "
37308 "%<#pragma omp declare reduction%>", type
);
37309 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
37310 error_at (loc
, "reference type %qT in "
37311 "%<#pragma omp declare reduction%>", type
);
37312 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
37313 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
37314 "%<#pragma omp declare reduction%>", type
);
37316 types
.safe_push (type
);
37318 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
37319 cp_lexer_consume_token (parser
->lexer
);
37324 /* Restore the saved message. */
37325 parser
->type_definition_forbidden_message
= saved_message
;
37326 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
37327 parser
->colon_doesnt_start_class_def_p
37328 = saved_colon_doesnt_start_class_def_p
;
37330 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
)
37331 || types
.is_empty ())
37334 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37338 first_token
= cp_lexer_peek_token (parser
->lexer
);
37341 FOR_EACH_VEC_ELT (types
, i
, type
)
37344 = build_function_type_list (void_type_node
,
37345 cp_build_reference_type (type
, false),
37347 tree this_reduc_id
= reduc_id
;
37348 if (!dependent_type_p (type
))
37349 this_reduc_id
= omp_reduction_id (ERROR_MARK
, reduc_id
, type
);
37350 tree fndecl
= build_lang_decl (FUNCTION_DECL
, this_reduc_id
, fntype
);
37351 DECL_SOURCE_LOCATION (fndecl
) = pragma_tok
->location
;
37352 DECL_ARTIFICIAL (fndecl
) = 1;
37353 DECL_EXTERNAL (fndecl
) = 1;
37354 DECL_DECLARED_INLINE_P (fndecl
) = 1;
37355 DECL_IGNORED_P (fndecl
) = 1;
37356 DECL_OMP_DECLARE_REDUCTION_P (fndecl
) = 1;
37357 SET_DECL_ASSEMBLER_NAME (fndecl
, get_identifier ("<udr>"));
37358 DECL_ATTRIBUTES (fndecl
)
37359 = tree_cons (get_identifier ("gnu_inline"), NULL_TREE
,
37360 DECL_ATTRIBUTES (fndecl
));
37361 if (processing_template_decl
)
37362 fndecl
= push_template_decl (fndecl
);
37363 bool block_scope
= false;
37364 tree block
= NULL_TREE
;
37365 if (current_function_decl
)
37367 block_scope
= true;
37368 DECL_CONTEXT (fndecl
) = global_namespace
;
37369 if (!processing_template_decl
)
37372 else if (current_class_type
)
37376 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
37377 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
37378 cp_lexer_consume_token (parser
->lexer
);
37379 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
37381 cp
= cp_token_cache_new (first_token
,
37382 cp_lexer_peek_nth_token (parser
->lexer
,
37385 DECL_STATIC_FUNCTION_P (fndecl
) = 1;
37386 finish_member_declaration (fndecl
);
37387 DECL_PENDING_INLINE_INFO (fndecl
) = cp
;
37388 DECL_PENDING_INLINE_P (fndecl
) = 1;
37389 vec_safe_push (unparsed_funs_with_definitions
, fndecl
);
37394 DECL_CONTEXT (fndecl
) = current_namespace
;
37398 start_preparsed_function (fndecl
, NULL_TREE
, SF_PRE_PARSED
);
37400 block
= begin_omp_structured_block ();
37403 cp_parser_push_lexer_for_tokens (parser
, cp
);
37404 parser
->lexer
->in_pragma
= true;
37406 if (!cp_parser_omp_declare_reduction_exprs (fndecl
, parser
))
37409 finish_function (0);
37411 DECL_CONTEXT (fndecl
) = current_function_decl
;
37413 cp_parser_pop_lexer (parser
);
37417 cp_parser_pop_lexer (parser
);
37419 finish_function (0);
37422 DECL_CONTEXT (fndecl
) = current_function_decl
;
37423 block
= finish_omp_structured_block (block
);
37424 if (TREE_CODE (block
) == BIND_EXPR
)
37425 DECL_SAVED_TREE (fndecl
) = BIND_EXPR_BODY (block
);
37426 else if (TREE_CODE (block
) == STATEMENT_LIST
)
37427 DECL_SAVED_TREE (fndecl
) = block
;
37428 if (processing_template_decl
)
37429 add_decl_expr (fndecl
);
37431 cp_check_omp_declare_reduction (fndecl
);
37432 if (cp
== NULL
&& types
.length () > 1)
37433 cp
= cp_token_cache_new (first_token
,
37434 cp_lexer_peek_nth_token (parser
->lexer
, 2));
37435 if (errs
!= errorcount
)
37439 cp_parser_require_pragma_eol (parser
, pragma_tok
);
37442 /* Free any declarators allocated. */
37443 obstack_free (&declarator_obstack
, p
);
37447 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37448 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37449 initializer-clause[opt] new-line
37450 #pragma omp declare target new-line */
37453 cp_parser_omp_declare (cp_parser
*parser
, cp_token
*pragma_tok
,
37454 enum pragma_context context
)
37456 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
37458 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
37459 const char *p
= IDENTIFIER_POINTER (id
);
37461 if (strcmp (p
, "simd") == 0)
37463 cp_lexer_consume_token (parser
->lexer
);
37464 cp_parser_omp_declare_simd (parser
, pragma_tok
,
37468 cp_ensure_no_omp_declare_simd (parser
);
37469 if (strcmp (p
, "reduction") == 0)
37471 cp_lexer_consume_token (parser
->lexer
);
37472 cp_parser_omp_declare_reduction (parser
, pragma_tok
,
37476 if (!flag_openmp
) /* flag_openmp_simd */
37478 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37481 if (strcmp (p
, "target") == 0)
37483 cp_lexer_consume_token (parser
->lexer
);
37484 cp_parser_omp_declare_target (parser
, pragma_tok
);
37488 cp_parser_error (parser
, "expected %<simd%> or %<reduction%> "
37490 cp_parser_require_pragma_eol (parser
, pragma_tok
);
37494 #pragma omp taskloop taskloop-clause[optseq] new-line
37497 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37500 #define OMP_TASKLOOP_CLAUSE_MASK \
37501 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37508 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37512 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37513 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37517 cp_parser_omp_taskloop (cp_parser
*parser
, cp_token
*pragma_tok
,
37518 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
37521 tree clauses
, sb
, ret
;
37523 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
37525 strcat (p_name
, " taskloop");
37526 mask
|= OMP_TASKLOOP_CLAUSE_MASK
;
37528 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
37530 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
37531 const char *p
= IDENTIFIER_POINTER (id
);
37533 if (strcmp (p
, "simd") == 0)
37535 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
37536 if (cclauses
== NULL
)
37537 cclauses
= cclauses_buf
;
37539 cp_lexer_consume_token (parser
->lexer
);
37540 if (!flag_openmp
) /* flag_openmp_simd */
37541 return cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
37543 sb
= begin_omp_structured_block ();
37544 save
= cp_parser_begin_omp_structured_block (parser
);
37545 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
37547 cp_parser_end_omp_structured_block (parser
, save
);
37548 tree body
= finish_omp_structured_block (sb
);
37551 ret
= make_node (OMP_TASKLOOP
);
37552 TREE_TYPE (ret
) = void_type_node
;
37553 OMP_FOR_BODY (ret
) = body
;
37554 OMP_FOR_CLAUSES (ret
) = cclauses
[C_OMP_CLAUSE_SPLIT_TASKLOOP
];
37555 SET_EXPR_LOCATION (ret
, loc
);
37560 if (!flag_openmp
) /* flag_openmp_simd */
37562 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37566 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
37570 cp_omp_split_clauses (loc
, OMP_TASKLOOP
, mask
, clauses
, cclauses
);
37571 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_TASKLOOP
];
37574 sb
= begin_omp_structured_block ();
37575 save
= cp_parser_begin_omp_structured_block (parser
);
37577 ret
= cp_parser_omp_for_loop (parser
, OMP_TASKLOOP
, clauses
, cclauses
,
37580 cp_parser_end_omp_structured_block (parser
, save
);
37581 add_stmt (finish_omp_structured_block (sb
));
37588 # pragma acc routine oacc-routine-clause[optseq] new-line
37589 function-definition
37591 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37594 #define OACC_ROUTINE_CLAUSE_MASK \
37595 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37596 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37601 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37602 component, which must resolve to a declared namespace-scope
37603 function. The clauses are either processed directly (for a named
37604 function), or defered until the immediatley following declaration
37608 cp_parser_oacc_routine (cp_parser
*parser
, cp_token
*pragma_tok
,
37609 enum pragma_context context
)
37611 gcc_checking_assert (context
== pragma_external
);
37612 /* The checking for "another pragma following this one" in the "no optional
37613 '( name )'" case makes sure that we dont re-enter. */
37614 gcc_checking_assert (parser
->oacc_routine
== NULL
);
37616 cp_oacc_routine_data data
;
37617 data
.error_seen
= false;
37618 data
.fndecl_seen
= false;
37619 data
.tokens
= vNULL
;
37620 data
.clauses
= NULL_TREE
;
37621 data
.loc
= pragma_tok
->location
;
37622 /* It is safe to take the address of a local variable; it will only be
37623 used while this scope is live. */
37624 parser
->oacc_routine
= &data
;
37626 /* Look for optional '( name )'. */
37627 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
37629 cp_lexer_consume_token (parser
->lexer
); /* '(' */
37631 /* We parse the name as an id-expression. If it resolves to
37632 anything other than a non-overloaded function at namespace
37633 scope, it's an error. */
37634 location_t name_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
37635 tree name
= cp_parser_id_expression (parser
,
37636 /*template_keyword_p=*/false,
37637 /*check_dependency_p=*/false,
37638 /*template_p=*/NULL
,
37639 /*declarator_p=*/false,
37640 /*optional_p=*/false);
37641 tree decl
= cp_parser_lookup_name_simple (parser
, name
, name_loc
);
37642 if (name
!= error_mark_node
&& decl
== error_mark_node
)
37643 cp_parser_name_lookup_error (parser
, name
, decl
, NLE_NULL
, name_loc
);
37645 if (decl
== error_mark_node
37646 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
37648 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37649 parser
->oacc_routine
= NULL
;
37654 = cp_parser_oacc_all_clauses (parser
, OACC_ROUTINE_CLAUSE_MASK
,
37655 "#pragma acc routine",
37656 cp_lexer_peek_token (parser
->lexer
));
37658 if (decl
&& is_overloaded_fn (decl
)
37659 && (TREE_CODE (decl
) != FUNCTION_DECL
37660 || DECL_FUNCTION_TEMPLATE_P (decl
)))
37662 error_at (name_loc
,
37663 "%<#pragma acc routine%> names a set of overloads");
37664 parser
->oacc_routine
= NULL
;
37668 /* Perhaps we should use the same rule as declarations in different
37670 if (!DECL_NAMESPACE_SCOPE_P (decl
))
37672 error_at (name_loc
,
37673 "%qD does not refer to a namespace scope function", decl
);
37674 parser
->oacc_routine
= NULL
;
37678 if (TREE_CODE (decl
) != FUNCTION_DECL
)
37680 error_at (name_loc
, "%qD does not refer to a function", decl
);
37681 parser
->oacc_routine
= NULL
;
37685 cp_finalize_oacc_routine (parser
, decl
, false);
37686 parser
->oacc_routine
= NULL
;
37688 else /* No optional '( name )'. */
37690 /* Store away all pragma tokens. */
37691 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
37692 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
37693 cp_lexer_consume_token (parser
->lexer
);
37694 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
37695 parser
->oacc_routine
->error_seen
= true;
37696 cp_parser_require_pragma_eol (parser
, pragma_tok
);
37697 struct cp_token_cache
*cp
37698 = cp_token_cache_new (pragma_tok
, cp_lexer_peek_token (parser
->lexer
));
37699 parser
->oacc_routine
->tokens
.safe_push (cp
);
37701 /* Emit a helpful diagnostic if there's another pragma following this
37703 if (cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA
))
37705 cp_ensure_no_oacc_routine (parser
);
37706 data
.tokens
.release ();
37707 /* ..., and then just keep going. */
37711 /* We only have to consider the pragma_external case here. */
37712 cp_parser_declaration (parser
);
37713 if (parser
->oacc_routine
37714 && !parser
->oacc_routine
->fndecl_seen
)
37715 cp_ensure_no_oacc_routine (parser
);
37717 parser
->oacc_routine
= NULL
;
37718 data
.tokens
.release ();
37722 /* Finalize #pragma acc routine clauses after direct declarator has
37726 cp_parser_late_parsing_oacc_routine (cp_parser
*parser
, tree attrs
)
37728 struct cp_token_cache
*ce
;
37729 cp_oacc_routine_data
*data
= parser
->oacc_routine
;
37731 if (!data
->error_seen
&& data
->fndecl_seen
)
37733 error_at (data
->loc
,
37734 "%<#pragma acc routine%> not immediately followed by "
37735 "a single function declaration or definition");
37736 data
->error_seen
= true;
37738 if (data
->error_seen
)
37741 gcc_checking_assert (data
->tokens
.length () == 1);
37742 ce
= data
->tokens
[0];
37744 cp_parser_push_lexer_for_tokens (parser
, ce
);
37745 parser
->lexer
->in_pragma
= true;
37746 gcc_assert (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_PRAGMA
);
37748 cp_token
*pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
37749 gcc_checking_assert (parser
->oacc_routine
->clauses
== NULL_TREE
);
37750 parser
->oacc_routine
->clauses
37751 = cp_parser_oacc_all_clauses (parser
, OACC_ROUTINE_CLAUSE_MASK
,
37752 "#pragma acc routine", pragma_tok
);
37753 cp_parser_pop_lexer (parser
);
37754 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
37760 /* Apply any saved OpenACC routine clauses to a just-parsed
37764 cp_finalize_oacc_routine (cp_parser
*parser
, tree fndecl
, bool is_defn
)
37766 if (__builtin_expect (parser
->oacc_routine
!= NULL
, 0))
37768 /* Keep going if we're in error reporting mode. */
37769 if (parser
->oacc_routine
->error_seen
37770 || fndecl
== error_mark_node
)
37773 if (parser
->oacc_routine
->fndecl_seen
)
37775 error_at (parser
->oacc_routine
->loc
,
37776 "%<#pragma acc routine%> not immediately followed by"
37777 " a single function declaration or definition");
37778 parser
->oacc_routine
= NULL
;
37781 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
37783 cp_ensure_no_oacc_routine (parser
);
37787 if (oacc_get_fn_attrib (fndecl
))
37789 error_at (parser
->oacc_routine
->loc
,
37790 "%<#pragma acc routine%> already applied to %qD", fndecl
);
37791 parser
->oacc_routine
= NULL
;
37795 if (TREE_USED (fndecl
) || (!is_defn
&& DECL_SAVED_TREE (fndecl
)))
37797 error_at (parser
->oacc_routine
->loc
,
37799 ? G_("%<#pragma acc routine%> must be applied before use")
37800 : G_("%<#pragma acc routine%> must be applied before "
37802 parser
->oacc_routine
= NULL
;
37806 /* Process the routine's dimension clauses. */
37807 tree dims
= oacc_build_routine_dims (parser
->oacc_routine
->clauses
);
37808 oacc_replace_fn_attrib (fndecl
, dims
);
37810 /* Add an "omp declare target" attribute. */
37811 DECL_ATTRIBUTES (fndecl
)
37812 = tree_cons (get_identifier ("omp declare target"),
37813 NULL_TREE
, DECL_ATTRIBUTES (fndecl
));
37815 /* Don't unset parser->oacc_routine here: we may still need it to
37816 diagnose wrong usage. But, remember that we've used this "#pragma acc
37818 parser
->oacc_routine
->fndecl_seen
= true;
37822 /* Main entry point to OpenMP statement pragmas. */
37825 cp_parser_omp_construct (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
37828 char p_name
[sizeof "#pragma omp teams distribute parallel for simd"];
37829 omp_clause_mask
mask (0);
37831 switch (cp_parser_pragma_kind (pragma_tok
))
37833 case PRAGMA_OACC_ATOMIC
:
37834 cp_parser_omp_atomic (parser
, pragma_tok
);
37836 case PRAGMA_OACC_CACHE
:
37837 stmt
= cp_parser_oacc_cache (parser
, pragma_tok
);
37839 case PRAGMA_OACC_DATA
:
37840 stmt
= cp_parser_oacc_data (parser
, pragma_tok
, if_p
);
37842 case PRAGMA_OACC_ENTER_DATA
:
37843 stmt
= cp_parser_oacc_enter_exit_data (parser
, pragma_tok
, true);
37845 case PRAGMA_OACC_EXIT_DATA
:
37846 stmt
= cp_parser_oacc_enter_exit_data (parser
, pragma_tok
, false);
37848 case PRAGMA_OACC_HOST_DATA
:
37849 stmt
= cp_parser_oacc_host_data (parser
, pragma_tok
, if_p
);
37851 case PRAGMA_OACC_KERNELS
:
37852 case PRAGMA_OACC_PARALLEL
:
37853 strcpy (p_name
, "#pragma acc");
37854 stmt
= cp_parser_oacc_kernels_parallel (parser
, pragma_tok
, p_name
,
37857 case PRAGMA_OACC_LOOP
:
37858 strcpy (p_name
, "#pragma acc");
37859 stmt
= cp_parser_oacc_loop (parser
, pragma_tok
, p_name
, mask
, NULL
,
37862 case PRAGMA_OACC_UPDATE
:
37863 stmt
= cp_parser_oacc_update (parser
, pragma_tok
);
37865 case PRAGMA_OACC_WAIT
:
37866 stmt
= cp_parser_oacc_wait (parser
, pragma_tok
);
37868 case PRAGMA_OMP_ATOMIC
:
37869 cp_parser_omp_atomic (parser
, pragma_tok
);
37871 case PRAGMA_OMP_CRITICAL
:
37872 stmt
= cp_parser_omp_critical (parser
, pragma_tok
, if_p
);
37874 case PRAGMA_OMP_DISTRIBUTE
:
37875 strcpy (p_name
, "#pragma omp");
37876 stmt
= cp_parser_omp_distribute (parser
, pragma_tok
, p_name
, mask
, NULL
,
37879 case PRAGMA_OMP_FOR
:
37880 strcpy (p_name
, "#pragma omp");
37881 stmt
= cp_parser_omp_for (parser
, pragma_tok
, p_name
, mask
, NULL
,
37884 case PRAGMA_OMP_MASTER
:
37885 stmt
= cp_parser_omp_master (parser
, pragma_tok
, if_p
);
37887 case PRAGMA_OMP_PARALLEL
:
37888 strcpy (p_name
, "#pragma omp");
37889 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
, mask
, NULL
,
37892 case PRAGMA_OMP_SECTIONS
:
37893 strcpy (p_name
, "#pragma omp");
37894 stmt
= cp_parser_omp_sections (parser
, pragma_tok
, p_name
, mask
, NULL
);
37896 case PRAGMA_OMP_SIMD
:
37897 strcpy (p_name
, "#pragma omp");
37898 stmt
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
, NULL
,
37901 case PRAGMA_OMP_SINGLE
:
37902 stmt
= cp_parser_omp_single (parser
, pragma_tok
, if_p
);
37904 case PRAGMA_OMP_TASK
:
37905 stmt
= cp_parser_omp_task (parser
, pragma_tok
, if_p
);
37907 case PRAGMA_OMP_TASKGROUP
:
37908 stmt
= cp_parser_omp_taskgroup (parser
, pragma_tok
, if_p
);
37910 case PRAGMA_OMP_TASKLOOP
:
37911 strcpy (p_name
, "#pragma omp");
37912 stmt
= cp_parser_omp_taskloop (parser
, pragma_tok
, p_name
, mask
, NULL
,
37915 case PRAGMA_OMP_TEAMS
:
37916 strcpy (p_name
, "#pragma omp");
37917 stmt
= cp_parser_omp_teams (parser
, pragma_tok
, p_name
, mask
, NULL
,
37921 gcc_unreachable ();
37924 protected_set_expr_location (stmt
, pragma_tok
->location
);
37927 /* Transactional Memory parsing routines. */
37929 /* Parse a transaction attribute.
37935 We use this instead of cp_parser_attributes_opt for transactions to avoid
37936 the pedwarn in C++98 mode. */
37939 cp_parser_txn_attribute_opt (cp_parser
*parser
)
37942 tree attr_name
, attr
= NULL
;
37944 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
37945 return cp_parser_attributes_opt (parser
);
37947 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
37949 cp_lexer_consume_token (parser
->lexer
);
37950 if (!cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
))
37953 token
= cp_lexer_peek_token (parser
->lexer
);
37954 if (token
->type
== CPP_NAME
|| token
->type
== CPP_KEYWORD
)
37956 token
= cp_lexer_consume_token (parser
->lexer
);
37958 attr_name
= (token
->type
== CPP_KEYWORD
37959 /* For keywords, use the canonical spelling,
37960 not the parsed identifier. */
37961 ? ridpointers
[(int) token
->keyword
]
37963 attr
= build_tree_list (attr_name
, NULL_TREE
);
37966 cp_parser_error (parser
, "expected identifier");
37968 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
37970 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
37974 /* Parse a __transaction_atomic or __transaction_relaxed statement.
37976 transaction-statement:
37977 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
37979 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
37983 cp_parser_transaction (cp_parser
*parser
, cp_token
*token
)
37985 unsigned char old_in
= parser
->in_transaction
;
37986 unsigned char this_in
= 1, new_in
;
37987 enum rid keyword
= token
->keyword
;
37988 tree stmt
, attrs
, noex
;
37990 cp_lexer_consume_token (parser
->lexer
);
37992 if (keyword
== RID_TRANSACTION_RELAXED
37993 || keyword
== RID_SYNCHRONIZED
)
37994 this_in
|= TM_STMT_ATTR_RELAXED
;
37997 attrs
= cp_parser_txn_attribute_opt (parser
);
37999 this_in
|= parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
);
38002 /* Parse a noexcept specification. */
38003 if (keyword
== RID_ATOMIC_NOEXCEPT
)
38004 noex
= boolean_true_node
;
38005 else if (keyword
== RID_ATOMIC_CANCEL
)
38007 /* cancel-and-throw is unimplemented. */
38008 sorry ("atomic_cancel");
38012 noex
= cp_parser_noexcept_specification_opt (parser
, true, NULL
, true);
38014 /* Keep track if we're in the lexical scope of an outer transaction. */
38015 new_in
= this_in
| (old_in
& TM_STMT_ATTR_OUTER
);
38017 stmt
= begin_transaction_stmt (token
->location
, NULL
, this_in
);
38019 parser
->in_transaction
= new_in
;
38020 cp_parser_compound_statement (parser
, NULL
, BCS_TRANSACTION
, false);
38021 parser
->in_transaction
= old_in
;
38023 finish_transaction_stmt (stmt
, NULL
, this_in
, noex
);
38028 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38030 transaction-expression:
38031 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38032 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38036 cp_parser_transaction_expression (cp_parser
*parser
, enum rid keyword
)
38038 unsigned char old_in
= parser
->in_transaction
;
38039 unsigned char this_in
= 1;
38043 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
38045 gcc_assert (keyword
== RID_TRANSACTION_ATOMIC
38046 || keyword
== RID_TRANSACTION_RELAXED
);
38050 keyword
== RID_TRANSACTION_RELAXED
38051 ? G_("%<__transaction_relaxed%> without transactional memory "
38053 : G_("%<__transaction_atomic%> without transactional memory "
38054 "support enabled"));
38056 token
= cp_parser_require_keyword (parser
, keyword
,
38057 (keyword
== RID_TRANSACTION_ATOMIC
? RT_TRANSACTION_ATOMIC
38058 : RT_TRANSACTION_RELAXED
));
38059 gcc_assert (token
!= NULL
);
38061 if (keyword
== RID_TRANSACTION_RELAXED
)
38062 this_in
|= TM_STMT_ATTR_RELAXED
;
38064 /* Set this early. This might mean that we allow transaction_cancel in
38065 an expression that we find out later actually has to be a constexpr.
38066 However, we expect that cxx_constant_value will be able to deal with
38067 this; also, if the noexcept has no constexpr, then what we parse next
38068 really is a transaction's body. */
38069 parser
->in_transaction
= this_in
;
38071 /* Parse a noexcept specification. */
38072 noex
= cp_parser_noexcept_specification_opt (parser
, false, &noex_expr
,
38075 if (!noex
|| !noex_expr
38076 || cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
38078 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
38080 expr
= cp_parser_expression (parser
);
38081 expr
= finish_parenthesized_expr (expr
);
38083 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
38087 /* The only expression that is available got parsed for the noexcept
38088 already. noexcept is true then. */
38090 noex
= boolean_true_node
;
38093 expr
= build_transaction_expr (token
->location
, expr
, this_in
, noex
);
38094 parser
->in_transaction
= old_in
;
38096 if (cp_parser_non_integral_constant_expression (parser
, NIC_TRANSACTION
))
38097 return error_mark_node
;
38099 return (flag_tm
? expr
: error_mark_node
);
38102 /* Parse a function-transaction-block.
38104 function-transaction-block:
38105 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38107 __transaction_atomic txn-attribute[opt] function-try-block
38108 __transaction_relaxed ctor-initializer[opt] function-body
38109 __transaction_relaxed function-try-block
38113 cp_parser_function_transaction (cp_parser
*parser
, enum rid keyword
)
38115 unsigned char old_in
= parser
->in_transaction
;
38116 unsigned char new_in
= 1;
38117 tree compound_stmt
, stmt
, attrs
;
38118 bool ctor_initializer_p
;
38121 gcc_assert (keyword
== RID_TRANSACTION_ATOMIC
38122 || keyword
== RID_TRANSACTION_RELAXED
);
38123 token
= cp_parser_require_keyword (parser
, keyword
,
38124 (keyword
== RID_TRANSACTION_ATOMIC
? RT_TRANSACTION_ATOMIC
38125 : RT_TRANSACTION_RELAXED
));
38126 gcc_assert (token
!= NULL
);
38128 if (keyword
== RID_TRANSACTION_RELAXED
)
38129 new_in
|= TM_STMT_ATTR_RELAXED
;
38132 attrs
= cp_parser_txn_attribute_opt (parser
);
38134 new_in
|= parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
);
38137 stmt
= begin_transaction_stmt (token
->location
, &compound_stmt
, new_in
);
38139 parser
->in_transaction
= new_in
;
38141 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
38142 ctor_initializer_p
= cp_parser_function_try_block (parser
);
38144 ctor_initializer_p
= cp_parser_ctor_initializer_opt_and_function_body
38145 (parser
, /*in_function_try_block=*/false);
38147 parser
->in_transaction
= old_in
;
38149 finish_transaction_stmt (stmt
, compound_stmt
, new_in
, NULL_TREE
);
38151 return ctor_initializer_p
;
38154 /* Parse a __transaction_cancel statement.
38157 __transaction_cancel txn-attribute[opt] ;
38158 __transaction_cancel txn-attribute[opt] throw-expression ;
38160 ??? Cancel and throw is not yet implemented. */
38163 cp_parser_transaction_cancel (cp_parser
*parser
)
38166 bool is_outer
= false;
38169 token
= cp_parser_require_keyword (parser
, RID_TRANSACTION_CANCEL
,
38170 RT_TRANSACTION_CANCEL
);
38171 gcc_assert (token
!= NULL
);
38173 attrs
= cp_parser_txn_attribute_opt (parser
);
38175 is_outer
= (parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
) != 0);
38177 /* ??? Parse cancel-and-throw here. */
38179 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
38183 error_at (token
->location
, "%<__transaction_cancel%> without "
38184 "transactional memory support enabled");
38185 return error_mark_node
;
38187 else if (parser
->in_transaction
& TM_STMT_ATTR_RELAXED
)
38189 error_at (token
->location
, "%<__transaction_cancel%> within a "
38190 "%<__transaction_relaxed%>");
38191 return error_mark_node
;
38195 if ((parser
->in_transaction
& TM_STMT_ATTR_OUTER
) == 0
38196 && !is_tm_may_cancel_outer (current_function_decl
))
38198 error_at (token
->location
, "outer %<__transaction_cancel%> not "
38199 "within outer %<__transaction_atomic%>");
38200 error_at (token
->location
,
38201 " or a %<transaction_may_cancel_outer%> function");
38202 return error_mark_node
;
38205 else if (parser
->in_transaction
== 0)
38207 error_at (token
->location
, "%<__transaction_cancel%> not within "
38208 "%<__transaction_atomic%>");
38209 return error_mark_node
;
38212 stmt
= build_tm_abort_call (token
->location
, is_outer
);
38220 static GTY (()) cp_parser
*the_parser
;
38223 /* Special handling for the first token or line in the file. The first
38224 thing in the file might be #pragma GCC pch_preprocess, which loads a
38225 PCH file, which is a GC collection point. So we need to handle this
38226 first pragma without benefit of an existing lexer structure.
38228 Always returns one token to the caller in *FIRST_TOKEN. This is
38229 either the true first token of the file, or the first token after
38230 the initial pragma. */
38233 cp_parser_initial_pragma (cp_token
*first_token
)
38237 cp_lexer_get_preprocessor_token (NULL
, first_token
);
38238 if (cp_parser_pragma_kind (first_token
) != PRAGMA_GCC_PCH_PREPROCESS
)
38241 cp_lexer_get_preprocessor_token (NULL
, first_token
);
38242 if (first_token
->type
== CPP_STRING
)
38244 name
= first_token
->u
.value
;
38246 cp_lexer_get_preprocessor_token (NULL
, first_token
);
38247 if (first_token
->type
!= CPP_PRAGMA_EOL
)
38248 error_at (first_token
->location
,
38249 "junk at end of %<#pragma GCC pch_preprocess%>");
38252 error_at (first_token
->location
, "expected string literal");
38254 /* Skip to the end of the pragma. */
38255 while (first_token
->type
!= CPP_PRAGMA_EOL
&& first_token
->type
!= CPP_EOF
)
38256 cp_lexer_get_preprocessor_token (NULL
, first_token
);
38258 /* Now actually load the PCH file. */
38260 c_common_pch_pragma (parse_in
, TREE_STRING_POINTER (name
));
38262 /* Read one more token to return to our caller. We have to do this
38263 after reading the PCH file in, since its pointers have to be
38265 cp_lexer_get_preprocessor_token (NULL
, first_token
);
38268 /* Parses the grainsize pragma for the _Cilk_for statement.
38270 #pragma cilk grainsize = <VALUE>. */
38273 cp_parser_cilk_grainsize (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
38275 if (cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
38277 tree exp
= cp_parser_binary_expression (parser
, false, false,
38278 PREC_NOT_OPERATOR
, NULL
);
38279 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
38280 if (!exp
|| exp
== error_mark_node
)
38282 error_at (pragma_tok
->location
, "invalid grainsize for _Cilk_for");
38286 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38287 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CILK_FOR
))
38288 cp_parser_cilk_for (parser
, exp
, if_p
);
38290 warning_at (cp_lexer_peek_token (parser
->lexer
)->location
, 0,
38291 "%<#pragma cilk grainsize%> is not followed by "
38295 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
38298 /* Normal parsing of a pragma token. Here we can (and must) use the
38302 cp_parser_pragma (cp_parser
*parser
, enum pragma_context context
, bool *if_p
)
38304 cp_token
*pragma_tok
;
38309 pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
38310 gcc_assert (pragma_tok
->type
== CPP_PRAGMA
);
38311 parser
->lexer
->in_pragma
= true;
38313 id
= cp_parser_pragma_kind (pragma_tok
);
38314 if (id
!= PRAGMA_OMP_DECLARE
&& id
!= PRAGMA_OACC_ROUTINE
)
38315 cp_ensure_no_omp_declare_simd (parser
);
38318 case PRAGMA_GCC_PCH_PREPROCESS
:
38319 error_at (pragma_tok
->location
,
38320 "%<#pragma GCC pch_preprocess%> must be first");
38323 case PRAGMA_OMP_BARRIER
:
38326 case pragma_compound
:
38327 cp_parser_omp_barrier (parser
, pragma_tok
);
38330 error_at (pragma_tok
->location
, "%<#pragma %s%> may only be "
38331 "used in compound statements", "omp barrier");
38338 case PRAGMA_OMP_FLUSH
:
38341 case pragma_compound
:
38342 cp_parser_omp_flush (parser
, pragma_tok
);
38345 error_at (pragma_tok
->location
, "%<#pragma %s%> may only be "
38346 "used in compound statements", "omp flush");
38353 case PRAGMA_OMP_TASKWAIT
:
38356 case pragma_compound
:
38357 cp_parser_omp_taskwait (parser
, pragma_tok
);
38360 error_at (pragma_tok
->location
,
38361 "%<#pragma %s%> may only be used in compound statements",
38369 case PRAGMA_OMP_TASKYIELD
:
38372 case pragma_compound
:
38373 cp_parser_omp_taskyield (parser
, pragma_tok
);
38376 error_at (pragma_tok
->location
,
38377 "%<#pragma %s%> may only be used in compound statements",
38385 case PRAGMA_OMP_CANCEL
:
38388 case pragma_compound
:
38389 cp_parser_omp_cancel (parser
, pragma_tok
);
38392 error_at (pragma_tok
->location
,
38393 "%<#pragma %s%> may only be used in compound statements",
38401 case PRAGMA_OMP_CANCELLATION_POINT
:
38402 cp_parser_omp_cancellation_point (parser
, pragma_tok
, context
);
38405 case PRAGMA_OMP_THREADPRIVATE
:
38406 cp_parser_omp_threadprivate (parser
, pragma_tok
);
38409 case PRAGMA_OMP_DECLARE
:
38410 cp_parser_omp_declare (parser
, pragma_tok
, context
);
38413 case PRAGMA_OACC_DECLARE
:
38414 cp_parser_oacc_declare (parser
, pragma_tok
);
38417 case PRAGMA_OACC_ENTER_DATA
:
38418 if (context
== pragma_stmt
)
38420 error_at (pragma_tok
->location
,
38421 "%<#pragma %s%> may only be used in compound statements",
38425 else if (context
!= pragma_compound
)
38427 cp_parser_omp_construct (parser
, pragma_tok
, if_p
);
38430 case PRAGMA_OACC_EXIT_DATA
:
38431 if (context
== pragma_stmt
)
38433 error_at (pragma_tok
->location
,
38434 "%<#pragma %s%> may only be used in compound statements",
38438 else if (context
!= pragma_compound
)
38440 cp_parser_omp_construct (parser
, pragma_tok
, if_p
);
38443 case PRAGMA_OACC_ROUTINE
:
38444 if (context
!= pragma_external
)
38446 error_at (pragma_tok
->location
,
38447 "%<#pragma acc routine%> must be at file scope");
38450 cp_parser_oacc_routine (parser
, pragma_tok
, context
);
38453 case PRAGMA_OACC_UPDATE
:
38454 if (context
== pragma_stmt
)
38456 error_at (pragma_tok
->location
,
38457 "%<#pragma %s%> may only be used in compound statements",
38461 else if (context
!= pragma_compound
)
38463 cp_parser_omp_construct (parser
, pragma_tok
, if_p
);
38466 case PRAGMA_OACC_WAIT
:
38467 if (context
== pragma_stmt
)
38469 error_at (pragma_tok
->location
,
38470 "%<#pragma %s%> may only be used in compound statements",
38474 else if (context
!= pragma_compound
)
38476 cp_parser_omp_construct (parser
, pragma_tok
, if_p
);
38479 case PRAGMA_OACC_ATOMIC
:
38480 case PRAGMA_OACC_CACHE
:
38481 case PRAGMA_OACC_DATA
:
38482 case PRAGMA_OACC_HOST_DATA
:
38483 case PRAGMA_OACC_KERNELS
:
38484 case PRAGMA_OACC_PARALLEL
:
38485 case PRAGMA_OACC_LOOP
:
38486 case PRAGMA_OMP_ATOMIC
:
38487 case PRAGMA_OMP_CRITICAL
:
38488 case PRAGMA_OMP_DISTRIBUTE
:
38489 case PRAGMA_OMP_FOR
:
38490 case PRAGMA_OMP_MASTER
:
38491 case PRAGMA_OMP_PARALLEL
:
38492 case PRAGMA_OMP_SECTIONS
:
38493 case PRAGMA_OMP_SIMD
:
38494 case PRAGMA_OMP_SINGLE
:
38495 case PRAGMA_OMP_TASK
:
38496 case PRAGMA_OMP_TASKGROUP
:
38497 case PRAGMA_OMP_TASKLOOP
:
38498 case PRAGMA_OMP_TEAMS
:
38499 if (context
!= pragma_stmt
&& context
!= pragma_compound
)
38501 stmt
= push_omp_privatization_clauses (false);
38502 cp_parser_omp_construct (parser
, pragma_tok
, if_p
);
38503 pop_omp_privatization_clauses (stmt
);
38506 case PRAGMA_OMP_ORDERED
:
38507 if (context
!= pragma_stmt
&& context
!= pragma_compound
)
38509 stmt
= push_omp_privatization_clauses (false);
38510 ret
= cp_parser_omp_ordered (parser
, pragma_tok
, context
, if_p
);
38511 pop_omp_privatization_clauses (stmt
);
38514 case PRAGMA_OMP_TARGET
:
38515 if (context
!= pragma_stmt
&& context
!= pragma_compound
)
38517 stmt
= push_omp_privatization_clauses (false);
38518 ret
= cp_parser_omp_target (parser
, pragma_tok
, context
, if_p
);
38519 pop_omp_privatization_clauses (stmt
);
38522 case PRAGMA_OMP_END_DECLARE_TARGET
:
38523 cp_parser_omp_end_declare_target (parser
, pragma_tok
);
38526 case PRAGMA_OMP_SECTION
:
38527 error_at (pragma_tok
->location
,
38528 "%<#pragma omp section%> may only be used in "
38529 "%<#pragma omp sections%> construct");
38534 if (context
== pragma_external
)
38536 error_at (pragma_tok
->location
,
38537 "%<#pragma GCC ivdep%> must be inside a function");
38540 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
38542 tok
= cp_lexer_peek_token (the_parser
->lexer
);
38543 if (tok
->type
!= CPP_KEYWORD
38544 || (tok
->keyword
!= RID_FOR
&& tok
->keyword
!= RID_WHILE
38545 && tok
->keyword
!= RID_DO
))
38547 cp_parser_error (parser
, "for, while or do statement expected");
38550 cp_parser_iteration_statement (parser
, if_p
, true);
38554 case PRAGMA_CILK_SIMD
:
38555 if (context
== pragma_external
)
38557 error_at (pragma_tok
->location
,
38558 "%<#pragma simd%> must be inside a function");
38561 stmt
= push_omp_privatization_clauses (false);
38562 cp_parser_cilk_simd (parser
, pragma_tok
, if_p
);
38563 pop_omp_privatization_clauses (stmt
);
38566 case PRAGMA_CILK_GRAINSIZE
:
38567 if (context
== pragma_external
)
38569 error_at (pragma_tok
->location
,
38570 "%<#pragma cilk grainsize%> must be inside a function");
38574 /* Ignore the pragma if Cilk Plus is not enabled. */
38577 cp_parser_cilk_grainsize (parser
, pragma_tok
, if_p
);
38582 error_at (pragma_tok
->location
, "-fcilkplus must be enabled to use "
38583 "%<#pragma cilk grainsize%>");
38588 gcc_assert (id
>= PRAGMA_FIRST_EXTERNAL
);
38589 c_invoke_pragma_handler (id
);
38593 cp_parser_error (parser
, "expected declaration specifiers");
38597 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
38601 /* The interface the pragma parsers have to the lexer. */
38604 pragma_lex (tree
*value
, location_t
*loc
)
38606 cp_token
*tok
= cp_lexer_peek_token (the_parser
->lexer
);
38607 enum cpp_ttype ret
= tok
->type
;
38609 *value
= tok
->u
.value
;
38611 *loc
= tok
->location
;
38613 if (ret
== CPP_PRAGMA_EOL
|| ret
== CPP_EOF
)
38615 else if (ret
== CPP_STRING
)
38616 *value
= cp_parser_string_literal (the_parser
, false, false);
38619 if (ret
== CPP_KEYWORD
)
38621 cp_lexer_consume_token (the_parser
->lexer
);
38628 /* External interface. */
38630 /* Parse one entire translation unit. */
38633 c_parse_file (void)
38635 static bool already_called
= false;
38637 if (already_called
)
38638 fatal_error (input_location
,
38639 "inter-module optimizations not implemented for C++");
38640 already_called
= true;
38642 the_parser
= cp_parser_new ();
38643 push_deferring_access_checks (flag_access_control
38644 ? dk_no_deferred
: dk_no_check
);
38645 cp_parser_translation_unit (the_parser
);
38649 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
38650 vectorlength clause:
38652 vectorlength ( constant-expression ) */
38655 cp_parser_cilk_simd_vectorlength (cp_parser
*parser
, tree clauses
,
38658 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
38660 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
38661 safelen clause. Thus, vectorlength is represented as OMP 4.0
38662 safelen. For SIMD-enabled function it is represented by OMP 4.0
38665 check_no_duplicate_clause (clauses
, OMP_CLAUSE_SAFELEN
, "vectorlength",
38668 check_no_duplicate_clause (clauses
, OMP_CLAUSE_SIMDLEN
, "vectorlength",
38671 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
38672 return error_mark_node
;
38674 expr
= cp_parser_constant_expression (parser
);
38675 expr
= maybe_constant_value (expr
);
38677 /* If expr == error_mark_node, then don't emit any errors nor
38678 create a clause. if any of the above functions returns
38679 error mark node then they would have emitted an error message. */
38680 if (expr
== error_mark_node
)
38682 else if (!TREE_TYPE (expr
)
38683 || !TREE_CONSTANT (expr
)
38684 || !INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
38685 error_at (loc
, "vectorlength must be an integer constant");
38686 else if (TREE_CONSTANT (expr
)
38687 && !pow2p_hwi (TREE_INT_CST_LOW (expr
)))
38688 error_at (loc
, "vectorlength must be a power of 2");
38694 c
= build_omp_clause (loc
, OMP_CLAUSE_SAFELEN
);
38695 OMP_CLAUSE_SAFELEN_EXPR (c
) = expr
;
38696 OMP_CLAUSE_CHAIN (c
) = clauses
;
38701 c
= build_omp_clause (loc
, OMP_CLAUSE_SIMDLEN
);
38702 OMP_CLAUSE_SIMDLEN_EXPR (c
) = expr
;
38703 OMP_CLAUSE_CHAIN (c
) = clauses
;
38708 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
38709 return error_mark_node
;
38713 /* Handles the Cilk Plus #pragma simd linear clause.
38715 linear ( simd-linear-variable-list )
38717 simd-linear-variable-list:
38718 simd-linear-variable
38719 simd-linear-variable-list , simd-linear-variable
38721 simd-linear-variable:
38723 id-expression : simd-linear-step
38726 conditional-expression */
38729 cp_parser_cilk_simd_linear (cp_parser
*parser
, tree clauses
)
38731 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
38733 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
38735 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
38737 cp_parser_error (parser
, "expected identifier");
38738 cp_parser_skip_to_closing_parenthesis (parser
, false, false, true);
38739 return error_mark_node
;
38742 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
38743 parser
->colon_corrects_to_scope_p
= false;
38746 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
38747 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
38749 cp_parser_error (parser
, "expected variable-name");
38750 clauses
= error_mark_node
;
38754 tree var_name
= cp_parser_id_expression (parser
, false, true, NULL
,
38756 tree decl
= cp_parser_lookup_name_simple (parser
, var_name
,
38758 if (decl
== error_mark_node
)
38760 cp_parser_name_lookup_error (parser
, var_name
, decl
, NLE_NULL
,
38762 clauses
= error_mark_node
;
38766 tree e
= NULL_TREE
;
38767 tree step_size
= integer_one_node
;
38769 /* If present, parse the linear step. Otherwise, assume the default
38771 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_COLON
)
38773 cp_lexer_consume_token (parser
->lexer
);
38775 e
= cp_parser_assignment_expression (parser
);
38776 e
= maybe_constant_value (e
);
38778 if (e
== error_mark_node
)
38780 /* If an error has occurred, then the whole pragma is
38781 considered ill-formed. Thus, no reason to keep
38783 clauses
= error_mark_node
;
38786 else if (type_dependent_expression_p (e
)
38787 || value_dependent_expression_p (e
)
38789 && INTEGRAL_TYPE_P (TREE_TYPE (e
))
38790 && (TREE_CONSTANT (e
)
38794 cp_parser_error (parser
,
38795 "step size must be an integer constant "
38796 "expression or an integer variable");
38799 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
38800 tree l
= build_omp_clause (loc
, OMP_CLAUSE_LINEAR
);
38801 OMP_CLAUSE_DECL (l
) = decl
;
38802 OMP_CLAUSE_LINEAR_STEP (l
) = step_size
;
38803 OMP_CLAUSE_CHAIN (l
) = clauses
;
38806 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
38807 cp_lexer_consume_token (parser
->lexer
);
38808 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
38812 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
38813 "expected %<,%> or %<)%> after %qE", decl
);
38814 clauses
= error_mark_node
;
38818 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
38819 cp_parser_skip_to_closing_parenthesis (parser
, false, false, true);
38823 /* Returns the name of the next clause. If the clause is not
38824 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
38825 token is not consumed. Otherwise, the appropriate enum from the
38826 pragma_simd_clause is returned and the token is consumed. */
38828 static pragma_omp_clause
38829 cp_parser_cilk_simd_clause_name (cp_parser
*parser
)
38831 pragma_omp_clause clause_type
;
38832 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
38834 if (token
->keyword
== RID_PRIVATE
)
38835 clause_type
= PRAGMA_CILK_CLAUSE_PRIVATE
;
38836 else if (!token
->u
.value
|| token
->type
!= CPP_NAME
)
38837 return PRAGMA_CILK_CLAUSE_NONE
;
38838 else if (id_equal (token
->u
.value
, "vectorlength"))
38839 clause_type
= PRAGMA_CILK_CLAUSE_VECTORLENGTH
;
38840 else if (id_equal (token
->u
.value
, "linear"))
38841 clause_type
= PRAGMA_CILK_CLAUSE_LINEAR
;
38842 else if (id_equal (token
->u
.value
, "firstprivate"))
38843 clause_type
= PRAGMA_CILK_CLAUSE_FIRSTPRIVATE
;
38844 else if (id_equal (token
->u
.value
, "lastprivate"))
38845 clause_type
= PRAGMA_CILK_CLAUSE_LASTPRIVATE
;
38846 else if (id_equal (token
->u
.value
, "reduction"))
38847 clause_type
= PRAGMA_CILK_CLAUSE_REDUCTION
;
38849 return PRAGMA_CILK_CLAUSE_NONE
;
38851 cp_lexer_consume_token (parser
->lexer
);
38852 return clause_type
;
38855 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
38858 cp_parser_cilk_simd_all_clauses (cp_parser
*parser
, cp_token
*pragma_token
)
38860 tree clauses
= NULL_TREE
;
38862 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
38863 && clauses
!= error_mark_node
)
38865 pragma_omp_clause c_kind
;
38866 c_kind
= cp_parser_cilk_simd_clause_name (parser
);
38867 if (c_kind
== PRAGMA_CILK_CLAUSE_VECTORLENGTH
)
38868 clauses
= cp_parser_cilk_simd_vectorlength (parser
, clauses
, false);
38869 else if (c_kind
== PRAGMA_CILK_CLAUSE_LINEAR
)
38870 clauses
= cp_parser_cilk_simd_linear (parser
, clauses
);
38871 else if (c_kind
== PRAGMA_CILK_CLAUSE_PRIVATE
)
38872 /* Use the OpenMP 4.0 equivalent function. */
38873 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
, clauses
);
38874 else if (c_kind
== PRAGMA_CILK_CLAUSE_FIRSTPRIVATE
)
38875 /* Use the OpenMP 4.0 equivalent function. */
38876 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
38878 else if (c_kind
== PRAGMA_CILK_CLAUSE_LASTPRIVATE
)
38879 /* Use the OMP 4.0 equivalent function. */
38880 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
38882 else if (c_kind
== PRAGMA_CILK_CLAUSE_REDUCTION
)
38883 /* Use the OMP 4.0 equivalent function. */
38884 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
38887 clauses
= error_mark_node
;
38888 cp_parser_error (parser
, "expected %<#pragma simd%> clause");
38893 cp_parser_skip_to_pragma_eol (parser
, pragma_token
);
38895 if (clauses
== error_mark_node
)
38896 return error_mark_node
;
38898 return finish_omp_clauses (clauses
, C_ORT_CILK
);
38901 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
38904 cp_parser_cilk_simd (cp_parser
*parser
, cp_token
*pragma_token
, bool *if_p
)
38906 tree clauses
= cp_parser_cilk_simd_all_clauses (parser
, pragma_token
);
38908 if (clauses
== error_mark_node
)
38911 if (cp_lexer_next_token_is_not_keyword (parser
->lexer
, RID_FOR
))
38913 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
38914 "for statement expected");
38918 tree sb
= begin_omp_structured_block ();
38919 int save
= cp_parser_begin_omp_structured_block (parser
);
38920 tree ret
= cp_parser_omp_for_loop (parser
, CILK_SIMD
, clauses
, NULL
, if_p
);
38922 cpp_validate_cilk_plus_loop (OMP_FOR_BODY (ret
));
38923 cp_parser_end_omp_structured_block (parser
, save
);
38924 add_stmt (finish_omp_structured_block (sb
));
38927 /* Main entry-point for parsing Cilk Plus _Cilk_for
38928 loops. The return value is error_mark_node
38929 when errors happen and CILK_FOR tree on success. */
38932 cp_parser_cilk_for (cp_parser
*parser
, tree grain
, bool *if_p
)
38934 if (cp_lexer_next_token_is_not_keyword (parser
->lexer
, RID_CILK_FOR
))
38935 gcc_unreachable ();
38937 tree sb
= begin_omp_structured_block ();
38938 int save
= cp_parser_begin_omp_structured_block (parser
);
38940 tree clauses
= build_omp_clause (EXPR_LOCATION (grain
), OMP_CLAUSE_SCHEDULE
);
38941 OMP_CLAUSE_SCHEDULE_KIND (clauses
) = OMP_CLAUSE_SCHEDULE_CILKFOR
;
38942 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clauses
) = grain
;
38943 clauses
= finish_omp_clauses (clauses
, C_ORT_CILK
);
38945 tree ret
= cp_parser_omp_for_loop (parser
, CILK_FOR
, clauses
, NULL
, if_p
);
38947 cpp_validate_cilk_plus_loop (ret
);
38949 ret
= error_mark_node
;
38951 cp_parser_end_omp_structured_block (parser
, save
);
38952 add_stmt (finish_omp_structured_block (sb
));
38956 /* Create an identifier for a generic parameter type (a synthesized
38957 template parameter implied by `auto' or a concept identifier). */
38959 static GTY(()) int generic_parm_count
;
38961 make_generic_type_name ()
38964 sprintf (buf
, "auto:%d", ++generic_parm_count
);
38965 return get_identifier (buf
);
38968 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
38969 (creating a new template parameter list if necessary). Returns the newly
38970 created template type parm. */
38973 synthesize_implicit_template_parm (cp_parser
*parser
, tree constr
)
38975 gcc_assert (current_binding_level
->kind
== sk_function_parms
);
38977 /* Before committing to modifying any scope, if we're in an
38978 implicit template scope, and we're trying to synthesize a
38979 constrained parameter, try to find a previous parameter with
38980 the same name. This is the same-type rule for abbreviated
38981 function templates.
38983 NOTE: We can generate implicit parameters when tentatively
38984 parsing a nested name specifier, only to reject that parse
38985 later. However, matching the same template-id as part of a
38986 direct-declarator should generate an identical template
38987 parameter, so this rule will merge them. */
38988 if (parser
->implicit_template_scope
&& constr
)
38990 tree t
= parser
->implicit_template_parms
;
38993 if (equivalent_placeholder_constraints (TREE_TYPE (t
), constr
))
38995 tree d
= TREE_VALUE (t
);
38996 if (TREE_CODE (d
) == PARM_DECL
)
38997 /* Return the TEMPLATE_PARM_INDEX. */
38998 d
= DECL_INITIAL (d
);
39001 t
= TREE_CHAIN (t
);
39005 /* We are either continuing a function template that already contains implicit
39006 template parameters, creating a new fully-implicit function template, or
39007 extending an existing explicit function template with implicit template
39010 cp_binding_level
*const entry_scope
= current_binding_level
;
39012 bool become_template
= false;
39013 cp_binding_level
*parent_scope
= 0;
39015 if (parser
->implicit_template_scope
)
39017 gcc_assert (parser
->implicit_template_parms
);
39019 current_binding_level
= parser
->implicit_template_scope
;
39023 /* Roll back to the existing template parameter scope (in the case of
39024 extending an explicit function template) or introduce a new template
39025 parameter scope ahead of the function parameter scope (or class scope
39026 in the case of out-of-line member definitions). The function scope is
39027 added back after template parameter synthesis below. */
39029 cp_binding_level
*scope
= entry_scope
;
39031 while (scope
->kind
== sk_function_parms
)
39033 parent_scope
= scope
;
39034 scope
= scope
->level_chain
;
39036 if (current_class_type
&& !LAMBDA_TYPE_P (current_class_type
))
39038 /* If not defining a class, then any class scope is a scope level in
39039 an out-of-line member definition. In this case simply wind back
39040 beyond the first such scope to inject the template parameter list.
39041 Otherwise wind back to the class being defined. The latter can
39042 occur in class member friend declarations such as:
39048 friend void A::foo (auto);
39051 The template parameter list synthesized for the friend declaration
39052 must be injected in the scope of 'B'. This can also occur in
39053 erroneous cases such as:
39059 void B::foo (auto) {}
39062 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39063 but, nevertheless, the template parameter list synthesized for the
39064 declarator should be injected into the scope of 'A' as if the
39065 ill-formed template was specified explicitly. */
39067 while (scope
->kind
== sk_class
&& !scope
->defining_class_p
)
39069 parent_scope
= scope
;
39070 scope
= scope
->level_chain
;
39074 current_binding_level
= scope
;
39076 if (scope
->kind
!= sk_template_parms
39077 || !function_being_declared_is_template_p (parser
))
39079 /* Introduce a new template parameter list for implicit template
39082 become_template
= true;
39084 parser
->implicit_template_scope
39085 = begin_scope (sk_template_parms
, NULL
);
39087 ++processing_template_decl
;
39089 parser
->fully_implicit_function_template_p
= true;
39090 ++parser
->num_template_parameter_lists
;
39094 /* Synthesize implicit template parameters at the end of the explicit
39095 template parameter list. */
39097 gcc_assert (current_template_parms
);
39099 parser
->implicit_template_scope
= scope
;
39101 tree v
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
39102 parser
->implicit_template_parms
39103 = TREE_VEC_ELT (v
, TREE_VEC_LENGTH (v
) - 1);
39107 /* Synthesize a new template parameter and track the current template
39108 parameter chain with implicit_template_parms. */
39110 tree proto
= constr
? DECL_INITIAL (constr
) : NULL_TREE
;
39111 tree synth_id
= make_generic_type_name ();
39112 tree synth_tmpl_parm
;
39113 bool non_type
= false;
39115 if (proto
== NULL_TREE
|| TREE_CODE (proto
) == TYPE_DECL
)
39117 = finish_template_type_parm (class_type_node
, synth_id
);
39118 else if (TREE_CODE (proto
) == TEMPLATE_DECL
)
39120 = finish_constrained_template_template_parm (proto
, synth_id
);
39123 synth_tmpl_parm
= copy_decl (proto
);
39124 DECL_NAME (synth_tmpl_parm
) = synth_id
;
39128 // Attach the constraint to the parm before processing.
39129 tree node
= build_tree_list (NULL_TREE
, synth_tmpl_parm
);
39130 TREE_TYPE (node
) = constr
;
39132 = process_template_parm (parser
->implicit_template_parms
,
39135 /*non_type=*/non_type
,
39136 /*param_pack=*/false);
39138 // Chain the new parameter to the list of implicit parameters.
39139 if (parser
->implicit_template_parms
)
39140 parser
->implicit_template_parms
39141 = TREE_CHAIN (parser
->implicit_template_parms
);
39143 parser
->implicit_template_parms
= new_parm
;
39145 tree new_decl
= get_local_decls ();
39147 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39148 new_decl
= DECL_INITIAL (new_decl
);
39150 /* If creating a fully implicit function template, start the new implicit
39151 template parameter list with this synthesized type, otherwise grow the
39152 current template parameter list. */
39154 if (become_template
)
39156 parent_scope
->level_chain
= current_binding_level
;
39158 tree new_parms
= make_tree_vec (1);
39159 TREE_VEC_ELT (new_parms
, 0) = parser
->implicit_template_parms
;
39160 current_template_parms
= tree_cons (size_int (processing_template_decl
),
39161 new_parms
, current_template_parms
);
39165 tree
& new_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
39166 int new_parm_idx
= TREE_VEC_LENGTH (new_parms
);
39167 new_parms
= grow_tree_vec (new_parms
, new_parm_idx
+ 1);
39168 TREE_VEC_ELT (new_parms
, new_parm_idx
) = parser
->implicit_template_parms
;
39171 // If the new parameter was constrained, we need to add that to the
39172 // constraints in the template parameter list.
39173 if (tree req
= TEMPLATE_PARM_CONSTRAINTS (tree_last (new_parm
)))
39175 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
39176 reqs
= conjoin_constraints (reqs
, req
);
39177 TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
) = reqs
;
39180 current_binding_level
= entry_scope
;
39185 /* Finish the declaration of a fully implicit function template. Such a
39186 template has no explicit template parameter list so has not been through the
39187 normal template head and tail processing. synthesize_implicit_template_parm
39188 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39189 provided if the declaration is a class member such that its template
39190 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39191 form is returned. Otherwise NULL_TREE is returned. */
39194 finish_fully_implicit_template (cp_parser
*parser
, tree member_decl_opt
)
39196 gcc_assert (parser
->fully_implicit_function_template_p
);
39198 if (member_decl_opt
&& member_decl_opt
!= error_mark_node
39199 && DECL_VIRTUAL_P (member_decl_opt
))
39201 error_at (DECL_SOURCE_LOCATION (member_decl_opt
),
39202 "implicit templates may not be %<virtual%>");
39203 DECL_VIRTUAL_P (member_decl_opt
) = false;
39206 if (member_decl_opt
)
39207 member_decl_opt
= finish_member_template_decl (member_decl_opt
);
39208 end_template_decl ();
39210 parser
->fully_implicit_function_template_p
= false;
39211 --parser
->num_template_parameter_lists
;
39213 return member_decl_opt
;
39216 #include "gt-cp-parser.h"