2 Copyright (C) 2000-2016 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"
39 #include "gomp-constants.h"
40 #include "c-family/c-indentation.h"
42 #include "cp-cilkplus.h"
47 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
48 and c-lex.c) and the C++ parser. */
50 static cp_token eof_token
=
52 CPP_EOF
, RID_MAX
, 0, false, false, false, 0, { NULL
}
55 /* The various kinds of non integral constant we encounter. */
56 enum non_integral_constant
{
58 /* floating-point literal */
62 /* %<__FUNCTION__%> */
64 /* %<__PRETTY_FUNCTION__%> */
72 /* %<typeid%> operator */
74 /* non-constant compound literals */
82 /* an array reference */
88 /* the address of a label */
102 /* calls to overloaded operators */
106 /* a comma operator */
108 /* a call to a constructor */
110 /* a transaction expression */
114 /* The various kinds of errors about name-lookup failing. */
115 enum name_lookup_error
{
120 /* is not a class or namespace */
122 /* is not a class, namespace, or enumeration */
126 /* The various kinds of required token */
127 enum required_token
{
129 RT_SEMICOLON
, /* ';' */
130 RT_OPEN_PAREN
, /* '(' */
131 RT_CLOSE_BRACE
, /* '}' */
132 RT_OPEN_BRACE
, /* '{' */
133 RT_CLOSE_SQUARE
, /* ']' */
134 RT_OPEN_SQUARE
, /* '[' */
138 RT_GREATER
, /* '>' */
140 RT_ELLIPSIS
, /* '...' */
144 RT_COLON_SCOPE
, /* ':' or '::' */
145 RT_CLOSE_PAREN
, /* ')' */
146 RT_COMMA_CLOSE_PAREN
, /* ',' or ')' */
147 RT_PRAGMA_EOL
, /* end of line */
148 RT_NAME
, /* identifier */
150 /* The type is CPP_KEYWORD */
152 RT_DELETE
, /* delete */
153 RT_RETURN
, /* return */
154 RT_WHILE
, /* while */
155 RT_EXTERN
, /* extern */
156 RT_STATIC_ASSERT
, /* static_assert */
157 RT_DECLTYPE
, /* decltype */
158 RT_OPERATOR
, /* operator */
159 RT_CLASS
, /* class */
160 RT_TEMPLATE
, /* template */
161 RT_NAMESPACE
, /* namespace */
162 RT_USING
, /* using */
165 RT_CATCH
, /* catch */
166 RT_THROW
, /* throw */
167 RT_LABEL
, /* __label__ */
168 RT_AT_TRY
, /* @try */
169 RT_AT_SYNCHRONIZED
, /* @synchronized */
170 RT_AT_THROW
, /* @throw */
172 RT_SELECT
, /* selection-statement */
173 RT_INTERATION
, /* iteration-statement */
174 RT_JUMP
, /* jump-statement */
175 RT_CLASS_KEY
, /* class-key */
176 RT_CLASS_TYPENAME_TEMPLATE
, /* class, typename, or template */
177 RT_TRANSACTION_ATOMIC
, /* __transaction_atomic */
178 RT_TRANSACTION_RELAXED
, /* __transaction_relaxed */
179 RT_TRANSACTION_CANCEL
/* __transaction_cancel */
182 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
183 reverting it on destruction. */
185 class type_id_in_expr_sentinel
190 type_id_in_expr_sentinel (cp_parser
*parser
, bool set
= true)
192 saved (parser
->in_type_id_in_expr_p
)
193 { parser
->in_type_id_in_expr_p
= set
; }
194 ~type_id_in_expr_sentinel ()
195 { parser
->in_type_id_in_expr_p
= saved
; }
200 static cp_lexer
*cp_lexer_new_main
202 static cp_lexer
*cp_lexer_new_from_tokens
203 (cp_token_cache
*tokens
);
204 static void cp_lexer_destroy
206 static int cp_lexer_saving_tokens
208 static cp_token
*cp_lexer_token_at
209 (cp_lexer
*, cp_token_position
);
210 static void cp_lexer_get_preprocessor_token
211 (cp_lexer
*, cp_token
*);
212 static inline cp_token
*cp_lexer_peek_token
214 static cp_token
*cp_lexer_peek_nth_token
215 (cp_lexer
*, size_t);
216 static inline bool cp_lexer_next_token_is
217 (cp_lexer
*, enum cpp_ttype
);
218 static bool cp_lexer_next_token_is_not
219 (cp_lexer
*, enum cpp_ttype
);
220 static bool cp_lexer_next_token_is_keyword
221 (cp_lexer
*, enum rid
);
222 static cp_token
*cp_lexer_consume_token
224 static void cp_lexer_purge_token
226 static void cp_lexer_purge_tokens_after
227 (cp_lexer
*, cp_token_position
);
228 static void cp_lexer_save_tokens
230 static void cp_lexer_commit_tokens
232 static void cp_lexer_rollback_tokens
234 static void cp_lexer_print_token
235 (FILE *, cp_token
*);
236 static inline bool cp_lexer_debugging_p
238 static void cp_lexer_start_debugging
239 (cp_lexer
*) ATTRIBUTE_UNUSED
;
240 static void cp_lexer_stop_debugging
241 (cp_lexer
*) ATTRIBUTE_UNUSED
;
243 static cp_token_cache
*cp_token_cache_new
244 (cp_token
*, cp_token
*);
246 static void cp_parser_initial_pragma
249 static tree cp_literal_operator_id
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
!= lexer
->buffer
->address ());
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 (C_IS_RESERVED_WORD (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 the next token is a keyword for a decl-specifier. */
943 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer
*lexer
)
947 token
= cp_lexer_peek_token (lexer
);
948 switch (token
->keyword
)
950 /* auto specifier: storage-class-specifier in C++,
951 simple-type-specifier in C++0x. */
953 /* Storage classes. */
959 /* Elaborated type specifiers. */
965 /* Simple type specifiers. */
979 /* GNU extensions. */
982 /* C++0x extensions. */
984 case RID_UNDERLYING_TYPE
:
988 if (token
->keyword
>= RID_FIRST_INT_N
989 && token
->keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
990 && int_n_enabled_p
[token
->keyword
- RID_FIRST_INT_N
])
996 /* Returns TRUE iff the token T begins a decltype type. */
999 token_is_decltype (cp_token
*t
)
1001 return (t
->keyword
== RID_DECLTYPE
1002 || t
->type
== CPP_DECLTYPE
);
1005 /* Returns TRUE iff the next token begins a decltype type. */
1008 cp_lexer_next_token_is_decltype (cp_lexer
*lexer
)
1010 cp_token
*t
= cp_lexer_peek_token (lexer
);
1011 return token_is_decltype (t
);
1014 /* Called when processing a token with tree_check_value; perform or defer the
1015 associated checks and return the value. */
1018 saved_checks_value (struct tree_check
*check_value
)
1020 /* Perform any access checks that were deferred. */
1021 vec
<deferred_access_check
, va_gc
> *checks
;
1022 deferred_access_check
*chk
;
1023 checks
= check_value
->checks
;
1027 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
1028 perform_or_defer_access_check (chk
->binfo
,
1030 chk
->diag_decl
, tf_warning_or_error
);
1032 /* Return the stored value. */
1033 return check_value
->value
;
1036 /* Return a pointer to the Nth token in the token stream. If N is 1,
1037 then this is precisely equivalent to cp_lexer_peek_token (except
1038 that it is not inline). One would like to disallow that case, but
1039 there is one case (cp_parser_nth_token_starts_template_id) where
1040 the caller passes a variable for N and it might be 1. */
1043 cp_lexer_peek_nth_token (cp_lexer
* lexer
, size_t n
)
1047 /* N is 1-based, not zero-based. */
1050 if (cp_lexer_debugging_p (lexer
))
1051 fprintf (cp_lexer_debug_stream
,
1052 "cp_lexer: peeking ahead %ld at token: ", (long)n
);
1055 token
= lexer
->next_token
;
1056 gcc_assert (!n
|| token
!= &eof_token
);
1060 if (token
== lexer
->last_token
)
1066 if (!token
->purged_p
)
1070 if (cp_lexer_debugging_p (lexer
))
1072 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
1073 putc ('\n', cp_lexer_debug_stream
);
1079 /* Return the next token, and advance the lexer's next_token pointer
1080 to point to the next non-purged token. */
1083 cp_lexer_consume_token (cp_lexer
* lexer
)
1085 cp_token
*token
= lexer
->next_token
;
1087 gcc_assert (token
!= &eof_token
);
1088 gcc_assert (!lexer
->in_pragma
|| token
->type
!= CPP_PRAGMA_EOL
);
1092 lexer
->next_token
++;
1093 if (lexer
->next_token
== lexer
->last_token
)
1095 lexer
->next_token
= &eof_token
;
1100 while (lexer
->next_token
->purged_p
);
1102 cp_lexer_set_source_position_from_token (token
);
1104 /* Provide debugging output. */
1105 if (cp_lexer_debugging_p (lexer
))
1107 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream
);
1108 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
1109 putc ('\n', cp_lexer_debug_stream
);
1115 /* Permanently remove the next token from the token stream, and
1116 advance the next_token pointer to refer to the next non-purged
1120 cp_lexer_purge_token (cp_lexer
*lexer
)
1122 cp_token
*tok
= lexer
->next_token
;
1124 gcc_assert (tok
!= &eof_token
);
1125 tok
->purged_p
= true;
1126 tok
->location
= UNKNOWN_LOCATION
;
1127 tok
->u
.value
= NULL_TREE
;
1128 tok
->keyword
= RID_MAX
;
1133 if (tok
== lexer
->last_token
)
1139 while (tok
->purged_p
);
1140 lexer
->next_token
= tok
;
1143 /* Permanently remove all tokens after TOK, up to, but not
1144 including, the token that will be returned next by
1145 cp_lexer_peek_token. */
1148 cp_lexer_purge_tokens_after (cp_lexer
*lexer
, cp_token
*tok
)
1150 cp_token
*peek
= lexer
->next_token
;
1152 if (peek
== &eof_token
)
1153 peek
= lexer
->last_token
;
1155 gcc_assert (tok
< peek
);
1157 for ( tok
+= 1; tok
!= peek
; tok
+= 1)
1159 tok
->purged_p
= true;
1160 tok
->location
= UNKNOWN_LOCATION
;
1161 tok
->u
.value
= NULL_TREE
;
1162 tok
->keyword
= RID_MAX
;
1166 /* Begin saving tokens. All tokens consumed after this point will be
1170 cp_lexer_save_tokens (cp_lexer
* lexer
)
1172 /* Provide debugging output. */
1173 if (cp_lexer_debugging_p (lexer
))
1174 fprintf (cp_lexer_debug_stream
, "cp_lexer: saving tokens\n");
1176 lexer
->saved_tokens
.safe_push (lexer
->next_token
);
1179 /* Commit to the portion of the token stream most recently saved. */
1182 cp_lexer_commit_tokens (cp_lexer
* lexer
)
1184 /* Provide debugging output. */
1185 if (cp_lexer_debugging_p (lexer
))
1186 fprintf (cp_lexer_debug_stream
, "cp_lexer: committing tokens\n");
1188 lexer
->saved_tokens
.pop ();
1191 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1192 to the token stream. Stop saving tokens. */
1195 cp_lexer_rollback_tokens (cp_lexer
* lexer
)
1197 /* Provide debugging output. */
1198 if (cp_lexer_debugging_p (lexer
))
1199 fprintf (cp_lexer_debug_stream
, "cp_lexer: restoring tokens\n");
1201 lexer
->next_token
= lexer
->saved_tokens
.pop ();
1204 /* RAII wrapper around the above functions, with sanity checking. Creating
1205 a variable saves tokens, which are committed when the variable is
1206 destroyed unless they are explicitly rolled back by calling the rollback
1209 struct saved_token_sentinel
1214 saved_token_sentinel(cp_lexer
*lexer
): lexer(lexer
), commit(true)
1216 len
= lexer
->saved_tokens
.length ();
1217 cp_lexer_save_tokens (lexer
);
1221 cp_lexer_rollback_tokens (lexer
);
1224 ~saved_token_sentinel()
1227 cp_lexer_commit_tokens (lexer
);
1228 gcc_assert (lexer
->saved_tokens
.length () == len
);
1232 /* Print a representation of the TOKEN on the STREAM. */
1235 cp_lexer_print_token (FILE * stream
, cp_token
*token
)
1237 /* We don't use cpp_type2name here because the parser defines
1238 a few tokens of its own. */
1239 static const char *const token_names
[] = {
1240 /* cpplib-defined token types */
1241 #define OP(e, s) #e,
1242 #define TK(e, s) #e,
1246 /* C++ parser token types - see "Manifest constants", above. */
1249 "NESTED_NAME_SPECIFIER",
1252 /* For some tokens, print the associated data. */
1253 switch (token
->type
)
1256 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1257 For example, `struct' is mapped to an INTEGER_CST. */
1258 if (!identifier_p (token
->u
.value
))
1260 /* else fall through */
1262 fputs (IDENTIFIER_POINTER (token
->u
.value
), stream
);
1269 case CPP_UTF8STRING
:
1270 fprintf (stream
, " \"%s\"", TREE_STRING_POINTER (token
->u
.value
));
1274 print_generic_expr (stream
, token
->u
.value
, 0);
1278 /* If we have a name for the token, print it out. Otherwise, we
1279 simply give the numeric code. */
1280 if (token
->type
< ARRAY_SIZE(token_names
))
1281 fputs (token_names
[token
->type
], stream
);
1283 fprintf (stream
, "[%d]", token
->type
);
1289 debug (cp_token
&ref
)
1291 cp_lexer_print_token (stderr
, &ref
);
1292 fprintf (stderr
, "\n");
1296 debug (cp_token
*ptr
)
1301 fprintf (stderr
, "<nil>\n");
1305 /* Start emitting debugging information. */
1308 cp_lexer_start_debugging (cp_lexer
* lexer
)
1310 if (!LEXER_DEBUGGING_ENABLED_P
)
1311 fatal_error (input_location
,
1312 "LEXER_DEBUGGING_ENABLED_P is not set to true");
1314 lexer
->debugging_p
= true;
1315 cp_lexer_debug_stream
= stderr
;
1318 /* Stop emitting debugging information. */
1321 cp_lexer_stop_debugging (cp_lexer
* lexer
)
1323 if (!LEXER_DEBUGGING_ENABLED_P
)
1324 fatal_error (input_location
,
1325 "LEXER_DEBUGGING_ENABLED_P is not set to true");
1327 lexer
->debugging_p
= false;
1328 cp_lexer_debug_stream
= NULL
;
1331 /* Create a new cp_token_cache, representing a range of tokens. */
1333 static cp_token_cache
*
1334 cp_token_cache_new (cp_token
*first
, cp_token
*last
)
1336 cp_token_cache
*cache
= ggc_alloc
<cp_token_cache
> ();
1337 cache
->first
= first
;
1342 /* Diagnose if #pragma omp declare simd isn't followed immediately
1343 by function declaration or definition. */
1346 cp_ensure_no_omp_declare_simd (cp_parser
*parser
)
1348 if (parser
->omp_declare_simd
&& !parser
->omp_declare_simd
->error_seen
)
1350 error ("%<#pragma omp declare simd%> not immediately followed by "
1351 "function declaration or definition");
1352 parser
->omp_declare_simd
= NULL
;
1356 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1357 and put that into "omp declare simd" attribute. */
1360 cp_finalize_omp_declare_simd (cp_parser
*parser
, tree fndecl
)
1362 if (__builtin_expect (parser
->omp_declare_simd
!= NULL
, 0))
1364 if (fndecl
== error_mark_node
)
1366 parser
->omp_declare_simd
= NULL
;
1369 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
1371 cp_ensure_no_omp_declare_simd (parser
);
1377 /* Diagnose if #pragma acc routine isn't followed immediately by function
1378 declaration or definition. */
1381 cp_ensure_no_oacc_routine (cp_parser
*parser
)
1383 if (parser
->oacc_routine
&& !parser
->oacc_routine
->error_seen
)
1385 tree clauses
= parser
->oacc_routine
->clauses
;
1386 location_t loc
= OMP_CLAUSE_LOCATION (TREE_PURPOSE (clauses
));
1388 error_at (loc
, "%<#pragma acc routine%> not followed by a function "
1389 "declaration or definition");
1390 parser
->oacc_routine
= NULL
;
1394 /* Decl-specifiers. */
1396 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1399 clear_decl_specs (cp_decl_specifier_seq
*decl_specs
)
1401 memset (decl_specs
, 0, sizeof (cp_decl_specifier_seq
));
1406 /* Nothing other than the parser should be creating declarators;
1407 declarators are a semi-syntactic representation of C++ entities.
1408 Other parts of the front end that need to create entities (like
1409 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1411 static cp_declarator
*make_call_declarator
1412 (cp_declarator
*, tree
, cp_cv_quals
, cp_virt_specifiers
, cp_ref_qualifier
, tree
, tree
, tree
, tree
);
1413 static cp_declarator
*make_array_declarator
1414 (cp_declarator
*, tree
);
1415 static cp_declarator
*make_pointer_declarator
1416 (cp_cv_quals
, cp_declarator
*, tree
);
1417 static cp_declarator
*make_reference_declarator
1418 (cp_cv_quals
, cp_declarator
*, bool, tree
);
1419 static cp_declarator
*make_ptrmem_declarator
1420 (cp_cv_quals
, tree
, cp_declarator
*, tree
);
1422 /* An erroneous declarator. */
1423 static cp_declarator
*cp_error_declarator
;
1425 /* The obstack on which declarators and related data structures are
1427 static struct obstack declarator_obstack
;
1429 /* Alloc BYTES from the declarator memory pool. */
1431 static inline void *
1432 alloc_declarator (size_t bytes
)
1434 return obstack_alloc (&declarator_obstack
, bytes
);
1437 /* Allocate a declarator of the indicated KIND. Clear fields that are
1438 common to all declarators. */
1440 static cp_declarator
*
1441 make_declarator (cp_declarator_kind kind
)
1443 cp_declarator
*declarator
;
1445 declarator
= (cp_declarator
*) alloc_declarator (sizeof (cp_declarator
));
1446 declarator
->kind
= kind
;
1447 declarator
->attributes
= NULL_TREE
;
1448 declarator
->std_attributes
= NULL_TREE
;
1449 declarator
->declarator
= NULL
;
1450 declarator
->parameter_pack_p
= false;
1451 declarator
->id_loc
= UNKNOWN_LOCATION
;
1456 /* Make a declarator for a generalized identifier. If
1457 QUALIFYING_SCOPE is non-NULL, the identifier is
1458 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1459 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1462 static cp_declarator
*
1463 make_id_declarator (tree qualifying_scope
, tree unqualified_name
,
1464 special_function_kind sfk
)
1466 cp_declarator
*declarator
;
1468 /* It is valid to write:
1470 class C { void f(); };
1474 The standard is not clear about whether `typedef const C D' is
1475 legal; as of 2002-09-15 the committee is considering that
1476 question. EDG 3.0 allows that syntax. Therefore, we do as
1478 if (qualifying_scope
&& TYPE_P (qualifying_scope
))
1479 qualifying_scope
= TYPE_MAIN_VARIANT (qualifying_scope
);
1481 gcc_assert (identifier_p (unqualified_name
)
1482 || TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
1483 || TREE_CODE (unqualified_name
) == TEMPLATE_ID_EXPR
);
1485 declarator
= make_declarator (cdk_id
);
1486 declarator
->u
.id
.qualifying_scope
= qualifying_scope
;
1487 declarator
->u
.id
.unqualified_name
= unqualified_name
;
1488 declarator
->u
.id
.sfk
= sfk
;
1493 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1494 of modifiers such as const or volatile to apply to the pointer
1495 type, represented as identifiers. ATTRIBUTES represent the attributes that
1496 appertain to the pointer or reference. */
1499 make_pointer_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
,
1502 cp_declarator
*declarator
;
1504 declarator
= make_declarator (cdk_pointer
);
1505 declarator
->declarator
= target
;
1506 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1507 declarator
->u
.pointer
.class_type
= NULL_TREE
;
1510 declarator
->id_loc
= target
->id_loc
;
1511 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1512 target
->parameter_pack_p
= false;
1515 declarator
->parameter_pack_p
= false;
1517 declarator
->std_attributes
= attributes
;
1522 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1523 represent the attributes that appertain to the pointer or
1527 make_reference_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
,
1528 bool rvalue_ref
, tree attributes
)
1530 cp_declarator
*declarator
;
1532 declarator
= make_declarator (cdk_reference
);
1533 declarator
->declarator
= target
;
1534 declarator
->u
.reference
.qualifiers
= cv_qualifiers
;
1535 declarator
->u
.reference
.rvalue_ref
= rvalue_ref
;
1538 declarator
->id_loc
= target
->id_loc
;
1539 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1540 target
->parameter_pack_p
= false;
1543 declarator
->parameter_pack_p
= false;
1545 declarator
->std_attributes
= attributes
;
1550 /* Like make_pointer_declarator -- but for a pointer to a non-static
1551 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1552 appertain to the pointer or reference. */
1555 make_ptrmem_declarator (cp_cv_quals cv_qualifiers
, tree class_type
,
1556 cp_declarator
*pointee
,
1559 cp_declarator
*declarator
;
1561 declarator
= make_declarator (cdk_ptrmem
);
1562 declarator
->declarator
= pointee
;
1563 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1564 declarator
->u
.pointer
.class_type
= class_type
;
1568 declarator
->parameter_pack_p
= pointee
->parameter_pack_p
;
1569 pointee
->parameter_pack_p
= false;
1572 declarator
->parameter_pack_p
= false;
1574 declarator
->std_attributes
= attributes
;
1579 /* Make a declarator for the function given by TARGET, with the
1580 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1581 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1582 indicates what exceptions can be thrown. */
1585 make_call_declarator (cp_declarator
*target
,
1587 cp_cv_quals cv_qualifiers
,
1588 cp_virt_specifiers virt_specifiers
,
1589 cp_ref_qualifier ref_qualifier
,
1591 tree exception_specification
,
1592 tree late_return_type
,
1593 tree requires_clause
)
1595 cp_declarator
*declarator
;
1597 declarator
= make_declarator (cdk_function
);
1598 declarator
->declarator
= target
;
1599 declarator
->u
.function
.parameters
= parms
;
1600 declarator
->u
.function
.qualifiers
= cv_qualifiers
;
1601 declarator
->u
.function
.virt_specifiers
= virt_specifiers
;
1602 declarator
->u
.function
.ref_qualifier
= ref_qualifier
;
1603 declarator
->u
.function
.tx_qualifier
= tx_qualifier
;
1604 declarator
->u
.function
.exception_specification
= exception_specification
;
1605 declarator
->u
.function
.late_return_type
= late_return_type
;
1606 declarator
->u
.function
.requires_clause
= requires_clause
;
1609 declarator
->id_loc
= target
->id_loc
;
1610 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1611 target
->parameter_pack_p
= false;
1614 declarator
->parameter_pack_p
= false;
1619 /* Make a declarator for an array of BOUNDS elements, each of which is
1620 defined by ELEMENT. */
1623 make_array_declarator (cp_declarator
*element
, tree bounds
)
1625 cp_declarator
*declarator
;
1627 declarator
= make_declarator (cdk_array
);
1628 declarator
->declarator
= element
;
1629 declarator
->u
.array
.bounds
= bounds
;
1632 declarator
->id_loc
= element
->id_loc
;
1633 declarator
->parameter_pack_p
= element
->parameter_pack_p
;
1634 element
->parameter_pack_p
= false;
1637 declarator
->parameter_pack_p
= false;
1642 /* Determine whether the declarator we've seen so far can be a
1643 parameter pack, when followed by an ellipsis. */
1645 declarator_can_be_parameter_pack (cp_declarator
*declarator
)
1647 if (declarator
&& declarator
->parameter_pack_p
)
1648 /* We already saw an ellipsis. */
1651 /* Search for a declarator name, or any other declarator that goes
1652 after the point where the ellipsis could appear in a parameter
1653 pack. If we find any of these, then this declarator can not be
1654 made into a parameter pack. */
1656 while (declarator
&& !found
)
1658 switch ((int)declarator
->kind
)
1669 declarator
= declarator
->declarator
;
1677 cp_parameter_declarator
*no_parameters
;
1679 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1680 DECLARATOR and DEFAULT_ARGUMENT. */
1682 cp_parameter_declarator
*
1683 make_parameter_declarator (cp_decl_specifier_seq
*decl_specifiers
,
1684 cp_declarator
*declarator
,
1685 tree default_argument
,
1686 bool template_parameter_pack_p
= false)
1688 cp_parameter_declarator
*parameter
;
1690 parameter
= ((cp_parameter_declarator
*)
1691 alloc_declarator (sizeof (cp_parameter_declarator
)));
1692 parameter
->next
= NULL
;
1693 if (decl_specifiers
)
1694 parameter
->decl_specifiers
= *decl_specifiers
;
1696 clear_decl_specs (¶meter
->decl_specifiers
);
1697 parameter
->declarator
= declarator
;
1698 parameter
->default_argument
= default_argument
;
1699 parameter
->template_parameter_pack_p
= template_parameter_pack_p
;
1704 /* Returns true iff DECLARATOR is a declaration for a function. */
1707 function_declarator_p (const cp_declarator
*declarator
)
1711 if (declarator
->kind
== cdk_function
1712 && declarator
->declarator
->kind
== cdk_id
)
1714 if (declarator
->kind
== cdk_id
1715 || declarator
->kind
== cdk_error
)
1717 declarator
= declarator
->declarator
;
1727 A cp_parser parses the token stream as specified by the C++
1728 grammar. Its job is purely parsing, not semantic analysis. For
1729 example, the parser breaks the token stream into declarators,
1730 expressions, statements, and other similar syntactic constructs.
1731 It does not check that the types of the expressions on either side
1732 of an assignment-statement are compatible, or that a function is
1733 not declared with a parameter of type `void'.
1735 The parser invokes routines elsewhere in the compiler to perform
1736 semantic analysis and to build up the abstract syntax tree for the
1739 The parser (and the template instantiation code, which is, in a
1740 way, a close relative of parsing) are the only parts of the
1741 compiler that should be calling push_scope and pop_scope, or
1742 related functions. The parser (and template instantiation code)
1743 keeps track of what scope is presently active; everything else
1744 should simply honor that. (The code that generates static
1745 initializers may also need to set the scope, in order to check
1746 access control correctly when emitting the initializers.)
1751 The parser is of the standard recursive-descent variety. Upcoming
1752 tokens in the token stream are examined in order to determine which
1753 production to use when parsing a non-terminal. Some C++ constructs
1754 require arbitrary look ahead to disambiguate. For example, it is
1755 impossible, in the general case, to tell whether a statement is an
1756 expression or declaration without scanning the entire statement.
1757 Therefore, the parser is capable of "parsing tentatively." When the
1758 parser is not sure what construct comes next, it enters this mode.
1759 Then, while we attempt to parse the construct, the parser queues up
1760 error messages, rather than issuing them immediately, and saves the
1761 tokens it consumes. If the construct is parsed successfully, the
1762 parser "commits", i.e., it issues any queued error messages and
1763 the tokens that were being preserved are permanently discarded.
1764 If, however, the construct is not parsed successfully, the parser
1765 rolls back its state completely so that it can resume parsing using
1766 a different alternative.
1771 The performance of the parser could probably be improved substantially.
1772 We could often eliminate the need to parse tentatively by looking ahead
1773 a little bit. In some places, this approach might not entirely eliminate
1774 the need to parse tentatively, but it might still speed up the average
1777 /* Flags that are passed to some parsing functions. These values can
1778 be bitwise-ored together. */
1783 CP_PARSER_FLAGS_NONE
= 0x0,
1784 /* The construct is optional. If it is not present, then no error
1785 should be issued. */
1786 CP_PARSER_FLAGS_OPTIONAL
= 0x1,
1787 /* When parsing a type-specifier, treat user-defined type-names
1788 as non-type identifiers. */
1789 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
= 0x2,
1790 /* When parsing a type-specifier, do not try to parse a class-specifier
1791 or enum-specifier. */
1792 CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
= 0x4,
1793 /* When parsing a decl-specifier-seq, only allow type-specifier or
1795 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
= 0x8
1798 /* This type is used for parameters and variables which hold
1799 combinations of the above flags. */
1800 typedef int cp_parser_flags
;
1802 /* The different kinds of declarators we want to parse. */
1804 enum cp_parser_declarator_kind
1806 /* We want an abstract declarator. */
1807 CP_PARSER_DECLARATOR_ABSTRACT
,
1808 /* We want a named declarator. */
1809 CP_PARSER_DECLARATOR_NAMED
,
1810 /* We don't mind, but the name must be an unqualified-id. */
1811 CP_PARSER_DECLARATOR_EITHER
1814 /* The precedence values used to parse binary expressions. The minimum value
1815 of PREC must be 1, because zero is reserved to quickly discriminate
1816 binary operators from other tokens. */
1821 PREC_LOGICAL_OR_EXPRESSION
,
1822 PREC_LOGICAL_AND_EXPRESSION
,
1823 PREC_INCLUSIVE_OR_EXPRESSION
,
1824 PREC_EXCLUSIVE_OR_EXPRESSION
,
1825 PREC_AND_EXPRESSION
,
1826 PREC_EQUALITY_EXPRESSION
,
1827 PREC_RELATIONAL_EXPRESSION
,
1828 PREC_SHIFT_EXPRESSION
,
1829 PREC_ADDITIVE_EXPRESSION
,
1830 PREC_MULTIPLICATIVE_EXPRESSION
,
1832 NUM_PREC_VALUES
= PREC_PM_EXPRESSION
1835 /* A mapping from a token type to a corresponding tree node type, with a
1836 precedence value. */
1838 struct cp_parser_binary_operations_map_node
1840 /* The token type. */
1841 enum cpp_ttype token_type
;
1842 /* The corresponding tree code. */
1843 enum tree_code tree_type
;
1844 /* The precedence of this operator. */
1845 enum cp_parser_prec prec
;
1848 struct cp_parser_expression_stack_entry
1850 /* Left hand side of the binary operation we are currently
1853 /* Original tree code for left hand side, if it was a binary
1854 expression itself (used for -Wparentheses). */
1855 enum tree_code lhs_type
;
1856 /* Tree code for the binary operation we are parsing. */
1857 enum tree_code tree_type
;
1858 /* Precedence of the binary operation we are parsing. */
1859 enum cp_parser_prec prec
;
1860 /* Location of the binary operation we are parsing. */
1864 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1865 entries because precedence levels on the stack are monotonically
1867 typedef struct cp_parser_expression_stack_entry
1868 cp_parser_expression_stack
[NUM_PREC_VALUES
];
1872 /* Constructors and destructors. */
1874 static cp_parser_context
*cp_parser_context_new
1875 (cp_parser_context
*);
1877 /* Class variables. */
1879 static GTY((deletable
)) cp_parser_context
* cp_parser_context_free_list
;
1881 /* The operator-precedence table used by cp_parser_binary_expression.
1882 Transformed into an associative array (binops_by_token) by
1885 static const cp_parser_binary_operations_map_node binops
[] = {
1886 { CPP_DEREF_STAR
, MEMBER_REF
, PREC_PM_EXPRESSION
},
1887 { CPP_DOT_STAR
, DOTSTAR_EXPR
, PREC_PM_EXPRESSION
},
1889 { CPP_MULT
, MULT_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1890 { CPP_DIV
, TRUNC_DIV_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1891 { CPP_MOD
, TRUNC_MOD_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1893 { CPP_PLUS
, PLUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1894 { CPP_MINUS
, MINUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1896 { CPP_LSHIFT
, LSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1897 { CPP_RSHIFT
, RSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1899 { CPP_LESS
, LT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1900 { CPP_GREATER
, GT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1901 { CPP_LESS_EQ
, LE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1902 { CPP_GREATER_EQ
, GE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1904 { CPP_EQ_EQ
, EQ_EXPR
, PREC_EQUALITY_EXPRESSION
},
1905 { CPP_NOT_EQ
, NE_EXPR
, PREC_EQUALITY_EXPRESSION
},
1907 { CPP_AND
, BIT_AND_EXPR
, PREC_AND_EXPRESSION
},
1909 { CPP_XOR
, BIT_XOR_EXPR
, PREC_EXCLUSIVE_OR_EXPRESSION
},
1911 { CPP_OR
, BIT_IOR_EXPR
, PREC_INCLUSIVE_OR_EXPRESSION
},
1913 { CPP_AND_AND
, TRUTH_ANDIF_EXPR
, PREC_LOGICAL_AND_EXPRESSION
},
1915 { CPP_OR_OR
, TRUTH_ORIF_EXPR
, PREC_LOGICAL_OR_EXPRESSION
}
1918 /* The same as binops, but initialized by cp_parser_new so that
1919 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1921 static cp_parser_binary_operations_map_node binops_by_token
[N_CP_TTYPES
];
1923 /* Constructors and destructors. */
1925 /* Construct a new context. The context below this one on the stack
1926 is given by NEXT. */
1928 static cp_parser_context
*
1929 cp_parser_context_new (cp_parser_context
* next
)
1931 cp_parser_context
*context
;
1933 /* Allocate the storage. */
1934 if (cp_parser_context_free_list
!= NULL
)
1936 /* Pull the first entry from the free list. */
1937 context
= cp_parser_context_free_list
;
1938 cp_parser_context_free_list
= context
->next
;
1939 memset (context
, 0, sizeof (*context
));
1942 context
= ggc_cleared_alloc
<cp_parser_context
> ();
1944 /* No errors have occurred yet in this context. */
1945 context
->status
= CP_PARSER_STATUS_KIND_NO_ERROR
;
1946 /* If this is not the bottommost context, copy information that we
1947 need from the previous context. */
1950 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1951 expression, then we are parsing one in this context, too. */
1952 context
->object_type
= next
->object_type
;
1953 /* Thread the stack. */
1954 context
->next
= next
;
1960 /* Managing the unparsed function queues. */
1962 #define unparsed_funs_with_default_args \
1963 parser->unparsed_queues->last ().funs_with_default_args
1964 #define unparsed_funs_with_definitions \
1965 parser->unparsed_queues->last ().funs_with_definitions
1966 #define unparsed_nsdmis \
1967 parser->unparsed_queues->last ().nsdmis
1968 #define unparsed_classes \
1969 parser->unparsed_queues->last ().classes
1972 push_unparsed_function_queues (cp_parser
*parser
)
1974 cp_unparsed_functions_entry e
= {NULL
, make_tree_vector (), NULL
, NULL
};
1975 vec_safe_push (parser
->unparsed_queues
, e
);
1979 pop_unparsed_function_queues (cp_parser
*parser
)
1981 release_tree_vector (unparsed_funs_with_definitions
);
1982 parser
->unparsed_queues
->pop ();
1987 /* Constructors and destructors. */
1989 static cp_parser
*cp_parser_new
1992 /* Routines to parse various constructs.
1994 Those that return `tree' will return the error_mark_node (rather
1995 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1996 Sometimes, they will return an ordinary node if error-recovery was
1997 attempted, even though a parse error occurred. So, to check
1998 whether or not a parse error occurred, you should always use
1999 cp_parser_error_occurred. If the construct is optional (indicated
2000 either by an `_opt' in the name of the function that does the
2001 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2002 the construct is not present. */
2004 /* Lexical conventions [gram.lex] */
2006 static cp_expr cp_parser_identifier
2008 static cp_expr cp_parser_string_literal
2009 (cp_parser
*, bool, bool, bool);
2010 static cp_expr cp_parser_userdef_char_literal
2012 static tree cp_parser_userdef_string_literal
2014 static cp_expr cp_parser_userdef_numeric_literal
2017 /* Basic concepts [gram.basic] */
2019 static bool cp_parser_translation_unit
2022 /* Expressions [gram.expr] */
2024 static cp_expr cp_parser_primary_expression
2025 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
2026 static cp_expr cp_parser_id_expression
2027 (cp_parser
*, bool, bool, bool *, bool, bool);
2028 static cp_expr cp_parser_unqualified_id
2029 (cp_parser
*, bool, bool, bool, bool);
2030 static tree cp_parser_nested_name_specifier_opt
2031 (cp_parser
*, bool, bool, bool, bool);
2032 static tree cp_parser_nested_name_specifier
2033 (cp_parser
*, bool, bool, bool, bool);
2034 static tree cp_parser_qualifying_entity
2035 (cp_parser
*, bool, bool, bool, bool, bool);
2036 static cp_expr cp_parser_postfix_expression
2037 (cp_parser
*, bool, bool, bool, bool, cp_id_kind
*);
2038 static tree cp_parser_postfix_open_square_expression
2039 (cp_parser
*, tree
, bool, bool);
2040 static tree cp_parser_postfix_dot_deref_expression
2041 (cp_parser
*, enum cpp_ttype
, cp_expr
, bool, cp_id_kind
*, location_t
);
2042 static vec
<tree
, va_gc
> *cp_parser_parenthesized_expression_list
2043 (cp_parser
*, int, bool, bool, bool *, location_t
* = NULL
);
2044 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2045 enum { non_attr
= 0, normal_attr
= 1, id_attr
= 2 };
2046 static void cp_parser_pseudo_destructor_name
2047 (cp_parser
*, tree
, tree
*, tree
*);
2048 static cp_expr cp_parser_unary_expression
2049 (cp_parser
*, cp_id_kind
* = NULL
, bool = false, bool = false, bool = false);
2050 static enum tree_code cp_parser_unary_operator
2052 static tree cp_parser_new_expression
2054 static vec
<tree
, va_gc
> *cp_parser_new_placement
2056 static tree cp_parser_new_type_id
2057 (cp_parser
*, tree
*);
2058 static cp_declarator
*cp_parser_new_declarator_opt
2060 static cp_declarator
*cp_parser_direct_new_declarator
2062 static vec
<tree
, va_gc
> *cp_parser_new_initializer
2064 static tree cp_parser_delete_expression
2066 static cp_expr cp_parser_cast_expression
2067 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
2068 static cp_expr cp_parser_binary_expression
2069 (cp_parser
*, bool, bool, enum cp_parser_prec
, cp_id_kind
*);
2070 static tree cp_parser_question_colon_clause
2071 (cp_parser
*, cp_expr
);
2072 static cp_expr cp_parser_assignment_expression
2073 (cp_parser
*, cp_id_kind
* = NULL
, bool = false, bool = false);
2074 static enum tree_code cp_parser_assignment_operator_opt
2076 static cp_expr cp_parser_expression
2077 (cp_parser
*, cp_id_kind
* = NULL
, bool = false, bool = false);
2078 static cp_expr cp_parser_constant_expression
2079 (cp_parser
*, bool = false, bool * = NULL
);
2080 static cp_expr cp_parser_builtin_offsetof
2082 static cp_expr cp_parser_lambda_expression
2084 static void cp_parser_lambda_introducer
2085 (cp_parser
*, tree
);
2086 static bool cp_parser_lambda_declarator_opt
2087 (cp_parser
*, tree
);
2088 static void cp_parser_lambda_body
2089 (cp_parser
*, tree
);
2091 /* Statements [gram.stmt.stmt] */
2093 static void cp_parser_statement
2094 (cp_parser
*, tree
, bool, bool *, vec
<tree
> * = NULL
);
2095 static void cp_parser_label_for_labeled_statement
2096 (cp_parser
*, tree
);
2097 static tree cp_parser_expression_statement
2098 (cp_parser
*, tree
);
2099 static tree cp_parser_compound_statement
2100 (cp_parser
*, tree
, int, bool);
2101 static void cp_parser_statement_seq_opt
2102 (cp_parser
*, tree
);
2103 static tree cp_parser_selection_statement
2104 (cp_parser
*, bool *, vec
<tree
> *);
2105 static tree cp_parser_condition
2107 static tree cp_parser_iteration_statement
2108 (cp_parser
*, bool *, bool);
2109 static bool cp_parser_for_init_statement
2110 (cp_parser
*, tree
*decl
);
2111 static tree cp_parser_for
2112 (cp_parser
*, bool);
2113 static tree cp_parser_c_for
2114 (cp_parser
*, tree
, tree
, bool);
2115 static tree cp_parser_range_for
2116 (cp_parser
*, tree
, tree
, tree
, bool);
2117 static void do_range_for_auto_deduction
2119 static tree cp_parser_perform_range_for_lookup
2120 (tree
, tree
*, tree
*);
2121 static tree cp_parser_range_for_member_function
2123 static tree cp_parser_jump_statement
2125 static void cp_parser_declaration_statement
2128 static tree cp_parser_implicitly_scoped_statement
2129 (cp_parser
*, bool *, const token_indent_info
&, vec
<tree
> * = NULL
);
2130 static void cp_parser_already_scoped_statement
2131 (cp_parser
*, bool *, const token_indent_info
&);
2133 /* Declarations [gram.dcl.dcl] */
2135 static void cp_parser_declaration_seq_opt
2137 static void cp_parser_declaration
2139 static void cp_parser_block_declaration
2140 (cp_parser
*, bool);
2141 static void cp_parser_simple_declaration
2142 (cp_parser
*, bool, tree
*);
2143 static void cp_parser_decl_specifier_seq
2144 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, int *);
2145 static tree cp_parser_storage_class_specifier_opt
2147 static tree cp_parser_function_specifier_opt
2148 (cp_parser
*, cp_decl_specifier_seq
*);
2149 static tree cp_parser_type_specifier
2150 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, bool,
2152 static tree cp_parser_simple_type_specifier
2153 (cp_parser
*, cp_decl_specifier_seq
*, cp_parser_flags
);
2154 static tree cp_parser_type_name
2155 (cp_parser
*, bool);
2156 static tree cp_parser_type_name
2158 static tree cp_parser_nonclass_name
2159 (cp_parser
* parser
);
2160 static tree cp_parser_elaborated_type_specifier
2161 (cp_parser
*, bool, bool);
2162 static tree cp_parser_enum_specifier
2164 static void cp_parser_enumerator_list
2165 (cp_parser
*, tree
);
2166 static void cp_parser_enumerator_definition
2167 (cp_parser
*, tree
);
2168 static tree cp_parser_namespace_name
2170 static void cp_parser_namespace_definition
2172 static void cp_parser_namespace_body
2174 static tree cp_parser_qualified_namespace_specifier
2176 static void cp_parser_namespace_alias_definition
2178 static bool cp_parser_using_declaration
2179 (cp_parser
*, bool);
2180 static void cp_parser_using_directive
2182 static tree cp_parser_alias_declaration
2184 static void cp_parser_asm_definition
2186 static void cp_parser_linkage_specification
2188 static void cp_parser_static_assert
2189 (cp_parser
*, bool);
2190 static tree cp_parser_decltype
2193 /* Declarators [gram.dcl.decl] */
2195 static tree cp_parser_init_declarator
2196 (cp_parser
*, cp_decl_specifier_seq
*, vec
<deferred_access_check
, va_gc
> *,
2197 bool, bool, int, bool *, tree
*, location_t
*, tree
*);
2198 static cp_declarator
*cp_parser_declarator
2199 (cp_parser
*, cp_parser_declarator_kind
, int *, bool *, bool, bool);
2200 static cp_declarator
*cp_parser_direct_declarator
2201 (cp_parser
*, cp_parser_declarator_kind
, int *, bool, bool);
2202 static enum tree_code cp_parser_ptr_operator
2203 (cp_parser
*, tree
*, cp_cv_quals
*, tree
*);
2204 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2206 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2208 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2210 static tree cp_parser_tx_qualifier_opt
2212 static tree cp_parser_late_return_type_opt
2213 (cp_parser
*, cp_declarator
*, tree
&, cp_cv_quals
);
2214 static tree cp_parser_declarator_id
2215 (cp_parser
*, bool);
2216 static tree cp_parser_type_id
2218 static tree cp_parser_template_type_arg
2220 static tree
cp_parser_trailing_type_id (cp_parser
*);
2221 static tree cp_parser_type_id_1
2222 (cp_parser
*, bool, bool);
2223 static void cp_parser_type_specifier_seq
2224 (cp_parser
*, bool, bool, cp_decl_specifier_seq
*);
2225 static tree cp_parser_parameter_declaration_clause
2227 static tree cp_parser_parameter_declaration_list
2228 (cp_parser
*, bool *);
2229 static cp_parameter_declarator
*cp_parser_parameter_declaration
2230 (cp_parser
*, bool, bool *);
2231 static tree cp_parser_default_argument
2232 (cp_parser
*, bool);
2233 static void cp_parser_function_body
2234 (cp_parser
*, bool);
2235 static tree cp_parser_initializer
2236 (cp_parser
*, bool *, bool *);
2237 static cp_expr cp_parser_initializer_clause
2238 (cp_parser
*, bool *);
2239 static cp_expr cp_parser_braced_list
2240 (cp_parser
*, bool*);
2241 static vec
<constructor_elt
, va_gc
> *cp_parser_initializer_list
2242 (cp_parser
*, bool *);
2244 static bool cp_parser_ctor_initializer_opt_and_function_body
2245 (cp_parser
*, bool);
2247 static tree cp_parser_late_parsing_omp_declare_simd
2248 (cp_parser
*, tree
);
2250 static tree cp_parser_late_parsing_cilk_simd_fn_info
2251 (cp_parser
*, tree
);
2253 static tree cp_parser_late_parsing_oacc_routine
2254 (cp_parser
*, tree
);
2256 static tree synthesize_implicit_template_parm
2257 (cp_parser
*, tree
);
2258 static tree finish_fully_implicit_template
2259 (cp_parser
*, tree
);
2261 /* Classes [gram.class] */
2263 static tree cp_parser_class_name
2264 (cp_parser
*, bool, bool, enum tag_types
, bool, bool, bool, bool = false);
2265 static tree cp_parser_class_specifier
2267 static tree cp_parser_class_head
2268 (cp_parser
*, bool *);
2269 static enum tag_types cp_parser_class_key
2271 static void cp_parser_type_parameter_key
2272 (cp_parser
* parser
);
2273 static void cp_parser_member_specification_opt
2275 static void cp_parser_member_declaration
2277 static tree cp_parser_pure_specifier
2279 static tree cp_parser_constant_initializer
2282 /* Derived classes [gram.class.derived] */
2284 static tree cp_parser_base_clause
2286 static tree cp_parser_base_specifier
2289 /* Special member functions [gram.special] */
2291 static tree cp_parser_conversion_function_id
2293 static tree cp_parser_conversion_type_id
2295 static cp_declarator
*cp_parser_conversion_declarator_opt
2297 static bool cp_parser_ctor_initializer_opt
2299 static void cp_parser_mem_initializer_list
2301 static tree cp_parser_mem_initializer
2303 static tree cp_parser_mem_initializer_id
2306 /* Overloading [gram.over] */
2308 static cp_expr cp_parser_operator_function_id
2310 static cp_expr cp_parser_operator
2313 /* Templates [gram.temp] */
2315 static void cp_parser_template_declaration
2316 (cp_parser
*, bool);
2317 static tree cp_parser_template_parameter_list
2319 static tree cp_parser_template_parameter
2320 (cp_parser
*, bool *, bool *);
2321 static tree cp_parser_type_parameter
2322 (cp_parser
*, bool *);
2323 static tree cp_parser_template_id
2324 (cp_parser
*, bool, bool, enum tag_types
, bool);
2325 static tree cp_parser_template_name
2326 (cp_parser
*, bool, bool, bool, enum tag_types
, bool *);
2327 static tree cp_parser_template_argument_list
2329 static tree cp_parser_template_argument
2331 static void cp_parser_explicit_instantiation
2333 static void cp_parser_explicit_specialization
2336 /* Exception handling [gram.exception] */
2338 static tree cp_parser_try_block
2340 static bool cp_parser_function_try_block
2342 static void cp_parser_handler_seq
2344 static void cp_parser_handler
2346 static tree cp_parser_exception_declaration
2348 static tree cp_parser_throw_expression
2350 static tree cp_parser_exception_specification_opt
2352 static tree cp_parser_type_id_list
2355 /* GNU Extensions */
2357 static tree cp_parser_asm_specification_opt
2359 static tree cp_parser_asm_operand_list
2361 static tree cp_parser_asm_clobber_list
2363 static tree cp_parser_asm_label_list
2365 static bool cp_next_tokens_can_be_attribute_p
2367 static bool cp_next_tokens_can_be_gnu_attribute_p
2369 static bool cp_next_tokens_can_be_std_attribute_p
2371 static bool cp_nth_tokens_can_be_std_attribute_p
2372 (cp_parser
*, size_t);
2373 static bool cp_nth_tokens_can_be_gnu_attribute_p
2374 (cp_parser
*, size_t);
2375 static bool cp_nth_tokens_can_be_attribute_p
2376 (cp_parser
*, size_t);
2377 static tree cp_parser_attributes_opt
2379 static tree cp_parser_gnu_attributes_opt
2381 static tree cp_parser_gnu_attribute_list
2383 static tree cp_parser_std_attribute
2385 static tree cp_parser_std_attribute_spec
2387 static tree cp_parser_std_attribute_spec_seq
2389 static bool cp_parser_extension_opt
2390 (cp_parser
*, int *);
2391 static void cp_parser_label_declaration
2394 /* Concept Extensions */
2396 static tree cp_parser_requires_clause
2398 static tree cp_parser_requires_clause_opt
2400 static tree cp_parser_requires_expression
2402 static tree cp_parser_requirement_parameter_list
2404 static tree cp_parser_requirement_body
2406 static tree cp_parser_requirement_list
2408 static tree cp_parser_requirement
2410 static tree cp_parser_simple_requirement
2412 static tree cp_parser_compound_requirement
2414 static tree cp_parser_type_requirement
2416 static tree cp_parser_nested_requirement
2419 /* Transactional Memory Extensions */
2421 static tree cp_parser_transaction
2422 (cp_parser
*, cp_token
*);
2423 static tree cp_parser_transaction_expression
2424 (cp_parser
*, enum rid
);
2425 static bool cp_parser_function_transaction
2426 (cp_parser
*, enum rid
);
2427 static tree cp_parser_transaction_cancel
2430 enum pragma_context
{
2437 static bool cp_parser_pragma
2438 (cp_parser
*, enum pragma_context
, bool *);
2440 /* Objective-C++ Productions */
2442 static tree cp_parser_objc_message_receiver
2444 static tree cp_parser_objc_message_args
2446 static tree cp_parser_objc_message_expression
2448 static cp_expr cp_parser_objc_encode_expression
2450 static tree cp_parser_objc_defs_expression
2452 static tree cp_parser_objc_protocol_expression
2454 static tree cp_parser_objc_selector_expression
2456 static cp_expr cp_parser_objc_expression
2458 static bool cp_parser_objc_selector_p
2460 static tree cp_parser_objc_selector
2462 static tree cp_parser_objc_protocol_refs_opt
2464 static void cp_parser_objc_declaration
2465 (cp_parser
*, tree
);
2466 static tree cp_parser_objc_statement
2468 static bool cp_parser_objc_valid_prefix_attributes
2469 (cp_parser
*, tree
*);
2470 static void cp_parser_objc_at_property_declaration
2472 static void cp_parser_objc_at_synthesize_declaration
2474 static void cp_parser_objc_at_dynamic_declaration
2476 static tree cp_parser_objc_struct_declaration
2479 /* Utility Routines */
2481 static cp_expr cp_parser_lookup_name
2482 (cp_parser
*, tree
, enum tag_types
, bool, bool, bool, tree
*, location_t
);
2483 static tree cp_parser_lookup_name_simple
2484 (cp_parser
*, tree
, location_t
);
2485 static tree cp_parser_maybe_treat_template_as_class
2487 static bool cp_parser_check_declarator_template_parameters
2488 (cp_parser
*, cp_declarator
*, location_t
);
2489 static bool cp_parser_check_template_parameters
2490 (cp_parser
*, unsigned, location_t
, cp_declarator
*);
2491 static cp_expr cp_parser_simple_cast_expression
2493 static tree cp_parser_global_scope_opt
2494 (cp_parser
*, bool);
2495 static bool cp_parser_constructor_declarator_p
2496 (cp_parser
*, bool);
2497 static tree cp_parser_function_definition_from_specifiers_and_declarator
2498 (cp_parser
*, cp_decl_specifier_seq
*, tree
, const cp_declarator
*);
2499 static tree cp_parser_function_definition_after_declarator
2500 (cp_parser
*, bool);
2501 static bool cp_parser_template_declaration_after_export
2502 (cp_parser
*, bool);
2503 static void cp_parser_perform_template_parameter_access_checks
2504 (vec
<deferred_access_check
, va_gc
> *);
2505 static tree cp_parser_single_declaration
2506 (cp_parser
*, vec
<deferred_access_check
, va_gc
> *, bool, bool, bool *);
2507 static cp_expr cp_parser_functional_cast
2508 (cp_parser
*, tree
);
2509 static tree cp_parser_save_member_function_body
2510 (cp_parser
*, cp_decl_specifier_seq
*, cp_declarator
*, tree
);
2511 static tree cp_parser_save_nsdmi
2513 static tree cp_parser_enclosed_template_argument_list
2515 static void cp_parser_save_default_args
2516 (cp_parser
*, tree
);
2517 static void cp_parser_late_parsing_for_member
2518 (cp_parser
*, tree
);
2519 static tree cp_parser_late_parse_one_default_arg
2520 (cp_parser
*, tree
, tree
, tree
);
2521 static void cp_parser_late_parsing_nsdmi
2522 (cp_parser
*, tree
);
2523 static void cp_parser_late_parsing_default_args
2524 (cp_parser
*, tree
);
2525 static tree cp_parser_sizeof_operand
2526 (cp_parser
*, enum rid
);
2527 static tree cp_parser_trait_expr
2528 (cp_parser
*, enum rid
);
2529 static bool cp_parser_declares_only_class_p
2531 static void cp_parser_set_storage_class
2532 (cp_parser
*, cp_decl_specifier_seq
*, enum rid
, cp_token
*);
2533 static void cp_parser_set_decl_spec_type
2534 (cp_decl_specifier_seq
*, tree
, cp_token
*, bool);
2535 static void set_and_check_decl_spec_loc
2536 (cp_decl_specifier_seq
*decl_specs
,
2537 cp_decl_spec ds
, cp_token
*);
2538 static bool cp_parser_friend_p
2539 (const cp_decl_specifier_seq
*);
2540 static void cp_parser_required_error
2541 (cp_parser
*, required_token
, bool);
2542 static cp_token
*cp_parser_require
2543 (cp_parser
*, enum cpp_ttype
, required_token
);
2544 static cp_token
*cp_parser_require_keyword
2545 (cp_parser
*, enum rid
, required_token
);
2546 static bool cp_parser_token_starts_function_definition_p
2548 static bool cp_parser_next_token_starts_class_definition_p
2550 static bool cp_parser_next_token_ends_template_argument_p
2552 static bool cp_parser_nth_token_starts_template_argument_list_p
2553 (cp_parser
*, size_t);
2554 static enum tag_types cp_parser_token_is_class_key
2556 static enum tag_types cp_parser_token_is_type_parameter_key
2558 static void cp_parser_check_class_key
2559 (enum tag_types
, tree type
);
2560 static void cp_parser_check_access_in_redeclaration
2561 (tree type
, location_t location
);
2562 static bool cp_parser_optional_template_keyword
2564 static void cp_parser_pre_parsed_nested_name_specifier
2566 static bool cp_parser_cache_group
2567 (cp_parser
*, enum cpp_ttype
, unsigned);
2568 static tree cp_parser_cache_defarg
2569 (cp_parser
*parser
, bool nsdmi
);
2570 static void cp_parser_parse_tentatively
2572 static void cp_parser_commit_to_tentative_parse
2574 static void cp_parser_commit_to_topmost_tentative_parse
2576 static void cp_parser_abort_tentative_parse
2578 static bool cp_parser_parse_definitely
2580 static inline bool cp_parser_parsing_tentatively
2582 static bool cp_parser_uncommitted_to_tentative_parse_p
2584 static void cp_parser_error
2585 (cp_parser
*, const char *);
2586 static void cp_parser_name_lookup_error
2587 (cp_parser
*, tree
, tree
, name_lookup_error
, location_t
);
2588 static bool cp_parser_simulate_error
2590 static bool cp_parser_check_type_definition
2592 static void cp_parser_check_for_definition_in_return_type
2593 (cp_declarator
*, tree
, location_t type_location
);
2594 static void cp_parser_check_for_invalid_template_id
2595 (cp_parser
*, tree
, enum tag_types
, location_t location
);
2596 static bool cp_parser_non_integral_constant_expression
2597 (cp_parser
*, non_integral_constant
);
2598 static void cp_parser_diagnose_invalid_type_name
2599 (cp_parser
*, tree
, location_t
);
2600 static bool cp_parser_parse_and_diagnose_invalid_type_name
2602 static int cp_parser_skip_to_closing_parenthesis
2603 (cp_parser
*, bool, bool, bool);
2604 static void cp_parser_skip_to_end_of_statement
2606 static void cp_parser_consume_semicolon_at_end_of_statement
2608 static void cp_parser_skip_to_end_of_block_or_statement
2610 static bool cp_parser_skip_to_closing_brace
2612 static void cp_parser_skip_to_end_of_template_parameter_list
2614 static void cp_parser_skip_to_pragma_eol
2615 (cp_parser
*, cp_token
*);
2616 static bool cp_parser_error_occurred
2618 static bool cp_parser_allow_gnu_extensions_p
2620 static bool cp_parser_is_pure_string_literal
2622 static bool cp_parser_is_string_literal
2624 static bool cp_parser_is_keyword
2625 (cp_token
*, enum rid
);
2626 static tree cp_parser_make_typename_type
2627 (cp_parser
*, tree
, location_t location
);
2628 static cp_declarator
* cp_parser_make_indirect_declarator
2629 (enum tree_code
, tree
, cp_cv_quals
, cp_declarator
*, tree
);
2630 static bool cp_parser_compound_literal_p
2632 static bool cp_parser_array_designator_p
2634 static bool cp_parser_skip_to_closing_square_bracket
2637 /* Concept-related syntactic transformations */
2639 static tree
cp_parser_maybe_concept_name (cp_parser
*, tree
);
2640 static tree
cp_parser_maybe_partial_concept_id (cp_parser
*, tree
, tree
);
2642 // -------------------------------------------------------------------------- //
2643 // Unevaluated Operand Guard
2645 // Implementation of an RAII helper for unevaluated operand parsing.
2646 cp_unevaluated::cp_unevaluated ()
2648 ++cp_unevaluated_operand
;
2649 ++c_inhibit_evaluation_warnings
;
2652 cp_unevaluated::~cp_unevaluated ()
2654 --c_inhibit_evaluation_warnings
;
2655 --cp_unevaluated_operand
;
2658 // -------------------------------------------------------------------------- //
2659 // Tentative Parsing
2661 /* Returns nonzero if we are parsing tentatively. */
2664 cp_parser_parsing_tentatively (cp_parser
* parser
)
2666 return parser
->context
->next
!= NULL
;
2669 /* Returns nonzero if TOKEN is a string literal. */
2672 cp_parser_is_pure_string_literal (cp_token
* token
)
2674 return (token
->type
== CPP_STRING
||
2675 token
->type
== CPP_STRING16
||
2676 token
->type
== CPP_STRING32
||
2677 token
->type
== CPP_WSTRING
||
2678 token
->type
== CPP_UTF8STRING
);
2681 /* Returns nonzero if TOKEN is a string literal
2682 of a user-defined string literal. */
2685 cp_parser_is_string_literal (cp_token
* token
)
2687 return (cp_parser_is_pure_string_literal (token
) ||
2688 token
->type
== CPP_STRING_USERDEF
||
2689 token
->type
== CPP_STRING16_USERDEF
||
2690 token
->type
== CPP_STRING32_USERDEF
||
2691 token
->type
== CPP_WSTRING_USERDEF
||
2692 token
->type
== CPP_UTF8STRING_USERDEF
);
2695 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2698 cp_parser_is_keyword (cp_token
* token
, enum rid keyword
)
2700 return token
->keyword
== keyword
;
2703 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2706 static enum pragma_kind
2707 cp_parser_pragma_kind (cp_token
*token
)
2709 if (token
->type
!= CPP_PRAGMA
)
2711 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2712 return (enum pragma_kind
) TREE_INT_CST_LOW (token
->u
.value
);
2715 /* Helper function for cp_parser_error.
2716 Having peeked a token of kind TOK1_KIND that might signify
2717 a conflict marker, peek successor tokens to determine
2718 if we actually do have a conflict marker.
2719 Specifically, we consider a run of 7 '<', '=' or '>' characters
2720 at the start of a line as a conflict marker.
2721 These come through the lexer as three pairs and a single,
2722 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2723 If it returns true, *OUT_LOC is written to with the location/range
2727 cp_lexer_peek_conflict_marker (cp_lexer
*lexer
, enum cpp_ttype tok1_kind
,
2728 location_t
*out_loc
)
2730 cp_token
*token2
= cp_lexer_peek_nth_token (lexer
, 2);
2731 if (token2
->type
!= tok1_kind
)
2733 cp_token
*token3
= cp_lexer_peek_nth_token (lexer
, 3);
2734 if (token3
->type
!= tok1_kind
)
2736 cp_token
*token4
= cp_lexer_peek_nth_token (lexer
, 4);
2737 if (token4
->type
!= conflict_marker_get_final_tok_kind (tok1_kind
))
2740 /* It must be at the start of the line. */
2741 location_t start_loc
= cp_lexer_peek_token (lexer
)->location
;
2742 if (LOCATION_COLUMN (start_loc
) != 1)
2745 /* We have a conflict marker. Construct a location of the form:
2748 with start == caret, finishing at the end of the marker. */
2749 location_t finish_loc
= get_finish (token4
->location
);
2750 *out_loc
= make_location (start_loc
, start_loc
, finish_loc
);
2755 /* If not parsing tentatively, issue a diagnostic of the form
2756 FILE:LINE: MESSAGE before TOKEN
2757 where TOKEN is the next token in the input stream. MESSAGE
2758 (specified by the caller) is usually of the form "expected
2762 cp_parser_error (cp_parser
* parser
, const char* gmsgid
)
2764 if (!cp_parser_simulate_error (parser
))
2766 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2767 /* This diagnostic makes more sense if it is tagged to the line
2768 of the token we just peeked at. */
2769 cp_lexer_set_source_position_from_token (token
);
2771 if (token
->type
== CPP_PRAGMA
)
2773 error_at (token
->location
,
2774 "%<#pragma%> is not allowed here");
2775 cp_parser_skip_to_pragma_eol (parser
, token
);
2779 /* If this is actually a conflict marker, report it as such. */
2780 if (token
->type
== CPP_LSHIFT
2781 || token
->type
== CPP_RSHIFT
2782 || token
->type
== CPP_EQ_EQ
)
2785 if (cp_lexer_peek_conflict_marker (parser
->lexer
, token
->type
, &loc
))
2787 error_at (loc
, "version control conflict marker in file");
2792 c_parse_error (gmsgid
,
2793 /* Because c_parser_error does not understand
2794 CPP_KEYWORD, keywords are treated like
2796 (token
->type
== CPP_KEYWORD
? CPP_NAME
: token
->type
),
2797 token
->u
.value
, token
->flags
);
2801 /* Issue an error about name-lookup failing. NAME is the
2802 IDENTIFIER_NODE DECL is the result of
2803 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2804 the thing that we hoped to find. */
2807 cp_parser_name_lookup_error (cp_parser
* parser
,
2810 name_lookup_error desired
,
2811 location_t location
)
2813 /* If name lookup completely failed, tell the user that NAME was not
2815 if (decl
== error_mark_node
)
2817 if (parser
->scope
&& parser
->scope
!= global_namespace
)
2818 error_at (location
, "%<%E::%E%> has not been declared",
2819 parser
->scope
, name
);
2820 else if (parser
->scope
== global_namespace
)
2821 error_at (location
, "%<::%E%> has not been declared", name
);
2822 else if (parser
->object_scope
2823 && !CLASS_TYPE_P (parser
->object_scope
))
2824 error_at (location
, "request for member %qE in non-class type %qT",
2825 name
, parser
->object_scope
);
2826 else if (parser
->object_scope
)
2827 error_at (location
, "%<%T::%E%> has not been declared",
2828 parser
->object_scope
, name
);
2830 error_at (location
, "%qE has not been declared", name
);
2832 else if (parser
->scope
&& parser
->scope
!= global_namespace
)
2837 error_at (location
, "%<%E::%E%> is not a type",
2838 parser
->scope
, name
);
2841 error_at (location
, "%<%E::%E%> is not a class or namespace",
2842 parser
->scope
, name
);
2846 "%<%E::%E%> is not a class, namespace, or enumeration",
2847 parser
->scope
, name
);
2854 else if (parser
->scope
== global_namespace
)
2859 error_at (location
, "%<::%E%> is not a type", name
);
2862 error_at (location
, "%<::%E%> is not a class or namespace", name
);
2866 "%<::%E%> is not a class, namespace, or enumeration",
2878 error_at (location
, "%qE is not a type", name
);
2881 error_at (location
, "%qE is not a class or namespace", name
);
2885 "%qE is not a class, namespace, or enumeration", name
);
2893 /* If we are parsing tentatively, remember that an error has occurred
2894 during this tentative parse. Returns true if the error was
2895 simulated; false if a message should be issued by the caller. */
2898 cp_parser_simulate_error (cp_parser
* parser
)
2900 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2902 parser
->context
->status
= CP_PARSER_STATUS_KIND_ERROR
;
2908 /* This function is called when a type is defined. If type
2909 definitions are forbidden at this point, an error message is
2913 cp_parser_check_type_definition (cp_parser
* parser
)
2915 /* If types are forbidden here, issue a message. */
2916 if (parser
->type_definition_forbidden_message
)
2918 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2919 in the message need to be interpreted. */
2920 error (parser
->type_definition_forbidden_message
);
2926 /* This function is called when the DECLARATOR is processed. The TYPE
2927 was a type defined in the decl-specifiers. If it is invalid to
2928 define a type in the decl-specifiers for DECLARATOR, an error is
2929 issued. TYPE_LOCATION is the location of TYPE and is used
2930 for error reporting. */
2933 cp_parser_check_for_definition_in_return_type (cp_declarator
*declarator
,
2934 tree type
, location_t type_location
)
2936 /* [dcl.fct] forbids type definitions in return types.
2937 Unfortunately, it's not easy to know whether or not we are
2938 processing a return type until after the fact. */
2940 && (declarator
->kind
== cdk_pointer
2941 || declarator
->kind
== cdk_reference
2942 || declarator
->kind
== cdk_ptrmem
))
2943 declarator
= declarator
->declarator
;
2945 && declarator
->kind
== cdk_function
)
2947 error_at (type_location
,
2948 "new types may not be defined in a return type");
2949 inform (type_location
,
2950 "(perhaps a semicolon is missing after the definition of %qT)",
2955 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2956 "<" in any valid C++ program. If the next token is indeed "<",
2957 issue a message warning the user about what appears to be an
2958 invalid attempt to form a template-id. LOCATION is the location
2959 of the type-specifier (TYPE) */
2962 cp_parser_check_for_invalid_template_id (cp_parser
* parser
,
2964 enum tag_types tag_type
,
2965 location_t location
)
2967 cp_token_position start
= 0;
2969 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2972 error_at (location
, "%qT is not a template", type
);
2973 else if (identifier_p (type
))
2975 if (tag_type
!= none_type
)
2976 error_at (location
, "%qE is not a class template", type
);
2978 error_at (location
, "%qE is not a template", type
);
2981 error_at (location
, "invalid template-id");
2982 /* Remember the location of the invalid "<". */
2983 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2984 start
= cp_lexer_token_position (parser
->lexer
, true);
2985 /* Consume the "<". */
2986 cp_lexer_consume_token (parser
->lexer
);
2987 /* Parse the template arguments. */
2988 cp_parser_enclosed_template_argument_list (parser
);
2989 /* Permanently remove the invalid template arguments so that
2990 this error message is not issued again. */
2992 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
2996 /* If parsing an integral constant-expression, issue an error message
2997 about the fact that THING appeared and return true. Otherwise,
2998 return false. In either case, set
2999 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3002 cp_parser_non_integral_constant_expression (cp_parser
*parser
,
3003 non_integral_constant thing
)
3005 parser
->non_integral_constant_expression_p
= true;
3006 if (parser
->integral_constant_expression_p
)
3008 if (!parser
->allow_non_integral_constant_expression_p
)
3010 const char *msg
= NULL
;
3014 error ("floating-point literal "
3015 "cannot appear in a constant-expression");
3018 error ("a cast to a type other than an integral or "
3019 "enumeration type cannot appear in a "
3020 "constant-expression");
3023 error ("%<typeid%> operator "
3024 "cannot appear in a constant-expression");
3027 error ("non-constant compound literals "
3028 "cannot appear in a constant-expression");
3031 error ("a function call "
3032 "cannot appear in a constant-expression");
3035 error ("an increment "
3036 "cannot appear in a constant-expression");
3039 error ("an decrement "
3040 "cannot appear in a constant-expression");
3043 error ("an array reference "
3044 "cannot appear in a constant-expression");
3046 case NIC_ADDR_LABEL
:
3047 error ("the address of a label "
3048 "cannot appear in a constant-expression");
3050 case NIC_OVERLOADED
:
3051 error ("calls to overloaded operators "
3052 "cannot appear in a constant-expression");
3054 case NIC_ASSIGNMENT
:
3055 error ("an assignment cannot appear in a constant-expression");
3058 error ("a comma operator "
3059 "cannot appear in a constant-expression");
3061 case NIC_CONSTRUCTOR
:
3062 error ("a call to a constructor "
3063 "cannot appear in a constant-expression");
3065 case NIC_TRANSACTION
:
3066 error ("a transaction expression "
3067 "cannot appear in a constant-expression");
3073 msg
= "__FUNCTION__";
3075 case NIC_PRETTY_FUNC
:
3076 msg
= "__PRETTY_FUNCTION__";
3096 case NIC_PREINCREMENT
:
3099 case NIC_PREDECREMENT
:
3112 error ("%qs cannot appear in a constant-expression", msg
);
3119 /* Emit a diagnostic for an invalid type name. This function commits
3120 to the current active tentative parse, if any. (Otherwise, the
3121 problematic construct might be encountered again later, resulting
3122 in duplicate error messages.) LOCATION is the location of ID. */
3125 cp_parser_diagnose_invalid_type_name (cp_parser
*parser
, tree id
,
3126 location_t location
)
3128 tree decl
, ambiguous_decls
;
3129 cp_parser_commit_to_tentative_parse (parser
);
3130 /* Try to lookup the identifier. */
3131 decl
= cp_parser_lookup_name (parser
, id
, none_type
,
3132 /*is_template=*/false,
3133 /*is_namespace=*/false,
3134 /*check_dependency=*/true,
3135 &ambiguous_decls
, location
);
3136 if (ambiguous_decls
)
3137 /* If the lookup was ambiguous, an error will already have
3140 /* If the lookup found a template-name, it means that the user forgot
3141 to specify an argument list. Emit a useful error message. */
3142 if (DECL_TYPE_TEMPLATE_P (decl
))
3145 "invalid use of template-name %qE without an argument list",
3147 inform (DECL_SOURCE_LOCATION (decl
), "%qD declared here", decl
);
3149 else if (TREE_CODE (id
) == BIT_NOT_EXPR
)
3150 error_at (location
, "invalid use of destructor %qD as a type", id
);
3151 else if (TREE_CODE (decl
) == TYPE_DECL
)
3152 /* Something like 'unsigned A a;' */
3153 error_at (location
, "invalid combination of multiple type-specifiers");
3154 else if (!parser
->scope
)
3156 /* Issue an error message. */
3157 error_at (location
, "%qE does not name a type", id
);
3158 /* If we're in a template class, it's possible that the user was
3159 referring to a type from a base class. For example:
3161 template <typename T> struct A { typedef T X; };
3162 template <typename T> struct B : public A<T> { X x; };
3164 The user should have said "typename A<T>::X". */
3165 if (cxx_dialect
< cxx11
&& id
== ridpointers
[(int)RID_CONSTEXPR
])
3166 inform (location
, "C++11 %<constexpr%> only available with "
3167 "-std=c++11 or -std=gnu++11");
3168 else if (cxx_dialect
< cxx11
&& id
== ridpointers
[(int)RID_NOEXCEPT
])
3169 inform (location
, "C++11 %<noexcept%> only available with "
3170 "-std=c++11 or -std=gnu++11");
3171 else if (cxx_dialect
< cxx11
3172 && TREE_CODE (id
) == IDENTIFIER_NODE
3173 && !strcmp (IDENTIFIER_POINTER (id
), "thread_local"))
3174 inform (location
, "C++11 %<thread_local%> only available with "
3175 "-std=c++11 or -std=gnu++11");
3176 else if (!flag_concepts
&& id
== ridpointers
[(int)RID_CONCEPT
])
3177 inform (location
, "%<concept%> only available with -fconcepts");
3178 else if (processing_template_decl
&& current_class_type
3179 && TYPE_BINFO (current_class_type
))
3183 for (b
= TREE_CHAIN (TYPE_BINFO (current_class_type
));
3187 tree base_type
= BINFO_TYPE (b
);
3188 if (CLASS_TYPE_P (base_type
)
3189 && dependent_type_p (base_type
))
3192 /* Go from a particular instantiation of the
3193 template (which will have an empty TYPE_FIELDs),
3194 to the main version. */
3195 base_type
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type
);
3196 for (field
= TYPE_FIELDS (base_type
);
3198 field
= DECL_CHAIN (field
))
3199 if (TREE_CODE (field
) == TYPE_DECL
3200 && DECL_NAME (field
) == id
)
3203 "(perhaps %<typename %T::%E%> was intended)",
3204 BINFO_TYPE (b
), id
);
3213 /* Here we diagnose qualified-ids where the scope is actually correct,
3214 but the identifier does not resolve to a valid type name. */
3215 else if (parser
->scope
!= error_mark_node
)
3217 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
3219 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
3220 error_at (location_of (id
),
3221 "%qE in namespace %qE does not name a template type",
3224 error_at (location_of (id
),
3225 "%qE in namespace %qE does not name a type",
3228 inform (DECL_SOURCE_LOCATION (decl
), "%qD declared here", decl
);
3230 else if (CLASS_TYPE_P (parser
->scope
)
3231 && constructor_name_p (id
, parser
->scope
))
3234 error_at (location
, "%<%T::%E%> names the constructor, not"
3235 " the type", parser
->scope
, id
);
3236 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
3237 error_at (location
, "and %qT has no template constructors",
3240 else if (TYPE_P (parser
->scope
)
3241 && dependent_scope_p (parser
->scope
))
3242 error_at (location
, "need %<typename%> before %<%T::%E%> because "
3243 "%qT is a dependent scope",
3244 parser
->scope
, id
, parser
->scope
);
3245 else if (TYPE_P (parser
->scope
))
3247 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
3248 error_at (location_of (id
),
3249 "%qE in %q#T does not name a template type",
3252 error_at (location_of (id
),
3253 "%qE in %q#T does not name a type",
3256 inform (DECL_SOURCE_LOCATION (decl
), "%qD declared here", decl
);
3263 /* Check for a common situation where a type-name should be present,
3264 but is not, and issue a sensible error message. Returns true if an
3265 invalid type-name was detected.
3267 The situation handled by this function are variable declarations of the
3268 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3269 Usually, `ID' should name a type, but if we got here it means that it
3270 does not. We try to emit the best possible error message depending on
3271 how exactly the id-expression looks like. */
3274 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser
*parser
)
3277 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3279 /* Avoid duplicate error about ambiguous lookup. */
3280 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
3282 cp_token
*next
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
3283 if (next
->type
== CPP_NAME
&& next
->error_reported
)
3287 cp_parser_parse_tentatively (parser
);
3288 id
= cp_parser_id_expression (parser
,
3289 /*template_keyword_p=*/false,
3290 /*check_dependency_p=*/true,
3291 /*template_p=*/NULL
,
3292 /*declarator_p=*/true,
3293 /*optional_p=*/false);
3294 /* If the next token is a (, this is a function with no explicit return
3295 type, i.e. constructor, destructor or conversion op. */
3296 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
3297 || TREE_CODE (id
) == TYPE_DECL
)
3299 cp_parser_abort_tentative_parse (parser
);
3302 if (!cp_parser_parse_definitely (parser
))
3305 /* Emit a diagnostic for the invalid type. */
3306 cp_parser_diagnose_invalid_type_name (parser
, id
, token
->location
);
3308 /* If we aren't in the middle of a declarator (i.e. in a
3309 parameter-declaration-clause), skip to the end of the declaration;
3310 there's no point in trying to process it. */
3311 if (!parser
->in_declarator_p
)
3312 cp_parser_skip_to_end_of_block_or_statement (parser
);
3316 /* Consume tokens up to, and including, the next non-nested closing `)'.
3317 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3318 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3319 found an unnested token of that type. */
3322 cp_parser_skip_to_closing_parenthesis_1 (cp_parser
*parser
,
3327 unsigned paren_depth
= 0;
3328 unsigned brace_depth
= 0;
3329 unsigned square_depth
= 0;
3331 if (recovering
&& or_ttype
== CPP_EOF
3332 && cp_parser_uncommitted_to_tentative_parse_p (parser
))
3337 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
3339 /* Have we found what we're looking for before the closing paren? */
3340 if (token
->type
== or_ttype
&& or_ttype
!= CPP_EOF
3341 && !brace_depth
&& !paren_depth
&& !square_depth
)
3344 switch (token
->type
)
3347 case CPP_PRAGMA_EOL
:
3348 /* If we've run out of tokens, then there is no closing `)'. */
3351 /* This is good for lambda expression capture-lists. */
3352 case CPP_OPEN_SQUARE
:
3355 case CPP_CLOSE_SQUARE
:
3356 if (!square_depth
--)
3361 /* This matches the processing in skip_to_end_of_statement. */
3366 case CPP_OPEN_BRACE
:
3369 case CPP_CLOSE_BRACE
:
3374 case CPP_OPEN_PAREN
:
3379 case CPP_CLOSE_PAREN
:
3380 if (!brace_depth
&& !paren_depth
--)
3383 cp_lexer_consume_token (parser
->lexer
);
3392 /* Consume the token. */
3393 cp_lexer_consume_token (parser
->lexer
);
3397 /* Consume tokens up to, and including, the next non-nested closing `)'.
3398 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3399 are doing error recovery. Returns -1 if OR_COMMA is true and we
3400 found an unnested token of that type. */
3403 cp_parser_skip_to_closing_parenthesis (cp_parser
*parser
,
3408 cpp_ttype ttype
= or_comma
? CPP_COMMA
: CPP_EOF
;
3409 return cp_parser_skip_to_closing_parenthesis_1 (parser
, recovering
,
3410 ttype
, consume_paren
);
3413 /* Consume tokens until we reach the end of the current statement.
3414 Normally, that will be just before consuming a `;'. However, if a
3415 non-nested `}' comes first, then we stop before consuming that. */
3418 cp_parser_skip_to_end_of_statement (cp_parser
* parser
)
3420 unsigned nesting_depth
= 0;
3422 /* Unwind generic function template scope if necessary. */
3423 if (parser
->fully_implicit_function_template_p
)
3424 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
3428 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3430 switch (token
->type
)
3433 case CPP_PRAGMA_EOL
:
3434 /* If we've run out of tokens, stop. */
3438 /* If the next token is a `;', we have reached the end of the
3444 case CPP_CLOSE_BRACE
:
3445 /* If this is a non-nested '}', stop before consuming it.
3446 That way, when confronted with something like:
3450 we stop before consuming the closing '}', even though we
3451 have not yet reached a `;'. */
3452 if (nesting_depth
== 0)
3455 /* If it is the closing '}' for a block that we have
3456 scanned, stop -- but only after consuming the token.
3462 we will stop after the body of the erroneously declared
3463 function, but before consuming the following `typedef'
3465 if (--nesting_depth
== 0)
3467 cp_lexer_consume_token (parser
->lexer
);
3471 case CPP_OPEN_BRACE
:
3479 /* Consume the token. */
3480 cp_lexer_consume_token (parser
->lexer
);
3484 /* This function is called at the end of a statement or declaration.
3485 If the next token is a semicolon, it is consumed; otherwise, error
3486 recovery is attempted. */
3489 cp_parser_consume_semicolon_at_end_of_statement (cp_parser
*parser
)
3491 /* Look for the trailing `;'. */
3492 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
3494 /* If there is additional (erroneous) input, skip to the end of
3496 cp_parser_skip_to_end_of_statement (parser
);
3497 /* If the next token is now a `;', consume it. */
3498 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
3499 cp_lexer_consume_token (parser
->lexer
);
3503 /* Skip tokens until we have consumed an entire block, or until we
3504 have consumed a non-nested `;'. */
3507 cp_parser_skip_to_end_of_block_or_statement (cp_parser
* parser
)
3509 int nesting_depth
= 0;
3511 /* Unwind generic function template scope if necessary. */
3512 if (parser
->fully_implicit_function_template_p
)
3513 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
3515 while (nesting_depth
>= 0)
3517 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3519 switch (token
->type
)
3522 case CPP_PRAGMA_EOL
:
3523 /* If we've run out of tokens, stop. */
3527 /* Stop if this is an unnested ';'. */
3532 case CPP_CLOSE_BRACE
:
3533 /* Stop if this is an unnested '}', or closes the outermost
3536 if (nesting_depth
< 0)
3542 case CPP_OPEN_BRACE
:
3551 /* Consume the token. */
3552 cp_lexer_consume_token (parser
->lexer
);
3556 /* Skip tokens until a non-nested closing curly brace is the next
3557 token, or there are no more tokens. Return true in the first case,
3561 cp_parser_skip_to_closing_brace (cp_parser
*parser
)
3563 unsigned nesting_depth
= 0;
3567 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3569 switch (token
->type
)
3572 case CPP_PRAGMA_EOL
:
3573 /* If we've run out of tokens, stop. */
3576 case CPP_CLOSE_BRACE
:
3577 /* If the next token is a non-nested `}', then we have reached
3578 the end of the current block. */
3579 if (nesting_depth
-- == 0)
3583 case CPP_OPEN_BRACE
:
3584 /* If it the next token is a `{', then we are entering a new
3585 block. Consume the entire block. */
3593 /* Consume the token. */
3594 cp_lexer_consume_token (parser
->lexer
);
3598 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3599 parameter is the PRAGMA token, allowing us to purge the entire pragma
3603 cp_parser_skip_to_pragma_eol (cp_parser
* parser
, cp_token
*pragma_tok
)
3607 parser
->lexer
->in_pragma
= false;
3610 token
= cp_lexer_consume_token (parser
->lexer
);
3611 while (token
->type
!= CPP_PRAGMA_EOL
&& token
->type
!= CPP_EOF
);
3613 /* Ensure that the pragma is not parsed again. */
3614 cp_lexer_purge_tokens_after (parser
->lexer
, pragma_tok
);
3617 /* Require pragma end of line, resyncing with it as necessary. The
3618 arguments are as for cp_parser_skip_to_pragma_eol. */
3621 cp_parser_require_pragma_eol (cp_parser
*parser
, cp_token
*pragma_tok
)
3623 parser
->lexer
->in_pragma
= false;
3624 if (!cp_parser_require (parser
, CPP_PRAGMA_EOL
, RT_PRAGMA_EOL
))
3625 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
3628 /* This is a simple wrapper around make_typename_type. When the id is
3629 an unresolved identifier node, we can provide a superior diagnostic
3630 using cp_parser_diagnose_invalid_type_name. */
3633 cp_parser_make_typename_type (cp_parser
*parser
, tree id
,
3634 location_t id_location
)
3637 if (identifier_p (id
))
3639 result
= make_typename_type (parser
->scope
, id
, typename_type
,
3640 /*complain=*/tf_none
);
3641 if (result
== error_mark_node
)
3642 cp_parser_diagnose_invalid_type_name (parser
, id
, id_location
);
3645 return make_typename_type (parser
->scope
, id
, typename_type
, tf_error
);
3648 /* This is a wrapper around the
3649 make_{pointer,ptrmem,reference}_declarator functions that decides
3650 which one to call based on the CODE and CLASS_TYPE arguments. The
3651 CODE argument should be one of the values returned by
3652 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3653 appertain to the pointer or reference. */
3655 static cp_declarator
*
3656 cp_parser_make_indirect_declarator (enum tree_code code
, tree class_type
,
3657 cp_cv_quals cv_qualifiers
,
3658 cp_declarator
*target
,
3661 if (code
== ERROR_MARK
)
3662 return cp_error_declarator
;
3664 if (code
== INDIRECT_REF
)
3665 if (class_type
== NULL_TREE
)
3666 return make_pointer_declarator (cv_qualifiers
, target
, attributes
);
3668 return make_ptrmem_declarator (cv_qualifiers
, class_type
,
3669 target
, attributes
);
3670 else if (code
== ADDR_EXPR
&& class_type
== NULL_TREE
)
3671 return make_reference_declarator (cv_qualifiers
, target
,
3673 else if (code
== NON_LVALUE_EXPR
&& class_type
== NULL_TREE
)
3674 return make_reference_declarator (cv_qualifiers
, target
,
3679 /* Create a new C++ parser. */
3682 cp_parser_new (void)
3688 /* cp_lexer_new_main is called before doing GC allocation because
3689 cp_lexer_new_main might load a PCH file. */
3690 lexer
= cp_lexer_new_main ();
3692 /* Initialize the binops_by_token so that we can get the tree
3693 directly from the token. */
3694 for (i
= 0; i
< sizeof (binops
) / sizeof (binops
[0]); i
++)
3695 binops_by_token
[binops
[i
].token_type
] = binops
[i
];
3697 parser
= ggc_cleared_alloc
<cp_parser
> ();
3698 parser
->lexer
= lexer
;
3699 parser
->context
= cp_parser_context_new (NULL
);
3701 /* For now, we always accept GNU extensions. */
3702 parser
->allow_gnu_extensions_p
= 1;
3704 /* The `>' token is a greater-than operator, not the end of a
3706 parser
->greater_than_is_operator_p
= true;
3708 parser
->default_arg_ok_p
= true;
3710 /* We are not parsing a constant-expression. */
3711 parser
->integral_constant_expression_p
= false;
3712 parser
->allow_non_integral_constant_expression_p
= false;
3713 parser
->non_integral_constant_expression_p
= false;
3715 /* Local variable names are not forbidden. */
3716 parser
->local_variables_forbidden_p
= false;
3718 /* We are not processing an `extern "C"' declaration. */
3719 parser
->in_unbraced_linkage_specification_p
= false;
3721 /* We are not processing a declarator. */
3722 parser
->in_declarator_p
= false;
3724 /* We are not processing a template-argument-list. */
3725 parser
->in_template_argument_list_p
= false;
3727 /* We are not in an iteration statement. */
3728 parser
->in_statement
= 0;
3730 /* We are not in a switch statement. */
3731 parser
->in_switch_statement_p
= false;
3733 /* We are not parsing a type-id inside an expression. */
3734 parser
->in_type_id_in_expr_p
= false;
3736 /* Declarations aren't implicitly extern "C". */
3737 parser
->implicit_extern_c
= false;
3739 /* String literals should be translated to the execution character set. */
3740 parser
->translate_strings_p
= true;
3742 /* We are not parsing a function body. */
3743 parser
->in_function_body
= false;
3745 /* We can correct until told otherwise. */
3746 parser
->colon_corrects_to_scope_p
= true;
3748 /* The unparsed function queue is empty. */
3749 push_unparsed_function_queues (parser
);
3751 /* There are no classes being defined. */
3752 parser
->num_classes_being_defined
= 0;
3754 /* No template parameters apply. */
3755 parser
->num_template_parameter_lists
= 0;
3757 /* Not declaring an implicit function template. */
3758 parser
->auto_is_implicit_function_template_parm_p
= false;
3759 parser
->fully_implicit_function_template_p
= false;
3760 parser
->implicit_template_parms
= 0;
3761 parser
->implicit_template_scope
= 0;
3763 /* Active OpenACC routine clauses. */
3764 parser
->oacc_routine
= NULL
;
3766 /* Allow constrained-type-specifiers. */
3767 parser
->prevent_constrained_type_specifiers
= 0;
3772 /* Create a cp_lexer structure which will emit the tokens in CACHE
3773 and push it onto the parser's lexer stack. This is used for delayed
3774 parsing of in-class method bodies and default arguments, and should
3775 not be confused with tentative parsing. */
3777 cp_parser_push_lexer_for_tokens (cp_parser
*parser
, cp_token_cache
*cache
)
3779 cp_lexer
*lexer
= cp_lexer_new_from_tokens (cache
);
3780 lexer
->next
= parser
->lexer
;
3781 parser
->lexer
= lexer
;
3783 /* Move the current source position to that of the first token in the
3785 cp_lexer_set_source_position_from_token (lexer
->next_token
);
3788 /* Pop the top lexer off the parser stack. This is never used for the
3789 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3791 cp_parser_pop_lexer (cp_parser
*parser
)
3793 cp_lexer
*lexer
= parser
->lexer
;
3794 parser
->lexer
= lexer
->next
;
3795 cp_lexer_destroy (lexer
);
3797 /* Put the current source position back where it was before this
3798 lexer was pushed. */
3799 cp_lexer_set_source_position_from_token (parser
->lexer
->next_token
);
3802 /* Lexical conventions [gram.lex] */
3804 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3808 cp_parser_identifier (cp_parser
* parser
)
3812 /* Look for the identifier. */
3813 token
= cp_parser_require (parser
, CPP_NAME
, RT_NAME
);
3814 /* Return the value. */
3816 return cp_expr (token
->u
.value
, token
->location
);
3818 return error_mark_node
;
3821 /* Parse a sequence of adjacent string constants. Returns a
3822 TREE_STRING representing the combined, nul-terminated string
3823 constant. If TRANSLATE is true, translate the string to the
3824 execution character set. If WIDE_OK is true, a wide string is
3827 C++98 [lex.string] says that if a narrow string literal token is
3828 adjacent to a wide string literal token, the behavior is undefined.
3829 However, C99 6.4.5p4 says that this results in a wide string literal.
3830 We follow C99 here, for consistency with the C front end.
3832 This code is largely lifted from lex_string() in c-lex.c.
3834 FUTURE: ObjC++ will need to handle @-strings here. */
3836 cp_parser_string_literal (cp_parser
*parser
, bool translate
, bool wide_ok
,
3837 bool lookup_udlit
= true)
3841 struct obstack str_ob
;
3842 cpp_string str
, istr
, *strs
;
3844 enum cpp_ttype type
, curr_type
;
3845 int have_suffix_p
= 0;
3847 tree suffix_id
= NULL_TREE
;
3848 bool curr_tok_is_userdef_p
= false;
3850 tok
= cp_lexer_peek_token (parser
->lexer
);
3851 if (!cp_parser_is_string_literal (tok
))
3853 cp_parser_error (parser
, "expected string-literal");
3854 return error_mark_node
;
3857 location_t loc
= tok
->location
;
3859 if (cpp_userdef_string_p (tok
->type
))
3861 string_tree
= USERDEF_LITERAL_VALUE (tok
->u
.value
);
3862 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3863 curr_tok_is_userdef_p
= true;
3867 string_tree
= tok
->u
.value
;
3868 curr_type
= tok
->type
;
3872 /* Try to avoid the overhead of creating and destroying an obstack
3873 for the common case of just one string. */
3874 if (!cp_parser_is_string_literal
3875 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
3877 cp_lexer_consume_token (parser
->lexer
);
3879 str
.text
= (const unsigned char *)TREE_STRING_POINTER (string_tree
);
3880 str
.len
= TREE_STRING_LENGTH (string_tree
);
3883 if (curr_tok_is_userdef_p
)
3885 suffix_id
= USERDEF_LITERAL_SUFFIX_ID (tok
->u
.value
);
3887 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3890 curr_type
= tok
->type
;
3896 location_t last_tok_loc
;
3897 gcc_obstack_init (&str_ob
);
3902 last_tok_loc
= tok
->location
;
3903 cp_lexer_consume_token (parser
->lexer
);
3905 str
.text
= (const unsigned char *)TREE_STRING_POINTER (string_tree
);
3906 str
.len
= TREE_STRING_LENGTH (string_tree
);
3908 if (curr_tok_is_userdef_p
)
3910 tree curr_suffix_id
= USERDEF_LITERAL_SUFFIX_ID (tok
->u
.value
);
3911 if (have_suffix_p
== 0)
3913 suffix_id
= curr_suffix_id
;
3916 else if (have_suffix_p
== 1
3917 && curr_suffix_id
!= suffix_id
)
3919 error ("inconsistent user-defined literal suffixes"
3920 " %qD and %qD in string literal",
3921 suffix_id
, curr_suffix_id
);
3924 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3927 curr_type
= tok
->type
;
3929 if (type
!= curr_type
)
3931 if (type
== CPP_STRING
)
3933 else if (curr_type
!= CPP_STRING
)
3934 error_at (tok
->location
,
3935 "unsupported non-standard concatenation "
3936 "of string literals");
3939 obstack_grow (&str_ob
, &str
, sizeof (cpp_string
));
3941 tok
= cp_lexer_peek_token (parser
->lexer
);
3942 if (cpp_userdef_string_p (tok
->type
))
3944 string_tree
= USERDEF_LITERAL_VALUE (tok
->u
.value
);
3945 curr_type
= cpp_userdef_string_remove_type (tok
->type
);
3946 curr_tok_is_userdef_p
= true;
3950 string_tree
= tok
->u
.value
;
3951 curr_type
= tok
->type
;
3952 curr_tok_is_userdef_p
= false;
3955 while (cp_parser_is_string_literal (tok
));
3957 /* A string literal built by concatenation has its caret=start at
3958 the start of the initial string, and its finish at the finish of
3959 the final string literal. */
3960 loc
= make_location (loc
, loc
, get_finish (last_tok_loc
));
3962 strs
= (cpp_string
*) obstack_finish (&str_ob
);
3965 if (type
!= CPP_STRING
&& !wide_ok
)
3967 cp_parser_error (parser
, "a wide string is invalid in this context");
3971 if ((translate
? cpp_interpret_string
: cpp_interpret_string_notranslate
)
3972 (parse_in
, strs
, count
, &istr
, type
))
3974 value
= build_string (istr
.len
, (const char *)istr
.text
);
3975 free (CONST_CAST (unsigned char *, istr
.text
));
3981 case CPP_UTF8STRING
:
3982 TREE_TYPE (value
) = char_array_type_node
;
3985 TREE_TYPE (value
) = char16_array_type_node
;
3988 TREE_TYPE (value
) = char32_array_type_node
;
3991 TREE_TYPE (value
) = wchar_array_type_node
;
3995 value
= fix_string_type (value
);
3999 tree literal
= build_userdef_literal (suffix_id
, value
,
4000 OT_NONE
, NULL_TREE
);
4002 value
= cp_parser_userdef_string_literal (literal
);
4008 /* cpp_interpret_string has issued an error. */
4009 value
= error_mark_node
;
4012 obstack_free (&str_ob
, 0);
4014 return cp_expr (value
, loc
);
4017 /* Look up a literal operator with the name and the exact arguments. */
4020 lookup_literal_operator (tree name
, vec
<tree
, va_gc
> *args
)
4023 decl
= lookup_name (name
);
4024 if (!decl
|| !is_overloaded_fn (decl
))
4025 return error_mark_node
;
4027 for (fns
= decl
; fns
; fns
= OVL_NEXT (fns
))
4031 tree fn
= OVL_CURRENT (fns
);
4032 tree parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
4033 if (parmtypes
!= NULL_TREE
)
4035 for (ix
= 0; ix
< vec_safe_length (args
) && parmtypes
!= NULL_TREE
;
4036 ++ix
, parmtypes
= TREE_CHAIN (parmtypes
))
4038 tree tparm
= TREE_VALUE (parmtypes
);
4039 tree targ
= TREE_TYPE ((*args
)[ix
]);
4040 bool ptr
= TYPE_PTR_P (tparm
);
4041 bool arr
= TREE_CODE (targ
) == ARRAY_TYPE
;
4042 if ((ptr
|| arr
|| !same_type_p (tparm
, targ
))
4044 || !same_type_p (TREE_TYPE (tparm
),
4049 && ix
== vec_safe_length (args
)
4050 /* May be this should be sufficient_parms_p instead,
4051 depending on how exactly should user-defined literals
4052 work in presence of default arguments on the literal
4053 operator parameters. */
4054 && parmtypes
== void_list_node
)
4059 return error_mark_node
;
4062 /* Parse a user-defined char constant. Returns a call to a user-defined
4063 literal operator taking the character as an argument. */
4066 cp_parser_userdef_char_literal (cp_parser
*parser
)
4068 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
4069 tree literal
= token
->u
.value
;
4070 tree suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
4071 tree value
= USERDEF_LITERAL_VALUE (literal
);
4072 tree name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
4075 /* Build up a call to the user-defined operator */
4076 /* Lookup the name we got back from the id-expression. */
4077 vec
<tree
, va_gc
> *args
= make_tree_vector ();
4078 vec_safe_push (args
, value
);
4079 decl
= lookup_literal_operator (name
, args
);
4080 if (!decl
|| decl
== error_mark_node
)
4082 error ("unable to find character literal operator %qD with %qT argument",
4083 name
, TREE_TYPE (value
));
4084 release_tree_vector (args
);
4085 return error_mark_node
;
4087 result
= finish_call_expr (decl
, &args
, false, true, tf_warning_or_error
);
4088 release_tree_vector (args
);
4092 /* A subroutine of cp_parser_userdef_numeric_literal to
4093 create a char... template parameter pack from a string node. */
4096 make_char_string_pack (tree value
)
4099 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
4100 const char *str
= TREE_STRING_POINTER (value
);
4101 int i
, len
= TREE_STRING_LENGTH (value
) - 1;
4102 tree argvec
= make_tree_vec (1);
4104 /* Fill in CHARVEC with all of the parameters. */
4105 charvec
= make_tree_vec (len
);
4106 for (i
= 0; i
< len
; ++i
)
4107 TREE_VEC_ELT (charvec
, i
) = build_int_cst (char_type_node
, str
[i
]);
4109 /* Build the argument packs. */
4110 SET_ARGUMENT_PACK_ARGS (argpack
, charvec
);
4111 TREE_TYPE (argpack
) = char_type_node
;
4113 TREE_VEC_ELT (argvec
, 0) = argpack
;
4118 /* A subroutine of cp_parser_userdef_numeric_literal to
4119 create a char... template parameter pack from a string node. */
4122 make_string_pack (tree value
)
4125 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
4126 const unsigned char *str
4127 = (const unsigned char *) TREE_STRING_POINTER (value
);
4128 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (value
))));
4129 int len
= TREE_STRING_LENGTH (value
) / sz
- 1;
4130 tree argvec
= make_tree_vec (2);
4132 tree str_char_type_node
= TREE_TYPE (TREE_TYPE (value
));
4133 str_char_type_node
= TYPE_MAIN_VARIANT (str_char_type_node
);
4135 /* First template parm is character type. */
4136 TREE_VEC_ELT (argvec
, 0) = str_char_type_node
;
4138 /* Fill in CHARVEC with all of the parameters. */
4139 charvec
= make_tree_vec (len
);
4140 for (int i
= 0; i
< len
; ++i
)
4141 TREE_VEC_ELT (charvec
, i
)
4142 = double_int_to_tree (str_char_type_node
,
4143 double_int::from_buffer (str
+ i
* sz
, sz
));
4145 /* Build the argument packs. */
4146 SET_ARGUMENT_PACK_ARGS (argpack
, charvec
);
4147 TREE_TYPE (argpack
) = str_char_type_node
;
4149 TREE_VEC_ELT (argvec
, 1) = argpack
;
4154 /* Parse a user-defined numeric constant. returns a call to a user-defined
4155 literal operator. */
4158 cp_parser_userdef_numeric_literal (cp_parser
*parser
)
4160 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
4161 tree literal
= token
->u
.value
;
4162 tree suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
4163 tree value
= USERDEF_LITERAL_VALUE (literal
);
4164 int overflow
= USERDEF_LITERAL_OVERFLOW (literal
);
4165 tree num_string
= USERDEF_LITERAL_NUM_STRING (literal
);
4166 tree name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
4168 vec
<tree
, va_gc
> *args
;
4170 /* Look for a literal operator taking the exact type of numeric argument
4171 as the literal value. */
4172 args
= make_tree_vector ();
4173 vec_safe_push (args
, value
);
4174 decl
= lookup_literal_operator (name
, args
);
4175 if (decl
&& decl
!= error_mark_node
)
4177 result
= finish_call_expr (decl
, &args
, false, true,
4178 tf_warning_or_error
);
4180 if (TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
&& overflow
> 0)
4182 warning_at (token
->location
, OPT_Woverflow
,
4183 "integer literal exceeds range of %qT type",
4184 long_long_unsigned_type_node
);
4189 warning_at (token
->location
, OPT_Woverflow
,
4190 "floating literal exceeds range of %qT type",
4191 long_double_type_node
);
4192 else if (overflow
< 0)
4193 warning_at (token
->location
, OPT_Woverflow
,
4194 "floating literal truncated to zero");
4197 release_tree_vector (args
);
4200 release_tree_vector (args
);
4202 /* If the numeric argument didn't work, look for a raw literal
4203 operator taking a const char* argument consisting of the number
4204 in string format. */
4205 args
= make_tree_vector ();
4206 vec_safe_push (args
, num_string
);
4207 decl
= lookup_literal_operator (name
, args
);
4208 if (decl
&& decl
!= error_mark_node
)
4210 result
= finish_call_expr (decl
, &args
, false, true,
4211 tf_warning_or_error
);
4212 release_tree_vector (args
);
4215 release_tree_vector (args
);
4217 /* If the raw literal didn't work, look for a non-type template
4218 function with parameter pack char.... Call the function with
4219 template parameter characters representing the number. */
4220 args
= make_tree_vector ();
4221 decl
= lookup_literal_operator (name
, args
);
4222 if (decl
&& decl
!= error_mark_node
)
4224 tree tmpl_args
= make_char_string_pack (num_string
);
4225 decl
= lookup_template_function (decl
, tmpl_args
);
4226 result
= finish_call_expr (decl
, &args
, false, true,
4227 tf_warning_or_error
);
4228 release_tree_vector (args
);
4232 release_tree_vector (args
);
4234 error ("unable to find numeric literal operator %qD", name
);
4235 if (!cpp_get_options (parse_in
)->ext_numeric_literals
)
4236 inform (token
->location
, "use -std=gnu++11 or -fext-numeric-literals "
4237 "to enable more built-in suffixes");
4238 return error_mark_node
;
4241 /* Parse a user-defined string constant. Returns a call to a user-defined
4242 literal operator taking a character pointer and the length of the string
4246 cp_parser_userdef_string_literal (tree literal
)
4248 tree suffix_id
= USERDEF_LITERAL_SUFFIX_ID (literal
);
4249 tree name
= cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id
));
4250 tree value
= USERDEF_LITERAL_VALUE (literal
);
4251 int len
= TREE_STRING_LENGTH (value
)
4252 / TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (value
)))) - 1;
4254 vec
<tree
, va_gc
> *args
;
4256 /* Build up a call to the user-defined operator. */
4257 /* Lookup the name we got back from the id-expression. */
4258 args
= make_tree_vector ();
4259 vec_safe_push (args
, value
);
4260 vec_safe_push (args
, build_int_cst (size_type_node
, len
));
4261 decl
= lookup_literal_operator (name
, args
);
4263 if (decl
&& decl
!= error_mark_node
)
4265 result
= finish_call_expr (decl
, &args
, false, true,
4266 tf_warning_or_error
);
4267 release_tree_vector (args
);
4270 release_tree_vector (args
);
4272 /* Look for a template function with typename parameter CharT
4273 and parameter pack CharT... Call the function with
4274 template parameter characters representing the string. */
4275 args
= make_tree_vector ();
4276 decl
= lookup_literal_operator (name
, args
);
4277 if (decl
&& decl
!= error_mark_node
)
4279 tree tmpl_args
= make_string_pack (value
);
4280 decl
= lookup_template_function (decl
, tmpl_args
);
4281 result
= finish_call_expr (decl
, &args
, false, true,
4282 tf_warning_or_error
);
4283 release_tree_vector (args
);
4286 release_tree_vector (args
);
4288 error ("unable to find string literal operator %qD with %qT, %qT arguments",
4289 name
, TREE_TYPE (value
), size_type_node
);
4290 return error_mark_node
;
4294 /* Basic concepts [gram.basic] */
4296 /* Parse a translation-unit.
4299 declaration-seq [opt]
4301 Returns TRUE if all went well. */
4304 cp_parser_translation_unit (cp_parser
* parser
)
4306 /* The address of the first non-permanent object on the declarator
4308 static void *declarator_obstack_base
;
4312 /* Create the declarator obstack, if necessary. */
4313 if (!cp_error_declarator
)
4315 gcc_obstack_init (&declarator_obstack
);
4316 /* Create the error declarator. */
4317 cp_error_declarator
= make_declarator (cdk_error
);
4318 /* Create the empty parameter list. */
4319 no_parameters
= make_parameter_declarator (NULL
, NULL
, NULL_TREE
);
4320 /* Remember where the base of the declarator obstack lies. */
4321 declarator_obstack_base
= obstack_next_free (&declarator_obstack
);
4324 cp_parser_declaration_seq_opt (parser
);
4326 /* If there are no tokens left then all went well. */
4327 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
4329 /* Get rid of the token array; we don't need it any more. */
4330 cp_lexer_destroy (parser
->lexer
);
4331 parser
->lexer
= NULL
;
4333 /* This file might have been a context that's implicitly extern
4334 "C". If so, pop the lang context. (Only relevant for PCH.) */
4335 if (parser
->implicit_extern_c
)
4337 pop_lang_context ();
4338 parser
->implicit_extern_c
= false;
4342 finish_translation_unit ();
4348 cp_parser_error (parser
, "expected declaration");
4352 /* Make sure the declarator obstack was fully cleaned up. */
4353 gcc_assert (obstack_next_free (&declarator_obstack
)
4354 == declarator_obstack_base
);
4356 /* All went well. */
4360 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4361 decltype context. */
4363 static inline tsubst_flags_t
4364 complain_flags (bool decltype_p
)
4366 tsubst_flags_t complain
= tf_warning_or_error
;
4368 complain
|= tf_decltype
;
4372 /* We're about to parse a collection of statements. If we're currently
4373 parsing tentatively, set up a firewall so that any nested
4374 cp_parser_commit_to_tentative_parse won't affect the current context. */
4376 static cp_token_position
4377 cp_parser_start_tentative_firewall (cp_parser
*parser
)
4379 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
4382 cp_parser_parse_tentatively (parser
);
4383 cp_parser_commit_to_topmost_tentative_parse (parser
);
4384 return cp_lexer_token_position (parser
->lexer
, false);
4387 /* We've finished parsing the collection of statements. Wrap up the
4388 firewall and replace the relevant tokens with the parsed form. */
4391 cp_parser_end_tentative_firewall (cp_parser
*parser
, cp_token_position start
,
4397 /* Finish the firewall level. */
4398 cp_parser_parse_definitely (parser
);
4399 /* And remember the result of the parse for when we try again. */
4400 cp_token
*token
= cp_lexer_token_at (parser
->lexer
, start
);
4401 token
->type
= CPP_PREPARSED_EXPR
;
4402 token
->u
.value
= expr
;
4403 token
->keyword
= RID_MAX
;
4404 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
4407 /* Like the above functions, but let the user modify the tokens. Used by
4408 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4409 later parses, so it makes sense to localize the effects of
4410 cp_parser_commit_to_tentative_parse. */
4412 struct tentative_firewall
4417 tentative_firewall (cp_parser
*p
): parser(p
)
4419 /* If we're currently parsing tentatively, start a committed level as a
4420 firewall and then an inner tentative parse. */
4421 if ((set
= cp_parser_uncommitted_to_tentative_parse_p (parser
)))
4423 cp_parser_parse_tentatively (parser
);
4424 cp_parser_commit_to_topmost_tentative_parse (parser
);
4425 cp_parser_parse_tentatively (parser
);
4429 ~tentative_firewall()
4433 /* Finish the inner tentative parse and the firewall, propagating any
4434 uncommitted error state to the outer tentative parse. */
4435 bool err
= cp_parser_error_occurred (parser
);
4436 cp_parser_parse_definitely (parser
);
4437 cp_parser_parse_definitely (parser
);
4439 cp_parser_simulate_error (parser
);
4444 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4445 enclosing parentheses. */
4448 cp_parser_statement_expr (cp_parser
*parser
)
4450 cp_token_position start
= cp_parser_start_tentative_firewall (parser
);
4452 /* Consume the '('. */
4453 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
4454 cp_lexer_consume_token (parser
->lexer
);
4455 /* Start the statement-expression. */
4456 tree expr
= begin_stmt_expr ();
4457 /* Parse the compound-statement. */
4458 cp_parser_compound_statement (parser
, expr
, BCS_NORMAL
, false);
4460 expr
= finish_stmt_expr (expr
, false);
4461 /* Consume the ')'. */
4462 location_t finish_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
4463 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
4464 cp_parser_skip_to_end_of_statement (parser
);
4466 cp_parser_end_tentative_firewall (parser
, start
, expr
);
4467 location_t combined_loc
= make_location (start_loc
, start_loc
, finish_loc
);
4468 return cp_expr (expr
, combined_loc
);
4471 /* Expressions [gram.expr] */
4473 /* Parse a fold-operator.
4476 - * / % ^ & | = < > << >>
4477 = -= *= /= %= ^= &= |= <<= >>=
4478 == != <= >= && || , .* ->*
4480 This returns the tree code corresponding to the matched operator
4481 as an int. When the current token matches a compound assignment
4482 opertor, the resulting tree code is the negative value of the
4483 non-assignment operator. */
4486 cp_parser_fold_operator (cp_token
*token
)
4488 switch (token
->type
)
4490 case CPP_PLUS
: return PLUS_EXPR
;
4491 case CPP_MINUS
: return MINUS_EXPR
;
4492 case CPP_MULT
: return MULT_EXPR
;
4493 case CPP_DIV
: return TRUNC_DIV_EXPR
;
4494 case CPP_MOD
: return TRUNC_MOD_EXPR
;
4495 case CPP_XOR
: return BIT_XOR_EXPR
;
4496 case CPP_AND
: return BIT_AND_EXPR
;
4497 case CPP_OR
: return BIT_IOR_EXPR
;
4498 case CPP_LSHIFT
: return LSHIFT_EXPR
;
4499 case CPP_RSHIFT
: return RSHIFT_EXPR
;
4501 case CPP_EQ
: return -NOP_EXPR
;
4502 case CPP_PLUS_EQ
: return -PLUS_EXPR
;
4503 case CPP_MINUS_EQ
: return -MINUS_EXPR
;
4504 case CPP_MULT_EQ
: return -MULT_EXPR
;
4505 case CPP_DIV_EQ
: return -TRUNC_DIV_EXPR
;
4506 case CPP_MOD_EQ
: return -TRUNC_MOD_EXPR
;
4507 case CPP_XOR_EQ
: return -BIT_XOR_EXPR
;
4508 case CPP_AND_EQ
: return -BIT_AND_EXPR
;
4509 case CPP_OR_EQ
: return -BIT_IOR_EXPR
;
4510 case CPP_LSHIFT_EQ
: return -LSHIFT_EXPR
;
4511 case CPP_RSHIFT_EQ
: return -RSHIFT_EXPR
;
4513 case CPP_EQ_EQ
: return EQ_EXPR
;
4514 case CPP_NOT_EQ
: return NE_EXPR
;
4515 case CPP_LESS
: return LT_EXPR
;
4516 case CPP_GREATER
: return GT_EXPR
;
4517 case CPP_LESS_EQ
: return LE_EXPR
;
4518 case CPP_GREATER_EQ
: return GE_EXPR
;
4520 case CPP_AND_AND
: return TRUTH_ANDIF_EXPR
;
4521 case CPP_OR_OR
: return TRUTH_ORIF_EXPR
;
4523 case CPP_COMMA
: return COMPOUND_EXPR
;
4525 case CPP_DOT_STAR
: return DOTSTAR_EXPR
;
4526 case CPP_DEREF_STAR
: return MEMBER_REF
;
4528 default: return ERROR_MARK
;
4532 /* Returns true if CODE indicates a binary expression, which is not allowed in
4533 the LHS of a fold-expression. More codes will need to be added to use this
4534 function in other contexts. */
4537 is_binary_op (tree_code code
)
4542 case POINTER_PLUS_EXPR
:
4545 case TRUNC_DIV_EXPR
:
4546 case TRUNC_MOD_EXPR
:
4562 case TRUTH_ANDIF_EXPR
:
4563 case TRUTH_ORIF_EXPR
:
4576 /* If the next token is a suitable fold operator, consume it and return as
4577 the function above. */
4580 cp_parser_fold_operator (cp_parser
*parser
)
4582 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
4583 int code
= cp_parser_fold_operator (token
);
4584 if (code
!= ERROR_MARK
)
4585 cp_lexer_consume_token (parser
->lexer
);
4589 /* Parse a fold-expression.
4592 ( ... folding-operator cast-expression)
4593 ( cast-expression folding-operator ... )
4594 ( cast-expression folding operator ... folding-operator cast-expression)
4596 Note that the '(' and ')' are matched in primary expression. */
4599 cp_parser_fold_expression (cp_parser
*parser
, tree expr1
)
4604 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
4606 cp_lexer_consume_token (parser
->lexer
);
4607 int op
= cp_parser_fold_operator (parser
);
4608 if (op
== ERROR_MARK
)
4610 cp_parser_error (parser
, "expected binary operator");
4611 return error_mark_node
;
4614 tree expr
= cp_parser_cast_expression (parser
, false, false,
4616 if (expr
== error_mark_node
)
4617 return error_mark_node
;
4618 return finish_left_unary_fold_expr (expr
, op
);
4621 const cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
4622 int op
= cp_parser_fold_operator (parser
);
4623 if (op
== ERROR_MARK
)
4625 cp_parser_error (parser
, "expected binary operator");
4626 return error_mark_node
;
4629 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
))
4631 cp_parser_error (parser
, "expected ...");
4632 return error_mark_node
;
4634 cp_lexer_consume_token (parser
->lexer
);
4636 /* The operands of a fold-expression are cast-expressions, so binary or
4637 conditional expressions are not allowed. We check this here to avoid
4638 tentative parsing. */
4639 if (is_binary_op (TREE_CODE (expr1
)))
4640 error_at (location_of (expr1
),
4641 "binary expression in operand of fold-expression");
4642 else if (TREE_CODE (expr1
) == COND_EXPR
)
4643 error_at (location_of (expr1
),
4644 "conditional expression in operand of fold-expression");
4647 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
4648 return finish_right_unary_fold_expr (expr1
, op
);
4650 if (cp_lexer_next_token_is_not (parser
->lexer
, token
->type
))
4652 cp_parser_error (parser
, "mismatched operator in fold-expression");
4653 return error_mark_node
;
4655 cp_lexer_consume_token (parser
->lexer
);
4657 // Binary left or right fold.
4658 tree expr2
= cp_parser_cast_expression (parser
, false, false, false, &pidk
);
4659 if (expr2
== error_mark_node
)
4660 return error_mark_node
;
4661 return finish_binary_fold_expr (expr1
, expr2
, op
);
4664 /* Parse a primary-expression.
4671 lambda-expression (C++11)
4676 ( compound-statement )
4677 __builtin_va_arg ( assignment-expression , type-id )
4678 __builtin_offsetof ( type-id , offsetof-expression )
4681 __has_nothrow_assign ( type-id )
4682 __has_nothrow_constructor ( type-id )
4683 __has_nothrow_copy ( type-id )
4684 __has_trivial_assign ( type-id )
4685 __has_trivial_constructor ( type-id )
4686 __has_trivial_copy ( type-id )
4687 __has_trivial_destructor ( type-id )
4688 __has_virtual_destructor ( type-id )
4689 __is_abstract ( type-id )
4690 __is_base_of ( type-id , type-id )
4691 __is_class ( type-id )
4692 __is_empty ( type-id )
4693 __is_enum ( type-id )
4694 __is_final ( type-id )
4695 __is_literal_type ( type-id )
4696 __is_pod ( type-id )
4697 __is_polymorphic ( type-id )
4698 __is_std_layout ( type-id )
4699 __is_trivial ( type-id )
4700 __is_union ( type-id )
4702 Objective-C++ Extension:
4710 ADDRESS_P is true iff this expression was immediately preceded by
4711 "&" and therefore might denote a pointer-to-member. CAST_P is true
4712 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4713 true iff this expression is a template argument.
4715 Returns a representation of the expression. Upon return, *IDK
4716 indicates what kind of id-expression (if any) was present. */
4719 cp_parser_primary_expression (cp_parser
*parser
,
4722 bool template_arg_p
,
4726 cp_token
*token
= NULL
;
4728 /* Assume the primary expression is not an id-expression. */
4729 *idk
= CP_ID_KIND_NONE
;
4731 /* Peek at the next token. */
4732 token
= cp_lexer_peek_token (parser
->lexer
);
4733 switch ((int) token
->type
)
4742 user-defined-literal */
4749 case CPP_PREPARSED_EXPR
:
4750 if (TREE_CODE (token
->u
.value
) == USERDEF_LITERAL
)
4751 return cp_parser_userdef_numeric_literal (parser
);
4752 token
= cp_lexer_consume_token (parser
->lexer
);
4753 if (TREE_CODE (token
->u
.value
) == FIXED_CST
)
4755 error_at (token
->location
,
4756 "fixed-point types not supported in C++");
4757 return error_mark_node
;
4759 /* Floating-point literals are only allowed in an integral
4760 constant expression if they are cast to an integral or
4761 enumeration type. */
4762 if (TREE_CODE (token
->u
.value
) == REAL_CST
4763 && parser
->integral_constant_expression_p
4766 /* CAST_P will be set even in invalid code like "int(2.7 +
4767 ...)". Therefore, we have to check that the next token
4768 is sure to end the cast. */
4771 cp_token
*next_token
;
4773 next_token
= cp_lexer_peek_token (parser
->lexer
);
4774 if (/* The comma at the end of an
4775 enumerator-definition. */
4776 next_token
->type
!= CPP_COMMA
4777 /* The curly brace at the end of an enum-specifier. */
4778 && next_token
->type
!= CPP_CLOSE_BRACE
4779 /* The end of a statement. */
4780 && next_token
->type
!= CPP_SEMICOLON
4781 /* The end of the cast-expression. */
4782 && next_token
->type
!= CPP_CLOSE_PAREN
4783 /* The end of an array bound. */
4784 && next_token
->type
!= CPP_CLOSE_SQUARE
4785 /* The closing ">" in a template-argument-list. */
4786 && (next_token
->type
!= CPP_GREATER
4787 || parser
->greater_than_is_operator_p
)
4788 /* C++0x only: A ">>" treated like two ">" tokens,
4789 in a template-argument-list. */
4790 && (next_token
->type
!= CPP_RSHIFT
4791 || (cxx_dialect
== cxx98
)
4792 || parser
->greater_than_is_operator_p
))
4796 /* If we are within a cast, then the constraint that the
4797 cast is to an integral or enumeration type will be
4798 checked at that point. If we are not within a cast, then
4799 this code is invalid. */
4801 cp_parser_non_integral_constant_expression (parser
, NIC_FLOAT
);
4803 return cp_expr (token
->u
.value
, token
->location
);
4805 case CPP_CHAR_USERDEF
:
4806 case CPP_CHAR16_USERDEF
:
4807 case CPP_CHAR32_USERDEF
:
4808 case CPP_WCHAR_USERDEF
:
4809 case CPP_UTF8CHAR_USERDEF
:
4810 return cp_parser_userdef_char_literal (parser
);
4816 case CPP_UTF8STRING
:
4817 case CPP_STRING_USERDEF
:
4818 case CPP_STRING16_USERDEF
:
4819 case CPP_STRING32_USERDEF
:
4820 case CPP_WSTRING_USERDEF
:
4821 case CPP_UTF8STRING_USERDEF
:
4822 /* ??? Should wide strings be allowed when parser->translate_strings_p
4823 is false (i.e. in attributes)? If not, we can kill the third
4824 argument to cp_parser_string_literal. */
4825 return cp_parser_string_literal (parser
,
4826 parser
->translate_strings_p
,
4829 case CPP_OPEN_PAREN
:
4830 /* If we see `( { ' then we are looking at the beginning of
4831 a GNU statement-expression. */
4832 if (cp_parser_allow_gnu_extensions_p (parser
)
4833 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_OPEN_BRACE
))
4835 /* Statement-expressions are not allowed by the standard. */
4836 pedwarn (token
->location
, OPT_Wpedantic
,
4837 "ISO C++ forbids braced-groups within expressions");
4839 /* And they're not allowed outside of a function-body; you
4840 cannot, for example, write:
4842 int i = ({ int j = 3; j + 1; });
4844 at class or namespace scope. */
4845 if (!parser
->in_function_body
4846 || parser
->in_template_argument_list_p
)
4848 error_at (token
->location
,
4849 "statement-expressions are not allowed outside "
4850 "functions nor in template-argument lists");
4851 cp_parser_skip_to_end_of_block_or_statement (parser
);
4852 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
4853 cp_lexer_consume_token (parser
->lexer
);
4854 return error_mark_node
;
4857 return cp_parser_statement_expr (parser
);
4859 /* Otherwise it's a normal parenthesized expression. */
4862 bool saved_greater_than_is_operator_p
;
4864 location_t open_paren_loc
= token
->location
;
4866 /* Consume the `('. */
4867 cp_lexer_consume_token (parser
->lexer
);
4868 /* Within a parenthesized expression, a `>' token is always
4869 the greater-than operator. */
4870 saved_greater_than_is_operator_p
4871 = parser
->greater_than_is_operator_p
;
4872 parser
->greater_than_is_operator_p
= true;
4874 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
4875 /* Left fold expression. */
4878 /* Parse the parenthesized expression. */
4879 expr
= cp_parser_expression (parser
, idk
, cast_p
, decltype_p
);
4881 token
= cp_lexer_peek_token (parser
->lexer
);
4882 if (token
->type
== CPP_ELLIPSIS
|| cp_parser_fold_operator (token
))
4884 expr
= cp_parser_fold_expression (parser
, expr
);
4885 if (expr
!= error_mark_node
4886 && cxx_dialect
< cxx1z
4887 && !in_system_header_at (input_location
))
4888 pedwarn (input_location
, 0, "fold-expressions only available "
4889 "with -std=c++1z or -std=gnu++1z");
4892 /* Let the front end know that this expression was
4893 enclosed in parentheses. This matters in case, for
4894 example, the expression is of the form `A::B', since
4895 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4897 expr
= finish_parenthesized_expr (expr
);
4899 /* DR 705: Wrapping an unqualified name in parentheses
4900 suppresses arg-dependent lookup. We want to pass back
4901 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4902 (c++/37862), but none of the others. */
4903 if (*idk
!= CP_ID_KIND_QUALIFIED
)
4904 *idk
= CP_ID_KIND_NONE
;
4906 /* The `>' token might be the end of a template-id or
4907 template-parameter-list now. */
4908 parser
->greater_than_is_operator_p
4909 = saved_greater_than_is_operator_p
;
4911 /* Consume the `)'. */
4912 token
= cp_lexer_peek_token (parser
->lexer
);
4913 location_t close_paren_loc
= token
->location
;
4914 expr
.set_range (open_paren_loc
, close_paren_loc
);
4915 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
)
4916 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
4917 cp_parser_skip_to_end_of_statement (parser
);
4922 case CPP_OPEN_SQUARE
:
4924 if (c_dialect_objc ())
4926 /* We might have an Objective-C++ message. */
4927 cp_parser_parse_tentatively (parser
);
4928 tree msg
= cp_parser_objc_message_expression (parser
);
4929 /* If that works out, we're done ... */
4930 if (cp_parser_parse_definitely (parser
))
4932 /* ... else, fall though to see if it's a lambda. */
4934 cp_expr lam
= cp_parser_lambda_expression (parser
);
4935 /* Don't warn about a failed tentative parse. */
4936 if (cp_parser_error_occurred (parser
))
4937 return error_mark_node
;
4938 maybe_warn_cpp0x (CPP0X_LAMBDA_EXPR
);
4942 case CPP_OBJC_STRING
:
4943 if (c_dialect_objc ())
4944 /* We have an Objective-C++ string literal. */
4945 return cp_parser_objc_expression (parser
);
4946 cp_parser_error (parser
, "expected primary-expression");
4947 return error_mark_node
;
4950 switch (token
->keyword
)
4952 /* These two are the boolean literals. */
4954 cp_lexer_consume_token (parser
->lexer
);
4955 return cp_expr (boolean_true_node
, token
->location
);
4957 cp_lexer_consume_token (parser
->lexer
);
4958 return cp_expr (boolean_false_node
, token
->location
);
4960 /* The `__null' literal. */
4962 cp_lexer_consume_token (parser
->lexer
);
4963 return cp_expr (null_node
, token
->location
);
4965 /* The `nullptr' literal. */
4967 cp_lexer_consume_token (parser
->lexer
);
4968 return cp_expr (nullptr_node
, token
->location
);
4970 /* Recognize the `this' keyword. */
4972 cp_lexer_consume_token (parser
->lexer
);
4973 if (parser
->local_variables_forbidden_p
)
4975 error_at (token
->location
,
4976 "%<this%> may not be used in this context");
4977 return error_mark_node
;
4979 /* Pointers cannot appear in constant-expressions. */
4980 if (cp_parser_non_integral_constant_expression (parser
, NIC_THIS
))
4981 return error_mark_node
;
4982 return cp_expr (finish_this_expr (), token
->location
);
4984 /* The `operator' keyword can be the beginning of an
4989 case RID_FUNCTION_NAME
:
4990 case RID_PRETTY_FUNCTION_NAME
:
4991 case RID_C99_FUNCTION_NAME
:
4993 non_integral_constant name
;
4995 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4996 __func__ are the names of variables -- but they are
4997 treated specially. Therefore, they are handled here,
4998 rather than relying on the generic id-expression logic
4999 below. Grammatically, these names are id-expressions.
5001 Consume the token. */
5002 token
= cp_lexer_consume_token (parser
->lexer
);
5004 switch (token
->keyword
)
5006 case RID_FUNCTION_NAME
:
5007 name
= NIC_FUNC_NAME
;
5009 case RID_PRETTY_FUNCTION_NAME
:
5010 name
= NIC_PRETTY_FUNC
;
5012 case RID_C99_FUNCTION_NAME
:
5013 name
= NIC_C99_FUNC
;
5019 if (cp_parser_non_integral_constant_expression (parser
, name
))
5020 return error_mark_node
;
5022 /* Look up the name. */
5023 return finish_fname (token
->u
.value
);
5030 source_location type_location
;
5031 location_t start_loc
5032 = cp_lexer_peek_token (parser
->lexer
)->location
;
5033 /* The `__builtin_va_arg' construct is used to handle
5034 `va_arg'. Consume the `__builtin_va_arg' token. */
5035 cp_lexer_consume_token (parser
->lexer
);
5036 /* Look for the opening `('. */
5037 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
5038 /* Now, parse the assignment-expression. */
5039 expression
= cp_parser_assignment_expression (parser
);
5040 /* Look for the `,'. */
5041 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
5042 type_location
= cp_lexer_peek_token (parser
->lexer
)->location
;
5043 /* Parse the type-id. */
5045 type_id_in_expr_sentinel
s (parser
);
5046 type
= cp_parser_type_id (parser
);
5048 /* Look for the closing `)'. */
5049 location_t finish_loc
5050 = cp_lexer_peek_token (parser
->lexer
)->location
;
5051 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5052 /* Using `va_arg' in a constant-expression is not
5054 if (cp_parser_non_integral_constant_expression (parser
,
5056 return error_mark_node
;
5057 /* Construct a location of the form:
5058 __builtin_va_arg (v, int)
5059 ~~~~~~~~~~~~~~~~~~~~~^~~~
5060 with the caret at the type, ranging from the start of the
5061 "__builtin_va_arg" token to the close paren. */
5062 location_t combined_loc
5063 = make_location (type_location
, start_loc
, finish_loc
);
5064 return build_x_va_arg (combined_loc
, expression
, type
);
5068 return cp_parser_builtin_offsetof (parser
);
5070 case RID_HAS_NOTHROW_ASSIGN
:
5071 case RID_HAS_NOTHROW_CONSTRUCTOR
:
5072 case RID_HAS_NOTHROW_COPY
:
5073 case RID_HAS_TRIVIAL_ASSIGN
:
5074 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
5075 case RID_HAS_TRIVIAL_COPY
:
5076 case RID_HAS_TRIVIAL_DESTRUCTOR
:
5077 case RID_HAS_VIRTUAL_DESTRUCTOR
:
5078 case RID_IS_ABSTRACT
:
5079 case RID_IS_BASE_OF
:
5084 case RID_IS_LITERAL_TYPE
:
5086 case RID_IS_POLYMORPHIC
:
5087 case RID_IS_SAME_AS
:
5088 case RID_IS_STD_LAYOUT
:
5089 case RID_IS_TRIVIAL
:
5090 case RID_IS_TRIVIALLY_ASSIGNABLE
:
5091 case RID_IS_TRIVIALLY_CONSTRUCTIBLE
:
5092 case RID_IS_TRIVIALLY_COPYABLE
:
5094 return cp_parser_trait_expr (parser
, token
->keyword
);
5098 return cp_parser_requires_expression (parser
);
5100 /* Objective-C++ expressions. */
5102 case RID_AT_PROTOCOL
:
5103 case RID_AT_SELECTOR
:
5104 return cp_parser_objc_expression (parser
);
5107 if (parser
->in_function_body
5108 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
5111 error_at (token
->location
,
5112 "a template declaration cannot appear at block scope");
5113 cp_parser_skip_to_end_of_block_or_statement (parser
);
5114 return error_mark_node
;
5117 cp_parser_error (parser
, "expected primary-expression");
5118 return error_mark_node
;
5121 /* An id-expression can start with either an identifier, a
5122 `::' as the beginning of a qualified-id, or the "operator"
5126 case CPP_TEMPLATE_ID
:
5127 case CPP_NESTED_NAME_SPECIFIER
:
5130 cp_expr id_expression
;
5132 const char *error_msg
;
5135 cp_token
*id_expr_token
;
5137 /* Parse the id-expression. */
5139 = cp_parser_id_expression (parser
,
5140 /*template_keyword_p=*/false,
5141 /*check_dependency_p=*/true,
5143 /*declarator_p=*/false,
5144 /*optional_p=*/false);
5145 if (id_expression
== error_mark_node
)
5146 return error_mark_node
;
5147 id_expr_token
= token
;
5148 token
= cp_lexer_peek_token (parser
->lexer
);
5149 done
= (token
->type
!= CPP_OPEN_SQUARE
5150 && token
->type
!= CPP_OPEN_PAREN
5151 && token
->type
!= CPP_DOT
5152 && token
->type
!= CPP_DEREF
5153 && token
->type
!= CPP_PLUS_PLUS
5154 && token
->type
!= CPP_MINUS_MINUS
);
5155 /* If we have a template-id, then no further lookup is
5156 required. If the template-id was for a template-class, we
5157 will sometimes have a TYPE_DECL at this point. */
5158 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
5159 || TREE_CODE (id_expression
) == TYPE_DECL
)
5160 decl
= id_expression
;
5161 /* Look up the name. */
5164 tree ambiguous_decls
;
5166 /* If we already know that this lookup is ambiguous, then
5167 we've already issued an error message; there's no reason
5169 if (id_expr_token
->type
== CPP_NAME
5170 && id_expr_token
->error_reported
)
5172 cp_parser_simulate_error (parser
);
5173 return error_mark_node
;
5176 decl
= cp_parser_lookup_name (parser
, id_expression
,
5179 /*is_namespace=*/false,
5180 /*check_dependency=*/true,
5182 id_expr_token
->location
);
5183 /* If the lookup was ambiguous, an error will already have
5185 if (ambiguous_decls
)
5186 return error_mark_node
;
5188 /* In Objective-C++, we may have an Objective-C 2.0
5189 dot-syntax for classes here. */
5190 if (c_dialect_objc ()
5191 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
5192 && TREE_CODE (decl
) == TYPE_DECL
5193 && objc_is_class_name (decl
))
5196 cp_lexer_consume_token (parser
->lexer
);
5197 component
= cp_parser_identifier (parser
);
5198 if (component
== error_mark_node
)
5199 return error_mark_node
;
5201 tree result
= objc_build_class_component_ref (id_expression
,
5203 /* Build a location of the form:
5206 with caret at the start of the component name (at
5207 input_location), ranging from the start of the id_expression
5208 to the end of the component name. */
5209 location_t combined_loc
5210 = make_location (input_location
, id_expression
.get_start (),
5211 get_finish (input_location
));
5212 protected_set_expr_location (result
, combined_loc
);
5216 /* In Objective-C++, an instance variable (ivar) may be preferred
5217 to whatever cp_parser_lookup_name() found.
5218 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5219 rest of c-family, we have to do a little extra work to preserve
5220 any location information in cp_expr "decl". Given that
5221 objc_lookup_ivar is implemented in "c-family" and "objc", we
5222 have a trip through the pure "tree" type, rather than cp_expr.
5223 Naively copying it back to "decl" would implicitly give the
5224 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5225 store an EXPR_LOCATION. Hence we only update "decl" (and
5226 hence its location_t) if we get back a different tree node. */
5227 tree decl_tree
= objc_lookup_ivar (decl
.get_value (),
5229 if (decl_tree
!= decl
.get_value ())
5230 decl
= cp_expr (decl_tree
);
5232 /* If name lookup gives us a SCOPE_REF, then the
5233 qualifying scope was dependent. */
5234 if (TREE_CODE (decl
) == SCOPE_REF
)
5236 /* At this point, we do not know if DECL is a valid
5237 integral constant expression. We assume that it is
5238 in fact such an expression, so that code like:
5240 template <int N> struct A {
5244 is accepted. At template-instantiation time, we
5245 will check that B<N>::i is actually a constant. */
5248 /* Check to see if DECL is a local variable in a context
5249 where that is forbidden. */
5250 if (parser
->local_variables_forbidden_p
5251 && local_variable_p (decl
))
5253 /* It might be that we only found DECL because we are
5254 trying to be generous with pre-ISO scoping rules.
5255 For example, consider:
5259 for (int i = 0; i < 10; ++i) {}
5260 extern void f(int j = i);
5263 Here, name look up will originally find the out
5264 of scope `i'. We need to issue a warning message,
5265 but then use the global `i'. */
5266 decl
= check_for_out_of_scope_variable (decl
);
5267 if (local_variable_p (decl
))
5269 error_at (id_expr_token
->location
,
5270 "local variable %qD may not appear in this context",
5272 return error_mark_node
;
5277 decl
= (finish_id_expression
5278 (id_expression
, decl
, parser
->scope
,
5280 parser
->integral_constant_expression_p
,
5281 parser
->allow_non_integral_constant_expression_p
,
5282 &parser
->non_integral_constant_expression_p
,
5283 template_p
, done
, address_p
,
5286 id_expr_token
->location
));
5288 cp_parser_error (parser
, error_msg
);
5289 decl
.set_location (id_expr_token
->location
);
5293 /* Anything else is an error. */
5295 cp_parser_error (parser
, "expected primary-expression");
5296 return error_mark_node
;
5300 static inline cp_expr
5301 cp_parser_primary_expression (cp_parser
*parser
,
5304 bool template_arg_p
,
5307 return cp_parser_primary_expression (parser
, address_p
, cast_p
, template_arg_p
,
5308 /*decltype*/false, idk
);
5311 /* Parse an id-expression.
5318 :: [opt] nested-name-specifier template [opt] unqualified-id
5320 :: operator-function-id
5323 Return a representation of the unqualified portion of the
5324 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5325 a `::' or nested-name-specifier.
5327 Often, if the id-expression was a qualified-id, the caller will
5328 want to make a SCOPE_REF to represent the qualified-id. This
5329 function does not do this in order to avoid wastefully creating
5330 SCOPE_REFs when they are not required.
5332 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5335 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5336 uninstantiated templates.
5338 If *TEMPLATE_P is non-NULL, it is set to true iff the
5339 `template' keyword is used to explicitly indicate that the entity
5340 named is a template.
5342 If DECLARATOR_P is true, the id-expression is appearing as part of
5343 a declarator, rather than as part of an expression. */
5346 cp_parser_id_expression (cp_parser
*parser
,
5347 bool template_keyword_p
,
5348 bool check_dependency_p
,
5353 bool global_scope_p
;
5354 bool nested_name_specifier_p
;
5356 /* Assume the `template' keyword was not used. */
5358 *template_p
= template_keyword_p
;
5360 /* Look for the optional `::' operator. */
5362 = (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false)
5364 /* Look for the optional nested-name-specifier. */
5365 nested_name_specifier_p
5366 = (cp_parser_nested_name_specifier_opt (parser
,
5367 /*typename_keyword_p=*/false,
5372 /* If there is a nested-name-specifier, then we are looking at
5373 the first qualified-id production. */
5374 if (nested_name_specifier_p
)
5377 tree saved_object_scope
;
5378 tree saved_qualifying_scope
;
5379 tree unqualified_id
;
5382 /* See if the next token is the `template' keyword. */
5384 template_p
= &is_template
;
5385 *template_p
= cp_parser_optional_template_keyword (parser
);
5386 /* Name lookup we do during the processing of the
5387 unqualified-id might obliterate SCOPE. */
5388 saved_scope
= parser
->scope
;
5389 saved_object_scope
= parser
->object_scope
;
5390 saved_qualifying_scope
= parser
->qualifying_scope
;
5391 /* Process the final unqualified-id. */
5392 unqualified_id
= cp_parser_unqualified_id (parser
, *template_p
,
5395 /*optional_p=*/false);
5396 /* Restore the SAVED_SCOPE for our caller. */
5397 parser
->scope
= saved_scope
;
5398 parser
->object_scope
= saved_object_scope
;
5399 parser
->qualifying_scope
= saved_qualifying_scope
;
5401 return unqualified_id
;
5403 /* Otherwise, if we are in global scope, then we are looking at one
5404 of the other qualified-id productions. */
5405 else if (global_scope_p
)
5410 /* Peek at the next token. */
5411 token
= cp_lexer_peek_token (parser
->lexer
);
5413 /* If it's an identifier, and the next token is not a "<", then
5414 we can avoid the template-id case. This is an optimization
5415 for this common case. */
5416 if (token
->type
== CPP_NAME
5417 && !cp_parser_nth_token_starts_template_argument_list_p
5419 return cp_parser_identifier (parser
);
5421 cp_parser_parse_tentatively (parser
);
5422 /* Try a template-id. */
5423 id
= cp_parser_template_id (parser
,
5424 /*template_keyword_p=*/false,
5425 /*check_dependency_p=*/true,
5428 /* If that worked, we're done. */
5429 if (cp_parser_parse_definitely (parser
))
5432 /* Peek at the next token. (Changes in the token buffer may
5433 have invalidated the pointer obtained above.) */
5434 token
= cp_lexer_peek_token (parser
->lexer
);
5436 switch (token
->type
)
5439 return cp_parser_identifier (parser
);
5442 if (token
->keyword
== RID_OPERATOR
)
5443 return cp_parser_operator_function_id (parser
);
5447 cp_parser_error (parser
, "expected id-expression");
5448 return error_mark_node
;
5452 return cp_parser_unqualified_id (parser
, template_keyword_p
,
5453 /*check_dependency_p=*/true,
5458 /* Parse an unqualified-id.
5462 operator-function-id
5463 conversion-function-id
5467 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5468 keyword, in a construct like `A::template ...'.
5470 Returns a representation of unqualified-id. For the `identifier'
5471 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5472 production a BIT_NOT_EXPR is returned; the operand of the
5473 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5474 other productions, see the documentation accompanying the
5475 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5476 names are looked up in uninstantiated templates. If DECLARATOR_P
5477 is true, the unqualified-id is appearing as part of a declarator,
5478 rather than as part of an expression. */
5481 cp_parser_unqualified_id (cp_parser
* parser
,
5482 bool template_keyword_p
,
5483 bool check_dependency_p
,
5489 /* Peek at the next token. */
5490 token
= cp_lexer_peek_token (parser
->lexer
);
5492 switch ((int) token
->type
)
5498 /* We don't know yet whether or not this will be a
5500 cp_parser_parse_tentatively (parser
);
5501 /* Try a template-id. */
5502 id
= cp_parser_template_id (parser
, template_keyword_p
,
5506 /* If it worked, we're done. */
5507 if (cp_parser_parse_definitely (parser
))
5509 /* Otherwise, it's an ordinary identifier. */
5510 return cp_parser_identifier (parser
);
5513 case CPP_TEMPLATE_ID
:
5514 return cp_parser_template_id (parser
, template_keyword_p
,
5522 tree qualifying_scope
;
5527 /* Consume the `~' token. */
5528 cp_lexer_consume_token (parser
->lexer
);
5529 /* Parse the class-name. The standard, as written, seems to
5532 template <typename T> struct S { ~S (); };
5533 template <typename T> S<T>::~S() {}
5535 is invalid, since `~' must be followed by a class-name, but
5536 `S<T>' is dependent, and so not known to be a class.
5537 That's not right; we need to look in uninstantiated
5538 templates. A further complication arises from:
5540 template <typename T> void f(T t) {
5544 Here, it is not possible to look up `T' in the scope of `T'
5545 itself. We must look in both the current scope, and the
5546 scope of the containing complete expression.
5548 Yet another issue is:
5557 The standard does not seem to say that the `S' in `~S'
5558 should refer to the type `S' and not the data member
5561 /* DR 244 says that we look up the name after the "~" in the
5562 same scope as we looked up the qualifying name. That idea
5563 isn't fully worked out; it's more complicated than that. */
5564 scope
= parser
->scope
;
5565 object_scope
= parser
->object_scope
;
5566 qualifying_scope
= parser
->qualifying_scope
;
5568 /* Check for invalid scopes. */
5569 if (scope
== error_mark_node
)
5571 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
5572 cp_lexer_consume_token (parser
->lexer
);
5573 return error_mark_node
;
5575 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
5577 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
5578 error_at (token
->location
,
5579 "scope %qT before %<~%> is not a class-name",
5581 cp_parser_simulate_error (parser
);
5582 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
5583 cp_lexer_consume_token (parser
->lexer
);
5584 return error_mark_node
;
5586 gcc_assert (!scope
|| TYPE_P (scope
));
5588 /* If the name is of the form "X::~X" it's OK even if X is a
5590 token
= cp_lexer_peek_token (parser
->lexer
);
5592 && token
->type
== CPP_NAME
5593 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
5595 && (token
->u
.value
== TYPE_IDENTIFIER (scope
)
5596 || (CLASS_TYPE_P (scope
)
5597 && constructor_name_p (token
->u
.value
, scope
))))
5599 cp_lexer_consume_token (parser
->lexer
);
5600 return build_nt (BIT_NOT_EXPR
, scope
);
5603 /* ~auto means the destructor of whatever the object is. */
5604 if (cp_parser_is_keyword (token
, RID_AUTO
))
5606 if (cxx_dialect
< cxx14
)
5607 pedwarn (input_location
, 0,
5608 "%<~auto%> only available with "
5609 "-std=c++14 or -std=gnu++14");
5610 cp_lexer_consume_token (parser
->lexer
);
5611 return build_nt (BIT_NOT_EXPR
, make_auto ());
5614 /* If there was an explicit qualification (S::~T), first look
5615 in the scope given by the qualification (i.e., S).
5617 Note: in the calls to cp_parser_class_name below we pass
5618 typename_type so that lookup finds the injected-class-name
5619 rather than the constructor. */
5621 type_decl
= NULL_TREE
;
5624 cp_parser_parse_tentatively (parser
);
5625 type_decl
= cp_parser_class_name (parser
,
5626 /*typename_keyword_p=*/false,
5627 /*template_keyword_p=*/false,
5629 /*check_dependency=*/false,
5630 /*class_head_p=*/false,
5632 if (cp_parser_parse_definitely (parser
))
5635 /* In "N::S::~S", look in "N" as well. */
5636 if (!done
&& scope
&& qualifying_scope
)
5638 cp_parser_parse_tentatively (parser
);
5639 parser
->scope
= qualifying_scope
;
5640 parser
->object_scope
= NULL_TREE
;
5641 parser
->qualifying_scope
= NULL_TREE
;
5643 = cp_parser_class_name (parser
,
5644 /*typename_keyword_p=*/false,
5645 /*template_keyword_p=*/false,
5647 /*check_dependency=*/false,
5648 /*class_head_p=*/false,
5650 if (cp_parser_parse_definitely (parser
))
5653 /* In "p->S::~T", look in the scope given by "*p" as well. */
5654 else if (!done
&& object_scope
)
5656 cp_parser_parse_tentatively (parser
);
5657 parser
->scope
= object_scope
;
5658 parser
->object_scope
= NULL_TREE
;
5659 parser
->qualifying_scope
= NULL_TREE
;
5661 = cp_parser_class_name (parser
,
5662 /*typename_keyword_p=*/false,
5663 /*template_keyword_p=*/false,
5665 /*check_dependency=*/false,
5666 /*class_head_p=*/false,
5668 if (cp_parser_parse_definitely (parser
))
5671 /* Look in the surrounding context. */
5674 parser
->scope
= NULL_TREE
;
5675 parser
->object_scope
= NULL_TREE
;
5676 parser
->qualifying_scope
= NULL_TREE
;
5677 if (processing_template_decl
)
5678 cp_parser_parse_tentatively (parser
);
5680 = cp_parser_class_name (parser
,
5681 /*typename_keyword_p=*/false,
5682 /*template_keyword_p=*/false,
5684 /*check_dependency=*/false,
5685 /*class_head_p=*/false,
5687 if (processing_template_decl
5688 && ! cp_parser_parse_definitely (parser
))
5690 /* We couldn't find a type with this name. If we're parsing
5691 tentatively, fail and try something else. */
5692 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
5694 cp_parser_simulate_error (parser
);
5695 return error_mark_node
;
5697 /* Otherwise, accept it and check for a match at instantiation
5699 type_decl
= cp_parser_identifier (parser
);
5700 if (type_decl
!= error_mark_node
)
5701 type_decl
= build_nt (BIT_NOT_EXPR
, type_decl
);
5705 /* If an error occurred, assume that the name of the
5706 destructor is the same as the name of the qualifying
5707 class. That allows us to keep parsing after running
5708 into ill-formed destructor names. */
5709 if (type_decl
== error_mark_node
&& scope
)
5710 return build_nt (BIT_NOT_EXPR
, scope
);
5711 else if (type_decl
== error_mark_node
)
5712 return error_mark_node
;
5714 /* Check that destructor name and scope match. */
5715 if (declarator_p
&& scope
&& !check_dtor_name (scope
, type_decl
))
5717 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
5718 error_at (token
->location
,
5719 "declaration of %<~%T%> as member of %qT",
5721 cp_parser_simulate_error (parser
);
5722 return error_mark_node
;
5727 A typedef-name that names a class shall not be used as the
5728 identifier in the declarator for a destructor declaration. */
5730 && !DECL_IMPLICIT_TYPEDEF_P (type_decl
)
5731 && !DECL_SELF_REFERENCE_P (type_decl
)
5732 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
5733 error_at (token
->location
,
5734 "typedef-name %qD used as destructor declarator",
5737 return build_nt (BIT_NOT_EXPR
, TREE_TYPE (type_decl
));
5741 if (token
->keyword
== RID_OPERATOR
)
5745 /* This could be a template-id, so we try that first. */
5746 cp_parser_parse_tentatively (parser
);
5747 /* Try a template-id. */
5748 id
= cp_parser_template_id (parser
, template_keyword_p
,
5749 /*check_dependency_p=*/true,
5752 /* If that worked, we're done. */
5753 if (cp_parser_parse_definitely (parser
))
5755 /* We still don't know whether we're looking at an
5756 operator-function-id or a conversion-function-id. */
5757 cp_parser_parse_tentatively (parser
);
5758 /* Try an operator-function-id. */
5759 id
= cp_parser_operator_function_id (parser
);
5760 /* If that didn't work, try a conversion-function-id. */
5761 if (!cp_parser_parse_definitely (parser
))
5762 id
= cp_parser_conversion_function_id (parser
);
5763 else if (UDLIT_OPER_P (id
))
5766 const char *name
= UDLIT_OP_SUFFIX (id
);
5767 if (name
[0] != '_' && !in_system_header_at (input_location
)
5769 warning (0, "literal operator suffixes not preceded by %<_%>"
5770 " are reserved for future standardization");
5780 cp_parser_error (parser
, "expected unqualified-id");
5781 return error_mark_node
;
5785 /* Parse an (optional) nested-name-specifier.
5787 nested-name-specifier: [C++98]
5788 class-or-namespace-name :: nested-name-specifier [opt]
5789 class-or-namespace-name :: template nested-name-specifier [opt]
5791 nested-name-specifier: [C++0x]
5794 nested-name-specifier identifier ::
5795 nested-name-specifier template [opt] simple-template-id ::
5797 PARSER->SCOPE should be set appropriately before this function is
5798 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5799 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5802 Sets PARSER->SCOPE to the class (TYPE) or namespace
5803 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5804 it unchanged if there is no nested-name-specifier. Returns the new
5805 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5807 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5808 part of a declaration and/or decl-specifier. */
5811 cp_parser_nested_name_specifier_opt (cp_parser
*parser
,
5812 bool typename_keyword_p
,
5813 bool check_dependency_p
,
5815 bool is_declaration
)
5817 bool success
= false;
5818 cp_token_position start
= 0;
5821 /* Remember where the nested-name-specifier starts. */
5822 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
5824 start
= cp_lexer_token_position (parser
->lexer
, false);
5825 push_deferring_access_checks (dk_deferred
);
5832 tree saved_qualifying_scope
;
5833 bool template_keyword_p
;
5835 /* Spot cases that cannot be the beginning of a
5836 nested-name-specifier. */
5837 token
= cp_lexer_peek_token (parser
->lexer
);
5839 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5840 the already parsed nested-name-specifier. */
5841 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
5843 /* Grab the nested-name-specifier and continue the loop. */
5844 cp_parser_pre_parsed_nested_name_specifier (parser
);
5845 /* If we originally encountered this nested-name-specifier
5846 with IS_DECLARATION set to false, we will not have
5847 resolved TYPENAME_TYPEs, so we must do so here. */
5849 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
5851 new_scope
= resolve_typename_type (parser
->scope
,
5852 /*only_current_p=*/false);
5853 if (TREE_CODE (new_scope
) != TYPENAME_TYPE
)
5854 parser
->scope
= new_scope
;
5860 /* Spot cases that cannot be the beginning of a
5861 nested-name-specifier. On the second and subsequent times
5862 through the loop, we look for the `template' keyword. */
5863 if (success
&& token
->keyword
== RID_TEMPLATE
)
5865 /* A template-id can start a nested-name-specifier. */
5866 else if (token
->type
== CPP_TEMPLATE_ID
)
5868 /* DR 743: decltype can be used in a nested-name-specifier. */
5869 else if (token_is_decltype (token
))
5873 /* If the next token is not an identifier, then it is
5874 definitely not a type-name or namespace-name. */
5875 if (token
->type
!= CPP_NAME
)
5877 /* If the following token is neither a `<' (to begin a
5878 template-id), nor a `::', then we are not looking at a
5879 nested-name-specifier. */
5880 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
5882 if (token
->type
== CPP_COLON
5883 && parser
->colon_corrects_to_scope_p
5884 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_NAME
)
5886 error_at (token
->location
,
5887 "found %<:%> in nested-name-specifier, expected %<::%>");
5888 token
->type
= CPP_SCOPE
;
5891 if (token
->type
!= CPP_SCOPE
5892 && !cp_parser_nth_token_starts_template_argument_list_p
5897 /* The nested-name-specifier is optional, so we parse
5899 cp_parser_parse_tentatively (parser
);
5901 /* Look for the optional `template' keyword, if this isn't the
5902 first time through the loop. */
5904 template_keyword_p
= cp_parser_optional_template_keyword (parser
);
5906 template_keyword_p
= false;
5908 /* Save the old scope since the name lookup we are about to do
5909 might destroy it. */
5910 old_scope
= parser
->scope
;
5911 saved_qualifying_scope
= parser
->qualifying_scope
;
5912 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5913 look up names in "X<T>::I" in order to determine that "Y" is
5914 a template. So, if we have a typename at this point, we make
5915 an effort to look through it. */
5917 && !typename_keyword_p
5919 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
5920 parser
->scope
= resolve_typename_type (parser
->scope
,
5921 /*only_current_p=*/false);
5922 /* Parse the qualifying entity. */
5924 = cp_parser_qualifying_entity (parser
,
5930 /* Look for the `::' token. */
5931 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
5933 /* If we found what we wanted, we keep going; otherwise, we're
5935 if (!cp_parser_parse_definitely (parser
))
5937 bool error_p
= false;
5939 /* Restore the OLD_SCOPE since it was valid before the
5940 failed attempt at finding the last
5941 class-or-namespace-name. */
5942 parser
->scope
= old_scope
;
5943 parser
->qualifying_scope
= saved_qualifying_scope
;
5945 /* If the next token is a decltype, and the one after that is a
5946 `::', then the decltype has failed to resolve to a class or
5947 enumeration type. Give this error even when parsing
5948 tentatively since it can't possibly be valid--and we're going
5949 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5950 won't get another chance.*/
5951 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DECLTYPE
)
5952 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
5955 token
= cp_lexer_consume_token (parser
->lexer
);
5956 error_at (token
->location
, "decltype evaluates to %qT, "
5957 "which is not a class or enumeration type",
5958 token
->u
.tree_check_value
->value
);
5959 parser
->scope
= error_mark_node
;
5963 cp_lexer_consume_token (parser
->lexer
);
5966 if (cp_lexer_next_token_is (parser
->lexer
, CPP_TEMPLATE_ID
)
5967 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_SCOPE
))
5969 /* If we have a non-type template-id followed by ::, it can't
5970 possibly be valid. */
5971 token
= cp_lexer_peek_token (parser
->lexer
);
5972 tree tid
= token
->u
.tree_check_value
->value
;
5973 if (TREE_CODE (tid
) == TEMPLATE_ID_EXPR
5974 && TREE_CODE (TREE_OPERAND (tid
, 0)) != IDENTIFIER_NODE
)
5976 tree tmpl
= NULL_TREE
;
5977 if (is_overloaded_fn (tid
))
5979 tree fns
= get_fns (tid
);
5980 if (!OVL_CHAIN (fns
))
5981 tmpl
= OVL_CURRENT (fns
);
5982 error_at (token
->location
, "function template-id %qD "
5983 "in nested-name-specifier", tid
);
5987 /* Variable template. */
5988 tmpl
= TREE_OPERAND (tid
, 0);
5989 gcc_assert (variable_template_p (tmpl
));
5990 error_at (token
->location
, "variable template-id %qD "
5991 "in nested-name-specifier", tid
);
5994 inform (DECL_SOURCE_LOCATION (tmpl
),
5995 "%qD declared here", tmpl
);
5997 parser
->scope
= error_mark_node
;
6001 cp_lexer_consume_token (parser
->lexer
);
6002 cp_lexer_consume_token (parser
->lexer
);
6006 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
6008 /* If the next token is an identifier, and the one after
6009 that is a `::', then any valid interpretation would have
6010 found a class-or-namespace-name. */
6011 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
6012 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
6014 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
6017 token
= cp_lexer_consume_token (parser
->lexer
);
6020 if (!token
->error_reported
)
6023 tree ambiguous_decls
;
6025 decl
= cp_parser_lookup_name (parser
, token
->u
.value
,
6027 /*is_template=*/false,
6028 /*is_namespace=*/false,
6029 /*check_dependency=*/true,
6032 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
6033 error_at (token
->location
,
6034 "%qD used without template parameters",
6036 else if (ambiguous_decls
)
6038 // cp_parser_lookup_name has the same diagnostic,
6039 // thus make sure to emit it at most once.
6040 if (cp_parser_uncommitted_to_tentative_parse_p
6043 error_at (token
->location
,
6044 "reference to %qD is ambiguous",
6046 print_candidates (ambiguous_decls
);
6048 decl
= error_mark_node
;
6052 if (cxx_dialect
!= cxx98
)
6053 cp_parser_name_lookup_error
6054 (parser
, token
->u
.value
, decl
, NLE_NOT_CXX98
,
6057 cp_parser_name_lookup_error
6058 (parser
, token
->u
.value
, decl
, NLE_CXX98
,
6062 parser
->scope
= error_mark_node
;
6064 /* Treat this as a successful nested-name-specifier
6069 If the name found is not a class-name (clause
6070 _class_) or namespace-name (_namespace.def_), the
6071 program is ill-formed. */
6074 cp_lexer_consume_token (parser
->lexer
);
6078 /* We've found one valid nested-name-specifier. */
6080 /* Name lookup always gives us a DECL. */
6081 if (TREE_CODE (new_scope
) == TYPE_DECL
)
6082 new_scope
= TREE_TYPE (new_scope
);
6083 /* Uses of "template" must be followed by actual templates. */
6084 if (template_keyword_p
6085 && !(CLASS_TYPE_P (new_scope
)
6086 && ((CLASSTYPE_USE_TEMPLATE (new_scope
)
6087 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope
)))
6088 || CLASSTYPE_IS_TEMPLATE (new_scope
)))
6089 && !(TREE_CODE (new_scope
) == TYPENAME_TYPE
6090 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope
))
6091 == TEMPLATE_ID_EXPR
)))
6092 permerror (input_location
, TYPE_P (new_scope
)
6093 ? G_("%qT is not a template")
6094 : G_("%qD is not a template"),
6096 /* If it is a class scope, try to complete it; we are about to
6097 be looking up names inside the class. */
6098 if (TYPE_P (new_scope
)
6099 /* Since checking types for dependency can be expensive,
6100 avoid doing it if the type is already complete. */
6101 && !COMPLETE_TYPE_P (new_scope
)
6102 /* Do not try to complete dependent types. */
6103 && !dependent_type_p (new_scope
))
6105 new_scope
= complete_type (new_scope
);
6106 /* If it is a typedef to current class, use the current
6107 class instead, as the typedef won't have any names inside
6109 if (!COMPLETE_TYPE_P (new_scope
)
6110 && currently_open_class (new_scope
))
6111 new_scope
= TYPE_MAIN_VARIANT (new_scope
);
6113 /* Make sure we look in the right scope the next time through
6115 parser
->scope
= new_scope
;
6118 /* If parsing tentatively, replace the sequence of tokens that makes
6119 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6120 token. That way, should we re-parse the token stream, we will
6121 not have to repeat the effort required to do the parse, nor will
6122 we issue duplicate error messages. */
6123 if (success
&& start
)
6127 token
= cp_lexer_token_at (parser
->lexer
, start
);
6128 /* Reset the contents of the START token. */
6129 token
->type
= CPP_NESTED_NAME_SPECIFIER
;
6130 /* Retrieve any deferred checks. Do not pop this access checks yet
6131 so the memory will not be reclaimed during token replacing below. */
6132 token
->u
.tree_check_value
= ggc_cleared_alloc
<struct tree_check
> ();
6133 token
->u
.tree_check_value
->value
= parser
->scope
;
6134 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
6135 token
->u
.tree_check_value
->qualifying_scope
=
6136 parser
->qualifying_scope
;
6137 token
->keyword
= RID_MAX
;
6139 /* Purge all subsequent tokens. */
6140 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
6144 pop_to_parent_deferring_access_checks ();
6146 return success
? parser
->scope
: NULL_TREE
;
6149 /* Parse a nested-name-specifier. See
6150 cp_parser_nested_name_specifier_opt for details. This function
6151 behaves identically, except that it will an issue an error if no
6152 nested-name-specifier is present. */
6155 cp_parser_nested_name_specifier (cp_parser
*parser
,
6156 bool typename_keyword_p
,
6157 bool check_dependency_p
,
6159 bool is_declaration
)
6163 /* Look for the nested-name-specifier. */
6164 scope
= cp_parser_nested_name_specifier_opt (parser
,
6169 /* If it was not present, issue an error message. */
6172 cp_parser_error (parser
, "expected nested-name-specifier");
6173 parser
->scope
= NULL_TREE
;
6179 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6180 this is either a class-name or a namespace-name (which corresponds
6181 to the class-or-namespace-name production in the grammar). For
6182 C++0x, it can also be a type-name that refers to an enumeration
6183 type or a simple-template-id.
6185 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6186 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6187 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6188 TYPE_P is TRUE iff the next name should be taken as a class-name,
6189 even the same name is declared to be another entity in the same
6192 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6193 specified by the class-or-namespace-name. If neither is found the
6194 ERROR_MARK_NODE is returned. */
6197 cp_parser_qualifying_entity (cp_parser
*parser
,
6198 bool typename_keyword_p
,
6199 bool template_keyword_p
,
6200 bool check_dependency_p
,
6202 bool is_declaration
)
6205 tree saved_qualifying_scope
;
6206 tree saved_object_scope
;
6209 bool successful_parse_p
;
6211 /* DR 743: decltype can appear in a nested-name-specifier. */
6212 if (cp_lexer_next_token_is_decltype (parser
->lexer
))
6214 scope
= cp_parser_decltype (parser
);
6215 if (TREE_CODE (scope
) != ENUMERAL_TYPE
6216 && !MAYBE_CLASS_TYPE_P (scope
))
6218 cp_parser_simulate_error (parser
);
6219 return error_mark_node
;
6221 if (TYPE_NAME (scope
))
6222 scope
= TYPE_NAME (scope
);
6226 /* Before we try to parse the class-name, we must save away the
6227 current PARSER->SCOPE since cp_parser_class_name will destroy
6229 saved_scope
= parser
->scope
;
6230 saved_qualifying_scope
= parser
->qualifying_scope
;
6231 saved_object_scope
= parser
->object_scope
;
6232 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6233 there is no need to look for a namespace-name. */
6234 only_class_p
= template_keyword_p
6235 || (saved_scope
&& TYPE_P (saved_scope
) && cxx_dialect
== cxx98
);
6237 cp_parser_parse_tentatively (parser
);
6238 scope
= cp_parser_class_name (parser
,
6241 type_p
? class_type
: none_type
,
6243 /*class_head_p=*/false,
6245 /*enum_ok=*/cxx_dialect
> cxx98
);
6246 successful_parse_p
= only_class_p
|| cp_parser_parse_definitely (parser
);
6247 /* If that didn't work, try for a namespace-name. */
6248 if (!only_class_p
&& !successful_parse_p
)
6250 /* Restore the saved scope. */
6251 parser
->scope
= saved_scope
;
6252 parser
->qualifying_scope
= saved_qualifying_scope
;
6253 parser
->object_scope
= saved_object_scope
;
6254 /* If we are not looking at an identifier followed by the scope
6255 resolution operator, then this is not part of a
6256 nested-name-specifier. (Note that this function is only used
6257 to parse the components of a nested-name-specifier.) */
6258 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
)
6259 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
6260 return error_mark_node
;
6261 scope
= cp_parser_namespace_name (parser
);
6267 /* Return true if we are looking at a compound-literal, false otherwise. */
6270 cp_parser_compound_literal_p (cp_parser
*parser
)
6272 /* Consume the `('. */
6273 cp_lexer_consume_token (parser
->lexer
);
6275 cp_lexer_save_tokens (parser
->lexer
);
6277 /* Skip tokens until the next token is a closing parenthesis.
6278 If we find the closing `)', and the next token is a `{', then
6279 we are looking at a compound-literal. */
6280 bool compound_literal_p
6281 = (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
6282 /*consume_paren=*/true)
6283 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
));
6285 /* Roll back the tokens we skipped. */
6286 cp_lexer_rollback_tokens (parser
->lexer
);
6288 return compound_literal_p
;
6291 /* Parse a postfix-expression.
6295 postfix-expression [ expression ]
6296 postfix-expression ( expression-list [opt] )
6297 simple-type-specifier ( expression-list [opt] )
6298 typename :: [opt] nested-name-specifier identifier
6299 ( expression-list [opt] )
6300 typename :: [opt] nested-name-specifier template [opt] template-id
6301 ( expression-list [opt] )
6302 postfix-expression . template [opt] id-expression
6303 postfix-expression -> template [opt] id-expression
6304 postfix-expression . pseudo-destructor-name
6305 postfix-expression -> pseudo-destructor-name
6306 postfix-expression ++
6307 postfix-expression --
6308 dynamic_cast < type-id > ( expression )
6309 static_cast < type-id > ( expression )
6310 reinterpret_cast < type-id > ( expression )
6311 const_cast < type-id > ( expression )
6312 typeid ( expression )
6318 ( type-id ) { initializer-list , [opt] }
6320 This extension is a GNU version of the C99 compound-literal
6321 construct. (The C99 grammar uses `type-name' instead of `type-id',
6322 but they are essentially the same concept.)
6324 If ADDRESS_P is true, the postfix expression is the operand of the
6325 `&' operator. CAST_P is true if this expression is the target of a
6328 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6329 class member access expressions [expr.ref].
6331 Returns a representation of the expression. */
6334 cp_parser_postfix_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
6335 bool member_access_only_p
, bool decltype_p
,
6336 cp_id_kind
* pidk_return
)
6341 cp_id_kind idk
= CP_ID_KIND_NONE
;
6342 cp_expr postfix_expression
= NULL_TREE
;
6343 bool is_member_access
= false;
6344 int saved_in_statement
= -1;
6346 /* Peek at the next token. */
6347 token
= cp_lexer_peek_token (parser
->lexer
);
6348 loc
= token
->location
;
6349 location_t start_loc
= get_range_from_loc (line_table
, loc
).m_start
;
6351 /* Some of the productions are determined by keywords. */
6352 keyword
= token
->keyword
;
6362 const char *saved_message
;
6363 bool saved_in_type_id_in_expr_p
;
6365 /* All of these can be handled in the same way from the point
6366 of view of parsing. Begin by consuming the token
6367 identifying the cast. */
6368 cp_lexer_consume_token (parser
->lexer
);
6370 /* New types cannot be defined in the cast. */
6371 saved_message
= parser
->type_definition_forbidden_message
;
6372 parser
->type_definition_forbidden_message
6373 = G_("types may not be defined in casts");
6375 /* Look for the opening `<'. */
6376 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
6377 /* Parse the type to which we are casting. */
6378 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6379 parser
->in_type_id_in_expr_p
= true;
6380 type
= cp_parser_type_id (parser
);
6381 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6382 /* Look for the closing `>'. */
6383 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
6384 /* Restore the old message. */
6385 parser
->type_definition_forbidden_message
= saved_message
;
6387 bool saved_greater_than_is_operator_p
6388 = parser
->greater_than_is_operator_p
;
6389 parser
->greater_than_is_operator_p
= true;
6391 /* And the expression which is being cast. */
6392 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
6393 expression
= cp_parser_expression (parser
, & idk
, /*cast_p=*/true);
6394 cp_token
*close_paren
= cp_parser_require (parser
, CPP_CLOSE_PAREN
,
6396 location_t end_loc
= close_paren
?
6397 close_paren
->location
: UNKNOWN_LOCATION
;
6399 parser
->greater_than_is_operator_p
6400 = saved_greater_than_is_operator_p
;
6402 /* Only type conversions to integral or enumeration types
6403 can be used in constant-expressions. */
6404 if (!cast_valid_in_integral_constant_expression_p (type
)
6405 && cp_parser_non_integral_constant_expression (parser
, NIC_CAST
))
6406 return error_mark_node
;
6412 = build_dynamic_cast (type
, expression
, tf_warning_or_error
);
6416 = build_static_cast (type
, expression
, tf_warning_or_error
);
6420 = build_reinterpret_cast (type
, expression
,
6421 tf_warning_or_error
);
6425 = build_const_cast (type
, expression
, tf_warning_or_error
);
6431 /* Construct a location e.g. :
6432 reinterpret_cast <int *> (expr)
6433 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6434 ranging from the start of the "*_cast" token to the final closing
6435 paren, with the caret at the start. */
6436 location_t cp_cast_loc
= make_location (start_loc
, start_loc
, end_loc
);
6437 postfix_expression
.set_location (cp_cast_loc
);
6444 const char *saved_message
;
6445 bool saved_in_type_id_in_expr_p
;
6447 /* Consume the `typeid' token. */
6448 cp_lexer_consume_token (parser
->lexer
);
6449 /* Look for the `(' token. */
6450 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
6451 /* Types cannot be defined in a `typeid' expression. */
6452 saved_message
= parser
->type_definition_forbidden_message
;
6453 parser
->type_definition_forbidden_message
6454 = G_("types may not be defined in a %<typeid%> expression");
6455 /* We can't be sure yet whether we're looking at a type-id or an
6457 cp_parser_parse_tentatively (parser
);
6458 /* Try a type-id first. */
6459 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6460 parser
->in_type_id_in_expr_p
= true;
6461 type
= cp_parser_type_id (parser
);
6462 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6463 /* Look for the `)' token. Otherwise, we can't be sure that
6464 we're not looking at an expression: consider `typeid (int
6465 (3))', for example. */
6466 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6467 /* If all went well, simply lookup the type-id. */
6468 if (cp_parser_parse_definitely (parser
))
6469 postfix_expression
= get_typeid (type
, tf_warning_or_error
);
6470 /* Otherwise, fall back to the expression variant. */
6475 /* Look for an expression. */
6476 expression
= cp_parser_expression (parser
, & idk
);
6477 /* Compute its typeid. */
6478 postfix_expression
= build_typeid (expression
, tf_warning_or_error
);
6479 /* Look for the `)' token. */
6480 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6482 /* Restore the saved message. */
6483 parser
->type_definition_forbidden_message
= saved_message
;
6484 /* `typeid' may not appear in an integral constant expression. */
6485 if (cp_parser_non_integral_constant_expression (parser
, NIC_TYPEID
))
6486 return error_mark_node
;
6493 /* The syntax permitted here is the same permitted for an
6494 elaborated-type-specifier. */
6495 ++parser
->prevent_constrained_type_specifiers
;
6496 type
= cp_parser_elaborated_type_specifier (parser
,
6497 /*is_friend=*/false,
6498 /*is_declaration=*/false);
6499 --parser
->prevent_constrained_type_specifiers
;
6500 postfix_expression
= cp_parser_functional_cast (parser
, type
);
6504 case RID_CILK_SPAWN
:
6506 location_t cilk_spawn_loc
6507 = cp_lexer_peek_token (parser
->lexer
)->location
;
6508 cp_lexer_consume_token (parser
->lexer
);
6509 token
= cp_lexer_peek_token (parser
->lexer
);
6510 if (token
->type
== CPP_SEMICOLON
)
6512 error_at (token
->location
, "%<_Cilk_spawn%> must be followed by "
6514 postfix_expression
= error_mark_node
;
6517 else if (!current_function_decl
)
6519 error_at (token
->location
, "%<_Cilk_spawn%> may only be used "
6520 "inside a function");
6521 postfix_expression
= error_mark_node
;
6526 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6527 saved_in_statement
= parser
->in_statement
;
6528 parser
->in_statement
|= IN_CILK_SPAWN
;
6530 cfun
->calls_cilk_spawn
= 1;
6531 postfix_expression
=
6532 cp_parser_postfix_expression (parser
, false, false,
6533 false, false, &idk
);
6536 error_at (token
->location
, "-fcilkplus must be enabled to use"
6537 " %<_Cilk_spawn%>");
6538 cfun
->calls_cilk_spawn
= 0;
6540 else if (saved_in_statement
& IN_CILK_SPAWN
)
6542 error_at (token
->location
, "consecutive %<_Cilk_spawn%> keywords "
6543 "are not permitted");
6544 postfix_expression
= error_mark_node
;
6545 cfun
->calls_cilk_spawn
= 0;
6549 location_t loc
= postfix_expression
.get_location ();
6550 postfix_expression
= build_cilk_spawn (token
->location
,
6551 postfix_expression
);
6552 /* Build a location of the form:
6555 with caret at the expr, ranging from the start of the
6556 _Cilk_spawn token to the end of the expression. */
6557 location_t combined_loc
=
6558 make_location (loc
, cilk_spawn_loc
, get_finish (loc
));
6559 postfix_expression
.set_location (combined_loc
);
6560 if (postfix_expression
!= error_mark_node
)
6561 SET_EXPR_LOCATION (postfix_expression
, input_location
);
6562 parser
->in_statement
= parser
->in_statement
& ~IN_CILK_SPAWN
;
6567 case RID_BUILTIN_SHUFFLE
:
6569 vec
<tree
, va_gc
> *vec
;
6573 cp_lexer_consume_token (parser
->lexer
);
6574 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
6575 /*cast_p=*/false, /*allow_expansion_p=*/true,
6576 /*non_constant_p=*/NULL
);
6578 return error_mark_node
;
6580 FOR_EACH_VEC_ELT (*vec
, i
, p
)
6583 if (vec
->length () == 2)
6584 return build_x_vec_perm_expr (loc
, (*vec
)[0], NULL_TREE
, (*vec
)[1],
6585 tf_warning_or_error
);
6586 else if (vec
->length () == 3)
6587 return build_x_vec_perm_expr (loc
, (*vec
)[0], (*vec
)[1], (*vec
)[2],
6588 tf_warning_or_error
);
6591 error_at (loc
, "wrong number of arguments to "
6592 "%<__builtin_shuffle%>");
6593 return error_mark_node
;
6602 /* If the next thing is a simple-type-specifier, we may be
6603 looking at a functional cast. We could also be looking at
6604 an id-expression. So, we try the functional cast, and if
6605 that doesn't work we fall back to the primary-expression. */
6606 cp_parser_parse_tentatively (parser
);
6607 /* Look for the simple-type-specifier. */
6608 ++parser
->prevent_constrained_type_specifiers
;
6609 type
= cp_parser_simple_type_specifier (parser
,
6610 /*decl_specs=*/NULL
,
6611 CP_PARSER_FLAGS_NONE
);
6612 --parser
->prevent_constrained_type_specifiers
;
6613 /* Parse the cast itself. */
6614 if (!cp_parser_error_occurred (parser
))
6616 = cp_parser_functional_cast (parser
, type
);
6617 /* If that worked, we're done. */
6618 if (cp_parser_parse_definitely (parser
))
6621 /* If the functional-cast didn't work out, try a
6622 compound-literal. */
6623 if (cp_parser_allow_gnu_extensions_p (parser
)
6624 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
6626 cp_expr initializer
= NULL_TREE
;
6628 cp_parser_parse_tentatively (parser
);
6630 /* Avoid calling cp_parser_type_id pointlessly, see comment
6631 in cp_parser_cast_expression about c++/29234. */
6632 if (!cp_parser_compound_literal_p (parser
))
6633 cp_parser_simulate_error (parser
);
6636 /* Parse the type. */
6637 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6638 parser
->in_type_id_in_expr_p
= true;
6639 type
= cp_parser_type_id (parser
);
6640 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6641 /* Look for the `)'. */
6642 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6645 /* If things aren't going well, there's no need to
6647 if (!cp_parser_error_occurred (parser
))
6649 bool non_constant_p
;
6650 /* Parse the brace-enclosed initializer list. */
6651 initializer
= cp_parser_braced_list (parser
,
6654 /* If that worked, we're definitely looking at a
6655 compound-literal expression. */
6656 if (cp_parser_parse_definitely (parser
))
6658 /* Warn the user that a compound literal is not
6659 allowed in standard C++. */
6660 pedwarn (input_location
, OPT_Wpedantic
,
6661 "ISO C++ forbids compound-literals");
6662 /* For simplicity, we disallow compound literals in
6663 constant-expressions. We could
6664 allow compound literals of integer type, whose
6665 initializer was a constant, in constant
6666 expressions. Permitting that usage, as a further
6667 extension, would not change the meaning of any
6668 currently accepted programs. (Of course, as
6669 compound literals are not part of ISO C++, the
6670 standard has nothing to say.) */
6671 if (cp_parser_non_integral_constant_expression (parser
,
6674 postfix_expression
= error_mark_node
;
6677 /* Form the representation of the compound-literal. */
6679 = finish_compound_literal (type
, initializer
,
6680 tf_warning_or_error
);
6681 postfix_expression
.set_location (initializer
.get_location ());
6686 /* It must be a primary-expression. */
6688 = cp_parser_primary_expression (parser
, address_p
, cast_p
,
6689 /*template_arg_p=*/false,
6696 /* Note that we don't need to worry about calling build_cplus_new on a
6697 class-valued CALL_EXPR in decltype when it isn't the end of the
6698 postfix-expression; unary_complex_lvalue will take care of that for
6701 /* Keep looping until the postfix-expression is complete. */
6704 if (idk
== CP_ID_KIND_UNQUALIFIED
6705 && identifier_p (postfix_expression
)
6706 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
6707 /* It is not a Koenig lookup function call. */
6709 = unqualified_name_lookup_error (postfix_expression
);
6711 /* Peek at the next token. */
6712 token
= cp_lexer_peek_token (parser
->lexer
);
6714 switch (token
->type
)
6716 case CPP_OPEN_SQUARE
:
6717 if (cp_next_tokens_can_be_std_attribute_p (parser
))
6719 cp_parser_error (parser
,
6720 "two consecutive %<[%> shall "
6721 "only introduce an attribute");
6722 return error_mark_node
;
6725 = cp_parser_postfix_open_square_expression (parser
,
6729 postfix_expression
.set_range (start_loc
,
6730 postfix_expression
.get_location ());
6732 idk
= CP_ID_KIND_NONE
;
6733 is_member_access
= false;
6736 case CPP_OPEN_PAREN
:
6737 /* postfix-expression ( expression-list [opt] ) */
6740 bool is_builtin_constant_p
;
6741 bool saved_integral_constant_expression_p
= false;
6742 bool saved_non_integral_constant_expression_p
= false;
6743 tsubst_flags_t complain
= complain_flags (decltype_p
);
6744 vec
<tree
, va_gc
> *args
;
6745 location_t close_paren_loc
= UNKNOWN_LOCATION
;
6747 is_member_access
= false;
6749 is_builtin_constant_p
6750 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression
);
6751 if (is_builtin_constant_p
)
6753 /* The whole point of __builtin_constant_p is to allow
6754 non-constant expressions to appear as arguments. */
6755 saved_integral_constant_expression_p
6756 = parser
->integral_constant_expression_p
;
6757 saved_non_integral_constant_expression_p
6758 = parser
->non_integral_constant_expression_p
;
6759 parser
->integral_constant_expression_p
= false;
6761 args
= (cp_parser_parenthesized_expression_list
6763 /*cast_p=*/false, /*allow_expansion_p=*/true,
6764 /*non_constant_p=*/NULL
,
6765 /*close_paren_loc=*/&close_paren_loc
));
6766 if (is_builtin_constant_p
)
6768 parser
->integral_constant_expression_p
6769 = saved_integral_constant_expression_p
;
6770 parser
->non_integral_constant_expression_p
6771 = saved_non_integral_constant_expression_p
;
6776 postfix_expression
= error_mark_node
;
6780 /* Function calls are not permitted in
6781 constant-expressions. */
6782 if (! builtin_valid_in_constant_expr_p (postfix_expression
)
6783 && cp_parser_non_integral_constant_expression (parser
,
6786 postfix_expression
= error_mark_node
;
6787 release_tree_vector (args
);
6792 if (idk
== CP_ID_KIND_UNQUALIFIED
6793 || idk
== CP_ID_KIND_TEMPLATE_ID
)
6795 if (identifier_p (postfix_expression
))
6797 if (!args
->is_empty ())
6800 if (!any_type_dependent_arguments_p (args
))
6802 = perform_koenig_lookup (postfix_expression
, args
,
6807 = unqualified_fn_lookup_error (postfix_expression
);
6809 /* We do not perform argument-dependent lookup if
6810 normal lookup finds a non-function, in accordance
6811 with the expected resolution of DR 218. */
6812 else if (!args
->is_empty ()
6813 && is_overloaded_fn (postfix_expression
))
6815 tree fn
= get_first_fn (postfix_expression
);
6816 fn
= STRIP_TEMPLATE (fn
);
6818 /* Do not do argument dependent lookup if regular
6819 lookup finds a member function or a block-scope
6820 function declaration. [basic.lookup.argdep]/3 */
6821 if (!DECL_FUNCTION_MEMBER_P (fn
)
6822 && !DECL_LOCAL_FUNCTION_P (fn
))
6825 if (!any_type_dependent_arguments_p (args
))
6827 = perform_koenig_lookup (postfix_expression
, args
,
6833 if (TREE_CODE (postfix_expression
) == FUNCTION_DECL
6834 && DECL_BUILT_IN_CLASS (postfix_expression
) == BUILT_IN_NORMAL
6835 && DECL_FUNCTION_CODE (postfix_expression
) == BUILT_IN_MEMSET
6836 && vec_safe_length (args
) == 3)
6838 tree arg0
= (*args
)[0];
6839 tree arg1
= (*args
)[1];
6840 tree arg2
= (*args
)[2];
6841 int literal_mask
= ((!!integer_zerop (arg1
) << 1)
6842 | (!!integer_zerop (arg2
) << 2));
6843 if (TREE_CODE (arg2
) == CONST_DECL
)
6844 arg2
= DECL_INITIAL (arg2
);
6845 warn_for_memset (input_location
, arg0
, arg2
, literal_mask
);
6848 if (TREE_CODE (postfix_expression
) == COMPONENT_REF
)
6850 tree instance
= TREE_OPERAND (postfix_expression
, 0);
6851 tree fn
= TREE_OPERAND (postfix_expression
, 1);
6853 if (processing_template_decl
6854 && (type_dependent_object_expression_p (instance
)
6855 || (!BASELINK_P (fn
)
6856 && TREE_CODE (fn
) != FIELD_DECL
)
6857 || type_dependent_expression_p (fn
)
6858 || any_type_dependent_arguments_p (args
)))
6861 = build_nt_call_vec (postfix_expression
, args
);
6862 release_tree_vector (args
);
6866 if (BASELINK_P (fn
))
6869 = (build_new_method_call
6870 (instance
, fn
, &args
, NULL_TREE
,
6871 (idk
== CP_ID_KIND_QUALIFIED
6872 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
6879 = finish_call_expr (postfix_expression
, &args
,
6880 /*disallow_virtual=*/false,
6884 else if (TREE_CODE (postfix_expression
) == OFFSET_REF
6885 || TREE_CODE (postfix_expression
) == MEMBER_REF
6886 || TREE_CODE (postfix_expression
) == DOTSTAR_EXPR
)
6887 postfix_expression
= (build_offset_ref_call_from_tree
6888 (postfix_expression
, &args
,
6890 else if (idk
== CP_ID_KIND_QUALIFIED
)
6891 /* A call to a static class member, or a namespace-scope
6894 = finish_call_expr (postfix_expression
, &args
,
6895 /*disallow_virtual=*/true,
6899 /* All other function calls. */
6901 = finish_call_expr (postfix_expression
, &args
,
6902 /*disallow_virtual=*/false,
6906 if (close_paren_loc
!= UNKNOWN_LOCATION
)
6908 location_t combined_loc
= make_location (token
->location
,
6911 postfix_expression
.set_location (combined_loc
);
6914 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6915 idk
= CP_ID_KIND_NONE
;
6917 release_tree_vector (args
);
6923 /* postfix-expression . template [opt] id-expression
6924 postfix-expression . pseudo-destructor-name
6925 postfix-expression -> template [opt] id-expression
6926 postfix-expression -> pseudo-destructor-name */
6928 /* Consume the `.' or `->' operator. */
6929 cp_lexer_consume_token (parser
->lexer
);
6932 = cp_parser_postfix_dot_deref_expression (parser
, token
->type
,
6936 is_member_access
= true;
6940 /* postfix-expression ++ */
6941 /* Consume the `++' token. */
6942 cp_lexer_consume_token (parser
->lexer
);
6943 /* Generate a representation for the complete expression. */
6945 = finish_increment_expr (postfix_expression
,
6946 POSTINCREMENT_EXPR
);
6947 /* Increments may not appear in constant-expressions. */
6948 if (cp_parser_non_integral_constant_expression (parser
, NIC_INC
))
6949 postfix_expression
= error_mark_node
;
6950 idk
= CP_ID_KIND_NONE
;
6951 is_member_access
= false;
6954 case CPP_MINUS_MINUS
:
6955 /* postfix-expression -- */
6956 /* Consume the `--' token. */
6957 cp_lexer_consume_token (parser
->lexer
);
6958 /* Generate a representation for the complete expression. */
6960 = finish_increment_expr (postfix_expression
,
6961 POSTDECREMENT_EXPR
);
6962 /* Decrements may not appear in constant-expressions. */
6963 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEC
))
6964 postfix_expression
= error_mark_node
;
6965 idk
= CP_ID_KIND_NONE
;
6966 is_member_access
= false;
6970 if (pidk_return
!= NULL
)
6971 * pidk_return
= idk
;
6972 if (member_access_only_p
)
6973 return is_member_access
6974 ? postfix_expression
6975 : cp_expr (error_mark_node
);
6977 return postfix_expression
;
6981 /* We should never get here. */
6983 return error_mark_node
;
6986 /* This function parses Cilk Plus array notations. If a normal array expr. is
6987 parsed then the array index is passed back to the caller through *INIT_INDEX
6988 and the function returns a NULL_TREE. If array notation expr. is parsed,
6989 then *INIT_INDEX is ignored by the caller and the function returns
6990 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6994 cp_parser_array_notation (location_t loc
, cp_parser
*parser
, tree
*init_index
,
6997 cp_token
*token
= NULL
;
6998 tree length_index
, stride
= NULL_TREE
, value_tree
, array_type
;
6999 if (!array_value
|| array_value
== error_mark_node
)
7001 cp_parser_skip_to_end_of_statement (parser
);
7002 return error_mark_node
;
7005 array_type
= TREE_TYPE (array_value
);
7007 bool saved_colon_corrects
= parser
->colon_corrects_to_scope_p
;
7008 parser
->colon_corrects_to_scope_p
= false;
7009 token
= cp_lexer_peek_token (parser
->lexer
);
7013 cp_parser_error (parser
, "expected %<:%> or numeral");
7014 return error_mark_node
;
7016 else if (token
->type
== CPP_COLON
)
7018 /* Consume the ':'. */
7019 cp_lexer_consume_token (parser
->lexer
);
7021 /* If we are here, then we have a case like this A[:]. */
7022 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_CLOSE_SQUARE
)
7024 cp_parser_error (parser
, "expected %<]%>");
7025 cp_parser_skip_to_end_of_statement (parser
);
7026 return error_mark_node
;
7028 *init_index
= NULL_TREE
;
7030 length_index
= NULL_TREE
;
7034 /* If we are here, then there are three valid possibilities:
7036 2. ARRAY [ EXP : EXP ]
7037 3. ARRAY [ EXP : EXP : EXP ] */
7039 *init_index
= cp_parser_expression (parser
);
7040 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
7042 /* This indicates that we have a normal array expression. */
7043 parser
->colon_corrects_to_scope_p
= saved_colon_corrects
;
7047 /* Consume the ':'. */
7048 cp_lexer_consume_token (parser
->lexer
);
7049 length_index
= cp_parser_expression (parser
);
7050 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_COLON
)
7052 cp_lexer_consume_token (parser
->lexer
);
7053 stride
= cp_parser_expression (parser
);
7056 parser
->colon_corrects_to_scope_p
= saved_colon_corrects
;
7058 if (*init_index
== error_mark_node
|| length_index
== error_mark_node
7059 || stride
== error_mark_node
|| array_type
== error_mark_node
)
7061 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_SQUARE
)
7062 cp_lexer_consume_token (parser
->lexer
);
7063 return error_mark_node
;
7065 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
7067 value_tree
= build_array_notation_ref (loc
, array_value
, *init_index
,
7068 length_index
, stride
, array_type
);
7072 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7073 by cp_parser_builtin_offsetof. We're looking for
7075 postfix-expression [ expression ]
7076 postfix-expression [ braced-init-list ] (C++11)
7078 FOR_OFFSETOF is set if we're being called in that context, which
7079 changes how we deal with integer constant expressions. */
7082 cp_parser_postfix_open_square_expression (cp_parser
*parser
,
7083 tree postfix_expression
,
7087 tree index
= NULL_TREE
;
7088 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
7089 bool saved_greater_than_is_operator_p
;
7091 /* Consume the `[' token. */
7092 cp_lexer_consume_token (parser
->lexer
);
7094 saved_greater_than_is_operator_p
= parser
->greater_than_is_operator_p
;
7095 parser
->greater_than_is_operator_p
= true;
7097 /* Parse the index expression. */
7098 /* ??? For offsetof, there is a question of what to allow here. If
7099 offsetof is not being used in an integral constant expression context,
7100 then we *could* get the right answer by computing the value at runtime.
7101 If we are in an integral constant expression context, then we might
7102 could accept any constant expression; hard to say without analysis.
7103 Rather than open the barn door too wide right away, allow only integer
7104 constant expressions here. */
7106 index
= cp_parser_constant_expression (parser
);
7109 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7111 bool expr_nonconst_p
;
7112 cp_lexer_set_source_position (parser
->lexer
);
7113 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
7114 index
= cp_parser_braced_list (parser
, &expr_nonconst_p
);
7116 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_COLON
)
7118 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
7119 "braced list index is not allowed with array "
7121 cp_parser_skip_to_end_of_statement (parser
);
7122 return error_mark_node
;
7125 else if (flag_cilkplus
)
7127 /* Here are have these two options:
7128 ARRAY[EXP : EXP] - Array notation expr with default
7130 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7132 tree an_exp
= cp_parser_array_notation (loc
, parser
, &index
,
7133 postfix_expression
);
7138 index
= cp_parser_expression (parser
);
7141 parser
->greater_than_is_operator_p
= saved_greater_than_is_operator_p
;
7143 /* Look for the closing `]'. */
7144 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
7146 /* Build the ARRAY_REF. */
7147 postfix_expression
= grok_array_decl (loc
, postfix_expression
,
7150 /* When not doing offsetof, array references are not permitted in
7151 constant-expressions. */
7153 && (cp_parser_non_integral_constant_expression (parser
, NIC_ARRAY_REF
)))
7154 postfix_expression
= error_mark_node
;
7156 return postfix_expression
;
7159 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7160 by cp_parser_builtin_offsetof. We're looking for
7162 postfix-expression . template [opt] id-expression
7163 postfix-expression . pseudo-destructor-name
7164 postfix-expression -> template [opt] id-expression
7165 postfix-expression -> pseudo-destructor-name
7167 FOR_OFFSETOF is set if we're being called in that context. That sorta
7168 limits what of the above we'll actually accept, but nevermind.
7169 TOKEN_TYPE is the "." or "->" token, which will already have been
7170 removed from the stream. */
7173 cp_parser_postfix_dot_deref_expression (cp_parser
*parser
,
7174 enum cpp_ttype token_type
,
7175 cp_expr postfix_expression
,
7176 bool for_offsetof
, cp_id_kind
*idk
,
7177 location_t location
)
7181 bool pseudo_destructor_p
;
7182 tree scope
= NULL_TREE
;
7183 location_t start_loc
= postfix_expression
.get_start ();
7185 /* If this is a `->' operator, dereference the pointer. */
7186 if (token_type
== CPP_DEREF
)
7187 postfix_expression
= build_x_arrow (location
, postfix_expression
,
7188 tf_warning_or_error
);
7189 /* Check to see whether or not the expression is type-dependent and
7190 not the current instantiation. */
7191 dependent_p
= type_dependent_object_expression_p (postfix_expression
);
7192 /* The identifier following the `->' or `.' is not qualified. */
7193 parser
->scope
= NULL_TREE
;
7194 parser
->qualifying_scope
= NULL_TREE
;
7195 parser
->object_scope
= NULL_TREE
;
7196 *idk
= CP_ID_KIND_NONE
;
7198 /* Enter the scope corresponding to the type of the object
7199 given by the POSTFIX_EXPRESSION. */
7200 if (!dependent_p
&& TREE_TYPE (postfix_expression
) != NULL_TREE
)
7202 scope
= TREE_TYPE (postfix_expression
);
7203 /* According to the standard, no expression should ever have
7204 reference type. Unfortunately, we do not currently match
7205 the standard in this respect in that our internal representation
7206 of an expression may have reference type even when the standard
7207 says it does not. Therefore, we have to manually obtain the
7208 underlying type here. */
7209 scope
= non_reference (scope
);
7210 /* The type of the POSTFIX_EXPRESSION must be complete. */
7211 /* Unlike the object expression in other contexts, *this is not
7212 required to be of complete type for purposes of class member
7213 access (5.2.5) outside the member function body. */
7214 if (postfix_expression
!= current_class_ref
7215 && !(processing_template_decl
7216 && current_class_type
7217 && (same_type_ignoring_top_level_qualifiers_p
7218 (scope
, current_class_type
))))
7219 scope
= complete_type_or_else (scope
, postfix_expression
);
7220 /* Let the name lookup machinery know that we are processing a
7221 class member access expression. */
7222 parser
->context
->object_type
= scope
;
7223 /* If something went wrong, we want to be able to discern that case,
7224 as opposed to the case where there was no SCOPE due to the type
7225 of expression being dependent. */
7227 scope
= error_mark_node
;
7228 /* If the SCOPE was erroneous, make the various semantic analysis
7229 functions exit quickly -- and without issuing additional error
7231 if (scope
== error_mark_node
)
7232 postfix_expression
= error_mark_node
;
7235 /* Tell cp_parser_lookup_name that there was an object, even though it's
7237 parser
->context
->object_type
= unknown_type_node
;
7239 /* Assume this expression is not a pseudo-destructor access. */
7240 pseudo_destructor_p
= false;
7242 /* If the SCOPE is a scalar type, then, if this is a valid program,
7243 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7244 is type dependent, it can be pseudo-destructor-name or something else.
7245 Try to parse it as pseudo-destructor-name first. */
7246 if ((scope
&& SCALAR_TYPE_P (scope
)) || dependent_p
)
7251 cp_parser_parse_tentatively (parser
);
7252 /* Parse the pseudo-destructor-name. */
7254 cp_parser_pseudo_destructor_name (parser
, postfix_expression
,
7257 && (cp_parser_error_occurred (parser
)
7258 || !SCALAR_TYPE_P (type
)))
7259 cp_parser_abort_tentative_parse (parser
);
7260 else if (cp_parser_parse_definitely (parser
))
7262 pseudo_destructor_p
= true;
7264 = finish_pseudo_destructor_expr (postfix_expression
,
7269 if (!pseudo_destructor_p
)
7271 /* If the SCOPE is not a scalar type, we are looking at an
7272 ordinary class member access expression, rather than a
7273 pseudo-destructor-name. */
7275 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
7276 /* Parse the id-expression. */
7277 name
= (cp_parser_id_expression
7279 cp_parser_optional_template_keyword (parser
),
7280 /*check_dependency_p=*/true,
7282 /*declarator_p=*/false,
7283 /*optional_p=*/false));
7284 /* In general, build a SCOPE_REF if the member name is qualified.
7285 However, if the name was not dependent and has already been
7286 resolved; there is no need to build the SCOPE_REF. For example;
7288 struct X { void f(); };
7289 template <typename T> void f(T* t) { t->X::f(); }
7291 Even though "t" is dependent, "X::f" is not and has been resolved
7292 to a BASELINK; there is no need to include scope information. */
7294 /* But we do need to remember that there was an explicit scope for
7295 virtual function calls. */
7297 *idk
= CP_ID_KIND_QUALIFIED
;
7299 /* If the name is a template-id that names a type, we will get a
7300 TYPE_DECL here. That is invalid code. */
7301 if (TREE_CODE (name
) == TYPE_DECL
)
7303 error_at (token
->location
, "invalid use of %qD", name
);
7304 postfix_expression
= error_mark_node
;
7308 if (name
!= error_mark_node
&& !BASELINK_P (name
) && parser
->scope
)
7310 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
7312 error_at (token
->location
, "%<%D::%D%> is not a class member",
7313 parser
->scope
, name
);
7314 postfix_expression
= error_mark_node
;
7317 name
= build_qualified_name (/*type=*/NULL_TREE
,
7321 parser
->scope
= NULL_TREE
;
7322 parser
->qualifying_scope
= NULL_TREE
;
7323 parser
->object_scope
= NULL_TREE
;
7325 if (parser
->scope
&& name
&& BASELINK_P (name
))
7326 adjust_result_of_qualified_name_lookup
7327 (name
, parser
->scope
, scope
);
7329 = finish_class_member_access_expr (postfix_expression
, name
,
7331 tf_warning_or_error
);
7332 /* Build a location e.g.:
7335 where the caret is at the deref token, ranging from
7336 the start of postfix_expression to the end of the access expr. */
7338 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
7339 location_t combined_loc
7340 = make_location (input_location
, start_loc
, end_loc
);
7341 protected_set_expr_location (postfix_expression
, combined_loc
);
7345 /* We no longer need to look up names in the scope of the object on
7346 the left-hand side of the `.' or `->' operator. */
7347 parser
->context
->object_type
= NULL_TREE
;
7349 /* Outside of offsetof, these operators may not appear in
7350 constant-expressions. */
7352 && (cp_parser_non_integral_constant_expression
7353 (parser
, token_type
== CPP_DEREF
? NIC_ARROW
: NIC_POINT
)))
7354 postfix_expression
= error_mark_node
;
7356 return postfix_expression
;
7359 /* Parse a parenthesized expression-list.
7362 assignment-expression
7363 expression-list, assignment-expression
7368 identifier, expression-list
7370 CAST_P is true if this expression is the target of a cast.
7372 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7375 Returns a vector of trees. Each element is a representation of an
7376 assignment-expression. NULL is returned if the ( and or ) are
7377 missing. An empty, but allocated, vector is returned on no
7378 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7379 if we are parsing an attribute list for an attribute that wants a
7380 plain identifier argument, normal_attr for an attribute that wants
7381 an expression, or non_attr if we aren't parsing an attribute list. If
7382 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7383 not all of the expressions in the list were constant.
7384 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7385 will be written to with the location of the closing parenthesis. If
7386 an error occurs, it may or may not be written to. */
7388 static vec
<tree
, va_gc
> *
7389 cp_parser_parenthesized_expression_list (cp_parser
* parser
,
7390 int is_attribute_list
,
7392 bool allow_expansion_p
,
7393 bool *non_constant_p
,
7394 location_t
*close_paren_loc
)
7396 vec
<tree
, va_gc
> *expression_list
;
7397 bool fold_expr_p
= is_attribute_list
!= non_attr
;
7398 tree identifier
= NULL_TREE
;
7399 bool saved_greater_than_is_operator_p
;
7401 /* Assume all the expressions will be constant. */
7403 *non_constant_p
= false;
7405 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
7408 expression_list
= make_tree_vector ();
7410 /* Within a parenthesized expression, a `>' token is always
7411 the greater-than operator. */
7412 saved_greater_than_is_operator_p
7413 = parser
->greater_than_is_operator_p
;
7414 parser
->greater_than_is_operator_p
= true;
7416 /* Consume expressions until there are no more. */
7417 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
7422 /* At the beginning of attribute lists, check to see if the
7423 next token is an identifier. */
7424 if (is_attribute_list
== id_attr
7425 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_NAME
)
7429 /* Consume the identifier. */
7430 token
= cp_lexer_consume_token (parser
->lexer
);
7431 /* Save the identifier. */
7432 identifier
= token
->u
.value
;
7436 bool expr_non_constant_p
;
7438 /* Parse the next assignment-expression. */
7439 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7441 /* A braced-init-list. */
7442 cp_lexer_set_source_position (parser
->lexer
);
7443 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
7444 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
7445 if (non_constant_p
&& expr_non_constant_p
)
7446 *non_constant_p
= true;
7448 else if (non_constant_p
)
7450 expr
= (cp_parser_constant_expression
7451 (parser
, /*allow_non_constant_p=*/true,
7452 &expr_non_constant_p
));
7453 if (expr_non_constant_p
)
7454 *non_constant_p
= true;
7457 expr
= cp_parser_assignment_expression (parser
, /*pidk=*/NULL
,
7461 expr
= instantiate_non_dependent_expr (expr
);
7463 /* If we have an ellipsis, then this is an expression
7465 if (allow_expansion_p
7466 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
7468 /* Consume the `...'. */
7469 cp_lexer_consume_token (parser
->lexer
);
7471 /* Build the argument pack. */
7472 expr
= make_pack_expansion (expr
);
7475 /* Add it to the list. We add error_mark_node
7476 expressions to the list, so that we can still tell if
7477 the correct form for a parenthesized expression-list
7478 is found. That gives better errors. */
7479 vec_safe_push (expression_list
, expr
);
7481 if (expr
== error_mark_node
)
7485 /* After the first item, attribute lists look the same as
7486 expression lists. */
7487 is_attribute_list
= non_attr
;
7490 /* If the next token isn't a `,', then we are done. */
7491 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
7494 /* Otherwise, consume the `,' and keep going. */
7495 cp_lexer_consume_token (parser
->lexer
);
7498 if (close_paren_loc
)
7499 *close_paren_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
7501 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
7506 /* We try and resync to an unnested comma, as that will give the
7507 user better diagnostics. */
7508 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
7509 /*recovering=*/true,
7511 /*consume_paren=*/true);
7516 parser
->greater_than_is_operator_p
7517 = saved_greater_than_is_operator_p
;
7522 parser
->greater_than_is_operator_p
7523 = saved_greater_than_is_operator_p
;
7526 vec_safe_insert (expression_list
, 0, identifier
);
7528 return expression_list
;
7531 /* Parse a pseudo-destructor-name.
7533 pseudo-destructor-name:
7534 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7535 :: [opt] nested-name-specifier template template-id :: ~ type-name
7536 :: [opt] nested-name-specifier [opt] ~ type-name
7538 If either of the first two productions is used, sets *SCOPE to the
7539 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7540 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7541 or ERROR_MARK_NODE if the parse fails. */
7544 cp_parser_pseudo_destructor_name (cp_parser
* parser
,
7549 bool nested_name_specifier_p
;
7552 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMPL
)
7553 && cp_lexer_nth_token_is_keyword (parser
->lexer
, 2, RID_AUTO
)
7554 && !type_dependent_expression_p (object
))
7556 if (cxx_dialect
< cxx14
)
7557 pedwarn (input_location
, 0,
7558 "%<~auto%> only available with "
7559 "-std=c++14 or -std=gnu++14");
7560 cp_lexer_consume_token (parser
->lexer
);
7561 cp_lexer_consume_token (parser
->lexer
);
7563 *type
= TREE_TYPE (object
);
7567 /* Assume that things will not work out. */
7568 *type
= error_mark_node
;
7570 /* Look for the optional `::' operator. */
7571 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
7572 /* Look for the optional nested-name-specifier. */
7573 nested_name_specifier_p
7574 = (cp_parser_nested_name_specifier_opt (parser
,
7575 /*typename_keyword_p=*/false,
7576 /*check_dependency_p=*/true,
7578 /*is_declaration=*/false)
7580 /* Now, if we saw a nested-name-specifier, we might be doing the
7581 second production. */
7582 if (nested_name_specifier_p
7583 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
7585 /* Consume the `template' keyword. */
7586 cp_lexer_consume_token (parser
->lexer
);
7587 /* Parse the template-id. */
7588 cp_parser_template_id (parser
,
7589 /*template_keyword_p=*/true,
7590 /*check_dependency_p=*/false,
7592 /*is_declaration=*/true);
7593 /* Look for the `::' token. */
7594 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
7596 /* If the next token is not a `~', then there might be some
7597 additional qualification. */
7598 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMPL
))
7600 /* At this point, we're looking for "type-name :: ~". The type-name
7601 must not be a class-name, since this is a pseudo-destructor. So,
7602 it must be either an enum-name, or a typedef-name -- both of which
7603 are just identifiers. So, we peek ahead to check that the "::"
7604 and "~" tokens are present; if they are not, then we can avoid
7605 calling type_name. */
7606 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_NAME
7607 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
7608 || cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_COMPL
)
7610 cp_parser_error (parser
, "non-scalar type");
7614 /* Look for the type-name. */
7615 *scope
= TREE_TYPE (cp_parser_nonclass_name (parser
));
7616 if (*scope
== error_mark_node
)
7619 /* Look for the `::' token. */
7620 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
7625 /* Look for the `~'. */
7626 cp_parser_require (parser
, CPP_COMPL
, RT_COMPL
);
7628 /* Once we see the ~, this has to be a pseudo-destructor. */
7629 if (!processing_template_decl
&& !cp_parser_error_occurred (parser
))
7630 cp_parser_commit_to_topmost_tentative_parse (parser
);
7632 /* Look for the type-name again. We are not responsible for
7633 checking that it matches the first type-name. */
7634 *type
= TREE_TYPE (cp_parser_nonclass_name (parser
));
7637 /* Parse a unary-expression.
7643 unary-operator cast-expression
7644 sizeof unary-expression
7646 alignof ( type-id ) [C++0x]
7653 __extension__ cast-expression
7654 __alignof__ unary-expression
7655 __alignof__ ( type-id )
7656 alignof unary-expression [C++0x]
7657 __real__ cast-expression
7658 __imag__ cast-expression
7660 sizeof ( type-id ) { initializer-list , [opt] }
7661 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7662 __alignof__ ( type-id ) { initializer-list , [opt] }
7664 ADDRESS_P is true iff the unary-expression is appearing as the
7665 operand of the `&' operator. CAST_P is true if this expression is
7666 the target of a cast.
7668 Returns a representation of the expression. */
7671 cp_parser_unary_expression (cp_parser
*parser
, cp_id_kind
* pidk
,
7672 bool address_p
, bool cast_p
, bool decltype_p
)
7675 enum tree_code unary_operator
;
7677 /* Peek at the next token. */
7678 token
= cp_lexer_peek_token (parser
->lexer
);
7679 /* Some keywords give away the kind of expression. */
7680 if (token
->type
== CPP_KEYWORD
)
7682 enum rid keyword
= token
->keyword
;
7691 location_t first_loc
;
7693 op
= keyword
== RID_ALIGNOF
? ALIGNOF_EXPR
: SIZEOF_EXPR
;
7694 /* Consume the token. */
7695 cp_lexer_consume_token (parser
->lexer
);
7696 first_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
7697 /* Parse the operand. */
7698 operand
= cp_parser_sizeof_operand (parser
, keyword
);
7700 if (TYPE_P (operand
))
7701 ret
= cxx_sizeof_or_alignof_type (operand
, op
, true);
7704 /* ISO C++ defines alignof only with types, not with
7705 expressions. So pedwarn if alignof is used with a non-
7706 type expression. However, __alignof__ is ok. */
7707 if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "alignof"))
7708 pedwarn (token
->location
, OPT_Wpedantic
,
7709 "ISO C++ does not allow %<alignof%> "
7712 ret
= cxx_sizeof_or_alignof_expr (operand
, op
, true);
7714 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7715 SIZEOF_EXPR with the original operand. */
7716 if (op
== SIZEOF_EXPR
&& ret
!= error_mark_node
)
7718 if (TREE_CODE (ret
) != SIZEOF_EXPR
|| TYPE_P (operand
))
7720 if (!processing_template_decl
&& TYPE_P (operand
))
7722 ret
= build_min (SIZEOF_EXPR
, size_type_node
,
7723 build1 (NOP_EXPR
, operand
,
7725 SIZEOF_EXPR_TYPE_P (ret
) = 1;
7728 ret
= build_min (SIZEOF_EXPR
, size_type_node
, operand
);
7729 TREE_SIDE_EFFECTS (ret
) = 0;
7730 TREE_READONLY (ret
) = 1;
7732 SET_EXPR_LOCATION (ret
, first_loc
);
7738 return cp_parser_new_expression (parser
);
7741 return cp_parser_delete_expression (parser
);
7745 /* The saved value of the PEDANTIC flag. */
7749 /* Save away the PEDANTIC flag. */
7750 cp_parser_extension_opt (parser
, &saved_pedantic
);
7751 /* Parse the cast-expression. */
7752 expr
= cp_parser_simple_cast_expression (parser
);
7753 /* Restore the PEDANTIC flag. */
7754 pedantic
= saved_pedantic
;
7764 /* Consume the `__real__' or `__imag__' token. */
7765 cp_lexer_consume_token (parser
->lexer
);
7766 /* Parse the cast-expression. */
7767 expression
= cp_parser_simple_cast_expression (parser
);
7768 /* Create the complete representation. */
7769 return build_x_unary_op (token
->location
,
7770 (keyword
== RID_REALPART
7771 ? REALPART_EXPR
: IMAGPART_EXPR
),
7773 tf_warning_or_error
);
7777 case RID_TRANSACTION_ATOMIC
:
7778 case RID_TRANSACTION_RELAXED
:
7779 return cp_parser_transaction_expression (parser
, keyword
);
7784 const char *saved_message
;
7785 bool saved_integral_constant_expression_p
;
7786 bool saved_non_integral_constant_expression_p
;
7787 bool saved_greater_than_is_operator_p
;
7789 cp_lexer_consume_token (parser
->lexer
);
7790 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
7792 saved_message
= parser
->type_definition_forbidden_message
;
7793 parser
->type_definition_forbidden_message
7794 = G_("types may not be defined in %<noexcept%> expressions");
7796 saved_integral_constant_expression_p
7797 = parser
->integral_constant_expression_p
;
7798 saved_non_integral_constant_expression_p
7799 = parser
->non_integral_constant_expression_p
;
7800 parser
->integral_constant_expression_p
= false;
7802 saved_greater_than_is_operator_p
7803 = parser
->greater_than_is_operator_p
;
7804 parser
->greater_than_is_operator_p
= true;
7806 ++cp_unevaluated_operand
;
7807 ++c_inhibit_evaluation_warnings
;
7808 ++cp_noexcept_operand
;
7809 expr
= cp_parser_expression (parser
);
7810 --cp_noexcept_operand
;
7811 --c_inhibit_evaluation_warnings
;
7812 --cp_unevaluated_operand
;
7814 parser
->greater_than_is_operator_p
7815 = saved_greater_than_is_operator_p
;
7817 parser
->integral_constant_expression_p
7818 = saved_integral_constant_expression_p
;
7819 parser
->non_integral_constant_expression_p
7820 = saved_non_integral_constant_expression_p
;
7822 parser
->type_definition_forbidden_message
= saved_message
;
7824 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7825 return finish_noexcept_expr (expr
, tf_warning_or_error
);
7833 /* Look for the `:: new' and `:: delete', which also signal the
7834 beginning of a new-expression, or delete-expression,
7835 respectively. If the next token is `::', then it might be one of
7837 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
7841 /* See if the token after the `::' is one of the keywords in
7842 which we're interested. */
7843 keyword
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->keyword
;
7844 /* If it's `new', we have a new-expression. */
7845 if (keyword
== RID_NEW
)
7846 return cp_parser_new_expression (parser
);
7847 /* Similarly, for `delete'. */
7848 else if (keyword
== RID_DELETE
)
7849 return cp_parser_delete_expression (parser
);
7852 /* Look for a unary operator. */
7853 unary_operator
= cp_parser_unary_operator (token
);
7854 /* The `++' and `--' operators can be handled similarly, even though
7855 they are not technically unary-operators in the grammar. */
7856 if (unary_operator
== ERROR_MARK
)
7858 if (token
->type
== CPP_PLUS_PLUS
)
7859 unary_operator
= PREINCREMENT_EXPR
;
7860 else if (token
->type
== CPP_MINUS_MINUS
)
7861 unary_operator
= PREDECREMENT_EXPR
;
7862 /* Handle the GNU address-of-label extension. */
7863 else if (cp_parser_allow_gnu_extensions_p (parser
)
7864 && token
->type
== CPP_AND_AND
)
7868 location_t start_loc
= token
->location
;
7870 /* Consume the '&&' token. */
7871 cp_lexer_consume_token (parser
->lexer
);
7872 /* Look for the identifier. */
7873 location_t finish_loc
7874 = get_finish (cp_lexer_peek_token (parser
->lexer
)->location
);
7875 identifier
= cp_parser_identifier (parser
);
7876 /* Construct a location of the form:
7879 with caret==start at the "&&", finish at the end of the label. */
7880 location_t combined_loc
7881 = make_location (start_loc
, start_loc
, finish_loc
);
7882 /* Create an expression representing the address. */
7883 expression
= finish_label_address_expr (identifier
, combined_loc
);
7884 if (cp_parser_non_integral_constant_expression (parser
,
7886 expression
= error_mark_node
;
7890 if (unary_operator
!= ERROR_MARK
)
7892 cp_expr cast_expression
;
7893 cp_expr expression
= error_mark_node
;
7894 non_integral_constant non_constant_p
= NIC_NONE
;
7895 location_t loc
= token
->location
;
7896 tsubst_flags_t complain
= complain_flags (decltype_p
);
7898 /* Consume the operator token. */
7899 token
= cp_lexer_consume_token (parser
->lexer
);
7900 enum cpp_ttype op_ttype
= cp_lexer_peek_token (parser
->lexer
)->type
;
7902 /* Parse the cast-expression. */
7904 = cp_parser_cast_expression (parser
,
7905 unary_operator
== ADDR_EXPR
,
7911 OP_TOKEN CAST_EXPRESSION
7912 ^~~~~~~~~~~~~~~~~~~~~~~~~
7913 with start==caret at the operator token, and
7914 extending to the end of the cast_expression. */
7915 loc
= make_location (loc
, loc
, cast_expression
.get_finish ());
7917 /* Now, build an appropriate representation. */
7918 switch (unary_operator
)
7921 non_constant_p
= NIC_STAR
;
7922 expression
= build_x_indirect_ref (loc
, cast_expression
,
7925 /* TODO: build_x_indirect_ref does not always honor the
7926 location, so ensure it is set. */
7927 expression
.set_location (loc
);
7931 non_constant_p
= NIC_ADDR
;
7934 expression
= build_x_unary_op (loc
, unary_operator
,
7937 /* TODO: build_x_unary_op does not always honor the location,
7938 so ensure it is set. */
7939 expression
.set_location (loc
);
7942 case PREINCREMENT_EXPR
:
7943 case PREDECREMENT_EXPR
:
7944 non_constant_p
= unary_operator
== PREINCREMENT_EXPR
7945 ? NIC_PREINCREMENT
: NIC_PREDECREMENT
;
7948 /* Immediately fold negation of a constant, unless the constant is 0
7949 (since -0 == 0) or it would overflow. */
7950 if (unary_operator
== NEGATE_EXPR
&& op_ttype
== CPP_NUMBER
7951 && CONSTANT_CLASS_P (cast_expression
)
7952 && !integer_zerop (cast_expression
)
7953 && !TREE_OVERFLOW (cast_expression
))
7955 tree folded
= fold_build1 (unary_operator
,
7956 TREE_TYPE (cast_expression
),
7958 if (CONSTANT_CLASS_P (folded
) && !TREE_OVERFLOW (folded
))
7960 expression
= cp_expr (folded
, loc
);
7965 case UNARY_PLUS_EXPR
:
7966 case TRUTH_NOT_EXPR
:
7967 expression
= finish_unary_op_expr (loc
, unary_operator
,
7968 cast_expression
, complain
);
7975 if (non_constant_p
!= NIC_NONE
7976 && cp_parser_non_integral_constant_expression (parser
,
7978 expression
= error_mark_node
;
7983 return cp_parser_postfix_expression (parser
, address_p
, cast_p
,
7984 /*member_access_only_p=*/false,
7989 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7990 unary-operator, the corresponding tree code is returned. */
7992 static enum tree_code
7993 cp_parser_unary_operator (cp_token
* token
)
7995 switch (token
->type
)
7998 return INDIRECT_REF
;
8004 return UNARY_PLUS_EXPR
;
8010 return TRUTH_NOT_EXPR
;
8013 return BIT_NOT_EXPR
;
8020 /* Parse a new-expression.
8023 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8024 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8026 Returns a representation of the expression. */
8029 cp_parser_new_expression (cp_parser
* parser
)
8031 bool global_scope_p
;
8032 vec
<tree
, va_gc
> *placement
;
8034 vec
<tree
, va_gc
> *initializer
;
8035 tree nelts
= NULL_TREE
;
8038 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
8040 /* Look for the optional `::' operator. */
8042 = (cp_parser_global_scope_opt (parser
,
8043 /*current_scope_valid_p=*/false)
8045 /* Look for the `new' operator. */
8046 cp_parser_require_keyword (parser
, RID_NEW
, RT_NEW
);
8047 /* There's no easy way to tell a new-placement from the
8048 `( type-id )' construct. */
8049 cp_parser_parse_tentatively (parser
);
8050 /* Look for a new-placement. */
8051 placement
= cp_parser_new_placement (parser
);
8052 /* If that didn't work out, there's no new-placement. */
8053 if (!cp_parser_parse_definitely (parser
))
8055 if (placement
!= NULL
)
8056 release_tree_vector (placement
);
8060 /* If the next token is a `(', then we have a parenthesized
8062 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
8065 const char *saved_message
= parser
->type_definition_forbidden_message
;
8067 /* Consume the `('. */
8068 cp_lexer_consume_token (parser
->lexer
);
8070 /* Parse the type-id. */
8071 parser
->type_definition_forbidden_message
8072 = G_("types may not be defined in a new-expression");
8074 type_id_in_expr_sentinel
s (parser
);
8075 type
= cp_parser_type_id (parser
);
8077 parser
->type_definition_forbidden_message
= saved_message
;
8079 /* Look for the closing `)'. */
8080 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
8081 token
= cp_lexer_peek_token (parser
->lexer
);
8082 /* There should not be a direct-new-declarator in this production,
8083 but GCC used to allowed this, so we check and emit a sensible error
8084 message for this case. */
8085 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
8087 error_at (token
->location
,
8088 "array bound forbidden after parenthesized type-id");
8089 inform (token
->location
,
8090 "try removing the parentheses around the type-id");
8091 cp_parser_direct_new_declarator (parser
);
8094 /* Otherwise, there must be a new-type-id. */
8096 type
= cp_parser_new_type_id (parser
, &nelts
);
8098 /* If the next token is a `(' or '{', then we have a new-initializer. */
8099 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8100 if (token
->type
== CPP_OPEN_PAREN
8101 || token
->type
== CPP_OPEN_BRACE
)
8102 initializer
= cp_parser_new_initializer (parser
);
8106 /* A new-expression may not appear in an integral constant
8108 if (cp_parser_non_integral_constant_expression (parser
, NIC_NEW
))
8109 ret
= error_mark_node
;
8110 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8111 of a new-type-id or type-id of a new-expression, the new-expression shall
8112 contain a new-initializer of the form ( assignment-expression )".
8113 Additionally, consistently with the spirit of DR 1467, we want to accept
8114 'new auto { 2 }' too. */
8115 else if (type_uses_auto (type
)
8116 && (vec_safe_length (initializer
) != 1
8117 || (BRACE_ENCLOSED_INITIALIZER_P ((*initializer
)[0])
8118 && CONSTRUCTOR_NELTS ((*initializer
)[0]) != 1)))
8120 error_at (token
->location
,
8121 "initialization of new-expression for type %<auto%> "
8122 "requires exactly one element");
8123 ret
= error_mark_node
;
8127 /* Construct a location e.g.:
8130 with caret == start at the start of the "new" token, and the end
8131 at the end of the final token we consumed. */
8132 cp_token
*end_tok
= cp_lexer_previous_token (parser
->lexer
);
8133 location_t end_loc
= get_finish (end_tok
->location
);
8134 location_t combined_loc
= make_location (start_loc
, start_loc
, end_loc
);
8136 /* Create a representation of the new-expression. */
8137 ret
= build_new (&placement
, type
, nelts
, &initializer
, global_scope_p
,
8138 tf_warning_or_error
);
8139 protected_set_expr_location (ret
, combined_loc
);
8142 if (placement
!= NULL
)
8143 release_tree_vector (placement
);
8144 if (initializer
!= NULL
)
8145 release_tree_vector (initializer
);
8150 /* Parse a new-placement.
8155 Returns the same representation as for an expression-list. */
8157 static vec
<tree
, va_gc
> *
8158 cp_parser_new_placement (cp_parser
* parser
)
8160 vec
<tree
, va_gc
> *expression_list
;
8162 /* Parse the expression-list. */
8163 expression_list
= (cp_parser_parenthesized_expression_list
8164 (parser
, non_attr
, /*cast_p=*/false,
8165 /*allow_expansion_p=*/true,
8166 /*non_constant_p=*/NULL
));
8168 if (expression_list
&& expression_list
->is_empty ())
8169 error ("expected expression-list or type-id");
8171 return expression_list
;
8174 /* Parse a new-type-id.
8177 type-specifier-seq new-declarator [opt]
8179 Returns the TYPE allocated. If the new-type-id indicates an array
8180 type, *NELTS is set to the number of elements in the last array
8181 bound; the TYPE will not include the last array bound. */
8184 cp_parser_new_type_id (cp_parser
* parser
, tree
*nelts
)
8186 cp_decl_specifier_seq type_specifier_seq
;
8187 cp_declarator
*new_declarator
;
8188 cp_declarator
*declarator
;
8189 cp_declarator
*outer_declarator
;
8190 const char *saved_message
;
8192 /* The type-specifier sequence must not contain type definitions.
8193 (It cannot contain declarations of new types either, but if they
8194 are not definitions we will catch that because they are not
8196 saved_message
= parser
->type_definition_forbidden_message
;
8197 parser
->type_definition_forbidden_message
8198 = G_("types may not be defined in a new-type-id");
8199 /* Parse the type-specifier-seq. */
8200 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
8201 /*is_trailing_return=*/false,
8202 &type_specifier_seq
);
8203 /* Restore the old message. */
8204 parser
->type_definition_forbidden_message
= saved_message
;
8206 if (type_specifier_seq
.type
== error_mark_node
)
8207 return error_mark_node
;
8209 /* Parse the new-declarator. */
8210 new_declarator
= cp_parser_new_declarator_opt (parser
);
8212 /* Determine the number of elements in the last array dimension, if
8215 /* Skip down to the last array dimension. */
8216 declarator
= new_declarator
;
8217 outer_declarator
= NULL
;
8218 while (declarator
&& (declarator
->kind
== cdk_pointer
8219 || declarator
->kind
== cdk_ptrmem
))
8221 outer_declarator
= declarator
;
8222 declarator
= declarator
->declarator
;
8225 && declarator
->kind
== cdk_array
8226 && declarator
->declarator
8227 && declarator
->declarator
->kind
== cdk_array
)
8229 outer_declarator
= declarator
;
8230 declarator
= declarator
->declarator
;
8233 if (declarator
&& declarator
->kind
== cdk_array
)
8235 *nelts
= declarator
->u
.array
.bounds
;
8236 if (*nelts
== error_mark_node
)
8237 *nelts
= integer_one_node
;
8239 if (outer_declarator
)
8240 outer_declarator
->declarator
= declarator
->declarator
;
8242 new_declarator
= NULL
;
8245 return groktypename (&type_specifier_seq
, new_declarator
, false);
8248 /* Parse an (optional) new-declarator.
8251 ptr-operator new-declarator [opt]
8252 direct-new-declarator
8254 Returns the declarator. */
8256 static cp_declarator
*
8257 cp_parser_new_declarator_opt (cp_parser
* parser
)
8259 enum tree_code code
;
8260 tree type
, std_attributes
= NULL_TREE
;
8261 cp_cv_quals cv_quals
;
8263 /* We don't know if there's a ptr-operator next, or not. */
8264 cp_parser_parse_tentatively (parser
);
8265 /* Look for a ptr-operator. */
8266 code
= cp_parser_ptr_operator (parser
, &type
, &cv_quals
, &std_attributes
);
8267 /* If that worked, look for more new-declarators. */
8268 if (cp_parser_parse_definitely (parser
))
8270 cp_declarator
*declarator
;
8272 /* Parse another optional declarator. */
8273 declarator
= cp_parser_new_declarator_opt (parser
);
8275 declarator
= cp_parser_make_indirect_declarator
8276 (code
, type
, cv_quals
, declarator
, std_attributes
);
8281 /* If the next token is a `[', there is a direct-new-declarator. */
8282 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
8283 return cp_parser_direct_new_declarator (parser
);
8288 /* Parse a direct-new-declarator.
8290 direct-new-declarator:
8292 direct-new-declarator [constant-expression]
8296 static cp_declarator
*
8297 cp_parser_direct_new_declarator (cp_parser
* parser
)
8299 cp_declarator
*declarator
= NULL
;
8306 /* Look for the opening `['. */
8307 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
8309 token
= cp_lexer_peek_token (parser
->lexer
);
8310 expression
= cp_parser_expression (parser
);
8311 /* The standard requires that the expression have integral
8312 type. DR 74 adds enumeration types. We believe that the
8313 real intent is that these expressions be handled like the
8314 expression in a `switch' condition, which also allows
8315 classes with a single conversion to integral or
8316 enumeration type. */
8317 if (!processing_template_decl
)
8320 = build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
8325 error_at (token
->location
,
8326 "expression in new-declarator must have integral "
8327 "or enumeration type");
8328 expression
= error_mark_node
;
8332 /* Look for the closing `]'. */
8333 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
8335 /* Add this bound to the declarator. */
8336 declarator
= make_array_declarator (declarator
, expression
);
8338 /* If the next token is not a `[', then there are no more
8340 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
8347 /* Parse a new-initializer.
8350 ( expression-list [opt] )
8353 Returns a representation of the expression-list. */
8355 static vec
<tree
, va_gc
> *
8356 cp_parser_new_initializer (cp_parser
* parser
)
8358 vec
<tree
, va_gc
> *expression_list
;
8360 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
8363 bool expr_non_constant_p
;
8364 cp_lexer_set_source_position (parser
->lexer
);
8365 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
8366 t
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
8367 CONSTRUCTOR_IS_DIRECT_INIT (t
) = 1;
8368 expression_list
= make_tree_vector_single (t
);
8371 expression_list
= (cp_parser_parenthesized_expression_list
8372 (parser
, non_attr
, /*cast_p=*/false,
8373 /*allow_expansion_p=*/true,
8374 /*non_constant_p=*/NULL
));
8376 return expression_list
;
8379 /* Parse a delete-expression.
8382 :: [opt] delete cast-expression
8383 :: [opt] delete [ ] cast-expression
8385 Returns a representation of the expression. */
8388 cp_parser_delete_expression (cp_parser
* parser
)
8390 bool global_scope_p
;
8394 /* Look for the optional `::' operator. */
8396 = (cp_parser_global_scope_opt (parser
,
8397 /*current_scope_valid_p=*/false)
8399 /* Look for the `delete' keyword. */
8400 cp_parser_require_keyword (parser
, RID_DELETE
, RT_DELETE
);
8401 /* See if the array syntax is in use. */
8402 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
8404 /* Consume the `[' token. */
8405 cp_lexer_consume_token (parser
->lexer
);
8406 /* Look for the `]' token. */
8407 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
8408 /* Remember that this is the `[]' construct. */
8414 /* Parse the cast-expression. */
8415 expression
= cp_parser_simple_cast_expression (parser
);
8417 /* A delete-expression may not appear in an integral constant
8419 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEL
))
8420 return error_mark_node
;
8422 return delete_sanity (expression
, NULL_TREE
, array_p
, global_scope_p
,
8423 tf_warning_or_error
);
8426 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8427 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8431 cp_parser_tokens_start_cast_expression (cp_parser
*parser
)
8433 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8434 switch (token
->type
)
8440 case CPP_CLOSE_SQUARE
:
8441 case CPP_CLOSE_PAREN
:
8442 case CPP_CLOSE_BRACE
:
8443 case CPP_OPEN_BRACE
:
8447 case CPP_DEREF_STAR
:
8455 case CPP_GREATER_EQ
:
8476 case CPP_OPEN_PAREN
:
8477 /* In ((type ()) () the last () isn't a valid cast-expression,
8478 so the whole must be parsed as postfix-expression. */
8479 return cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
8482 case CPP_OPEN_SQUARE
:
8483 /* '[' may start a primary-expression in obj-c++ and in C++11,
8484 as a lambda-expression, eg, '(void)[]{}'. */
8485 if (cxx_dialect
>= cxx11
)
8487 return c_dialect_objc ();
8490 case CPP_MINUS_MINUS
:
8491 /* '++' and '--' may or may not start a cast-expression:
8493 struct T { void operator++(int); };
8494 void f() { (T())++; }
8507 /* Parse a cast-expression.
8511 ( type-id ) cast-expression
8513 ADDRESS_P is true iff the unary-expression is appearing as the
8514 operand of the `&' operator. CAST_P is true if this expression is
8515 the target of a cast.
8517 Returns a representation of the expression. */
8520 cp_parser_cast_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
8521 bool decltype_p
, cp_id_kind
* pidk
)
8523 /* If it's a `(', then we might be looking at a cast. */
8524 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
8526 tree type
= NULL_TREE
;
8527 cp_expr
expr (NULL_TREE
);
8528 int cast_expression
= 0;
8529 const char *saved_message
;
8531 /* There's no way to know yet whether or not this is a cast.
8532 For example, `(int (3))' is a unary-expression, while `(int)
8533 3' is a cast. So, we resort to parsing tentatively. */
8534 cp_parser_parse_tentatively (parser
);
8535 /* Types may not be defined in a cast. */
8536 saved_message
= parser
->type_definition_forbidden_message
;
8537 parser
->type_definition_forbidden_message
8538 = G_("types may not be defined in casts");
8539 /* Consume the `('. */
8540 cp_token
*open_paren
= cp_lexer_consume_token (parser
->lexer
);
8541 location_t open_paren_loc
= open_paren
->location
;
8543 /* A very tricky bit is that `(struct S) { 3 }' is a
8544 compound-literal (which we permit in C++ as an extension).
8545 But, that construct is not a cast-expression -- it is a
8546 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8547 is legal; if the compound-literal were a cast-expression,
8548 you'd need an extra set of parentheses.) But, if we parse
8549 the type-id, and it happens to be a class-specifier, then we
8550 will commit to the parse at that point, because we cannot
8551 undo the action that is done when creating a new class. So,
8552 then we cannot back up and do a postfix-expression.
8554 Another tricky case is the following (c++/29234):
8556 struct S { void operator () (); };
8563 As a type-id we parse the parenthesized S()() as a function
8564 returning a function, groktypename complains and we cannot
8565 back up in this case either.
8567 Therefore, we scan ahead to the closing `)', and check to see
8568 if the tokens after the `)' can start a cast-expression. Otherwise
8569 we are dealing with an unary-expression, a postfix-expression
8572 Yet another tricky case, in C++11, is the following (c++/54891):
8576 The issue is that usually, besides the case of lambda-expressions,
8577 the parenthesized type-id cannot be followed by '[', and, eg, we
8578 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8579 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8580 we don't commit, we try a cast-expression, then an unary-expression.
8582 Save tokens so that we can put them back. */
8583 cp_lexer_save_tokens (parser
->lexer
);
8585 /* We may be looking at a cast-expression. */
8586 if (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
8587 /*consume_paren=*/true))
8589 = cp_parser_tokens_start_cast_expression (parser
);
8591 /* Roll back the tokens we skipped. */
8592 cp_lexer_rollback_tokens (parser
->lexer
);
8593 /* If we aren't looking at a cast-expression, simulate an error so
8594 that the call to cp_parser_error_occurred below returns true. */
8595 if (!cast_expression
)
8596 cp_parser_simulate_error (parser
);
8599 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
8600 parser
->in_type_id_in_expr_p
= true;
8601 /* Look for the type-id. */
8602 type
= cp_parser_type_id (parser
);
8603 /* Look for the closing `)'. */
8604 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
8605 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
8608 /* Restore the saved message. */
8609 parser
->type_definition_forbidden_message
= saved_message
;
8611 /* At this point this can only be either a cast or a
8612 parenthesized ctor such as `(T ())' that looks like a cast to
8613 function returning T. */
8614 if (!cp_parser_error_occurred (parser
))
8616 /* Only commit if the cast-expression doesn't start with
8617 '++', '--', or '[' in C++11. */
8618 if (cast_expression
> 0)
8619 cp_parser_commit_to_topmost_tentative_parse (parser
);
8621 expr
= cp_parser_cast_expression (parser
,
8622 /*address_p=*/false,
8624 /*decltype_p=*/false,
8627 if (cp_parser_parse_definitely (parser
))
8629 /* Warn about old-style casts, if so requested. */
8630 if (warn_old_style_cast
8631 && !in_system_header_at (input_location
)
8632 && !VOID_TYPE_P (type
)
8633 && current_lang_name
!= lang_name_c
)
8634 warning (OPT_Wold_style_cast
, "use of old-style cast");
8636 /* Only type conversions to integral or enumeration types
8637 can be used in constant-expressions. */
8638 if (!cast_valid_in_integral_constant_expression_p (type
)
8639 && cp_parser_non_integral_constant_expression (parser
,
8641 return error_mark_node
;
8643 /* Perform the cast. */
8647 with start==caret at the open paren, extending to the
8649 location_t cast_loc
= make_location (open_paren_loc
,
8651 expr
.get_finish ());
8652 expr
= build_c_cast (cast_loc
, type
, expr
);
8657 cp_parser_abort_tentative_parse (parser
);
8660 /* If we get here, then it's not a cast, so it must be a
8661 unary-expression. */
8662 return cp_parser_unary_expression (parser
, pidk
, address_p
,
8663 cast_p
, decltype_p
);
8666 /* Parse a binary expression of the general form:
8670 pm-expression .* cast-expression
8671 pm-expression ->* cast-expression
8673 multiplicative-expression:
8675 multiplicative-expression * pm-expression
8676 multiplicative-expression / pm-expression
8677 multiplicative-expression % pm-expression
8679 additive-expression:
8680 multiplicative-expression
8681 additive-expression + multiplicative-expression
8682 additive-expression - multiplicative-expression
8686 shift-expression << additive-expression
8687 shift-expression >> additive-expression
8689 relational-expression:
8691 relational-expression < shift-expression
8692 relational-expression > shift-expression
8693 relational-expression <= shift-expression
8694 relational-expression >= shift-expression
8698 relational-expression:
8699 relational-expression <? shift-expression
8700 relational-expression >? shift-expression
8702 equality-expression:
8703 relational-expression
8704 equality-expression == relational-expression
8705 equality-expression != relational-expression
8709 and-expression & equality-expression
8711 exclusive-or-expression:
8713 exclusive-or-expression ^ and-expression
8715 inclusive-or-expression:
8716 exclusive-or-expression
8717 inclusive-or-expression | exclusive-or-expression
8719 logical-and-expression:
8720 inclusive-or-expression
8721 logical-and-expression && inclusive-or-expression
8723 logical-or-expression:
8724 logical-and-expression
8725 logical-or-expression || logical-and-expression
8727 All these are implemented with a single function like:
8730 simple-cast-expression
8731 binary-expression <token> binary-expression
8733 CAST_P is true if this expression is the target of a cast.
8735 The binops_by_token map is used to get the tree codes for each <token> type.
8736 binary-expressions are associated according to a precedence table. */
8738 #define TOKEN_PRECEDENCE(token) \
8739 (((token->type == CPP_GREATER \
8740 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8741 && !parser->greater_than_is_operator_p) \
8742 ? PREC_NOT_OPERATOR \
8743 : binops_by_token[token->type].prec)
8746 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
,
8747 bool no_toplevel_fold_p
,
8749 enum cp_parser_prec prec
,
8752 cp_parser_expression_stack stack
;
8753 cp_parser_expression_stack_entry
*sp
= &stack
[0];
8754 cp_parser_expression_stack_entry current
;
8757 enum tree_code rhs_type
;
8758 enum cp_parser_prec new_prec
, lookahead_prec
;
8761 /* Parse the first expression. */
8762 current
.lhs_type
= (cp_lexer_next_token_is (parser
->lexer
, CPP_NOT
)
8763 ? TRUTH_NOT_EXPR
: ERROR_MARK
);
8764 current
.lhs
= cp_parser_cast_expression (parser
, /*address_p=*/false,
8765 cast_p
, decltype_p
, pidk
);
8766 current
.prec
= prec
;
8768 if (cp_parser_error_occurred (parser
))
8769 return error_mark_node
;
8773 /* Get an operator token. */
8774 token
= cp_lexer_peek_token (parser
->lexer
);
8776 if (warn_cxx11_compat
8777 && token
->type
== CPP_RSHIFT
8778 && !parser
->greater_than_is_operator_p
)
8780 if (warning_at (token
->location
, OPT_Wc__11_compat
,
8781 "%<>>%> operator is treated"
8782 " as two right angle brackets in C++11"))
8783 inform (token
->location
,
8784 "suggest parentheses around %<>>%> expression");
8787 new_prec
= TOKEN_PRECEDENCE (token
);
8788 if (new_prec
!= PREC_NOT_OPERATOR
8789 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
8790 /* This is a fold-expression; handle it later. */
8791 new_prec
= PREC_NOT_OPERATOR
;
8793 /* Popping an entry off the stack means we completed a subexpression:
8794 - either we found a token which is not an operator (`>' where it is not
8795 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8796 will happen repeatedly;
8797 - or, we found an operator which has lower priority. This is the case
8798 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8800 if (new_prec
<= current
.prec
)
8809 current
.tree_type
= binops_by_token
[token
->type
].tree_type
;
8810 current
.loc
= token
->location
;
8812 /* We used the operator token. */
8813 cp_lexer_consume_token (parser
->lexer
);
8815 /* For "false && x" or "true || x", x will never be executed;
8816 disable warnings while evaluating it. */
8817 if (current
.tree_type
== TRUTH_ANDIF_EXPR
)
8818 c_inhibit_evaluation_warnings
+=
8819 cp_fully_fold (current
.lhs
) == truthvalue_false_node
;
8820 else if (current
.tree_type
== TRUTH_ORIF_EXPR
)
8821 c_inhibit_evaluation_warnings
+=
8822 cp_fully_fold (current
.lhs
) == truthvalue_true_node
;
8824 /* Extract another operand. It may be the RHS of this expression
8825 or the LHS of a new, higher priority expression. */
8826 rhs_type
= (cp_lexer_next_token_is (parser
->lexer
, CPP_NOT
)
8827 ? TRUTH_NOT_EXPR
: ERROR_MARK
);
8828 rhs
= cp_parser_simple_cast_expression (parser
);
8830 /* Get another operator token. Look up its precedence to avoid
8831 building a useless (immediately popped) stack entry for common
8832 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8833 token
= cp_lexer_peek_token (parser
->lexer
);
8834 lookahead_prec
= TOKEN_PRECEDENCE (token
);
8835 if (lookahead_prec
!= PREC_NOT_OPERATOR
8836 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
8837 lookahead_prec
= PREC_NOT_OPERATOR
;
8838 if (lookahead_prec
> new_prec
)
8840 /* ... and prepare to parse the RHS of the new, higher priority
8841 expression. Since precedence levels on the stack are
8842 monotonically increasing, we do not have to care about
8847 current
.lhs_type
= rhs_type
;
8848 current
.prec
= new_prec
;
8849 new_prec
= lookahead_prec
;
8853 lookahead_prec
= new_prec
;
8854 /* If the stack is not empty, we have parsed into LHS the right side
8855 (`4' in the example above) of an expression we had suspended.
8856 We can use the information on the stack to recover the LHS (`3')
8857 from the stack together with the tree code (`MULT_EXPR'), and
8858 the precedence of the higher level subexpression
8859 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8860 which will be used to actually build the additive expression. */
8862 rhs_type
= current
.lhs_type
;
8867 /* Undo the disabling of warnings done above. */
8868 if (current
.tree_type
== TRUTH_ANDIF_EXPR
)
8869 c_inhibit_evaluation_warnings
-=
8870 cp_fully_fold (current
.lhs
) == truthvalue_false_node
;
8871 else if (current
.tree_type
== TRUTH_ORIF_EXPR
)
8872 c_inhibit_evaluation_warnings
-=
8873 cp_fully_fold (current
.lhs
) == truthvalue_true_node
;
8875 if (warn_logical_not_paren
8876 && TREE_CODE_CLASS (current
.tree_type
) == tcc_comparison
8877 && current
.lhs_type
== TRUTH_NOT_EXPR
8878 /* Avoid warning for !!x == y. */
8879 && (TREE_CODE (current
.lhs
) != NE_EXPR
8880 || !integer_zerop (TREE_OPERAND (current
.lhs
, 1)))
8881 && (TREE_CODE (current
.lhs
) != TRUTH_NOT_EXPR
8882 || (TREE_CODE (TREE_OPERAND (current
.lhs
, 0)) != TRUTH_NOT_EXPR
8883 /* Avoid warning for !b == y where b is boolean. */
8884 && (TREE_TYPE (TREE_OPERAND (current
.lhs
, 0)) == NULL_TREE
8885 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (current
.lhs
, 0)))
8887 /* Avoid warning for !!b == y where b is boolean. */
8888 && (!DECL_P (current
.lhs
)
8889 || TREE_TYPE (current
.lhs
) == NULL_TREE
8890 || TREE_CODE (TREE_TYPE (current
.lhs
)) != BOOLEAN_TYPE
))
8891 warn_logical_not_parentheses (current
.loc
, current
.tree_type
,
8892 maybe_constant_value (rhs
));
8896 location_t combined_loc
= make_location (current
.loc
,
8897 current
.lhs
.get_start (),
8900 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8901 ERROR_MARK for everything that is not a binary expression.
8902 This makes warn_about_parentheses miss some warnings that
8903 involve unary operators. For unary expressions we should
8904 pass the correct tree_code unless the unary expression was
8905 surrounded by parentheses.
8907 if (no_toplevel_fold_p
8908 && lookahead_prec
<= current
.prec
8910 current
.lhs
= build2_loc (combined_loc
,
8912 TREE_CODE_CLASS (current
.tree_type
)
8914 ? boolean_type_node
: TREE_TYPE (current
.lhs
),
8918 current
.lhs
= build_x_binary_op (combined_loc
, current
.tree_type
,
8919 current
.lhs
, current
.lhs_type
,
8920 rhs
, rhs_type
, &overload
,
8921 complain_flags (decltype_p
));
8922 /* TODO: build_x_binary_op doesn't always honor the location. */
8923 current
.lhs
.set_location (combined_loc
);
8925 current
.lhs_type
= current
.tree_type
;
8927 /* If the binary operator required the use of an overloaded operator,
8928 then this expression cannot be an integral constant-expression.
8929 An overloaded operator can be used even if both operands are
8930 otherwise permissible in an integral constant-expression if at
8931 least one of the operands is of enumeration type. */
8934 && cp_parser_non_integral_constant_expression (parser
,
8936 return error_mark_node
;
8943 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
,
8944 bool no_toplevel_fold_p
,
8945 enum cp_parser_prec prec
,
8948 return cp_parser_binary_expression (parser
, cast_p
, no_toplevel_fold_p
,
8949 /*decltype*/false, prec
, pidk
);
8952 /* Parse the `? expression : assignment-expression' part of a
8953 conditional-expression. The LOGICAL_OR_EXPR is the
8954 logical-or-expression that started the conditional-expression.
8955 Returns a representation of the entire conditional-expression.
8957 This routine is used by cp_parser_assignment_expression.
8959 ? expression : assignment-expression
8963 ? : assignment-expression */
8966 cp_parser_question_colon_clause (cp_parser
* parser
, cp_expr logical_or_expr
)
8968 tree expr
, folded_logical_or_expr
= cp_fully_fold (logical_or_expr
);
8969 cp_expr assignment_expr
;
8970 struct cp_token
*token
;
8971 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
8973 /* Consume the `?' token. */
8974 cp_lexer_consume_token (parser
->lexer
);
8975 token
= cp_lexer_peek_token (parser
->lexer
);
8976 if (cp_parser_allow_gnu_extensions_p (parser
)
8977 && token
->type
== CPP_COLON
)
8979 pedwarn (token
->location
, OPT_Wpedantic
,
8980 "ISO C++ does not allow ?: with omitted middle operand");
8981 /* Implicit true clause. */
8983 c_inhibit_evaluation_warnings
+=
8984 folded_logical_or_expr
== truthvalue_true_node
;
8985 warn_for_omitted_condop (token
->location
, logical_or_expr
);
8989 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
8990 parser
->colon_corrects_to_scope_p
= false;
8991 /* Parse the expression. */
8992 c_inhibit_evaluation_warnings
+=
8993 folded_logical_or_expr
== truthvalue_false_node
;
8994 expr
= cp_parser_expression (parser
);
8995 c_inhibit_evaluation_warnings
+=
8996 ((folded_logical_or_expr
== truthvalue_true_node
)
8997 - (folded_logical_or_expr
== truthvalue_false_node
));
8998 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
9001 /* The next token should be a `:'. */
9002 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
9003 /* Parse the assignment-expression. */
9004 assignment_expr
= cp_parser_assignment_expression (parser
);
9005 c_inhibit_evaluation_warnings
-=
9006 folded_logical_or_expr
== truthvalue_true_node
;
9009 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9010 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9011 with the caret at the "?", ranging from the start of
9012 the logical_or_expr to the end of the assignment_expr. */
9013 loc
= make_location (loc
,
9014 logical_or_expr
.get_start (),
9015 assignment_expr
.get_finish ());
9017 /* Build the conditional-expression. */
9018 return build_x_conditional_expr (loc
, logical_or_expr
,
9021 tf_warning_or_error
);
9024 /* Parse an assignment-expression.
9026 assignment-expression:
9027 conditional-expression
9028 logical-or-expression assignment-operator assignment_expression
9031 CAST_P is true if this expression is the target of a cast.
9032 DECLTYPE_P is true if this expression is the operand of decltype.
9034 Returns a representation for the expression. */
9037 cp_parser_assignment_expression (cp_parser
* parser
, cp_id_kind
* pidk
,
9038 bool cast_p
, bool decltype_p
)
9042 /* If the next token is the `throw' keyword, then we're looking at
9043 a throw-expression. */
9044 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THROW
))
9045 expr
= cp_parser_throw_expression (parser
);
9046 /* Otherwise, it must be that we are looking at a
9047 logical-or-expression. */
9050 /* Parse the binary expressions (logical-or-expression). */
9051 expr
= cp_parser_binary_expression (parser
, cast_p
, false,
9053 PREC_NOT_OPERATOR
, pidk
);
9054 /* If the next token is a `?' then we're actually looking at a
9055 conditional-expression. */
9056 if (cp_lexer_next_token_is (parser
->lexer
, CPP_QUERY
))
9057 return cp_parser_question_colon_clause (parser
, expr
);
9060 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9062 /* If it's an assignment-operator, we're using the second
9064 enum tree_code assignment_operator
9065 = cp_parser_assignment_operator_opt (parser
);
9066 if (assignment_operator
!= ERROR_MARK
)
9068 bool non_constant_p
;
9070 /* Parse the right-hand side of the assignment. */
9071 cp_expr rhs
= cp_parser_initializer_clause (parser
,
9074 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
9075 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
9077 /* An assignment may not appear in a
9078 constant-expression. */
9079 if (cp_parser_non_integral_constant_expression (parser
,
9081 return error_mark_node
;
9082 /* Build the assignment expression. Its default
9086 is the location of the '=' token as the
9087 caret, ranging from the start of the lhs to the
9089 loc
= make_location (loc
,
9092 expr
= build_x_modify_expr (loc
, expr
,
9093 assignment_operator
,
9095 complain_flags (decltype_p
));
9096 /* TODO: build_x_modify_expr doesn't honor the location,
9097 so we must set it here. */
9098 expr
.set_location (loc
);
9106 /* Parse an (optional) assignment-operator.
9108 assignment-operator: one of
9109 = *= /= %= += -= >>= <<= &= ^= |=
9113 assignment-operator: one of
9116 If the next token is an assignment operator, the corresponding tree
9117 code is returned, and the token is consumed. For example, for
9118 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9119 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9120 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9121 operator, ERROR_MARK is returned. */
9123 static enum tree_code
9124 cp_parser_assignment_operator_opt (cp_parser
* parser
)
9129 /* Peek at the next token. */
9130 token
= cp_lexer_peek_token (parser
->lexer
);
9132 switch (token
->type
)
9143 op
= TRUNC_DIV_EXPR
;
9147 op
= TRUNC_MOD_EXPR
;
9179 /* Nothing else is an assignment operator. */
9183 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9184 if (op
!= ERROR_MARK
9185 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
9188 /* If it was an assignment operator, consume it. */
9189 if (op
!= ERROR_MARK
)
9190 cp_lexer_consume_token (parser
->lexer
);
9195 /* Parse an expression.
9198 assignment-expression
9199 expression , assignment-expression
9201 CAST_P is true if this expression is the target of a cast.
9202 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9203 except possibly parenthesized or on the RHS of a comma (N3276).
9205 Returns a representation of the expression. */
9208 cp_parser_expression (cp_parser
* parser
, cp_id_kind
* pidk
,
9209 bool cast_p
, bool decltype_p
)
9211 cp_expr expression
= NULL_TREE
;
9212 location_t loc
= UNKNOWN_LOCATION
;
9216 cp_expr assignment_expression
;
9218 /* Parse the next assignment-expression. */
9219 assignment_expression
9220 = cp_parser_assignment_expression (parser
, pidk
, cast_p
, decltype_p
);
9222 /* We don't create a temporary for a call that is the immediate operand
9223 of decltype or on the RHS of a comma. But when we see a comma, we
9224 need to create a temporary for a call on the LHS. */
9225 if (decltype_p
&& !processing_template_decl
9226 && TREE_CODE (assignment_expression
) == CALL_EXPR
9227 && CLASS_TYPE_P (TREE_TYPE (assignment_expression
))
9228 && cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
9229 assignment_expression
9230 = build_cplus_new (TREE_TYPE (assignment_expression
),
9231 assignment_expression
, tf_warning_or_error
);
9233 /* If this is the first assignment-expression, we can just
9236 expression
= assignment_expression
;
9239 /* Create a location with caret at the comma, ranging
9240 from the start of the LHS to the end of the RHS. */
9241 loc
= make_location (loc
,
9242 expression
.get_start (),
9243 assignment_expression
.get_finish ());
9244 expression
= build_x_compound_expr (loc
, expression
,
9245 assignment_expression
,
9246 complain_flags (decltype_p
));
9247 expression
.set_location (loc
);
9249 /* If the next token is not a comma, or we're in a fold-expression, then
9250 we are done with the expression. */
9251 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
)
9252 || cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_ELLIPSIS
))
9254 /* Consume the `,'. */
9255 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9256 cp_lexer_consume_token (parser
->lexer
);
9257 /* A comma operator cannot appear in a constant-expression. */
9258 if (cp_parser_non_integral_constant_expression (parser
, NIC_COMMA
))
9259 expression
= error_mark_node
;
9265 /* Parse a constant-expression.
9267 constant-expression:
9268 conditional-expression
9270 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9271 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9272 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9273 is false, NON_CONSTANT_P should be NULL. */
9276 cp_parser_constant_expression (cp_parser
* parser
,
9277 bool allow_non_constant_p
,
9278 bool *non_constant_p
)
9280 bool saved_integral_constant_expression_p
;
9281 bool saved_allow_non_integral_constant_expression_p
;
9282 bool saved_non_integral_constant_expression_p
;
9285 /* It might seem that we could simply parse the
9286 conditional-expression, and then check to see if it were
9287 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9288 one that the compiler can figure out is constant, possibly after
9289 doing some simplifications or optimizations. The standard has a
9290 precise definition of constant-expression, and we must honor
9291 that, even though it is somewhat more restrictive.
9297 is not a legal declaration, because `(2, 3)' is not a
9298 constant-expression. The `,' operator is forbidden in a
9299 constant-expression. However, GCC's constant-folding machinery
9300 will fold this operation to an INTEGER_CST for `3'. */
9302 /* Save the old settings. */
9303 saved_integral_constant_expression_p
= parser
->integral_constant_expression_p
;
9304 saved_allow_non_integral_constant_expression_p
9305 = parser
->allow_non_integral_constant_expression_p
;
9306 saved_non_integral_constant_expression_p
= parser
->non_integral_constant_expression_p
;
9307 /* We are now parsing a constant-expression. */
9308 parser
->integral_constant_expression_p
= true;
9309 parser
->allow_non_integral_constant_expression_p
9310 = (allow_non_constant_p
|| cxx_dialect
>= cxx11
);
9311 parser
->non_integral_constant_expression_p
= false;
9312 /* Although the grammar says "conditional-expression", we parse an
9313 "assignment-expression", which also permits "throw-expression"
9314 and the use of assignment operators. In the case that
9315 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9316 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9317 actually essential that we look for an assignment-expression.
9318 For example, cp_parser_initializer_clauses uses this function to
9319 determine whether a particular assignment-expression is in fact
9321 expression
= cp_parser_assignment_expression (parser
);
9322 /* Restore the old settings. */
9323 parser
->integral_constant_expression_p
9324 = saved_integral_constant_expression_p
;
9325 parser
->allow_non_integral_constant_expression_p
9326 = saved_allow_non_integral_constant_expression_p
;
9327 if (cxx_dialect
>= cxx11
)
9329 /* Require an rvalue constant expression here; that's what our
9330 callers expect. Reference constant expressions are handled
9331 separately in e.g. cp_parser_template_argument. */
9332 bool is_const
= potential_rvalue_constant_expression (expression
);
9333 parser
->non_integral_constant_expression_p
= !is_const
;
9334 if (!is_const
&& !allow_non_constant_p
)
9335 require_potential_rvalue_constant_expression (expression
);
9337 if (allow_non_constant_p
)
9338 *non_constant_p
= parser
->non_integral_constant_expression_p
;
9339 parser
->non_integral_constant_expression_p
9340 = saved_non_integral_constant_expression_p
;
9345 /* Parse __builtin_offsetof.
9347 offsetof-expression:
9348 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9350 offsetof-member-designator:
9352 | offsetof-member-designator "." id-expression
9353 | offsetof-member-designator "[" expression "]"
9354 | offsetof-member-designator "->" id-expression */
9357 cp_parser_builtin_offsetof (cp_parser
*parser
)
9359 int save_ice_p
, save_non_ice_p
;
9364 location_t finish_loc
;
9366 /* We're about to accept non-integral-constant things, but will
9367 definitely yield an integral constant expression. Save and
9368 restore these values around our local parsing. */
9369 save_ice_p
= parser
->integral_constant_expression_p
;
9370 save_non_ice_p
= parser
->non_integral_constant_expression_p
;
9372 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9374 /* Consume the "__builtin_offsetof" token. */
9375 cp_lexer_consume_token (parser
->lexer
);
9376 /* Consume the opening `('. */
9377 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9378 /* Parse the type-id. */
9379 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9380 type
= cp_parser_type_id (parser
);
9381 /* Look for the `,'. */
9382 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
9383 token
= cp_lexer_peek_token (parser
->lexer
);
9385 /* Build the (type *)null that begins the traditional offsetof macro. */
9386 expr
= build_static_cast (build_pointer_type (type
), null_pointer_node
,
9387 tf_warning_or_error
);
9389 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9390 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DEREF
, expr
,
9391 true, &dummy
, token
->location
);
9394 token
= cp_lexer_peek_token (parser
->lexer
);
9395 switch (token
->type
)
9397 case CPP_OPEN_SQUARE
:
9398 /* offsetof-member-designator "[" expression "]" */
9399 expr
= cp_parser_postfix_open_square_expression (parser
, expr
,
9404 /* offsetof-member-designator "->" identifier */
9405 expr
= grok_array_decl (token
->location
, expr
,
9406 integer_zero_node
, false);
9410 /* offsetof-member-designator "." identifier */
9411 cp_lexer_consume_token (parser
->lexer
);
9412 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
,
9417 case CPP_CLOSE_PAREN
:
9418 /* Consume the ")" token. */
9419 finish_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9420 cp_lexer_consume_token (parser
->lexer
);
9424 /* Error. We know the following require will fail, but
9425 that gives the proper error message. */
9426 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9427 cp_parser_skip_to_closing_parenthesis (parser
, true, false, true);
9428 expr
= error_mark_node
;
9434 /* Make a location of the form:
9435 __builtin_offsetof (struct s, f)
9436 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9437 with caret at the type-id, ranging from the start of the
9438 "_builtin_offsetof" token to the close paren. */
9439 loc
= make_location (loc
, start_loc
, finish_loc
);
9440 /* The result will be an INTEGER_CST, so we need to explicitly
9441 preserve the location. */
9442 expr
= cp_expr (finish_offsetof (expr
, loc
), loc
);
9445 parser
->integral_constant_expression_p
= save_ice_p
;
9446 parser
->non_integral_constant_expression_p
= save_non_ice_p
;
9451 /* Parse a trait expression.
9453 Returns a representation of the expression, the underlying type
9454 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9457 cp_parser_trait_expr (cp_parser
* parser
, enum rid keyword
)
9460 tree type1
, type2
= NULL_TREE
;
9461 bool binary
= false;
9462 bool variadic
= false;
9466 case RID_HAS_NOTHROW_ASSIGN
:
9467 kind
= CPTK_HAS_NOTHROW_ASSIGN
;
9469 case RID_HAS_NOTHROW_CONSTRUCTOR
:
9470 kind
= CPTK_HAS_NOTHROW_CONSTRUCTOR
;
9472 case RID_HAS_NOTHROW_COPY
:
9473 kind
= CPTK_HAS_NOTHROW_COPY
;
9475 case RID_HAS_TRIVIAL_ASSIGN
:
9476 kind
= CPTK_HAS_TRIVIAL_ASSIGN
;
9478 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
9479 kind
= CPTK_HAS_TRIVIAL_CONSTRUCTOR
;
9481 case RID_HAS_TRIVIAL_COPY
:
9482 kind
= CPTK_HAS_TRIVIAL_COPY
;
9484 case RID_HAS_TRIVIAL_DESTRUCTOR
:
9485 kind
= CPTK_HAS_TRIVIAL_DESTRUCTOR
;
9487 case RID_HAS_VIRTUAL_DESTRUCTOR
:
9488 kind
= CPTK_HAS_VIRTUAL_DESTRUCTOR
;
9490 case RID_IS_ABSTRACT
:
9491 kind
= CPTK_IS_ABSTRACT
;
9493 case RID_IS_BASE_OF
:
9494 kind
= CPTK_IS_BASE_OF
;
9498 kind
= CPTK_IS_CLASS
;
9501 kind
= CPTK_IS_EMPTY
;
9504 kind
= CPTK_IS_ENUM
;
9507 kind
= CPTK_IS_FINAL
;
9509 case RID_IS_LITERAL_TYPE
:
9510 kind
= CPTK_IS_LITERAL_TYPE
;
9515 case RID_IS_POLYMORPHIC
:
9516 kind
= CPTK_IS_POLYMORPHIC
;
9518 case RID_IS_SAME_AS
:
9519 kind
= CPTK_IS_SAME_AS
;
9522 case RID_IS_STD_LAYOUT
:
9523 kind
= CPTK_IS_STD_LAYOUT
;
9525 case RID_IS_TRIVIAL
:
9526 kind
= CPTK_IS_TRIVIAL
;
9528 case RID_IS_TRIVIALLY_ASSIGNABLE
:
9529 kind
= CPTK_IS_TRIVIALLY_ASSIGNABLE
;
9532 case RID_IS_TRIVIALLY_CONSTRUCTIBLE
:
9533 kind
= CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
;
9536 case RID_IS_TRIVIALLY_COPYABLE
:
9537 kind
= CPTK_IS_TRIVIALLY_COPYABLE
;
9540 kind
= CPTK_IS_UNION
;
9542 case RID_UNDERLYING_TYPE
:
9543 kind
= CPTK_UNDERLYING_TYPE
;
9548 case RID_DIRECT_BASES
:
9549 kind
= CPTK_DIRECT_BASES
;
9555 /* Consume the token. */
9556 cp_lexer_consume_token (parser
->lexer
);
9558 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9561 type_id_in_expr_sentinel
s (parser
);
9562 type1
= cp_parser_type_id (parser
);
9565 if (type1
== error_mark_node
)
9566 return error_mark_node
;
9570 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
9573 type_id_in_expr_sentinel
s (parser
);
9574 type2
= cp_parser_type_id (parser
);
9577 if (type2
== error_mark_node
)
9578 return error_mark_node
;
9582 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
9584 cp_lexer_consume_token (parser
->lexer
);
9585 tree elt
= cp_parser_type_id (parser
);
9586 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
9588 cp_lexer_consume_token (parser
->lexer
);
9589 elt
= make_pack_expansion (elt
);
9591 if (elt
== error_mark_node
)
9592 return error_mark_node
;
9593 type2
= tree_cons (NULL_TREE
, elt
, type2
);
9597 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9599 /* Complete the trait expression, which may mean either processing
9600 the trait expr now or saving it for template instantiation. */
9603 case CPTK_UNDERLYING_TYPE
:
9604 return finish_underlying_type (type1
);
9606 return finish_bases (type1
, false);
9607 case CPTK_DIRECT_BASES
:
9608 return finish_bases (type1
, true);
9610 return finish_trait_expr (kind
, type1
, type2
);
9614 /* Lambdas that appear in variable initializer or default argument scope
9615 get that in their mangling, so we need to record it. We might as well
9616 use the count for function and namespace scopes as well. */
9617 static GTY(()) tree lambda_scope
;
9618 static GTY(()) int lambda_count
;
9619 struct GTY(()) tree_int
9624 static GTY(()) vec
<tree_int
, va_gc
> *lambda_scope_stack
;
9627 start_lambda_scope (tree decl
)
9631 /* Once we're inside a function, we ignore other scopes and just push
9632 the function again so that popping works properly. */
9633 if (current_function_decl
&& TREE_CODE (decl
) != FUNCTION_DECL
)
9634 decl
= current_function_decl
;
9635 ti
.t
= lambda_scope
;
9636 ti
.i
= lambda_count
;
9637 vec_safe_push (lambda_scope_stack
, ti
);
9638 if (lambda_scope
!= decl
)
9640 /* Don't reset the count if we're still in the same function. */
9641 lambda_scope
= decl
;
9647 record_lambda_scope (tree lambda
)
9649 LAMBDA_EXPR_EXTRA_SCOPE (lambda
) = lambda_scope
;
9650 LAMBDA_EXPR_DISCRIMINATOR (lambda
) = lambda_count
++;
9654 finish_lambda_scope (void)
9656 tree_int
*p
= &lambda_scope_stack
->last ();
9657 if (lambda_scope
!= p
->t
)
9659 lambda_scope
= p
->t
;
9660 lambda_count
= p
->i
;
9662 lambda_scope_stack
->pop ();
9665 /* Parse a lambda expression.
9668 lambda-introducer lambda-declarator [opt] compound-statement
9670 Returns a representation of the expression. */
9673 cp_parser_lambda_expression (cp_parser
* parser
)
9675 tree lambda_expr
= build_lambda_expr ();
9678 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
9679 cp_token_position start
= 0;
9681 LAMBDA_EXPR_LOCATION (lambda_expr
) = token
->location
;
9683 if (cp_unevaluated_operand
)
9685 if (!token
->error_reported
)
9687 error_at (LAMBDA_EXPR_LOCATION (lambda_expr
),
9688 "lambda-expression in unevaluated context");
9689 token
->error_reported
= true;
9693 else if (parser
->in_template_argument_list_p
)
9695 if (!token
->error_reported
)
9697 error_at (token
->location
, "lambda-expression in template-argument");
9698 token
->error_reported
= true;
9703 /* We may be in the middle of deferred access check. Disable
9705 push_deferring_access_checks (dk_no_deferred
);
9707 cp_parser_lambda_introducer (parser
, lambda_expr
);
9709 type
= begin_lambda_type (lambda_expr
);
9710 if (type
== error_mark_node
)
9711 return error_mark_node
;
9713 record_lambda_scope (lambda_expr
);
9715 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9716 determine_visibility (TYPE_NAME (type
));
9718 /* Now that we've started the type, add the capture fields for any
9719 explicit captures. */
9720 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
));
9723 /* Inside the class, surrounding template-parameter-lists do not apply. */
9724 unsigned int saved_num_template_parameter_lists
9725 = parser
->num_template_parameter_lists
;
9726 unsigned char in_statement
= parser
->in_statement
;
9727 bool in_switch_statement_p
= parser
->in_switch_statement_p
;
9728 bool fully_implicit_function_template_p
9729 = parser
->fully_implicit_function_template_p
;
9730 tree implicit_template_parms
= parser
->implicit_template_parms
;
9731 cp_binding_level
* implicit_template_scope
= parser
->implicit_template_scope
;
9732 bool auto_is_implicit_function_template_parm_p
9733 = parser
->auto_is_implicit_function_template_parm_p
;
9735 parser
->num_template_parameter_lists
= 0;
9736 parser
->in_statement
= 0;
9737 parser
->in_switch_statement_p
= false;
9738 parser
->fully_implicit_function_template_p
= false;
9739 parser
->implicit_template_parms
= 0;
9740 parser
->implicit_template_scope
= 0;
9741 parser
->auto_is_implicit_function_template_parm_p
= false;
9743 /* By virtue of defining a local class, a lambda expression has access to
9744 the private variables of enclosing classes. */
9746 ok
&= cp_parser_lambda_declarator_opt (parser
, lambda_expr
);
9750 if (!cp_parser_error_occurred (parser
)
9751 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
)
9752 && cp_parser_start_tentative_firewall (parser
))
9754 cp_parser_lambda_body (parser
, lambda_expr
);
9756 else if (cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
9758 if (cp_parser_skip_to_closing_brace (parser
))
9759 cp_lexer_consume_token (parser
->lexer
);
9762 /* The capture list was built up in reverse order; fix that now. */
9763 LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
)
9764 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
));
9767 maybe_add_lambda_conv_op (type
);
9769 type
= finish_struct (type
, /*attributes=*/NULL_TREE
);
9771 parser
->num_template_parameter_lists
= saved_num_template_parameter_lists
;
9772 parser
->in_statement
= in_statement
;
9773 parser
->in_switch_statement_p
= in_switch_statement_p
;
9774 parser
->fully_implicit_function_template_p
9775 = fully_implicit_function_template_p
;
9776 parser
->implicit_template_parms
= implicit_template_parms
;
9777 parser
->implicit_template_scope
= implicit_template_scope
;
9778 parser
->auto_is_implicit_function_template_parm_p
9779 = auto_is_implicit_function_template_parm_p
;
9782 /* This field is only used during parsing of the lambda. */
9783 LAMBDA_EXPR_THIS_CAPTURE (lambda_expr
) = NULL_TREE
;
9785 /* This lambda shouldn't have any proxies left at this point. */
9786 gcc_assert (LAMBDA_EXPR_PENDING_PROXIES (lambda_expr
) == NULL
);
9787 /* And now that we're done, push proxies for an enclosing lambda. */
9788 insert_pending_capture_proxies ();
9791 lambda_expr
= build_lambda_object (lambda_expr
);
9793 lambda_expr
= error_mark_node
;
9795 cp_parser_end_tentative_firewall (parser
, start
, lambda_expr
);
9797 pop_deferring_access_checks ();
9802 /* Parse the beginning of a lambda expression.
9805 [ lambda-capture [opt] ]
9807 LAMBDA_EXPR is the current representation of the lambda expression. */
9810 cp_parser_lambda_introducer (cp_parser
* parser
, tree lambda_expr
)
9812 /* Need commas after the first capture. */
9815 /* Eat the leading `['. */
9816 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
9818 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9819 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
)
9820 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_NAME
)
9821 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_REFERENCE
;
9822 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
9823 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_COPY
;
9825 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) != CPLD_NONE
)
9827 cp_lexer_consume_token (parser
->lexer
);
9831 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_SQUARE
))
9833 cp_token
* capture_token
;
9835 tree capture_init_expr
;
9836 cp_id_kind idk
= CP_ID_KIND_NONE
;
9837 bool explicit_init_p
= false;
9839 enum capture_kind_type
9844 enum capture_kind_type capture_kind
= BY_COPY
;
9846 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
9848 error ("expected end of capture-list");
9855 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
9857 /* Possibly capture `this'. */
9858 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THIS
))
9860 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9861 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_COPY
)
9862 pedwarn (loc
, 0, "explicit by-copy capture of %<this%> redundant "
9863 "with by-copy capture default");
9864 cp_lexer_consume_token (parser
->lexer
);
9865 add_capture (lambda_expr
,
9866 /*id=*/this_identifier
,
9867 /*initializer=*/finish_this_expr(),
9868 /*by_reference_p=*/false,
9873 /* Remember whether we want to capture as a reference or not. */
9874 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
))
9876 capture_kind
= BY_REFERENCE
;
9877 cp_lexer_consume_token (parser
->lexer
);
9880 /* Get the identifier. */
9881 capture_token
= cp_lexer_peek_token (parser
->lexer
);
9882 capture_id
= cp_parser_identifier (parser
);
9884 if (capture_id
== error_mark_node
)
9885 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9886 delimiters, but I modified this to stop on unnested ']' as well. It
9887 was already changed to stop on unnested '}', so the
9888 "closing_parenthesis" name is no more misleading with my change. */
9890 cp_parser_skip_to_closing_parenthesis (parser
,
9891 /*recovering=*/true,
9893 /*consume_paren=*/true);
9897 /* Find the initializer for this capture. */
9898 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
)
9899 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
9900 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9902 bool direct
, non_constant
;
9903 /* An explicit initializer exists. */
9904 if (cxx_dialect
< cxx14
)
9905 pedwarn (input_location
, 0,
9906 "lambda capture initializers "
9907 "only available with -std=c++14 or -std=gnu++14");
9908 capture_init_expr
= cp_parser_initializer (parser
, &direct
,
9910 explicit_init_p
= true;
9911 if (capture_init_expr
== NULL_TREE
)
9913 error ("empty initializer for lambda init-capture");
9914 capture_init_expr
= error_mark_node
;
9919 const char* error_msg
;
9921 /* Turn the identifier into an id-expression. */
9923 = cp_parser_lookup_name_simple (parser
, capture_id
,
9924 capture_token
->location
);
9926 if (capture_init_expr
== error_mark_node
)
9928 unqualified_name_lookup_error (capture_id
);
9931 else if (DECL_P (capture_init_expr
)
9932 && (!VAR_P (capture_init_expr
)
9933 && TREE_CODE (capture_init_expr
) != PARM_DECL
))
9935 error_at (capture_token
->location
,
9936 "capture of non-variable %qD ",
9938 inform (DECL_SOURCE_LOCATION (capture_init_expr
),
9939 "%q#D declared here", capture_init_expr
);
9942 if (VAR_P (capture_init_expr
)
9943 && decl_storage_duration (capture_init_expr
) != dk_auto
)
9945 if (pedwarn (capture_token
->location
, 0, "capture of variable "
9946 "%qD with non-automatic storage duration",
9948 inform (DECL_SOURCE_LOCATION (capture_init_expr
),
9949 "%q#D declared here", capture_init_expr
);
9954 = finish_id_expression
9959 /*integral_constant_expression_p=*/false,
9960 /*allow_non_integral_constant_expression_p=*/false,
9961 /*non_integral_constant_expression_p=*/NULL
,
9962 /*template_p=*/false,
9964 /*address_p=*/false,
9965 /*template_arg_p=*/false,
9967 capture_token
->location
);
9969 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
9971 cp_lexer_consume_token (parser
->lexer
);
9972 capture_init_expr
= make_pack_expansion (capture_init_expr
);
9975 check_for_bare_parameter_packs (capture_init_expr
);
9978 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) != CPLD_NONE
9979 && !explicit_init_p
)
9981 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_COPY
9982 && capture_kind
== BY_COPY
)
9983 pedwarn (capture_token
->location
, 0, "explicit by-copy capture "
9984 "of %qD redundant with by-copy capture default",
9986 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_REFERENCE
9987 && capture_kind
== BY_REFERENCE
)
9988 pedwarn (capture_token
->location
, 0, "explicit by-reference "
9989 "capture of %qD redundant with by-reference capture "
9990 "default", capture_id
);
9993 add_capture (lambda_expr
,
9996 /*by_reference_p=*/capture_kind
== BY_REFERENCE
,
10000 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
10003 /* Parse the (optional) middle of a lambda expression.
10006 < template-parameter-list [opt] >
10007 ( parameter-declaration-clause [opt] )
10008 attribute-specifier [opt]
10010 exception-specification [opt]
10011 lambda-return-type-clause [opt]
10013 LAMBDA_EXPR is the current representation of the lambda expression. */
10016 cp_parser_lambda_declarator_opt (cp_parser
* parser
, tree lambda_expr
)
10018 /* 5.1.1.4 of the standard says:
10019 If a lambda-expression does not include a lambda-declarator, it is as if
10020 the lambda-declarator were ().
10021 This means an empty parameter list, no attributes, and no exception
10023 tree param_list
= void_list_node
;
10024 tree attributes
= NULL_TREE
;
10025 tree exception_spec
= NULL_TREE
;
10026 tree template_param_list
= NULL_TREE
;
10027 tree tx_qual
= NULL_TREE
;
10029 /* The template-parameter-list is optional, but must begin with
10030 an opening angle if present. */
10031 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
10033 if (cxx_dialect
< cxx14
)
10034 pedwarn (parser
->lexer
->next_token
->location
, 0,
10035 "lambda templates are only available with "
10036 "-std=c++14 or -std=gnu++14");
10038 cp_lexer_consume_token (parser
->lexer
);
10040 template_param_list
= cp_parser_template_parameter_list (parser
);
10042 cp_parser_skip_to_end_of_template_parameter_list (parser
);
10044 /* We just processed one more parameter list. */
10045 ++parser
->num_template_parameter_lists
;
10048 /* The parameter-declaration-clause is optional (unless
10049 template-parameter-list was given), but must begin with an
10050 opening parenthesis if present. */
10051 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
10053 cp_lexer_consume_token (parser
->lexer
);
10055 begin_scope (sk_function_parms
, /*entity=*/NULL_TREE
);
10057 /* Parse parameters. */
10058 param_list
= cp_parser_parameter_declaration_clause (parser
);
10060 /* Default arguments shall not be specified in the
10061 parameter-declaration-clause of a lambda-declarator. */
10062 for (tree t
= param_list
; t
; t
= TREE_CHAIN (t
))
10063 if (TREE_PURPOSE (t
) && cxx_dialect
< cxx14
)
10064 pedwarn (DECL_SOURCE_LOCATION (TREE_VALUE (t
)), OPT_Wpedantic
,
10065 "default argument specified for lambda parameter");
10067 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
10069 attributes
= cp_parser_attributes_opt (parser
);
10071 /* Parse optional `mutable' keyword. */
10072 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_MUTABLE
))
10074 cp_lexer_consume_token (parser
->lexer
);
10075 LAMBDA_EXPR_MUTABLE_P (lambda_expr
) = 1;
10078 tx_qual
= cp_parser_tx_qualifier_opt (parser
);
10080 /* Parse optional exception specification. */
10081 exception_spec
= cp_parser_exception_specification_opt (parser
);
10083 /* Parse optional trailing return type. */
10084 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
10086 cp_lexer_consume_token (parser
->lexer
);
10087 LAMBDA_EXPR_RETURN_TYPE (lambda_expr
)
10088 = cp_parser_trailing_type_id (parser
);
10091 /* The function parameters must be in scope all the way until after the
10092 trailing-return-type in case of decltype. */
10093 pop_bindings_and_leave_scope ();
10095 else if (template_param_list
!= NULL_TREE
) // generate diagnostic
10096 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
10098 /* Create the function call operator.
10100 Messing with declarators like this is no uglier than building up the
10101 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10104 cp_decl_specifier_seq return_type_specs
;
10105 cp_declarator
* declarator
;
10110 clear_decl_specs (&return_type_specs
);
10111 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
10112 return_type_specs
.type
= LAMBDA_EXPR_RETURN_TYPE (lambda_expr
);
10114 /* Maybe we will deduce the return type later. */
10115 return_type_specs
.type
= make_auto ();
10117 p
= obstack_alloc (&declarator_obstack
, 0);
10119 declarator
= make_id_declarator (NULL_TREE
, ansi_opname (CALL_EXPR
),
10122 quals
= (LAMBDA_EXPR_MUTABLE_P (lambda_expr
)
10123 ? TYPE_UNQUALIFIED
: TYPE_QUAL_CONST
);
10124 declarator
= make_call_declarator (declarator
, param_list
, quals
,
10125 VIRT_SPEC_UNSPECIFIED
,
10129 /*late_return_type=*/NULL_TREE
,
10130 /*requires_clause*/NULL_TREE
);
10131 declarator
->id_loc
= LAMBDA_EXPR_LOCATION (lambda_expr
);
10133 fco
= grokmethod (&return_type_specs
,
10136 if (fco
!= error_mark_node
)
10138 DECL_INITIALIZED_IN_CLASS_P (fco
) = 1;
10139 DECL_ARTIFICIAL (fco
) = 1;
10140 /* Give the object parameter a different name. */
10141 DECL_NAME (DECL_ARGUMENTS (fco
)) = get_identifier ("__closure");
10142 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
10143 TYPE_HAS_LATE_RETURN_TYPE (TREE_TYPE (fco
)) = 1;
10145 if (template_param_list
)
10147 fco
= finish_member_template_decl (fco
);
10148 finish_template_decl (template_param_list
);
10149 --parser
->num_template_parameter_lists
;
10151 else if (parser
->fully_implicit_function_template_p
)
10152 fco
= finish_fully_implicit_template (parser
, fco
);
10154 finish_member_declaration (fco
);
10156 obstack_free (&declarator_obstack
, p
);
10158 return (fco
!= error_mark_node
);
10162 /* Parse the body of a lambda expression, which is simply
10166 but which requires special handling.
10167 LAMBDA_EXPR is the current representation of the lambda expression. */
10170 cp_parser_lambda_body (cp_parser
* parser
, tree lambda_expr
)
10172 bool nested
= (current_function_decl
!= NULL_TREE
);
10173 bool local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
10175 push_function_context ();
10177 /* Still increment function_depth so that we don't GC in the
10178 middle of an expression. */
10180 vec
<tree
> omp_privatization_save
;
10181 save_omp_privatization_clauses (omp_privatization_save
);
10182 /* Clear this in case we're in the middle of a default argument. */
10183 parser
->local_variables_forbidden_p
= false;
10185 /* Finish the function call operator
10187 + late_parsing_for_member
10188 + function_definition_after_declarator
10189 + ctor_initializer_opt_and_function_body */
10191 tree fco
= lambda_function (lambda_expr
);
10194 tree compound_stmt
;
10197 /* Let the front end know that we are going to be defining this
10199 start_preparsed_function (fco
,
10201 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
10203 start_lambda_scope (fco
);
10204 body
= begin_function_body ();
10206 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
10209 /* Push the proxies for any explicit captures. */
10210 for (cap
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
); cap
;
10211 cap
= TREE_CHAIN (cap
))
10212 build_capture_proxy (TREE_PURPOSE (cap
));
10214 compound_stmt
= begin_compound_stmt (0);
10216 /* 5.1.1.4 of the standard says:
10217 If a lambda-expression does not include a trailing-return-type, it
10218 is as if the trailing-return-type denotes the following type:
10219 * if the compound-statement is of the form
10220 { return attribute-specifier [opt] expression ; }
10221 the type of the returned expression after lvalue-to-rvalue
10222 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10223 (_conv.array_ 4.2), and function-to-pointer conversion
10225 * otherwise, void. */
10227 /* In a lambda that has neither a lambda-return-type-clause
10228 nor a deducible form, errors should be reported for return statements
10229 in the body. Since we used void as the placeholder return type, parsing
10230 the body as usual will give such desired behavior. */
10231 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr
)
10232 && cp_lexer_peek_nth_token (parser
->lexer
, 1)->keyword
== RID_RETURN
10233 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SEMICOLON
)
10235 tree expr
= NULL_TREE
;
10236 cp_id_kind idk
= CP_ID_KIND_NONE
;
10238 /* Parse tentatively in case there's more after the initial return
10240 cp_parser_parse_tentatively (parser
);
10242 cp_parser_require_keyword (parser
, RID_RETURN
, RT_RETURN
);
10244 expr
= cp_parser_expression (parser
, &idk
);
10246 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
10247 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
10249 if (cp_parser_parse_definitely (parser
))
10251 if (!processing_template_decl
)
10253 tree type
= lambda_return_type (expr
);
10254 apply_deduced_return_type (fco
, type
);
10255 if (type
== error_mark_node
)
10256 expr
= error_mark_node
;
10259 /* Will get error here if type not deduced yet. */
10260 finish_return_stmt (expr
);
10268 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
10269 cp_parser_label_declaration (parser
);
10270 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
10271 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
10274 finish_compound_stmt (compound_stmt
);
10277 finish_function_body (body
);
10278 finish_lambda_scope ();
10280 /* Finish the function and generate code for it if necessary. */
10281 tree fn
= finish_function (/*inline*/2);
10283 /* Only expand if the call op is not a template. */
10284 if (!DECL_TEMPLATE_INFO (fco
))
10285 expand_or_defer_fn (fn
);
10288 restore_omp_privatization_clauses (omp_privatization_save
);
10289 parser
->local_variables_forbidden_p
= local_variables_forbidden_p
;
10291 pop_function_context();
10296 /* Statements [gram.stmt.stmt] */
10298 /* Parse a statement.
10302 expression-statement
10304 selection-statement
10305 iteration-statement
10307 declaration-statement
10314 attribute-specifier-seq (opt) expression-statement
10315 attribute-specifier-seq (opt) compound-statement
10316 attribute-specifier-seq (opt) selection-statement
10317 attribute-specifier-seq (opt) iteration-statement
10318 attribute-specifier-seq (opt) jump-statement
10319 declaration-statement
10320 attribute-specifier-seq (opt) try-block
10327 IN_COMPOUND is true when the statement is nested inside a
10328 cp_parser_compound_statement; this matters for certain pragmas.
10330 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10331 is a (possibly labeled) if statement which is not enclosed in braces
10332 and has an else clause. This is used to implement -Wparentheses.
10334 CHAIN is a vector of if-else-if conditions. */
10337 cp_parser_statement (cp_parser
* parser
, tree in_statement_expr
,
10338 bool in_compound
, bool *if_p
, vec
<tree
> *chain
)
10340 tree statement
, std_attrs
= NULL_TREE
;
10342 location_t statement_location
, attrs_location
;
10347 /* There is no statement yet. */
10348 statement
= NULL_TREE
;
10350 saved_token_sentinel
saved_tokens (parser
->lexer
);
10351 attrs_location
= cp_lexer_peek_token (parser
->lexer
)->location
;
10352 if (c_dialect_objc ())
10353 /* In obj-c++, seeing '[[' might be the either the beginning of
10354 c++11 attributes, or a nested objc-message-expression. So
10355 let's parse the c++11 attributes tentatively. */
10356 cp_parser_parse_tentatively (parser
);
10357 std_attrs
= cp_parser_std_attribute_spec_seq (parser
);
10358 if (c_dialect_objc ())
10360 if (!cp_parser_parse_definitely (parser
))
10361 std_attrs
= NULL_TREE
;
10364 /* Peek at the next token. */
10365 token
= cp_lexer_peek_token (parser
->lexer
);
10366 /* Remember the location of the first token in the statement. */
10367 statement_location
= token
->location
;
10368 /* If this is a keyword, then that will often determine what kind of
10369 statement we have. */
10370 if (token
->type
== CPP_KEYWORD
)
10372 enum rid keyword
= token
->keyword
;
10378 /* Looks like a labeled-statement with a case label.
10379 Parse the label, and then use tail recursion to parse
10381 cp_parser_label_for_labeled_statement (parser
, std_attrs
);
10382 in_compound
= false;
10387 statement
= cp_parser_selection_statement (parser
, if_p
, chain
);
10393 statement
= cp_parser_iteration_statement (parser
, if_p
, false);
10397 if (!flag_cilkplus
)
10399 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
10400 "-fcilkplus must be enabled to use %<_Cilk_for%>");
10401 cp_lexer_consume_token (parser
->lexer
);
10402 statement
= error_mark_node
;
10405 statement
= cp_parser_cilk_for (parser
, integer_zero_node
, if_p
);
10412 statement
= cp_parser_jump_statement (parser
);
10415 case RID_CILK_SYNC
:
10416 cp_lexer_consume_token (parser
->lexer
);
10419 tree sync_expr
= build_cilk_sync ();
10420 SET_EXPR_LOCATION (sync_expr
,
10422 statement
= finish_expr_stmt (sync_expr
);
10426 error_at (token
->location
, "-fcilkplus must be enabled to use"
10427 " %<_Cilk_sync%>");
10428 statement
= error_mark_node
;
10430 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
10433 /* Objective-C++ exception-handling constructs. */
10436 case RID_AT_FINALLY
:
10437 case RID_AT_SYNCHRONIZED
:
10439 statement
= cp_parser_objc_statement (parser
);
10443 statement
= cp_parser_try_block (parser
);
10446 case RID_NAMESPACE
:
10447 /* This must be a namespace alias definition. */
10448 cp_parser_declaration_statement (parser
);
10451 case RID_TRANSACTION_ATOMIC
:
10452 case RID_TRANSACTION_RELAXED
:
10453 case RID_SYNCHRONIZED
:
10454 case RID_ATOMIC_NOEXCEPT
:
10455 case RID_ATOMIC_CANCEL
:
10456 statement
= cp_parser_transaction (parser
, token
);
10458 case RID_TRANSACTION_CANCEL
:
10459 statement
= cp_parser_transaction_cancel (parser
);
10463 /* It might be a keyword like `int' that can start a
10464 declaration-statement. */
10468 else if (token
->type
== CPP_NAME
)
10470 /* If the next token is a `:', then we are looking at a
10471 labeled-statement. */
10472 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
10473 if (token
->type
== CPP_COLON
)
10475 /* Looks like a labeled-statement with an ordinary label.
10476 Parse the label, and then use tail recursion to parse
10479 cp_parser_label_for_labeled_statement (parser
, std_attrs
);
10480 in_compound
= false;
10484 /* Anything that starts with a `{' must be a compound-statement. */
10485 else if (token
->type
== CPP_OPEN_BRACE
)
10486 statement
= cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
10487 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10488 a statement all its own. */
10489 else if (token
->type
== CPP_PRAGMA
)
10491 /* Only certain OpenMP pragmas are attached to statements, and thus
10492 are considered statements themselves. All others are not. In
10493 the context of a compound, accept the pragma as a "statement" and
10494 return so that we can check for a close brace. Otherwise we
10495 require a real statement and must go back and read one. */
10497 cp_parser_pragma (parser
, pragma_compound
, if_p
);
10498 else if (!cp_parser_pragma (parser
, pragma_stmt
, if_p
))
10502 else if (token
->type
== CPP_EOF
)
10504 cp_parser_error (parser
, "expected statement");
10508 /* Everything else must be a declaration-statement or an
10509 expression-statement. Try for the declaration-statement
10510 first, unless we are looking at a `;', in which case we know that
10511 we have an expression-statement. */
10514 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
10516 if (std_attrs
!= NULL_TREE
)
10518 /* Attributes should be parsed as part of the the
10519 declaration, so let's un-parse them. */
10520 saved_tokens
.rollback();
10521 std_attrs
= NULL_TREE
;
10524 cp_parser_parse_tentatively (parser
);
10525 /* Try to parse the declaration-statement. */
10526 cp_parser_declaration_statement (parser
);
10527 /* If that worked, we're done. */
10528 if (cp_parser_parse_definitely (parser
))
10531 /* Look for an expression-statement instead. */
10532 statement
= cp_parser_expression_statement (parser
, in_statement_expr
);
10535 /* Set the line number for the statement. */
10536 if (statement
&& STATEMENT_CODE_P (TREE_CODE (statement
)))
10537 SET_EXPR_LOCATION (statement
, statement_location
);
10539 /* Note that for now, we don't do anything with c++11 statements
10540 parsed at this level. */
10541 if (std_attrs
!= NULL_TREE
)
10542 warning_at (attrs_location
,
10544 "attributes at the beginning of statement are ignored");
10547 /* Parse the label for a labeled-statement, i.e.
10550 case constant-expression :
10554 case constant-expression ... constant-expression : statement
10556 When a label is parsed without errors, the label is added to the
10557 parse tree by the finish_* functions, so this function doesn't
10558 have to return the label. */
10561 cp_parser_label_for_labeled_statement (cp_parser
* parser
, tree attributes
)
10564 tree label
= NULL_TREE
;
10565 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
10567 /* The next token should be an identifier. */
10568 token
= cp_lexer_peek_token (parser
->lexer
);
10569 if (token
->type
!= CPP_NAME
10570 && token
->type
!= CPP_KEYWORD
)
10572 cp_parser_error (parser
, "expected labeled-statement");
10576 parser
->colon_corrects_to_scope_p
= false;
10577 switch (token
->keyword
)
10581 tree expr
, expr_hi
;
10582 cp_token
*ellipsis
;
10584 /* Consume the `case' token. */
10585 cp_lexer_consume_token (parser
->lexer
);
10586 /* Parse the constant-expression. */
10587 expr
= cp_parser_constant_expression (parser
);
10588 if (check_for_bare_parameter_packs (expr
))
10589 expr
= error_mark_node
;
10591 ellipsis
= cp_lexer_peek_token (parser
->lexer
);
10592 if (ellipsis
->type
== CPP_ELLIPSIS
)
10594 /* Consume the `...' token. */
10595 cp_lexer_consume_token (parser
->lexer
);
10596 expr_hi
= cp_parser_constant_expression (parser
);
10597 if (check_for_bare_parameter_packs (expr_hi
))
10598 expr_hi
= error_mark_node
;
10600 /* We don't need to emit warnings here, as the common code
10601 will do this for us. */
10604 expr_hi
= NULL_TREE
;
10606 if (parser
->in_switch_statement_p
)
10607 finish_case_label (token
->location
, expr
, expr_hi
);
10609 error_at (token
->location
,
10610 "case label %qE not within a switch statement",
10616 /* Consume the `default' token. */
10617 cp_lexer_consume_token (parser
->lexer
);
10619 if (parser
->in_switch_statement_p
)
10620 finish_case_label (token
->location
, NULL_TREE
, NULL_TREE
);
10622 error_at (token
->location
, "case label not within a switch statement");
10626 /* Anything else must be an ordinary label. */
10627 label
= finish_label_stmt (cp_parser_identifier (parser
));
10631 /* Require the `:' token. */
10632 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
10634 /* An ordinary label may optionally be followed by attributes.
10635 However, this is only permitted if the attributes are then
10636 followed by a semicolon. This is because, for backward
10637 compatibility, when parsing
10638 lab: __attribute__ ((unused)) int i;
10639 we want the attribute to attach to "i", not "lab". */
10640 if (label
!= NULL_TREE
10641 && cp_next_tokens_can_be_gnu_attribute_p (parser
))
10644 cp_parser_parse_tentatively (parser
);
10645 attrs
= cp_parser_gnu_attributes_opt (parser
);
10646 if (attrs
== NULL_TREE
10647 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
10648 cp_parser_abort_tentative_parse (parser
);
10649 else if (!cp_parser_parse_definitely (parser
))
10652 attributes
= chainon (attributes
, attrs
);
10655 if (attributes
!= NULL_TREE
)
10656 cplus_decl_attributes (&label
, attributes
, 0);
10658 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
10661 /* Parse an expression-statement.
10663 expression-statement:
10666 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10667 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10668 indicates whether this expression-statement is part of an
10669 expression statement. */
10672 cp_parser_expression_statement (cp_parser
* parser
, tree in_statement_expr
)
10674 tree statement
= NULL_TREE
;
10675 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10677 /* If the next token is a ';', then there is no expression
10679 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
10681 statement
= cp_parser_expression (parser
);
10682 if (statement
== error_mark_node
10683 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
10685 cp_parser_skip_to_end_of_block_or_statement (parser
);
10686 return error_mark_node
;
10690 /* Give a helpful message for "A<T>::type t;" and the like. */
10691 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
10692 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
10694 if (TREE_CODE (statement
) == SCOPE_REF
)
10695 error_at (token
->location
, "need %<typename%> before %qE because "
10696 "%qT is a dependent scope",
10697 statement
, TREE_OPERAND (statement
, 0));
10698 else if (is_overloaded_fn (statement
)
10699 && DECL_CONSTRUCTOR_P (get_first_fn (statement
)))
10702 tree fn
= get_first_fn (statement
);
10703 error_at (token
->location
,
10704 "%<%T::%D%> names the constructor, not the type",
10705 DECL_CONTEXT (fn
), DECL_NAME (fn
));
10709 /* Consume the final `;'. */
10710 cp_parser_consume_semicolon_at_end_of_statement (parser
);
10712 if (in_statement_expr
10713 && cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
10714 /* This is the final expression statement of a statement
10716 statement
= finish_stmt_expr_expr (statement
, in_statement_expr
);
10717 else if (statement
)
10718 statement
= finish_expr_stmt (statement
);
10723 /* Parse a compound-statement.
10725 compound-statement:
10726 { statement-seq [opt] }
10730 compound-statement:
10731 { label-declaration-seq [opt] statement-seq [opt] }
10733 label-declaration-seq:
10735 label-declaration-seq label-declaration
10737 Returns a tree representing the statement. */
10740 cp_parser_compound_statement (cp_parser
*parser
, tree in_statement_expr
,
10741 int bcs_flags
, bool function_body
)
10743 tree compound_stmt
;
10745 /* Consume the `{'. */
10746 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
10747 return error_mark_node
;
10748 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl
)
10749 && !function_body
&& cxx_dialect
< cxx14
)
10750 pedwarn (input_location
, OPT_Wpedantic
,
10751 "compound-statement in constexpr function");
10752 /* Begin the compound-statement. */
10753 compound_stmt
= begin_compound_stmt (bcs_flags
);
10754 /* If the next keyword is `__label__' we have a label declaration. */
10755 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
10756 cp_parser_label_declaration (parser
);
10757 /* Parse an (optional) statement-seq. */
10758 cp_parser_statement_seq_opt (parser
, in_statement_expr
);
10759 /* Finish the compound-statement. */
10760 finish_compound_stmt (compound_stmt
);
10761 /* Consume the `}'. */
10762 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
10764 return compound_stmt
;
10767 /* Parse an (optional) statement-seq.
10771 statement-seq [opt] statement */
10774 cp_parser_statement_seq_opt (cp_parser
* parser
, tree in_statement_expr
)
10776 /* Scan statements until there aren't any more. */
10779 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10781 /* If we are looking at a `}', then we have run out of
10782 statements; the same is true if we have reached the end
10783 of file, or have stumbled upon a stray '@end'. */
10784 if (token
->type
== CPP_CLOSE_BRACE
10785 || token
->type
== CPP_EOF
10786 || token
->type
== CPP_PRAGMA_EOL
10787 || (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_AT_END
))
10790 /* If we are in a compound statement and find 'else' then
10791 something went wrong. */
10792 else if (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ELSE
)
10794 if (parser
->in_statement
& IN_IF_STMT
)
10798 token
= cp_lexer_consume_token (parser
->lexer
);
10799 error_at (token
->location
, "%<else%> without a previous %<if%>");
10803 /* Parse the statement. */
10804 cp_parser_statement (parser
, in_statement_expr
, true, NULL
);
10808 /* Parse a selection-statement.
10810 selection-statement:
10811 if ( condition ) statement
10812 if ( condition ) statement else statement
10813 switch ( condition ) statement
10815 Returns the new IF_STMT or SWITCH_STMT.
10817 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10818 is a (possibly labeled) if statement which is not enclosed in
10819 braces and has an else clause. This is used to implement
10822 CHAIN is a vector of if-else-if conditions. This is used to implement
10823 -Wduplicated-cond. */
10826 cp_parser_selection_statement (cp_parser
* parser
, bool *if_p
,
10831 token_indent_info guard_tinfo
;
10836 /* Peek at the next token. */
10837 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_SELECT
);
10838 guard_tinfo
= get_token_indent_info (token
);
10840 /* See what kind of keyword it is. */
10841 keyword
= token
->keyword
;
10850 /* Look for the `('. */
10851 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
10853 cp_parser_skip_to_end_of_statement (parser
);
10854 return error_mark_node
;
10857 /* Begin the selection-statement. */
10858 if (keyword
== RID_IF
)
10859 statement
= begin_if_stmt ();
10861 statement
= begin_switch_stmt ();
10863 /* Parse the condition. */
10864 condition
= cp_parser_condition (parser
);
10865 /* Look for the `)'. */
10866 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
10867 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
10868 /*consume_paren=*/true);
10870 if (keyword
== RID_IF
)
10873 unsigned char in_statement
;
10875 /* Add the condition. */
10876 finish_if_stmt_cond (condition
, statement
);
10878 if (warn_duplicated_cond
)
10879 warn_duplicated_cond_add_or_warn (token
->location
, condition
,
10882 /* Parse the then-clause. */
10883 in_statement
= parser
->in_statement
;
10884 parser
->in_statement
|= IN_IF_STMT
;
10885 cp_parser_implicitly_scoped_statement (parser
, &nested_if
,
10887 parser
->in_statement
= in_statement
;
10889 finish_then_clause (statement
);
10891 /* If the next token is `else', parse the else-clause. */
10892 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
10896 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
10897 /* Consume the `else' keyword. */
10898 cp_lexer_consume_token (parser
->lexer
);
10899 if (warn_duplicated_cond
)
10901 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
10905 /* We've got "if (COND) else if (COND2)". Start
10906 the condition chain and add COND as the first
10908 chain
= new vec
<tree
> ();
10909 if (!CONSTANT_CLASS_P (condition
)
10910 && !TREE_SIDE_EFFECTS (condition
))
10912 /* Wrap it in a NOP_EXPR so that we can set the
10913 location of the condition. */
10914 tree e
= build1 (NOP_EXPR
, TREE_TYPE (condition
),
10916 SET_EXPR_LOCATION (e
, token
->location
);
10917 chain
->safe_push (e
);
10920 else if (!cp_lexer_next_token_is_keyword (parser
->lexer
,
10923 /* This is if-else without subsequent if. Zap the
10924 condition chain; we would have already warned at
10930 begin_else_clause (statement
);
10931 /* Parse the else-clause. */
10932 cp_parser_implicitly_scoped_statement (parser
, NULL
,
10933 guard_tinfo
, chain
);
10935 finish_else_clause (statement
);
10937 /* If we are currently parsing a then-clause, then
10938 IF_P will not be NULL. We set it to true to
10939 indicate that this if statement has an else clause.
10940 This may trigger the Wparentheses warning below
10941 when we get back up to the parent if statement. */
10947 /* This if statement does not have an else clause. If
10948 NESTED_IF is true, then the then-clause has an if
10949 statement which does have an else clause. We warn
10950 about the potential ambiguity. */
10952 warning_at (EXPR_LOCATION (statement
), OPT_Wdangling_else
,
10953 "suggest explicit braces to avoid ambiguous"
10955 if (warn_duplicated_cond
)
10957 /* We don't need the condition chain anymore. */
10963 /* Now we're all done with the if-statement. */
10964 finish_if_stmt (statement
);
10968 bool in_switch_statement_p
;
10969 unsigned char in_statement
;
10971 /* Add the condition. */
10972 finish_switch_cond (condition
, statement
);
10974 /* Parse the body of the switch-statement. */
10975 in_switch_statement_p
= parser
->in_switch_statement_p
;
10976 in_statement
= parser
->in_statement
;
10977 parser
->in_switch_statement_p
= true;
10978 parser
->in_statement
|= IN_SWITCH_STMT
;
10979 cp_parser_implicitly_scoped_statement (parser
, if_p
,
10981 parser
->in_switch_statement_p
= in_switch_statement_p
;
10982 parser
->in_statement
= in_statement
;
10984 /* Now we're all done with the switch-statement. */
10985 finish_switch_stmt (statement
);
10993 cp_parser_error (parser
, "expected selection-statement");
10994 return error_mark_node
;
10998 /* Parse a condition.
11002 type-specifier-seq declarator = initializer-clause
11003 type-specifier-seq declarator braced-init-list
11008 type-specifier-seq declarator asm-specification [opt]
11009 attributes [opt] = assignment-expression
11011 Returns the expression that should be tested. */
11014 cp_parser_condition (cp_parser
* parser
)
11016 cp_decl_specifier_seq type_specifiers
;
11017 const char *saved_message
;
11018 int declares_class_or_enum
;
11020 /* Try the declaration first. */
11021 cp_parser_parse_tentatively (parser
);
11022 /* New types are not allowed in the type-specifier-seq for a
11024 saved_message
= parser
->type_definition_forbidden_message
;
11025 parser
->type_definition_forbidden_message
11026 = G_("types may not be defined in conditions");
11027 /* Parse the type-specifier-seq. */
11028 cp_parser_decl_specifier_seq (parser
,
11029 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
,
11031 &declares_class_or_enum
);
11032 /* Restore the saved message. */
11033 parser
->type_definition_forbidden_message
= saved_message
;
11034 /* If all is well, we might be looking at a declaration. */
11035 if (!cp_parser_error_occurred (parser
))
11038 tree asm_specification
;
11040 cp_declarator
*declarator
;
11041 tree initializer
= NULL_TREE
;
11043 /* Parse the declarator. */
11044 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
11045 /*ctor_dtor_or_conv_p=*/NULL
,
11046 /*parenthesized_p=*/NULL
,
11047 /*member_p=*/false,
11048 /*friend_p=*/false);
11049 /* Parse the attributes. */
11050 attributes
= cp_parser_attributes_opt (parser
);
11051 /* Parse the asm-specification. */
11052 asm_specification
= cp_parser_asm_specification_opt (parser
);
11053 /* If the next token is not an `=' or '{', then we might still be
11054 looking at an expression. For example:
11058 looks like a decl-specifier-seq and a declarator -- but then
11059 there is no `=', so this is an expression. */
11060 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
11061 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
11062 cp_parser_simulate_error (parser
);
11064 /* If we did see an `=' or '{', then we are looking at a declaration
11066 if (cp_parser_parse_definitely (parser
))
11069 bool non_constant_p
;
11070 bool flags
= LOOKUP_ONLYCONVERTING
;
11072 /* Create the declaration. */
11073 decl
= start_decl (declarator
, &type_specifiers
,
11074 /*initialized_p=*/true,
11075 attributes
, /*prefix_attributes=*/NULL_TREE
,
11078 /* Parse the initializer. */
11079 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11081 initializer
= cp_parser_braced_list (parser
, &non_constant_p
);
11082 CONSTRUCTOR_IS_DIRECT_INIT (initializer
) = 1;
11087 /* Consume the `='. */
11088 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
11089 initializer
= cp_parser_initializer_clause (parser
, &non_constant_p
);
11091 if (BRACE_ENCLOSED_INITIALIZER_P (initializer
))
11092 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
11094 /* Process the initializer. */
11095 cp_finish_decl (decl
,
11096 initializer
, !non_constant_p
,
11101 pop_scope (pushed_scope
);
11103 return convert_from_reference (decl
);
11106 /* If we didn't even get past the declarator successfully, we are
11107 definitely not looking at a declaration. */
11109 cp_parser_abort_tentative_parse (parser
);
11111 /* Otherwise, we are looking at an expression. */
11112 return cp_parser_expression (parser
);
11115 /* Parses a for-statement or range-for-statement until the closing ')',
11119 cp_parser_for (cp_parser
*parser
, bool ivdep
)
11121 tree init
, scope
, decl
;
11124 /* Begin the for-statement. */
11125 scope
= begin_for_scope (&init
);
11127 /* Parse the initialization. */
11128 is_range_for
= cp_parser_for_init_statement (parser
, &decl
);
11131 return cp_parser_range_for (parser
, scope
, init
, decl
, ivdep
);
11133 return cp_parser_c_for (parser
, scope
, init
, ivdep
);
11137 cp_parser_c_for (cp_parser
*parser
, tree scope
, tree init
, bool ivdep
)
11139 /* Normal for loop */
11140 tree condition
= NULL_TREE
;
11141 tree expression
= NULL_TREE
;
11144 stmt
= begin_for_stmt (scope
, init
);
11145 /* The for-init-statement has already been parsed in
11146 cp_parser_for_init_statement, so no work is needed here. */
11147 finish_for_init_stmt (stmt
);
11149 /* If there's a condition, process it. */
11150 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
11151 condition
= cp_parser_condition (parser
);
11154 cp_parser_error (parser
, "missing loop condition in loop with "
11155 "%<GCC ivdep%> pragma");
11156 condition
= error_mark_node
;
11158 finish_for_cond (condition
, stmt
, ivdep
);
11159 /* Look for the `;'. */
11160 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11162 /* If there's an expression, process it. */
11163 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
11164 expression
= cp_parser_expression (parser
);
11165 finish_for_expr (expression
, stmt
);
11170 /* Tries to parse a range-based for-statement:
11173 decl-specifier-seq declarator : expression
11175 The decl-specifier-seq declarator and the `:' are already parsed by
11176 cp_parser_for_init_statement. If processing_template_decl it returns a
11177 newly created RANGE_FOR_STMT; if not, it is converted to a
11178 regular FOR_STMT. */
11181 cp_parser_range_for (cp_parser
*parser
, tree scope
, tree init
, tree range_decl
,
11184 tree stmt
, range_expr
;
11186 /* Get the range declaration momentarily out of the way so that
11187 the range expression doesn't clash with it. */
11188 if (range_decl
!= error_mark_node
)
11189 pop_binding (DECL_NAME (range_decl
), range_decl
);
11191 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11193 bool expr_non_constant_p
;
11194 range_expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
11197 range_expr
= cp_parser_expression (parser
);
11199 /* Put the range declaration back into scope. */
11200 if (range_decl
!= error_mark_node
)
11201 push_binding (DECL_NAME (range_decl
), range_decl
, current_binding_level
);
11203 /* If in template, STMT is converted to a normal for-statement
11204 at instantiation. If not, it is done just ahead. */
11205 if (processing_template_decl
)
11207 if (check_for_bare_parameter_packs (range_expr
))
11208 range_expr
= error_mark_node
;
11209 stmt
= begin_range_for_stmt (scope
, init
);
11211 RANGE_FOR_IVDEP (stmt
) = 1;
11212 finish_range_for_decl (stmt
, range_decl
, range_expr
);
11213 if (!type_dependent_expression_p (range_expr
)
11214 /* do_auto_deduction doesn't mess with template init-lists. */
11215 && !BRACE_ENCLOSED_INITIALIZER_P (range_expr
))
11216 do_range_for_auto_deduction (range_decl
, range_expr
);
11220 stmt
= begin_for_stmt (scope
, init
);
11221 stmt
= cp_convert_range_for (stmt
, range_decl
, range_expr
, ivdep
);
11226 /* Subroutine of cp_convert_range_for: given the initializer expression,
11227 builds up the range temporary. */
11230 build_range_temp (tree range_expr
)
11232 tree range_type
, range_temp
;
11234 /* Find out the type deduced by the declaration
11235 `auto &&__range = range_expr'. */
11236 range_type
= cp_build_reference_type (make_auto (), true);
11237 range_type
= do_auto_deduction (range_type
, range_expr
,
11238 type_uses_auto (range_type
));
11240 /* Create the __range variable. */
11241 range_temp
= build_decl (input_location
, VAR_DECL
,
11242 get_identifier ("__for_range"), range_type
);
11243 TREE_USED (range_temp
) = 1;
11244 DECL_ARTIFICIAL (range_temp
) = 1;
11249 /* Used by cp_parser_range_for in template context: we aren't going to
11250 do a full conversion yet, but we still need to resolve auto in the
11251 type of the for-range-declaration if present. This is basically
11252 a shortcut version of cp_convert_range_for. */
11255 do_range_for_auto_deduction (tree decl
, tree range_expr
)
11257 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
11260 tree begin_dummy
, end_dummy
, range_temp
, iter_type
, iter_decl
;
11261 range_temp
= convert_from_reference (build_range_temp (range_expr
));
11262 iter_type
= (cp_parser_perform_range_for_lookup
11263 (range_temp
, &begin_dummy
, &end_dummy
));
11266 iter_decl
= build_decl (input_location
, VAR_DECL
, NULL_TREE
,
11268 iter_decl
= build_x_indirect_ref (input_location
, iter_decl
, RO_NULL
,
11269 tf_warning_or_error
);
11270 TREE_TYPE (decl
) = do_auto_deduction (TREE_TYPE (decl
),
11271 iter_decl
, auto_node
);
11276 /* Converts a range-based for-statement into a normal
11277 for-statement, as per the definition.
11279 for (RANGE_DECL : RANGE_EXPR)
11282 should be equivalent to:
11285 auto &&__range = RANGE_EXPR;
11286 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11290 RANGE_DECL = *__begin;
11295 If RANGE_EXPR is an array:
11296 BEGIN_EXPR = __range
11297 END_EXPR = __range + ARRAY_SIZE(__range)
11298 Else if RANGE_EXPR has a member 'begin' or 'end':
11299 BEGIN_EXPR = __range.begin()
11300 END_EXPR = __range.end()
11302 BEGIN_EXPR = begin(__range)
11303 END_EXPR = end(__range);
11305 If __range has a member 'begin' but not 'end', or vice versa, we must
11306 still use the second alternative (it will surely fail, however).
11307 When calling begin()/end() in the third alternative we must use
11308 argument dependent lookup, but always considering 'std' as an associated
11312 cp_convert_range_for (tree statement
, tree range_decl
, tree range_expr
,
11316 tree iter_type
, begin_expr
, end_expr
;
11317 tree condition
, expression
;
11319 if (range_decl
== error_mark_node
|| range_expr
== error_mark_node
)
11320 /* If an error happened previously do nothing or else a lot of
11321 unhelpful errors would be issued. */
11322 begin_expr
= end_expr
= iter_type
= error_mark_node
;
11327 if (VAR_P (range_expr
)
11328 && array_of_runtime_bound_p (TREE_TYPE (range_expr
)))
11329 /* Can't bind a reference to an array of runtime bound. */
11330 range_temp
= range_expr
;
11333 range_temp
= build_range_temp (range_expr
);
11334 pushdecl (range_temp
);
11335 cp_finish_decl (range_temp
, range_expr
,
11336 /*is_constant_init*/false, NULL_TREE
,
11337 LOOKUP_ONLYCONVERTING
);
11338 range_temp
= convert_from_reference (range_temp
);
11340 iter_type
= cp_parser_perform_range_for_lookup (range_temp
,
11341 &begin_expr
, &end_expr
);
11344 /* The new for initialization statement. */
11345 begin
= build_decl (input_location
, VAR_DECL
,
11346 get_identifier ("__for_begin"), iter_type
);
11347 TREE_USED (begin
) = 1;
11348 DECL_ARTIFICIAL (begin
) = 1;
11350 cp_finish_decl (begin
, begin_expr
,
11351 /*is_constant_init*/false, NULL_TREE
,
11352 LOOKUP_ONLYCONVERTING
);
11354 if (cxx_dialect
>= cxx1z
)
11355 iter_type
= cv_unqualified (TREE_TYPE (end_expr
));
11356 end
= build_decl (input_location
, VAR_DECL
,
11357 get_identifier ("__for_end"), iter_type
);
11358 TREE_USED (end
) = 1;
11359 DECL_ARTIFICIAL (end
) = 1;
11361 cp_finish_decl (end
, end_expr
,
11362 /*is_constant_init*/false, NULL_TREE
,
11363 LOOKUP_ONLYCONVERTING
);
11365 finish_for_init_stmt (statement
);
11367 /* The new for condition. */
11368 condition
= build_x_binary_op (input_location
, NE_EXPR
,
11371 NULL
, tf_warning_or_error
);
11372 finish_for_cond (condition
, statement
, ivdep
);
11374 /* The new increment expression. */
11375 expression
= finish_unary_op_expr (input_location
,
11376 PREINCREMENT_EXPR
, begin
,
11377 tf_warning_or_error
);
11378 finish_for_expr (expression
, statement
);
11380 /* The declaration is initialized with *__begin inside the loop body. */
11381 cp_finish_decl (range_decl
,
11382 build_x_indirect_ref (input_location
, begin
, RO_NULL
,
11383 tf_warning_or_error
),
11384 /*is_constant_init*/false, NULL_TREE
,
11385 LOOKUP_ONLYCONVERTING
);
11390 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11391 We need to solve both at the same time because the method used
11392 depends on the existence of members begin or end.
11393 Returns the type deduced for the iterator expression. */
11396 cp_parser_perform_range_for_lookup (tree range
, tree
*begin
, tree
*end
)
11398 if (error_operand_p (range
))
11400 *begin
= *end
= error_mark_node
;
11401 return error_mark_node
;
11404 if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (range
))))
11406 error ("range-based %<for%> expression of type %qT "
11407 "has incomplete type", TREE_TYPE (range
));
11408 *begin
= *end
= error_mark_node
;
11409 return error_mark_node
;
11411 if (TREE_CODE (TREE_TYPE (range
)) == ARRAY_TYPE
)
11413 /* If RANGE is an array, we will use pointer arithmetic. */
11414 *begin
= decay_conversion (range
, tf_warning_or_error
);
11415 *end
= build_binary_op (input_location
, PLUS_EXPR
,
11417 array_type_nelts_top (TREE_TYPE (range
)),
11419 return TREE_TYPE (*begin
);
11423 /* If it is not an array, we must do a bit of magic. */
11424 tree id_begin
, id_end
;
11425 tree member_begin
, member_end
;
11427 *begin
= *end
= error_mark_node
;
11429 id_begin
= get_identifier ("begin");
11430 id_end
= get_identifier ("end");
11431 member_begin
= lookup_member (TREE_TYPE (range
), id_begin
,
11432 /*protect=*/2, /*want_type=*/false,
11433 tf_warning_or_error
);
11434 member_end
= lookup_member (TREE_TYPE (range
), id_end
,
11435 /*protect=*/2, /*want_type=*/false,
11436 tf_warning_or_error
);
11438 if (member_begin
!= NULL_TREE
|| member_end
!= NULL_TREE
)
11440 /* Use the member functions. */
11441 if (member_begin
!= NULL_TREE
)
11442 *begin
= cp_parser_range_for_member_function (range
, id_begin
);
11444 error ("range-based %<for%> expression of type %qT has an "
11445 "%<end%> member but not a %<begin%>", TREE_TYPE (range
));
11447 if (member_end
!= NULL_TREE
)
11448 *end
= cp_parser_range_for_member_function (range
, id_end
);
11450 error ("range-based %<for%> expression of type %qT has a "
11451 "%<begin%> member but not an %<end%>", TREE_TYPE (range
));
11455 /* Use global functions with ADL. */
11456 vec
<tree
, va_gc
> *vec
;
11457 vec
= make_tree_vector ();
11459 vec_safe_push (vec
, range
);
11461 member_begin
= perform_koenig_lookup (id_begin
, vec
,
11462 tf_warning_or_error
);
11463 *begin
= finish_call_expr (member_begin
, &vec
, false, true,
11464 tf_warning_or_error
);
11465 member_end
= perform_koenig_lookup (id_end
, vec
,
11466 tf_warning_or_error
);
11467 *end
= finish_call_expr (member_end
, &vec
, false, true,
11468 tf_warning_or_error
);
11470 release_tree_vector (vec
);
11473 /* Last common checks. */
11474 if (*begin
== error_mark_node
|| *end
== error_mark_node
)
11476 /* If one of the expressions is an error do no more checks. */
11477 *begin
= *end
= error_mark_node
;
11478 return error_mark_node
;
11480 else if (type_dependent_expression_p (*begin
)
11481 || type_dependent_expression_p (*end
))
11482 /* Can happen, when, eg, in a template context, Koenig lookup
11483 can't resolve begin/end (c++/58503). */
11487 tree iter_type
= cv_unqualified (TREE_TYPE (*begin
));
11488 /* The unqualified type of the __begin and __end temporaries should
11489 be the same, as required by the multiple auto declaration. */
11490 if (!same_type_p (iter_type
, cv_unqualified (TREE_TYPE (*end
))))
11492 if (cxx_dialect
>= cxx1z
11493 && (build_x_binary_op (input_location
, NE_EXPR
,
11494 *begin
, ERROR_MARK
,
11497 != error_mark_node
))
11498 /* P0184R0 allows __begin and __end to have different types,
11499 but make sure they are comparable so we can give a better
11502 error ("inconsistent begin/end types in range-based %<for%> "
11503 "statement: %qT and %qT",
11504 TREE_TYPE (*begin
), TREE_TYPE (*end
));
11511 /* Helper function for cp_parser_perform_range_for_lookup.
11512 Builds a tree for RANGE.IDENTIFIER(). */
11515 cp_parser_range_for_member_function (tree range
, tree identifier
)
11518 vec
<tree
, va_gc
> *vec
;
11520 member
= finish_class_member_access_expr (range
, identifier
,
11521 false, tf_warning_or_error
);
11522 if (member
== error_mark_node
)
11523 return error_mark_node
;
11525 vec
= make_tree_vector ();
11526 res
= finish_call_expr (member
, &vec
,
11527 /*disallow_virtual=*/false,
11528 /*koenig_p=*/false,
11529 tf_warning_or_error
);
11530 release_tree_vector (vec
);
11534 /* Parse an iteration-statement.
11536 iteration-statement:
11537 while ( condition ) statement
11538 do statement while ( expression ) ;
11539 for ( for-init-statement condition [opt] ; expression [opt] )
11542 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11545 cp_parser_iteration_statement (cp_parser
* parser
, bool *if_p
, bool ivdep
)
11550 unsigned char in_statement
;
11551 token_indent_info guard_tinfo
;
11553 /* Peek at the next token. */
11554 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_INTERATION
);
11556 return error_mark_node
;
11558 guard_tinfo
= get_token_indent_info (token
);
11560 /* Remember whether or not we are already within an iteration
11562 in_statement
= parser
->in_statement
;
11564 /* See what kind of keyword it is. */
11565 keyword
= token
->keyword
;
11572 /* Begin the while-statement. */
11573 statement
= begin_while_stmt ();
11574 /* Look for the `('. */
11575 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
11576 /* Parse the condition. */
11577 condition
= cp_parser_condition (parser
);
11578 finish_while_stmt_cond (condition
, statement
, ivdep
);
11579 /* Look for the `)'. */
11580 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
11581 /* Parse the dependent statement. */
11582 parser
->in_statement
= IN_ITERATION_STMT
;
11583 cp_parser_already_scoped_statement (parser
, if_p
, guard_tinfo
);
11584 parser
->in_statement
= in_statement
;
11585 /* We're done with the while-statement. */
11586 finish_while_stmt (statement
);
11594 /* Begin the do-statement. */
11595 statement
= begin_do_stmt ();
11596 /* Parse the body of the do-statement. */
11597 parser
->in_statement
= IN_ITERATION_STMT
;
11598 cp_parser_implicitly_scoped_statement (parser
, NULL
, guard_tinfo
);
11599 parser
->in_statement
= in_statement
;
11600 finish_do_body (statement
);
11601 /* Look for the `while' keyword. */
11602 cp_parser_require_keyword (parser
, RID_WHILE
, RT_WHILE
);
11603 /* Look for the `('. */
11604 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
11605 /* Parse the expression. */
11606 expression
= cp_parser_expression (parser
);
11607 /* We're done with the do-statement. */
11608 finish_do_stmt (expression
, statement
, ivdep
);
11609 /* Look for the `)'. */
11610 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
11611 /* Look for the `;'. */
11612 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11618 /* Look for the `('. */
11619 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
11621 statement
= cp_parser_for (parser
, ivdep
);
11623 /* Look for the `)'. */
11624 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
11626 /* Parse the body of the for-statement. */
11627 parser
->in_statement
= IN_ITERATION_STMT
;
11628 cp_parser_already_scoped_statement (parser
, if_p
, guard_tinfo
);
11629 parser
->in_statement
= in_statement
;
11631 /* We're done with the for-statement. */
11632 finish_for_stmt (statement
);
11637 cp_parser_error (parser
, "expected iteration-statement");
11638 statement
= error_mark_node
;
11645 /* Parse a for-init-statement or the declarator of a range-based-for.
11646 Returns true if a range-based-for declaration is seen.
11648 for-init-statement:
11649 expression-statement
11650 simple-declaration */
11653 cp_parser_for_init_statement (cp_parser
* parser
, tree
*decl
)
11655 /* If the next token is a `;', then we have an empty
11656 expression-statement. Grammatically, this is also a
11657 simple-declaration, but an invalid one, because it does not
11658 declare anything. Therefore, if we did not handle this case
11659 specially, we would issue an error message about an invalid
11661 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
11663 bool is_range_for
= false;
11664 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
11666 /* A colon is used in range-based for. */
11667 parser
->colon_corrects_to_scope_p
= false;
11669 /* We're going to speculatively look for a declaration, falling back
11670 to an expression, if necessary. */
11671 cp_parser_parse_tentatively (parser
);
11672 /* Parse the declaration. */
11673 cp_parser_simple_declaration (parser
,
11674 /*function_definition_allowed_p=*/false,
11676 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
11677 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
11679 /* It is a range-for, consume the ':' */
11680 cp_lexer_consume_token (parser
->lexer
);
11681 is_range_for
= true;
11682 if (cxx_dialect
< cxx11
)
11684 pedwarn (cp_lexer_peek_token (parser
->lexer
)->location
, 0,
11685 "range-based %<for%> loops only available with "
11686 "-std=c++11 or -std=gnu++11");
11687 *decl
= error_mark_node
;
11691 /* The ';' is not consumed yet because we told
11692 cp_parser_simple_declaration not to. */
11693 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11695 if (cp_parser_parse_definitely (parser
))
11696 return is_range_for
;
11697 /* If the tentative parse failed, then we shall need to look for an
11698 expression-statement. */
11700 /* If we are here, it is an expression-statement. */
11701 cp_parser_expression_statement (parser
, NULL_TREE
);
11705 /* Parse a jump-statement.
11710 return expression [opt] ;
11711 return braced-init-list ;
11717 goto * expression ;
11719 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11722 cp_parser_jump_statement (cp_parser
* parser
)
11724 tree statement
= error_mark_node
;
11727 unsigned char in_statement
;
11729 /* Peek at the next token. */
11730 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_JUMP
);
11732 return error_mark_node
;
11734 /* See what kind of keyword it is. */
11735 keyword
= token
->keyword
;
11739 in_statement
= parser
->in_statement
& ~IN_IF_STMT
;
11740 switch (in_statement
)
11743 error_at (token
->location
, "break statement not within loop or switch");
11746 gcc_assert ((in_statement
& IN_SWITCH_STMT
)
11747 || in_statement
== IN_ITERATION_STMT
);
11748 statement
= finish_break_stmt ();
11749 if (in_statement
== IN_ITERATION_STMT
)
11750 break_maybe_infinite_loop ();
11753 error_at (token
->location
, "invalid exit from OpenMP structured block");
11756 error_at (token
->location
, "break statement used with OpenMP for loop");
11758 case IN_CILK_SIMD_FOR
:
11759 error_at (token
->location
, "break statement used with Cilk Plus for loop");
11762 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11766 switch (parser
->in_statement
& ~(IN_SWITCH_STMT
| IN_IF_STMT
))
11769 error_at (token
->location
, "continue statement not within a loop");
11771 case IN_CILK_SIMD_FOR
:
11772 error_at (token
->location
,
11773 "continue statement within %<#pragma simd%> loop body");
11774 /* Fall through. */
11775 case IN_ITERATION_STMT
:
11777 statement
= finish_continue_stmt ();
11780 error_at (token
->location
, "invalid exit from OpenMP structured block");
11783 gcc_unreachable ();
11785 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11791 bool expr_non_constant_p
;
11793 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11795 cp_lexer_set_source_position (parser
->lexer
);
11796 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
11797 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
11799 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
11800 expr
= cp_parser_expression (parser
);
11802 /* If the next token is a `;', then there is no
11805 /* Build the return-statement. */
11806 statement
= finish_return_stmt (expr
);
11807 /* Look for the final `;'. */
11808 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11813 if (parser
->in_function_body
11814 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
11816 error ("%<goto%> in %<constexpr%> function");
11817 cp_function_chain
->invalid_constexpr
= true;
11820 /* Create the goto-statement. */
11821 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
))
11823 /* Issue a warning about this use of a GNU extension. */
11824 pedwarn (token
->location
, OPT_Wpedantic
, "ISO C++ forbids computed gotos");
11825 /* Consume the '*' token. */
11826 cp_lexer_consume_token (parser
->lexer
);
11827 /* Parse the dependent expression. */
11828 finish_goto_stmt (cp_parser_expression (parser
));
11831 finish_goto_stmt (cp_parser_identifier (parser
));
11832 /* Look for the final `;'. */
11833 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
11837 cp_parser_error (parser
, "expected jump-statement");
11844 /* Parse a declaration-statement.
11846 declaration-statement:
11847 block-declaration */
11850 cp_parser_declaration_statement (cp_parser
* parser
)
11854 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11855 p
= obstack_alloc (&declarator_obstack
, 0);
11857 /* Parse the block-declaration. */
11858 cp_parser_block_declaration (parser
, /*statement_p=*/true);
11860 /* Free any declarators allocated. */
11861 obstack_free (&declarator_obstack
, p
);
11864 /* Some dependent statements (like `if (cond) statement'), are
11865 implicitly in their own scope. In other words, if the statement is
11866 a single statement (as opposed to a compound-statement), it is
11867 none-the-less treated as if it were enclosed in braces. Any
11868 declarations appearing in the dependent statement are out of scope
11869 after control passes that point. This function parses a statement,
11870 but ensures that is in its own scope, even if it is not a
11871 compound-statement.
11873 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11874 is a (possibly labeled) if statement which is not enclosed in
11875 braces and has an else clause. This is used to implement
11878 CHAIN is a vector of if-else-if conditions. This is used to implement
11881 Returns the new statement. */
11884 cp_parser_implicitly_scoped_statement (cp_parser
* parser
, bool *if_p
,
11885 const token_indent_info
&guard_tinfo
,
11889 location_t body_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
11890 token_indent_info body_tinfo
11891 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
11896 /* Mark if () ; with a special NOP_EXPR. */
11897 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
11899 cp_lexer_consume_token (parser
->lexer
);
11900 statement
= add_stmt (build_empty_stmt (body_loc
));
11902 if (guard_tinfo
.keyword
== RID_IF
11903 && !cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ELSE
))
11904 warning_at (body_loc
, OPT_Wempty_body
,
11905 "suggest braces around empty body in an %<if%> statement");
11906 else if (guard_tinfo
.keyword
== RID_ELSE
)
11907 warning_at (body_loc
, OPT_Wempty_body
,
11908 "suggest braces around empty body in an %<else%> statement");
11910 /* if a compound is opened, we simply parse the statement directly. */
11911 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11912 statement
= cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
11913 /* If the token is not a `{', then we must take special action. */
11916 /* Create a compound-statement. */
11917 statement
= begin_compound_stmt (0);
11918 /* Parse the dependent-statement. */
11919 cp_parser_statement (parser
, NULL_TREE
, false, if_p
, chain
);
11920 /* Finish the dummy compound-statement. */
11921 finish_compound_stmt (statement
);
11924 token_indent_info next_tinfo
11925 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
11926 warn_for_misleading_indentation (guard_tinfo
, body_tinfo
, next_tinfo
);
11928 /* Return the statement. */
11932 /* For some dependent statements (like `while (cond) statement'), we
11933 have already created a scope. Therefore, even if the dependent
11934 statement is a compound-statement, we do not want to create another
11938 cp_parser_already_scoped_statement (cp_parser
* parser
, bool *if_p
,
11939 const token_indent_info
&guard_tinfo
)
11941 /* If the token is a `{', then we must take special action. */
11942 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
11944 token_indent_info body_tinfo
11945 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
11947 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
11948 token_indent_info next_tinfo
11949 = get_token_indent_info (cp_lexer_peek_token (parser
->lexer
));
11950 warn_for_misleading_indentation (guard_tinfo
, body_tinfo
, next_tinfo
);
11954 /* Avoid calling cp_parser_compound_statement, so that we
11955 don't create a new scope. Do everything else by hand. */
11956 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
11957 /* If the next keyword is `__label__' we have a label declaration. */
11958 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
11959 cp_parser_label_declaration (parser
);
11960 /* Parse an (optional) statement-seq. */
11961 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
11962 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
11966 /* Declarations [gram.dcl.dcl] */
11968 /* Parse an optional declaration-sequence.
11972 declaration-seq declaration */
11975 cp_parser_declaration_seq_opt (cp_parser
* parser
)
11981 token
= cp_lexer_peek_token (parser
->lexer
);
11983 if (token
->type
== CPP_CLOSE_BRACE
11984 || token
->type
== CPP_EOF
11985 || token
->type
== CPP_PRAGMA_EOL
)
11988 if (token
->type
== CPP_SEMICOLON
)
11990 /* A declaration consisting of a single semicolon is
11991 invalid. Allow it unless we're being pedantic. */
11992 cp_lexer_consume_token (parser
->lexer
);
11993 if (!in_system_header_at (input_location
))
11994 pedwarn (input_location
, OPT_Wpedantic
, "extra %<;%>");
11998 /* If we're entering or exiting a region that's implicitly
11999 extern "C", modify the lang context appropriately. */
12000 if (!parser
->implicit_extern_c
&& token
->implicit_extern_c
)
12002 push_lang_context (lang_name_c
);
12003 parser
->implicit_extern_c
= true;
12005 else if (parser
->implicit_extern_c
&& !token
->implicit_extern_c
)
12007 pop_lang_context ();
12008 parser
->implicit_extern_c
= false;
12011 if (token
->type
== CPP_PRAGMA
)
12013 /* A top-level declaration can consist solely of a #pragma.
12014 A nested declaration cannot, so this is done here and not
12015 in cp_parser_declaration. (A #pragma at block scope is
12016 handled in cp_parser_statement.) */
12017 cp_parser_pragma (parser
, pragma_external
, NULL
);
12021 /* Parse the declaration itself. */
12022 cp_parser_declaration (parser
);
12026 /* Parse a declaration.
12030 function-definition
12031 template-declaration
12032 explicit-instantiation
12033 explicit-specialization
12034 linkage-specification
12035 namespace-definition
12040 __extension__ declaration */
12043 cp_parser_declaration (cp_parser
* parser
)
12047 int saved_pedantic
;
12049 tree attributes
= NULL_TREE
;
12051 /* Check for the `__extension__' keyword. */
12052 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
12054 /* Parse the qualified declaration. */
12055 cp_parser_declaration (parser
);
12056 /* Restore the PEDANTIC flag. */
12057 pedantic
= saved_pedantic
;
12062 /* Try to figure out what kind of declaration is present. */
12063 token1
= *cp_lexer_peek_token (parser
->lexer
);
12065 if (token1
.type
!= CPP_EOF
)
12066 token2
= *cp_lexer_peek_nth_token (parser
->lexer
, 2);
12069 token2
.type
= CPP_EOF
;
12070 token2
.keyword
= RID_MAX
;
12073 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12074 p
= obstack_alloc (&declarator_obstack
, 0);
12076 /* If the next token is `extern' and the following token is a string
12077 literal, then we have a linkage specification. */
12078 if (token1
.keyword
== RID_EXTERN
12079 && cp_parser_is_pure_string_literal (&token2
))
12080 cp_parser_linkage_specification (parser
);
12081 /* If the next token is `template', then we have either a template
12082 declaration, an explicit instantiation, or an explicit
12084 else if (token1
.keyword
== RID_TEMPLATE
)
12086 /* `template <>' indicates a template specialization. */
12087 if (token2
.type
== CPP_LESS
12088 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
12089 cp_parser_explicit_specialization (parser
);
12090 /* `template <' indicates a template declaration. */
12091 else if (token2
.type
== CPP_LESS
)
12092 cp_parser_template_declaration (parser
, /*member_p=*/false);
12093 /* Anything else must be an explicit instantiation. */
12095 cp_parser_explicit_instantiation (parser
);
12097 /* If the next token is `export', then we have a template
12099 else if (token1
.keyword
== RID_EXPORT
)
12100 cp_parser_template_declaration (parser
, /*member_p=*/false);
12101 /* If the next token is `extern', 'static' or 'inline' and the one
12102 after that is `template', we have a GNU extended explicit
12103 instantiation directive. */
12104 else if (cp_parser_allow_gnu_extensions_p (parser
)
12105 && (token1
.keyword
== RID_EXTERN
12106 || token1
.keyword
== RID_STATIC
12107 || token1
.keyword
== RID_INLINE
)
12108 && token2
.keyword
== RID_TEMPLATE
)
12109 cp_parser_explicit_instantiation (parser
);
12110 /* If the next token is `namespace', check for a named or unnamed
12111 namespace definition. */
12112 else if (token1
.keyword
== RID_NAMESPACE
12113 && (/* A named namespace definition. */
12114 (token2
.type
== CPP_NAME
12115 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
12117 || (token2
.type
== CPP_OPEN_SQUARE
12118 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
12119 == CPP_OPEN_SQUARE
)
12120 /* An unnamed namespace definition. */
12121 || token2
.type
== CPP_OPEN_BRACE
12122 || token2
.keyword
== RID_ATTRIBUTE
))
12123 cp_parser_namespace_definition (parser
);
12124 /* An inline (associated) namespace definition. */
12125 else if (token1
.keyword
== RID_INLINE
12126 && token2
.keyword
== RID_NAMESPACE
)
12127 cp_parser_namespace_definition (parser
);
12128 /* Objective-C++ declaration/definition. */
12129 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1
.keyword
))
12130 cp_parser_objc_declaration (parser
, NULL_TREE
);
12131 else if (c_dialect_objc ()
12132 && token1
.keyword
== RID_ATTRIBUTE
12133 && cp_parser_objc_valid_prefix_attributes (parser
, &attributes
))
12134 cp_parser_objc_declaration (parser
, attributes
);
12135 /* At this point we may have a template declared by a concept
12137 else if (flag_concepts
12138 && cp_parser_template_declaration_after_export (parser
,
12139 /*member_p=*/false))
12142 /* Try to parse a block-declaration, or a function-definition. */
12143 cp_parser_block_declaration (parser
, /*statement_p=*/false);
12145 /* Free any declarators allocated. */
12146 obstack_free (&declarator_obstack
, p
);
12149 /* Parse a block-declaration.
12154 namespace-alias-definition
12161 __extension__ block-declaration
12166 static_assert-declaration
12168 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12169 part of a declaration-statement. */
12172 cp_parser_block_declaration (cp_parser
*parser
,
12176 int saved_pedantic
;
12178 /* Check for the `__extension__' keyword. */
12179 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
12181 /* Parse the qualified declaration. */
12182 cp_parser_block_declaration (parser
, statement_p
);
12183 /* Restore the PEDANTIC flag. */
12184 pedantic
= saved_pedantic
;
12189 /* Peek at the next token to figure out which kind of declaration is
12191 token1
= cp_lexer_peek_token (parser
->lexer
);
12193 /* If the next keyword is `asm', we have an asm-definition. */
12194 if (token1
->keyword
== RID_ASM
)
12197 cp_parser_commit_to_tentative_parse (parser
);
12198 cp_parser_asm_definition (parser
);
12200 /* If the next keyword is `namespace', we have a
12201 namespace-alias-definition. */
12202 else if (token1
->keyword
== RID_NAMESPACE
)
12203 cp_parser_namespace_alias_definition (parser
);
12204 /* If the next keyword is `using', we have a
12205 using-declaration, a using-directive, or an alias-declaration. */
12206 else if (token1
->keyword
== RID_USING
)
12211 cp_parser_commit_to_tentative_parse (parser
);
12212 /* If the token after `using' is `namespace', then we have a
12213 using-directive. */
12214 token2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
12215 if (token2
->keyword
== RID_NAMESPACE
)
12216 cp_parser_using_directive (parser
);
12217 /* If the second token after 'using' is '=', then we have an
12218 alias-declaration. */
12219 else if (cxx_dialect
>= cxx11
12220 && token2
->type
== CPP_NAME
12221 && ((cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_EQ
)
12222 || (cp_nth_tokens_can_be_attribute_p (parser
, 3))))
12223 cp_parser_alias_declaration (parser
);
12224 /* Otherwise, it's a using-declaration. */
12226 cp_parser_using_declaration (parser
,
12227 /*access_declaration_p=*/false);
12229 /* If the next keyword is `__label__' we have a misplaced label
12231 else if (token1
->keyword
== RID_LABEL
)
12233 cp_lexer_consume_token (parser
->lexer
);
12234 error_at (token1
->location
, "%<__label__%> not at the beginning of a block");
12235 cp_parser_skip_to_end_of_statement (parser
);
12236 /* If the next token is now a `;', consume it. */
12237 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
12238 cp_lexer_consume_token (parser
->lexer
);
12240 /* If the next token is `static_assert' we have a static assertion. */
12241 else if (token1
->keyword
== RID_STATIC_ASSERT
)
12242 cp_parser_static_assert (parser
, /*member_p=*/false);
12243 /* Anything else must be a simple-declaration. */
12245 cp_parser_simple_declaration (parser
, !statement_p
,
12246 /*maybe_range_for_decl*/NULL
);
12249 /* Parse a simple-declaration.
12251 simple-declaration:
12252 decl-specifier-seq [opt] init-declarator-list [opt] ;
12254 init-declarator-list:
12256 init-declarator-list , init-declarator
12258 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12259 function-definition as a simple-declaration.
12261 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12262 parsed declaration if it is an uninitialized single declarator not followed
12263 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12264 if present, will not be consumed. */
12267 cp_parser_simple_declaration (cp_parser
* parser
,
12268 bool function_definition_allowed_p
,
12269 tree
*maybe_range_for_decl
)
12271 cp_decl_specifier_seq decl_specifiers
;
12272 int declares_class_or_enum
;
12273 bool saw_declarator
;
12274 location_t comma_loc
= UNKNOWN_LOCATION
;
12275 location_t init_loc
= UNKNOWN_LOCATION
;
12277 if (maybe_range_for_decl
)
12278 *maybe_range_for_decl
= NULL_TREE
;
12280 /* Defer access checks until we know what is being declared; the
12281 checks for names appearing in the decl-specifier-seq should be
12282 done as if we were in the scope of the thing being declared. */
12283 push_deferring_access_checks (dk_deferred
);
12285 /* Parse the decl-specifier-seq. We have to keep track of whether
12286 or not the decl-specifier-seq declares a named class or
12287 enumeration type, since that is the only case in which the
12288 init-declarator-list is allowed to be empty.
12292 In a simple-declaration, the optional init-declarator-list can be
12293 omitted only when declaring a class or enumeration, that is when
12294 the decl-specifier-seq contains either a class-specifier, an
12295 elaborated-type-specifier, or an enum-specifier. */
12296 cp_parser_decl_specifier_seq (parser
,
12297 CP_PARSER_FLAGS_OPTIONAL
,
12299 &declares_class_or_enum
);
12300 /* We no longer need to defer access checks. */
12301 stop_deferring_access_checks ();
12303 /* In a block scope, a valid declaration must always have a
12304 decl-specifier-seq. By not trying to parse declarators, we can
12305 resolve the declaration/expression ambiguity more quickly. */
12306 if (!function_definition_allowed_p
12307 && !decl_specifiers
.any_specifiers_p
)
12309 cp_parser_error (parser
, "expected declaration");
12313 /* If the next two tokens are both identifiers, the code is
12314 erroneous. The usual cause of this situation is code like:
12318 where "T" should name a type -- but does not. */
12319 if (!decl_specifiers
.any_type_specifiers_p
12320 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
12322 /* If parsing tentatively, we should commit; we really are
12323 looking at a declaration. */
12324 cp_parser_commit_to_tentative_parse (parser
);
12329 /* If we have seen at least one decl-specifier, and the next token
12330 is not a parenthesis, then we must be looking at a declaration.
12331 (After "int (" we might be looking at a functional cast.) */
12332 if (decl_specifiers
.any_specifiers_p
12333 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
)
12334 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
12335 && !cp_parser_error_occurred (parser
))
12336 cp_parser_commit_to_tentative_parse (parser
);
12340 last_type
= NULL_TREE
;
12342 /* Keep going until we hit the `;' at the end of the simple
12344 saw_declarator
= false;
12345 while (cp_lexer_next_token_is_not (parser
->lexer
,
12349 bool function_definition_p
;
12351 tree auto_result
= NULL_TREE
;
12353 if (saw_declarator
)
12355 /* If we are processing next declarator, comma is expected */
12356 token
= cp_lexer_peek_token (parser
->lexer
);
12357 gcc_assert (token
->type
== CPP_COMMA
);
12358 cp_lexer_consume_token (parser
->lexer
);
12359 if (maybe_range_for_decl
)
12361 *maybe_range_for_decl
= error_mark_node
;
12362 if (comma_loc
== UNKNOWN_LOCATION
)
12363 comma_loc
= token
->location
;
12367 saw_declarator
= true;
12369 /* Parse the init-declarator. */
12370 decl
= cp_parser_init_declarator (parser
, &decl_specifiers
,
12372 function_definition_allowed_p
,
12373 /*member_p=*/false,
12374 declares_class_or_enum
,
12375 &function_definition_p
,
12376 maybe_range_for_decl
,
12379 /* If an error occurred while parsing tentatively, exit quickly.
12380 (That usually happens when in the body of a function; each
12381 statement is treated as a declaration-statement until proven
12383 if (cp_parser_error_occurred (parser
))
12388 if (last_type
&& last_type
!= error_mark_node
12389 && !same_type_p (auto_result
, last_type
))
12391 /* If the list of declarators contains more than one declarator,
12392 the type of each declared variable is determined as described
12393 above. If the type deduced for the template parameter U is not
12394 the same in each deduction, the program is ill-formed. */
12395 error_at (decl_specifiers
.locations
[ds_type_spec
],
12396 "inconsistent deduction for %qT: %qT and then %qT",
12397 decl_specifiers
.type
, last_type
, auto_result
);
12398 last_type
= error_mark_node
;
12401 last_type
= auto_result
;
12404 /* Handle function definitions specially. */
12405 if (function_definition_p
)
12407 /* If the next token is a `,', then we are probably
12408 processing something like:
12412 which is erroneous. */
12413 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
12415 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12416 error_at (token
->location
,
12418 " declarations and function-definitions is forbidden");
12420 /* Otherwise, we're done with the list of declarators. */
12423 pop_deferring_access_checks ();
12427 if (maybe_range_for_decl
&& *maybe_range_for_decl
== NULL_TREE
)
12428 *maybe_range_for_decl
= decl
;
12429 /* The next token should be either a `,' or a `;'. */
12430 token
= cp_lexer_peek_token (parser
->lexer
);
12431 /* If it's a `,', there are more declarators to come. */
12432 if (token
->type
== CPP_COMMA
)
12433 /* will be consumed next time around */;
12434 /* If it's a `;', we are done. */
12435 else if (token
->type
== CPP_SEMICOLON
|| maybe_range_for_decl
)
12437 /* Anything else is an error. */
12440 /* If we have already issued an error message we don't need
12441 to issue another one. */
12442 if ((decl
!= error_mark_node
12443 && DECL_INITIAL (decl
) != error_mark_node
)
12444 || cp_parser_uncommitted_to_tentative_parse_p (parser
))
12445 cp_parser_error (parser
, "expected %<,%> or %<;%>");
12446 /* Skip tokens until we reach the end of the statement. */
12447 cp_parser_skip_to_end_of_statement (parser
);
12448 /* If the next token is now a `;', consume it. */
12449 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
12450 cp_lexer_consume_token (parser
->lexer
);
12453 /* After the first time around, a function-definition is not
12454 allowed -- even if it was OK at first. For example:
12459 function_definition_allowed_p
= false;
12462 /* Issue an error message if no declarators are present, and the
12463 decl-specifier-seq does not itself declare a class or
12464 enumeration: [dcl.dcl]/3. */
12465 if (!saw_declarator
)
12467 if (cp_parser_declares_only_class_p (parser
))
12469 if (!declares_class_or_enum
12470 && decl_specifiers
.type
12471 && OVERLOAD_TYPE_P (decl_specifiers
.type
))
12472 /* Ensure an error is issued anyway when finish_decltype_type,
12473 called via cp_parser_decl_specifier_seq, returns a class or
12474 an enumeration (c++/51786). */
12475 decl_specifiers
.type
= NULL_TREE
;
12476 shadow_tag (&decl_specifiers
);
12478 /* Perform any deferred access checks. */
12479 perform_deferred_access_checks (tf_warning_or_error
);
12482 /* Consume the `;'. */
12483 if (!maybe_range_for_decl
)
12484 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
12485 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
12487 if (init_loc
!= UNKNOWN_LOCATION
)
12488 error_at (init_loc
, "initializer in range-based %<for%> loop");
12489 if (comma_loc
!= UNKNOWN_LOCATION
)
12490 error_at (comma_loc
,
12491 "multiple declarations in range-based %<for%> loop");
12495 pop_deferring_access_checks ();
12498 /* Parse a decl-specifier-seq.
12500 decl-specifier-seq:
12501 decl-specifier-seq [opt] decl-specifier
12502 decl-specifier attribute-specifier-seq [opt] (C++11)
12505 storage-class-specifier
12516 Concepts Extension:
12521 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12523 The parser flags FLAGS is used to control type-specifier parsing.
12525 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12528 1: one of the decl-specifiers is an elaborated-type-specifier
12529 (i.e., a type declaration)
12530 2: one of the decl-specifiers is an enum-specifier or a
12531 class-specifier (i.e., a type definition)
12536 cp_parser_decl_specifier_seq (cp_parser
* parser
,
12537 cp_parser_flags flags
,
12538 cp_decl_specifier_seq
*decl_specs
,
12539 int* declares_class_or_enum
)
12541 bool constructor_possible_p
= !parser
->in_declarator_p
;
12542 bool found_decl_spec
= false;
12543 cp_token
*start_token
= NULL
;
12546 /* Clear DECL_SPECS. */
12547 clear_decl_specs (decl_specs
);
12549 /* Assume no class or enumeration type is declared. */
12550 *declares_class_or_enum
= 0;
12552 /* Keep reading specifiers until there are no more to read. */
12555 bool constructor_p
;
12559 /* Peek at the next token. */
12560 token
= cp_lexer_peek_token (parser
->lexer
);
12562 /* Save the first token of the decl spec list for error
12565 start_token
= token
;
12566 /* Handle attributes. */
12567 if (cp_next_tokens_can_be_attribute_p (parser
))
12569 /* Parse the attributes. */
12570 tree attrs
= cp_parser_attributes_opt (parser
);
12572 /* In a sequence of declaration specifiers, c++11 attributes
12573 appertain to the type that precede them. In that case
12576 The attribute-specifier-seq affects the type only for
12577 the declaration it appears in, not other declarations
12578 involving the same type.
12580 But for now let's force the user to position the
12581 attribute either at the beginning of the declaration or
12582 after the declarator-id, which would clearly mean that it
12583 applies to the declarator. */
12584 if (cxx11_attribute_p (attrs
))
12586 if (!found_decl_spec
)
12587 /* The c++11 attribute is at the beginning of the
12588 declaration. It appertains to the entity being
12592 if (decl_specs
->type
&& CLASS_TYPE_P (decl_specs
->type
))
12594 /* This is an attribute following a
12595 class-specifier. */
12596 if (decl_specs
->type_definition_p
)
12597 warn_misplaced_attr_for_class_type (token
->location
,
12603 decl_specs
->std_attributes
12604 = chainon (decl_specs
->std_attributes
,
12606 if (decl_specs
->locations
[ds_std_attribute
] == 0)
12607 decl_specs
->locations
[ds_std_attribute
] = token
->location
;
12613 decl_specs
->attributes
12614 = chainon (decl_specs
->attributes
,
12616 if (decl_specs
->locations
[ds_attribute
] == 0)
12617 decl_specs
->locations
[ds_attribute
] = token
->location
;
12620 /* Assume we will find a decl-specifier keyword. */
12621 found_decl_spec
= true;
12622 /* If the next token is an appropriate keyword, we can simply
12623 add it to the list. */
12624 switch (token
->keyword
)
12630 if (!at_class_scope_p ())
12632 error_at (token
->location
, "%<friend%> used outside of class");
12633 cp_lexer_purge_token (parser
->lexer
);
12638 /* Consume the token. */
12639 cp_lexer_consume_token (parser
->lexer
);
12643 case RID_CONSTEXPR
:
12645 cp_lexer_consume_token (parser
->lexer
);
12650 cp_lexer_consume_token (parser
->lexer
);
12653 /* function-specifier:
12660 cp_parser_function_specifier_opt (parser
, decl_specs
);
12667 /* Consume the token. */
12668 cp_lexer_consume_token (parser
->lexer
);
12669 /* A constructor declarator cannot appear in a typedef. */
12670 constructor_possible_p
= false;
12671 /* The "typedef" keyword can only occur in a declaration; we
12672 may as well commit at this point. */
12673 cp_parser_commit_to_tentative_parse (parser
);
12675 if (decl_specs
->storage_class
!= sc_none
)
12676 decl_specs
->conflicting_specifiers_p
= true;
12679 /* storage-class-specifier:
12689 if (cxx_dialect
== cxx98
)
12691 /* Consume the token. */
12692 cp_lexer_consume_token (parser
->lexer
);
12694 /* Complain about `auto' as a storage specifier, if
12695 we're complaining about C++0x compatibility. */
12696 warning_at (token
->location
, OPT_Wc__11_compat
, "%<auto%>"
12697 " changes meaning in C++11; please remove it");
12699 /* Set the storage class anyway. */
12700 cp_parser_set_storage_class (parser
, decl_specs
, RID_AUTO
,
12704 /* C++0x auto type-specifier. */
12705 found_decl_spec
= false;
12712 /* Consume the token. */
12713 cp_lexer_consume_token (parser
->lexer
);
12714 cp_parser_set_storage_class (parser
, decl_specs
, token
->keyword
,
12718 /* Consume the token. */
12720 cp_lexer_consume_token (parser
->lexer
);
12724 /* We did not yet find a decl-specifier yet. */
12725 found_decl_spec
= false;
12729 if (found_decl_spec
12730 && (flags
& CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
)
12731 && token
->keyword
!= RID_CONSTEXPR
)
12732 error ("decl-specifier invalid in condition");
12735 set_and_check_decl_spec_loc (decl_specs
, ds
, token
);
12737 /* Constructors are a special case. The `S' in `S()' is not a
12738 decl-specifier; it is the beginning of the declarator. */
12740 = (!found_decl_spec
12741 && constructor_possible_p
12742 && (cp_parser_constructor_declarator_p
12743 (parser
, decl_spec_seq_has_spec_p (decl_specs
, ds_friend
))));
12745 /* If we don't have a DECL_SPEC yet, then we must be looking at
12746 a type-specifier. */
12747 if (!found_decl_spec
&& !constructor_p
)
12749 int decl_spec_declares_class_or_enum
;
12750 bool is_cv_qualifier
;
12754 = cp_parser_type_specifier (parser
, flags
,
12756 /*is_declaration=*/true,
12757 &decl_spec_declares_class_or_enum
,
12759 *declares_class_or_enum
|= decl_spec_declares_class_or_enum
;
12761 /* If this type-specifier referenced a user-defined type
12762 (a typedef, class-name, etc.), then we can't allow any
12763 more such type-specifiers henceforth.
12767 The longest sequence of decl-specifiers that could
12768 possibly be a type name is taken as the
12769 decl-specifier-seq of a declaration. The sequence shall
12770 be self-consistent as described below.
12774 As a general rule, at most one type-specifier is allowed
12775 in the complete decl-specifier-seq of a declaration. The
12776 only exceptions are the following:
12778 -- const or volatile can be combined with any other
12781 -- signed or unsigned can be combined with char, long,
12789 void g (const int Pc);
12791 Here, Pc is *not* part of the decl-specifier seq; it's
12792 the declarator. Therefore, once we see a type-specifier
12793 (other than a cv-qualifier), we forbid any additional
12794 user-defined types. We *do* still allow things like `int
12795 int' to be considered a decl-specifier-seq, and issue the
12796 error message later. */
12797 if (type_spec
&& !is_cv_qualifier
)
12798 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
12799 /* A constructor declarator cannot follow a type-specifier. */
12802 constructor_possible_p
= false;
12803 found_decl_spec
= true;
12804 if (!is_cv_qualifier
)
12805 decl_specs
->any_type_specifiers_p
= true;
12809 /* If we still do not have a DECL_SPEC, then there are no more
12810 decl-specifiers. */
12811 if (!found_decl_spec
)
12814 decl_specs
->any_specifiers_p
= true;
12815 /* After we see one decl-specifier, further decl-specifiers are
12816 always optional. */
12817 flags
|= CP_PARSER_FLAGS_OPTIONAL
;
12820 /* Don't allow a friend specifier with a class definition. */
12821 if (decl_spec_seq_has_spec_p (decl_specs
, ds_friend
)
12822 && (*declares_class_or_enum
& 2))
12823 error_at (decl_specs
->locations
[ds_friend
],
12824 "class definition may not be declared a friend");
12827 /* Parse an (optional) storage-class-specifier.
12829 storage-class-specifier:
12838 storage-class-specifier:
12841 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12844 cp_parser_storage_class_specifier_opt (cp_parser
* parser
)
12846 switch (cp_lexer_peek_token (parser
->lexer
)->keyword
)
12849 if (cxx_dialect
!= cxx98
)
12851 /* Fall through for C++98. */
12858 /* Consume the token. */
12859 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
12866 /* Parse an (optional) function-specifier.
12868 function-specifier:
12873 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12874 Updates DECL_SPECS, if it is non-NULL. */
12877 cp_parser_function_specifier_opt (cp_parser
* parser
,
12878 cp_decl_specifier_seq
*decl_specs
)
12880 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12881 switch (token
->keyword
)
12884 set_and_check_decl_spec_loc (decl_specs
, ds_inline
, token
);
12888 /* 14.5.2.3 [temp.mem]
12890 A member function template shall not be virtual. */
12891 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
12892 && current_class_type
)
12893 error_at (token
->location
, "templates may not be %<virtual%>");
12895 set_and_check_decl_spec_loc (decl_specs
, ds_virtual
, token
);
12899 set_and_check_decl_spec_loc (decl_specs
, ds_explicit
, token
);
12906 /* Consume the token. */
12907 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
12910 /* Parse a linkage-specification.
12912 linkage-specification:
12913 extern string-literal { declaration-seq [opt] }
12914 extern string-literal declaration */
12917 cp_parser_linkage_specification (cp_parser
* parser
)
12921 /* Look for the `extern' keyword. */
12922 cp_parser_require_keyword (parser
, RID_EXTERN
, RT_EXTERN
);
12924 /* Look for the string-literal. */
12925 linkage
= cp_parser_string_literal (parser
, false, false);
12927 /* Transform the literal into an identifier. If the literal is a
12928 wide-character string, or contains embedded NULs, then we can't
12929 handle it as the user wants. */
12930 if (strlen (TREE_STRING_POINTER (linkage
))
12931 != (size_t) (TREE_STRING_LENGTH (linkage
) - 1))
12933 cp_parser_error (parser
, "invalid linkage-specification");
12934 /* Assume C++ linkage. */
12935 linkage
= lang_name_cplusplus
;
12938 linkage
= get_identifier (TREE_STRING_POINTER (linkage
));
12940 /* We're now using the new linkage. */
12941 push_lang_context (linkage
);
12943 /* If the next token is a `{', then we're using the first
12945 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
12947 cp_ensure_no_omp_declare_simd (parser
);
12948 cp_ensure_no_oacc_routine (parser
);
12950 /* Consume the `{' token. */
12951 cp_lexer_consume_token (parser
->lexer
);
12952 /* Parse the declarations. */
12953 cp_parser_declaration_seq_opt (parser
);
12954 /* Look for the closing `}'. */
12955 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
12957 /* Otherwise, there's just one declaration. */
12960 bool saved_in_unbraced_linkage_specification_p
;
12962 saved_in_unbraced_linkage_specification_p
12963 = parser
->in_unbraced_linkage_specification_p
;
12964 parser
->in_unbraced_linkage_specification_p
= true;
12965 cp_parser_declaration (parser
);
12966 parser
->in_unbraced_linkage_specification_p
12967 = saved_in_unbraced_linkage_specification_p
;
12970 /* We're done with the linkage-specification. */
12971 pop_lang_context ();
12974 /* Parse a static_assert-declaration.
12976 static_assert-declaration:
12977 static_assert ( constant-expression , string-literal ) ;
12978 static_assert ( constant-expression ) ; (C++1Z)
12980 If MEMBER_P, this static_assert is a class member. */
12983 cp_parser_static_assert(cp_parser
*parser
, bool member_p
)
12988 location_t saved_loc
;
12991 /* Peek at the `static_assert' token so we can keep track of exactly
12992 where the static assertion started. */
12993 token
= cp_lexer_peek_token (parser
->lexer
);
12994 saved_loc
= token
->location
;
12996 /* Look for the `static_assert' keyword. */
12997 if (!cp_parser_require_keyword (parser
, RID_STATIC_ASSERT
,
13001 /* We know we are in a static assertion; commit to any tentative
13003 if (cp_parser_parsing_tentatively (parser
))
13004 cp_parser_commit_to_tentative_parse (parser
);
13006 /* Parse the `(' starting the static assertion condition. */
13007 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
13009 /* Parse the constant-expression. Allow a non-constant expression
13010 here in order to give better diagnostics in finish_static_assert. */
13012 cp_parser_constant_expression (parser
,
13013 /*allow_non_constant_p=*/true,
13014 /*non_constant_p=*/&dummy
);
13016 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13018 if (cxx_dialect
< cxx1z
)
13019 pedwarn (input_location
, OPT_Wpedantic
,
13020 "static_assert without a message "
13021 "only available with -std=c++1z or -std=gnu++1z");
13023 cp_lexer_consume_token (parser
->lexer
);
13024 message
= build_string (1, "");
13025 TREE_TYPE (message
) = char_array_type_node
;
13026 fix_string_type (message
);
13030 /* Parse the separating `,'. */
13031 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
13033 /* Parse the string-literal message. */
13034 message
= cp_parser_string_literal (parser
,
13035 /*translate=*/false,
13038 /* A `)' completes the static assertion. */
13039 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
13040 cp_parser_skip_to_closing_parenthesis (parser
,
13041 /*recovering=*/true,
13042 /*or_comma=*/false,
13043 /*consume_paren=*/true);
13046 /* A semicolon terminates the declaration. */
13047 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
13049 /* Complete the static assertion, which may mean either processing
13050 the static assert now or saving it for template instantiation. */
13051 finish_static_assert (condition
, message
, saved_loc
, member_p
);
13054 /* Parse the expression in decltype ( expression ). */
13057 cp_parser_decltype_expr (cp_parser
*parser
,
13058 bool &id_expression_or_member_access_p
)
13060 cp_token
*id_expr_start_token
;
13063 /* Since we're going to preserve any side-effects from this parse, set up a
13064 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13065 in the expression. */
13066 tentative_firewall
firewall (parser
);
13068 /* First, try parsing an id-expression. */
13069 id_expr_start_token
= cp_lexer_peek_token (parser
->lexer
);
13070 cp_parser_parse_tentatively (parser
);
13071 expr
= cp_parser_id_expression (parser
,
13072 /*template_keyword_p=*/false,
13073 /*check_dependency_p=*/true,
13074 /*template_p=*/NULL
,
13075 /*declarator_p=*/false,
13076 /*optional_p=*/false);
13078 if (!cp_parser_error_occurred (parser
) && expr
!= error_mark_node
)
13080 bool non_integral_constant_expression_p
= false;
13081 tree id_expression
= expr
;
13083 const char *error_msg
;
13085 if (identifier_p (expr
))
13086 /* Lookup the name we got back from the id-expression. */
13087 expr
= cp_parser_lookup_name_simple (parser
, expr
,
13088 id_expr_start_token
->location
);
13091 && expr
!= error_mark_node
13092 && TREE_CODE (expr
) != TYPE_DECL
13093 && (TREE_CODE (expr
) != BIT_NOT_EXPR
13094 || !TYPE_P (TREE_OPERAND (expr
, 0)))
13095 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13097 /* Complete lookup of the id-expression. */
13098 expr
= (finish_id_expression
13099 (id_expression
, expr
, parser
->scope
, &idk
,
13100 /*integral_constant_expression_p=*/false,
13101 /*allow_non_integral_constant_expression_p=*/true,
13102 &non_integral_constant_expression_p
,
13103 /*template_p=*/false,
13105 /*address_p=*/false,
13106 /*template_arg_p=*/false,
13108 id_expr_start_token
->location
));
13110 if (expr
== error_mark_node
)
13111 /* We found an id-expression, but it was something that we
13112 should not have found. This is an error, not something
13113 we can recover from, so note that we found an
13114 id-expression and we'll recover as gracefully as
13116 id_expression_or_member_access_p
= true;
13120 && expr
!= error_mark_node
13121 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13122 /* We have an id-expression. */
13123 id_expression_or_member_access_p
= true;
13126 if (!id_expression_or_member_access_p
)
13128 /* Abort the id-expression parse. */
13129 cp_parser_abort_tentative_parse (parser
);
13131 /* Parsing tentatively, again. */
13132 cp_parser_parse_tentatively (parser
);
13134 /* Parse a class member access. */
13135 expr
= cp_parser_postfix_expression (parser
, /*address_p=*/false,
13136 /*cast_p=*/false, /*decltype*/true,
13137 /*member_access_only_p=*/true, NULL
);
13140 && expr
!= error_mark_node
13141 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
13142 /* We have an id-expression. */
13143 id_expression_or_member_access_p
= true;
13146 if (id_expression_or_member_access_p
)
13147 /* We have parsed the complete id-expression or member access. */
13148 cp_parser_parse_definitely (parser
);
13151 /* Abort our attempt to parse an id-expression or member access
13153 cp_parser_abort_tentative_parse (parser
);
13155 /* Parse a full expression. */
13156 expr
= cp_parser_expression (parser
, /*pidk=*/NULL
, /*cast_p=*/false,
13157 /*decltype_p=*/true);
13163 /* Parse a `decltype' type. Returns the type.
13165 simple-type-specifier:
13166 decltype ( expression )
13168 decltype ( auto ) */
13171 cp_parser_decltype (cp_parser
*parser
)
13174 bool id_expression_or_member_access_p
= false;
13175 const char *saved_message
;
13176 bool saved_integral_constant_expression_p
;
13177 bool saved_non_integral_constant_expression_p
;
13178 bool saved_greater_than_is_operator_p
;
13179 cp_token
*start_token
= cp_lexer_peek_token (parser
->lexer
);
13181 if (start_token
->type
== CPP_DECLTYPE
)
13183 /* Already parsed. */
13184 cp_lexer_consume_token (parser
->lexer
);
13185 return saved_checks_value (start_token
->u
.tree_check_value
);
13188 /* Look for the `decltype' token. */
13189 if (!cp_parser_require_keyword (parser
, RID_DECLTYPE
, RT_DECLTYPE
))
13190 return error_mark_node
;
13192 /* Parse the opening `('. */
13193 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
13194 return error_mark_node
;
13196 /* decltype (auto) */
13197 if (cxx_dialect
>= cxx14
13198 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
13200 cp_lexer_consume_token (parser
->lexer
);
13201 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
13202 return error_mark_node
;
13203 expr
= make_decltype_auto ();
13204 AUTO_IS_DECLTYPE (expr
) = true;
13208 /* Types cannot be defined in a `decltype' expression. Save away the
13210 saved_message
= parser
->type_definition_forbidden_message
;
13212 /* And create the new one. */
13213 parser
->type_definition_forbidden_message
13214 = G_("types may not be defined in %<decltype%> expressions");
13216 /* The restrictions on constant-expressions do not apply inside
13217 decltype expressions. */
13218 saved_integral_constant_expression_p
13219 = parser
->integral_constant_expression_p
;
13220 saved_non_integral_constant_expression_p
13221 = parser
->non_integral_constant_expression_p
;
13222 parser
->integral_constant_expression_p
= false;
13224 /* Within a parenthesized expression, a `>' token is always
13225 the greater-than operator. */
13226 saved_greater_than_is_operator_p
13227 = parser
->greater_than_is_operator_p
;
13228 parser
->greater_than_is_operator_p
= true;
13230 /* Do not actually evaluate the expression. */
13231 ++cp_unevaluated_operand
;
13233 /* Do not warn about problems with the expression. */
13234 ++c_inhibit_evaluation_warnings
;
13236 expr
= cp_parser_decltype_expr (parser
, id_expression_or_member_access_p
);
13238 /* Go back to evaluating expressions. */
13239 --cp_unevaluated_operand
;
13240 --c_inhibit_evaluation_warnings
;
13242 /* The `>' token might be the end of a template-id or
13243 template-parameter-list now. */
13244 parser
->greater_than_is_operator_p
13245 = saved_greater_than_is_operator_p
;
13247 /* Restore the old message and the integral constant expression
13249 parser
->type_definition_forbidden_message
= saved_message
;
13250 parser
->integral_constant_expression_p
13251 = saved_integral_constant_expression_p
;
13252 parser
->non_integral_constant_expression_p
13253 = saved_non_integral_constant_expression_p
;
13255 /* Parse to the closing `)'. */
13256 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
13258 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
13259 /*consume_paren=*/true);
13260 return error_mark_node
;
13263 expr
= finish_decltype_type (expr
, id_expression_or_member_access_p
,
13264 tf_warning_or_error
);
13267 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13269 start_token
->type
= CPP_DECLTYPE
;
13270 start_token
->u
.tree_check_value
= ggc_cleared_alloc
<struct tree_check
> ();
13271 start_token
->u
.tree_check_value
->value
= expr
;
13272 start_token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
13273 start_token
->keyword
= RID_MAX
;
13274 cp_lexer_purge_tokens_after (parser
->lexer
, start_token
);
13279 /* Special member functions [gram.special] */
13281 /* Parse a conversion-function-id.
13283 conversion-function-id:
13284 operator conversion-type-id
13286 Returns an IDENTIFIER_NODE representing the operator. */
13289 cp_parser_conversion_function_id (cp_parser
* parser
)
13293 tree saved_qualifying_scope
;
13294 tree saved_object_scope
;
13295 tree pushed_scope
= NULL_TREE
;
13297 /* Look for the `operator' token. */
13298 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
13299 return error_mark_node
;
13300 /* When we parse the conversion-type-id, the current scope will be
13301 reset. However, we need that information in able to look up the
13302 conversion function later, so we save it here. */
13303 saved_scope
= parser
->scope
;
13304 saved_qualifying_scope
= parser
->qualifying_scope
;
13305 saved_object_scope
= parser
->object_scope
;
13306 /* We must enter the scope of the class so that the names of
13307 entities declared within the class are available in the
13308 conversion-type-id. For example, consider:
13315 S::operator I() { ... }
13317 In order to see that `I' is a type-name in the definition, we
13318 must be in the scope of `S'. */
13320 pushed_scope
= push_scope (saved_scope
);
13321 /* Parse the conversion-type-id. */
13322 type
= cp_parser_conversion_type_id (parser
);
13323 /* Leave the scope of the class, if any. */
13325 pop_scope (pushed_scope
);
13326 /* Restore the saved scope. */
13327 parser
->scope
= saved_scope
;
13328 parser
->qualifying_scope
= saved_qualifying_scope
;
13329 parser
->object_scope
= saved_object_scope
;
13330 /* If the TYPE is invalid, indicate failure. */
13331 if (type
== error_mark_node
)
13332 return error_mark_node
;
13333 return mangle_conv_op_name_for_type (type
);
13336 /* Parse a conversion-type-id:
13338 conversion-type-id:
13339 type-specifier-seq conversion-declarator [opt]
13341 Returns the TYPE specified. */
13344 cp_parser_conversion_type_id (cp_parser
* parser
)
13347 cp_decl_specifier_seq type_specifiers
;
13348 cp_declarator
*declarator
;
13349 tree type_specified
;
13350 const char *saved_message
;
13352 /* Parse the attributes. */
13353 attributes
= cp_parser_attributes_opt (parser
);
13355 saved_message
= parser
->type_definition_forbidden_message
;
13356 parser
->type_definition_forbidden_message
13357 = G_("types may not be defined in a conversion-type-id");
13359 /* Parse the type-specifiers. */
13360 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
13361 /*is_trailing_return=*/false,
13364 parser
->type_definition_forbidden_message
= saved_message
;
13366 /* If that didn't work, stop. */
13367 if (type_specifiers
.type
== error_mark_node
)
13368 return error_mark_node
;
13369 /* Parse the conversion-declarator. */
13370 declarator
= cp_parser_conversion_declarator_opt (parser
);
13372 type_specified
= grokdeclarator (declarator
, &type_specifiers
, TYPENAME
,
13373 /*initialized=*/0, &attributes
);
13375 cplus_decl_attributes (&type_specified
, attributes
, /*flags=*/0);
13377 /* Don't give this error when parsing tentatively. This happens to
13378 work because we always parse this definitively once. */
13379 if (! cp_parser_uncommitted_to_tentative_parse_p (parser
)
13380 && type_uses_auto (type_specified
))
13382 if (cxx_dialect
< cxx14
)
13384 error ("invalid use of %<auto%> in conversion operator");
13385 return error_mark_node
;
13387 else if (template_parm_scope_p ())
13388 warning (0, "use of %<auto%> in member template "
13389 "conversion operator can never be deduced");
13392 return type_specified
;
13395 /* Parse an (optional) conversion-declarator.
13397 conversion-declarator:
13398 ptr-operator conversion-declarator [opt]
13402 static cp_declarator
*
13403 cp_parser_conversion_declarator_opt (cp_parser
* parser
)
13405 enum tree_code code
;
13406 tree class_type
, std_attributes
= NULL_TREE
;
13407 cp_cv_quals cv_quals
;
13409 /* We don't know if there's a ptr-operator next, or not. */
13410 cp_parser_parse_tentatively (parser
);
13411 /* Try the ptr-operator. */
13412 code
= cp_parser_ptr_operator (parser
, &class_type
, &cv_quals
,
13414 /* If it worked, look for more conversion-declarators. */
13415 if (cp_parser_parse_definitely (parser
))
13417 cp_declarator
*declarator
;
13419 /* Parse another optional declarator. */
13420 declarator
= cp_parser_conversion_declarator_opt (parser
);
13422 declarator
= cp_parser_make_indirect_declarator
13423 (code
, class_type
, cv_quals
, declarator
, std_attributes
);
13431 /* Parse an (optional) ctor-initializer.
13434 : mem-initializer-list
13436 Returns TRUE iff the ctor-initializer was actually present. */
13439 cp_parser_ctor_initializer_opt (cp_parser
* parser
)
13441 /* If the next token is not a `:', then there is no
13442 ctor-initializer. */
13443 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
13445 /* Do default initialization of any bases and members. */
13446 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13447 finish_mem_initializers (NULL_TREE
);
13452 /* Consume the `:' token. */
13453 cp_lexer_consume_token (parser
->lexer
);
13454 /* And the mem-initializer-list. */
13455 cp_parser_mem_initializer_list (parser
);
13460 /* Parse a mem-initializer-list.
13462 mem-initializer-list:
13463 mem-initializer ... [opt]
13464 mem-initializer ... [opt] , mem-initializer-list */
13467 cp_parser_mem_initializer_list (cp_parser
* parser
)
13469 tree mem_initializer_list
= NULL_TREE
;
13470 tree target_ctor
= error_mark_node
;
13471 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13473 /* Let the semantic analysis code know that we are starting the
13474 mem-initializer-list. */
13475 if (!DECL_CONSTRUCTOR_P (current_function_decl
))
13476 error_at (token
->location
,
13477 "only constructors take member initializers");
13479 /* Loop through the list. */
13482 tree mem_initializer
;
13484 token
= cp_lexer_peek_token (parser
->lexer
);
13485 /* Parse the mem-initializer. */
13486 mem_initializer
= cp_parser_mem_initializer (parser
);
13487 /* If the next token is a `...', we're expanding member initializers. */
13488 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
13490 /* Consume the `...'. */
13491 cp_lexer_consume_token (parser
->lexer
);
13493 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13494 can be expanded but members cannot. */
13495 if (mem_initializer
!= error_mark_node
13496 && !TYPE_P (TREE_PURPOSE (mem_initializer
)))
13498 error_at (token
->location
,
13499 "cannot expand initializer for member %<%D%>",
13500 TREE_PURPOSE (mem_initializer
));
13501 mem_initializer
= error_mark_node
;
13504 /* Construct the pack expansion type. */
13505 if (mem_initializer
!= error_mark_node
)
13506 mem_initializer
= make_pack_expansion (mem_initializer
);
13508 if (target_ctor
!= error_mark_node
13509 && mem_initializer
!= error_mark_node
)
13511 error ("mem-initializer for %qD follows constructor delegation",
13512 TREE_PURPOSE (mem_initializer
));
13513 mem_initializer
= error_mark_node
;
13515 /* Look for a target constructor. */
13516 if (mem_initializer
!= error_mark_node
13517 && CLASS_TYPE_P (TREE_PURPOSE (mem_initializer
))
13518 && same_type_p (TREE_PURPOSE (mem_initializer
), current_class_type
))
13520 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
13521 if (mem_initializer_list
)
13523 error ("constructor delegation follows mem-initializer for %qD",
13524 TREE_PURPOSE (mem_initializer_list
));
13525 mem_initializer
= error_mark_node
;
13527 target_ctor
= mem_initializer
;
13529 /* Add it to the list, unless it was erroneous. */
13530 if (mem_initializer
!= error_mark_node
)
13532 TREE_CHAIN (mem_initializer
) = mem_initializer_list
;
13533 mem_initializer_list
= mem_initializer
;
13535 /* If the next token is not a `,', we're done. */
13536 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
13538 /* Consume the `,' token. */
13539 cp_lexer_consume_token (parser
->lexer
);
13542 /* Perform semantic analysis. */
13543 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13544 finish_mem_initializers (mem_initializer_list
);
13547 /* Parse a mem-initializer.
13550 mem-initializer-id ( expression-list [opt] )
13551 mem-initializer-id braced-init-list
13556 ( expression-list [opt] )
13558 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13559 class) or FIELD_DECL (for a non-static data member) to initialize;
13560 the TREE_VALUE is the expression-list. An empty initialization
13561 list is represented by void_list_node. */
13564 cp_parser_mem_initializer (cp_parser
* parser
)
13566 tree mem_initializer_id
;
13567 tree expression_list
;
13569 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13571 /* Find out what is being initialized. */
13572 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
13574 permerror (token
->location
,
13575 "anachronistic old-style base class initializer");
13576 mem_initializer_id
= NULL_TREE
;
13580 mem_initializer_id
= cp_parser_mem_initializer_id (parser
);
13581 if (mem_initializer_id
== error_mark_node
)
13582 return mem_initializer_id
;
13584 member
= expand_member_init (mem_initializer_id
);
13585 if (member
&& !DECL_P (member
))
13586 in_base_initializer
= 1;
13588 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
13590 bool expr_non_constant_p
;
13591 cp_lexer_set_source_position (parser
->lexer
);
13592 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
13593 expression_list
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
13594 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
13595 expression_list
= build_tree_list (NULL_TREE
, expression_list
);
13599 vec
<tree
, va_gc
> *vec
;
13600 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
13602 /*allow_expansion_p=*/true,
13603 /*non_constant_p=*/NULL
);
13605 return error_mark_node
;
13606 expression_list
= build_tree_list_vec (vec
);
13607 release_tree_vector (vec
);
13610 if (expression_list
== error_mark_node
)
13611 return error_mark_node
;
13612 if (!expression_list
)
13613 expression_list
= void_type_node
;
13615 in_base_initializer
= 0;
13617 return member
? build_tree_list (member
, expression_list
) : error_mark_node
;
13620 /* Parse a mem-initializer-id.
13622 mem-initializer-id:
13623 :: [opt] nested-name-specifier [opt] class-name
13624 decltype-specifier (C++11)
13627 Returns a TYPE indicating the class to be initialized for the first
13628 production (and the second in C++11). Returns an IDENTIFIER_NODE
13629 indicating the data member to be initialized for the last production. */
13632 cp_parser_mem_initializer_id (cp_parser
* parser
)
13634 bool global_scope_p
;
13635 bool nested_name_specifier_p
;
13636 bool template_p
= false;
13639 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13641 /* `typename' is not allowed in this context ([temp.res]). */
13642 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
13644 error_at (token
->location
,
13645 "keyword %<typename%> not allowed in this context (a qualified "
13646 "member initializer is implicitly a type)");
13647 cp_lexer_consume_token (parser
->lexer
);
13649 /* Look for the optional `::' operator. */
13651 = (cp_parser_global_scope_opt (parser
,
13652 /*current_scope_valid_p=*/false)
13654 /* Look for the optional nested-name-specifier. The simplest way to
13659 The keyword `typename' is not permitted in a base-specifier or
13660 mem-initializer; in these contexts a qualified name that
13661 depends on a template-parameter is implicitly assumed to be a
13664 is to assume that we have seen the `typename' keyword at this
13666 nested_name_specifier_p
13667 = (cp_parser_nested_name_specifier_opt (parser
,
13668 /*typename_keyword_p=*/true,
13669 /*check_dependency_p=*/true,
13671 /*is_declaration=*/true)
13673 if (nested_name_specifier_p
)
13674 template_p
= cp_parser_optional_template_keyword (parser
);
13675 /* If there is a `::' operator or a nested-name-specifier, then we
13676 are definitely looking for a class-name. */
13677 if (global_scope_p
|| nested_name_specifier_p
)
13678 return cp_parser_class_name (parser
,
13679 /*typename_keyword_p=*/true,
13680 /*template_keyword_p=*/template_p
,
13682 /*check_dependency_p=*/true,
13683 /*class_head_p=*/false,
13684 /*is_declaration=*/true);
13685 /* Otherwise, we could also be looking for an ordinary identifier. */
13686 cp_parser_parse_tentatively (parser
);
13687 if (cp_lexer_next_token_is_decltype (parser
->lexer
))
13688 /* Try a decltype-specifier. */
13689 id
= cp_parser_decltype (parser
);
13691 /* Otherwise, try a class-name. */
13692 id
= cp_parser_class_name (parser
,
13693 /*typename_keyword_p=*/true,
13694 /*template_keyword_p=*/false,
13696 /*check_dependency_p=*/true,
13697 /*class_head_p=*/false,
13698 /*is_declaration=*/true);
13699 /* If we found one, we're done. */
13700 if (cp_parser_parse_definitely (parser
))
13702 /* Otherwise, look for an ordinary identifier. */
13703 return cp_parser_identifier (parser
);
13706 /* Overloading [gram.over] */
13708 /* Parse an operator-function-id.
13710 operator-function-id:
13713 Returns an IDENTIFIER_NODE for the operator which is a
13714 human-readable spelling of the identifier, e.g., `operator +'. */
13717 cp_parser_operator_function_id (cp_parser
* parser
)
13719 /* Look for the `operator' keyword. */
13720 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
13721 return error_mark_node
;
13722 /* And then the name of the operator itself. */
13723 return cp_parser_operator (parser
);
13726 /* Return an identifier node for a user-defined literal operator.
13727 The suffix identifier is chained to the operator name identifier. */
13730 cp_literal_operator_id (const char* name
)
13733 char *buffer
= XNEWVEC (char, strlen (UDLIT_OP_ANSI_PREFIX
)
13734 + strlen (name
) + 10);
13735 sprintf (buffer
, UDLIT_OP_ANSI_FORMAT
, name
);
13736 identifier
= get_identifier (buffer
);
13741 /* Parse an operator.
13744 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13745 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13746 || ++ -- , ->* -> () []
13753 Returns an IDENTIFIER_NODE for the operator which is a
13754 human-readable spelling of the identifier, e.g., `operator +'. */
13757 cp_parser_operator (cp_parser
* parser
)
13759 tree id
= NULL_TREE
;
13763 /* Peek at the next token. */
13764 token
= cp_lexer_peek_token (parser
->lexer
);
13766 location_t start_loc
= token
->location
;
13768 /* Figure out which operator we have. */
13769 switch (token
->type
)
13775 /* The keyword should be either `new' or `delete'. */
13776 if (token
->keyword
== RID_NEW
)
13778 else if (token
->keyword
== RID_DELETE
)
13783 /* Consume the `new' or `delete' token. */
13784 location_t end_loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
13786 /* Peek at the next token. */
13787 token
= cp_lexer_peek_token (parser
->lexer
);
13788 /* If it's a `[' token then this is the array variant of the
13790 if (token
->type
== CPP_OPEN_SQUARE
)
13792 /* Consume the `[' token. */
13793 cp_lexer_consume_token (parser
->lexer
);
13794 /* Look for the `]' token. */
13795 if (cp_token
*close_token
13796 = cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
13797 end_loc
= close_token
->location
;
13798 id
= ansi_opname (op
== NEW_EXPR
13799 ? VEC_NEW_EXPR
: VEC_DELETE_EXPR
);
13801 /* Otherwise, we have the non-array variant. */
13803 id
= ansi_opname (op
);
13805 location_t loc
= make_location (start_loc
, start_loc
, end_loc
);
13807 return cp_expr (id
, loc
);
13811 id
= ansi_opname (PLUS_EXPR
);
13815 id
= ansi_opname (MINUS_EXPR
);
13819 id
= ansi_opname (MULT_EXPR
);
13823 id
= ansi_opname (TRUNC_DIV_EXPR
);
13827 id
= ansi_opname (TRUNC_MOD_EXPR
);
13831 id
= ansi_opname (BIT_XOR_EXPR
);
13835 id
= ansi_opname (BIT_AND_EXPR
);
13839 id
= ansi_opname (BIT_IOR_EXPR
);
13843 id
= ansi_opname (BIT_NOT_EXPR
);
13847 id
= ansi_opname (TRUTH_NOT_EXPR
);
13851 id
= ansi_assopname (NOP_EXPR
);
13855 id
= ansi_opname (LT_EXPR
);
13859 id
= ansi_opname (GT_EXPR
);
13863 id
= ansi_assopname (PLUS_EXPR
);
13867 id
= ansi_assopname (MINUS_EXPR
);
13871 id
= ansi_assopname (MULT_EXPR
);
13875 id
= ansi_assopname (TRUNC_DIV_EXPR
);
13879 id
= ansi_assopname (TRUNC_MOD_EXPR
);
13883 id
= ansi_assopname (BIT_XOR_EXPR
);
13887 id
= ansi_assopname (BIT_AND_EXPR
);
13891 id
= ansi_assopname (BIT_IOR_EXPR
);
13895 id
= ansi_opname (LSHIFT_EXPR
);
13899 id
= ansi_opname (RSHIFT_EXPR
);
13902 case CPP_LSHIFT_EQ
:
13903 id
= ansi_assopname (LSHIFT_EXPR
);
13906 case CPP_RSHIFT_EQ
:
13907 id
= ansi_assopname (RSHIFT_EXPR
);
13911 id
= ansi_opname (EQ_EXPR
);
13915 id
= ansi_opname (NE_EXPR
);
13919 id
= ansi_opname (LE_EXPR
);
13922 case CPP_GREATER_EQ
:
13923 id
= ansi_opname (GE_EXPR
);
13927 id
= ansi_opname (TRUTH_ANDIF_EXPR
);
13931 id
= ansi_opname (TRUTH_ORIF_EXPR
);
13934 case CPP_PLUS_PLUS
:
13935 id
= ansi_opname (POSTINCREMENT_EXPR
);
13938 case CPP_MINUS_MINUS
:
13939 id
= ansi_opname (PREDECREMENT_EXPR
);
13943 id
= ansi_opname (COMPOUND_EXPR
);
13946 case CPP_DEREF_STAR
:
13947 id
= ansi_opname (MEMBER_REF
);
13951 id
= ansi_opname (COMPONENT_REF
);
13954 case CPP_OPEN_PAREN
:
13955 /* Consume the `('. */
13956 cp_lexer_consume_token (parser
->lexer
);
13957 /* Look for the matching `)'. */
13958 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
13959 return ansi_opname (CALL_EXPR
);
13961 case CPP_OPEN_SQUARE
:
13962 /* Consume the `['. */
13963 cp_lexer_consume_token (parser
->lexer
);
13964 /* Look for the matching `]'. */
13965 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
13966 return ansi_opname (ARRAY_REF
);
13968 case CPP_UTF8STRING
:
13969 case CPP_UTF8STRING_USERDEF
:
13975 case CPP_STRING_USERDEF
:
13976 case CPP_WSTRING_USERDEF
:
13977 case CPP_STRING16_USERDEF
:
13978 case CPP_STRING32_USERDEF
:
13980 tree str
, string_tree
;
13983 if (cxx_dialect
== cxx98
)
13984 maybe_warn_cpp0x (CPP0X_USER_DEFINED_LITERALS
);
13986 /* Consume the string. */
13987 str
= cp_parser_string_literal (parser
, /*translate=*/true,
13988 /*wide_ok=*/true, /*lookup_udlit=*/false);
13989 if (str
== error_mark_node
)
13990 return error_mark_node
;
13991 else if (TREE_CODE (str
) == USERDEF_LITERAL
)
13993 string_tree
= USERDEF_LITERAL_VALUE (str
);
13994 id
= USERDEF_LITERAL_SUFFIX_ID (str
);
13999 /* Look for the suffix identifier. */
14000 token
= cp_lexer_peek_token (parser
->lexer
);
14001 if (token
->type
== CPP_NAME
)
14002 id
= cp_parser_identifier (parser
);
14003 else if (token
->type
== CPP_KEYWORD
)
14005 error ("unexpected keyword;"
14006 " remove space between quotes and suffix identifier");
14007 return error_mark_node
;
14011 error ("expected suffix identifier");
14012 return error_mark_node
;
14015 sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
14016 (TREE_TYPE (TREE_TYPE (string_tree
))));
14017 len
= TREE_STRING_LENGTH (string_tree
) / sz
- 1;
14020 error ("expected empty string after %<operator%> keyword");
14021 return error_mark_node
;
14023 if (utf8
|| TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (string_tree
)))
14026 error ("invalid encoding prefix in literal operator");
14027 return error_mark_node
;
14029 if (id
!= error_mark_node
)
14031 const char *name
= IDENTIFIER_POINTER (id
);
14032 id
= cp_literal_operator_id (name
);
14038 /* Anything else is an error. */
14042 /* If we have selected an identifier, we need to consume the
14045 cp_lexer_consume_token (parser
->lexer
);
14046 /* Otherwise, no valid operator name was present. */
14049 cp_parser_error (parser
, "expected operator");
14050 id
= error_mark_node
;
14053 return cp_expr (id
, start_loc
);
14056 /* Parse a template-declaration.
14058 template-declaration:
14059 export [opt] template < template-parameter-list > declaration
14061 If MEMBER_P is TRUE, this template-declaration occurs within a
14064 The grammar rule given by the standard isn't correct. What
14065 is really meant is:
14067 template-declaration:
14068 export [opt] template-parameter-list-seq
14069 decl-specifier-seq [opt] init-declarator [opt] ;
14070 export [opt] template-parameter-list-seq
14071 function-definition
14073 template-parameter-list-seq:
14074 template-parameter-list-seq [opt]
14075 template < template-parameter-list >
14077 Concept Extensions:
14079 template-parameter-list-seq:
14080 template < template-parameter-list > requires-clause [opt]
14083 requires logical-or-expression */
14086 cp_parser_template_declaration (cp_parser
* parser
, bool member_p
)
14088 /* Check for `export'. */
14089 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXPORT
))
14091 /* Consume the `export' token. */
14092 cp_lexer_consume_token (parser
->lexer
);
14093 /* Warn that we do not support `export'. */
14094 warning (0, "keyword %<export%> not implemented, and will be ignored");
14097 cp_parser_template_declaration_after_export (parser
, member_p
);
14100 /* Parse a template-parameter-list.
14102 template-parameter-list:
14104 template-parameter-list , template-parameter
14106 Returns a TREE_LIST. Each node represents a template parameter.
14107 The nodes are connected via their TREE_CHAINs. */
14110 cp_parser_template_parameter_list (cp_parser
* parser
)
14112 tree parameter_list
= NULL_TREE
;
14114 begin_template_parm_list ();
14116 /* The loop below parses the template parms. We first need to know
14117 the total number of template parms to be able to compute proper
14118 canonical types of each dependent type. So after the loop, when
14119 we know the total number of template parms,
14120 end_template_parm_list computes the proper canonical types and
14121 fixes up the dependent types accordingly. */
14126 bool is_parameter_pack
;
14127 location_t parm_loc
;
14129 /* Parse the template-parameter. */
14130 parm_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
14131 parameter
= cp_parser_template_parameter (parser
,
14133 &is_parameter_pack
);
14134 /* Add it to the list. */
14135 if (parameter
!= error_mark_node
)
14136 parameter_list
= process_template_parm (parameter_list
,
14140 is_parameter_pack
);
14143 tree err_parm
= build_tree_list (parameter
, parameter
);
14144 parameter_list
= chainon (parameter_list
, err_parm
);
14147 /* If the next token is not a `,', we're done. */
14148 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14150 /* Otherwise, consume the `,' token. */
14151 cp_lexer_consume_token (parser
->lexer
);
14154 return end_template_parm_list (parameter_list
);
14157 /* Parse a introduction-list.
14160 introduced-parameter
14161 introduction-list , introduced-parameter
14163 introduced-parameter:
14164 ...[opt] identifier
14166 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14167 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14168 WILDCARD_DECL will also have DECL_NAME set and token location in
14169 DECL_SOURCE_LOCATION. */
14172 cp_parser_introduction_list (cp_parser
*parser
)
14174 vec
<tree
, va_gc
> *introduction_vec
= make_tree_vector ();
14178 bool is_pack
= cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
);
14180 cp_lexer_consume_token (parser
->lexer
);
14182 /* Build placeholder. */
14183 tree parm
= build_nt (WILDCARD_DECL
);
14184 DECL_SOURCE_LOCATION (parm
)
14185 = cp_lexer_peek_token (parser
->lexer
)->location
;
14186 DECL_NAME (parm
) = cp_parser_identifier (parser
);
14187 WILDCARD_PACK_P (parm
) = is_pack
;
14188 vec_safe_push (introduction_vec
, parm
);
14190 /* If the next token is not a `,', we're done. */
14191 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14193 /* Otherwise, consume the `,' token. */
14194 cp_lexer_consume_token (parser
->lexer
);
14197 /* Convert the vec into a TREE_VEC. */
14198 tree introduction_list
= make_tree_vec (introduction_vec
->length ());
14201 FOR_EACH_VEC_ELT (*introduction_vec
, n
, parm
)
14202 TREE_VEC_ELT (introduction_list
, n
) = parm
;
14204 release_tree_vector (introduction_vec
);
14205 return introduction_list
;
14208 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14209 is an abstract declarator. */
14211 static inline cp_declarator
*
14212 get_id_declarator (cp_declarator
*declarator
)
14214 cp_declarator
*d
= declarator
;
14215 while (d
&& d
->kind
!= cdk_id
)
14220 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14221 is an abstract declarator. */
14224 get_unqualified_id (cp_declarator
*declarator
)
14226 declarator
= get_id_declarator (declarator
);
14228 return declarator
->u
.id
.unqualified_name
;
14233 /* Returns true if DECL represents a constrained-parameter. */
14236 is_constrained_parameter (tree decl
)
14239 && TREE_CODE (decl
) == TYPE_DECL
14240 && CONSTRAINED_PARM_CONCEPT (decl
)
14241 && DECL_P (CONSTRAINED_PARM_CONCEPT (decl
)));
14244 /* Returns true if PARM declares a constrained-parameter. */
14247 is_constrained_parameter (cp_parameter_declarator
*parm
)
14249 return is_constrained_parameter (parm
->decl_specifiers
.type
);
14252 /* Check that the type parameter is only a declarator-id, and that its
14253 type is not cv-qualified. */
14256 cp_parser_check_constrained_type_parm (cp_parser
*parser
,
14257 cp_parameter_declarator
*parm
)
14259 if (!parm
->declarator
)
14262 if (parm
->declarator
->kind
!= cdk_id
)
14264 cp_parser_error (parser
, "invalid constrained type parameter");
14268 /* Don't allow cv-qualified type parameters. */
14269 if (decl_spec_seq_has_spec_p (&parm
->decl_specifiers
, ds_const
)
14270 || decl_spec_seq_has_spec_p (&parm
->decl_specifiers
, ds_volatile
))
14272 cp_parser_error (parser
, "cv-qualified type parameter");
14279 /* Finish parsing/processing a template type parameter and checking
14280 various restrictions. */
14283 cp_parser_constrained_type_template_parm (cp_parser
*parser
,
14285 cp_parameter_declarator
* parmdecl
)
14287 if (cp_parser_check_constrained_type_parm (parser
, parmdecl
))
14288 return finish_template_type_parm (class_type_node
, id
);
14290 return error_mark_node
;
14294 finish_constrained_template_template_parm (tree proto
, tree id
)
14296 /* FIXME: This should probably be copied, and we may need to adjust
14297 the template parameter depths. */
14298 tree saved_parms
= current_template_parms
;
14299 begin_template_parm_list ();
14300 current_template_parms
= DECL_TEMPLATE_PARMS (proto
);
14301 end_template_parm_list ();
14303 tree parm
= finish_template_template_parm (class_type_node
, id
);
14304 current_template_parms
= saved_parms
;
14309 /* Finish parsing/processing a template template parameter by borrowing
14310 the template parameter list from the prototype parameter. */
14313 cp_parser_constrained_template_template_parm (cp_parser
*parser
,
14316 cp_parameter_declarator
*parmdecl
)
14318 if (!cp_parser_check_constrained_type_parm (parser
, parmdecl
))
14319 return error_mark_node
;
14320 return finish_constrained_template_template_parm (proto
, id
);
14323 /* Create a new non-type template parameter from the given PARM
14327 constrained_non_type_template_parm (bool *is_non_type
,
14328 cp_parameter_declarator
*parm
)
14330 *is_non_type
= true;
14331 cp_declarator
*decl
= parm
->declarator
;
14332 cp_decl_specifier_seq
*specs
= &parm
->decl_specifiers
;
14333 specs
->type
= TREE_TYPE (DECL_INITIAL (specs
->type
));
14334 return grokdeclarator (decl
, specs
, TPARM
, 0, NULL
);
14337 /* Build a constrained template parameter based on the PARMDECL
14338 declarator. The type of PARMDECL is the constrained type, which
14339 refers to the prototype template parameter that ultimately
14340 specifies the type of the declared parameter. */
14343 finish_constrained_parameter (cp_parser
*parser
,
14344 cp_parameter_declarator
*parmdecl
,
14346 bool *is_parameter_pack
)
14348 tree decl
= parmdecl
->decl_specifiers
.type
;
14349 tree id
= get_unqualified_id (parmdecl
->declarator
);
14350 tree def
= parmdecl
->default_argument
;
14351 tree proto
= DECL_INITIAL (decl
);
14353 /* A template parameter constrained by a variadic concept shall also
14354 be declared as a template parameter pack. */
14355 bool is_variadic
= template_parameter_pack_p (proto
);
14356 if (is_variadic
&& !*is_parameter_pack
)
14357 cp_parser_error (parser
, "variadic constraint introduced without %<...%>");
14359 /* Build the parameter. Return an error if the declarator was invalid. */
14361 if (TREE_CODE (proto
) == TYPE_DECL
)
14362 parm
= cp_parser_constrained_type_template_parm (parser
, id
, parmdecl
);
14363 else if (TREE_CODE (proto
) == TEMPLATE_DECL
)
14364 parm
= cp_parser_constrained_template_template_parm (parser
, proto
, id
,
14367 parm
= constrained_non_type_template_parm (is_non_type
, parmdecl
);
14368 if (parm
== error_mark_node
)
14369 return error_mark_node
;
14371 /* Finish the parameter decl and create a node attaching the
14372 default argument and constraint. */
14373 parm
= build_tree_list (def
, parm
);
14374 TEMPLATE_PARM_CONSTRAINTS (parm
) = decl
;
14379 /* Returns true if the parsed type actually represents the declaration
14380 of a type template-parameter. */
14383 declares_constrained_type_template_parameter (tree type
)
14385 return (is_constrained_parameter (type
)
14386 && TREE_CODE (TREE_TYPE (type
)) == TEMPLATE_TYPE_PARM
);
14390 /* Returns true if the parsed type actually represents the declaration of
14391 a template template-parameter. */
14394 declares_constrained_template_template_parameter (tree type
)
14396 return (is_constrained_parameter (type
)
14397 && TREE_CODE (TREE_TYPE (type
)) == TEMPLATE_TEMPLATE_PARM
);
14400 /* Parse a default argument for a type template-parameter.
14401 Note that diagnostics are handled in cp_parser_template_parameter. */
14404 cp_parser_default_type_template_argument (cp_parser
*parser
)
14406 gcc_assert (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
));
14408 /* Consume the `=' token. */
14409 cp_lexer_consume_token (parser
->lexer
);
14411 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
14413 /* Parse the default-argument. */
14414 push_deferring_access_checks (dk_no_deferred
);
14415 tree default_argument
= cp_parser_type_id (parser
);
14416 pop_deferring_access_checks ();
14418 if (flag_concepts
&& type_uses_auto (default_argument
))
14420 error_at (token
->location
,
14421 "invalid use of %<auto%> in default template argument");
14422 return error_mark_node
;
14425 return default_argument
;
14428 /* Parse a default argument for a template template-parameter. */
14431 cp_parser_default_template_template_argument (cp_parser
*parser
)
14433 gcc_assert (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
));
14437 /* Consume the `='. */
14438 cp_lexer_consume_token (parser
->lexer
);
14439 /* Parse the id-expression. */
14440 push_deferring_access_checks (dk_no_deferred
);
14441 /* save token before parsing the id-expression, for error
14443 const cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
14444 tree default_argument
14445 = cp_parser_id_expression (parser
,
14446 /*template_keyword_p=*/false,
14447 /*check_dependency_p=*/true,
14448 /*template_p=*/&is_template
,
14449 /*declarator_p=*/false,
14450 /*optional_p=*/false);
14451 if (TREE_CODE (default_argument
) == TYPE_DECL
)
14452 /* If the id-expression was a template-id that refers to
14453 a template-class, we already have the declaration here,
14454 so no further lookup is needed. */
14457 /* Look up the name. */
14459 = cp_parser_lookup_name (parser
, default_argument
,
14461 /*is_template=*/is_template
,
14462 /*is_namespace=*/false,
14463 /*check_dependency=*/true,
14464 /*ambiguous_decls=*/NULL
,
14466 /* See if the default argument is valid. */
14467 default_argument
= check_template_template_default_arg (default_argument
);
14468 pop_deferring_access_checks ();
14469 return default_argument
;
14472 /* Parse a template-parameter.
14474 template-parameter:
14476 parameter-declaration
14478 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14479 the parameter. The TREE_PURPOSE is the default value, if any.
14480 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14481 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14482 set to true iff this parameter is a parameter pack. */
14485 cp_parser_template_parameter (cp_parser
* parser
, bool *is_non_type
,
14486 bool *is_parameter_pack
)
14489 cp_parameter_declarator
*parameter_declarator
;
14492 /* Assume it is a type parameter or a template parameter. */
14493 *is_non_type
= false;
14494 /* Assume it not a parameter pack. */
14495 *is_parameter_pack
= false;
14496 /* Peek at the next token. */
14497 token
= cp_lexer_peek_token (parser
->lexer
);
14498 /* If it is `class' or `template', we have a type-parameter. */
14499 if (token
->keyword
== RID_TEMPLATE
)
14500 return cp_parser_type_parameter (parser
, is_parameter_pack
);
14501 /* If it is `class' or `typename' we do not know yet whether it is a
14502 type parameter or a non-type parameter. Consider:
14504 template <typename T, typename T::X X> ...
14508 template <class C, class D*> ...
14510 Here, the first parameter is a type parameter, and the second is
14511 a non-type parameter. We can tell by looking at the token after
14512 the identifier -- if it is a `,', `=', or `>' then we have a type
14514 if (token
->keyword
== RID_TYPENAME
|| token
->keyword
== RID_CLASS
)
14516 /* Peek at the token after `class' or `typename'. */
14517 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
14518 /* If it's an ellipsis, we have a template type parameter
14520 if (token
->type
== CPP_ELLIPSIS
)
14521 return cp_parser_type_parameter (parser
, is_parameter_pack
);
14522 /* If it's an identifier, skip it. */
14523 if (token
->type
== CPP_NAME
)
14524 token
= cp_lexer_peek_nth_token (parser
->lexer
, 3);
14525 /* Now, see if the token looks like the end of a template
14527 if (token
->type
== CPP_COMMA
14528 || token
->type
== CPP_EQ
14529 || token
->type
== CPP_GREATER
)
14530 return cp_parser_type_parameter (parser
, is_parameter_pack
);
14533 /* Otherwise, it is a non-type parameter or a constrained parameter.
14537 When parsing a default template-argument for a non-type
14538 template-parameter, the first non-nested `>' is taken as the end
14539 of the template parameter-list rather than a greater-than
14541 parameter_declarator
14542 = cp_parser_parameter_declaration (parser
, /*template_parm_p=*/true,
14543 /*parenthesized_p=*/NULL
);
14545 if (!parameter_declarator
)
14546 return error_mark_node
;
14548 /* If the parameter declaration is marked as a parameter pack, set
14549 *IS_PARAMETER_PACK to notify the caller. */
14550 if (parameter_declarator
->template_parameter_pack_p
)
14551 *is_parameter_pack
= true;
14553 if (parameter_declarator
->default_argument
)
14555 /* Can happen in some cases of erroneous input (c++/34892). */
14556 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
14557 /* Consume the `...' for better error recovery. */
14558 cp_lexer_consume_token (parser
->lexer
);
14561 // The parameter may have been constrained.
14562 if (is_constrained_parameter (parameter_declarator
))
14563 return finish_constrained_parameter (parser
,
14564 parameter_declarator
,
14566 is_parameter_pack
);
14568 // Now we're sure that the parameter is a non-type parameter.
14569 *is_non_type
= true;
14571 parm
= grokdeclarator (parameter_declarator
->declarator
,
14572 ¶meter_declarator
->decl_specifiers
,
14573 TPARM
, /*initialized=*/0,
14574 /*attrlist=*/NULL
);
14575 if (parm
== error_mark_node
)
14576 return error_mark_node
;
14578 return build_tree_list (parameter_declarator
->default_argument
, parm
);
14581 /* Parse a type-parameter.
14584 class identifier [opt]
14585 class identifier [opt] = type-id
14586 typename identifier [opt]
14587 typename identifier [opt] = type-id
14588 template < template-parameter-list > class identifier [opt]
14589 template < template-parameter-list > class identifier [opt]
14592 GNU Extension (variadic templates):
14595 class ... identifier [opt]
14596 typename ... identifier [opt]
14598 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14599 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14600 the declaration of the parameter.
14602 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14605 cp_parser_type_parameter (cp_parser
* parser
, bool *is_parameter_pack
)
14610 /* Look for a keyword to tell us what kind of parameter this is. */
14611 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_TYPENAME_TEMPLATE
);
14613 return error_mark_node
;
14615 switch (token
->keyword
)
14621 tree default_argument
;
14623 /* If the next token is an ellipsis, we have a template
14625 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
14627 /* Consume the `...' token. */
14628 cp_lexer_consume_token (parser
->lexer
);
14629 maybe_warn_variadic_templates ();
14631 *is_parameter_pack
= true;
14634 /* If the next token is an identifier, then it names the
14636 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
14637 identifier
= cp_parser_identifier (parser
);
14639 identifier
= NULL_TREE
;
14641 /* Create the parameter. */
14642 parameter
= finish_template_type_parm (class_type_node
, identifier
);
14644 /* If the next token is an `=', we have a default argument. */
14645 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
14648 = cp_parser_default_type_template_argument (parser
);
14650 /* Template parameter packs cannot have default
14652 if (*is_parameter_pack
)
14655 error_at (token
->location
,
14656 "template parameter pack %qD cannot have a "
14657 "default argument", identifier
);
14659 error_at (token
->location
,
14660 "template parameter packs cannot have "
14661 "default arguments");
14662 default_argument
= NULL_TREE
;
14664 else if (check_for_bare_parameter_packs (default_argument
))
14665 default_argument
= error_mark_node
;
14668 default_argument
= NULL_TREE
;
14670 /* Create the combined representation of the parameter and the
14671 default argument. */
14672 parameter
= build_tree_list (default_argument
, parameter
);
14679 tree default_argument
;
14681 /* Look for the `<'. */
14682 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
14683 /* Parse the template-parameter-list. */
14684 cp_parser_template_parameter_list (parser
);
14685 /* Look for the `>'. */
14686 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
14688 // If template requirements are present, parse them.
14689 tree reqs
= get_shorthand_constraints (current_template_parms
);
14690 if (tree r
= cp_parser_requires_clause_opt (parser
))
14691 reqs
= conjoin_constraints (reqs
, make_predicate_constraint (r
));
14692 TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
) = reqs
;
14694 /* Look for the `class' or 'typename' keywords. */
14695 cp_parser_type_parameter_key (parser
);
14696 /* If the next token is an ellipsis, we have a template
14698 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
14700 /* Consume the `...' token. */
14701 cp_lexer_consume_token (parser
->lexer
);
14702 maybe_warn_variadic_templates ();
14704 *is_parameter_pack
= true;
14706 /* If the next token is an `=', then there is a
14707 default-argument. If the next token is a `>', we are at
14708 the end of the parameter-list. If the next token is a `,',
14709 then we are at the end of this parameter. */
14710 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
14711 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_GREATER
)
14712 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14714 identifier
= cp_parser_identifier (parser
);
14715 /* Treat invalid names as if the parameter were nameless. */
14716 if (identifier
== error_mark_node
)
14717 identifier
= NULL_TREE
;
14720 identifier
= NULL_TREE
;
14722 /* Create the template parameter. */
14723 parameter
= finish_template_template_parm (class_type_node
,
14726 /* If the next token is an `=', then there is a
14727 default-argument. */
14728 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
14731 = cp_parser_default_template_template_argument (parser
);
14733 /* Template parameter packs cannot have default
14735 if (*is_parameter_pack
)
14738 error_at (token
->location
,
14739 "template parameter pack %qD cannot "
14740 "have a default argument",
14743 error_at (token
->location
, "template parameter packs cannot "
14744 "have default arguments");
14745 default_argument
= NULL_TREE
;
14749 default_argument
= NULL_TREE
;
14751 /* Create the combined representation of the parameter and the
14752 default argument. */
14753 parameter
= build_tree_list (default_argument
, parameter
);
14758 gcc_unreachable ();
14765 /* Parse a template-id.
14768 template-name < template-argument-list [opt] >
14770 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14771 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14772 returned. Otherwise, if the template-name names a function, or set
14773 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14774 names a class, returns a TYPE_DECL for the specialization.
14776 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14777 uninstantiated templates. */
14780 cp_parser_template_id (cp_parser
*parser
,
14781 bool template_keyword_p
,
14782 bool check_dependency_p
,
14783 enum tag_types tag_type
,
14784 bool is_declaration
)
14789 cp_token_position start_of_id
= 0;
14790 cp_token
*next_token
= NULL
, *next_token_2
= NULL
;
14791 bool is_identifier
;
14793 /* If the next token corresponds to a template-id, there is no need
14795 next_token
= cp_lexer_peek_token (parser
->lexer
);
14796 if (next_token
->type
== CPP_TEMPLATE_ID
)
14798 cp_lexer_consume_token (parser
->lexer
);
14799 return saved_checks_value (next_token
->u
.tree_check_value
);
14802 /* Avoid performing name lookup if there is no possibility of
14803 finding a template-id. */
14804 if ((next_token
->type
!= CPP_NAME
&& next_token
->keyword
!= RID_OPERATOR
)
14805 || (next_token
->type
== CPP_NAME
14806 && !cp_parser_nth_token_starts_template_argument_list_p
14809 cp_parser_error (parser
, "expected template-id");
14810 return error_mark_node
;
14813 /* Remember where the template-id starts. */
14814 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
14815 start_of_id
= cp_lexer_token_position (parser
->lexer
, false);
14817 push_deferring_access_checks (dk_deferred
);
14819 /* Parse the template-name. */
14820 is_identifier
= false;
14821 templ
= cp_parser_template_name (parser
, template_keyword_p
,
14822 check_dependency_p
,
14826 if (templ
== error_mark_node
|| is_identifier
)
14828 pop_deferring_access_checks ();
14832 /* Since we're going to preserve any side-effects from this parse, set up a
14833 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14834 in the template arguments. */
14835 tentative_firewall
firewall (parser
);
14837 /* If we find the sequence `[:' after a template-name, it's probably
14838 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14839 parse correctly the argument list. */
14840 if (((next_token
= cp_lexer_peek_token (parser
->lexer
))->type
14841 == CPP_OPEN_SQUARE
)
14842 && next_token
->flags
& DIGRAPH
14843 && ((next_token_2
= cp_lexer_peek_nth_token (parser
->lexer
, 2))->type
14845 && !(next_token_2
->flags
& PREV_WHITE
))
14847 cp_parser_parse_tentatively (parser
);
14848 /* Change `:' into `::'. */
14849 next_token_2
->type
= CPP_SCOPE
;
14850 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14852 cp_lexer_consume_token (parser
->lexer
);
14854 /* Parse the arguments. */
14855 arguments
= cp_parser_enclosed_template_argument_list (parser
);
14856 if (!cp_parser_parse_definitely (parser
))
14858 /* If we couldn't parse an argument list, then we revert our changes
14859 and return simply an error. Maybe this is not a template-id
14861 next_token_2
->type
= CPP_COLON
;
14862 cp_parser_error (parser
, "expected %<<%>");
14863 pop_deferring_access_checks ();
14864 return error_mark_node
;
14866 /* Otherwise, emit an error about the invalid digraph, but continue
14867 parsing because we got our argument list. */
14868 if (permerror (next_token
->location
,
14869 "%<<::%> cannot begin a template-argument list"))
14871 static bool hint
= false;
14872 inform (next_token
->location
,
14873 "%<<:%> is an alternate spelling for %<[%>."
14874 " Insert whitespace between %<<%> and %<::%>");
14875 if (!hint
&& !flag_permissive
)
14877 inform (next_token
->location
, "(if you use %<-fpermissive%> "
14878 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14879 "accept your code)");
14886 /* Look for the `<' that starts the template-argument-list. */
14887 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
14889 pop_deferring_access_checks ();
14890 return error_mark_node
;
14892 /* Parse the arguments. */
14893 arguments
= cp_parser_enclosed_template_argument_list (parser
);
14896 /* Build a representation of the specialization. */
14897 if (identifier_p (templ
))
14898 template_id
= build_min_nt_loc (next_token
->location
,
14901 else if (DECL_TYPE_TEMPLATE_P (templ
)
14902 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
14904 bool entering_scope
;
14905 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14906 template (rather than some instantiation thereof) only if
14907 is not nested within some other construct. For example, in
14908 "template <typename T> void f(T) { A<T>::", A<T> is just an
14909 instantiation of A. */
14910 entering_scope
= (template_parm_scope_p ()
14911 && cp_lexer_next_token_is (parser
->lexer
,
14914 = finish_template_type (templ
, arguments
, entering_scope
);
14916 /* A template-like identifier may be a partial concept id. */
14917 else if (flag_concepts
14918 && (template_id
= (cp_parser_maybe_partial_concept_id
14919 (parser
, templ
, arguments
))))
14920 return template_id
;
14921 else if (variable_template_p (templ
))
14923 template_id
= lookup_template_variable (templ
, arguments
);
14924 if (TREE_CODE (template_id
) == TEMPLATE_ID_EXPR
)
14925 SET_EXPR_LOCATION (template_id
, next_token
->location
);
14929 /* If it's not a class-template or a template-template, it should be
14930 a function-template. */
14931 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ
)
14932 || TREE_CODE (templ
) == OVERLOAD
14933 || BASELINK_P (templ
)));
14935 template_id
= lookup_template_function (templ
, arguments
);
14936 if (TREE_CODE (template_id
) == TEMPLATE_ID_EXPR
)
14937 SET_EXPR_LOCATION (template_id
, next_token
->location
);
14940 /* If parsing tentatively, replace the sequence of tokens that makes
14941 up the template-id with a CPP_TEMPLATE_ID token. That way,
14942 should we re-parse the token stream, we will not have to repeat
14943 the effort required to do the parse, nor will we issue duplicate
14944 error messages about problems during instantiation of the
14947 /* Don't do this if we had a parse error in a declarator; re-parsing
14948 might succeed if a name changes meaning (60361). */
14949 && !(cp_parser_error_occurred (parser
)
14950 && cp_parser_parsing_tentatively (parser
)
14951 && parser
->in_declarator_p
))
14953 cp_token
*token
= cp_lexer_token_at (parser
->lexer
, start_of_id
);
14955 /* Reset the contents of the START_OF_ID token. */
14956 token
->type
= CPP_TEMPLATE_ID
;
14958 /* Update the location to be of the form:
14959 template-name < template-argument-list [opt] >
14960 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14961 with caret == start at the start of the template-name,
14962 ranging until the closing '>'. */
14963 location_t finish_loc
14964 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
14965 location_t combined_loc
14966 = make_location (token
->location
, token
->location
, finish_loc
);
14967 token
->location
= combined_loc
;
14969 /* Retrieve any deferred checks. Do not pop this access checks yet
14970 so the memory will not be reclaimed during token replacing below. */
14971 token
->u
.tree_check_value
= ggc_cleared_alloc
<struct tree_check
> ();
14972 token
->u
.tree_check_value
->value
= template_id
;
14973 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
14974 token
->keyword
= RID_MAX
;
14976 /* Purge all subsequent tokens. */
14977 cp_lexer_purge_tokens_after (parser
->lexer
, start_of_id
);
14979 /* ??? Can we actually assume that, if template_id ==
14980 error_mark_node, we will have issued a diagnostic to the
14981 user, as opposed to simply marking the tentative parse as
14983 if (cp_parser_error_occurred (parser
) && template_id
!= error_mark_node
)
14984 error_at (token
->location
, "parse error in template argument list");
14987 pop_to_parent_deferring_access_checks ();
14988 return template_id
;
14991 /* Parse a template-name.
14996 The standard should actually say:
15000 operator-function-id
15002 A defect report has been filed about this issue.
15004 A conversion-function-id cannot be a template name because they cannot
15005 be part of a template-id. In fact, looking at this code:
15007 a.operator K<int>()
15009 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15010 It is impossible to call a templated conversion-function-id with an
15011 explicit argument list, since the only allowed template parameter is
15012 the type to which it is converting.
15014 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15015 `template' keyword, in a construction like:
15019 In that case `f' is taken to be a template-name, even though there
15020 is no way of knowing for sure.
15022 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15023 name refers to a set of overloaded functions, at least one of which
15024 is a template, or an IDENTIFIER_NODE with the name of the template,
15025 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15026 names are looked up inside uninstantiated templates. */
15029 cp_parser_template_name (cp_parser
* parser
,
15030 bool template_keyword_p
,
15031 bool check_dependency_p
,
15032 bool is_declaration
,
15033 enum tag_types tag_type
,
15034 bool *is_identifier
)
15039 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15041 /* If the next token is `operator', then we have either an
15042 operator-function-id or a conversion-function-id. */
15043 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_OPERATOR
))
15045 /* We don't know whether we're looking at an
15046 operator-function-id or a conversion-function-id. */
15047 cp_parser_parse_tentatively (parser
);
15048 /* Try an operator-function-id. */
15049 identifier
= cp_parser_operator_function_id (parser
);
15050 /* If that didn't work, try a conversion-function-id. */
15051 if (!cp_parser_parse_definitely (parser
))
15053 cp_parser_error (parser
, "expected template-name");
15054 return error_mark_node
;
15057 /* Look for the identifier. */
15059 identifier
= cp_parser_identifier (parser
);
15061 /* If we didn't find an identifier, we don't have a template-id. */
15062 if (identifier
== error_mark_node
)
15063 return error_mark_node
;
15065 /* If the name immediately followed the `template' keyword, then it
15066 is a template-name. However, if the next token is not `<', then
15067 we do not treat it as a template-name, since it is not being used
15068 as part of a template-id. This enables us to handle constructs
15071 template <typename T> struct S { S(); };
15072 template <typename T> S<T>::S();
15074 correctly. We would treat `S' as a template -- if it were `S<T>'
15075 -- but we do not if there is no `<'. */
15077 if (processing_template_decl
15078 && cp_parser_nth_token_starts_template_argument_list_p (parser
, 1))
15080 /* In a declaration, in a dependent context, we pretend that the
15081 "template" keyword was present in order to improve error
15082 recovery. For example, given:
15084 template <typename T> void f(T::X<int>);
15086 we want to treat "X<int>" as a template-id. */
15088 && !template_keyword_p
15089 && parser
->scope
&& TYPE_P (parser
->scope
)
15090 && check_dependency_p
15091 && dependent_scope_p (parser
->scope
)
15092 /* Do not do this for dtors (or ctors), since they never
15093 need the template keyword before their name. */
15094 && !constructor_name_p (identifier
, parser
->scope
))
15096 cp_token_position start
= 0;
15098 /* Explain what went wrong. */
15099 error_at (token
->location
, "non-template %qD used as template",
15101 inform (token
->location
, "use %<%T::template %D%> to indicate that it is a template",
15102 parser
->scope
, identifier
);
15103 /* If parsing tentatively, find the location of the "<" token. */
15104 if (cp_parser_simulate_error (parser
))
15105 start
= cp_lexer_token_position (parser
->lexer
, true);
15106 /* Parse the template arguments so that we can issue error
15107 messages about them. */
15108 cp_lexer_consume_token (parser
->lexer
);
15109 cp_parser_enclosed_template_argument_list (parser
);
15110 /* Skip tokens until we find a good place from which to
15111 continue parsing. */
15112 cp_parser_skip_to_closing_parenthesis (parser
,
15113 /*recovering=*/true,
15115 /*consume_paren=*/false);
15116 /* If parsing tentatively, permanently remove the
15117 template argument list. That will prevent duplicate
15118 error messages from being issued about the missing
15119 "template" keyword. */
15121 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
15123 *is_identifier
= true;
15127 /* If the "template" keyword is present, then there is generally
15128 no point in doing name-lookup, so we just return IDENTIFIER.
15129 But, if the qualifying scope is non-dependent then we can
15130 (and must) do name-lookup normally. */
15131 if (template_keyword_p
15133 || (TYPE_P (parser
->scope
)
15134 && dependent_type_p (parser
->scope
))))
15138 /* Look up the name. */
15139 decl
= cp_parser_lookup_name (parser
, identifier
,
15141 /*is_template=*/true,
15142 /*is_namespace=*/false,
15143 check_dependency_p
,
15144 /*ambiguous_decls=*/NULL
,
15147 decl
= strip_using_decl (decl
);
15149 /* If DECL is a template, then the name was a template-name. */
15150 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
15152 if (TREE_DEPRECATED (decl
)
15153 && deprecated_state
!= DEPRECATED_SUPPRESS
)
15154 warn_deprecated_use (decl
, NULL_TREE
);
15158 tree fn
= NULL_TREE
;
15160 /* The standard does not explicitly indicate whether a name that
15161 names a set of overloaded declarations, some of which are
15162 templates, is a template-name. However, such a name should
15163 be a template-name; otherwise, there is no way to form a
15164 template-id for the overloaded templates. */
15165 fns
= BASELINK_P (decl
) ? BASELINK_FUNCTIONS (decl
) : decl
;
15166 if (TREE_CODE (fns
) == OVERLOAD
)
15167 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
15168 if (TREE_CODE (OVL_CURRENT (fn
)) == TEMPLATE_DECL
)
15173 /* The name does not name a template. */
15174 cp_parser_error (parser
, "expected template-name");
15175 return error_mark_node
;
15179 /* If DECL is dependent, and refers to a function, then just return
15180 its name; we will look it up again during template instantiation. */
15181 if (DECL_FUNCTION_TEMPLATE_P (decl
) || !DECL_P (decl
))
15183 tree scope
= ovl_scope (decl
);
15184 if (TYPE_P (scope
) && dependent_type_p (scope
))
15191 /* Parse a template-argument-list.
15193 template-argument-list:
15194 template-argument ... [opt]
15195 template-argument-list , template-argument ... [opt]
15197 Returns a TREE_VEC containing the arguments. */
15200 cp_parser_template_argument_list (cp_parser
* parser
)
15202 tree fixed_args
[10];
15203 unsigned n_args
= 0;
15204 unsigned alloced
= 10;
15205 tree
*arg_ary
= fixed_args
;
15207 bool saved_in_template_argument_list_p
;
15209 bool saved_non_ice_p
;
15211 saved_in_template_argument_list_p
= parser
->in_template_argument_list_p
;
15212 parser
->in_template_argument_list_p
= true;
15213 /* Even if the template-id appears in an integral
15214 constant-expression, the contents of the argument list do
15216 saved_ice_p
= parser
->integral_constant_expression_p
;
15217 parser
->integral_constant_expression_p
= false;
15218 saved_non_ice_p
= parser
->non_integral_constant_expression_p
;
15219 parser
->non_integral_constant_expression_p
= false;
15221 /* Parse the arguments. */
15227 /* Consume the comma. */
15228 cp_lexer_consume_token (parser
->lexer
);
15230 /* Parse the template-argument. */
15231 argument
= cp_parser_template_argument (parser
);
15233 /* If the next token is an ellipsis, we're expanding a template
15235 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
15237 if (argument
== error_mark_node
)
15239 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15240 error_at (token
->location
,
15241 "expected parameter pack before %<...%>");
15243 /* Consume the `...' token. */
15244 cp_lexer_consume_token (parser
->lexer
);
15246 /* Make the argument into a TYPE_PACK_EXPANSION or
15247 EXPR_PACK_EXPANSION. */
15248 argument
= make_pack_expansion (argument
);
15251 if (n_args
== alloced
)
15255 if (arg_ary
== fixed_args
)
15257 arg_ary
= XNEWVEC (tree
, alloced
);
15258 memcpy (arg_ary
, fixed_args
, sizeof (tree
) * n_args
);
15261 arg_ary
= XRESIZEVEC (tree
, arg_ary
, alloced
);
15263 arg_ary
[n_args
++] = argument
;
15265 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
15267 vec
= make_tree_vec (n_args
);
15270 TREE_VEC_ELT (vec
, n_args
) = arg_ary
[n_args
];
15272 if (arg_ary
!= fixed_args
)
15274 parser
->non_integral_constant_expression_p
= saved_non_ice_p
;
15275 parser
->integral_constant_expression_p
= saved_ice_p
;
15276 parser
->in_template_argument_list_p
= saved_in_template_argument_list_p
;
15278 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
15282 /* Parse a template-argument.
15285 assignment-expression
15289 The representation is that of an assignment-expression, type-id, or
15290 id-expression -- except that the qualified id-expression is
15291 evaluated, so that the value returned is either a DECL or an
15294 Although the standard says "assignment-expression", it forbids
15295 throw-expressions or assignments in the template argument.
15296 Therefore, we use "conditional-expression" instead. */
15299 cp_parser_template_argument (cp_parser
* parser
)
15304 bool maybe_type_id
= false;
15305 cp_token
*token
= NULL
, *argument_start_token
= NULL
;
15306 location_t loc
= 0;
15309 /* There's really no way to know what we're looking at, so we just
15310 try each alternative in order.
15314 In a template-argument, an ambiguity between a type-id and an
15315 expression is resolved to a type-id, regardless of the form of
15316 the corresponding template-parameter.
15318 Therefore, we try a type-id first. */
15319 cp_parser_parse_tentatively (parser
);
15320 argument
= cp_parser_template_type_arg (parser
);
15321 /* If there was no error parsing the type-id but the next token is a
15322 '>>', our behavior depends on which dialect of C++ we're
15323 parsing. In C++98, we probably found a typo for '> >'. But there
15324 are type-id which are also valid expressions. For instance:
15326 struct X { int operator >> (int); };
15327 template <int V> struct Foo {};
15330 Here 'X()' is a valid type-id of a function type, but the user just
15331 wanted to write the expression "X() >> 5". Thus, we remember that we
15332 found a valid type-id, but we still try to parse the argument as an
15333 expression to see what happens.
15335 In C++0x, the '>>' will be considered two separate '>'
15337 if (!cp_parser_error_occurred (parser
)
15338 && cxx_dialect
== cxx98
15339 && cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
15341 maybe_type_id
= true;
15342 cp_parser_abort_tentative_parse (parser
);
15346 /* If the next token isn't a `,' or a `>', then this argument wasn't
15347 really finished. This means that the argument is not a valid
15349 if (!cp_parser_next_token_ends_template_argument_p (parser
))
15350 cp_parser_error (parser
, "expected template-argument");
15351 /* If that worked, we're done. */
15352 if (cp_parser_parse_definitely (parser
))
15355 /* We're still not sure what the argument will be. */
15356 cp_parser_parse_tentatively (parser
);
15357 /* Try a template. */
15358 argument_start_token
= cp_lexer_peek_token (parser
->lexer
);
15359 argument
= cp_parser_id_expression (parser
,
15360 /*template_keyword_p=*/false,
15361 /*check_dependency_p=*/true,
15363 /*declarator_p=*/false,
15364 /*optional_p=*/false);
15365 /* If the next token isn't a `,' or a `>', then this argument wasn't
15366 really finished. */
15367 if (!cp_parser_next_token_ends_template_argument_p (parser
))
15368 cp_parser_error (parser
, "expected template-argument");
15369 if (!cp_parser_error_occurred (parser
))
15371 /* Figure out what is being referred to. If the id-expression
15372 was for a class template specialization, then we will have a
15373 TYPE_DECL at this point. There is no need to do name lookup
15374 at this point in that case. */
15375 if (TREE_CODE (argument
) != TYPE_DECL
)
15376 argument
= cp_parser_lookup_name (parser
, argument
,
15378 /*is_template=*/template_p
,
15379 /*is_namespace=*/false,
15380 /*check_dependency=*/true,
15381 /*ambiguous_decls=*/NULL
,
15382 argument_start_token
->location
);
15383 /* Handle a constrained-type-specifier for a non-type template
15385 if (tree decl
= cp_parser_maybe_concept_name (parser
, argument
))
15387 else if (TREE_CODE (argument
) != TEMPLATE_DECL
15388 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
15389 cp_parser_error (parser
, "expected template-name");
15391 if (cp_parser_parse_definitely (parser
))
15393 if (TREE_DEPRECATED (argument
))
15394 warn_deprecated_use (argument
, NULL_TREE
);
15397 /* It must be a non-type argument. In C++17 any constant-expression is
15399 if (cxx_dialect
> cxx14
)
15402 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15404 -- an integral constant-expression of integral or enumeration
15407 -- the name of a non-type template-parameter; or
15409 -- the name of an object or function with external linkage...
15411 -- the address of an object or function with external linkage...
15413 -- a pointer to member... */
15414 /* Look for a non-type template parameter. */
15415 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
15417 cp_parser_parse_tentatively (parser
);
15418 argument
= cp_parser_primary_expression (parser
,
15419 /*address_p=*/false,
15421 /*template_arg_p=*/true,
15423 if (TREE_CODE (argument
) != TEMPLATE_PARM_INDEX
15424 || !cp_parser_next_token_ends_template_argument_p (parser
))
15425 cp_parser_simulate_error (parser
);
15426 if (cp_parser_parse_definitely (parser
))
15430 /* If the next token is "&", the argument must be the address of an
15431 object or function with external linkage. */
15432 address_p
= cp_lexer_next_token_is (parser
->lexer
, CPP_AND
);
15435 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
15436 cp_lexer_consume_token (parser
->lexer
);
15438 /* See if we might have an id-expression. */
15439 token
= cp_lexer_peek_token (parser
->lexer
);
15440 if (token
->type
== CPP_NAME
15441 || token
->keyword
== RID_OPERATOR
15442 || token
->type
== CPP_SCOPE
15443 || token
->type
== CPP_TEMPLATE_ID
15444 || token
->type
== CPP_NESTED_NAME_SPECIFIER
)
15446 cp_parser_parse_tentatively (parser
);
15447 argument
= cp_parser_primary_expression (parser
,
15450 /*template_arg_p=*/true,
15452 if (cp_parser_error_occurred (parser
)
15453 || !cp_parser_next_token_ends_template_argument_p (parser
))
15454 cp_parser_abort_tentative_parse (parser
);
15459 if (INDIRECT_REF_P (argument
))
15461 /* Strip the dereference temporarily. */
15462 gcc_assert (REFERENCE_REF_P (argument
));
15463 argument
= TREE_OPERAND (argument
, 0);
15466 /* If we're in a template, we represent a qualified-id referring
15467 to a static data member as a SCOPE_REF even if the scope isn't
15468 dependent so that we can check access control later. */
15470 if (TREE_CODE (probe
) == SCOPE_REF
)
15471 probe
= TREE_OPERAND (probe
, 1);
15474 /* A variable without external linkage might still be a
15475 valid constant-expression, so no error is issued here
15476 if the external-linkage check fails. */
15477 if (!address_p
&& !DECL_EXTERNAL_LINKAGE_P (probe
))
15478 cp_parser_simulate_error (parser
);
15480 else if (is_overloaded_fn (argument
))
15481 /* All overloaded functions are allowed; if the external
15482 linkage test does not pass, an error will be issued
15486 && (TREE_CODE (argument
) == OFFSET_REF
15487 || TREE_CODE (argument
) == SCOPE_REF
))
15488 /* A pointer-to-member. */
15490 else if (TREE_CODE (argument
) == TEMPLATE_PARM_INDEX
)
15493 cp_parser_simulate_error (parser
);
15495 if (cp_parser_parse_definitely (parser
))
15498 argument
= build_x_unary_op (loc
, ADDR_EXPR
, argument
,
15499 tf_warning_or_error
);
15501 argument
= convert_from_reference (argument
);
15506 /* If the argument started with "&", there are no other valid
15507 alternatives at this point. */
15510 cp_parser_error (parser
, "invalid non-type template argument");
15511 return error_mark_node
;
15515 /* If the argument wasn't successfully parsed as a type-id followed
15516 by '>>', the argument can only be a constant expression now.
15517 Otherwise, we try parsing the constant-expression tentatively,
15518 because the argument could really be a type-id. */
15520 cp_parser_parse_tentatively (parser
);
15522 if (cxx_dialect
<= cxx14
)
15523 argument
= cp_parser_constant_expression (parser
);
15526 /* With C++17 generalized non-type template arguments we need to handle
15527 lvalue constant expressions, too. */
15528 argument
= cp_parser_assignment_expression (parser
);
15529 require_potential_constant_expression (argument
);
15532 if (!maybe_type_id
)
15534 if (!cp_parser_next_token_ends_template_argument_p (parser
))
15535 cp_parser_error (parser
, "expected template-argument");
15536 if (cp_parser_parse_definitely (parser
))
15538 /* We did our best to parse the argument as a non type-id, but that
15539 was the only alternative that matched (albeit with a '>' after
15540 it). We can assume it's just a typo from the user, and a
15541 diagnostic will then be issued. */
15542 return cp_parser_template_type_arg (parser
);
15545 /* Parse an explicit-instantiation.
15547 explicit-instantiation:
15548 template declaration
15550 Although the standard says `declaration', what it really means is:
15552 explicit-instantiation:
15553 template decl-specifier-seq [opt] declarator [opt] ;
15555 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15556 supposed to be allowed. A defect report has been filed about this
15561 explicit-instantiation:
15562 storage-class-specifier template
15563 decl-specifier-seq [opt] declarator [opt] ;
15564 function-specifier template
15565 decl-specifier-seq [opt] declarator [opt] ; */
15568 cp_parser_explicit_instantiation (cp_parser
* parser
)
15570 int declares_class_or_enum
;
15571 cp_decl_specifier_seq decl_specifiers
;
15572 tree extension_specifier
= NULL_TREE
;
15574 timevar_push (TV_TEMPLATE_INST
);
15576 /* Look for an (optional) storage-class-specifier or
15577 function-specifier. */
15578 if (cp_parser_allow_gnu_extensions_p (parser
))
15580 extension_specifier
15581 = cp_parser_storage_class_specifier_opt (parser
);
15582 if (!extension_specifier
)
15583 extension_specifier
15584 = cp_parser_function_specifier_opt (parser
,
15585 /*decl_specs=*/NULL
);
15588 /* Look for the `template' keyword. */
15589 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
15590 /* Let the front end know that we are processing an explicit
15592 begin_explicit_instantiation ();
15593 /* [temp.explicit] says that we are supposed to ignore access
15594 control while processing explicit instantiation directives. */
15595 push_deferring_access_checks (dk_no_check
);
15596 /* Parse a decl-specifier-seq. */
15597 cp_parser_decl_specifier_seq (parser
,
15598 CP_PARSER_FLAGS_OPTIONAL
,
15600 &declares_class_or_enum
);
15601 /* If there was exactly one decl-specifier, and it declared a class,
15602 and there's no declarator, then we have an explicit type
15604 if (declares_class_or_enum
&& cp_parser_declares_only_class_p (parser
))
15608 type
= check_tag_decl (&decl_specifiers
,
15609 /*explicit_type_instantiation_p=*/true);
15610 /* Turn access control back on for names used during
15611 template instantiation. */
15612 pop_deferring_access_checks ();
15614 do_type_instantiation (type
, extension_specifier
,
15615 /*complain=*/tf_error
);
15619 cp_declarator
*declarator
;
15622 /* Parse the declarator. */
15624 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
15625 /*ctor_dtor_or_conv_p=*/NULL
,
15626 /*parenthesized_p=*/NULL
,
15627 /*member_p=*/false,
15628 /*friend_p=*/false);
15629 if (declares_class_or_enum
& 2)
15630 cp_parser_check_for_definition_in_return_type (declarator
,
15631 decl_specifiers
.type
,
15632 decl_specifiers
.locations
[ds_type_spec
]);
15633 if (declarator
!= cp_error_declarator
)
15635 if (decl_spec_seq_has_spec_p (&decl_specifiers
, ds_inline
))
15636 permerror (decl_specifiers
.locations
[ds_inline
],
15637 "explicit instantiation shall not use"
15638 " %<inline%> specifier");
15639 if (decl_spec_seq_has_spec_p (&decl_specifiers
, ds_constexpr
))
15640 permerror (decl_specifiers
.locations
[ds_constexpr
],
15641 "explicit instantiation shall not use"
15642 " %<constexpr%> specifier");
15644 decl
= grokdeclarator (declarator
, &decl_specifiers
,
15645 NORMAL
, 0, &decl_specifiers
.attributes
);
15646 /* Turn access control back on for names used during
15647 template instantiation. */
15648 pop_deferring_access_checks ();
15649 /* Do the explicit instantiation. */
15650 do_decl_instantiation (decl
, extension_specifier
);
15654 pop_deferring_access_checks ();
15655 /* Skip the body of the explicit instantiation. */
15656 cp_parser_skip_to_end_of_statement (parser
);
15659 /* We're done with the instantiation. */
15660 end_explicit_instantiation ();
15662 cp_parser_consume_semicolon_at_end_of_statement (parser
);
15664 timevar_pop (TV_TEMPLATE_INST
);
15667 /* Parse an explicit-specialization.
15669 explicit-specialization:
15670 template < > declaration
15672 Although the standard says `declaration', what it really means is:
15674 explicit-specialization:
15675 template <> decl-specifier [opt] init-declarator [opt] ;
15676 template <> function-definition
15677 template <> explicit-specialization
15678 template <> template-declaration */
15681 cp_parser_explicit_specialization (cp_parser
* parser
)
15683 bool need_lang_pop
;
15684 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15686 /* Look for the `template' keyword. */
15687 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
15688 /* Look for the `<'. */
15689 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
15690 /* Look for the `>'. */
15691 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
15692 /* We have processed another parameter list. */
15693 ++parser
->num_template_parameter_lists
;
15696 A template ... explicit specialization ... shall not have C
15698 if (current_lang_name
== lang_name_c
)
15700 error_at (token
->location
, "template specialization with C linkage");
15701 /* Give it C++ linkage to avoid confusing other parts of the
15703 push_lang_context (lang_name_cplusplus
);
15704 need_lang_pop
= true;
15707 need_lang_pop
= false;
15708 /* Let the front end know that we are beginning a specialization. */
15709 if (!begin_specialization ())
15711 end_specialization ();
15715 /* If the next keyword is `template', we need to figure out whether
15716 or not we're looking a template-declaration. */
15717 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
15719 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
15720 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_GREATER
)
15721 cp_parser_template_declaration_after_export (parser
,
15722 /*member_p=*/false);
15724 cp_parser_explicit_specialization (parser
);
15727 /* Parse the dependent declaration. */
15728 cp_parser_single_declaration (parser
,
15730 /*member_p=*/false,
15731 /*explicit_specialization_p=*/true,
15732 /*friend_p=*/NULL
);
15733 /* We're done with the specialization. */
15734 end_specialization ();
15735 /* For the erroneous case of a template with C linkage, we pushed an
15736 implicit C++ linkage scope; exit that scope now. */
15738 pop_lang_context ();
15739 /* We're done with this parameter list. */
15740 --parser
->num_template_parameter_lists
;
15743 /* Parse a type-specifier.
15746 simple-type-specifier
15749 elaborated-type-specifier
15757 Returns a representation of the type-specifier. For a
15758 class-specifier, enum-specifier, or elaborated-type-specifier, a
15759 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15761 The parser flags FLAGS is used to control type-specifier parsing.
15763 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15764 in a decl-specifier-seq.
15766 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15767 class-specifier, enum-specifier, or elaborated-type-specifier, then
15768 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15769 if a type is declared; 2 if it is defined. Otherwise, it is set to
15772 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15773 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15774 is set to FALSE. */
15777 cp_parser_type_specifier (cp_parser
* parser
,
15778 cp_parser_flags flags
,
15779 cp_decl_specifier_seq
*decl_specs
,
15780 bool is_declaration
,
15781 int* declares_class_or_enum
,
15782 bool* is_cv_qualifier
)
15784 tree type_spec
= NULL_TREE
;
15787 cp_decl_spec ds
= ds_last
;
15789 /* Assume this type-specifier does not declare a new type. */
15790 if (declares_class_or_enum
)
15791 *declares_class_or_enum
= 0;
15792 /* And that it does not specify a cv-qualifier. */
15793 if (is_cv_qualifier
)
15794 *is_cv_qualifier
= false;
15795 /* Peek at the next token. */
15796 token
= cp_lexer_peek_token (parser
->lexer
);
15798 /* If we're looking at a keyword, we can use that to guide the
15799 production we choose. */
15800 keyword
= token
->keyword
;
15804 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
15805 goto elaborated_type_specifier
;
15807 /* Look for the enum-specifier. */
15808 type_spec
= cp_parser_enum_specifier (parser
);
15809 /* If that worked, we're done. */
15812 if (declares_class_or_enum
)
15813 *declares_class_or_enum
= 2;
15815 cp_parser_set_decl_spec_type (decl_specs
,
15818 /*type_definition_p=*/true);
15822 goto elaborated_type_specifier
;
15824 /* Any of these indicate either a class-specifier, or an
15825 elaborated-type-specifier. */
15829 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
15830 goto elaborated_type_specifier
;
15832 /* Parse tentatively so that we can back up if we don't find a
15833 class-specifier. */
15834 cp_parser_parse_tentatively (parser
);
15835 /* Look for the class-specifier. */
15836 type_spec
= cp_parser_class_specifier (parser
);
15837 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE
, type_spec
);
15838 /* If that worked, we're done. */
15839 if (cp_parser_parse_definitely (parser
))
15841 if (declares_class_or_enum
)
15842 *declares_class_or_enum
= 2;
15844 cp_parser_set_decl_spec_type (decl_specs
,
15847 /*type_definition_p=*/true);
15851 /* Fall through. */
15852 elaborated_type_specifier
:
15853 /* We're declaring (not defining) a class or enum. */
15854 if (declares_class_or_enum
)
15855 *declares_class_or_enum
= 1;
15857 /* Fall through. */
15859 /* Look for an elaborated-type-specifier. */
15861 = (cp_parser_elaborated_type_specifier
15863 decl_spec_seq_has_spec_p (decl_specs
, ds_friend
),
15866 cp_parser_set_decl_spec_type (decl_specs
,
15869 /*type_definition_p=*/false);
15874 if (is_cv_qualifier
)
15875 *is_cv_qualifier
= true;
15880 if (is_cv_qualifier
)
15881 *is_cv_qualifier
= true;
15886 if (is_cv_qualifier
)
15887 *is_cv_qualifier
= true;
15891 /* The `__complex__' keyword is a GNU extension. */
15899 /* Handle simple keywords. */
15904 set_and_check_decl_spec_loc (decl_specs
, ds
, token
);
15905 decl_specs
->any_specifiers_p
= true;
15907 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
15910 /* If we do not already have a type-specifier, assume we are looking
15911 at a simple-type-specifier. */
15912 type_spec
= cp_parser_simple_type_specifier (parser
,
15916 /* If we didn't find a type-specifier, and a type-specifier was not
15917 optional in this context, issue an error message. */
15918 if (!type_spec
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
15920 cp_parser_error (parser
, "expected type specifier");
15921 return error_mark_node
;
15927 /* Parse a simple-type-specifier.
15929 simple-type-specifier:
15930 :: [opt] nested-name-specifier [opt] type-name
15931 :: [opt] nested-name-specifier template template-id
15946 simple-type-specifier:
15948 decltype ( expression )
15951 __underlying_type ( type-id )
15955 simple-type-specifier:
15957 __typeof__ unary-expression
15958 __typeof__ ( type-id )
15959 __typeof__ ( type-id ) { initializer-list , [opt] }
15961 Concepts Extension:
15963 simple-type-specifier:
15964 constrained-type-specifier
15966 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15967 appropriately updated. */
15970 cp_parser_simple_type_specifier (cp_parser
* parser
,
15971 cp_decl_specifier_seq
*decl_specs
,
15972 cp_parser_flags flags
)
15974 tree type
= NULL_TREE
;
15978 /* Peek at the next token. */
15979 token
= cp_lexer_peek_token (parser
->lexer
);
15981 /* If we're looking at a keyword, things are easy. */
15982 switch (token
->keyword
)
15986 decl_specs
->explicit_char_p
= true;
15987 type
= char_type_node
;
15990 type
= char16_type_node
;
15993 type
= char32_type_node
;
15996 type
= wchar_type_node
;
15999 type
= boolean_type_node
;
16002 set_and_check_decl_spec_loc (decl_specs
, ds_short
, token
);
16003 type
= short_integer_type_node
;
16007 decl_specs
->explicit_int_p
= true;
16008 type
= integer_type_node
;
16014 idx
= token
->keyword
- RID_INT_N_0
;
16015 if (! int_n_enabled_p
[idx
])
16019 decl_specs
->explicit_intN_p
= true;
16020 decl_specs
->int_n_idx
= idx
;
16022 type
= int_n_trees
[idx
].signed_type
;
16026 set_and_check_decl_spec_loc (decl_specs
, ds_long
, token
);
16027 type
= long_integer_type_node
;
16030 set_and_check_decl_spec_loc (decl_specs
, ds_signed
, token
);
16031 type
= integer_type_node
;
16034 set_and_check_decl_spec_loc (decl_specs
, ds_unsigned
, token
);
16035 type
= unsigned_type_node
;
16038 type
= float_type_node
;
16041 type
= double_type_node
;
16044 type
= void_type_node
;
16048 maybe_warn_cpp0x (CPP0X_AUTO
);
16049 if (parser
->auto_is_implicit_function_template_parm_p
)
16051 /* The 'auto' might be the placeholder return type for a function decl
16052 with trailing return type. */
16053 bool have_trailing_return_fn_decl
= false;
16055 cp_parser_parse_tentatively (parser
);
16056 cp_lexer_consume_token (parser
->lexer
);
16057 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
16058 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
)
16059 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
16060 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
16062 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
16064 cp_lexer_consume_token (parser
->lexer
);
16065 cp_parser_skip_to_closing_parenthesis (parser
,
16066 /*recovering*/false,
16068 /*consume_paren*/true);
16072 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
16074 have_trailing_return_fn_decl
= true;
16078 cp_lexer_consume_token (parser
->lexer
);
16080 cp_parser_abort_tentative_parse (parser
);
16082 if (have_trailing_return_fn_decl
)
16084 type
= make_auto ();
16088 if (cxx_dialect
>= cxx14
)
16090 type
= synthesize_implicit_template_parm (parser
, NULL_TREE
);
16091 type
= TREE_TYPE (type
);
16094 type
= error_mark_node
;
16096 if (current_class_type
&& LAMBDA_TYPE_P (current_class_type
))
16098 if (cxx_dialect
< cxx14
)
16099 error_at (token
->location
,
16100 "use of %<auto%> in lambda parameter declaration "
16101 "only available with "
16102 "-std=c++14 or -std=gnu++14");
16104 else if (cxx_dialect
< cxx14
)
16105 error_at (token
->location
,
16106 "use of %<auto%> in parameter declaration "
16107 "only available with "
16108 "-std=c++14 or -std=gnu++14");
16109 else if (!flag_concepts
)
16110 pedwarn (token
->location
, OPT_Wpedantic
,
16111 "ISO C++ forbids use of %<auto%> in parameter "
16115 type
= make_auto ();
16119 /* Since DR 743, decltype can either be a simple-type-specifier by
16120 itself or begin a nested-name-specifier. Parsing it will replace
16121 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16122 handling below decide what to do. */
16123 cp_parser_decltype (parser
);
16124 cp_lexer_set_token_position (parser
->lexer
, token
);
16128 /* Consume the `typeof' token. */
16129 cp_lexer_consume_token (parser
->lexer
);
16130 /* Parse the operand to `typeof'. */
16131 type
= cp_parser_sizeof_operand (parser
, RID_TYPEOF
);
16132 /* If it is not already a TYPE, take its type. */
16133 if (!TYPE_P (type
))
16134 type
= finish_typeof (type
);
16137 cp_parser_set_decl_spec_type (decl_specs
, type
,
16139 /*type_definition_p=*/false);
16143 case RID_UNDERLYING_TYPE
:
16144 type
= cp_parser_trait_expr (parser
, RID_UNDERLYING_TYPE
);
16146 cp_parser_set_decl_spec_type (decl_specs
, type
,
16148 /*type_definition_p=*/false);
16153 case RID_DIRECT_BASES
:
16154 type
= cp_parser_trait_expr (parser
, token
->keyword
);
16156 cp_parser_set_decl_spec_type (decl_specs
, type
,
16158 /*type_definition_p=*/false);
16164 /* If token is an already-parsed decltype not followed by ::,
16165 it's a simple-type-specifier. */
16166 if (token
->type
== CPP_DECLTYPE
16167 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
16169 type
= saved_checks_value (token
->u
.tree_check_value
);
16172 cp_parser_set_decl_spec_type (decl_specs
, type
,
16174 /*type_definition_p=*/false);
16175 /* Remember that we are handling a decltype in order to
16176 implement the resolution of DR 1510 when the argument
16177 isn't instantiation dependent. */
16178 decl_specs
->decltype_p
= true;
16180 cp_lexer_consume_token (parser
->lexer
);
16184 /* If the type-specifier was for a built-in type, we're done. */
16187 /* Record the type. */
16189 && (token
->keyword
!= RID_SIGNED
16190 && token
->keyword
!= RID_UNSIGNED
16191 && token
->keyword
!= RID_SHORT
16192 && token
->keyword
!= RID_LONG
))
16193 cp_parser_set_decl_spec_type (decl_specs
,
16196 /*type_definition_p=*/false);
16198 decl_specs
->any_specifiers_p
= true;
16200 /* Consume the token. */
16201 cp_lexer_consume_token (parser
->lexer
);
16203 if (type
== error_mark_node
)
16204 return error_mark_node
;
16206 /* There is no valid C++ program where a non-template type is
16207 followed by a "<". That usually indicates that the user thought
16208 that the type was a template. */
16209 cp_parser_check_for_invalid_template_id (parser
, type
, none_type
,
16212 return TYPE_NAME (type
);
16215 /* The type-specifier must be a user-defined type. */
16216 if (!(flags
& CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
))
16221 /* Don't gobble tokens or issue error messages if this is an
16222 optional type-specifier. */
16223 if (flags
& CP_PARSER_FLAGS_OPTIONAL
)
16224 cp_parser_parse_tentatively (parser
);
16226 /* Look for the optional `::' operator. */
16228 = (cp_parser_global_scope_opt (parser
,
16229 /*current_scope_valid_p=*/false)
16231 /* Look for the nested-name specifier. */
16233 = (cp_parser_nested_name_specifier_opt (parser
,
16234 /*typename_keyword_p=*/false,
16235 /*check_dependency_p=*/true,
16237 /*is_declaration=*/false)
16239 token
= cp_lexer_peek_token (parser
->lexer
);
16240 /* If we have seen a nested-name-specifier, and the next token
16241 is `template', then we are using the template-id production. */
16243 && cp_parser_optional_template_keyword (parser
))
16245 /* Look for the template-id. */
16246 type
= cp_parser_template_id (parser
,
16247 /*template_keyword_p=*/true,
16248 /*check_dependency_p=*/true,
16250 /*is_declaration=*/false);
16251 /* If the template-id did not name a type, we are out of
16253 if (TREE_CODE (type
) != TYPE_DECL
)
16255 cp_parser_error (parser
, "expected template-id for type");
16259 /* Otherwise, look for a type-name. */
16261 type
= cp_parser_type_name (parser
);
16262 /* Keep track of all name-lookups performed in class scopes. */
16266 && TREE_CODE (type
) == TYPE_DECL
16267 && identifier_p (DECL_NAME (type
)))
16268 maybe_note_name_used_in_class (DECL_NAME (type
), type
);
16269 /* If it didn't work out, we don't have a TYPE. */
16270 if ((flags
& CP_PARSER_FLAGS_OPTIONAL
)
16271 && !cp_parser_parse_definitely (parser
))
16273 if (type
&& decl_specs
)
16274 cp_parser_set_decl_spec_type (decl_specs
, type
,
16276 /*type_definition_p=*/false);
16279 /* If we didn't get a type-name, issue an error message. */
16280 if (!type
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
16282 cp_parser_error (parser
, "expected type-name");
16283 return error_mark_node
;
16286 if (type
&& type
!= error_mark_node
)
16288 /* See if TYPE is an Objective-C type, and if so, parse and
16289 accept any protocol references following it. Do this before
16290 the cp_parser_check_for_invalid_template_id() call, because
16291 Objective-C types can be followed by '<...>' which would
16292 enclose protocol names rather than template arguments, and so
16293 everything is fine. */
16294 if (c_dialect_objc () && !parser
->scope
16295 && (objc_is_id (type
) || objc_is_class_name (type
)))
16297 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
16298 tree qual_type
= objc_get_protocol_qualified_type (type
, protos
);
16300 /* Clobber the "unqualified" type previously entered into
16301 DECL_SPECS with the new, improved protocol-qualified version. */
16303 decl_specs
->type
= qual_type
;
16308 /* There is no valid C++ program where a non-template type is
16309 followed by a "<". That usually indicates that the user
16310 thought that the type was a template. */
16311 cp_parser_check_for_invalid_template_id (parser
, TREE_TYPE (type
),
16319 /* Parse a type-name.
16325 simple-template-id [in c++0x]
16342 Returns a TYPE_DECL for the type. */
16345 cp_parser_type_name (cp_parser
* parser
)
16347 return cp_parser_type_name (parser
, /*typename_keyword_p=*/false);
16352 cp_parser_type_name (cp_parser
* parser
, bool typename_keyword_p
)
16356 /* We can't know yet whether it is a class-name or not. */
16357 cp_parser_parse_tentatively (parser
);
16358 /* Try a class-name. */
16359 type_decl
= cp_parser_class_name (parser
,
16360 typename_keyword_p
,
16361 /*template_keyword_p=*/false,
16363 /*check_dependency_p=*/true,
16364 /*class_head_p=*/false,
16365 /*is_declaration=*/false);
16366 /* If it's not a class-name, keep looking. */
16367 if (!cp_parser_parse_definitely (parser
))
16369 if (cxx_dialect
< cxx11
)
16370 /* It must be a typedef-name or an enum-name. */
16371 return cp_parser_nonclass_name (parser
);
16373 cp_parser_parse_tentatively (parser
);
16374 /* It is either a simple-template-id representing an
16375 instantiation of an alias template... */
16376 type_decl
= cp_parser_template_id (parser
,
16377 /*template_keyword_p=*/false,
16378 /*check_dependency_p=*/true,
16380 /*is_declaration=*/false);
16381 /* Note that this must be an instantiation of an alias template
16382 because [temp.names]/6 says:
16384 A template-id that names an alias template specialization
16387 Whereas [temp.names]/7 says:
16389 A simple-template-id that names a class template
16390 specialization is a class-name.
16392 With concepts, this could also be a partial-concept-id that
16393 declares a non-type template parameter. */
16394 if (type_decl
!= NULL_TREE
16395 && TREE_CODE (type_decl
) == TYPE_DECL
16396 && TYPE_DECL_ALIAS_P (type_decl
))
16397 gcc_assert (DECL_TEMPLATE_INSTANTIATION (type_decl
));
16398 else if (is_constrained_parameter (type_decl
))
16399 /* Don't do anything. */ ;
16401 cp_parser_simulate_error (parser
);
16403 if (!cp_parser_parse_definitely (parser
))
16404 /* ... Or a typedef-name or an enum-name. */
16405 return cp_parser_nonclass_name (parser
);
16411 /* Check if DECL and ARGS can form a constrained-type-specifier.
16412 If ARGS is non-null, we try to form a concept check of the
16413 form DECL<?, ARGS> where ? is a wildcard that matches any
16414 kind of template argument. If ARGS is NULL, then we try to
16415 form a concept check of the form DECL<?>. */
16418 cp_parser_maybe_constrained_type_specifier (cp_parser
*parser
,
16419 tree decl
, tree args
)
16421 gcc_assert (args
? TREE_CODE (args
) == TREE_VEC
: true);
16423 /* If we a constrained-type-specifier cannot be deduced. */
16424 if (parser
->prevent_constrained_type_specifiers
)
16427 /* A constrained type specifier can only be found in an
16428 overload set or as a reference to a template declaration.
16430 FIXME: This might be masking a bug. It's possible that
16431 that the deduction below is causing template specializations
16432 to be formed with the wildcard as an argument. */
16433 if (TREE_CODE (decl
) != OVERLOAD
&& TREE_CODE (decl
) != TEMPLATE_DECL
)
16436 /* Try to build a call expression that evaluates the
16437 concept. This can fail if the overload set refers
16438 only to non-templates. */
16439 tree placeholder
= build_nt (WILDCARD_DECL
);
16440 tree check
= build_concept_check (decl
, placeholder
, args
);
16441 if (check
== error_mark_node
)
16444 /* Deduce the checked constraint and the prototype parameter.
16446 FIXME: In certain cases, failure to deduce should be a
16447 diagnosable error. */
16450 if (!deduce_constrained_parameter (check
, conc
, proto
))
16453 /* In template parameter scope, this results in a constrained
16454 parameter. Return a descriptor of that parm. */
16455 if (processing_template_parmlist
)
16456 return build_constrained_parameter (conc
, proto
, args
);
16458 /* In a parameter-declaration-clause, constrained-type
16459 specifiers result in invented template parameters. */
16460 if (parser
->auto_is_implicit_function_template_parm_p
)
16462 tree x
= build_constrained_parameter (conc
, proto
, args
);
16463 return synthesize_implicit_template_parm (parser
, x
);
16467 /* Otherwise, we're in a context where the constrained
16468 type name is deduced and the constraint applies
16469 after deduction. */
16470 return make_constrained_auto (conc
, args
);
16476 /* If DECL refers to a concept, return a TYPE_DECL representing
16477 the result of using the constrained type specifier in the
16478 current context. DECL refers to a concept if
16480 - it is an overload set containing a function concept taking a single
16483 - it is a variable concept taking a single type argument. */
16486 cp_parser_maybe_concept_name (cp_parser
* parser
, tree decl
)
16489 && (TREE_CODE (decl
) == OVERLOAD
16490 || BASELINK_P (decl
)
16491 || variable_concept_p (decl
)))
16492 return cp_parser_maybe_constrained_type_specifier (parser
, decl
, NULL_TREE
);
16497 /* Check if DECL and ARGS form a partial-concept-id. If so,
16498 assign ID to the resulting constrained placeholder.
16500 Returns true if the partial-concept-id designates a placeholder
16501 and false otherwise. Note that *id is set to NULL_TREE in
16505 cp_parser_maybe_partial_concept_id (cp_parser
*parser
, tree decl
, tree args
)
16507 return cp_parser_maybe_constrained_type_specifier (parser
, decl
, args
);
16510 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16522 Returns a TYPE_DECL for the type. */
16525 cp_parser_nonclass_name (cp_parser
* parser
)
16530 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
16531 identifier
= cp_parser_identifier (parser
);
16532 if (identifier
== error_mark_node
)
16533 return error_mark_node
;
16535 /* Look up the type-name. */
16536 type_decl
= cp_parser_lookup_name_simple (parser
, identifier
, token
->location
);
16538 type_decl
= strip_using_decl (type_decl
);
16540 /* If we found an overload set, then it may refer to a concept-name. */
16541 if (tree decl
= cp_parser_maybe_concept_name (parser
, type_decl
))
16544 if (TREE_CODE (type_decl
) != TYPE_DECL
16545 && (objc_is_id (identifier
) || objc_is_class_name (identifier
)))
16547 /* See if this is an Objective-C type. */
16548 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
16549 tree type
= objc_get_protocol_qualified_type (identifier
, protos
);
16551 type_decl
= TYPE_NAME (type
);
16554 /* Issue an error if we did not find a type-name. */
16555 if (TREE_CODE (type_decl
) != TYPE_DECL
16556 /* In Objective-C, we have the complication that class names are
16557 normally type names and start declarations (eg, the
16558 "NSObject" in "NSObject *object;"), but can be used in an
16559 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16560 is an expression. So, a classname followed by a dot is not a
16561 valid type-name. */
16562 || (objc_is_class_name (TREE_TYPE (type_decl
))
16563 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
))
16565 if (!cp_parser_simulate_error (parser
))
16566 cp_parser_name_lookup_error (parser
, identifier
, type_decl
,
16567 NLE_TYPE
, token
->location
);
16568 return error_mark_node
;
16570 /* Remember that the name was used in the definition of the
16571 current class so that we can check later to see if the
16572 meaning would have been different after the class was
16573 entirely defined. */
16574 else if (type_decl
!= error_mark_node
16576 maybe_note_name_used_in_class (identifier
, type_decl
);
16581 /* Parse an elaborated-type-specifier. Note that the grammar given
16582 here incorporates the resolution to DR68.
16584 elaborated-type-specifier:
16585 class-key :: [opt] nested-name-specifier [opt] identifier
16586 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16587 enum-key :: [opt] nested-name-specifier [opt] identifier
16588 typename :: [opt] nested-name-specifier identifier
16589 typename :: [opt] nested-name-specifier template [opt]
16594 elaborated-type-specifier:
16595 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16596 class-key attributes :: [opt] nested-name-specifier [opt]
16597 template [opt] template-id
16598 enum attributes :: [opt] nested-name-specifier [opt] identifier
16600 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16601 declared `friend'. If IS_DECLARATION is TRUE, then this
16602 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16603 something is being declared.
16605 Returns the TYPE specified. */
16608 cp_parser_elaborated_type_specifier (cp_parser
* parser
,
16610 bool is_declaration
)
16612 enum tag_types tag_type
;
16614 tree type
= NULL_TREE
;
16615 tree attributes
= NULL_TREE
;
16617 cp_token
*token
= NULL
;
16619 /* See if we're looking at the `enum' keyword. */
16620 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ENUM
))
16622 /* Consume the `enum' token. */
16623 cp_lexer_consume_token (parser
->lexer
);
16624 /* Remember that it's an enumeration type. */
16625 tag_type
= enum_type
;
16626 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16627 enums) is used here. */
16628 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
16629 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
16631 pedwarn (input_location
, 0, "elaborated-type-specifier "
16632 "for a scoped enum must not use the %<%D%> keyword",
16633 cp_lexer_peek_token (parser
->lexer
)->u
.value
);
16634 /* Consume the `struct' or `class' and parse it anyway. */
16635 cp_lexer_consume_token (parser
->lexer
);
16637 /* Parse the attributes. */
16638 attributes
= cp_parser_attributes_opt (parser
);
16640 /* Or, it might be `typename'. */
16641 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
16644 /* Consume the `typename' token. */
16645 cp_lexer_consume_token (parser
->lexer
);
16646 /* Remember that it's a `typename' type. */
16647 tag_type
= typename_type
;
16649 /* Otherwise it must be a class-key. */
16652 tag_type
= cp_parser_class_key (parser
);
16653 if (tag_type
== none_type
)
16654 return error_mark_node
;
16655 /* Parse the attributes. */
16656 attributes
= cp_parser_attributes_opt (parser
);
16659 /* Look for the `::' operator. */
16660 globalscope
= cp_parser_global_scope_opt (parser
,
16661 /*current_scope_valid_p=*/false);
16662 /* Look for the nested-name-specifier. */
16663 if (tag_type
== typename_type
&& !globalscope
)
16665 if (!cp_parser_nested_name_specifier (parser
,
16666 /*typename_keyword_p=*/true,
16667 /*check_dependency_p=*/true,
16670 return error_mark_node
;
16673 /* Even though `typename' is not present, the proposed resolution
16674 to Core Issue 180 says that in `class A<T>::B', `B' should be
16675 considered a type-name, even if `A<T>' is dependent. */
16676 cp_parser_nested_name_specifier_opt (parser
,
16677 /*typename_keyword_p=*/true,
16678 /*check_dependency_p=*/true,
16681 /* For everything but enumeration types, consider a template-id.
16682 For an enumeration type, consider only a plain identifier. */
16683 if (tag_type
!= enum_type
)
16685 bool template_p
= false;
16688 /* Allow the `template' keyword. */
16689 template_p
= cp_parser_optional_template_keyword (parser
);
16690 /* If we didn't see `template', we don't know if there's a
16691 template-id or not. */
16693 cp_parser_parse_tentatively (parser
);
16694 /* Parse the template-id. */
16695 token
= cp_lexer_peek_token (parser
->lexer
);
16696 decl
= cp_parser_template_id (parser
, template_p
,
16697 /*check_dependency_p=*/true,
16700 /* If we didn't find a template-id, look for an ordinary
16702 if (!template_p
&& !cp_parser_parse_definitely (parser
))
16704 /* We can get here when cp_parser_template_id, called by
16705 cp_parser_class_name with tag_type == none_type, succeeds
16706 and caches a BASELINK. Then, when called again here,
16707 instead of failing and returning an error_mark_node
16708 returns it (see template/typename17.C in C++11).
16709 ??? Could we diagnose this earlier? */
16710 else if (tag_type
== typename_type
&& BASELINK_P (decl
))
16712 cp_parser_diagnose_invalid_type_name (parser
, decl
, token
->location
);
16713 type
= error_mark_node
;
16715 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16716 in effect, then we must assume that, upon instantiation, the
16717 template will correspond to a class. */
16718 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
16719 && tag_type
== typename_type
)
16720 type
= make_typename_type (parser
->scope
, decl
,
16722 /*complain=*/tf_error
);
16723 /* If the `typename' keyword is in effect and DECL is not a type
16724 decl, then type is non existent. */
16725 else if (tag_type
== typename_type
&& TREE_CODE (decl
) != TYPE_DECL
)
16727 else if (TREE_CODE (decl
) == TYPE_DECL
)
16728 type
= check_elaborated_type_specifier (tag_type
, decl
,
16729 /*allow_template_p=*/true);
16730 else if (decl
== error_mark_node
)
16731 type
= error_mark_node
;
16736 token
= cp_lexer_peek_token (parser
->lexer
);
16737 identifier
= cp_parser_identifier (parser
);
16739 if (identifier
== error_mark_node
)
16741 parser
->scope
= NULL_TREE
;
16742 return error_mark_node
;
16745 /* For a `typename', we needn't call xref_tag. */
16746 if (tag_type
== typename_type
16747 && TREE_CODE (parser
->scope
) != NAMESPACE_DECL
)
16748 return cp_parser_make_typename_type (parser
, identifier
,
16751 /* Template parameter lists apply only if we are not within a
16752 function parameter list. */
16753 bool template_parm_lists_apply
16754 = parser
->num_template_parameter_lists
;
16755 if (template_parm_lists_apply
)
16756 for (cp_binding_level
*s
= current_binding_level
;
16757 s
&& s
->kind
!= sk_template_parms
;
16758 s
= s
->level_chain
)
16759 if (s
->kind
== sk_function_parms
)
16760 template_parm_lists_apply
= false;
16762 /* Look up a qualified name in the usual way. */
16766 tree ambiguous_decls
;
16768 decl
= cp_parser_lookup_name (parser
, identifier
,
16770 /*is_template=*/false,
16771 /*is_namespace=*/false,
16772 /*check_dependency=*/true,
16776 /* If the lookup was ambiguous, an error will already have been
16778 if (ambiguous_decls
)
16779 return error_mark_node
;
16781 /* If we are parsing friend declaration, DECL may be a
16782 TEMPLATE_DECL tree node here. However, we need to check
16783 whether this TEMPLATE_DECL results in valid code. Consider
16784 the following example:
16787 template <class T> class C {};
16790 template <class T> friend class N::C; // #1, valid code
16792 template <class T> class Y {
16793 friend class N::C; // #2, invalid code
16796 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16797 name lookup of `N::C'. We see that friend declaration must
16798 be template for the code to be valid. Note that
16799 processing_template_decl does not work here since it is
16800 always 1 for the above two cases. */
16802 decl
= (cp_parser_maybe_treat_template_as_class
16803 (decl
, /*tag_name_p=*/is_friend
16804 && template_parm_lists_apply
));
16806 if (TREE_CODE (decl
) != TYPE_DECL
)
16808 cp_parser_diagnose_invalid_type_name (parser
,
16811 return error_mark_node
;
16814 if (TREE_CODE (TREE_TYPE (decl
)) != TYPENAME_TYPE
)
16816 bool allow_template
= (template_parm_lists_apply
16817 || DECL_SELF_REFERENCE_P (decl
));
16818 type
= check_elaborated_type_specifier (tag_type
, decl
,
16821 if (type
== error_mark_node
)
16822 return error_mark_node
;
16825 /* Forward declarations of nested types, such as
16830 are invalid unless all components preceding the final '::'
16831 are complete. If all enclosing types are complete, these
16832 declarations become merely pointless.
16834 Invalid forward declarations of nested types are errors
16835 caught elsewhere in parsing. Those that are pointless arrive
16838 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
16839 && !is_friend
&& !processing_explicit_instantiation
)
16840 warning (0, "declaration %qD does not declare anything", decl
);
16842 type
= TREE_TYPE (decl
);
16846 /* An elaborated-type-specifier sometimes introduces a new type and
16847 sometimes names an existing type. Normally, the rule is that it
16848 introduces a new type only if there is not an existing type of
16849 the same name already in scope. For example, given:
16852 void f() { struct S s; }
16854 the `struct S' in the body of `f' is the same `struct S' as in
16855 the global scope; the existing definition is used. However, if
16856 there were no global declaration, this would introduce a new
16857 local class named `S'.
16859 An exception to this rule applies to the following code:
16861 namespace N { struct S; }
16863 Here, the elaborated-type-specifier names a new type
16864 unconditionally; even if there is already an `S' in the
16865 containing scope this declaration names a new type.
16866 This exception only applies if the elaborated-type-specifier
16867 forms the complete declaration:
16871 A declaration consisting solely of `class-key identifier ;' is
16872 either a redeclaration of the name in the current scope or a
16873 forward declaration of the identifier as a class name. It
16874 introduces the name into the current scope.
16876 We are in this situation precisely when the next token is a `;'.
16878 An exception to the exception is that a `friend' declaration does
16879 *not* name a new type; i.e., given:
16881 struct S { friend struct T; };
16883 `T' is not a new type in the scope of `S'.
16885 Also, `new struct S' or `sizeof (struct S)' never results in the
16886 definition of a new type; a new type can only be declared in a
16887 declaration context. */
16893 /* Friends have special name lookup rules. */
16894 ts
= ts_within_enclosing_non_class
;
16895 else if (is_declaration
16896 && cp_lexer_next_token_is (parser
->lexer
,
16898 /* This is a `class-key identifier ;' */
16904 (template_parm_lists_apply
16905 && (cp_parser_next_token_starts_class_definition_p (parser
)
16906 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)));
16907 /* An unqualified name was used to reference this type, so
16908 there were no qualifying templates. */
16909 if (template_parm_lists_apply
16910 && !cp_parser_check_template_parameters (parser
,
16911 /*num_templates=*/0,
16913 /*declarator=*/NULL
))
16914 return error_mark_node
;
16915 type
= xref_tag (tag_type
, identifier
, ts
, template_p
);
16919 if (type
== error_mark_node
)
16920 return error_mark_node
;
16922 /* Allow attributes on forward declarations of classes. */
16925 if (TREE_CODE (type
) == TYPENAME_TYPE
)
16926 warning (OPT_Wattributes
,
16927 "attributes ignored on uninstantiated type");
16928 else if (tag_type
!= enum_type
&& CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
16929 && ! processing_explicit_instantiation
)
16930 warning (OPT_Wattributes
,
16931 "attributes ignored on template instantiation");
16932 else if (is_declaration
&& cp_parser_declares_only_class_p (parser
))
16933 cplus_decl_attributes (&type
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
16935 warning (OPT_Wattributes
,
16936 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
16939 if (tag_type
!= enum_type
)
16941 /* Indicate whether this class was declared as a `class' or as a
16943 if (CLASS_TYPE_P (type
))
16944 CLASSTYPE_DECLARED_CLASS (type
) = (tag_type
== class_type
);
16945 cp_parser_check_class_key (tag_type
, type
);
16948 /* A "<" cannot follow an elaborated type specifier. If that
16949 happens, the user was probably trying to form a template-id. */
16950 cp_parser_check_for_invalid_template_id (parser
, type
, tag_type
,
16956 /* Parse an enum-specifier.
16959 enum-head { enumerator-list [opt] }
16960 enum-head { enumerator-list , } [C++0x]
16963 enum-key identifier [opt] enum-base [opt]
16964 enum-key nested-name-specifier identifier enum-base [opt]
16969 enum struct [C++0x]
16972 : type-specifier-seq
16974 opaque-enum-specifier:
16975 enum-key identifier enum-base [opt] ;
16978 enum-key attributes[opt] identifier [opt] enum-base [opt]
16979 { enumerator-list [opt] }attributes[opt]
16980 enum-key attributes[opt] identifier [opt] enum-base [opt]
16981 { enumerator-list, }attributes[opt] [C++0x]
16983 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16984 if the token stream isn't an enum-specifier after all. */
16987 cp_parser_enum_specifier (cp_parser
* parser
)
16990 tree type
= NULL_TREE
;
16992 tree nested_name_specifier
= NULL_TREE
;
16994 bool scoped_enum_p
= false;
16995 bool has_underlying_type
= false;
16996 bool nested_being_defined
= false;
16997 bool new_value_list
= false;
16998 bool is_new_type
= false;
16999 bool is_anonymous
= false;
17000 tree underlying_type
= NULL_TREE
;
17001 cp_token
*type_start_token
= NULL
;
17002 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
17004 parser
->colon_corrects_to_scope_p
= false;
17006 /* Parse tentatively so that we can back up if we don't find a
17008 cp_parser_parse_tentatively (parser
);
17010 /* Caller guarantees that the current token is 'enum', an identifier
17011 possibly follows, and the token after that is an opening brace.
17012 If we don't have an identifier, fabricate an anonymous name for
17013 the enumeration being defined. */
17014 cp_lexer_consume_token (parser
->lexer
);
17016 /* Parse the "class" or "struct", which indicates a scoped
17017 enumeration type in C++0x. */
17018 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
17019 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
17021 if (cxx_dialect
< cxx11
)
17022 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
17024 /* Consume the `struct' or `class' token. */
17025 cp_lexer_consume_token (parser
->lexer
);
17027 scoped_enum_p
= true;
17030 attributes
= cp_parser_attributes_opt (parser
);
17032 /* Clear the qualification. */
17033 parser
->scope
= NULL_TREE
;
17034 parser
->qualifying_scope
= NULL_TREE
;
17035 parser
->object_scope
= NULL_TREE
;
17037 /* Figure out in what scope the declaration is being placed. */
17038 prev_scope
= current_scope ();
17040 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
17042 push_deferring_access_checks (dk_no_check
);
17043 nested_name_specifier
17044 = cp_parser_nested_name_specifier_opt (parser
,
17045 /*typename_keyword_p=*/true,
17046 /*check_dependency_p=*/false,
17048 /*is_declaration=*/false);
17050 if (nested_name_specifier
)
17054 identifier
= cp_parser_identifier (parser
);
17055 name
= cp_parser_lookup_name (parser
, identifier
,
17057 /*is_template=*/false,
17058 /*is_namespace=*/false,
17059 /*check_dependency=*/true,
17060 /*ambiguous_decls=*/NULL
,
17062 if (name
&& name
!= error_mark_node
)
17064 type
= TREE_TYPE (name
);
17065 if (TREE_CODE (type
) == TYPENAME_TYPE
)
17067 /* Are template enums allowed in ISO? */
17068 if (template_parm_scope_p ())
17069 pedwarn (type_start_token
->location
, OPT_Wpedantic
,
17070 "%qD is an enumeration template", name
);
17071 /* ignore a typename reference, for it will be solved by name
17076 else if (nested_name_specifier
== error_mark_node
)
17077 /* We already issued an error. */;
17080 error_at (type_start_token
->location
,
17081 "%qD does not name an enumeration in %qT",
17082 identifier
, nested_name_specifier
);
17083 nested_name_specifier
= error_mark_node
;
17088 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
17089 identifier
= cp_parser_identifier (parser
);
17092 identifier
= make_anon_name ();
17093 is_anonymous
= true;
17095 error_at (type_start_token
->location
,
17096 "anonymous scoped enum is not allowed");
17099 pop_deferring_access_checks ();
17101 /* Check for the `:' that denotes a specified underlying type in C++0x.
17102 Note that a ':' could also indicate a bitfield width, however. */
17103 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
17105 cp_decl_specifier_seq type_specifiers
;
17107 /* Consume the `:'. */
17108 cp_lexer_consume_token (parser
->lexer
);
17110 /* Parse the type-specifier-seq. */
17111 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
17112 /*is_trailing_return=*/false,
17115 /* At this point this is surely not elaborated type specifier. */
17116 if (!cp_parser_parse_definitely (parser
))
17119 if (cxx_dialect
< cxx11
)
17120 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
17122 has_underlying_type
= true;
17124 /* If that didn't work, stop. */
17125 if (type_specifiers
.type
!= error_mark_node
)
17127 underlying_type
= grokdeclarator (NULL
, &type_specifiers
, TYPENAME
,
17128 /*initialized=*/0, NULL
);
17129 if (underlying_type
== error_mark_node
17130 || check_for_bare_parameter_packs (underlying_type
))
17131 underlying_type
= NULL_TREE
;
17135 /* Look for the `{' but don't consume it yet. */
17136 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
17138 if (cxx_dialect
< cxx11
|| (!scoped_enum_p
&& !underlying_type
))
17140 cp_parser_error (parser
, "expected %<{%>");
17141 if (has_underlying_type
)
17147 /* An opaque-enum-specifier must have a ';' here. */
17148 if ((scoped_enum_p
|| underlying_type
)
17149 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
17151 cp_parser_error (parser
, "expected %<;%> or %<{%>");
17152 if (has_underlying_type
)
17160 if (!has_underlying_type
&& !cp_parser_parse_definitely (parser
))
17163 if (nested_name_specifier
)
17165 if (CLASS_TYPE_P (nested_name_specifier
))
17167 nested_being_defined
= TYPE_BEING_DEFINED (nested_name_specifier
);
17168 TYPE_BEING_DEFINED (nested_name_specifier
) = 1;
17169 push_scope (nested_name_specifier
);
17171 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
17173 push_nested_namespace (nested_name_specifier
);
17177 /* Issue an error message if type-definitions are forbidden here. */
17178 if (!cp_parser_check_type_definition (parser
))
17179 type
= error_mark_node
;
17181 /* Create the new type. We do this before consuming the opening
17182 brace so the enum will be recorded as being on the line of its
17183 tag (or the 'enum' keyword, if there is no tag). */
17184 type
= start_enum (identifier
, type
, underlying_type
,
17185 attributes
, scoped_enum_p
, &is_new_type
);
17187 /* If the next token is not '{' it is an opaque-enum-specifier or an
17188 elaborated-type-specifier. */
17189 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
17191 timevar_push (TV_PARSE_ENUM
);
17192 if (nested_name_specifier
17193 && nested_name_specifier
!= error_mark_node
)
17195 /* The following catches invalid code such as:
17196 enum class S<int>::E { A, B, C }; */
17197 if (!processing_specialization
17198 && CLASS_TYPE_P (nested_name_specifier
)
17199 && CLASSTYPE_USE_TEMPLATE (nested_name_specifier
))
17200 error_at (type_start_token
->location
, "cannot add an enumerator "
17201 "list to a template instantiation");
17203 if (TREE_CODE (nested_name_specifier
) == TYPENAME_TYPE
)
17205 error_at (type_start_token
->location
,
17206 "%<%T::%E%> has not been declared",
17207 TYPE_CONTEXT (nested_name_specifier
),
17208 nested_name_specifier
);
17209 type
= error_mark_node
;
17211 else if (TREE_CODE (nested_name_specifier
) != NAMESPACE_DECL
17212 && !CLASS_TYPE_P (nested_name_specifier
))
17214 error_at (type_start_token
->location
, "nested name specifier "
17215 "%qT for enum declaration does not name a class "
17216 "or namespace", nested_name_specifier
);
17217 type
= error_mark_node
;
17219 /* If that scope does not contain the scope in which the
17220 class was originally declared, the program is invalid. */
17221 else if (prev_scope
&& !is_ancestor (prev_scope
,
17222 nested_name_specifier
))
17224 if (at_namespace_scope_p ())
17225 error_at (type_start_token
->location
,
17226 "declaration of %qD in namespace %qD which does not "
17228 type
, prev_scope
, nested_name_specifier
);
17230 error_at (type_start_token
->location
,
17231 "declaration of %qD in %qD which does not "
17233 type
, prev_scope
, nested_name_specifier
);
17234 type
= error_mark_node
;
17236 /* If that scope is the scope where the declaration is being placed
17237 the program is invalid. */
17238 else if (CLASS_TYPE_P (nested_name_specifier
)
17239 && CLASS_TYPE_P (prev_scope
)
17240 && same_type_p (nested_name_specifier
, prev_scope
))
17242 permerror (type_start_token
->location
,
17243 "extra qualification not allowed");
17244 nested_name_specifier
= NULL_TREE
;
17249 begin_scope (sk_scoped_enum
, type
);
17251 /* Consume the opening brace. */
17252 cp_lexer_consume_token (parser
->lexer
);
17254 if (type
== error_mark_node
)
17255 ; /* Nothing to add */
17256 else if (OPAQUE_ENUM_P (type
)
17257 || (cxx_dialect
> cxx98
&& processing_specialization
))
17259 new_value_list
= true;
17260 SET_OPAQUE_ENUM_P (type
, false);
17261 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
17265 error_at (type_start_token
->location
,
17266 "multiple definition of %q#T", type
);
17267 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)),
17268 "previous definition here");
17269 type
= error_mark_node
;
17272 if (type
== error_mark_node
)
17273 cp_parser_skip_to_end_of_block_or_statement (parser
);
17274 /* If the next token is not '}', then there are some enumerators. */
17275 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
17277 if (is_anonymous
&& !scoped_enum_p
)
17278 pedwarn (type_start_token
->location
, OPT_Wpedantic
,
17279 "ISO C++ forbids empty anonymous enum");
17282 cp_parser_enumerator_list (parser
, type
);
17284 /* Consume the final '}'. */
17285 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
17289 timevar_pop (TV_PARSE_ENUM
);
17293 /* If a ';' follows, then it is an opaque-enum-specifier
17294 and additional restrictions apply. */
17295 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
17298 error_at (type_start_token
->location
,
17299 "opaque-enum-specifier without name");
17300 else if (nested_name_specifier
)
17301 error_at (type_start_token
->location
,
17302 "opaque-enum-specifier must use a simple identifier");
17306 /* Look for trailing attributes to apply to this enumeration, and
17307 apply them if appropriate. */
17308 if (cp_parser_allow_gnu_extensions_p (parser
))
17310 tree trailing_attr
= cp_parser_gnu_attributes_opt (parser
);
17311 cplus_decl_attributes (&type
,
17313 (int) ATTR_FLAG_TYPE_IN_PLACE
);
17316 /* Finish up the enumeration. */
17317 if (type
!= error_mark_node
)
17319 if (new_value_list
)
17320 finish_enum_value_list (type
);
17322 finish_enum (type
);
17325 if (nested_name_specifier
)
17327 if (CLASS_TYPE_P (nested_name_specifier
))
17329 TYPE_BEING_DEFINED (nested_name_specifier
) = nested_being_defined
;
17330 pop_scope (nested_name_specifier
);
17332 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
17334 pop_nested_namespace (nested_name_specifier
);
17338 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
17342 /* Parse an enumerator-list. The enumerators all have the indicated
17346 enumerator-definition
17347 enumerator-list , enumerator-definition */
17350 cp_parser_enumerator_list (cp_parser
* parser
, tree type
)
17354 /* Parse an enumerator-definition. */
17355 cp_parser_enumerator_definition (parser
, type
);
17357 /* If the next token is not a ',', we've reached the end of
17359 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
17361 /* Otherwise, consume the `,' and keep going. */
17362 cp_lexer_consume_token (parser
->lexer
);
17363 /* If the next token is a `}', there is a trailing comma. */
17364 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
17366 if (cxx_dialect
< cxx11
&& !in_system_header_at (input_location
))
17367 pedwarn (input_location
, OPT_Wpedantic
,
17368 "comma at end of enumerator list");
17374 /* Parse an enumerator-definition. The enumerator has the indicated
17377 enumerator-definition:
17379 enumerator = constant-expression
17386 enumerator-definition:
17387 enumerator attributes [opt]
17388 enumerator attributes [opt] = constant-expression */
17391 cp_parser_enumerator_definition (cp_parser
* parser
, tree type
)
17397 /* Save the input location because we are interested in the location
17398 of the identifier and not the location of the explicit value. */
17399 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
17401 /* Look for the identifier. */
17402 identifier
= cp_parser_identifier (parser
);
17403 if (identifier
== error_mark_node
)
17406 /* Parse any specified attributes. */
17407 tree attrs
= cp_parser_attributes_opt (parser
);
17409 /* If the next token is an '=', then there is an explicit value. */
17410 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
17412 /* Consume the `=' token. */
17413 cp_lexer_consume_token (parser
->lexer
);
17414 /* Parse the value. */
17415 value
= cp_parser_constant_expression (parser
);
17420 /* If we are processing a template, make sure the initializer of the
17421 enumerator doesn't contain any bare template parameter pack. */
17422 if (check_for_bare_parameter_packs (value
))
17423 value
= error_mark_node
;
17425 /* Create the enumerator. */
17426 build_enumerator (identifier
, value
, type
, attrs
, loc
);
17429 /* Parse a namespace-name.
17432 original-namespace-name
17435 Returns the NAMESPACE_DECL for the namespace. */
17438 cp_parser_namespace_name (cp_parser
* parser
)
17441 tree namespace_decl
;
17443 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17445 /* Get the name of the namespace. */
17446 identifier
= cp_parser_identifier (parser
);
17447 if (identifier
== error_mark_node
)
17448 return error_mark_node
;
17450 /* Look up the identifier in the currently active scope. Look only
17451 for namespaces, due to:
17453 [basic.lookup.udir]
17455 When looking up a namespace-name in a using-directive or alias
17456 definition, only namespace names are considered.
17460 [basic.lookup.qual]
17462 During the lookup of a name preceding the :: scope resolution
17463 operator, object, function, and enumerator names are ignored.
17465 (Note that cp_parser_qualifying_entity only calls this
17466 function if the token after the name is the scope resolution
17468 namespace_decl
= cp_parser_lookup_name (parser
, identifier
,
17470 /*is_template=*/false,
17471 /*is_namespace=*/true,
17472 /*check_dependency=*/true,
17473 /*ambiguous_decls=*/NULL
,
17475 /* If it's not a namespace, issue an error. */
17476 if (namespace_decl
== error_mark_node
17477 || TREE_CODE (namespace_decl
) != NAMESPACE_DECL
)
17479 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
17480 error_at (token
->location
, "%qD is not a namespace-name", identifier
);
17481 cp_parser_error (parser
, "expected namespace-name");
17482 namespace_decl
= error_mark_node
;
17485 return namespace_decl
;
17488 /* Parse a namespace-definition.
17490 namespace-definition:
17491 named-namespace-definition
17492 unnamed-namespace-definition
17494 named-namespace-definition:
17495 original-namespace-definition
17496 extension-namespace-definition
17498 original-namespace-definition:
17499 namespace identifier { namespace-body }
17501 extension-namespace-definition:
17502 namespace original-namespace-name { namespace-body }
17504 unnamed-namespace-definition:
17505 namespace { namespace-body } */
17508 cp_parser_namespace_definition (cp_parser
* parser
)
17510 tree identifier
, attribs
;
17511 bool has_visibility
;
17514 int nested_definition_count
= 0;
17516 cp_ensure_no_omp_declare_simd (parser
);
17517 cp_ensure_no_oacc_routine (parser
);
17518 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_INLINE
))
17520 maybe_warn_cpp0x (CPP0X_INLINE_NAMESPACES
);
17522 cp_lexer_consume_token (parser
->lexer
);
17527 /* Look for the `namespace' keyword. */
17528 token
= cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
17530 /* Parse any specified attributes before the identifier. */
17531 attribs
= cp_parser_attributes_opt (parser
);
17533 /* Get the name of the namespace. We do not attempt to distinguish
17534 between an original-namespace-definition and an
17535 extension-namespace-definition at this point. The semantic
17536 analysis routines are responsible for that. */
17537 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
17538 identifier
= cp_parser_identifier (parser
);
17540 identifier
= NULL_TREE
;
17542 /* Parse any specified attributes after the identifier. */
17543 tree post_ident_attribs
= cp_parser_attributes_opt (parser
);
17544 if (post_ident_attribs
)
17547 attribs
= chainon (attribs
, post_ident_attribs
);
17549 attribs
= post_ident_attribs
;
17552 /* Start the namespace. */
17553 bool ok
= push_namespace (identifier
);
17555 /* Parse any nested namespace definition. */
17556 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
17559 error_at (token
->location
, "a nested namespace definition cannot have attributes");
17560 if (cxx_dialect
< cxx1z
)
17561 pedwarn (input_location
, OPT_Wpedantic
,
17562 "nested namespace definitions only available with "
17563 "-std=c++1z or -std=gnu++1z");
17565 error_at (token
->location
, "a nested namespace definition cannot be inline");
17566 while (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
17568 cp_lexer_consume_token (parser
->lexer
);
17569 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
17570 identifier
= cp_parser_identifier (parser
);
17573 cp_parser_error (parser
, "nested identifier required");
17576 ++nested_definition_count
;
17577 push_namespace (identifier
);
17581 /* Look for the `{' to validate starting the namespace. */
17582 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
17584 /* "inline namespace" is equivalent to a stub namespace definition
17585 followed by a strong using directive. */
17586 if (is_inline
&& ok
)
17588 tree name_space
= current_namespace
;
17589 /* Set up namespace association. */
17590 DECL_NAMESPACE_ASSOCIATIONS (name_space
)
17591 = tree_cons (CP_DECL_CONTEXT (name_space
), NULL_TREE
,
17592 DECL_NAMESPACE_ASSOCIATIONS (name_space
));
17593 /* Import the contents of the inline namespace. */
17595 do_using_directive (name_space
);
17596 push_namespace (identifier
);
17599 has_visibility
= handle_namespace_attrs (current_namespace
, attribs
);
17601 warning (OPT_Wnamespaces
, "namespace %qD entered", current_namespace
);
17603 /* Parse the body of the namespace. */
17604 cp_parser_namespace_body (parser
);
17606 if (has_visibility
)
17607 pop_visibility (1);
17609 /* Finish the nested namespace definitions. */
17610 while (nested_definition_count
--)
17613 /* Finish the namespace. */
17616 /* Look for the final `}'. */
17617 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
17620 /* Parse a namespace-body.
17623 declaration-seq [opt] */
17626 cp_parser_namespace_body (cp_parser
* parser
)
17628 cp_parser_declaration_seq_opt (parser
);
17631 /* Parse a namespace-alias-definition.
17633 namespace-alias-definition:
17634 namespace identifier = qualified-namespace-specifier ; */
17637 cp_parser_namespace_alias_definition (cp_parser
* parser
)
17640 tree namespace_specifier
;
17642 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17644 /* Look for the `namespace' keyword. */
17645 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
17646 /* Look for the identifier. */
17647 identifier
= cp_parser_identifier (parser
);
17648 if (identifier
== error_mark_node
)
17650 /* Look for the `=' token. */
17651 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
)
17652 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
17654 error_at (token
->location
, "%<namespace%> definition is not allowed here");
17655 /* Skip the definition. */
17656 cp_lexer_consume_token (parser
->lexer
);
17657 if (cp_parser_skip_to_closing_brace (parser
))
17658 cp_lexer_consume_token (parser
->lexer
);
17661 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
17662 /* Look for the qualified-namespace-specifier. */
17663 namespace_specifier
17664 = cp_parser_qualified_namespace_specifier (parser
);
17665 /* Look for the `;' token. */
17666 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
17668 /* Register the alias in the symbol table. */
17669 do_namespace_alias (identifier
, namespace_specifier
);
17672 /* Parse a qualified-namespace-specifier.
17674 qualified-namespace-specifier:
17675 :: [opt] nested-name-specifier [opt] namespace-name
17677 Returns a NAMESPACE_DECL corresponding to the specified
17681 cp_parser_qualified_namespace_specifier (cp_parser
* parser
)
17683 /* Look for the optional `::'. */
17684 cp_parser_global_scope_opt (parser
,
17685 /*current_scope_valid_p=*/false);
17687 /* Look for the optional nested-name-specifier. */
17688 cp_parser_nested_name_specifier_opt (parser
,
17689 /*typename_keyword_p=*/false,
17690 /*check_dependency_p=*/true,
17692 /*is_declaration=*/true);
17694 return cp_parser_namespace_name (parser
);
17697 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17698 access declaration.
17701 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17702 using :: unqualified-id ;
17704 access-declaration:
17710 cp_parser_using_declaration (cp_parser
* parser
,
17711 bool access_declaration_p
)
17714 bool typename_p
= false;
17715 bool global_scope_p
;
17719 int oldcount
= errorcount
;
17720 cp_token
*diag_token
= NULL
;
17722 if (access_declaration_p
)
17724 diag_token
= cp_lexer_peek_token (parser
->lexer
);
17725 cp_parser_parse_tentatively (parser
);
17729 /* Look for the `using' keyword. */
17730 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
17732 /* Peek at the next token. */
17733 token
= cp_lexer_peek_token (parser
->lexer
);
17734 /* See if it's `typename'. */
17735 if (token
->keyword
== RID_TYPENAME
)
17737 /* Remember that we've seen it. */
17739 /* Consume the `typename' token. */
17740 cp_lexer_consume_token (parser
->lexer
);
17744 /* Look for the optional global scope qualification. */
17746 = (cp_parser_global_scope_opt (parser
,
17747 /*current_scope_valid_p=*/false)
17750 /* If we saw `typename', or didn't see `::', then there must be a
17751 nested-name-specifier present. */
17752 if (typename_p
|| !global_scope_p
)
17754 qscope
= cp_parser_nested_name_specifier (parser
, typename_p
,
17755 /*check_dependency_p=*/true,
17757 /*is_declaration=*/true);
17758 if (!qscope
&& !cp_parser_uncommitted_to_tentative_parse_p (parser
))
17760 cp_parser_skip_to_end_of_block_or_statement (parser
);
17764 /* Otherwise, we could be in either of the two productions. In that
17765 case, treat the nested-name-specifier as optional. */
17767 qscope
= cp_parser_nested_name_specifier_opt (parser
,
17768 /*typename_keyword_p=*/false,
17769 /*check_dependency_p=*/true,
17771 /*is_declaration=*/true);
17773 qscope
= global_namespace
;
17774 else if (UNSCOPED_ENUM_P (qscope
))
17775 qscope
= CP_TYPE_CONTEXT (qscope
);
17777 if (access_declaration_p
&& cp_parser_error_occurred (parser
))
17778 /* Something has already gone wrong; there's no need to parse
17779 further. Since an error has occurred, the return value of
17780 cp_parser_parse_definitely will be false, as required. */
17781 return cp_parser_parse_definitely (parser
);
17783 token
= cp_lexer_peek_token (parser
->lexer
);
17784 /* Parse the unqualified-id. */
17785 identifier
= cp_parser_unqualified_id (parser
,
17786 /*template_keyword_p=*/false,
17787 /*check_dependency_p=*/true,
17788 /*declarator_p=*/true,
17789 /*optional_p=*/false);
17791 if (access_declaration_p
)
17793 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
17794 cp_parser_simulate_error (parser
);
17795 if (!cp_parser_parse_definitely (parser
))
17799 /* The function we call to handle a using-declaration is different
17800 depending on what scope we are in. */
17801 if (qscope
== error_mark_node
|| identifier
== error_mark_node
)
17803 else if (!identifier_p (identifier
)
17804 && TREE_CODE (identifier
) != BIT_NOT_EXPR
)
17805 /* [namespace.udecl]
17807 A using declaration shall not name a template-id. */
17808 error_at (token
->location
,
17809 "a template-id may not appear in a using-declaration");
17812 if (at_class_scope_p ())
17814 /* Create the USING_DECL. */
17815 decl
= do_class_using_decl (parser
->scope
, identifier
);
17817 if (decl
&& typename_p
)
17818 USING_DECL_TYPENAME_P (decl
) = 1;
17820 if (check_for_bare_parameter_packs (decl
))
17822 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
17826 /* Add it to the list of members in this class. */
17827 finish_member_declaration (decl
);
17831 decl
= cp_parser_lookup_name_simple (parser
,
17834 if (decl
== error_mark_node
)
17835 cp_parser_name_lookup_error (parser
, identifier
,
17838 else if (check_for_bare_parameter_packs (decl
))
17840 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
17843 else if (!at_namespace_scope_p ())
17844 do_local_using_decl (decl
, qscope
, identifier
);
17846 do_toplevel_using_decl (decl
, qscope
, identifier
);
17850 /* Look for the final `;'. */
17851 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
17853 if (access_declaration_p
&& errorcount
== oldcount
)
17854 warning_at (diag_token
->location
, OPT_Wdeprecated
,
17855 "access declarations are deprecated "
17856 "in favour of using-declarations; "
17857 "suggestion: add the %<using%> keyword");
17862 /* Parse an alias-declaration.
17865 using identifier attribute-specifier-seq [opt] = type-id */
17868 cp_parser_alias_declaration (cp_parser
* parser
)
17870 tree id
, type
, decl
, pushed_scope
= NULL_TREE
, attributes
;
17871 location_t id_location
;
17872 cp_declarator
*declarator
;
17873 cp_decl_specifier_seq decl_specs
;
17875 const char *saved_message
= NULL
;
17877 /* Look for the `using' keyword. */
17878 cp_token
*using_token
17879 = cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
17880 if (using_token
== NULL
)
17881 return error_mark_node
;
17883 id_location
= cp_lexer_peek_token (parser
->lexer
)->location
;
17884 id
= cp_parser_identifier (parser
);
17885 if (id
== error_mark_node
)
17886 return error_mark_node
;
17888 cp_token
*attrs_token
= cp_lexer_peek_token (parser
->lexer
);
17889 attributes
= cp_parser_attributes_opt (parser
);
17890 if (attributes
== error_mark_node
)
17891 return error_mark_node
;
17893 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
17895 if (cp_parser_error_occurred (parser
))
17896 return error_mark_node
;
17898 cp_parser_commit_to_tentative_parse (parser
);
17900 /* Now we are going to parse the type-id of the declaration. */
17905 "A type-specifier-seq shall not define a class or enumeration
17906 unless it appears in the type-id of an alias-declaration (7.1.3) that
17907 is not the declaration of a template-declaration."
17909 In other words, if we currently are in an alias template, the
17910 type-id should not define a type.
17912 So let's set parser->type_definition_forbidden_message in that
17913 case; cp_parser_check_type_definition (called by
17914 cp_parser_class_specifier) will then emit an error if a type is
17915 defined in the type-id. */
17916 if (parser
->num_template_parameter_lists
)
17918 saved_message
= parser
->type_definition_forbidden_message
;
17919 parser
->type_definition_forbidden_message
=
17920 G_("types may not be defined in alias template declarations");
17923 type
= cp_parser_type_id (parser
);
17925 /* Restore the error message if need be. */
17926 if (parser
->num_template_parameter_lists
)
17927 parser
->type_definition_forbidden_message
= saved_message
;
17929 if (type
== error_mark_node
17930 || !cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
17932 cp_parser_skip_to_end_of_block_or_statement (parser
);
17933 return error_mark_node
;
17936 /* A typedef-name can also be introduced by an alias-declaration. The
17937 identifier following the using keyword becomes a typedef-name. It has
17938 the same semantics as if it were introduced by the typedef
17939 specifier. In particular, it does not define a new type and it shall
17940 not appear in the type-id. */
17942 clear_decl_specs (&decl_specs
);
17943 decl_specs
.type
= type
;
17944 if (attributes
!= NULL_TREE
)
17946 decl_specs
.attributes
= attributes
;
17947 set_and_check_decl_spec_loc (&decl_specs
,
17951 set_and_check_decl_spec_loc (&decl_specs
,
17954 set_and_check_decl_spec_loc (&decl_specs
,
17958 declarator
= make_id_declarator (NULL_TREE
, id
, sfk_none
);
17959 declarator
->id_loc
= id_location
;
17961 member_p
= at_class_scope_p ();
17963 decl
= grokfield (declarator
, &decl_specs
, NULL_TREE
, false,
17964 NULL_TREE
, attributes
);
17966 decl
= start_decl (declarator
, &decl_specs
, 0,
17967 attributes
, NULL_TREE
, &pushed_scope
);
17968 if (decl
== error_mark_node
)
17971 // Attach constraints to the alias declaration.
17972 if (flag_concepts
&& current_template_parms
)
17974 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
17975 tree constr
= build_constraints (reqs
, NULL_TREE
);
17976 set_constraints (decl
, constr
);
17979 cp_finish_decl (decl
, NULL_TREE
, 0, NULL_TREE
, 0);
17982 pop_scope (pushed_scope
);
17984 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17985 added into the symbol table; otherwise, return the TYPE_DECL. */
17986 if (DECL_LANG_SPECIFIC (decl
)
17987 && DECL_TEMPLATE_INFO (decl
)
17988 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
17990 decl
= DECL_TI_TEMPLATE (decl
);
17992 check_member_template (decl
);
17998 /* Parse a using-directive.
18001 using namespace :: [opt] nested-name-specifier [opt]
18002 namespace-name ; */
18005 cp_parser_using_directive (cp_parser
* parser
)
18007 tree namespace_decl
;
18010 /* Look for the `using' keyword. */
18011 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
18012 /* And the `namespace' keyword. */
18013 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
18014 /* Look for the optional `::' operator. */
18015 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
18016 /* And the optional nested-name-specifier. */
18017 cp_parser_nested_name_specifier_opt (parser
,
18018 /*typename_keyword_p=*/false,
18019 /*check_dependency_p=*/true,
18021 /*is_declaration=*/true);
18022 /* Get the namespace being used. */
18023 namespace_decl
= cp_parser_namespace_name (parser
);
18024 /* And any specified attributes. */
18025 attribs
= cp_parser_attributes_opt (parser
);
18026 /* Update the symbol table. */
18027 parse_using_directive (namespace_decl
, attribs
);
18028 /* Look for the final `;'. */
18029 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18032 /* Parse an asm-definition.
18035 asm ( string-literal ) ;
18040 asm volatile [opt] ( string-literal ) ;
18041 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18042 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18043 : asm-operand-list [opt] ) ;
18044 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18045 : asm-operand-list [opt]
18046 : asm-clobber-list [opt] ) ;
18047 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18048 : asm-clobber-list [opt]
18049 : asm-goto-list ) ; */
18052 cp_parser_asm_definition (cp_parser
* parser
)
18055 tree outputs
= NULL_TREE
;
18056 tree inputs
= NULL_TREE
;
18057 tree clobbers
= NULL_TREE
;
18058 tree labels
= NULL_TREE
;
18060 bool volatile_p
= false;
18061 bool extended_p
= false;
18062 bool invalid_inputs_p
= false;
18063 bool invalid_outputs_p
= false;
18064 bool goto_p
= false;
18065 required_token missing
= RT_NONE
;
18067 /* Look for the `asm' keyword. */
18068 cp_parser_require_keyword (parser
, RID_ASM
, RT_ASM
);
18070 if (parser
->in_function_body
18071 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
18073 error ("%<asm%> in %<constexpr%> function");
18074 cp_function_chain
->invalid_constexpr
= true;
18077 /* See if the next token is `volatile'. */
18078 if (cp_parser_allow_gnu_extensions_p (parser
)
18079 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_VOLATILE
))
18081 /* Remember that we saw the `volatile' keyword. */
18083 /* Consume the token. */
18084 cp_lexer_consume_token (parser
->lexer
);
18086 if (cp_parser_allow_gnu_extensions_p (parser
)
18087 && parser
->in_function_body
18088 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_GOTO
))
18090 /* Remember that we saw the `goto' keyword. */
18092 /* Consume the token. */
18093 cp_lexer_consume_token (parser
->lexer
);
18095 /* Look for the opening `('. */
18096 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
18098 /* Look for the string. */
18099 string
= cp_parser_string_literal (parser
, false, false);
18100 if (string
== error_mark_node
)
18102 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
18103 /*consume_paren=*/true);
18107 /* If we're allowing GNU extensions, check for the extended assembly
18108 syntax. Unfortunately, the `:' tokens need not be separated by
18109 a space in C, and so, for compatibility, we tolerate that here
18110 too. Doing that means that we have to treat the `::' operator as
18112 if (cp_parser_allow_gnu_extensions_p (parser
)
18113 && parser
->in_function_body
18114 && (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)
18115 || cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
)))
18117 bool inputs_p
= false;
18118 bool clobbers_p
= false;
18119 bool labels_p
= false;
18121 /* The extended syntax was used. */
18124 /* Look for outputs. */
18125 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
18127 /* Consume the `:'. */
18128 cp_lexer_consume_token (parser
->lexer
);
18129 /* Parse the output-operands. */
18130 if (cp_lexer_next_token_is_not (parser
->lexer
,
18132 && cp_lexer_next_token_is_not (parser
->lexer
,
18134 && cp_lexer_next_token_is_not (parser
->lexer
,
18138 outputs
= cp_parser_asm_operand_list (parser
);
18139 if (outputs
== error_mark_node
)
18140 invalid_outputs_p
= true;
18143 /* If the next token is `::', there are no outputs, and the
18144 next token is the beginning of the inputs. */
18145 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
18146 /* The inputs are coming next. */
18149 /* Look for inputs. */
18151 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
18153 /* Consume the `:' or `::'. */
18154 cp_lexer_consume_token (parser
->lexer
);
18155 /* Parse the output-operands. */
18156 if (cp_lexer_next_token_is_not (parser
->lexer
,
18158 && cp_lexer_next_token_is_not (parser
->lexer
,
18160 && cp_lexer_next_token_is_not (parser
->lexer
,
18163 inputs
= cp_parser_asm_operand_list (parser
);
18164 if (inputs
== error_mark_node
)
18165 invalid_inputs_p
= true;
18168 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
18169 /* The clobbers are coming next. */
18172 /* Look for clobbers. */
18174 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
18177 /* Consume the `:' or `::'. */
18178 cp_lexer_consume_token (parser
->lexer
);
18179 /* Parse the clobbers. */
18180 if (cp_lexer_next_token_is_not (parser
->lexer
,
18182 && cp_lexer_next_token_is_not (parser
->lexer
,
18184 clobbers
= cp_parser_asm_clobber_list (parser
);
18187 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
18188 /* The labels are coming next. */
18191 /* Look for labels. */
18193 || (goto_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)))
18196 /* Consume the `:' or `::'. */
18197 cp_lexer_consume_token (parser
->lexer
);
18198 /* Parse the labels. */
18199 labels
= cp_parser_asm_label_list (parser
);
18202 if (goto_p
&& !labels_p
)
18203 missing
= clobbers_p
? RT_COLON
: RT_COLON_SCOPE
;
18206 missing
= RT_COLON_SCOPE
;
18208 /* Look for the closing `)'. */
18209 if (!cp_parser_require (parser
, missing
? CPP_COLON
: CPP_CLOSE_PAREN
,
18210 missing
? missing
: RT_CLOSE_PAREN
))
18211 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
18212 /*consume_paren=*/true);
18213 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18215 if (!invalid_inputs_p
&& !invalid_outputs_p
)
18217 /* Create the ASM_EXPR. */
18218 if (parser
->in_function_body
)
18220 asm_stmt
= finish_asm_stmt (volatile_p
, string
, outputs
,
18221 inputs
, clobbers
, labels
);
18222 /* If the extended syntax was not used, mark the ASM_EXPR. */
18225 tree temp
= asm_stmt
;
18226 if (TREE_CODE (temp
) == CLEANUP_POINT_EXPR
)
18227 temp
= TREE_OPERAND (temp
, 0);
18229 ASM_INPUT_P (temp
) = 1;
18233 symtab
->finalize_toplevel_asm (string
);
18237 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
18238 type that comes from the decl-specifier-seq. */
18241 strip_declarator_types (tree type
, cp_declarator
*declarator
)
18243 for (cp_declarator
*d
= declarator
; d
;)
18252 if (TYPE_PTRMEMFUNC_P (type
))
18253 type
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
18254 type
= TREE_TYPE (type
);
18262 /* Declarators [gram.dcl.decl] */
18264 /* Parse an init-declarator.
18267 declarator initializer [opt]
18272 declarator asm-specification [opt] attributes [opt] initializer [opt]
18274 function-definition:
18275 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18277 decl-specifier-seq [opt] declarator function-try-block
18281 function-definition:
18282 __extension__ function-definition
18286 function-definition:
18287 decl-specifier-seq [opt] declarator function-transaction-block
18289 The DECL_SPECIFIERS apply to this declarator. Returns a
18290 representation of the entity declared. If MEMBER_P is TRUE, then
18291 this declarator appears in a class scope. The new DECL created by
18292 this declarator is returned.
18294 The CHECKS are access checks that should be performed once we know
18295 what entity is being declared (and, therefore, what classes have
18298 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18299 for a function-definition here as well. If the declarator is a
18300 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18301 be TRUE upon return. By that point, the function-definition will
18302 have been completely parsed.
18304 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18307 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18308 parsed declaration if it is an uninitialized single declarator not followed
18309 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18310 if present, will not be consumed. If returned, this declarator will be
18311 created with SD_INITIALIZED but will not call cp_finish_decl.
18313 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18314 and there is an initializer, the pointed location_t is set to the
18315 location of the '=' or `(', or '{' in C++11 token introducing the
18319 cp_parser_init_declarator (cp_parser
* parser
,
18320 cp_decl_specifier_seq
*decl_specifiers
,
18321 vec
<deferred_access_check
, va_gc
> *checks
,
18322 bool function_definition_allowed_p
,
18324 int declares_class_or_enum
,
18325 bool* function_definition_p
,
18326 tree
* maybe_range_for_decl
,
18327 location_t
* init_loc
,
18330 cp_token
*token
= NULL
, *asm_spec_start_token
= NULL
,
18331 *attributes_start_token
= NULL
;
18332 cp_declarator
*declarator
;
18333 tree prefix_attributes
;
18334 tree attributes
= NULL
;
18335 tree asm_specification
;
18337 tree decl
= NULL_TREE
;
18339 int is_initialized
;
18340 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18341 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18343 enum cpp_ttype initialization_kind
;
18344 bool is_direct_init
= false;
18345 bool is_non_constant_init
;
18346 int ctor_dtor_or_conv_p
;
18347 bool friend_p
= cp_parser_friend_p (decl_specifiers
);
18348 tree pushed_scope
= NULL_TREE
;
18349 bool range_for_decl_p
= false;
18350 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
18351 location_t tmp_init_loc
= UNKNOWN_LOCATION
;
18353 /* Gather the attributes that were provided with the
18354 decl-specifiers. */
18355 prefix_attributes
= decl_specifiers
->attributes
;
18357 /* Assume that this is not the declarator for a function
18359 if (function_definition_p
)
18360 *function_definition_p
= false;
18362 /* Default arguments are only permitted for function parameters. */
18363 if (decl_spec_seq_has_spec_p (decl_specifiers
, ds_typedef
))
18364 parser
->default_arg_ok_p
= false;
18366 /* Defer access checks while parsing the declarator; we cannot know
18367 what names are accessible until we know what is being
18369 resume_deferring_access_checks ();
18371 /* Parse the declarator. */
18372 token
= cp_lexer_peek_token (parser
->lexer
);
18374 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
18375 &ctor_dtor_or_conv_p
,
18376 /*parenthesized_p=*/NULL
,
18377 member_p
, friend_p
);
18378 /* Gather up the deferred checks. */
18379 stop_deferring_access_checks ();
18381 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
18383 /* If the DECLARATOR was erroneous, there's no need to go
18385 if (declarator
== cp_error_declarator
)
18386 return error_mark_node
;
18388 /* Check that the number of template-parameter-lists is OK. */
18389 if (!cp_parser_check_declarator_template_parameters (parser
, declarator
,
18391 return error_mark_node
;
18393 if (declares_class_or_enum
& 2)
18394 cp_parser_check_for_definition_in_return_type (declarator
,
18395 decl_specifiers
->type
,
18396 decl_specifiers
->locations
[ds_type_spec
]);
18398 /* Figure out what scope the entity declared by the DECLARATOR is
18399 located in. `grokdeclarator' sometimes changes the scope, so
18400 we compute it now. */
18401 scope
= get_scope_of_declarator (declarator
);
18403 /* Perform any lookups in the declared type which were thought to be
18404 dependent, but are not in the scope of the declarator. */
18405 decl_specifiers
->type
18406 = maybe_update_decl_type (decl_specifiers
->type
, scope
);
18408 /* If we're allowing GNU extensions, look for an
18409 asm-specification. */
18410 if (cp_parser_allow_gnu_extensions_p (parser
))
18412 /* Look for an asm-specification. */
18413 asm_spec_start_token
= cp_lexer_peek_token (parser
->lexer
);
18414 asm_specification
= cp_parser_asm_specification_opt (parser
);
18417 asm_specification
= NULL_TREE
;
18419 /* Look for attributes. */
18420 attributes_start_token
= cp_lexer_peek_token (parser
->lexer
);
18421 attributes
= cp_parser_attributes_opt (parser
);
18423 /* Peek at the next token. */
18424 token
= cp_lexer_peek_token (parser
->lexer
);
18426 bool bogus_implicit_tmpl
= false;
18428 if (function_declarator_p (declarator
))
18430 /* Check to see if the token indicates the start of a
18431 function-definition. */
18432 if (cp_parser_token_starts_function_definition_p (token
))
18434 if (!function_definition_allowed_p
)
18436 /* If a function-definition should not appear here, issue an
18438 cp_parser_error (parser
,
18439 "a function-definition is not allowed here");
18440 return error_mark_node
;
18443 location_t func_brace_location
18444 = cp_lexer_peek_token (parser
->lexer
)->location
;
18446 /* Neither attributes nor an asm-specification are allowed
18447 on a function-definition. */
18448 if (asm_specification
)
18449 error_at (asm_spec_start_token
->location
,
18450 "an asm-specification is not allowed "
18451 "on a function-definition");
18453 error_at (attributes_start_token
->location
,
18454 "attributes are not allowed "
18455 "on a function-definition");
18456 /* This is a function-definition. */
18457 *function_definition_p
= true;
18459 /* Parse the function definition. */
18461 decl
= cp_parser_save_member_function_body (parser
,
18464 prefix_attributes
);
18467 (cp_parser_function_definition_from_specifiers_and_declarator
18468 (parser
, decl_specifiers
, prefix_attributes
, declarator
));
18470 if (decl
!= error_mark_node
&& DECL_STRUCT_FUNCTION (decl
))
18472 /* This is where the prologue starts... */
18473 DECL_STRUCT_FUNCTION (decl
)->function_start_locus
18474 = func_brace_location
;
18480 else if (parser
->fully_implicit_function_template_p
)
18482 /* A non-template declaration involving a function parameter list
18483 containing an implicit template parameter will be made into a
18484 template. If the resulting declaration is not going to be an
18485 actual function then finish the template scope here to prevent it.
18486 An error message will be issued once we have a decl to talk about.
18488 FIXME probably we should do type deduction rather than create an
18489 implicit template, but the standard currently doesn't allow it. */
18490 bogus_implicit_tmpl
= true;
18491 finish_fully_implicit_template (parser
, NULL_TREE
);
18496 Only in function declarations for constructors, destructors, and
18497 type conversions can the decl-specifier-seq be omitted.
18499 We explicitly postpone this check past the point where we handle
18500 function-definitions because we tolerate function-definitions
18501 that are missing their return types in some modes. */
18502 if (!decl_specifiers
->any_specifiers_p
&& ctor_dtor_or_conv_p
<= 0)
18504 cp_parser_error (parser
,
18505 "expected constructor, destructor, or type conversion");
18506 return error_mark_node
;
18509 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18510 if (token
->type
== CPP_EQ
18511 || token
->type
== CPP_OPEN_PAREN
18512 || token
->type
== CPP_OPEN_BRACE
)
18514 is_initialized
= SD_INITIALIZED
;
18515 initialization_kind
= token
->type
;
18516 if (maybe_range_for_decl
)
18517 *maybe_range_for_decl
= error_mark_node
;
18518 tmp_init_loc
= token
->location
;
18519 if (init_loc
&& *init_loc
== UNKNOWN_LOCATION
)
18520 *init_loc
= tmp_init_loc
;
18522 if (token
->type
== CPP_EQ
18523 && function_declarator_p (declarator
))
18525 cp_token
*t2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
18526 if (t2
->keyword
== RID_DEFAULT
)
18527 is_initialized
= SD_DEFAULTED
;
18528 else if (t2
->keyword
== RID_DELETE
)
18529 is_initialized
= SD_DELETED
;
18534 /* If the init-declarator isn't initialized and isn't followed by a
18535 `,' or `;', it's not a valid init-declarator. */
18536 if (token
->type
!= CPP_COMMA
18537 && token
->type
!= CPP_SEMICOLON
)
18539 if (maybe_range_for_decl
&& *maybe_range_for_decl
!= error_mark_node
)
18540 range_for_decl_p
= true;
18543 if (!maybe_range_for_decl
)
18544 cp_parser_error (parser
, "expected initializer");
18545 return error_mark_node
;
18548 is_initialized
= SD_UNINITIALIZED
;
18549 initialization_kind
= CPP_EOF
;
18552 /* Because start_decl has side-effects, we should only call it if we
18553 know we're going ahead. By this point, we know that we cannot
18554 possibly be looking at any other construct. */
18555 cp_parser_commit_to_tentative_parse (parser
);
18557 /* Enter the newly declared entry in the symbol table. If we're
18558 processing a declaration in a class-specifier, we wait until
18559 after processing the initializer. */
18562 if (parser
->in_unbraced_linkage_specification_p
)
18563 decl_specifiers
->storage_class
= sc_extern
;
18564 decl
= start_decl (declarator
, decl_specifiers
,
18565 range_for_decl_p
? SD_INITIALIZED
: is_initialized
,
18566 attributes
, prefix_attributes
, &pushed_scope
);
18567 cp_finalize_omp_declare_simd (parser
, decl
);
18568 cp_finalize_oacc_routine (parser
, decl
, false);
18569 /* Adjust location of decl if declarator->id_loc is more appropriate:
18570 set, and decl wasn't merged with another decl, in which case its
18571 location would be different from input_location, and more accurate. */
18573 && declarator
->id_loc
!= UNKNOWN_LOCATION
18574 && DECL_SOURCE_LOCATION (decl
) == input_location
)
18575 DECL_SOURCE_LOCATION (decl
) = declarator
->id_loc
;
18578 /* Enter the SCOPE. That way unqualified names appearing in the
18579 initializer will be looked up in SCOPE. */
18580 pushed_scope
= push_scope (scope
);
18582 /* Perform deferred access control checks, now that we know in which
18583 SCOPE the declared entity resides. */
18584 if (!member_p
&& decl
)
18586 tree saved_current_function_decl
= NULL_TREE
;
18588 /* If the entity being declared is a function, pretend that we
18589 are in its scope. If it is a `friend', it may have access to
18590 things that would not otherwise be accessible. */
18591 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18593 saved_current_function_decl
= current_function_decl
;
18594 current_function_decl
= decl
;
18597 /* Perform access checks for template parameters. */
18598 cp_parser_perform_template_parameter_access_checks (checks
);
18600 /* Perform the access control checks for the declarator and the
18601 decl-specifiers. */
18602 perform_deferred_access_checks (tf_warning_or_error
);
18604 /* Restore the saved value. */
18605 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18606 current_function_decl
= saved_current_function_decl
;
18609 /* Parse the initializer. */
18610 initializer
= NULL_TREE
;
18611 is_direct_init
= false;
18612 is_non_constant_init
= true;
18613 if (is_initialized
)
18615 if (function_declarator_p (declarator
))
18617 if (initialization_kind
== CPP_EQ
)
18618 initializer
= cp_parser_pure_specifier (parser
);
18621 /* If the declaration was erroneous, we don't really
18622 know what the user intended, so just silently
18623 consume the initializer. */
18624 if (decl
!= error_mark_node
)
18625 error_at (tmp_init_loc
, "initializer provided for function");
18626 cp_parser_skip_to_closing_parenthesis (parser
,
18627 /*recovering=*/true,
18628 /*or_comma=*/false,
18629 /*consume_paren=*/true);
18634 /* We want to record the extra mangling scope for in-class
18635 initializers of class members and initializers of static data
18636 member templates. The former involves deferring
18637 parsing of the initializer until end of class as with default
18638 arguments. So right here we only handle the latter. */
18639 if (!member_p
&& processing_template_decl
)
18640 start_lambda_scope (decl
);
18641 initializer
= cp_parser_initializer (parser
,
18643 &is_non_constant_init
);
18644 if (!member_p
&& processing_template_decl
)
18645 finish_lambda_scope ();
18646 if (initializer
== error_mark_node
)
18647 cp_parser_skip_to_end_of_statement (parser
);
18651 /* The old parser allows attributes to appear after a parenthesized
18652 initializer. Mark Mitchell proposed removing this functionality
18653 on the GCC mailing lists on 2002-08-13. This parser accepts the
18654 attributes -- but ignores them. */
18655 if (cp_parser_allow_gnu_extensions_p (parser
)
18656 && initialization_kind
== CPP_OPEN_PAREN
)
18657 if (cp_parser_attributes_opt (parser
))
18658 warning (OPT_Wattributes
,
18659 "attributes after parenthesized initializer ignored");
18661 /* And now complain about a non-function implicit template. */
18662 if (bogus_implicit_tmpl
&& decl
!= error_mark_node
)
18663 error_at (DECL_SOURCE_LOCATION (decl
),
18664 "non-function %qD declared as implicit template", decl
);
18666 /* For an in-class declaration, use `grokfield' to create the
18672 pop_scope (pushed_scope
);
18673 pushed_scope
= NULL_TREE
;
18675 decl
= grokfield (declarator
, decl_specifiers
,
18676 initializer
, !is_non_constant_init
,
18677 /*asmspec=*/NULL_TREE
,
18678 chainon (attributes
, prefix_attributes
));
18679 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
18680 cp_parser_save_default_args (parser
, decl
);
18681 cp_finalize_omp_declare_simd (parser
, decl
);
18682 cp_finalize_oacc_routine (parser
, decl
, false);
18685 /* Finish processing the declaration. But, skip member
18687 if (!member_p
&& decl
&& decl
!= error_mark_node
&& !range_for_decl_p
)
18689 cp_finish_decl (decl
,
18690 initializer
, !is_non_constant_init
,
18692 /* If the initializer is in parentheses, then this is
18693 a direct-initialization, which means that an
18694 `explicit' constructor is OK. Otherwise, an
18695 `explicit' constructor cannot be used. */
18696 ((is_direct_init
|| !is_initialized
)
18697 ? LOOKUP_NORMAL
: LOOKUP_IMPLICIT
));
18699 else if ((cxx_dialect
!= cxx98
) && friend_p
18700 && decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
18701 /* Core issue #226 (C++0x only): A default template-argument
18702 shall not be specified in a friend class template
18704 check_default_tmpl_args (decl
, current_template_parms
, /*is_primary=*/true,
18705 /*is_partial=*/false, /*is_friend_decl=*/1);
18707 if (!friend_p
&& pushed_scope
)
18708 pop_scope (pushed_scope
);
18710 if (function_declarator_p (declarator
)
18711 && parser
->fully_implicit_function_template_p
)
18714 decl
= finish_fully_implicit_template (parser
, decl
);
18716 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
18719 if (auto_result
&& is_initialized
&& decl_specifiers
->type
18720 && type_uses_auto (decl_specifiers
->type
))
18721 *auto_result
= strip_declarator_types (TREE_TYPE (decl
), declarator
);
18726 /* Parse a declarator.
18730 ptr-operator declarator
18732 abstract-declarator:
18733 ptr-operator abstract-declarator [opt]
18734 direct-abstract-declarator
18739 attributes [opt] direct-declarator
18740 attributes [opt] ptr-operator declarator
18742 abstract-declarator:
18743 attributes [opt] ptr-operator abstract-declarator [opt]
18744 attributes [opt] direct-abstract-declarator
18746 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18747 detect constructor, destructor or conversion operators. It is set
18748 to -1 if the declarator is a name, and +1 if it is a
18749 function. Otherwise it is set to zero. Usually you just want to
18750 test for >0, but internally the negative value is used.
18752 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18753 a decl-specifier-seq unless it declares a constructor, destructor,
18754 or conversion. It might seem that we could check this condition in
18755 semantic analysis, rather than parsing, but that makes it difficult
18756 to handle something like `f()'. We want to notice that there are
18757 no decl-specifiers, and therefore realize that this is an
18758 expression, not a declaration.)
18760 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18761 the declarator is a direct-declarator of the form "(...)".
18763 MEMBER_P is true iff this declarator is a member-declarator.
18765 FRIEND_P is true iff this declarator is a friend. */
18767 static cp_declarator
*
18768 cp_parser_declarator (cp_parser
* parser
,
18769 cp_parser_declarator_kind dcl_kind
,
18770 int* ctor_dtor_or_conv_p
,
18771 bool* parenthesized_p
,
18772 bool member_p
, bool friend_p
)
18774 cp_declarator
*declarator
;
18775 enum tree_code code
;
18776 cp_cv_quals cv_quals
;
18778 tree gnu_attributes
= NULL_TREE
, std_attributes
= NULL_TREE
;
18780 /* Assume this is not a constructor, destructor, or type-conversion
18782 if (ctor_dtor_or_conv_p
)
18783 *ctor_dtor_or_conv_p
= 0;
18785 if (cp_parser_allow_gnu_extensions_p (parser
))
18786 gnu_attributes
= cp_parser_gnu_attributes_opt (parser
);
18788 /* Check for the ptr-operator production. */
18789 cp_parser_parse_tentatively (parser
);
18790 /* Parse the ptr-operator. */
18791 code
= cp_parser_ptr_operator (parser
,
18796 /* If that worked, then we have a ptr-operator. */
18797 if (cp_parser_parse_definitely (parser
))
18799 /* If a ptr-operator was found, then this declarator was not
18801 if (parenthesized_p
)
18802 *parenthesized_p
= true;
18803 /* The dependent declarator is optional if we are parsing an
18804 abstract-declarator. */
18805 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
18806 cp_parser_parse_tentatively (parser
);
18808 /* Parse the dependent declarator. */
18809 declarator
= cp_parser_declarator (parser
, dcl_kind
,
18810 /*ctor_dtor_or_conv_p=*/NULL
,
18811 /*parenthesized_p=*/NULL
,
18812 /*member_p=*/false,
18815 /* If we are parsing an abstract-declarator, we must handle the
18816 case where the dependent declarator is absent. */
18817 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
18818 && !cp_parser_parse_definitely (parser
))
18821 declarator
= cp_parser_make_indirect_declarator
18822 (code
, class_type
, cv_quals
, declarator
, std_attributes
);
18824 /* Everything else is a direct-declarator. */
18827 if (parenthesized_p
)
18828 *parenthesized_p
= cp_lexer_next_token_is (parser
->lexer
,
18830 declarator
= cp_parser_direct_declarator (parser
, dcl_kind
,
18831 ctor_dtor_or_conv_p
,
18832 member_p
, friend_p
);
18835 if (gnu_attributes
&& declarator
&& declarator
!= cp_error_declarator
)
18836 declarator
->attributes
= gnu_attributes
;
18840 /* Parse a direct-declarator or direct-abstract-declarator.
18844 direct-declarator ( parameter-declaration-clause )
18845 cv-qualifier-seq [opt]
18846 ref-qualifier [opt]
18847 exception-specification [opt]
18848 direct-declarator [ constant-expression [opt] ]
18851 direct-abstract-declarator:
18852 direct-abstract-declarator [opt]
18853 ( parameter-declaration-clause )
18854 cv-qualifier-seq [opt]
18855 ref-qualifier [opt]
18856 exception-specification [opt]
18857 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18858 ( abstract-declarator )
18860 Returns a representation of the declarator. DCL_KIND is
18861 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18862 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18863 we are parsing a direct-declarator. It is
18864 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18865 of ambiguity we prefer an abstract declarator, as per
18866 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18867 as for cp_parser_declarator. */
18869 static cp_declarator
*
18870 cp_parser_direct_declarator (cp_parser
* parser
,
18871 cp_parser_declarator_kind dcl_kind
,
18872 int* ctor_dtor_or_conv_p
,
18873 bool member_p
, bool friend_p
)
18876 cp_declarator
*declarator
= NULL
;
18877 tree scope
= NULL_TREE
;
18878 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
18879 bool saved_in_declarator_p
= parser
->in_declarator_p
;
18881 tree pushed_scope
= NULL_TREE
;
18885 /* Peek at the next token. */
18886 token
= cp_lexer_peek_token (parser
->lexer
);
18887 if (token
->type
== CPP_OPEN_PAREN
)
18889 /* This is either a parameter-declaration-clause, or a
18890 parenthesized declarator. When we know we are parsing a
18891 named declarator, it must be a parenthesized declarator
18892 if FIRST is true. For instance, `(int)' is a
18893 parameter-declaration-clause, with an omitted
18894 direct-abstract-declarator. But `((*))', is a
18895 parenthesized abstract declarator. Finally, when T is a
18896 template parameter `(T)' is a
18897 parameter-declaration-clause, and not a parenthesized
18900 We first try and parse a parameter-declaration-clause,
18901 and then try a nested declarator (if FIRST is true).
18903 It is not an error for it not to be a
18904 parameter-declaration-clause, even when FIRST is
18910 The first is the declaration of a function while the
18911 second is the definition of a variable, including its
18914 Having seen only the parenthesis, we cannot know which of
18915 these two alternatives should be selected. Even more
18916 complex are examples like:
18921 The former is a function-declaration; the latter is a
18922 variable initialization.
18924 Thus again, we try a parameter-declaration-clause, and if
18925 that fails, we back out and return. */
18927 if (!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
18930 bool is_declarator
= false;
18932 /* In a member-declarator, the only valid interpretation
18933 of a parenthesis is the start of a
18934 parameter-declaration-clause. (It is invalid to
18935 initialize a static data member with a parenthesized
18936 initializer; only the "=" form of initialization is
18939 cp_parser_parse_tentatively (parser
);
18941 /* Consume the `('. */
18942 cp_lexer_consume_token (parser
->lexer
);
18945 /* If this is going to be an abstract declarator, we're
18946 in a declarator and we can't have default args. */
18947 parser
->default_arg_ok_p
= false;
18948 parser
->in_declarator_p
= true;
18951 begin_scope (sk_function_parms
, NULL_TREE
);
18953 /* Parse the parameter-declaration-clause. */
18954 params
= cp_parser_parameter_declaration_clause (parser
);
18956 /* Consume the `)'. */
18957 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18959 /* If all went well, parse the cv-qualifier-seq,
18960 ref-qualifier and the exception-specification. */
18961 if (member_p
|| cp_parser_parse_definitely (parser
))
18963 cp_cv_quals cv_quals
;
18964 cp_virt_specifiers virt_specifiers
;
18965 cp_ref_qualifier ref_qual
;
18966 tree exception_specification
;
18969 bool memfn
= (member_p
|| (pushed_scope
18970 && CLASS_TYPE_P (pushed_scope
)));
18972 is_declarator
= true;
18974 if (ctor_dtor_or_conv_p
)
18975 *ctor_dtor_or_conv_p
= *ctor_dtor_or_conv_p
< 0;
18978 /* Parse the cv-qualifier-seq. */
18979 cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
18980 /* Parse the ref-qualifier. */
18981 ref_qual
= cp_parser_ref_qualifier_opt (parser
);
18982 /* Parse the tx-qualifier. */
18983 tree tx_qual
= cp_parser_tx_qualifier_opt (parser
);
18984 /* And the exception-specification. */
18985 exception_specification
18986 = cp_parser_exception_specification_opt (parser
);
18988 attrs
= cp_parser_std_attribute_spec_seq (parser
);
18990 /* In here, we handle cases where attribute is used after
18991 the function declaration. For example:
18992 void func (int x) __attribute__((vector(..))); */
18993 tree gnu_attrs
= NULL_TREE
;
18995 && cp_next_tokens_can_be_gnu_attribute_p (parser
))
18997 cp_parser_parse_tentatively (parser
);
18998 tree attr
= cp_parser_gnu_attributes_opt (parser
);
18999 if (cp_lexer_next_token_is_not (parser
->lexer
,
19001 && cp_lexer_next_token_is_not (parser
->lexer
,
19003 cp_parser_abort_tentative_parse (parser
);
19004 else if (!cp_parser_parse_definitely (parser
))
19009 tree requires_clause
= NULL_TREE
;
19010 late_return
= (cp_parser_late_return_type_opt
19011 (parser
, declarator
, requires_clause
,
19012 memfn
? cv_quals
: -1));
19014 /* Parse the virt-specifier-seq. */
19015 virt_specifiers
= cp_parser_virt_specifier_seq_opt (parser
);
19017 /* Create the function-declarator. */
19018 declarator
= make_call_declarator (declarator
,
19024 exception_specification
,
19027 declarator
->std_attributes
= attrs
;
19028 declarator
->attributes
= gnu_attrs
;
19029 /* Any subsequent parameter lists are to do with
19030 return type, so are not those of the declared
19032 parser
->default_arg_ok_p
= false;
19035 /* Remove the function parms from scope. */
19036 pop_bindings_and_leave_scope ();
19039 /* Repeat the main loop. */
19043 /* If this is the first, we can try a parenthesized
19047 bool saved_in_type_id_in_expr_p
;
19049 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
19050 parser
->in_declarator_p
= saved_in_declarator_p
;
19052 /* Consume the `('. */
19053 cp_lexer_consume_token (parser
->lexer
);
19054 /* Parse the nested declarator. */
19055 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
19056 parser
->in_type_id_in_expr_p
= true;
19058 = cp_parser_declarator (parser
, dcl_kind
, ctor_dtor_or_conv_p
,
19059 /*parenthesized_p=*/NULL
,
19060 member_p
, friend_p
);
19061 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
19063 /* Expect a `)'. */
19064 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
19065 declarator
= cp_error_declarator
;
19066 if (declarator
== cp_error_declarator
)
19069 goto handle_declarator
;
19071 /* Otherwise, we must be done. */
19075 else if ((!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
19076 && token
->type
== CPP_OPEN_SQUARE
19077 && !cp_next_tokens_can_be_attribute_p (parser
))
19079 /* Parse an array-declarator. */
19080 tree bounds
, attrs
;
19082 if (ctor_dtor_or_conv_p
)
19083 *ctor_dtor_or_conv_p
= 0;
19086 parser
->default_arg_ok_p
= false;
19087 parser
->in_declarator_p
= true;
19088 /* Consume the `['. */
19089 cp_lexer_consume_token (parser
->lexer
);
19090 /* Peek at the next token. */
19091 token
= cp_lexer_peek_token (parser
->lexer
);
19092 /* If the next token is `]', then there is no
19093 constant-expression. */
19094 if (token
->type
!= CPP_CLOSE_SQUARE
)
19096 bool non_constant_p
;
19098 = cp_parser_constant_expression (parser
,
19099 /*allow_non_constant=*/true,
19101 if (!non_constant_p
)
19103 else if (error_operand_p (bounds
))
19104 /* Already gave an error. */;
19105 else if (!parser
->in_function_body
19106 || current_binding_level
->kind
== sk_function_parms
)
19108 /* Normally, the array bound must be an integral constant
19109 expression. However, as an extension, we allow VLAs
19110 in function scopes as long as they aren't part of a
19111 parameter declaration. */
19112 cp_parser_error (parser
,
19113 "array bound is not an integer constant");
19114 bounds
= error_mark_node
;
19116 else if (processing_template_decl
19117 && !type_dependent_expression_p (bounds
))
19119 /* Remember this wasn't a constant-expression. */
19120 bounds
= build_nop (TREE_TYPE (bounds
), bounds
);
19121 TREE_SIDE_EFFECTS (bounds
) = 1;
19125 bounds
= NULL_TREE
;
19126 /* Look for the closing `]'. */
19127 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
19129 declarator
= cp_error_declarator
;
19133 attrs
= cp_parser_std_attribute_spec_seq (parser
);
19134 declarator
= make_array_declarator (declarator
, bounds
);
19135 declarator
->std_attributes
= attrs
;
19137 else if (first
&& dcl_kind
!= CP_PARSER_DECLARATOR_ABSTRACT
)
19140 tree qualifying_scope
;
19141 tree unqualified_name
;
19143 special_function_kind sfk
;
19145 bool pack_expansion_p
= false;
19146 cp_token
*declarator_id_start_token
;
19148 /* Parse a declarator-id */
19149 abstract_ok
= (dcl_kind
== CP_PARSER_DECLARATOR_EITHER
);
19152 cp_parser_parse_tentatively (parser
);
19154 /* If we see an ellipsis, we should be looking at a
19156 if (token
->type
== CPP_ELLIPSIS
)
19158 /* Consume the `...' */
19159 cp_lexer_consume_token (parser
->lexer
);
19161 pack_expansion_p
= true;
19165 declarator_id_start_token
= cp_lexer_peek_token (parser
->lexer
);
19167 = cp_parser_declarator_id (parser
, /*optional_p=*/abstract_ok
);
19168 qualifying_scope
= parser
->scope
;
19173 if (!unqualified_name
&& pack_expansion_p
)
19175 /* Check whether an error occurred. */
19176 okay
= !cp_parser_error_occurred (parser
);
19178 /* We already consumed the ellipsis to mark a
19179 parameter pack, but we have no way to report it,
19180 so abort the tentative parse. We will be exiting
19181 immediately anyway. */
19182 cp_parser_abort_tentative_parse (parser
);
19185 okay
= cp_parser_parse_definitely (parser
);
19188 unqualified_name
= error_mark_node
;
19189 else if (unqualified_name
19190 && (qualifying_scope
19191 || (!identifier_p (unqualified_name
))))
19193 cp_parser_error (parser
, "expected unqualified-id");
19194 unqualified_name
= error_mark_node
;
19198 if (!unqualified_name
)
19200 if (unqualified_name
== error_mark_node
)
19202 declarator
= cp_error_declarator
;
19203 pack_expansion_p
= false;
19204 declarator
->parameter_pack_p
= false;
19208 attrs
= cp_parser_std_attribute_spec_seq (parser
);
19210 if (qualifying_scope
&& at_namespace_scope_p ()
19211 && TREE_CODE (qualifying_scope
) == TYPENAME_TYPE
)
19213 /* In the declaration of a member of a template class
19214 outside of the class itself, the SCOPE will sometimes
19215 be a TYPENAME_TYPE. For example, given:
19217 template <typename T>
19218 int S<T>::R::i = 3;
19220 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19221 this context, we must resolve S<T>::R to an ordinary
19222 type, rather than a typename type.
19224 The reason we normally avoid resolving TYPENAME_TYPEs
19225 is that a specialization of `S' might render
19226 `S<T>::R' not a type. However, if `S' is
19227 specialized, then this `i' will not be used, so there
19228 is no harm in resolving the types here. */
19231 /* Resolve the TYPENAME_TYPE. */
19232 type
= resolve_typename_type (qualifying_scope
,
19233 /*only_current_p=*/false);
19234 /* If that failed, the declarator is invalid. */
19235 if (TREE_CODE (type
) == TYPENAME_TYPE
)
19237 if (typedef_variant_p (type
))
19238 error_at (declarator_id_start_token
->location
,
19239 "cannot define member of dependent typedef "
19242 error_at (declarator_id_start_token
->location
,
19243 "%<%T::%E%> is not a type",
19244 TYPE_CONTEXT (qualifying_scope
),
19245 TYPE_IDENTIFIER (qualifying_scope
));
19247 qualifying_scope
= type
;
19252 if (unqualified_name
)
19256 if (qualifying_scope
19257 && CLASS_TYPE_P (qualifying_scope
))
19258 class_type
= qualifying_scope
;
19260 class_type
= current_class_type
;
19262 if (TREE_CODE (unqualified_name
) == TYPE_DECL
)
19264 tree name_type
= TREE_TYPE (unqualified_name
);
19265 if (class_type
&& same_type_p (name_type
, class_type
))
19267 if (qualifying_scope
19268 && CLASSTYPE_USE_TEMPLATE (name_type
))
19270 error_at (declarator_id_start_token
->location
,
19271 "invalid use of constructor as a template");
19272 inform (declarator_id_start_token
->location
,
19273 "use %<%T::%D%> instead of %<%T::%D%> to "
19274 "name the constructor in a qualified name",
19276 DECL_NAME (TYPE_TI_TEMPLATE (class_type
)),
19277 class_type
, name_type
);
19278 declarator
= cp_error_declarator
;
19282 unqualified_name
= constructor_name (class_type
);
19286 /* We do not attempt to print the declarator
19287 here because we do not have enough
19288 information about its original syntactic
19290 cp_parser_error (parser
, "invalid declarator");
19291 declarator
= cp_error_declarator
;
19298 if (TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
)
19299 sfk
= sfk_destructor
;
19300 else if (IDENTIFIER_TYPENAME_P (unqualified_name
))
19301 sfk
= sfk_conversion
;
19302 else if (/* There's no way to declare a constructor
19303 for an anonymous type, even if the type
19304 got a name for linkage purposes. */
19305 !TYPE_WAS_ANONYMOUS (class_type
)
19306 /* Handle correctly (c++/19200):
19320 friend void N::S();
19323 && class_type
!= qualifying_scope
)
19324 && constructor_name_p (unqualified_name
,
19327 unqualified_name
= constructor_name (class_type
);
19328 sfk
= sfk_constructor
;
19330 else if (is_overloaded_fn (unqualified_name
)
19331 && DECL_CONSTRUCTOR_P (get_first_fn
19332 (unqualified_name
)))
19333 sfk
= sfk_constructor
;
19335 if (ctor_dtor_or_conv_p
&& sfk
!= sfk_none
)
19336 *ctor_dtor_or_conv_p
= -1;
19339 declarator
= make_id_declarator (qualifying_scope
,
19342 declarator
->std_attributes
= attrs
;
19343 declarator
->id_loc
= token
->location
;
19344 declarator
->parameter_pack_p
= pack_expansion_p
;
19346 if (pack_expansion_p
)
19347 maybe_warn_variadic_templates ();
19350 handle_declarator
:;
19351 scope
= get_scope_of_declarator (declarator
);
19354 /* Any names that appear after the declarator-id for a
19355 member are looked up in the containing scope. */
19356 if (at_function_scope_p ())
19358 /* But declarations with qualified-ids can't appear in a
19360 cp_parser_error (parser
, "qualified-id in declaration");
19361 declarator
= cp_error_declarator
;
19364 pushed_scope
= push_scope (scope
);
19366 parser
->in_declarator_p
= true;
19367 if ((ctor_dtor_or_conv_p
&& *ctor_dtor_or_conv_p
)
19368 || (declarator
&& declarator
->kind
== cdk_id
))
19369 /* Default args are only allowed on function
19371 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
19373 parser
->default_arg_ok_p
= false;
19382 /* For an abstract declarator, we might wind up with nothing at this
19383 point. That's an error; the declarator is not optional. */
19385 cp_parser_error (parser
, "expected declarator");
19387 /* If we entered a scope, we must exit it now. */
19389 pop_scope (pushed_scope
);
19391 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
19392 parser
->in_declarator_p
= saved_in_declarator_p
;
19397 /* Parse a ptr-operator.
19400 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19401 * cv-qualifier-seq [opt]
19403 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19404 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19409 & cv-qualifier-seq [opt]
19411 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19412 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19413 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19414 filled in with the TYPE containing the member. *CV_QUALS is
19415 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19416 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19417 Note that the tree codes returned by this function have nothing
19418 to do with the types of trees that will be eventually be created
19419 to represent the pointer or reference type being parsed. They are
19420 just constants with suggestive names. */
19421 static enum tree_code
19422 cp_parser_ptr_operator (cp_parser
* parser
,
19424 cp_cv_quals
*cv_quals
,
19427 enum tree_code code
= ERROR_MARK
;
19429 tree attrs
= NULL_TREE
;
19431 /* Assume that it's not a pointer-to-member. */
19433 /* And that there are no cv-qualifiers. */
19434 *cv_quals
= TYPE_UNQUALIFIED
;
19436 /* Peek at the next token. */
19437 token
= cp_lexer_peek_token (parser
->lexer
);
19439 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19440 if (token
->type
== CPP_MULT
)
19441 code
= INDIRECT_REF
;
19442 else if (token
->type
== CPP_AND
)
19444 else if ((cxx_dialect
!= cxx98
) &&
19445 token
->type
== CPP_AND_AND
) /* C++0x only */
19446 code
= NON_LVALUE_EXPR
;
19448 if (code
!= ERROR_MARK
)
19450 /* Consume the `*', `&' or `&&'. */
19451 cp_lexer_consume_token (parser
->lexer
);
19453 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19454 `&', if we are allowing GNU extensions. (The only qualifier
19455 that can legally appear after `&' is `restrict', but that is
19456 enforced during semantic analysis. */
19457 if (code
== INDIRECT_REF
19458 || cp_parser_allow_gnu_extensions_p (parser
))
19459 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
19461 attrs
= cp_parser_std_attribute_spec_seq (parser
);
19462 if (attributes
!= NULL
)
19463 *attributes
= attrs
;
19467 /* Try the pointer-to-member case. */
19468 cp_parser_parse_tentatively (parser
);
19469 /* Look for the optional `::' operator. */
19470 cp_parser_global_scope_opt (parser
,
19471 /*current_scope_valid_p=*/false);
19472 /* Look for the nested-name specifier. */
19473 token
= cp_lexer_peek_token (parser
->lexer
);
19474 cp_parser_nested_name_specifier (parser
,
19475 /*typename_keyword_p=*/false,
19476 /*check_dependency_p=*/true,
19478 /*is_declaration=*/false);
19479 /* If we found it, and the next token is a `*', then we are
19480 indeed looking at a pointer-to-member operator. */
19481 if (!cp_parser_error_occurred (parser
)
19482 && cp_parser_require (parser
, CPP_MULT
, RT_MULT
))
19484 /* Indicate that the `*' operator was used. */
19485 code
= INDIRECT_REF
;
19487 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
19488 error_at (token
->location
, "%qD is a namespace", parser
->scope
);
19489 else if (TREE_CODE (parser
->scope
) == ENUMERAL_TYPE
)
19490 error_at (token
->location
, "cannot form pointer to member of "
19491 "non-class %q#T", parser
->scope
);
19494 /* The type of which the member is a member is given by the
19496 *type
= parser
->scope
;
19497 /* The next name will not be qualified. */
19498 parser
->scope
= NULL_TREE
;
19499 parser
->qualifying_scope
= NULL_TREE
;
19500 parser
->object_scope
= NULL_TREE
;
19501 /* Look for optional c++11 attributes. */
19502 attrs
= cp_parser_std_attribute_spec_seq (parser
);
19503 if (attributes
!= NULL
)
19504 *attributes
= attrs
;
19505 /* Look for the optional cv-qualifier-seq. */
19506 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
19509 /* If that didn't work we don't have a ptr-operator. */
19510 if (!cp_parser_parse_definitely (parser
))
19511 cp_parser_error (parser
, "expected ptr-operator");
19517 /* Parse an (optional) cv-qualifier-seq.
19520 cv-qualifier cv-qualifier-seq [opt]
19531 Returns a bitmask representing the cv-qualifiers. */
19534 cp_parser_cv_qualifier_seq_opt (cp_parser
* parser
)
19536 cp_cv_quals cv_quals
= TYPE_UNQUALIFIED
;
19541 cp_cv_quals cv_qualifier
;
19543 /* Peek at the next token. */
19544 token
= cp_lexer_peek_token (parser
->lexer
);
19545 /* See if it's a cv-qualifier. */
19546 switch (token
->keyword
)
19549 cv_qualifier
= TYPE_QUAL_CONST
;
19553 cv_qualifier
= TYPE_QUAL_VOLATILE
;
19557 cv_qualifier
= TYPE_QUAL_RESTRICT
;
19561 cv_qualifier
= TYPE_UNQUALIFIED
;
19568 if (cv_quals
& cv_qualifier
)
19570 error_at (token
->location
, "duplicate cv-qualifier");
19571 cp_lexer_purge_token (parser
->lexer
);
19575 cp_lexer_consume_token (parser
->lexer
);
19576 cv_quals
|= cv_qualifier
;
19583 /* Parse an (optional) ref-qualifier
19589 Returns cp_ref_qualifier representing ref-qualifier. */
19591 static cp_ref_qualifier
19592 cp_parser_ref_qualifier_opt (cp_parser
* parser
)
19594 cp_ref_qualifier ref_qual
= REF_QUAL_NONE
;
19596 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19597 if (cxx_dialect
< cxx11
&& cp_parser_parsing_tentatively (parser
))
19602 cp_ref_qualifier curr_ref_qual
= REF_QUAL_NONE
;
19603 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19605 switch (token
->type
)
19608 curr_ref_qual
= REF_QUAL_LVALUE
;
19612 curr_ref_qual
= REF_QUAL_RVALUE
;
19616 curr_ref_qual
= REF_QUAL_NONE
;
19620 if (!curr_ref_qual
)
19624 error_at (token
->location
, "multiple ref-qualifiers");
19625 cp_lexer_purge_token (parser
->lexer
);
19629 ref_qual
= curr_ref_qual
;
19630 cp_lexer_consume_token (parser
->lexer
);
19637 /* Parse an optional tx-qualifier.
19641 transaction_safe_dynamic */
19644 cp_parser_tx_qualifier_opt (cp_parser
*parser
)
19646 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19647 if (token
->type
== CPP_NAME
)
19649 tree name
= token
->u
.value
;
19650 const char *p
= IDENTIFIER_POINTER (name
);
19651 const int len
= strlen ("transaction_safe");
19652 if (!strncmp (p
, "transaction_safe", len
))
19656 || !strcmp (p
, "_dynamic"))
19658 cp_lexer_consume_token (parser
->lexer
);
19661 error ("%E requires %<-fgnu-tm%>", name
);
19672 /* Parse an (optional) virt-specifier-seq.
19674 virt-specifier-seq:
19675 virt-specifier virt-specifier-seq [opt]
19681 Returns a bitmask representing the virt-specifiers. */
19683 static cp_virt_specifiers
19684 cp_parser_virt_specifier_seq_opt (cp_parser
* parser
)
19686 cp_virt_specifiers virt_specifiers
= VIRT_SPEC_UNSPECIFIED
;
19691 cp_virt_specifiers virt_specifier
;
19693 /* Peek at the next token. */
19694 token
= cp_lexer_peek_token (parser
->lexer
);
19695 /* See if it's a virt-specifier-qualifier. */
19696 if (token
->type
!= CPP_NAME
)
19698 if (!strcmp (IDENTIFIER_POINTER(token
->u
.value
), "override"))
19700 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS
);
19701 virt_specifier
= VIRT_SPEC_OVERRIDE
;
19703 else if (!strcmp (IDENTIFIER_POINTER(token
->u
.value
), "final"))
19705 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS
);
19706 virt_specifier
= VIRT_SPEC_FINAL
;
19708 else if (!strcmp (IDENTIFIER_POINTER(token
->u
.value
), "__final"))
19710 virt_specifier
= VIRT_SPEC_FINAL
;
19715 if (virt_specifiers
& virt_specifier
)
19717 error_at (token
->location
, "duplicate virt-specifier");
19718 cp_lexer_purge_token (parser
->lexer
);
19722 cp_lexer_consume_token (parser
->lexer
);
19723 virt_specifiers
|= virt_specifier
;
19726 return virt_specifiers
;
19729 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19730 is in scope even though it isn't real. */
19733 inject_this_parameter (tree ctype
, cp_cv_quals quals
)
19737 if (current_class_ptr
)
19739 /* We don't clear this between NSDMIs. Is it already what we want? */
19740 tree type
= TREE_TYPE (TREE_TYPE (current_class_ptr
));
19741 if (same_type_ignoring_top_level_qualifiers_p (ctype
, type
)
19742 && cp_type_quals (type
) == quals
)
19746 this_parm
= build_this_parm (ctype
, quals
);
19747 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19748 current_class_ptr
= NULL_TREE
;
19750 = cp_build_indirect_ref (this_parm
, RO_NULL
, tf_warning_or_error
);
19751 current_class_ptr
= this_parm
;
19754 /* Return true iff our current scope is a non-static data member
19758 parsing_nsdmi (void)
19760 /* We recognize NSDMI context by the context-less 'this' pointer set up
19761 by the function above. */
19762 if (current_class_ptr
19763 && TREE_CODE (current_class_ptr
) == PARM_DECL
19764 && DECL_CONTEXT (current_class_ptr
) == NULL_TREE
)
19769 /* Parse a late-specified return type, if any. This is not a separate
19770 non-terminal, but part of a function declarator, which looks like
19772 -> trailing-type-specifier-seq abstract-declarator(opt)
19774 Returns the type indicated by the type-id.
19776 In addition to this, parse any queued up omp declare simd
19777 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19779 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19783 cp_parser_late_return_type_opt (cp_parser
* parser
, cp_declarator
*declarator
,
19784 tree
& requires_clause
, cp_cv_quals quals
)
19787 tree type
= NULL_TREE
;
19788 bool declare_simd_p
= (parser
->omp_declare_simd
19790 && declarator
->kind
== cdk_id
);
19792 bool cilk_simd_fn_vector_p
= (parser
->cilk_simd_fn_info
19793 && declarator
&& declarator
->kind
== cdk_id
);
19795 bool oacc_routine_p
= (parser
->oacc_routine
19797 && declarator
->kind
== cdk_id
);
19799 /* Peek at the next token. */
19800 token
= cp_lexer_peek_token (parser
->lexer
);
19801 /* A late-specified return type is indicated by an initial '->'. */
19802 if (token
->type
!= CPP_DEREF
19803 && token
->keyword
!= RID_REQUIRES
19804 && !(token
->type
== CPP_NAME
19805 && token
->u
.value
== ridpointers
[RID_REQUIRES
])
19806 && !(declare_simd_p
|| cilk_simd_fn_vector_p
|| oacc_routine_p
))
19809 tree save_ccp
= current_class_ptr
;
19810 tree save_ccr
= current_class_ref
;
19813 /* DR 1207: 'this' is in scope in the trailing return type. */
19814 inject_this_parameter (current_class_type
, quals
);
19817 if (token
->type
== CPP_DEREF
)
19819 /* Consume the ->. */
19820 cp_lexer_consume_token (parser
->lexer
);
19822 type
= cp_parser_trailing_type_id (parser
);
19825 /* Function declarations may be followed by a trailing
19826 requires-clause. */
19827 requires_clause
= cp_parser_requires_clause_opt (parser
);
19829 if (cilk_simd_fn_vector_p
)
19830 declarator
->attributes
19831 = cp_parser_late_parsing_cilk_simd_fn_info (parser
,
19832 declarator
->attributes
);
19833 if (declare_simd_p
)
19834 declarator
->attributes
19835 = cp_parser_late_parsing_omp_declare_simd (parser
,
19836 declarator
->attributes
);
19837 if (oacc_routine_p
)
19838 declarator
->attributes
19839 = cp_parser_late_parsing_oacc_routine (parser
,
19840 declarator
->attributes
);
19844 current_class_ptr
= save_ccp
;
19845 current_class_ref
= save_ccr
;
19851 /* Parse a declarator-id.
19855 :: [opt] nested-name-specifier [opt] type-name
19857 In the `id-expression' case, the value returned is as for
19858 cp_parser_id_expression if the id-expression was an unqualified-id.
19859 If the id-expression was a qualified-id, then a SCOPE_REF is
19860 returned. The first operand is the scope (either a NAMESPACE_DECL
19861 or TREE_TYPE), but the second is still just a representation of an
19865 cp_parser_declarator_id (cp_parser
* parser
, bool optional_p
)
19868 /* The expression must be an id-expression. Assume that qualified
19869 names are the names of types so that:
19872 int S<T>::R::i = 3;
19874 will work; we must treat `S<T>::R' as the name of a type.
19875 Similarly, assume that qualified names are templates, where
19879 int S<T>::R<T>::i = 3;
19882 id
= cp_parser_id_expression (parser
,
19883 /*template_keyword_p=*/false,
19884 /*check_dependency_p=*/false,
19885 /*template_p=*/NULL
,
19886 /*declarator_p=*/true,
19888 if (id
&& BASELINK_P (id
))
19889 id
= BASELINK_FUNCTIONS (id
);
19893 /* Parse a type-id.
19896 type-specifier-seq abstract-declarator [opt]
19898 Returns the TYPE specified. */
19901 cp_parser_type_id_1 (cp_parser
* parser
, bool is_template_arg
,
19902 bool is_trailing_return
)
19904 cp_decl_specifier_seq type_specifier_seq
;
19905 cp_declarator
*abstract_declarator
;
19907 /* Parse the type-specifier-seq. */
19908 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
19909 is_trailing_return
,
19910 &type_specifier_seq
);
19911 if (type_specifier_seq
.type
== error_mark_node
)
19912 return error_mark_node
;
19914 /* There might or might not be an abstract declarator. */
19915 cp_parser_parse_tentatively (parser
);
19916 /* Look for the declarator. */
19917 abstract_declarator
19918 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_ABSTRACT
, NULL
,
19919 /*parenthesized_p=*/NULL
,
19920 /*member_p=*/false,
19921 /*friend_p=*/false);
19922 /* Check to see if there really was a declarator. */
19923 if (!cp_parser_parse_definitely (parser
))
19924 abstract_declarator
= NULL
;
19926 if (type_specifier_seq
.type
19927 /* The concepts TS allows 'auto' as a type-id. */
19928 && (!flag_concepts
|| parser
->in_type_id_in_expr_p
)
19929 /* None of the valid uses of 'auto' in C++14 involve the type-id
19930 nonterminal, but it is valid in a trailing-return-type. */
19931 && !(cxx_dialect
>= cxx14
&& is_trailing_return
)
19932 && type_uses_auto (type_specifier_seq
.type
))
19934 /* A type-id with type 'auto' is only ok if the abstract declarator
19935 is a function declarator with a late-specified return type.
19937 A type-id with 'auto' is also valid in a trailing-return-type
19938 in a compound-requirement. */
19939 if (abstract_declarator
19940 && abstract_declarator
->kind
== cdk_function
19941 && abstract_declarator
->u
.function
.late_return_type
)
19943 else if (parser
->in_result_type_constraint_p
)
19947 error ("invalid use of %<auto%>");
19948 return error_mark_node
;
19952 return groktypename (&type_specifier_seq
, abstract_declarator
,
19957 cp_parser_type_id (cp_parser
*parser
)
19959 return cp_parser_type_id_1 (parser
, false, false);
19963 cp_parser_template_type_arg (cp_parser
*parser
)
19966 const char *saved_message
= parser
->type_definition_forbidden_message
;
19967 parser
->type_definition_forbidden_message
19968 = G_("types may not be defined in template arguments");
19969 r
= cp_parser_type_id_1 (parser
, true, false);
19970 parser
->type_definition_forbidden_message
= saved_message
;
19971 if (cxx_dialect
>= cxx14
&& !flag_concepts
&& type_uses_auto (r
))
19973 error ("invalid use of %<auto%> in template argument");
19974 r
= error_mark_node
;
19980 cp_parser_trailing_type_id (cp_parser
*parser
)
19982 return cp_parser_type_id_1 (parser
, false, true);
19985 /* Parse a type-specifier-seq.
19987 type-specifier-seq:
19988 type-specifier type-specifier-seq [opt]
19992 type-specifier-seq:
19993 attributes type-specifier-seq [opt]
19995 If IS_DECLARATION is true, we are at the start of a "condition" or
19996 exception-declaration, so we might be followed by a declarator-id.
19998 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19999 i.e. we've just seen "->".
20001 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
20004 cp_parser_type_specifier_seq (cp_parser
* parser
,
20005 bool is_declaration
,
20006 bool is_trailing_return
,
20007 cp_decl_specifier_seq
*type_specifier_seq
)
20009 bool seen_type_specifier
= false;
20010 cp_parser_flags flags
= CP_PARSER_FLAGS_OPTIONAL
;
20011 cp_token
*start_token
= NULL
;
20013 /* Clear the TYPE_SPECIFIER_SEQ. */
20014 clear_decl_specs (type_specifier_seq
);
20016 /* In the context of a trailing return type, enum E { } is an
20017 elaborated-type-specifier followed by a function-body, not an
20019 if (is_trailing_return
)
20020 flags
|= CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
;
20022 /* Parse the type-specifiers and attributes. */
20025 tree type_specifier
;
20026 bool is_cv_qualifier
;
20028 /* Check for attributes first. */
20029 if (cp_next_tokens_can_be_attribute_p (parser
))
20031 type_specifier_seq
->attributes
=
20032 chainon (type_specifier_seq
->attributes
,
20033 cp_parser_attributes_opt (parser
));
20037 /* record the token of the beginning of the type specifier seq,
20038 for error reporting purposes*/
20040 start_token
= cp_lexer_peek_token (parser
->lexer
);
20042 /* Look for the type-specifier. */
20043 type_specifier
= cp_parser_type_specifier (parser
,
20045 type_specifier_seq
,
20046 /*is_declaration=*/false,
20049 if (!type_specifier
)
20051 /* If the first type-specifier could not be found, this is not a
20052 type-specifier-seq at all. */
20053 if (!seen_type_specifier
)
20055 /* Set in_declarator_p to avoid skipping to the semicolon. */
20056 int in_decl
= parser
->in_declarator_p
;
20057 parser
->in_declarator_p
= true;
20059 if (cp_parser_uncommitted_to_tentative_parse_p (parser
)
20060 || !cp_parser_parse_and_diagnose_invalid_type_name (parser
))
20061 cp_parser_error (parser
, "expected type-specifier");
20063 parser
->in_declarator_p
= in_decl
;
20065 type_specifier_seq
->type
= error_mark_node
;
20068 /* If subsequent type-specifiers could not be found, the
20069 type-specifier-seq is complete. */
20073 seen_type_specifier
= true;
20074 /* The standard says that a condition can be:
20076 type-specifier-seq declarator = assignment-expression
20083 we should treat the "S" as a declarator, not as a
20084 type-specifier. The standard doesn't say that explicitly for
20085 type-specifier-seq, but it does say that for
20086 decl-specifier-seq in an ordinary declaration. Perhaps it
20087 would be clearer just to allow a decl-specifier-seq here, and
20088 then add a semantic restriction that if any decl-specifiers
20089 that are not type-specifiers appear, the program is invalid. */
20090 if (is_declaration
&& !is_cv_qualifier
)
20091 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
20095 /* Return whether the function currently being declared has an associated
20096 template parameter list. */
20099 function_being_declared_is_template_p (cp_parser
* parser
)
20101 if (!current_template_parms
|| processing_template_parmlist
)
20104 if (parser
->implicit_template_scope
)
20107 if (at_class_scope_p ()
20108 && TYPE_BEING_DEFINED (current_class_type
))
20109 return parser
->num_template_parameter_lists
!= 0;
20111 return ((int) parser
->num_template_parameter_lists
> template_class_depth
20112 (current_class_type
));
20115 /* Parse a parameter-declaration-clause.
20117 parameter-declaration-clause:
20118 parameter-declaration-list [opt] ... [opt]
20119 parameter-declaration-list , ...
20121 Returns a representation for the parameter declarations. A return
20122 value of NULL indicates a parameter-declaration-clause consisting
20123 only of an ellipsis. */
20126 cp_parser_parameter_declaration_clause (cp_parser
* parser
)
20135 int auto_is_implicit_function_template_parm_p
;
20137 parser
->auto_is_implicit_function_template_parm_p
20138 = auto_is_implicit_function_template_parm_p
;
20140 } cleanup
= { parser
, parser
->auto_is_implicit_function_template_parm_p
};
20144 if (!processing_specialization
20145 && !processing_template_parmlist
20146 && !processing_explicit_instantiation
)
20147 if (!current_function_decl
20148 || (current_class_type
&& LAMBDA_TYPE_P (current_class_type
)))
20149 parser
->auto_is_implicit_function_template_parm_p
= true;
20151 /* Peek at the next token. */
20152 token
= cp_lexer_peek_token (parser
->lexer
);
20153 /* Check for trivial parameter-declaration-clauses. */
20154 if (token
->type
== CPP_ELLIPSIS
)
20156 /* Consume the `...' token. */
20157 cp_lexer_consume_token (parser
->lexer
);
20160 else if (token
->type
== CPP_CLOSE_PAREN
)
20161 /* There are no parameters. */
20163 #ifndef NO_IMPLICIT_EXTERN_C
20164 if (in_system_header_at (input_location
)
20165 && current_class_type
== NULL
20166 && current_lang_name
== lang_name_c
)
20170 return void_list_node
;
20172 /* Check for `(void)', too, which is a special case. */
20173 else if (token
->keyword
== RID_VOID
20174 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
20175 == CPP_CLOSE_PAREN
))
20177 /* Consume the `void' token. */
20178 cp_lexer_consume_token (parser
->lexer
);
20179 /* There are no parameters. */
20180 return void_list_node
;
20183 /* Parse the parameter-declaration-list. */
20184 parameters
= cp_parser_parameter_declaration_list (parser
, &is_error
);
20185 /* If a parse error occurred while parsing the
20186 parameter-declaration-list, then the entire
20187 parameter-declaration-clause is erroneous. */
20191 /* Peek at the next token. */
20192 token
= cp_lexer_peek_token (parser
->lexer
);
20193 /* If it's a `,', the clause should terminate with an ellipsis. */
20194 if (token
->type
== CPP_COMMA
)
20196 /* Consume the `,'. */
20197 cp_lexer_consume_token (parser
->lexer
);
20198 /* Expect an ellipsis. */
20200 = (cp_parser_require (parser
, CPP_ELLIPSIS
, RT_ELLIPSIS
) != NULL
);
20202 /* It might also be `...' if the optional trailing `,' was
20204 else if (token
->type
== CPP_ELLIPSIS
)
20206 /* Consume the `...' token. */
20207 cp_lexer_consume_token (parser
->lexer
);
20208 /* And remember that we saw it. */
20212 ellipsis_p
= false;
20214 /* Finish the parameter list. */
20216 parameters
= chainon (parameters
, void_list_node
);
20221 /* Parse a parameter-declaration-list.
20223 parameter-declaration-list:
20224 parameter-declaration
20225 parameter-declaration-list , parameter-declaration
20227 Returns a representation of the parameter-declaration-list, as for
20228 cp_parser_parameter_declaration_clause. However, the
20229 `void_list_node' is never appended to the list. Upon return,
20230 *IS_ERROR will be true iff an error occurred. */
20233 cp_parser_parameter_declaration_list (cp_parser
* parser
, bool *is_error
)
20235 tree parameters
= NULL_TREE
;
20236 tree
*tail
= ¶meters
;
20237 bool saved_in_unbraced_linkage_specification_p
;
20240 /* Assume all will go well. */
20242 /* The special considerations that apply to a function within an
20243 unbraced linkage specifications do not apply to the parameters
20244 to the function. */
20245 saved_in_unbraced_linkage_specification_p
20246 = parser
->in_unbraced_linkage_specification_p
;
20247 parser
->in_unbraced_linkage_specification_p
= false;
20249 /* Look for more parameters. */
20252 cp_parameter_declarator
*parameter
;
20253 tree decl
= error_mark_node
;
20254 bool parenthesized_p
= false;
20255 int template_parm_idx
= (function_being_declared_is_template_p (parser
)?
20256 TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
20257 (current_template_parms
)) : 0);
20259 /* Parse the parameter. */
20261 = cp_parser_parameter_declaration (parser
,
20262 /*template_parm_p=*/false,
20265 /* We don't know yet if the enclosing context is deprecated, so wait
20266 and warn in grokparms if appropriate. */
20267 deprecated_state
= DEPRECATED_SUPPRESS
;
20271 /* If a function parameter pack was specified and an implicit template
20272 parameter was introduced during cp_parser_parameter_declaration,
20273 change any implicit parameters introduced into packs. */
20274 if (parser
->implicit_template_parms
20275 && parameter
->declarator
20276 && parameter
->declarator
->parameter_pack_p
)
20278 int latest_template_parm_idx
= TREE_VEC_LENGTH
20279 (INNERMOST_TEMPLATE_PARMS (current_template_parms
));
20281 if (latest_template_parm_idx
!= template_parm_idx
)
20282 parameter
->decl_specifiers
.type
= convert_generic_types_to_packs
20283 (parameter
->decl_specifiers
.type
,
20284 template_parm_idx
, latest_template_parm_idx
);
20287 decl
= grokdeclarator (parameter
->declarator
,
20288 ¶meter
->decl_specifiers
,
20290 parameter
->default_argument
!= NULL_TREE
,
20291 ¶meter
->decl_specifiers
.attributes
);
20294 deprecated_state
= DEPRECATED_NORMAL
;
20296 /* If a parse error occurred parsing the parameter declaration,
20297 then the entire parameter-declaration-list is erroneous. */
20298 if (decl
== error_mark_node
)
20301 parameters
= error_mark_node
;
20305 if (parameter
->decl_specifiers
.attributes
)
20306 cplus_decl_attributes (&decl
,
20307 parameter
->decl_specifiers
.attributes
,
20309 if (DECL_NAME (decl
))
20310 decl
= pushdecl (decl
);
20312 if (decl
!= error_mark_node
)
20314 retrofit_lang_decl (decl
);
20315 DECL_PARM_INDEX (decl
) = ++index
;
20316 DECL_PARM_LEVEL (decl
) = function_parm_depth ();
20319 /* Add the new parameter to the list. */
20320 *tail
= build_tree_list (parameter
->default_argument
, decl
);
20321 tail
= &TREE_CHAIN (*tail
);
20323 /* Peek at the next token. */
20324 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
20325 || cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
20326 /* These are for Objective-C++ */
20327 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
20328 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
20329 /* The parameter-declaration-list is complete. */
20331 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
20335 /* Peek at the next token. */
20336 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
20337 /* If it's an ellipsis, then the list is complete. */
20338 if (token
->type
== CPP_ELLIPSIS
)
20340 /* Otherwise, there must be more parameters. Consume the
20342 cp_lexer_consume_token (parser
->lexer
);
20343 /* When parsing something like:
20345 int i(float f, double d)
20347 we can tell after seeing the declaration for "f" that we
20348 are not looking at an initialization of a variable "i",
20349 but rather at the declaration of a function "i".
20351 Due to the fact that the parsing of template arguments
20352 (as specified to a template-id) requires backtracking we
20353 cannot use this technique when inside a template argument
20355 if (!parser
->in_template_argument_list_p
20356 && !parser
->in_type_id_in_expr_p
20357 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
20358 /* However, a parameter-declaration of the form
20359 "float(f)" (which is a valid declaration of a
20360 parameter "f") can also be interpreted as an
20361 expression (the conversion of "f" to "float"). */
20362 && !parenthesized_p
)
20363 cp_parser_commit_to_tentative_parse (parser
);
20367 cp_parser_error (parser
, "expected %<,%> or %<...%>");
20368 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
20369 cp_parser_skip_to_closing_parenthesis (parser
,
20370 /*recovering=*/true,
20371 /*or_comma=*/false,
20372 /*consume_paren=*/false);
20377 parser
->in_unbraced_linkage_specification_p
20378 = saved_in_unbraced_linkage_specification_p
;
20380 /* Reset implicit_template_scope if we are about to leave the function
20381 parameter list that introduced it. Note that for out-of-line member
20382 definitions, there will be one or more class scopes before we get to
20383 the template parameter scope. */
20385 if (cp_binding_level
*its
= parser
->implicit_template_scope
)
20386 if (cp_binding_level
*maybe_its
= current_binding_level
->level_chain
)
20388 while (maybe_its
->kind
== sk_class
)
20389 maybe_its
= maybe_its
->level_chain
;
20390 if (maybe_its
== its
)
20392 parser
->implicit_template_parms
= 0;
20393 parser
->implicit_template_scope
= 0;
20400 /* Parse a parameter declaration.
20402 parameter-declaration:
20403 decl-specifier-seq ... [opt] declarator
20404 decl-specifier-seq declarator = assignment-expression
20405 decl-specifier-seq ... [opt] abstract-declarator [opt]
20406 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20408 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20409 declares a template parameter. (In that case, a non-nested `>'
20410 token encountered during the parsing of the assignment-expression
20411 is not interpreted as a greater-than operator.)
20413 Returns a representation of the parameter, or NULL if an error
20414 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20415 true iff the declarator is of the form "(p)". */
20417 static cp_parameter_declarator
*
20418 cp_parser_parameter_declaration (cp_parser
*parser
,
20419 bool template_parm_p
,
20420 bool *parenthesized_p
)
20422 int declares_class_or_enum
;
20423 cp_decl_specifier_seq decl_specifiers
;
20424 cp_declarator
*declarator
;
20425 tree default_argument
;
20426 cp_token
*token
= NULL
, *declarator_token_start
= NULL
;
20427 const char *saved_message
;
20428 bool template_parameter_pack_p
= false;
20430 /* In a template parameter, `>' is not an operator.
20434 When parsing a default template-argument for a non-type
20435 template-parameter, the first non-nested `>' is taken as the end
20436 of the template parameter-list rather than a greater-than
20439 /* Type definitions may not appear in parameter types. */
20440 saved_message
= parser
->type_definition_forbidden_message
;
20441 parser
->type_definition_forbidden_message
20442 = G_("types may not be defined in parameter types");
20444 /* Parse the declaration-specifiers. */
20445 cp_parser_decl_specifier_seq (parser
,
20446 CP_PARSER_FLAGS_NONE
,
20448 &declares_class_or_enum
);
20450 /* Complain about missing 'typename' or other invalid type names. */
20451 if (!decl_specifiers
.any_type_specifiers_p
20452 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
20453 decl_specifiers
.type
= error_mark_node
;
20455 /* If an error occurred, there's no reason to attempt to parse the
20456 rest of the declaration. */
20457 if (cp_parser_error_occurred (parser
))
20459 parser
->type_definition_forbidden_message
= saved_message
;
20463 /* Peek at the next token. */
20464 token
= cp_lexer_peek_token (parser
->lexer
);
20466 /* If the next token is a `)', `,', `=', `>', or `...', then there
20467 is no declarator. However, when variadic templates are enabled,
20468 there may be a declarator following `...'. */
20469 if (token
->type
== CPP_CLOSE_PAREN
20470 || token
->type
== CPP_COMMA
20471 || token
->type
== CPP_EQ
20472 || token
->type
== CPP_GREATER
)
20475 if (parenthesized_p
)
20476 *parenthesized_p
= false;
20478 /* Otherwise, there should be a declarator. */
20481 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
20482 parser
->default_arg_ok_p
= false;
20484 /* After seeing a decl-specifier-seq, if the next token is not a
20485 "(", there is no possibility that the code is a valid
20486 expression. Therefore, if parsing tentatively, we commit at
20488 if (!parser
->in_template_argument_list_p
20489 /* In an expression context, having seen:
20493 we cannot be sure whether we are looking at a
20494 function-type (taking a "char" as a parameter) or a cast
20495 of some object of type "char" to "int". */
20496 && !parser
->in_type_id_in_expr_p
20497 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
20498 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
20499 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
20500 cp_parser_commit_to_tentative_parse (parser
);
20501 /* Parse the declarator. */
20502 declarator_token_start
= token
;
20503 declarator
= cp_parser_declarator (parser
,
20504 CP_PARSER_DECLARATOR_EITHER
,
20505 /*ctor_dtor_or_conv_p=*/NULL
,
20507 /*member_p=*/false,
20508 /*friend_p=*/false);
20509 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
20510 /* After the declarator, allow more attributes. */
20511 decl_specifiers
.attributes
20512 = chainon (decl_specifiers
.attributes
,
20513 cp_parser_attributes_opt (parser
));
20515 /* If the declarator is a template parameter pack, remember that and
20516 clear the flag in the declarator itself so we don't get errors
20517 from grokdeclarator. */
20518 if (template_parm_p
&& declarator
&& declarator
->parameter_pack_p
)
20520 declarator
->parameter_pack_p
= false;
20521 template_parameter_pack_p
= true;
20525 /* If the next token is an ellipsis, and we have not seen a declarator
20526 name, and if either the type of the declarator contains parameter
20527 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20528 for, eg, abbreviated integral type names), then we actually have a
20529 parameter pack expansion expression. Otherwise, leave the ellipsis
20530 for a C-style variadic function. */
20531 token
= cp_lexer_peek_token (parser
->lexer
);
20532 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
20534 tree type
= decl_specifiers
.type
;
20536 if (type
&& DECL_P (type
))
20537 type
= TREE_TYPE (type
);
20540 && TREE_CODE (type
) != TYPE_PACK_EXPANSION
20541 && (template_parm_p
|| uses_parameter_packs (type
)))
20542 || (!type
&& template_parm_p
))
20543 && declarator_can_be_parameter_pack (declarator
))
20545 /* Consume the `...'. */
20546 cp_lexer_consume_token (parser
->lexer
);
20547 maybe_warn_variadic_templates ();
20549 /* Build a pack expansion type */
20550 if (template_parm_p
)
20551 template_parameter_pack_p
= true;
20552 else if (declarator
)
20553 declarator
->parameter_pack_p
= true;
20555 decl_specifiers
.type
= make_pack_expansion (type
);
20559 /* The restriction on defining new types applies only to the type
20560 of the parameter, not to the default argument. */
20561 parser
->type_definition_forbidden_message
= saved_message
;
20563 /* If the next token is `=', then process a default argument. */
20564 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
20566 tree type
= decl_specifiers
.type
;
20567 token
= cp_lexer_peek_token (parser
->lexer
);
20568 /* If we are defining a class, then the tokens that make up the
20569 default argument must be saved and processed later. */
20570 if (!template_parm_p
&& at_class_scope_p ()
20571 && TYPE_BEING_DEFINED (current_class_type
)
20572 && !LAMBDA_TYPE_P (current_class_type
))
20573 default_argument
= cp_parser_cache_defarg (parser
, /*nsdmi=*/false);
20575 // A constrained-type-specifier may declare a type template-parameter.
20576 else if (declares_constrained_type_template_parameter (type
))
20578 = cp_parser_default_type_template_argument (parser
);
20580 // A constrained-type-specifier may declare a template-template-parameter.
20581 else if (declares_constrained_template_template_parameter (type
))
20583 = cp_parser_default_template_template_argument (parser
);
20585 /* Outside of a class definition, we can just parse the
20586 assignment-expression. */
20589 = cp_parser_default_argument (parser
, template_parm_p
);
20591 if (!parser
->default_arg_ok_p
)
20593 permerror (token
->location
,
20594 "default arguments are only "
20595 "permitted for function parameters");
20597 else if ((declarator
&& declarator
->parameter_pack_p
)
20598 || template_parameter_pack_p
20599 || (decl_specifiers
.type
20600 && PACK_EXPANSION_P (decl_specifiers
.type
)))
20602 /* Find the name of the parameter pack. */
20603 cp_declarator
*id_declarator
= declarator
;
20604 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
20605 id_declarator
= id_declarator
->declarator
;
20607 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
20608 error_at (declarator_token_start
->location
,
20610 ? G_("template parameter pack %qD "
20611 "cannot have a default argument")
20612 : G_("parameter pack %qD cannot have "
20613 "a default argument"),
20614 id_declarator
->u
.id
.unqualified_name
);
20616 error_at (declarator_token_start
->location
,
20618 ? G_("template parameter pack cannot have "
20619 "a default argument")
20620 : G_("parameter pack cannot have a "
20621 "default argument"));
20623 default_argument
= NULL_TREE
;
20627 default_argument
= NULL_TREE
;
20629 return make_parameter_declarator (&decl_specifiers
,
20632 template_parameter_pack_p
);
20635 /* Parse a default argument and return it.
20637 TEMPLATE_PARM_P is true if this is a default argument for a
20638 non-type template parameter. */
20640 cp_parser_default_argument (cp_parser
*parser
, bool template_parm_p
)
20642 tree default_argument
= NULL_TREE
;
20643 bool saved_greater_than_is_operator_p
;
20644 bool saved_local_variables_forbidden_p
;
20645 bool non_constant_p
, is_direct_init
;
20647 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20649 saved_greater_than_is_operator_p
= parser
->greater_than_is_operator_p
;
20650 parser
->greater_than_is_operator_p
= !template_parm_p
;
20651 /* Local variable names (and the `this' keyword) may not
20652 appear in a default argument. */
20653 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
20654 parser
->local_variables_forbidden_p
= true;
20655 /* Parse the assignment-expression. */
20656 if (template_parm_p
)
20657 push_deferring_access_checks (dk_no_deferred
);
20658 tree saved_class_ptr
= NULL_TREE
;
20659 tree saved_class_ref
= NULL_TREE
;
20660 /* The "this" pointer is not valid in a default argument. */
20663 saved_class_ptr
= current_class_ptr
;
20664 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
20665 saved_class_ref
= current_class_ref
;
20666 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
20669 = cp_parser_initializer (parser
, &is_direct_init
, &non_constant_p
);
20670 /* Restore the "this" pointer. */
20673 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
20674 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
20676 if (BRACE_ENCLOSED_INITIALIZER_P (default_argument
))
20677 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
20678 if (template_parm_p
)
20679 pop_deferring_access_checks ();
20680 parser
->greater_than_is_operator_p
= saved_greater_than_is_operator_p
;
20681 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
20683 return default_argument
;
20686 /* Parse a function-body.
20689 compound_statement */
20692 cp_parser_function_body (cp_parser
*parser
, bool in_function_try_block
)
20694 cp_parser_compound_statement (parser
, NULL
, (in_function_try_block
20695 ? BCS_TRY_BLOCK
: BCS_NORMAL
),
20699 /* Parse a ctor-initializer-opt followed by a function-body. Return
20700 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20701 is true we are parsing a function-try-block. */
20704 cp_parser_ctor_initializer_opt_and_function_body (cp_parser
*parser
,
20705 bool in_function_try_block
)
20708 bool ctor_initializer_p
;
20709 const bool check_body_p
=
20710 DECL_CONSTRUCTOR_P (current_function_decl
)
20711 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
);
20714 /* Begin the function body. */
20715 body
= begin_function_body ();
20716 /* Parse the optional ctor-initializer. */
20717 ctor_initializer_p
= cp_parser_ctor_initializer_opt (parser
);
20719 /* If we're parsing a constexpr constructor definition, we need
20720 to check that the constructor body is indeed empty. However,
20721 before we get to cp_parser_function_body lot of junk has been
20722 generated, so we can't just check that we have an empty block.
20723 Rather we take a snapshot of the outermost block, and check whether
20724 cp_parser_function_body changed its state. */
20727 list
= cur_stmt_list
;
20728 if (STATEMENT_LIST_TAIL (list
))
20729 last
= STATEMENT_LIST_TAIL (list
)->stmt
;
20731 /* Parse the function-body. */
20732 cp_parser_function_body (parser
, in_function_try_block
);
20734 check_constexpr_ctor_body (last
, list
, /*complain=*/true);
20735 /* Finish the function body. */
20736 finish_function_body (body
);
20738 return ctor_initializer_p
;
20741 /* Parse an initializer.
20744 = initializer-clause
20745 ( expression-list )
20747 Returns an expression representing the initializer. If no
20748 initializer is present, NULL_TREE is returned.
20750 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20751 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20752 set to TRUE if there is no initializer present. If there is an
20753 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20754 is set to true; otherwise it is set to false. */
20757 cp_parser_initializer (cp_parser
* parser
, bool* is_direct_init
,
20758 bool* non_constant_p
)
20763 /* Peek at the next token. */
20764 token
= cp_lexer_peek_token (parser
->lexer
);
20766 /* Let our caller know whether or not this initializer was
20768 *is_direct_init
= (token
->type
!= CPP_EQ
);
20769 /* Assume that the initializer is constant. */
20770 *non_constant_p
= false;
20772 if (token
->type
== CPP_EQ
)
20774 /* Consume the `='. */
20775 cp_lexer_consume_token (parser
->lexer
);
20776 /* Parse the initializer-clause. */
20777 init
= cp_parser_initializer_clause (parser
, non_constant_p
);
20779 else if (token
->type
== CPP_OPEN_PAREN
)
20781 vec
<tree
, va_gc
> *vec
;
20782 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
20784 /*allow_expansion_p=*/true,
20787 return error_mark_node
;
20788 init
= build_tree_list_vec (vec
);
20789 release_tree_vector (vec
);
20791 else if (token
->type
== CPP_OPEN_BRACE
)
20793 cp_lexer_set_source_position (parser
->lexer
);
20794 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
20795 init
= cp_parser_braced_list (parser
, non_constant_p
);
20796 CONSTRUCTOR_IS_DIRECT_INIT (init
) = 1;
20800 /* Anything else is an error. */
20801 cp_parser_error (parser
, "expected initializer");
20802 init
= error_mark_node
;
20805 if (check_for_bare_parameter_packs (init
))
20806 init
= error_mark_node
;
20811 /* Parse an initializer-clause.
20813 initializer-clause:
20814 assignment-expression
20817 Returns an expression representing the initializer.
20819 If the `assignment-expression' production is used the value
20820 returned is simply a representation for the expression.
20822 Otherwise, calls cp_parser_braced_list. */
20825 cp_parser_initializer_clause (cp_parser
* parser
, bool* non_constant_p
)
20827 cp_expr initializer
;
20829 /* Assume the expression is constant. */
20830 *non_constant_p
= false;
20832 /* If it is not a `{', then we are looking at an
20833 assignment-expression. */
20834 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
20837 = cp_parser_constant_expression (parser
,
20838 /*allow_non_constant_p=*/true,
20842 initializer
= cp_parser_braced_list (parser
, non_constant_p
);
20844 return initializer
;
20847 /* Parse a brace-enclosed initializer list.
20850 { initializer-list , [opt] }
20853 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20854 the elements of the initializer-list (or NULL, if the last
20855 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20856 NULL_TREE. There is no way to detect whether or not the optional
20857 trailing `,' was provided. NON_CONSTANT_P is as for
20858 cp_parser_initializer. */
20861 cp_parser_braced_list (cp_parser
* parser
, bool* non_constant_p
)
20864 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
20866 /* Consume the `{' token. */
20867 cp_lexer_consume_token (parser
->lexer
);
20868 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20869 initializer
= make_node (CONSTRUCTOR
);
20870 /* If it's not a `}', then there is a non-trivial initializer. */
20871 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
20873 /* Parse the initializer list. */
20874 CONSTRUCTOR_ELTS (initializer
)
20875 = cp_parser_initializer_list (parser
, non_constant_p
);
20876 /* A trailing `,' token is allowed. */
20877 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
20878 cp_lexer_consume_token (parser
->lexer
);
20881 *non_constant_p
= false;
20882 /* Now, there should be a trailing `}'. */
20883 location_t finish_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
20884 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
20885 TREE_TYPE (initializer
) = init_list_type_node
;
20887 cp_expr
result (initializer
);
20888 /* Build a location of the form:
20891 with caret==start at the open brace, finish at the close brace. */
20892 location_t combined_loc
= make_location (start_loc
, start_loc
, finish_loc
);
20893 result
.set_location (combined_loc
);
20897 /* Consume tokens up to, and including, the next non-nested closing `]'.
20898 Returns true iff we found a closing `]'. */
20901 cp_parser_skip_to_closing_square_bracket (cp_parser
*parser
)
20903 unsigned square_depth
= 0;
20907 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
20909 switch (token
->type
)
20912 case CPP_PRAGMA_EOL
:
20913 /* If we've run out of tokens, then there is no closing `]'. */
20916 case CPP_OPEN_SQUARE
:
20920 case CPP_CLOSE_SQUARE
:
20921 if (!square_depth
--)
20923 cp_lexer_consume_token (parser
->lexer
);
20932 /* Consume the token. */
20933 cp_lexer_consume_token (parser
->lexer
);
20937 /* Return true if we are looking at an array-designator, false otherwise. */
20940 cp_parser_array_designator_p (cp_parser
*parser
)
20942 /* Consume the `['. */
20943 cp_lexer_consume_token (parser
->lexer
);
20945 cp_lexer_save_tokens (parser
->lexer
);
20947 /* Skip tokens until the next token is a closing square bracket.
20948 If we find the closing `]', and the next token is a `=', then
20949 we are looking at an array designator. */
20950 bool array_designator_p
20951 = (cp_parser_skip_to_closing_square_bracket (parser
)
20952 && cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
));
20954 /* Roll back the tokens we skipped. */
20955 cp_lexer_rollback_tokens (parser
->lexer
);
20957 return array_designator_p
;
20960 /* Parse an initializer-list.
20963 initializer-clause ... [opt]
20964 initializer-list , initializer-clause ... [opt]
20969 designation initializer-clause ...[opt]
20970 initializer-list , designation initializer-clause ...[opt]
20975 [ constant-expression ] =
20977 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20978 for the initializer. If the INDEX of the elt is non-NULL, it is the
20979 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20980 as for cp_parser_initializer. */
20982 static vec
<constructor_elt
, va_gc
> *
20983 cp_parser_initializer_list (cp_parser
* parser
, bool* non_constant_p
)
20985 vec
<constructor_elt
, va_gc
> *v
= NULL
;
20987 /* Assume all of the expressions are constant. */
20988 *non_constant_p
= false;
20990 /* Parse the rest of the list. */
20996 bool clause_non_constant_p
;
20998 /* If the next token is an identifier and the following one is a
20999 colon, we are looking at the GNU designated-initializer
21001 if (cp_parser_allow_gnu_extensions_p (parser
)
21002 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
21003 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
21005 /* Warn the user that they are using an extension. */
21006 pedwarn (input_location
, OPT_Wpedantic
,
21007 "ISO C++ does not allow designated initializers");
21008 /* Consume the identifier. */
21009 designator
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
21010 /* Consume the `:'. */
21011 cp_lexer_consume_token (parser
->lexer
);
21013 /* Also handle the C99 syntax, '. id ='. */
21014 else if (cp_parser_allow_gnu_extensions_p (parser
)
21015 && cp_lexer_next_token_is (parser
->lexer
, CPP_DOT
)
21016 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_NAME
21017 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_EQ
)
21019 /* Warn the user that they are using an extension. */
21020 pedwarn (input_location
, OPT_Wpedantic
,
21021 "ISO C++ does not allow C99 designated initializers");
21022 /* Consume the `.'. */
21023 cp_lexer_consume_token (parser
->lexer
);
21024 /* Consume the identifier. */
21025 designator
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
21026 /* Consume the `='. */
21027 cp_lexer_consume_token (parser
->lexer
);
21029 /* Also handle C99 array designators, '[ const ] ='. */
21030 else if (cp_parser_allow_gnu_extensions_p (parser
)
21031 && !c_dialect_objc ()
21032 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
21034 /* In C++11, [ could start a lambda-introducer. */
21035 bool non_const
= false;
21037 cp_parser_parse_tentatively (parser
);
21039 if (!cp_parser_array_designator_p (parser
))
21041 cp_parser_simulate_error (parser
);
21042 designator
= NULL_TREE
;
21046 designator
= cp_parser_constant_expression (parser
, true,
21048 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
21049 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
21052 if (!cp_parser_parse_definitely (parser
))
21053 designator
= NULL_TREE
;
21054 else if (non_const
)
21055 require_potential_rvalue_constant_expression (designator
);
21058 designator
= NULL_TREE
;
21060 /* Parse the initializer. */
21061 initializer
= cp_parser_initializer_clause (parser
,
21062 &clause_non_constant_p
);
21063 /* If any clause is non-constant, so is the entire initializer. */
21064 if (clause_non_constant_p
)
21065 *non_constant_p
= true;
21067 /* If we have an ellipsis, this is an initializer pack
21069 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
21071 /* Consume the `...'. */
21072 cp_lexer_consume_token (parser
->lexer
);
21074 /* Turn the initializer into an initializer expansion. */
21075 initializer
= make_pack_expansion (initializer
);
21078 /* Add it to the vector. */
21079 CONSTRUCTOR_APPEND_ELT (v
, designator
, initializer
);
21081 /* If the next token is not a comma, we have reached the end of
21083 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
21086 /* Peek at the next token. */
21087 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
21088 /* If the next token is a `}', then we're still done. An
21089 initializer-clause can have a trailing `,' after the
21090 initializer-list and before the closing `}'. */
21091 if (token
->type
== CPP_CLOSE_BRACE
)
21094 /* Consume the `,' token. */
21095 cp_lexer_consume_token (parser
->lexer
);
21101 /* Classes [gram.class] */
21103 /* Parse a class-name.
21109 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21110 to indicate that names looked up in dependent types should be
21111 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21112 keyword has been used to indicate that the name that appears next
21113 is a template. TAG_TYPE indicates the explicit tag given before
21114 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21115 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21116 is the class being defined in a class-head. If ENUM_OK is TRUE,
21117 enum-names are also accepted.
21119 Returns the TYPE_DECL representing the class. */
21122 cp_parser_class_name (cp_parser
*parser
,
21123 bool typename_keyword_p
,
21124 bool template_keyword_p
,
21125 enum tag_types tag_type
,
21126 bool check_dependency_p
,
21128 bool is_declaration
,
21135 tree identifier
= NULL_TREE
;
21137 /* All class-names start with an identifier. */
21138 token
= cp_lexer_peek_token (parser
->lexer
);
21139 if (token
->type
!= CPP_NAME
&& token
->type
!= CPP_TEMPLATE_ID
)
21141 cp_parser_error (parser
, "expected class-name");
21142 return error_mark_node
;
21145 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21146 to a template-id, so we save it here. */
21147 scope
= parser
->scope
;
21148 if (scope
== error_mark_node
)
21149 return error_mark_node
;
21151 /* Any name names a type if we're following the `typename' keyword
21152 in a qualified name where the enclosing scope is type-dependent. */
21153 typename_p
= (typename_keyword_p
&& scope
&& TYPE_P (scope
)
21154 && dependent_type_p (scope
));
21155 /* Handle the common case (an identifier, but not a template-id)
21157 if (token
->type
== CPP_NAME
21158 && !cp_parser_nth_token_starts_template_argument_list_p (parser
, 2))
21160 cp_token
*identifier_token
;
21163 /* Look for the identifier. */
21164 identifier_token
= cp_lexer_peek_token (parser
->lexer
);
21165 ambiguous_p
= identifier_token
->error_reported
;
21166 identifier
= cp_parser_identifier (parser
);
21167 /* If the next token isn't an identifier, we are certainly not
21168 looking at a class-name. */
21169 if (identifier
== error_mark_node
)
21170 decl
= error_mark_node
;
21171 /* If we know this is a type-name, there's no need to look it
21173 else if (typename_p
)
21177 tree ambiguous_decls
;
21178 /* If we already know that this lookup is ambiguous, then
21179 we've already issued an error message; there's no reason
21183 cp_parser_simulate_error (parser
);
21184 return error_mark_node
;
21186 /* If the next token is a `::', then the name must be a type
21189 [basic.lookup.qual]
21191 During the lookup for a name preceding the :: scope
21192 resolution operator, object, function, and enumerator
21193 names are ignored. */
21194 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
21195 tag_type
= scope_type
;
21196 /* Look up the name. */
21197 decl
= cp_parser_lookup_name (parser
, identifier
,
21199 /*is_template=*/false,
21200 /*is_namespace=*/false,
21201 check_dependency_p
,
21203 identifier_token
->location
);
21204 if (ambiguous_decls
)
21206 if (cp_parser_parsing_tentatively (parser
))
21207 cp_parser_simulate_error (parser
);
21208 return error_mark_node
;
21214 /* Try a template-id. */
21215 decl
= cp_parser_template_id (parser
, template_keyword_p
,
21216 check_dependency_p
,
21219 if (decl
== error_mark_node
)
21220 return error_mark_node
;
21223 decl
= cp_parser_maybe_treat_template_as_class (decl
, class_head_p
);
21225 /* If this is a typename, create a TYPENAME_TYPE. */
21226 if (typename_p
&& decl
!= error_mark_node
)
21228 decl
= make_typename_type (scope
, decl
, typename_type
,
21229 /*complain=*/tf_error
);
21230 if (decl
!= error_mark_node
)
21231 decl
= TYPE_NAME (decl
);
21234 decl
= strip_using_decl (decl
);
21236 /* Check to see that it is really the name of a class. */
21237 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
21238 && identifier_p (TREE_OPERAND (decl
, 0))
21239 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
21240 /* Situations like this:
21242 template <typename T> struct A {
21243 typename T::template X<int>::I i;
21246 are problematic. Is `T::template X<int>' a class-name? The
21247 standard does not seem to be definitive, but there is no other
21248 valid interpretation of the following `::'. Therefore, those
21249 names are considered class-names. */
21251 decl
= make_typename_type (scope
, decl
, tag_type
, tf_error
);
21252 if (decl
!= error_mark_node
)
21253 decl
= TYPE_NAME (decl
);
21255 else if (TREE_CODE (decl
) != TYPE_DECL
21256 || TREE_TYPE (decl
) == error_mark_node
21257 || !(MAYBE_CLASS_TYPE_P (TREE_TYPE (decl
))
21258 || (enum_ok
&& TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
))
21259 /* In Objective-C 2.0, a classname followed by '.' starts a
21260 dot-syntax expression, and it's not a type-name. */
21261 || (c_dialect_objc ()
21262 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
21263 && objc_is_class_name (decl
)))
21264 decl
= error_mark_node
;
21266 if (decl
== error_mark_node
)
21267 cp_parser_error (parser
, "expected class-name");
21268 else if (identifier
&& !parser
->scope
)
21269 maybe_note_name_used_in_class (identifier
, decl
);
21274 /* Parse a class-specifier.
21277 class-head { member-specification [opt] }
21279 Returns the TREE_TYPE representing the class. */
21282 cp_parser_class_specifier_1 (cp_parser
* parser
)
21285 tree attributes
= NULL_TREE
;
21286 bool nested_name_specifier_p
;
21287 unsigned saved_num_template_parameter_lists
;
21288 bool saved_in_function_body
;
21289 unsigned char in_statement
;
21290 bool in_switch_statement_p
;
21291 bool saved_in_unbraced_linkage_specification_p
;
21292 tree old_scope
= NULL_TREE
;
21293 tree scope
= NULL_TREE
;
21294 cp_token
*closing_brace
;
21296 push_deferring_access_checks (dk_no_deferred
);
21298 /* Parse the class-head. */
21299 type
= cp_parser_class_head (parser
,
21300 &nested_name_specifier_p
);
21301 /* If the class-head was a semantic disaster, skip the entire body
21305 cp_parser_skip_to_end_of_block_or_statement (parser
);
21306 pop_deferring_access_checks ();
21307 return error_mark_node
;
21310 /* Look for the `{'. */
21311 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
21313 pop_deferring_access_checks ();
21314 return error_mark_node
;
21317 cp_ensure_no_omp_declare_simd (parser
);
21318 cp_ensure_no_oacc_routine (parser
);
21320 /* Issue an error message if type-definitions are forbidden here. */
21321 cp_parser_check_type_definition (parser
);
21322 /* Remember that we are defining one more class. */
21323 ++parser
->num_classes_being_defined
;
21324 /* Inside the class, surrounding template-parameter-lists do not
21326 saved_num_template_parameter_lists
21327 = parser
->num_template_parameter_lists
;
21328 parser
->num_template_parameter_lists
= 0;
21329 /* We are not in a function body. */
21330 saved_in_function_body
= parser
->in_function_body
;
21331 parser
->in_function_body
= false;
21332 /* Or in a loop. */
21333 in_statement
= parser
->in_statement
;
21334 parser
->in_statement
= 0;
21335 /* Or in a switch. */
21336 in_switch_statement_p
= parser
->in_switch_statement_p
;
21337 parser
->in_switch_statement_p
= false;
21338 /* We are not immediately inside an extern "lang" block. */
21339 saved_in_unbraced_linkage_specification_p
21340 = parser
->in_unbraced_linkage_specification_p
;
21341 parser
->in_unbraced_linkage_specification_p
= false;
21343 // Associate constraints with the type.
21345 type
= associate_classtype_constraints (type
);
21347 /* Start the class. */
21348 if (nested_name_specifier_p
)
21350 scope
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (type
));
21351 old_scope
= push_inner_scope (scope
);
21353 type
= begin_class_definition (type
);
21355 if (type
== error_mark_node
)
21356 /* If the type is erroneous, skip the entire body of the class. */
21357 cp_parser_skip_to_closing_brace (parser
);
21359 /* Parse the member-specification. */
21360 cp_parser_member_specification_opt (parser
);
21362 /* Look for the trailing `}'. */
21363 closing_brace
= cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
21364 /* Look for trailing attributes to apply to this class. */
21365 if (cp_parser_allow_gnu_extensions_p (parser
))
21366 attributes
= cp_parser_gnu_attributes_opt (parser
);
21367 if (type
!= error_mark_node
)
21368 type
= finish_struct (type
, attributes
);
21369 if (nested_name_specifier_p
)
21370 pop_inner_scope (old_scope
, scope
);
21372 /* We've finished a type definition. Check for the common syntax
21373 error of forgetting a semicolon after the definition. We need to
21374 be careful, as we can't just check for not-a-semicolon and be done
21375 with it; the user might have typed:
21377 class X { } c = ...;
21378 class X { } *p = ...;
21380 and so forth. Instead, enumerate all the possible tokens that
21381 might follow this production; if we don't see one of them, then
21382 complain and silently insert the semicolon. */
21384 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21385 bool want_semicolon
= true;
21387 if (cp_next_tokens_can_be_std_attribute_p (parser
))
21388 /* Don't try to parse c++11 attributes here. As per the
21389 grammar, that should be a task for
21390 cp_parser_decl_specifier_seq. */
21391 want_semicolon
= false;
21393 switch (token
->type
)
21396 case CPP_SEMICOLON
:
21399 case CPP_OPEN_PAREN
:
21400 case CPP_CLOSE_PAREN
:
21402 want_semicolon
= false;
21405 /* While it's legal for type qualifiers and storage class
21406 specifiers to follow type definitions in the grammar, only
21407 compiler testsuites contain code like that. Assume that if
21408 we see such code, then what we're really seeing is a case
21412 const <type> var = ...;
21417 static <type> func (...) ...
21419 i.e. the qualifier or specifier applies to the next
21420 declaration. To do so, however, we need to look ahead one
21421 more token to see if *that* token is a type specifier.
21423 This code could be improved to handle:
21426 static const <type> var = ...; */
21428 if (keyword_is_decl_specifier (token
->keyword
))
21430 cp_token
*lookahead
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
21432 /* Handling user-defined types here would be nice, but very
21435 = (lookahead
->type
== CPP_KEYWORD
21436 && keyword_begins_type_specifier (lookahead
->keyword
));
21443 /* If we don't have a type, then something is very wrong and we
21444 shouldn't try to do anything clever. Likewise for not seeing the
21446 if (closing_brace
&& TYPE_P (type
) && want_semicolon
)
21448 cp_token_position prev
21449 = cp_lexer_previous_token_position (parser
->lexer
);
21450 cp_token
*prev_token
= cp_lexer_token_at (parser
->lexer
, prev
);
21451 location_t loc
= prev_token
->location
;
21453 if (CLASSTYPE_DECLARED_CLASS (type
))
21454 error_at (loc
, "expected %<;%> after class definition");
21455 else if (TREE_CODE (type
) == RECORD_TYPE
)
21456 error_at (loc
, "expected %<;%> after struct definition");
21457 else if (TREE_CODE (type
) == UNION_TYPE
)
21458 error_at (loc
, "expected %<;%> after union definition");
21460 gcc_unreachable ();
21462 /* Unget one token and smash it to look as though we encountered
21463 a semicolon in the input stream. */
21464 cp_lexer_set_token_position (parser
->lexer
, prev
);
21465 token
= cp_lexer_peek_token (parser
->lexer
);
21466 token
->type
= CPP_SEMICOLON
;
21467 token
->keyword
= RID_MAX
;
21471 /* If this class is not itself within the scope of another class,
21472 then we need to parse the bodies of all of the queued function
21473 definitions. Note that the queued functions defined in a class
21474 are not always processed immediately following the
21475 class-specifier for that class. Consider:
21478 struct B { void f() { sizeof (A); } };
21481 If `f' were processed before the processing of `A' were
21482 completed, there would be no way to compute the size of `A'.
21483 Note that the nesting we are interested in here is lexical --
21484 not the semantic nesting given by TYPE_CONTEXT. In particular,
21487 struct A { struct B; };
21488 struct A::B { void f() { } };
21490 there is no need to delay the parsing of `A::B::f'. */
21491 if (--parser
->num_classes_being_defined
== 0)
21494 tree class_type
= NULL_TREE
;
21495 tree pushed_scope
= NULL_TREE
;
21497 cp_default_arg_entry
*e
;
21498 tree save_ccp
, save_ccr
;
21500 /* In a first pass, parse default arguments to the functions.
21501 Then, in a second pass, parse the bodies of the functions.
21502 This two-phased approach handles cases like:
21510 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_default_args
, ix
, e
)
21513 /* If there are default arguments that have not yet been processed,
21514 take care of them now. */
21515 if (class_type
!= e
->class_type
)
21518 pop_scope (pushed_scope
);
21519 class_type
= e
->class_type
;
21520 pushed_scope
= push_scope (class_type
);
21522 /* Make sure that any template parameters are in scope. */
21523 maybe_begin_member_template_processing (decl
);
21524 /* Parse the default argument expressions. */
21525 cp_parser_late_parsing_default_args (parser
, decl
);
21526 /* Remove any template parameters from the symbol table. */
21527 maybe_end_member_template_processing ();
21529 vec_safe_truncate (unparsed_funs_with_default_args
, 0);
21530 /* Now parse any NSDMIs. */
21531 save_ccp
= current_class_ptr
;
21532 save_ccr
= current_class_ref
;
21533 FOR_EACH_VEC_SAFE_ELT (unparsed_nsdmis
, ix
, decl
)
21535 if (class_type
!= DECL_CONTEXT (decl
))
21538 pop_scope (pushed_scope
);
21539 class_type
= DECL_CONTEXT (decl
);
21540 pushed_scope
= push_scope (class_type
);
21542 inject_this_parameter (class_type
, TYPE_UNQUALIFIED
);
21543 cp_parser_late_parsing_nsdmi (parser
, decl
);
21545 vec_safe_truncate (unparsed_nsdmis
, 0);
21546 current_class_ptr
= save_ccp
;
21547 current_class_ref
= save_ccr
;
21549 pop_scope (pushed_scope
);
21551 /* Now do some post-NSDMI bookkeeping. */
21552 FOR_EACH_VEC_SAFE_ELT (unparsed_classes
, ix
, class_type
)
21553 after_nsdmi_defaulted_late_checks (class_type
);
21554 vec_safe_truncate (unparsed_classes
, 0);
21555 after_nsdmi_defaulted_late_checks (type
);
21557 /* Now parse the body of the functions. */
21560 /* OpenMP UDRs need to be parsed before all other functions. */
21561 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_definitions
, ix
, decl
)
21562 if (DECL_OMP_DECLARE_REDUCTION_P (decl
))
21563 cp_parser_late_parsing_for_member (parser
, decl
);
21564 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_definitions
, ix
, decl
)
21565 if (!DECL_OMP_DECLARE_REDUCTION_P (decl
))
21566 cp_parser_late_parsing_for_member (parser
, decl
);
21569 FOR_EACH_VEC_SAFE_ELT (unparsed_funs_with_definitions
, ix
, decl
)
21570 cp_parser_late_parsing_for_member (parser
, decl
);
21571 vec_safe_truncate (unparsed_funs_with_definitions
, 0);
21574 vec_safe_push (unparsed_classes
, type
);
21576 /* Put back any saved access checks. */
21577 pop_deferring_access_checks ();
21579 /* Restore saved state. */
21580 parser
->in_switch_statement_p
= in_switch_statement_p
;
21581 parser
->in_statement
= in_statement
;
21582 parser
->in_function_body
= saved_in_function_body
;
21583 parser
->num_template_parameter_lists
21584 = saved_num_template_parameter_lists
;
21585 parser
->in_unbraced_linkage_specification_p
21586 = saved_in_unbraced_linkage_specification_p
;
21592 cp_parser_class_specifier (cp_parser
* parser
)
21595 timevar_push (TV_PARSE_STRUCT
);
21596 ret
= cp_parser_class_specifier_1 (parser
);
21597 timevar_pop (TV_PARSE_STRUCT
);
21601 /* Parse a class-head.
21604 class-key identifier [opt] base-clause [opt]
21605 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21606 class-key nested-name-specifier [opt] template-id
21609 class-virt-specifier:
21613 class-key attributes identifier [opt] base-clause [opt]
21614 class-key attributes nested-name-specifier identifier base-clause [opt]
21615 class-key attributes nested-name-specifier [opt] template-id
21618 Upon return BASES is initialized to the list of base classes (or
21619 NULL, if there are none) in the same form returned by
21620 cp_parser_base_clause.
21622 Returns the TYPE of the indicated class. Sets
21623 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21624 involving a nested-name-specifier was used, and FALSE otherwise.
21626 Returns error_mark_node if this is not a class-head.
21628 Returns NULL_TREE if the class-head is syntactically valid, but
21629 semantically invalid in a way that means we should skip the entire
21630 body of the class. */
21633 cp_parser_class_head (cp_parser
* parser
,
21634 bool* nested_name_specifier_p
)
21636 tree nested_name_specifier
;
21637 enum tag_types class_key
;
21638 tree id
= NULL_TREE
;
21639 tree type
= NULL_TREE
;
21642 cp_virt_specifiers virt_specifiers
= VIRT_SPEC_UNSPECIFIED
;
21643 bool template_id_p
= false;
21644 bool qualified_p
= false;
21645 bool invalid_nested_name_p
= false;
21646 bool invalid_explicit_specialization_p
= false;
21647 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
21648 tree pushed_scope
= NULL_TREE
;
21649 unsigned num_templates
;
21650 cp_token
*type_start_token
= NULL
, *nested_name_specifier_token_start
= NULL
;
21651 /* Assume no nested-name-specifier will be present. */
21652 *nested_name_specifier_p
= false;
21653 /* Assume no template parameter lists will be used in defining the
21656 parser
->colon_corrects_to_scope_p
= false;
21658 /* Look for the class-key. */
21659 class_key
= cp_parser_class_key (parser
);
21660 if (class_key
== none_type
)
21661 return error_mark_node
;
21663 location_t class_head_start_location
= input_location
;
21665 /* Parse the attributes. */
21666 attributes
= cp_parser_attributes_opt (parser
);
21668 /* If the next token is `::', that is invalid -- but sometimes
21669 people do try to write:
21673 Handle this gracefully by accepting the extra qualifier, and then
21674 issuing an error about it later if this really is a
21675 class-head. If it turns out just to be an elaborated type
21676 specifier, remain silent. */
21677 if (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false))
21678 qualified_p
= true;
21680 push_deferring_access_checks (dk_no_check
);
21682 /* Determine the name of the class. Begin by looking for an
21683 optional nested-name-specifier. */
21684 nested_name_specifier_token_start
= cp_lexer_peek_token (parser
->lexer
);
21685 nested_name_specifier
21686 = cp_parser_nested_name_specifier_opt (parser
,
21687 /*typename_keyword_p=*/false,
21688 /*check_dependency_p=*/false,
21690 /*is_declaration=*/false);
21691 /* If there was a nested-name-specifier, then there *must* be an
21693 if (nested_name_specifier
)
21695 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
21696 /* Although the grammar says `identifier', it really means
21697 `class-name' or `template-name'. You are only allowed to
21698 define a class that has already been declared with this
21701 The proposed resolution for Core Issue 180 says that wherever
21702 you see `class T::X' you should treat `X' as a type-name.
21704 It is OK to define an inaccessible class; for example:
21706 class A { class B; };
21709 We do not know if we will see a class-name, or a
21710 template-name. We look for a class-name first, in case the
21711 class-name is a template-id; if we looked for the
21712 template-name first we would stop after the template-name. */
21713 cp_parser_parse_tentatively (parser
);
21714 type
= cp_parser_class_name (parser
,
21715 /*typename_keyword_p=*/false,
21716 /*template_keyword_p=*/false,
21718 /*check_dependency_p=*/false,
21719 /*class_head_p=*/true,
21720 /*is_declaration=*/false);
21721 /* If that didn't work, ignore the nested-name-specifier. */
21722 if (!cp_parser_parse_definitely (parser
))
21724 invalid_nested_name_p
= true;
21725 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
21726 id
= cp_parser_identifier (parser
);
21727 if (id
== error_mark_node
)
21730 /* If we could not find a corresponding TYPE, treat this
21731 declaration like an unqualified declaration. */
21732 if (type
== error_mark_node
)
21733 nested_name_specifier
= NULL_TREE
;
21734 /* Otherwise, count the number of templates used in TYPE and its
21735 containing scopes. */
21740 for (scope
= TREE_TYPE (type
);
21741 scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
;
21742 scope
= get_containing_scope (scope
))
21744 && CLASS_TYPE_P (scope
)
21745 && CLASSTYPE_TEMPLATE_INFO (scope
)
21746 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
))
21747 && (!CLASSTYPE_TEMPLATE_SPECIALIZATION (scope
)
21748 || uses_template_parms (CLASSTYPE_TI_ARGS (scope
))))
21752 /* Otherwise, the identifier is optional. */
21755 /* We don't know whether what comes next is a template-id,
21756 an identifier, or nothing at all. */
21757 cp_parser_parse_tentatively (parser
);
21758 /* Check for a template-id. */
21759 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
21760 id
= cp_parser_template_id (parser
,
21761 /*template_keyword_p=*/false,
21762 /*check_dependency_p=*/true,
21764 /*is_declaration=*/true);
21765 /* If that didn't work, it could still be an identifier. */
21766 if (!cp_parser_parse_definitely (parser
))
21768 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
21770 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
21771 id
= cp_parser_identifier (parser
);
21778 template_id_p
= true;
21783 pop_deferring_access_checks ();
21787 cp_parser_check_for_invalid_template_id (parser
, id
,
21789 type_start_token
->location
);
21791 virt_specifiers
= cp_parser_virt_specifier_seq_opt (parser
);
21793 /* If it's not a `:' or a `{' then we can't really be looking at a
21794 class-head, since a class-head only appears as part of a
21795 class-specifier. We have to detect this situation before calling
21796 xref_tag, since that has irreversible side-effects. */
21797 if (!cp_parser_next_token_starts_class_definition_p (parser
))
21799 cp_parser_error (parser
, "expected %<{%> or %<:%>");
21800 type
= error_mark_node
;
21804 /* At this point, we're going ahead with the class-specifier, even
21805 if some other problem occurs. */
21806 cp_parser_commit_to_tentative_parse (parser
);
21807 if (virt_specifiers
& VIRT_SPEC_OVERRIDE
)
21809 cp_parser_error (parser
,
21810 "cannot specify %<override%> for a class");
21811 type
= error_mark_node
;
21814 /* Issue the error about the overly-qualified name now. */
21817 cp_parser_error (parser
,
21818 "global qualification of class name is invalid");
21819 type
= error_mark_node
;
21822 else if (invalid_nested_name_p
)
21824 cp_parser_error (parser
,
21825 "qualified name does not name a class");
21826 type
= error_mark_node
;
21829 else if (nested_name_specifier
)
21833 /* Reject typedef-names in class heads. */
21834 if (!DECL_IMPLICIT_TYPEDEF_P (type
))
21836 error_at (type_start_token
->location
,
21837 "invalid class name in declaration of %qD",
21843 /* Figure out in what scope the declaration is being placed. */
21844 scope
= current_scope ();
21845 /* If that scope does not contain the scope in which the
21846 class was originally declared, the program is invalid. */
21847 if (scope
&& !is_ancestor (scope
, nested_name_specifier
))
21849 if (at_namespace_scope_p ())
21850 error_at (type_start_token
->location
,
21851 "declaration of %qD in namespace %qD which does not "
21853 type
, scope
, nested_name_specifier
);
21855 error_at (type_start_token
->location
,
21856 "declaration of %qD in %qD which does not enclose %qD",
21857 type
, scope
, nested_name_specifier
);
21863 A declarator-id shall not be qualified except for the
21864 definition of a ... nested class outside of its class
21865 ... [or] the definition or explicit instantiation of a
21866 class member of a namespace outside of its namespace. */
21867 if (scope
== nested_name_specifier
)
21869 permerror (nested_name_specifier_token_start
->location
,
21870 "extra qualification not allowed");
21871 nested_name_specifier
= NULL_TREE
;
21875 /* An explicit-specialization must be preceded by "template <>". If
21876 it is not, try to recover gracefully. */
21877 if (at_namespace_scope_p ()
21878 && parser
->num_template_parameter_lists
== 0
21881 /* Build a location of this form:
21882 struct typename <ARGS>
21883 ^~~~~~~~~~~~~~~~~~~~~~
21884 with caret==start at the start token, and
21885 finishing at the end of the type. */
21886 location_t reported_loc
21887 = make_location (class_head_start_location
,
21888 class_head_start_location
,
21889 get_finish (type_start_token
->location
));
21890 rich_location
richloc (line_table
, reported_loc
);
21891 richloc
.add_fixit_insert (class_head_start_location
, "template <> ");
21894 "an explicit specialization must be preceded by %<template <>%>");
21895 invalid_explicit_specialization_p
= true;
21896 /* Take the same action that would have been taken by
21897 cp_parser_explicit_specialization. */
21898 ++parser
->num_template_parameter_lists
;
21899 begin_specialization ();
21901 /* There must be no "return" statements between this point and the
21902 end of this function; set "type "to the correct return value and
21903 use "goto done;" to return. */
21904 /* Make sure that the right number of template parameters were
21906 if (!cp_parser_check_template_parameters (parser
, num_templates
,
21907 type_start_token
->location
,
21908 /*declarator=*/NULL
))
21910 /* If something went wrong, there is no point in even trying to
21911 process the class-definition. */
21916 /* Look up the type. */
21919 if (TREE_CODE (id
) == TEMPLATE_ID_EXPR
21920 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id
, 0))
21921 || TREE_CODE (TREE_OPERAND (id
, 0)) == OVERLOAD
))
21923 error_at (type_start_token
->location
,
21924 "function template %qD redeclared as a class template", id
);
21925 type
= error_mark_node
;
21929 type
= TREE_TYPE (id
);
21930 type
= maybe_process_partial_specialization (type
);
21932 if (nested_name_specifier
)
21933 pushed_scope
= push_scope (nested_name_specifier
);
21935 else if (nested_name_specifier
)
21941 template <typename T> struct S { struct T };
21942 template <typename T> struct S<T>::T { };
21944 we will get a TYPENAME_TYPE when processing the definition of
21945 `S::T'. We need to resolve it to the actual type before we
21946 try to define it. */
21947 if (TREE_CODE (TREE_TYPE (type
)) == TYPENAME_TYPE
)
21949 class_type
= resolve_typename_type (TREE_TYPE (type
),
21950 /*only_current_p=*/false);
21951 if (TREE_CODE (class_type
) != TYPENAME_TYPE
)
21952 type
= TYPE_NAME (class_type
);
21955 cp_parser_error (parser
, "could not resolve typename type");
21956 type
= error_mark_node
;
21960 if (maybe_process_partial_specialization (TREE_TYPE (type
))
21961 == error_mark_node
)
21967 class_type
= current_class_type
;
21968 /* Enter the scope indicated by the nested-name-specifier. */
21969 pushed_scope
= push_scope (nested_name_specifier
);
21970 /* Get the canonical version of this type. */
21971 type
= TYPE_MAIN_DECL (TREE_TYPE (type
));
21972 /* Call push_template_decl if it seems like we should be defining a
21973 template either from the template headers or the type we're
21974 defining, so that we diagnose both extra and missing headers. */
21975 if ((PROCESSING_REAL_TEMPLATE_DECL_P ()
21976 || CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (type
)))
21977 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type
)))
21979 type
= push_template_decl (type
);
21980 if (type
== error_mark_node
)
21987 type
= TREE_TYPE (type
);
21988 *nested_name_specifier_p
= true;
21990 else /* The name is not a nested name. */
21992 /* If the class was unnamed, create a dummy name. */
21994 id
= make_anon_name ();
21995 type
= xref_tag (class_key
, id
, /*tag_scope=*/ts_current
,
21996 parser
->num_template_parameter_lists
);
21999 /* Indicate whether this class was declared as a `class' or as a
22001 if (TREE_CODE (type
) == RECORD_TYPE
)
22002 CLASSTYPE_DECLARED_CLASS (type
) = (class_key
== class_type
);
22003 cp_parser_check_class_key (class_key
, type
);
22005 /* If this type was already complete, and we see another definition,
22006 that's an error. */
22007 if (type
!= error_mark_node
&& COMPLETE_TYPE_P (type
))
22009 error_at (type_start_token
->location
, "redefinition of %q#T",
22011 inform (location_of (type
), "previous definition of %q#T",
22016 else if (type
== error_mark_node
)
22021 /* Apply attributes now, before any use of the class as a template
22022 argument in its base list. */
22023 cplus_decl_attributes (&type
, attributes
, (int)ATTR_FLAG_TYPE_IN_PLACE
);
22024 fixup_attribute_variants (type
);
22027 /* We will have entered the scope containing the class; the names of
22028 base classes should be looked up in that context. For example:
22030 struct A { struct B {}; struct C; };
22031 struct A::C : B {};
22035 /* Get the list of base-classes, if there is one. */
22036 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
22038 /* PR59482: enter the class scope so that base-specifiers are looked
22042 bases
= cp_parser_base_clause (parser
);
22043 /* PR59482: get out of the previously pushed class scope so that the
22044 subsequent pops pop the right thing. */
22051 /* If we're really defining a class, process the base classes.
22052 If they're invalid, fail. */
22053 if (type
&& cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
)
22054 && !xref_basetypes (type
, bases
))
22058 /* Leave the scope given by the nested-name-specifier. We will
22059 enter the class scope itself while processing the members. */
22061 pop_scope (pushed_scope
);
22063 if (invalid_explicit_specialization_p
)
22065 end_specialization ();
22066 --parser
->num_template_parameter_lists
;
22070 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
22071 if (type
&& (virt_specifiers
& VIRT_SPEC_FINAL
))
22072 CLASSTYPE_FINAL (type
) = 1;
22074 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
22078 /* Parse a class-key.
22085 Returns the kind of class-key specified, or none_type to indicate
22088 static enum tag_types
22089 cp_parser_class_key (cp_parser
* parser
)
22092 enum tag_types tag_type
;
22094 /* Look for the class-key. */
22095 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_KEY
);
22099 /* Check to see if the TOKEN is a class-key. */
22100 tag_type
= cp_parser_token_is_class_key (token
);
22102 cp_parser_error (parser
, "expected class-key");
22106 /* Parse a type-parameter-key.
22108 type-parameter-key:
22114 cp_parser_type_parameter_key (cp_parser
* parser
)
22116 /* Look for the type-parameter-key. */
22117 enum tag_types tag_type
= none_type
;
22118 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22119 if ((tag_type
= cp_parser_token_is_type_parameter_key (token
)) != none_type
)
22121 cp_lexer_consume_token (parser
->lexer
);
22122 if (pedantic
&& tag_type
== typename_type
&& cxx_dialect
< cxx1z
)
22123 /* typename is not allowed in a template template parameter
22124 by the standard until C++1Z. */
22125 pedwarn (token
->location
, OPT_Wpedantic
,
22126 "ISO C++ forbids typename key in template template parameter;"
22127 " use -std=c++1z or -std=gnu++1z");
22130 cp_parser_error (parser
, "expected %<class%> or %<typename%>");
22135 /* Parse an (optional) member-specification.
22137 member-specification:
22138 member-declaration member-specification [opt]
22139 access-specifier : member-specification [opt] */
22142 cp_parser_member_specification_opt (cp_parser
* parser
)
22149 /* Peek at the next token. */
22150 token
= cp_lexer_peek_token (parser
->lexer
);
22151 /* If it's a `}', or EOF then we've seen all the members. */
22152 if (token
->type
== CPP_CLOSE_BRACE
22153 || token
->type
== CPP_EOF
22154 || token
->type
== CPP_PRAGMA_EOL
)
22157 /* See if this token is a keyword. */
22158 keyword
= token
->keyword
;
22162 case RID_PROTECTED
:
22164 /* Consume the access-specifier. */
22165 cp_lexer_consume_token (parser
->lexer
);
22166 /* Remember which access-specifier is active. */
22167 current_access_specifier
= token
->u
.value
;
22168 /* Look for the `:'. */
22169 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
22173 /* Accept #pragmas at class scope. */
22174 if (token
->type
== CPP_PRAGMA
)
22176 cp_parser_pragma (parser
, pragma_member
, NULL
);
22180 /* Otherwise, the next construction must be a
22181 member-declaration. */
22182 cp_parser_member_declaration (parser
);
22187 /* Parse a member-declaration.
22189 member-declaration:
22190 decl-specifier-seq [opt] member-declarator-list [opt] ;
22191 function-definition ; [opt]
22192 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22194 template-declaration
22197 member-declarator-list:
22199 member-declarator-list , member-declarator
22202 declarator pure-specifier [opt]
22203 declarator constant-initializer [opt]
22204 identifier [opt] : constant-expression
22208 member-declaration:
22209 __extension__ member-declaration
22212 declarator attributes [opt] pure-specifier [opt]
22213 declarator attributes [opt] constant-initializer [opt]
22214 identifier [opt] attributes [opt] : constant-expression
22218 member-declaration:
22219 static_assert-declaration */
22222 cp_parser_member_declaration (cp_parser
* parser
)
22224 cp_decl_specifier_seq decl_specifiers
;
22225 tree prefix_attributes
;
22227 int declares_class_or_enum
;
22229 cp_token
*token
= NULL
;
22230 cp_token
*decl_spec_token_start
= NULL
;
22231 cp_token
*initializer_token_start
= NULL
;
22232 int saved_pedantic
;
22233 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
22235 /* Check for the `__extension__' keyword. */
22236 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
22239 cp_parser_member_declaration (parser
);
22240 /* Restore the old value of the PEDANTIC flag. */
22241 pedantic
= saved_pedantic
;
22246 /* Check for a template-declaration. */
22247 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
22249 /* An explicit specialization here is an error condition, and we
22250 expect the specialization handler to detect and report this. */
22251 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
22252 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
22253 cp_parser_explicit_specialization (parser
);
22255 cp_parser_template_declaration (parser
, /*member_p=*/true);
22259 /* Check for a template introduction. */
22260 else if (cp_parser_template_declaration_after_export (parser
, true))
22263 /* Check for a using-declaration. */
22264 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
22266 if (cxx_dialect
< cxx11
)
22268 /* Parse the using-declaration. */
22269 cp_parser_using_declaration (parser
,
22270 /*access_declaration_p=*/false);
22276 bool alias_decl_expected
;
22277 cp_parser_parse_tentatively (parser
);
22278 decl
= cp_parser_alias_declaration (parser
);
22279 /* Note that if we actually see the '=' token after the
22280 identifier, cp_parser_alias_declaration commits the
22281 tentative parse. In that case, we really expect an
22282 alias-declaration. Otherwise, we expect a using
22284 alias_decl_expected
=
22285 !cp_parser_uncommitted_to_tentative_parse_p (parser
);
22286 cp_parser_parse_definitely (parser
);
22288 if (alias_decl_expected
)
22289 finish_member_declaration (decl
);
22291 cp_parser_using_declaration (parser
,
22292 /*access_declaration_p=*/false);
22297 /* Check for @defs. */
22298 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_DEFS
))
22301 tree ivar_chains
= cp_parser_objc_defs_expression (parser
);
22302 ivar
= ivar_chains
;
22306 ivar
= TREE_CHAIN (member
);
22307 TREE_CHAIN (member
) = NULL_TREE
;
22308 finish_member_declaration (member
);
22313 /* If the next token is `static_assert' we have a static assertion. */
22314 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC_ASSERT
))
22316 cp_parser_static_assert (parser
, /*member_p=*/true);
22320 parser
->colon_corrects_to_scope_p
= false;
22322 if (cp_parser_using_declaration (parser
, /*access_declaration=*/true))
22325 /* Parse the decl-specifier-seq. */
22326 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
22327 cp_parser_decl_specifier_seq (parser
,
22328 CP_PARSER_FLAGS_OPTIONAL
,
22330 &declares_class_or_enum
);
22331 /* Check for an invalid type-name. */
22332 if (!decl_specifiers
.any_type_specifiers_p
22333 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
22335 /* If there is no declarator, then the decl-specifier-seq should
22337 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
22339 /* If there was no decl-specifier-seq, and the next token is a
22340 `;', then we have something like:
22346 Each member-declaration shall declare at least one member
22347 name of the class. */
22348 if (!decl_specifiers
.any_specifiers_p
)
22350 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22351 if (!in_system_header_at (token
->location
))
22352 pedwarn (token
->location
, OPT_Wpedantic
, "extra %<;%>");
22358 /* See if this declaration is a friend. */
22359 friend_p
= cp_parser_friend_p (&decl_specifiers
);
22360 /* If there were decl-specifiers, check to see if there was
22361 a class-declaration. */
22362 type
= check_tag_decl (&decl_specifiers
,
22363 /*explicit_type_instantiation_p=*/false);
22364 /* Nested classes have already been added to the class, but
22365 a `friend' needs to be explicitly registered. */
22368 /* If the `friend' keyword was present, the friend must
22369 be introduced with a class-key. */
22370 if (!declares_class_or_enum
&& cxx_dialect
< cxx11
)
22371 pedwarn (decl_spec_token_start
->location
, OPT_Wpedantic
,
22372 "in C++03 a class-key must be used "
22373 "when declaring a friend");
22376 template <typename T> struct A {
22377 friend struct A<T>::B;
22380 A<T>::B will be represented by a TYPENAME_TYPE, and
22381 therefore not recognized by check_tag_decl. */
22384 type
= decl_specifiers
.type
;
22385 if (type
&& TREE_CODE (type
) == TYPE_DECL
)
22386 type
= TREE_TYPE (type
);
22388 if (!type
|| !TYPE_P (type
))
22389 error_at (decl_spec_token_start
->location
,
22390 "friend declaration does not name a class or "
22393 make_friend_class (current_class_type
, type
,
22394 /*complain=*/true);
22396 /* If there is no TYPE, an error message will already have
22398 else if (!type
|| type
== error_mark_node
)
22400 /* An anonymous aggregate has to be handled specially; such
22401 a declaration really declares a data member (with a
22402 particular type), as opposed to a nested class. */
22403 else if (ANON_AGGR_TYPE_P (type
))
22406 if (decl_specifiers
.storage_class
!= sc_none
)
22407 error_at (decl_spec_token_start
->location
,
22408 "a storage class on an anonymous aggregate "
22409 "in class scope is not allowed");
22411 /* Remove constructors and such from TYPE, now that we
22412 know it is an anonymous aggregate. */
22413 fixup_anonymous_aggr (type
);
22414 /* And make the corresponding data member. */
22415 decl
= build_decl (decl_spec_token_start
->location
,
22416 FIELD_DECL
, NULL_TREE
, type
);
22417 /* Add it to the class. */
22418 finish_member_declaration (decl
);
22421 cp_parser_check_access_in_redeclaration
22423 decl_spec_token_start
->location
);
22428 bool assume_semicolon
= false;
22430 /* Clear attributes from the decl_specifiers but keep them
22431 around as prefix attributes that apply them to the entity
22433 prefix_attributes
= decl_specifiers
.attributes
;
22434 decl_specifiers
.attributes
= NULL_TREE
;
22436 /* See if these declarations will be friends. */
22437 friend_p
= cp_parser_friend_p (&decl_specifiers
);
22439 /* Keep going until we hit the `;' at the end of the
22441 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
22443 tree attributes
= NULL_TREE
;
22444 tree first_attribute
;
22446 /* Peek at the next token. */
22447 token
= cp_lexer_peek_token (parser
->lexer
);
22449 /* Check for a bitfield declaration. */
22450 if (token
->type
== CPP_COLON
22451 || (token
->type
== CPP_NAME
22452 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
22458 /* Get the name of the bitfield. Note that we cannot just
22459 check TOKEN here because it may have been invalidated by
22460 the call to cp_lexer_peek_nth_token above. */
22461 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
22462 identifier
= cp_parser_identifier (parser
);
22464 identifier
= NULL_TREE
;
22466 /* Consume the `:' token. */
22467 cp_lexer_consume_token (parser
->lexer
);
22468 /* Get the width of the bitfield. */
22470 = cp_parser_constant_expression (parser
);
22472 /* Look for attributes that apply to the bitfield. */
22473 attributes
= cp_parser_attributes_opt (parser
);
22474 /* Remember which attributes are prefix attributes and
22476 first_attribute
= attributes
;
22477 /* Combine the attributes. */
22478 attributes
= chainon (prefix_attributes
, attributes
);
22480 /* Create the bitfield declaration. */
22481 decl
= grokbitfield (identifier
22482 ? make_id_declarator (NULL_TREE
,
22492 cp_declarator
*declarator
;
22494 tree asm_specification
;
22495 int ctor_dtor_or_conv_p
;
22497 /* Parse the declarator. */
22499 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
22500 &ctor_dtor_or_conv_p
,
22501 /*parenthesized_p=*/NULL
,
22505 /* If something went wrong parsing the declarator, make sure
22506 that we at least consume some tokens. */
22507 if (declarator
== cp_error_declarator
)
22509 /* Skip to the end of the statement. */
22510 cp_parser_skip_to_end_of_statement (parser
);
22511 /* If the next token is not a semicolon, that is
22512 probably because we just skipped over the body of
22513 a function. So, we consume a semicolon if
22514 present, but do not issue an error message if it
22516 if (cp_lexer_next_token_is (parser
->lexer
,
22518 cp_lexer_consume_token (parser
->lexer
);
22522 if (declares_class_or_enum
& 2)
22523 cp_parser_check_for_definition_in_return_type
22524 (declarator
, decl_specifiers
.type
,
22525 decl_specifiers
.locations
[ds_type_spec
]);
22527 /* Look for an asm-specification. */
22528 asm_specification
= cp_parser_asm_specification_opt (parser
);
22529 /* Look for attributes that apply to the declaration. */
22530 attributes
= cp_parser_attributes_opt (parser
);
22531 /* Remember which attributes are prefix attributes and
22533 first_attribute
= attributes
;
22534 /* Combine the attributes. */
22535 attributes
= chainon (prefix_attributes
, attributes
);
22537 /* If it's an `=', then we have a constant-initializer or a
22538 pure-specifier. It is not correct to parse the
22539 initializer before registering the member declaration
22540 since the member declaration should be in scope while
22541 its initializer is processed. However, the rest of the
22542 front end does not yet provide an interface that allows
22543 us to handle this correctly. */
22544 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
22548 A pure-specifier shall be used only in the declaration of
22549 a virtual function.
22551 A member-declarator can contain a constant-initializer
22552 only if it declares a static member of integral or
22555 Therefore, if the DECLARATOR is for a function, we look
22556 for a pure-specifier; otherwise, we look for a
22557 constant-initializer. When we call `grokfield', it will
22558 perform more stringent semantics checks. */
22559 initializer_token_start
= cp_lexer_peek_token (parser
->lexer
);
22560 if (function_declarator_p (declarator
)
22561 || (decl_specifiers
.type
22562 && TREE_CODE (decl_specifiers
.type
) == TYPE_DECL
22563 && declarator
->kind
== cdk_id
22564 && (TREE_CODE (TREE_TYPE (decl_specifiers
.type
))
22565 == FUNCTION_TYPE
)))
22566 initializer
= cp_parser_pure_specifier (parser
);
22567 else if (decl_specifiers
.storage_class
!= sc_static
)
22568 initializer
= cp_parser_save_nsdmi (parser
);
22569 else if (cxx_dialect
>= cxx11
)
22572 /* Don't require a constant rvalue in C++11, since we
22573 might want a reference constant. We'll enforce
22574 constancy later. */
22575 cp_lexer_consume_token (parser
->lexer
);
22576 /* Parse the initializer. */
22577 initializer
= cp_parser_initializer_clause (parser
,
22581 /* Parse the initializer. */
22582 initializer
= cp_parser_constant_initializer (parser
);
22584 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
)
22585 && !function_declarator_p (declarator
))
22588 if (decl_specifiers
.storage_class
!= sc_static
)
22589 initializer
= cp_parser_save_nsdmi (parser
);
22591 initializer
= cp_parser_initializer (parser
, &x
, &x
);
22593 /* Otherwise, there is no initializer. */
22595 initializer
= NULL_TREE
;
22597 /* See if we are probably looking at a function
22598 definition. We are certainly not looking at a
22599 member-declarator. Calling `grokfield' has
22600 side-effects, so we must not do it unless we are sure
22601 that we are looking at a member-declarator. */
22602 if (cp_parser_token_starts_function_definition_p
22603 (cp_lexer_peek_token (parser
->lexer
)))
22605 /* The grammar does not allow a pure-specifier to be
22606 used when a member function is defined. (It is
22607 possible that this fact is an oversight in the
22608 standard, since a pure function may be defined
22609 outside of the class-specifier. */
22610 if (initializer
&& initializer_token_start
)
22611 error_at (initializer_token_start
->location
,
22612 "pure-specifier on function-definition");
22613 decl
= cp_parser_save_member_function_body (parser
,
22617 if (parser
->fully_implicit_function_template_p
)
22618 decl
= finish_fully_implicit_template (parser
, decl
);
22619 /* If the member was not a friend, declare it here. */
22621 finish_member_declaration (decl
);
22622 /* Peek at the next token. */
22623 token
= cp_lexer_peek_token (parser
->lexer
);
22624 /* If the next token is a semicolon, consume it. */
22625 if (token
->type
== CPP_SEMICOLON
)
22626 cp_lexer_consume_token (parser
->lexer
);
22630 if (declarator
->kind
== cdk_function
)
22631 declarator
->id_loc
= token
->location
;
22632 /* Create the declaration. */
22633 decl
= grokfield (declarator
, &decl_specifiers
,
22634 initializer
, /*init_const_expr_p=*/true,
22635 asm_specification
, attributes
);
22636 if (parser
->fully_implicit_function_template_p
)
22639 finish_fully_implicit_template (parser
, 0);
22641 decl
= finish_fully_implicit_template (parser
, decl
);
22645 cp_finalize_omp_declare_simd (parser
, decl
);
22646 cp_finalize_oacc_routine (parser
, decl
, false);
22648 /* Reset PREFIX_ATTRIBUTES. */
22649 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
22650 attributes
= TREE_CHAIN (attributes
);
22652 TREE_CHAIN (attributes
) = NULL_TREE
;
22654 /* If there is any qualification still in effect, clear it
22655 now; we will be starting fresh with the next declarator. */
22656 parser
->scope
= NULL_TREE
;
22657 parser
->qualifying_scope
= NULL_TREE
;
22658 parser
->object_scope
= NULL_TREE
;
22659 /* If it's a `,', then there are more declarators. */
22660 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
22662 cp_lexer_consume_token (parser
->lexer
);
22663 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
22665 cp_token
*token
= cp_lexer_previous_token (parser
->lexer
);
22666 error_at (token
->location
,
22667 "stray %<,%> at end of member declaration");
22670 /* If the next token isn't a `;', then we have a parse error. */
22671 else if (cp_lexer_next_token_is_not (parser
->lexer
,
22674 /* The next token might be a ways away from where the
22675 actual semicolon is missing. Find the previous token
22676 and use that for our error position. */
22677 cp_token
*token
= cp_lexer_previous_token (parser
->lexer
);
22678 error_at (token
->location
,
22679 "expected %<;%> at end of member declaration");
22681 /* Assume that the user meant to provide a semicolon. If
22682 we were to cp_parser_skip_to_end_of_statement, we might
22683 skip to a semicolon inside a member function definition
22684 and issue nonsensical error messages. */
22685 assume_semicolon
= true;
22690 /* Add DECL to the list of members. */
22692 /* Explicitly include, eg, NSDMIs, for better error
22693 recovery (c++/58650). */
22694 || !DECL_DECLARES_FUNCTION_P (decl
))
22695 finish_member_declaration (decl
);
22697 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22698 cp_parser_save_default_args (parser
, decl
);
22699 else if (TREE_CODE (decl
) == FIELD_DECL
22700 && !DECL_C_BIT_FIELD (decl
)
22701 && DECL_INITIAL (decl
))
22702 /* Add DECL to the queue of NSDMI to be parsed later. */
22703 vec_safe_push (unparsed_nsdmis
, decl
);
22706 if (assume_semicolon
)
22711 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
22713 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
22716 /* Parse a pure-specifier.
22721 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22722 Otherwise, ERROR_MARK_NODE is returned. */
22725 cp_parser_pure_specifier (cp_parser
* parser
)
22729 /* Look for the `=' token. */
22730 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
22731 return error_mark_node
;
22732 /* Look for the `0' token. */
22733 token
= cp_lexer_peek_token (parser
->lexer
);
22735 if (token
->type
== CPP_EOF
22736 || token
->type
== CPP_PRAGMA_EOL
)
22737 return error_mark_node
;
22739 cp_lexer_consume_token (parser
->lexer
);
22741 /* Accept = default or = delete in c++0x mode. */
22742 if (token
->keyword
== RID_DEFAULT
22743 || token
->keyword
== RID_DELETE
)
22745 maybe_warn_cpp0x (CPP0X_DEFAULTED_DELETED
);
22746 return token
->u
.value
;
22749 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22750 if (token
->type
!= CPP_NUMBER
|| !(token
->flags
& PURE_ZERO
))
22752 cp_parser_error (parser
,
22753 "invalid pure specifier (only %<= 0%> is allowed)");
22754 cp_parser_skip_to_end_of_statement (parser
);
22755 return error_mark_node
;
22757 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
22759 error_at (token
->location
, "templates may not be %<virtual%>");
22760 return error_mark_node
;
22763 return integer_zero_node
;
22766 /* Parse a constant-initializer.
22768 constant-initializer:
22769 = constant-expression
22771 Returns a representation of the constant-expression. */
22774 cp_parser_constant_initializer (cp_parser
* parser
)
22776 /* Look for the `=' token. */
22777 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
22778 return error_mark_node
;
22780 /* It is invalid to write:
22782 struct S { static const int i = { 7 }; };
22785 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
22787 cp_parser_error (parser
,
22788 "a brace-enclosed initializer is not allowed here");
22789 /* Consume the opening brace. */
22790 cp_lexer_consume_token (parser
->lexer
);
22791 /* Skip the initializer. */
22792 cp_parser_skip_to_closing_brace (parser
);
22793 /* Look for the trailing `}'. */
22794 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
22796 return error_mark_node
;
22799 return cp_parser_constant_expression (parser
);
22802 /* Derived classes [gram.class.derived] */
22804 /* Parse a base-clause.
22807 : base-specifier-list
22809 base-specifier-list:
22810 base-specifier ... [opt]
22811 base-specifier-list , base-specifier ... [opt]
22813 Returns a TREE_LIST representing the base-classes, in the order in
22814 which they were declared. The representation of each node is as
22815 described by cp_parser_base_specifier.
22817 In the case that no bases are specified, this function will return
22818 NULL_TREE, not ERROR_MARK_NODE. */
22821 cp_parser_base_clause (cp_parser
* parser
)
22823 tree bases
= NULL_TREE
;
22825 /* Look for the `:' that begins the list. */
22826 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
22828 /* Scan the base-specifier-list. */
22833 bool pack_expansion_p
= false;
22835 /* Look for the base-specifier. */
22836 base
= cp_parser_base_specifier (parser
);
22837 /* Look for the (optional) ellipsis. */
22838 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
22840 /* Consume the `...'. */
22841 cp_lexer_consume_token (parser
->lexer
);
22843 pack_expansion_p
= true;
22846 /* Add BASE to the front of the list. */
22847 if (base
&& base
!= error_mark_node
)
22849 if (pack_expansion_p
)
22850 /* Make this a pack expansion type. */
22851 TREE_VALUE (base
) = make_pack_expansion (TREE_VALUE (base
));
22853 if (!check_for_bare_parameter_packs (TREE_VALUE (base
)))
22855 TREE_CHAIN (base
) = bases
;
22859 /* Peek at the next token. */
22860 token
= cp_lexer_peek_token (parser
->lexer
);
22861 /* If it's not a comma, then the list is complete. */
22862 if (token
->type
!= CPP_COMMA
)
22864 /* Consume the `,'. */
22865 cp_lexer_consume_token (parser
->lexer
);
22868 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22869 base class had a qualified name. However, the next name that
22870 appears is certainly not qualified. */
22871 parser
->scope
= NULL_TREE
;
22872 parser
->qualifying_scope
= NULL_TREE
;
22873 parser
->object_scope
= NULL_TREE
;
22875 return nreverse (bases
);
22878 /* Parse a base-specifier.
22881 :: [opt] nested-name-specifier [opt] class-name
22882 virtual access-specifier [opt] :: [opt] nested-name-specifier
22884 access-specifier virtual [opt] :: [opt] nested-name-specifier
22887 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22888 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22889 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22890 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22893 cp_parser_base_specifier (cp_parser
* parser
)
22897 bool virtual_p
= false;
22898 bool duplicate_virtual_error_issued_p
= false;
22899 bool duplicate_access_error_issued_p
= false;
22900 bool class_scope_p
, template_p
;
22901 tree access
= access_default_node
;
22904 /* Process the optional `virtual' and `access-specifier'. */
22907 /* Peek at the next token. */
22908 token
= cp_lexer_peek_token (parser
->lexer
);
22909 /* Process `virtual'. */
22910 switch (token
->keyword
)
22913 /* If `virtual' appears more than once, issue an error. */
22914 if (virtual_p
&& !duplicate_virtual_error_issued_p
)
22916 cp_parser_error (parser
,
22917 "%<virtual%> specified more than once in base-specified");
22918 duplicate_virtual_error_issued_p
= true;
22923 /* Consume the `virtual' token. */
22924 cp_lexer_consume_token (parser
->lexer
);
22929 case RID_PROTECTED
:
22931 /* If more than one access specifier appears, issue an
22933 if (access
!= access_default_node
22934 && !duplicate_access_error_issued_p
)
22936 cp_parser_error (parser
,
22937 "more than one access specifier in base-specified");
22938 duplicate_access_error_issued_p
= true;
22941 access
= ridpointers
[(int) token
->keyword
];
22943 /* Consume the access-specifier. */
22944 cp_lexer_consume_token (parser
->lexer
);
22953 /* It is not uncommon to see programs mechanically, erroneously, use
22954 the 'typename' keyword to denote (dependent) qualified types
22955 as base classes. */
22956 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
22958 token
= cp_lexer_peek_token (parser
->lexer
);
22959 if (!processing_template_decl
)
22960 error_at (token
->location
,
22961 "keyword %<typename%> not allowed outside of templates");
22963 error_at (token
->location
,
22964 "keyword %<typename%> not allowed in this context "
22965 "(the base class is implicitly a type)");
22966 cp_lexer_consume_token (parser
->lexer
);
22969 /* Look for the optional `::' operator. */
22970 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
22971 /* Look for the nested-name-specifier. The simplest way to
22976 The keyword `typename' is not permitted in a base-specifier or
22977 mem-initializer; in these contexts a qualified name that
22978 depends on a template-parameter is implicitly assumed to be a
22981 is to pretend that we have seen the `typename' keyword at this
22983 cp_parser_nested_name_specifier_opt (parser
,
22984 /*typename_keyword_p=*/true,
22985 /*check_dependency_p=*/true,
22987 /*is_declaration=*/true);
22988 /* If the base class is given by a qualified name, assume that names
22989 we see are type names or templates, as appropriate. */
22990 class_scope_p
= (parser
->scope
&& TYPE_P (parser
->scope
));
22991 template_p
= class_scope_p
&& cp_parser_optional_template_keyword (parser
);
22994 && cp_lexer_next_token_is_decltype (parser
->lexer
))
22995 /* DR 950 allows decltype as a base-specifier. */
22996 type
= cp_parser_decltype (parser
);
22999 /* Otherwise, look for the class-name. */
23000 type
= cp_parser_class_name (parser
,
23004 /*check_dependency_p=*/true,
23005 /*class_head_p=*/false,
23006 /*is_declaration=*/true);
23007 type
= TREE_TYPE (type
);
23010 if (type
== error_mark_node
)
23011 return error_mark_node
;
23013 return finish_base_specifier (type
, access
, virtual_p
);
23016 /* Exception handling [gram.exception] */
23018 /* Parse an (optional) noexcept-specification.
23020 noexcept-specification:
23021 noexcept ( constant-expression ) [opt]
23023 If no noexcept-specification is present, returns NULL_TREE.
23024 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
23025 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
23026 there are no parentheses. CONSUMED_EXPR will be set accordingly.
23027 Otherwise, returns a noexcept specification unless RETURN_COND is true,
23028 in which case a boolean condition is returned instead. */
23031 cp_parser_noexcept_specification_opt (cp_parser
* parser
,
23032 bool require_constexpr
,
23033 bool* consumed_expr
,
23037 const char *saved_message
;
23039 /* Peek at the next token. */
23040 token
= cp_lexer_peek_token (parser
->lexer
);
23042 /* Is it a noexcept-specification? */
23043 if (cp_parser_is_keyword (token
, RID_NOEXCEPT
))
23046 cp_lexer_consume_token (parser
->lexer
);
23048 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
23050 cp_lexer_consume_token (parser
->lexer
);
23052 if (require_constexpr
)
23054 /* Types may not be defined in an exception-specification. */
23055 saved_message
= parser
->type_definition_forbidden_message
;
23056 parser
->type_definition_forbidden_message
23057 = G_("types may not be defined in an exception-specification");
23059 expr
= cp_parser_constant_expression (parser
);
23061 /* Restore the saved message. */
23062 parser
->type_definition_forbidden_message
= saved_message
;
23066 expr
= cp_parser_expression (parser
);
23067 *consumed_expr
= true;
23070 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23074 expr
= boolean_true_node
;
23075 if (!require_constexpr
)
23076 *consumed_expr
= false;
23079 /* We cannot build a noexcept-spec right away because this will check
23080 that expr is a constexpr. */
23082 return build_noexcept_spec (expr
, tf_warning_or_error
);
23090 /* Parse an (optional) exception-specification.
23092 exception-specification:
23093 throw ( type-id-list [opt] )
23095 Returns a TREE_LIST representing the exception-specification. The
23096 TREE_VALUE of each node is a type. */
23099 cp_parser_exception_specification_opt (cp_parser
* parser
)
23103 const char *saved_message
;
23105 /* Peek at the next token. */
23106 token
= cp_lexer_peek_token (parser
->lexer
);
23108 /* Is it a noexcept-specification? */
23109 type_id_list
= cp_parser_noexcept_specification_opt(parser
, true, NULL
,
23111 if (type_id_list
!= NULL_TREE
)
23112 return type_id_list
;
23114 /* If it's not `throw', then there's no exception-specification. */
23115 if (!cp_parser_is_keyword (token
, RID_THROW
))
23119 /* Enable this once a lot of code has transitioned to noexcept? */
23120 if (cxx_dialect
>= cxx11
&& !in_system_header_at (input_location
))
23121 warning (OPT_Wdeprecated
, "dynamic exception specifications are "
23122 "deprecated in C++0x; use %<noexcept%> instead");
23125 /* Consume the `throw'. */
23126 cp_lexer_consume_token (parser
->lexer
);
23128 /* Look for the `('. */
23129 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
23131 /* Peek at the next token. */
23132 token
= cp_lexer_peek_token (parser
->lexer
);
23133 /* If it's not a `)', then there is a type-id-list. */
23134 if (token
->type
!= CPP_CLOSE_PAREN
)
23136 /* Types may not be defined in an exception-specification. */
23137 saved_message
= parser
->type_definition_forbidden_message
;
23138 parser
->type_definition_forbidden_message
23139 = G_("types may not be defined in an exception-specification");
23140 /* Parse the type-id-list. */
23141 type_id_list
= cp_parser_type_id_list (parser
);
23142 /* Restore the saved message. */
23143 parser
->type_definition_forbidden_message
= saved_message
;
23146 type_id_list
= empty_except_spec
;
23148 /* Look for the `)'. */
23149 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23151 return type_id_list
;
23154 /* Parse an (optional) type-id-list.
23158 type-id-list , type-id ... [opt]
23160 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23161 in the order that the types were presented. */
23164 cp_parser_type_id_list (cp_parser
* parser
)
23166 tree types
= NULL_TREE
;
23173 token
= cp_lexer_peek_token (parser
->lexer
);
23175 /* Get the next type-id. */
23176 type
= cp_parser_type_id (parser
);
23177 /* Check for invalid 'auto'. */
23178 if (flag_concepts
&& type_uses_auto (type
))
23180 error_at (token
->location
,
23181 "invalid use of %<auto%> in exception-specification");
23182 type
= error_mark_node
;
23184 /* Parse the optional ellipsis. */
23185 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
23187 /* Consume the `...'. */
23188 cp_lexer_consume_token (parser
->lexer
);
23190 /* Turn the type into a pack expansion expression. */
23191 type
= make_pack_expansion (type
);
23193 /* Add it to the list. */
23194 types
= add_exception_specifier (types
, type
, /*complain=*/1);
23195 /* Peek at the next token. */
23196 token
= cp_lexer_peek_token (parser
->lexer
);
23197 /* If it is not a `,', we are done. */
23198 if (token
->type
!= CPP_COMMA
)
23200 /* Consume the `,'. */
23201 cp_lexer_consume_token (parser
->lexer
);
23204 return nreverse (types
);
23207 /* Parse a try-block.
23210 try compound-statement handler-seq */
23213 cp_parser_try_block (cp_parser
* parser
)
23217 cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
);
23218 if (parser
->in_function_body
23219 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
))
23220 error ("%<try%> in %<constexpr%> function");
23222 try_block
= begin_try_block ();
23223 cp_parser_compound_statement (parser
, NULL
, BCS_TRY_BLOCK
, false);
23224 finish_try_block (try_block
);
23225 cp_parser_handler_seq (parser
);
23226 finish_handler_sequence (try_block
);
23231 /* Parse a function-try-block.
23233 function-try-block:
23234 try ctor-initializer [opt] function-body handler-seq */
23237 cp_parser_function_try_block (cp_parser
* parser
)
23239 tree compound_stmt
;
23241 bool ctor_initializer_p
;
23243 /* Look for the `try' keyword. */
23244 if (!cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
))
23246 /* Let the rest of the front end know where we are. */
23247 try_block
= begin_function_try_block (&compound_stmt
);
23248 /* Parse the function-body. */
23249 ctor_initializer_p
= cp_parser_ctor_initializer_opt_and_function_body
23250 (parser
, /*in_function_try_block=*/true);
23251 /* We're done with the `try' part. */
23252 finish_function_try_block (try_block
);
23253 /* Parse the handlers. */
23254 cp_parser_handler_seq (parser
);
23255 /* We're done with the handlers. */
23256 finish_function_handler_sequence (try_block
, compound_stmt
);
23258 return ctor_initializer_p
;
23261 /* Parse a handler-seq.
23264 handler handler-seq [opt] */
23267 cp_parser_handler_seq (cp_parser
* parser
)
23273 /* Parse the handler. */
23274 cp_parser_handler (parser
);
23275 /* Peek at the next token. */
23276 token
= cp_lexer_peek_token (parser
->lexer
);
23277 /* If it's not `catch' then there are no more handlers. */
23278 if (!cp_parser_is_keyword (token
, RID_CATCH
))
23283 /* Parse a handler.
23286 catch ( exception-declaration ) compound-statement */
23289 cp_parser_handler (cp_parser
* parser
)
23294 cp_parser_require_keyword (parser
, RID_CATCH
, RT_CATCH
);
23295 handler
= begin_handler ();
23296 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
23297 declaration
= cp_parser_exception_declaration (parser
);
23298 finish_handler_parms (declaration
, handler
);
23299 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23300 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
23301 finish_handler (handler
);
23304 /* Parse an exception-declaration.
23306 exception-declaration:
23307 type-specifier-seq declarator
23308 type-specifier-seq abstract-declarator
23312 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23313 ellipsis variant is used. */
23316 cp_parser_exception_declaration (cp_parser
* parser
)
23318 cp_decl_specifier_seq type_specifiers
;
23319 cp_declarator
*declarator
;
23320 const char *saved_message
;
23322 /* If it's an ellipsis, it's easy to handle. */
23323 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
23325 /* Consume the `...' token. */
23326 cp_lexer_consume_token (parser
->lexer
);
23330 /* Types may not be defined in exception-declarations. */
23331 saved_message
= parser
->type_definition_forbidden_message
;
23332 parser
->type_definition_forbidden_message
23333 = G_("types may not be defined in exception-declarations");
23335 /* Parse the type-specifier-seq. */
23336 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
23337 /*is_trailing_return=*/false,
23339 /* If it's a `)', then there is no declarator. */
23340 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
23343 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_EITHER
,
23344 /*ctor_dtor_or_conv_p=*/NULL
,
23345 /*parenthesized_p=*/NULL
,
23346 /*member_p=*/false,
23347 /*friend_p=*/false);
23349 /* Restore the saved message. */
23350 parser
->type_definition_forbidden_message
= saved_message
;
23352 if (!type_specifiers
.any_specifiers_p
)
23353 return error_mark_node
;
23355 return grokdeclarator (declarator
, &type_specifiers
, CATCHPARM
, 1, NULL
);
23358 /* Parse a throw-expression.
23361 throw assignment-expression [opt]
23363 Returns a THROW_EXPR representing the throw-expression. */
23366 cp_parser_throw_expression (cp_parser
* parser
)
23371 cp_parser_require_keyword (parser
, RID_THROW
, RT_THROW
);
23372 token
= cp_lexer_peek_token (parser
->lexer
);
23373 /* Figure out whether or not there is an assignment-expression
23374 following the "throw" keyword. */
23375 if (token
->type
== CPP_COMMA
23376 || token
->type
== CPP_SEMICOLON
23377 || token
->type
== CPP_CLOSE_PAREN
23378 || token
->type
== CPP_CLOSE_SQUARE
23379 || token
->type
== CPP_CLOSE_BRACE
23380 || token
->type
== CPP_COLON
)
23381 expression
= NULL_TREE
;
23383 expression
= cp_parser_assignment_expression (parser
);
23385 return build_throw (expression
);
23388 /* GNU Extensions */
23390 /* Parse an (optional) asm-specification.
23393 asm ( string-literal )
23395 If the asm-specification is present, returns a STRING_CST
23396 corresponding to the string-literal. Otherwise, returns
23400 cp_parser_asm_specification_opt (cp_parser
* parser
)
23403 tree asm_specification
;
23405 /* Peek at the next token. */
23406 token
= cp_lexer_peek_token (parser
->lexer
);
23407 /* If the next token isn't the `asm' keyword, then there's no
23408 asm-specification. */
23409 if (!cp_parser_is_keyword (token
, RID_ASM
))
23412 /* Consume the `asm' token. */
23413 cp_lexer_consume_token (parser
->lexer
);
23414 /* Look for the `('. */
23415 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
23417 /* Look for the string-literal. */
23418 asm_specification
= cp_parser_string_literal (parser
, false, false);
23420 /* Look for the `)'. */
23421 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23423 return asm_specification
;
23426 /* Parse an asm-operand-list.
23430 asm-operand-list , asm-operand
23433 string-literal ( expression )
23434 [ string-literal ] string-literal ( expression )
23436 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23437 each node is the expression. The TREE_PURPOSE is itself a
23438 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23439 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23440 is a STRING_CST for the string literal before the parenthesis. Returns
23441 ERROR_MARK_NODE if any of the operands are invalid. */
23444 cp_parser_asm_operand_list (cp_parser
* parser
)
23446 tree asm_operands
= NULL_TREE
;
23447 bool invalid_operands
= false;
23451 tree string_literal
;
23455 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
23457 /* Consume the `[' token. */
23458 cp_lexer_consume_token (parser
->lexer
);
23459 /* Read the operand name. */
23460 name
= cp_parser_identifier (parser
);
23461 if (name
!= error_mark_node
)
23462 name
= build_string (IDENTIFIER_LENGTH (name
),
23463 IDENTIFIER_POINTER (name
));
23464 /* Look for the closing `]'. */
23465 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
23469 /* Look for the string-literal. */
23470 string_literal
= cp_parser_string_literal (parser
, false, false);
23472 /* Look for the `('. */
23473 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
23474 /* Parse the expression. */
23475 expression
= cp_parser_expression (parser
);
23476 /* Look for the `)'. */
23477 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
23479 if (name
== error_mark_node
23480 || string_literal
== error_mark_node
23481 || expression
== error_mark_node
)
23482 invalid_operands
= true;
23484 /* Add this operand to the list. */
23485 asm_operands
= tree_cons (build_tree_list (name
, string_literal
),
23488 /* If the next token is not a `,', there are no more
23490 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
23492 /* Consume the `,'. */
23493 cp_lexer_consume_token (parser
->lexer
);
23496 return invalid_operands
? error_mark_node
: nreverse (asm_operands
);
23499 /* Parse an asm-clobber-list.
23503 asm-clobber-list , string-literal
23505 Returns a TREE_LIST, indicating the clobbers in the order that they
23506 appeared. The TREE_VALUE of each node is a STRING_CST. */
23509 cp_parser_asm_clobber_list (cp_parser
* parser
)
23511 tree clobbers
= NULL_TREE
;
23515 tree string_literal
;
23517 /* Look for the string literal. */
23518 string_literal
= cp_parser_string_literal (parser
, false, false);
23519 /* Add it to the list. */
23520 clobbers
= tree_cons (NULL_TREE
, string_literal
, clobbers
);
23521 /* If the next token is not a `,', then the list is
23523 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
23525 /* Consume the `,' token. */
23526 cp_lexer_consume_token (parser
->lexer
);
23532 /* Parse an asm-label-list.
23536 asm-label-list , identifier
23538 Returns a TREE_LIST, indicating the labels in the order that they
23539 appeared. The TREE_VALUE of each node is a label. */
23542 cp_parser_asm_label_list (cp_parser
* parser
)
23544 tree labels
= NULL_TREE
;
23548 tree identifier
, label
, name
;
23550 /* Look for the identifier. */
23551 identifier
= cp_parser_identifier (parser
);
23552 if (!error_operand_p (identifier
))
23554 label
= lookup_label (identifier
);
23555 if (TREE_CODE (label
) == LABEL_DECL
)
23557 TREE_USED (label
) = 1;
23558 check_goto (label
);
23559 name
= build_string (IDENTIFIER_LENGTH (identifier
),
23560 IDENTIFIER_POINTER (identifier
));
23561 labels
= tree_cons (name
, label
, labels
);
23564 /* If the next token is not a `,', then the list is
23566 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
23568 /* Consume the `,' token. */
23569 cp_lexer_consume_token (parser
->lexer
);
23572 return nreverse (labels
);
23575 /* Return TRUE iff the next tokens in the stream are possibly the
23576 beginning of a GNU extension attribute. */
23579 cp_next_tokens_can_be_gnu_attribute_p (cp_parser
*parser
)
23581 return cp_nth_tokens_can_be_gnu_attribute_p (parser
, 1);
23584 /* Return TRUE iff the next tokens in the stream are possibly the
23585 beginning of a standard C++-11 attribute specifier. */
23588 cp_next_tokens_can_be_std_attribute_p (cp_parser
*parser
)
23590 return cp_nth_tokens_can_be_std_attribute_p (parser
, 1);
23593 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23594 beginning of a standard C++-11 attribute specifier. */
23597 cp_nth_tokens_can_be_std_attribute_p (cp_parser
*parser
, size_t n
)
23599 cp_token
*token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
23601 return (cxx_dialect
>= cxx11
23602 && ((token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ALIGNAS
)
23603 || (token
->type
== CPP_OPEN_SQUARE
23604 && (token
= cp_lexer_peek_nth_token (parser
->lexer
, n
+ 1))
23605 && token
->type
== CPP_OPEN_SQUARE
)));
23608 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23609 beginning of a GNU extension attribute. */
23612 cp_nth_tokens_can_be_gnu_attribute_p (cp_parser
*parser
, size_t n
)
23614 cp_token
*token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
23616 return token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ATTRIBUTE
;
23619 /* Return true iff the next tokens can be the beginning of either a
23620 GNU attribute list, or a standard C++11 attribute sequence. */
23623 cp_next_tokens_can_be_attribute_p (cp_parser
*parser
)
23625 return (cp_next_tokens_can_be_gnu_attribute_p (parser
)
23626 || cp_next_tokens_can_be_std_attribute_p (parser
));
23629 /* Return true iff the next Nth tokens can be the beginning of either
23630 a GNU attribute list, or a standard C++11 attribute sequence. */
23633 cp_nth_tokens_can_be_attribute_p (cp_parser
*parser
, size_t n
)
23635 return (cp_nth_tokens_can_be_gnu_attribute_p (parser
, n
)
23636 || cp_nth_tokens_can_be_std_attribute_p (parser
, n
));
23639 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23640 of GNU attributes, or return NULL. */
23643 cp_parser_attributes_opt (cp_parser
*parser
)
23645 if (cp_next_tokens_can_be_gnu_attribute_p (parser
))
23646 return cp_parser_gnu_attributes_opt (parser
);
23647 return cp_parser_std_attribute_spec_seq (parser
);
23650 #define CILK_SIMD_FN_CLAUSE_MASK \
23651 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23652 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23653 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23654 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23655 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23657 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23658 vector [(<clauses>)] */
23661 cp_parser_cilk_simd_fn_vector_attrs (cp_parser
*parser
, cp_token
*v_token
)
23663 bool first_p
= parser
->cilk_simd_fn_info
== NULL
;
23664 cp_token
*token
= v_token
;
23667 parser
->cilk_simd_fn_info
= XNEW (cp_omp_declare_simd_data
);
23668 parser
->cilk_simd_fn_info
->error_seen
= false;
23669 parser
->cilk_simd_fn_info
->fndecl_seen
= false;
23670 parser
->cilk_simd_fn_info
->tokens
= vNULL
;
23672 int paren_scope
= 0;
23673 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
23675 cp_lexer_consume_token (parser
->lexer
);
23676 v_token
= cp_lexer_peek_token (parser
->lexer
);
23679 while (paren_scope
> 0)
23681 token
= cp_lexer_peek_token (parser
->lexer
);
23682 if (token
->type
== CPP_OPEN_PAREN
)
23684 else if (token
->type
== CPP_CLOSE_PAREN
)
23686 /* Do not push the last ')' */
23687 if (!(token
->type
== CPP_CLOSE_PAREN
&& paren_scope
== 0))
23688 cp_lexer_consume_token (parser
->lexer
);
23691 token
->type
= CPP_PRAGMA_EOL
;
23692 parser
->lexer
->next_token
= token
;
23693 cp_lexer_consume_token (parser
->lexer
);
23695 struct cp_token_cache
*cp
23696 = cp_token_cache_new (v_token
, cp_lexer_peek_token (parser
->lexer
));
23697 parser
->cilk_simd_fn_info
->tokens
.safe_push (cp
);
23700 /* Parse an (optional) series of attributes.
23703 attributes attribute
23706 __attribute__ (( attribute-list [opt] ))
23708 The return value is as for cp_parser_gnu_attribute_list. */
23711 cp_parser_gnu_attributes_opt (cp_parser
* parser
)
23713 tree attributes
= NULL_TREE
;
23718 tree attribute_list
;
23721 /* Peek at the next token. */
23722 token
= cp_lexer_peek_token (parser
->lexer
);
23723 /* If it's not `__attribute__', then we're done. */
23724 if (token
->keyword
!= RID_ATTRIBUTE
)
23727 /* Consume the `__attribute__' keyword. */
23728 cp_lexer_consume_token (parser
->lexer
);
23729 /* Look for the two `(' tokens. */
23730 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
23731 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
23733 /* Peek at the next token. */
23734 token
= cp_lexer_peek_token (parser
->lexer
);
23735 if (token
->type
!= CPP_CLOSE_PAREN
)
23736 /* Parse the attribute-list. */
23737 attribute_list
= cp_parser_gnu_attribute_list (parser
);
23739 /* If the next token is a `)', then there is no attribute
23741 attribute_list
= NULL
;
23743 /* Look for the two `)' tokens. */
23744 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23746 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23749 cp_parser_skip_to_end_of_statement (parser
);
23751 /* Add these new attributes to the list. */
23752 attributes
= chainon (attributes
, attribute_list
);
23758 /* Parse a GNU attribute-list.
23762 attribute-list , attribute
23766 identifier ( identifier )
23767 identifier ( identifier , expression-list )
23768 identifier ( expression-list )
23770 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23771 to an attribute. The TREE_PURPOSE of each node is the identifier
23772 indicating which attribute is in use. The TREE_VALUE represents
23773 the arguments, if any. */
23776 cp_parser_gnu_attribute_list (cp_parser
* parser
)
23778 tree attribute_list
= NULL_TREE
;
23779 bool save_translate_strings_p
= parser
->translate_strings_p
;
23781 parser
->translate_strings_p
= false;
23788 /* Look for the identifier. We also allow keywords here; for
23789 example `__attribute__ ((const))' is legal. */
23790 token
= cp_lexer_peek_token (parser
->lexer
);
23791 if (token
->type
== CPP_NAME
23792 || token
->type
== CPP_KEYWORD
)
23794 tree arguments
= NULL_TREE
;
23796 /* Consume the token, but save it since we need it for the
23797 SIMD enabled function parsing. */
23798 cp_token
*id_token
= cp_lexer_consume_token (parser
->lexer
);
23800 /* Save away the identifier that indicates which attribute
23802 identifier
= (token
->type
== CPP_KEYWORD
)
23803 /* For keywords, use the canonical spelling, not the
23804 parsed identifier. */
23805 ? ridpointers
[(int) token
->keyword
]
23806 : id_token
->u
.value
;
23808 attribute
= build_tree_list (identifier
, NULL_TREE
);
23810 /* Peek at the next token. */
23811 token
= cp_lexer_peek_token (parser
->lexer
);
23812 /* If it's an `(', then parse the attribute arguments. */
23813 if (token
->type
== CPP_OPEN_PAREN
)
23815 vec
<tree
, va_gc
> *vec
;
23816 int attr_flag
= (attribute_takes_identifier_p (identifier
)
23817 ? id_attr
: normal_attr
);
23818 if (is_cilkplus_vector_p (identifier
))
23820 cp_parser_cilk_simd_fn_vector_attrs (parser
, id_token
);
23824 vec
= cp_parser_parenthesized_expression_list
23825 (parser
, attr_flag
, /*cast_p=*/false,
23826 /*allow_expansion_p=*/false,
23827 /*non_constant_p=*/NULL
);
23829 arguments
= error_mark_node
;
23832 arguments
= build_tree_list_vec (vec
);
23833 release_tree_vector (vec
);
23835 /* Save the arguments away. */
23836 TREE_VALUE (attribute
) = arguments
;
23838 else if (is_cilkplus_vector_p (identifier
))
23840 cp_parser_cilk_simd_fn_vector_attrs (parser
, id_token
);
23844 if (arguments
!= error_mark_node
)
23846 /* Add this attribute to the list. */
23847 TREE_CHAIN (attribute
) = attribute_list
;
23848 attribute_list
= attribute
;
23851 token
= cp_lexer_peek_token (parser
->lexer
);
23853 /* Now, look for more attributes. If the next token isn't a
23854 `,', we're done. */
23855 if (token
->type
!= CPP_COMMA
)
23858 /* Consume the comma and keep going. */
23859 cp_lexer_consume_token (parser
->lexer
);
23861 parser
->translate_strings_p
= save_translate_strings_p
;
23863 /* We built up the list in reverse order. */
23864 return nreverse (attribute_list
);
23867 /* Parse a standard C++11 attribute.
23869 The returned representation is a TREE_LIST which TREE_PURPOSE is
23870 the scoped name of the attribute, and the TREE_VALUE is its
23873 Note that the scoped name of the attribute is itself a TREE_LIST
23874 which TREE_PURPOSE is the namespace of the attribute, and
23875 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23876 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23877 and which TREE_PURPOSE is directly the attribute name.
23879 Clients of the attribute code should use get_attribute_namespace
23880 and get_attribute_name to get the actual namespace and name of
23881 attributes, regardless of their being GNU or C++11 attributes.
23884 attribute-token attribute-argument-clause [opt]
23888 attribute-scoped-token
23890 attribute-scoped-token:
23891 attribute-namespace :: identifier
23893 attribute-namespace:
23896 attribute-argument-clause:
23897 ( balanced-token-seq )
23899 balanced-token-seq:
23900 balanced-token [opt]
23901 balanced-token-seq balanced-token
23904 ( balanced-token-seq )
23905 [ balanced-token-seq ]
23906 { balanced-token-seq }. */
23909 cp_parser_std_attribute (cp_parser
*parser
)
23911 tree attribute
, attr_ns
= NULL_TREE
, attr_id
= NULL_TREE
, arguments
;
23914 /* First, parse name of the attribute, a.k.a attribute-token. */
23916 token
= cp_lexer_peek_token (parser
->lexer
);
23917 if (token
->type
== CPP_NAME
)
23918 attr_id
= token
->u
.value
;
23919 else if (token
->type
== CPP_KEYWORD
)
23920 attr_id
= ridpointers
[(int) token
->keyword
];
23921 else if (token
->flags
& NAMED_OP
)
23922 attr_id
= get_identifier (cpp_type2name (token
->type
, token
->flags
));
23924 if (attr_id
== NULL_TREE
)
23927 cp_lexer_consume_token (parser
->lexer
);
23929 token
= cp_lexer_peek_token (parser
->lexer
);
23930 if (token
->type
== CPP_SCOPE
)
23932 /* We are seeing a scoped attribute token. */
23934 cp_lexer_consume_token (parser
->lexer
);
23937 token
= cp_lexer_consume_token (parser
->lexer
);
23938 if (token
->type
== CPP_NAME
)
23939 attr_id
= token
->u
.value
;
23940 else if (token
->type
== CPP_KEYWORD
)
23941 attr_id
= ridpointers
[(int) token
->keyword
];
23944 error_at (token
->location
,
23945 "expected an identifier for the attribute name");
23946 return error_mark_node
;
23948 attribute
= build_tree_list (build_tree_list (attr_ns
, attr_id
),
23950 token
= cp_lexer_peek_token (parser
->lexer
);
23954 attribute
= build_tree_list (build_tree_list (NULL_TREE
, attr_id
),
23956 /* C++11 noreturn attribute is equivalent to GNU's. */
23957 if (is_attribute_p ("noreturn", attr_id
))
23958 TREE_PURPOSE (TREE_PURPOSE (attribute
)) = get_identifier ("gnu");
23959 /* C++14 deprecated attribute is equivalent to GNU's. */
23960 else if (cxx_dialect
>= cxx11
&& is_attribute_p ("deprecated", attr_id
))
23962 if (cxx_dialect
== cxx11
)
23963 pedwarn (token
->location
, OPT_Wpedantic
,
23964 "%<deprecated%> is a C++14 feature;"
23965 " use %<gnu::deprecated%>");
23966 TREE_PURPOSE (TREE_PURPOSE (attribute
)) = get_identifier ("gnu");
23968 /* Transactional Memory TS optimize_for_synchronized attribute is
23969 equivalent to GNU transaction_callable. */
23970 else if (is_attribute_p ("optimize_for_synchronized", attr_id
))
23971 TREE_PURPOSE (attribute
)
23972 = get_identifier ("transaction_callable");
23973 /* Transactional Memory attributes are GNU attributes. */
23974 else if (tm_attr_to_mask (attr_id
))
23975 TREE_PURPOSE (attribute
) = attr_id
;
23978 /* Now parse the optional argument clause of the attribute. */
23980 if (token
->type
!= CPP_OPEN_PAREN
)
23984 vec
<tree
, va_gc
> *vec
;
23985 int attr_flag
= normal_attr
;
23987 if (attr_ns
== get_identifier ("gnu")
23988 && attribute_takes_identifier_p (attr_id
))
23989 /* A GNU attribute that takes an identifier in parameter. */
23990 attr_flag
= id_attr
;
23992 vec
= cp_parser_parenthesized_expression_list
23993 (parser
, attr_flag
, /*cast_p=*/false,
23994 /*allow_expansion_p=*/true,
23995 /*non_constant_p=*/NULL
);
23997 arguments
= error_mark_node
;
24000 arguments
= build_tree_list_vec (vec
);
24001 release_tree_vector (vec
);
24004 if (arguments
== error_mark_node
)
24005 attribute
= error_mark_node
;
24007 TREE_VALUE (attribute
) = arguments
;
24013 /* Check that the attribute ATTRIBUTE appears at most once in the
24014 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
24015 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
24016 isn't implemented yet in GCC. */
24019 cp_parser_check_std_attribute (tree attributes
, tree attribute
)
24023 tree name
= get_attribute_name (attribute
);
24024 if (is_attribute_p ("noreturn", name
)
24025 && lookup_attribute ("noreturn", attributes
))
24026 error ("attribute noreturn can appear at most once "
24027 "in an attribute-list");
24028 else if (is_attribute_p ("deprecated", name
)
24029 && lookup_attribute ("deprecated", attributes
))
24030 error ("attribute deprecated can appear at most once "
24031 "in an attribute-list");
24035 /* Parse a list of standard C++-11 attributes.
24039 attribute-list , attribute[opt]
24041 attribute-list , attribute ...
24045 cp_parser_std_attribute_list (cp_parser
*parser
)
24047 tree attributes
= NULL_TREE
, attribute
= NULL_TREE
;
24048 cp_token
*token
= NULL
;
24052 attribute
= cp_parser_std_attribute (parser
);
24053 if (attribute
== error_mark_node
)
24055 if (attribute
!= NULL_TREE
)
24057 cp_parser_check_std_attribute (attributes
, attribute
);
24058 TREE_CHAIN (attribute
) = attributes
;
24059 attributes
= attribute
;
24061 token
= cp_lexer_peek_token (parser
->lexer
);
24062 if (token
->type
== CPP_ELLIPSIS
)
24064 cp_lexer_consume_token (parser
->lexer
);
24065 TREE_VALUE (attribute
)
24066 = make_pack_expansion (TREE_VALUE (attribute
));
24067 token
= cp_lexer_peek_token (parser
->lexer
);
24069 if (token
->type
!= CPP_COMMA
)
24071 cp_lexer_consume_token (parser
->lexer
);
24073 attributes
= nreverse (attributes
);
24077 /* Parse a standard C++-11 attribute specifier.
24079 attribute-specifier:
24080 [ [ attribute-list ] ]
24081 alignment-specifier
24083 alignment-specifier:
24084 alignas ( type-id ... [opt] )
24085 alignas ( alignment-expression ... [opt] ). */
24088 cp_parser_std_attribute_spec (cp_parser
*parser
)
24090 tree attributes
= NULL_TREE
;
24091 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
24093 if (token
->type
== CPP_OPEN_SQUARE
24094 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_OPEN_SQUARE
)
24096 cp_lexer_consume_token (parser
->lexer
);
24097 cp_lexer_consume_token (parser
->lexer
);
24099 attributes
= cp_parser_std_attribute_list (parser
);
24101 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
)
24102 || !cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
24103 cp_parser_skip_to_end_of_statement (parser
);
24105 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24106 when we are sure that we have actually parsed them. */
24107 maybe_warn_cpp0x (CPP0X_ATTRIBUTES
);
24113 /* Look for an alignment-specifier. */
24115 token
= cp_lexer_peek_token (parser
->lexer
);
24117 if (token
->type
!= CPP_KEYWORD
24118 || token
->keyword
!= RID_ALIGNAS
)
24121 cp_lexer_consume_token (parser
->lexer
);
24122 maybe_warn_cpp0x (CPP0X_ATTRIBUTES
);
24124 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
) == NULL
)
24126 cp_parser_error (parser
, "expected %<(%>");
24127 return error_mark_node
;
24130 cp_parser_parse_tentatively (parser
);
24131 alignas_expr
= cp_parser_type_id (parser
);
24133 if (!cp_parser_parse_definitely (parser
))
24135 gcc_assert (alignas_expr
== error_mark_node
24136 || alignas_expr
== NULL_TREE
);
24139 cp_parser_assignment_expression (parser
);
24140 if (alignas_expr
== error_mark_node
)
24141 cp_parser_skip_to_end_of_statement (parser
);
24142 if (alignas_expr
== NULL_TREE
24143 || alignas_expr
== error_mark_node
)
24144 return alignas_expr
;
24147 alignas_expr
= cxx_alignas_expr (alignas_expr
);
24148 alignas_expr
= build_tree_list (NULL_TREE
, alignas_expr
);
24150 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
24152 cp_lexer_consume_token (parser
->lexer
);
24153 alignas_expr
= make_pack_expansion (alignas_expr
);
24156 if (cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
) == NULL
)
24158 cp_parser_error (parser
, "expected %<)%>");
24159 return error_mark_node
;
24162 /* Build the C++-11 representation of an 'aligned'
24165 build_tree_list (build_tree_list (get_identifier ("gnu"),
24166 get_identifier ("aligned")),
24173 /* Parse a standard C++-11 attribute-specifier-seq.
24175 attribute-specifier-seq:
24176 attribute-specifier-seq [opt] attribute-specifier
24180 cp_parser_std_attribute_spec_seq (cp_parser
*parser
)
24182 tree attr_specs
= NULL_TREE
;
24183 tree attr_last
= NULL_TREE
;
24187 tree attr_spec
= cp_parser_std_attribute_spec (parser
);
24188 if (attr_spec
== NULL_TREE
)
24190 if (attr_spec
== error_mark_node
)
24191 return error_mark_node
;
24194 TREE_CHAIN (attr_last
) = attr_spec
;
24196 attr_specs
= attr_last
= attr_spec
;
24197 attr_last
= tree_last (attr_last
);
24203 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24204 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24205 current value of the PEDANTIC flag, regardless of whether or not
24206 the `__extension__' keyword is present. The caller is responsible
24207 for restoring the value of the PEDANTIC flag. */
24210 cp_parser_extension_opt (cp_parser
* parser
, int* saved_pedantic
)
24212 /* Save the old value of the PEDANTIC flag. */
24213 *saved_pedantic
= pedantic
;
24215 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXTENSION
))
24217 /* Consume the `__extension__' token. */
24218 cp_lexer_consume_token (parser
->lexer
);
24219 /* We're not being pedantic while the `__extension__' keyword is
24229 /* Parse a label declaration.
24232 __label__ label-declarator-seq ;
24234 label-declarator-seq:
24235 identifier , label-declarator-seq
24239 cp_parser_label_declaration (cp_parser
* parser
)
24241 /* Look for the `__label__' keyword. */
24242 cp_parser_require_keyword (parser
, RID_LABEL
, RT_LABEL
);
24248 /* Look for an identifier. */
24249 identifier
= cp_parser_identifier (parser
);
24250 /* If we failed, stop. */
24251 if (identifier
== error_mark_node
)
24253 /* Declare it as a label. */
24254 finish_label_decl (identifier
);
24255 /* If the next token is a `;', stop. */
24256 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
24258 /* Look for the `,' separating the label declarations. */
24259 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
24262 /* Look for the final `;'. */
24263 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
24266 // -------------------------------------------------------------------------- //
24269 // Parse a requires clause.
24271 // requires-clause:
24272 // 'requires' logical-or-expression
24274 // The required logical-or-expression must be a constant expression. Note
24275 // that we don't check that the expression is constepxr here. We defer until
24276 // we analyze constraints and then, we only check atomic constraints.
24278 cp_parser_requires_clause (cp_parser
*parser
)
24280 // Parse the requires clause so that it is not automatically folded.
24281 ++processing_template_decl
;
24282 tree expr
= cp_parser_binary_expression (parser
, false, false,
24283 PREC_NOT_OPERATOR
, NULL
);
24284 if (check_for_bare_parameter_packs (expr
))
24285 expr
= error_mark_node
;
24286 --processing_template_decl
;
24290 // Optionally parse a requires clause:
24292 cp_parser_requires_clause_opt (cp_parser
*parser
)
24294 cp_token
*tok
= cp_lexer_peek_token (parser
->lexer
);
24295 if (tok
->keyword
!= RID_REQUIRES
)
24297 if (!flag_concepts
&& tok
->type
== CPP_NAME
24298 && tok
->u
.value
== ridpointers
[RID_REQUIRES
])
24300 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
24301 "%<requires%> only available with -fconcepts");
24302 /* Parse and discard the requires-clause. */
24303 cp_lexer_consume_token (parser
->lexer
);
24304 cp_parser_requires_clause (parser
);
24308 cp_lexer_consume_token (parser
->lexer
);
24309 return cp_parser_requires_clause (parser
);
24313 /*---------------------------------------------------------------------------
24314 Requires expressions
24315 ---------------------------------------------------------------------------*/
24317 /* Parse a requires expression
24319 requirement-expression:
24320 'requires' requirement-parameter-list [opt] requirement-body */
24322 cp_parser_requires_expression (cp_parser
*parser
)
24324 gcc_assert (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_REQUIRES
));
24325 location_t loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
24327 /* A requires-expression shall appear only within a concept
24328 definition or a requires-clause.
24330 TODO: Implement this diagnostic correctly. */
24331 if (!processing_template_decl
)
24333 error_at (loc
, "a requires expression cannot appear outside a template");
24334 cp_parser_skip_to_end_of_statement (parser
);
24335 return error_mark_node
;
24340 /* Local parameters are delared as variables within the scope
24341 of the expression. They are not visible past the end of
24342 the expression. Expressions within the requires-expression
24343 are unevaluated. */
24344 struct scope_sentinel
24348 ++cp_unevaluated_operand
;
24349 begin_scope (sk_block
, NULL_TREE
);
24354 pop_bindings_and_leave_scope ();
24355 --cp_unevaluated_operand
;
24359 /* Parse the optional parameter list. */
24360 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
24362 parms
= cp_parser_requirement_parameter_list (parser
);
24363 if (parms
== error_mark_node
)
24364 return error_mark_node
;
24369 /* Parse the requirement body. */
24370 reqs
= cp_parser_requirement_body (parser
);
24371 if (reqs
== error_mark_node
)
24372 return error_mark_node
;
24375 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24377 grokparms (parms
, &parms
);
24378 return finish_requires_expr (parms
, reqs
);
24381 /* Parse a parameterized requirement.
24383 requirement-parameter-list:
24384 '(' parameter-declaration-clause ')' */
24386 cp_parser_requirement_parameter_list (cp_parser
*parser
)
24388 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24389 return error_mark_node
;
24391 tree parms
= cp_parser_parameter_declaration_clause (parser
);
24393 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24394 return error_mark_node
;
24399 /* Parse the body of a requirement.
24402 '{' requirement-list '}' */
24404 cp_parser_requirement_body (cp_parser
*parser
)
24406 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
24407 return error_mark_node
;
24409 tree reqs
= cp_parser_requirement_list (parser
);
24411 if (!cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
))
24412 return error_mark_node
;
24417 /* Parse a list of requirements.
24421 requirement-list ';' requirement[opt] */
24423 cp_parser_requirement_list (cp_parser
*parser
)
24425 tree result
= NULL_TREE
;
24428 tree req
= cp_parser_requirement (parser
);
24429 if (req
== error_mark_node
)
24430 return error_mark_node
;
24432 result
= tree_cons (NULL_TREE
, req
, result
);
24434 /* If we see a semi-colon, consume it. */
24435 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
24436 cp_lexer_consume_token (parser
->lexer
);
24438 /* Stop processing at the end of the list. */
24439 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
24443 /* Reverse the order of requirements so they are analyzed in
24444 declaration order. */
24445 return nreverse (result
);
24448 /* Parse a syntactic requirement or type requirement.
24452 compound-requirement
24454 nested-requirement */
24456 cp_parser_requirement (cp_parser
*parser
)
24458 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
24459 return cp_parser_compound_requirement (parser
);
24460 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
24461 return cp_parser_type_requirement (parser
);
24462 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_REQUIRES
))
24463 return cp_parser_nested_requirement (parser
);
24465 return cp_parser_simple_requirement (parser
);
24468 /* Parse a simple requirement.
24470 simple-requirement:
24473 cp_parser_simple_requirement (cp_parser
*parser
)
24475 tree expr
= cp_parser_expression (parser
, NULL
, false, false);
24476 if (!expr
|| expr
== error_mark_node
)
24477 return error_mark_node
;
24479 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
24480 return error_mark_node
;
24482 return finish_simple_requirement (expr
);
24485 /* Parse a type requirement
24488 nested-name-specifier [opt] required-type-name ';'
24490 required-type-name:
24492 'template' [opt] simple-template-id */
24494 cp_parser_type_requirement (cp_parser
*parser
)
24496 cp_lexer_consume_token (parser
->lexer
);
24498 // Save the scope before parsing name specifiers.
24499 tree saved_scope
= parser
->scope
;
24500 tree saved_object_scope
= parser
->object_scope
;
24501 tree saved_qualifying_scope
= parser
->qualifying_scope
;
24502 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
24503 cp_parser_nested_name_specifier_opt (parser
,
24504 /*typename_keyword_p=*/true,
24505 /*check_dependency_p=*/false,
24507 /*is_declaration=*/false);
24510 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
24512 cp_lexer_consume_token (parser
->lexer
);
24513 type
= cp_parser_template_id (parser
,
24514 /*template_keyword_p=*/true,
24515 /*check_dependency=*/false,
24516 /*tag_type=*/none_type
,
24517 /*is_declaration=*/false);
24518 type
= make_typename_type (parser
->scope
, type
, typename_type
,
24519 /*complain=*/tf_error
);
24522 type
= cp_parser_type_name (parser
, /*typename_keyword_p=*/true);
24524 if (TREE_CODE (type
) == TYPE_DECL
)
24525 type
= TREE_TYPE (type
);
24527 parser
->scope
= saved_scope
;
24528 parser
->object_scope
= saved_object_scope
;
24529 parser
->qualifying_scope
= saved_qualifying_scope
;
24531 if (type
== error_mark_node
)
24532 cp_parser_skip_to_end_of_statement (parser
);
24534 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
24535 return error_mark_node
;
24536 if (type
== error_mark_node
)
24537 return error_mark_node
;
24539 return finish_type_requirement (type
);
24542 /* Parse a compound requirement
24544 compound-requirement:
24545 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24547 cp_parser_compound_requirement (cp_parser
*parser
)
24549 /* Parse an expression enclosed in '{ }'s. */
24550 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
24551 return error_mark_node
;
24553 tree expr
= cp_parser_expression (parser
, NULL
, false, false);
24554 if (!expr
|| expr
== error_mark_node
)
24555 return error_mark_node
;
24557 if (!cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
))
24558 return error_mark_node
;
24560 /* Parse the optional noexcept. */
24561 bool noexcept_p
= false;
24562 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_NOEXCEPT
))
24564 cp_lexer_consume_token (parser
->lexer
);
24568 /* Parse the optional trailing return type. */
24569 tree type
= NULL_TREE
;
24570 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
24572 cp_lexer_consume_token (parser
->lexer
);
24573 bool saved_result_type_constraint_p
= parser
->in_result_type_constraint_p
;
24574 parser
->in_result_type_constraint_p
= true;
24575 type
= cp_parser_trailing_type_id (parser
);
24576 parser
->in_result_type_constraint_p
= saved_result_type_constraint_p
;
24577 if (type
== error_mark_node
)
24578 return error_mark_node
;
24581 return finish_compound_requirement (expr
, type
, noexcept_p
);
24584 /* Parse a nested requirement. This is the same as a requires clause.
24586 nested-requirement:
24589 cp_parser_nested_requirement (cp_parser
*parser
)
24591 cp_lexer_consume_token (parser
->lexer
);
24592 tree req
= cp_parser_requires_clause (parser
);
24593 if (req
== error_mark_node
)
24594 return error_mark_node
;
24595 return finish_nested_requirement (req
);
24598 /* Support Functions */
24600 /* Return the appropriate prefer_type argument for lookup_name_real based on
24601 tag_type and template_mem_access. */
24604 prefer_type_arg (tag_types tag_type
, bool template_mem_access
= false)
24606 /* DR 141: When looking in the current enclosing context for a template-name
24607 after -> or ., only consider class templates. */
24608 if (template_mem_access
)
24612 case none_type
: return 0; // No preference.
24613 case scope_type
: return 1; // Type or namespace.
24614 default: return 2; // Type only.
24618 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24619 NAME should have one of the representations used for an
24620 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24621 is returned. If PARSER->SCOPE is a dependent type, then a
24622 SCOPE_REF is returned.
24624 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24625 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24626 was formed. Abstractly, such entities should not be passed to this
24627 function, because they do not need to be looked up, but it is
24628 simpler to check for this special case here, rather than at the
24631 In cases not explicitly covered above, this function returns a
24632 DECL, OVERLOAD, or baselink representing the result of the lookup.
24633 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24636 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24637 (e.g., "struct") that was used. In that case bindings that do not
24638 refer to types are ignored.
24640 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24643 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24646 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24649 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24650 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24651 NULL_TREE otherwise. */
24654 cp_parser_lookup_name (cp_parser
*parser
, tree name
,
24655 enum tag_types tag_type
,
24658 bool check_dependency
,
24659 tree
*ambiguous_decls
,
24660 location_t name_location
)
24663 tree object_type
= parser
->context
->object_type
;
24665 /* Assume that the lookup will be unambiguous. */
24666 if (ambiguous_decls
)
24667 *ambiguous_decls
= NULL_TREE
;
24669 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24670 no longer valid. Note that if we are parsing tentatively, and
24671 the parse fails, OBJECT_TYPE will be automatically restored. */
24672 parser
->context
->object_type
= NULL_TREE
;
24674 if (name
== error_mark_node
)
24675 return error_mark_node
;
24677 /* A template-id has already been resolved; there is no lookup to
24679 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
24681 if (BASELINK_P (name
))
24683 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name
))
24684 == TEMPLATE_ID_EXPR
);
24688 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24689 it should already have been checked to make sure that the name
24690 used matches the type being destroyed. */
24691 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
24695 /* Figure out to which type this destructor applies. */
24697 type
= parser
->scope
;
24698 else if (object_type
)
24699 type
= object_type
;
24701 type
= current_class_type
;
24702 /* If that's not a class type, there is no destructor. */
24703 if (!type
|| !CLASS_TYPE_P (type
))
24704 return error_mark_node
;
24705 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
24706 lazily_declare_fn (sfk_destructor
, type
);
24707 if (!CLASSTYPE_DESTRUCTORS (type
))
24708 return error_mark_node
;
24709 /* If it was a class type, return the destructor. */
24710 return CLASSTYPE_DESTRUCTORS (type
);
24713 /* By this point, the NAME should be an ordinary identifier. If
24714 the id-expression was a qualified name, the qualifying scope is
24715 stored in PARSER->SCOPE at this point. */
24716 gcc_assert (identifier_p (name
));
24718 /* Perform the lookup. */
24723 if (parser
->scope
== error_mark_node
)
24724 return error_mark_node
;
24726 /* If the SCOPE is dependent, the lookup must be deferred until
24727 the template is instantiated -- unless we are explicitly
24728 looking up names in uninstantiated templates. Even then, we
24729 cannot look up the name if the scope is not a class type; it
24730 might, for example, be a template type parameter. */
24731 dependent_p
= (TYPE_P (parser
->scope
)
24732 && dependent_scope_p (parser
->scope
));
24733 if ((check_dependency
|| !CLASS_TYPE_P (parser
->scope
))
24735 /* Defer lookup. */
24736 decl
= error_mark_node
;
24739 tree pushed_scope
= NULL_TREE
;
24741 /* If PARSER->SCOPE is a dependent type, then it must be a
24742 class type, and we must not be checking dependencies;
24743 otherwise, we would have processed this lookup above. So
24744 that PARSER->SCOPE is not considered a dependent base by
24745 lookup_member, we must enter the scope here. */
24747 pushed_scope
= push_scope (parser
->scope
);
24749 /* If the PARSER->SCOPE is a template specialization, it
24750 may be instantiated during name lookup. In that case,
24751 errors may be issued. Even if we rollback the current
24752 tentative parse, those errors are valid. */
24753 decl
= lookup_qualified_name (parser
->scope
, name
,
24754 prefer_type_arg (tag_type
),
24755 /*complain=*/true);
24757 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24758 lookup result and the nested-name-specifier nominates a class C:
24759 * if the name specified after the nested-name-specifier, when
24760 looked up in C, is the injected-class-name of C (Clause 9), or
24761 * if the name specified after the nested-name-specifier is the
24762 same as the identifier or the simple-template-id's template-
24763 name in the last component of the nested-name-specifier,
24764 the name is instead considered to name the constructor of
24765 class C. [ Note: for example, the constructor is not an
24766 acceptable lookup result in an elaborated-type-specifier so
24767 the constructor would not be used in place of the
24768 injected-class-name. --end note ] Such a constructor name
24769 shall be used only in the declarator-id of a declaration that
24770 names a constructor or in a using-declaration. */
24771 if (tag_type
== none_type
24772 && DECL_SELF_REFERENCE_P (decl
)
24773 && same_type_p (DECL_CONTEXT (decl
), parser
->scope
))
24774 decl
= lookup_qualified_name (parser
->scope
, ctor_identifier
,
24775 prefer_type_arg (tag_type
),
24776 /*complain=*/true);
24778 /* If we have a single function from a using decl, pull it out. */
24779 if (TREE_CODE (decl
) == OVERLOAD
24780 && !really_overloaded_fn (decl
))
24781 decl
= OVL_FUNCTION (decl
);
24784 pop_scope (pushed_scope
);
24787 /* If the scope is a dependent type and either we deferred lookup or
24788 we did lookup but didn't find the name, rememeber the name. */
24789 if (decl
== error_mark_node
&& TYPE_P (parser
->scope
)
24790 && dependent_type_p (parser
->scope
))
24796 /* The resolution to Core Issue 180 says that `struct
24797 A::B' should be considered a type-name, even if `A'
24799 type
= make_typename_type (parser
->scope
, name
, tag_type
,
24800 /*complain=*/tf_error
);
24801 if (type
!= error_mark_node
)
24802 decl
= TYPE_NAME (type
);
24804 else if (is_template
24805 && (cp_parser_next_token_ends_template_argument_p (parser
)
24806 || cp_lexer_next_token_is (parser
->lexer
,
24808 decl
= make_unbound_class_template (parser
->scope
,
24810 /*complain=*/tf_error
);
24812 decl
= build_qualified_name (/*type=*/NULL_TREE
,
24813 parser
->scope
, name
,
24816 parser
->qualifying_scope
= parser
->scope
;
24817 parser
->object_scope
= NULL_TREE
;
24819 else if (object_type
)
24821 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24822 OBJECT_TYPE is not a class. */
24823 if (CLASS_TYPE_P (object_type
))
24824 /* If the OBJECT_TYPE is a template specialization, it may
24825 be instantiated during name lookup. In that case, errors
24826 may be issued. Even if we rollback the current tentative
24827 parse, those errors are valid. */
24828 decl
= lookup_member (object_type
,
24831 prefer_type_arg (tag_type
),
24832 tf_warning_or_error
);
24837 /* Look it up in the enclosing context. DR 141: When looking for a
24838 template-name after -> or ., only consider class templates. */
24839 decl
= lookup_name_real (name
, prefer_type_arg (tag_type
, is_template
),
24841 /*block_p=*/true, is_namespace
, 0);
24842 if (object_type
== unknown_type_node
)
24843 /* The object is type-dependent, so we can't look anything up; we used
24844 this to get the DR 141 behavior. */
24845 object_type
= NULL_TREE
;
24846 parser
->object_scope
= object_type
;
24847 parser
->qualifying_scope
= NULL_TREE
;
24851 decl
= lookup_name_real (name
, prefer_type_arg (tag_type
),
24853 /*block_p=*/true, is_namespace
, 0);
24854 parser
->qualifying_scope
= NULL_TREE
;
24855 parser
->object_scope
= NULL_TREE
;
24858 /* If the lookup failed, let our caller know. */
24859 if (!decl
|| decl
== error_mark_node
)
24860 return error_mark_node
;
24862 /* Pull out the template from an injected-class-name (or multiple). */
24864 decl
= maybe_get_template_decl_from_type_decl (decl
);
24866 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24867 if (TREE_CODE (decl
) == TREE_LIST
)
24869 if (ambiguous_decls
)
24870 *ambiguous_decls
= decl
;
24871 /* The error message we have to print is too complicated for
24872 cp_parser_error, so we incorporate its actions directly. */
24873 if (!cp_parser_simulate_error (parser
))
24875 error_at (name_location
, "reference to %qD is ambiguous",
24877 print_candidates (decl
);
24879 return error_mark_node
;
24882 gcc_assert (DECL_P (decl
)
24883 || TREE_CODE (decl
) == OVERLOAD
24884 || TREE_CODE (decl
) == SCOPE_REF
24885 || TREE_CODE (decl
) == UNBOUND_CLASS_TEMPLATE
24886 || BASELINK_P (decl
));
24888 /* If we have resolved the name of a member declaration, check to
24889 see if the declaration is accessible. When the name resolves to
24890 set of overloaded functions, accessibility is checked when
24891 overload resolution is done.
24893 During an explicit instantiation, access is not checked at all,
24894 as per [temp.explicit]. */
24896 check_accessibility_of_qualified_id (decl
, object_type
, parser
->scope
);
24898 maybe_record_typedef_use (decl
);
24900 return cp_expr (decl
, name_location
);
24903 /* Like cp_parser_lookup_name, but for use in the typical case where
24904 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24905 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24908 cp_parser_lookup_name_simple (cp_parser
* parser
, tree name
, location_t location
)
24910 return cp_parser_lookup_name (parser
, name
,
24912 /*is_template=*/false,
24913 /*is_namespace=*/false,
24914 /*check_dependency=*/true,
24915 /*ambiguous_decls=*/NULL
,
24919 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24920 the current context, return the TYPE_DECL. If TAG_NAME_P is
24921 true, the DECL indicates the class being defined in a class-head,
24922 or declared in an elaborated-type-specifier.
24924 Otherwise, return DECL. */
24927 cp_parser_maybe_treat_template_as_class (tree decl
, bool tag_name_p
)
24929 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24930 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24933 template <typename T> struct B;
24936 template <typename T> struct A::B {};
24938 Similarly, in an elaborated-type-specifier:
24940 namespace N { struct X{}; }
24943 template <typename T> friend struct N::X;
24946 However, if the DECL refers to a class type, and we are in
24947 the scope of the class, then the name lookup automatically
24948 finds the TYPE_DECL created by build_self_reference rather
24949 than a TEMPLATE_DECL. For example, in:
24951 template <class T> struct S {
24955 there is no need to handle such case. */
24957 if (DECL_CLASS_TEMPLATE_P (decl
) && tag_name_p
)
24958 return DECL_TEMPLATE_RESULT (decl
);
24963 /* If too many, or too few, template-parameter lists apply to the
24964 declarator, issue an error message. Returns TRUE if all went well,
24965 and FALSE otherwise. */
24968 cp_parser_check_declarator_template_parameters (cp_parser
* parser
,
24969 cp_declarator
*declarator
,
24970 location_t declarator_location
)
24972 switch (declarator
->kind
)
24976 unsigned num_templates
= 0;
24977 tree scope
= declarator
->u
.id
.qualifying_scope
;
24980 num_templates
= num_template_headers_for_class (scope
);
24981 else if (TREE_CODE (declarator
->u
.id
.unqualified_name
)
24982 == TEMPLATE_ID_EXPR
)
24983 /* If the DECLARATOR has the form `X<y>' then it uses one
24984 additional level of template parameters. */
24987 return cp_parser_check_template_parameters
24988 (parser
, num_templates
, declarator_location
, declarator
);
24994 case cdk_reference
:
24996 return (cp_parser_check_declarator_template_parameters
24997 (parser
, declarator
->declarator
, declarator_location
));
25003 gcc_unreachable ();
25008 /* NUM_TEMPLATES were used in the current declaration. If that is
25009 invalid, return FALSE and issue an error messages. Otherwise,
25010 return TRUE. If DECLARATOR is non-NULL, then we are checking a
25011 declarator and we can print more accurate diagnostics. */
25014 cp_parser_check_template_parameters (cp_parser
* parser
,
25015 unsigned num_templates
,
25016 location_t location
,
25017 cp_declarator
*declarator
)
25019 /* If there are the same number of template classes and parameter
25020 lists, that's OK. */
25021 if (parser
->num_template_parameter_lists
== num_templates
)
25023 /* If there are more, but only one more, then we are referring to a
25024 member template. That's OK too. */
25025 if (parser
->num_template_parameter_lists
== num_templates
+ 1)
25027 /* If there are more template classes than parameter lists, we have
25030 template <class T> void S<T>::R<T>::f (); */
25031 if (parser
->num_template_parameter_lists
< num_templates
)
25033 if (declarator
&& !current_function_decl
)
25034 error_at (location
, "specializing member %<%T::%E%> "
25035 "requires %<template<>%> syntax",
25036 declarator
->u
.id
.qualifying_scope
,
25037 declarator
->u
.id
.unqualified_name
);
25038 else if (declarator
)
25039 error_at (location
, "invalid declaration of %<%T::%E%>",
25040 declarator
->u
.id
.qualifying_scope
,
25041 declarator
->u
.id
.unqualified_name
);
25043 error_at (location
, "too few template-parameter-lists");
25046 /* Otherwise, there are too many template parameter lists. We have
25049 template <class T> template <class U> void S::f(); */
25050 error_at (location
, "too many template-parameter-lists");
25054 /* Parse an optional `::' token indicating that the following name is
25055 from the global namespace. If so, PARSER->SCOPE is set to the
25056 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
25057 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
25058 Returns the new value of PARSER->SCOPE, if the `::' token is
25059 present, and NULL_TREE otherwise. */
25062 cp_parser_global_scope_opt (cp_parser
* parser
, bool current_scope_valid_p
)
25066 /* Peek at the next token. */
25067 token
= cp_lexer_peek_token (parser
->lexer
);
25068 /* If we're looking at a `::' token then we're starting from the
25069 global namespace, not our current location. */
25070 if (token
->type
== CPP_SCOPE
)
25072 /* Consume the `::' token. */
25073 cp_lexer_consume_token (parser
->lexer
);
25074 /* Set the SCOPE so that we know where to start the lookup. */
25075 parser
->scope
= global_namespace
;
25076 parser
->qualifying_scope
= global_namespace
;
25077 parser
->object_scope
= NULL_TREE
;
25079 return parser
->scope
;
25081 else if (!current_scope_valid_p
)
25083 parser
->scope
= NULL_TREE
;
25084 parser
->qualifying_scope
= NULL_TREE
;
25085 parser
->object_scope
= NULL_TREE
;
25091 /* Returns TRUE if the upcoming token sequence is the start of a
25092 constructor declarator. If FRIEND_P is true, the declarator is
25093 preceded by the `friend' specifier. */
25096 cp_parser_constructor_declarator_p (cp_parser
*parser
, bool friend_p
)
25098 bool constructor_p
;
25099 bool outside_class_specifier_p
;
25100 tree nested_name_specifier
;
25101 cp_token
*next_token
;
25103 /* The common case is that this is not a constructor declarator, so
25104 try to avoid doing lots of work if at all possible. It's not
25105 valid declare a constructor at function scope. */
25106 if (parser
->in_function_body
)
25108 /* And only certain tokens can begin a constructor declarator. */
25109 next_token
= cp_lexer_peek_token (parser
->lexer
);
25110 if (next_token
->type
!= CPP_NAME
25111 && next_token
->type
!= CPP_SCOPE
25112 && next_token
->type
!= CPP_NESTED_NAME_SPECIFIER
25113 && next_token
->type
!= CPP_TEMPLATE_ID
)
25116 /* Parse tentatively; we are going to roll back all of the tokens
25118 cp_parser_parse_tentatively (parser
);
25119 /* Assume that we are looking at a constructor declarator. */
25120 constructor_p
= true;
25122 /* Look for the optional `::' operator. */
25123 cp_parser_global_scope_opt (parser
,
25124 /*current_scope_valid_p=*/false);
25125 /* Look for the nested-name-specifier. */
25126 nested_name_specifier
25127 = (cp_parser_nested_name_specifier_opt (parser
,
25128 /*typename_keyword_p=*/false,
25129 /*check_dependency_p=*/false,
25131 /*is_declaration=*/false));
25133 outside_class_specifier_p
= (!at_class_scope_p ()
25134 || !TYPE_BEING_DEFINED (current_class_type
)
25137 /* Outside of a class-specifier, there must be a
25138 nested-name-specifier. */
25139 if (!nested_name_specifier
&& outside_class_specifier_p
)
25140 constructor_p
= false;
25141 else if (nested_name_specifier
== error_mark_node
)
25142 constructor_p
= false;
25144 /* If we have a class scope, this is easy; DR 147 says that S::S always
25145 names the constructor, and no other qualified name could. */
25146 if (constructor_p
&& nested_name_specifier
25147 && CLASS_TYPE_P (nested_name_specifier
))
25149 tree id
= cp_parser_unqualified_id (parser
,
25150 /*template_keyword_p=*/false,
25151 /*check_dependency_p=*/false,
25152 /*declarator_p=*/true,
25153 /*optional_p=*/false);
25154 if (is_overloaded_fn (id
))
25155 id
= DECL_NAME (get_first_fn (id
));
25156 if (!constructor_name_p (id
, nested_name_specifier
))
25157 constructor_p
= false;
25159 /* If we still think that this might be a constructor-declarator,
25160 look for a class-name. */
25161 else if (constructor_p
)
25165 template <typename T> struct S {
25169 we must recognize that the nested `S' names a class. */
25171 type_decl
= cp_parser_class_name (parser
,
25172 /*typename_keyword_p=*/false,
25173 /*template_keyword_p=*/false,
25175 /*check_dependency_p=*/false,
25176 /*class_head_p=*/false,
25177 /*is_declaration=*/false);
25178 /* If there was no class-name, then this is not a constructor.
25179 Otherwise, if we are in a class-specifier and we aren't
25180 handling a friend declaration, check that its type matches
25181 current_class_type (c++/38313). Note: error_mark_node
25182 is left alone for error recovery purposes. */
25183 constructor_p
= (!cp_parser_error_occurred (parser
)
25184 && (outside_class_specifier_p
25185 || type_decl
== error_mark_node
25186 || same_type_p (current_class_type
,
25187 TREE_TYPE (type_decl
))));
25189 /* If we're still considering a constructor, we have to see a `(',
25190 to begin the parameter-declaration-clause, followed by either a
25191 `)', an `...', or a decl-specifier. We need to check for a
25192 type-specifier to avoid being fooled into thinking that:
25196 is a constructor. (It is actually a function named `f' that
25197 takes one parameter (of type `int') and returns a value of type
25200 && !cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
25201 constructor_p
= false;
25204 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
25205 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
)
25206 /* A parameter declaration begins with a decl-specifier,
25207 which is either the "attribute" keyword, a storage class
25208 specifier, or (usually) a type-specifier. */
25209 && !cp_lexer_next_token_is_decl_specifier_keyword (parser
->lexer
))
25212 tree pushed_scope
= NULL_TREE
;
25213 unsigned saved_num_template_parameter_lists
;
25215 /* Names appearing in the type-specifier should be looked up
25216 in the scope of the class. */
25217 if (current_class_type
)
25221 type
= TREE_TYPE (type_decl
);
25222 if (TREE_CODE (type
) == TYPENAME_TYPE
)
25224 type
= resolve_typename_type (type
,
25225 /*only_current_p=*/false);
25226 if (TREE_CODE (type
) == TYPENAME_TYPE
)
25228 cp_parser_abort_tentative_parse (parser
);
25232 pushed_scope
= push_scope (type
);
25235 /* Inside the constructor parameter list, surrounding
25236 template-parameter-lists do not apply. */
25237 saved_num_template_parameter_lists
25238 = parser
->num_template_parameter_lists
;
25239 parser
->num_template_parameter_lists
= 0;
25241 /* Look for the type-specifier. */
25242 cp_parser_type_specifier (parser
,
25243 CP_PARSER_FLAGS_NONE
,
25244 /*decl_specs=*/NULL
,
25245 /*is_declarator=*/true,
25246 /*declares_class_or_enum=*/NULL
,
25247 /*is_cv_qualifier=*/NULL
);
25249 parser
->num_template_parameter_lists
25250 = saved_num_template_parameter_lists
;
25252 /* Leave the scope of the class. */
25254 pop_scope (pushed_scope
);
25256 constructor_p
= !cp_parser_error_occurred (parser
);
25260 /* We did not really want to consume any tokens. */
25261 cp_parser_abort_tentative_parse (parser
);
25263 return constructor_p
;
25266 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25267 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25268 they must be performed once we are in the scope of the function.
25270 Returns the function defined. */
25273 cp_parser_function_definition_from_specifiers_and_declarator
25274 (cp_parser
* parser
,
25275 cp_decl_specifier_seq
*decl_specifiers
,
25277 const cp_declarator
*declarator
)
25282 /* Begin the function-definition. */
25283 success_p
= start_function (decl_specifiers
, declarator
, attributes
);
25285 /* The things we're about to see are not directly qualified by any
25286 template headers we've seen thus far. */
25287 reset_specialization ();
25289 /* If there were names looked up in the decl-specifier-seq that we
25290 did not check, check them now. We must wait until we are in the
25291 scope of the function to perform the checks, since the function
25292 might be a friend. */
25293 perform_deferred_access_checks (tf_warning_or_error
);
25297 cp_finalize_omp_declare_simd (parser
, current_function_decl
);
25298 parser
->omp_declare_simd
= NULL
;
25299 cp_finalize_oacc_routine (parser
, current_function_decl
, true);
25300 parser
->oacc_routine
= NULL
;
25305 /* Skip the entire function. */
25306 cp_parser_skip_to_end_of_block_or_statement (parser
);
25307 fn
= error_mark_node
;
25309 else if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
25311 /* Seen already, skip it. An error message has already been output. */
25312 cp_parser_skip_to_end_of_block_or_statement (parser
);
25313 fn
= current_function_decl
;
25314 current_function_decl
= NULL_TREE
;
25315 /* If this is a function from a class, pop the nested class. */
25316 if (current_class_name
)
25317 pop_nested_class ();
25322 if (DECL_DECLARED_INLINE_P (current_function_decl
))
25323 tv
= TV_PARSE_INLINE
;
25325 tv
= TV_PARSE_FUNC
;
25327 fn
= cp_parser_function_definition_after_declarator (parser
,
25328 /*inline_p=*/false);
25335 /* Parse the part of a function-definition that follows the
25336 declarator. INLINE_P is TRUE iff this function is an inline
25337 function defined within a class-specifier.
25339 Returns the function defined. */
25342 cp_parser_function_definition_after_declarator (cp_parser
* parser
,
25346 bool ctor_initializer_p
= false;
25347 bool saved_in_unbraced_linkage_specification_p
;
25348 bool saved_in_function_body
;
25349 unsigned saved_num_template_parameter_lists
;
25351 bool fully_implicit_function_template_p
25352 = parser
->fully_implicit_function_template_p
;
25353 parser
->fully_implicit_function_template_p
= false;
25354 tree implicit_template_parms
25355 = parser
->implicit_template_parms
;
25356 parser
->implicit_template_parms
= 0;
25357 cp_binding_level
* implicit_template_scope
25358 = parser
->implicit_template_scope
;
25359 parser
->implicit_template_scope
= 0;
25361 saved_in_function_body
= parser
->in_function_body
;
25362 parser
->in_function_body
= true;
25363 /* If the next token is `return', then the code may be trying to
25364 make use of the "named return value" extension that G++ used to
25366 token
= cp_lexer_peek_token (parser
->lexer
);
25367 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_RETURN
))
25369 /* Consume the `return' keyword. */
25370 cp_lexer_consume_token (parser
->lexer
);
25371 /* Look for the identifier that indicates what value is to be
25373 cp_parser_identifier (parser
);
25374 /* Issue an error message. */
25375 error_at (token
->location
,
25376 "named return values are no longer supported");
25377 /* Skip tokens until we reach the start of the function body. */
25380 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
25381 if (token
->type
== CPP_OPEN_BRACE
25382 || token
->type
== CPP_EOF
25383 || token
->type
== CPP_PRAGMA_EOL
)
25385 cp_lexer_consume_token (parser
->lexer
);
25388 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25389 anything declared inside `f'. */
25390 saved_in_unbraced_linkage_specification_p
25391 = parser
->in_unbraced_linkage_specification_p
;
25392 parser
->in_unbraced_linkage_specification_p
= false;
25393 /* Inside the function, surrounding template-parameter-lists do not
25395 saved_num_template_parameter_lists
25396 = parser
->num_template_parameter_lists
;
25397 parser
->num_template_parameter_lists
= 0;
25399 start_lambda_scope (current_function_decl
);
25401 /* If the next token is `try', `__transaction_atomic', or
25402 `__transaction_relaxed`, then we are looking at either function-try-block
25403 or function-transaction-block. Note that all of these include the
25405 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRANSACTION_ATOMIC
))
25406 ctor_initializer_p
= cp_parser_function_transaction (parser
,
25407 RID_TRANSACTION_ATOMIC
);
25408 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
25409 RID_TRANSACTION_RELAXED
))
25410 ctor_initializer_p
= cp_parser_function_transaction (parser
,
25411 RID_TRANSACTION_RELAXED
);
25412 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
25413 ctor_initializer_p
= cp_parser_function_try_block (parser
);
25415 ctor_initializer_p
= cp_parser_ctor_initializer_opt_and_function_body
25416 (parser
, /*in_function_try_block=*/false);
25418 finish_lambda_scope ();
25420 /* Finish the function. */
25421 fn
= finish_function ((ctor_initializer_p
? 1 : 0) |
25422 (inline_p
? 2 : 0));
25423 /* Generate code for it, if necessary. */
25424 expand_or_defer_fn (fn
);
25425 /* Restore the saved values. */
25426 parser
->in_unbraced_linkage_specification_p
25427 = saved_in_unbraced_linkage_specification_p
;
25428 parser
->num_template_parameter_lists
25429 = saved_num_template_parameter_lists
;
25430 parser
->in_function_body
= saved_in_function_body
;
25432 parser
->fully_implicit_function_template_p
25433 = fully_implicit_function_template_p
;
25434 parser
->implicit_template_parms
25435 = implicit_template_parms
;
25436 parser
->implicit_template_scope
25437 = implicit_template_scope
;
25439 if (parser
->fully_implicit_function_template_p
)
25440 finish_fully_implicit_template (parser
, /*member_decl_opt=*/0);
25445 /* Parse a template-declaration body (following argument list). */
25448 cp_parser_template_declaration_after_parameters (cp_parser
* parser
,
25449 tree parameter_list
,
25452 tree decl
= NULL_TREE
;
25453 bool friend_p
= false;
25455 /* We just processed one more parameter list. */
25456 ++parser
->num_template_parameter_lists
;
25458 /* Get the deferred access checks from the parameter list. These
25459 will be checked once we know what is being declared, as for a
25460 member template the checks must be performed in the scope of the
25461 class containing the member. */
25462 vec
<deferred_access_check
, va_gc
> *checks
= get_deferred_access_checks ();
25464 /* Tentatively parse for a new template parameter list, which can either be
25465 the template keyword or a template introduction. */
25466 if (cp_parser_template_declaration_after_export (parser
, member_p
))
25468 else if (cxx_dialect
>= cxx11
25469 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
25470 decl
= cp_parser_alias_declaration (parser
);
25473 /* There are no access checks when parsing a template, as we do not
25474 know if a specialization will be a friend. */
25475 push_deferring_access_checks (dk_no_check
);
25476 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
25477 decl
= cp_parser_single_declaration (parser
,
25480 /*explicit_specialization_p=*/false,
25482 pop_deferring_access_checks ();
25484 /* If this is a member template declaration, let the front
25486 if (member_p
&& !friend_p
&& decl
)
25488 if (TREE_CODE (decl
) == TYPE_DECL
)
25489 cp_parser_check_access_in_redeclaration (decl
, token
->location
);
25491 decl
= finish_member_template_decl (decl
);
25493 else if (friend_p
&& decl
25494 && DECL_DECLARES_TYPE_P (decl
))
25495 make_friend_class (current_class_type
, TREE_TYPE (decl
),
25496 /*complain=*/true);
25498 /* We are done with the current parameter list. */
25499 --parser
->num_template_parameter_lists
;
25501 pop_deferring_access_checks ();
25504 finish_template_decl (parameter_list
);
25506 /* Check the template arguments for a literal operator template. */
25508 && DECL_DECLARES_FUNCTION_P (decl
)
25509 && UDLIT_OPER_P (DECL_NAME (decl
)))
25512 if (parameter_list
== NULL_TREE
)
25516 int num_parms
= TREE_VEC_LENGTH (parameter_list
);
25517 if (num_parms
== 1)
25519 tree parm_list
= TREE_VEC_ELT (parameter_list
, 0);
25520 tree parm
= INNERMOST_TEMPLATE_PARMS (parm_list
);
25521 if (TREE_TYPE (parm
) != char_type_node
25522 || !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
25525 else if (num_parms
== 2 && cxx_dialect
>= cxx14
)
25527 tree parm_type
= TREE_VEC_ELT (parameter_list
, 0);
25528 tree type
= INNERMOST_TEMPLATE_PARMS (parm_type
);
25529 tree parm_list
= TREE_VEC_ELT (parameter_list
, 1);
25530 tree parm
= INNERMOST_TEMPLATE_PARMS (parm_list
);
25531 if (TREE_TYPE (parm
) != TREE_TYPE (type
)
25532 || !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
25540 if (cxx_dialect
>= cxx14
)
25541 error ("literal operator template %qD has invalid parameter list."
25542 " Expected non-type template argument pack <char...>"
25543 " or <typename CharT, CharT...>",
25546 error ("literal operator template %qD has invalid parameter list."
25547 " Expected non-type template argument pack <char...>",
25552 /* Register member declarations. */
25553 if (member_p
&& !friend_p
&& decl
&& !DECL_CLASS_TEMPLATE_P (decl
))
25554 finish_member_declaration (decl
);
25555 /* If DECL is a function template, we must return to parse it later.
25556 (Even though there is no definition, there might be default
25557 arguments that need handling.) */
25558 if (member_p
&& decl
25559 && DECL_DECLARES_FUNCTION_P (decl
))
25560 vec_safe_push (unparsed_funs_with_definitions
, decl
);
25563 /* Parse a template introduction header for a template-declaration. Returns
25564 false if tentative parse fails. */
25567 cp_parser_template_introduction (cp_parser
* parser
, bool member_p
)
25569 cp_parser_parse_tentatively (parser
);
25571 tree saved_scope
= parser
->scope
;
25572 tree saved_object_scope
= parser
->object_scope
;
25573 tree saved_qualifying_scope
= parser
->qualifying_scope
;
25575 /* Look for the optional `::' operator. */
25576 cp_parser_global_scope_opt (parser
,
25577 /*current_scope_valid_p=*/false);
25578 /* Look for the nested-name-specifier. */
25579 cp_parser_nested_name_specifier_opt (parser
,
25580 /*typename_keyword_p=*/false,
25581 /*check_dependency_p=*/true,
25583 /*is_declaration=*/false);
25585 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
25586 tree concept_name
= cp_parser_identifier (parser
);
25588 /* Look up the concept for which we will be matching
25589 template parameters. */
25590 tree tmpl_decl
= cp_parser_lookup_name_simple (parser
, concept_name
,
25592 parser
->scope
= saved_scope
;
25593 parser
->object_scope
= saved_object_scope
;
25594 parser
->qualifying_scope
= saved_qualifying_scope
;
25596 if (concept_name
== error_mark_node
)
25597 cp_parser_simulate_error (parser
);
25599 /* Look for opening brace for introduction. */
25600 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
25602 if (!cp_parser_parse_definitely (parser
))
25605 push_deferring_access_checks (dk_deferred
);
25607 /* Build vector of placeholder parameters and grab
25608 matching identifiers. */
25609 tree introduction_list
= cp_parser_introduction_list (parser
);
25611 /* The introduction-list shall not be empty. */
25612 int nargs
= TREE_VEC_LENGTH (introduction_list
);
25615 error ("empty introduction-list");
25619 /* Look for closing brace for introduction. */
25620 if (!cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
))
25623 if (tmpl_decl
== error_mark_node
)
25625 cp_parser_name_lookup_error (parser
, concept_name
, tmpl_decl
, NLE_NULL
,
25630 /* Build and associate the constraint. */
25631 tree parms
= finish_template_introduction (tmpl_decl
, introduction_list
);
25632 if (parms
&& parms
!= error_mark_node
)
25634 cp_parser_template_declaration_after_parameters (parser
, parms
,
25639 error_at (token
->location
, "no matching concept for template-introduction");
25643 /* Parse a normal template-declaration following the template keyword. */
25646 cp_parser_explicit_template_declaration (cp_parser
* parser
, bool member_p
)
25648 tree parameter_list
;
25649 bool need_lang_pop
;
25650 location_t location
= input_location
;
25652 /* Look for the `<' token. */
25653 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
25655 if (at_class_scope_p () && current_function_decl
)
25657 /* 14.5.2.2 [temp.mem]
25659 A local class shall not have member templates. */
25660 error_at (location
,
25661 "invalid declaration of member template in local class");
25662 cp_parser_skip_to_end_of_block_or_statement (parser
);
25667 A template ... shall not have C linkage. */
25668 if (current_lang_name
== lang_name_c
)
25670 error_at (location
, "template with C linkage");
25671 /* Give it C++ linkage to avoid confusing other parts of the
25673 push_lang_context (lang_name_cplusplus
);
25674 need_lang_pop
= true;
25677 need_lang_pop
= false;
25679 /* We cannot perform access checks on the template parameter
25680 declarations until we know what is being declared, just as we
25681 cannot check the decl-specifier list. */
25682 push_deferring_access_checks (dk_deferred
);
25684 /* If the next token is `>', then we have an invalid
25685 specialization. Rather than complain about an invalid template
25686 parameter, issue an error message here. */
25687 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
))
25689 cp_parser_error (parser
, "invalid explicit specialization");
25690 begin_specialization ();
25691 parameter_list
= NULL_TREE
;
25695 /* Parse the template parameters. */
25696 parameter_list
= cp_parser_template_parameter_list (parser
);
25699 /* Look for the `>'. */
25700 cp_parser_skip_to_end_of_template_parameter_list (parser
);
25702 /* Manage template requirements */
25703 tree reqs
= get_shorthand_constraints (current_template_parms
);
25704 if (tree r
= cp_parser_requires_clause_opt (parser
))
25705 reqs
= conjoin_constraints (reqs
, make_predicate_constraint (r
));
25706 TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
) = reqs
;
25708 cp_parser_template_declaration_after_parameters (parser
, parameter_list
,
25711 /* For the erroneous case of a template with C linkage, we pushed an
25712 implicit C++ linkage scope; exit that scope now. */
25714 pop_lang_context ();
25717 /* Parse a template-declaration, assuming that the `export' (and
25718 `extern') keywords, if present, has already been scanned. MEMBER_P
25719 is as for cp_parser_template_declaration. */
25722 cp_parser_template_declaration_after_export (cp_parser
* parser
, bool member_p
)
25724 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
25726 cp_lexer_consume_token (parser
->lexer
);
25727 cp_parser_explicit_template_declaration (parser
, member_p
);
25730 else if (flag_concepts
)
25731 return cp_parser_template_introduction (parser
, member_p
);
25736 /* Perform the deferred access checks from a template-parameter-list.
25737 CHECKS is a TREE_LIST of access checks, as returned by
25738 get_deferred_access_checks. */
25741 cp_parser_perform_template_parameter_access_checks (vec
<deferred_access_check
, va_gc
> *checks
)
25743 ++processing_template_parmlist
;
25744 perform_access_checks (checks
, tf_warning_or_error
);
25745 --processing_template_parmlist
;
25748 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25749 `function-definition' sequence that follows a template header.
25750 If MEMBER_P is true, this declaration appears in a class scope.
25752 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25753 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25756 cp_parser_single_declaration (cp_parser
* parser
,
25757 vec
<deferred_access_check
, va_gc
> *checks
,
25759 bool explicit_specialization_p
,
25762 int declares_class_or_enum
;
25763 tree decl
= NULL_TREE
;
25764 cp_decl_specifier_seq decl_specifiers
;
25765 bool function_definition_p
= false;
25766 cp_token
*decl_spec_token_start
;
25768 /* This function is only used when processing a template
25770 gcc_assert (innermost_scope_kind () == sk_template_parms
25771 || innermost_scope_kind () == sk_template_spec
);
25773 /* Defer access checks until we know what is being declared. */
25774 push_deferring_access_checks (dk_deferred
);
25776 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25778 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
25779 cp_parser_decl_specifier_seq (parser
,
25780 CP_PARSER_FLAGS_OPTIONAL
,
25782 &declares_class_or_enum
);
25784 *friend_p
= cp_parser_friend_p (&decl_specifiers
);
25786 /* There are no template typedefs. */
25787 if (decl_spec_seq_has_spec_p (&decl_specifiers
, ds_typedef
))
25789 error_at (decl_spec_token_start
->location
,
25790 "template declaration of %<typedef%>");
25791 decl
= error_mark_node
;
25794 /* Gather up the access checks that occurred the
25795 decl-specifier-seq. */
25796 stop_deferring_access_checks ();
25798 /* Check for the declaration of a template class. */
25799 if (declares_class_or_enum
)
25801 if (cp_parser_declares_only_class_p (parser
)
25802 || (declares_class_or_enum
& 2))
25804 // If this is a declaration, but not a definition, associate
25805 // any constraints with the type declaration. Constraints
25806 // are associated with definitions in cp_parser_class_specifier.
25807 if (declares_class_or_enum
== 1)
25808 associate_classtype_constraints (decl_specifiers
.type
);
25810 decl
= shadow_tag (&decl_specifiers
);
25815 friend template <typename T> struct A<T>::B;
25818 A<T>::B will be represented by a TYPENAME_TYPE, and
25819 therefore not recognized by shadow_tag. */
25820 if (friend_p
&& *friend_p
25822 && decl_specifiers
.type
25823 && TYPE_P (decl_specifiers
.type
))
25824 decl
= decl_specifiers
.type
;
25826 if (decl
&& decl
!= error_mark_node
)
25827 decl
= TYPE_NAME (decl
);
25829 decl
= error_mark_node
;
25831 /* Perform access checks for template parameters. */
25832 cp_parser_perform_template_parameter_access_checks (checks
);
25834 /* Give a helpful diagnostic for
25835 template <class T> struct A { } a;
25836 if we aren't already recovering from an error. */
25837 if (!cp_parser_declares_only_class_p (parser
)
25840 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
25841 "a class template declaration must not declare "
25843 cp_parser_skip_to_end_of_block_or_statement (parser
);
25849 /* Complain about missing 'typename' or other invalid type names. */
25850 if (!decl_specifiers
.any_type_specifiers_p
25851 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
25853 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25854 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25855 the rest of this declaration. */
25856 decl
= error_mark_node
;
25860 /* If it's not a template class, try for a template function. If
25861 the next token is a `;', then this declaration does not declare
25862 anything. But, if there were errors in the decl-specifiers, then
25863 the error might well have come from an attempted class-specifier.
25864 In that case, there's no need to warn about a missing declarator. */
25866 && (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
25867 || decl_specifiers
.type
!= error_mark_node
))
25869 decl
= cp_parser_init_declarator (parser
,
25872 /*function_definition_allowed_p=*/true,
25874 declares_class_or_enum
,
25875 &function_definition_p
,
25878 /* 7.1.1-1 [dcl.stc]
25880 A storage-class-specifier shall not be specified in an explicit
25881 specialization... */
25883 && explicit_specialization_p
25884 && decl_specifiers
.storage_class
!= sc_none
)
25886 error_at (decl_spec_token_start
->location
,
25887 "explicit template specialization cannot have a storage class");
25888 decl
= error_mark_node
;
25891 if (decl
&& VAR_P (decl
))
25892 check_template_variable (decl
);
25895 /* Look for a trailing `;' after the declaration. */
25896 if (!function_definition_p
25897 && (decl
== error_mark_node
25898 || !cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
)))
25899 cp_parser_skip_to_end_of_block_or_statement (parser
);
25902 pop_deferring_access_checks ();
25904 /* Clear any current qualification; whatever comes next is the start
25905 of something new. */
25906 parser
->scope
= NULL_TREE
;
25907 parser
->qualifying_scope
= NULL_TREE
;
25908 parser
->object_scope
= NULL_TREE
;
25913 /* Parse a cast-expression that is not the operand of a unary "&". */
25916 cp_parser_simple_cast_expression (cp_parser
*parser
)
25918 return cp_parser_cast_expression (parser
, /*address_p=*/false,
25919 /*cast_p=*/false, /*decltype*/false, NULL
);
25922 /* Parse a functional cast to TYPE. Returns an expression
25923 representing the cast. */
25926 cp_parser_functional_cast (cp_parser
* parser
, tree type
)
25928 vec
<tree
, va_gc
> *vec
;
25929 tree expression_list
;
25933 location_t start_loc
= input_location
;
25936 type
= error_mark_node
;
25938 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
25940 cp_lexer_set_source_position (parser
->lexer
);
25941 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
25942 expression_list
= cp_parser_braced_list (parser
, &nonconst_p
);
25943 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
25944 if (TREE_CODE (type
) == TYPE_DECL
)
25945 type
= TREE_TYPE (type
);
25947 cast
= finish_compound_literal (type
, expression_list
,
25948 tf_warning_or_error
);
25949 /* Create a location of the form:
25952 with caret == start at the start of the type name,
25953 finishing at the closing brace. */
25954 location_t finish_loc
25955 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
25956 location_t combined_loc
= make_location (start_loc
, start_loc
,
25958 cast
.set_location (combined_loc
);
25963 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
25965 /*allow_expansion_p=*/true,
25966 /*non_constant_p=*/NULL
);
25968 expression_list
= error_mark_node
;
25971 expression_list
= build_tree_list_vec (vec
);
25972 release_tree_vector (vec
);
25975 cast
= build_functional_cast (type
, expression_list
,
25976 tf_warning_or_error
);
25977 /* [expr.const]/1: In an integral constant expression "only type
25978 conversions to integral or enumeration type can be used". */
25979 if (TREE_CODE (type
) == TYPE_DECL
)
25980 type
= TREE_TYPE (type
);
25981 if (cast
!= error_mark_node
25982 && !cast_valid_in_integral_constant_expression_p (type
)
25983 && cp_parser_non_integral_constant_expression (parser
,
25985 return error_mark_node
;
25987 /* Create a location of the form:
25990 with caret == start at the start of the type name,
25991 finishing at the closing paren. */
25992 location_t finish_loc
25993 = get_finish (cp_lexer_previous_token (parser
->lexer
)->location
);
25994 location_t combined_loc
= make_location (start_loc
, start_loc
, finish_loc
);
25995 cast
.set_location (combined_loc
);
25999 /* Save the tokens that make up the body of a member function defined
26000 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
26001 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
26002 specifiers applied to the declaration. Returns the FUNCTION_DECL
26003 for the member function. */
26006 cp_parser_save_member_function_body (cp_parser
* parser
,
26007 cp_decl_specifier_seq
*decl_specifiers
,
26008 cp_declarator
*declarator
,
26015 /* Create the FUNCTION_DECL. */
26016 fn
= grokmethod (decl_specifiers
, declarator
, attributes
);
26017 cp_finalize_omp_declare_simd (parser
, fn
);
26018 cp_finalize_oacc_routine (parser
, fn
, true);
26019 /* If something went badly wrong, bail out now. */
26020 if (fn
== error_mark_node
)
26022 /* If there's a function-body, skip it. */
26023 if (cp_parser_token_starts_function_definition_p
26024 (cp_lexer_peek_token (parser
->lexer
)))
26025 cp_parser_skip_to_end_of_block_or_statement (parser
);
26026 return error_mark_node
;
26029 /* Remember it, if there default args to post process. */
26030 cp_parser_save_default_args (parser
, fn
);
26032 /* Save away the tokens that make up the body of the
26034 first
= parser
->lexer
->next_token
;
26035 /* Handle function try blocks. */
26036 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
26037 cp_lexer_consume_token (parser
->lexer
);
26038 /* We can have braced-init-list mem-initializers before the fn body. */
26039 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
26041 cp_lexer_consume_token (parser
->lexer
);
26042 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
26044 /* cache_group will stop after an un-nested { } pair, too. */
26045 if (cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, /*depth=*/0))
26048 /* variadic mem-inits have ... after the ')'. */
26049 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
26050 cp_lexer_consume_token (parser
->lexer
);
26053 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
26054 /* Handle function try blocks. */
26055 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CATCH
))
26056 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
26057 last
= parser
->lexer
->next_token
;
26059 /* Save away the inline definition; we will process it when the
26060 class is complete. */
26061 DECL_PENDING_INLINE_INFO (fn
) = cp_token_cache_new (first
, last
);
26062 DECL_PENDING_INLINE_P (fn
) = 1;
26064 /* We need to know that this was defined in the class, so that
26065 friend templates are handled correctly. */
26066 DECL_INITIALIZED_IN_CLASS_P (fn
) = 1;
26068 /* Add FN to the queue of functions to be parsed later. */
26069 vec_safe_push (unparsed_funs_with_definitions
, fn
);
26074 /* Save the tokens that make up the in-class initializer for a non-static
26075 data member. Returns a DEFAULT_ARG. */
26078 cp_parser_save_nsdmi (cp_parser
* parser
)
26080 return cp_parser_cache_defarg (parser
, /*nsdmi=*/true);
26083 /* Parse a template-argument-list, as well as the trailing ">" (but
26084 not the opening "<"). See cp_parser_template_argument_list for the
26088 cp_parser_enclosed_template_argument_list (cp_parser
* parser
)
26092 tree saved_qualifying_scope
;
26093 tree saved_object_scope
;
26094 bool saved_greater_than_is_operator_p
;
26095 int saved_unevaluated_operand
;
26096 int saved_inhibit_evaluation_warnings
;
26100 When parsing a template-id, the first non-nested `>' is taken as
26101 the end of the template-argument-list rather than a greater-than
26103 saved_greater_than_is_operator_p
26104 = parser
->greater_than_is_operator_p
;
26105 parser
->greater_than_is_operator_p
= false;
26106 /* Parsing the argument list may modify SCOPE, so we save it
26108 saved_scope
= parser
->scope
;
26109 saved_qualifying_scope
= parser
->qualifying_scope
;
26110 saved_object_scope
= parser
->object_scope
;
26111 /* We need to evaluate the template arguments, even though this
26112 template-id may be nested within a "sizeof". */
26113 saved_unevaluated_operand
= cp_unevaluated_operand
;
26114 cp_unevaluated_operand
= 0;
26115 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
26116 c_inhibit_evaluation_warnings
= 0;
26117 /* Parse the template-argument-list itself. */
26118 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
)
26119 || cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
26120 arguments
= NULL_TREE
;
26122 arguments
= cp_parser_template_argument_list (parser
);
26123 /* Look for the `>' that ends the template-argument-list. If we find
26124 a '>>' instead, it's probably just a typo. */
26125 if (cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
26127 if (cxx_dialect
!= cxx98
)
26129 /* In C++0x, a `>>' in a template argument list or cast
26130 expression is considered to be two separate `>'
26131 tokens. So, change the current token to a `>', but don't
26132 consume it: it will be consumed later when the outer
26133 template argument list (or cast expression) is parsed.
26134 Note that this replacement of `>' for `>>' is necessary
26135 even if we are parsing tentatively: in the tentative
26136 case, after calling
26137 cp_parser_enclosed_template_argument_list we will always
26138 throw away all of the template arguments and the first
26139 closing `>', either because the template argument list
26140 was erroneous or because we are replacing those tokens
26141 with a CPP_TEMPLATE_ID token. The second `>' (which will
26142 not have been thrown away) is needed either to close an
26143 outer template argument list or to complete a new-style
26145 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
26146 token
->type
= CPP_GREATER
;
26148 else if (!saved_greater_than_is_operator_p
)
26150 /* If we're in a nested template argument list, the '>>' has
26151 to be a typo for '> >'. We emit the error message, but we
26152 continue parsing and we push a '>' as next token, so that
26153 the argument list will be parsed correctly. Note that the
26154 global source location is still on the token before the
26155 '>>', so we need to say explicitly where we want it. */
26156 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
26157 error_at (token
->location
, "%<>>%> should be %<> >%> "
26158 "within a nested template argument list");
26160 token
->type
= CPP_GREATER
;
26164 /* If this is not a nested template argument list, the '>>'
26165 is a typo for '>'. Emit an error message and continue.
26166 Same deal about the token location, but here we can get it
26167 right by consuming the '>>' before issuing the diagnostic. */
26168 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
26169 error_at (token
->location
,
26170 "spurious %<>>%>, use %<>%> to terminate "
26171 "a template argument list");
26175 cp_parser_skip_to_end_of_template_parameter_list (parser
);
26176 /* The `>' token might be a greater-than operator again now. */
26177 parser
->greater_than_is_operator_p
26178 = saved_greater_than_is_operator_p
;
26179 /* Restore the SAVED_SCOPE. */
26180 parser
->scope
= saved_scope
;
26181 parser
->qualifying_scope
= saved_qualifying_scope
;
26182 parser
->object_scope
= saved_object_scope
;
26183 cp_unevaluated_operand
= saved_unevaluated_operand
;
26184 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
26189 /* MEMBER_FUNCTION is a member function, or a friend. If default
26190 arguments, or the body of the function have not yet been parsed,
26194 cp_parser_late_parsing_for_member (cp_parser
* parser
, tree member_function
)
26196 timevar_push (TV_PARSE_INMETH
);
26197 /* If this member is a template, get the underlying
26199 if (DECL_FUNCTION_TEMPLATE_P (member_function
))
26200 member_function
= DECL_TEMPLATE_RESULT (member_function
);
26202 /* There should not be any class definitions in progress at this
26203 point; the bodies of members are only parsed outside of all class
26205 gcc_assert (parser
->num_classes_being_defined
== 0);
26206 /* While we're parsing the member functions we might encounter more
26207 classes. We want to handle them right away, but we don't want
26208 them getting mixed up with functions that are currently in the
26210 push_unparsed_function_queues (parser
);
26212 /* Make sure that any template parameters are in scope. */
26213 maybe_begin_member_template_processing (member_function
);
26215 /* If the body of the function has not yet been parsed, parse it
26217 if (DECL_PENDING_INLINE_P (member_function
))
26219 tree function_scope
;
26220 cp_token_cache
*tokens
;
26222 /* The function is no longer pending; we are processing it. */
26223 tokens
= DECL_PENDING_INLINE_INFO (member_function
);
26224 DECL_PENDING_INLINE_INFO (member_function
) = NULL
;
26225 DECL_PENDING_INLINE_P (member_function
) = 0;
26227 /* If this is a local class, enter the scope of the containing
26229 function_scope
= current_function_decl
;
26230 if (function_scope
)
26231 push_function_context ();
26233 /* Push the body of the function onto the lexer stack. */
26234 cp_parser_push_lexer_for_tokens (parser
, tokens
);
26236 /* Let the front end know that we going to be defining this
26238 start_preparsed_function (member_function
, NULL_TREE
,
26239 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
26241 /* Don't do access checking if it is a templated function. */
26242 if (processing_template_decl
)
26243 push_deferring_access_checks (dk_no_check
);
26245 /* #pragma omp declare reduction needs special parsing. */
26246 if (DECL_OMP_DECLARE_REDUCTION_P (member_function
))
26248 parser
->lexer
->in_pragma
= true;
26249 cp_parser_omp_declare_reduction_exprs (member_function
, parser
);
26250 finish_function (/*inline*/2);
26251 cp_check_omp_declare_reduction (member_function
);
26254 /* Now, parse the body of the function. */
26255 cp_parser_function_definition_after_declarator (parser
,
26256 /*inline_p=*/true);
26258 if (processing_template_decl
)
26259 pop_deferring_access_checks ();
26261 /* Leave the scope of the containing function. */
26262 if (function_scope
)
26263 pop_function_context ();
26264 cp_parser_pop_lexer (parser
);
26267 /* Remove any template parameters from the symbol table. */
26268 maybe_end_member_template_processing ();
26270 /* Restore the queue. */
26271 pop_unparsed_function_queues (parser
);
26272 timevar_pop (TV_PARSE_INMETH
);
26275 /* If DECL contains any default args, remember it on the unparsed
26276 functions queue. */
26279 cp_parser_save_default_args (cp_parser
* parser
, tree decl
)
26283 for (probe
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
26285 probe
= TREE_CHAIN (probe
))
26286 if (TREE_PURPOSE (probe
))
26288 cp_default_arg_entry entry
= {current_class_type
, decl
};
26289 vec_safe_push (unparsed_funs_with_default_args
, entry
);
26294 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26295 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26296 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26297 from the parameter-type-list. */
26300 cp_parser_late_parse_one_default_arg (cp_parser
*parser
, tree decl
,
26301 tree default_arg
, tree parmtype
)
26303 cp_token_cache
*tokens
;
26307 if (default_arg
== error_mark_node
)
26308 return error_mark_node
;
26310 /* Push the saved tokens for the default argument onto the parser's
26312 tokens
= DEFARG_TOKENS (default_arg
);
26313 cp_parser_push_lexer_for_tokens (parser
, tokens
);
26315 start_lambda_scope (decl
);
26317 /* Parse the default argument. */
26318 parsed_arg
= cp_parser_initializer (parser
, &dummy
, &dummy
);
26319 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg
))
26320 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
26322 finish_lambda_scope ();
26324 if (parsed_arg
== error_mark_node
)
26325 cp_parser_skip_to_end_of_statement (parser
);
26327 if (!processing_template_decl
)
26329 /* In a non-template class, check conversions now. In a template,
26330 we'll wait and instantiate these as needed. */
26331 if (TREE_CODE (decl
) == PARM_DECL
)
26332 parsed_arg
= check_default_argument (parmtype
, parsed_arg
,
26333 tf_warning_or_error
);
26335 parsed_arg
= digest_nsdmi_init (decl
, parsed_arg
);
26338 /* If the token stream has not been completely used up, then
26339 there was extra junk after the end of the default
26341 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
26343 if (TREE_CODE (decl
) == PARM_DECL
)
26344 cp_parser_error (parser
, "expected %<,%>");
26346 cp_parser_error (parser
, "expected %<;%>");
26349 /* Revert to the main lexer. */
26350 cp_parser_pop_lexer (parser
);
26355 /* FIELD is a non-static data member with an initializer which we saved for
26356 later; parse it now. */
26359 cp_parser_late_parsing_nsdmi (cp_parser
*parser
, tree field
)
26363 maybe_begin_member_template_processing (field
);
26365 push_unparsed_function_queues (parser
);
26366 def
= cp_parser_late_parse_one_default_arg (parser
, field
,
26367 DECL_INITIAL (field
),
26369 pop_unparsed_function_queues (parser
);
26371 maybe_end_member_template_processing ();
26373 DECL_INITIAL (field
) = def
;
26376 /* FN is a FUNCTION_DECL which may contains a parameter with an
26377 unparsed DEFAULT_ARG. Parse the default args now. This function
26378 assumes that the current scope is the scope in which the default
26379 argument should be processed. */
26382 cp_parser_late_parsing_default_args (cp_parser
*parser
, tree fn
)
26384 bool saved_local_variables_forbidden_p
;
26385 tree parm
, parmdecl
;
26387 /* While we're parsing the default args, we might (due to the
26388 statement expression extension) encounter more classes. We want
26389 to handle them right away, but we don't want them getting mixed
26390 up with default args that are currently in the queue. */
26391 push_unparsed_function_queues (parser
);
26393 /* Local variable names (and the `this' keyword) may not appear
26394 in a default argument. */
26395 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
26396 parser
->local_variables_forbidden_p
= true;
26398 push_defarg_context (fn
);
26400 for (parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
)),
26401 parmdecl
= DECL_ARGUMENTS (fn
);
26402 parm
&& parm
!= void_list_node
;
26403 parm
= TREE_CHAIN (parm
),
26404 parmdecl
= DECL_CHAIN (parmdecl
))
26406 tree default_arg
= TREE_PURPOSE (parm
);
26408 vec
<tree
, va_gc
> *insts
;
26415 if (TREE_CODE (default_arg
) != DEFAULT_ARG
)
26416 /* This can happen for a friend declaration for a function
26417 already declared with default arguments. */
26421 = cp_parser_late_parse_one_default_arg (parser
, parmdecl
,
26423 TREE_VALUE (parm
));
26424 if (parsed_arg
== error_mark_node
)
26429 TREE_PURPOSE (parm
) = parsed_arg
;
26431 /* Update any instantiations we've already created. */
26432 for (insts
= DEFARG_INSTANTIATIONS (default_arg
), ix
= 0;
26433 vec_safe_iterate (insts
, ix
, ©
); ix
++)
26434 TREE_PURPOSE (copy
) = parsed_arg
;
26437 pop_defarg_context ();
26439 /* Make sure no default arg is missing. */
26440 check_default_args (fn
);
26442 /* Restore the state of local_variables_forbidden_p. */
26443 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
26445 /* Restore the queue. */
26446 pop_unparsed_function_queues (parser
);
26449 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26451 sizeof ... ( identifier )
26453 where the 'sizeof' token has already been consumed. */
26456 cp_parser_sizeof_pack (cp_parser
*parser
)
26458 /* Consume the `...'. */
26459 cp_lexer_consume_token (parser
->lexer
);
26460 maybe_warn_variadic_templates ();
26462 bool paren
= cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
);
26464 cp_lexer_consume_token (parser
->lexer
);
26466 permerror (cp_lexer_peek_token (parser
->lexer
)->location
,
26467 "%<sizeof...%> argument must be surrounded by parentheses");
26469 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
26470 tree name
= cp_parser_identifier (parser
);
26471 if (name
== error_mark_node
)
26472 return error_mark_node
;
26473 /* The name is not qualified. */
26474 parser
->scope
= NULL_TREE
;
26475 parser
->qualifying_scope
= NULL_TREE
;
26476 parser
->object_scope
= NULL_TREE
;
26477 tree expr
= cp_parser_lookup_name_simple (parser
, name
, token
->location
);
26478 if (expr
== error_mark_node
)
26479 cp_parser_name_lookup_error (parser
, name
, expr
, NLE_NULL
,
26481 if (TREE_CODE (expr
) == TYPE_DECL
|| TREE_CODE (expr
) == TEMPLATE_DECL
)
26482 expr
= TREE_TYPE (expr
);
26483 else if (TREE_CODE (expr
) == CONST_DECL
)
26484 expr
= DECL_INITIAL (expr
);
26485 expr
= make_pack_expansion (expr
);
26486 PACK_EXPANSION_SIZEOF_P (expr
) = true;
26489 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
26494 /* Parse the operand of `sizeof' (or a similar operator). Returns
26495 either a TYPE or an expression, depending on the form of the
26496 input. The KEYWORD indicates which kind of expression we have
26500 cp_parser_sizeof_operand (cp_parser
* parser
, enum rid keyword
)
26502 tree expr
= NULL_TREE
;
26503 const char *saved_message
;
26505 bool saved_integral_constant_expression_p
;
26506 bool saved_non_integral_constant_expression_p
;
26508 /* If it's a `...', then we are computing the length of a parameter
26510 if (keyword
== RID_SIZEOF
26511 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
26512 return cp_parser_sizeof_pack (parser
);
26514 /* Types cannot be defined in a `sizeof' expression. Save away the
26516 saved_message
= parser
->type_definition_forbidden_message
;
26517 /* And create the new one. */
26518 tmp
= concat ("types may not be defined in %<",
26519 IDENTIFIER_POINTER (ridpointers
[keyword
]),
26520 "%> expressions", NULL
);
26521 parser
->type_definition_forbidden_message
= tmp
;
26523 /* The restrictions on constant-expressions do not apply inside
26524 sizeof expressions. */
26525 saved_integral_constant_expression_p
26526 = parser
->integral_constant_expression_p
;
26527 saved_non_integral_constant_expression_p
26528 = parser
->non_integral_constant_expression_p
;
26529 parser
->integral_constant_expression_p
= false;
26531 /* Do not actually evaluate the expression. */
26532 ++cp_unevaluated_operand
;
26533 ++c_inhibit_evaluation_warnings
;
26534 /* If it's a `(', then we might be looking at the type-id
26536 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
26538 tree type
= NULL_TREE
;
26540 /* We can't be sure yet whether we're looking at a type-id or an
26542 cp_parser_parse_tentatively (parser
);
26543 /* Note: as a GNU Extension, compound literals are considered
26544 postfix-expressions as they are in C99, so they are valid
26545 arguments to sizeof. See comment in cp_parser_cast_expression
26547 if (cp_parser_compound_literal_p (parser
))
26548 cp_parser_simulate_error (parser
);
26551 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
26552 parser
->in_type_id_in_expr_p
= true;
26553 /* Look for the type-id. */
26554 type
= cp_parser_type_id (parser
);
26555 /* Look for the closing `)'. */
26556 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
26557 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
26560 /* If all went well, then we're done. */
26561 if (cp_parser_parse_definitely (parser
))
26563 cp_decl_specifier_seq decl_specs
;
26565 /* Build a trivial decl-specifier-seq. */
26566 clear_decl_specs (&decl_specs
);
26567 decl_specs
.type
= type
;
26569 /* Call grokdeclarator to figure out what type this is. */
26570 expr
= grokdeclarator (NULL
,
26574 /*attrlist=*/NULL
);
26578 /* If the type-id production did not work out, then we must be
26579 looking at the unary-expression production. */
26581 expr
= cp_parser_unary_expression (parser
);
26583 /* Go back to evaluating expressions. */
26584 --cp_unevaluated_operand
;
26585 --c_inhibit_evaluation_warnings
;
26587 /* Free the message we created. */
26589 /* And restore the old one. */
26590 parser
->type_definition_forbidden_message
= saved_message
;
26591 parser
->integral_constant_expression_p
26592 = saved_integral_constant_expression_p
;
26593 parser
->non_integral_constant_expression_p
26594 = saved_non_integral_constant_expression_p
;
26599 /* If the current declaration has no declarator, return true. */
26602 cp_parser_declares_only_class_p (cp_parser
*parser
)
26604 /* If the next token is a `;' or a `,' then there is no
26606 return (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
26607 || cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
26610 /* Update the DECL_SPECS to reflect the storage class indicated by
26614 cp_parser_set_storage_class (cp_parser
*parser
,
26615 cp_decl_specifier_seq
*decl_specs
,
26619 cp_storage_class storage_class
;
26621 if (parser
->in_unbraced_linkage_specification_p
)
26623 error_at (token
->location
, "invalid use of %qD in linkage specification",
26624 ridpointers
[keyword
]);
26627 else if (decl_specs
->storage_class
!= sc_none
)
26629 decl_specs
->conflicting_specifiers_p
= true;
26633 if ((keyword
== RID_EXTERN
|| keyword
== RID_STATIC
)
26634 && decl_spec_seq_has_spec_p (decl_specs
, ds_thread
)
26635 && decl_specs
->gnu_thread_keyword_p
)
26637 pedwarn (decl_specs
->locations
[ds_thread
], 0,
26638 "%<__thread%> before %qD", ridpointers
[keyword
]);
26644 storage_class
= sc_auto
;
26647 storage_class
= sc_register
;
26650 storage_class
= sc_static
;
26653 storage_class
= sc_extern
;
26656 storage_class
= sc_mutable
;
26659 gcc_unreachable ();
26661 decl_specs
->storage_class
= storage_class
;
26662 set_and_check_decl_spec_loc (decl_specs
, ds_storage_class
, token
);
26664 /* A storage class specifier cannot be applied alongside a typedef
26665 specifier. If there is a typedef specifier present then set
26666 conflicting_specifiers_p which will trigger an error later
26667 on in grokdeclarator. */
26668 if (decl_spec_seq_has_spec_p (decl_specs
, ds_typedef
))
26669 decl_specs
->conflicting_specifiers_p
= true;
26672 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26673 is true, the type is a class or enum definition. */
26676 cp_parser_set_decl_spec_type (cp_decl_specifier_seq
*decl_specs
,
26679 bool type_definition_p
)
26681 decl_specs
->any_specifiers_p
= true;
26683 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26684 (with, for example, in "typedef int wchar_t;") we remember that
26685 this is what happened. In system headers, we ignore these
26686 declarations so that G++ can work with system headers that are not
26688 if (decl_spec_seq_has_spec_p (decl_specs
, ds_typedef
)
26689 && !type_definition_p
26690 && (type_spec
== boolean_type_node
26691 || type_spec
== char16_type_node
26692 || type_spec
== char32_type_node
26693 || type_spec
== wchar_type_node
)
26694 && (decl_specs
->type
26695 || decl_spec_seq_has_spec_p (decl_specs
, ds_long
)
26696 || decl_spec_seq_has_spec_p (decl_specs
, ds_short
)
26697 || decl_spec_seq_has_spec_p (decl_specs
, ds_unsigned
)
26698 || decl_spec_seq_has_spec_p (decl_specs
, ds_signed
)))
26700 decl_specs
->redefined_builtin_type
= type_spec
;
26701 set_and_check_decl_spec_loc (decl_specs
,
26702 ds_redefined_builtin_type_spec
,
26704 if (!decl_specs
->type
)
26706 decl_specs
->type
= type_spec
;
26707 decl_specs
->type_definition_p
= false;
26708 set_and_check_decl_spec_loc (decl_specs
,ds_type_spec
, token
);
26711 else if (decl_specs
->type
)
26712 decl_specs
->multiple_types_p
= true;
26715 decl_specs
->type
= type_spec
;
26716 decl_specs
->type_definition_p
= type_definition_p
;
26717 decl_specs
->redefined_builtin_type
= NULL_TREE
;
26718 set_and_check_decl_spec_loc (decl_specs
, ds_type_spec
, token
);
26722 /* True iff TOKEN is the GNU keyword __thread. */
26725 token_is__thread (cp_token
*token
)
26727 gcc_assert (token
->keyword
== RID_THREAD
);
26728 return !strcmp (IDENTIFIER_POINTER (token
->u
.value
), "__thread");
26731 /* Set the location for a declarator specifier and check if it is
26734 DECL_SPECS is the sequence of declarator specifiers onto which to
26737 DS is the single declarator specifier to set which location is to
26738 be set onto the existing sequence of declarators.
26740 LOCATION is the location for the declarator specifier to
26744 set_and_check_decl_spec_loc (cp_decl_specifier_seq
*decl_specs
,
26745 cp_decl_spec ds
, cp_token
*token
)
26747 gcc_assert (ds
< ds_last
);
26749 if (decl_specs
== NULL
)
26752 source_location location
= token
->location
;
26754 if (decl_specs
->locations
[ds
] == 0)
26756 decl_specs
->locations
[ds
] = location
;
26757 if (ds
== ds_thread
)
26758 decl_specs
->gnu_thread_keyword_p
= token_is__thread (token
);
26764 if (decl_specs
->locations
[ds_long_long
] != 0)
26765 error_at (location
,
26766 "%<long long long%> is too long for GCC");
26769 decl_specs
->locations
[ds_long_long
] = location
;
26770 pedwarn_cxx98 (location
,
26772 "ISO C++ 1998 does not support %<long long%>");
26775 else if (ds
== ds_thread
)
26777 bool gnu
= token_is__thread (token
);
26778 if (gnu
!= decl_specs
->gnu_thread_keyword_p
)
26779 error_at (location
,
26780 "both %<__thread%> and %<thread_local%> specified");
26782 error_at (location
, "duplicate %qD", token
->u
.value
);
26786 static const char *const decl_spec_names
[] = {
26803 error_at (location
,
26804 "duplicate %qs", decl_spec_names
[ds
]);
26809 /* Return true iff the declarator specifier DS is present in the
26810 sequence of declarator specifiers DECL_SPECS. */
26813 decl_spec_seq_has_spec_p (const cp_decl_specifier_seq
* decl_specs
,
26816 gcc_assert (ds
< ds_last
);
26818 if (decl_specs
== NULL
)
26821 return decl_specs
->locations
[ds
] != 0;
26824 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26825 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26828 cp_parser_friend_p (const cp_decl_specifier_seq
*decl_specifiers
)
26830 return decl_spec_seq_has_spec_p (decl_specifiers
, ds_friend
);
26833 /* Issue an error message indicating that TOKEN_DESC was expected.
26834 If KEYWORD is true, it indicated this function is called by
26835 cp_parser_require_keword and the required token can only be
26836 a indicated keyword. */
26839 cp_parser_required_error (cp_parser
*parser
,
26840 required_token token_desc
,
26843 switch (token_desc
)
26846 cp_parser_error (parser
, "expected %<new%>");
26849 cp_parser_error (parser
, "expected %<delete%>");
26852 cp_parser_error (parser
, "expected %<return%>");
26855 cp_parser_error (parser
, "expected %<while%>");
26858 cp_parser_error (parser
, "expected %<extern%>");
26860 case RT_STATIC_ASSERT
:
26861 cp_parser_error (parser
, "expected %<static_assert%>");
26864 cp_parser_error (parser
, "expected %<decltype%>");
26867 cp_parser_error (parser
, "expected %<operator%>");
26870 cp_parser_error (parser
, "expected %<class%>");
26873 cp_parser_error (parser
, "expected %<template%>");
26876 cp_parser_error (parser
, "expected %<namespace%>");
26879 cp_parser_error (parser
, "expected %<using%>");
26882 cp_parser_error (parser
, "expected %<asm%>");
26885 cp_parser_error (parser
, "expected %<try%>");
26888 cp_parser_error (parser
, "expected %<catch%>");
26891 cp_parser_error (parser
, "expected %<throw%>");
26894 cp_parser_error (parser
, "expected %<__label__%>");
26897 cp_parser_error (parser
, "expected %<@try%>");
26899 case RT_AT_SYNCHRONIZED
:
26900 cp_parser_error (parser
, "expected %<@synchronized%>");
26903 cp_parser_error (parser
, "expected %<@throw%>");
26905 case RT_TRANSACTION_ATOMIC
:
26906 cp_parser_error (parser
, "expected %<__transaction_atomic%>");
26908 case RT_TRANSACTION_RELAXED
:
26909 cp_parser_error (parser
, "expected %<__transaction_relaxed%>");
26916 switch (token_desc
)
26919 cp_parser_error (parser
, "expected %<;%>");
26921 case RT_OPEN_PAREN
:
26922 cp_parser_error (parser
, "expected %<(%>");
26924 case RT_CLOSE_BRACE
:
26925 cp_parser_error (parser
, "expected %<}%>");
26927 case RT_OPEN_BRACE
:
26928 cp_parser_error (parser
, "expected %<{%>");
26930 case RT_CLOSE_SQUARE
:
26931 cp_parser_error (parser
, "expected %<]%>");
26933 case RT_OPEN_SQUARE
:
26934 cp_parser_error (parser
, "expected %<[%>");
26937 cp_parser_error (parser
, "expected %<,%>");
26940 cp_parser_error (parser
, "expected %<::%>");
26943 cp_parser_error (parser
, "expected %<<%>");
26946 cp_parser_error (parser
, "expected %<>%>");
26949 cp_parser_error (parser
, "expected %<=%>");
26952 cp_parser_error (parser
, "expected %<...%>");
26955 cp_parser_error (parser
, "expected %<*%>");
26958 cp_parser_error (parser
, "expected %<~%>");
26961 cp_parser_error (parser
, "expected %<:%>");
26963 case RT_COLON_SCOPE
:
26964 cp_parser_error (parser
, "expected %<:%> or %<::%>");
26966 case RT_CLOSE_PAREN
:
26967 cp_parser_error (parser
, "expected %<)%>");
26969 case RT_COMMA_CLOSE_PAREN
:
26970 cp_parser_error (parser
, "expected %<,%> or %<)%>");
26972 case RT_PRAGMA_EOL
:
26973 cp_parser_error (parser
, "expected end of line");
26976 cp_parser_error (parser
, "expected identifier");
26979 cp_parser_error (parser
, "expected selection-statement");
26981 case RT_INTERATION
:
26982 cp_parser_error (parser
, "expected iteration-statement");
26985 cp_parser_error (parser
, "expected jump-statement");
26988 cp_parser_error (parser
, "expected class-key");
26990 case RT_CLASS_TYPENAME_TEMPLATE
:
26991 cp_parser_error (parser
,
26992 "expected %<class%>, %<typename%>, or %<template%>");
26995 gcc_unreachable ();
26999 gcc_unreachable ();
27004 /* If the next token is of the indicated TYPE, consume it. Otherwise,
27005 issue an error message indicating that TOKEN_DESC was expected.
27007 Returns the token consumed, if the token had the appropriate type.
27008 Otherwise, returns NULL. */
27011 cp_parser_require (cp_parser
* parser
,
27012 enum cpp_ttype type
,
27013 required_token token_desc
)
27015 if (cp_lexer_next_token_is (parser
->lexer
, type
))
27016 return cp_lexer_consume_token (parser
->lexer
);
27019 /* Output the MESSAGE -- unless we're parsing tentatively. */
27020 if (!cp_parser_simulate_error (parser
))
27021 cp_parser_required_error (parser
, token_desc
, /*keyword=*/false);
27026 /* An error message is produced if the next token is not '>'.
27027 All further tokens are skipped until the desired token is
27028 found or '{', '}', ';' or an unbalanced ')' or ']'. */
27031 cp_parser_skip_to_end_of_template_parameter_list (cp_parser
* parser
)
27033 /* Current level of '< ... >'. */
27034 unsigned level
= 0;
27035 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
27036 unsigned nesting_depth
= 0;
27038 /* Are we ready, yet? If not, issue error message. */
27039 if (cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
))
27042 /* Skip tokens until the desired token is found. */
27045 /* Peek at the next token. */
27046 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
27049 if (!nesting_depth
)
27054 if (cxx_dialect
== cxx98
)
27055 /* C++0x views the `>>' operator as two `>' tokens, but
27058 else if (!nesting_depth
&& level
-- == 0)
27060 /* We've hit a `>>' where the first `>' closes the
27061 template argument list, and the second `>' is
27062 spurious. Just consume the `>>' and stop; we've
27063 already produced at least one error. */
27064 cp_lexer_consume_token (parser
->lexer
);
27067 /* Fall through for C++0x, so we handle the second `>' in
27071 if (!nesting_depth
&& level
-- == 0)
27073 /* We've reached the token we want, consume it and stop. */
27074 cp_lexer_consume_token (parser
->lexer
);
27079 case CPP_OPEN_PAREN
:
27080 case CPP_OPEN_SQUARE
:
27084 case CPP_CLOSE_PAREN
:
27085 case CPP_CLOSE_SQUARE
:
27086 if (nesting_depth
-- == 0)
27091 case CPP_PRAGMA_EOL
:
27092 case CPP_SEMICOLON
:
27093 case CPP_OPEN_BRACE
:
27094 case CPP_CLOSE_BRACE
:
27095 /* The '>' was probably forgotten, don't look further. */
27102 /* Consume this token. */
27103 cp_lexer_consume_token (parser
->lexer
);
27107 /* If the next token is the indicated keyword, consume it. Otherwise,
27108 issue an error message indicating that TOKEN_DESC was expected.
27110 Returns the token consumed, if the token had the appropriate type.
27111 Otherwise, returns NULL. */
27114 cp_parser_require_keyword (cp_parser
* parser
,
27116 required_token token_desc
)
27118 cp_token
*token
= cp_parser_require (parser
, CPP_KEYWORD
, token_desc
);
27120 if (token
&& token
->keyword
!= keyword
)
27122 cp_parser_required_error (parser
, token_desc
, /*keyword=*/true);
27129 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27130 function-definition. */
27133 cp_parser_token_starts_function_definition_p (cp_token
* token
)
27135 return (/* An ordinary function-body begins with an `{'. */
27136 token
->type
== CPP_OPEN_BRACE
27137 /* A ctor-initializer begins with a `:'. */
27138 || token
->type
== CPP_COLON
27139 /* A function-try-block begins with `try'. */
27140 || token
->keyword
== RID_TRY
27141 /* A function-transaction-block begins with `__transaction_atomic'
27142 or `__transaction_relaxed'. */
27143 || token
->keyword
== RID_TRANSACTION_ATOMIC
27144 || token
->keyword
== RID_TRANSACTION_RELAXED
27145 /* The named return value extension begins with `return'. */
27146 || token
->keyword
== RID_RETURN
);
27149 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27153 cp_parser_next_token_starts_class_definition_p (cp_parser
*parser
)
27157 token
= cp_lexer_peek_token (parser
->lexer
);
27158 return (token
->type
== CPP_OPEN_BRACE
27159 || (token
->type
== CPP_COLON
27160 && !parser
->colon_doesnt_start_class_def_p
));
27163 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27164 C++0x) ending a template-argument. */
27167 cp_parser_next_token_ends_template_argument_p (cp_parser
*parser
)
27171 token
= cp_lexer_peek_token (parser
->lexer
);
27172 return (token
->type
== CPP_COMMA
27173 || token
->type
== CPP_GREATER
27174 || token
->type
== CPP_ELLIPSIS
27175 || ((cxx_dialect
!= cxx98
) && token
->type
== CPP_RSHIFT
));
27178 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27179 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27182 cp_parser_nth_token_starts_template_argument_list_p (cp_parser
* parser
,
27187 token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
27188 if (token
->type
== CPP_LESS
)
27190 /* Check for the sequence `<::' in the original code. It would be lexed as
27191 `[:', where `[' is a digraph, and there is no whitespace before
27193 if (token
->type
== CPP_OPEN_SQUARE
&& token
->flags
& DIGRAPH
)
27196 token2
= cp_lexer_peek_nth_token (parser
->lexer
, n
+1);
27197 if (token2
->type
== CPP_COLON
&& !(token2
->flags
& PREV_WHITE
))
27203 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27204 or none_type otherwise. */
27206 static enum tag_types
27207 cp_parser_token_is_class_key (cp_token
* token
)
27209 switch (token
->keyword
)
27214 return record_type
;
27223 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27224 or none_type otherwise or if the token is null. */
27226 static enum tag_types
27227 cp_parser_token_is_type_parameter_key (cp_token
* token
)
27232 switch (token
->keyword
)
27237 return typename_type
;
27244 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27247 cp_parser_check_class_key (enum tag_types class_key
, tree type
)
27249 if (type
== error_mark_node
)
27251 if ((TREE_CODE (type
) == UNION_TYPE
) != (class_key
== union_type
))
27253 if (permerror (input_location
, "%qs tag used in naming %q#T",
27254 class_key
== union_type
? "union"
27255 : class_key
== record_type
? "struct" : "class",
27257 inform (DECL_SOURCE_LOCATION (TYPE_NAME (type
)),
27258 "%q#T was previously declared here", type
);
27262 /* Issue an error message if DECL is redeclared with different
27263 access than its original declaration [class.access.spec/3].
27264 This applies to nested classes, nested class templates and
27265 enumerations [class.mem/1]. */
27268 cp_parser_check_access_in_redeclaration (tree decl
, location_t location
)
27271 || (!CLASS_TYPE_P (TREE_TYPE (decl
))
27272 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
))
27275 if ((TREE_PRIVATE (decl
)
27276 != (current_access_specifier
== access_private_node
))
27277 || (TREE_PROTECTED (decl
)
27278 != (current_access_specifier
== access_protected_node
)))
27279 error_at (location
, "%qD redeclared with different access", decl
);
27282 /* Look for the `template' keyword, as a syntactic disambiguator.
27283 Return TRUE iff it is present, in which case it will be
27287 cp_parser_optional_template_keyword (cp_parser
*parser
)
27289 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
27291 /* In C++98 the `template' keyword can only be used within templates;
27292 outside templates the parser can always figure out what is a
27293 template and what is not. In C++11, per the resolution of DR 468,
27294 `template' is allowed in cases where it is not strictly necessary. */
27295 if (!processing_template_decl
27296 && pedantic
&& cxx_dialect
== cxx98
)
27298 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
27299 pedwarn (token
->location
, OPT_Wpedantic
,
27300 "in C++98 %<template%> (as a disambiguator) is only "
27301 "allowed within templates");
27302 /* If this part of the token stream is rescanned, the same
27303 error message would be generated. So, we purge the token
27304 from the stream. */
27305 cp_lexer_purge_token (parser
->lexer
);
27310 /* Consume the `template' keyword. */
27311 cp_lexer_consume_token (parser
->lexer
);
27318 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27319 set PARSER->SCOPE, and perform other related actions. */
27322 cp_parser_pre_parsed_nested_name_specifier (cp_parser
*parser
)
27324 struct tree_check
*check_value
;
27326 /* Get the stored value. */
27327 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
27328 /* Set the scope from the stored value. */
27329 parser
->scope
= saved_checks_value (check_value
);
27330 parser
->qualifying_scope
= check_value
->qualifying_scope
;
27331 parser
->object_scope
= NULL_TREE
;
27334 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27335 encounter the end of a block before what we were looking for. */
27338 cp_parser_cache_group (cp_parser
*parser
,
27339 enum cpp_ttype end
,
27344 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
27346 /* Abort a parenthesized expression if we encounter a semicolon. */
27347 if ((end
== CPP_CLOSE_PAREN
|| depth
== 0)
27348 && token
->type
== CPP_SEMICOLON
)
27350 /* If we've reached the end of the file, stop. */
27351 if (token
->type
== CPP_EOF
27352 || (end
!= CPP_PRAGMA_EOL
27353 && token
->type
== CPP_PRAGMA_EOL
))
27355 if (token
->type
== CPP_CLOSE_BRACE
&& depth
== 0)
27356 /* We've hit the end of an enclosing block, so there's been some
27357 kind of syntax error. */
27360 /* Consume the token. */
27361 cp_lexer_consume_token (parser
->lexer
);
27362 /* See if it starts a new group. */
27363 if (token
->type
== CPP_OPEN_BRACE
)
27365 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, depth
+ 1);
27366 /* In theory this should probably check end == '}', but
27367 cp_parser_save_member_function_body needs it to exit
27368 after either '}' or ')' when called with ')'. */
27372 else if (token
->type
== CPP_OPEN_PAREN
)
27374 cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, depth
+ 1);
27375 if (depth
== 0 && end
== CPP_CLOSE_PAREN
)
27378 else if (token
->type
== CPP_PRAGMA
)
27379 cp_parser_cache_group (parser
, CPP_PRAGMA_EOL
, depth
+ 1);
27380 else if (token
->type
== end
)
27385 /* Like above, for caching a default argument or NSDMI. Both of these are
27386 terminated by a non-nested comma, but it can be unclear whether or not a
27387 comma is nested in a template argument list unless we do more parsing.
27388 In order to handle this ambiguity, when we encounter a ',' after a '<'
27389 we try to parse what follows as a parameter-declaration-list (in the
27390 case of a default argument) or a member-declarator (in the case of an
27391 NSDMI). If that succeeds, then we stop caching. */
27394 cp_parser_cache_defarg (cp_parser
*parser
, bool nsdmi
)
27396 unsigned depth
= 0;
27397 int maybe_template_id
= 0;
27398 cp_token
*first_token
;
27400 tree default_argument
;
27402 /* Add tokens until we have processed the entire default
27403 argument. We add the range [first_token, token). */
27404 first_token
= cp_lexer_peek_token (parser
->lexer
);
27405 if (first_token
->type
== CPP_OPEN_BRACE
)
27407 /* For list-initialization, this is straightforward. */
27408 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
27409 token
= cp_lexer_peek_token (parser
->lexer
);
27415 /* Peek at the next token. */
27416 token
= cp_lexer_peek_token (parser
->lexer
);
27417 /* What we do depends on what token we have. */
27418 switch (token
->type
)
27420 /* In valid code, a default argument must be
27421 immediately followed by a `,' `)', or `...'. */
27423 if (depth
== 0 && maybe_template_id
)
27425 /* If we've seen a '<', we might be in a
27426 template-argument-list. Until Core issue 325 is
27427 resolved, we don't know how this situation ought
27428 to be handled, so try to DTRT. We check whether
27429 what comes after the comma is a valid parameter
27430 declaration list. If it is, then the comma ends
27431 the default argument; otherwise the default
27432 argument continues. */
27433 bool error
= false;
27436 /* Set ITALP so cp_parser_parameter_declaration_list
27437 doesn't decide to commit to this parse. */
27438 bool saved_italp
= parser
->in_template_argument_list_p
;
27439 parser
->in_template_argument_list_p
= true;
27441 cp_parser_parse_tentatively (parser
);
27445 /* Parse declarators until we reach a non-comma or
27446 somthing that cannot be an initializer.
27447 Just checking whether we're looking at a single
27448 declarator is insufficient. Consider:
27449 int var = tuple<T,U>::x;
27450 The template parameter 'U' looks exactly like a
27454 int ctor_dtor_or_conv_p
;
27455 cp_lexer_consume_token (parser
->lexer
);
27456 cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
27457 &ctor_dtor_or_conv_p
,
27458 /*parenthesized_p=*/NULL
,
27460 /*friend_p=*/false);
27461 peek
= cp_lexer_peek_token (parser
->lexer
);
27462 if (cp_parser_error_occurred (parser
))
27465 while (peek
->type
== CPP_COMMA
);
27466 /* If we met an '=' or ';' then the original comma
27467 was the end of the NSDMI. Otherwise assume
27468 we're still in the NSDMI. */
27469 error
= (peek
->type
!= CPP_EQ
27470 && peek
->type
!= CPP_SEMICOLON
);
27474 cp_lexer_consume_token (parser
->lexer
);
27475 begin_scope (sk_function_parms
, NULL_TREE
);
27476 cp_parser_parameter_declaration_list (parser
, &error
);
27477 pop_bindings_and_leave_scope ();
27479 if (!cp_parser_error_occurred (parser
) && !error
)
27481 cp_parser_abort_tentative_parse (parser
);
27483 parser
->in_template_argument_list_p
= saved_italp
;
27486 case CPP_CLOSE_PAREN
:
27488 /* If we run into a non-nested `;', `}', or `]',
27489 then the code is invalid -- but the default
27490 argument is certainly over. */
27491 case CPP_SEMICOLON
:
27492 case CPP_CLOSE_BRACE
:
27493 case CPP_CLOSE_SQUARE
:
27495 /* Handle correctly int n = sizeof ... ( p ); */
27496 && token
->type
!= CPP_ELLIPSIS
)
27498 /* Update DEPTH, if necessary. */
27499 else if (token
->type
== CPP_CLOSE_PAREN
27500 || token
->type
== CPP_CLOSE_BRACE
27501 || token
->type
== CPP_CLOSE_SQUARE
)
27505 case CPP_OPEN_PAREN
:
27506 case CPP_OPEN_SQUARE
:
27507 case CPP_OPEN_BRACE
:
27513 /* This might be the comparison operator, or it might
27514 start a template argument list. */
27515 ++maybe_template_id
;
27519 if (cxx_dialect
== cxx98
)
27521 /* Fall through for C++0x, which treats the `>>'
27522 operator like two `>' tokens in certain
27528 /* This might be an operator, or it might close a
27529 template argument list. But if a previous '<'
27530 started a template argument list, this will have
27531 closed it, so we can't be in one anymore. */
27532 maybe_template_id
-= 1 + (token
->type
== CPP_RSHIFT
);
27533 if (maybe_template_id
< 0)
27534 maybe_template_id
= 0;
27538 /* If we run out of tokens, issue an error message. */
27540 case CPP_PRAGMA_EOL
:
27541 error_at (token
->location
, "file ends in default argument");
27542 return error_mark_node
;
27546 /* In these cases, we should look for template-ids.
27547 For example, if the default argument is
27548 `X<int, double>()', we need to do name lookup to
27549 figure out whether or not `X' is a template; if
27550 so, the `,' does not end the default argument.
27552 That is not yet done. */
27559 /* If we've reached the end, stop. */
27563 /* Add the token to the token block. */
27564 token
= cp_lexer_consume_token (parser
->lexer
);
27567 /* Create a DEFAULT_ARG to represent the unparsed default
27569 default_argument
= make_node (DEFAULT_ARG
);
27570 DEFARG_TOKENS (default_argument
)
27571 = cp_token_cache_new (first_token
, token
);
27572 DEFARG_INSTANTIATIONS (default_argument
) = NULL
;
27574 return default_argument
;
27577 /* Begin parsing tentatively. We always save tokens while parsing
27578 tentatively so that if the tentative parsing fails we can restore the
27582 cp_parser_parse_tentatively (cp_parser
* parser
)
27584 /* Enter a new parsing context. */
27585 parser
->context
= cp_parser_context_new (parser
->context
);
27586 /* Begin saving tokens. */
27587 cp_lexer_save_tokens (parser
->lexer
);
27588 /* In order to avoid repetitive access control error messages,
27589 access checks are queued up until we are no longer parsing
27591 push_deferring_access_checks (dk_deferred
);
27594 /* Commit to the currently active tentative parse. */
27597 cp_parser_commit_to_tentative_parse (cp_parser
* parser
)
27599 cp_parser_context
*context
;
27602 /* Mark all of the levels as committed. */
27603 lexer
= parser
->lexer
;
27604 for (context
= parser
->context
; context
->next
; context
= context
->next
)
27606 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
27608 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
27609 while (!cp_lexer_saving_tokens (lexer
))
27610 lexer
= lexer
->next
;
27611 cp_lexer_commit_tokens (lexer
);
27615 /* Commit to the topmost currently active tentative parse.
27617 Note that this function shouldn't be called when there are
27618 irreversible side-effects while in a tentative state. For
27619 example, we shouldn't create a permanent entry in the symbol
27620 table, or issue an error message that might not apply if the
27621 tentative parse is aborted. */
27624 cp_parser_commit_to_topmost_tentative_parse (cp_parser
* parser
)
27626 cp_parser_context
*context
= parser
->context
;
27627 cp_lexer
*lexer
= parser
->lexer
;
27631 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
27633 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
27635 while (!cp_lexer_saving_tokens (lexer
))
27636 lexer
= lexer
->next
;
27637 cp_lexer_commit_tokens (lexer
);
27641 /* Abort the currently active tentative parse. All consumed tokens
27642 will be rolled back, and no diagnostics will be issued. */
27645 cp_parser_abort_tentative_parse (cp_parser
* parser
)
27647 gcc_assert (parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
27648 || errorcount
> 0);
27649 cp_parser_simulate_error (parser
);
27650 /* Now, pretend that we want to see if the construct was
27651 successfully parsed. */
27652 cp_parser_parse_definitely (parser
);
27655 /* Stop parsing tentatively. If a parse error has occurred, restore the
27656 token stream. Otherwise, commit to the tokens we have consumed.
27657 Returns true if no error occurred; false otherwise. */
27660 cp_parser_parse_definitely (cp_parser
* parser
)
27662 bool error_occurred
;
27663 cp_parser_context
*context
;
27665 /* Remember whether or not an error occurred, since we are about to
27666 destroy that information. */
27667 error_occurred
= cp_parser_error_occurred (parser
);
27668 /* Remove the topmost context from the stack. */
27669 context
= parser
->context
;
27670 parser
->context
= context
->next
;
27671 /* If no parse errors occurred, commit to the tentative parse. */
27672 if (!error_occurred
)
27674 /* Commit to the tokens read tentatively, unless that was
27676 if (context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
)
27677 cp_lexer_commit_tokens (parser
->lexer
);
27679 pop_to_parent_deferring_access_checks ();
27681 /* Otherwise, if errors occurred, roll back our state so that things
27682 are just as they were before we began the tentative parse. */
27685 cp_lexer_rollback_tokens (parser
->lexer
);
27686 pop_deferring_access_checks ();
27688 /* Add the context to the front of the free list. */
27689 context
->next
= cp_parser_context_free_list
;
27690 cp_parser_context_free_list
= context
;
27692 return !error_occurred
;
27695 /* Returns true if we are parsing tentatively and are not committed to
27696 this tentative parse. */
27699 cp_parser_uncommitted_to_tentative_parse_p (cp_parser
* parser
)
27701 return (cp_parser_parsing_tentatively (parser
)
27702 && parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
);
27705 /* Returns nonzero iff an error has occurred during the most recent
27706 tentative parse. */
27709 cp_parser_error_occurred (cp_parser
* parser
)
27711 return (cp_parser_parsing_tentatively (parser
)
27712 && parser
->context
->status
== CP_PARSER_STATUS_KIND_ERROR
);
27715 /* Returns nonzero if GNU extensions are allowed. */
27718 cp_parser_allow_gnu_extensions_p (cp_parser
* parser
)
27720 return parser
->allow_gnu_extensions_p
;
27723 /* Objective-C++ Productions */
27726 /* Parse an Objective-C expression, which feeds into a primary-expression
27730 objc-message-expression
27731 objc-string-literal
27732 objc-encode-expression
27733 objc-protocol-expression
27734 objc-selector-expression
27736 Returns a tree representation of the expression. */
27739 cp_parser_objc_expression (cp_parser
* parser
)
27741 /* Try to figure out what kind of declaration is present. */
27742 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
27746 case CPP_OPEN_SQUARE
:
27747 return cp_parser_objc_message_expression (parser
);
27749 case CPP_OBJC_STRING
:
27750 kwd
= cp_lexer_consume_token (parser
->lexer
);
27751 return objc_build_string_object (kwd
->u
.value
);
27754 switch (kwd
->keyword
)
27756 case RID_AT_ENCODE
:
27757 return cp_parser_objc_encode_expression (parser
);
27759 case RID_AT_PROTOCOL
:
27760 return cp_parser_objc_protocol_expression (parser
);
27762 case RID_AT_SELECTOR
:
27763 return cp_parser_objc_selector_expression (parser
);
27769 error_at (kwd
->location
,
27770 "misplaced %<@%D%> Objective-C++ construct",
27772 cp_parser_skip_to_end_of_block_or_statement (parser
);
27775 return error_mark_node
;
27778 /* Parse an Objective-C message expression.
27780 objc-message-expression:
27781 [ objc-message-receiver objc-message-args ]
27783 Returns a representation of an Objective-C message. */
27786 cp_parser_objc_message_expression (cp_parser
* parser
)
27788 tree receiver
, messageargs
;
27790 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
27791 cp_lexer_consume_token (parser
->lexer
); /* Eat '['. */
27792 receiver
= cp_parser_objc_message_receiver (parser
);
27793 messageargs
= cp_parser_objc_message_args (parser
);
27794 location_t end_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
27795 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
27797 tree result
= objc_build_message_expr (receiver
, messageargs
);
27799 /* Construct a location e.g.
27802 ranging from the '[' to the ']', with the caret at the start. */
27803 location_t combined_loc
= make_location (start_loc
, start_loc
, end_loc
);
27804 protected_set_expr_location (result
, combined_loc
);
27809 /* Parse an objc-message-receiver.
27811 objc-message-receiver:
27813 simple-type-specifier
27815 Returns a representation of the type or expression. */
27818 cp_parser_objc_message_receiver (cp_parser
* parser
)
27822 /* An Objective-C message receiver may be either (1) a type
27823 or (2) an expression. */
27824 cp_parser_parse_tentatively (parser
);
27825 rcv
= cp_parser_expression (parser
);
27827 /* If that worked out, fine. */
27828 if (cp_parser_parse_definitely (parser
))
27831 cp_parser_parse_tentatively (parser
);
27832 rcv
= cp_parser_simple_type_specifier (parser
,
27833 /*decl_specs=*/NULL
,
27834 CP_PARSER_FLAGS_NONE
);
27836 if (cp_parser_parse_definitely (parser
))
27837 return objc_get_class_reference (rcv
);
27839 cp_parser_error (parser
, "objective-c++ message receiver expected");
27840 return error_mark_node
;
27843 /* Parse the arguments and selectors comprising an Objective-C message.
27848 objc-selector-args , objc-comma-args
27850 objc-selector-args:
27851 objc-selector [opt] : assignment-expression
27852 objc-selector-args objc-selector [opt] : assignment-expression
27855 assignment-expression
27856 objc-comma-args , assignment-expression
27858 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27859 selector arguments and TREE_VALUE containing a list of comma
27863 cp_parser_objc_message_args (cp_parser
* parser
)
27865 tree sel_args
= NULL_TREE
, addl_args
= NULL_TREE
;
27866 bool maybe_unary_selector_p
= true;
27867 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
27869 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
27871 tree selector
= NULL_TREE
, arg
;
27873 if (token
->type
!= CPP_COLON
)
27874 selector
= cp_parser_objc_selector (parser
);
27876 /* Detect if we have a unary selector. */
27877 if (maybe_unary_selector_p
27878 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
27879 return build_tree_list (selector
, NULL_TREE
);
27881 maybe_unary_selector_p
= false;
27882 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
27883 arg
= cp_parser_assignment_expression (parser
);
27886 = chainon (sel_args
,
27887 build_tree_list (selector
, arg
));
27889 token
= cp_lexer_peek_token (parser
->lexer
);
27892 /* Handle non-selector arguments, if any. */
27893 while (token
->type
== CPP_COMMA
)
27897 cp_lexer_consume_token (parser
->lexer
);
27898 arg
= cp_parser_assignment_expression (parser
);
27901 = chainon (addl_args
,
27902 build_tree_list (NULL_TREE
, arg
));
27904 token
= cp_lexer_peek_token (parser
->lexer
);
27907 if (sel_args
== NULL_TREE
&& addl_args
== NULL_TREE
)
27909 cp_parser_error (parser
, "objective-c++ message argument(s) are expected");
27910 return build_tree_list (error_mark_node
, error_mark_node
);
27913 return build_tree_list (sel_args
, addl_args
);
27916 /* Parse an Objective-C encode expression.
27918 objc-encode-expression:
27919 @encode objc-typename
27921 Returns an encoded representation of the type argument. */
27924 cp_parser_objc_encode_expression (cp_parser
* parser
)
27928 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
27930 cp_lexer_consume_token (parser
->lexer
); /* Eat '@encode'. */
27931 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
27932 token
= cp_lexer_peek_token (parser
->lexer
);
27933 type
= complete_type (cp_parser_type_id (parser
));
27934 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
27938 error_at (token
->location
,
27939 "%<@encode%> must specify a type as an argument");
27940 return error_mark_node
;
27943 /* This happens if we find @encode(T) (where T is a template
27944 typename or something dependent on a template typename) when
27945 parsing a template. In that case, we can't compile it
27946 immediately, but we rather create an AT_ENCODE_EXPR which will
27947 need to be instantiated when the template is used.
27949 if (dependent_type_p (type
))
27951 tree value
= build_min (AT_ENCODE_EXPR
, size_type_node
, type
);
27952 TREE_READONLY (value
) = 1;
27957 /* Build a location of the form:
27960 with caret==start at the @ token, finishing at the close paren. */
27961 location_t combined_loc
27962 = make_location (start_loc
, start_loc
,
27963 cp_lexer_previous_token (parser
->lexer
)->location
);
27965 return cp_expr (objc_build_encode_expr (type
), combined_loc
);
27968 /* Parse an Objective-C @defs expression. */
27971 cp_parser_objc_defs_expression (cp_parser
*parser
)
27975 cp_lexer_consume_token (parser
->lexer
); /* Eat '@defs'. */
27976 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
27977 name
= cp_parser_identifier (parser
);
27978 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
27980 return objc_get_class_ivars (name
);
27983 /* Parse an Objective-C protocol expression.
27985 objc-protocol-expression:
27986 @protocol ( identifier )
27988 Returns a representation of the protocol expression. */
27991 cp_parser_objc_protocol_expression (cp_parser
* parser
)
27994 location_t start_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
27996 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
27997 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
27998 proto
= cp_parser_identifier (parser
);
27999 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
28001 /* Build a location of the form:
28004 with caret==start at the @ token, finishing at the close paren. */
28005 location_t combined_loc
28006 = make_location (start_loc
, start_loc
,
28007 cp_lexer_previous_token (parser
->lexer
)->location
);
28008 tree result
= objc_build_protocol_expr (proto
);
28009 protected_set_expr_location (result
, combined_loc
);
28013 /* Parse an Objective-C selector expression.
28015 objc-selector-expression:
28016 @selector ( objc-method-signature )
28018 objc-method-signature:
28024 objc-selector-seq objc-selector :
28026 Returns a representation of the method selector. */
28029 cp_parser_objc_selector_expression (cp_parser
* parser
)
28031 tree sel_seq
= NULL_TREE
;
28032 bool maybe_unary_selector_p
= true;
28034 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
28036 cp_lexer_consume_token (parser
->lexer
); /* Eat '@selector'. */
28037 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
28038 token
= cp_lexer_peek_token (parser
->lexer
);
28040 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
28041 || token
->type
== CPP_SCOPE
)
28043 tree selector
= NULL_TREE
;
28045 if (token
->type
!= CPP_COLON
28046 || token
->type
== CPP_SCOPE
)
28047 selector
= cp_parser_objc_selector (parser
);
28049 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
)
28050 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
))
28052 /* Detect if we have a unary selector. */
28053 if (maybe_unary_selector_p
)
28055 sel_seq
= selector
;
28056 goto finish_selector
;
28060 cp_parser_error (parser
, "expected %<:%>");
28063 maybe_unary_selector_p
= false;
28064 token
= cp_lexer_consume_token (parser
->lexer
);
28066 if (token
->type
== CPP_SCOPE
)
28069 = chainon (sel_seq
,
28070 build_tree_list (selector
, NULL_TREE
));
28072 = chainon (sel_seq
,
28073 build_tree_list (NULL_TREE
, NULL_TREE
));
28077 = chainon (sel_seq
,
28078 build_tree_list (selector
, NULL_TREE
));
28080 token
= cp_lexer_peek_token (parser
->lexer
);
28084 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
28087 /* Build a location of the form:
28090 with caret==start at the @ token, finishing at the close paren. */
28091 location_t combined_loc
28092 = make_location (loc
, loc
,
28093 cp_lexer_previous_token (parser
->lexer
)->location
);
28094 tree result
= objc_build_selector_expr (combined_loc
, sel_seq
);
28095 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28096 protected_set_expr_location (result
, combined_loc
);
28100 /* Parse a list of identifiers.
28102 objc-identifier-list:
28104 objc-identifier-list , identifier
28106 Returns a TREE_LIST of identifier nodes. */
28109 cp_parser_objc_identifier_list (cp_parser
* parser
)
28115 identifier
= cp_parser_identifier (parser
);
28116 if (identifier
== error_mark_node
)
28117 return error_mark_node
;
28119 list
= build_tree_list (NULL_TREE
, identifier
);
28120 sep
= cp_lexer_peek_token (parser
->lexer
);
28122 while (sep
->type
== CPP_COMMA
)
28124 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
28125 identifier
= cp_parser_identifier (parser
);
28126 if (identifier
== error_mark_node
)
28129 list
= chainon (list
, build_tree_list (NULL_TREE
,
28131 sep
= cp_lexer_peek_token (parser
->lexer
);
28137 /* Parse an Objective-C alias declaration.
28139 objc-alias-declaration:
28140 @compatibility_alias identifier identifier ;
28142 This function registers the alias mapping with the Objective-C front end.
28143 It returns nothing. */
28146 cp_parser_objc_alias_declaration (cp_parser
* parser
)
28150 cp_lexer_consume_token (parser
->lexer
); /* Eat '@compatibility_alias'. */
28151 alias
= cp_parser_identifier (parser
);
28152 orig
= cp_parser_identifier (parser
);
28153 objc_declare_alias (alias
, orig
);
28154 cp_parser_consume_semicolon_at_end_of_statement (parser
);
28157 /* Parse an Objective-C class forward-declaration.
28159 objc-class-declaration:
28160 @class objc-identifier-list ;
28162 The function registers the forward declarations with the Objective-C
28163 front end. It returns nothing. */
28166 cp_parser_objc_class_declaration (cp_parser
* parser
)
28168 cp_lexer_consume_token (parser
->lexer
); /* Eat '@class'. */
28173 id
= cp_parser_identifier (parser
);
28174 if (id
== error_mark_node
)
28177 objc_declare_class (id
);
28179 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
28180 cp_lexer_consume_token (parser
->lexer
);
28184 cp_parser_consume_semicolon_at_end_of_statement (parser
);
28187 /* Parse a list of Objective-C protocol references.
28189 objc-protocol-refs-opt:
28190 objc-protocol-refs [opt]
28192 objc-protocol-refs:
28193 < objc-identifier-list >
28195 Returns a TREE_LIST of identifiers, if any. */
28198 cp_parser_objc_protocol_refs_opt (cp_parser
* parser
)
28200 tree protorefs
= NULL_TREE
;
28202 if(cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
28204 cp_lexer_consume_token (parser
->lexer
); /* Eat '<'. */
28205 protorefs
= cp_parser_objc_identifier_list (parser
);
28206 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
28212 /* Parse a Objective-C visibility specification. */
28215 cp_parser_objc_visibility_spec (cp_parser
* parser
)
28217 cp_token
*vis
= cp_lexer_peek_token (parser
->lexer
);
28219 switch (vis
->keyword
)
28221 case RID_AT_PRIVATE
:
28222 objc_set_visibility (OBJC_IVAR_VIS_PRIVATE
);
28224 case RID_AT_PROTECTED
:
28225 objc_set_visibility (OBJC_IVAR_VIS_PROTECTED
);
28227 case RID_AT_PUBLIC
:
28228 objc_set_visibility (OBJC_IVAR_VIS_PUBLIC
);
28230 case RID_AT_PACKAGE
:
28231 objc_set_visibility (OBJC_IVAR_VIS_PACKAGE
);
28237 /* Eat '@private'/'@protected'/'@public'. */
28238 cp_lexer_consume_token (parser
->lexer
);
28241 /* Parse an Objective-C method type. Return 'true' if it is a class
28242 (+) method, and 'false' if it is an instance (-) method. */
28245 cp_parser_objc_method_type (cp_parser
* parser
)
28247 if (cp_lexer_consume_token (parser
->lexer
)->type
== CPP_PLUS
)
28253 /* Parse an Objective-C protocol qualifier. */
28256 cp_parser_objc_protocol_qualifiers (cp_parser
* parser
)
28258 tree quals
= NULL_TREE
, node
;
28259 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28261 node
= token
->u
.value
;
28263 while (node
&& identifier_p (node
)
28264 && (node
== ridpointers
[(int) RID_IN
]
28265 || node
== ridpointers
[(int) RID_OUT
]
28266 || node
== ridpointers
[(int) RID_INOUT
]
28267 || node
== ridpointers
[(int) RID_BYCOPY
]
28268 || node
== ridpointers
[(int) RID_BYREF
]
28269 || node
== ridpointers
[(int) RID_ONEWAY
]))
28271 quals
= tree_cons (NULL_TREE
, node
, quals
);
28272 cp_lexer_consume_token (parser
->lexer
);
28273 token
= cp_lexer_peek_token (parser
->lexer
);
28274 node
= token
->u
.value
;
28280 /* Parse an Objective-C typename. */
28283 cp_parser_objc_typename (cp_parser
* parser
)
28285 tree type_name
= NULL_TREE
;
28287 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
28289 tree proto_quals
, cp_type
= NULL_TREE
;
28291 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
28292 proto_quals
= cp_parser_objc_protocol_qualifiers (parser
);
28294 /* An ObjC type name may consist of just protocol qualifiers, in which
28295 case the type shall default to 'id'. */
28296 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
28298 cp_type
= cp_parser_type_id (parser
);
28300 /* If the type could not be parsed, an error has already
28301 been produced. For error recovery, behave as if it had
28302 not been specified, which will use the default type
28304 if (cp_type
== error_mark_node
)
28306 cp_type
= NULL_TREE
;
28307 /* We need to skip to the closing parenthesis as
28308 cp_parser_type_id() does not seem to do it for
28310 cp_parser_skip_to_closing_parenthesis (parser
,
28311 /*recovering=*/true,
28312 /*or_comma=*/false,
28313 /*consume_paren=*/false);
28317 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
28318 type_name
= build_tree_list (proto_quals
, cp_type
);
28324 /* Check to see if TYPE refers to an Objective-C selector name. */
28327 cp_parser_objc_selector_p (enum cpp_ttype type
)
28329 return (type
== CPP_NAME
|| type
== CPP_KEYWORD
28330 || type
== CPP_AND_AND
|| type
== CPP_AND_EQ
|| type
== CPP_AND
28331 || type
== CPP_OR
|| type
== CPP_COMPL
|| type
== CPP_NOT
28332 || type
== CPP_NOT_EQ
|| type
== CPP_OR_OR
|| type
== CPP_OR_EQ
28333 || type
== CPP_XOR
|| type
== CPP_XOR_EQ
);
28336 /* Parse an Objective-C selector. */
28339 cp_parser_objc_selector (cp_parser
* parser
)
28341 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
28343 if (!cp_parser_objc_selector_p (token
->type
))
28345 error_at (token
->location
, "invalid Objective-C++ selector name");
28346 return error_mark_node
;
28349 /* C++ operator names are allowed to appear in ObjC selectors. */
28350 switch (token
->type
)
28352 case CPP_AND_AND
: return get_identifier ("and");
28353 case CPP_AND_EQ
: return get_identifier ("and_eq");
28354 case CPP_AND
: return get_identifier ("bitand");
28355 case CPP_OR
: return get_identifier ("bitor");
28356 case CPP_COMPL
: return get_identifier ("compl");
28357 case CPP_NOT
: return get_identifier ("not");
28358 case CPP_NOT_EQ
: return get_identifier ("not_eq");
28359 case CPP_OR_OR
: return get_identifier ("or");
28360 case CPP_OR_EQ
: return get_identifier ("or_eq");
28361 case CPP_XOR
: return get_identifier ("xor");
28362 case CPP_XOR_EQ
: return get_identifier ("xor_eq");
28363 default: return token
->u
.value
;
28367 /* Parse an Objective-C params list. */
28370 cp_parser_objc_method_keyword_params (cp_parser
* parser
, tree
* attributes
)
28372 tree params
= NULL_TREE
;
28373 bool maybe_unary_selector_p
= true;
28374 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28376 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
28378 tree selector
= NULL_TREE
, type_name
, identifier
;
28379 tree parm_attr
= NULL_TREE
;
28381 if (token
->keyword
== RID_ATTRIBUTE
)
28384 if (token
->type
!= CPP_COLON
)
28385 selector
= cp_parser_objc_selector (parser
);
28387 /* Detect if we have a unary selector. */
28388 if (maybe_unary_selector_p
28389 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
28391 params
= selector
; /* Might be followed by attributes. */
28395 maybe_unary_selector_p
= false;
28396 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
28398 /* Something went quite wrong. There should be a colon
28399 here, but there is not. Stop parsing parameters. */
28402 type_name
= cp_parser_objc_typename (parser
);
28403 /* New ObjC allows attributes on parameters too. */
28404 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
28405 parm_attr
= cp_parser_attributes_opt (parser
);
28406 identifier
= cp_parser_identifier (parser
);
28410 objc_build_keyword_decl (selector
,
28415 token
= cp_lexer_peek_token (parser
->lexer
);
28418 if (params
== NULL_TREE
)
28420 cp_parser_error (parser
, "objective-c++ method declaration is expected");
28421 return error_mark_node
;
28424 /* We allow tail attributes for the method. */
28425 if (token
->keyword
== RID_ATTRIBUTE
)
28427 *attributes
= cp_parser_attributes_opt (parser
);
28428 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
28429 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
28431 cp_parser_error (parser
,
28432 "method attributes must be specified at the end");
28433 return error_mark_node
;
28436 if (params
== NULL_TREE
)
28438 cp_parser_error (parser
, "objective-c++ method declaration is expected");
28439 return error_mark_node
;
28444 /* Parse the non-keyword Objective-C params. */
28447 cp_parser_objc_method_tail_params_opt (cp_parser
* parser
, bool *ellipsisp
,
28450 tree params
= make_node (TREE_LIST
);
28451 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28452 *ellipsisp
= false; /* Initially, assume no ellipsis. */
28454 while (token
->type
== CPP_COMMA
)
28456 cp_parameter_declarator
*parmdecl
;
28459 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
28460 token
= cp_lexer_peek_token (parser
->lexer
);
28462 if (token
->type
== CPP_ELLIPSIS
)
28464 cp_lexer_consume_token (parser
->lexer
); /* Eat '...'. */
28466 token
= cp_lexer_peek_token (parser
->lexer
);
28470 /* TODO: parse attributes for tail parameters. */
28471 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
28472 parm
= grokdeclarator (parmdecl
->declarator
,
28473 &parmdecl
->decl_specifiers
,
28474 PARM
, /*initialized=*/0,
28475 /*attrlist=*/NULL
);
28477 chainon (params
, build_tree_list (NULL_TREE
, parm
));
28478 token
= cp_lexer_peek_token (parser
->lexer
);
28481 /* We allow tail attributes for the method. */
28482 if (token
->keyword
== RID_ATTRIBUTE
)
28484 if (*attributes
== NULL_TREE
)
28486 *attributes
= cp_parser_attributes_opt (parser
);
28487 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
28488 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
28492 /* We have an error, but parse the attributes, so that we can
28494 *attributes
= cp_parser_attributes_opt (parser
);
28496 cp_parser_error (parser
,
28497 "method attributes must be specified at the end");
28498 return error_mark_node
;
28504 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28507 cp_parser_objc_interstitial_code (cp_parser
* parser
)
28509 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28511 /* If the next token is `extern' and the following token is a string
28512 literal, then we have a linkage specification. */
28513 if (token
->keyword
== RID_EXTERN
28514 && cp_parser_is_pure_string_literal
28515 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
28516 cp_parser_linkage_specification (parser
);
28517 /* Handle #pragma, if any. */
28518 else if (token
->type
== CPP_PRAGMA
)
28519 cp_parser_pragma (parser
, pragma_objc_icode
, NULL
);
28520 /* Allow stray semicolons. */
28521 else if (token
->type
== CPP_SEMICOLON
)
28522 cp_lexer_consume_token (parser
->lexer
);
28523 /* Mark methods as optional or required, when building protocols. */
28524 else if (token
->keyword
== RID_AT_OPTIONAL
)
28526 cp_lexer_consume_token (parser
->lexer
);
28527 objc_set_method_opt (true);
28529 else if (token
->keyword
== RID_AT_REQUIRED
)
28531 cp_lexer_consume_token (parser
->lexer
);
28532 objc_set_method_opt (false);
28534 else if (token
->keyword
== RID_NAMESPACE
)
28535 cp_parser_namespace_definition (parser
);
28536 /* Other stray characters must generate errors. */
28537 else if (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_CLOSE_BRACE
)
28539 cp_lexer_consume_token (parser
->lexer
);
28540 error ("stray %qs between Objective-C++ methods",
28541 token
->type
== CPP_OPEN_BRACE
? "{" : "}");
28543 /* Finally, try to parse a block-declaration, or a function-definition. */
28545 cp_parser_block_declaration (parser
, /*statement_p=*/false);
28548 /* Parse a method signature. */
28551 cp_parser_objc_method_signature (cp_parser
* parser
, tree
* attributes
)
28553 tree rettype
, kwdparms
, optparms
;
28554 bool ellipsis
= false;
28555 bool is_class_method
;
28557 is_class_method
= cp_parser_objc_method_type (parser
);
28558 rettype
= cp_parser_objc_typename (parser
);
28559 *attributes
= NULL_TREE
;
28560 kwdparms
= cp_parser_objc_method_keyword_params (parser
, attributes
);
28561 if (kwdparms
== error_mark_node
)
28562 return error_mark_node
;
28563 optparms
= cp_parser_objc_method_tail_params_opt (parser
, &ellipsis
, attributes
);
28564 if (optparms
== error_mark_node
)
28565 return error_mark_node
;
28567 return objc_build_method_signature (is_class_method
, rettype
, kwdparms
, optparms
, ellipsis
);
28571 cp_parser_objc_method_maybe_bad_prefix_attributes (cp_parser
* parser
)
28574 cp_lexer_save_tokens (parser
->lexer
);
28575 tattr
= cp_parser_attributes_opt (parser
);
28576 gcc_assert (tattr
) ;
28578 /* If the attributes are followed by a method introducer, this is not allowed.
28579 Dump the attributes and flag the situation. */
28580 if (cp_lexer_next_token_is (parser
->lexer
, CPP_PLUS
)
28581 || cp_lexer_next_token_is (parser
->lexer
, CPP_MINUS
))
28584 /* Otherwise, the attributes introduce some interstitial code, possibly so
28585 rewind to allow that check. */
28586 cp_lexer_rollback_tokens (parser
->lexer
);
28590 /* Parse an Objective-C method prototype list. */
28593 cp_parser_objc_method_prototype_list (cp_parser
* parser
)
28595 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28597 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
28599 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
28601 tree attributes
, sig
;
28602 bool is_class_method
;
28603 if (token
->type
== CPP_PLUS
)
28604 is_class_method
= true;
28606 is_class_method
= false;
28607 sig
= cp_parser_objc_method_signature (parser
, &attributes
);
28608 if (sig
== error_mark_node
)
28610 cp_parser_skip_to_end_of_block_or_statement (parser
);
28611 token
= cp_lexer_peek_token (parser
->lexer
);
28614 objc_add_method_declaration (is_class_method
, sig
, attributes
);
28615 cp_parser_consume_semicolon_at_end_of_statement (parser
);
28617 else if (token
->keyword
== RID_AT_PROPERTY
)
28618 cp_parser_objc_at_property_declaration (parser
);
28619 else if (token
->keyword
== RID_ATTRIBUTE
28620 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
28621 warning_at (cp_lexer_peek_token (parser
->lexer
)->location
,
28623 "prefix attributes are ignored for methods");
28625 /* Allow for interspersed non-ObjC++ code. */
28626 cp_parser_objc_interstitial_code (parser
);
28628 token
= cp_lexer_peek_token (parser
->lexer
);
28631 if (token
->type
!= CPP_EOF
)
28632 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
28634 cp_parser_error (parser
, "expected %<@end%>");
28636 objc_finish_interface ();
28639 /* Parse an Objective-C method definition list. */
28642 cp_parser_objc_method_definition_list (cp_parser
* parser
)
28644 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28646 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
28650 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
28653 tree sig
, attribute
;
28654 bool is_class_method
;
28655 if (token
->type
== CPP_PLUS
)
28656 is_class_method
= true;
28658 is_class_method
= false;
28659 push_deferring_access_checks (dk_deferred
);
28660 sig
= cp_parser_objc_method_signature (parser
, &attribute
);
28661 if (sig
== error_mark_node
)
28663 cp_parser_skip_to_end_of_block_or_statement (parser
);
28664 token
= cp_lexer_peek_token (parser
->lexer
);
28667 objc_start_method_definition (is_class_method
, sig
, attribute
,
28670 /* For historical reasons, we accept an optional semicolon. */
28671 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
28672 cp_lexer_consume_token (parser
->lexer
);
28674 ptk
= cp_lexer_peek_token (parser
->lexer
);
28675 if (!(ptk
->type
== CPP_PLUS
|| ptk
->type
== CPP_MINUS
28676 || ptk
->type
== CPP_EOF
|| ptk
->keyword
== RID_AT_END
))
28678 perform_deferred_access_checks (tf_warning_or_error
);
28679 stop_deferring_access_checks ();
28680 meth
= cp_parser_function_definition_after_declarator (parser
,
28682 pop_deferring_access_checks ();
28683 objc_finish_method_definition (meth
);
28686 /* The following case will be removed once @synthesize is
28687 completely implemented. */
28688 else if (token
->keyword
== RID_AT_PROPERTY
)
28689 cp_parser_objc_at_property_declaration (parser
);
28690 else if (token
->keyword
== RID_AT_SYNTHESIZE
)
28691 cp_parser_objc_at_synthesize_declaration (parser
);
28692 else if (token
->keyword
== RID_AT_DYNAMIC
)
28693 cp_parser_objc_at_dynamic_declaration (parser
);
28694 else if (token
->keyword
== RID_ATTRIBUTE
28695 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
28696 warning_at (token
->location
, OPT_Wattributes
,
28697 "prefix attributes are ignored for methods");
28699 /* Allow for interspersed non-ObjC++ code. */
28700 cp_parser_objc_interstitial_code (parser
);
28702 token
= cp_lexer_peek_token (parser
->lexer
);
28705 if (token
->type
!= CPP_EOF
)
28706 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
28708 cp_parser_error (parser
, "expected %<@end%>");
28710 objc_finish_implementation ();
28713 /* Parse Objective-C ivars. */
28716 cp_parser_objc_class_ivars (cp_parser
* parser
)
28718 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
28720 if (token
->type
!= CPP_OPEN_BRACE
)
28721 return; /* No ivars specified. */
28723 cp_lexer_consume_token (parser
->lexer
); /* Eat '{'. */
28724 token
= cp_lexer_peek_token (parser
->lexer
);
28726 while (token
->type
!= CPP_CLOSE_BRACE
28727 && token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
28729 cp_decl_specifier_seq declspecs
;
28730 int decl_class_or_enum_p
;
28731 tree prefix_attributes
;
28733 cp_parser_objc_visibility_spec (parser
);
28735 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
28738 cp_parser_decl_specifier_seq (parser
,
28739 CP_PARSER_FLAGS_OPTIONAL
,
28741 &decl_class_or_enum_p
);
28743 /* auto, register, static, extern, mutable. */
28744 if (declspecs
.storage_class
!= sc_none
)
28746 cp_parser_error (parser
, "invalid type for instance variable");
28747 declspecs
.storage_class
= sc_none
;
28750 /* thread_local. */
28751 if (decl_spec_seq_has_spec_p (&declspecs
, ds_thread
))
28753 cp_parser_error (parser
, "invalid type for instance variable");
28754 declspecs
.locations
[ds_thread
] = 0;
28758 if (decl_spec_seq_has_spec_p (&declspecs
, ds_typedef
))
28760 cp_parser_error (parser
, "invalid type for instance variable");
28761 declspecs
.locations
[ds_typedef
] = 0;
28764 prefix_attributes
= declspecs
.attributes
;
28765 declspecs
.attributes
= NULL_TREE
;
28767 /* Keep going until we hit the `;' at the end of the
28769 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
28771 tree width
= NULL_TREE
, attributes
, first_attribute
, decl
;
28772 cp_declarator
*declarator
= NULL
;
28773 int ctor_dtor_or_conv_p
;
28775 /* Check for a (possibly unnamed) bitfield declaration. */
28776 token
= cp_lexer_peek_token (parser
->lexer
);
28777 if (token
->type
== CPP_COLON
)
28780 if (token
->type
== CPP_NAME
28781 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
28784 /* Get the name of the bitfield. */
28785 declarator
= make_id_declarator (NULL_TREE
,
28786 cp_parser_identifier (parser
),
28790 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
28791 /* Get the width of the bitfield. */
28793 = cp_parser_constant_expression (parser
);
28797 /* Parse the declarator. */
28799 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
28800 &ctor_dtor_or_conv_p
,
28801 /*parenthesized_p=*/NULL
,
28802 /*member_p=*/false,
28803 /*friend_p=*/false);
28806 /* Look for attributes that apply to the ivar. */
28807 attributes
= cp_parser_attributes_opt (parser
);
28808 /* Remember which attributes are prefix attributes and
28810 first_attribute
= attributes
;
28811 /* Combine the attributes. */
28812 attributes
= chainon (prefix_attributes
, attributes
);
28815 /* Create the bitfield declaration. */
28816 decl
= grokbitfield (declarator
, &declspecs
,
28820 decl
= grokfield (declarator
, &declspecs
,
28821 NULL_TREE
, /*init_const_expr_p=*/false,
28822 NULL_TREE
, attributes
);
28824 /* Add the instance variable. */
28825 if (decl
!= error_mark_node
&& decl
!= NULL_TREE
)
28826 objc_add_instance_variable (decl
);
28828 /* Reset PREFIX_ATTRIBUTES. */
28829 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
28830 attributes
= TREE_CHAIN (attributes
);
28832 TREE_CHAIN (attributes
) = NULL_TREE
;
28834 token
= cp_lexer_peek_token (parser
->lexer
);
28836 if (token
->type
== CPP_COMMA
)
28838 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
28844 cp_parser_consume_semicolon_at_end_of_statement (parser
);
28845 token
= cp_lexer_peek_token (parser
->lexer
);
28848 if (token
->keyword
== RID_AT_END
)
28849 cp_parser_error (parser
, "expected %<}%>");
28851 /* Do not consume the RID_AT_END, so it will be read again as terminating
28852 the @interface of @implementation. */
28853 if (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
28854 cp_lexer_consume_token (parser
->lexer
); /* Eat '}'. */
28856 /* For historical reasons, we accept an optional semicolon. */
28857 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
28858 cp_lexer_consume_token (parser
->lexer
);
28861 /* Parse an Objective-C protocol declaration. */
28864 cp_parser_objc_protocol_declaration (cp_parser
* parser
, tree attributes
)
28866 tree proto
, protorefs
;
28869 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
28870 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
28872 tok
= cp_lexer_peek_token (parser
->lexer
);
28873 error_at (tok
->location
, "identifier expected after %<@protocol%>");
28874 cp_parser_consume_semicolon_at_end_of_statement (parser
);
28878 /* See if we have a forward declaration or a definition. */
28879 tok
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
28881 /* Try a forward declaration first. */
28882 if (tok
->type
== CPP_COMMA
|| tok
->type
== CPP_SEMICOLON
)
28888 id
= cp_parser_identifier (parser
);
28889 if (id
== error_mark_node
)
28892 objc_declare_protocol (id
, attributes
);
28894 if(cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
28895 cp_lexer_consume_token (parser
->lexer
);
28899 cp_parser_consume_semicolon_at_end_of_statement (parser
);
28902 /* Ok, we got a full-fledged definition (or at least should). */
28905 proto
= cp_parser_identifier (parser
);
28906 protorefs
= cp_parser_objc_protocol_refs_opt (parser
);
28907 objc_start_protocol (proto
, protorefs
, attributes
);
28908 cp_parser_objc_method_prototype_list (parser
);
28912 /* Parse an Objective-C superclass or category. */
28915 cp_parser_objc_superclass_or_category (cp_parser
*parser
,
28918 tree
*categ
, bool *is_class_extension
)
28920 cp_token
*next
= cp_lexer_peek_token (parser
->lexer
);
28922 *super
= *categ
= NULL_TREE
;
28923 *is_class_extension
= false;
28924 if (next
->type
== CPP_COLON
)
28926 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
28927 *super
= cp_parser_identifier (parser
);
28929 else if (next
->type
== CPP_OPEN_PAREN
)
28931 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
28933 /* If there is no category name, and this is an @interface, we
28934 have a class extension. */
28935 if (iface_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
28937 *categ
= NULL_TREE
;
28938 *is_class_extension
= true;
28941 *categ
= cp_parser_identifier (parser
);
28943 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
28947 /* Parse an Objective-C class interface. */
28950 cp_parser_objc_class_interface (cp_parser
* parser
, tree attributes
)
28952 tree name
, super
, categ
, protos
;
28953 bool is_class_extension
;
28955 cp_lexer_consume_token (parser
->lexer
); /* Eat '@interface'. */
28956 name
= cp_parser_identifier (parser
);
28957 if (name
== error_mark_node
)
28959 /* It's hard to recover because even if valid @interface stuff
28960 is to follow, we can't compile it (or validate it) if we
28961 don't even know which class it refers to. Let's assume this
28962 was a stray '@interface' token in the stream and skip it.
28966 cp_parser_objc_superclass_or_category (parser
, true, &super
, &categ
,
28967 &is_class_extension
);
28968 protos
= cp_parser_objc_protocol_refs_opt (parser
);
28970 /* We have either a class or a category on our hands. */
28971 if (categ
|| is_class_extension
)
28972 objc_start_category_interface (name
, categ
, protos
, attributes
);
28975 objc_start_class_interface (name
, super
, protos
, attributes
);
28976 /* Handle instance variable declarations, if any. */
28977 cp_parser_objc_class_ivars (parser
);
28978 objc_continue_interface ();
28981 cp_parser_objc_method_prototype_list (parser
);
28984 /* Parse an Objective-C class implementation. */
28987 cp_parser_objc_class_implementation (cp_parser
* parser
)
28989 tree name
, super
, categ
;
28990 bool is_class_extension
;
28992 cp_lexer_consume_token (parser
->lexer
); /* Eat '@implementation'. */
28993 name
= cp_parser_identifier (parser
);
28994 if (name
== error_mark_node
)
28996 /* It's hard to recover because even if valid @implementation
28997 stuff is to follow, we can't compile it (or validate it) if
28998 we don't even know which class it refers to. Let's assume
28999 this was a stray '@implementation' token in the stream and
29004 cp_parser_objc_superclass_or_category (parser
, false, &super
, &categ
,
29005 &is_class_extension
);
29007 /* We have either a class or a category on our hands. */
29009 objc_start_category_implementation (name
, categ
);
29012 objc_start_class_implementation (name
, super
);
29013 /* Handle instance variable declarations, if any. */
29014 cp_parser_objc_class_ivars (parser
);
29015 objc_continue_implementation ();
29018 cp_parser_objc_method_definition_list (parser
);
29021 /* Consume the @end token and finish off the implementation. */
29024 cp_parser_objc_end_implementation (cp_parser
* parser
)
29026 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
29027 objc_finish_implementation ();
29030 /* Parse an Objective-C declaration. */
29033 cp_parser_objc_declaration (cp_parser
* parser
, tree attributes
)
29035 /* Try to figure out what kind of declaration is present. */
29036 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
29039 switch (kwd
->keyword
)
29044 error_at (kwd
->location
, "attributes may not be specified before"
29045 " the %<@%D%> Objective-C++ keyword",
29049 case RID_AT_IMPLEMENTATION
:
29050 warning_at (kwd
->location
, OPT_Wattributes
,
29051 "prefix attributes are ignored before %<@%D%>",
29058 switch (kwd
->keyword
)
29061 cp_parser_objc_alias_declaration (parser
);
29064 cp_parser_objc_class_declaration (parser
);
29066 case RID_AT_PROTOCOL
:
29067 cp_parser_objc_protocol_declaration (parser
, attributes
);
29069 case RID_AT_INTERFACE
:
29070 cp_parser_objc_class_interface (parser
, attributes
);
29072 case RID_AT_IMPLEMENTATION
:
29073 cp_parser_objc_class_implementation (parser
);
29076 cp_parser_objc_end_implementation (parser
);
29079 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
29081 cp_parser_skip_to_end_of_block_or_statement (parser
);
29085 /* Parse an Objective-C try-catch-finally statement.
29087 objc-try-catch-finally-stmt:
29088 @try compound-statement objc-catch-clause-seq [opt]
29089 objc-finally-clause [opt]
29091 objc-catch-clause-seq:
29092 objc-catch-clause objc-catch-clause-seq [opt]
29095 @catch ( objc-exception-declaration ) compound-statement
29097 objc-finally-clause:
29098 @finally compound-statement
29100 objc-exception-declaration:
29101 parameter-declaration
29104 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29108 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29109 for C. Keep them in sync. */
29112 cp_parser_objc_try_catch_finally_statement (cp_parser
*parser
)
29114 location_t location
;
29117 cp_parser_require_keyword (parser
, RID_AT_TRY
, RT_AT_TRY
);
29118 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
29119 objc_maybe_warn_exceptions (location
);
29120 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29121 node, lest it get absorbed into the surrounding block. */
29122 stmt
= push_stmt_list ();
29123 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
29124 objc_begin_try_stmt (location
, pop_stmt_list (stmt
));
29126 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_CATCH
))
29128 cp_parameter_declarator
*parm
;
29129 tree parameter_declaration
= error_mark_node
;
29130 bool seen_open_paren
= false;
29132 cp_lexer_consume_token (parser
->lexer
);
29133 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
29134 seen_open_paren
= true;
29135 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
29137 /* We have "@catch (...)" (where the '...' are literally
29138 what is in the code). Skip the '...'.
29139 parameter_declaration is set to NULL_TREE, and
29140 objc_being_catch_clauses() knows that that means
29142 cp_lexer_consume_token (parser
->lexer
);
29143 parameter_declaration
= NULL_TREE
;
29147 /* We have "@catch (NSException *exception)" or something
29148 like that. Parse the parameter declaration. */
29149 parm
= cp_parser_parameter_declaration (parser
, false, NULL
);
29151 parameter_declaration
= error_mark_node
;
29153 parameter_declaration
= grokdeclarator (parm
->declarator
,
29154 &parm
->decl_specifiers
,
29155 PARM
, /*initialized=*/0,
29156 /*attrlist=*/NULL
);
29158 if (seen_open_paren
)
29159 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
29162 /* If there was no open parenthesis, we are recovering from
29163 an error, and we are trying to figure out what mistake
29164 the user has made. */
29166 /* If there is an immediate closing parenthesis, the user
29167 probably forgot the opening one (ie, they typed "@catch
29168 NSException *e)". Parse the closing parenthesis and keep
29170 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
29171 cp_lexer_consume_token (parser
->lexer
);
29173 /* If these is no immediate closing parenthesis, the user
29174 probably doesn't know that parenthesis are required at
29175 all (ie, they typed "@catch NSException *e"). So, just
29176 forget about the closing parenthesis and keep going. */
29178 objc_begin_catch_clause (parameter_declaration
);
29179 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
29180 objc_finish_catch_clause ();
29182 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_FINALLY
))
29184 cp_lexer_consume_token (parser
->lexer
);
29185 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
29186 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29187 node, lest it get absorbed into the surrounding block. */
29188 stmt
= push_stmt_list ();
29189 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
29190 objc_build_finally_clause (location
, pop_stmt_list (stmt
));
29193 return objc_finish_try_stmt ();
29196 /* Parse an Objective-C synchronized statement.
29198 objc-synchronized-stmt:
29199 @synchronized ( expression ) compound-statement
29201 Returns NULL_TREE. */
29204 cp_parser_objc_synchronized_statement (cp_parser
*parser
)
29206 location_t location
;
29209 cp_parser_require_keyword (parser
, RID_AT_SYNCHRONIZED
, RT_AT_SYNCHRONIZED
);
29211 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
29212 objc_maybe_warn_exceptions (location
);
29213 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
29214 lock
= cp_parser_expression (parser
);
29215 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
29217 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29218 node, lest it get absorbed into the surrounding block. */
29219 stmt
= push_stmt_list ();
29220 cp_parser_compound_statement (parser
, NULL
, BCS_NORMAL
, false);
29222 return objc_build_synchronized (location
, lock
, pop_stmt_list (stmt
));
29225 /* Parse an Objective-C throw statement.
29228 @throw assignment-expression [opt] ;
29230 Returns a constructed '@throw' statement. */
29233 cp_parser_objc_throw_statement (cp_parser
*parser
)
29235 tree expr
= NULL_TREE
;
29236 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
29238 cp_parser_require_keyword (parser
, RID_AT_THROW
, RT_AT_THROW
);
29240 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
29241 expr
= cp_parser_expression (parser
);
29243 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29245 return objc_build_throw_stmt (loc
, expr
);
29248 /* Parse an Objective-C statement. */
29251 cp_parser_objc_statement (cp_parser
* parser
)
29253 /* Try to figure out what kind of declaration is present. */
29254 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
29256 switch (kwd
->keyword
)
29259 return cp_parser_objc_try_catch_finally_statement (parser
);
29260 case RID_AT_SYNCHRONIZED
:
29261 return cp_parser_objc_synchronized_statement (parser
);
29263 return cp_parser_objc_throw_statement (parser
);
29265 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
29267 cp_parser_skip_to_end_of_block_or_statement (parser
);
29270 return error_mark_node
;
29273 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29274 look ahead to see if an objc keyword follows the attributes. This
29275 is to detect the use of prefix attributes on ObjC @interface and
29279 cp_parser_objc_valid_prefix_attributes (cp_parser
* parser
, tree
*attrib
)
29281 cp_lexer_save_tokens (parser
->lexer
);
29282 *attrib
= cp_parser_attributes_opt (parser
);
29283 gcc_assert (*attrib
);
29284 if (OBJC_IS_AT_KEYWORD (cp_lexer_peek_token (parser
->lexer
)->keyword
))
29286 cp_lexer_commit_tokens (parser
->lexer
);
29289 cp_lexer_rollback_tokens (parser
->lexer
);
29293 /* This routine is a minimal replacement for
29294 c_parser_struct_declaration () used when parsing the list of
29295 types/names or ObjC++ properties. For example, when parsing the
29298 @property (readonly) int a, b, c;
29300 this function is responsible for parsing "int a, int b, int c" and
29301 returning the declarations as CHAIN of DECLs.
29303 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29304 similar parsing. */
29306 cp_parser_objc_struct_declaration (cp_parser
*parser
)
29308 tree decls
= NULL_TREE
;
29309 cp_decl_specifier_seq declspecs
;
29310 int decl_class_or_enum_p
;
29311 tree prefix_attributes
;
29313 cp_parser_decl_specifier_seq (parser
,
29314 CP_PARSER_FLAGS_NONE
,
29316 &decl_class_or_enum_p
);
29318 if (declspecs
.type
== error_mark_node
)
29319 return error_mark_node
;
29321 /* auto, register, static, extern, mutable. */
29322 if (declspecs
.storage_class
!= sc_none
)
29324 cp_parser_error (parser
, "invalid type for property");
29325 declspecs
.storage_class
= sc_none
;
29328 /* thread_local. */
29329 if (decl_spec_seq_has_spec_p (&declspecs
, ds_thread
))
29331 cp_parser_error (parser
, "invalid type for property");
29332 declspecs
.locations
[ds_thread
] = 0;
29336 if (decl_spec_seq_has_spec_p (&declspecs
, ds_typedef
))
29338 cp_parser_error (parser
, "invalid type for property");
29339 declspecs
.locations
[ds_typedef
] = 0;
29342 prefix_attributes
= declspecs
.attributes
;
29343 declspecs
.attributes
= NULL_TREE
;
29345 /* Keep going until we hit the `;' at the end of the declaration. */
29346 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
29348 tree attributes
, first_attribute
, decl
;
29349 cp_declarator
*declarator
;
29352 /* Parse the declarator. */
29353 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
29354 NULL
, NULL
, false, false);
29356 /* Look for attributes that apply to the ivar. */
29357 attributes
= cp_parser_attributes_opt (parser
);
29358 /* Remember which attributes are prefix attributes and
29360 first_attribute
= attributes
;
29361 /* Combine the attributes. */
29362 attributes
= chainon (prefix_attributes
, attributes
);
29364 decl
= grokfield (declarator
, &declspecs
,
29365 NULL_TREE
, /*init_const_expr_p=*/false,
29366 NULL_TREE
, attributes
);
29368 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
29369 return error_mark_node
;
29371 /* Reset PREFIX_ATTRIBUTES. */
29372 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
29373 attributes
= TREE_CHAIN (attributes
);
29375 TREE_CHAIN (attributes
) = NULL_TREE
;
29377 DECL_CHAIN (decl
) = decls
;
29380 token
= cp_lexer_peek_token (parser
->lexer
);
29381 if (token
->type
== CPP_COMMA
)
29383 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
29392 /* Parse an Objective-C @property declaration. The syntax is:
29394 objc-property-declaration:
29395 '@property' objc-property-attributes[opt] struct-declaration ;
29397 objc-property-attributes:
29398 '(' objc-property-attribute-list ')'
29400 objc-property-attribute-list:
29401 objc-property-attribute
29402 objc-property-attribute-list, objc-property-attribute
29404 objc-property-attribute
29405 'getter' = identifier
29406 'setter' = identifier
29415 @property NSString *name;
29416 @property (readonly) id object;
29417 @property (retain, nonatomic, getter=getTheName) id name;
29418 @property int a, b, c;
29420 PS: This function is identical to
29421 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29423 cp_parser_objc_at_property_declaration (cp_parser
*parser
)
29425 /* The following variables hold the attributes of the properties as
29426 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29427 seen. When we see an attribute, we set them to 'true' (if they
29428 are boolean properties) or to the identifier (if they have an
29429 argument, ie, for getter and setter). Note that here we only
29430 parse the list of attributes, check the syntax and accumulate the
29431 attributes that we find. objc_add_property_declaration() will
29432 then process the information. */
29433 bool property_assign
= false;
29434 bool property_copy
= false;
29435 tree property_getter_ident
= NULL_TREE
;
29436 bool property_nonatomic
= false;
29437 bool property_readonly
= false;
29438 bool property_readwrite
= false;
29439 bool property_retain
= false;
29440 tree property_setter_ident
= NULL_TREE
;
29442 /* 'properties' is the list of properties that we read. Usually a
29443 single one, but maybe more (eg, in "@property int a, b, c;" there
29448 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
29450 cp_lexer_consume_token (parser
->lexer
); /* Eat '@property'. */
29452 /* Parse the optional attribute list... */
29453 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
29456 cp_lexer_consume_token (parser
->lexer
);
29460 bool syntax_error
= false;
29461 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
29464 if (token
->type
!= CPP_NAME
)
29466 cp_parser_error (parser
, "expected identifier");
29469 keyword
= C_RID_CODE (token
->u
.value
);
29470 cp_lexer_consume_token (parser
->lexer
);
29473 case RID_ASSIGN
: property_assign
= true; break;
29474 case RID_COPY
: property_copy
= true; break;
29475 case RID_NONATOMIC
: property_nonatomic
= true; break;
29476 case RID_READONLY
: property_readonly
= true; break;
29477 case RID_READWRITE
: property_readwrite
= true; break;
29478 case RID_RETAIN
: property_retain
= true; break;
29482 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
29484 if (keyword
== RID_GETTER
)
29485 cp_parser_error (parser
,
29486 "missing %<=%> (after %<getter%> attribute)");
29488 cp_parser_error (parser
,
29489 "missing %<=%> (after %<setter%> attribute)");
29490 syntax_error
= true;
29493 cp_lexer_consume_token (parser
->lexer
); /* eat the = */
29494 if (!cp_parser_objc_selector_p (cp_lexer_peek_token (parser
->lexer
)->type
))
29496 cp_parser_error (parser
, "expected identifier");
29497 syntax_error
= true;
29500 if (keyword
== RID_SETTER
)
29502 if (property_setter_ident
!= NULL_TREE
)
29504 cp_parser_error (parser
, "the %<setter%> attribute may only be specified once");
29505 cp_lexer_consume_token (parser
->lexer
);
29508 property_setter_ident
= cp_parser_objc_selector (parser
);
29509 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
29510 cp_parser_error (parser
, "setter name must terminate with %<:%>");
29512 cp_lexer_consume_token (parser
->lexer
);
29516 if (property_getter_ident
!= NULL_TREE
)
29518 cp_parser_error (parser
, "the %<getter%> attribute may only be specified once");
29519 cp_lexer_consume_token (parser
->lexer
);
29522 property_getter_ident
= cp_parser_objc_selector (parser
);
29526 cp_parser_error (parser
, "unknown property attribute");
29527 syntax_error
= true;
29534 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
29535 cp_lexer_consume_token (parser
->lexer
);
29540 /* FIXME: "@property (setter, assign);" will generate a spurious
29541 "error: expected ‘)’ before ‘,’ token". This is because
29542 cp_parser_require, unlike the C counterpart, will produce an
29543 error even if we are in error recovery. */
29544 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
29546 cp_parser_skip_to_closing_parenthesis (parser
,
29547 /*recovering=*/true,
29548 /*or_comma=*/false,
29549 /*consume_paren=*/true);
29553 /* ... and the property declaration(s). */
29554 properties
= cp_parser_objc_struct_declaration (parser
);
29556 if (properties
== error_mark_node
)
29558 cp_parser_skip_to_end_of_statement (parser
);
29559 /* If the next token is now a `;', consume it. */
29560 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
29561 cp_lexer_consume_token (parser
->lexer
);
29565 if (properties
== NULL_TREE
)
29566 cp_parser_error (parser
, "expected identifier");
29569 /* Comma-separated properties are chained together in
29570 reverse order; add them one by one. */
29571 properties
= nreverse (properties
);
29573 for (; properties
; properties
= TREE_CHAIN (properties
))
29574 objc_add_property_declaration (loc
, copy_node (properties
),
29575 property_readonly
, property_readwrite
,
29576 property_assign
, property_retain
,
29577 property_copy
, property_nonatomic
,
29578 property_getter_ident
, property_setter_ident
);
29581 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29584 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29586 objc-synthesize-declaration:
29587 @synthesize objc-synthesize-identifier-list ;
29589 objc-synthesize-identifier-list:
29590 objc-synthesize-identifier
29591 objc-synthesize-identifier-list, objc-synthesize-identifier
29593 objc-synthesize-identifier
29595 identifier = identifier
29598 @synthesize MyProperty;
29599 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29601 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29602 for C. Keep them in sync.
29605 cp_parser_objc_at_synthesize_declaration (cp_parser
*parser
)
29607 tree list
= NULL_TREE
;
29609 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
29611 cp_lexer_consume_token (parser
->lexer
); /* Eat '@synthesize'. */
29614 tree property
, ivar
;
29615 property
= cp_parser_identifier (parser
);
29616 if (property
== error_mark_node
)
29618 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29621 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
29623 cp_lexer_consume_token (parser
->lexer
);
29624 ivar
= cp_parser_identifier (parser
);
29625 if (ivar
== error_mark_node
)
29627 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29633 list
= chainon (list
, build_tree_list (ivar
, property
));
29634 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
29635 cp_lexer_consume_token (parser
->lexer
);
29639 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29640 objc_add_synthesize_declaration (loc
, list
);
29643 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29645 objc-dynamic-declaration:
29646 @dynamic identifier-list ;
29649 @dynamic MyProperty;
29650 @dynamic MyProperty, AnotherProperty;
29652 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29653 for C. Keep them in sync.
29656 cp_parser_objc_at_dynamic_declaration (cp_parser
*parser
)
29658 tree list
= NULL_TREE
;
29660 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
29662 cp_lexer_consume_token (parser
->lexer
); /* Eat '@dynamic'. */
29666 property
= cp_parser_identifier (parser
);
29667 if (property
== error_mark_node
)
29669 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29672 list
= chainon (list
, build_tree_list (NULL
, property
));
29673 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
29674 cp_lexer_consume_token (parser
->lexer
);
29678 cp_parser_consume_semicolon_at_end_of_statement (parser
);
29679 objc_add_dynamic_declaration (loc
, list
);
29683 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29685 /* Returns name of the next clause.
29686 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29687 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29688 returned and the token is consumed. */
29690 static pragma_omp_clause
29691 cp_parser_omp_clause_name (cp_parser
*parser
)
29693 pragma_omp_clause result
= PRAGMA_OMP_CLAUSE_NONE
;
29695 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
29696 result
= PRAGMA_OACC_CLAUSE_AUTO
;
29697 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_IF
))
29698 result
= PRAGMA_OMP_CLAUSE_IF
;
29699 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DEFAULT
))
29700 result
= PRAGMA_OMP_CLAUSE_DEFAULT
;
29701 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DELETE
))
29702 result
= PRAGMA_OACC_CLAUSE_DELETE
;
29703 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_PRIVATE
))
29704 result
= PRAGMA_OMP_CLAUSE_PRIVATE
;
29705 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
29706 result
= PRAGMA_OMP_CLAUSE_FOR
;
29707 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
29709 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
29710 const char *p
= IDENTIFIER_POINTER (id
);
29715 if (!strcmp ("aligned", p
))
29716 result
= PRAGMA_OMP_CLAUSE_ALIGNED
;
29717 else if (!strcmp ("async", p
))
29718 result
= PRAGMA_OACC_CLAUSE_ASYNC
;
29721 if (!strcmp ("collapse", p
))
29722 result
= PRAGMA_OMP_CLAUSE_COLLAPSE
;
29723 else if (!strcmp ("copy", p
))
29724 result
= PRAGMA_OACC_CLAUSE_COPY
;
29725 else if (!strcmp ("copyin", p
))
29726 result
= PRAGMA_OMP_CLAUSE_COPYIN
;
29727 else if (!strcmp ("copyout", p
))
29728 result
= PRAGMA_OACC_CLAUSE_COPYOUT
;
29729 else if (!strcmp ("copyprivate", p
))
29730 result
= PRAGMA_OMP_CLAUSE_COPYPRIVATE
;
29731 else if (!strcmp ("create", p
))
29732 result
= PRAGMA_OACC_CLAUSE_CREATE
;
29735 if (!strcmp ("defaultmap", p
))
29736 result
= PRAGMA_OMP_CLAUSE_DEFAULTMAP
;
29737 else if (!strcmp ("depend", p
))
29738 result
= PRAGMA_OMP_CLAUSE_DEPEND
;
29739 else if (!strcmp ("device", p
))
29740 result
= PRAGMA_OMP_CLAUSE_DEVICE
;
29741 else if (!strcmp ("deviceptr", p
))
29742 result
= PRAGMA_OACC_CLAUSE_DEVICEPTR
;
29743 else if (!strcmp ("device_resident", p
))
29744 result
= PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT
;
29745 else if (!strcmp ("dist_schedule", p
))
29746 result
= PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
;
29749 if (!strcmp ("final", p
))
29750 result
= PRAGMA_OMP_CLAUSE_FINAL
;
29751 else if (!strcmp ("firstprivate", p
))
29752 result
= PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
;
29753 else if (!strcmp ("from", p
))
29754 result
= PRAGMA_OMP_CLAUSE_FROM
;
29757 if (!strcmp ("gang", p
))
29758 result
= PRAGMA_OACC_CLAUSE_GANG
;
29759 else if (!strcmp ("grainsize", p
))
29760 result
= PRAGMA_OMP_CLAUSE_GRAINSIZE
;
29763 if (!strcmp ("hint", p
))
29764 result
= PRAGMA_OMP_CLAUSE_HINT
;
29765 else if (!strcmp ("host", p
))
29766 result
= PRAGMA_OACC_CLAUSE_HOST
;
29769 if (!strcmp ("inbranch", p
))
29770 result
= PRAGMA_OMP_CLAUSE_INBRANCH
;
29771 else if (!strcmp ("independent", p
))
29772 result
= PRAGMA_OACC_CLAUSE_INDEPENDENT
;
29773 else if (!strcmp ("is_device_ptr", p
))
29774 result
= PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR
;
29777 if (!strcmp ("lastprivate", p
))
29778 result
= PRAGMA_OMP_CLAUSE_LASTPRIVATE
;
29779 else if (!strcmp ("linear", p
))
29780 result
= PRAGMA_OMP_CLAUSE_LINEAR
;
29781 else if (!strcmp ("link", p
))
29782 result
= PRAGMA_OMP_CLAUSE_LINK
;
29785 if (!strcmp ("map", p
))
29786 result
= PRAGMA_OMP_CLAUSE_MAP
;
29787 else if (!strcmp ("mergeable", p
))
29788 result
= PRAGMA_OMP_CLAUSE_MERGEABLE
;
29789 else if (flag_cilkplus
&& !strcmp ("mask", p
))
29790 result
= PRAGMA_CILK_CLAUSE_MASK
;
29793 if (!strcmp ("nogroup", p
))
29794 result
= PRAGMA_OMP_CLAUSE_NOGROUP
;
29795 else if (!strcmp ("notinbranch", p
))
29796 result
= PRAGMA_OMP_CLAUSE_NOTINBRANCH
;
29797 else if (!strcmp ("nowait", p
))
29798 result
= PRAGMA_OMP_CLAUSE_NOWAIT
;
29799 else if (flag_cilkplus
&& !strcmp ("nomask", p
))
29800 result
= PRAGMA_CILK_CLAUSE_NOMASK
;
29801 else if (!strcmp ("num_gangs", p
))
29802 result
= PRAGMA_OACC_CLAUSE_NUM_GANGS
;
29803 else if (!strcmp ("num_tasks", p
))
29804 result
= PRAGMA_OMP_CLAUSE_NUM_TASKS
;
29805 else if (!strcmp ("num_teams", p
))
29806 result
= PRAGMA_OMP_CLAUSE_NUM_TEAMS
;
29807 else if (!strcmp ("num_threads", p
))
29808 result
= PRAGMA_OMP_CLAUSE_NUM_THREADS
;
29809 else if (!strcmp ("num_workers", p
))
29810 result
= PRAGMA_OACC_CLAUSE_NUM_WORKERS
;
29813 if (!strcmp ("ordered", p
))
29814 result
= PRAGMA_OMP_CLAUSE_ORDERED
;
29817 if (!strcmp ("parallel", p
))
29818 result
= PRAGMA_OMP_CLAUSE_PARALLEL
;
29819 else if (!strcmp ("present", p
))
29820 result
= PRAGMA_OACC_CLAUSE_PRESENT
;
29821 else if (!strcmp ("present_or_copy", p
)
29822 || !strcmp ("pcopy", p
))
29823 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY
;
29824 else if (!strcmp ("present_or_copyin", p
)
29825 || !strcmp ("pcopyin", p
))
29826 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN
;
29827 else if (!strcmp ("present_or_copyout", p
)
29828 || !strcmp ("pcopyout", p
))
29829 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT
;
29830 else if (!strcmp ("present_or_create", p
)
29831 || !strcmp ("pcreate", p
))
29832 result
= PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE
;
29833 else if (!strcmp ("priority", p
))
29834 result
= PRAGMA_OMP_CLAUSE_PRIORITY
;
29835 else if (!strcmp ("proc_bind", p
))
29836 result
= PRAGMA_OMP_CLAUSE_PROC_BIND
;
29839 if (!strcmp ("reduction", p
))
29840 result
= PRAGMA_OMP_CLAUSE_REDUCTION
;
29843 if (!strcmp ("safelen", p
))
29844 result
= PRAGMA_OMP_CLAUSE_SAFELEN
;
29845 else if (!strcmp ("schedule", p
))
29846 result
= PRAGMA_OMP_CLAUSE_SCHEDULE
;
29847 else if (!strcmp ("sections", p
))
29848 result
= PRAGMA_OMP_CLAUSE_SECTIONS
;
29849 else if (!strcmp ("self", p
))
29850 result
= PRAGMA_OACC_CLAUSE_SELF
;
29851 else if (!strcmp ("seq", p
))
29852 result
= PRAGMA_OACC_CLAUSE_SEQ
;
29853 else if (!strcmp ("shared", p
))
29854 result
= PRAGMA_OMP_CLAUSE_SHARED
;
29855 else if (!strcmp ("simd", p
))
29856 result
= PRAGMA_OMP_CLAUSE_SIMD
;
29857 else if (!strcmp ("simdlen", p
))
29858 result
= PRAGMA_OMP_CLAUSE_SIMDLEN
;
29861 if (!strcmp ("taskgroup", p
))
29862 result
= PRAGMA_OMP_CLAUSE_TASKGROUP
;
29863 else if (!strcmp ("thread_limit", p
))
29864 result
= PRAGMA_OMP_CLAUSE_THREAD_LIMIT
;
29865 else if (!strcmp ("threads", p
))
29866 result
= PRAGMA_OMP_CLAUSE_THREADS
;
29867 else if (!strcmp ("tile", p
))
29868 result
= PRAGMA_OACC_CLAUSE_TILE
;
29869 else if (!strcmp ("to", p
))
29870 result
= PRAGMA_OMP_CLAUSE_TO
;
29873 if (!strcmp ("uniform", p
))
29874 result
= PRAGMA_OMP_CLAUSE_UNIFORM
;
29875 else if (!strcmp ("untied", p
))
29876 result
= PRAGMA_OMP_CLAUSE_UNTIED
;
29877 else if (!strcmp ("use_device", p
))
29878 result
= PRAGMA_OACC_CLAUSE_USE_DEVICE
;
29879 else if (!strcmp ("use_device_ptr", p
))
29880 result
= PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR
;
29883 if (!strcmp ("vector", p
))
29884 result
= PRAGMA_OACC_CLAUSE_VECTOR
;
29885 else if (!strcmp ("vector_length", p
))
29886 result
= PRAGMA_OACC_CLAUSE_VECTOR_LENGTH
;
29887 else if (flag_cilkplus
&& !strcmp ("vectorlength", p
))
29888 result
= PRAGMA_CILK_CLAUSE_VECTORLENGTH
;
29891 if (!strcmp ("wait", p
))
29892 result
= PRAGMA_OACC_CLAUSE_WAIT
;
29893 else if (!strcmp ("worker", p
))
29894 result
= PRAGMA_OACC_CLAUSE_WORKER
;
29899 if (result
!= PRAGMA_OMP_CLAUSE_NONE
)
29900 cp_lexer_consume_token (parser
->lexer
);
29905 /* Validate that a clause of the given type does not already exist. */
29908 check_no_duplicate_clause (tree clauses
, enum omp_clause_code code
,
29909 const char *name
, location_t location
)
29913 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
29914 if (OMP_CLAUSE_CODE (c
) == code
)
29916 error_at (location
, "too many %qs clauses", name
);
29924 variable-list , identifier
29926 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29927 colon). An opening parenthesis will have been consumed by the caller.
29929 If KIND is nonzero, create the appropriate node and install the decl
29930 in OMP_CLAUSE_DECL and add the node to the head of the list.
29932 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29933 return the list created.
29935 COLON can be NULL if only closing parenthesis should end the list,
29936 or pointer to bool which will receive false if the list is terminated
29937 by closing parenthesis or true if the list is terminated by colon. */
29940 cp_parser_omp_var_list_no_open (cp_parser
*parser
, enum omp_clause_code kind
,
29941 tree list
, bool *colon
)
29944 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
29947 parser
->colon_corrects_to_scope_p
= false;
29954 token
= cp_lexer_peek_token (parser
->lexer
);
29956 && current_class_ptr
29957 && cp_parser_is_keyword (token
, RID_THIS
))
29959 decl
= finish_this_expr ();
29960 if (TREE_CODE (decl
) == NON_LVALUE_EXPR
29961 || CONVERT_EXPR_P (decl
))
29962 decl
= TREE_OPERAND (decl
, 0);
29963 cp_lexer_consume_token (parser
->lexer
);
29967 name
= cp_parser_id_expression (parser
, /*template_p=*/false,
29968 /*check_dependency_p=*/true,
29969 /*template_p=*/NULL
,
29970 /*declarator_p=*/false,
29971 /*optional_p=*/false);
29972 if (name
== error_mark_node
)
29975 decl
= cp_parser_lookup_name_simple (parser
, name
, token
->location
);
29976 if (decl
== error_mark_node
)
29977 cp_parser_name_lookup_error (parser
, name
, decl
, NLE_NULL
,
29980 if (decl
== error_mark_node
)
29982 else if (kind
!= 0)
29986 case OMP_CLAUSE__CACHE_
:
29987 /* The OpenACC cache directive explicitly only allows "array
29988 elements or subarrays". */
29989 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_OPEN_SQUARE
)
29991 error_at (token
->location
, "expected %<[%>");
29992 decl
= error_mark_node
;
29996 case OMP_CLAUSE_MAP
:
29997 case OMP_CLAUSE_FROM
:
29998 case OMP_CLAUSE_TO
:
29999 while (cp_lexer_next_token_is (parser
->lexer
, CPP_DOT
))
30002 = cp_lexer_peek_token (parser
->lexer
)->location
;
30003 cp_id_kind idk
= CP_ID_KIND_NONE
;
30004 cp_lexer_consume_token (parser
->lexer
);
30006 = cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
,
30011 case OMP_CLAUSE_DEPEND
:
30012 case OMP_CLAUSE_REDUCTION
:
30013 while (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
30015 tree low_bound
= NULL_TREE
, length
= NULL_TREE
;
30017 parser
->colon_corrects_to_scope_p
= false;
30018 cp_lexer_consume_token (parser
->lexer
);
30019 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
30020 low_bound
= cp_parser_expression (parser
);
30022 parser
->colon_corrects_to_scope_p
30023 = saved_colon_corrects_to_scope_p
;
30024 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_SQUARE
))
30025 length
= integer_one_node
;
30028 /* Look for `:'. */
30029 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
30031 if (!cp_lexer_next_token_is (parser
->lexer
,
30033 length
= cp_parser_expression (parser
);
30035 /* Look for the closing `]'. */
30036 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
,
30040 decl
= tree_cons (low_bound
, length
, decl
);
30047 tree u
= build_omp_clause (token
->location
, kind
);
30048 OMP_CLAUSE_DECL (u
) = decl
;
30049 OMP_CLAUSE_CHAIN (u
) = list
;
30053 list
= tree_cons (decl
, NULL_TREE
, list
);
30056 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
30058 cp_lexer_consume_token (parser
->lexer
);
30062 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
30064 if (colon
!= NULL
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
30067 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
30071 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30075 /* Try to resync to an unnested comma. Copied from
30076 cp_parser_parenthesized_expression_list. */
30079 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
30080 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
30081 /*recovering=*/true,
30083 /*consume_paren=*/true);
30091 /* Similarly, but expect leading and trailing parenthesis. This is a very
30092 common case for omp clauses. */
30095 cp_parser_omp_var_list (cp_parser
*parser
, enum omp_clause_code kind
, tree list
)
30097 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30098 return cp_parser_omp_var_list_no_open (parser
, kind
, list
, NULL
);
30103 copy ( variable-list )
30104 copyin ( variable-list )
30105 copyout ( variable-list )
30106 create ( variable-list )
30107 delete ( variable-list )
30108 present ( variable-list )
30109 present_or_copy ( variable-list )
30110 pcopy ( variable-list )
30111 present_or_copyin ( variable-list )
30112 pcopyin ( variable-list )
30113 present_or_copyout ( variable-list )
30114 pcopyout ( variable-list )
30115 present_or_create ( variable-list )
30116 pcreate ( variable-list ) */
30119 cp_parser_oacc_data_clause (cp_parser
*parser
, pragma_omp_clause c_kind
,
30122 enum gomp_map_kind kind
;
30125 case PRAGMA_OACC_CLAUSE_COPY
:
30126 kind
= GOMP_MAP_FORCE_TOFROM
;
30128 case PRAGMA_OACC_CLAUSE_COPYIN
:
30129 kind
= GOMP_MAP_FORCE_TO
;
30131 case PRAGMA_OACC_CLAUSE_COPYOUT
:
30132 kind
= GOMP_MAP_FORCE_FROM
;
30134 case PRAGMA_OACC_CLAUSE_CREATE
:
30135 kind
= GOMP_MAP_FORCE_ALLOC
;
30137 case PRAGMA_OACC_CLAUSE_DELETE
:
30138 kind
= GOMP_MAP_DELETE
;
30140 case PRAGMA_OACC_CLAUSE_DEVICE
:
30141 kind
= GOMP_MAP_FORCE_TO
;
30143 case PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT
:
30144 kind
= GOMP_MAP_DEVICE_RESIDENT
;
30146 case PRAGMA_OACC_CLAUSE_HOST
:
30147 case PRAGMA_OACC_CLAUSE_SELF
:
30148 kind
= GOMP_MAP_FORCE_FROM
;
30150 case PRAGMA_OACC_CLAUSE_LINK
:
30151 kind
= GOMP_MAP_LINK
;
30153 case PRAGMA_OACC_CLAUSE_PRESENT
:
30154 kind
= GOMP_MAP_FORCE_PRESENT
;
30156 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY
:
30157 kind
= GOMP_MAP_TOFROM
;
30159 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN
:
30160 kind
= GOMP_MAP_TO
;
30162 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT
:
30163 kind
= GOMP_MAP_FROM
;
30165 case PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE
:
30166 kind
= GOMP_MAP_ALLOC
;
30169 gcc_unreachable ();
30172 nl
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_MAP
, list
);
30174 for (c
= nl
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
30175 OMP_CLAUSE_SET_MAP_KIND (c
, kind
);
30181 deviceptr ( variable-list ) */
30184 cp_parser_oacc_data_clause_deviceptr (cp_parser
*parser
, tree list
)
30186 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
30189 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30190 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30191 variable-list must only allow for pointer variables. */
30192 vars
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
30193 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
30195 tree v
= TREE_PURPOSE (t
);
30196 tree u
= build_omp_clause (loc
, OMP_CLAUSE_MAP
);
30197 OMP_CLAUSE_SET_MAP_KIND (u
, GOMP_MAP_FORCE_DEVICEPTR
);
30198 OMP_CLAUSE_DECL (u
) = v
;
30199 OMP_CLAUSE_CHAIN (u
) = list
;
30213 cp_parser_oacc_simple_clause (cp_parser
* /* parser */,
30214 enum omp_clause_code code
,
30215 tree list
, location_t location
)
30217 check_no_duplicate_clause (list
, code
, omp_clause_code_name
[code
], location
);
30218 tree c
= build_omp_clause (location
, code
);
30219 OMP_CLAUSE_CHAIN (c
) = list
;
30224 num_gangs ( expression )
30225 num_workers ( expression )
30226 vector_length ( expression ) */
30229 cp_parser_oacc_single_int_clause (cp_parser
*parser
, omp_clause_code code
,
30230 const char *str
, tree list
)
30232 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
30234 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30237 tree t
= cp_parser_assignment_expression (parser
, NULL
, false, false);
30239 if (t
== error_mark_node
30240 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30242 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30243 /*or_comma=*/false,
30244 /*consume_paren=*/true);
30248 check_no_duplicate_clause (list
, code
, str
, loc
);
30250 tree c
= build_omp_clause (loc
, code
);
30251 OMP_CLAUSE_OPERAND (c
, 0) = t
;
30252 OMP_CLAUSE_CHAIN (c
) = list
;
30258 gang [( gang-arg-list )]
30259 worker [( [num:] int-expr )]
30260 vector [( [length:] int-expr )]
30262 where gang-arg is one of:
30267 and size-expr may be:
30274 cp_parser_oacc_shape_clause (cp_parser
*parser
, omp_clause_code kind
,
30275 const char *str
, tree list
)
30277 const char *id
= "num";
30278 cp_lexer
*lexer
= parser
->lexer
;
30279 tree ops
[2] = { NULL_TREE
, NULL_TREE
}, c
;
30280 location_t loc
= cp_lexer_peek_token (lexer
)->location
;
30282 if (kind
== OMP_CLAUSE_VECTOR
)
30285 if (cp_lexer_next_token_is (lexer
, CPP_OPEN_PAREN
))
30287 cp_lexer_consume_token (lexer
);
30291 cp_token
*next
= cp_lexer_peek_token (lexer
);
30294 /* Gang static argument. */
30295 if (kind
== OMP_CLAUSE_GANG
30296 && cp_lexer_next_token_is_keyword (lexer
, RID_STATIC
))
30298 cp_lexer_consume_token (lexer
);
30300 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
30301 goto cleanup_error
;
30304 if (ops
[idx
] != NULL
)
30306 cp_parser_error (parser
, "too many %<static%> arguments");
30307 goto cleanup_error
;
30310 /* Check for the '*' argument. */
30311 if (cp_lexer_next_token_is (lexer
, CPP_MULT
)
30312 && (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_COMMA
)
30313 || cp_lexer_nth_token_is (parser
->lexer
, 2,
30316 cp_lexer_consume_token (lexer
);
30317 ops
[idx
] = integer_minus_one_node
;
30319 if (cp_lexer_next_token_is (lexer
, CPP_COMMA
))
30321 cp_lexer_consume_token (lexer
);
30327 /* Worker num: argument and vector length: arguments. */
30328 else if (cp_lexer_next_token_is (lexer
, CPP_NAME
)
30329 && strcmp (id
, IDENTIFIER_POINTER (next
->u
.value
)) == 0
30330 && cp_lexer_nth_token_is (lexer
, 2, CPP_COLON
))
30332 cp_lexer_consume_token (lexer
); /* id */
30333 cp_lexer_consume_token (lexer
); /* ':' */
30336 /* Now collect the actual argument. */
30337 if (ops
[idx
] != NULL_TREE
)
30339 cp_parser_error (parser
, "unexpected argument");
30340 goto cleanup_error
;
30343 tree expr
= cp_parser_assignment_expression (parser
, NULL
, false,
30345 if (expr
== error_mark_node
)
30346 goto cleanup_error
;
30348 mark_exp_read (expr
);
30351 if (kind
== OMP_CLAUSE_GANG
30352 && cp_lexer_next_token_is (lexer
, CPP_COMMA
))
30354 cp_lexer_consume_token (lexer
);
30361 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30362 goto cleanup_error
;
30365 check_no_duplicate_clause (list
, kind
, str
, loc
);
30367 c
= build_omp_clause (loc
, kind
);
30370 OMP_CLAUSE_OPERAND (c
, 1) = ops
[1];
30372 OMP_CLAUSE_OPERAND (c
, 0) = ops
[0];
30373 OMP_CLAUSE_CHAIN (c
) = list
;
30378 cp_parser_skip_to_closing_parenthesis (parser
, false, false, true);
30383 tile ( size-expr-list ) */
30386 cp_parser_oacc_clause_tile (cp_parser
*parser
, location_t clause_loc
, tree list
)
30388 tree c
, expr
= error_mark_node
;
30389 tree tile
= NULL_TREE
;
30391 check_no_duplicate_clause (list
, OMP_CLAUSE_TILE
, "tile", clause_loc
);
30393 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30398 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
)
30399 && (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_COMMA
)
30400 || cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_CLOSE_PAREN
)))
30402 cp_lexer_consume_token (parser
->lexer
);
30403 expr
= integer_minus_one_node
;
30406 expr
= cp_parser_assignment_expression (parser
, NULL
, false, false);
30408 if (expr
== error_mark_node
)
30411 tile
= tree_cons (NULL_TREE
, expr
, tile
);
30413 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
30414 cp_lexer_consume_token (parser
->lexer
);
30416 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
));
30418 /* Consume the trailing ')'. */
30419 cp_lexer_consume_token (parser
->lexer
);
30421 c
= build_omp_clause (clause_loc
, OMP_CLAUSE_TILE
);
30422 tile
= nreverse (tile
);
30423 OMP_CLAUSE_TILE_LIST (c
) = tile
;
30424 OMP_CLAUSE_CHAIN (c
) = list
;
30429 Parse wait clause or directive parameters. */
30432 cp_parser_oacc_wait_list (cp_parser
*parser
, location_t clause_loc
, tree list
)
30434 vec
<tree
, va_gc
> *args
;
30437 args
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
30439 /*allow_expansion_p=*/true,
30440 /*non_constant_p=*/NULL
);
30442 if (args
== NULL
|| args
->length () == 0)
30444 cp_parser_error (parser
, "expected integer expression before ')'");
30446 release_tree_vector (args
);
30450 args_tree
= build_tree_list_vec (args
);
30452 release_tree_vector (args
);
30454 for (t
= args_tree
; t
; t
= TREE_CHAIN (t
))
30456 tree targ
= TREE_VALUE (t
);
30458 if (targ
!= error_mark_node
)
30460 if (!INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
30461 error ("%<wait%> expression must be integral");
30464 tree c
= build_omp_clause (clause_loc
, OMP_CLAUSE_WAIT
);
30466 mark_rvalue_use (targ
);
30467 OMP_CLAUSE_DECL (c
) = targ
;
30468 OMP_CLAUSE_CHAIN (c
) = list
;
30478 wait ( int-expr-list ) */
30481 cp_parser_oacc_clause_wait (cp_parser
*parser
, tree list
)
30483 location_t location
= cp_lexer_peek_token (parser
->lexer
)->location
;
30485 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_OPEN_PAREN
)
30488 list
= cp_parser_oacc_wait_list (parser
, location
, list
);
30494 collapse ( constant-expression ) */
30497 cp_parser_omp_clause_collapse (cp_parser
*parser
, tree list
, location_t location
)
30503 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
30504 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30507 num
= cp_parser_constant_expression (parser
);
30509 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30510 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30511 /*or_comma=*/false,
30512 /*consume_paren=*/true);
30514 if (num
== error_mark_node
)
30516 num
= fold_non_dependent_expr (num
);
30517 if (!tree_fits_shwi_p (num
)
30518 || !INTEGRAL_TYPE_P (TREE_TYPE (num
))
30519 || (n
= tree_to_shwi (num
)) <= 0
30522 error_at (loc
, "collapse argument needs positive constant integer expression");
30526 check_no_duplicate_clause (list
, OMP_CLAUSE_COLLAPSE
, "collapse", location
);
30527 c
= build_omp_clause (loc
, OMP_CLAUSE_COLLAPSE
);
30528 OMP_CLAUSE_CHAIN (c
) = list
;
30529 OMP_CLAUSE_COLLAPSE_EXPR (c
) = num
;
30535 default ( shared | none )
30541 cp_parser_omp_clause_default (cp_parser
*parser
, tree list
,
30542 location_t location
, bool is_oacc
)
30544 enum omp_clause_default_kind kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
30547 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30549 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
30551 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
30552 const char *p
= IDENTIFIER_POINTER (id
);
30557 if (strcmp ("none", p
) != 0)
30559 kind
= OMP_CLAUSE_DEFAULT_NONE
;
30563 if (strcmp ("shared", p
) != 0 || is_oacc
)
30565 kind
= OMP_CLAUSE_DEFAULT_SHARED
;
30572 cp_lexer_consume_token (parser
->lexer
);
30578 cp_parser_error (parser
, "expected %<none%>");
30580 cp_parser_error (parser
, "expected %<none%> or %<shared%>");
30583 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30584 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30585 /*or_comma=*/false,
30586 /*consume_paren=*/true);
30588 if (kind
== OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
30591 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULT
, "default", location
);
30592 c
= build_omp_clause (location
, OMP_CLAUSE_DEFAULT
);
30593 OMP_CLAUSE_CHAIN (c
) = list
;
30594 OMP_CLAUSE_DEFAULT_KIND (c
) = kind
;
30600 final ( expression ) */
30603 cp_parser_omp_clause_final (cp_parser
*parser
, tree list
, location_t location
)
30607 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30610 t
= cp_parser_condition (parser
);
30612 if (t
== error_mark_node
30613 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30614 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30615 /*or_comma=*/false,
30616 /*consume_paren=*/true);
30618 check_no_duplicate_clause (list
, OMP_CLAUSE_FINAL
, "final", location
);
30620 c
= build_omp_clause (location
, OMP_CLAUSE_FINAL
);
30621 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
30622 OMP_CLAUSE_CHAIN (c
) = list
;
30631 if ( directive-name-modifier : expression )
30633 directive-name-modifier:
30634 parallel | task | taskloop | target data | target | target update
30635 | target enter data | target exit data */
30638 cp_parser_omp_clause_if (cp_parser
*parser
, tree list
, location_t location
,
30642 enum tree_code if_modifier
= ERROR_MARK
;
30644 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30647 if (is_omp
&& cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
30649 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
30650 const char *p
= IDENTIFIER_POINTER (id
);
30653 if (strcmp ("parallel", p
) == 0)
30654 if_modifier
= OMP_PARALLEL
;
30655 else if (strcmp ("task", p
) == 0)
30656 if_modifier
= OMP_TASK
;
30657 else if (strcmp ("taskloop", p
) == 0)
30658 if_modifier
= OMP_TASKLOOP
;
30659 else if (strcmp ("target", p
) == 0)
30661 if_modifier
= OMP_TARGET
;
30662 if (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_NAME
))
30664 id
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->u
.value
;
30665 p
= IDENTIFIER_POINTER (id
);
30666 if (strcmp ("data", p
) == 0)
30667 if_modifier
= OMP_TARGET_DATA
;
30668 else if (strcmp ("update", p
) == 0)
30669 if_modifier
= OMP_TARGET_UPDATE
;
30670 else if (strcmp ("enter", p
) == 0)
30671 if_modifier
= OMP_TARGET_ENTER_DATA
;
30672 else if (strcmp ("exit", p
) == 0)
30673 if_modifier
= OMP_TARGET_EXIT_DATA
;
30674 if (if_modifier
!= OMP_TARGET
)
30679 = cp_lexer_peek_nth_token (parser
->lexer
, 2)->location
;
30680 error_at (loc
, "expected %<data%>, %<update%>, %<enter%> "
30682 if_modifier
= ERROR_MARK
;
30684 if (if_modifier
== OMP_TARGET_ENTER_DATA
30685 || if_modifier
== OMP_TARGET_EXIT_DATA
)
30687 if (cp_lexer_nth_token_is (parser
->lexer
, 3, CPP_NAME
))
30689 id
= cp_lexer_peek_nth_token (parser
->lexer
, 3)->u
.value
;
30690 p
= IDENTIFIER_POINTER (id
);
30691 if (strcmp ("data", p
) == 0)
30697 = cp_lexer_peek_nth_token (parser
->lexer
, 3)->location
;
30698 error_at (loc
, "expected %<data%>");
30699 if_modifier
= ERROR_MARK
;
30704 if (if_modifier
!= ERROR_MARK
)
30706 if (cp_lexer_nth_token_is (parser
->lexer
, n
, CPP_COLON
))
30709 cp_lexer_consume_token (parser
->lexer
);
30716 = cp_lexer_peek_nth_token (parser
->lexer
, n
)->location
;
30717 error_at (loc
, "expected %<:%>");
30719 if_modifier
= ERROR_MARK
;
30724 t
= cp_parser_condition (parser
);
30726 if (t
== error_mark_node
30727 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30728 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30729 /*or_comma=*/false,
30730 /*consume_paren=*/true);
30732 for (c
= list
; c
; c
= OMP_CLAUSE_CHAIN (c
))
30733 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IF
)
30735 if (if_modifier
!= ERROR_MARK
30736 && OMP_CLAUSE_IF_MODIFIER (c
) == if_modifier
)
30738 const char *p
= NULL
;
30739 switch (if_modifier
)
30741 case OMP_PARALLEL
: p
= "parallel"; break;
30742 case OMP_TASK
: p
= "task"; break;
30743 case OMP_TASKLOOP
: p
= "taskloop"; break;
30744 case OMP_TARGET_DATA
: p
= "target data"; break;
30745 case OMP_TARGET
: p
= "target"; break;
30746 case OMP_TARGET_UPDATE
: p
= "target update"; break;
30747 case OMP_TARGET_ENTER_DATA
: p
= "enter data"; break;
30748 case OMP_TARGET_EXIT_DATA
: p
= "exit data"; break;
30749 default: gcc_unreachable ();
30751 error_at (location
, "too many %<if%> clauses with %qs modifier",
30755 else if (OMP_CLAUSE_IF_MODIFIER (c
) == if_modifier
)
30758 error_at (location
, "too many %<if%> clauses");
30760 error_at (location
, "too many %<if%> clauses without modifier");
30763 else if (if_modifier
== ERROR_MARK
30764 || OMP_CLAUSE_IF_MODIFIER (c
) == ERROR_MARK
)
30766 error_at (location
, "if any %<if%> clause has modifier, then all "
30767 "%<if%> clauses have to use modifier");
30772 c
= build_omp_clause (location
, OMP_CLAUSE_IF
);
30773 OMP_CLAUSE_IF_MODIFIER (c
) = if_modifier
;
30774 OMP_CLAUSE_IF_EXPR (c
) = t
;
30775 OMP_CLAUSE_CHAIN (c
) = list
;
30784 cp_parser_omp_clause_mergeable (cp_parser
* /*parser*/,
30785 tree list
, location_t location
)
30789 check_no_duplicate_clause (list
, OMP_CLAUSE_MERGEABLE
, "mergeable",
30792 c
= build_omp_clause (location
, OMP_CLAUSE_MERGEABLE
);
30793 OMP_CLAUSE_CHAIN (c
) = list
;
30801 cp_parser_omp_clause_nowait (cp_parser
* /*parser*/,
30802 tree list
, location_t location
)
30806 check_no_duplicate_clause (list
, OMP_CLAUSE_NOWAIT
, "nowait", location
);
30808 c
= build_omp_clause (location
, OMP_CLAUSE_NOWAIT
);
30809 OMP_CLAUSE_CHAIN (c
) = list
;
30814 num_threads ( expression ) */
30817 cp_parser_omp_clause_num_threads (cp_parser
*parser
, tree list
,
30818 location_t location
)
30822 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30825 t
= cp_parser_expression (parser
);
30827 if (t
== error_mark_node
30828 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30829 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30830 /*or_comma=*/false,
30831 /*consume_paren=*/true);
30833 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_THREADS
,
30834 "num_threads", location
);
30836 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_THREADS
);
30837 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
30838 OMP_CLAUSE_CHAIN (c
) = list
;
30844 num_tasks ( expression ) */
30847 cp_parser_omp_clause_num_tasks (cp_parser
*parser
, tree list
,
30848 location_t location
)
30852 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30855 t
= cp_parser_expression (parser
);
30857 if (t
== error_mark_node
30858 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30859 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30860 /*or_comma=*/false,
30861 /*consume_paren=*/true);
30863 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_TASKS
,
30864 "num_tasks", location
);
30866 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_TASKS
);
30867 OMP_CLAUSE_NUM_TASKS_EXPR (c
) = t
;
30868 OMP_CLAUSE_CHAIN (c
) = list
;
30874 grainsize ( expression ) */
30877 cp_parser_omp_clause_grainsize (cp_parser
*parser
, tree list
,
30878 location_t location
)
30882 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30885 t
= cp_parser_expression (parser
);
30887 if (t
== error_mark_node
30888 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30889 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30890 /*or_comma=*/false,
30891 /*consume_paren=*/true);
30893 check_no_duplicate_clause (list
, OMP_CLAUSE_GRAINSIZE
,
30894 "grainsize", location
);
30896 c
= build_omp_clause (location
, OMP_CLAUSE_GRAINSIZE
);
30897 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
30898 OMP_CLAUSE_CHAIN (c
) = list
;
30904 priority ( expression ) */
30907 cp_parser_omp_clause_priority (cp_parser
*parser
, tree list
,
30908 location_t location
)
30912 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30915 t
= cp_parser_expression (parser
);
30917 if (t
== error_mark_node
30918 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30919 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30920 /*or_comma=*/false,
30921 /*consume_paren=*/true);
30923 check_no_duplicate_clause (list
, OMP_CLAUSE_PRIORITY
,
30924 "priority", location
);
30926 c
= build_omp_clause (location
, OMP_CLAUSE_PRIORITY
);
30927 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
30928 OMP_CLAUSE_CHAIN (c
) = list
;
30934 hint ( expression ) */
30937 cp_parser_omp_clause_hint (cp_parser
*parser
, tree list
,
30938 location_t location
)
30942 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30945 t
= cp_parser_expression (parser
);
30947 if (t
== error_mark_node
30948 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
30949 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
30950 /*or_comma=*/false,
30951 /*consume_paren=*/true);
30953 check_no_duplicate_clause (list
, OMP_CLAUSE_HINT
, "hint", location
);
30955 c
= build_omp_clause (location
, OMP_CLAUSE_HINT
);
30956 OMP_CLAUSE_HINT_EXPR (c
) = t
;
30957 OMP_CLAUSE_CHAIN (c
) = list
;
30963 defaultmap ( tofrom : scalar ) */
30966 cp_parser_omp_clause_defaultmap (cp_parser
*parser
, tree list
,
30967 location_t location
)
30972 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
30975 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
30977 cp_parser_error (parser
, "expected %<tofrom%>");
30980 id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
30981 p
= IDENTIFIER_POINTER (id
);
30982 if (strcmp (p
, "tofrom") != 0)
30984 cp_parser_error (parser
, "expected %<tofrom%>");
30987 cp_lexer_consume_token (parser
->lexer
);
30988 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
30991 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
30993 cp_parser_error (parser
, "expected %<scalar%>");
30996 id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
30997 p
= IDENTIFIER_POINTER (id
);
30998 if (strcmp (p
, "scalar") != 0)
31000 cp_parser_error (parser
, "expected %<scalar%>");
31003 cp_lexer_consume_token (parser
->lexer
);
31004 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31007 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULTMAP
, "defaultmap",
31010 c
= build_omp_clause (location
, OMP_CLAUSE_DEFAULTMAP
);
31011 OMP_CLAUSE_CHAIN (c
) = list
;
31015 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31016 /*or_comma=*/false,
31017 /*consume_paren=*/true);
31025 ordered ( constant-expression ) */
31028 cp_parser_omp_clause_ordered (cp_parser
*parser
,
31029 tree list
, location_t location
)
31031 tree c
, num
= NULL_TREE
;
31034 check_no_duplicate_clause (list
, OMP_CLAUSE_ORDERED
,
31035 "ordered", location
);
31037 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
31039 cp_lexer_consume_token (parser
->lexer
);
31041 num
= cp_parser_constant_expression (parser
);
31043 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31044 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31045 /*or_comma=*/false,
31046 /*consume_paren=*/true);
31048 if (num
== error_mark_node
)
31050 num
= fold_non_dependent_expr (num
);
31051 if (!tree_fits_shwi_p (num
)
31052 || !INTEGRAL_TYPE_P (TREE_TYPE (num
))
31053 || (n
= tree_to_shwi (num
)) <= 0
31056 error_at (location
,
31057 "ordered argument needs positive constant integer "
31063 c
= build_omp_clause (location
, OMP_CLAUSE_ORDERED
);
31064 OMP_CLAUSE_ORDERED_EXPR (c
) = num
;
31065 OMP_CLAUSE_CHAIN (c
) = list
;
31070 reduction ( reduction-operator : variable-list )
31072 reduction-operator:
31073 One of: + * - & ^ | && ||
31077 reduction-operator:
31078 One of: + * - & ^ | && || min max
31082 reduction-operator:
31083 One of: + * - & ^ | && ||
31087 cp_parser_omp_clause_reduction (cp_parser
*parser
, tree list
)
31089 enum tree_code code
= ERROR_MARK
;
31090 tree nlist
, c
, id
= NULL_TREE
;
31092 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31095 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
31097 case CPP_PLUS
: code
= PLUS_EXPR
; break;
31098 case CPP_MULT
: code
= MULT_EXPR
; break;
31099 case CPP_MINUS
: code
= MINUS_EXPR
; break;
31100 case CPP_AND
: code
= BIT_AND_EXPR
; break;
31101 case CPP_XOR
: code
= BIT_XOR_EXPR
; break;
31102 case CPP_OR
: code
= BIT_IOR_EXPR
; break;
31103 case CPP_AND_AND
: code
= TRUTH_ANDIF_EXPR
; break;
31104 case CPP_OR_OR
: code
= TRUTH_ORIF_EXPR
; break;
31108 if (code
!= ERROR_MARK
)
31109 cp_lexer_consume_token (parser
->lexer
);
31112 bool saved_colon_corrects_to_scope_p
;
31113 saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
31114 parser
->colon_corrects_to_scope_p
= false;
31115 id
= cp_parser_id_expression (parser
, /*template_p=*/false,
31116 /*check_dependency_p=*/true,
31117 /*template_p=*/NULL
,
31118 /*declarator_p=*/false,
31119 /*optional_p=*/false);
31120 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
31121 if (identifier_p (id
))
31123 const char *p
= IDENTIFIER_POINTER (id
);
31125 if (strcmp (p
, "min") == 0)
31127 else if (strcmp (p
, "max") == 0)
31129 else if (id
== ansi_opname (PLUS_EXPR
))
31131 else if (id
== ansi_opname (MULT_EXPR
))
31133 else if (id
== ansi_opname (MINUS_EXPR
))
31135 else if (id
== ansi_opname (BIT_AND_EXPR
))
31136 code
= BIT_AND_EXPR
;
31137 else if (id
== ansi_opname (BIT_IOR_EXPR
))
31138 code
= BIT_IOR_EXPR
;
31139 else if (id
== ansi_opname (BIT_XOR_EXPR
))
31140 code
= BIT_XOR_EXPR
;
31141 else if (id
== ansi_opname (TRUTH_ANDIF_EXPR
))
31142 code
= TRUTH_ANDIF_EXPR
;
31143 else if (id
== ansi_opname (TRUTH_ORIF_EXPR
))
31144 code
= TRUTH_ORIF_EXPR
;
31145 id
= omp_reduction_id (code
, id
, NULL_TREE
);
31146 tree scope
= parser
->scope
;
31148 id
= build_qualified_name (NULL_TREE
, scope
, id
, false);
31149 parser
->scope
= NULL_TREE
;
31150 parser
->qualifying_scope
= NULL_TREE
;
31151 parser
->object_scope
= NULL_TREE
;
31155 error ("invalid reduction-identifier");
31157 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31158 /*or_comma=*/false,
31159 /*consume_paren=*/true);
31164 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
31167 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_REDUCTION
, list
,
31169 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
31171 OMP_CLAUSE_REDUCTION_CODE (c
) = code
;
31172 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = id
;
31179 schedule ( schedule-kind )
31180 schedule ( schedule-kind , expression )
31183 static | dynamic | guided | runtime | auto
31186 schedule ( schedule-modifier : schedule-kind )
31187 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31195 cp_parser_omp_clause_schedule (cp_parser
*parser
, tree list
, location_t location
)
31198 int modifiers
= 0, nmodifiers
= 0;
31200 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31203 c
= build_omp_clause (location
, OMP_CLAUSE_SCHEDULE
);
31205 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31207 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31208 const char *p
= IDENTIFIER_POINTER (id
);
31209 if (strcmp ("simd", p
) == 0)
31210 OMP_CLAUSE_SCHEDULE_SIMD (c
) = 1;
31211 else if (strcmp ("monotonic", p
) == 0)
31212 modifiers
|= OMP_CLAUSE_SCHEDULE_MONOTONIC
;
31213 else if (strcmp ("nonmonotonic", p
) == 0)
31214 modifiers
|= OMP_CLAUSE_SCHEDULE_NONMONOTONIC
;
31217 cp_lexer_consume_token (parser
->lexer
);
31218 if (nmodifiers
++ == 0
31219 && cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
31220 cp_lexer_consume_token (parser
->lexer
);
31223 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
31228 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31230 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31231 const char *p
= IDENTIFIER_POINTER (id
);
31236 if (strcmp ("dynamic", p
) != 0)
31238 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_DYNAMIC
;
31242 if (strcmp ("guided", p
) != 0)
31244 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_GUIDED
;
31248 if (strcmp ("runtime", p
) != 0)
31250 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_RUNTIME
;
31257 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
31258 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_STATIC
;
31259 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
31260 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_AUTO
;
31263 cp_lexer_consume_token (parser
->lexer
);
31265 if ((modifiers
& (OMP_CLAUSE_SCHEDULE_MONOTONIC
31266 | OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
31267 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31268 | OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
31270 error_at (location
, "both %<monotonic%> and %<nonmonotonic%> modifiers "
31275 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
31278 cp_lexer_consume_token (parser
->lexer
);
31280 token
= cp_lexer_peek_token (parser
->lexer
);
31281 t
= cp_parser_assignment_expression (parser
);
31283 if (t
== error_mark_node
)
31285 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_RUNTIME
)
31286 error_at (token
->location
, "schedule %<runtime%> does not take "
31287 "a %<chunk_size%> parameter");
31288 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_AUTO
)
31289 error_at (token
->location
, "schedule %<auto%> does not take "
31290 "a %<chunk_size%> parameter");
31292 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
31294 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31297 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
31300 OMP_CLAUSE_SCHEDULE_KIND (c
)
31301 = (enum omp_clause_schedule_kind
)
31302 (OMP_CLAUSE_SCHEDULE_KIND (c
) | modifiers
);
31304 check_no_duplicate_clause (list
, OMP_CLAUSE_SCHEDULE
, "schedule", location
);
31305 OMP_CLAUSE_CHAIN (c
) = list
;
31309 cp_parser_error (parser
, "invalid schedule kind");
31311 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31312 /*or_comma=*/false,
31313 /*consume_paren=*/true);
31321 cp_parser_omp_clause_untied (cp_parser
* /*parser*/,
31322 tree list
, location_t location
)
31326 check_no_duplicate_clause (list
, OMP_CLAUSE_UNTIED
, "untied", location
);
31328 c
= build_omp_clause (location
, OMP_CLAUSE_UNTIED
);
31329 OMP_CLAUSE_CHAIN (c
) = list
;
31338 cp_parser_omp_clause_branch (cp_parser
* /*parser*/, enum omp_clause_code code
,
31339 tree list
, location_t location
)
31341 check_no_duplicate_clause (list
, code
, omp_clause_code_name
[code
], location
);
31342 tree c
= build_omp_clause (location
, code
);
31343 OMP_CLAUSE_CHAIN (c
) = list
;
31354 cp_parser_omp_clause_cancelkind (cp_parser
* /*parser*/,
31355 enum omp_clause_code code
,
31356 tree list
, location_t location
)
31358 tree c
= build_omp_clause (location
, code
);
31359 OMP_CLAUSE_CHAIN (c
) = list
;
31367 cp_parser_omp_clause_nogroup (cp_parser
* /*parser*/,
31368 tree list
, location_t location
)
31370 check_no_duplicate_clause (list
, OMP_CLAUSE_NOGROUP
, "nogroup", location
);
31371 tree c
= build_omp_clause (location
, OMP_CLAUSE_NOGROUP
);
31372 OMP_CLAUSE_CHAIN (c
) = list
;
31381 cp_parser_omp_clause_orderedkind (cp_parser
* /*parser*/,
31382 enum omp_clause_code code
,
31383 tree list
, location_t location
)
31385 check_no_duplicate_clause (list
, code
, omp_clause_code_name
[code
], location
);
31386 tree c
= build_omp_clause (location
, code
);
31387 OMP_CLAUSE_CHAIN (c
) = list
;
31392 num_teams ( expression ) */
31395 cp_parser_omp_clause_num_teams (cp_parser
*parser
, tree list
,
31396 location_t location
)
31400 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31403 t
= cp_parser_expression (parser
);
31405 if (t
== error_mark_node
31406 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31407 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31408 /*or_comma=*/false,
31409 /*consume_paren=*/true);
31411 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_TEAMS
,
31412 "num_teams", location
);
31414 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_TEAMS
);
31415 OMP_CLAUSE_NUM_TEAMS_EXPR (c
) = t
;
31416 OMP_CLAUSE_CHAIN (c
) = list
;
31422 thread_limit ( expression ) */
31425 cp_parser_omp_clause_thread_limit (cp_parser
*parser
, tree list
,
31426 location_t location
)
31430 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31433 t
= cp_parser_expression (parser
);
31435 if (t
== error_mark_node
31436 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31437 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31438 /*or_comma=*/false,
31439 /*consume_paren=*/true);
31441 check_no_duplicate_clause (list
, OMP_CLAUSE_THREAD_LIMIT
,
31442 "thread_limit", location
);
31444 c
= build_omp_clause (location
, OMP_CLAUSE_THREAD_LIMIT
);
31445 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
31446 OMP_CLAUSE_CHAIN (c
) = list
;
31452 aligned ( variable-list )
31453 aligned ( variable-list : constant-expression ) */
31456 cp_parser_omp_clause_aligned (cp_parser
*parser
, tree list
)
31458 tree nlist
, c
, alignment
= NULL_TREE
;
31461 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31464 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_ALIGNED
, list
,
31469 alignment
= cp_parser_constant_expression (parser
);
31471 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31472 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31473 /*or_comma=*/false,
31474 /*consume_paren=*/true);
31476 if (alignment
== error_mark_node
)
31477 alignment
= NULL_TREE
;
31480 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
31481 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = alignment
;
31487 linear ( variable-list )
31488 linear ( variable-list : expression )
31491 linear ( modifier ( variable-list ) )
31492 linear ( modifier ( variable-list ) : expression ) */
31495 cp_parser_omp_clause_linear (cp_parser
*parser
, tree list
,
31496 bool is_cilk_simd_fn
, bool declare_simd
)
31498 tree nlist
, c
, step
= integer_one_node
;
31500 enum omp_clause_linear_kind kind
= OMP_CLAUSE_LINEAR_DEFAULT
;
31502 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31505 if (!is_cilk_simd_fn
31506 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31508 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31509 const char *p
= IDENTIFIER_POINTER (id
);
31511 if (strcmp ("ref", p
) == 0)
31512 kind
= OMP_CLAUSE_LINEAR_REF
;
31513 else if (strcmp ("val", p
) == 0)
31514 kind
= OMP_CLAUSE_LINEAR_VAL
;
31515 else if (strcmp ("uval", p
) == 0)
31516 kind
= OMP_CLAUSE_LINEAR_UVAL
;
31517 if (cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_OPEN_PAREN
))
31518 cp_lexer_consume_token (parser
->lexer
);
31520 kind
= OMP_CLAUSE_LINEAR_DEFAULT
;
31523 if (kind
== OMP_CLAUSE_LINEAR_DEFAULT
)
31524 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_LINEAR
, list
,
31528 nlist
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LINEAR
, list
);
31529 colon
= cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
);
31531 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
31532 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31533 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31534 /*or_comma=*/false,
31535 /*consume_paren=*/true);
31542 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
31543 && cp_lexer_nth_token_is (parser
->lexer
, 2, CPP_CLOSE_PAREN
))
31545 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
31546 cp_parser_parse_tentatively (parser
);
31547 step
= cp_parser_id_expression (parser
, /*template_p=*/false,
31548 /*check_dependency_p=*/true,
31549 /*template_p=*/NULL
,
31550 /*declarator_p=*/false,
31551 /*optional_p=*/false);
31552 if (step
!= error_mark_node
)
31553 step
= cp_parser_lookup_name_simple (parser
, step
, token
->location
);
31554 if (step
== error_mark_node
)
31557 cp_parser_abort_tentative_parse (parser
);
31559 else if (!cp_parser_parse_definitely (parser
))
31563 step
= cp_parser_expression (parser
);
31565 if (is_cilk_simd_fn
&& TREE_CODE (step
) == PARM_DECL
)
31567 sorry ("using parameters for %<linear%> step is not supported yet");
31568 step
= integer_one_node
;
31570 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31571 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31572 /*or_comma=*/false,
31573 /*consume_paren=*/true);
31575 if (step
== error_mark_node
)
31579 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
31581 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
31582 OMP_CLAUSE_LINEAR_KIND (c
) = kind
;
31589 safelen ( constant-expression ) */
31592 cp_parser_omp_clause_safelen (cp_parser
*parser
, tree list
,
31593 location_t location
)
31597 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31600 t
= cp_parser_constant_expression (parser
);
31602 if (t
== error_mark_node
31603 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31604 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31605 /*or_comma=*/false,
31606 /*consume_paren=*/true);
31608 check_no_duplicate_clause (list
, OMP_CLAUSE_SAFELEN
, "safelen", location
);
31610 c
= build_omp_clause (location
, OMP_CLAUSE_SAFELEN
);
31611 OMP_CLAUSE_SAFELEN_EXPR (c
) = t
;
31612 OMP_CLAUSE_CHAIN (c
) = list
;
31618 simdlen ( constant-expression ) */
31621 cp_parser_omp_clause_simdlen (cp_parser
*parser
, tree list
,
31622 location_t location
)
31626 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31629 t
= cp_parser_constant_expression (parser
);
31631 if (t
== error_mark_node
31632 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31633 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31634 /*or_comma=*/false,
31635 /*consume_paren=*/true);
31637 check_no_duplicate_clause (list
, OMP_CLAUSE_SIMDLEN
, "simdlen", location
);
31639 c
= build_omp_clause (location
, OMP_CLAUSE_SIMDLEN
);
31640 OMP_CLAUSE_SIMDLEN_EXPR (c
) = t
;
31641 OMP_CLAUSE_CHAIN (c
) = list
;
31648 identifier [+/- integer]
31649 vec , identifier [+/- integer]
31653 cp_parser_omp_clause_depend_sink (cp_parser
*parser
, location_t clause_loc
,
31658 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
31660 cp_parser_error (parser
, "expected identifier");
31664 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31666 location_t id_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
31667 tree t
, identifier
= cp_parser_identifier (parser
);
31668 tree addend
= NULL
;
31670 if (identifier
== error_mark_node
)
31671 t
= error_mark_node
;
31674 t
= cp_parser_lookup_name_simple
31675 (parser
, identifier
,
31676 cp_lexer_peek_token (parser
->lexer
)->location
);
31677 if (t
== error_mark_node
)
31678 cp_parser_name_lookup_error (parser
, identifier
, t
, NLE_NULL
,
31683 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MINUS
))
31685 else if (!cp_lexer_next_token_is (parser
->lexer
, CPP_PLUS
))
31687 addend
= integer_zero_node
;
31688 goto add_to_vector
;
31690 cp_lexer_consume_token (parser
->lexer
);
31692 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NUMBER
))
31694 cp_parser_error (parser
, "expected integer");
31698 addend
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31699 if (TREE_CODE (addend
) != INTEGER_CST
)
31701 cp_parser_error (parser
, "expected integer");
31704 cp_lexer_consume_token (parser
->lexer
);
31707 if (t
!= error_mark_node
)
31709 vec
= tree_cons (addend
, t
, vec
);
31711 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (vec
) = 1;
31714 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
31717 cp_lexer_consume_token (parser
->lexer
);
31720 if (cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
) && vec
)
31722 tree u
= build_omp_clause (clause_loc
, OMP_CLAUSE_DEPEND
);
31723 OMP_CLAUSE_DEPEND_KIND (u
) = OMP_CLAUSE_DEPEND_SINK
;
31724 OMP_CLAUSE_DECL (u
) = nreverse (vec
);
31725 OMP_CLAUSE_CHAIN (u
) = list
;
31732 depend ( depend-kind : variable-list )
31740 depend ( sink : vec ) */
31743 cp_parser_omp_clause_depend (cp_parser
*parser
, tree list
, location_t loc
)
31746 enum omp_clause_depend_kind kind
= OMP_CLAUSE_DEPEND_INOUT
;
31748 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31751 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31753 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31754 const char *p
= IDENTIFIER_POINTER (id
);
31756 if (strcmp ("in", p
) == 0)
31757 kind
= OMP_CLAUSE_DEPEND_IN
;
31758 else if (strcmp ("inout", p
) == 0)
31759 kind
= OMP_CLAUSE_DEPEND_INOUT
;
31760 else if (strcmp ("out", p
) == 0)
31761 kind
= OMP_CLAUSE_DEPEND_OUT
;
31762 else if (strcmp ("source", p
) == 0)
31763 kind
= OMP_CLAUSE_DEPEND_SOURCE
;
31764 else if (strcmp ("sink", p
) == 0)
31765 kind
= OMP_CLAUSE_DEPEND_SINK
;
31772 cp_lexer_consume_token (parser
->lexer
);
31774 if (kind
== OMP_CLAUSE_DEPEND_SOURCE
)
31776 c
= build_omp_clause (loc
, OMP_CLAUSE_DEPEND
);
31777 OMP_CLAUSE_DEPEND_KIND (c
) = kind
;
31778 OMP_CLAUSE_DECL (c
) = NULL_TREE
;
31779 OMP_CLAUSE_CHAIN (c
) = list
;
31780 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31781 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31782 /*or_comma=*/false,
31783 /*consume_paren=*/true);
31787 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
31790 if (kind
== OMP_CLAUSE_DEPEND_SINK
)
31791 nlist
= cp_parser_omp_clause_depend_sink (parser
, loc
, list
);
31794 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_DEPEND
,
31797 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
31798 OMP_CLAUSE_DEPEND_KIND (c
) = kind
;
31803 cp_parser_error (parser
, "invalid depend kind");
31805 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31806 /*or_comma=*/false,
31807 /*consume_paren=*/true);
31812 map ( map-kind : variable-list )
31813 map ( variable-list )
31816 alloc | to | from | tofrom
31820 alloc | to | from | tofrom | release | delete
31822 map ( always [,] map-kind: variable-list ) */
31825 cp_parser_omp_clause_map (cp_parser
*parser
, tree list
)
31828 enum gomp_map_kind kind
= GOMP_MAP_TOFROM
;
31829 bool always
= false;
31831 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31834 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31836 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31837 const char *p
= IDENTIFIER_POINTER (id
);
31839 if (strcmp ("always", p
) == 0)
31842 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COMMA
)
31844 if ((cp_lexer_peek_nth_token (parser
->lexer
, nth
)->type
== CPP_NAME
31845 || (cp_lexer_peek_nth_token (parser
->lexer
, nth
)->keyword
31847 && (cp_lexer_peek_nth_token (parser
->lexer
, nth
+ 1)->type
31851 cp_lexer_consume_token (parser
->lexer
);
31853 cp_lexer_consume_token (parser
->lexer
);
31858 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
31859 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
31861 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
31862 const char *p
= IDENTIFIER_POINTER (id
);
31864 if (strcmp ("alloc", p
) == 0)
31865 kind
= GOMP_MAP_ALLOC
;
31866 else if (strcmp ("to", p
) == 0)
31867 kind
= always
? GOMP_MAP_ALWAYS_TO
: GOMP_MAP_TO
;
31868 else if (strcmp ("from", p
) == 0)
31869 kind
= always
? GOMP_MAP_ALWAYS_FROM
: GOMP_MAP_FROM
;
31870 else if (strcmp ("tofrom", p
) == 0)
31871 kind
= always
? GOMP_MAP_ALWAYS_TOFROM
: GOMP_MAP_TOFROM
;
31872 else if (strcmp ("release", p
) == 0)
31873 kind
= GOMP_MAP_RELEASE
;
31876 cp_parser_error (parser
, "invalid map kind");
31877 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31878 /*or_comma=*/false,
31879 /*consume_paren=*/true);
31882 cp_lexer_consume_token (parser
->lexer
);
31883 cp_lexer_consume_token (parser
->lexer
);
31885 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DELETE
)
31886 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
31888 kind
= GOMP_MAP_DELETE
;
31889 cp_lexer_consume_token (parser
->lexer
);
31890 cp_lexer_consume_token (parser
->lexer
);
31893 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_MAP
, list
,
31896 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
31897 OMP_CLAUSE_SET_MAP_KIND (c
, kind
);
31903 device ( expression ) */
31906 cp_parser_omp_clause_device (cp_parser
*parser
, tree list
,
31907 location_t location
)
31911 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31914 t
= cp_parser_expression (parser
);
31916 if (t
== error_mark_node
31917 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31918 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31919 /*or_comma=*/false,
31920 /*consume_paren=*/true);
31922 check_no_duplicate_clause (list
, OMP_CLAUSE_DEVICE
,
31923 "device", location
);
31925 c
= build_omp_clause (location
, OMP_CLAUSE_DEVICE
);
31926 OMP_CLAUSE_DEVICE_ID (c
) = t
;
31927 OMP_CLAUSE_CHAIN (c
) = list
;
31933 dist_schedule ( static )
31934 dist_schedule ( static , expression ) */
31937 cp_parser_omp_clause_dist_schedule (cp_parser
*parser
, tree list
,
31938 location_t location
)
31942 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31945 c
= build_omp_clause (location
, OMP_CLAUSE_DIST_SCHEDULE
);
31947 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
31949 cp_lexer_consume_token (parser
->lexer
);
31951 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
31953 cp_lexer_consume_token (parser
->lexer
);
31955 t
= cp_parser_assignment_expression (parser
);
31957 if (t
== error_mark_node
)
31959 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
31961 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
31964 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
31967 check_no_duplicate_clause (list
, OMP_CLAUSE_DIST_SCHEDULE
, "dist_schedule",
31969 OMP_CLAUSE_CHAIN (c
) = list
;
31973 cp_parser_error (parser
, "invalid dist_schedule kind");
31975 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
31976 /*or_comma=*/false,
31977 /*consume_paren=*/true);
31982 proc_bind ( proc-bind-kind )
31985 master | close | spread */
31988 cp_parser_omp_clause_proc_bind (cp_parser
*parser
, tree list
,
31989 location_t location
)
31992 enum omp_clause_proc_bind_kind kind
;
31994 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
31997 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
31999 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32000 const char *p
= IDENTIFIER_POINTER (id
);
32002 if (strcmp ("master", p
) == 0)
32003 kind
= OMP_CLAUSE_PROC_BIND_MASTER
;
32004 else if (strcmp ("close", p
) == 0)
32005 kind
= OMP_CLAUSE_PROC_BIND_CLOSE
;
32006 else if (strcmp ("spread", p
) == 0)
32007 kind
= OMP_CLAUSE_PROC_BIND_SPREAD
;
32014 cp_lexer_consume_token (parser
->lexer
);
32015 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
32018 c
= build_omp_clause (location
, OMP_CLAUSE_PROC_BIND
);
32019 check_no_duplicate_clause (list
, OMP_CLAUSE_PROC_BIND
, "proc_bind",
32021 OMP_CLAUSE_PROC_BIND_KIND (c
) = kind
;
32022 OMP_CLAUSE_CHAIN (c
) = list
;
32026 cp_parser_error (parser
, "invalid depend kind");
32028 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32029 /*or_comma=*/false,
32030 /*consume_paren=*/true);
32035 async [( int-expr )] */
32038 cp_parser_oacc_clause_async (cp_parser
*parser
, tree list
)
32041 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
32043 t
= build_int_cst (integer_type_node
, GOMP_ASYNC_NOVAL
);
32045 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
32047 cp_lexer_consume_token (parser
->lexer
);
32049 t
= cp_parser_expression (parser
);
32050 if (t
== error_mark_node
32051 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
32052 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
32053 /*or_comma=*/false,
32054 /*consume_paren=*/true);
32057 check_no_duplicate_clause (list
, OMP_CLAUSE_ASYNC
, "async", loc
);
32059 c
= build_omp_clause (loc
, OMP_CLAUSE_ASYNC
);
32060 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
32061 OMP_CLAUSE_CHAIN (c
) = list
;
32067 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32068 is a bitmask in MASK. Return the list of clauses found. */
32071 cp_parser_oacc_all_clauses (cp_parser
*parser
, omp_clause_mask mask
,
32072 const char *where
, cp_token
*pragma_tok
,
32073 bool finish_p
= true)
32075 tree clauses
= NULL
;
32078 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
32081 pragma_omp_clause c_kind
;
32082 omp_clause_code code
;
32083 const char *c_name
;
32084 tree prev
= clauses
;
32086 if (!first
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
32087 cp_lexer_consume_token (parser
->lexer
);
32089 here
= cp_lexer_peek_token (parser
->lexer
)->location
;
32090 c_kind
= cp_parser_omp_clause_name (parser
);
32094 case PRAGMA_OACC_CLAUSE_ASYNC
:
32095 clauses
= cp_parser_oacc_clause_async (parser
, clauses
);
32098 case PRAGMA_OACC_CLAUSE_AUTO
:
32099 clauses
= cp_parser_oacc_simple_clause (parser
, OMP_CLAUSE_AUTO
,
32103 case PRAGMA_OACC_CLAUSE_COLLAPSE
:
32104 clauses
= cp_parser_omp_clause_collapse (parser
, clauses
, here
);
32105 c_name
= "collapse";
32107 case PRAGMA_OACC_CLAUSE_COPY
:
32108 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32111 case PRAGMA_OACC_CLAUSE_COPYIN
:
32112 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32115 case PRAGMA_OACC_CLAUSE_COPYOUT
:
32116 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32117 c_name
= "copyout";
32119 case PRAGMA_OACC_CLAUSE_CREATE
:
32120 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32123 case PRAGMA_OACC_CLAUSE_DELETE
:
32124 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32127 case PRAGMA_OMP_CLAUSE_DEFAULT
:
32128 clauses
= cp_parser_omp_clause_default (parser
, clauses
, here
, true);
32129 c_name
= "default";
32131 case PRAGMA_OACC_CLAUSE_DEVICE
:
32132 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32135 case PRAGMA_OACC_CLAUSE_DEVICEPTR
:
32136 clauses
= cp_parser_oacc_data_clause_deviceptr (parser
, clauses
);
32137 c_name
= "deviceptr";
32139 case PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT
:
32140 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32141 c_name
= "device_resident";
32143 case PRAGMA_OACC_CLAUSE_FIRSTPRIVATE
:
32144 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
32146 c_name
= "firstprivate";
32148 case PRAGMA_OACC_CLAUSE_GANG
:
32150 clauses
= cp_parser_oacc_shape_clause (parser
, OMP_CLAUSE_GANG
,
32153 case PRAGMA_OACC_CLAUSE_HOST
:
32154 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32157 case PRAGMA_OACC_CLAUSE_IF
:
32158 clauses
= cp_parser_omp_clause_if (parser
, clauses
, here
, false);
32161 case PRAGMA_OACC_CLAUSE_INDEPENDENT
:
32162 clauses
= cp_parser_oacc_simple_clause (parser
,
32163 OMP_CLAUSE_INDEPENDENT
,
32165 c_name
= "independent";
32167 case PRAGMA_OACC_CLAUSE_LINK
:
32168 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32171 case PRAGMA_OACC_CLAUSE_NUM_GANGS
:
32172 code
= OMP_CLAUSE_NUM_GANGS
;
32173 c_name
= "num_gangs";
32174 clauses
= cp_parser_oacc_single_int_clause (parser
, code
, c_name
,
32177 case PRAGMA_OACC_CLAUSE_NUM_WORKERS
:
32178 c_name
= "num_workers";
32179 code
= OMP_CLAUSE_NUM_WORKERS
;
32180 clauses
= cp_parser_oacc_single_int_clause (parser
, code
, c_name
,
32183 case PRAGMA_OACC_CLAUSE_PRESENT
:
32184 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32185 c_name
= "present";
32187 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY
:
32188 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32189 c_name
= "present_or_copy";
32191 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN
:
32192 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32193 c_name
= "present_or_copyin";
32195 case PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT
:
32196 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32197 c_name
= "present_or_copyout";
32199 case PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE
:
32200 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32201 c_name
= "present_or_create";
32203 case PRAGMA_OACC_CLAUSE_PRIVATE
:
32204 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
32206 c_name
= "private";
32208 case PRAGMA_OACC_CLAUSE_REDUCTION
:
32209 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
32210 c_name
= "reduction";
32212 case PRAGMA_OACC_CLAUSE_SELF
:
32213 clauses
= cp_parser_oacc_data_clause (parser
, c_kind
, clauses
);
32216 case PRAGMA_OACC_CLAUSE_SEQ
:
32217 clauses
= cp_parser_oacc_simple_clause (parser
, OMP_CLAUSE_SEQ
,
32221 case PRAGMA_OACC_CLAUSE_TILE
:
32222 clauses
= cp_parser_oacc_clause_tile (parser
, here
, clauses
);
32225 case PRAGMA_OACC_CLAUSE_USE_DEVICE
:
32226 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_USE_DEVICE_PTR
,
32228 c_name
= "use_device";
32230 case PRAGMA_OACC_CLAUSE_VECTOR
:
32232 clauses
= cp_parser_oacc_shape_clause (parser
, OMP_CLAUSE_VECTOR
,
32235 case PRAGMA_OACC_CLAUSE_VECTOR_LENGTH
:
32236 c_name
= "vector_length";
32237 code
= OMP_CLAUSE_VECTOR_LENGTH
;
32238 clauses
= cp_parser_oacc_single_int_clause (parser
, code
, c_name
,
32241 case PRAGMA_OACC_CLAUSE_WAIT
:
32242 clauses
= cp_parser_oacc_clause_wait (parser
, clauses
);
32245 case PRAGMA_OACC_CLAUSE_WORKER
:
32247 clauses
= cp_parser_oacc_shape_clause (parser
, OMP_CLAUSE_WORKER
,
32251 cp_parser_error (parser
, "expected %<#pragma acc%> clause");
32257 if (((mask
>> c_kind
) & 1) == 0)
32259 /* Remove the invalid clause(s) from the list to avoid
32260 confusing the rest of the compiler. */
32262 error_at (here
, "%qs is not valid for %qs", c_name
, where
);
32267 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
32270 return finish_omp_clauses (clauses
, C_ORT_ACC
);
32275 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32276 is a bitmask in MASK. Return the list of clauses found; the result
32277 of clause default goes in *pdefault. */
32280 cp_parser_omp_all_clauses (cp_parser
*parser
, omp_clause_mask mask
,
32281 const char *where
, cp_token
*pragma_tok
,
32282 bool finish_p
= true)
32284 tree clauses
= NULL
;
32286 cp_token
*token
= NULL
;
32288 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
32290 pragma_omp_clause c_kind
;
32291 const char *c_name
;
32292 tree prev
= clauses
;
32294 if (!first
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
32295 cp_lexer_consume_token (parser
->lexer
);
32297 token
= cp_lexer_peek_token (parser
->lexer
);
32298 c_kind
= cp_parser_omp_clause_name (parser
);
32302 case PRAGMA_OMP_CLAUSE_COLLAPSE
:
32303 clauses
= cp_parser_omp_clause_collapse (parser
, clauses
,
32305 c_name
= "collapse";
32307 case PRAGMA_OMP_CLAUSE_COPYIN
:
32308 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYIN
, clauses
);
32311 case PRAGMA_OMP_CLAUSE_COPYPRIVATE
:
32312 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYPRIVATE
,
32314 c_name
= "copyprivate";
32316 case PRAGMA_OMP_CLAUSE_DEFAULT
:
32317 clauses
= cp_parser_omp_clause_default (parser
, clauses
,
32318 token
->location
, false);
32319 c_name
= "default";
32321 case PRAGMA_OMP_CLAUSE_FINAL
:
32322 clauses
= cp_parser_omp_clause_final (parser
, clauses
, token
->location
);
32325 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
:
32326 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
32328 c_name
= "firstprivate";
32330 case PRAGMA_OMP_CLAUSE_GRAINSIZE
:
32331 clauses
= cp_parser_omp_clause_grainsize (parser
, clauses
,
32333 c_name
= "grainsize";
32335 case PRAGMA_OMP_CLAUSE_HINT
:
32336 clauses
= cp_parser_omp_clause_hint (parser
, clauses
,
32340 case PRAGMA_OMP_CLAUSE_DEFAULTMAP
:
32341 clauses
= cp_parser_omp_clause_defaultmap (parser
, clauses
,
32343 c_name
= "defaultmap";
32345 case PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR
:
32346 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_USE_DEVICE_PTR
,
32348 c_name
= "use_device_ptr";
32350 case PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR
:
32351 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_IS_DEVICE_PTR
,
32353 c_name
= "is_device_ptr";
32355 case PRAGMA_OMP_CLAUSE_IF
:
32356 clauses
= cp_parser_omp_clause_if (parser
, clauses
, token
->location
,
32360 case PRAGMA_OMP_CLAUSE_LASTPRIVATE
:
32361 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
32363 c_name
= "lastprivate";
32365 case PRAGMA_OMP_CLAUSE_MERGEABLE
:
32366 clauses
= cp_parser_omp_clause_mergeable (parser
, clauses
,
32368 c_name
= "mergeable";
32370 case PRAGMA_OMP_CLAUSE_NOWAIT
:
32371 clauses
= cp_parser_omp_clause_nowait (parser
, clauses
, token
->location
);
32374 case PRAGMA_OMP_CLAUSE_NUM_TASKS
:
32375 clauses
= cp_parser_omp_clause_num_tasks (parser
, clauses
,
32377 c_name
= "num_tasks";
32379 case PRAGMA_OMP_CLAUSE_NUM_THREADS
:
32380 clauses
= cp_parser_omp_clause_num_threads (parser
, clauses
,
32382 c_name
= "num_threads";
32384 case PRAGMA_OMP_CLAUSE_ORDERED
:
32385 clauses
= cp_parser_omp_clause_ordered (parser
, clauses
,
32387 c_name
= "ordered";
32389 case PRAGMA_OMP_CLAUSE_PRIORITY
:
32390 clauses
= cp_parser_omp_clause_priority (parser
, clauses
,
32392 c_name
= "priority";
32394 case PRAGMA_OMP_CLAUSE_PRIVATE
:
32395 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
32397 c_name
= "private";
32399 case PRAGMA_OMP_CLAUSE_REDUCTION
:
32400 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
32401 c_name
= "reduction";
32403 case PRAGMA_OMP_CLAUSE_SCHEDULE
:
32404 clauses
= cp_parser_omp_clause_schedule (parser
, clauses
,
32406 c_name
= "schedule";
32408 case PRAGMA_OMP_CLAUSE_SHARED
:
32409 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_SHARED
,
32413 case PRAGMA_OMP_CLAUSE_UNTIED
:
32414 clauses
= cp_parser_omp_clause_untied (parser
, clauses
,
32418 case PRAGMA_OMP_CLAUSE_INBRANCH
:
32419 case PRAGMA_CILK_CLAUSE_MASK
:
32420 clauses
= cp_parser_omp_clause_branch (parser
, OMP_CLAUSE_INBRANCH
,
32421 clauses
, token
->location
);
32422 c_name
= "inbranch";
32424 case PRAGMA_OMP_CLAUSE_NOTINBRANCH
:
32425 case PRAGMA_CILK_CLAUSE_NOMASK
:
32426 clauses
= cp_parser_omp_clause_branch (parser
,
32427 OMP_CLAUSE_NOTINBRANCH
,
32428 clauses
, token
->location
);
32429 c_name
= "notinbranch";
32431 case PRAGMA_OMP_CLAUSE_PARALLEL
:
32432 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_PARALLEL
,
32433 clauses
, token
->location
);
32434 c_name
= "parallel";
32438 error_at (token
->location
, "%qs must be the first clause of %qs",
32443 case PRAGMA_OMP_CLAUSE_FOR
:
32444 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_FOR
,
32445 clauses
, token
->location
);
32448 goto clause_not_first
;
32450 case PRAGMA_OMP_CLAUSE_SECTIONS
:
32451 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_SECTIONS
,
32452 clauses
, token
->location
);
32453 c_name
= "sections";
32455 goto clause_not_first
;
32457 case PRAGMA_OMP_CLAUSE_TASKGROUP
:
32458 clauses
= cp_parser_omp_clause_cancelkind (parser
, OMP_CLAUSE_TASKGROUP
,
32459 clauses
, token
->location
);
32460 c_name
= "taskgroup";
32462 goto clause_not_first
;
32464 case PRAGMA_OMP_CLAUSE_LINK
:
32465 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LINK
, clauses
);
32468 case PRAGMA_OMP_CLAUSE_TO
:
32469 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_LINK
)) != 0)
32470 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_TO_DECLARE
,
32473 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_TO
, clauses
);
32476 case PRAGMA_OMP_CLAUSE_FROM
:
32477 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FROM
, clauses
);
32480 case PRAGMA_OMP_CLAUSE_UNIFORM
:
32481 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_UNIFORM
,
32483 c_name
= "uniform";
32485 case PRAGMA_OMP_CLAUSE_NUM_TEAMS
:
32486 clauses
= cp_parser_omp_clause_num_teams (parser
, clauses
,
32488 c_name
= "num_teams";
32490 case PRAGMA_OMP_CLAUSE_THREAD_LIMIT
:
32491 clauses
= cp_parser_omp_clause_thread_limit (parser
, clauses
,
32493 c_name
= "thread_limit";
32495 case PRAGMA_OMP_CLAUSE_ALIGNED
:
32496 clauses
= cp_parser_omp_clause_aligned (parser
, clauses
);
32497 c_name
= "aligned";
32499 case PRAGMA_OMP_CLAUSE_LINEAR
:
32501 bool cilk_simd_fn
= false, declare_simd
= false;
32502 if (((mask
>> PRAGMA_CILK_CLAUSE_VECTORLENGTH
) & 1) != 0)
32503 cilk_simd_fn
= true;
32504 else if (((mask
>> PRAGMA_OMP_CLAUSE_UNIFORM
) & 1) != 0)
32505 declare_simd
= true;
32506 clauses
= cp_parser_omp_clause_linear (parser
, clauses
,
32507 cilk_simd_fn
, declare_simd
);
32511 case PRAGMA_OMP_CLAUSE_DEPEND
:
32512 clauses
= cp_parser_omp_clause_depend (parser
, clauses
,
32516 case PRAGMA_OMP_CLAUSE_MAP
:
32517 clauses
= cp_parser_omp_clause_map (parser
, clauses
);
32520 case PRAGMA_OMP_CLAUSE_DEVICE
:
32521 clauses
= cp_parser_omp_clause_device (parser
, clauses
,
32525 case PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
:
32526 clauses
= cp_parser_omp_clause_dist_schedule (parser
, clauses
,
32528 c_name
= "dist_schedule";
32530 case PRAGMA_OMP_CLAUSE_PROC_BIND
:
32531 clauses
= cp_parser_omp_clause_proc_bind (parser
, clauses
,
32533 c_name
= "proc_bind";
32535 case PRAGMA_OMP_CLAUSE_SAFELEN
:
32536 clauses
= cp_parser_omp_clause_safelen (parser
, clauses
,
32538 c_name
= "safelen";
32540 case PRAGMA_OMP_CLAUSE_SIMDLEN
:
32541 clauses
= cp_parser_omp_clause_simdlen (parser
, clauses
,
32543 c_name
= "simdlen";
32545 case PRAGMA_OMP_CLAUSE_NOGROUP
:
32546 clauses
= cp_parser_omp_clause_nogroup (parser
, clauses
,
32548 c_name
= "nogroup";
32550 case PRAGMA_OMP_CLAUSE_THREADS
:
32552 = cp_parser_omp_clause_orderedkind (parser
, OMP_CLAUSE_THREADS
,
32553 clauses
, token
->location
);
32554 c_name
= "threads";
32556 case PRAGMA_OMP_CLAUSE_SIMD
:
32558 = cp_parser_omp_clause_orderedkind (parser
, OMP_CLAUSE_SIMD
,
32559 clauses
, token
->location
);
32562 case PRAGMA_CILK_CLAUSE_VECTORLENGTH
:
32563 clauses
= cp_parser_cilk_simd_vectorlength (parser
, clauses
, true);
32564 c_name
= "simdlen";
32567 cp_parser_error (parser
, "expected %<#pragma omp%> clause");
32573 if (((mask
>> c_kind
) & 1) == 0)
32575 /* Remove the invalid clause(s) from the list to avoid
32576 confusing the rest of the compiler. */
32578 error_at (token
->location
, "%qs is not valid for %qs", c_name
, where
);
32582 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32583 no reason to skip to the end. */
32584 if (!(flag_cilkplus
&& pragma_tok
== NULL
))
32585 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
32588 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_UNIFORM
)) != 0)
32589 return finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
32591 return finish_omp_clauses (clauses
, C_ORT_OMP
);
32600 In practice, we're also interested in adding the statement to an
32601 outer node. So it is convenient if we work around the fact that
32602 cp_parser_statement calls add_stmt. */
32605 cp_parser_begin_omp_structured_block (cp_parser
*parser
)
32607 unsigned save
= parser
->in_statement
;
32609 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32610 This preserves the "not within loop or switch" style error messages
32611 for nonsense cases like
32617 if (parser
->in_statement
)
32618 parser
->in_statement
= IN_OMP_BLOCK
;
32624 cp_parser_end_omp_structured_block (cp_parser
*parser
, unsigned save
)
32626 parser
->in_statement
= save
;
32630 cp_parser_omp_structured_block (cp_parser
*parser
, bool *if_p
)
32632 tree stmt
= begin_omp_structured_block ();
32633 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
32635 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
32637 cp_parser_end_omp_structured_block (parser
, save
);
32638 return finish_omp_structured_block (stmt
);
32642 # pragma omp atomic new-line
32646 x binop= expr | x++ | ++x | x-- | --x
32648 +, *, -, /, &, ^, |, <<, >>
32650 where x is an lvalue expression with scalar type.
32653 # pragma omp atomic new-line
32656 # pragma omp atomic read new-line
32659 # pragma omp atomic write new-line
32662 # pragma omp atomic update new-line
32665 # pragma omp atomic capture new-line
32668 # pragma omp atomic capture new-line
32676 expression-stmt | x = x binop expr
32678 v = expression-stmt
32680 { v = x; update-stmt; } | { update-stmt; v = x; }
32684 expression-stmt | x = x binop expr | x = expr binop x
32688 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32690 where x and v are lvalue expressions with scalar type. */
32693 cp_parser_omp_atomic (cp_parser
*parser
, cp_token
*pragma_tok
)
32695 tree lhs
= NULL_TREE
, rhs
= NULL_TREE
, v
= NULL_TREE
, lhs1
= NULL_TREE
;
32696 tree rhs1
= NULL_TREE
, orig_lhs
;
32697 enum tree_code code
= OMP_ATOMIC
, opcode
= NOP_EXPR
;
32698 bool structured_block
= false;
32699 bool seq_cst
= false;
32701 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32703 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32704 const char *p
= IDENTIFIER_POINTER (id
);
32706 if (!strcmp (p
, "seq_cst"))
32709 cp_lexer_consume_token (parser
->lexer
);
32710 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
)
32711 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_NAME
)
32712 cp_lexer_consume_token (parser
->lexer
);
32715 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32717 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32718 const char *p
= IDENTIFIER_POINTER (id
);
32720 if (!strcmp (p
, "read"))
32721 code
= OMP_ATOMIC_READ
;
32722 else if (!strcmp (p
, "write"))
32724 else if (!strcmp (p
, "update"))
32726 else if (!strcmp (p
, "capture"))
32727 code
= OMP_ATOMIC_CAPTURE_NEW
;
32731 cp_lexer_consume_token (parser
->lexer
);
32735 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
)
32736 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_NAME
)
32737 cp_lexer_consume_token (parser
->lexer
);
32739 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
32741 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
32742 const char *p
= IDENTIFIER_POINTER (id
);
32744 if (!strcmp (p
, "seq_cst"))
32747 cp_lexer_consume_token (parser
->lexer
);
32751 cp_parser_require_pragma_eol (parser
, pragma_tok
);
32755 case OMP_ATOMIC_READ
:
32756 case NOP_EXPR
: /* atomic write */
32757 v
= cp_parser_unary_expression (parser
);
32758 if (v
== error_mark_node
)
32760 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
32762 if (code
== NOP_EXPR
)
32763 lhs
= cp_parser_expression (parser
);
32765 lhs
= cp_parser_unary_expression (parser
);
32766 if (lhs
== error_mark_node
)
32768 if (code
== NOP_EXPR
)
32770 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32778 case OMP_ATOMIC_CAPTURE_NEW
:
32779 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
32781 cp_lexer_consume_token (parser
->lexer
);
32782 structured_block
= true;
32786 v
= cp_parser_unary_expression (parser
);
32787 if (v
== error_mark_node
)
32789 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
32797 lhs
= cp_parser_unary_expression (parser
);
32799 switch (TREE_CODE (lhs
))
32804 case POSTINCREMENT_EXPR
:
32805 if (code
== OMP_ATOMIC_CAPTURE_NEW
&& !structured_block
)
32806 code
= OMP_ATOMIC_CAPTURE_OLD
;
32808 case PREINCREMENT_EXPR
:
32809 lhs
= TREE_OPERAND (lhs
, 0);
32810 opcode
= PLUS_EXPR
;
32811 rhs
= integer_one_node
;
32814 case POSTDECREMENT_EXPR
:
32815 if (code
== OMP_ATOMIC_CAPTURE_NEW
&& !structured_block
)
32816 code
= OMP_ATOMIC_CAPTURE_OLD
;
32818 case PREDECREMENT_EXPR
:
32819 lhs
= TREE_OPERAND (lhs
, 0);
32820 opcode
= MINUS_EXPR
;
32821 rhs
= integer_one_node
;
32824 case COMPOUND_EXPR
:
32825 if (TREE_CODE (TREE_OPERAND (lhs
, 0)) == SAVE_EXPR
32826 && TREE_CODE (TREE_OPERAND (lhs
, 1)) == COMPOUND_EXPR
32827 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0)) == MODIFY_EXPR
32828 && TREE_OPERAND (TREE_OPERAND (lhs
, 1), 1) == TREE_OPERAND (lhs
, 0)
32829 && TREE_CODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND
32830 (TREE_OPERAND (lhs
, 1), 0), 0)))
32832 /* Undo effects of boolean_increment for post {in,de}crement. */
32833 lhs
= TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0);
32836 if (TREE_CODE (lhs
) == MODIFY_EXPR
32837 && TREE_CODE (TREE_TYPE (TREE_OPERAND (lhs
, 0))) == BOOLEAN_TYPE
)
32839 /* Undo effects of boolean_increment. */
32840 if (integer_onep (TREE_OPERAND (lhs
, 1)))
32842 /* This is pre or post increment. */
32843 rhs
= TREE_OPERAND (lhs
, 1);
32844 lhs
= TREE_OPERAND (lhs
, 0);
32846 if (code
== OMP_ATOMIC_CAPTURE_NEW
32847 && !structured_block
32848 && TREE_CODE (orig_lhs
) == COMPOUND_EXPR
)
32849 code
= OMP_ATOMIC_CAPTURE_OLD
;
32855 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
32858 opcode
= MULT_EXPR
;
32861 opcode
= TRUNC_DIV_EXPR
;
32864 opcode
= PLUS_EXPR
;
32867 opcode
= MINUS_EXPR
;
32869 case CPP_LSHIFT_EQ
:
32870 opcode
= LSHIFT_EXPR
;
32872 case CPP_RSHIFT_EQ
:
32873 opcode
= RSHIFT_EXPR
;
32876 opcode
= BIT_AND_EXPR
;
32879 opcode
= BIT_IOR_EXPR
;
32882 opcode
= BIT_XOR_EXPR
;
32885 enum cp_parser_prec oprec
;
32887 cp_lexer_consume_token (parser
->lexer
);
32888 cp_parser_parse_tentatively (parser
);
32889 rhs1
= cp_parser_simple_cast_expression (parser
);
32890 if (rhs1
== error_mark_node
)
32892 cp_parser_abort_tentative_parse (parser
);
32893 cp_parser_simple_cast_expression (parser
);
32896 token
= cp_lexer_peek_token (parser
->lexer
);
32897 if (token
->type
!= CPP_SEMICOLON
&& !cp_tree_equal (lhs
, rhs1
))
32899 cp_parser_abort_tentative_parse (parser
);
32900 cp_parser_parse_tentatively (parser
);
32901 rhs
= cp_parser_binary_expression (parser
, false, true,
32902 PREC_NOT_OPERATOR
, NULL
);
32903 if (rhs
== error_mark_node
)
32905 cp_parser_abort_tentative_parse (parser
);
32906 cp_parser_binary_expression (parser
, false, true,
32907 PREC_NOT_OPERATOR
, NULL
);
32910 switch (TREE_CODE (rhs
))
32913 case TRUNC_DIV_EXPR
:
32922 if (cp_tree_equal (lhs
, TREE_OPERAND (rhs
, 1)))
32924 if (cp_parser_parse_definitely (parser
))
32926 opcode
= TREE_CODE (rhs
);
32927 rhs1
= TREE_OPERAND (rhs
, 0);
32928 rhs
= TREE_OPERAND (rhs
, 1);
32938 cp_parser_abort_tentative_parse (parser
);
32939 if (structured_block
&& code
== OMP_ATOMIC_CAPTURE_OLD
)
32941 rhs
= cp_parser_expression (parser
);
32942 if (rhs
== error_mark_node
)
32948 cp_parser_error (parser
,
32949 "invalid form of %<#pragma omp atomic%>");
32952 if (!cp_parser_parse_definitely (parser
))
32954 switch (token
->type
)
32956 case CPP_SEMICOLON
:
32957 if (structured_block
&& code
== OMP_ATOMIC_CAPTURE_NEW
)
32959 code
= OMP_ATOMIC_CAPTURE_OLD
;
32964 cp_lexer_consume_token (parser
->lexer
);
32967 else if (structured_block
)
32974 cp_parser_error (parser
,
32975 "invalid form of %<#pragma omp atomic%>");
32978 opcode
= MULT_EXPR
;
32981 opcode
= TRUNC_DIV_EXPR
;
32984 opcode
= PLUS_EXPR
;
32987 opcode
= MINUS_EXPR
;
32990 opcode
= LSHIFT_EXPR
;
32993 opcode
= RSHIFT_EXPR
;
32996 opcode
= BIT_AND_EXPR
;
32999 opcode
= BIT_IOR_EXPR
;
33002 opcode
= BIT_XOR_EXPR
;
33005 cp_parser_error (parser
,
33006 "invalid operator for %<#pragma omp atomic%>");
33009 oprec
= TOKEN_PRECEDENCE (token
);
33010 gcc_assert (oprec
!= PREC_NOT_OPERATOR
);
33011 if (commutative_tree_code (opcode
))
33012 oprec
= (enum cp_parser_prec
) (oprec
- 1);
33013 cp_lexer_consume_token (parser
->lexer
);
33014 rhs
= cp_parser_binary_expression (parser
, false, false,
33016 if (rhs
== error_mark_node
)
33021 cp_parser_error (parser
,
33022 "invalid operator for %<#pragma omp atomic%>");
33025 cp_lexer_consume_token (parser
->lexer
);
33027 rhs
= cp_parser_expression (parser
);
33028 if (rhs
== error_mark_node
)
33033 if (structured_block
&& code
== OMP_ATOMIC_CAPTURE_NEW
)
33035 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
33037 v
= cp_parser_unary_expression (parser
);
33038 if (v
== error_mark_node
)
33040 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
33042 lhs1
= cp_parser_unary_expression (parser
);
33043 if (lhs1
== error_mark_node
)
33046 if (structured_block
)
33048 cp_parser_consume_semicolon_at_end_of_statement (parser
);
33049 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
33052 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
, seq_cst
);
33053 if (!structured_block
)
33054 cp_parser_consume_semicolon_at_end_of_statement (parser
);
33058 cp_parser_skip_to_end_of_block_or_statement (parser
);
33059 if (structured_block
)
33061 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
33062 cp_lexer_consume_token (parser
->lexer
);
33063 else if (code
== OMP_ATOMIC_CAPTURE_NEW
)
33065 cp_parser_skip_to_end_of_block_or_statement (parser
);
33066 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
33067 cp_lexer_consume_token (parser
->lexer
);
33074 # pragma omp barrier new-line */
33077 cp_parser_omp_barrier (cp_parser
*parser
, cp_token
*pragma_tok
)
33079 cp_parser_require_pragma_eol (parser
, pragma_tok
);
33080 finish_omp_barrier ();
33084 # pragma omp critical [(name)] new-line
33088 # pragma omp critical [(name) [hint(expression)]] new-line
33089 structured-block */
33091 #define OMP_CRITICAL_CLAUSE_MASK \
33092 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33095 cp_parser_omp_critical (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
33097 tree stmt
, name
= NULL_TREE
, clauses
= NULL_TREE
;
33099 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
33101 cp_lexer_consume_token (parser
->lexer
);
33103 name
= cp_parser_identifier (parser
);
33105 if (name
== error_mark_node
33106 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
33107 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
33108 /*or_comma=*/false,
33109 /*consume_paren=*/true);
33110 if (name
== error_mark_node
)
33113 clauses
= cp_parser_omp_all_clauses (parser
,
33114 OMP_CRITICAL_CLAUSE_MASK
,
33115 "#pragma omp critical", pragma_tok
);
33118 cp_parser_require_pragma_eol (parser
, pragma_tok
);
33120 stmt
= cp_parser_omp_structured_block (parser
, if_p
);
33121 return c_finish_omp_critical (input_location
, stmt
, name
, clauses
);
33125 # pragma omp flush flush-vars[opt] new-line
33128 ( variable-list ) */
33131 cp_parser_omp_flush (cp_parser
*parser
, cp_token
*pragma_tok
)
33133 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
33134 (void) cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
33135 cp_parser_require_pragma_eol (parser
, pragma_tok
);
33137 finish_omp_flush ();
33140 /* Helper function, to parse omp for increment expression. */
33143 cp_parser_omp_for_cond (cp_parser
*parser
, tree decl
, enum tree_code code
)
33145 tree cond
= cp_parser_binary_expression (parser
, false, true,
33146 PREC_NOT_OPERATOR
, NULL
);
33147 if (cond
== error_mark_node
33148 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
33150 cp_parser_skip_to_end_of_statement (parser
);
33151 return error_mark_node
;
33154 switch (TREE_CODE (cond
))
33162 if (code
== CILK_SIMD
|| code
== CILK_FOR
)
33164 /* Fall through: OpenMP disallows NE_EXPR. */
33166 return error_mark_node
;
33169 /* If decl is an iterator, preserve LHS and RHS of the relational
33170 expr until finish_omp_for. */
33172 && (type_dependent_expression_p (decl
)
33173 || CLASS_TYPE_P (TREE_TYPE (decl
))))
33176 return build_x_binary_op (EXPR_LOC_OR_LOC (cond
, input_location
),
33178 TREE_OPERAND (cond
, 0), ERROR_MARK
,
33179 TREE_OPERAND (cond
, 1), ERROR_MARK
,
33180 /*overload=*/NULL
, tf_warning_or_error
);
33183 /* Helper function, to parse omp for increment expression. */
33186 cp_parser_omp_for_incr (cp_parser
*parser
, tree decl
)
33188 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
33194 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
33196 op
= (token
->type
== CPP_PLUS_PLUS
33197 ? PREINCREMENT_EXPR
: PREDECREMENT_EXPR
);
33198 cp_lexer_consume_token (parser
->lexer
);
33199 lhs
= cp_parser_simple_cast_expression (parser
);
33201 && (!processing_template_decl
|| !cp_tree_equal (lhs
, decl
)))
33202 return error_mark_node
;
33203 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
33206 lhs
= cp_parser_primary_expression (parser
, false, false, false, &idk
);
33208 && (!processing_template_decl
|| !cp_tree_equal (lhs
, decl
)))
33209 return error_mark_node
;
33211 token
= cp_lexer_peek_token (parser
->lexer
);
33212 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
33214 op
= (token
->type
== CPP_PLUS_PLUS
33215 ? POSTINCREMENT_EXPR
: POSTDECREMENT_EXPR
);
33216 cp_lexer_consume_token (parser
->lexer
);
33217 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
33220 op
= cp_parser_assignment_operator_opt (parser
);
33221 if (op
== ERROR_MARK
)
33222 return error_mark_node
;
33224 if (op
!= NOP_EXPR
)
33226 rhs
= cp_parser_assignment_expression (parser
);
33227 rhs
= build2 (op
, TREE_TYPE (decl
), decl
, rhs
);
33228 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
33231 lhs
= cp_parser_binary_expression (parser
, false, false,
33232 PREC_ADDITIVE_EXPRESSION
, NULL
);
33233 token
= cp_lexer_peek_token (parser
->lexer
);
33234 decl_first
= (lhs
== decl
33235 || (processing_template_decl
&& cp_tree_equal (lhs
, decl
)));
33238 if (token
->type
!= CPP_PLUS
33239 && token
->type
!= CPP_MINUS
)
33240 return error_mark_node
;
33244 op
= token
->type
== CPP_PLUS
? PLUS_EXPR
: MINUS_EXPR
;
33245 cp_lexer_consume_token (parser
->lexer
);
33246 rhs
= cp_parser_binary_expression (parser
, false, false,
33247 PREC_ADDITIVE_EXPRESSION
, NULL
);
33248 token
= cp_lexer_peek_token (parser
->lexer
);
33249 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
|| decl_first
)
33251 if (lhs
== NULL_TREE
)
33253 if (op
== PLUS_EXPR
)
33256 lhs
= build_x_unary_op (input_location
, NEGATE_EXPR
, rhs
,
33257 tf_warning_or_error
);
33260 lhs
= build_x_binary_op (input_location
, op
, lhs
, ERROR_MARK
, rhs
,
33261 ERROR_MARK
, NULL
, tf_warning_or_error
);
33264 while (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
);
33269 && (!processing_template_decl
|| !cp_tree_equal (rhs
, decl
)))
33270 || op
== MINUS_EXPR
)
33271 return error_mark_node
;
33272 rhs
= build2 (op
, TREE_TYPE (decl
), lhs
, decl
);
33275 rhs
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, lhs
);
33277 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
33280 /* Parse the initialization statement of either an OpenMP for loop or
33281 a Cilk Plus for loop.
33283 Return true if the resulting construct should have an
33284 OMP_CLAUSE_PRIVATE added to it. */
33287 cp_parser_omp_for_loop_init (cp_parser
*parser
,
33288 enum tree_code code
,
33289 tree
&this_pre_body
,
33290 vec
<tree
, va_gc
> *for_block
,
33296 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
33299 tree add_private_clause
= NULL_TREE
;
33301 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33305 integer-type var = lb
33306 random-access-iterator-type var = lb
33307 pointer-type var = lb
33309 cp_decl_specifier_seq type_specifiers
;
33311 /* First, try to parse as an initialized declaration. See
33312 cp_parser_condition, from whence the bulk of this is copied. */
33314 cp_parser_parse_tentatively (parser
);
33315 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
33316 /*is_trailing_return=*/false,
33318 if (cp_parser_parse_definitely (parser
))
33320 /* If parsing a type specifier seq succeeded, then this
33321 MUST be a initialized declaration. */
33322 tree asm_specification
, attributes
;
33323 cp_declarator
*declarator
;
33325 declarator
= cp_parser_declarator (parser
,
33326 CP_PARSER_DECLARATOR_NAMED
,
33327 /*ctor_dtor_or_conv_p=*/NULL
,
33328 /*parenthesized_p=*/NULL
,
33329 /*member_p=*/false,
33330 /*friend_p=*/false);
33331 attributes
= cp_parser_attributes_opt (parser
);
33332 asm_specification
= cp_parser_asm_specification_opt (parser
);
33334 if (declarator
== cp_error_declarator
)
33335 cp_parser_skip_to_end_of_statement (parser
);
33339 tree pushed_scope
, auto_node
;
33341 decl
= start_decl (declarator
, &type_specifiers
,
33342 SD_INITIALIZED
, attributes
,
33343 /*prefix_attributes=*/NULL_TREE
,
33346 auto_node
= type_uses_auto (TREE_TYPE (decl
));
33347 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
33349 if (cp_lexer_next_token_is (parser
->lexer
,
33352 if (code
!= CILK_SIMD
&& code
!= CILK_FOR
)
33353 error ("parenthesized initialization is not allowed in "
33354 "OpenMP %<for%> loop");
33356 error ("parenthesized initialization is "
33357 "not allowed in for-loop");
33360 /* Trigger an error. */
33361 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
33363 init
= error_mark_node
;
33364 cp_parser_skip_to_end_of_statement (parser
);
33366 else if (CLASS_TYPE_P (TREE_TYPE (decl
))
33367 || type_dependent_expression_p (decl
)
33370 bool is_direct_init
, is_non_constant_init
;
33372 init
= cp_parser_initializer (parser
,
33374 &is_non_constant_init
);
33379 = do_auto_deduction (TREE_TYPE (decl
), init
,
33382 if (!CLASS_TYPE_P (TREE_TYPE (decl
))
33383 && !type_dependent_expression_p (decl
))
33387 cp_finish_decl (decl
, init
, !is_non_constant_init
,
33389 LOOKUP_ONLYCONVERTING
);
33391 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
33393 vec_safe_push (for_block
, this_pre_body
);
33397 init
= pop_stmt_list (this_pre_body
);
33398 this_pre_body
= NULL_TREE
;
33403 cp_lexer_consume_token (parser
->lexer
);
33404 init
= cp_parser_assignment_expression (parser
);
33407 if (TREE_CODE (TREE_TYPE (decl
)) == REFERENCE_TYPE
)
33408 init
= error_mark_node
;
33410 cp_finish_decl (decl
, NULL_TREE
,
33411 /*init_const_expr_p=*/false,
33413 LOOKUP_ONLYCONVERTING
);
33417 pop_scope (pushed_scope
);
33423 /* If parsing a type specifier sequence failed, then
33424 this MUST be a simple expression. */
33425 if (code
== CILK_FOR
)
33426 error ("%<_Cilk_for%> allows expression instead of declaration only "
33427 "in C, not in C++");
33428 cp_parser_parse_tentatively (parser
);
33429 decl
= cp_parser_primary_expression (parser
, false, false,
33431 cp_token
*last_tok
= cp_lexer_peek_token (parser
->lexer
);
33432 if (!cp_parser_error_occurred (parser
)
33434 && (TREE_CODE (decl
) == COMPONENT_REF
33435 || (TREE_CODE (decl
) == SCOPE_REF
&& TREE_TYPE (decl
))))
33437 cp_parser_abort_tentative_parse (parser
);
33438 cp_parser_parse_tentatively (parser
);
33439 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
33440 tree name
= cp_parser_id_expression (parser
, /*template_p=*/false,
33441 /*check_dependency_p=*/true,
33442 /*template_p=*/NULL
,
33443 /*declarator_p=*/false,
33444 /*optional_p=*/false);
33445 if (name
!= error_mark_node
33446 && last_tok
== cp_lexer_peek_token (parser
->lexer
))
33448 decl
= cp_parser_lookup_name_simple (parser
, name
,
33450 if (TREE_CODE (decl
) == FIELD_DECL
)
33451 add_private_clause
= omp_privatize_field (decl
, false);
33453 cp_parser_abort_tentative_parse (parser
);
33454 cp_parser_parse_tentatively (parser
);
33455 decl
= cp_parser_primary_expression (parser
, false, false,
33458 if (!cp_parser_error_occurred (parser
)
33461 && CLASS_TYPE_P (TREE_TYPE (decl
)))
33465 cp_parser_parse_definitely (parser
);
33466 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
33467 rhs
= cp_parser_assignment_expression (parser
);
33469 finish_expr_stmt (build_x_modify_expr (EXPR_LOCATION (rhs
),
33472 tf_warning_or_error
));
33473 if (!add_private_clause
)
33474 add_private_clause
= decl
;
33479 cp_parser_abort_tentative_parse (parser
);
33480 init
= cp_parser_expression (parser
);
33483 if (TREE_CODE (init
) == MODIFY_EXPR
33484 || TREE_CODE (init
) == MODOP_EXPR
)
33485 real_decl
= TREE_OPERAND (init
, 0);
33489 return add_private_clause
;
33492 /* Parse the restricted form of the for statement allowed by OpenMP. */
33495 cp_parser_omp_for_loop (cp_parser
*parser
, enum tree_code code
, tree clauses
,
33496 tree
*cclauses
, bool *if_p
)
33498 tree init
, orig_init
, cond
, incr
, body
, decl
, pre_body
= NULL_TREE
, ret
;
33499 tree real_decl
, initv
, condv
, incrv
, declv
;
33500 tree this_pre_body
, cl
, ordered_cl
= NULL_TREE
;
33501 location_t loc_first
;
33502 bool collapse_err
= false;
33503 int i
, collapse
= 1, ordered
= 0, count
, nbraces
= 0;
33504 vec
<tree
, va_gc
> *for_block
= make_tree_vector ();
33505 auto_vec
<tree
, 4> orig_inits
;
33507 for (cl
= clauses
; cl
; cl
= OMP_CLAUSE_CHAIN (cl
))
33508 if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_COLLAPSE
)
33509 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (cl
));
33510 else if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_ORDERED
33511 && OMP_CLAUSE_ORDERED_EXPR (cl
))
33514 ordered
= tree_to_shwi (OMP_CLAUSE_ORDERED_EXPR (cl
));
33517 if (ordered
&& ordered
< collapse
)
33519 error_at (OMP_CLAUSE_LOCATION (ordered_cl
),
33520 "%<ordered%> clause parameter is less than %<collapse%>");
33521 OMP_CLAUSE_ORDERED_EXPR (ordered_cl
)
33522 = build_int_cst (NULL_TREE
, collapse
);
33523 ordered
= collapse
;
33527 for (tree
*pc
= &clauses
; *pc
; )
33528 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LINEAR
)
33530 error_at (OMP_CLAUSE_LOCATION (*pc
),
33531 "%<linear%> clause may not be specified together "
33532 "with %<ordered%> clause with a parameter");
33533 *pc
= OMP_CLAUSE_CHAIN (*pc
);
33536 pc
= &OMP_CLAUSE_CHAIN (*pc
);
33539 gcc_assert (collapse
>= 1 && ordered
>= 0);
33540 count
= ordered
? ordered
: collapse
;
33542 declv
= make_tree_vec (count
);
33543 initv
= make_tree_vec (count
);
33544 condv
= make_tree_vec (count
);
33545 incrv
= make_tree_vec (count
);
33547 loc_first
= cp_lexer_peek_token (parser
->lexer
)->location
;
33549 for (i
= 0; i
< count
; i
++)
33551 int bracecount
= 0;
33552 tree add_private_clause
= NULL_TREE
;
33555 if (code
!= CILK_FOR
33556 && !cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
33558 cp_parser_error (parser
, "for statement expected");
33561 if (code
== CILK_FOR
33562 && !cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CILK_FOR
))
33564 cp_parser_error (parser
, "_Cilk_for statement expected");
33567 loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
33569 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
33572 init
= orig_init
= decl
= real_decl
= NULL
;
33573 this_pre_body
= push_stmt_list ();
33576 = cp_parser_omp_for_loop_init (parser
, code
,
33577 this_pre_body
, for_block
,
33578 init
, orig_init
, decl
, real_decl
);
33580 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
33583 this_pre_body
= pop_stmt_list (this_pre_body
);
33587 pre_body
= push_stmt_list ();
33589 add_stmt (this_pre_body
);
33590 pre_body
= pop_stmt_list (pre_body
);
33593 pre_body
= this_pre_body
;
33598 if (cclauses
!= NULL
33599 && cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
] != NULL
33600 && real_decl
!= NULL_TREE
)
33603 for (c
= &cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
]; *c
; )
33604 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_FIRSTPRIVATE
33605 && OMP_CLAUSE_DECL (*c
) == real_decl
)
33607 error_at (loc
, "iteration variable %qD"
33608 " should not be firstprivate", real_decl
);
33609 *c
= OMP_CLAUSE_CHAIN (*c
);
33611 else if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_LASTPRIVATE
33612 && OMP_CLAUSE_DECL (*c
) == real_decl
)
33614 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33616 *c
= OMP_CLAUSE_CHAIN (*c
);
33617 if (code
== OMP_SIMD
)
33619 OMP_CLAUSE_CHAIN (l
) = cclauses
[C_OMP_CLAUSE_SPLIT_FOR
];
33620 cclauses
[C_OMP_CLAUSE_SPLIT_FOR
] = l
;
33624 OMP_CLAUSE_CHAIN (l
) = clauses
;
33627 add_private_clause
= NULL_TREE
;
33631 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_PRIVATE
33632 && OMP_CLAUSE_DECL (*c
) == real_decl
)
33633 add_private_clause
= NULL_TREE
;
33634 c
= &OMP_CLAUSE_CHAIN (*c
);
33638 if (add_private_clause
)
33641 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
33643 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
33644 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
33645 && OMP_CLAUSE_DECL (c
) == decl
)
33647 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
33648 && OMP_CLAUSE_DECL (c
) == decl
)
33649 error_at (loc
, "iteration variable %qD "
33650 "should not be firstprivate",
33652 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
33653 && OMP_CLAUSE_DECL (c
) == decl
)
33654 error_at (loc
, "iteration variable %qD should not be reduction",
33659 if (code
!= OMP_SIMD
)
33660 c
= build_omp_clause (loc
, OMP_CLAUSE_PRIVATE
);
33661 else if (collapse
== 1)
33662 c
= build_omp_clause (loc
, OMP_CLAUSE_LINEAR
);
33664 c
= build_omp_clause (loc
, OMP_CLAUSE_LASTPRIVATE
);
33665 OMP_CLAUSE_DECL (c
) = add_private_clause
;
33666 c
= finish_omp_clauses (c
, C_ORT_OMP
);
33669 OMP_CLAUSE_CHAIN (c
) = clauses
;
33671 /* For linear, signal that we need to fill up
33672 the so far unknown linear step. */
33673 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
)
33674 OMP_CLAUSE_LINEAR_STEP (c
) = NULL_TREE
;
33680 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
33681 cond
= cp_parser_omp_for_cond (parser
, decl
, code
);
33682 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
33685 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
33687 /* If decl is an iterator, preserve the operator on decl
33688 until finish_omp_for. */
33690 && ((processing_template_decl
33691 && (TREE_TYPE (real_decl
) == NULL_TREE
33692 || !POINTER_TYPE_P (TREE_TYPE (real_decl
))))
33693 || CLASS_TYPE_P (TREE_TYPE (real_decl
))))
33694 incr
= cp_parser_omp_for_incr (parser
, real_decl
);
33696 incr
= cp_parser_expression (parser
);
33697 if (!EXPR_HAS_LOCATION (incr
))
33698 protected_set_expr_location (incr
, input_location
);
33701 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
33702 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
33703 /*or_comma=*/false,
33704 /*consume_paren=*/true);
33706 TREE_VEC_ELT (declv
, i
) = decl
;
33707 TREE_VEC_ELT (initv
, i
) = init
;
33708 TREE_VEC_ELT (condv
, i
) = cond
;
33709 TREE_VEC_ELT (incrv
, i
) = incr
;
33712 orig_inits
.safe_grow_cleared (i
+ 1);
33713 orig_inits
[i
] = orig_init
;
33716 if (i
== count
- 1)
33719 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33720 in between the collapsed for loops to be still considered perfectly
33721 nested. Hopefully the final version clarifies this.
33722 For now handle (multiple) {'s and empty statements. */
33723 cp_parser_parse_tentatively (parser
);
33726 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
33728 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
33730 cp_lexer_consume_token (parser
->lexer
);
33733 else if (bracecount
33734 && cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
33735 cp_lexer_consume_token (parser
->lexer
);
33738 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
33739 error_at (loc
, "not enough collapsed for loops");
33740 collapse_err
= true;
33741 cp_parser_abort_tentative_parse (parser
);
33750 cp_parser_parse_definitely (parser
);
33751 nbraces
+= bracecount
;
33758 /* Note that we saved the original contents of this flag when we entered
33759 the structured block, and so we don't need to re-save it here. */
33760 if (code
== CILK_SIMD
|| code
== CILK_FOR
)
33761 parser
->in_statement
= IN_CILK_SIMD_FOR
;
33763 parser
->in_statement
= IN_OMP_FOR
;
33765 /* Note that the grammar doesn't call for a structured block here,
33766 though the loop as a whole is a structured block. */
33767 body
= push_stmt_list ();
33768 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
33769 body
= pop_stmt_list (body
);
33771 if (declv
== NULL_TREE
)
33774 ret
= finish_omp_for (loc_first
, code
, declv
, NULL
, initv
, condv
, incrv
,
33775 body
, pre_body
, &orig_inits
, clauses
);
33779 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
33781 cp_lexer_consume_token (parser
->lexer
);
33784 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
33785 cp_lexer_consume_token (parser
->lexer
);
33790 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
33791 "collapsed loops not perfectly nested");
33793 collapse_err
= true;
33794 cp_parser_statement_seq_opt (parser
, NULL
);
33795 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
33800 while (!for_block
->is_empty ())
33801 add_stmt (pop_stmt_list (for_block
->pop ()));
33802 release_tree_vector (for_block
);
33807 /* Helper function for OpenMP parsing, split clauses and call
33808 finish_omp_clauses on each of the set of clauses afterwards. */
33811 cp_omp_split_clauses (location_t loc
, enum tree_code code
,
33812 omp_clause_mask mask
, tree clauses
, tree
*cclauses
)
33815 c_omp_split_clauses (loc
, code
, mask
, clauses
, cclauses
);
33816 for (i
= 0; i
< C_OMP_CLAUSE_SPLIT_COUNT
; i
++)
33818 cclauses
[i
] = finish_omp_clauses (cclauses
[i
], C_ORT_OMP
);
33822 #pragma omp simd simd-clause[optseq] new-line
33825 #define OMP_SIMD_CLAUSE_MASK \
33826 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33830 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33836 cp_parser_omp_simd (cp_parser
*parser
, cp_token
*pragma_tok
,
33837 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
33840 tree clauses
, sb
, ret
;
33842 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
33844 strcat (p_name
, " simd");
33845 mask
|= OMP_SIMD_CLAUSE_MASK
;
33847 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
33851 cp_omp_split_clauses (loc
, OMP_SIMD
, mask
, clauses
, cclauses
);
33852 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_SIMD
];
33853 tree c
= find_omp_clause (cclauses
[C_OMP_CLAUSE_SPLIT_FOR
],
33854 OMP_CLAUSE_ORDERED
);
33855 if (c
&& OMP_CLAUSE_ORDERED_EXPR (c
))
33857 error_at (OMP_CLAUSE_LOCATION (c
),
33858 "%<ordered%> clause with parameter may not be specified "
33859 "on %qs construct", p_name
);
33860 OMP_CLAUSE_ORDERED_EXPR (c
) = NULL_TREE
;
33864 sb
= begin_omp_structured_block ();
33865 save
= cp_parser_begin_omp_structured_block (parser
);
33867 ret
= cp_parser_omp_for_loop (parser
, OMP_SIMD
, clauses
, cclauses
, if_p
);
33869 cp_parser_end_omp_structured_block (parser
, save
);
33870 add_stmt (finish_omp_structured_block (sb
));
33876 #pragma omp for for-clause[optseq] new-line
33880 #pragma omp for simd for-simd-clause[optseq] new-line
33883 #define OMP_FOR_CLAUSE_MASK \
33884 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33895 cp_parser_omp_for (cp_parser
*parser
, cp_token
*pragma_tok
,
33896 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
33899 tree clauses
, sb
, ret
;
33901 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
33903 strcat (p_name
, " for");
33904 mask
|= OMP_FOR_CLAUSE_MASK
;
33905 /* parallel for{, simd} disallows nowait clause, but for
33906 target {teams distribute ,}parallel for{, simd} it should be accepted. */
33907 if (cclauses
&& (mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_MAP
)) == 0)
33908 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_NOWAIT
);
33909 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33910 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) != 0)
33911 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_ORDERED
);
33913 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
33915 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
33916 const char *p
= IDENTIFIER_POINTER (id
);
33918 if (strcmp (p
, "simd") == 0)
33920 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
33921 if (cclauses
== NULL
)
33922 cclauses
= cclauses_buf
;
33924 cp_lexer_consume_token (parser
->lexer
);
33925 if (!flag_openmp
) /* flag_openmp_simd */
33926 return cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
33928 sb
= begin_omp_structured_block ();
33929 save
= cp_parser_begin_omp_structured_block (parser
);
33930 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
33932 cp_parser_end_omp_structured_block (parser
, save
);
33933 tree body
= finish_omp_structured_block (sb
);
33936 ret
= make_node (OMP_FOR
);
33937 TREE_TYPE (ret
) = void_type_node
;
33938 OMP_FOR_BODY (ret
) = body
;
33939 OMP_FOR_CLAUSES (ret
) = cclauses
[C_OMP_CLAUSE_SPLIT_FOR
];
33940 SET_EXPR_LOCATION (ret
, loc
);
33945 if (!flag_openmp
) /* flag_openmp_simd */
33947 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
33951 /* Composite distribute parallel for disallows linear clause. */
33952 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) != 0)
33953 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_LINEAR
);
33955 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
33959 cp_omp_split_clauses (loc
, OMP_FOR
, mask
, clauses
, cclauses
);
33960 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_FOR
];
33963 sb
= begin_omp_structured_block ();
33964 save
= cp_parser_begin_omp_structured_block (parser
);
33966 ret
= cp_parser_omp_for_loop (parser
, OMP_FOR
, clauses
, cclauses
, if_p
);
33968 cp_parser_end_omp_structured_block (parser
, save
);
33969 add_stmt (finish_omp_structured_block (sb
));
33975 # pragma omp master new-line
33976 structured-block */
33979 cp_parser_omp_master (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
33981 cp_parser_require_pragma_eol (parser
, pragma_tok
);
33982 return c_finish_omp_master (input_location
,
33983 cp_parser_omp_structured_block (parser
, if_p
));
33987 # pragma omp ordered new-line
33991 # pragma omp ordered ordered-clauses new-line
33992 structured-block */
33994 #define OMP_ORDERED_CLAUSE_MASK \
33995 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
33996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
33998 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
33999 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
34002 cp_parser_omp_ordered (cp_parser
*parser
, cp_token
*pragma_tok
,
34003 enum pragma_context context
, bool *if_p
)
34005 location_t loc
= pragma_tok
->location
;
34007 if (context
!= pragma_stmt
&& context
!= pragma_compound
)
34009 cp_parser_error (parser
, "expected declaration specifiers");
34010 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34014 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34016 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34017 const char *p
= IDENTIFIER_POINTER (id
);
34019 if (strcmp (p
, "depend") == 0)
34021 if (context
== pragma_stmt
)
34023 error_at (pragma_tok
->location
, "%<#pragma omp ordered%> with "
34024 "%<depend%> clause may only be used in compound "
34026 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34030 = cp_parser_omp_all_clauses (parser
,
34031 OMP_ORDERED_DEPEND_CLAUSE_MASK
,
34032 "#pragma omp ordered", pragma_tok
);
34033 c_finish_omp_ordered (loc
, clauses
, NULL_TREE
);
34039 = cp_parser_omp_all_clauses (parser
, OMP_ORDERED_CLAUSE_MASK
,
34040 "#pragma omp ordered", pragma_tok
);
34041 c_finish_omp_ordered (loc
, clauses
,
34042 cp_parser_omp_structured_block (parser
, if_p
));
34049 { section-sequence }
34052 section-directive[opt] structured-block
34053 section-sequence section-directive structured-block */
34056 cp_parser_omp_sections_scope (cp_parser
*parser
)
34058 tree stmt
, substmt
;
34059 bool error_suppress
= false;
34062 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
34065 stmt
= push_stmt_list ();
34067 if (cp_parser_pragma_kind (cp_lexer_peek_token (parser
->lexer
))
34068 != PRAGMA_OMP_SECTION
)
34070 substmt
= cp_parser_omp_structured_block (parser
, NULL
);
34071 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
34072 add_stmt (substmt
);
34077 tok
= cp_lexer_peek_token (parser
->lexer
);
34078 if (tok
->type
== CPP_CLOSE_BRACE
)
34080 if (tok
->type
== CPP_EOF
)
34083 if (cp_parser_pragma_kind (tok
) == PRAGMA_OMP_SECTION
)
34085 cp_lexer_consume_token (parser
->lexer
);
34086 cp_parser_require_pragma_eol (parser
, tok
);
34087 error_suppress
= false;
34089 else if (!error_suppress
)
34091 cp_parser_error (parser
, "expected %<#pragma omp section%> or %<}%>");
34092 error_suppress
= true;
34095 substmt
= cp_parser_omp_structured_block (parser
, NULL
);
34096 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
34097 add_stmt (substmt
);
34099 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
34101 substmt
= pop_stmt_list (stmt
);
34103 stmt
= make_node (OMP_SECTIONS
);
34104 TREE_TYPE (stmt
) = void_type_node
;
34105 OMP_SECTIONS_BODY (stmt
) = substmt
;
34112 # pragma omp sections sections-clause[optseq] newline
34115 #define OMP_SECTIONS_CLAUSE_MASK \
34116 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34117 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34118 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34123 cp_parser_omp_sections (cp_parser
*parser
, cp_token
*pragma_tok
,
34124 char *p_name
, omp_clause_mask mask
, tree
*cclauses
)
34127 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
34129 strcat (p_name
, " sections");
34130 mask
|= OMP_SECTIONS_CLAUSE_MASK
;
34132 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_NOWAIT
);
34134 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
34138 cp_omp_split_clauses (loc
, OMP_SECTIONS
, mask
, clauses
, cclauses
);
34139 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_SECTIONS
];
34142 ret
= cp_parser_omp_sections_scope (parser
);
34144 OMP_SECTIONS_CLAUSES (ret
) = clauses
;
34150 # pragma omp parallel parallel-clause[optseq] new-line
34152 # pragma omp parallel for parallel-for-clause[optseq] new-line
34154 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34158 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34159 structured-block */
34161 #define OMP_PARALLEL_CLAUSE_MASK \
34162 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34169 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34170 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34173 cp_parser_omp_parallel (cp_parser
*parser
, cp_token
*pragma_tok
,
34174 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
34177 tree stmt
, clauses
, block
;
34179 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
34181 strcat (p_name
, " parallel");
34182 mask
|= OMP_PARALLEL_CLAUSE_MASK
;
34183 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34184 if ((mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_MAP
)) != 0
34185 && (mask
& (OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) == 0)
34186 mask
&= ~(OMP_CLAUSE_MASK_1
<< PRAGMA_OMP_CLAUSE_COPYIN
);
34188 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
34190 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
34191 if (cclauses
== NULL
)
34192 cclauses
= cclauses_buf
;
34194 cp_lexer_consume_token (parser
->lexer
);
34195 if (!flag_openmp
) /* flag_openmp_simd */
34196 return cp_parser_omp_for (parser
, pragma_tok
, p_name
, mask
, cclauses
,
34198 block
= begin_omp_parallel ();
34199 save
= cp_parser_begin_omp_structured_block (parser
);
34200 tree ret
= cp_parser_omp_for (parser
, pragma_tok
, p_name
, mask
, cclauses
,
34202 cp_parser_end_omp_structured_block (parser
, save
);
34203 stmt
= finish_omp_parallel (cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
],
34205 if (ret
== NULL_TREE
)
34207 OMP_PARALLEL_COMBINED (stmt
) = 1;
34210 /* When combined with distribute, parallel has to be followed by for.
34211 #pragma omp target parallel is allowed though. */
34213 && (mask
& (OMP_CLAUSE_MASK_1
34214 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE
)) != 0)
34216 error_at (loc
, "expected %<for%> after %qs", p_name
);
34217 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34220 else if (!flag_openmp
) /* flag_openmp_simd */
34222 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34225 else if (cclauses
== NULL
&& cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34227 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34228 const char *p
= IDENTIFIER_POINTER (id
);
34229 if (strcmp (p
, "sections") == 0)
34231 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
34232 cclauses
= cclauses_buf
;
34234 cp_lexer_consume_token (parser
->lexer
);
34235 block
= begin_omp_parallel ();
34236 save
= cp_parser_begin_omp_structured_block (parser
);
34237 cp_parser_omp_sections (parser
, pragma_tok
, p_name
, mask
, cclauses
);
34238 cp_parser_end_omp_structured_block (parser
, save
);
34239 stmt
= finish_omp_parallel (cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
],
34241 OMP_PARALLEL_COMBINED (stmt
) = 1;
34246 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
34250 cp_omp_split_clauses (loc
, OMP_PARALLEL
, mask
, clauses
, cclauses
);
34251 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_PARALLEL
];
34254 block
= begin_omp_parallel ();
34255 save
= cp_parser_begin_omp_structured_block (parser
);
34256 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
34257 cp_parser_end_omp_structured_block (parser
, save
);
34258 stmt
= finish_omp_parallel (clauses
, block
);
34263 # pragma omp single single-clause[optseq] new-line
34264 structured-block */
34266 #define OMP_SINGLE_CLAUSE_MASK \
34267 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34273 cp_parser_omp_single (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
34275 tree stmt
= make_node (OMP_SINGLE
);
34276 TREE_TYPE (stmt
) = void_type_node
;
34278 OMP_SINGLE_CLAUSES (stmt
)
34279 = cp_parser_omp_all_clauses (parser
, OMP_SINGLE_CLAUSE_MASK
,
34280 "#pragma omp single", pragma_tok
);
34281 OMP_SINGLE_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
34283 return add_stmt (stmt
);
34287 # pragma omp task task-clause[optseq] new-line
34288 structured-block */
34290 #define OMP_TASK_CLAUSE_MASK \
34291 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34303 cp_parser_omp_task (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
34305 tree clauses
, block
;
34308 clauses
= cp_parser_omp_all_clauses (parser
, OMP_TASK_CLAUSE_MASK
,
34309 "#pragma omp task", pragma_tok
);
34310 block
= begin_omp_task ();
34311 save
= cp_parser_begin_omp_structured_block (parser
);
34312 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
34313 cp_parser_end_omp_structured_block (parser
, save
);
34314 return finish_omp_task (clauses
, block
);
34318 # pragma omp taskwait new-line */
34321 cp_parser_omp_taskwait (cp_parser
*parser
, cp_token
*pragma_tok
)
34323 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34324 finish_omp_taskwait ();
34328 # pragma omp taskyield new-line */
34331 cp_parser_omp_taskyield (cp_parser
*parser
, cp_token
*pragma_tok
)
34333 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34334 finish_omp_taskyield ();
34338 # pragma omp taskgroup new-line
34339 structured-block */
34342 cp_parser_omp_taskgroup (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
34344 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34345 return c_finish_omp_taskgroup (input_location
,
34346 cp_parser_omp_structured_block (parser
,
34352 # pragma omp threadprivate (variable-list) */
34355 cp_parser_omp_threadprivate (cp_parser
*parser
, cp_token
*pragma_tok
)
34359 vars
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
34360 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34362 finish_omp_threadprivate (vars
);
34366 # pragma omp cancel cancel-clause[optseq] new-line */
34368 #define OMP_CANCEL_CLAUSE_MASK \
34369 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34376 cp_parser_omp_cancel (cp_parser
*parser
, cp_token
*pragma_tok
)
34378 tree clauses
= cp_parser_omp_all_clauses (parser
, OMP_CANCEL_CLAUSE_MASK
,
34379 "#pragma omp cancel", pragma_tok
);
34380 finish_omp_cancel (clauses
);
34384 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34386 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34387 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34393 cp_parser_omp_cancellation_point (cp_parser
*parser
, cp_token
*pragma_tok
)
34396 bool point_seen
= false;
34398 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34400 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34401 const char *p
= IDENTIFIER_POINTER (id
);
34403 if (strcmp (p
, "point") == 0)
34405 cp_lexer_consume_token (parser
->lexer
);
34411 cp_parser_error (parser
, "expected %<point%>");
34412 cp_parser_require_pragma_eol (parser
, pragma_tok
);
34416 clauses
= cp_parser_omp_all_clauses (parser
,
34417 OMP_CANCELLATION_POINT_CLAUSE_MASK
,
34418 "#pragma omp cancellation point",
34420 finish_omp_cancellation_point (clauses
);
34424 #pragma omp distribute distribute-clause[optseq] new-line
34427 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34428 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34435 cp_parser_omp_distribute (cp_parser
*parser
, cp_token
*pragma_tok
,
34436 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
34439 tree clauses
, sb
, ret
;
34441 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
34443 strcat (p_name
, " distribute");
34444 mask
|= OMP_DISTRIBUTE_CLAUSE_MASK
;
34446 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34448 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34449 const char *p
= IDENTIFIER_POINTER (id
);
34451 bool parallel
= false;
34453 if (strcmp (p
, "simd") == 0)
34456 parallel
= strcmp (p
, "parallel") == 0;
34457 if (parallel
|| simd
)
34459 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
34460 if (cclauses
== NULL
)
34461 cclauses
= cclauses_buf
;
34462 cp_lexer_consume_token (parser
->lexer
);
34463 if (!flag_openmp
) /* flag_openmp_simd */
34466 return cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
34469 return cp_parser_omp_parallel (parser
, pragma_tok
, p_name
, mask
,
34472 sb
= begin_omp_structured_block ();
34473 save
= cp_parser_begin_omp_structured_block (parser
);
34475 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
34478 ret
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
, mask
,
34480 cp_parser_end_omp_structured_block (parser
, save
);
34481 tree body
= finish_omp_structured_block (sb
);
34484 ret
= make_node (OMP_DISTRIBUTE
);
34485 TREE_TYPE (ret
) = void_type_node
;
34486 OMP_FOR_BODY (ret
) = body
;
34487 OMP_FOR_CLAUSES (ret
) = cclauses
[C_OMP_CLAUSE_SPLIT_DISTRIBUTE
];
34488 SET_EXPR_LOCATION (ret
, loc
);
34493 if (!flag_openmp
) /* flag_openmp_simd */
34495 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34499 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
34503 cp_omp_split_clauses (loc
, OMP_DISTRIBUTE
, mask
, clauses
, cclauses
);
34504 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_DISTRIBUTE
];
34507 sb
= begin_omp_structured_block ();
34508 save
= cp_parser_begin_omp_structured_block (parser
);
34510 ret
= cp_parser_omp_for_loop (parser
, OMP_DISTRIBUTE
, clauses
, NULL
, if_p
);
34512 cp_parser_end_omp_structured_block (parser
, save
);
34513 add_stmt (finish_omp_structured_block (sb
));
34519 # pragma omp teams teams-clause[optseq] new-line
34520 structured-block */
34522 #define OMP_TEAMS_CLAUSE_MASK \
34523 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34532 cp_parser_omp_teams (cp_parser
*parser
, cp_token
*pragma_tok
,
34533 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
34536 tree clauses
, sb
, ret
;
34538 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
34540 strcat (p_name
, " teams");
34541 mask
|= OMP_TEAMS_CLAUSE_MASK
;
34543 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34545 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34546 const char *p
= IDENTIFIER_POINTER (id
);
34547 if (strcmp (p
, "distribute") == 0)
34549 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
34550 if (cclauses
== NULL
)
34551 cclauses
= cclauses_buf
;
34553 cp_lexer_consume_token (parser
->lexer
);
34554 if (!flag_openmp
) /* flag_openmp_simd */
34555 return cp_parser_omp_distribute (parser
, pragma_tok
, p_name
, mask
,
34557 sb
= begin_omp_structured_block ();
34558 save
= cp_parser_begin_omp_structured_block (parser
);
34559 ret
= cp_parser_omp_distribute (parser
, pragma_tok
, p_name
, mask
,
34561 cp_parser_end_omp_structured_block (parser
, save
);
34562 tree body
= finish_omp_structured_block (sb
);
34565 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_TEAMS
];
34566 ret
= make_node (OMP_TEAMS
);
34567 TREE_TYPE (ret
) = void_type_node
;
34568 OMP_TEAMS_CLAUSES (ret
) = clauses
;
34569 OMP_TEAMS_BODY (ret
) = body
;
34570 OMP_TEAMS_COMBINED (ret
) = 1;
34571 return add_stmt (ret
);
34574 if (!flag_openmp
) /* flag_openmp_simd */
34576 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34580 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
34584 cp_omp_split_clauses (loc
, OMP_TEAMS
, mask
, clauses
, cclauses
);
34585 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_TEAMS
];
34588 tree stmt
= make_node (OMP_TEAMS
);
34589 TREE_TYPE (stmt
) = void_type_node
;
34590 OMP_TEAMS_CLAUSES (stmt
) = clauses
;
34591 OMP_TEAMS_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
34593 return add_stmt (stmt
);
34597 # pragma omp target data target-data-clause[optseq] new-line
34598 structured-block */
34600 #define OMP_TARGET_DATA_CLAUSE_MASK \
34601 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34602 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34603 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34604 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34607 cp_parser_omp_target_data (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
34610 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_DATA_CLAUSE_MASK
,
34611 "#pragma omp target data", pragma_tok
);
34613 for (tree
*pc
= &clauses
; *pc
;)
34615 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
34616 switch (OMP_CLAUSE_MAP_KIND (*pc
))
34619 case GOMP_MAP_ALWAYS_TO
:
34620 case GOMP_MAP_FROM
:
34621 case GOMP_MAP_ALWAYS_FROM
:
34622 case GOMP_MAP_TOFROM
:
34623 case GOMP_MAP_ALWAYS_TOFROM
:
34624 case GOMP_MAP_ALLOC
:
34627 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
34628 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
34629 case GOMP_MAP_ALWAYS_POINTER
:
34633 error_at (OMP_CLAUSE_LOCATION (*pc
),
34634 "%<#pragma omp target data%> with map-type other "
34635 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34636 "on %<map%> clause");
34637 *pc
= OMP_CLAUSE_CHAIN (*pc
);
34640 pc
= &OMP_CLAUSE_CHAIN (*pc
);
34646 error_at (pragma_tok
->location
,
34647 "%<#pragma omp target data%> must contain at least "
34648 "one %<map%> clause");
34652 tree stmt
= make_node (OMP_TARGET_DATA
);
34653 TREE_TYPE (stmt
) = void_type_node
;
34654 OMP_TARGET_DATA_CLAUSES (stmt
) = clauses
;
34656 keep_next_level (true);
34657 OMP_TARGET_DATA_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
34659 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
34660 return add_stmt (stmt
);
34664 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34665 structured-block */
34667 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34668 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34675 cp_parser_omp_target_enter_data (cp_parser
*parser
, cp_token
*pragma_tok
,
34676 enum pragma_context context
)
34678 bool data_seen
= false;
34679 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34681 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34682 const char *p
= IDENTIFIER_POINTER (id
);
34684 if (strcmp (p
, "data") == 0)
34686 cp_lexer_consume_token (parser
->lexer
);
34692 cp_parser_error (parser
, "expected %<data%>");
34693 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34697 if (context
== pragma_stmt
)
34699 error_at (pragma_tok
->location
,
34700 "%<#pragma omp target enter data%> may only be "
34701 "used in compound statements");
34702 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34707 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_ENTER_DATA_CLAUSE_MASK
,
34708 "#pragma omp target enter data", pragma_tok
);
34710 for (tree
*pc
= &clauses
; *pc
;)
34712 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
34713 switch (OMP_CLAUSE_MAP_KIND (*pc
))
34716 case GOMP_MAP_ALWAYS_TO
:
34717 case GOMP_MAP_ALLOC
:
34720 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
34721 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
34722 case GOMP_MAP_ALWAYS_POINTER
:
34726 error_at (OMP_CLAUSE_LOCATION (*pc
),
34727 "%<#pragma omp target enter data%> with map-type other "
34728 "than %<to%> or %<alloc%> on %<map%> clause");
34729 *pc
= OMP_CLAUSE_CHAIN (*pc
);
34732 pc
= &OMP_CLAUSE_CHAIN (*pc
);
34738 error_at (pragma_tok
->location
,
34739 "%<#pragma omp target enter data%> must contain at least "
34740 "one %<map%> clause");
34744 tree stmt
= make_node (OMP_TARGET_ENTER_DATA
);
34745 TREE_TYPE (stmt
) = void_type_node
;
34746 OMP_TARGET_ENTER_DATA_CLAUSES (stmt
) = clauses
;
34747 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
34748 return add_stmt (stmt
);
34752 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34753 structured-block */
34755 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34756 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34763 cp_parser_omp_target_exit_data (cp_parser
*parser
, cp_token
*pragma_tok
,
34764 enum pragma_context context
)
34766 bool data_seen
= false;
34767 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34769 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34770 const char *p
= IDENTIFIER_POINTER (id
);
34772 if (strcmp (p
, "data") == 0)
34774 cp_lexer_consume_token (parser
->lexer
);
34780 cp_parser_error (parser
, "expected %<data%>");
34781 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34785 if (context
== pragma_stmt
)
34787 error_at (pragma_tok
->location
,
34788 "%<#pragma omp target exit data%> may only be "
34789 "used in compound statements");
34790 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34795 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_EXIT_DATA_CLAUSE_MASK
,
34796 "#pragma omp target exit data", pragma_tok
);
34798 for (tree
*pc
= &clauses
; *pc
;)
34800 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
34801 switch (OMP_CLAUSE_MAP_KIND (*pc
))
34803 case GOMP_MAP_FROM
:
34804 case GOMP_MAP_ALWAYS_FROM
:
34805 case GOMP_MAP_RELEASE
:
34806 case GOMP_MAP_DELETE
:
34809 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
34810 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
34811 case GOMP_MAP_ALWAYS_POINTER
:
34815 error_at (OMP_CLAUSE_LOCATION (*pc
),
34816 "%<#pragma omp target exit data%> with map-type other "
34817 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34819 *pc
= OMP_CLAUSE_CHAIN (*pc
);
34822 pc
= &OMP_CLAUSE_CHAIN (*pc
);
34828 error_at (pragma_tok
->location
,
34829 "%<#pragma omp target exit data%> must contain at least "
34830 "one %<map%> clause");
34834 tree stmt
= make_node (OMP_TARGET_EXIT_DATA
);
34835 TREE_TYPE (stmt
) = void_type_node
;
34836 OMP_TARGET_EXIT_DATA_CLAUSES (stmt
) = clauses
;
34837 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
34838 return add_stmt (stmt
);
34842 # pragma omp target update target-update-clause[optseq] new-line */
34844 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34845 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34853 cp_parser_omp_target_update (cp_parser
*parser
, cp_token
*pragma_tok
,
34854 enum pragma_context context
)
34856 if (context
== pragma_stmt
)
34858 error_at (pragma_tok
->location
,
34859 "%<#pragma omp target update%> may only be "
34860 "used in compound statements");
34861 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34866 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_UPDATE_CLAUSE_MASK
,
34867 "#pragma omp target update", pragma_tok
);
34868 if (find_omp_clause (clauses
, OMP_CLAUSE_TO
) == NULL_TREE
34869 && find_omp_clause (clauses
, OMP_CLAUSE_FROM
) == NULL_TREE
)
34871 error_at (pragma_tok
->location
,
34872 "%<#pragma omp target update%> must contain at least one "
34873 "%<from%> or %<to%> clauses");
34877 tree stmt
= make_node (OMP_TARGET_UPDATE
);
34878 TREE_TYPE (stmt
) = void_type_node
;
34879 OMP_TARGET_UPDATE_CLAUSES (stmt
) = clauses
;
34880 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
34886 # pragma omp target target-clause[optseq] new-line
34887 structured-block */
34889 #define OMP_TARGET_CLAUSE_MASK \
34890 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34896 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34897 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34898 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34901 cp_parser_omp_target (cp_parser
*parser
, cp_token
*pragma_tok
,
34902 enum pragma_context context
, bool *if_p
)
34904 tree
*pc
= NULL
, stmt
;
34906 if (context
!= pragma_stmt
&& context
!= pragma_compound
)
34908 cp_parser_error (parser
, "expected declaration specifiers");
34909 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
34913 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
34915 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
34916 const char *p
= IDENTIFIER_POINTER (id
);
34917 enum tree_code ccode
= ERROR_MARK
;
34919 if (strcmp (p
, "teams") == 0)
34921 else if (strcmp (p
, "parallel") == 0)
34922 ccode
= OMP_PARALLEL
;
34923 else if (strcmp (p
, "simd") == 0)
34925 if (ccode
!= ERROR_MARK
)
34927 tree cclauses
[C_OMP_CLAUSE_SPLIT_COUNT
];
34928 char p_name
[sizeof ("#pragma omp target teams distribute "
34929 "parallel for simd")];
34931 cp_lexer_consume_token (parser
->lexer
);
34932 strcpy (p_name
, "#pragma omp target");
34933 if (!flag_openmp
) /* flag_openmp_simd */
34939 stmt
= cp_parser_omp_teams (parser
, pragma_tok
, p_name
,
34940 OMP_TARGET_CLAUSE_MASK
,
34944 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
,
34945 OMP_TARGET_CLAUSE_MASK
,
34949 stmt
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
,
34950 OMP_TARGET_CLAUSE_MASK
,
34954 gcc_unreachable ();
34956 return stmt
!= NULL_TREE
;
34958 keep_next_level (true);
34959 tree sb
= begin_omp_structured_block (), ret
;
34960 unsigned save
= cp_parser_begin_omp_structured_block (parser
);
34964 ret
= cp_parser_omp_teams (parser
, pragma_tok
, p_name
,
34965 OMP_TARGET_CLAUSE_MASK
, cclauses
,
34969 ret
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
,
34970 OMP_TARGET_CLAUSE_MASK
, cclauses
,
34974 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
,
34975 OMP_TARGET_CLAUSE_MASK
, cclauses
,
34979 gcc_unreachable ();
34981 cp_parser_end_omp_structured_block (parser
, save
);
34982 tree body
= finish_omp_structured_block (sb
);
34983 if (ret
== NULL_TREE
)
34985 if (ccode
== OMP_TEAMS
&& !processing_template_decl
)
34987 /* For combined target teams, ensure the num_teams and
34988 thread_limit clause expressions are evaluated on the host,
34989 before entering the target construct. */
34991 for (c
= cclauses
[C_OMP_CLAUSE_SPLIT_TEAMS
];
34992 c
; c
= OMP_CLAUSE_CHAIN (c
))
34993 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
34994 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
34995 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
34997 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
34998 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
34999 if (expr
== error_mark_node
)
35001 tree tmp
= TARGET_EXPR_SLOT (expr
);
35003 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
35004 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
35005 OMP_CLAUSE_FIRSTPRIVATE
);
35006 OMP_CLAUSE_DECL (tc
) = tmp
;
35007 OMP_CLAUSE_CHAIN (tc
)
35008 = cclauses
[C_OMP_CLAUSE_SPLIT_TARGET
];
35009 cclauses
[C_OMP_CLAUSE_SPLIT_TARGET
] = tc
;
35012 tree stmt
= make_node (OMP_TARGET
);
35013 TREE_TYPE (stmt
) = void_type_node
;
35014 OMP_TARGET_CLAUSES (stmt
) = cclauses
[C_OMP_CLAUSE_SPLIT_TARGET
];
35015 OMP_TARGET_BODY (stmt
) = body
;
35016 OMP_TARGET_COMBINED (stmt
) = 1;
35018 pc
= &OMP_TARGET_CLAUSES (stmt
);
35019 goto check_clauses
;
35021 else if (!flag_openmp
) /* flag_openmp_simd */
35023 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35026 else if (strcmp (p
, "data") == 0)
35028 cp_lexer_consume_token (parser
->lexer
);
35029 cp_parser_omp_target_data (parser
, pragma_tok
, if_p
);
35032 else if (strcmp (p
, "enter") == 0)
35034 cp_lexer_consume_token (parser
->lexer
);
35035 cp_parser_omp_target_enter_data (parser
, pragma_tok
, context
);
35038 else if (strcmp (p
, "exit") == 0)
35040 cp_lexer_consume_token (parser
->lexer
);
35041 cp_parser_omp_target_exit_data (parser
, pragma_tok
, context
);
35044 else if (strcmp (p
, "update") == 0)
35046 cp_lexer_consume_token (parser
->lexer
);
35047 return cp_parser_omp_target_update (parser
, pragma_tok
, context
);
35051 stmt
= make_node (OMP_TARGET
);
35052 TREE_TYPE (stmt
) = void_type_node
;
35054 OMP_TARGET_CLAUSES (stmt
)
35055 = cp_parser_omp_all_clauses (parser
, OMP_TARGET_CLAUSE_MASK
,
35056 "#pragma omp target", pragma_tok
);
35057 pc
= &OMP_TARGET_CLAUSES (stmt
);
35058 keep_next_level (true);
35059 OMP_TARGET_BODY (stmt
) = cp_parser_omp_structured_block (parser
, if_p
);
35061 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35067 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_MAP
)
35068 switch (OMP_CLAUSE_MAP_KIND (*pc
))
35071 case GOMP_MAP_ALWAYS_TO
:
35072 case GOMP_MAP_FROM
:
35073 case GOMP_MAP_ALWAYS_FROM
:
35074 case GOMP_MAP_TOFROM
:
35075 case GOMP_MAP_ALWAYS_TOFROM
:
35076 case GOMP_MAP_ALLOC
:
35077 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
35078 case GOMP_MAP_FIRSTPRIVATE_REFERENCE
:
35079 case GOMP_MAP_ALWAYS_POINTER
:
35082 error_at (OMP_CLAUSE_LOCATION (*pc
),
35083 "%<#pragma omp target%> with map-type other "
35084 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35085 "on %<map%> clause");
35086 *pc
= OMP_CLAUSE_CHAIN (*pc
);
35089 pc
= &OMP_CLAUSE_CHAIN (*pc
);
35095 # pragma acc cache (variable-list) new-line
35099 cp_parser_oacc_cache (cp_parser
*parser
, cp_token
*pragma_tok
)
35101 tree stmt
, clauses
;
35103 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE__CACHE_
, NULL_TREE
);
35104 clauses
= finish_omp_clauses (clauses
, C_ORT_ACC
);
35106 cp_parser_require_pragma_eol (parser
, cp_lexer_peek_token (parser
->lexer
));
35108 stmt
= make_node (OACC_CACHE
);
35109 TREE_TYPE (stmt
) = void_type_node
;
35110 OACC_CACHE_CLAUSES (stmt
) = clauses
;
35111 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35118 # pragma acc data oacc-data-clause[optseq] new-line
35119 structured-block */
35121 #define OACC_DATA_CLAUSE_MASK \
35122 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35125 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35126 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35127 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35128 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35129 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35130 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35131 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35132 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35135 cp_parser_oacc_data (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
35137 tree stmt
, clauses
, block
;
35140 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_DATA_CLAUSE_MASK
,
35141 "#pragma acc data", pragma_tok
);
35143 block
= begin_omp_parallel ();
35144 save
= cp_parser_begin_omp_structured_block (parser
);
35145 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
35146 cp_parser_end_omp_structured_block (parser
, save
);
35147 stmt
= finish_oacc_data (clauses
, block
);
35152 # pragma acc host_data <clauses> new-line
35153 structured-block */
35155 #define OACC_HOST_DATA_CLAUSE_MASK \
35156 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35159 cp_parser_oacc_host_data (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
35161 tree stmt
, clauses
, block
;
35164 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_HOST_DATA_CLAUSE_MASK
,
35165 "#pragma acc host_data", pragma_tok
);
35167 block
= begin_omp_parallel ();
35168 save
= cp_parser_begin_omp_structured_block (parser
);
35169 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
35170 cp_parser_end_omp_structured_block (parser
, save
);
35171 stmt
= finish_oacc_host_data (clauses
, block
);
35176 # pragma acc declare oacc-data-clause[optseq] new-line
35179 #define OACC_DECLARE_CLAUSE_MASK \
35180 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35181 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35182 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35194 cp_parser_oacc_declare (cp_parser
*parser
, cp_token
*pragma_tok
)
35196 tree clauses
, stmt
;
35197 bool error
= false;
35199 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_DECLARE_CLAUSE_MASK
,
35200 "#pragma acc declare", pragma_tok
, true);
35203 if (find_omp_clause (clauses
, OMP_CLAUSE_MAP
) == NULL_TREE
)
35205 error_at (pragma_tok
->location
,
35206 "no valid clauses specified in %<#pragma acc declare%>");
35210 for (tree t
= clauses
; t
; t
= OMP_CLAUSE_CHAIN (t
))
35212 location_t loc
= OMP_CLAUSE_LOCATION (t
);
35213 tree decl
= OMP_CLAUSE_DECL (t
);
35214 if (!DECL_P (decl
))
35216 error_at (loc
, "array section in %<#pragma acc declare%>");
35220 gcc_assert (OMP_CLAUSE_CODE (t
) == OMP_CLAUSE_MAP
);
35221 switch (OMP_CLAUSE_MAP_KIND (t
))
35223 case GOMP_MAP_FIRSTPRIVATE_POINTER
:
35224 case GOMP_MAP_FORCE_ALLOC
:
35225 case GOMP_MAP_FORCE_TO
:
35226 case GOMP_MAP_FORCE_DEVICEPTR
:
35227 case GOMP_MAP_DEVICE_RESIDENT
:
35230 case GOMP_MAP_POINTER
:
35231 /* Generated by c_finish_omp_clauses from array sections;
35232 avoid spurious diagnostics. */
35235 case GOMP_MAP_LINK
:
35236 if (!global_bindings_p ()
35237 && (TREE_STATIC (decl
)
35238 || !DECL_EXTERNAL (decl
)))
35241 "%qD must be a global variable in"
35242 "%<#pragma acc declare link%>",
35250 if (global_bindings_p ())
35252 error_at (loc
, "invalid OpenACC clause at file scope");
35256 if (DECL_EXTERNAL (decl
))
35259 "invalid use of %<extern%> variable %qD "
35260 "in %<#pragma acc declare%>", decl
);
35264 else if (TREE_PUBLIC (decl
))
35267 "invalid use of %<global%> variable %qD "
35268 "in %<#pragma acc declare%>", decl
);
35275 if (lookup_attribute ("omp declare target", DECL_ATTRIBUTES (decl
))
35276 || lookup_attribute ("omp declare target link",
35277 DECL_ATTRIBUTES (decl
)))
35279 error_at (loc
, "variable %qD used more than once with "
35280 "%<#pragma acc declare%>", decl
);
35289 if (OMP_CLAUSE_MAP_KIND (t
) == GOMP_MAP_LINK
)
35290 id
= get_identifier ("omp declare target link");
35292 id
= get_identifier ("omp declare target");
35294 DECL_ATTRIBUTES (decl
)
35295 = tree_cons (id
, NULL_TREE
, DECL_ATTRIBUTES (decl
));
35296 if (global_bindings_p ())
35298 symtab_node
*node
= symtab_node::get (decl
);
35301 node
->offloadable
= 1;
35302 if (ENABLE_OFFLOADING
)
35304 g
->have_offload
= true;
35305 if (is_a
<varpool_node
*> (node
))
35306 vec_safe_push (offload_vars
, decl
);
35313 if (error
|| global_bindings_p ())
35316 stmt
= make_node (OACC_DECLARE
);
35317 TREE_TYPE (stmt
) = void_type_node
;
35318 OACC_DECLARE_CLAUSES (stmt
) = clauses
;
35319 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35327 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35331 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35333 LOC is the location of the #pragma token.
35336 #define OACC_ENTER_DATA_CLAUSE_MASK \
35337 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35338 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35339 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35340 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35341 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35345 #define OACC_EXIT_DATA_CLAUSE_MASK \
35346 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35353 cp_parser_oacc_enter_exit_data (cp_parser
*parser
, cp_token
*pragma_tok
,
35356 tree stmt
, clauses
;
35358 if (cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA_EOL
)
35359 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
35361 cp_parser_error (parser
, enter
35362 ? "expected %<data%> in %<#pragma acc enter data%>"
35363 : "expected %<data%> in %<#pragma acc exit data%>");
35364 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35369 IDENTIFIER_POINTER (cp_lexer_peek_token (parser
->lexer
)->u
.value
);
35370 if (strcmp (p
, "data") != 0)
35372 cp_parser_error (parser
, "invalid pragma");
35373 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35377 cp_lexer_consume_token (parser
->lexer
);
35380 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_ENTER_DATA_CLAUSE_MASK
,
35381 "#pragma acc enter data", pragma_tok
);
35383 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_EXIT_DATA_CLAUSE_MASK
,
35384 "#pragma acc exit data", pragma_tok
);
35386 if (find_omp_clause (clauses
, OMP_CLAUSE_MAP
) == NULL_TREE
)
35388 error_at (pragma_tok
->location
,
35389 "%<#pragma acc enter data%> has no data movement clause");
35393 stmt
= enter
? make_node (OACC_ENTER_DATA
) : make_node (OACC_EXIT_DATA
);
35394 TREE_TYPE (stmt
) = void_type_node
;
35395 OMP_STANDALONE_CLAUSES (stmt
) = clauses
;
35396 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35402 # pragma acc loop oacc-loop-clause[optseq] new-line
35403 structured-block */
35405 #define OACC_LOOP_CLAUSE_MASK \
35406 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35410 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35418 cp_parser_oacc_loop (cp_parser
*parser
, cp_token
*pragma_tok
, char *p_name
,
35419 omp_clause_mask mask
, tree
*cclauses
, bool *if_p
)
35421 bool is_parallel
= ((mask
>> PRAGMA_OACC_CLAUSE_REDUCTION
) & 1) == 1;
35423 strcat (p_name
, " loop");
35424 mask
|= OACC_LOOP_CLAUSE_MASK
;
35426 tree clauses
= cp_parser_oacc_all_clauses (parser
, mask
, p_name
, pragma_tok
,
35430 clauses
= c_oacc_split_loop_clauses (clauses
, cclauses
, is_parallel
);
35432 *cclauses
= finish_omp_clauses (*cclauses
, C_ORT_ACC
);
35434 clauses
= finish_omp_clauses (clauses
, C_ORT_ACC
);
35437 tree block
= begin_omp_structured_block ();
35438 int save
= cp_parser_begin_omp_structured_block (parser
);
35439 tree stmt
= cp_parser_omp_for_loop (parser
, OACC_LOOP
, clauses
, NULL
, if_p
);
35440 cp_parser_end_omp_structured_block (parser
, save
);
35441 add_stmt (finish_omp_structured_block (block
));
35447 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35452 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35456 #define OACC_KERNELS_CLAUSE_MASK \
35457 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35458 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35459 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35460 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35461 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35462 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35463 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35472 #define OACC_PARALLEL_CLAUSE_MASK \
35473 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35474 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35475 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35480 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35481 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35482 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35483 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35484 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35485 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35486 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35487 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35488 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35489 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35495 cp_parser_oacc_kernels_parallel (cp_parser
*parser
, cp_token
*pragma_tok
,
35496 char *p_name
, bool *if_p
)
35498 omp_clause_mask mask
;
35499 enum tree_code code
;
35500 switch (cp_parser_pragma_kind (pragma_tok
))
35502 case PRAGMA_OACC_KERNELS
:
35503 strcat (p_name
, " kernels");
35504 mask
= OACC_KERNELS_CLAUSE_MASK
;
35505 code
= OACC_KERNELS
;
35507 case PRAGMA_OACC_PARALLEL
:
35508 strcat (p_name
, " parallel");
35509 mask
= OACC_PARALLEL_CLAUSE_MASK
;
35510 code
= OACC_PARALLEL
;
35513 gcc_unreachable ();
35516 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35519 = IDENTIFIER_POINTER (cp_lexer_peek_token (parser
->lexer
)->u
.value
);
35520 if (strcmp (p
, "loop") == 0)
35522 cp_lexer_consume_token (parser
->lexer
);
35523 tree block
= begin_omp_parallel ();
35525 cp_parser_oacc_loop (parser
, pragma_tok
, p_name
, mask
, &clauses
,
35527 return finish_omp_construct (code
, block
, clauses
);
35531 tree clauses
= cp_parser_oacc_all_clauses (parser
, mask
, p_name
, pragma_tok
);
35533 tree block
= begin_omp_parallel ();
35534 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
35535 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
35536 cp_parser_end_omp_structured_block (parser
, save
);
35537 return finish_omp_construct (code
, block
, clauses
);
35541 # pragma acc update oacc-update-clause[optseq] new-line
35544 #define OACC_UPDATE_CLAUSE_MASK \
35545 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35546 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35547 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35548 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35549 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35550 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35553 cp_parser_oacc_update (cp_parser
*parser
, cp_token
*pragma_tok
)
35555 tree stmt
, clauses
;
35557 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_UPDATE_CLAUSE_MASK
,
35558 "#pragma acc update", pragma_tok
);
35560 if (find_omp_clause (clauses
, OMP_CLAUSE_MAP
) == NULL_TREE
)
35562 error_at (pragma_tok
->location
,
35563 "%<#pragma acc update%> must contain at least one "
35564 "%<device%> or %<host%> or %<self%> clause");
35568 stmt
= make_node (OACC_UPDATE
);
35569 TREE_TYPE (stmt
) = void_type_node
;
35570 OACC_UPDATE_CLAUSES (stmt
) = clauses
;
35571 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
35577 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35579 LOC is the location of the #pragma token.
35582 #define OACC_WAIT_CLAUSE_MASK \
35583 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35586 cp_parser_oacc_wait (cp_parser
*parser
, cp_token
*pragma_tok
)
35588 tree clauses
, list
= NULL_TREE
, stmt
= NULL_TREE
;
35589 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
35591 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
35592 list
= cp_parser_oacc_wait_list (parser
, loc
, list
);
35594 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_WAIT_CLAUSE_MASK
,
35595 "#pragma acc wait", pragma_tok
);
35597 stmt
= c_finish_oacc_wait (loc
, list
, clauses
);
35598 stmt
= finish_expr_stmt (stmt
);
35604 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35606 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35607 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35608 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35609 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35610 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35611 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35612 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35615 cp_parser_omp_declare_simd (cp_parser
*parser
, cp_token
*pragma_tok
,
35616 enum pragma_context context
)
35618 bool first_p
= parser
->omp_declare_simd
== NULL
;
35619 cp_omp_declare_simd_data data
;
35622 data
.error_seen
= false;
35623 data
.fndecl_seen
= false;
35624 data
.tokens
= vNULL
;
35625 parser
->omp_declare_simd
= &data
;
35627 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
35628 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
35629 cp_lexer_consume_token (parser
->lexer
);
35630 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
35631 parser
->omp_declare_simd
->error_seen
= true;
35632 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35633 struct cp_token_cache
*cp
35634 = cp_token_cache_new (pragma_tok
, cp_lexer_peek_token (parser
->lexer
));
35635 parser
->omp_declare_simd
->tokens
.safe_push (cp
);
35638 while (cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA
))
35639 cp_parser_pragma (parser
, context
, NULL
);
35642 case pragma_external
:
35643 cp_parser_declaration (parser
);
35645 case pragma_member
:
35646 cp_parser_member_declaration (parser
);
35648 case pragma_objc_icode
:
35649 cp_parser_block_declaration (parser
, /*statement_p=*/false);
35652 cp_parser_declaration_statement (parser
);
35655 if (parser
->omp_declare_simd
35656 && !parser
->omp_declare_simd
->error_seen
35657 && !parser
->omp_declare_simd
->fndecl_seen
)
35658 error_at (pragma_tok
->location
,
35659 "%<#pragma omp declare simd%> not immediately followed by "
35660 "function declaration or definition");
35661 data
.tokens
.release ();
35662 parser
->omp_declare_simd
= NULL
;
35666 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35667 This function is modelled similar to the late parsing of omp declare
35671 cp_parser_late_parsing_cilk_simd_fn_info (cp_parser
*parser
, tree attrs
)
35673 struct cp_token_cache
*ce
;
35674 cp_omp_declare_simd_data
*info
= parser
->cilk_simd_fn_info
;
35677 if (parser
->omp_declare_simd
!= NULL
35678 || lookup_attribute ("simd", attrs
))
35680 error ("%<#pragma omp declare simd%> of %<simd%> attribute cannot be "
35681 "used in the same function marked as a Cilk Plus SIMD-enabled "
35683 parser
->cilk_simd_fn_info
->tokens
.release ();
35684 XDELETE (parser
->cilk_simd_fn_info
);
35685 parser
->cilk_simd_fn_info
= NULL
;
35688 if (!info
->error_seen
&& info
->fndecl_seen
)
35690 error ("vector attribute not immediately followed by a single function"
35691 " declaration or definition");
35692 info
->error_seen
= true;
35694 if (info
->error_seen
)
35697 FOR_EACH_VEC_ELT (info
->tokens
, ii
, ce
)
35701 cp_parser_push_lexer_for_tokens (parser
, ce
);
35702 parser
->lexer
->in_pragma
= true;
35703 cl
= cp_parser_omp_all_clauses (parser
, CILK_SIMD_FN_CLAUSE_MASK
,
35704 "SIMD-enabled functions attribute",
35706 cp_parser_pop_lexer (parser
);
35708 cl
= tree_cons (NULL_TREE
, cl
, NULL_TREE
);
35710 c
= build_tree_list (get_identifier ("cilk simd function"), NULL_TREE
);
35711 TREE_CHAIN (c
) = attrs
;
35714 c
= build_tree_list (get_identifier ("omp declare simd"), cl
);
35715 TREE_CHAIN (c
) = attrs
;
35716 if (processing_template_decl
)
35717 ATTR_IS_DEPENDENT (c
) = 1;
35720 info
->fndecl_seen
= true;
35721 parser
->cilk_simd_fn_info
->tokens
.release ();
35722 XDELETE (parser
->cilk_simd_fn_info
);
35723 parser
->cilk_simd_fn_info
= NULL
;
35727 /* Finalize #pragma omp declare simd clauses after direct declarator has
35728 been parsed, and put that into "omp declare simd" attribute. */
35731 cp_parser_late_parsing_omp_declare_simd (cp_parser
*parser
, tree attrs
)
35733 struct cp_token_cache
*ce
;
35734 cp_omp_declare_simd_data
*data
= parser
->omp_declare_simd
;
35737 if (!data
->error_seen
&& data
->fndecl_seen
)
35739 error ("%<#pragma omp declare simd%> not immediately followed by "
35740 "a single function declaration or definition");
35741 data
->error_seen
= true;
35744 if (data
->error_seen
)
35747 FOR_EACH_VEC_ELT (data
->tokens
, i
, ce
)
35751 cp_parser_push_lexer_for_tokens (parser
, ce
);
35752 parser
->lexer
->in_pragma
= true;
35753 gcc_assert (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_PRAGMA
);
35754 cp_token
*pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
35755 cp_lexer_consume_token (parser
->lexer
);
35756 cl
= cp_parser_omp_all_clauses (parser
, OMP_DECLARE_SIMD_CLAUSE_MASK
,
35757 "#pragma omp declare simd", pragma_tok
);
35758 cp_parser_pop_lexer (parser
);
35760 cl
= tree_cons (NULL_TREE
, cl
, NULL_TREE
);
35761 c
= build_tree_list (get_identifier ("omp declare simd"), cl
);
35762 TREE_CHAIN (c
) = attrs
;
35763 if (processing_template_decl
)
35764 ATTR_IS_DEPENDENT (c
) = 1;
35768 data
->fndecl_seen
= true;
35774 # pragma omp declare target new-line
35775 declarations and definitions
35776 # pragma omp end declare target new-line
35779 # pragma omp declare target ( extended-list ) new-line
35781 # pragma omp declare target declare-target-clauses[seq] new-line */
35783 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35784 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35788 cp_parser_omp_declare_target (cp_parser
*parser
, cp_token
*pragma_tok
)
35790 tree clauses
= NULL_TREE
;
35791 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35793 = cp_parser_omp_all_clauses (parser
, OMP_DECLARE_TARGET_CLAUSE_MASK
,
35794 "#pragma omp declare target", pragma_tok
);
35795 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
35797 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_TO_DECLARE
,
35799 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP
);
35800 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35804 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35805 scope_chain
->omp_declare_target_attribute
++;
35808 if (scope_chain
->omp_declare_target_attribute
)
35809 error_at (pragma_tok
->location
,
35810 "%<#pragma omp declare target%> with clauses in between "
35811 "%<#pragma omp declare target%> without clauses and "
35812 "%<#pragma omp end declare target%>");
35813 for (tree c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
35815 tree t
= OMP_CLAUSE_DECL (c
), id
;
35816 tree at1
= lookup_attribute ("omp declare target", DECL_ATTRIBUTES (t
));
35817 tree at2
= lookup_attribute ("omp declare target link",
35818 DECL_ATTRIBUTES (t
));
35819 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINK
)
35821 id
= get_identifier ("omp declare target link");
35822 std::swap (at1
, at2
);
35825 id
= get_identifier ("omp declare target");
35828 error_at (OMP_CLAUSE_LOCATION (c
),
35829 "%qD specified both in declare target %<link%> and %<to%>"
35835 symtab_node
*node
= symtab_node::get (t
);
35836 DECL_ATTRIBUTES (t
) = tree_cons (id
, NULL_TREE
, DECL_ATTRIBUTES (t
));
35839 node
->offloadable
= 1;
35840 if (ENABLE_OFFLOADING
)
35842 g
->have_offload
= true;
35843 if (is_a
<varpool_node
*> (node
))
35844 vec_safe_push (offload_vars
, t
);
35852 cp_parser_omp_end_declare_target (cp_parser
*parser
, cp_token
*pragma_tok
)
35854 const char *p
= "";
35855 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35857 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35858 p
= IDENTIFIER_POINTER (id
);
35860 if (strcmp (p
, "declare") == 0)
35862 cp_lexer_consume_token (parser
->lexer
);
35864 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35866 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35867 p
= IDENTIFIER_POINTER (id
);
35869 if (strcmp (p
, "target") == 0)
35870 cp_lexer_consume_token (parser
->lexer
);
35873 cp_parser_error (parser
, "expected %<target%>");
35874 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35880 cp_parser_error (parser
, "expected %<declare%>");
35881 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
35884 cp_parser_require_pragma_eol (parser
, pragma_tok
);
35885 if (!scope_chain
->omp_declare_target_attribute
)
35886 error_at (pragma_tok
->location
,
35887 "%<#pragma omp end declare target%> without corresponding "
35888 "%<#pragma omp declare target%>");
35890 scope_chain
->omp_declare_target_attribute
--;
35893 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35894 expression and optional initializer clause of
35895 #pragma omp declare reduction. We store the expression(s) as
35896 either 3, 6 or 7 special statements inside of the artificial function's
35897 body. The first two statements are DECL_EXPRs for the artificial
35898 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35899 expression that uses those variables.
35900 If there was any INITIALIZER clause, this is followed by further statements,
35901 the fourth and fifth statements are DECL_EXPRs for the artificial
35902 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35903 constructor variant (first token after open paren is not omp_priv),
35904 then the sixth statement is a statement with the function call expression
35905 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35906 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35907 to initialize the OMP_PRIV artificial variable and there is seventh
35908 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35911 cp_parser_omp_declare_reduction_exprs (tree fndecl
, cp_parser
*parser
)
35913 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
35914 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
35915 type
= TREE_TYPE (type
);
35916 tree omp_out
= build_lang_decl (VAR_DECL
, get_identifier ("omp_out"), type
);
35917 DECL_ARTIFICIAL (omp_out
) = 1;
35918 pushdecl (omp_out
);
35919 add_decl_expr (omp_out
);
35920 tree omp_in
= build_lang_decl (VAR_DECL
, get_identifier ("omp_in"), type
);
35921 DECL_ARTIFICIAL (omp_in
) = 1;
35923 add_decl_expr (omp_in
);
35925 tree omp_priv
= NULL_TREE
, omp_orig
= NULL_TREE
, initializer
= NULL_TREE
;
35927 keep_next_level (true);
35928 tree block
= begin_omp_structured_block ();
35929 combiner
= cp_parser_expression (parser
);
35930 finish_expr_stmt (combiner
);
35931 block
= finish_omp_structured_block (block
);
35934 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
35937 const char *p
= "";
35938 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35940 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35941 p
= IDENTIFIER_POINTER (id
);
35944 if (strcmp (p
, "initializer") == 0)
35946 cp_lexer_consume_token (parser
->lexer
);
35947 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
35951 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
35953 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
35954 p
= IDENTIFIER_POINTER (id
);
35957 omp_priv
= build_lang_decl (VAR_DECL
, get_identifier ("omp_priv"), type
);
35958 DECL_ARTIFICIAL (omp_priv
) = 1;
35959 pushdecl (omp_priv
);
35960 add_decl_expr (omp_priv
);
35961 omp_orig
= build_lang_decl (VAR_DECL
, get_identifier ("omp_orig"), type
);
35962 DECL_ARTIFICIAL (omp_orig
) = 1;
35963 pushdecl (omp_orig
);
35964 add_decl_expr (omp_orig
);
35966 keep_next_level (true);
35967 block
= begin_omp_structured_block ();
35970 if (strcmp (p
, "omp_priv") == 0)
35972 bool is_direct_init
, is_non_constant_init
;
35974 cp_lexer_consume_token (parser
->lexer
);
35975 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35976 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
35977 || (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
35978 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
35980 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
35981 == CPP_CLOSE_PAREN
))
35983 finish_omp_structured_block (block
);
35984 error ("invalid initializer clause");
35987 initializer
= cp_parser_initializer (parser
, &is_direct_init
,
35988 &is_non_constant_init
);
35989 cp_finish_decl (omp_priv
, initializer
, !is_non_constant_init
,
35990 NULL_TREE
, LOOKUP_ONLYCONVERTING
);
35994 cp_parser_parse_tentatively (parser
);
35995 tree fn_name
= cp_parser_id_expression (parser
, /*template_p=*/false,
35996 /*check_dependency_p=*/true,
35997 /*template_p=*/NULL
,
35998 /*declarator_p=*/false,
35999 /*optional_p=*/false);
36000 vec
<tree
, va_gc
> *args
;
36001 if (fn_name
== error_mark_node
36002 || cp_parser_error_occurred (parser
)
36003 || !cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
36004 || ((args
= cp_parser_parenthesized_expression_list
36005 (parser
, non_attr
, /*cast_p=*/false,
36006 /*allow_expansion_p=*/true,
36007 /*non_constant_p=*/NULL
)),
36008 cp_parser_error_occurred (parser
)))
36010 finish_omp_structured_block (block
);
36011 cp_parser_abort_tentative_parse (parser
);
36012 cp_parser_error (parser
, "expected id-expression (arguments)");
36017 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
36018 if (arg
== omp_priv
36019 || (TREE_CODE (arg
) == ADDR_EXPR
36020 && TREE_OPERAND (arg
, 0) == omp_priv
))
36022 cp_parser_abort_tentative_parse (parser
);
36023 if (arg
== NULL_TREE
)
36024 error ("one of the initializer call arguments should be %<omp_priv%>"
36025 " or %<&omp_priv%>");
36026 initializer
= cp_parser_postfix_expression (parser
, false, false, false,
36028 finish_expr_stmt (initializer
);
36031 block
= finish_omp_structured_block (block
);
36032 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
36036 add_decl_expr (omp_orig
);
36038 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
36042 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA_EOL
))
36043 cp_parser_required_error (parser
, RT_PRAGMA_EOL
, /*keyword=*/false);
36049 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36050 initializer-clause[opt] new-line
36052 initializer-clause:
36053 initializer (omp_priv initializer)
36054 initializer (function-name (argument-list)) */
36057 cp_parser_omp_declare_reduction (cp_parser
*parser
, cp_token
*pragma_tok
,
36058 enum pragma_context
)
36060 auto_vec
<tree
> types
;
36061 enum tree_code reduc_code
= ERROR_MARK
;
36062 tree reduc_id
= NULL_TREE
, orig_reduc_id
= NULL_TREE
, type
;
36064 cp_token
*first_token
;
36065 cp_token_cache
*cp
;
36069 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
36070 p
= obstack_alloc (&declarator_obstack
, 0);
36072 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
36075 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
36078 reduc_code
= PLUS_EXPR
;
36081 reduc_code
= MULT_EXPR
;
36084 reduc_code
= MINUS_EXPR
;
36087 reduc_code
= BIT_AND_EXPR
;
36090 reduc_code
= BIT_XOR_EXPR
;
36093 reduc_code
= BIT_IOR_EXPR
;
36096 reduc_code
= TRUTH_ANDIF_EXPR
;
36099 reduc_code
= TRUTH_ORIF_EXPR
;
36102 reduc_id
= orig_reduc_id
= cp_parser_identifier (parser
);
36105 cp_parser_error (parser
, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
36106 "%<|%>, %<&&%>, %<||%> or identifier");
36110 if (reduc_code
!= ERROR_MARK
)
36111 cp_lexer_consume_token (parser
->lexer
);
36113 reduc_id
= omp_reduction_id (reduc_code
, reduc_id
, NULL_TREE
);
36114 if (reduc_id
== error_mark_node
)
36117 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
36120 /* Types may not be defined in declare reduction type list. */
36121 const char *saved_message
;
36122 saved_message
= parser
->type_definition_forbidden_message
;
36123 parser
->type_definition_forbidden_message
36124 = G_("types may not be defined in declare reduction type list");
36125 bool saved_colon_corrects_to_scope_p
;
36126 saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
36127 parser
->colon_corrects_to_scope_p
= false;
36128 bool saved_colon_doesnt_start_class_def_p
;
36129 saved_colon_doesnt_start_class_def_p
36130 = parser
->colon_doesnt_start_class_def_p
;
36131 parser
->colon_doesnt_start_class_def_p
= true;
36135 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
36136 type
= cp_parser_type_id (parser
);
36137 if (type
== error_mark_node
)
36139 else if (ARITHMETIC_TYPE_P (type
)
36140 && (orig_reduc_id
== NULL_TREE
36141 || (TREE_CODE (type
) != COMPLEX_TYPE
36142 && (strcmp (IDENTIFIER_POINTER (orig_reduc_id
),
36144 || strcmp (IDENTIFIER_POINTER (orig_reduc_id
),
36146 error_at (loc
, "predeclared arithmetic type %qT in "
36147 "%<#pragma omp declare reduction%>", type
);
36148 else if (TREE_CODE (type
) == FUNCTION_TYPE
36149 || TREE_CODE (type
) == METHOD_TYPE
36150 || TREE_CODE (type
) == ARRAY_TYPE
)
36151 error_at (loc
, "function or array type %qT in "
36152 "%<#pragma omp declare reduction%>", type
);
36153 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
36154 error_at (loc
, "reference type %qT in "
36155 "%<#pragma omp declare reduction%>", type
);
36156 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
36157 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
36158 "%<#pragma omp declare reduction%>", type
);
36160 types
.safe_push (type
);
36162 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
36163 cp_lexer_consume_token (parser
->lexer
);
36168 /* Restore the saved message. */
36169 parser
->type_definition_forbidden_message
= saved_message
;
36170 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
36171 parser
->colon_doesnt_start_class_def_p
36172 = saved_colon_doesnt_start_class_def_p
;
36174 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
)
36175 || types
.is_empty ())
36178 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36182 first_token
= cp_lexer_peek_token (parser
->lexer
);
36185 FOR_EACH_VEC_ELT (types
, i
, type
)
36188 = build_function_type_list (void_type_node
,
36189 cp_build_reference_type (type
, false),
36191 tree this_reduc_id
= reduc_id
;
36192 if (!dependent_type_p (type
))
36193 this_reduc_id
= omp_reduction_id (ERROR_MARK
, reduc_id
, type
);
36194 tree fndecl
= build_lang_decl (FUNCTION_DECL
, this_reduc_id
, fntype
);
36195 DECL_SOURCE_LOCATION (fndecl
) = pragma_tok
->location
;
36196 DECL_ARTIFICIAL (fndecl
) = 1;
36197 DECL_EXTERNAL (fndecl
) = 1;
36198 DECL_DECLARED_INLINE_P (fndecl
) = 1;
36199 DECL_IGNORED_P (fndecl
) = 1;
36200 DECL_OMP_DECLARE_REDUCTION_P (fndecl
) = 1;
36201 SET_DECL_ASSEMBLER_NAME (fndecl
, get_identifier ("<udr>"));
36202 DECL_ATTRIBUTES (fndecl
)
36203 = tree_cons (get_identifier ("gnu_inline"), NULL_TREE
,
36204 DECL_ATTRIBUTES (fndecl
));
36205 if (processing_template_decl
)
36206 fndecl
= push_template_decl (fndecl
);
36207 bool block_scope
= false;
36208 tree block
= NULL_TREE
;
36209 if (current_function_decl
)
36211 block_scope
= true;
36212 DECL_CONTEXT (fndecl
) = global_namespace
;
36213 if (!processing_template_decl
)
36216 else if (current_class_type
)
36220 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
36221 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
36222 cp_lexer_consume_token (parser
->lexer
);
36223 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
36225 cp
= cp_token_cache_new (first_token
,
36226 cp_lexer_peek_nth_token (parser
->lexer
,
36229 DECL_STATIC_FUNCTION_P (fndecl
) = 1;
36230 finish_member_declaration (fndecl
);
36231 DECL_PENDING_INLINE_INFO (fndecl
) = cp
;
36232 DECL_PENDING_INLINE_P (fndecl
) = 1;
36233 vec_safe_push (unparsed_funs_with_definitions
, fndecl
);
36238 DECL_CONTEXT (fndecl
) = current_namespace
;
36242 start_preparsed_function (fndecl
, NULL_TREE
, SF_PRE_PARSED
);
36244 block
= begin_omp_structured_block ();
36247 cp_parser_push_lexer_for_tokens (parser
, cp
);
36248 parser
->lexer
->in_pragma
= true;
36250 if (!cp_parser_omp_declare_reduction_exprs (fndecl
, parser
))
36253 finish_function (0);
36255 DECL_CONTEXT (fndecl
) = current_function_decl
;
36257 cp_parser_pop_lexer (parser
);
36261 cp_parser_pop_lexer (parser
);
36263 finish_function (0);
36266 DECL_CONTEXT (fndecl
) = current_function_decl
;
36267 block
= finish_omp_structured_block (block
);
36268 if (TREE_CODE (block
) == BIND_EXPR
)
36269 DECL_SAVED_TREE (fndecl
) = BIND_EXPR_BODY (block
);
36270 else if (TREE_CODE (block
) == STATEMENT_LIST
)
36271 DECL_SAVED_TREE (fndecl
) = block
;
36272 if (processing_template_decl
)
36273 add_decl_expr (fndecl
);
36275 cp_check_omp_declare_reduction (fndecl
);
36276 if (cp
== NULL
&& types
.length () > 1)
36277 cp
= cp_token_cache_new (first_token
,
36278 cp_lexer_peek_nth_token (parser
->lexer
, 2));
36279 if (errs
!= errorcount
)
36283 cp_parser_require_pragma_eol (parser
, pragma_tok
);
36286 /* Free any declarators allocated. */
36287 obstack_free (&declarator_obstack
, p
);
36291 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36292 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36293 initializer-clause[opt] new-line
36294 #pragma omp declare target new-line */
36297 cp_parser_omp_declare (cp_parser
*parser
, cp_token
*pragma_tok
,
36298 enum pragma_context context
)
36300 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
36302 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
36303 const char *p
= IDENTIFIER_POINTER (id
);
36305 if (strcmp (p
, "simd") == 0)
36307 cp_lexer_consume_token (parser
->lexer
);
36308 cp_parser_omp_declare_simd (parser
, pragma_tok
,
36312 cp_ensure_no_omp_declare_simd (parser
);
36313 if (strcmp (p
, "reduction") == 0)
36315 cp_lexer_consume_token (parser
->lexer
);
36316 cp_parser_omp_declare_reduction (parser
, pragma_tok
,
36320 if (!flag_openmp
) /* flag_openmp_simd */
36322 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36325 if (strcmp (p
, "target") == 0)
36327 cp_lexer_consume_token (parser
->lexer
);
36328 cp_parser_omp_declare_target (parser
, pragma_tok
);
36332 cp_parser_error (parser
, "expected %<simd%> or %<reduction%> "
36334 cp_parser_require_pragma_eol (parser
, pragma_tok
);
36338 #pragma omp taskloop taskloop-clause[optseq] new-line
36341 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36344 #define OMP_TASKLOOP_CLAUSE_MASK \
36345 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36349 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36361 cp_parser_omp_taskloop (cp_parser
*parser
, cp_token
*pragma_tok
,
36362 char *p_name
, omp_clause_mask mask
, tree
*cclauses
,
36365 tree clauses
, sb
, ret
;
36367 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
36369 strcat (p_name
, " taskloop");
36370 mask
|= OMP_TASKLOOP_CLAUSE_MASK
;
36372 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
36374 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
36375 const char *p
= IDENTIFIER_POINTER (id
);
36377 if (strcmp (p
, "simd") == 0)
36379 tree cclauses_buf
[C_OMP_CLAUSE_SPLIT_COUNT
];
36380 if (cclauses
== NULL
)
36381 cclauses
= cclauses_buf
;
36383 cp_lexer_consume_token (parser
->lexer
);
36384 if (!flag_openmp
) /* flag_openmp_simd */
36385 return cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
36387 sb
= begin_omp_structured_block ();
36388 save
= cp_parser_begin_omp_structured_block (parser
);
36389 ret
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
,
36391 cp_parser_end_omp_structured_block (parser
, save
);
36392 tree body
= finish_omp_structured_block (sb
);
36395 ret
= make_node (OMP_TASKLOOP
);
36396 TREE_TYPE (ret
) = void_type_node
;
36397 OMP_FOR_BODY (ret
) = body
;
36398 OMP_FOR_CLAUSES (ret
) = cclauses
[C_OMP_CLAUSE_SPLIT_TASKLOOP
];
36399 SET_EXPR_LOCATION (ret
, loc
);
36404 if (!flag_openmp
) /* flag_openmp_simd */
36406 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36410 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
,
36414 cp_omp_split_clauses (loc
, OMP_TASKLOOP
, mask
, clauses
, cclauses
);
36415 clauses
= cclauses
[C_OMP_CLAUSE_SPLIT_TASKLOOP
];
36418 sb
= begin_omp_structured_block ();
36419 save
= cp_parser_begin_omp_structured_block (parser
);
36421 ret
= cp_parser_omp_for_loop (parser
, OMP_TASKLOOP
, clauses
, cclauses
,
36424 cp_parser_end_omp_structured_block (parser
, save
);
36425 add_stmt (finish_omp_structured_block (sb
));
36432 # pragma acc routine oacc-routine-clause[optseq] new-line
36433 function-definition
36435 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36438 #define OACC_ROUTINE_CLAUSE_MASK \
36439 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36445 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36446 component, which must resolve to a declared namespace-scope
36447 function. The clauses are either processed directly (for a named
36448 function), or defered until the immediatley following declaration
36452 cp_parser_oacc_routine (cp_parser
*parser
, cp_token
*pragma_tok
,
36453 enum pragma_context context
)
36455 bool first_p
= parser
->oacc_routine
== NULL
;
36456 location_t loc
= pragma_tok
->location
;
36457 cp_omp_declare_simd_data data
;
36460 data
.error_seen
= false;
36461 data
.fndecl_seen
= false;
36462 data
.tokens
= vNULL
;
36463 data
.clauses
= NULL_TREE
;
36464 parser
->oacc_routine
= &data
;
36467 tree decl
= NULL_TREE
;
36468 /* Create a dummy claue, to record location. */
36469 tree c_head
= build_omp_clause (pragma_tok
->location
, OMP_CLAUSE_SEQ
);
36471 if (context
!= pragma_external
)
36473 cp_parser_error (parser
, "%<#pragma acc routine%> not at file scope");
36474 parser
->oacc_routine
->error_seen
= true;
36475 parser
->oacc_routine
= NULL
;
36479 /* Look for optional '( name )'. */
36480 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
36484 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
36485 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
36486 cp_lexer_consume_token (parser
->lexer
);
36487 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
36488 parser
->oacc_routine
->error_seen
= true;
36489 cp_parser_require_pragma_eol (parser
, pragma_tok
);
36491 error_at (OMP_CLAUSE_LOCATION (parser
->oacc_routine
->clauses
),
36492 "%<#pragma acc routine%> not followed by a "
36493 "function declaration or definition");
36495 parser
->oacc_routine
->error_seen
= true;
36499 cp_lexer_consume_token (parser
->lexer
);
36500 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
36502 /* We parse the name as an id-expression. If it resolves to
36503 anything other than a non-overloaded function at namespace
36504 scope, it's an error. */
36505 tree id
= cp_parser_id_expression (parser
,
36506 /*template_keyword_p=*/false,
36507 /*check_dependency_p=*/false,
36508 /*template_p=*/NULL
,
36509 /*declarator_p=*/false,
36510 /*optional_p=*/false);
36511 decl
= cp_parser_lookup_name_simple (parser
, id
, token
->location
);
36512 if (id
!= error_mark_node
&& decl
== error_mark_node
)
36513 cp_parser_name_lookup_error (parser
, id
, decl
, NLE_NULL
,
36516 if (decl
== error_mark_node
36517 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
36519 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
36520 parser
->oacc_routine
= NULL
;
36524 /* Build a chain of clauses. */
36525 parser
->lexer
->in_pragma
= true;
36526 tree clauses
= NULL_TREE
;
36527 clauses
= cp_parser_oacc_all_clauses (parser
, OACC_ROUTINE_CLAUSE_MASK
,
36528 "#pragma acc routine",
36529 cp_lexer_peek_token
36532 /* Force clauses to be non-null, by attaching context to it. */
36533 clauses
= tree_cons (c_head
, clauses
, NULL_TREE
);
36535 if (decl
&& is_overloaded_fn (decl
)
36536 && (TREE_CODE (decl
) != FUNCTION_DECL
36537 || DECL_FUNCTION_TEMPLATE_P (decl
)))
36539 error_at (loc
, "%<#pragma acc routine%> names a set of overloads");
36540 parser
->oacc_routine
= NULL
;
36544 /* Perhaps we should use the same rule as declarations in different
36546 if (!DECL_NAMESPACE_SCOPE_P (decl
))
36548 error_at (loc
, "%<#pragma acc routine%> does not refer to a "
36549 "namespace scope function");
36550 parser
->oacc_routine
= NULL
;
36554 if (!decl
|| TREE_CODE (decl
) != FUNCTION_DECL
)
36557 "%<#pragma acc routine%> does not refer to a function");
36558 parser
->oacc_routine
= NULL
;
36562 data
.clauses
= clauses
;
36564 cp_finalize_oacc_routine (parser
, decl
, false);
36565 data
.tokens
.release ();
36566 parser
->oacc_routine
= NULL
;
36570 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
36571 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_EOF
))
36572 cp_lexer_consume_token (parser
->lexer
);
36573 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
36574 parser
->oacc_routine
->error_seen
= true;
36575 cp_parser_require_pragma_eol (parser
, pragma_tok
);
36577 struct cp_token_cache
*cp
36578 = cp_token_cache_new (pragma_tok
, cp_lexer_peek_token (parser
->lexer
));
36579 parser
->oacc_routine
->tokens
.safe_push (cp
);
36582 parser
->oacc_routine
->clauses
= c_head
;
36584 while (cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA
))
36585 cp_parser_pragma (parser
, context
, NULL
);
36589 /* Create an empty list of clauses. */
36590 parser
->oacc_routine
->clauses
= tree_cons (c_head
, NULL_TREE
,
36592 cp_parser_declaration (parser
);
36594 if (parser
->oacc_routine
36595 && !parser
->oacc_routine
->error_seen
36596 && !parser
->oacc_routine
->fndecl_seen
)
36597 error_at (loc
, "%<#pragma acc routine%> not followed by a "
36598 "function declaration or definition");
36600 data
.tokens
.release ();
36601 parser
->oacc_routine
= NULL
;
36606 /* Finalize #pragma acc routine clauses after direct declarator has
36607 been parsed, and put that into "oacc function" attribute. */
36610 cp_parser_late_parsing_oacc_routine (cp_parser
*parser
, tree attrs
)
36612 struct cp_token_cache
*ce
;
36613 cp_omp_declare_simd_data
*data
= parser
->oacc_routine
;
36614 tree cl
, clauses
= parser
->oacc_routine
->clauses
;
36617 loc
= OMP_CLAUSE_LOCATION (TREE_PURPOSE(clauses
));
36619 if ((!data
->error_seen
&& data
->fndecl_seen
)
36620 || data
->tokens
.length () != 1)
36622 error_at (loc
, "%<#pragma acc routine%> not followed by a "
36623 "function declaration or definition");
36624 data
->error_seen
= true;
36627 if (data
->error_seen
)
36630 ce
= data
->tokens
[0];
36632 cp_parser_push_lexer_for_tokens (parser
, ce
);
36633 parser
->lexer
->in_pragma
= true;
36634 gcc_assert (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_PRAGMA
);
36636 cp_token
*pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
36637 cl
= cp_parser_oacc_all_clauses (parser
, OACC_ROUTINE_CLAUSE_MASK
,
36638 "#pragma acc routine", pragma_tok
);
36639 cp_parser_pop_lexer (parser
);
36641 tree c_head
= build_omp_clause (loc
, OMP_CLAUSE_SEQ
);
36643 /* Force clauses to be non-null, by attaching context to it. */
36644 parser
->oacc_routine
->clauses
= tree_cons (c_head
, cl
, NULL_TREE
);
36646 data
->fndecl_seen
= true;
36650 /* Apply any saved OpenACC routine clauses to a just-parsed
36654 cp_finalize_oacc_routine (cp_parser
*parser
, tree fndecl
, bool is_defn
)
36656 if (__builtin_expect (parser
->oacc_routine
!= NULL
, 0))
36658 tree clauses
= parser
->oacc_routine
->clauses
;
36659 location_t loc
= OMP_CLAUSE_LOCATION (TREE_PURPOSE(clauses
));
36661 if (parser
->oacc_routine
->error_seen
)
36664 if (fndecl
== error_mark_node
)
36666 parser
->oacc_routine
= NULL
;
36670 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
36672 cp_ensure_no_oacc_routine (parser
);
36676 if (!fndecl
|| TREE_CODE (fndecl
) != FUNCTION_DECL
)
36679 "%<#pragma acc routine%> not followed by a function "
36680 "declaration or definition");
36681 parser
->oacc_routine
= NULL
;
36684 if (get_oacc_fn_attrib (fndecl
))
36686 error_at (loc
, "%<#pragma acc routine%> already applied to %D",
36688 parser
->oacc_routine
= NULL
;
36691 if (TREE_USED (fndecl
) || (!is_defn
&& DECL_SAVED_TREE (fndecl
)))
36693 error_at (loc
, "%<#pragma acc routine%> must be applied before %s",
36694 TREE_USED (fndecl
) ? "use" : "definition");
36695 parser
->oacc_routine
= NULL
;
36698 /* Process for function attrib */
36699 tree dims
= build_oacc_routine_dims (TREE_VALUE (clauses
));
36700 replace_oacc_fn_attrib (fndecl
, dims
);
36702 /* Add an "omp target" attribute. */
36703 DECL_ATTRIBUTES (fndecl
)
36704 = tree_cons (get_identifier ("omp declare target"),
36705 NULL_TREE
, DECL_ATTRIBUTES (fndecl
));
36709 /* Main entry point to OpenMP statement pragmas. */
36712 cp_parser_omp_construct (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
36715 char p_name
[sizeof "#pragma omp teams distribute parallel for simd"];
36716 omp_clause_mask
mask (0);
36718 switch (cp_parser_pragma_kind (pragma_tok
))
36720 case PRAGMA_OACC_ATOMIC
:
36721 cp_parser_omp_atomic (parser
, pragma_tok
);
36723 case PRAGMA_OACC_CACHE
:
36724 stmt
= cp_parser_oacc_cache (parser
, pragma_tok
);
36726 case PRAGMA_OACC_DATA
:
36727 stmt
= cp_parser_oacc_data (parser
, pragma_tok
, if_p
);
36729 case PRAGMA_OACC_ENTER_DATA
:
36730 stmt
= cp_parser_oacc_enter_exit_data (parser
, pragma_tok
, true);
36732 case PRAGMA_OACC_EXIT_DATA
:
36733 stmt
= cp_parser_oacc_enter_exit_data (parser
, pragma_tok
, false);
36735 case PRAGMA_OACC_HOST_DATA
:
36736 stmt
= cp_parser_oacc_host_data (parser
, pragma_tok
, if_p
);
36738 case PRAGMA_OACC_KERNELS
:
36739 case PRAGMA_OACC_PARALLEL
:
36740 strcpy (p_name
, "#pragma acc");
36741 stmt
= cp_parser_oacc_kernels_parallel (parser
, pragma_tok
, p_name
,
36744 case PRAGMA_OACC_LOOP
:
36745 strcpy (p_name
, "#pragma acc");
36746 stmt
= cp_parser_oacc_loop (parser
, pragma_tok
, p_name
, mask
, NULL
,
36749 case PRAGMA_OACC_UPDATE
:
36750 stmt
= cp_parser_oacc_update (parser
, pragma_tok
);
36752 case PRAGMA_OACC_WAIT
:
36753 stmt
= cp_parser_oacc_wait (parser
, pragma_tok
);
36755 case PRAGMA_OMP_ATOMIC
:
36756 cp_parser_omp_atomic (parser
, pragma_tok
);
36758 case PRAGMA_OMP_CRITICAL
:
36759 stmt
= cp_parser_omp_critical (parser
, pragma_tok
, if_p
);
36761 case PRAGMA_OMP_DISTRIBUTE
:
36762 strcpy (p_name
, "#pragma omp");
36763 stmt
= cp_parser_omp_distribute (parser
, pragma_tok
, p_name
, mask
, NULL
,
36766 case PRAGMA_OMP_FOR
:
36767 strcpy (p_name
, "#pragma omp");
36768 stmt
= cp_parser_omp_for (parser
, pragma_tok
, p_name
, mask
, NULL
,
36771 case PRAGMA_OMP_MASTER
:
36772 stmt
= cp_parser_omp_master (parser
, pragma_tok
, if_p
);
36774 case PRAGMA_OMP_PARALLEL
:
36775 strcpy (p_name
, "#pragma omp");
36776 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
, p_name
, mask
, NULL
,
36779 case PRAGMA_OMP_SECTIONS
:
36780 strcpy (p_name
, "#pragma omp");
36781 stmt
= cp_parser_omp_sections (parser
, pragma_tok
, p_name
, mask
, NULL
);
36783 case PRAGMA_OMP_SIMD
:
36784 strcpy (p_name
, "#pragma omp");
36785 stmt
= cp_parser_omp_simd (parser
, pragma_tok
, p_name
, mask
, NULL
,
36788 case PRAGMA_OMP_SINGLE
:
36789 stmt
= cp_parser_omp_single (parser
, pragma_tok
, if_p
);
36791 case PRAGMA_OMP_TASK
:
36792 stmt
= cp_parser_omp_task (parser
, pragma_tok
, if_p
);
36794 case PRAGMA_OMP_TASKGROUP
:
36795 stmt
= cp_parser_omp_taskgroup (parser
, pragma_tok
, if_p
);
36797 case PRAGMA_OMP_TASKLOOP
:
36798 strcpy (p_name
, "#pragma omp");
36799 stmt
= cp_parser_omp_taskloop (parser
, pragma_tok
, p_name
, mask
, NULL
,
36802 case PRAGMA_OMP_TEAMS
:
36803 strcpy (p_name
, "#pragma omp");
36804 stmt
= cp_parser_omp_teams (parser
, pragma_tok
, p_name
, mask
, NULL
,
36808 gcc_unreachable ();
36811 protected_set_expr_location (stmt
, pragma_tok
->location
);
36814 /* Transactional Memory parsing routines. */
36816 /* Parse a transaction attribute.
36822 We use this instead of cp_parser_attributes_opt for transactions to avoid
36823 the pedwarn in C++98 mode. */
36826 cp_parser_txn_attribute_opt (cp_parser
*parser
)
36829 tree attr_name
, attr
= NULL
;
36831 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
36832 return cp_parser_attributes_opt (parser
);
36834 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
36836 cp_lexer_consume_token (parser
->lexer
);
36837 if (!cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
))
36840 token
= cp_lexer_peek_token (parser
->lexer
);
36841 if (token
->type
== CPP_NAME
|| token
->type
== CPP_KEYWORD
)
36843 token
= cp_lexer_consume_token (parser
->lexer
);
36845 attr_name
= (token
->type
== CPP_KEYWORD
36846 /* For keywords, use the canonical spelling,
36847 not the parsed identifier. */
36848 ? ridpointers
[(int) token
->keyword
]
36850 attr
= build_tree_list (attr_name
, NULL_TREE
);
36853 cp_parser_error (parser
, "expected identifier");
36855 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
36857 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
36861 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36863 transaction-statement:
36864 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36866 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36870 cp_parser_transaction (cp_parser
*parser
, cp_token
*token
)
36872 unsigned char old_in
= parser
->in_transaction
;
36873 unsigned char this_in
= 1, new_in
;
36874 enum rid keyword
= token
->keyword
;
36875 tree stmt
, attrs
, noex
;
36877 cp_lexer_consume_token (parser
->lexer
);
36879 if (keyword
== RID_TRANSACTION_RELAXED
36880 || keyword
== RID_SYNCHRONIZED
)
36881 this_in
|= TM_STMT_ATTR_RELAXED
;
36884 attrs
= cp_parser_txn_attribute_opt (parser
);
36886 this_in
|= parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
);
36889 /* Parse a noexcept specification. */
36890 if (keyword
== RID_ATOMIC_NOEXCEPT
)
36891 noex
= boolean_true_node
;
36892 else if (keyword
== RID_ATOMIC_CANCEL
)
36894 /* cancel-and-throw is unimplemented. */
36895 sorry ("atomic_cancel");
36899 noex
= cp_parser_noexcept_specification_opt (parser
, true, NULL
, true);
36901 /* Keep track if we're in the lexical scope of an outer transaction. */
36902 new_in
= this_in
| (old_in
& TM_STMT_ATTR_OUTER
);
36904 stmt
= begin_transaction_stmt (token
->location
, NULL
, this_in
);
36906 parser
->in_transaction
= new_in
;
36907 cp_parser_compound_statement (parser
, NULL
, BCS_TRANSACTION
, false);
36908 parser
->in_transaction
= old_in
;
36910 finish_transaction_stmt (stmt
, NULL
, this_in
, noex
);
36915 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36917 transaction-expression:
36918 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36919 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36923 cp_parser_transaction_expression (cp_parser
*parser
, enum rid keyword
)
36925 unsigned char old_in
= parser
->in_transaction
;
36926 unsigned char this_in
= 1;
36930 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
36932 gcc_assert (keyword
== RID_TRANSACTION_ATOMIC
36933 || keyword
== RID_TRANSACTION_RELAXED
);
36937 keyword
== RID_TRANSACTION_RELAXED
36938 ? G_("%<__transaction_relaxed%> without transactional memory "
36940 : G_("%<__transaction_atomic%> without transactional memory "
36941 "support enabled"));
36943 token
= cp_parser_require_keyword (parser
, keyword
,
36944 (keyword
== RID_TRANSACTION_ATOMIC
? RT_TRANSACTION_ATOMIC
36945 : RT_TRANSACTION_RELAXED
));
36946 gcc_assert (token
!= NULL
);
36948 if (keyword
== RID_TRANSACTION_RELAXED
)
36949 this_in
|= TM_STMT_ATTR_RELAXED
;
36951 /* Set this early. This might mean that we allow transaction_cancel in
36952 an expression that we find out later actually has to be a constexpr.
36953 However, we expect that cxx_constant_value will be able to deal with
36954 this; also, if the noexcept has no constexpr, then what we parse next
36955 really is a transaction's body. */
36956 parser
->in_transaction
= this_in
;
36958 /* Parse a noexcept specification. */
36959 noex
= cp_parser_noexcept_specification_opt (parser
, false, &noex_expr
,
36962 if (!noex
|| !noex_expr
36963 || cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
36965 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
36967 expr
= cp_parser_expression (parser
);
36968 expr
= finish_parenthesized_expr (expr
);
36970 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
36974 /* The only expression that is available got parsed for the noexcept
36975 already. noexcept is true then. */
36977 noex
= boolean_true_node
;
36980 expr
= build_transaction_expr (token
->location
, expr
, this_in
, noex
);
36981 parser
->in_transaction
= old_in
;
36983 if (cp_parser_non_integral_constant_expression (parser
, NIC_TRANSACTION
))
36984 return error_mark_node
;
36986 return (flag_tm
? expr
: error_mark_node
);
36989 /* Parse a function-transaction-block.
36991 function-transaction-block:
36992 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
36994 __transaction_atomic txn-attribute[opt] function-try-block
36995 __transaction_relaxed ctor-initializer[opt] function-body
36996 __transaction_relaxed function-try-block
37000 cp_parser_function_transaction (cp_parser
*parser
, enum rid keyword
)
37002 unsigned char old_in
= parser
->in_transaction
;
37003 unsigned char new_in
= 1;
37004 tree compound_stmt
, stmt
, attrs
;
37005 bool ctor_initializer_p
;
37008 gcc_assert (keyword
== RID_TRANSACTION_ATOMIC
37009 || keyword
== RID_TRANSACTION_RELAXED
);
37010 token
= cp_parser_require_keyword (parser
, keyword
,
37011 (keyword
== RID_TRANSACTION_ATOMIC
? RT_TRANSACTION_ATOMIC
37012 : RT_TRANSACTION_RELAXED
));
37013 gcc_assert (token
!= NULL
);
37015 if (keyword
== RID_TRANSACTION_RELAXED
)
37016 new_in
|= TM_STMT_ATTR_RELAXED
;
37019 attrs
= cp_parser_txn_attribute_opt (parser
);
37021 new_in
|= parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
);
37024 stmt
= begin_transaction_stmt (token
->location
, &compound_stmt
, new_in
);
37026 parser
->in_transaction
= new_in
;
37028 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
37029 ctor_initializer_p
= cp_parser_function_try_block (parser
);
37031 ctor_initializer_p
= cp_parser_ctor_initializer_opt_and_function_body
37032 (parser
, /*in_function_try_block=*/false);
37034 parser
->in_transaction
= old_in
;
37036 finish_transaction_stmt (stmt
, compound_stmt
, new_in
, NULL_TREE
);
37038 return ctor_initializer_p
;
37041 /* Parse a __transaction_cancel statement.
37044 __transaction_cancel txn-attribute[opt] ;
37045 __transaction_cancel txn-attribute[opt] throw-expression ;
37047 ??? Cancel and throw is not yet implemented. */
37050 cp_parser_transaction_cancel (cp_parser
*parser
)
37053 bool is_outer
= false;
37056 token
= cp_parser_require_keyword (parser
, RID_TRANSACTION_CANCEL
,
37057 RT_TRANSACTION_CANCEL
);
37058 gcc_assert (token
!= NULL
);
37060 attrs
= cp_parser_txn_attribute_opt (parser
);
37062 is_outer
= (parse_tm_stmt_attr (attrs
, TM_STMT_ATTR_OUTER
) != 0);
37064 /* ??? Parse cancel-and-throw here. */
37066 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
37070 error_at (token
->location
, "%<__transaction_cancel%> without "
37071 "transactional memory support enabled");
37072 return error_mark_node
;
37074 else if (parser
->in_transaction
& TM_STMT_ATTR_RELAXED
)
37076 error_at (token
->location
, "%<__transaction_cancel%> within a "
37077 "%<__transaction_relaxed%>");
37078 return error_mark_node
;
37082 if ((parser
->in_transaction
& TM_STMT_ATTR_OUTER
) == 0
37083 && !is_tm_may_cancel_outer (current_function_decl
))
37085 error_at (token
->location
, "outer %<__transaction_cancel%> not "
37086 "within outer %<__transaction_atomic%>");
37087 error_at (token
->location
,
37088 " or a %<transaction_may_cancel_outer%> function");
37089 return error_mark_node
;
37092 else if (parser
->in_transaction
== 0)
37094 error_at (token
->location
, "%<__transaction_cancel%> not within "
37095 "%<__transaction_atomic%>");
37096 return error_mark_node
;
37099 stmt
= build_tm_abort_call (token
->location
, is_outer
);
37107 static GTY (()) cp_parser
*the_parser
;
37110 /* Special handling for the first token or line in the file. The first
37111 thing in the file might be #pragma GCC pch_preprocess, which loads a
37112 PCH file, which is a GC collection point. So we need to handle this
37113 first pragma without benefit of an existing lexer structure.
37115 Always returns one token to the caller in *FIRST_TOKEN. This is
37116 either the true first token of the file, or the first token after
37117 the initial pragma. */
37120 cp_parser_initial_pragma (cp_token
*first_token
)
37124 cp_lexer_get_preprocessor_token (NULL
, first_token
);
37125 if (cp_parser_pragma_kind (first_token
) != PRAGMA_GCC_PCH_PREPROCESS
)
37128 cp_lexer_get_preprocessor_token (NULL
, first_token
);
37129 if (first_token
->type
== CPP_STRING
)
37131 name
= first_token
->u
.value
;
37133 cp_lexer_get_preprocessor_token (NULL
, first_token
);
37134 if (first_token
->type
!= CPP_PRAGMA_EOL
)
37135 error_at (first_token
->location
,
37136 "junk at end of %<#pragma GCC pch_preprocess%>");
37139 error_at (first_token
->location
, "expected string literal");
37141 /* Skip to the end of the pragma. */
37142 while (first_token
->type
!= CPP_PRAGMA_EOL
&& first_token
->type
!= CPP_EOF
)
37143 cp_lexer_get_preprocessor_token (NULL
, first_token
);
37145 /* Now actually load the PCH file. */
37147 c_common_pch_pragma (parse_in
, TREE_STRING_POINTER (name
));
37149 /* Read one more token to return to our caller. We have to do this
37150 after reading the PCH file in, since its pointers have to be
37152 cp_lexer_get_preprocessor_token (NULL
, first_token
);
37155 /* Parses the grainsize pragma for the _Cilk_for statement.
37157 #pragma cilk grainsize = <VALUE>. */
37160 cp_parser_cilk_grainsize (cp_parser
*parser
, cp_token
*pragma_tok
, bool *if_p
)
37162 if (cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
37164 tree exp
= cp_parser_binary_expression (parser
, false, false,
37165 PREC_NOT_OPERATOR
, NULL
);
37166 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37167 if (!exp
|| exp
== error_mark_node
)
37169 error_at (pragma_tok
->location
, "invalid grainsize for _Cilk_for");
37173 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37174 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CILK_FOR
))
37175 cp_parser_cilk_for (parser
, exp
, if_p
);
37177 warning_at (cp_lexer_peek_token (parser
->lexer
)->location
, 0,
37178 "%<#pragma cilk grainsize%> is not followed by "
37182 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37185 /* Normal parsing of a pragma token. Here we can (and must) use the
37189 cp_parser_pragma (cp_parser
*parser
, enum pragma_context context
, bool *if_p
)
37191 cp_token
*pragma_tok
;
37196 pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
37197 gcc_assert (pragma_tok
->type
== CPP_PRAGMA
);
37198 parser
->lexer
->in_pragma
= true;
37200 id
= cp_parser_pragma_kind (pragma_tok
);
37201 if (id
!= PRAGMA_OMP_DECLARE_REDUCTION
&& id
!= PRAGMA_OACC_ROUTINE
)
37202 cp_ensure_no_omp_declare_simd (parser
);
37205 case PRAGMA_GCC_PCH_PREPROCESS
:
37206 error_at (pragma_tok
->location
,
37207 "%<#pragma GCC pch_preprocess%> must be first");
37210 case PRAGMA_OMP_BARRIER
:
37213 case pragma_compound
:
37214 cp_parser_omp_barrier (parser
, pragma_tok
);
37217 error_at (pragma_tok
->location
, "%<#pragma omp barrier%> may only be "
37218 "used in compound statements");
37225 case PRAGMA_OMP_FLUSH
:
37228 case pragma_compound
:
37229 cp_parser_omp_flush (parser
, pragma_tok
);
37232 error_at (pragma_tok
->location
, "%<#pragma omp flush%> may only be "
37233 "used in compound statements");
37240 case PRAGMA_OMP_TASKWAIT
:
37243 case pragma_compound
:
37244 cp_parser_omp_taskwait (parser
, pragma_tok
);
37247 error_at (pragma_tok
->location
,
37248 "%<#pragma omp taskwait%> may only be "
37249 "used in compound statements");
37256 case PRAGMA_OMP_TASKYIELD
:
37259 case pragma_compound
:
37260 cp_parser_omp_taskyield (parser
, pragma_tok
);
37263 error_at (pragma_tok
->location
,
37264 "%<#pragma omp taskyield%> may only be "
37265 "used in compound statements");
37272 case PRAGMA_OMP_CANCEL
:
37275 case pragma_compound
:
37276 cp_parser_omp_cancel (parser
, pragma_tok
);
37279 error_at (pragma_tok
->location
,
37280 "%<#pragma omp cancel%> may only be "
37281 "used in compound statements");
37288 case PRAGMA_OMP_CANCELLATION_POINT
:
37291 case pragma_compound
:
37292 cp_parser_omp_cancellation_point (parser
, pragma_tok
);
37295 error_at (pragma_tok
->location
,
37296 "%<#pragma omp cancellation point%> may only be "
37297 "used in compound statements");
37304 case PRAGMA_OMP_THREADPRIVATE
:
37305 cp_parser_omp_threadprivate (parser
, pragma_tok
);
37308 case PRAGMA_OMP_DECLARE_REDUCTION
:
37309 cp_parser_omp_declare (parser
, pragma_tok
, context
);
37312 case PRAGMA_OACC_DECLARE
:
37313 cp_parser_oacc_declare (parser
, pragma_tok
);
37316 case PRAGMA_OACC_ROUTINE
:
37317 cp_parser_oacc_routine (parser
, pragma_tok
, context
);
37320 case PRAGMA_OACC_ATOMIC
:
37321 case PRAGMA_OACC_CACHE
:
37322 case PRAGMA_OACC_DATA
:
37323 case PRAGMA_OACC_ENTER_DATA
:
37324 case PRAGMA_OACC_EXIT_DATA
:
37325 case PRAGMA_OACC_HOST_DATA
:
37326 case PRAGMA_OACC_KERNELS
:
37327 case PRAGMA_OACC_PARALLEL
:
37328 case PRAGMA_OACC_LOOP
:
37329 case PRAGMA_OACC_UPDATE
:
37330 case PRAGMA_OACC_WAIT
:
37331 case PRAGMA_OMP_ATOMIC
:
37332 case PRAGMA_OMP_CRITICAL
:
37333 case PRAGMA_OMP_DISTRIBUTE
:
37334 case PRAGMA_OMP_FOR
:
37335 case PRAGMA_OMP_MASTER
:
37336 case PRAGMA_OMP_PARALLEL
:
37337 case PRAGMA_OMP_SECTIONS
:
37338 case PRAGMA_OMP_SIMD
:
37339 case PRAGMA_OMP_SINGLE
:
37340 case PRAGMA_OMP_TASK
:
37341 case PRAGMA_OMP_TASKGROUP
:
37342 case PRAGMA_OMP_TASKLOOP
:
37343 case PRAGMA_OMP_TEAMS
:
37344 if (context
!= pragma_stmt
&& context
!= pragma_compound
)
37346 stmt
= push_omp_privatization_clauses (false);
37347 cp_parser_omp_construct (parser
, pragma_tok
, if_p
);
37348 pop_omp_privatization_clauses (stmt
);
37351 case PRAGMA_OMP_ORDERED
:
37352 stmt
= push_omp_privatization_clauses (false);
37353 ret
= cp_parser_omp_ordered (parser
, pragma_tok
, context
, if_p
);
37354 pop_omp_privatization_clauses (stmt
);
37357 case PRAGMA_OMP_TARGET
:
37358 stmt
= push_omp_privatization_clauses (false);
37359 ret
= cp_parser_omp_target (parser
, pragma_tok
, context
, if_p
);
37360 pop_omp_privatization_clauses (stmt
);
37363 case PRAGMA_OMP_END_DECLARE_TARGET
:
37364 cp_parser_omp_end_declare_target (parser
, pragma_tok
);
37367 case PRAGMA_OMP_SECTION
:
37368 error_at (pragma_tok
->location
,
37369 "%<#pragma omp section%> may only be used in "
37370 "%<#pragma omp sections%> construct");
37375 if (context
== pragma_external
)
37377 error_at (pragma_tok
->location
,
37378 "%<#pragma GCC ivdep%> must be inside a function");
37381 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37383 tok
= cp_lexer_peek_token (the_parser
->lexer
);
37384 if (tok
->type
!= CPP_KEYWORD
37385 || (tok
->keyword
!= RID_FOR
&& tok
->keyword
!= RID_WHILE
37386 && tok
->keyword
!= RID_DO
))
37388 cp_parser_error (parser
, "for, while or do statement expected");
37391 cp_parser_iteration_statement (parser
, if_p
, true);
37395 case PRAGMA_CILK_SIMD
:
37396 if (context
== pragma_external
)
37398 error_at (pragma_tok
->location
,
37399 "%<#pragma simd%> must be inside a function");
37402 stmt
= push_omp_privatization_clauses (false);
37403 cp_parser_cilk_simd (parser
, pragma_tok
, if_p
);
37404 pop_omp_privatization_clauses (stmt
);
37407 case PRAGMA_CILK_GRAINSIZE
:
37408 if (context
== pragma_external
)
37410 error_at (pragma_tok
->location
,
37411 "%<#pragma cilk grainsize%> must be inside a function");
37415 /* Ignore the pragma if Cilk Plus is not enabled. */
37418 cp_parser_cilk_grainsize (parser
, pragma_tok
, if_p
);
37423 error_at (pragma_tok
->location
, "-fcilkplus must be enabled to use "
37424 "%<#pragma cilk grainsize%>");
37429 gcc_assert (id
>= PRAGMA_FIRST_EXTERNAL
);
37430 c_invoke_pragma_handler (id
);
37434 cp_parser_error (parser
, "expected declaration specifiers");
37438 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
37442 /* The interface the pragma parsers have to the lexer. */
37445 pragma_lex (tree
*value
, location_t
*loc
)
37447 cp_token
*tok
= cp_lexer_peek_token (the_parser
->lexer
);
37448 enum cpp_ttype ret
= tok
->type
;
37450 *value
= tok
->u
.value
;
37452 *loc
= tok
->location
;
37454 if (ret
== CPP_PRAGMA_EOL
|| ret
== CPP_EOF
)
37456 else if (ret
== CPP_STRING
)
37457 *value
= cp_parser_string_literal (the_parser
, false, false);
37460 if (ret
== CPP_KEYWORD
)
37462 cp_lexer_consume_token (the_parser
->lexer
);
37469 /* External interface. */
37471 /* Parse one entire translation unit. */
37474 c_parse_file (void)
37476 static bool already_called
= false;
37478 if (already_called
)
37479 fatal_error (input_location
,
37480 "inter-module optimizations not implemented for C++");
37481 already_called
= true;
37483 the_parser
= cp_parser_new ();
37484 push_deferring_access_checks (flag_access_control
37485 ? dk_no_deferred
: dk_no_check
);
37486 cp_parser_translation_unit (the_parser
);
37490 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37491 vectorlength clause:
37493 vectorlength ( constant-expression ) */
37496 cp_parser_cilk_simd_vectorlength (cp_parser
*parser
, tree clauses
,
37499 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
37501 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37502 safelen clause. Thus, vectorlength is represented as OMP 4.0
37503 safelen. For SIMD-enabled function it is represented by OMP 4.0
37506 check_no_duplicate_clause (clauses
, OMP_CLAUSE_SAFELEN
, "vectorlength",
37509 check_no_duplicate_clause (clauses
, OMP_CLAUSE_SIMDLEN
, "vectorlength",
37512 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
37513 return error_mark_node
;
37515 expr
= cp_parser_constant_expression (parser
);
37516 expr
= maybe_constant_value (expr
);
37518 /* If expr == error_mark_node, then don't emit any errors nor
37519 create a clause. if any of the above functions returns
37520 error mark node then they would have emitted an error message. */
37521 if (expr
== error_mark_node
)
37523 else if (!TREE_TYPE (expr
)
37524 || !TREE_CONSTANT (expr
)
37525 || !INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
37526 error_at (loc
, "vectorlength must be an integer constant");
37527 else if (TREE_CONSTANT (expr
)
37528 && exact_log2 (TREE_INT_CST_LOW (expr
)) == -1)
37529 error_at (loc
, "vectorlength must be a power of 2");
37535 c
= build_omp_clause (loc
, OMP_CLAUSE_SAFELEN
);
37536 OMP_CLAUSE_SAFELEN_EXPR (c
) = expr
;
37537 OMP_CLAUSE_CHAIN (c
) = clauses
;
37542 c
= build_omp_clause (loc
, OMP_CLAUSE_SIMDLEN
);
37543 OMP_CLAUSE_SIMDLEN_EXPR (c
) = expr
;
37544 OMP_CLAUSE_CHAIN (c
) = clauses
;
37549 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
37550 return error_mark_node
;
37554 /* Handles the Cilk Plus #pragma simd linear clause.
37556 linear ( simd-linear-variable-list )
37558 simd-linear-variable-list:
37559 simd-linear-variable
37560 simd-linear-variable-list , simd-linear-variable
37562 simd-linear-variable:
37564 id-expression : simd-linear-step
37567 conditional-expression */
37570 cp_parser_cilk_simd_linear (cp_parser
*parser
, tree clauses
)
37572 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
37574 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
37576 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
37578 cp_parser_error (parser
, "expected identifier");
37579 cp_parser_skip_to_closing_parenthesis (parser
, false, false, true);
37580 return error_mark_node
;
37583 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
37584 parser
->colon_corrects_to_scope_p
= false;
37587 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
37588 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
37590 cp_parser_error (parser
, "expected variable-name");
37591 clauses
= error_mark_node
;
37595 tree var_name
= cp_parser_id_expression (parser
, false, true, NULL
,
37597 tree decl
= cp_parser_lookup_name_simple (parser
, var_name
,
37599 if (decl
== error_mark_node
)
37601 cp_parser_name_lookup_error (parser
, var_name
, decl
, NLE_NULL
,
37603 clauses
= error_mark_node
;
37607 tree e
= NULL_TREE
;
37608 tree step_size
= integer_one_node
;
37610 /* If present, parse the linear step. Otherwise, assume the default
37612 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_COLON
)
37614 cp_lexer_consume_token (parser
->lexer
);
37616 e
= cp_parser_assignment_expression (parser
);
37617 e
= maybe_constant_value (e
);
37619 if (e
== error_mark_node
)
37621 /* If an error has occurred, then the whole pragma is
37622 considered ill-formed. Thus, no reason to keep
37624 clauses
= error_mark_node
;
37627 else if (type_dependent_expression_p (e
)
37628 || value_dependent_expression_p (e
)
37630 && INTEGRAL_TYPE_P (TREE_TYPE (e
))
37631 && (TREE_CONSTANT (e
)
37635 cp_parser_error (parser
,
37636 "step size must be an integer constant "
37637 "expression or an integer variable");
37640 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37641 tree l
= build_omp_clause (loc
, OMP_CLAUSE_LINEAR
);
37642 OMP_CLAUSE_DECL (l
) = decl
;
37643 OMP_CLAUSE_LINEAR_STEP (l
) = step_size
;
37644 OMP_CLAUSE_CHAIN (l
) = clauses
;
37647 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
37648 cp_lexer_consume_token (parser
->lexer
);
37649 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
37653 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
37654 "expected %<,%> or %<)%> after %qE", decl
);
37655 clauses
= error_mark_node
;
37659 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
37660 cp_parser_skip_to_closing_parenthesis (parser
, false, false, true);
37664 /* Returns the name of the next clause. If the clause is not
37665 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37666 token is not consumed. Otherwise, the appropriate enum from the
37667 pragma_simd_clause is returned and the token is consumed. */
37669 static pragma_omp_clause
37670 cp_parser_cilk_simd_clause_name (cp_parser
*parser
)
37672 pragma_omp_clause clause_type
;
37673 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
37675 if (token
->keyword
== RID_PRIVATE
)
37676 clause_type
= PRAGMA_CILK_CLAUSE_PRIVATE
;
37677 else if (!token
->u
.value
|| token
->type
!= CPP_NAME
)
37678 return PRAGMA_CILK_CLAUSE_NONE
;
37679 else if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "vectorlength"))
37680 clause_type
= PRAGMA_CILK_CLAUSE_VECTORLENGTH
;
37681 else if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "linear"))
37682 clause_type
= PRAGMA_CILK_CLAUSE_LINEAR
;
37683 else if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "firstprivate"))
37684 clause_type
= PRAGMA_CILK_CLAUSE_FIRSTPRIVATE
;
37685 else if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "lastprivate"))
37686 clause_type
= PRAGMA_CILK_CLAUSE_LASTPRIVATE
;
37687 else if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "reduction"))
37688 clause_type
= PRAGMA_CILK_CLAUSE_REDUCTION
;
37690 return PRAGMA_CILK_CLAUSE_NONE
;
37692 cp_lexer_consume_token (parser
->lexer
);
37693 return clause_type
;
37696 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37699 cp_parser_cilk_simd_all_clauses (cp_parser
*parser
, cp_token
*pragma_token
)
37701 tree clauses
= NULL_TREE
;
37703 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
)
37704 && clauses
!= error_mark_node
)
37706 pragma_omp_clause c_kind
;
37707 c_kind
= cp_parser_cilk_simd_clause_name (parser
);
37708 if (c_kind
== PRAGMA_CILK_CLAUSE_VECTORLENGTH
)
37709 clauses
= cp_parser_cilk_simd_vectorlength (parser
, clauses
, false);
37710 else if (c_kind
== PRAGMA_CILK_CLAUSE_LINEAR
)
37711 clauses
= cp_parser_cilk_simd_linear (parser
, clauses
);
37712 else if (c_kind
== PRAGMA_CILK_CLAUSE_PRIVATE
)
37713 /* Use the OpenMP 4.0 equivalent function. */
37714 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
, clauses
);
37715 else if (c_kind
== PRAGMA_CILK_CLAUSE_FIRSTPRIVATE
)
37716 /* Use the OpenMP 4.0 equivalent function. */
37717 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
37719 else if (c_kind
== PRAGMA_CILK_CLAUSE_LASTPRIVATE
)
37720 /* Use the OMP 4.0 equivalent function. */
37721 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
37723 else if (c_kind
== PRAGMA_CILK_CLAUSE_REDUCTION
)
37724 /* Use the OMP 4.0 equivalent function. */
37725 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
37728 clauses
= error_mark_node
;
37729 cp_parser_error (parser
, "expected %<#pragma simd%> clause");
37734 cp_parser_skip_to_pragma_eol (parser
, pragma_token
);
37736 if (clauses
== error_mark_node
)
37737 return error_mark_node
;
37739 return finish_omp_clauses (clauses
, C_ORT_CILK
);
37742 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37745 cp_parser_cilk_simd (cp_parser
*parser
, cp_token
*pragma_token
, bool *if_p
)
37747 tree clauses
= cp_parser_cilk_simd_all_clauses (parser
, pragma_token
);
37749 if (clauses
== error_mark_node
)
37752 if (cp_lexer_next_token_is_not_keyword (parser
->lexer
, RID_FOR
))
37754 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
37755 "for statement expected");
37759 tree sb
= begin_omp_structured_block ();
37760 int save
= cp_parser_begin_omp_structured_block (parser
);
37761 tree ret
= cp_parser_omp_for_loop (parser
, CILK_SIMD
, clauses
, NULL
, if_p
);
37763 cpp_validate_cilk_plus_loop (OMP_FOR_BODY (ret
));
37764 cp_parser_end_omp_structured_block (parser
, save
);
37765 add_stmt (finish_omp_structured_block (sb
));
37768 /* Main entry-point for parsing Cilk Plus _Cilk_for
37769 loops. The return value is error_mark_node
37770 when errors happen and CILK_FOR tree on success. */
37773 cp_parser_cilk_for (cp_parser
*parser
, tree grain
, bool *if_p
)
37775 if (cp_lexer_next_token_is_not_keyword (parser
->lexer
, RID_CILK_FOR
))
37776 gcc_unreachable ();
37778 tree sb
= begin_omp_structured_block ();
37779 int save
= cp_parser_begin_omp_structured_block (parser
);
37781 tree clauses
= build_omp_clause (EXPR_LOCATION (grain
), OMP_CLAUSE_SCHEDULE
);
37782 OMP_CLAUSE_SCHEDULE_KIND (clauses
) = OMP_CLAUSE_SCHEDULE_CILKFOR
;
37783 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clauses
) = grain
;
37784 clauses
= finish_omp_clauses (clauses
, C_ORT_CILK
);
37786 tree ret
= cp_parser_omp_for_loop (parser
, CILK_FOR
, clauses
, NULL
, if_p
);
37788 cpp_validate_cilk_plus_loop (ret
);
37790 ret
= error_mark_node
;
37792 cp_parser_end_omp_structured_block (parser
, save
);
37793 add_stmt (finish_omp_structured_block (sb
));
37797 /* Create an identifier for a generic parameter type (a synthesized
37798 template parameter implied by `auto' or a concept identifier). */
37800 static GTY(()) int generic_parm_count
;
37802 make_generic_type_name ()
37805 sprintf (buf
, "auto:%d", ++generic_parm_count
);
37806 return get_identifier (buf
);
37809 /* Predicate that behaves as is_auto_or_concept but matches the parent
37810 node of the generic type rather than the generic type itself. This
37811 allows for type transformation in add_implicit_template_parms. */
37814 tree_type_is_auto_or_concept (const_tree t
)
37816 return TREE_TYPE (t
) && is_auto_or_concept (TREE_TYPE (t
));
37819 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37820 (creating a new template parameter list if necessary). Returns the newly
37821 created template type parm. */
37824 synthesize_implicit_template_parm (cp_parser
*parser
, tree constr
)
37826 gcc_assert (current_binding_level
->kind
== sk_function_parms
);
37828 /* Before committing to modifying any scope, if we're in an
37829 implicit template scope, and we're trying to synthesize a
37830 constrained parameter, try to find a previous parameter with
37831 the same name. This is the same-type rule for abbreviated
37832 function templates. */
37833 if (parser
->implicit_template_scope
&& constr
)
37835 tree t
= parser
->implicit_template_parms
;
37838 if (equivalent_placeholder_constraints (TREE_TYPE (t
), constr
))
37840 tree d
= TREE_VALUE (t
);
37841 if (TREE_CODE (d
) == PARM_DECL
)
37842 /* Return the TEMPLATE_PARM_INDEX. */
37843 d
= DECL_INITIAL (d
);
37846 t
= TREE_CHAIN (t
);
37850 /* We are either continuing a function template that already contains implicit
37851 template parameters, creating a new fully-implicit function template, or
37852 extending an existing explicit function template with implicit template
37855 cp_binding_level
*const entry_scope
= current_binding_level
;
37857 bool become_template
= false;
37858 cp_binding_level
*parent_scope
= 0;
37860 if (parser
->implicit_template_scope
)
37862 gcc_assert (parser
->implicit_template_parms
);
37864 current_binding_level
= parser
->implicit_template_scope
;
37868 /* Roll back to the existing template parameter scope (in the case of
37869 extending an explicit function template) or introduce a new template
37870 parameter scope ahead of the function parameter scope (or class scope
37871 in the case of out-of-line member definitions). The function scope is
37872 added back after template parameter synthesis below. */
37874 cp_binding_level
*scope
= entry_scope
;
37876 while (scope
->kind
== sk_function_parms
)
37878 parent_scope
= scope
;
37879 scope
= scope
->level_chain
;
37881 if (current_class_type
&& !LAMBDA_TYPE_P (current_class_type
))
37883 /* If not defining a class, then any class scope is a scope level in
37884 an out-of-line member definition. In this case simply wind back
37885 beyond the first such scope to inject the template parameter list.
37886 Otherwise wind back to the class being defined. The latter can
37887 occur in class member friend declarations such as:
37893 friend void A::foo (auto);
37896 The template parameter list synthesized for the friend declaration
37897 must be injected in the scope of 'B'. This can also occur in
37898 erroneous cases such as:
37904 void B::foo (auto) {}
37907 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37908 but, nevertheless, the template parameter list synthesized for the
37909 declarator should be injected into the scope of 'A' as if the
37910 ill-formed template was specified explicitly. */
37912 while (scope
->kind
== sk_class
&& !scope
->defining_class_p
)
37914 parent_scope
= scope
;
37915 scope
= scope
->level_chain
;
37919 current_binding_level
= scope
;
37921 if (scope
->kind
!= sk_template_parms
37922 || !function_being_declared_is_template_p (parser
))
37924 /* Introduce a new template parameter list for implicit template
37927 become_template
= true;
37929 parser
->implicit_template_scope
37930 = begin_scope (sk_template_parms
, NULL
);
37932 ++processing_template_decl
;
37934 parser
->fully_implicit_function_template_p
= true;
37935 ++parser
->num_template_parameter_lists
;
37939 /* Synthesize implicit template parameters at the end of the explicit
37940 template parameter list. */
37942 gcc_assert (current_template_parms
);
37944 parser
->implicit_template_scope
= scope
;
37946 tree v
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
37947 parser
->implicit_template_parms
37948 = TREE_VEC_ELT (v
, TREE_VEC_LENGTH (v
) - 1);
37952 /* Synthesize a new template parameter and track the current template
37953 parameter chain with implicit_template_parms. */
37955 tree proto
= constr
? DECL_INITIAL (constr
) : NULL_TREE
;
37956 tree synth_id
= make_generic_type_name ();
37957 tree synth_tmpl_parm
;
37958 bool non_type
= false;
37960 if (proto
== NULL_TREE
|| TREE_CODE (proto
) == TYPE_DECL
)
37962 = finish_template_type_parm (class_type_node
, synth_id
);
37963 else if (TREE_CODE (proto
) == TEMPLATE_DECL
)
37965 = finish_constrained_template_template_parm (proto
, synth_id
);
37968 synth_tmpl_parm
= copy_decl (proto
);
37969 DECL_NAME (synth_tmpl_parm
) = synth_id
;
37973 // Attach the constraint to the parm before processing.
37974 tree node
= build_tree_list (NULL_TREE
, synth_tmpl_parm
);
37975 TREE_TYPE (node
) = constr
;
37977 = process_template_parm (parser
->implicit_template_parms
,
37980 /*non_type=*/non_type
,
37981 /*param_pack=*/false);
37983 // Chain the new parameter to the list of implicit parameters.
37984 if (parser
->implicit_template_parms
)
37985 parser
->implicit_template_parms
37986 = TREE_CHAIN (parser
->implicit_template_parms
);
37988 parser
->implicit_template_parms
= new_parm
;
37990 tree new_decl
= getdecls ();
37992 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
37993 new_decl
= DECL_INITIAL (new_decl
);
37995 /* If creating a fully implicit function template, start the new implicit
37996 template parameter list with this synthesized type, otherwise grow the
37997 current template parameter list. */
37999 if (become_template
)
38001 parent_scope
->level_chain
= current_binding_level
;
38003 tree new_parms
= make_tree_vec (1);
38004 TREE_VEC_ELT (new_parms
, 0) = parser
->implicit_template_parms
;
38005 current_template_parms
= tree_cons (size_int (processing_template_decl
),
38006 new_parms
, current_template_parms
);
38010 tree
& new_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
38011 int new_parm_idx
= TREE_VEC_LENGTH (new_parms
);
38012 new_parms
= grow_tree_vec (new_parms
, new_parm_idx
+ 1);
38013 TREE_VEC_ELT (new_parms
, new_parm_idx
) = parser
->implicit_template_parms
;
38016 // If the new parameter was constrained, we need to add that to the
38017 // constraints in the template parameter list.
38018 if (tree req
= TEMPLATE_PARM_CONSTRAINTS (tree_last (new_parm
)))
38020 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
38021 reqs
= conjoin_constraints (reqs
, req
);
38022 TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
) = reqs
;
38025 current_binding_level
= entry_scope
;
38030 /* Finish the declaration of a fully implicit function template. Such a
38031 template has no explicit template parameter list so has not been through the
38032 normal template head and tail processing. synthesize_implicit_template_parm
38033 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
38034 provided if the declaration is a class member such that its template
38035 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
38036 form is returned. Otherwise NULL_TREE is returned. */
38039 finish_fully_implicit_template (cp_parser
*parser
, tree member_decl_opt
)
38041 gcc_assert (parser
->fully_implicit_function_template_p
);
38043 if (member_decl_opt
&& member_decl_opt
!= error_mark_node
38044 && DECL_VIRTUAL_P (member_decl_opt
))
38046 error_at (DECL_SOURCE_LOCATION (member_decl_opt
),
38047 "implicit templates may not be %<virtual%>");
38048 DECL_VIRTUAL_P (member_decl_opt
) = false;
38051 if (member_decl_opt
)
38052 member_decl_opt
= finish_member_template_decl (member_decl_opt
);
38053 end_template_decl ();
38055 parser
->fully_implicit_function_template_p
= false;
38056 --parser
->num_template_parameter_lists
;
38058 return member_decl_opt
;
38061 #include "gt-cp-parser.h"