1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998-2019 Free Software Foundation, Inc.
7 Written by Mark Mitchell (mmitchell@usa.net) based on code found
8 formerly in parse.y and pt.c.
10 This file is part of GCC.
12 GCC is free software; you can redistribute it and/or modify it
13 under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 3, or (at your option)
17 GCC is distributed in the hope that it will be useful, but
18 WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 General Public License for more details.
22 You should have received a copy of the GNU General Public License
23 along with GCC; see the file COPYING3. If not see
24 <http://www.gnu.org/licenses/>. */
28 #include "coretypes.h"
32 #include "stringpool.h"
36 #include "stor-layout.h"
37 #include "c-family/c-objc.h"
38 #include "tree-inline.h"
40 #include "tree-iterator.h"
41 #include "omp-general.h"
43 #include "stringpool.h"
45 #include "gomp-constants.h"
49 /* There routines provide a modular interface to perform many parsing
50 operations. They may therefore be used during actual parsing, or
51 during template instantiation, which may be regarded as a
52 degenerate form of parsing. */
54 static tree
maybe_convert_cond (tree
);
55 static tree
finalize_nrv_r (tree
*, int *, void *);
56 static tree
capture_decltype (tree
);
58 /* Used for OpenMP non-static data member privatization. */
60 static hash_map
<tree
, tree
> *omp_private_member_map
;
61 static vec
<tree
> omp_private_member_vec
;
62 static bool omp_private_member_ignore_next
;
65 /* Deferred Access Checking Overview
66 ---------------------------------
68 Most C++ expressions and declarations require access checking
69 to be performed during parsing. However, in several cases,
70 this has to be treated differently.
72 For member declarations, access checking has to be deferred
73 until more information about the declaration is known. For
85 When we are parsing the function return type `A::X', we don't
86 really know if this is allowed until we parse the function name.
88 Furthermore, some contexts require that access checking is
89 never performed at all. These include class heads, and template
92 Typical use of access checking functions is described here:
94 1. When we enter a context that requires certain access checking
95 mode, the function `push_deferring_access_checks' is called with
96 DEFERRING argument specifying the desired mode. Access checking
97 may be performed immediately (dk_no_deferred), deferred
98 (dk_deferred), or not performed (dk_no_check).
100 2. When a declaration such as a type, or a variable, is encountered,
101 the function `perform_or_defer_access_check' is called. It
102 maintains a vector of all deferred checks.
104 3. The global `current_class_type' or `current_function_decl' is then
105 setup by the parser. `enforce_access' relies on these information
108 4. Upon exiting the context mentioned in step 1,
109 `perform_deferred_access_checks' is called to check all declaration
110 stored in the vector. `pop_deferring_access_checks' is then
111 called to restore the previous access checking mode.
113 In case of parsing error, we simply call `pop_deferring_access_checks'
114 without `perform_deferred_access_checks'. */
116 struct GTY(()) deferred_access
{
117 /* A vector representing name-lookups for which we have deferred
118 checking access controls. We cannot check the accessibility of
119 names used in a decl-specifier-seq until we know what is being
120 declared because code like:
127 A::B* A::f() { return 0; }
129 is valid, even though `A::B' is not generally accessible. */
130 vec
<deferred_access_check
, va_gc
> * GTY(()) deferred_access_checks
;
132 /* The current mode of access checks. */
133 enum deferring_kind deferring_access_checks_kind
;
137 /* Data for deferred access checking. */
138 static GTY(()) vec
<deferred_access
, va_gc
> *deferred_access_stack
;
139 static GTY(()) unsigned deferred_access_no_check
;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring
)
147 /* For context like template instantiation, access checking
148 disabling applies to all nested context. */
149 if (deferred_access_no_check
|| deferring
== dk_no_check
)
150 deferred_access_no_check
++;
153 deferred_access e
= {NULL
, deferring
};
154 vec_safe_push (deferred_access_stack
, e
);
158 /* Save the current deferred access states and start deferred access
159 checking, continuing the set of deferred checks in CHECKS. */
162 reopen_deferring_access_checks (vec
<deferred_access_check
, va_gc
> * checks
)
164 push_deferring_access_checks (dk_deferred
);
165 if (!deferred_access_no_check
)
166 deferred_access_stack
->last().deferred_access_checks
= checks
;
169 /* Resume deferring access checks again after we stopped doing
173 resume_deferring_access_checks (void)
175 if (!deferred_access_no_check
)
176 deferred_access_stack
->last().deferring_access_checks_kind
= dk_deferred
;
179 /* Stop deferring access checks. */
182 stop_deferring_access_checks (void)
184 if (!deferred_access_no_check
)
185 deferred_access_stack
->last().deferring_access_checks_kind
= dk_no_deferred
;
188 /* Discard the current deferred access checks and restore the
192 pop_deferring_access_checks (void)
194 if (deferred_access_no_check
)
195 deferred_access_no_check
--;
197 deferred_access_stack
->pop ();
200 /* Returns a TREE_LIST representing the deferred checks.
201 The TREE_PURPOSE of each node is the type through which the
202 access occurred; the TREE_VALUE is the declaration named.
205 vec
<deferred_access_check
, va_gc
> *
206 get_deferred_access_checks (void)
208 if (deferred_access_no_check
)
211 return (deferred_access_stack
->last().deferred_access_checks
);
214 /* Take current deferred checks and combine with the
215 previous states if we also defer checks previously.
216 Otherwise perform checks now. */
219 pop_to_parent_deferring_access_checks (void)
221 if (deferred_access_no_check
)
222 deferred_access_no_check
--;
225 vec
<deferred_access_check
, va_gc
> *checks
;
226 deferred_access
*ptr
;
228 checks
= (deferred_access_stack
->last ().deferred_access_checks
);
230 deferred_access_stack
->pop ();
231 ptr
= &deferred_access_stack
->last ();
232 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
235 perform_access_checks (checks
, tf_warning_or_error
);
239 /* Merge with parent. */
241 deferred_access_check
*chk
, *probe
;
243 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
245 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, j
, probe
)
247 if (probe
->binfo
== chk
->binfo
&&
248 probe
->decl
== chk
->decl
&&
249 probe
->diag_decl
== chk
->diag_decl
)
252 /* Insert into parent's checks. */
253 vec_safe_push (ptr
->deferred_access_checks
, *chk
);
260 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
261 is the BINFO indicating the qualifying scope used to access the
262 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
263 or we aren't in SFINAE context or all the checks succeed return TRUE,
267 perform_access_checks (vec
<deferred_access_check
, va_gc
> *checks
,
268 tsubst_flags_t complain
)
271 deferred_access_check
*chk
;
272 location_t loc
= input_location
;
278 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
280 input_location
= chk
->loc
;
281 ok
&= enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
, complain
);
284 input_location
= loc
;
285 return (complain
& tf_error
) ? true : ok
;
288 /* Perform the deferred access checks.
290 After performing the checks, we still have to keep the list
291 `deferred_access_stack->deferred_access_checks' since we may want
292 to check access for them again later in a different context.
299 A::X A::a, x; // No error for `A::a', error for `x'
301 We have to perform deferred access of `A::X', first with `A::a',
302 next with `x'. Return value like perform_access_checks above. */
305 perform_deferred_access_checks (tsubst_flags_t complain
)
307 return perform_access_checks (get_deferred_access_checks (), complain
);
310 /* Defer checking the accessibility of DECL, when looked up in
311 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
312 Return value like perform_access_checks above.
313 If non-NULL, report failures to AFI. */
316 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
,
317 tsubst_flags_t complain
,
318 access_failure_info
*afi
)
321 deferred_access
*ptr
;
322 deferred_access_check
*chk
;
325 /* Exit if we are in a context that no access checking is performed.
327 if (deferred_access_no_check
)
330 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
332 ptr
= &deferred_access_stack
->last ();
334 /* If we are not supposed to defer access checks, just check now. */
335 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
337 bool ok
= enforce_access (binfo
, decl
, diag_decl
, complain
, afi
);
338 return (complain
& tf_error
) ? true : ok
;
341 /* See if we are already going to perform this check. */
342 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, i
, chk
)
344 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
345 chk
->diag_decl
== diag_decl
)
350 /* If not, record the check. */
351 deferred_access_check new_access
= {binfo
, decl
, diag_decl
, input_location
};
352 vec_safe_push (ptr
->deferred_access_checks
, new_access
);
357 /* Returns nonzero if the current statement is a full expression,
358 i.e. temporaries created during that statement should be destroyed
359 at the end of the statement. */
362 stmts_are_full_exprs_p (void)
364 return current_stmt_tree ()->stmts_are_full_exprs_p
;
367 /* T is a statement. Add it to the statement-tree. This is the C++
368 version. The C/ObjC frontends have a slightly different version of
374 enum tree_code code
= TREE_CODE (t
);
376 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
378 if (!EXPR_HAS_LOCATION (t
))
379 SET_EXPR_LOCATION (t
, input_location
);
381 /* When we expand a statement-tree, we must know whether or not the
382 statements are full-expressions. We record that fact here. */
383 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
386 if (code
== LABEL_EXPR
|| code
== CASE_LABEL_EXPR
)
387 STATEMENT_LIST_HAS_LABEL (cur_stmt_list
) = 1;
389 /* Add T to the statement-tree. Non-side-effect statements need to be
390 recorded during statement expressions. */
391 gcc_checking_assert (!stmt_list_stack
->is_empty ());
392 append_to_statement_list_force (t
, &cur_stmt_list
);
397 /* Returns the stmt_tree to which statements are currently being added. */
400 current_stmt_tree (void)
403 ? &cfun
->language
->base
.x_stmt_tree
404 : &scope_chain
->x_stmt_tree
);
407 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
410 maybe_cleanup_point_expr (tree expr
)
412 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
413 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
417 /* Like maybe_cleanup_point_expr except have the type of the new expression be
418 void so we don't need to create a temporary variable to hold the inner
419 expression. The reason why we do this is because the original type might be
420 an aggregate and we cannot create a temporary variable for that type. */
423 maybe_cleanup_point_expr_void (tree expr
)
425 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
426 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
432 /* Create a declaration statement for the declaration given by the DECL. */
435 add_decl_expr (tree decl
)
437 tree r
= build_stmt (DECL_SOURCE_LOCATION (decl
), DECL_EXPR
, decl
);
438 if (DECL_INITIAL (decl
)
439 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
440 r
= maybe_cleanup_point_expr_void (r
);
444 /* Finish a scope. */
447 do_poplevel (tree stmt_list
)
451 if (stmts_are_full_exprs_p ())
452 block
= poplevel (kept_level_p (), 1, 0);
454 stmt_list
= pop_stmt_list (stmt_list
);
456 if (!processing_template_decl
)
458 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
459 /* ??? See c_end_compound_stmt re statement expressions. */
465 /* Begin a new scope. */
468 do_pushlevel (scope_kind sk
)
470 tree ret
= push_stmt_list ();
471 if (stmts_are_full_exprs_p ())
472 begin_scope (sk
, NULL
);
476 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
477 when the current scope is exited. EH_ONLY is true when this is not
478 meant to apply to normal control flow transfer. */
481 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
483 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
484 CLEANUP_EH_ONLY (stmt
) = eh_only
;
486 CLEANUP_BODY (stmt
) = push_stmt_list ();
489 /* Simple infinite loop tracking for -Wreturn-type. We keep a stack of all
490 the current loops, represented by 'NULL_TREE' if we've seen a possible
491 exit, and 'error_mark_node' if not. This is currently used only to
492 suppress the warning about a function with no return statements, and
493 therefore we don't bother noting returns as possible exits. We also
494 don't bother with gotos. */
497 begin_maybe_infinite_loop (tree cond
)
499 /* Only track this while parsing a function, not during instantiation. */
500 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
501 && !processing_template_decl
))
503 bool maybe_infinite
= true;
506 cond
= fold_non_dependent_expr (cond
);
507 maybe_infinite
= integer_nonzerop (cond
);
509 vec_safe_push (cp_function_chain
->infinite_loops
,
510 maybe_infinite
? error_mark_node
: NULL_TREE
);
514 /* A break is a possible exit for the current loop. */
517 break_maybe_infinite_loop (void)
521 cp_function_chain
->infinite_loops
->last() = NULL_TREE
;
524 /* If we reach the end of the loop without seeing a possible exit, we have
528 end_maybe_infinite_loop (tree cond
)
530 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
531 && !processing_template_decl
))
533 tree current
= cp_function_chain
->infinite_loops
->pop();
534 if (current
!= NULL_TREE
)
536 cond
= fold_non_dependent_expr (cond
);
537 if (integer_nonzerop (cond
))
538 current_function_infinite_loop
= 1;
543 /* Begin a conditional that might contain a declaration. When generating
544 normal code, we want the declaration to appear before the statement
545 containing the conditional. When generating template code, we want the
546 conditional to be rendered as the raw DECL_EXPR. */
549 begin_cond (tree
*cond_p
)
551 if (processing_template_decl
)
552 *cond_p
= push_stmt_list ();
555 /* Finish such a conditional. */
558 finish_cond (tree
*cond_p
, tree expr
)
560 if (processing_template_decl
)
562 tree cond
= pop_stmt_list (*cond_p
);
564 if (expr
== NULL_TREE
)
565 /* Empty condition in 'for'. */
566 gcc_assert (empty_expr_stmt_p (cond
));
567 else if (check_for_bare_parameter_packs (expr
))
568 expr
= error_mark_node
;
569 else if (!empty_expr_stmt_p (cond
))
570 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), cond
, expr
);
575 /* If *COND_P specifies a conditional with a declaration, transform the
578 for (; A x = 42;) { }
580 while (true) { A x = 42; if (!x) break; }
581 for (;;) { A x = 42; if (!x) break; }
582 The statement list for BODY will be empty if the conditional did
583 not declare anything. */
586 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
590 if (!TREE_SIDE_EFFECTS (body
))
594 *cond_p
= boolean_true_node
;
596 if_stmt
= begin_if_stmt ();
597 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, false, tf_warning_or_error
);
598 finish_if_stmt_cond (cond
, if_stmt
);
599 finish_break_stmt ();
600 finish_then_clause (if_stmt
);
601 finish_if_stmt (if_stmt
);
604 /* Finish a goto-statement. */
607 finish_goto_stmt (tree destination
)
609 if (identifier_p (destination
))
610 destination
= lookup_label (destination
);
612 /* We warn about unused labels with -Wunused. That means we have to
613 mark the used labels as used. */
614 if (TREE_CODE (destination
) == LABEL_DECL
)
615 TREE_USED (destination
) = 1;
618 destination
= mark_rvalue_use (destination
);
619 if (!processing_template_decl
)
621 destination
= cp_convert (ptr_type_node
, destination
,
622 tf_warning_or_error
);
623 if (error_operand_p (destination
))
626 = fold_build_cleanup_point_expr (TREE_TYPE (destination
),
631 check_goto (destination
);
633 add_stmt (build_predict_expr (PRED_GOTO
, NOT_TAKEN
));
634 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
637 /* COND is the condition-expression for an if, while, etc.,
638 statement. Convert it to a boolean value, if appropriate.
639 In addition, verify sequence points if -Wsequence-point is enabled. */
642 maybe_convert_cond (tree cond
)
644 /* Empty conditions remain empty. */
648 /* Wait until we instantiate templates before doing conversion. */
649 if (type_dependent_expression_p (cond
))
652 if (warn_sequence_point
&& !processing_template_decl
)
653 verify_sequence_points (cond
);
655 /* Do the conversion. */
656 cond
= convert_from_reference (cond
);
658 if (TREE_CODE (cond
) == MODIFY_EXPR
659 && !TREE_NO_WARNING (cond
)
661 && warning_at (cp_expr_loc_or_input_loc (cond
),
662 OPT_Wparentheses
, "suggest parentheses around "
663 "assignment used as truth value"))
664 TREE_NO_WARNING (cond
) = 1;
666 return condition_conversion (cond
);
669 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
672 finish_expr_stmt (tree expr
)
675 location_t loc
= EXPR_LOCATION (expr
);
677 if (expr
!= NULL_TREE
)
679 /* If we ran into a problem, make sure we complained. */
680 gcc_assert (expr
!= error_mark_node
|| seen_error ());
682 if (!processing_template_decl
)
684 if (warn_sequence_point
)
685 verify_sequence_points (expr
);
686 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
688 else if (!type_dependent_expression_p (expr
))
689 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
690 tf_warning_or_error
);
692 if (check_for_bare_parameter_packs (expr
))
693 expr
= error_mark_node
;
695 /* Simplification of inner statement expressions, compound exprs,
696 etc can result in us already having an EXPR_STMT. */
697 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
699 if (TREE_CODE (expr
) != EXPR_STMT
)
700 expr
= build_stmt (loc
, EXPR_STMT
, expr
);
701 expr
= maybe_cleanup_point_expr_void (expr
);
711 /* Begin an if-statement. Returns a newly created IF_STMT if
718 scope
= do_pushlevel (sk_cond
);
719 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
720 NULL_TREE
, NULL_TREE
, scope
);
721 current_binding_level
->this_entity
= r
;
722 begin_cond (&IF_COND (r
));
726 /* Returns true if FN, a CALL_EXPR, is a call to
727 std::is_constant_evaluated or __builtin_is_constant_evaluated. */
730 is_std_constant_evaluated_p (tree fn
)
732 /* std::is_constant_evaluated takes no arguments. */
733 if (call_expr_nargs (fn
) != 0)
736 tree fndecl
= cp_get_callee_fndecl_nofold (fn
);
737 if (fndecl_built_in_p (fndecl
, CP_BUILT_IN_IS_CONSTANT_EVALUATED
,
741 if (!decl_in_std_namespace_p (fndecl
))
744 tree name
= DECL_NAME (fndecl
);
745 return name
&& id_equal (name
, "is_constant_evaluated");
748 /* Process the COND of an if-statement, which may be given by
752 finish_if_stmt_cond (tree cond
, tree if_stmt
)
754 cond
= maybe_convert_cond (cond
);
755 if (IF_STMT_CONSTEXPR_P (if_stmt
)
756 && !type_dependent_expression_p (cond
)
757 && require_constant_expression (cond
)
758 && !instantiation_dependent_expression_p (cond
)
759 /* Wait until instantiation time, since only then COND has been
760 converted to bool. */
761 && TYPE_MAIN_VARIANT (TREE_TYPE (cond
)) == boolean_type_node
)
763 /* if constexpr (std::is_constant_evaluated()) is always true,
764 so give the user a clue. */
765 if (warn_tautological_compare
)
768 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
769 t
= TREE_OPERAND (t
, 0);
770 if (TREE_CODE (t
) == CALL_EXPR
771 && is_std_constant_evaluated_p (t
))
772 warning_at (EXPR_LOCATION (cond
), OPT_Wtautological_compare
,
773 "%qs always evaluates to true in %<if constexpr%>",
774 "std::is_constant_evaluated");
777 cond
= instantiate_non_dependent_expr (cond
);
778 cond
= cxx_constant_value (cond
, NULL_TREE
);
780 finish_cond (&IF_COND (if_stmt
), cond
);
782 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
786 /* Finish the then-clause of an if-statement, which may be given by
790 finish_then_clause (tree if_stmt
)
792 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
796 /* Begin the else-clause of an if-statement. */
799 begin_else_clause (tree if_stmt
)
801 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
804 /* Finish the else-clause of an if-statement, which may be given by
808 finish_else_clause (tree if_stmt
)
810 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
813 /* Callback for cp_walk_tree to mark all {VAR,PARM}_DECLs in a tree as
817 maybe_mark_exp_read_r (tree
*tp
, int *, void *)
820 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
825 /* Finish an if-statement. */
828 finish_if_stmt (tree if_stmt
)
830 tree scope
= IF_SCOPE (if_stmt
);
831 IF_SCOPE (if_stmt
) = NULL
;
832 if (IF_STMT_CONSTEXPR_P (if_stmt
))
834 /* Prevent various -Wunused warnings. We might not instantiate
835 either of these branches, so we would not mark the variables
836 used in that branch as read. */
837 cp_walk_tree_without_duplicates (&THEN_CLAUSE (if_stmt
),
838 maybe_mark_exp_read_r
, NULL
);
839 cp_walk_tree_without_duplicates (&ELSE_CLAUSE (if_stmt
),
840 maybe_mark_exp_read_r
, NULL
);
842 add_stmt (do_poplevel (scope
));
845 /* Begin a while-statement. Returns a newly created WHILE_STMT if
849 begin_while_stmt (void)
852 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
854 WHILE_BODY (r
) = do_pushlevel (sk_block
);
855 begin_cond (&WHILE_COND (r
));
859 /* Process the COND of a while-statement, which may be given by
863 finish_while_stmt_cond (tree cond
, tree while_stmt
, bool ivdep
,
864 unsigned short unroll
)
866 cond
= maybe_convert_cond (cond
);
867 finish_cond (&WHILE_COND (while_stmt
), cond
);
868 begin_maybe_infinite_loop (cond
);
869 if (ivdep
&& cond
!= error_mark_node
)
870 WHILE_COND (while_stmt
) = build3 (ANNOTATE_EXPR
,
871 TREE_TYPE (WHILE_COND (while_stmt
)),
872 WHILE_COND (while_stmt
),
873 build_int_cst (integer_type_node
,
874 annot_expr_ivdep_kind
),
876 if (unroll
&& cond
!= error_mark_node
)
877 WHILE_COND (while_stmt
) = build3 (ANNOTATE_EXPR
,
878 TREE_TYPE (WHILE_COND (while_stmt
)),
879 WHILE_COND (while_stmt
),
880 build_int_cst (integer_type_node
,
881 annot_expr_unroll_kind
),
882 build_int_cst (integer_type_node
,
884 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
887 /* Finish a while-statement, which may be given by WHILE_STMT. */
890 finish_while_stmt (tree while_stmt
)
892 end_maybe_infinite_loop (boolean_true_node
);
893 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
896 /* Begin a do-statement. Returns a newly created DO_STMT if
902 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
903 begin_maybe_infinite_loop (boolean_true_node
);
905 DO_BODY (r
) = push_stmt_list ();
909 /* Finish the body of a do-statement, which may be given by DO_STMT. */
912 finish_do_body (tree do_stmt
)
914 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
916 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
917 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
919 if (IS_EMPTY_STMT (body
))
920 warning (OPT_Wempty_body
,
921 "suggest explicit braces around empty body in %<do%> statement");
924 /* Finish a do-statement, which may be given by DO_STMT, and whose
925 COND is as indicated. */
928 finish_do_stmt (tree cond
, tree do_stmt
, bool ivdep
, unsigned short unroll
)
930 cond
= maybe_convert_cond (cond
);
931 end_maybe_infinite_loop (cond
);
932 if (ivdep
&& cond
!= error_mark_node
)
933 cond
= build3 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
934 build_int_cst (integer_type_node
, annot_expr_ivdep_kind
),
936 if (unroll
&& cond
!= error_mark_node
)
937 cond
= build3 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
938 build_int_cst (integer_type_node
, annot_expr_unroll_kind
),
939 build_int_cst (integer_type_node
, unroll
));
940 DO_COND (do_stmt
) = cond
;
943 /* Finish a return-statement. The EXPRESSION returned, if any, is as
947 finish_return_stmt (tree expr
)
952 expr
= check_return_expr (expr
, &no_warning
);
954 if (error_operand_p (expr
)
955 || (flag_openmp
&& !check_omp_return ()))
957 /* Suppress -Wreturn-type for this function. */
958 if (warn_return_type
)
959 TREE_NO_WARNING (current_function_decl
) = true;
960 return error_mark_node
;
963 if (!processing_template_decl
)
965 if (warn_sequence_point
)
966 verify_sequence_points (expr
);
968 if (DECL_DESTRUCTOR_P (current_function_decl
)
969 || (DECL_CONSTRUCTOR_P (current_function_decl
)
970 && targetm
.cxx
.cdtor_returns_this ()))
972 /* Similarly, all destructors must run destructors for
973 base-classes before returning. So, all returns in a
974 destructor get sent to the DTOR_LABEL; finish_function emits
975 code to return a value there. */
976 return finish_goto_stmt (cdtor_label
);
980 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
981 TREE_NO_WARNING (r
) |= no_warning
;
982 r
= maybe_cleanup_point_expr_void (r
);
988 /* Begin the scope of a for-statement or a range-for-statement.
989 Both the returned trees are to be used in a call to
990 begin_for_stmt or begin_range_for_stmt. */
993 begin_for_scope (tree
*init
)
995 tree scope
= do_pushlevel (sk_for
);
997 if (processing_template_decl
)
998 *init
= push_stmt_list ();
1005 /* Begin a for-statement. Returns a new FOR_STMT.
1006 SCOPE and INIT should be the return of begin_for_scope,
1007 or both NULL_TREE */
1010 begin_for_stmt (tree scope
, tree init
)
1014 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
1015 NULL_TREE
, NULL_TREE
, NULL_TREE
);
1017 if (scope
== NULL_TREE
)
1020 scope
= begin_for_scope (&init
);
1023 FOR_INIT_STMT (r
) = init
;
1024 FOR_SCOPE (r
) = scope
;
1029 /* Finish the init-statement of a for-statement, which may be
1030 given by FOR_STMT. */
1033 finish_init_stmt (tree for_stmt
)
1035 if (processing_template_decl
)
1036 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
1037 add_stmt (for_stmt
);
1038 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
1039 begin_cond (&FOR_COND (for_stmt
));
1042 /* Finish the COND of a for-statement, which may be given by
1046 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
, unsigned short unroll
)
1048 cond
= maybe_convert_cond (cond
);
1049 finish_cond (&FOR_COND (for_stmt
), cond
);
1050 begin_maybe_infinite_loop (cond
);
1051 if (ivdep
&& cond
!= error_mark_node
)
1052 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
1053 TREE_TYPE (FOR_COND (for_stmt
)),
1054 FOR_COND (for_stmt
),
1055 build_int_cst (integer_type_node
,
1056 annot_expr_ivdep_kind
),
1058 if (unroll
&& cond
!= error_mark_node
)
1059 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
1060 TREE_TYPE (FOR_COND (for_stmt
)),
1061 FOR_COND (for_stmt
),
1062 build_int_cst (integer_type_node
,
1063 annot_expr_unroll_kind
),
1064 build_int_cst (integer_type_node
,
1066 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
1069 /* Finish the increment-EXPRESSION in a for-statement, which may be
1070 given by FOR_STMT. */
1073 finish_for_expr (tree expr
, tree for_stmt
)
1077 /* If EXPR is an overloaded function, issue an error; there is no
1078 context available to use to perform overload resolution. */
1079 if (type_unknown_p (expr
))
1081 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
1082 expr
= error_mark_node
;
1084 if (!processing_template_decl
)
1086 if (warn_sequence_point
)
1087 verify_sequence_points (expr
);
1088 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1089 tf_warning_or_error
);
1091 else if (!type_dependent_expression_p (expr
))
1092 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1093 tf_warning_or_error
);
1094 expr
= maybe_cleanup_point_expr_void (expr
);
1095 if (check_for_bare_parameter_packs (expr
))
1096 expr
= error_mark_node
;
1097 FOR_EXPR (for_stmt
) = expr
;
1100 /* Finish the body of a for-statement, which may be given by
1101 FOR_STMT. The increment-EXPR for the loop must be
1103 It can also finish RANGE_FOR_STMT. */
1106 finish_for_stmt (tree for_stmt
)
1108 end_maybe_infinite_loop (boolean_true_node
);
1110 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1111 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1113 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1115 /* Pop the scope for the body of the loop. */
1116 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1117 ? &RANGE_FOR_SCOPE (for_stmt
)
1118 : &FOR_SCOPE (for_stmt
));
1119 tree scope
= *scope_ptr
;
1122 /* During parsing of the body, range for uses "__for_{range,begin,end} "
1123 decl names to make those unaccessible by code in the body.
1124 Change it to ones with underscore instead of space, so that it can
1125 be inspected in the debugger. */
1126 tree range_for_decl
[3] = { NULL_TREE
, NULL_TREE
, NULL_TREE
};
1127 gcc_assert (CPTI_FOR_BEGIN__IDENTIFIER
== CPTI_FOR_RANGE__IDENTIFIER
+ 1
1128 && CPTI_FOR_END__IDENTIFIER
== CPTI_FOR_RANGE__IDENTIFIER
+ 2
1129 && CPTI_FOR_RANGE_IDENTIFIER
== CPTI_FOR_RANGE__IDENTIFIER
+ 3
1130 && CPTI_FOR_BEGIN_IDENTIFIER
== CPTI_FOR_BEGIN__IDENTIFIER
+ 3
1131 && CPTI_FOR_END_IDENTIFIER
== CPTI_FOR_END__IDENTIFIER
+ 3);
1132 for (int i
= 0; i
< 3; i
++)
1134 tree id
= cp_global_trees
[CPTI_FOR_RANGE__IDENTIFIER
+ i
];
1135 if (IDENTIFIER_BINDING (id
)
1136 && IDENTIFIER_BINDING (id
)->scope
== current_binding_level
)
1138 range_for_decl
[i
] = IDENTIFIER_BINDING (id
)->value
;
1139 gcc_assert (VAR_P (range_for_decl
[i
])
1140 && DECL_ARTIFICIAL (range_for_decl
[i
]));
1144 add_stmt (do_poplevel (scope
));
1146 for (int i
= 0; i
< 3; i
++)
1147 if (range_for_decl
[i
])
1148 DECL_NAME (range_for_decl
[i
])
1149 = cp_global_trees
[CPTI_FOR_RANGE_IDENTIFIER
+ i
];
1152 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1153 SCOPE and INIT should be the return of begin_for_scope,
1155 To finish it call finish_for_stmt(). */
1158 begin_range_for_stmt (tree scope
, tree init
)
1160 begin_maybe_infinite_loop (boolean_false_node
);
1162 tree r
= build_stmt (input_location
, RANGE_FOR_STMT
, NULL_TREE
, NULL_TREE
,
1163 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1165 if (scope
== NULL_TREE
)
1168 scope
= begin_for_scope (&init
);
1171 /* Since C++20, RANGE_FOR_STMTs can use the init tree, so save it. */
1172 RANGE_FOR_INIT_STMT (r
) = init
;
1173 RANGE_FOR_SCOPE (r
) = scope
;
1178 /* Finish the head of a range-based for statement, which may
1179 be given by RANGE_FOR_STMT. DECL must be the declaration
1180 and EXPR must be the loop expression. */
1183 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
1185 if (processing_template_decl
)
1186 RANGE_FOR_INIT_STMT (range_for_stmt
)
1187 = pop_stmt_list (RANGE_FOR_INIT_STMT (range_for_stmt
));
1188 RANGE_FOR_DECL (range_for_stmt
) = decl
;
1189 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
1190 add_stmt (range_for_stmt
);
1191 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
1194 /* Finish a break-statement. */
1197 finish_break_stmt (void)
1199 /* In switch statements break is sometimes stylistically used after
1200 a return statement. This can lead to spurious warnings about
1201 control reaching the end of a non-void function when it is
1202 inlined. Note that we are calling block_may_fallthru with
1203 language specific tree nodes; this works because
1204 block_may_fallthru returns true when given something it does not
1206 if (!block_may_fallthru (cur_stmt_list
))
1209 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1212 /* Finish a continue-statement. */
1215 finish_continue_stmt (void)
1217 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1220 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1224 begin_switch_stmt (void)
1228 scope
= do_pushlevel (sk_cond
);
1229 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1231 begin_cond (&SWITCH_STMT_COND (r
));
1236 /* Finish the cond of a switch-statement. */
1239 finish_switch_cond (tree cond
, tree switch_stmt
)
1241 tree orig_type
= NULL
;
1243 if (!processing_template_decl
)
1245 /* Convert the condition to an integer or enumeration type. */
1246 tree orig_cond
= cond
;
1247 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1248 if (cond
== NULL_TREE
)
1250 error_at (cp_expr_loc_or_input_loc (orig_cond
),
1251 "switch quantity not an integer");
1252 cond
= error_mark_node
;
1254 /* We want unlowered type here to handle enum bit-fields. */
1255 orig_type
= unlowered_expr_type (cond
);
1256 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1257 orig_type
= TREE_TYPE (cond
);
1258 if (cond
!= error_mark_node
)
1262 Integral promotions are performed. */
1263 cond
= perform_integral_promotions (cond
);
1264 cond
= maybe_cleanup_point_expr (cond
);
1267 if (check_for_bare_parameter_packs (cond
))
1268 cond
= error_mark_node
;
1269 else if (!processing_template_decl
&& warn_sequence_point
)
1270 verify_sequence_points (cond
);
1272 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1273 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1274 add_stmt (switch_stmt
);
1275 push_switch (switch_stmt
);
1276 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1279 /* Finish the body of a switch-statement, which may be given by
1280 SWITCH_STMT. The COND to switch on is indicated. */
1283 finish_switch_stmt (tree switch_stmt
)
1287 SWITCH_STMT_BODY (switch_stmt
) =
1288 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1291 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1292 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1293 add_stmt (do_poplevel (scope
));
1296 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1300 begin_try_block (void)
1302 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1304 TRY_STMTS (r
) = push_stmt_list ();
1308 /* Likewise, for a function-try-block. The block returned in
1309 *COMPOUND_STMT is an artificial outer scope, containing the
1310 function-try-block. */
1313 begin_function_try_block (tree
*compound_stmt
)
1316 /* This outer scope does not exist in the C++ standard, but we need
1317 a place to put __FUNCTION__ and similar variables. */
1318 *compound_stmt
= begin_compound_stmt (0);
1319 r
= begin_try_block ();
1320 FN_TRY_BLOCK_P (r
) = 1;
1324 /* Finish a try-block, which may be given by TRY_BLOCK. */
1327 finish_try_block (tree try_block
)
1329 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1330 TRY_HANDLERS (try_block
) = push_stmt_list ();
1333 /* Finish the body of a cleanup try-block, which may be given by
1337 finish_cleanup_try_block (tree try_block
)
1339 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1342 /* Finish an implicitly generated try-block, with a cleanup is given
1346 finish_cleanup (tree cleanup
, tree try_block
)
1348 TRY_HANDLERS (try_block
) = cleanup
;
1349 CLEANUP_P (try_block
) = 1;
1352 /* Likewise, for a function-try-block. */
1355 finish_function_try_block (tree try_block
)
1357 finish_try_block (try_block
);
1358 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1359 the try block, but moving it inside. */
1360 in_function_try_handler
= 1;
1363 /* Finish a handler-sequence for a try-block, which may be given by
1367 finish_handler_sequence (tree try_block
)
1369 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1370 check_handlers (TRY_HANDLERS (try_block
));
1373 /* Finish the handler-seq for a function-try-block, given by
1374 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1375 begin_function_try_block. */
1378 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1380 in_function_try_handler
= 0;
1381 finish_handler_sequence (try_block
);
1382 finish_compound_stmt (compound_stmt
);
1385 /* Begin a handler. Returns a HANDLER if appropriate. */
1388 begin_handler (void)
1392 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1395 /* Create a binding level for the eh_info and the exception object
1397 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1402 /* Finish the handler-parameters for a handler, which may be given by
1403 HANDLER. DECL is the declaration for the catch parameter, or NULL
1404 if this is a `catch (...)' clause. */
1407 finish_handler_parms (tree decl
, tree handler
)
1409 tree type
= NULL_TREE
;
1410 if (processing_template_decl
)
1414 decl
= pushdecl (decl
);
1415 decl
= push_template_decl (decl
);
1416 HANDLER_PARMS (handler
) = decl
;
1417 type
= TREE_TYPE (decl
);
1422 type
= expand_start_catch_block (decl
);
1423 if (warn_catch_value
1424 && type
!= NULL_TREE
1425 && type
!= error_mark_node
1426 && !TYPE_REF_P (TREE_TYPE (decl
)))
1428 tree orig_type
= TREE_TYPE (decl
);
1429 if (CLASS_TYPE_P (orig_type
))
1431 if (TYPE_POLYMORPHIC_P (orig_type
))
1432 warning (OPT_Wcatch_value_
,
1433 "catching polymorphic type %q#T by value", orig_type
);
1434 else if (warn_catch_value
> 1)
1435 warning (OPT_Wcatch_value_
,
1436 "catching type %q#T by value", orig_type
);
1438 else if (warn_catch_value
> 2)
1439 warning (OPT_Wcatch_value_
,
1440 "catching non-reference type %q#T", orig_type
);
1443 HANDLER_TYPE (handler
) = type
;
1446 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1447 the return value from the matching call to finish_handler_parms. */
1450 finish_handler (tree handler
)
1452 if (!processing_template_decl
)
1453 expand_end_catch_block ();
1454 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1457 /* Begin a compound statement. FLAGS contains some bits that control the
1458 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1459 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1460 block of a function. If BCS_TRY_BLOCK is set, this is the block
1461 created on behalf of a TRY statement. Returns a token to be passed to
1462 finish_compound_stmt. */
1465 begin_compound_stmt (unsigned int flags
)
1469 if (flags
& BCS_NO_SCOPE
)
1471 r
= push_stmt_list ();
1472 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1474 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1475 But, if it's a statement-expression with a scopeless block, there's
1476 nothing to keep, and we don't want to accidentally keep a block
1477 *inside* the scopeless block. */
1478 keep_next_level (false);
1482 scope_kind sk
= sk_block
;
1483 if (flags
& BCS_TRY_BLOCK
)
1485 else if (flags
& BCS_TRANSACTION
)
1486 sk
= sk_transaction
;
1487 r
= do_pushlevel (sk
);
1490 /* When processing a template, we need to remember where the braces were,
1491 so that we can set up identical scopes when instantiating the template
1492 later. BIND_EXPR is a handy candidate for this.
1493 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1494 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1495 processing templates. */
1496 if (processing_template_decl
)
1498 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1499 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1500 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1501 TREE_SIDE_EFFECTS (r
) = 1;
1507 /* Finish a compound-statement, which is given by STMT. */
1510 finish_compound_stmt (tree stmt
)
1512 if (TREE_CODE (stmt
) == BIND_EXPR
)
1514 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1515 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1516 discard the BIND_EXPR so it can be merged with the containing
1518 if (TREE_CODE (body
) == STATEMENT_LIST
1519 && STATEMENT_LIST_HEAD (body
) == NULL
1520 && !BIND_EXPR_BODY_BLOCK (stmt
)
1521 && !BIND_EXPR_TRY_BLOCK (stmt
))
1524 BIND_EXPR_BODY (stmt
) = body
;
1526 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1527 stmt
= pop_stmt_list (stmt
);
1530 /* Destroy any ObjC "super" receivers that may have been
1532 objc_clear_super_receiver ();
1534 stmt
= do_poplevel (stmt
);
1537 /* ??? See c_end_compound_stmt wrt statement expressions. */
1541 /* Finish an asm-statement, whose components are a STRING, some
1542 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1543 LABELS. Also note whether the asm-statement should be
1544 considered volatile, and whether it is asm inline. */
1547 finish_asm_stmt (location_t loc
, int volatile_p
, tree string
,
1548 tree output_operands
, tree input_operands
, tree clobbers
,
1549 tree labels
, bool inline_p
)
1553 int ninputs
= list_length (input_operands
);
1554 int noutputs
= list_length (output_operands
);
1556 if (!processing_template_decl
)
1558 const char *constraint
;
1559 const char **oconstraints
;
1560 bool allows_mem
, allows_reg
, is_inout
;
1564 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1566 string
= resolve_asm_operand_names (string
, output_operands
,
1567 input_operands
, labels
);
1569 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1571 operand
= TREE_VALUE (t
);
1573 /* ??? Really, this should not be here. Users should be using a
1574 proper lvalue, dammit. But there's a long history of using
1575 casts in the output operands. In cases like longlong.h, this
1576 becomes a primitive form of typechecking -- if the cast can be
1577 removed, then the output operand had a type of the proper width;
1578 otherwise we'll get an error. Gross, but ... */
1579 STRIP_NOPS (operand
);
1581 operand
= mark_lvalue_use (operand
);
1583 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1584 operand
= error_mark_node
;
1586 if (operand
!= error_mark_node
1587 && (TREE_READONLY (operand
)
1588 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1589 /* Functions are not modifiable, even though they are
1591 || FUNC_OR_METHOD_TYPE_P (TREE_TYPE (operand
))
1592 /* If it's an aggregate and any field is const, then it is
1593 effectively const. */
1594 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1595 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1596 cxx_readonly_error (loc
, operand
, lv_asm
);
1598 tree
*op
= &operand
;
1599 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1600 op
= &TREE_OPERAND (*op
, 1);
1601 switch (TREE_CODE (*op
))
1603 case PREINCREMENT_EXPR
:
1604 case PREDECREMENT_EXPR
:
1606 *op
= genericize_compound_lvalue (*op
);
1607 op
= &TREE_OPERAND (*op
, 1);
1613 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1614 oconstraints
[i
] = constraint
;
1616 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1617 &allows_mem
, &allows_reg
, &is_inout
))
1619 /* If the operand is going to end up in memory,
1620 mark it addressable. */
1621 if (!allows_reg
&& !cxx_mark_addressable (*op
))
1622 operand
= error_mark_node
;
1625 operand
= error_mark_node
;
1627 TREE_VALUE (t
) = operand
;
1630 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1632 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1633 bool constraint_parsed
1634 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1635 oconstraints
, &allows_mem
, &allows_reg
);
1636 /* If the operand is going to end up in memory, don't call
1637 decay_conversion. */
1638 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1639 operand
= mark_lvalue_use (TREE_VALUE (t
));
1641 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1643 /* If the type of the operand hasn't been determined (e.g.,
1644 because it involves an overloaded function), then issue
1645 an error message. There's no context available to
1646 resolve the overloading. */
1647 if (TREE_TYPE (operand
) == unknown_type_node
)
1650 "type of %<asm%> operand %qE could not be determined",
1652 operand
= error_mark_node
;
1655 if (constraint_parsed
)
1657 /* If the operand is going to end up in memory,
1658 mark it addressable. */
1659 if (!allows_reg
&& allows_mem
)
1661 /* Strip the nops as we allow this case. FIXME, this really
1662 should be rejected or made deprecated. */
1663 STRIP_NOPS (operand
);
1665 tree
*op
= &operand
;
1666 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1667 op
= &TREE_OPERAND (*op
, 1);
1668 switch (TREE_CODE (*op
))
1670 case PREINCREMENT_EXPR
:
1671 case PREDECREMENT_EXPR
:
1673 *op
= genericize_compound_lvalue (*op
);
1674 op
= &TREE_OPERAND (*op
, 1);
1680 if (!cxx_mark_addressable (*op
))
1681 operand
= error_mark_node
;
1683 else if (!allows_reg
&& !allows_mem
)
1685 /* If constraint allows neither register nor memory,
1686 try harder to get a constant. */
1687 tree constop
= maybe_constant_value (operand
);
1688 if (TREE_CONSTANT (constop
))
1693 operand
= error_mark_node
;
1695 TREE_VALUE (t
) = operand
;
1699 r
= build_stmt (loc
, ASM_EXPR
, string
,
1700 output_operands
, input_operands
,
1702 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1703 ASM_INLINE_P (r
) = inline_p
;
1704 r
= maybe_cleanup_point_expr_void (r
);
1705 return add_stmt (r
);
1708 /* Finish a label with the indicated NAME. Returns the new label. */
1711 finish_label_stmt (tree name
)
1713 tree decl
= define_label (input_location
, name
);
1715 if (decl
== error_mark_node
)
1716 return error_mark_node
;
1718 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1723 /* Finish a series of declarations for local labels. G++ allows users
1724 to declare "local" labels, i.e., labels with scope. This extension
1725 is useful when writing code involving statement-expressions. */
1728 finish_label_decl (tree name
)
1730 if (!at_function_scope_p ())
1732 error ("%<__label__%> declarations are only allowed in function scopes");
1736 add_decl_expr (declare_local_label (name
));
1739 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1742 finish_decl_cleanup (tree decl
, tree cleanup
)
1744 push_cleanup (decl
, cleanup
, false);
1747 /* If the current scope exits with an exception, run CLEANUP. */
1750 finish_eh_cleanup (tree cleanup
)
1752 push_cleanup (NULL
, cleanup
, true);
1755 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1756 order they were written by the user. Each node is as for
1757 emit_mem_initializers. */
1760 finish_mem_initializers (tree mem_inits
)
1762 /* Reorder the MEM_INITS so that they are in the order they appeared
1763 in the source program. */
1764 mem_inits
= nreverse (mem_inits
);
1766 if (processing_template_decl
)
1770 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1772 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1773 check for bare parameter packs in the TREE_VALUE, because
1774 any parameter packs in the TREE_VALUE have already been
1775 bound as part of the TREE_PURPOSE. See
1776 make_pack_expansion for more information. */
1777 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1778 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1779 TREE_VALUE (mem
) = error_mark_node
;
1782 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1783 CTOR_INITIALIZER
, mem_inits
));
1786 emit_mem_initializers (mem_inits
);
1789 /* Obfuscate EXPR if it looks like an id-expression or member access so
1790 that the call to finish_decltype in do_auto_deduction will give the
1791 right result. If EVEN_UNEVAL, do this even in unevaluated context. */
1794 force_paren_expr (tree expr
, bool even_uneval
)
1796 /* This is only needed for decltype(auto) in C++14. */
1797 if (cxx_dialect
< cxx14
)
1800 /* If we're in unevaluated context, we can't be deducing a
1801 return/initializer type, so we don't need to mess with this. */
1802 if (cp_unevaluated_operand
&& !even_uneval
)
1805 if (!DECL_P (tree_strip_any_location_wrapper (expr
))
1806 && TREE_CODE (expr
) != COMPONENT_REF
1807 && TREE_CODE (expr
) != SCOPE_REF
)
1810 location_t loc
= cp_expr_location (expr
);
1812 if (TREE_CODE (expr
) == COMPONENT_REF
1813 || TREE_CODE (expr
) == SCOPE_REF
)
1814 REF_PARENTHESIZED_P (expr
) = true;
1815 else if (processing_template_decl
)
1816 expr
= build1_loc (loc
, PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1819 expr
= build1_loc (loc
, VIEW_CONVERT_EXPR
, TREE_TYPE (expr
), expr
);
1820 REF_PARENTHESIZED_P (expr
) = true;
1826 /* If T is an id-expression obfuscated by force_paren_expr, undo the
1827 obfuscation and return the underlying id-expression. Otherwise
1831 maybe_undo_parenthesized_ref (tree t
)
1833 if (cxx_dialect
< cxx14
)
1836 if (INDIRECT_REF_P (t
) && REF_PARENTHESIZED_P (t
))
1838 t
= TREE_OPERAND (t
, 0);
1839 while (TREE_CODE (t
) == NON_LVALUE_EXPR
1840 || TREE_CODE (t
) == NOP_EXPR
)
1841 t
= TREE_OPERAND (t
, 0);
1843 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
1844 || TREE_CODE (t
) == STATIC_CAST_EXPR
);
1845 t
= TREE_OPERAND (t
, 0);
1847 else if (TREE_CODE (t
) == PAREN_EXPR
)
1848 t
= TREE_OPERAND (t
, 0);
1849 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
1850 && REF_PARENTHESIZED_P (t
))
1851 t
= TREE_OPERAND (t
, 0);
1856 /* Finish a parenthesized expression EXPR. */
1859 finish_parenthesized_expr (cp_expr expr
)
1862 /* This inhibits warnings in c_common_truthvalue_conversion. */
1863 TREE_NO_WARNING (expr
) = 1;
1865 if (TREE_CODE (expr
) == OFFSET_REF
1866 || TREE_CODE (expr
) == SCOPE_REF
)
1867 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1868 enclosed in parentheses. */
1869 PTRMEM_OK_P (expr
) = 0;
1871 tree stripped_expr
= tree_strip_any_location_wrapper (expr
);
1872 if (TREE_CODE (stripped_expr
) == STRING_CST
)
1873 PAREN_STRING_LITERAL_P (stripped_expr
) = 1;
1875 expr
= cp_expr (force_paren_expr (expr
), expr
.get_location ());
1880 /* Finish a reference to a non-static data member (DECL) that is not
1881 preceded by `.' or `->'. */
1884 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1886 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1887 bool try_omp_private
= !object
&& omp_private_member_map
;
1892 tree scope
= qualifying_scope
;
1893 if (scope
== NULL_TREE
)
1895 scope
= context_for_name_lookup (decl
);
1896 if (!TYPE_P (scope
))
1898 /* Can happen during error recovery (c++/85014). */
1899 gcc_assert (seen_error ());
1900 return error_mark_node
;
1903 object
= maybe_dummy_object (scope
, NULL
);
1906 object
= maybe_resolve_dummy (object
, true);
1907 if (object
== error_mark_node
)
1908 return error_mark_node
;
1910 /* DR 613/850: Can use non-static data members without an associated
1911 object in sizeof/decltype/alignof. */
1912 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1913 && (!processing_template_decl
|| !current_class_ref
))
1915 if (current_function_decl
1916 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1917 error ("invalid use of member %qD in static member function", decl
);
1919 error ("invalid use of non-static data member %qD", decl
);
1920 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1922 return error_mark_node
;
1925 if (current_class_ptr
)
1926 TREE_USED (current_class_ptr
) = 1;
1927 if (processing_template_decl
)
1929 tree type
= TREE_TYPE (decl
);
1931 if (TYPE_REF_P (type
))
1932 /* Quals on the object don't matter. */;
1933 else if (PACK_EXPANSION_P (type
))
1934 /* Don't bother trying to represent this. */
1938 /* Set the cv qualifiers. */
1939 int quals
= cp_type_quals (TREE_TYPE (object
));
1941 if (DECL_MUTABLE_P (decl
))
1942 quals
&= ~TYPE_QUAL_CONST
;
1944 quals
|= cp_type_quals (TREE_TYPE (decl
));
1945 type
= cp_build_qualified_type (type
, quals
);
1948 if (qualifying_scope
)
1949 /* Wrap this in a SCOPE_REF for now. */
1950 ret
= build_qualified_name (type
, qualifying_scope
, decl
,
1951 /*template_p=*/false);
1953 ret
= (convert_from_reference
1954 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1956 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1957 QUALIFYING_SCOPE is also non-null. */
1960 tree access_type
= TREE_TYPE (object
);
1962 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1963 decl
, tf_warning_or_error
);
1965 /* If the data member was named `C::M', convert `*this' to `C'
1967 if (qualifying_scope
)
1969 tree binfo
= NULL_TREE
;
1970 object
= build_scoped_ref (object
, qualifying_scope
,
1974 ret
= build_class_member_access_expr (object
, decl
,
1975 /*access_path=*/NULL_TREE
,
1976 /*preserve_reference=*/false,
1977 tf_warning_or_error
);
1979 if (try_omp_private
)
1981 tree
*v
= omp_private_member_map
->get (decl
);
1983 ret
= convert_from_reference (*v
);
1988 /* If we are currently parsing a template and we encountered a typedef
1989 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1990 adds the typedef to a list tied to the current template.
1991 At template instantiation time, that list is walked and access check
1992 performed for each typedef.
1993 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1996 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1998 location_t location
)
2000 tree template_info
= NULL
;
2001 tree cs
= current_scope ();
2003 if (!is_typedef_decl (typedef_decl
)
2005 || !CLASS_TYPE_P (context
)
2009 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
2010 template_info
= get_template_info (cs
);
2013 && TI_TEMPLATE (template_info
)
2014 && !currently_open_class (context
))
2015 append_type_to_template_for_access_check (cs
, typedef_decl
,
2019 /* DECL was the declaration to which a qualified-id resolved. Issue
2020 an error message if it is not accessible. If OBJECT_TYPE is
2021 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
2022 type of `*x', or `x', respectively. If the DECL was named as
2023 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
2026 check_accessibility_of_qualified_id (tree decl
,
2028 tree nested_name_specifier
)
2031 tree qualifying_type
= NULL_TREE
;
2033 /* If we are parsing a template declaration and if decl is a typedef,
2034 add it to a list tied to the template.
2035 At template instantiation time, that list will be walked and
2036 access check performed. */
2037 add_typedef_to_current_template_for_access_check (decl
,
2038 nested_name_specifier
2039 ? nested_name_specifier
2040 : DECL_CONTEXT (decl
),
2043 /* If we're not checking, return immediately. */
2044 if (deferred_access_no_check
)
2047 /* Determine the SCOPE of DECL. */
2048 scope
= context_for_name_lookup (decl
);
2049 /* If the SCOPE is not a type, then DECL is not a member. */
2050 if (!TYPE_P (scope
))
2052 /* Compute the scope through which DECL is being accessed. */
2054 /* OBJECT_TYPE might not be a class type; consider:
2056 class A { typedef int I; };
2060 In this case, we will have "A::I" as the DECL, but "I" as the
2062 && CLASS_TYPE_P (object_type
)
2063 && DERIVED_FROM_P (scope
, object_type
))
2064 /* If we are processing a `->' or `.' expression, use the type of the
2066 qualifying_type
= object_type
;
2067 else if (nested_name_specifier
)
2069 /* If the reference is to a non-static member of the
2070 current class, treat it as if it were referenced through
2073 if (DECL_NONSTATIC_MEMBER_P (decl
)
2074 && current_class_ptr
2075 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
2076 qualifying_type
= ct
;
2077 /* Otherwise, use the type indicated by the
2078 nested-name-specifier. */
2080 qualifying_type
= nested_name_specifier
;
2083 /* Otherwise, the name must be from the current class or one of
2085 qualifying_type
= currently_open_derived_class (scope
);
2088 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
2089 or similar in a default argument value. */
2090 && CLASS_TYPE_P (qualifying_type
)
2091 && !dependent_type_p (qualifying_type
))
2092 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
2093 decl
, tf_warning_or_error
);
2096 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
2097 class named to the left of the "::" operator. DONE is true if this
2098 expression is a complete postfix-expression; it is false if this
2099 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
2100 iff this expression is the operand of '&'. TEMPLATE_P is true iff
2101 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
2102 is true iff this qualified name appears as a template argument. */
2105 finish_qualified_id_expr (tree qualifying_class
,
2110 bool template_arg_p
,
2111 tsubst_flags_t complain
)
2113 gcc_assert (TYPE_P (qualifying_class
));
2115 if (error_operand_p (expr
))
2116 return error_mark_node
;
2118 if ((DECL_P (expr
) || BASELINK_P (expr
))
2119 && !mark_used (expr
, complain
))
2120 return error_mark_node
;
2124 if (TREE_CODE (expr
) == UNBOUND_CLASS_TEMPLATE
)
2126 /* cp_parser_lookup_name thought we were looking for a type,
2127 but we're actually looking for a declaration. */
2128 qualifying_class
= TYPE_CONTEXT (expr
);
2129 expr
= TYPE_IDENTIFIER (expr
);
2132 check_template_keyword (expr
);
2135 /* If EXPR occurs as the operand of '&', use special handling that
2136 permits a pointer-to-member. */
2137 if (address_p
&& done
)
2139 if (TREE_CODE (expr
) == SCOPE_REF
)
2140 expr
= TREE_OPERAND (expr
, 1);
2141 expr
= build_offset_ref (qualifying_class
, expr
,
2142 /*address_p=*/true, complain
);
2146 /* No need to check access within an enum. */
2147 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
2148 && TREE_CODE (expr
) != IDENTIFIER_NODE
)
2151 /* Within the scope of a class, turn references to non-static
2152 members into expression of the form "this->...". */
2154 /* But, within a template argument, we do not want make the
2155 transformation, as there is no "this" pointer. */
2157 else if (TREE_CODE (expr
) == FIELD_DECL
)
2159 push_deferring_access_checks (dk_no_check
);
2160 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
2162 pop_deferring_access_checks ();
2164 else if (BASELINK_P (expr
))
2166 /* See if any of the functions are non-static members. */
2167 /* If so, the expression may be relative to 'this'. */
2168 if ((type_dependent_expression_p (expr
)
2169 || !shared_member_p (expr
))
2170 && current_class_ptr
2171 && DERIVED_FROM_P (qualifying_class
,
2172 current_nonlambda_class_type ()))
2173 expr
= (build_class_member_access_expr
2174 (maybe_dummy_object (qualifying_class
, NULL
),
2176 BASELINK_ACCESS_BINFO (expr
),
2177 /*preserve_reference=*/false,
2180 /* The expression is a qualified name whose address is not
2182 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
2185 else if (!template_p
2186 && TREE_CODE (expr
) == TEMPLATE_DECL
2187 && !DECL_FUNCTION_TEMPLATE_P (expr
))
2189 if (complain
& tf_error
)
2190 error ("%qE missing template arguments", expr
);
2191 return error_mark_node
;
2195 /* In a template, return a SCOPE_REF for most qualified-ids
2196 so that we can check access at instantiation time. But if
2197 we're looking at a member of the current instantiation, we
2198 know we have access and building up the SCOPE_REF confuses
2199 non-type template argument handling. */
2200 if (processing_template_decl
2201 && (!currently_open_class (qualifying_class
)
2202 || TREE_CODE (expr
) == IDENTIFIER_NODE
2203 || TREE_CODE (expr
) == TEMPLATE_ID_EXPR
2204 || TREE_CODE (expr
) == BIT_NOT_EXPR
))
2205 expr
= build_qualified_name (TREE_TYPE (expr
),
2206 qualifying_class
, expr
,
2208 else if (tree wrap
= maybe_get_tls_wrapper_call (expr
))
2211 expr
= convert_from_reference (expr
);
2217 /* Begin a statement-expression. The value returned must be passed to
2218 finish_stmt_expr. */
2221 begin_stmt_expr (void)
2223 return push_stmt_list ();
2226 /* Process the final expression of a statement expression. EXPR can be
2227 NULL, if the final expression is empty. Return a STATEMENT_LIST
2228 containing all the statements in the statement-expression, or
2229 ERROR_MARK_NODE if there was an error. */
2232 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2234 if (error_operand_p (expr
))
2236 /* The type of the statement-expression is the type of the last
2238 TREE_TYPE (stmt_expr
) = error_mark_node
;
2239 return error_mark_node
;
2242 /* If the last statement does not have "void" type, then the value
2243 of the last statement is the value of the entire expression. */
2246 tree type
= TREE_TYPE (expr
);
2248 if (type
&& type_unknown_p (type
))
2250 error ("a statement expression is an insufficient context"
2251 " for overload resolution");
2252 TREE_TYPE (stmt_expr
) = error_mark_node
;
2253 return error_mark_node
;
2255 else if (processing_template_decl
)
2257 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2258 expr
= add_stmt (expr
);
2259 /* Mark the last statement so that we can recognize it as such at
2260 template-instantiation time. */
2261 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2263 else if (VOID_TYPE_P (type
))
2265 /* Just treat this like an ordinary statement. */
2266 expr
= finish_expr_stmt (expr
);
2270 /* It actually has a value we need to deal with. First, force it
2271 to be an rvalue so that we won't need to build up a copy
2272 constructor call later when we try to assign it to something. */
2273 expr
= force_rvalue (expr
, tf_warning_or_error
);
2274 if (error_operand_p (expr
))
2275 return error_mark_node
;
2277 /* Update for array-to-pointer decay. */
2278 type
= TREE_TYPE (expr
);
2280 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2281 normal statement, but don't convert to void or actually add
2283 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2284 expr
= maybe_cleanup_point_expr (expr
);
2288 /* The type of the statement-expression is the type of the last
2290 TREE_TYPE (stmt_expr
) = type
;
2296 /* Finish a statement-expression. EXPR should be the value returned
2297 by the previous begin_stmt_expr. Returns an expression
2298 representing the statement-expression. */
2301 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2306 if (error_operand_p (stmt_expr
))
2308 pop_stmt_list (stmt_expr
);
2309 return error_mark_node
;
2312 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2314 type
= TREE_TYPE (stmt_expr
);
2315 result
= pop_stmt_list (stmt_expr
);
2316 TREE_TYPE (result
) = type
;
2318 if (processing_template_decl
)
2320 result
= build_min (STMT_EXPR
, type
, result
);
2321 TREE_SIDE_EFFECTS (result
) = 1;
2322 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2324 else if (CLASS_TYPE_P (type
))
2326 /* Wrap the statement-expression in a TARGET_EXPR so that the
2327 temporary object created by the final expression is destroyed at
2328 the end of the full-expression containing the
2329 statement-expression. */
2330 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2336 /* Returns the expression which provides the value of STMT_EXPR. */
2339 stmt_expr_value_expr (tree stmt_expr
)
2341 tree t
= STMT_EXPR_STMT (stmt_expr
);
2343 if (TREE_CODE (t
) == BIND_EXPR
)
2344 t
= BIND_EXPR_BODY (t
);
2346 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2347 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2349 if (TREE_CODE (t
) == EXPR_STMT
)
2350 t
= EXPR_STMT_EXPR (t
);
2355 /* Return TRUE iff EXPR_STMT is an empty list of
2356 expression statements. */
2359 empty_expr_stmt_p (tree expr_stmt
)
2361 tree body
= NULL_TREE
;
2363 if (expr_stmt
== void_node
)
2368 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2369 body
= EXPR_STMT_EXPR (expr_stmt
);
2370 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2376 if (TREE_CODE (body
) == STATEMENT_LIST
)
2377 return tsi_end_p (tsi_start (body
));
2379 return empty_expr_stmt_p (body
);
2384 /* Perform Koenig lookup. FN_EXPR is the postfix-expression representing
2385 the function (or functions) to call; ARGS are the arguments to the
2386 call. Returns the functions to be considered by overload resolution. */
2389 perform_koenig_lookup (cp_expr fn_expr
, vec
<tree
, va_gc
> *args
,
2390 tsubst_flags_t complain
)
2392 tree identifier
= NULL_TREE
;
2393 tree functions
= NULL_TREE
;
2394 tree tmpl_args
= NULL_TREE
;
2395 bool template_id
= false;
2396 location_t loc
= fn_expr
.get_location ();
2397 tree fn
= fn_expr
.get_value ();
2399 STRIP_ANY_LOCATION_WRAPPER (fn
);
2401 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2403 /* Use a separate flag to handle null args. */
2405 tmpl_args
= TREE_OPERAND (fn
, 1);
2406 fn
= TREE_OPERAND (fn
, 0);
2409 /* Find the name of the overloaded function. */
2410 if (identifier_p (fn
))
2415 identifier
= OVL_NAME (functions
);
2418 /* A call to a namespace-scope function using an unqualified name.
2420 Do Koenig lookup -- unless any of the arguments are
2422 if (!any_type_dependent_arguments_p (args
)
2423 && !any_dependent_template_arguments_p (tmpl_args
))
2425 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2428 /* The unqualified name could not be resolved. */
2429 if (complain
& tf_error
)
2430 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2436 if (fn
&& template_id
&& fn
!= error_mark_node
)
2437 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2439 return cp_expr (fn
, loc
);
2442 /* Generate an expression for `FN (ARGS)'. This may change the
2445 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2446 as a virtual call, even if FN is virtual. (This flag is set when
2447 encountering an expression where the function name is explicitly
2448 qualified. For example a call to `X::f' never generates a virtual
2451 Returns code for the call. */
2454 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2455 bool koenig_p
, tsubst_flags_t complain
)
2459 vec
<tree
, va_gc
> *orig_args
= *args
;
2461 if (fn
== error_mark_node
)
2462 return error_mark_node
;
2464 gcc_assert (!TYPE_P (fn
));
2466 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2467 it so that we can tell this is a call to a known function. */
2468 fn
= maybe_undo_parenthesized_ref (fn
);
2470 STRIP_ANY_LOCATION_WRAPPER (fn
);
2474 if (processing_template_decl
)
2476 /* If FN is a local extern declaration or set thereof, look them up
2477 again at instantiation time. */
2478 if (is_overloaded_fn (fn
))
2480 tree ifn
= get_first_fn (fn
);
2481 if (TREE_CODE (ifn
) == FUNCTION_DECL
2482 && DECL_LOCAL_FUNCTION_P (ifn
))
2483 orig_fn
= DECL_NAME (ifn
);
2486 /* If the call expression is dependent, build a CALL_EXPR node
2487 with no type; type_dependent_expression_p recognizes
2488 expressions with no type as being dependent. */
2489 if (type_dependent_expression_p (fn
)
2490 || any_type_dependent_arguments_p (*args
))
2492 result
= build_min_nt_call_vec (orig_fn
, *args
);
2493 SET_EXPR_LOCATION (result
, cp_expr_loc_or_input_loc (fn
));
2494 KOENIG_LOOKUP_P (result
) = koenig_p
;
2495 if (is_overloaded_fn (fn
))
2500 bool abnormal
= true;
2501 for (lkp_iterator
iter (fn
); abnormal
&& iter
; ++iter
)
2503 tree fndecl
= *iter
;
2504 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2505 || !TREE_THIS_VOLATILE (fndecl
))
2508 /* FIXME: Stop warning about falling off end of non-void
2509 function. But this is wrong. Even if we only see
2510 no-return fns at this point, we could select a
2511 future-defined return fn during instantiation. Or
2514 current_function_returns_abnormally
= 1;
2518 orig_args
= make_tree_vector_copy (*args
);
2519 if (!BASELINK_P (fn
)
2520 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2521 && TREE_TYPE (fn
) != unknown_type_node
)
2522 fn
= build_non_dependent_expr (fn
);
2523 make_args_non_dependent (*args
);
2526 if (TREE_CODE (fn
) == COMPONENT_REF
)
2528 tree member
= TREE_OPERAND (fn
, 1);
2529 if (BASELINK_P (member
))
2531 tree object
= TREE_OPERAND (fn
, 0);
2532 return build_new_method_call (object
, member
,
2535 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2542 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2543 if (TREE_CODE (fn
) == ADDR_EXPR
2544 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2545 fn
= TREE_OPERAND (fn
, 0);
2547 if (is_overloaded_fn (fn
))
2548 fn
= baselink_for_fns (fn
);
2551 if (BASELINK_P (fn
))
2555 /* A call to a member function. From [over.call.func]:
2557 If the keyword this is in scope and refers to the class of
2558 that member function, or a derived class thereof, then the
2559 function call is transformed into a qualified function call
2560 using (*this) as the postfix-expression to the left of the
2561 . operator.... [Otherwise] a contrived object of type T
2562 becomes the implied object argument.
2566 struct A { void f(); };
2567 struct B : public A {};
2568 struct C : public A { void g() { B::f(); }};
2570 "the class of that member function" refers to `A'. But 11.2
2571 [class.access.base] says that we need to convert 'this' to B* as
2572 part of the access, so we pass 'B' to maybe_dummy_object. */
2574 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2576 /* A constructor call always uses a dummy object. (This constructor
2577 call which has the form A::A () is actually invalid and we are
2578 going to reject it later in build_new_method_call.) */
2579 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2582 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2585 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2587 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2592 else if (concept_check_p (fn
))
2594 /* FN is actually a template-id referring to a concept definition. */
2595 tree id
= unpack_concept_check (fn
);
2596 tree tmpl
= TREE_OPERAND (id
, 0);
2597 tree args
= TREE_OPERAND (id
, 1);
2599 if (!function_concept_p (tmpl
))
2601 error_at (EXPR_LOC_OR_LOC (fn
, input_location
),
2602 "cannot call a concept as a function");
2603 return error_mark_node
;
2606 /* Ensure the result is wrapped as a call expression. */
2607 result
= build_concept_check (tmpl
, args
, tf_warning_or_error
);
2609 /* Evaluate the check if it is non-dependent. */
2610 if (!uses_template_parms (args
))
2611 result
= evaluate_concept_check (result
, complain
);
2613 else if (is_overloaded_fn (fn
))
2615 /* If the function is an overloaded builtin, resolve it. */
2616 if (TREE_CODE (fn
) == FUNCTION_DECL
2617 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2618 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2619 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2623 if (warn_sizeof_pointer_memaccess
2624 && (complain
& tf_warning
)
2625 && !vec_safe_is_empty (*args
)
2626 && !processing_template_decl
)
2628 location_t sizeof_arg_loc
[3];
2631 for (i
= 0; i
< 3; i
++)
2635 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2636 sizeof_arg
[i
] = NULL_TREE
;
2637 if (i
>= (*args
)->length ())
2640 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2642 if (SIZEOF_EXPR_TYPE_P (t
))
2643 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2645 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2646 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2648 sizeof_pointer_memaccess_warning
2649 (sizeof_arg_loc
, fn
, *args
,
2650 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2653 if ((complain
& tf_warning
)
2654 && TREE_CODE (fn
) == FUNCTION_DECL
2655 && fndecl_built_in_p (fn
, BUILT_IN_MEMSET
)
2656 && vec_safe_length (*args
) == 3
2657 && !any_type_dependent_arguments_p (*args
))
2659 tree arg0
= (*orig_args
)[0];
2660 tree arg1
= (*orig_args
)[1];
2661 tree arg2
= (*orig_args
)[2];
2662 int literal_mask
= ((literal_integer_zerop (arg1
) << 1)
2663 | (literal_integer_zerop (arg2
) << 2));
2664 arg2
= instantiate_non_dependent_expr (arg2
);
2665 warn_for_memset (input_location
, arg0
, arg2
, literal_mask
);
2668 /* A call to a namespace-scope function. */
2669 result
= build_new_function_call (fn
, args
, complain
);
2672 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2674 if (!vec_safe_is_empty (*args
))
2675 error ("arguments to destructor are not allowed");
2676 /* Mark the pseudo-destructor call as having side-effects so
2677 that we do not issue warnings about its use. */
2678 result
= build1 (NOP_EXPR
,
2680 TREE_OPERAND (fn
, 0));
2681 TREE_SIDE_EFFECTS (result
) = 1;
2683 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2684 /* If the "function" is really an object of class type, it might
2685 have an overloaded `operator ()'. */
2686 result
= build_op_call (fn
, args
, complain
);
2689 /* A call where the function is unknown. */
2690 result
= cp_build_function_call_vec (fn
, args
, complain
);
2692 if (processing_template_decl
&& result
!= error_mark_node
)
2694 if (INDIRECT_REF_P (result
))
2695 result
= TREE_OPERAND (result
, 0);
2696 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2697 SET_EXPR_LOCATION (result
, input_location
);
2698 KOENIG_LOOKUP_P (result
) = koenig_p
;
2699 release_tree_vector (orig_args
);
2700 result
= convert_from_reference (result
);
2706 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2707 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2708 POSTDECREMENT_EXPR.) */
2711 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2713 /* input_location holds the location of the trailing operator token.
2714 Build a location of the form:
2717 with the caret at the operator token, ranging from the start
2718 of EXPR to the end of the operator token. */
2719 location_t combined_loc
= make_location (input_location
,
2721 get_finish (input_location
));
2722 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2723 tf_warning_or_error
);
2724 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2725 result
.set_location (combined_loc
);
2729 /* Finish a use of `this'. Returns an expression for `this'. */
2732 finish_this_expr (void)
2734 tree result
= NULL_TREE
;
2736 if (current_class_ptr
)
2738 tree type
= TREE_TYPE (current_class_ref
);
2740 /* In a lambda expression, 'this' refers to the captured 'this'. */
2741 if (LAMBDA_TYPE_P (type
))
2742 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2744 result
= current_class_ptr
;
2748 /* The keyword 'this' is a prvalue expression. */
2749 return rvalue (result
);
2751 tree fn
= current_nonlambda_function ();
2752 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2753 error ("%<this%> is unavailable for static member functions");
2755 error ("invalid use of %<this%> in non-member function");
2757 error ("invalid use of %<this%> at top level");
2758 return error_mark_node
;
2761 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2762 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2763 the TYPE for the type given. If SCOPE is non-NULL, the expression
2764 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2767 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2770 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2771 return error_mark_node
;
2773 gcc_assert (TYPE_P (destructor
));
2775 if (!processing_template_decl
)
2777 if (scope
== error_mark_node
)
2779 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2780 return error_mark_node
;
2782 if (is_auto (destructor
))
2783 destructor
= TREE_TYPE (object
);
2784 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2787 "qualified type %qT does not match destructor name ~%qT",
2789 return error_mark_node
;
2793 /* [expr.pseudo] says both:
2795 The type designated by the pseudo-destructor-name shall be
2796 the same as the object type.
2800 The cv-unqualified versions of the object type and of the
2801 type designated by the pseudo-destructor-name shall be the
2804 We implement the more generous second sentence, since that is
2805 what most other compilers do. */
2806 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2809 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2810 return error_mark_node
;
2814 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2818 /* Finish an expression of the form CODE EXPR. */
2821 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2822 tsubst_flags_t complain
)
2824 /* Build a location of the form:
2827 with the caret at the operator token, ranging from the start
2828 of the operator token to the end of EXPR. */
2829 location_t combined_loc
= make_location (op_loc
,
2830 op_loc
, expr
.get_finish ());
2831 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2832 /* TODO: build_x_unary_op doesn't always honor the location. */
2833 result
.set_location (combined_loc
);
2835 if (result
== error_mark_node
)
2838 if (!(complain
& tf_warning
))
2841 tree result_ovl
= result
;
2842 tree expr_ovl
= expr
;
2844 if (!processing_template_decl
)
2845 expr_ovl
= cp_fully_fold (expr_ovl
);
2847 if (!CONSTANT_CLASS_P (expr_ovl
)
2848 || TREE_OVERFLOW_P (expr_ovl
))
2851 if (!processing_template_decl
)
2852 result_ovl
= cp_fully_fold (result_ovl
);
2854 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2855 overflow_warning (combined_loc
, result_ovl
);
2860 /* Finish a compound-literal expression or C++11 functional cast with aggregate
2861 initializer. TYPE is the type to which the CONSTRUCTOR in COMPOUND_LITERAL
2865 finish_compound_literal (tree type
, tree compound_literal
,
2866 tsubst_flags_t complain
,
2869 if (type
== error_mark_node
)
2870 return error_mark_node
;
2872 if (TYPE_REF_P (type
))
2875 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2876 complain
, fcl_context
);
2877 /* The prvalue is then used to direct-initialize the reference. */
2878 tree r
= (perform_implicit_conversion_flags
2879 (type
, compound_literal
, complain
, LOOKUP_NORMAL
));
2880 return convert_from_reference (r
);
2883 if (!TYPE_OBJ_P (type
))
2885 if (complain
& tf_error
)
2886 error ("compound literal of non-object type %qT", type
);
2887 return error_mark_node
;
2890 if (tree anode
= type_uses_auto (type
))
2891 if (CLASS_PLACEHOLDER_TEMPLATE (anode
))
2893 type
= do_auto_deduction (type
, compound_literal
, anode
, complain
,
2895 if (type
== error_mark_node
)
2896 return error_mark_node
;
2899 /* Used to hold a copy of the compound literal in a template. */
2900 tree orig_cl
= NULL_TREE
;
2902 if (processing_template_decl
)
2904 const bool dependent_p
2905 = (instantiation_dependent_expression_p (compound_literal
)
2906 || dependent_type_p (type
));
2908 /* We're about to return, no need to copy. */
2909 orig_cl
= compound_literal
;
2911 /* We're going to need a copy. */
2912 orig_cl
= unshare_constructor (compound_literal
);
2913 TREE_TYPE (orig_cl
) = type
;
2914 /* Mark the expression as a compound literal. */
2915 TREE_HAS_CONSTRUCTOR (orig_cl
) = 1;
2916 /* And as instantiation-dependent. */
2917 CONSTRUCTOR_IS_DEPENDENT (orig_cl
) = dependent_p
;
2918 if (fcl_context
== fcl_c99
)
2919 CONSTRUCTOR_C99_COMPOUND_LITERAL (orig_cl
) = 1;
2920 /* If the compound literal is dependent, we're done for now. */
2923 /* Otherwise, do go on to e.g. check narrowing. */
2926 type
= complete_type (type
);
2928 if (TYPE_NON_AGGREGATE_CLASS (type
))
2930 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2931 everywhere that deals with function arguments would be a pain, so
2932 just wrap it in a TREE_LIST. The parser set a flag so we know
2933 that it came from T{} rather than T({}). */
2934 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2935 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2936 return build_functional_cast (type
, compound_literal
, complain
);
2939 if (TREE_CODE (type
) == ARRAY_TYPE
2940 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2941 return error_mark_node
;
2942 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2943 if (SCALAR_TYPE_P (type
)
2944 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
))
2946 tree t
= instantiate_non_dependent_expr_sfinae (compound_literal
,
2948 if (!check_narrowing (type
, t
, complain
))
2949 return error_mark_node
;
2951 if (TREE_CODE (type
) == ARRAY_TYPE
2952 && TYPE_DOMAIN (type
) == NULL_TREE
)
2954 cp_complete_array_type_or_error (&type
, compound_literal
,
2956 if (type
== error_mark_node
)
2957 return error_mark_node
;
2959 compound_literal
= digest_init_flags (type
, compound_literal
,
2960 LOOKUP_NORMAL
| LOOKUP_NO_NARROWING
,
2962 if (compound_literal
== error_mark_node
)
2963 return error_mark_node
;
2965 /* If we're in a template, return the original compound literal. */
2968 if (!VECTOR_TYPE_P (type
))
2969 return get_target_expr_sfinae (orig_cl
, complain
);
2974 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2976 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2977 if (fcl_context
== fcl_c99
)
2978 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2981 /* Put static/constant array temporaries in static variables. */
2982 /* FIXME all C99 compound literals should be variables rather than C++
2983 temporaries, unless they are used as an aggregate initializer. */
2984 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2985 && fcl_context
== fcl_c99
2986 && TREE_CODE (type
) == ARRAY_TYPE
2987 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2988 && initializer_constant_valid_p (compound_literal
, type
))
2990 tree decl
= create_temporary_var (type
);
2991 DECL_INITIAL (decl
) = compound_literal
;
2992 TREE_STATIC (decl
) = 1;
2993 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2995 /* 5.19 says that a constant expression can include an
2996 lvalue-rvalue conversion applied to "a glvalue of literal type
2997 that refers to a non-volatile temporary object initialized
2998 with a constant expression". Rather than try to communicate
2999 that this VAR_DECL is a temporary, just mark it constexpr. */
3000 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
3001 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
3002 TREE_CONSTANT (decl
) = true;
3004 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
3005 decl
= pushdecl_top_level (decl
);
3006 DECL_NAME (decl
) = make_anon_name ();
3007 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
3008 /* Make sure the destructor is callable. */
3009 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
3010 if (clean
== error_mark_node
)
3011 return error_mark_node
;
3015 /* Represent other compound literals with TARGET_EXPR so we produce
3016 an lvalue, but can elide copies. */
3017 if (!VECTOR_TYPE_P (type
))
3018 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
3020 return compound_literal
;
3023 /* Return the declaration for the function-name variable indicated by
3027 finish_fname (tree id
)
3031 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
3032 if (processing_template_decl
&& current_function_decl
3033 && decl
!= error_mark_node
)
3034 decl
= DECL_NAME (decl
);
3038 /* Finish a translation unit. */
3041 finish_translation_unit (void)
3043 /* In case there were missing closebraces,
3044 get us back to the global binding level. */
3046 while (current_namespace
!= global_namespace
)
3049 /* Do file scope __FUNCTION__ et al. */
3050 finish_fname_decls ();
3052 if (scope_chain
->omp_declare_target_attribute
)
3055 error ("%<#pragma omp declare target%> without corresponding "
3056 "%<#pragma omp end declare target%>");
3057 scope_chain
->omp_declare_target_attribute
= 0;
3061 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
3062 Returns the parameter. */
3065 finish_template_type_parm (tree aggr
, tree identifier
)
3067 if (aggr
!= class_type_node
)
3069 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
3070 aggr
= class_type_node
;
3073 return build_tree_list (aggr
, identifier
);
3076 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
3077 Returns the parameter. */
3080 finish_template_template_parm (tree aggr
, tree identifier
)
3082 tree decl
= build_decl (input_location
,
3083 TYPE_DECL
, identifier
, NULL_TREE
);
3085 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
3086 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
3087 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
3088 DECL_ARTIFICIAL (decl
) = 1;
3090 /* Associate the constraints with the underlying declaration,
3091 not the template. */
3092 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
3093 tree constr
= build_constraints (reqs
, NULL_TREE
);
3094 set_constraints (decl
, constr
);
3096 end_template_decl ();
3098 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
3100 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
3101 /*is_primary=*/true, /*is_partial=*/false,
3104 return finish_template_type_parm (aggr
, tmpl
);
3107 /* ARGUMENT is the default-argument value for a template template
3108 parameter. If ARGUMENT is invalid, issue error messages and return
3109 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
3112 check_template_template_default_arg (tree argument
)
3114 if (TREE_CODE (argument
) != TEMPLATE_DECL
3115 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
3116 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
3118 if (TREE_CODE (argument
) == TYPE_DECL
)
3119 error ("invalid use of type %qT as a default value for a template "
3120 "template-parameter", TREE_TYPE (argument
));
3122 error ("invalid default argument for a template template parameter");
3123 return error_mark_node
;
3129 /* Begin a class definition, as indicated by T. */
3132 begin_class_definition (tree t
)
3134 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
3135 return error_mark_node
;
3137 if (processing_template_parmlist
&& !LAMBDA_TYPE_P (t
))
3139 error ("definition of %q#T inside template parameter list", t
);
3140 return error_mark_node
;
3143 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
3144 are passed the same as decimal scalar types. */
3145 if (TREE_CODE (t
) == RECORD_TYPE
3146 && !processing_template_decl
)
3148 tree ns
= TYPE_CONTEXT (t
);
3149 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
3150 && DECL_CONTEXT (ns
) == std_node
3152 && id_equal (DECL_NAME (ns
), "decimal"))
3154 const char *n
= TYPE_NAME_STRING (t
);
3155 if ((strcmp (n
, "decimal32") == 0)
3156 || (strcmp (n
, "decimal64") == 0)
3157 || (strcmp (n
, "decimal128") == 0))
3158 TYPE_TRANSPARENT_AGGR (t
) = 1;
3162 /* A non-implicit typename comes from code like:
3164 template <typename T> struct A {
3165 template <typename U> struct A<T>::B ...
3167 This is erroneous. */
3168 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
3170 error ("invalid definition of qualified type %qT", t
);
3171 t
= error_mark_node
;
3174 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
3176 t
= make_class_type (RECORD_TYPE
);
3177 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
3180 if (TYPE_BEING_DEFINED (t
))
3182 t
= make_class_type (TREE_CODE (t
));
3183 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
3185 maybe_process_partial_specialization (t
);
3187 TYPE_BEING_DEFINED (t
) = 1;
3188 class_binding_level
->defining_class_p
= 1;
3190 if (flag_pack_struct
)
3193 TYPE_PACKED (t
) = 1;
3194 /* Even though the type is being defined for the first time
3195 here, there might have been a forward declaration, so there
3196 might be cv-qualified variants of T. */
3197 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
3198 TYPE_PACKED (v
) = 1;
3200 /* Reset the interface data, at the earliest possible
3201 moment, as it might have been set via a class foo;
3203 if (! TYPE_UNNAMED_P (t
))
3205 struct c_fileinfo
*finfo
= \
3206 get_fileinfo (LOCATION_FILE (input_location
));
3207 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
3208 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
3209 (t
, finfo
->interface_unknown
);
3211 reset_specialization();
3213 /* Make a declaration for this class in its own scope. */
3214 build_self_reference ();
3219 /* Finish the member declaration given by DECL. */
3222 finish_member_declaration (tree decl
)
3224 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
3227 if (decl
== void_type_node
)
3228 /* The COMPONENT was a friend, not a member, and so there's
3229 nothing for us to do. */
3232 /* We should see only one DECL at a time. */
3233 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
3235 /* Don't add decls after definition. */
3236 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3237 /* We can add lambda types when late parsing default
3239 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3241 /* Set up access control for DECL. */
3243 = (current_access_specifier
== access_private_node
);
3244 TREE_PROTECTED (decl
)
3245 = (current_access_specifier
== access_protected_node
);
3246 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3248 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
3249 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
3252 /* Mark the DECL as a member of the current class, unless it's
3253 a member of an enumeration. */
3254 if (TREE_CODE (decl
) != CONST_DECL
)
3255 DECL_CONTEXT (decl
) = current_class_type
;
3257 if (TREE_CODE (decl
) == USING_DECL
)
3258 /* For now, ignore class-scope USING_DECLS, so that debugging
3259 backends do not see them. */
3260 DECL_IGNORED_P (decl
) = 1;
3262 /* Check for bare parameter packs in the non-static data member
3264 if (TREE_CODE (decl
) == FIELD_DECL
)
3266 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3267 TREE_TYPE (decl
) = error_mark_node
;
3268 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
3269 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
3274 A C language linkage is ignored for the names of class members
3275 and the member function type of class member functions. */
3276 if (DECL_LANG_SPECIFIC (decl
))
3277 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3281 /* Functions and non-functions are added differently. */
3282 if (DECL_DECLARES_FUNCTION_P (decl
))
3283 add
= add_method (current_class_type
, decl
, false);
3284 /* Enter the DECL into the scope of the class, if the class
3285 isn't a closure (whose fields are supposed to be unnamed). */
3286 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3287 || pushdecl_class_level (decl
))
3292 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3293 go at the beginning. The reason is that
3294 legacy_nonfn_member_lookup searches the list in order, and we
3295 want a field name to override a type name so that the "struct
3296 stat hack" will work. In particular:
3298 struct S { enum E { }; static const int E = 5; int ary[S::E]; } s;
3302 if (TREE_CODE (decl
) == TYPE_DECL
)
3303 TYPE_FIELDS (current_class_type
)
3304 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3307 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3308 TYPE_FIELDS (current_class_type
) = decl
;
3311 maybe_add_class_template_decl_list (current_class_type
, decl
,
3316 /* Finish processing a complete template declaration. The PARMS are
3317 the template parameters. */
3320 finish_template_decl (tree parms
)
3323 end_template_decl ();
3325 end_specialization ();
3328 // Returns the template type of the class scope being entered. If we're
3329 // entering a constrained class scope. TYPE is the class template
3330 // scope being entered and we may need to match the intended type with
3331 // a constrained specialization. For example:
3333 // template<Object T>
3334 // struct S { void f(); }; #1
3336 // template<Object T>
3337 // void S<T>::f() { } #2
3339 // We check, in #2, that S<T> refers precisely to the type declared by
3340 // #1 (i.e., that the constraints match). Note that the following should
3341 // be an error since there is no specialization of S<T> that is
3342 // unconstrained, but this is not diagnosed here.
3344 // template<typename T>
3345 // void S<T>::f() { }
3347 // We cannot diagnose this problem here since this function also matches
3348 // qualified template names that are not part of a definition. For example:
3350 // template<Integral T, Floating_point U>
3351 // typename pair<T, U>::first_type void f(T, U);
3353 // Here, it is unlikely that there is a partial specialization of
3354 // pair constrained for for Integral and Floating_point arguments.
3356 // The general rule is: if a constrained specialization with matching
3357 // constraints is found return that type. Also note that if TYPE is not a
3358 // class-type (e.g. a typename type), then no fixup is needed.
3361 fixup_template_type (tree type
)
3363 // Find the template parameter list at the a depth appropriate to
3364 // the scope we're trying to enter.
3365 tree parms
= current_template_parms
;
3366 int depth
= template_class_depth (type
);
3367 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3368 parms
= TREE_CHAIN (parms
);
3371 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3372 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3374 // Search for a specialization whose type and constraints match.
3375 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3376 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3379 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3381 // If the type and constraints match a specialization, then we
3382 // are entering that type.
3383 if (same_type_p (type
, TREE_TYPE (specs
))
3384 && equivalent_constraints (cur_constr
, spec_constr
))
3385 return TREE_TYPE (specs
);
3386 specs
= TREE_CHAIN (specs
);
3389 // If no specialization matches, then must return the type
3390 // previously found.
3394 /* Finish processing a template-id (which names a type) of the form
3395 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3396 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3397 the scope of template-id indicated. */
3400 finish_template_type (tree name
, tree args
, int entering_scope
)
3404 type
= lookup_template_class (name
, args
,
3405 NULL_TREE
, NULL_TREE
, entering_scope
,
3406 tf_warning_or_error
| tf_user
);
3408 /* If we might be entering the scope of a partial specialization,
3409 find the one with the right constraints. */
3412 && CLASS_TYPE_P (type
)
3413 && CLASSTYPE_TEMPLATE_INFO (type
)
3414 && dependent_type_p (type
)
3415 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3416 type
= fixup_template_type (type
);
3418 if (type
== error_mark_node
)
3420 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3421 return TYPE_STUB_DECL (type
);
3423 return TYPE_NAME (type
);
3426 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3427 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3428 BASE_CLASS, or NULL_TREE if an error occurred. The
3429 ACCESS_SPECIFIER is one of
3430 access_{default,public,protected_private}_node. For a virtual base
3431 we set TREE_TYPE. */
3434 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3438 if (base
== error_mark_node
)
3440 error ("invalid base-class specification");
3443 else if (! MAYBE_CLASS_TYPE_P (base
))
3445 error ("%qT is not a class type", base
);
3450 if (cp_type_quals (base
) != 0)
3452 /* DR 484: Can a base-specifier name a cv-qualified
3454 base
= TYPE_MAIN_VARIANT (base
);
3456 result
= build_tree_list (access
, base
);
3458 TREE_TYPE (result
) = integer_type_node
;
3464 /* If FNS is a member function, a set of member functions, or a
3465 template-id referring to one or more member functions, return a
3466 BASELINK for FNS, incorporating the current access context.
3467 Otherwise, return FNS unchanged. */
3470 baselink_for_fns (tree fns
)
3475 if (BASELINK_P (fns
)
3476 || error_operand_p (fns
))
3479 scope
= ovl_scope (fns
);
3480 if (!CLASS_TYPE_P (scope
))
3483 cl
= currently_open_derived_class (scope
);
3486 cl
= TYPE_BINFO (cl
);
3487 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3490 /* Returns true iff DECL is a variable from a function outside
3494 outer_var_p (tree decl
)
3496 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3497 && DECL_FUNCTION_SCOPE_P (decl
)
3498 /* Don't get confused by temporaries. */
3500 && (DECL_CONTEXT (decl
) != current_function_decl
3501 || parsing_nsdmi ()));
3504 /* As above, but also checks that DECL is automatic. */
3507 outer_automatic_var_p (tree decl
)
3509 return (outer_var_p (decl
)
3510 && !TREE_STATIC (decl
));
3513 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3514 rewrite it for lambda capture.
3516 If ODR_USE is true, we're being called from mark_use, and we complain about
3517 use of constant variables. If ODR_USE is false, we're being called for the
3518 id-expression, and we do lambda capture. */
3521 process_outer_var_ref (tree decl
, tsubst_flags_t complain
, bool odr_use
)
3523 if (cp_unevaluated_operand
)
3524 /* It's not a use (3.2) if we're in an unevaluated context. */
3526 if (decl
== error_mark_node
)
3529 tree context
= DECL_CONTEXT (decl
);
3530 tree containing_function
= current_function_decl
;
3531 tree lambda_stack
= NULL_TREE
;
3532 tree lambda_expr
= NULL_TREE
;
3533 tree initializer
= convert_from_reference (decl
);
3535 /* Mark it as used now even if the use is ill-formed. */
3536 if (!mark_used (decl
, complain
))
3537 return error_mark_node
;
3539 if (parsing_nsdmi ())
3540 containing_function
= NULL_TREE
;
3542 if (containing_function
&& LAMBDA_FUNCTION_P (containing_function
))
3544 /* Check whether we've already built a proxy. */
3546 while (is_normal_capture_proxy (var
))
3547 var
= DECL_CAPTURED_VARIABLE (var
);
3548 tree d
= retrieve_local_specialization (var
);
3550 if (d
&& d
!= decl
&& is_capture_proxy (d
))
3552 if (DECL_CONTEXT (d
) == containing_function
)
3553 /* We already have an inner proxy. */
3556 /* We need to capture an outer proxy. */
3557 return process_outer_var_ref (d
, complain
, odr_use
);
3561 /* If we are in a lambda function, we can move out until we hit
3563 2. a non-lambda function, or
3564 3. a non-default capturing lambda function. */
3565 while (context
!= containing_function
3566 /* containing_function can be null with invalid generic lambdas. */
3567 && containing_function
3568 && LAMBDA_FUNCTION_P (containing_function
))
3570 tree closure
= DECL_CONTEXT (containing_function
);
3571 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3573 if (TYPE_CLASS_SCOPE_P (closure
))
3574 /* A lambda in an NSDMI (c++/64496). */
3577 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_NONE
)
3580 lambda_stack
= tree_cons (NULL_TREE
, lambda_expr
, lambda_stack
);
3582 containing_function
= decl_function_context (containing_function
);
3585 /* In a lambda within a template, wait until instantiation time to implicitly
3586 capture a parameter pack. We want to wait because we don't know if we're
3587 capturing the whole pack or a single element, and it's OK to wait because
3588 find_parameter_packs_r walks into the lambda body. */
3589 if (context
== containing_function
3590 && DECL_PACK_P (decl
))
3593 if (lambda_expr
&& VAR_P (decl
) && DECL_ANON_UNION_VAR_P (decl
))
3595 if (complain
& tf_error
)
3596 error ("cannot capture member %qD of anonymous union", decl
);
3597 return error_mark_node
;
3599 /* Do lambda capture when processing the id-expression, not when
3600 odr-using a variable. */
3601 if (!odr_use
&& context
== containing_function
)
3602 decl
= add_default_capture (lambda_stack
,
3603 /*id=*/DECL_NAME (decl
), initializer
);
3604 /* Only an odr-use of an outer automatic variable causes an
3605 error, and a constant variable can decay to a prvalue
3606 constant without odr-use. So don't complain yet. */
3607 else if (!odr_use
&& decl_constant_var_p (decl
))
3609 else if (lambda_expr
)
3611 if (complain
& tf_error
)
3613 error ("%qD is not captured", decl
);
3614 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3615 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_NONE
)
3616 inform (location_of (closure
),
3617 "the lambda has no capture-default");
3618 else if (TYPE_CLASS_SCOPE_P (closure
))
3619 inform (UNKNOWN_LOCATION
, "lambda in local class %q+T cannot "
3620 "capture variables from the enclosing context",
3621 TYPE_CONTEXT (closure
));
3622 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3624 return error_mark_node
;
3628 if (complain
& tf_error
)
3631 ? G_("use of local variable with automatic storage from "
3632 "containing function")
3633 : G_("use of parameter from containing function"));
3634 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3636 return error_mark_node
;
3641 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3642 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3643 if non-NULL, is the type or namespace used to explicitly qualify
3644 ID_EXPRESSION. DECL is the entity to which that name has been
3647 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3648 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3649 be set to true if this expression isn't permitted in a
3650 constant-expression, but it is otherwise not set by this function.
3651 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3652 constant-expression, but a non-constant expression is also
3655 DONE is true if this expression is a complete postfix-expression;
3656 it is false if this expression is followed by '->', '[', '(', etc.
3657 ADDRESS_P is true iff this expression is the operand of '&'.
3658 TEMPLATE_P is true iff the qualified-id was of the form
3659 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3660 appears as a template argument.
3662 If an error occurs, and it is the kind of error that might cause
3663 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3664 is the caller's responsibility to issue the message. *ERROR_MSG
3665 will be a string with static storage duration, so the caller need
3668 Return an expression for the entity, after issuing appropriate
3669 diagnostics. This function is also responsible for transforming a
3670 reference to a non-static member into a COMPONENT_REF that makes
3671 the use of "this" explicit.
3673 Upon return, *IDK will be filled in appropriately. */
3675 finish_id_expression_1 (tree id_expression
,
3679 bool integral_constant_expression_p
,
3680 bool allow_non_integral_constant_expression_p
,
3681 bool *non_integral_constant_expression_p
,
3685 bool template_arg_p
,
3686 const char **error_msg
,
3687 location_t location
)
3689 decl
= strip_using_decl (decl
);
3691 /* Initialize the output parameters. */
3692 *idk
= CP_ID_KIND_NONE
;
3695 if (id_expression
== error_mark_node
)
3696 return error_mark_node
;
3697 /* If we have a template-id, then no further lookup is
3698 required. If the template-id was for a template-class, we
3699 will sometimes have a TYPE_DECL at this point. */
3700 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3701 || TREE_CODE (decl
) == TYPE_DECL
)
3703 /* Look up the name. */
3706 if (decl
== error_mark_node
)
3708 /* Name lookup failed. */
3711 || (!dependent_type_p (scope
)
3712 && !(identifier_p (id_expression
)
3713 && IDENTIFIER_CONV_OP_P (id_expression
)
3714 && dependent_type_p (TREE_TYPE (id_expression
))))))
3716 /* If the qualifying type is non-dependent (and the name
3717 does not name a conversion operator to a dependent
3718 type), issue an error. */
3719 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3720 return error_mark_node
;
3724 /* It may be resolved via Koenig lookup. */
3725 *idk
= CP_ID_KIND_UNQUALIFIED
;
3726 return id_expression
;
3729 decl
= id_expression
;
3732 /* Remember that the name was used in the definition of
3733 the current class so that we can check later to see if
3734 the meaning would have been different after the class
3735 was entirely defined. */
3736 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3737 maybe_note_name_used_in_class (id_expression
, decl
);
3739 /* A use in unevaluated operand might not be instantiated appropriately
3740 if tsubst_copy builds a dummy parm, or if we never instantiate a
3741 generic lambda, so mark it now. */
3742 if (processing_template_decl
&& cp_unevaluated_operand
)
3743 mark_type_use (decl
);
3745 /* Disallow uses of local variables from containing functions, except
3746 within lambda-expressions. */
3747 if (outer_automatic_var_p (decl
))
3749 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3750 if (decl
== error_mark_node
)
3751 return error_mark_node
;
3754 /* Also disallow uses of function parameters outside the function
3755 body, except inside an unevaluated context (i.e. decltype). */
3756 if (TREE_CODE (decl
) == PARM_DECL
3757 && DECL_CONTEXT (decl
) == NULL_TREE
3758 && !cp_unevaluated_operand
)
3760 *error_msg
= G_("use of parameter outside function body");
3761 return error_mark_node
;
3765 /* If we didn't find anything, or what we found was a type,
3766 then this wasn't really an id-expression. */
3767 if (TREE_CODE (decl
) == TEMPLATE_DECL
3768 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3770 *error_msg
= G_("missing template arguments");
3771 return error_mark_node
;
3773 else if (TREE_CODE (decl
) == TYPE_DECL
3774 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3776 *error_msg
= G_("expected primary-expression");
3777 return error_mark_node
;
3780 /* If the name resolved to a template parameter, there is no
3781 need to look it up again later. */
3782 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3783 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3787 *idk
= CP_ID_KIND_NONE
;
3788 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3789 decl
= TEMPLATE_PARM_DECL (decl
);
3790 r
= DECL_INITIAL (decl
);
3791 if (CLASS_TYPE_P (TREE_TYPE (r
)) && !CP_TYPE_CONST_P (TREE_TYPE (r
)))
3793 /* If the entity is a template parameter object for a template
3794 parameter of type T, the type of the expression is const T. */
3795 tree ctype
= TREE_TYPE (r
);
3796 ctype
= cp_build_qualified_type (ctype
, (cp_type_quals (ctype
)
3797 | TYPE_QUAL_CONST
));
3798 r
= build1 (VIEW_CONVERT_EXPR
, ctype
, r
);
3800 r
= convert_from_reference (r
);
3801 if (integral_constant_expression_p
3802 && !dependent_type_p (TREE_TYPE (decl
))
3803 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3805 if (!allow_non_integral_constant_expression_p
)
3806 error ("template parameter %qD of type %qT is not allowed in "
3807 "an integral constant expression because it is not of "
3808 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3809 *non_integral_constant_expression_p
= true;
3815 bool dependent_p
= type_dependent_expression_p (decl
);
3817 /* If the declaration was explicitly qualified indicate
3818 that. The semantics of `A::f(3)' are different than
3819 `f(3)' if `f' is virtual. */
3821 ? CP_ID_KIND_QUALIFIED
3822 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3823 ? CP_ID_KIND_TEMPLATE_ID
3825 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3826 : CP_ID_KIND_UNQUALIFIED
)));
3830 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3831 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3832 wrong, so just return the identifier. */
3833 return id_expression
;
3835 if (DECL_CLASS_TEMPLATE_P (decl
))
3837 error ("use of class template %qT as expression", decl
);
3838 return error_mark_node
;
3841 if (TREE_CODE (decl
) == TREE_LIST
)
3843 /* Ambiguous reference to base members. */
3844 error ("request for member %qD is ambiguous in "
3845 "multiple inheritance lattice", id_expression
);
3846 print_candidates (decl
);
3847 return error_mark_node
;
3850 /* Mark variable-like entities as used. Functions are similarly
3851 marked either below or after overload resolution. */
3853 || TREE_CODE (decl
) == PARM_DECL
3854 || TREE_CODE (decl
) == CONST_DECL
3855 || TREE_CODE (decl
) == RESULT_DECL
)
3856 && !mark_used (decl
))
3857 return error_mark_node
;
3859 /* Only certain kinds of names are allowed in constant
3860 expression. Template parameters have already
3861 been handled above. */
3862 if (! error_operand_p (decl
)
3864 && integral_constant_expression_p
3865 && !decl_constant_var_p (decl
)
3866 && TREE_CODE (decl
) != CONST_DECL
3867 && !builtin_valid_in_constant_expr_p (decl
)
3868 && !concept_check_p (decl
))
3870 if (!allow_non_integral_constant_expression_p
)
3872 error ("%qD cannot appear in a constant-expression", decl
);
3873 return error_mark_node
;
3875 *non_integral_constant_expression_p
= true;
3878 if (tree wrap
= maybe_get_tls_wrapper_call (decl
))
3879 /* Replace an evaluated use of the thread_local variable with
3880 a call to its wrapper. */
3882 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3884 && variable_template_p (TREE_OPERAND (decl
, 0))
3885 && !concept_check_p (decl
))
3887 decl
= finish_template_variable (decl
);
3889 decl
= convert_from_reference (decl
);
3891 else if (concept_check_p (decl
))
3893 /* If this is a standard or variable concept check, potentially
3894 evaluate it. Function concepts need to be called as functions,
3895 so don't try evaluating them here. */
3896 tree tmpl
= TREE_OPERAND (decl
, 0);
3897 tree args
= TREE_OPERAND (decl
, 1);
3898 if (!function_concept_p (tmpl
) && !uses_template_parms (args
))
3899 decl
= evaluate_concept_check (decl
, tf_warning_or_error
);
3903 if (TREE_CODE (decl
) == SCOPE_REF
)
3905 gcc_assert (same_type_p (scope
, TREE_OPERAND (decl
, 0)));
3906 decl
= TREE_OPERAND (decl
, 1);
3909 decl
= (adjust_result_of_qualified_name_lookup
3910 (decl
, scope
, current_nonlambda_class_type()));
3912 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3915 cp_warn_deprecated_use_scopes (scope
);
3918 decl
= finish_qualified_id_expr (scope
,
3924 tf_warning_or_error
);
3926 decl
= convert_from_reference (decl
);
3928 else if (TREE_CODE (decl
) == FIELD_DECL
)
3930 /* Since SCOPE is NULL here, this is an unqualified name.
3931 Access checking has been performed during name lookup
3932 already. Turn off checking to avoid duplicate errors. */
3933 push_deferring_access_checks (dk_no_check
);
3934 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3935 /*qualifying_scope=*/NULL_TREE
);
3936 pop_deferring_access_checks ();
3938 else if (is_overloaded_fn (decl
))
3940 /* We only need to look at the first function,
3941 because all the fns share the attribute we're
3942 concerned with (all member fns or all non-members). */
3943 tree first_fn
= get_first_fn (decl
);
3944 first_fn
= STRIP_TEMPLATE (first_fn
);
3946 /* [basic.def.odr]: "A function whose name appears as a
3947 potentially-evaluated expression is odr-used if it is the unique
3950 But only mark it if it's a complete postfix-expression; in a call,
3951 ADL might select a different function, and we'll call mark_used in
3954 && !really_overloaded_fn (decl
)
3955 && !mark_used (first_fn
))
3956 return error_mark_node
;
3959 && (TREE_CODE (first_fn
) == USING_DECL
3960 || (TREE_CODE (first_fn
) == FUNCTION_DECL
3961 && DECL_FUNCTION_MEMBER_P (first_fn
)
3962 && !shared_member_p (decl
))))
3964 /* A set of member functions. */
3965 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3966 return finish_class_member_access_expr (decl
, id_expression
,
3967 /*template_p=*/false,
3968 tf_warning_or_error
);
3971 decl
= baselink_for_fns (decl
);
3973 else if (concept_check_p (decl
))
3975 /* If this is a standard or variable concept check, potentially
3976 evaluate it. Function concepts need to be called as functions,
3977 so don't try evaluating them here. */
3978 tree tmpl
= TREE_OPERAND (decl
, 0);
3979 tree args
= TREE_OPERAND (decl
, 1);
3980 if (!function_concept_p (tmpl
) && !uses_template_parms (args
))
3981 decl
= evaluate_concept_check (decl
, tf_warning_or_error
);
3985 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3986 && DECL_CLASS_SCOPE_P (decl
))
3988 tree context
= context_for_name_lookup (decl
);
3989 if (context
!= current_class_type
)
3991 tree path
= currently_open_derived_class (context
);
3992 perform_or_defer_access_check (TYPE_BINFO (path
),
3994 tf_warning_or_error
);
3998 decl
= convert_from_reference (decl
);
4002 return cp_expr (decl
, location
);
4005 /* As per finish_id_expression_1, but adding a wrapper node
4006 around the result if needed to express LOCATION. */
4009 finish_id_expression (tree id_expression
,
4013 bool integral_constant_expression_p
,
4014 bool allow_non_integral_constant_expression_p
,
4015 bool *non_integral_constant_expression_p
,
4019 bool template_arg_p
,
4020 const char **error_msg
,
4021 location_t location
)
4024 = finish_id_expression_1 (id_expression
, decl
, scope
, idk
,
4025 integral_constant_expression_p
,
4026 allow_non_integral_constant_expression_p
,
4027 non_integral_constant_expression_p
,
4028 template_p
, done
, address_p
, template_arg_p
,
4029 error_msg
, location
);
4030 return result
.maybe_add_location_wrapper ();
4033 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
4034 use as a type-specifier. */
4037 finish_typeof (tree expr
)
4041 if (type_dependent_expression_p (expr
))
4043 type
= cxx_make_type (TYPEOF_TYPE
);
4044 TYPEOF_TYPE_EXPR (type
) = expr
;
4045 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4050 expr
= mark_type_use (expr
);
4052 type
= unlowered_expr_type (expr
);
4054 if (!type
|| type
== unknown_type_node
)
4056 error ("type of %qE is unknown", expr
);
4057 return error_mark_node
;
4063 /* Implement the __underlying_type keyword: Return the underlying
4064 type of TYPE, suitable for use as a type-specifier. */
4067 finish_underlying_type (tree type
)
4069 tree underlying_type
;
4071 if (processing_template_decl
)
4073 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
4074 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
4075 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
4077 return underlying_type
;
4080 if (!complete_type_or_else (type
, NULL_TREE
))
4081 return error_mark_node
;
4083 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
4085 error ("%qT is not an enumeration type", type
);
4086 return error_mark_node
;
4089 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
4091 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
4092 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
4093 See finish_enum_value_list for details. */
4094 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
4096 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
4097 TYPE_UNSIGNED (underlying_type
));
4099 return underlying_type
;
4102 /* Implement the __direct_bases keyword: Return the direct base classes
4106 calculate_direct_bases (tree type
, tsubst_flags_t complain
)
4108 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
4109 || !NON_UNION_CLASS_TYPE_P (type
))
4110 return make_tree_vec (0);
4112 releasing_vec vector
;
4113 vec
<tree
, va_gc
> *base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
4117 /* Virtual bases are initialized first */
4118 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
4119 if (BINFO_VIRTUAL_P (binfo
))
4120 vec_safe_push (vector
, binfo
);
4122 /* Now non-virtuals */
4123 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
4124 if (!BINFO_VIRTUAL_P (binfo
))
4125 vec_safe_push (vector
, binfo
);
4127 tree bases_vec
= make_tree_vec (vector
->length ());
4129 for (i
= 0; i
< vector
->length (); ++i
)
4130 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
4135 /* Implement the __bases keyword: Return the base classes
4138 /* Find morally non-virtual base classes by walking binfo hierarchy */
4139 /* Virtual base classes are handled separately in finish_bases */
4142 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
4144 /* Don't walk bases of virtual bases */
4145 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
4149 dfs_calculate_bases_post (tree binfo
, void *data_
)
4151 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
4152 if (!BINFO_VIRTUAL_P (binfo
))
4153 vec_safe_push (*data
, BINFO_TYPE (binfo
));
4157 /* Calculates the morally non-virtual base classes of a class */
4158 static vec
<tree
, va_gc
> *
4159 calculate_bases_helper (tree type
)
4161 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
4163 /* Now add non-virtual base classes in order of construction */
4164 if (TYPE_BINFO (type
))
4165 dfs_walk_all (TYPE_BINFO (type
),
4166 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
4171 calculate_bases (tree type
, tsubst_flags_t complain
)
4173 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
4174 || !NON_UNION_CLASS_TYPE_P (type
))
4175 return make_tree_vec (0);
4177 releasing_vec vector
;
4178 tree bases_vec
= NULL_TREE
;
4180 vec
<tree
, va_gc
> *vbases
;
4183 /* First go through virtual base classes */
4184 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
4185 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
4187 releasing_vec vbase_bases
4188 = calculate_bases_helper (BINFO_TYPE (binfo
));
4189 vec_safe_splice (vector
, vbase_bases
);
4192 /* Now for the non-virtual bases */
4193 releasing_vec nonvbases
= calculate_bases_helper (type
);
4194 vec_safe_splice (vector
, nonvbases
);
4196 /* Note that during error recovery vector->length can even be zero. */
4197 if (vector
->length () > 1)
4199 /* Last element is entire class, so don't copy */
4200 bases_vec
= make_tree_vec (vector
->length () - 1);
4202 for (i
= 0; i
< vector
->length () - 1; ++i
)
4203 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
4206 bases_vec
= make_tree_vec (0);
4212 finish_bases (tree type
, bool direct
)
4214 tree bases
= NULL_TREE
;
4216 if (!processing_template_decl
)
4218 /* Parameter packs can only be used in templates */
4219 error ("parameter pack %<__bases%> only valid in template declaration");
4220 return error_mark_node
;
4223 bases
= cxx_make_type (BASES
);
4224 BASES_TYPE (bases
) = type
;
4225 BASES_DIRECT (bases
) = direct
;
4226 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
4231 /* Perform C++-specific checks for __builtin_offsetof before calling
4235 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
4237 /* If we're processing a template, we can't finish the semantics yet.
4238 Otherwise we can fold the entire expression now. */
4239 if (processing_template_decl
)
4241 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4242 SET_EXPR_LOCATION (expr
, loc
);
4246 if (expr
== error_mark_node
)
4247 return error_mark_node
;
4249 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4251 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4252 TREE_OPERAND (expr
, 2));
4253 return error_mark_node
;
4255 if (FUNC_OR_METHOD_TYPE_P (TREE_TYPE (expr
))
4256 || TREE_TYPE (expr
) == unknown_type_node
)
4258 while (TREE_CODE (expr
) == COMPONENT_REF
4259 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4260 expr
= TREE_OPERAND (expr
, 1);
4264 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4265 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
4268 error ("cannot apply %<offsetof%> to member function");
4269 return error_mark_node
;
4271 if (TREE_CODE (expr
) == CONST_DECL
)
4273 error ("cannot apply %<offsetof%> to an enumerator %qD", expr
);
4274 return error_mark_node
;
4276 if (REFERENCE_REF_P (expr
))
4277 expr
= TREE_OPERAND (expr
, 0);
4278 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4279 return error_mark_node
;
4280 if (warn_invalid_offsetof
4281 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4282 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4283 && cp_unevaluated_operand
== 0)
4284 warning_at (loc
, OPT_Winvalid_offsetof
, "%<offsetof%> within "
4285 "non-standard-layout type %qT is conditionally-supported",
4286 TREE_TYPE (TREE_TYPE (object_ptr
)));
4287 return fold_offsetof (expr
);
4290 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4291 function is broken out from the above for the benefit of the tree-ssa
4295 simplify_aggr_init_expr (tree
*tp
)
4297 tree aggr_init_expr
= *tp
;
4299 /* Form an appropriate CALL_EXPR. */
4300 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4301 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4302 tree type
= TREE_TYPE (slot
);
4305 enum style_t
{ ctor
, arg
, pcc
} style
;
4307 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4309 #ifdef PCC_STATIC_STRUCT_RETURN
4315 gcc_assert (TREE_ADDRESSABLE (type
));
4319 call_expr
= build_call_array_loc (input_location
,
4320 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4322 aggr_init_expr_nargs (aggr_init_expr
),
4323 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4324 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4325 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4326 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4327 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4328 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4329 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4333 /* Replace the first argument to the ctor with the address of the
4335 cxx_mark_addressable (slot
);
4336 CALL_EXPR_ARG (call_expr
, 0) =
4337 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4339 else if (style
== arg
)
4341 /* Just mark it addressable here, and leave the rest to
4342 expand_call{,_inline}. */
4343 cxx_mark_addressable (slot
);
4344 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4345 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4347 else if (style
== pcc
)
4349 /* If we're using the non-reentrant PCC calling convention, then we
4350 need to copy the returned value out of the static buffer into the
4352 push_deferring_access_checks (dk_no_check
);
4353 call_expr
= build_aggr_init (slot
, call_expr
,
4354 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4355 tf_warning_or_error
);
4356 pop_deferring_access_checks ();
4357 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4360 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4362 tree init
= build_zero_init (type
, NULL_TREE
,
4363 /*static_storage_p=*/false);
4364 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4365 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4372 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4375 emit_associated_thunks (tree fn
)
4377 /* When we use vcall offsets, we emit thunks with the virtual
4378 functions to which they thunk. The whole point of vcall offsets
4379 is so that you can know statically the entire set of thunks that
4380 will ever be needed for a given virtual function, thereby
4381 enabling you to output all the thunks with the function itself. */
4382 if (DECL_VIRTUAL_P (fn
)
4383 /* Do not emit thunks for extern template instantiations. */
4384 && ! DECL_REALLY_EXTERN (fn
))
4388 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4390 if (!THUNK_ALIAS (thunk
))
4392 use_thunk (thunk
, /*emit_p=*/1);
4393 if (DECL_RESULT_THUNK_P (thunk
))
4397 for (probe
= DECL_THUNKS (thunk
);
4398 probe
; probe
= DECL_CHAIN (probe
))
4399 use_thunk (probe
, /*emit_p=*/1);
4403 gcc_assert (!DECL_THUNKS (thunk
));
4408 /* Generate RTL for FN. */
4411 expand_or_defer_fn_1 (tree fn
)
4413 /* When the parser calls us after finishing the body of a template
4414 function, we don't really want to expand the body. */
4415 if (processing_template_decl
)
4417 /* Normally, collection only occurs in rest_of_compilation. So,
4418 if we don't collect here, we never collect junk generated
4419 during the processing of templates until we hit a
4420 non-template function. It's not safe to do this inside a
4421 nested class, though, as the parser may have local state that
4422 is not a GC root. */
4423 if (!function_depth
)
4428 gcc_assert (DECL_SAVED_TREE (fn
));
4430 /* We make a decision about linkage for these functions at the end
4431 of the compilation. Until that point, we do not want the back
4432 end to output them -- but we do want it to see the bodies of
4433 these functions so that it can inline them as appropriate. */
4434 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4436 if (DECL_INTERFACE_KNOWN (fn
))
4437 /* We've already made a decision as to how this function will
4439 else if (!at_eof
|| DECL_IMMEDIATE_FUNCTION_P (fn
))
4440 tentative_decl_linkage (fn
);
4442 import_export_decl (fn
);
4444 /* If the user wants us to keep all inline functions, then mark
4445 this function as needed so that finish_file will make sure to
4446 output it later. Similarly, all dllexport'd functions must
4447 be emitted; there may be callers in other DLLs. */
4448 if (DECL_DECLARED_INLINE_P (fn
)
4449 && !DECL_REALLY_EXTERN (fn
)
4450 && !DECL_IMMEDIATE_FUNCTION_P (fn
)
4451 && (flag_keep_inline_functions
4452 || (flag_keep_inline_dllexport
4453 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4456 DECL_EXTERNAL (fn
) = 0;
4460 /* If this is a constructor or destructor body, we have to clone
4462 if (maybe_clone_body (fn
))
4464 /* We don't want to process FN again, so pretend we've written
4465 it out, even though we haven't. */
4466 TREE_ASM_WRITTEN (fn
) = 1;
4467 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4468 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4469 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4473 /* There's no reason to do any of the work here if we're only doing
4474 semantic analysis; this code just generates RTL. */
4475 if (flag_syntax_only
)
4477 /* Pretend that this function has been written out so that we don't try
4478 to expand it again. */
4479 TREE_ASM_WRITTEN (fn
) = 1;
4487 expand_or_defer_fn (tree fn
)
4489 if (expand_or_defer_fn_1 (fn
))
4493 /* Expand or defer, at the whim of the compilation unit manager. */
4494 cgraph_node::finalize_function (fn
, function_depth
> 1);
4495 emit_associated_thunks (fn
);
4504 nrv_data () : visited (37) {}
4508 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4511 /* Helper function for walk_tree, used by finalize_nrv below. */
4514 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4516 class nrv_data
*dp
= (class nrv_data
*)data
;
4519 /* No need to walk into types. There wouldn't be any need to walk into
4520 non-statements, except that we have to consider STMT_EXPRs. */
4523 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4524 but differs from using NULL_TREE in that it indicates that we care
4525 about the value of the RESULT_DECL. */
4526 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4527 TREE_OPERAND (*tp
, 0) = dp
->result
;
4528 /* Change all cleanups for the NRV to only run when an exception is
4530 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4531 && CLEANUP_DECL (*tp
) == dp
->var
)
4532 CLEANUP_EH_ONLY (*tp
) = 1;
4533 /* Replace the DECL_EXPR for the NRV with an initialization of the
4534 RESULT_DECL, if needed. */
4535 else if (TREE_CODE (*tp
) == DECL_EXPR
4536 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4539 if (DECL_INITIAL (dp
->var
)
4540 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4541 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4542 DECL_INITIAL (dp
->var
));
4544 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4545 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4546 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4549 /* And replace all uses of the NRV with the RESULT_DECL. */
4550 else if (*tp
== dp
->var
)
4553 /* Avoid walking into the same tree more than once. Unfortunately, we
4554 can't just use walk_tree_without duplicates because it would only call
4555 us for the first occurrence of dp->var in the function body. */
4556 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4562 /* Keep iterating. */
4566 /* Called from finish_function to implement the named return value
4567 optimization by overriding all the RETURN_EXPRs and pertinent
4568 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4569 RESULT_DECL for the function. */
4572 finalize_nrv (tree
*tp
, tree var
, tree result
)
4574 class nrv_data data
;
4576 /* Copy name from VAR to RESULT. */
4577 DECL_NAME (result
) = DECL_NAME (var
);
4578 /* Don't forget that we take its address. */
4579 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4580 /* Finally set DECL_VALUE_EXPR to avoid assigning
4581 a stack slot at -O0 for the original var and debug info
4582 uses RESULT location for VAR. */
4583 SET_DECL_VALUE_EXPR (var
, result
);
4584 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4587 data
.result
= result
;
4588 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4591 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4594 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4595 bool need_copy_ctor
, bool need_copy_assignment
,
4598 int save_errorcount
= errorcount
;
4601 /* Always allocate 3 elements for simplicity. These are the
4602 function decls for the ctor, dtor, and assignment op.
4603 This layout is known to the three lang hooks,
4604 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4605 and cxx_omp_clause_assign_op. */
4606 info
= make_tree_vec (3);
4607 CP_OMP_CLAUSE_INFO (c
) = info
;
4609 if (need_default_ctor
|| need_copy_ctor
)
4611 if (need_default_ctor
)
4612 t
= get_default_ctor (type
);
4614 t
= get_copy_ctor (type
, tf_warning_or_error
);
4616 if (t
&& !trivial_fn_p (t
))
4617 TREE_VEC_ELT (info
, 0) = t
;
4620 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4621 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4623 if (need_copy_assignment
)
4625 t
= get_copy_assign (type
);
4627 if (t
&& !trivial_fn_p (t
))
4628 TREE_VEC_ELT (info
, 2) = t
;
4631 return errorcount
!= save_errorcount
;
4634 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4635 FIELD_DECL, otherwise return DECL itself. */
4638 omp_clause_decl_field (tree decl
)
4641 && DECL_HAS_VALUE_EXPR_P (decl
)
4642 && DECL_ARTIFICIAL (decl
)
4643 && DECL_LANG_SPECIFIC (decl
)
4644 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4646 tree f
= DECL_VALUE_EXPR (decl
);
4647 if (INDIRECT_REF_P (f
))
4648 f
= TREE_OPERAND (f
, 0);
4649 if (TREE_CODE (f
) == COMPONENT_REF
)
4651 f
= TREE_OPERAND (f
, 1);
4652 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4659 /* Adjust DECL if needed for printing using %qE. */
4662 omp_clause_printable_decl (tree decl
)
4664 tree t
= omp_clause_decl_field (decl
);
4670 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4671 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4675 omp_note_field_privatization (tree f
, tree t
)
4677 if (!omp_private_member_map
)
4678 omp_private_member_map
= new hash_map
<tree
, tree
>;
4679 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4683 omp_private_member_vec
.safe_push (f
);
4684 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4685 omp_private_member_vec
.safe_push (integer_zero_node
);
4689 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4693 omp_privatize_field (tree t
, bool shared
)
4695 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4696 if (m
== error_mark_node
)
4697 return error_mark_node
;
4698 if (!omp_private_member_map
&& !shared
)
4699 omp_private_member_map
= new hash_map
<tree
, tree
>;
4700 if (TYPE_REF_P (TREE_TYPE (t
)))
4702 gcc_assert (INDIRECT_REF_P (m
));
4703 m
= TREE_OPERAND (m
, 0);
4705 tree vb
= NULL_TREE
;
4706 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4709 v
= create_temporary_var (TREE_TYPE (m
));
4710 retrofit_lang_decl (v
);
4711 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4712 SET_DECL_VALUE_EXPR (v
, m
);
4713 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4715 omp_private_member_vec
.safe_push (t
);
4720 /* Helper function for handle_omp_array_sections. Called recursively
4721 to handle multiple array-section-subscripts. C is the clause,
4722 T current expression (initially OMP_CLAUSE_DECL), which is either
4723 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4724 expression if specified, TREE_VALUE length expression if specified,
4725 TREE_CHAIN is what it has been specified after, or some decl.
4726 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4727 set to true if any of the array-section-subscript could have length
4728 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4729 first array-section-subscript which is known not to have length
4731 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4732 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4733 all are or may have length of 1, array-section-subscript [:2] is the
4734 first one known not to have length 1. For array-section-subscript
4735 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4736 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4737 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4738 case though, as some lengths could be zero. */
4741 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4742 bool &maybe_zero_len
, unsigned int &first_non_one
,
4743 enum c_omp_region_type ort
)
4745 tree ret
, low_bound
, length
, type
;
4746 if (TREE_CODE (t
) != TREE_LIST
)
4748 if (error_operand_p (t
))
4749 return error_mark_node
;
4750 if (REFERENCE_REF_P (t
)
4751 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4752 t
= TREE_OPERAND (t
, 0);
4754 if (TREE_CODE (t
) == COMPONENT_REF
4756 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4757 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4758 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4759 && !type_dependent_expression_p (t
))
4761 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4762 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4764 error_at (OMP_CLAUSE_LOCATION (c
),
4765 "bit-field %qE in %qs clause",
4766 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4767 return error_mark_node
;
4769 while (TREE_CODE (t
) == COMPONENT_REF
)
4771 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4772 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4774 error_at (OMP_CLAUSE_LOCATION (c
),
4775 "%qE is a member of a union", t
);
4776 return error_mark_node
;
4778 t
= TREE_OPERAND (t
, 0);
4780 if (REFERENCE_REF_P (t
))
4781 t
= TREE_OPERAND (t
, 0);
4783 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4785 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
4788 error_at (OMP_CLAUSE_LOCATION (c
),
4789 "%qD is not a variable in %qs clause", t
,
4790 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4792 error_at (OMP_CLAUSE_LOCATION (c
),
4793 "%qE is not a variable in %qs clause", t
,
4794 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4795 return error_mark_node
;
4797 else if (ort
== C_ORT_OMP
4798 && TREE_CODE (t
) == PARM_DECL
4799 && DECL_ARTIFICIAL (t
)
4800 && DECL_NAME (t
) == this_identifier
)
4802 error_at (OMP_CLAUSE_LOCATION (c
),
4803 "%<this%> allowed in OpenMP only in %<declare simd%>"
4805 return error_mark_node
;
4807 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4808 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4810 error_at (OMP_CLAUSE_LOCATION (c
),
4811 "%qD is threadprivate variable in %qs clause", t
,
4812 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4813 return error_mark_node
;
4815 if (type_dependent_expression_p (ret
))
4817 ret
= convert_from_reference (ret
);
4821 if (ort
== C_ORT_OMP
4822 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4823 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4824 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4825 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4826 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4827 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4828 maybe_zero_len
, first_non_one
, ort
);
4829 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4832 type
= TREE_TYPE (ret
);
4833 low_bound
= TREE_PURPOSE (t
);
4834 length
= TREE_VALUE (t
);
4835 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4836 || (length
&& type_dependent_expression_p (length
)))
4839 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4840 return error_mark_node
;
4842 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4844 error_at (OMP_CLAUSE_LOCATION (c
),
4845 "low bound %qE of array section does not have integral type",
4847 return error_mark_node
;
4849 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4851 error_at (OMP_CLAUSE_LOCATION (c
),
4852 "length %qE of array section does not have integral type",
4854 return error_mark_node
;
4857 low_bound
= mark_rvalue_use (low_bound
);
4859 length
= mark_rvalue_use (length
);
4860 /* We need to reduce to real constant-values for checks below. */
4862 length
= fold_simple (length
);
4864 low_bound
= fold_simple (low_bound
);
4866 && TREE_CODE (low_bound
) == INTEGER_CST
4867 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4868 > TYPE_PRECISION (sizetype
))
4869 low_bound
= fold_convert (sizetype
, low_bound
);
4871 && TREE_CODE (length
) == INTEGER_CST
4872 && TYPE_PRECISION (TREE_TYPE (length
))
4873 > TYPE_PRECISION (sizetype
))
4874 length
= fold_convert (sizetype
, length
);
4875 if (low_bound
== NULL_TREE
)
4876 low_bound
= integer_zero_node
;
4878 if (length
!= NULL_TREE
)
4880 if (!integer_nonzerop (length
))
4882 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4883 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4884 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4885 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4887 if (integer_zerop (length
))
4889 error_at (OMP_CLAUSE_LOCATION (c
),
4890 "zero length array section in %qs clause",
4891 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4892 return error_mark_node
;
4896 maybe_zero_len
= true;
4898 if (first_non_one
== types
.length ()
4899 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4902 if (TREE_CODE (type
) == ARRAY_TYPE
)
4904 if (length
== NULL_TREE
4905 && (TYPE_DOMAIN (type
) == NULL_TREE
4906 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4908 error_at (OMP_CLAUSE_LOCATION (c
),
4909 "for unknown bound array type length expression must "
4911 return error_mark_node
;
4913 if (TREE_CODE (low_bound
) == INTEGER_CST
4914 && tree_int_cst_sgn (low_bound
) == -1)
4916 error_at (OMP_CLAUSE_LOCATION (c
),
4917 "negative low bound in array section in %qs clause",
4918 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4919 return error_mark_node
;
4921 if (length
!= NULL_TREE
4922 && TREE_CODE (length
) == INTEGER_CST
4923 && tree_int_cst_sgn (length
) == -1)
4925 error_at (OMP_CLAUSE_LOCATION (c
),
4926 "negative length in array section in %qs clause",
4927 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4928 return error_mark_node
;
4930 if (TYPE_DOMAIN (type
)
4931 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4932 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4936 = fold_convert (sizetype
, TYPE_MAX_VALUE (TYPE_DOMAIN (type
)));
4937 size
= size_binop (PLUS_EXPR
, size
, size_one_node
);
4938 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4940 if (tree_int_cst_lt (size
, low_bound
))
4942 error_at (OMP_CLAUSE_LOCATION (c
),
4943 "low bound %qE above array section size "
4944 "in %qs clause", low_bound
,
4945 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4946 return error_mark_node
;
4948 if (tree_int_cst_equal (size
, low_bound
))
4950 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4951 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4952 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4953 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4955 error_at (OMP_CLAUSE_LOCATION (c
),
4956 "zero length array section in %qs clause",
4957 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4958 return error_mark_node
;
4960 maybe_zero_len
= true;
4962 else if (length
== NULL_TREE
4963 && first_non_one
== types
.length ()
4964 && tree_int_cst_equal
4965 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4969 else if (length
== NULL_TREE
)
4971 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4972 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
4973 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_IN_REDUCTION
4974 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_TASK_REDUCTION
)
4975 maybe_zero_len
= true;
4976 if (first_non_one
== types
.length ())
4979 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4981 if (tree_int_cst_lt (size
, length
))
4983 error_at (OMP_CLAUSE_LOCATION (c
),
4984 "length %qE above array section size "
4985 "in %qs clause", length
,
4986 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4987 return error_mark_node
;
4989 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4992 = size_binop (PLUS_EXPR
,
4993 fold_convert (sizetype
, low_bound
),
4994 fold_convert (sizetype
, length
));
4995 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4996 && tree_int_cst_lt (size
, lbpluslen
))
4998 error_at (OMP_CLAUSE_LOCATION (c
),
4999 "high bound %qE above array section size "
5000 "in %qs clause", lbpluslen
,
5001 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5002 return error_mark_node
;
5007 else if (length
== NULL_TREE
)
5009 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
5010 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
5011 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_IN_REDUCTION
5012 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_TASK_REDUCTION
)
5013 maybe_zero_len
= true;
5014 if (first_non_one
== types
.length ())
5018 /* For [lb:] we will need to evaluate lb more than once. */
5019 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
5021 tree lb
= cp_save_expr (low_bound
);
5022 if (lb
!= low_bound
)
5024 TREE_PURPOSE (t
) = lb
;
5029 else if (TYPE_PTR_P (type
))
5031 if (length
== NULL_TREE
)
5033 error_at (OMP_CLAUSE_LOCATION (c
),
5034 "for pointer type length expression must be specified");
5035 return error_mark_node
;
5037 if (length
!= NULL_TREE
5038 && TREE_CODE (length
) == INTEGER_CST
5039 && tree_int_cst_sgn (length
) == -1)
5041 error_at (OMP_CLAUSE_LOCATION (c
),
5042 "negative length in array section in %qs clause",
5043 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5044 return error_mark_node
;
5046 /* If there is a pointer type anywhere but in the very first
5047 array-section-subscript, the array section can't be contiguous. */
5048 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
5049 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
5051 error_at (OMP_CLAUSE_LOCATION (c
),
5052 "array section is not contiguous in %qs clause",
5053 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5054 return error_mark_node
;
5059 error_at (OMP_CLAUSE_LOCATION (c
),
5060 "%qE does not have pointer or array type", ret
);
5061 return error_mark_node
;
5063 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
5064 types
.safe_push (TREE_TYPE (ret
));
5065 /* We will need to evaluate lb more than once. */
5066 tree lb
= cp_save_expr (low_bound
);
5067 if (lb
!= low_bound
)
5069 TREE_PURPOSE (t
) = lb
;
5072 /* Temporarily disable -fstrong-eval-order for array reductions.
5073 The SAVE_EXPR and COMPOUND_EXPR added if low_bound has side-effects
5074 is something the middle-end can't cope with and more importantly,
5075 it needs to be the actual base variable that is privatized, not some
5076 temporary assigned previous value of it. That, together with OpenMP
5077 saying how many times the side-effects are evaluated is unspecified,
5078 makes int *a, *b; ... reduction(+:a[a = b, 3:10]) really unspecified. */
5079 warning_sentinel
s (flag_strong_eval_order
,
5080 OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5081 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5082 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
);
5083 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
5087 /* Handle array sections for clause C. */
5090 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
5092 bool maybe_zero_len
= false;
5093 unsigned int first_non_one
= 0;
5094 auto_vec
<tree
, 10> types
;
5095 tree
*tp
= &OMP_CLAUSE_DECL (c
);
5096 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
5097 && TREE_CODE (*tp
) == TREE_LIST
5098 && TREE_PURPOSE (*tp
)
5099 && TREE_CODE (TREE_PURPOSE (*tp
)) == TREE_VEC
)
5100 tp
= &TREE_VALUE (*tp
);
5101 tree first
= handle_omp_array_sections_1 (c
, *tp
, types
,
5102 maybe_zero_len
, first_non_one
,
5104 if (first
== error_mark_node
)
5106 if (first
== NULL_TREE
)
5108 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
5111 tree tem
= NULL_TREE
;
5112 if (processing_template_decl
)
5114 /* Need to evaluate side effects in the length expressions
5116 while (TREE_CODE (t
) == TREE_LIST
)
5118 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
5120 if (tem
== NULL_TREE
)
5121 tem
= TREE_VALUE (t
);
5123 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
5124 TREE_VALUE (t
), tem
);
5129 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
5134 unsigned int num
= types
.length (), i
;
5135 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
5136 tree condition
= NULL_TREE
;
5138 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
5139 maybe_zero_len
= true;
5140 if (processing_template_decl
&& maybe_zero_len
)
5143 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
5146 tree low_bound
= TREE_PURPOSE (t
);
5147 tree length
= TREE_VALUE (t
);
5151 && TREE_CODE (low_bound
) == INTEGER_CST
5152 && TYPE_PRECISION (TREE_TYPE (low_bound
))
5153 > TYPE_PRECISION (sizetype
))
5154 low_bound
= fold_convert (sizetype
, low_bound
);
5156 && TREE_CODE (length
) == INTEGER_CST
5157 && TYPE_PRECISION (TREE_TYPE (length
))
5158 > TYPE_PRECISION (sizetype
))
5159 length
= fold_convert (sizetype
, length
);
5160 if (low_bound
== NULL_TREE
)
5161 low_bound
= integer_zero_node
;
5162 if (!maybe_zero_len
&& i
> first_non_one
)
5164 if (integer_nonzerop (low_bound
))
5165 goto do_warn_noncontiguous
;
5166 if (length
!= NULL_TREE
5167 && TREE_CODE (length
) == INTEGER_CST
5168 && TYPE_DOMAIN (types
[i
])
5169 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
5170 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
5174 size
= size_binop (PLUS_EXPR
,
5175 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
5177 if (!tree_int_cst_equal (length
, size
))
5179 do_warn_noncontiguous
:
5180 error_at (OMP_CLAUSE_LOCATION (c
),
5181 "array section is not contiguous in %qs "
5183 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5187 if (!processing_template_decl
5188 && length
!= NULL_TREE
5189 && TREE_SIDE_EFFECTS (length
))
5191 if (side_effects
== NULL_TREE
)
5192 side_effects
= length
;
5194 side_effects
= build2 (COMPOUND_EXPR
,
5195 TREE_TYPE (side_effects
),
5196 length
, side_effects
);
5199 else if (processing_template_decl
)
5205 if (i
> first_non_one
5206 && ((length
&& integer_nonzerop (length
))
5207 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5208 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5209 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
))
5212 l
= fold_convert (sizetype
, length
);
5215 l
= size_binop (PLUS_EXPR
,
5216 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
5218 l
= size_binop (MINUS_EXPR
, l
,
5219 fold_convert (sizetype
, low_bound
));
5221 if (i
> first_non_one
)
5223 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
5225 if (condition
== NULL_TREE
)
5228 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
5231 else if (size
== NULL_TREE
)
5233 size
= size_in_bytes (TREE_TYPE (types
[i
]));
5234 tree eltype
= TREE_TYPE (types
[num
- 1]);
5235 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5236 eltype
= TREE_TYPE (eltype
);
5237 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5238 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5239 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
5240 size
= size_binop (EXACT_DIV_EXPR
, size
,
5241 size_in_bytes (eltype
));
5242 size
= size_binop (MULT_EXPR
, size
, l
);
5244 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
5245 size
, size_zero_node
);
5248 size
= size_binop (MULT_EXPR
, size
, l
);
5251 if (!processing_template_decl
)
5254 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
5255 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5256 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5257 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
5259 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5260 size
= save_expr (size
);
5261 tree index_type
= build_index_type (size
);
5262 tree eltype
= TREE_TYPE (first
);
5263 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5264 eltype
= TREE_TYPE (eltype
);
5265 tree type
= build_array_type (eltype
, index_type
);
5266 tree ptype
= build_pointer_type (eltype
);
5267 if (TYPE_REF_P (TREE_TYPE (t
))
5268 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
5269 t
= convert_from_reference (t
);
5270 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5271 t
= build_fold_addr_expr (t
);
5272 tree t2
= build_fold_addr_expr (first
);
5273 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5274 ptrdiff_type_node
, t2
);
5275 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5276 ptrdiff_type_node
, t2
,
5277 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5278 ptrdiff_type_node
, t
));
5279 if (tree_fits_shwi_p (t2
))
5280 t
= build2 (MEM_REF
, type
, t
,
5281 build_int_cst (ptype
, tree_to_shwi (t2
)));
5284 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5286 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5287 TREE_TYPE (t
), t
, t2
);
5288 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5290 OMP_CLAUSE_DECL (c
) = t
;
5293 OMP_CLAUSE_DECL (c
) = first
;
5294 OMP_CLAUSE_SIZE (c
) = size
;
5295 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5296 || (TREE_CODE (t
) == COMPONENT_REF
5297 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5299 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5300 switch (OMP_CLAUSE_MAP_KIND (c
))
5302 case GOMP_MAP_ALLOC
:
5305 case GOMP_MAP_TOFROM
:
5306 case GOMP_MAP_ALWAYS_TO
:
5307 case GOMP_MAP_ALWAYS_FROM
:
5308 case GOMP_MAP_ALWAYS_TOFROM
:
5309 case GOMP_MAP_RELEASE
:
5310 case GOMP_MAP_DELETE
:
5311 case GOMP_MAP_FORCE_TO
:
5312 case GOMP_MAP_FORCE_FROM
:
5313 case GOMP_MAP_FORCE_TOFROM
:
5314 case GOMP_MAP_FORCE_PRESENT
:
5315 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5320 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5322 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5323 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5324 else if (TREE_CODE (t
) == COMPONENT_REF
)
5325 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5326 else if (REFERENCE_REF_P (t
)
5327 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5329 t
= TREE_OPERAND (t
, 0);
5330 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5333 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5334 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5335 && !cxx_mark_addressable (t
))
5337 OMP_CLAUSE_DECL (c2
) = t
;
5338 t
= build_fold_addr_expr (first
);
5339 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5340 ptrdiff_type_node
, t
);
5341 tree ptr
= OMP_CLAUSE_DECL (c2
);
5342 ptr
= convert_from_reference (ptr
);
5343 if (!INDIRECT_TYPE_P (TREE_TYPE (ptr
)))
5344 ptr
= build_fold_addr_expr (ptr
);
5345 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5346 ptrdiff_type_node
, t
,
5347 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5348 ptrdiff_type_node
, ptr
));
5349 OMP_CLAUSE_SIZE (c2
) = t
;
5350 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5351 OMP_CLAUSE_CHAIN (c
) = c2
;
5352 ptr
= OMP_CLAUSE_DECL (c2
);
5353 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5354 && TYPE_REF_P (TREE_TYPE (ptr
))
5355 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5357 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5359 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5360 OMP_CLAUSE_DECL (c3
) = ptr
;
5361 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5362 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5364 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5365 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5366 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5367 OMP_CLAUSE_CHAIN (c2
) = c3
;
5374 /* Return identifier to look up for omp declare reduction. */
5377 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5379 const char *p
= NULL
;
5380 const char *m
= NULL
;
5381 switch (reduction_code
)
5389 case TRUTH_ANDIF_EXPR
:
5390 case TRUTH_ORIF_EXPR
:
5391 reduction_id
= ovl_op_identifier (false, reduction_code
);
5405 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5406 return error_mark_node
;
5407 p
= IDENTIFIER_POINTER (reduction_id
);
5410 if (type
!= NULL_TREE
)
5411 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5413 const char prefix
[] = "omp declare reduction ";
5414 size_t lenp
= sizeof (prefix
);
5415 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5417 size_t len
= strlen (p
);
5418 size_t lenm
= m
? strlen (m
) + 1 : 0;
5419 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5421 memcpy (name
, prefix
, lenp
- 1);
5422 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5425 name
[lenp
+ len
- 1] = '~';
5426 memcpy (name
+ lenp
+ len
, m
, lenm
);
5428 return get_identifier (name
);
5431 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5432 FUNCTION_DECL or NULL_TREE if not found. */
5435 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5436 vec
<tree
> *ambiguousp
)
5439 tree baselink
= NULL_TREE
;
5440 if (identifier_p (id
))
5443 bool nonint_cst_expression_p
;
5444 const char *error_msg
;
5445 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5446 tree decl
= lookup_name (id
);
5447 if (decl
== NULL_TREE
)
5448 decl
= error_mark_node
;
5449 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5450 &nonint_cst_expression_p
, false, true, false,
5451 false, &error_msg
, loc
);
5452 if (idk
== CP_ID_KIND_UNQUALIFIED
5453 && identifier_p (id
))
5455 vec
<tree
, va_gc
> *args
= NULL
;
5456 vec_safe_push (args
, build_reference_type (type
));
5457 id
= perform_koenig_lookup (id
, args
, tf_none
);
5460 else if (TREE_CODE (id
) == SCOPE_REF
)
5461 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5462 omp_reduction_id (ERROR_MARK
,
5463 TREE_OPERAND (id
, 1),
5468 if (fns
&& is_overloaded_fn (fns
))
5470 for (lkp_iterator
iter (get_fns (fns
)); iter
; ++iter
)
5472 tree fndecl
= *iter
;
5473 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5475 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5476 if (same_type_p (TREE_TYPE (argtype
), type
))
5484 if (id
&& BASELINK_P (fns
))
5493 if (!id
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5495 vec
<tree
> ambiguous
= vNULL
;
5496 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5498 if (ambiguousp
== NULL
)
5499 ambiguousp
= &ambiguous
;
5500 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5502 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5503 baselinkp
? baselinkp
: &baselink
,
5505 if (id
== NULL_TREE
)
5507 if (!ambiguousp
->is_empty ())
5508 ambiguousp
->safe_push (id
);
5509 else if (ret
!= NULL_TREE
)
5511 ambiguousp
->safe_push (ret
);
5512 ambiguousp
->safe_push (id
);
5518 if (ambiguousp
!= &ambiguous
)
5520 if (!ambiguous
.is_empty ())
5522 const char *str
= _("candidates are:");
5525 error_at (loc
, "user defined reduction lookup is ambiguous");
5526 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5528 inform (DECL_SOURCE_LOCATION (udr
), "%s %#qD", str
, udr
);
5530 str
= get_spaces (str
);
5532 ambiguous
.release ();
5533 ret
= error_mark_node
;
5534 baselink
= NULL_TREE
;
5539 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5540 id
, id
, tf_warning_or_error
);
5544 /* Helper function for cp_parser_omp_declare_reduction_exprs
5546 Remove CLEANUP_STMT for data (omp_priv variable).
5547 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5551 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5555 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5556 *tp
= CLEANUP_BODY (*tp
);
5557 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5559 tree decl
= DECL_EXPR_DECL (*tp
);
5560 if (!processing_template_decl
5561 && decl
== (tree
) data
5562 && DECL_INITIAL (decl
)
5563 && DECL_INITIAL (decl
) != error_mark_node
)
5565 tree list
= NULL_TREE
;
5566 append_to_statement_list_force (*tp
, &list
);
5567 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5568 decl
, DECL_INITIAL (decl
));
5569 DECL_INITIAL (decl
) = NULL_TREE
;
5570 append_to_statement_list_force (init_expr
, &list
);
5577 /* Data passed from cp_check_omp_declare_reduction to
5578 cp_check_omp_declare_reduction_r. */
5580 struct cp_check_omp_declare_reduction_data
5587 /* Helper function for cp_check_omp_declare_reduction, called via
5591 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5593 struct cp_check_omp_declare_reduction_data
*udr_data
5594 = (struct cp_check_omp_declare_reduction_data
*) data
;
5596 && !DECL_ARTIFICIAL (*tp
)
5597 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5598 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5600 location_t loc
= udr_data
->loc
;
5601 if (udr_data
->combiner_p
)
5602 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5603 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5606 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5607 "to variable %qD which is not %<omp_priv%> nor "
5615 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5618 cp_check_omp_declare_reduction (tree udr
)
5620 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5621 gcc_assert (TYPE_REF_P (type
));
5622 type
= TREE_TYPE (type
);
5624 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5626 if (type
== error_mark_node
)
5628 if (ARITHMETIC_TYPE_P (type
))
5630 static enum tree_code predef_codes
[]
5631 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5632 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5633 for (i
= 0; i
< 8; i
++)
5635 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5636 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5637 const char *n2
= IDENTIFIER_POINTER (id
);
5638 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5639 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5640 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5645 && TREE_CODE (type
) != COMPLEX_EXPR
)
5647 const char prefix_minmax
[] = "omp declare reduction m";
5648 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5649 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5650 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5651 prefix_minmax
, prefix_size
) == 0
5652 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5653 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5654 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5659 error_at (loc
, "predeclared arithmetic type %qT in "
5660 "%<#pragma omp declare reduction%>", type
);
5664 else if (FUNC_OR_METHOD_TYPE_P (type
)
5665 || TREE_CODE (type
) == ARRAY_TYPE
)
5667 error_at (loc
, "function or array type %qT in "
5668 "%<#pragma omp declare reduction%>", type
);
5671 else if (TYPE_REF_P (type
))
5673 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5677 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5679 error_at (loc
, "%<const%>, %<volatile%> or %<__restrict%>-qualified "
5680 "type %qT in %<#pragma omp declare reduction%>", type
);
5684 tree body
= DECL_SAVED_TREE (udr
);
5685 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5688 tree_stmt_iterator tsi
;
5689 struct cp_check_omp_declare_reduction_data data
;
5690 memset (data
.stmts
, 0, sizeof data
.stmts
);
5691 for (i
= 0, tsi
= tsi_start (body
);
5692 i
< 7 && !tsi_end_p (tsi
);
5693 i
++, tsi_next (&tsi
))
5694 data
.stmts
[i
] = tsi_stmt (tsi
);
5696 gcc_assert (tsi_end_p (tsi
));
5699 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5700 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5701 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5703 data
.combiner_p
= true;
5704 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5706 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5710 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5711 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5712 data
.combiner_p
= false;
5713 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5715 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5716 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5717 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5719 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5723 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5724 an inline call. But, remap
5725 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5726 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5729 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5730 tree decl
, tree placeholder
)
5733 hash_map
<tree
, tree
> decl_map
;
5735 decl_map
.put (omp_decl1
, placeholder
);
5736 decl_map
.put (omp_decl2
, decl
);
5737 memset (&id
, 0, sizeof (id
));
5738 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5739 id
.dst_fn
= current_function_decl
;
5740 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5741 id
.decl_map
= &decl_map
;
5743 id
.copy_decl
= copy_decl_no_change
;
5744 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5745 id
.transform_new_cfg
= true;
5746 id
.transform_return_to_modify
= false;
5747 id
.transform_lang_insert_block
= NULL
;
5749 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5753 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5754 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5757 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5759 if (*tp
== (tree
) data
)
5764 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5765 Return true if there is some error and the clause should be removed. */
5768 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5770 tree t
= OMP_CLAUSE_DECL (c
);
5771 bool predefined
= false;
5772 if (TREE_CODE (t
) == TREE_LIST
)
5774 gcc_assert (processing_template_decl
);
5777 tree type
= TREE_TYPE (t
);
5778 if (TREE_CODE (t
) == MEM_REF
)
5779 type
= TREE_TYPE (type
);
5780 if (TYPE_REF_P (type
))
5781 type
= TREE_TYPE (type
);
5782 if (TREE_CODE (type
) == ARRAY_TYPE
)
5785 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5786 while (TREE_CODE (type
) == ARRAY_TYPE
)
5787 type
= TREE_TYPE (type
);
5788 if (!processing_template_decl
)
5790 t
= require_complete_type (t
);
5791 if (t
== error_mark_node
)
5793 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5794 TYPE_SIZE_UNIT (type
));
5795 if (integer_zerop (size
))
5797 error_at (OMP_CLAUSE_LOCATION (c
),
5798 "%qE in %<reduction%> clause is a zero size array",
5799 omp_clause_printable_decl (t
));
5802 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5803 size
= save_expr (size
);
5804 tree index_type
= build_index_type (size
);
5805 tree atype
= build_array_type (type
, index_type
);
5806 tree ptype
= build_pointer_type (type
);
5807 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5808 t
= build_fold_addr_expr (t
);
5809 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5810 OMP_CLAUSE_DECL (c
) = t
;
5813 if (type
== error_mark_node
)
5815 else if (ARITHMETIC_TYPE_P (type
))
5816 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5825 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5832 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5836 case TRUTH_ANDIF_EXPR
:
5837 case TRUTH_ORIF_EXPR
:
5838 if (FLOAT_TYPE_P (type
))
5845 else if (TYPE_READONLY (type
))
5847 error_at (OMP_CLAUSE_LOCATION (c
),
5848 "%qE has const type for %<reduction%>",
5849 omp_clause_printable_decl (t
));
5852 else if (!processing_template_decl
)
5854 t
= require_complete_type (t
);
5855 if (t
== error_mark_node
)
5857 OMP_CLAUSE_DECL (c
) = t
;
5862 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5865 else if (processing_template_decl
)
5867 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) == error_mark_node
)
5872 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5874 type
= TYPE_MAIN_VARIANT (type
);
5875 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5876 if (id
== NULL_TREE
)
5877 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5878 NULL_TREE
, NULL_TREE
);
5879 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5882 if (id
== error_mark_node
)
5885 tree body
= DECL_SAVED_TREE (id
);
5888 if (TREE_CODE (body
) == STATEMENT_LIST
)
5890 tree_stmt_iterator tsi
;
5891 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5894 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5895 atype
= TREE_TYPE (atype
);
5896 bool need_static_cast
= !same_type_p (type
, atype
);
5897 memset (stmts
, 0, sizeof stmts
);
5898 for (i
= 0, tsi
= tsi_start (body
);
5899 i
< 7 && !tsi_end_p (tsi
);
5900 i
++, tsi_next (&tsi
))
5901 stmts
[i
] = tsi_stmt (tsi
);
5902 gcc_assert (tsi_end_p (tsi
));
5906 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5907 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5908 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5909 DECL_ARTIFICIAL (placeholder
) = 1;
5910 DECL_IGNORED_P (placeholder
) = 1;
5911 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5912 if (TREE_CODE (t
) == MEM_REF
)
5914 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5916 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5917 DECL_IGNORED_P (decl_placeholder
) = 1;
5918 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5920 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5921 cxx_mark_addressable (placeholder
);
5922 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5923 && (decl_placeholder
5924 || !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
)))))
5925 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5926 : OMP_CLAUSE_DECL (c
));
5927 tree omp_out
= placeholder
;
5928 tree omp_in
= decl_placeholder
? decl_placeholder
5929 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5930 if (need_static_cast
)
5932 tree rtype
= build_reference_type (atype
);
5933 omp_out
= build_static_cast (rtype
, omp_out
,
5934 tf_warning_or_error
);
5935 omp_in
= build_static_cast (rtype
, omp_in
,
5936 tf_warning_or_error
);
5937 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5939 omp_out
= convert_from_reference (omp_out
);
5940 omp_in
= convert_from_reference (omp_in
);
5942 OMP_CLAUSE_REDUCTION_MERGE (c
)
5943 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5944 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5948 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5949 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5950 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3]))
5951 && (decl_placeholder
5952 || !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
)))))
5953 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5954 : OMP_CLAUSE_DECL (c
));
5955 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5956 cxx_mark_addressable (placeholder
);
5957 tree omp_priv
= decl_placeholder
? decl_placeholder
5958 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5959 tree omp_orig
= placeholder
;
5960 if (need_static_cast
)
5964 error_at (OMP_CLAUSE_LOCATION (c
),
5965 "user defined reduction with constructor "
5966 "initializer for base class %qT", atype
);
5969 tree rtype
= build_reference_type (atype
);
5970 omp_priv
= build_static_cast (rtype
, omp_priv
,
5971 tf_warning_or_error
);
5972 omp_orig
= build_static_cast (rtype
, omp_orig
,
5973 tf_warning_or_error
);
5974 if (omp_priv
== error_mark_node
5975 || omp_orig
== error_mark_node
)
5977 omp_priv
= convert_from_reference (omp_priv
);
5978 omp_orig
= convert_from_reference (omp_orig
);
5981 *need_default_ctor
= true;
5982 OMP_CLAUSE_REDUCTION_INIT (c
)
5983 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5984 DECL_EXPR_DECL (stmts
[3]),
5985 omp_priv
, omp_orig
);
5986 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5987 find_omp_placeholder_r
, placeholder
, NULL
))
5988 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5992 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5993 *need_default_ctor
= true;
5997 tree v
= decl_placeholder
? decl_placeholder
5998 : convert_from_reference (t
);
5999 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
6000 init
= build_constructor (TREE_TYPE (v
), NULL
);
6002 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
6003 OMP_CLAUSE_REDUCTION_INIT (c
)
6004 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
6009 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
6013 error_at (OMP_CLAUSE_LOCATION (c
),
6014 "user defined reduction not found for %qE",
6015 omp_clause_printable_decl (t
));
6018 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
6019 gcc_assert (TYPE_SIZE_UNIT (type
)
6020 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
6024 /* Called from finish_struct_1. linear(this) or linear(this:step)
6025 clauses might not be finalized yet because the class has been incomplete
6026 when parsing #pragma omp declare simd methods. Fix those up now. */
6029 finish_omp_declare_simd_methods (tree t
)
6031 if (processing_template_decl
)
6034 for (tree x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6036 if (TREE_CODE (x
) == USING_DECL
6037 || !DECL_NONSTATIC_MEMBER_FUNCTION_P (x
))
6039 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
6040 if (!ods
|| !TREE_VALUE (ods
))
6042 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
6043 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
6044 && integer_zerop (OMP_CLAUSE_DECL (c
))
6045 && OMP_CLAUSE_LINEAR_STEP (c
)
6046 && TYPE_PTR_P (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
))))
6048 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
6049 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
6050 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
6051 sizetype
, s
, TYPE_SIZE_UNIT (t
));
6052 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
6057 /* Adjust sink depend clause to take into account pointer offsets.
6059 Return TRUE if there was a problem processing the offset, and the
6060 whole clause should be removed. */
6063 cp_finish_omp_clause_depend_sink (tree sink_clause
)
6065 tree t
= OMP_CLAUSE_DECL (sink_clause
);
6066 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
6068 /* Make sure we don't adjust things twice for templates. */
6069 if (processing_template_decl
)
6072 for (; t
; t
= TREE_CHAIN (t
))
6074 tree decl
= TREE_VALUE (t
);
6075 if (TYPE_PTR_P (TREE_TYPE (decl
)))
6077 tree offset
= TREE_PURPOSE (t
);
6078 bool neg
= wi::neg_p (wi::to_wide (offset
));
6079 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
6080 decl
= mark_rvalue_use (decl
);
6081 decl
= convert_from_reference (decl
);
6082 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
6083 neg
? MINUS_EXPR
: PLUS_EXPR
,
6085 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
6086 MINUS_EXPR
, sizetype
,
6087 fold_convert (sizetype
, t2
),
6088 fold_convert (sizetype
, decl
));
6089 if (t2
== error_mark_node
)
6091 TREE_PURPOSE (t
) = t2
;
6097 /* Finish OpenMP iterators ITER. Return true if they are errorneous
6098 and clauses containing them should be removed. */
6101 cp_omp_finish_iterators (tree iter
)
6104 for (tree it
= iter
; it
; it
= TREE_CHAIN (it
))
6106 tree var
= TREE_VEC_ELT (it
, 0);
6107 tree begin
= TREE_VEC_ELT (it
, 1);
6108 tree end
= TREE_VEC_ELT (it
, 2);
6109 tree step
= TREE_VEC_ELT (it
, 3);
6111 tree type
= TREE_TYPE (var
);
6112 location_t loc
= DECL_SOURCE_LOCATION (var
);
6113 if (type
== error_mark_node
)
6118 if (type_dependent_expression_p (var
))
6120 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6122 error_at (loc
, "iterator %qD has neither integral nor pointer type",
6127 else if (TYPE_READONLY (type
))
6129 error_at (loc
, "iterator %qD has const qualified type", var
);
6133 if (type_dependent_expression_p (begin
)
6134 || type_dependent_expression_p (end
)
6135 || type_dependent_expression_p (step
))
6137 else if (error_operand_p (step
))
6142 else if (!INTEGRAL_TYPE_P (TREE_TYPE (step
)))
6144 error_at (EXPR_LOC_OR_LOC (step
, loc
),
6145 "iterator step with non-integral type");
6150 begin
= mark_rvalue_use (begin
);
6151 end
= mark_rvalue_use (end
);
6152 step
= mark_rvalue_use (step
);
6153 begin
= cp_build_c_cast (type
, begin
, tf_warning_or_error
);
6154 end
= cp_build_c_cast (type
, end
, tf_warning_or_error
);
6156 if (!processing_template_decl
)
6157 step
= orig_step
= save_expr (step
);
6158 tree stype
= POINTER_TYPE_P (type
) ? sizetype
: type
;
6159 step
= cp_build_c_cast (stype
, step
, tf_warning_or_error
);
6160 if (POINTER_TYPE_P (type
) && !processing_template_decl
)
6162 begin
= save_expr (begin
);
6163 step
= pointer_int_sum (loc
, PLUS_EXPR
, begin
, step
);
6164 step
= fold_build2_loc (loc
, MINUS_EXPR
, sizetype
,
6165 fold_convert (sizetype
, step
),
6166 fold_convert (sizetype
, begin
));
6167 step
= fold_convert (ssizetype
, step
);
6169 if (!processing_template_decl
)
6171 begin
= maybe_constant_value (begin
);
6172 end
= maybe_constant_value (end
);
6173 step
= maybe_constant_value (step
);
6174 orig_step
= maybe_constant_value (orig_step
);
6176 if (integer_zerop (step
))
6178 error_at (loc
, "iterator %qD has zero step", var
);
6183 if (begin
== error_mark_node
6184 || end
== error_mark_node
6185 || step
== error_mark_node
6186 || orig_step
== error_mark_node
)
6192 if (!processing_template_decl
)
6194 begin
= fold_build_cleanup_point_expr (TREE_TYPE (begin
), begin
);
6195 end
= fold_build_cleanup_point_expr (TREE_TYPE (end
), end
);
6196 step
= fold_build_cleanup_point_expr (TREE_TYPE (step
), step
);
6197 orig_step
= fold_build_cleanup_point_expr (TREE_TYPE (orig_step
),
6200 hash_set
<tree
> pset
;
6202 for (it2
= TREE_CHAIN (it
); it2
; it2
= TREE_CHAIN (it2
))
6204 tree var2
= TREE_VEC_ELT (it2
, 0);
6205 tree begin2
= TREE_VEC_ELT (it2
, 1);
6206 tree end2
= TREE_VEC_ELT (it2
, 2);
6207 tree step2
= TREE_VEC_ELT (it2
, 3);
6208 location_t loc2
= DECL_SOURCE_LOCATION (var2
);
6209 if (cp_walk_tree (&begin2
, find_omp_placeholder_r
, var
, &pset
))
6211 error_at (EXPR_LOC_OR_LOC (begin2
, loc2
),
6212 "begin expression refers to outer iterator %qD", var
);
6215 else if (cp_walk_tree (&end2
, find_omp_placeholder_r
, var
, &pset
))
6217 error_at (EXPR_LOC_OR_LOC (end2
, loc2
),
6218 "end expression refers to outer iterator %qD", var
);
6221 else if (cp_walk_tree (&step2
, find_omp_placeholder_r
, var
, &pset
))
6223 error_at (EXPR_LOC_OR_LOC (step2
, loc2
),
6224 "step expression refers to outer iterator %qD", var
);
6233 TREE_VEC_ELT (it
, 1) = begin
;
6234 TREE_VEC_ELT (it
, 2) = end
;
6235 if (processing_template_decl
)
6236 TREE_VEC_ELT (it
, 3) = orig_step
;
6239 TREE_VEC_ELT (it
, 3) = step
;
6240 TREE_VEC_ELT (it
, 4) = orig_step
;
6246 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
6247 Remove any elements from the list that are invalid. */
6250 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
6252 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
6253 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
6255 tree safelen
= NULL_TREE
;
6256 bool branch_seen
= false;
6257 bool copyprivate_seen
= false;
6258 bool ordered_seen
= false;
6259 bool order_seen
= false;
6260 bool schedule_seen
= false;
6261 bool oacc_async
= false;
6262 tree last_iterators
= NULL_TREE
;
6263 bool last_iterators_remove
= false;
6264 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
6265 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
6266 int reduction_seen
= 0;
6268 bitmap_obstack_initialize (NULL
);
6269 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
6270 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
6271 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
6272 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
6273 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
6274 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
6275 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
6276 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
6278 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
6280 if (ort
& C_ORT_ACC
)
6281 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
6282 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
6288 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
6290 bool remove
= false;
6291 bool field_ok
= false;
6293 switch (OMP_CLAUSE_CODE (c
))
6295 case OMP_CLAUSE_SHARED
:
6296 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6297 goto check_dup_generic
;
6298 case OMP_CLAUSE_PRIVATE
:
6299 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6300 goto check_dup_generic
;
6301 case OMP_CLAUSE_REDUCTION
:
6302 if (reduction_seen
== 0)
6303 reduction_seen
= OMP_CLAUSE_REDUCTION_INSCAN (c
) ? -1 : 1;
6304 else if (reduction_seen
!= -2
6305 && reduction_seen
!= (OMP_CLAUSE_REDUCTION_INSCAN (c
)
6308 error_at (OMP_CLAUSE_LOCATION (c
),
6309 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
6310 "on the same construct");
6311 reduction_seen
= -2;
6314 case OMP_CLAUSE_IN_REDUCTION
:
6315 case OMP_CLAUSE_TASK_REDUCTION
:
6316 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6317 t
= OMP_CLAUSE_DECL (c
);
6318 if (TREE_CODE (t
) == TREE_LIST
)
6320 if (handle_omp_array_sections (c
, ort
))
6325 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
6326 && OMP_CLAUSE_REDUCTION_INSCAN (c
))
6328 error_at (OMP_CLAUSE_LOCATION (c
),
6329 "%<inscan%> %<reduction%> clause with array "
6334 if (TREE_CODE (t
) == TREE_LIST
)
6336 while (TREE_CODE (t
) == TREE_LIST
)
6341 gcc_assert (TREE_CODE (t
) == MEM_REF
);
6342 t
= TREE_OPERAND (t
, 0);
6343 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
6344 t
= TREE_OPERAND (t
, 0);
6345 if (TREE_CODE (t
) == ADDR_EXPR
6346 || INDIRECT_REF_P (t
))
6347 t
= TREE_OPERAND (t
, 0);
6349 tree n
= omp_clause_decl_field (t
);
6352 goto check_dup_generic_t
;
6355 cxx_mark_addressable (t
);
6356 goto check_dup_generic
;
6357 case OMP_CLAUSE_COPYPRIVATE
:
6358 copyprivate_seen
= true;
6359 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6360 goto check_dup_generic
;
6361 case OMP_CLAUSE_COPYIN
:
6362 goto check_dup_generic
;
6363 case OMP_CLAUSE_LINEAR
:
6364 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6365 t
= OMP_CLAUSE_DECL (c
);
6366 if (ort
!= C_ORT_OMP_DECLARE_SIMD
6367 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
6369 error_at (OMP_CLAUSE_LOCATION (c
),
6370 "modifier should not be specified in %<linear%> "
6371 "clause on %<simd%> or %<for%> constructs");
6372 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
6374 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6375 && !type_dependent_expression_p (t
))
6377 tree type
= TREE_TYPE (t
);
6378 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
6379 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
6380 && !TYPE_REF_P (type
))
6382 error_at (OMP_CLAUSE_LOCATION (c
),
6383 "linear clause with %qs modifier applied to "
6384 "non-reference variable with %qT type",
6385 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
6386 ? "ref" : "uval", TREE_TYPE (t
));
6390 if (TYPE_REF_P (type
))
6391 type
= TREE_TYPE (type
);
6392 if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
6394 if (!INTEGRAL_TYPE_P (type
)
6395 && !TYPE_PTR_P (type
))
6397 error_at (OMP_CLAUSE_LOCATION (c
),
6398 "linear clause applied to non-integral "
6399 "non-pointer variable with %qT type",
6406 t
= OMP_CLAUSE_LINEAR_STEP (c
);
6408 t
= integer_one_node
;
6409 if (t
== error_mark_node
)
6414 else if (!type_dependent_expression_p (t
)
6415 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
6416 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6417 || TREE_CODE (t
) != PARM_DECL
6418 || !TYPE_REF_P (TREE_TYPE (t
))
6419 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
6421 error_at (OMP_CLAUSE_LOCATION (c
),
6422 "linear step expression must be integral");
6428 t
= mark_rvalue_use (t
);
6429 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
6431 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
6432 goto check_dup_generic
;
6434 if (!processing_template_decl
6435 && (VAR_P (OMP_CLAUSE_DECL (c
))
6436 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
6438 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
6440 t
= maybe_constant_value (t
);
6441 if (TREE_CODE (t
) != INTEGER_CST
)
6443 error_at (OMP_CLAUSE_LOCATION (c
),
6444 "%<linear%> clause step %qE is neither "
6445 "constant nor a parameter", t
);
6450 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6451 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
6452 if (TYPE_REF_P (type
))
6453 type
= TREE_TYPE (type
);
6454 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
6456 type
= build_pointer_type (type
);
6457 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
6458 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6460 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6461 MINUS_EXPR
, sizetype
,
6462 fold_convert (sizetype
, t
),
6463 fold_convert (sizetype
, d
));
6464 if (t
== error_mark_node
)
6470 else if (TYPE_PTR_P (type
)
6471 /* Can't multiply the step yet if *this
6472 is still incomplete type. */
6473 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6474 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6475 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6476 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6478 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6480 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6481 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6483 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6484 MINUS_EXPR
, sizetype
,
6485 fold_convert (sizetype
, t
),
6486 fold_convert (sizetype
, d
));
6487 if (t
== error_mark_node
)
6494 t
= fold_convert (type
, t
);
6496 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6498 goto check_dup_generic
;
6500 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6503 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6504 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6507 t
= OMP_CLAUSE_DECL (c
);
6508 check_dup_generic_t
:
6509 if (t
== current_class_ptr
6510 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6511 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6512 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6514 error_at (OMP_CLAUSE_LOCATION (c
),
6515 "%<this%> allowed in OpenMP only in %<declare simd%>"
6520 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6521 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6523 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6526 error_at (OMP_CLAUSE_LOCATION (c
),
6527 "%qD is not a variable in clause %qs", t
,
6528 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6530 error_at (OMP_CLAUSE_LOCATION (c
),
6531 "%qE is not a variable in clause %qs", t
,
6532 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6535 else if ((ort
== C_ORT_ACC
6536 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6537 || (ort
== C_ORT_OMP
6538 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_USE_DEVICE_PTR
6539 || (OMP_CLAUSE_CODE (c
)
6540 == OMP_CLAUSE_USE_DEVICE_ADDR
))))
6542 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6544 error_at (OMP_CLAUSE_LOCATION (c
),
6546 ? "%qD appears more than once in reduction clauses"
6547 : "%qD appears more than once in data clauses",
6552 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6554 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6555 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6556 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6558 error_at (OMP_CLAUSE_LOCATION (c
),
6559 "%qD appears more than once in data clauses", t
);
6562 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6563 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6565 if (ort
== C_ORT_ACC
)
6566 error_at (OMP_CLAUSE_LOCATION (c
),
6567 "%qD appears more than once in data clauses", t
);
6569 error_at (OMP_CLAUSE_LOCATION (c
),
6570 "%qD appears both in data and map clauses", t
);
6574 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6579 && TREE_CODE (t
) == FIELD_DECL
6580 && t
== OMP_CLAUSE_DECL (c
)
6581 && ort
!= C_ORT_ACC
)
6584 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6585 == OMP_CLAUSE_SHARED
));
6586 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6591 case OMP_CLAUSE_FIRSTPRIVATE
:
6592 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6594 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6596 t
= OMP_CLAUSE_DECL (c
);
6597 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6599 error_at (OMP_CLAUSE_LOCATION (c
),
6600 "%<this%> allowed in OpenMP only in %<declare simd%>"
6605 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6606 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6607 || TREE_CODE (t
) != FIELD_DECL
))
6609 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6612 error_at (OMP_CLAUSE_LOCATION (c
),
6613 "%qD is not a variable in clause %<firstprivate%>",
6616 error_at (OMP_CLAUSE_LOCATION (c
),
6617 "%qE is not a variable in clause %<firstprivate%>",
6621 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6622 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6624 error_at (OMP_CLAUSE_LOCATION (c
),
6625 "%qD appears more than once in data clauses", t
);
6628 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6630 if (ort
== C_ORT_ACC
)
6631 error_at (OMP_CLAUSE_LOCATION (c
),
6632 "%qD appears more than once in data clauses", t
);
6634 error_at (OMP_CLAUSE_LOCATION (c
),
6635 "%qD appears both in data and map clauses", t
);
6639 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6640 goto handle_field_decl
;
6642 case OMP_CLAUSE_LASTPRIVATE
:
6643 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6645 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6647 t
= OMP_CLAUSE_DECL (c
);
6648 if (t
== current_class_ptr
)
6650 error_at (OMP_CLAUSE_LOCATION (c
),
6651 "%<this%> allowed in OpenMP only in %<declare simd%>"
6656 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6657 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6658 || TREE_CODE (t
) != FIELD_DECL
))
6660 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6663 error_at (OMP_CLAUSE_LOCATION (c
),
6664 "%qD is not a variable in clause %<lastprivate%>",
6667 error_at (OMP_CLAUSE_LOCATION (c
),
6668 "%qE is not a variable in clause %<lastprivate%>",
6672 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6673 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6675 error_at (OMP_CLAUSE_LOCATION (c
),
6676 "%qD appears more than once in data clauses", t
);
6680 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6681 goto handle_field_decl
;
6684 t
= OMP_CLAUSE_IF_EXPR (c
);
6685 t
= maybe_convert_cond (t
);
6686 if (t
== error_mark_node
)
6688 else if (!processing_template_decl
)
6689 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6690 OMP_CLAUSE_IF_EXPR (c
) = t
;
6693 case OMP_CLAUSE_FINAL
:
6694 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6695 t
= maybe_convert_cond (t
);
6696 if (t
== error_mark_node
)
6698 else if (!processing_template_decl
)
6699 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6700 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6703 case OMP_CLAUSE_GANG
:
6704 /* Operand 1 is the gang static: argument. */
6705 t
= OMP_CLAUSE_OPERAND (c
, 1);
6708 if (t
== error_mark_node
)
6710 else if (!type_dependent_expression_p (t
)
6711 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6713 error_at (OMP_CLAUSE_LOCATION (c
),
6714 "%<gang%> static expression must be integral");
6719 t
= mark_rvalue_use (t
);
6720 if (!processing_template_decl
)
6722 t
= maybe_constant_value (t
);
6723 if (TREE_CODE (t
) == INTEGER_CST
6724 && tree_int_cst_sgn (t
) != 1
6725 && t
!= integer_minus_one_node
)
6727 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6728 "%<gang%> static value must be "
6730 t
= integer_one_node
;
6732 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6735 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6737 /* Check operand 0, the num argument. */
6740 case OMP_CLAUSE_WORKER
:
6741 case OMP_CLAUSE_VECTOR
:
6742 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6746 case OMP_CLAUSE_NUM_TASKS
:
6747 case OMP_CLAUSE_NUM_TEAMS
:
6748 case OMP_CLAUSE_NUM_THREADS
:
6749 case OMP_CLAUSE_NUM_GANGS
:
6750 case OMP_CLAUSE_NUM_WORKERS
:
6751 case OMP_CLAUSE_VECTOR_LENGTH
:
6752 t
= OMP_CLAUSE_OPERAND (c
, 0);
6753 if (t
== error_mark_node
)
6755 else if (!type_dependent_expression_p (t
)
6756 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6758 switch (OMP_CLAUSE_CODE (c
))
6760 case OMP_CLAUSE_GANG
:
6761 error_at (OMP_CLAUSE_LOCATION (c
),
6762 "%<gang%> num expression must be integral"); break;
6763 case OMP_CLAUSE_VECTOR
:
6764 error_at (OMP_CLAUSE_LOCATION (c
),
6765 "%<vector%> length expression must be integral");
6767 case OMP_CLAUSE_WORKER
:
6768 error_at (OMP_CLAUSE_LOCATION (c
),
6769 "%<worker%> num expression must be integral");
6772 error_at (OMP_CLAUSE_LOCATION (c
),
6773 "%qs expression must be integral",
6774 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6780 t
= mark_rvalue_use (t
);
6781 if (!processing_template_decl
)
6783 t
= maybe_constant_value (t
);
6784 if (TREE_CODE (t
) == INTEGER_CST
6785 && tree_int_cst_sgn (t
) != 1)
6787 switch (OMP_CLAUSE_CODE (c
))
6789 case OMP_CLAUSE_GANG
:
6790 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6791 "%<gang%> num value must be positive");
6793 case OMP_CLAUSE_VECTOR
:
6794 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6795 "%<vector%> length value must be "
6798 case OMP_CLAUSE_WORKER
:
6799 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6800 "%<worker%> num value must be "
6804 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6805 "%qs value must be positive",
6806 omp_clause_code_name
6807 [OMP_CLAUSE_CODE (c
)]);
6809 t
= integer_one_node
;
6811 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6813 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6817 case OMP_CLAUSE_SCHEDULE
:
6818 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6821 else if (t
== error_mark_node
)
6823 else if (!type_dependent_expression_p (t
)
6824 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6826 error_at (OMP_CLAUSE_LOCATION (c
),
6827 "schedule chunk size expression must be integral");
6832 t
= mark_rvalue_use (t
);
6833 if (!processing_template_decl
)
6835 t
= maybe_constant_value (t
);
6836 if (TREE_CODE (t
) == INTEGER_CST
6837 && tree_int_cst_sgn (t
) != 1)
6839 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6840 "chunk size value must be positive");
6841 t
= integer_one_node
;
6843 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6845 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6848 schedule_seen
= true;
6851 case OMP_CLAUSE_SIMDLEN
:
6852 case OMP_CLAUSE_SAFELEN
:
6853 t
= OMP_CLAUSE_OPERAND (c
, 0);
6854 if (t
== error_mark_node
)
6856 else if (!type_dependent_expression_p (t
)
6857 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6859 error_at (OMP_CLAUSE_LOCATION (c
),
6860 "%qs length expression must be integral",
6861 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6866 t
= mark_rvalue_use (t
);
6867 if (!processing_template_decl
)
6869 t
= maybe_constant_value (t
);
6870 if (TREE_CODE (t
) != INTEGER_CST
6871 || tree_int_cst_sgn (t
) != 1)
6873 error_at (OMP_CLAUSE_LOCATION (c
),
6874 "%qs length expression must be positive "
6875 "constant integer expression",
6876 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6880 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6881 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6886 case OMP_CLAUSE_ASYNC
:
6887 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6888 if (t
== error_mark_node
)
6890 else if (!type_dependent_expression_p (t
)
6891 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6893 error_at (OMP_CLAUSE_LOCATION (c
),
6894 "%<async%> expression must be integral");
6899 t
= mark_rvalue_use (t
);
6900 if (!processing_template_decl
)
6901 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6902 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6906 case OMP_CLAUSE_WAIT
:
6907 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6908 if (t
== error_mark_node
)
6910 else if (!processing_template_decl
)
6911 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6912 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6915 case OMP_CLAUSE_THREAD_LIMIT
:
6916 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6917 if (t
== error_mark_node
)
6919 else if (!type_dependent_expression_p (t
)
6920 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6922 error_at (OMP_CLAUSE_LOCATION (c
),
6923 "%<thread_limit%> expression must be integral");
6928 t
= mark_rvalue_use (t
);
6929 if (!processing_template_decl
)
6931 t
= maybe_constant_value (t
);
6932 if (TREE_CODE (t
) == INTEGER_CST
6933 && tree_int_cst_sgn (t
) != 1)
6935 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6936 "%<thread_limit%> value must be positive");
6937 t
= integer_one_node
;
6939 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6941 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6945 case OMP_CLAUSE_DEVICE
:
6946 t
= OMP_CLAUSE_DEVICE_ID (c
);
6947 if (t
== error_mark_node
)
6949 else if (!type_dependent_expression_p (t
)
6950 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6952 error_at (OMP_CLAUSE_LOCATION (c
),
6953 "%<device%> id must be integral");
6958 t
= mark_rvalue_use (t
);
6959 if (!processing_template_decl
)
6960 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6961 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6965 case OMP_CLAUSE_DIST_SCHEDULE
:
6966 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6969 else if (t
== error_mark_node
)
6971 else if (!type_dependent_expression_p (t
)
6972 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6974 error_at (OMP_CLAUSE_LOCATION (c
),
6975 "%<dist_schedule%> chunk size expression must be "
6981 t
= mark_rvalue_use (t
);
6982 if (!processing_template_decl
)
6983 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6984 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6988 case OMP_CLAUSE_ALIGNED
:
6989 t
= OMP_CLAUSE_DECL (c
);
6990 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6992 error_at (OMP_CLAUSE_LOCATION (c
),
6993 "%<this%> allowed in OpenMP only in %<declare simd%>"
6998 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7000 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7003 error_at (OMP_CLAUSE_LOCATION (c
),
7004 "%qD is not a variable in %<aligned%> clause", t
);
7006 error_at (OMP_CLAUSE_LOCATION (c
),
7007 "%qE is not a variable in %<aligned%> clause", t
);
7010 else if (!type_dependent_expression_p (t
)
7011 && !TYPE_PTR_P (TREE_TYPE (t
))
7012 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
7013 && (!TYPE_REF_P (TREE_TYPE (t
))
7014 || (!INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
7015 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
7018 error_at (OMP_CLAUSE_LOCATION (c
),
7019 "%qE in %<aligned%> clause is neither a pointer nor "
7020 "an array nor a reference to pointer or array", t
);
7023 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
7025 error_at (OMP_CLAUSE_LOCATION (c
),
7026 "%qD appears more than once in %<aligned%> clauses",
7031 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
7032 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
7033 if (t
== error_mark_node
)
7035 else if (t
== NULL_TREE
)
7037 else if (!type_dependent_expression_p (t
)
7038 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7040 error_at (OMP_CLAUSE_LOCATION (c
),
7041 "%<aligned%> clause alignment expression must "
7047 t
= mark_rvalue_use (t
);
7048 if (!processing_template_decl
)
7050 t
= maybe_constant_value (t
);
7051 if (TREE_CODE (t
) != INTEGER_CST
7052 || tree_int_cst_sgn (t
) != 1)
7054 error_at (OMP_CLAUSE_LOCATION (c
),
7055 "%<aligned%> clause alignment expression must "
7056 "be positive constant integer expression");
7060 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7062 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
7066 case OMP_CLAUSE_NONTEMPORAL
:
7067 t
= OMP_CLAUSE_DECL (c
);
7068 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7070 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7073 error_at (OMP_CLAUSE_LOCATION (c
),
7074 "%qD is not a variable in %<nontemporal%> clause",
7077 error_at (OMP_CLAUSE_LOCATION (c
),
7078 "%qE is not a variable in %<nontemporal%> clause",
7082 else if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
7084 error_at (OMP_CLAUSE_LOCATION (c
),
7085 "%qD appears more than once in %<nontemporal%> "
7090 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
7093 case OMP_CLAUSE_DEPEND
:
7094 t
= OMP_CLAUSE_DECL (c
);
7097 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
7098 == OMP_CLAUSE_DEPEND_SOURCE
);
7101 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
7103 if (cp_finish_omp_clause_depend_sink (c
))
7107 if (TREE_CODE (t
) == TREE_LIST
7109 && TREE_CODE (TREE_PURPOSE (t
)) == TREE_VEC
)
7111 if (TREE_PURPOSE (t
) != last_iterators
)
7112 last_iterators_remove
7113 = cp_omp_finish_iterators (TREE_PURPOSE (t
));
7114 last_iterators
= TREE_PURPOSE (t
);
7116 if (last_iterators_remove
)
7117 t
= error_mark_node
;
7120 last_iterators
= NULL_TREE
;
7122 if (TREE_CODE (t
) == TREE_LIST
)
7124 if (handle_omp_array_sections (c
, ort
))
7126 else if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_DEPOBJ
)
7128 error_at (OMP_CLAUSE_LOCATION (c
),
7129 "%<depend%> clause with %<depobj%> dependence "
7130 "type on array section");
7135 if (t
== error_mark_node
)
7137 else if (t
== current_class_ptr
)
7139 error_at (OMP_CLAUSE_LOCATION (c
),
7140 "%<this%> allowed in OpenMP only in %<declare simd%>"
7144 else if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7146 else if (!lvalue_p (t
))
7149 error_at (OMP_CLAUSE_LOCATION (c
),
7150 "%qD is not lvalue expression nor array section "
7151 "in %<depend%> clause", t
);
7153 error_at (OMP_CLAUSE_LOCATION (c
),
7154 "%qE is not lvalue expression nor array section "
7155 "in %<depend%> clause", t
);
7158 else if (TREE_CODE (t
) == COMPONENT_REF
7159 && TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
7160 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
7162 error_at (OMP_CLAUSE_LOCATION (c
),
7163 "bit-field %qE in %qs clause", t
, "depend");
7166 else if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_DEPOBJ
)
7168 if (!c_omp_depend_t_p (TYPE_REF_P (TREE_TYPE (t
))
7169 ? TREE_TYPE (TREE_TYPE (t
))
7172 error_at (OMP_CLAUSE_LOCATION (c
),
7173 "%qE does not have %<omp_depend_t%> type in "
7174 "%<depend%> clause with %<depobj%> dependence "
7179 else if (c_omp_depend_t_p (TYPE_REF_P (TREE_TYPE (t
))
7180 ? TREE_TYPE (TREE_TYPE (t
))
7183 error_at (OMP_CLAUSE_LOCATION (c
),
7184 "%qE should not have %<omp_depend_t%> type in "
7185 "%<depend%> clause with dependence type other than "
7191 tree addr
= cp_build_addr_expr (t
, tf_warning_or_error
);
7192 if (addr
== error_mark_node
)
7196 t
= cp_build_indirect_ref (addr
, RO_UNARY_STAR
,
7197 tf_warning_or_error
);
7198 if (t
== error_mark_node
)
7200 else if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == TREE_LIST
7201 && TREE_PURPOSE (OMP_CLAUSE_DECL (c
))
7202 && (TREE_CODE (TREE_PURPOSE (OMP_CLAUSE_DECL (c
)))
7204 TREE_VALUE (OMP_CLAUSE_DECL (c
)) = t
;
7206 OMP_CLAUSE_DECL (c
) = t
;
7211 case OMP_CLAUSE_MAP
:
7213 case OMP_CLAUSE_FROM
:
7214 case OMP_CLAUSE__CACHE_
:
7215 t
= OMP_CLAUSE_DECL (c
);
7216 if (TREE_CODE (t
) == TREE_LIST
)
7218 if (handle_omp_array_sections (c
, ort
))
7222 t
= OMP_CLAUSE_DECL (c
);
7223 if (TREE_CODE (t
) != TREE_LIST
7224 && !type_dependent_expression_p (t
)
7225 && !cp_omp_mappable_type (TREE_TYPE (t
)))
7227 error_at (OMP_CLAUSE_LOCATION (c
),
7228 "array section does not have mappable type "
7230 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7231 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7234 while (TREE_CODE (t
) == ARRAY_REF
)
7235 t
= TREE_OPERAND (t
, 0);
7236 if (TREE_CODE (t
) == COMPONENT_REF
7237 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
7239 while (TREE_CODE (t
) == COMPONENT_REF
)
7240 t
= TREE_OPERAND (t
, 0);
7241 if (REFERENCE_REF_P (t
))
7242 t
= TREE_OPERAND (t
, 0);
7243 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
7245 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7247 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7248 error_at (OMP_CLAUSE_LOCATION (c
),
7249 "%qD appears more than once in motion"
7251 else if (ort
== C_ORT_ACC
)
7252 error_at (OMP_CLAUSE_LOCATION (c
),
7253 "%qD appears more than once in data"
7256 error_at (OMP_CLAUSE_LOCATION (c
),
7257 "%qD appears more than once in map"
7263 bitmap_set_bit (&map_head
, DECL_UID (t
));
7264 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
7270 if (t
== error_mark_node
)
7275 if (REFERENCE_REF_P (t
)
7276 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
7278 t
= TREE_OPERAND (t
, 0);
7279 OMP_CLAUSE_DECL (c
) = t
;
7281 if (TREE_CODE (t
) == COMPONENT_REF
7282 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
7283 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
7285 if (type_dependent_expression_p (t
))
7287 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
7288 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
7290 error_at (OMP_CLAUSE_LOCATION (c
),
7291 "bit-field %qE in %qs clause",
7292 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7295 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
7297 error_at (OMP_CLAUSE_LOCATION (c
),
7298 "%qE does not have a mappable type in %qs clause",
7299 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7300 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7303 while (TREE_CODE (t
) == COMPONENT_REF
)
7305 if (TREE_TYPE (TREE_OPERAND (t
, 0))
7306 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
7309 error_at (OMP_CLAUSE_LOCATION (c
),
7310 "%qE is a member of a union", t
);
7314 t
= TREE_OPERAND (t
, 0);
7318 if (REFERENCE_REF_P (t
))
7319 t
= TREE_OPERAND (t
, 0);
7320 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
7322 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
7323 goto handle_map_references
;
7326 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7328 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7330 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7331 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
7332 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
7335 error_at (OMP_CLAUSE_LOCATION (c
),
7336 "%qD is not a variable in %qs clause", t
,
7337 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7339 error_at (OMP_CLAUSE_LOCATION (c
),
7340 "%qE is not a variable in %qs clause", t
,
7341 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7344 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7346 error_at (OMP_CLAUSE_LOCATION (c
),
7347 "%qD is threadprivate variable in %qs clause", t
,
7348 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7351 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
7353 error_at (OMP_CLAUSE_LOCATION (c
),
7354 "%<this%> allowed in OpenMP only in %<declare simd%>"
7359 else if (!processing_template_decl
7360 && !TYPE_REF_P (TREE_TYPE (t
))
7361 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
7362 || (OMP_CLAUSE_MAP_KIND (c
)
7363 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
7364 && !cxx_mark_addressable (t
))
7366 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7367 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
7368 || (OMP_CLAUSE_MAP_KIND (c
)
7369 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
7370 && t
== OMP_CLAUSE_DECL (c
)
7371 && !type_dependent_expression_p (t
)
7372 && !cp_omp_mappable_type (TYPE_REF_P (TREE_TYPE (t
))
7373 ? TREE_TYPE (TREE_TYPE (t
))
7376 error_at (OMP_CLAUSE_LOCATION (c
),
7377 "%qD does not have a mappable type in %qs clause", t
,
7378 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7379 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7382 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7383 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
7384 && !type_dependent_expression_p (t
)
7385 && !INDIRECT_TYPE_P (TREE_TYPE (t
)))
7387 error_at (OMP_CLAUSE_LOCATION (c
),
7388 "%qD is not a pointer variable", t
);
7391 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7392 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
7394 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
7395 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7397 error_at (OMP_CLAUSE_LOCATION (c
),
7398 "%qD appears more than once in data clauses", t
);
7401 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7403 if (ort
== C_ORT_ACC
)
7404 error_at (OMP_CLAUSE_LOCATION (c
),
7405 "%qD appears more than once in data clauses", t
);
7407 error_at (OMP_CLAUSE_LOCATION (c
),
7408 "%qD appears both in data and map clauses", t
);
7412 bitmap_set_bit (&generic_head
, DECL_UID (t
));
7414 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7416 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7417 error_at (OMP_CLAUSE_LOCATION (c
),
7418 "%qD appears more than once in motion clauses", t
);
7419 if (ort
== C_ORT_ACC
)
7420 error_at (OMP_CLAUSE_LOCATION (c
),
7421 "%qD appears more than once in data clauses", t
);
7423 error_at (OMP_CLAUSE_LOCATION (c
),
7424 "%qD appears more than once in map clauses", t
);
7427 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
7428 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7430 if (ort
== C_ORT_ACC
)
7431 error_at (OMP_CLAUSE_LOCATION (c
),
7432 "%qD appears more than once in data clauses", t
);
7434 error_at (OMP_CLAUSE_LOCATION (c
),
7435 "%qD appears both in data and map clauses", t
);
7440 bitmap_set_bit (&map_head
, DECL_UID (t
));
7441 if (t
!= OMP_CLAUSE_DECL (c
)
7442 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
7443 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
7445 handle_map_references
:
7447 && !processing_template_decl
7448 && ort
!= C_ORT_DECLARE_SIMD
7449 && TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
))))
7451 t
= OMP_CLAUSE_DECL (c
);
7452 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7454 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
7455 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
7457 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
7459 else if (OMP_CLAUSE_MAP_KIND (c
)
7460 != GOMP_MAP_FIRSTPRIVATE_POINTER
7461 && (OMP_CLAUSE_MAP_KIND (c
)
7462 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
7463 && (OMP_CLAUSE_MAP_KIND (c
)
7464 != GOMP_MAP_ALWAYS_POINTER
))
7466 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
7468 if (TREE_CODE (t
) == COMPONENT_REF
)
7469 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
7471 OMP_CLAUSE_SET_MAP_KIND (c2
,
7472 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
7473 OMP_CLAUSE_DECL (c2
) = t
;
7474 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
7475 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
7476 OMP_CLAUSE_CHAIN (c
) = c2
;
7477 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
7478 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
7480 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
7486 case OMP_CLAUSE_TO_DECLARE
:
7487 case OMP_CLAUSE_LINK
:
7488 t
= OMP_CLAUSE_DECL (c
);
7489 if (TREE_CODE (t
) == FUNCTION_DECL
7490 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
7492 else if (!VAR_P (t
))
7494 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
7496 if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
7497 error_at (OMP_CLAUSE_LOCATION (c
),
7498 "template %qE in clause %qs", t
,
7499 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7500 else if (really_overloaded_fn (t
))
7501 error_at (OMP_CLAUSE_LOCATION (c
),
7502 "overloaded function name %qE in clause %qs", t
,
7503 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7505 error_at (OMP_CLAUSE_LOCATION (c
),
7506 "%qE is neither a variable nor a function name "
7508 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7511 error_at (OMP_CLAUSE_LOCATION (c
),
7512 "%qE is not a variable in clause %qs", t
,
7513 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7516 else if (DECL_THREAD_LOCAL_P (t
))
7518 error_at (OMP_CLAUSE_LOCATION (c
),
7519 "%qD is threadprivate variable in %qs clause", t
,
7520 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7523 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
7525 error_at (OMP_CLAUSE_LOCATION (c
),
7526 "%qD does not have a mappable type in %qs clause", t
,
7527 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7528 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7533 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
7535 error_at (OMP_CLAUSE_LOCATION (c
),
7536 "%qE appears more than once on the same "
7537 "%<declare target%> directive", t
);
7541 bitmap_set_bit (&generic_head
, DECL_UID (t
));
7544 case OMP_CLAUSE_UNIFORM
:
7545 t
= OMP_CLAUSE_DECL (c
);
7546 if (TREE_CODE (t
) != PARM_DECL
)
7548 if (processing_template_decl
)
7551 error_at (OMP_CLAUSE_LOCATION (c
),
7552 "%qD is not an argument in %<uniform%> clause", t
);
7554 error_at (OMP_CLAUSE_LOCATION (c
),
7555 "%qE is not an argument in %<uniform%> clause", t
);
7559 /* map_head bitmap is used as uniform_head if declare_simd. */
7560 bitmap_set_bit (&map_head
, DECL_UID (t
));
7561 goto check_dup_generic
;
7563 case OMP_CLAUSE_GRAINSIZE
:
7564 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
7565 if (t
== error_mark_node
)
7567 else if (!type_dependent_expression_p (t
)
7568 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7570 error_at (OMP_CLAUSE_LOCATION (c
),
7571 "%<grainsize%> expression must be integral");
7576 t
= mark_rvalue_use (t
);
7577 if (!processing_template_decl
)
7579 t
= maybe_constant_value (t
);
7580 if (TREE_CODE (t
) == INTEGER_CST
7581 && tree_int_cst_sgn (t
) != 1)
7583 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7584 "%<grainsize%> value must be positive");
7585 t
= integer_one_node
;
7587 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7589 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
7593 case OMP_CLAUSE_PRIORITY
:
7594 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
7595 if (t
== error_mark_node
)
7597 else if (!type_dependent_expression_p (t
)
7598 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7600 error_at (OMP_CLAUSE_LOCATION (c
),
7601 "%<priority%> expression must be integral");
7606 t
= mark_rvalue_use (t
);
7607 if (!processing_template_decl
)
7609 t
= maybe_constant_value (t
);
7610 if (TREE_CODE (t
) == INTEGER_CST
7611 && tree_int_cst_sgn (t
) == -1)
7613 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7614 "%<priority%> value must be non-negative");
7615 t
= integer_one_node
;
7617 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7619 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7623 case OMP_CLAUSE_HINT
:
7624 t
= OMP_CLAUSE_HINT_EXPR (c
);
7625 if (t
== error_mark_node
)
7627 else if (!type_dependent_expression_p (t
)
7628 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7630 error_at (OMP_CLAUSE_LOCATION (c
),
7631 "%<hint%> expression must be integral");
7636 t
= mark_rvalue_use (t
);
7637 if (!processing_template_decl
)
7639 t
= maybe_constant_value (t
);
7640 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7641 if (TREE_CODE (t
) != INTEGER_CST
)
7643 error_at (OMP_CLAUSE_LOCATION (c
),
7644 "%<hint%> expression must be constant integer "
7649 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7653 case OMP_CLAUSE_IS_DEVICE_PTR
:
7654 case OMP_CLAUSE_USE_DEVICE_PTR
:
7655 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7656 t
= OMP_CLAUSE_DECL (c
);
7657 if (!type_dependent_expression_p (t
))
7659 tree type
= TREE_TYPE (t
);
7660 if (!TYPE_PTR_P (type
)
7661 && (!TYPE_REF_P (type
) || !TYPE_PTR_P (TREE_TYPE (type
))))
7663 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_USE_DEVICE_PTR
7664 && ort
== C_ORT_OMP
)
7666 error_at (OMP_CLAUSE_LOCATION (c
),
7667 "%qs variable is neither a pointer "
7668 "nor reference to pointer",
7669 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7672 else if (TREE_CODE (type
) != ARRAY_TYPE
7673 && (!TYPE_REF_P (type
)
7674 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7676 error_at (OMP_CLAUSE_LOCATION (c
),
7677 "%qs variable is neither a pointer, nor an "
7678 "array nor reference to pointer or array",
7679 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7684 goto check_dup_generic
;
7686 case OMP_CLAUSE_USE_DEVICE_ADDR
:
7688 t
= OMP_CLAUSE_DECL (c
);
7689 if (!processing_template_decl
7690 && (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
7691 && !TYPE_REF_P (TREE_TYPE (t
))
7692 && !cxx_mark_addressable (t
))
7694 goto check_dup_generic
;
7696 case OMP_CLAUSE_NOWAIT
:
7697 case OMP_CLAUSE_DEFAULT
:
7698 case OMP_CLAUSE_UNTIED
:
7699 case OMP_CLAUSE_COLLAPSE
:
7700 case OMP_CLAUSE_MERGEABLE
:
7701 case OMP_CLAUSE_PARALLEL
:
7702 case OMP_CLAUSE_FOR
:
7703 case OMP_CLAUSE_SECTIONS
:
7704 case OMP_CLAUSE_TASKGROUP
:
7705 case OMP_CLAUSE_PROC_BIND
:
7706 case OMP_CLAUSE_DEVICE_TYPE
:
7707 case OMP_CLAUSE_NOGROUP
:
7708 case OMP_CLAUSE_THREADS
:
7709 case OMP_CLAUSE_SIMD
:
7710 case OMP_CLAUSE_DEFAULTMAP
:
7711 case OMP_CLAUSE_BIND
:
7712 case OMP_CLAUSE_AUTO
:
7713 case OMP_CLAUSE_INDEPENDENT
:
7714 case OMP_CLAUSE_SEQ
:
7715 case OMP_CLAUSE_IF_PRESENT
:
7716 case OMP_CLAUSE_FINALIZE
:
7719 case OMP_CLAUSE_TILE
:
7720 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7721 list
= TREE_CHAIN (list
))
7723 t
= TREE_VALUE (list
);
7725 if (t
== error_mark_node
)
7727 else if (!type_dependent_expression_p (t
)
7728 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7730 error_at (OMP_CLAUSE_LOCATION (c
),
7731 "%<tile%> argument needs integral type");
7736 t
= mark_rvalue_use (t
);
7737 if (!processing_template_decl
)
7739 /* Zero is used to indicate '*', we permit you
7740 to get there via an ICE of value zero. */
7741 t
= maybe_constant_value (t
);
7742 if (!tree_fits_shwi_p (t
)
7743 || tree_to_shwi (t
) < 0)
7745 error_at (OMP_CLAUSE_LOCATION (c
),
7746 "%<tile%> argument needs positive "
7747 "integral constant");
7750 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7754 /* Update list item. */
7755 TREE_VALUE (list
) = t
;
7759 case OMP_CLAUSE_ORDERED
:
7760 ordered_seen
= true;
7763 case OMP_CLAUSE_ORDER
:
7770 case OMP_CLAUSE_INBRANCH
:
7771 case OMP_CLAUSE_NOTINBRANCH
:
7774 error_at (OMP_CLAUSE_LOCATION (c
),
7775 "%<inbranch%> clause is incompatible with "
7782 case OMP_CLAUSE_INCLUSIVE
:
7783 case OMP_CLAUSE_EXCLUSIVE
:
7784 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7786 t
= OMP_CLAUSE_DECL (c
);
7787 if (t
== current_class_ptr
)
7789 error_at (OMP_CLAUSE_LOCATION (c
),
7790 "%<this%> allowed in OpenMP only in %<declare simd%>"
7796 && TREE_CODE (t
) != PARM_DECL
7797 && TREE_CODE (t
) != FIELD_DECL
)
7799 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7802 error_at (OMP_CLAUSE_LOCATION (c
),
7803 "%qD is not a variable in clause %qs", t
,
7804 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7806 error_at (OMP_CLAUSE_LOCATION (c
),
7807 "%qE is not a variable in clause %qs", t
,
7808 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7818 *pc
= OMP_CLAUSE_CHAIN (c
);
7820 pc
= &OMP_CLAUSE_CHAIN (c
);
7823 if (reduction_seen
< 0 && (ordered_seen
|| schedule_seen
))
7824 reduction_seen
= -2;
7826 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7828 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7829 bool remove
= false;
7830 bool need_complete_type
= false;
7831 bool need_default_ctor
= false;
7832 bool need_copy_ctor
= false;
7833 bool need_copy_assignment
= false;
7834 bool need_implicitly_determined
= false;
7835 bool need_dtor
= false;
7836 tree type
, inner_type
;
7840 case OMP_CLAUSE_SHARED
:
7841 need_implicitly_determined
= true;
7843 case OMP_CLAUSE_PRIVATE
:
7844 need_complete_type
= true;
7845 need_default_ctor
= true;
7847 need_implicitly_determined
= true;
7849 case OMP_CLAUSE_FIRSTPRIVATE
:
7850 need_complete_type
= true;
7851 need_copy_ctor
= true;
7853 need_implicitly_determined
= true;
7855 case OMP_CLAUSE_LASTPRIVATE
:
7856 need_complete_type
= true;
7857 need_copy_assignment
= true;
7858 need_implicitly_determined
= true;
7860 case OMP_CLAUSE_REDUCTION
:
7861 if (reduction_seen
== -2)
7862 OMP_CLAUSE_REDUCTION_INSCAN (c
) = 0;
7863 if (OMP_CLAUSE_REDUCTION_INSCAN (c
))
7864 need_copy_assignment
= true;
7865 need_implicitly_determined
= true;
7867 case OMP_CLAUSE_IN_REDUCTION
:
7868 case OMP_CLAUSE_TASK_REDUCTION
:
7869 case OMP_CLAUSE_INCLUSIVE
:
7870 case OMP_CLAUSE_EXCLUSIVE
:
7871 need_implicitly_determined
= true;
7873 case OMP_CLAUSE_LINEAR
:
7874 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7875 need_implicitly_determined
= true;
7876 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7877 && !bitmap_bit_p (&map_head
,
7878 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7880 error_at (OMP_CLAUSE_LOCATION (c
),
7881 "%<linear%> clause step is a parameter %qD not "
7882 "specified in %<uniform%> clause",
7883 OMP_CLAUSE_LINEAR_STEP (c
));
7884 *pc
= OMP_CLAUSE_CHAIN (c
);
7888 case OMP_CLAUSE_COPYPRIVATE
:
7889 need_copy_assignment
= true;
7891 case OMP_CLAUSE_COPYIN
:
7892 need_copy_assignment
= true;
7894 case OMP_CLAUSE_SIMDLEN
:
7896 && !processing_template_decl
7897 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7898 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7900 error_at (OMP_CLAUSE_LOCATION (c
),
7901 "%<simdlen%> clause value is bigger than "
7902 "%<safelen%> clause value");
7903 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7904 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7906 pc
= &OMP_CLAUSE_CHAIN (c
);
7908 case OMP_CLAUSE_SCHEDULE
:
7910 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7911 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7913 error_at (OMP_CLAUSE_LOCATION (c
),
7914 "%<nonmonotonic%> schedule modifier specified "
7915 "together with %<ordered%> clause");
7916 OMP_CLAUSE_SCHEDULE_KIND (c
)
7917 = (enum omp_clause_schedule_kind
)
7918 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7919 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7921 if (reduction_seen
== -2)
7922 error_at (OMP_CLAUSE_LOCATION (c
),
7923 "%qs clause specified together with %<inscan%> "
7924 "%<reduction%> clause", "schedule");
7925 pc
= &OMP_CLAUSE_CHAIN (c
);
7927 case OMP_CLAUSE_NOGROUP
:
7930 error_at (OMP_CLAUSE_LOCATION (c
),
7931 "%<nogroup%> clause must not be used together with "
7932 "%<reduction%> clause");
7933 *pc
= OMP_CLAUSE_CHAIN (c
);
7936 pc
= &OMP_CLAUSE_CHAIN (c
);
7938 case OMP_CLAUSE_ORDERED
:
7939 if (reduction_seen
== -2)
7940 error_at (OMP_CLAUSE_LOCATION (c
),
7941 "%qs clause specified together with %<inscan%> "
7942 "%<reduction%> clause", "ordered");
7943 pc
= &OMP_CLAUSE_CHAIN (c
);
7945 case OMP_CLAUSE_ORDER
:
7948 error_at (OMP_CLAUSE_LOCATION (c
),
7949 "%<order%> clause must not be used together "
7950 "with %<ordered%>");
7951 *pc
= OMP_CLAUSE_CHAIN (c
);
7954 pc
= &OMP_CLAUSE_CHAIN (c
);
7956 case OMP_CLAUSE_NOWAIT
:
7957 if (copyprivate_seen
)
7959 error_at (OMP_CLAUSE_LOCATION (c
),
7960 "%<nowait%> clause must not be used together "
7961 "with %<copyprivate%>");
7962 *pc
= OMP_CLAUSE_CHAIN (c
);
7967 pc
= &OMP_CLAUSE_CHAIN (c
);
7971 t
= OMP_CLAUSE_DECL (c
);
7972 if (processing_template_decl
7973 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7975 pc
= &OMP_CLAUSE_CHAIN (c
);
7981 case OMP_CLAUSE_LASTPRIVATE
:
7982 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7984 need_default_ctor
= true;
7989 case OMP_CLAUSE_REDUCTION
:
7990 case OMP_CLAUSE_IN_REDUCTION
:
7991 case OMP_CLAUSE_TASK_REDUCTION
:
7992 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7996 t
= OMP_CLAUSE_DECL (c
);
7999 case OMP_CLAUSE_COPYIN
:
8000 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
8002 error_at (OMP_CLAUSE_LOCATION (c
),
8003 "%qE must be %<threadprivate%> for %<copyin%>", t
);
8012 if (need_complete_type
|| need_copy_assignment
)
8014 t
= require_complete_type (t
);
8015 if (t
== error_mark_node
)
8017 else if (!processing_template_decl
8018 && TYPE_REF_P (TREE_TYPE (t
))
8019 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
8022 if (need_implicitly_determined
)
8024 const char *share_name
= NULL
;
8026 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
8027 share_name
= "threadprivate";
8028 else switch (cxx_omp_predetermined_sharing_1 (t
))
8030 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
8032 case OMP_CLAUSE_DEFAULT_SHARED
:
8033 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
8034 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
)
8035 && c_omp_predefined_variable (t
))
8036 /* The __func__ variable and similar function-local predefined
8037 variables may be listed in a shared or firstprivate
8041 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
8043 && cxx_omp_const_qual_no_mutable (t
))
8045 tree ctx
= CP_DECL_CONTEXT (t
);
8046 /* const qualified static data members without mutable
8047 member may be specified in firstprivate clause. */
8048 if (TYPE_P (ctx
) && MAYBE_CLASS_TYPE_P (ctx
))
8051 share_name
= "shared";
8053 case OMP_CLAUSE_DEFAULT_PRIVATE
:
8054 share_name
= "private";
8061 error_at (OMP_CLAUSE_LOCATION (c
),
8062 "%qE is predetermined %qs for %qs",
8063 omp_clause_printable_decl (t
), share_name
,
8064 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
8067 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
8068 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_FIRSTPRIVATE
8069 && cxx_omp_const_qual_no_mutable (t
))
8071 error_at (OMP_CLAUSE_LOCATION (c
),
8072 "%<const%> qualified %qE without %<mutable%> member "
8073 "may appear only in %<shared%> or %<firstprivate%> "
8074 "clauses", omp_clause_printable_decl (t
));
8079 /* We're interested in the base element, not arrays. */
8080 inner_type
= type
= TREE_TYPE (t
);
8081 if ((need_complete_type
8082 || need_copy_assignment
8083 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
8084 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
8085 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
8086 && TYPE_REF_P (inner_type
))
8087 inner_type
= TREE_TYPE (inner_type
);
8088 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
8089 inner_type
= TREE_TYPE (inner_type
);
8091 /* Check for special function availability by building a call to one.
8092 Save the results, because later we won't be in the right context
8093 for making these queries. */
8094 if (CLASS_TYPE_P (inner_type
)
8095 && COMPLETE_TYPE_P (inner_type
)
8096 && (need_default_ctor
|| need_copy_ctor
8097 || need_copy_assignment
|| need_dtor
)
8098 && !type_dependent_expression_p (t
)
8099 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
8100 need_copy_ctor
, need_copy_assignment
,
8105 && c_kind
== OMP_CLAUSE_SHARED
8106 && processing_template_decl
)
8108 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
8110 OMP_CLAUSE_DECL (c
) = t
;
8114 *pc
= OMP_CLAUSE_CHAIN (c
);
8116 pc
= &OMP_CLAUSE_CHAIN (c
);
8119 bitmap_obstack_release (NULL
);
8123 /* Start processing OpenMP clauses that can include any
8124 privatization clauses for non-static data members. */
8127 push_omp_privatization_clauses (bool ignore_next
)
8129 if (omp_private_member_ignore_next
)
8131 omp_private_member_ignore_next
= ignore_next
;
8134 omp_private_member_ignore_next
= ignore_next
;
8135 if (omp_private_member_map
)
8136 omp_private_member_vec
.safe_push (error_mark_node
);
8137 return push_stmt_list ();
8140 /* Revert remapping of any non-static data members since
8141 the last push_omp_privatization_clauses () call. */
8144 pop_omp_privatization_clauses (tree stmt
)
8146 if (stmt
== NULL_TREE
)
8148 stmt
= pop_stmt_list (stmt
);
8149 if (omp_private_member_map
)
8151 while (!omp_private_member_vec
.is_empty ())
8153 tree t
= omp_private_member_vec
.pop ();
8154 if (t
== error_mark_node
)
8159 bool no_decl_expr
= t
== integer_zero_node
;
8161 t
= omp_private_member_vec
.pop ();
8162 tree
*v
= omp_private_member_map
->get (t
);
8166 omp_private_member_map
->remove (t
);
8168 delete omp_private_member_map
;
8169 omp_private_member_map
= NULL
;
8174 /* Remember OpenMP privatization clauses mapping and clear it.
8175 Used for lambdas. */
8178 save_omp_privatization_clauses (vec
<tree
> &save
)
8181 if (omp_private_member_ignore_next
)
8182 save
.safe_push (integer_one_node
);
8183 omp_private_member_ignore_next
= false;
8184 if (!omp_private_member_map
)
8187 while (!omp_private_member_vec
.is_empty ())
8189 tree t
= omp_private_member_vec
.pop ();
8190 if (t
== error_mark_node
)
8196 if (t
== integer_zero_node
)
8197 t
= omp_private_member_vec
.pop ();
8198 tree
*v
= omp_private_member_map
->get (t
);
8200 save
.safe_push (*v
);
8205 delete omp_private_member_map
;
8206 omp_private_member_map
= NULL
;
8209 /* Restore OpenMP privatization clauses mapping saved by the
8213 restore_omp_privatization_clauses (vec
<tree
> &save
)
8215 gcc_assert (omp_private_member_vec
.is_empty ());
8216 omp_private_member_ignore_next
= false;
8217 if (save
.is_empty ())
8219 if (save
.length () == 1 && save
[0] == integer_one_node
)
8221 omp_private_member_ignore_next
= true;
8226 omp_private_member_map
= new hash_map
<tree
, tree
>;
8227 while (!save
.is_empty ())
8229 tree t
= save
.pop ();
8231 if (t
!= error_mark_node
)
8233 if (t
== integer_one_node
)
8235 omp_private_member_ignore_next
= true;
8236 gcc_assert (save
.is_empty ());
8239 if (t
== integer_zero_node
)
8241 tree
&v
= omp_private_member_map
->get_or_insert (t
);
8244 omp_private_member_vec
.safe_push (t
);
8246 omp_private_member_vec
.safe_push (n
);
8251 /* For all variables in the tree_list VARS, mark them as thread local. */
8254 finish_omp_threadprivate (tree vars
)
8258 /* Mark every variable in VARS to be assigned thread local storage. */
8259 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
8261 tree v
= TREE_PURPOSE (t
);
8263 if (error_operand_p (v
))
8265 else if (!VAR_P (v
))
8266 error ("%<threadprivate%> %qD is not file, namespace "
8267 "or block scope variable", v
);
8268 /* If V had already been marked threadprivate, it doesn't matter
8269 whether it had been used prior to this point. */
8270 else if (TREE_USED (v
)
8271 && (DECL_LANG_SPECIFIC (v
) == NULL
8272 || !CP_DECL_THREADPRIVATE_P (v
)))
8273 error ("%qE declared %<threadprivate%> after first use", v
);
8274 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
8275 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
8276 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
8277 error ("%<threadprivate%> %qE has incomplete type", v
);
8278 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
8279 && CP_DECL_CONTEXT (v
) != current_class_type
)
8280 error ("%<threadprivate%> %qE directive not "
8281 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
8284 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
8285 if (DECL_LANG_SPECIFIC (v
) == NULL
)
8286 retrofit_lang_decl (v
);
8288 if (! CP_DECL_THREAD_LOCAL_P (v
))
8290 CP_DECL_THREAD_LOCAL_P (v
) = true;
8291 set_decl_tls_model (v
, decl_default_tls_model (v
));
8292 /* If rtl has been already set for this var, call
8293 make_decl_rtl once again, so that encode_section_info
8294 has a chance to look at the new decl flags. */
8295 if (DECL_RTL_SET_P (v
))
8298 CP_DECL_THREADPRIVATE_P (v
) = 1;
8303 /* Build an OpenMP structured block. */
8306 begin_omp_structured_block (void)
8308 return do_pushlevel (sk_omp
);
8312 finish_omp_structured_block (tree block
)
8314 return do_poplevel (block
);
8317 /* Similarly, except force the retention of the BLOCK. */
8320 begin_omp_parallel (void)
8322 keep_next_level (true);
8323 return begin_omp_structured_block ();
8326 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
8330 finish_oacc_data (tree clauses
, tree block
)
8334 block
= finish_omp_structured_block (block
);
8336 stmt
= make_node (OACC_DATA
);
8337 TREE_TYPE (stmt
) = void_type_node
;
8338 OACC_DATA_CLAUSES (stmt
) = clauses
;
8339 OACC_DATA_BODY (stmt
) = block
;
8341 return add_stmt (stmt
);
8344 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
8348 finish_oacc_host_data (tree clauses
, tree block
)
8352 block
= finish_omp_structured_block (block
);
8354 stmt
= make_node (OACC_HOST_DATA
);
8355 TREE_TYPE (stmt
) = void_type_node
;
8356 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
8357 OACC_HOST_DATA_BODY (stmt
) = block
;
8359 return add_stmt (stmt
);
8362 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
8366 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
8368 body
= finish_omp_structured_block (body
);
8370 tree stmt
= make_node (code
);
8371 TREE_TYPE (stmt
) = void_type_node
;
8372 OMP_BODY (stmt
) = body
;
8373 OMP_CLAUSES (stmt
) = clauses
;
8375 return add_stmt (stmt
);
8379 finish_omp_parallel (tree clauses
, tree body
)
8383 body
= finish_omp_structured_block (body
);
8385 stmt
= make_node (OMP_PARALLEL
);
8386 TREE_TYPE (stmt
) = void_type_node
;
8387 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
8388 OMP_PARALLEL_BODY (stmt
) = body
;
8390 return add_stmt (stmt
);
8394 begin_omp_task (void)
8396 keep_next_level (true);
8397 return begin_omp_structured_block ();
8401 finish_omp_task (tree clauses
, tree body
)
8405 body
= finish_omp_structured_block (body
);
8407 stmt
= make_node (OMP_TASK
);
8408 TREE_TYPE (stmt
) = void_type_node
;
8409 OMP_TASK_CLAUSES (stmt
) = clauses
;
8410 OMP_TASK_BODY (stmt
) = body
;
8412 return add_stmt (stmt
);
8415 /* Helper function for finish_omp_for. Convert Ith random access iterator
8416 into integral iterator. Return FALSE if successful. */
8419 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
8420 tree declv
, tree orig_declv
, tree initv
,
8421 tree condv
, tree incrv
, tree
*body
,
8422 tree
*pre_body
, tree
&clauses
,
8423 int collapse
, int ordered
)
8425 tree diff
, iter_init
, iter_incr
= NULL
, last
;
8426 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
8427 tree decl
= TREE_VEC_ELT (declv
, i
);
8428 tree init
= TREE_VEC_ELT (initv
, i
);
8429 tree cond
= TREE_VEC_ELT (condv
, i
);
8430 tree incr
= TREE_VEC_ELT (incrv
, i
);
8432 location_t elocus
= locus
;
8434 if (init
&& EXPR_HAS_LOCATION (init
))
8435 elocus
= EXPR_LOCATION (init
);
8437 switch (TREE_CODE (cond
))
8444 if (TREE_OPERAND (cond
, 1) == iter
)
8445 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
8446 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
8447 if (TREE_OPERAND (cond
, 0) != iter
)
8448 cond
= error_mark_node
;
8451 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
8454 TREE_OPERAND (cond
, 1), ERROR_MARK
,
8455 NULL
, tf_warning_or_error
);
8456 if (error_operand_p (tem
))
8461 cond
= error_mark_node
;
8464 if (cond
== error_mark_node
)
8466 error_at (elocus
, "invalid controlling predicate");
8469 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
8470 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
8471 tf_warning_or_error
);
8472 diff
= cp_fully_fold (diff
);
8473 if (error_operand_p (diff
))
8475 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
8477 error_at (elocus
, "difference between %qE and %qD does not have integer type",
8478 TREE_OPERAND (cond
, 1), iter
);
8481 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
8482 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
8483 cond
, cp_walk_subtrees
))
8486 switch (TREE_CODE (incr
))
8488 case PREINCREMENT_EXPR
:
8489 case PREDECREMENT_EXPR
:
8490 case POSTINCREMENT_EXPR
:
8491 case POSTDECREMENT_EXPR
:
8492 if (TREE_OPERAND (incr
, 0) != iter
)
8494 incr
= error_mark_node
;
8497 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
8498 TREE_CODE (incr
), iter
,
8499 tf_warning_or_error
);
8500 if (error_operand_p (iter_incr
))
8502 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
8503 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
8504 incr
= integer_one_node
;
8506 incr
= integer_minus_one_node
;
8509 if (TREE_OPERAND (incr
, 0) != iter
)
8510 incr
= error_mark_node
;
8511 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
8512 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
8514 tree rhs
= TREE_OPERAND (incr
, 1);
8515 if (TREE_OPERAND (rhs
, 0) == iter
)
8517 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
8519 incr
= error_mark_node
;
8522 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
8523 iter
, TREE_CODE (rhs
),
8524 TREE_OPERAND (rhs
, 1),
8525 tf_warning_or_error
);
8526 if (error_operand_p (iter_incr
))
8528 incr
= TREE_OPERAND (rhs
, 1);
8529 incr
= cp_convert (TREE_TYPE (diff
), incr
,
8530 tf_warning_or_error
);
8531 if (TREE_CODE (rhs
) == MINUS_EXPR
)
8533 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
8534 incr
= fold_simple (incr
);
8536 if (TREE_CODE (incr
) != INTEGER_CST
8537 && (TREE_CODE (incr
) != NOP_EXPR
8538 || (TREE_CODE (TREE_OPERAND (incr
, 0))
8543 else if (TREE_OPERAND (rhs
, 1) == iter
)
8545 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
8546 || TREE_CODE (rhs
) != PLUS_EXPR
)
8547 incr
= error_mark_node
;
8550 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
8552 TREE_OPERAND (rhs
, 0),
8555 tf_warning_or_error
);
8556 if (error_operand_p (iter_incr
))
8558 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
8561 tf_warning_or_error
);
8562 if (error_operand_p (iter_incr
))
8564 incr
= TREE_OPERAND (rhs
, 0);
8569 incr
= error_mark_node
;
8572 incr
= error_mark_node
;
8575 incr
= error_mark_node
;
8579 if (incr
== error_mark_node
)
8581 error_at (elocus
, "invalid increment expression");
8585 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
8586 incr
= cp_fully_fold (incr
);
8587 tree loop_iv_seen
= NULL_TREE
;
8588 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
8589 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
8590 && OMP_CLAUSE_DECL (c
) == iter
)
8592 if (code
== OMP_TASKLOOP
|| code
== OMP_LOOP
)
8595 OMP_CLAUSE_LASTPRIVATE_LOOP_IV (c
) = 1;
8599 else if ((code
== OMP_TASKLOOP
|| code
== OMP_LOOP
)
8600 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
8601 && OMP_CLAUSE_DECL (c
) == iter
)
8604 if (code
== OMP_TASKLOOP
)
8605 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
8608 decl
= create_temporary_var (TREE_TYPE (diff
));
8610 add_decl_expr (decl
);
8611 last
= create_temporary_var (TREE_TYPE (diff
));
8613 add_decl_expr (last
);
8614 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
8615 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
8617 incr_var
= create_temporary_var (TREE_TYPE (diff
));
8618 pushdecl (incr_var
);
8619 add_decl_expr (incr_var
);
8621 gcc_assert (stmts_are_full_exprs_p ());
8622 tree diffvar
= NULL_TREE
;
8623 if (code
== OMP_TASKLOOP
)
8627 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8628 OMP_CLAUSE_DECL (ivc
) = iter
;
8629 cxx_omp_finish_clause (ivc
, NULL
);
8630 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
8633 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8634 OMP_CLAUSE_DECL (lvc
) = last
;
8635 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
8637 diffvar
= create_temporary_var (TREE_TYPE (diff
));
8639 add_decl_expr (diffvar
);
8641 else if (code
== OMP_LOOP
)
8645 /* While iterators on the loop construct are predetermined
8646 lastprivate, if the decl is not declared inside of the
8647 loop, OMP_CLAUSE_LASTPRIVATE should have been added
8649 loop_iv_seen
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8650 OMP_CLAUSE_DECL (loop_iv_seen
) = iter
;
8651 OMP_CLAUSE_CHAIN (loop_iv_seen
) = clauses
;
8652 clauses
= loop_iv_seen
;
8654 else if (OMP_CLAUSE_CODE (loop_iv_seen
) == OMP_CLAUSE_PRIVATE
)
8656 OMP_CLAUSE_PRIVATE_DEBUG (loop_iv_seen
) = 0;
8657 OMP_CLAUSE_PRIVATE_OUTER_REF (loop_iv_seen
) = 0;
8658 OMP_CLAUSE_CODE (loop_iv_seen
) = OMP_CLAUSE_FIRSTPRIVATE
;
8660 if (OMP_CLAUSE_CODE (loop_iv_seen
) == OMP_CLAUSE_FIRSTPRIVATE
)
8661 cxx_omp_finish_clause (loop_iv_seen
, NULL
);
8664 orig_pre_body
= *pre_body
;
8665 *pre_body
= push_stmt_list ();
8667 add_stmt (orig_pre_body
);
8669 finish_expr_stmt (build_x_modify_expr (elocus
,
8670 iter
, NOP_EXPR
, init
,
8671 tf_warning_or_error
));
8672 init
= build_int_cst (TREE_TYPE (diff
), 0);
8673 if (c
&& iter_incr
== NULL
8674 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
8678 finish_expr_stmt (build_x_modify_expr (elocus
,
8680 incr
, tf_warning_or_error
));
8683 iter_incr
= build_x_modify_expr (elocus
,
8684 iter
, PLUS_EXPR
, incr
,
8685 tf_warning_or_error
);
8687 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
8689 finish_expr_stmt (build_x_modify_expr (elocus
,
8690 last
, NOP_EXPR
, init
,
8691 tf_warning_or_error
));
8694 finish_expr_stmt (build_x_modify_expr (elocus
,
8696 diff
, tf_warning_or_error
));
8699 *pre_body
= pop_stmt_list (*pre_body
);
8701 cond
= cp_build_binary_op (elocus
,
8702 TREE_CODE (cond
), decl
, diff
,
8703 tf_warning_or_error
);
8704 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
8705 elocus
, incr
, NULL_TREE
);
8708 *body
= push_stmt_list ();
8709 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
8710 iter_init
= build_x_modify_expr (elocus
,
8711 iter
, PLUS_EXPR
, iter_init
,
8712 tf_warning_or_error
);
8713 if (iter_init
!= error_mark_node
)
8714 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
8715 finish_expr_stmt (iter_init
);
8716 finish_expr_stmt (build_x_modify_expr (elocus
,
8717 last
, NOP_EXPR
, decl
,
8718 tf_warning_or_error
));
8719 add_stmt (orig_body
);
8720 *body
= pop_stmt_list (*body
);
8724 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
8726 finish_expr_stmt (iter_incr
);
8730 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
8731 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
8732 iter_init
, iter_incr
);
8733 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
8734 iter_init
= build_x_modify_expr (elocus
,
8735 iter
, PLUS_EXPR
, iter_init
,
8736 tf_warning_or_error
);
8737 if (iter_init
!= error_mark_node
)
8738 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
8739 finish_expr_stmt (iter_init
);
8741 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
8742 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
8745 if (TREE_CODE (TREE_VEC_ELT (orig_declv
, i
)) == TREE_LIST
)
8747 tree t
= TREE_VEC_ELT (orig_declv
, i
);
8748 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8749 && TREE_VALUE (t
) == NULL_TREE
8750 && TREE_CODE (TREE_CHAIN (t
)) == TREE_VEC
);
8751 TREE_PURPOSE (t
) = TREE_VEC_ELT (declv
, i
);
8752 TREE_VALUE (t
) = last
;
8755 TREE_VEC_ELT (orig_declv
, i
)
8756 = tree_cons (TREE_VEC_ELT (declv
, i
), last
, NULL_TREE
);
8757 TREE_VEC_ELT (declv
, i
) = decl
;
8758 TREE_VEC_ELT (initv
, i
) = init
;
8759 TREE_VEC_ELT (condv
, i
) = cond
;
8760 TREE_VEC_ELT (incrv
, i
) = incr
;
8765 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
8766 are directly for their associated operands in the statement. DECL
8767 and INIT are a combo; if DECL is NULL then INIT ought to be a
8768 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
8769 optional statements that need to go before the loop into its
8773 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
8774 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
8775 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
8777 tree omp_for
= NULL
, orig_incr
= NULL
;
8778 tree decl
= NULL
, init
, cond
, incr
;
8784 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8785 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8786 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8787 if (TREE_VEC_LENGTH (declv
) > 1)
8791 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8793 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8796 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8798 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8799 if (collapse
!= TREE_VEC_LENGTH (declv
))
8800 ordered
= TREE_VEC_LENGTH (declv
);
8803 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8805 decl
= TREE_VEC_ELT (declv
, i
);
8806 init
= TREE_VEC_ELT (initv
, i
);
8807 cond
= TREE_VEC_ELT (condv
, i
);
8808 incr
= TREE_VEC_ELT (incrv
, i
);
8814 switch (TREE_CODE (init
))
8817 decl
= TREE_OPERAND (init
, 0);
8818 init
= TREE_OPERAND (init
, 1);
8821 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8823 decl
= TREE_OPERAND (init
, 0);
8824 init
= TREE_OPERAND (init
, 2);
8834 "expected iteration declaration or initialization");
8839 if (init
&& EXPR_HAS_LOCATION (init
))
8840 elocus
= EXPR_LOCATION (init
);
8842 if (cond
== global_namespace
)
8847 error_at (elocus
, "missing controlling predicate");
8853 error_at (elocus
, "missing increment expression");
8857 TREE_VEC_ELT (declv
, i
) = decl
;
8858 TREE_VEC_ELT (initv
, i
) = init
;
8865 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8867 && !c_omp_check_loop_iv_exprs (locus
, orig_declv
8868 ? orig_declv
: declv
,
8869 TREE_VEC_ELT (declv
, i
), orig_init
,
8870 NULL_TREE
, cp_walk_subtrees
))
8876 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8880 stmt
= make_node (code
);
8882 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8884 /* This is really just a place-holder. We'll be decomposing this
8885 again and going through the cp_build_modify_expr path below when
8886 we instantiate the thing. */
8887 TREE_VEC_ELT (initv
, i
)
8888 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8889 TREE_VEC_ELT (initv
, i
));
8892 TREE_TYPE (stmt
) = void_type_node
;
8893 OMP_FOR_INIT (stmt
) = initv
;
8894 OMP_FOR_COND (stmt
) = condv
;
8895 OMP_FOR_INCR (stmt
) = incrv
;
8896 OMP_FOR_BODY (stmt
) = body
;
8897 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8898 OMP_FOR_CLAUSES (stmt
) = clauses
;
8900 SET_EXPR_LOCATION (stmt
, locus
);
8901 return add_stmt (stmt
);
8905 orig_declv
= copy_node (declv
);
8907 if (processing_template_decl
)
8908 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8910 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8912 decl
= TREE_VEC_ELT (declv
, i
);
8913 init
= TREE_VEC_ELT (initv
, i
);
8914 cond
= TREE_VEC_ELT (condv
, i
);
8915 incr
= TREE_VEC_ELT (incrv
, i
);
8917 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8920 if (init
&& EXPR_HAS_LOCATION (init
))
8921 elocus
= EXPR_LOCATION (init
);
8925 error_at (elocus
, "expected iteration declaration or initialization");
8929 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8932 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8933 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8934 TREE_CODE (TREE_OPERAND (incr
, 1)),
8935 TREE_OPERAND (incr
, 2),
8936 tf_warning_or_error
);
8939 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8941 if (code
== OMP_SIMD
)
8943 error_at (elocus
, "%<#pragma omp simd%> used with class "
8944 "iteration variable %qE", decl
);
8947 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8948 initv
, condv
, incrv
, &body
,
8955 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8956 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8958 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8962 if (!processing_template_decl
)
8964 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8965 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8966 tf_warning_or_error
);
8969 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8971 && TREE_SIDE_EFFECTS (cond
)
8972 && COMPARISON_CLASS_P (cond
)
8973 && !processing_template_decl
)
8975 tree t
= TREE_OPERAND (cond
, 0);
8976 if (TREE_SIDE_EFFECTS (t
)
8978 && (TREE_CODE (t
) != NOP_EXPR
8979 || TREE_OPERAND (t
, 0) != decl
))
8980 TREE_OPERAND (cond
, 0)
8981 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8983 t
= TREE_OPERAND (cond
, 1);
8984 if (TREE_SIDE_EFFECTS (t
)
8986 && (TREE_CODE (t
) != NOP_EXPR
8987 || TREE_OPERAND (t
, 0) != decl
))
8988 TREE_OPERAND (cond
, 1)
8989 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8991 if (decl
== error_mark_node
|| init
== error_mark_node
)
8994 TREE_VEC_ELT (declv
, i
) = decl
;
8995 TREE_VEC_ELT (initv
, i
) = init
;
8996 TREE_VEC_ELT (condv
, i
) = cond
;
8997 TREE_VEC_ELT (incrv
, i
) = incr
;
9001 if (pre_body
&& IS_EMPTY_STMT (pre_body
))
9004 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
9005 incrv
, body
, pre_body
,
9006 !processing_template_decl
);
9008 /* Check for iterators appearing in lb, b or incr expressions. */
9009 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
9010 omp_for
= NULL_TREE
;
9012 if (omp_for
== NULL
)
9017 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
9019 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
9020 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
9022 if (TREE_CODE (incr
) != MODIFY_EXPR
)
9025 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
9026 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
9027 && !processing_template_decl
)
9029 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
9030 if (TREE_SIDE_EFFECTS (t
)
9032 && (TREE_CODE (t
) != NOP_EXPR
9033 || TREE_OPERAND (t
, 0) != decl
))
9034 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
9035 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
9037 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
9038 if (TREE_SIDE_EFFECTS (t
)
9040 && (TREE_CODE (t
) != NOP_EXPR
9041 || TREE_OPERAND (t
, 0) != decl
))
9042 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
9043 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
9047 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
9049 OMP_FOR_CLAUSES (omp_for
) = clauses
;
9051 /* For simd loops with non-static data member iterators, we could have added
9052 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
9053 step at this point, fill it in. */
9054 if (code
== OMP_SIMD
&& !processing_template_decl
9055 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
9056 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
9057 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
9058 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
9060 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
9061 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
9062 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
9064 switch (TREE_CODE (incr
))
9066 case PREINCREMENT_EXPR
:
9067 case POSTINCREMENT_EXPR
:
9068 /* c_omp_for_incr_canonicalize_ptr() should have been
9069 called to massage things appropriately. */
9070 gcc_assert (!INDIRECT_TYPE_P (TREE_TYPE (decl
)));
9071 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
9073 case PREDECREMENT_EXPR
:
9074 case POSTDECREMENT_EXPR
:
9075 /* c_omp_for_incr_canonicalize_ptr() should have been
9076 called to massage things appropriately. */
9077 gcc_assert (!INDIRECT_TYPE_P (TREE_TYPE (decl
)));
9078 OMP_CLAUSE_LINEAR_STEP (c
)
9079 = build_int_cst (TREE_TYPE (decl
), -1);
9082 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
9083 incr
= TREE_OPERAND (incr
, 1);
9084 switch (TREE_CODE (incr
))
9087 if (TREE_OPERAND (incr
, 1) == decl
)
9088 step
= TREE_OPERAND (incr
, 0);
9090 step
= TREE_OPERAND (incr
, 1);
9093 case POINTER_PLUS_EXPR
:
9094 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
9095 step
= TREE_OPERAND (incr
, 1);
9100 stept
= TREE_TYPE (decl
);
9101 if (INDIRECT_TYPE_P (stept
))
9103 step
= fold_convert (stept
, step
);
9104 if (TREE_CODE (incr
) == MINUS_EXPR
)
9105 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
9106 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
9112 /* Override saved methods on OMP_LOOP's OMP_CLAUSE_LASTPRIVATE_LOOP_IV
9113 clauses, we need copy ctor for those rather than default ctor,
9114 plus as for other lastprivates assignment op and dtor. */
9115 if (code
== OMP_LOOP
&& !processing_template_decl
)
9116 for (tree c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
9117 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
9118 && OMP_CLAUSE_LASTPRIVATE_LOOP_IV (c
)
9119 && cxx_omp_create_clause_info (c
, TREE_TYPE (OMP_CLAUSE_DECL (c
)),
9120 false, true, true, true))
9121 CP_OMP_CLAUSE_INFO (c
) = NULL_TREE
;
9126 /* Fix up range for decls. Those decls were pushed into BIND's BIND_EXPR_VARS
9127 and need to be moved into the BIND_EXPR inside of the OMP_FOR's body. */
9130 finish_omp_for_block (tree bind
, tree omp_for
)
9132 if (omp_for
== NULL_TREE
9133 || !OMP_FOR_ORIG_DECLS (omp_for
)
9134 || bind
== NULL_TREE
9135 || TREE_CODE (bind
) != BIND_EXPR
)
9138 for (int i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (omp_for
)); i
++)
9139 if (TREE_CODE (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
)) == TREE_LIST
9140 && TREE_CHAIN (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
)))
9142 tree v
= TREE_CHAIN (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
));
9143 gcc_assert (BIND_EXPR_BLOCK (bind
)
9144 && (BIND_EXPR_VARS (bind
)
9145 == BLOCK_VARS (BIND_EXPR_BLOCK (bind
))));
9146 for (int j
= 2; j
< TREE_VEC_LENGTH (v
); j
++)
9147 for (tree
*p
= &BIND_EXPR_VARS (bind
); *p
; p
= &DECL_CHAIN (*p
))
9149 if (*p
== TREE_VEC_ELT (v
, j
))
9152 *p
= DECL_CHAIN (*p
);
9155 b
= make_node (BLOCK
);
9156 b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
9157 OMP_FOR_BODY (omp_for
), b
);
9158 TREE_SIDE_EFFECTS (b
) = 1;
9159 OMP_FOR_BODY (omp_for
) = b
;
9161 DECL_CHAIN (var
) = BIND_EXPR_VARS (b
);
9162 BIND_EXPR_VARS (b
) = var
;
9163 BLOCK_VARS (BIND_EXPR_BLOCK (b
)) = var
;
9166 BLOCK_VARS (BIND_EXPR_BLOCK (bind
)) = BIND_EXPR_VARS (bind
);
9172 finish_omp_atomic (location_t loc
, enum tree_code code
, enum tree_code opcode
,
9173 tree lhs
, tree rhs
, tree v
, tree lhs1
, tree rhs1
,
9174 tree clauses
, enum omp_memory_order mo
)
9189 dependent_p
= false;
9192 /* Even in a template, we can detect invalid uses of the atomic
9193 pragma if neither LHS nor RHS is type-dependent. */
9194 if (processing_template_decl
)
9196 dependent_p
= (type_dependent_expression_p (lhs
)
9197 || (rhs
&& type_dependent_expression_p (rhs
))
9198 || (v
&& type_dependent_expression_p (v
))
9199 || (lhs1
&& type_dependent_expression_p (lhs1
))
9200 || (rhs1
&& type_dependent_expression_p (rhs1
)));
9203 gcc_assert (TREE_CODE (clauses
) == OMP_CLAUSE
9204 && OMP_CLAUSE_CODE (clauses
) == OMP_CLAUSE_HINT
9205 && OMP_CLAUSE_CHAIN (clauses
) == NULL_TREE
);
9206 if (type_dependent_expression_p (OMP_CLAUSE_HINT_EXPR (clauses
))
9207 || TREE_CODE (OMP_CLAUSE_HINT_EXPR (clauses
)) != INTEGER_CST
)
9212 lhs
= build_non_dependent_expr (lhs
);
9214 rhs
= build_non_dependent_expr (rhs
);
9216 v
= build_non_dependent_expr (v
);
9218 lhs1
= build_non_dependent_expr (lhs1
);
9220 rhs1
= build_non_dependent_expr (rhs1
);
9225 bool swapped
= false;
9226 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
9228 std::swap (rhs
, rhs1
);
9229 swapped
= !commutative_tree_code (opcode
);
9231 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
9233 if (code
== OMP_ATOMIC
)
9234 error ("%<#pragma omp atomic update%> uses two different "
9235 "expressions for memory");
9237 error ("%<#pragma omp atomic capture%> uses two different "
9238 "expressions for memory");
9241 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
9243 if (code
== OMP_ATOMIC
)
9244 error ("%<#pragma omp atomic update%> uses two different "
9245 "expressions for memory");
9247 error ("%<#pragma omp atomic capture%> uses two different "
9248 "expressions for memory");
9251 stmt
= c_finish_omp_atomic (loc
, code
, opcode
, lhs
, rhs
,
9252 v
, lhs1
, rhs1
, swapped
, mo
,
9253 processing_template_decl
!= 0);
9254 if (stmt
== error_mark_node
)
9257 if (processing_template_decl
)
9259 if (code
== OMP_ATOMIC_READ
)
9261 stmt
= build_min_nt_loc (loc
, OMP_ATOMIC_READ
, orig_lhs
);
9262 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
9263 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
9267 if (opcode
== NOP_EXPR
)
9268 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
9270 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
9272 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
9273 COMPOUND_EXPR
, orig_rhs1
, stmt
);
9274 if (code
!= OMP_ATOMIC
)
9276 stmt
= build_min_nt_loc (loc
, code
, orig_lhs1
, stmt
);
9277 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
9278 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
9281 stmt
= build2 (OMP_ATOMIC
, void_type_node
,
9282 clauses
? clauses
: integer_zero_node
, stmt
);
9283 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
9284 SET_EXPR_LOCATION (stmt
, loc
);
9287 /* Avoid -Wunused-value warnings here, the whole construct has side-effects
9288 and even if it might be wrapped from fold-const.c or c-omp.c wrapped
9289 in some tree that appears to be unused, the value is not unused. */
9290 warning_sentinel
w (warn_unused_value
);
9291 finish_expr_stmt (stmt
);
9295 finish_omp_barrier (void)
9297 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
9299 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9300 finish_expr_stmt (stmt
);
9304 finish_omp_depobj (location_t loc
, tree depobj
,
9305 enum omp_clause_depend_kind kind
, tree clause
)
9307 if (!error_operand_p (depobj
) && !type_dependent_expression_p (depobj
))
9309 if (!lvalue_p (depobj
))
9311 error_at (EXPR_LOC_OR_LOC (depobj
, loc
),
9312 "%<depobj%> expression is not lvalue expression");
9313 depobj
= error_mark_node
;
9317 if (processing_template_decl
)
9319 if (clause
== NULL_TREE
)
9320 clause
= build_int_cst (integer_type_node
, kind
);
9321 add_stmt (build_min_nt_loc (loc
, OMP_DEPOBJ
, depobj
, clause
));
9325 if (!error_operand_p (depobj
))
9327 tree addr
= cp_build_addr_expr (depobj
, tf_warning_or_error
);
9328 if (addr
== error_mark_node
)
9329 depobj
= error_mark_node
;
9331 depobj
= cp_build_indirect_ref (addr
, RO_UNARY_STAR
,
9332 tf_warning_or_error
);
9335 c_finish_omp_depobj (loc
, depobj
, kind
, clause
);
9339 finish_omp_flush (int mo
)
9341 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
9343 if (mo
!= MEMMODEL_LAST
)
9345 fn
= builtin_decl_explicit (BUILT_IN_ATOMIC_THREAD_FENCE
);
9346 vec
->quick_push (build_int_cst (integer_type_node
, mo
));
9348 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9349 finish_expr_stmt (stmt
);
9353 finish_omp_taskwait (void)
9355 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
9357 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9358 finish_expr_stmt (stmt
);
9362 finish_omp_taskyield (void)
9364 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
9366 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9367 finish_expr_stmt (stmt
);
9371 finish_omp_cancel (tree clauses
)
9373 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
9375 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
9377 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
9379 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
9381 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
9385 error ("%<#pragma omp cancel%> must specify one of "
9386 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
9390 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
9391 if (ifc
!= NULL_TREE
)
9393 if (OMP_CLAUSE_IF_MODIFIER (ifc
) != ERROR_MARK
9394 && OMP_CLAUSE_IF_MODIFIER (ifc
) != VOID_CST
)
9395 error_at (OMP_CLAUSE_LOCATION (ifc
),
9396 "expected %<cancel%> %<if%> clause modifier");
9399 tree ifc2
= omp_find_clause (OMP_CLAUSE_CHAIN (ifc
), OMP_CLAUSE_IF
);
9400 if (ifc2
!= NULL_TREE
)
9402 gcc_assert (OMP_CLAUSE_IF_MODIFIER (ifc
) == VOID_CST
9403 && OMP_CLAUSE_IF_MODIFIER (ifc2
) != ERROR_MARK
9404 && OMP_CLAUSE_IF_MODIFIER (ifc2
) != VOID_CST
);
9405 error_at (OMP_CLAUSE_LOCATION (ifc2
),
9406 "expected %<cancel%> %<if%> clause modifier");
9410 if (!processing_template_decl
)
9411 ifc
= maybe_convert_cond (OMP_CLAUSE_IF_EXPR (ifc
));
9413 ifc
= build_x_binary_op (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
9414 OMP_CLAUSE_IF_EXPR (ifc
), ERROR_MARK
,
9415 integer_zero_node
, ERROR_MARK
,
9416 NULL
, tf_warning_or_error
);
9419 ifc
= boolean_true_node
;
9420 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
9421 vec
->quick_push (ifc
);
9422 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9423 finish_expr_stmt (stmt
);
9427 finish_omp_cancellation_point (tree clauses
)
9429 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
9431 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
9433 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
9435 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
9437 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
9441 error ("%<#pragma omp cancellation point%> must specify one of "
9442 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
9446 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
9447 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9448 finish_expr_stmt (stmt
);
9451 /* Begin a __transaction_atomic or __transaction_relaxed statement.
9452 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
9453 should create an extra compound stmt. */
9456 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
9461 *pcompound
= begin_compound_stmt (0);
9463 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
9465 /* Only add the statement to the function if support enabled. */
9469 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
9470 ? G_("%<__transaction_relaxed%> without "
9471 "transactional memory support enabled")
9472 : G_("%<__transaction_atomic%> without "
9473 "transactional memory support enabled")));
9475 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
9476 TREE_SIDE_EFFECTS (r
) = 1;
9480 /* End a __transaction_atomic or __transaction_relaxed statement.
9481 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
9482 and we should end the compound. If NOEX is non-NULL, we wrap the body in
9483 a MUST_NOT_THROW_EXPR with NOEX as condition. */
9486 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
9488 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
9489 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
9490 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
9491 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
9493 /* noexcept specifications are not allowed for function transactions. */
9494 gcc_assert (!(noex
&& compound_stmt
));
9497 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
9499 protected_set_expr_location
9500 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
9501 TREE_SIDE_EFFECTS (body
) = 1;
9502 TRANSACTION_EXPR_BODY (stmt
) = body
;
9506 finish_compound_stmt (compound_stmt
);
9509 /* Build a __transaction_atomic or __transaction_relaxed expression. If
9510 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
9514 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
9519 expr
= build_must_not_throw_expr (expr
, noex
);
9520 protected_set_expr_location (expr
, loc
);
9521 TREE_SIDE_EFFECTS (expr
) = 1;
9523 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
9524 if (flags
& TM_STMT_ATTR_RELAXED
)
9525 TRANSACTION_EXPR_RELAXED (ret
) = 1;
9526 TREE_SIDE_EFFECTS (ret
) = 1;
9527 SET_EXPR_LOCATION (ret
, loc
);
9532 init_cp_semantics (void)
9536 /* Build a STATIC_ASSERT for a static assertion with the condition
9537 CONDITION and the message text MESSAGE. LOCATION is the location
9538 of the static assertion in the source code. When MEMBER_P, this
9539 static assertion is a member of a class. */
9541 finish_static_assert (tree condition
, tree message
, location_t location
,
9544 tsubst_flags_t complain
= tf_warning_or_error
;
9546 if (message
== NULL_TREE
9547 || message
== error_mark_node
9548 || condition
== NULL_TREE
9549 || condition
== error_mark_node
)
9552 if (check_for_bare_parameter_packs (condition
))
9553 condition
= error_mark_node
;
9555 if (instantiation_dependent_expression_p (condition
))
9557 /* We're in a template; build a STATIC_ASSERT and put it in
9561 assertion
= make_node (STATIC_ASSERT
);
9562 STATIC_ASSERT_CONDITION (assertion
) = condition
;
9563 STATIC_ASSERT_MESSAGE (assertion
) = message
;
9564 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
9567 maybe_add_class_template_decl_list (current_class_type
,
9571 add_stmt (assertion
);
9576 /* Fold the expression and convert it to a boolean value. */
9577 condition
= perform_implicit_conversion_flags (boolean_type_node
, condition
,
9578 complain
, LOOKUP_NORMAL
);
9579 condition
= fold_non_dependent_expr (condition
, complain
,
9580 /*manifestly_const_eval=*/true);
9582 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
9583 /* Do nothing; the condition is satisfied. */
9587 location_t saved_loc
= input_location
;
9589 input_location
= location
;
9590 if (TREE_CODE (condition
) == INTEGER_CST
9591 && integer_zerop (condition
))
9593 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
9594 (TREE_TYPE (TREE_TYPE (message
))));
9595 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
9596 /* Report the error. */
9598 error ("static assertion failed");
9600 error ("static assertion failed: %s",
9601 TREE_STRING_POINTER (message
));
9603 else if (condition
&& condition
!= error_mark_node
)
9605 error ("non-constant condition for static assertion");
9606 if (require_rvalue_constant_expression (condition
))
9607 cxx_constant_value (condition
);
9609 input_location
= saved_loc
;
9613 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
9614 suitable for use as a type-specifier.
9616 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
9617 id-expression or a class member access, FALSE when it was parsed as
9618 a full expression. */
9621 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
9622 tsubst_flags_t complain
)
9624 tree type
= NULL_TREE
;
9626 if (!expr
|| error_operand_p (expr
))
9627 return error_mark_node
;
9630 || TREE_CODE (expr
) == TYPE_DECL
9631 || (TREE_CODE (expr
) == BIT_NOT_EXPR
9632 && TYPE_P (TREE_OPERAND (expr
, 0))))
9634 if (complain
& tf_error
)
9635 error ("argument to %<decltype%> must be an expression");
9636 return error_mark_node
;
9639 /* Depending on the resolution of DR 1172, we may later need to distinguish
9640 instantiation-dependent but not type-dependent expressions so that, say,
9641 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
9642 if (instantiation_dependent_uneval_expression_p (expr
))
9644 type
= cxx_make_type (DECLTYPE_TYPE
);
9645 DECLTYPE_TYPE_EXPR (type
) = expr
;
9646 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
9647 = id_expression_or_member_access_p
;
9648 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9653 /* The type denoted by decltype(e) is defined as follows: */
9655 expr
= resolve_nondeduced_context (expr
, complain
);
9657 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
9658 return error_mark_node
;
9660 if (type_unknown_p (expr
))
9662 if (complain
& tf_error
)
9663 error ("%<decltype%> cannot resolve address of overloaded function");
9664 return error_mark_node
;
9667 /* To get the size of a static data member declared as an array of
9668 unknown bound, we need to instantiate it. */
9670 && VAR_HAD_UNKNOWN_BOUND (expr
)
9671 && DECL_TEMPLATE_INSTANTIATION (expr
))
9672 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
9674 if (id_expression_or_member_access_p
)
9676 /* If e is an id-expression or a class member access (5.2.5
9677 [expr.ref]), decltype(e) is defined as the type of the entity
9678 named by e. If there is no such entity, or e names a set of
9679 overloaded functions, the program is ill-formed. */
9680 if (identifier_p (expr
))
9681 expr
= lookup_name (expr
);
9683 if (INDIRECT_REF_P (expr
)
9684 || TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
9685 /* This can happen when the expression is, e.g., "a.b". Just
9686 look at the underlying operand. */
9687 expr
= TREE_OPERAND (expr
, 0);
9689 if (TREE_CODE (expr
) == OFFSET_REF
9690 || TREE_CODE (expr
) == MEMBER_REF
9691 || TREE_CODE (expr
) == SCOPE_REF
)
9692 /* We're only interested in the field itself. If it is a
9693 BASELINK, we will need to see through it in the next
9695 expr
= TREE_OPERAND (expr
, 1);
9697 if (BASELINK_P (expr
))
9698 /* See through BASELINK nodes to the underlying function. */
9699 expr
= BASELINK_FUNCTIONS (expr
);
9701 /* decltype of a decomposition name drops references in the tuple case
9702 (unlike decltype of a normal variable) and keeps cv-qualifiers from
9703 the containing object in the other cases (unlike decltype of a member
9704 access expression). */
9705 if (DECL_DECOMPOSITION_P (expr
))
9707 if (DECL_HAS_VALUE_EXPR_P (expr
))
9708 /* Expr is an array or struct subobject proxy, handle
9709 bit-fields properly. */
9710 return unlowered_expr_type (expr
);
9712 /* Expr is a reference variable for the tuple case. */
9713 return lookup_decomp_type (expr
);
9716 switch (TREE_CODE (expr
))
9719 if (DECL_BIT_FIELD_TYPE (expr
))
9721 type
= DECL_BIT_FIELD_TYPE (expr
);
9724 /* Fall through for fields that aren't bitfields. */
9732 case TEMPLATE_PARM_INDEX
:
9733 expr
= mark_type_use (expr
);
9734 type
= TREE_TYPE (expr
);
9738 type
= error_mark_node
;
9743 mark_type_use (expr
);
9744 type
= is_bitfield_expr_with_lowered_type (expr
);
9746 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
9754 /* We can get here when the id-expression refers to an
9755 enumerator or non-type template parameter. */
9756 type
= TREE_TYPE (expr
);
9760 /* Handle instantiated template non-type arguments. */
9761 type
= TREE_TYPE (expr
);
9767 /* Within a lambda-expression:
9769 Every occurrence of decltype((x)) where x is a possibly
9770 parenthesized id-expression that names an entity of
9771 automatic storage duration is treated as if x were
9772 transformed into an access to a corresponding data member
9773 of the closure type that would have been declared if x
9774 were a use of the denoted entity. */
9775 if (outer_automatic_var_p (expr
)
9776 && current_function_decl
9777 && LAMBDA_FUNCTION_P (current_function_decl
))
9778 type
= capture_decltype (expr
);
9779 else if (error_operand_p (expr
))
9780 type
= error_mark_node
;
9781 else if (expr
== current_class_ptr
)
9782 /* If the expression is just "this", we want the
9783 cv-unqualified pointer for the "this" type. */
9784 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
9787 /* Otherwise, where T is the type of e, if e is an lvalue,
9788 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
9789 cp_lvalue_kind clk
= lvalue_kind (expr
);
9790 type
= unlowered_expr_type (expr
);
9791 gcc_assert (!TYPE_REF_P (type
));
9793 /* For vector types, pick a non-opaque variant. */
9794 if (VECTOR_TYPE_P (type
))
9795 type
= strip_typedefs (type
);
9797 if (clk
!= clk_none
&& !(clk
& clk_class
))
9798 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
9805 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
9806 __has_nothrow_copy, depending on assign_p. Returns true iff all
9807 the copy {ctor,assign} fns are nothrow. */
9810 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
9812 tree fns
= NULL_TREE
;
9814 if (assign_p
|| TYPE_HAS_COPY_CTOR (type
))
9815 fns
= get_class_binding (type
, assign_p
? assign_op_identifier
9818 bool saw_copy
= false;
9819 for (ovl_iterator
iter (fns
); iter
; ++iter
)
9823 if (copy_fn_p (fn
) > 0)
9826 if (!maybe_instantiate_noexcept (fn
)
9827 || !TYPE_NOTHROW_P (TREE_TYPE (fn
)))
9835 /* Actually evaluates the trait. */
9838 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
9840 enum tree_code type_code1
;
9843 type_code1
= TREE_CODE (type1
);
9847 case CPTK_HAS_NOTHROW_ASSIGN
:
9848 type1
= strip_array_types (type1
);
9849 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9850 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
9851 || (CLASS_TYPE_P (type1
)
9852 && classtype_has_nothrow_assign_or_copy_p (type1
,
9855 case CPTK_HAS_TRIVIAL_ASSIGN
:
9856 /* ??? The standard seems to be missing the "or array of such a class
9857 type" wording for this trait. */
9858 type1
= strip_array_types (type1
);
9859 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9860 && (trivial_type_p (type1
)
9861 || (CLASS_TYPE_P (type1
)
9862 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
9864 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9865 type1
= strip_array_types (type1
);
9866 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
9867 || (CLASS_TYPE_P (type1
)
9868 && (t
= locate_ctor (type1
))
9869 && maybe_instantiate_noexcept (t
)
9870 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
9872 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9873 type1
= strip_array_types (type1
);
9874 return (trivial_type_p (type1
)
9875 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
9877 case CPTK_HAS_NOTHROW_COPY
:
9878 type1
= strip_array_types (type1
);
9879 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
9880 || (CLASS_TYPE_P (type1
)
9881 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
9883 case CPTK_HAS_TRIVIAL_COPY
:
9884 /* ??? The standard seems to be missing the "or array of such a class
9885 type" wording for this trait. */
9886 type1
= strip_array_types (type1
);
9887 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9888 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
9890 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9891 type1
= strip_array_types (type1
);
9892 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9893 || (CLASS_TYPE_P (type1
)
9894 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
9896 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9897 return type_has_virtual_destructor (type1
);
9899 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9900 return type_has_unique_obj_representations (type1
);
9902 case CPTK_IS_ABSTRACT
:
9903 return ABSTRACT_CLASS_TYPE_P (type1
);
9905 case CPTK_IS_AGGREGATE
:
9906 return CP_AGGREGATE_TYPE_P (type1
);
9908 case CPTK_IS_BASE_OF
:
9909 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9910 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9911 || DERIVED_FROM_P (type1
, type2
)));
9914 return NON_UNION_CLASS_TYPE_P (type1
);
9917 return NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
);
9920 return type_code1
== ENUMERAL_TYPE
;
9923 return CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
);
9925 case CPTK_IS_LITERAL_TYPE
:
9926 return literal_type_p (type1
);
9929 return pod_type_p (type1
);
9931 case CPTK_IS_POLYMORPHIC
:
9932 return CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
);
9934 case CPTK_IS_SAME_AS
:
9935 return same_type_p (type1
, type2
);
9937 case CPTK_IS_STD_LAYOUT
:
9938 return std_layout_type_p (type1
);
9940 case CPTK_IS_TRIVIAL
:
9941 return trivial_type_p (type1
);
9943 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9944 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9946 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9947 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9949 case CPTK_IS_TRIVIALLY_COPYABLE
:
9950 return trivially_copyable_p (type1
);
9953 return type_code1
== UNION_TYPE
;
9955 case CPTK_IS_ASSIGNABLE
:
9956 return is_xible (MODIFY_EXPR
, type1
, type2
);
9958 case CPTK_IS_CONSTRUCTIBLE
:
9959 return is_xible (INIT_EXPR
, type1
, type2
);
9967 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9968 void, or a complete type, returns true, otherwise false. */
9971 check_trait_type (tree type
)
9973 if (type
== NULL_TREE
)
9976 if (TREE_CODE (type
) == TREE_LIST
)
9977 return (check_trait_type (TREE_VALUE (type
))
9978 && check_trait_type (TREE_CHAIN (type
)));
9980 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9981 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9984 if (VOID_TYPE_P (type
))
9987 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9990 /* Process a trait expression. */
9993 finish_trait_expr (location_t loc
, cp_trait_kind kind
, tree type1
, tree type2
)
9995 if (type1
== error_mark_node
9996 || type2
== error_mark_node
)
9997 return error_mark_node
;
9999 if (processing_template_decl
)
10001 tree trait_expr
= make_node (TRAIT_EXPR
);
10002 TREE_TYPE (trait_expr
) = boolean_type_node
;
10003 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
10004 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
10005 TRAIT_EXPR_KIND (trait_expr
) = kind
;
10006 TRAIT_EXPR_LOCATION (trait_expr
) = loc
;
10012 case CPTK_HAS_NOTHROW_ASSIGN
:
10013 case CPTK_HAS_TRIVIAL_ASSIGN
:
10014 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
10015 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
10016 case CPTK_HAS_NOTHROW_COPY
:
10017 case CPTK_HAS_TRIVIAL_COPY
:
10018 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
10019 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
10020 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
10021 case CPTK_IS_ABSTRACT
:
10022 case CPTK_IS_AGGREGATE
:
10023 case CPTK_IS_EMPTY
:
10024 case CPTK_IS_FINAL
:
10025 case CPTK_IS_LITERAL_TYPE
:
10027 case CPTK_IS_POLYMORPHIC
:
10028 case CPTK_IS_STD_LAYOUT
:
10029 case CPTK_IS_TRIVIAL
:
10030 case CPTK_IS_TRIVIALLY_COPYABLE
:
10031 if (!check_trait_type (type1
))
10032 return error_mark_node
;
10035 case CPTK_IS_ASSIGNABLE
:
10036 case CPTK_IS_CONSTRUCTIBLE
:
10039 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
10040 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
10041 if (!check_trait_type (type1
)
10042 || !check_trait_type (type2
))
10043 return error_mark_node
;
10046 case CPTK_IS_BASE_OF
:
10047 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
10048 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
10049 && !complete_type_or_else (type2
, NULL_TREE
))
10050 /* We already issued an error. */
10051 return error_mark_node
;
10054 case CPTK_IS_CLASS
:
10056 case CPTK_IS_UNION
:
10057 case CPTK_IS_SAME_AS
:
10061 gcc_unreachable ();
10064 tree val
= (trait_expr_value (kind
, type1
, type2
)
10065 ? boolean_true_node
: boolean_false_node
);
10066 return maybe_wrap_with_location (val
, loc
);
10069 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
10070 which is ignored for C++. */
10073 set_float_const_decimal64 (void)
10078 clear_float_const_decimal64 (void)
10083 float_const_decimal64_p (void)
10089 /* Return true if T designates the implied `this' parameter. */
10092 is_this_parameter (tree t
)
10094 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
10096 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
10097 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
10101 /* Insert the deduced return type for an auto function. */
10104 apply_deduced_return_type (tree fco
, tree return_type
)
10108 if (return_type
== error_mark_node
)
10111 if (DECL_CONV_FN_P (fco
))
10112 DECL_NAME (fco
) = make_conv_op_name (return_type
);
10114 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
10116 result
= DECL_RESULT (fco
);
10117 if (result
== NULL_TREE
)
10119 if (TREE_TYPE (result
) == return_type
)
10122 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
10123 && !complete_type_or_else (return_type
, NULL_TREE
))
10126 /* We already have a DECL_RESULT from start_preparsed_function.
10127 Now we need to redo the work it and allocate_struct_function
10128 did to reflect the new type. */
10129 gcc_assert (current_function_decl
== fco
);
10130 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
10131 TYPE_MAIN_VARIANT (return_type
));
10132 DECL_ARTIFICIAL (result
) = 1;
10133 DECL_IGNORED_P (result
) = 1;
10134 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
10137 DECL_RESULT (fco
) = result
;
10139 if (!processing_template_decl
)
10141 bool aggr
= aggregate_value_p (result
, fco
);
10142 #ifdef PCC_STATIC_STRUCT_RETURN
10143 cfun
->returns_pcc_struct
= aggr
;
10145 cfun
->returns_struct
= aggr
;
10149 /* DECL is a local variable or parameter from the surrounding scope of a
10150 lambda-expression. Returns the decltype for a use of the capture field
10151 for DECL even if it hasn't been captured yet. */
10154 capture_decltype (tree decl
)
10156 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
10157 tree cap
= lookup_name_real (DECL_NAME (decl
), /*type*/0, /*nonclass*/1,
10158 /*block_p=*/true, /*ns*/0, LOOKUP_HIDDEN
);
10161 if (cap
&& is_capture_proxy (cap
))
10162 type
= TREE_TYPE (cap
);
10164 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
10167 error ("%qD is not captured", decl
);
10168 return error_mark_node
;
10171 type
= TREE_TYPE (decl
);
10172 if (TYPE_REF_P (type
)
10173 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
10174 type
= TREE_TYPE (type
);
10177 case CPLD_REFERENCE
:
10178 type
= TREE_TYPE (decl
);
10179 if (!TYPE_REF_P (type
))
10180 type
= build_reference_type (TREE_TYPE (decl
));
10184 gcc_unreachable ();
10187 if (!TYPE_REF_P (type
))
10189 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
10190 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
10191 |TYPE_QUAL_CONST
));
10192 type
= build_reference_type (type
);
10197 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
10198 this is a right unary fold. Otherwise it is a left unary fold. */
10201 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
10203 /* Build a pack expansion (assuming expr has pack type). */
10204 if (!uses_parameter_packs (expr
))
10206 error_at (location_of (expr
), "operand of fold expression has no "
10207 "unexpanded parameter packs");
10208 return error_mark_node
;
10210 tree pack
= make_pack_expansion (expr
);
10212 /* Build the fold expression. */
10213 tree code
= build_int_cstu (integer_type_node
, abs (op
));
10214 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
10215 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
10220 finish_left_unary_fold_expr (tree expr
, int op
)
10222 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
10226 finish_right_unary_fold_expr (tree expr
, int op
)
10228 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
10231 /* Build a binary fold expression over EXPR1 and EXPR2. The
10232 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
10233 has an unexpanded parameter pack). */
10236 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
10238 pack
= make_pack_expansion (pack
);
10239 tree code
= build_int_cstu (integer_type_node
, abs (op
));
10240 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
10241 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
10246 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
10248 // Determine which expr has an unexpanded parameter pack and
10249 // set the pack and initial term.
10250 bool pack1
= uses_parameter_packs (expr1
);
10251 bool pack2
= uses_parameter_packs (expr2
);
10252 if (pack1
&& !pack2
)
10253 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
10254 else if (pack2
&& !pack1
)
10255 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
10259 error ("both arguments in binary fold have unexpanded parameter packs");
10261 error ("no unexpanded parameter packs in binary fold");
10263 return error_mark_node
;
10266 /* Finish __builtin_launder (arg). */
10269 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
10271 tree orig_arg
= arg
;
10272 if (!type_dependent_expression_p (arg
))
10273 arg
= decay_conversion (arg
, complain
);
10274 if (error_operand_p (arg
))
10275 return error_mark_node
;
10276 if (!type_dependent_expression_p (arg
)
10277 && !TYPE_PTR_P (TREE_TYPE (arg
)))
10279 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
10280 return error_mark_node
;
10282 if (processing_template_decl
)
10284 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
10285 TREE_TYPE (arg
), 1, arg
);
10288 /* Finish __builtin_convertvector (arg, type). */
10291 cp_build_vec_convert (tree arg
, location_t loc
, tree type
,
10292 tsubst_flags_t complain
)
10294 if (error_operand_p (type
))
10295 return error_mark_node
;
10296 if (error_operand_p (arg
))
10297 return error_mark_node
;
10299 tree ret
= NULL_TREE
;
10300 if (!type_dependent_expression_p (arg
) && !dependent_type_p (type
))
10301 ret
= c_build_vec_convert (cp_expr_loc_or_input_loc (arg
), arg
,
10302 loc
, type
, (complain
& tf_error
) != 0);
10304 if (!processing_template_decl
)
10307 return build_call_expr_internal_loc (loc
, IFN_VEC_CONVERT
, type
, 1, arg
);
10310 #include "gt-cp-semantics.h"