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 ();
3053 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
3054 Returns the parameter. */
3057 finish_template_type_parm (tree aggr
, tree identifier
)
3059 if (aggr
!= class_type_node
)
3061 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
3062 aggr
= class_type_node
;
3065 return build_tree_list (aggr
, identifier
);
3068 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
3069 Returns the parameter. */
3072 finish_template_template_parm (tree aggr
, tree identifier
)
3074 tree decl
= build_decl (input_location
,
3075 TYPE_DECL
, identifier
, NULL_TREE
);
3077 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
3078 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
3079 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
3080 DECL_ARTIFICIAL (decl
) = 1;
3082 /* Associate the constraints with the underlying declaration,
3083 not the template. */
3084 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
3085 tree constr
= build_constraints (reqs
, NULL_TREE
);
3086 set_constraints (decl
, constr
);
3088 end_template_decl ();
3090 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
3092 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
3093 /*is_primary=*/true, /*is_partial=*/false,
3096 return finish_template_type_parm (aggr
, tmpl
);
3099 /* ARGUMENT is the default-argument value for a template template
3100 parameter. If ARGUMENT is invalid, issue error messages and return
3101 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
3104 check_template_template_default_arg (tree argument
)
3106 if (TREE_CODE (argument
) != TEMPLATE_DECL
3107 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
3108 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
3110 if (TREE_CODE (argument
) == TYPE_DECL
)
3111 error ("invalid use of type %qT as a default value for a template "
3112 "template-parameter", TREE_TYPE (argument
));
3114 error ("invalid default argument for a template template parameter");
3115 return error_mark_node
;
3121 /* Begin a class definition, as indicated by T. */
3124 begin_class_definition (tree t
)
3126 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
3127 return error_mark_node
;
3129 if (processing_template_parmlist
&& !LAMBDA_TYPE_P (t
))
3131 error ("definition of %q#T inside template parameter list", t
);
3132 return error_mark_node
;
3135 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
3136 are passed the same as decimal scalar types. */
3137 if (TREE_CODE (t
) == RECORD_TYPE
3138 && !processing_template_decl
)
3140 tree ns
= TYPE_CONTEXT (t
);
3141 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
3142 && DECL_CONTEXT (ns
) == std_node
3144 && id_equal (DECL_NAME (ns
), "decimal"))
3146 const char *n
= TYPE_NAME_STRING (t
);
3147 if ((strcmp (n
, "decimal32") == 0)
3148 || (strcmp (n
, "decimal64") == 0)
3149 || (strcmp (n
, "decimal128") == 0))
3150 TYPE_TRANSPARENT_AGGR (t
) = 1;
3154 /* A non-implicit typename comes from code like:
3156 template <typename T> struct A {
3157 template <typename U> struct A<T>::B ...
3159 This is erroneous. */
3160 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
3162 error ("invalid definition of qualified type %qT", t
);
3163 t
= error_mark_node
;
3166 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
3168 t
= make_class_type (RECORD_TYPE
);
3169 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
3172 if (TYPE_BEING_DEFINED (t
))
3174 t
= make_class_type (TREE_CODE (t
));
3175 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
3177 maybe_process_partial_specialization (t
);
3179 TYPE_BEING_DEFINED (t
) = 1;
3180 class_binding_level
->defining_class_p
= 1;
3182 if (flag_pack_struct
)
3185 TYPE_PACKED (t
) = 1;
3186 /* Even though the type is being defined for the first time
3187 here, there might have been a forward declaration, so there
3188 might be cv-qualified variants of T. */
3189 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
3190 TYPE_PACKED (v
) = 1;
3192 /* Reset the interface data, at the earliest possible
3193 moment, as it might have been set via a class foo;
3195 if (! TYPE_UNNAMED_P (t
))
3197 struct c_fileinfo
*finfo
= \
3198 get_fileinfo (LOCATION_FILE (input_location
));
3199 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
3200 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
3201 (t
, finfo
->interface_unknown
);
3203 reset_specialization();
3205 /* Make a declaration for this class in its own scope. */
3206 build_self_reference ();
3211 /* Finish the member declaration given by DECL. */
3214 finish_member_declaration (tree decl
)
3216 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
3219 if (decl
== void_type_node
)
3220 /* The COMPONENT was a friend, not a member, and so there's
3221 nothing for us to do. */
3224 /* We should see only one DECL at a time. */
3225 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
3227 /* Don't add decls after definition. */
3228 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3229 /* We can add lambda types when late parsing default
3231 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3233 /* Set up access control for DECL. */
3235 = (current_access_specifier
== access_private_node
);
3236 TREE_PROTECTED (decl
)
3237 = (current_access_specifier
== access_protected_node
);
3238 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3240 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
3241 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
3244 /* Mark the DECL as a member of the current class, unless it's
3245 a member of an enumeration. */
3246 if (TREE_CODE (decl
) != CONST_DECL
)
3247 DECL_CONTEXT (decl
) = current_class_type
;
3249 if (TREE_CODE (decl
) == USING_DECL
)
3250 /* For now, ignore class-scope USING_DECLS, so that debugging
3251 backends do not see them. */
3252 DECL_IGNORED_P (decl
) = 1;
3254 /* Check for bare parameter packs in the non-static data member
3256 if (TREE_CODE (decl
) == FIELD_DECL
)
3258 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3259 TREE_TYPE (decl
) = error_mark_node
;
3260 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
3261 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
3266 A C language linkage is ignored for the names of class members
3267 and the member function type of class member functions. */
3268 if (DECL_LANG_SPECIFIC (decl
))
3269 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3273 /* Functions and non-functions are added differently. */
3274 if (DECL_DECLARES_FUNCTION_P (decl
))
3275 add
= add_method (current_class_type
, decl
, false);
3276 /* Enter the DECL into the scope of the class, if the class
3277 isn't a closure (whose fields are supposed to be unnamed). */
3278 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3279 || pushdecl_class_level (decl
))
3284 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3285 go at the beginning. The reason is that
3286 legacy_nonfn_member_lookup searches the list in order, and we
3287 want a field name to override a type name so that the "struct
3288 stat hack" will work. In particular:
3290 struct S { enum E { }; static const int E = 5; int ary[S::E]; } s;
3294 if (TREE_CODE (decl
) == TYPE_DECL
)
3295 TYPE_FIELDS (current_class_type
)
3296 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3299 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3300 TYPE_FIELDS (current_class_type
) = decl
;
3303 maybe_add_class_template_decl_list (current_class_type
, decl
,
3308 /* Finish processing a complete template declaration. The PARMS are
3309 the template parameters. */
3312 finish_template_decl (tree parms
)
3315 end_template_decl ();
3317 end_specialization ();
3320 // Returns the template type of the class scope being entered. If we're
3321 // entering a constrained class scope. TYPE is the class template
3322 // scope being entered and we may need to match the intended type with
3323 // a constrained specialization. For example:
3325 // template<Object T>
3326 // struct S { void f(); }; #1
3328 // template<Object T>
3329 // void S<T>::f() { } #2
3331 // We check, in #2, that S<T> refers precisely to the type declared by
3332 // #1 (i.e., that the constraints match). Note that the following should
3333 // be an error since there is no specialization of S<T> that is
3334 // unconstrained, but this is not diagnosed here.
3336 // template<typename T>
3337 // void S<T>::f() { }
3339 // We cannot diagnose this problem here since this function also matches
3340 // qualified template names that are not part of a definition. For example:
3342 // template<Integral T, Floating_point U>
3343 // typename pair<T, U>::first_type void f(T, U);
3345 // Here, it is unlikely that there is a partial specialization of
3346 // pair constrained for for Integral and Floating_point arguments.
3348 // The general rule is: if a constrained specialization with matching
3349 // constraints is found return that type. Also note that if TYPE is not a
3350 // class-type (e.g. a typename type), then no fixup is needed.
3353 fixup_template_type (tree type
)
3355 // Find the template parameter list at the a depth appropriate to
3356 // the scope we're trying to enter.
3357 tree parms
= current_template_parms
;
3358 int depth
= template_class_depth (type
);
3359 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3360 parms
= TREE_CHAIN (parms
);
3363 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3364 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3366 // Search for a specialization whose type and constraints match.
3367 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3368 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3371 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3373 // If the type and constraints match a specialization, then we
3374 // are entering that type.
3375 if (same_type_p (type
, TREE_TYPE (specs
))
3376 && equivalent_constraints (cur_constr
, spec_constr
))
3377 return TREE_TYPE (specs
);
3378 specs
= TREE_CHAIN (specs
);
3381 // If no specialization matches, then must return the type
3382 // previously found.
3386 /* Finish processing a template-id (which names a type) of the form
3387 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3388 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3389 the scope of template-id indicated. */
3392 finish_template_type (tree name
, tree args
, int entering_scope
)
3396 type
= lookup_template_class (name
, args
,
3397 NULL_TREE
, NULL_TREE
, entering_scope
,
3398 tf_warning_or_error
| tf_user
);
3400 /* If we might be entering the scope of a partial specialization,
3401 find the one with the right constraints. */
3404 && CLASS_TYPE_P (type
)
3405 && CLASSTYPE_TEMPLATE_INFO (type
)
3406 && dependent_type_p (type
)
3407 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3408 type
= fixup_template_type (type
);
3410 if (type
== error_mark_node
)
3412 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3413 return TYPE_STUB_DECL (type
);
3415 return TYPE_NAME (type
);
3418 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3419 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3420 BASE_CLASS, or NULL_TREE if an error occurred. The
3421 ACCESS_SPECIFIER is one of
3422 access_{default,public,protected_private}_node. For a virtual base
3423 we set TREE_TYPE. */
3426 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3430 if (base
== error_mark_node
)
3432 error ("invalid base-class specification");
3435 else if (! MAYBE_CLASS_TYPE_P (base
))
3437 error ("%qT is not a class type", base
);
3442 if (cp_type_quals (base
) != 0)
3444 /* DR 484: Can a base-specifier name a cv-qualified
3446 base
= TYPE_MAIN_VARIANT (base
);
3448 result
= build_tree_list (access
, base
);
3450 TREE_TYPE (result
) = integer_type_node
;
3456 /* If FNS is a member function, a set of member functions, or a
3457 template-id referring to one or more member functions, return a
3458 BASELINK for FNS, incorporating the current access context.
3459 Otherwise, return FNS unchanged. */
3462 baselink_for_fns (tree fns
)
3467 if (BASELINK_P (fns
)
3468 || error_operand_p (fns
))
3471 scope
= ovl_scope (fns
);
3472 if (!CLASS_TYPE_P (scope
))
3475 cl
= currently_open_derived_class (scope
);
3478 cl
= TYPE_BINFO (cl
);
3479 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3482 /* Returns true iff DECL is a variable from a function outside
3486 outer_var_p (tree decl
)
3488 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3489 && DECL_FUNCTION_SCOPE_P (decl
)
3490 /* Don't get confused by temporaries. */
3492 && (DECL_CONTEXT (decl
) != current_function_decl
3493 || parsing_nsdmi ()));
3496 /* As above, but also checks that DECL is automatic. */
3499 outer_automatic_var_p (tree decl
)
3501 return (outer_var_p (decl
)
3502 && !TREE_STATIC (decl
));
3505 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3506 rewrite it for lambda capture.
3508 If ODR_USE is true, we're being called from mark_use, and we complain about
3509 use of constant variables. If ODR_USE is false, we're being called for the
3510 id-expression, and we do lambda capture. */
3513 process_outer_var_ref (tree decl
, tsubst_flags_t complain
, bool odr_use
)
3515 if (cp_unevaluated_operand
)
3516 /* It's not a use (3.2) if we're in an unevaluated context. */
3518 if (decl
== error_mark_node
)
3521 tree context
= DECL_CONTEXT (decl
);
3522 tree containing_function
= current_function_decl
;
3523 tree lambda_stack
= NULL_TREE
;
3524 tree lambda_expr
= NULL_TREE
;
3525 tree initializer
= convert_from_reference (decl
);
3527 /* Mark it as used now even if the use is ill-formed. */
3528 if (!mark_used (decl
, complain
))
3529 return error_mark_node
;
3531 if (parsing_nsdmi ())
3532 containing_function
= NULL_TREE
;
3534 if (containing_function
&& LAMBDA_FUNCTION_P (containing_function
))
3536 /* Check whether we've already built a proxy. */
3538 while (is_normal_capture_proxy (var
))
3539 var
= DECL_CAPTURED_VARIABLE (var
);
3540 tree d
= retrieve_local_specialization (var
);
3542 if (d
&& d
!= decl
&& is_capture_proxy (d
))
3544 if (DECL_CONTEXT (d
) == containing_function
)
3545 /* We already have an inner proxy. */
3548 /* We need to capture an outer proxy. */
3549 return process_outer_var_ref (d
, complain
, odr_use
);
3553 /* If we are in a lambda function, we can move out until we hit
3555 2. a non-lambda function, or
3556 3. a non-default capturing lambda function. */
3557 while (context
!= containing_function
3558 /* containing_function can be null with invalid generic lambdas. */
3559 && containing_function
3560 && LAMBDA_FUNCTION_P (containing_function
))
3562 tree closure
= DECL_CONTEXT (containing_function
);
3563 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3565 if (TYPE_CLASS_SCOPE_P (closure
))
3566 /* A lambda in an NSDMI (c++/64496). */
3569 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_NONE
)
3572 lambda_stack
= tree_cons (NULL_TREE
, lambda_expr
, lambda_stack
);
3574 containing_function
= decl_function_context (containing_function
);
3577 /* In a lambda within a template, wait until instantiation time to implicitly
3578 capture a parameter pack. We want to wait because we don't know if we're
3579 capturing the whole pack or a single element, and it's OK to wait because
3580 find_parameter_packs_r walks into the lambda body. */
3581 if (context
== containing_function
3582 && DECL_PACK_P (decl
))
3585 if (lambda_expr
&& VAR_P (decl
) && DECL_ANON_UNION_VAR_P (decl
))
3587 if (complain
& tf_error
)
3588 error ("cannot capture member %qD of anonymous union", decl
);
3589 return error_mark_node
;
3591 /* Do lambda capture when processing the id-expression, not when
3592 odr-using a variable. */
3593 if (!odr_use
&& context
== containing_function
)
3594 decl
= add_default_capture (lambda_stack
,
3595 /*id=*/DECL_NAME (decl
), initializer
);
3596 /* Only an odr-use of an outer automatic variable causes an
3597 error, and a constant variable can decay to a prvalue
3598 constant without odr-use. So don't complain yet. */
3599 else if (!odr_use
&& decl_constant_var_p (decl
))
3601 else if (lambda_expr
)
3603 if (complain
& tf_error
)
3605 error ("%qD is not captured", decl
);
3606 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3607 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) == CPLD_NONE
)
3608 inform (location_of (closure
),
3609 "the lambda has no capture-default");
3610 else if (TYPE_CLASS_SCOPE_P (closure
))
3611 inform (UNKNOWN_LOCATION
, "lambda in local class %q+T cannot "
3612 "capture variables from the enclosing context",
3613 TYPE_CONTEXT (closure
));
3614 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3616 return error_mark_node
;
3620 if (complain
& tf_error
)
3623 ? G_("use of local variable with automatic storage from "
3624 "containing function")
3625 : G_("use of parameter from containing function"));
3626 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3628 return error_mark_node
;
3633 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3634 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3635 if non-NULL, is the type or namespace used to explicitly qualify
3636 ID_EXPRESSION. DECL is the entity to which that name has been
3639 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3640 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3641 be set to true if this expression isn't permitted in a
3642 constant-expression, but it is otherwise not set by this function.
3643 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3644 constant-expression, but a non-constant expression is also
3647 DONE is true if this expression is a complete postfix-expression;
3648 it is false if this expression is followed by '->', '[', '(', etc.
3649 ADDRESS_P is true iff this expression is the operand of '&'.
3650 TEMPLATE_P is true iff the qualified-id was of the form
3651 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3652 appears as a template argument.
3654 If an error occurs, and it is the kind of error that might cause
3655 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3656 is the caller's responsibility to issue the message. *ERROR_MSG
3657 will be a string with static storage duration, so the caller need
3660 Return an expression for the entity, after issuing appropriate
3661 diagnostics. This function is also responsible for transforming a
3662 reference to a non-static member into a COMPONENT_REF that makes
3663 the use of "this" explicit.
3665 Upon return, *IDK will be filled in appropriately. */
3667 finish_id_expression_1 (tree id_expression
,
3671 bool integral_constant_expression_p
,
3672 bool allow_non_integral_constant_expression_p
,
3673 bool *non_integral_constant_expression_p
,
3677 bool template_arg_p
,
3678 const char **error_msg
,
3679 location_t location
)
3681 decl
= strip_using_decl (decl
);
3683 /* Initialize the output parameters. */
3684 *idk
= CP_ID_KIND_NONE
;
3687 if (id_expression
== error_mark_node
)
3688 return error_mark_node
;
3689 /* If we have a template-id, then no further lookup is
3690 required. If the template-id was for a template-class, we
3691 will sometimes have a TYPE_DECL at this point. */
3692 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3693 || TREE_CODE (decl
) == TYPE_DECL
)
3695 /* Look up the name. */
3698 if (decl
== error_mark_node
)
3700 /* Name lookup failed. */
3703 || (!dependent_type_p (scope
)
3704 && !(identifier_p (id_expression
)
3705 && IDENTIFIER_CONV_OP_P (id_expression
)
3706 && dependent_type_p (TREE_TYPE (id_expression
))))))
3708 /* If the qualifying type is non-dependent (and the name
3709 does not name a conversion operator to a dependent
3710 type), issue an error. */
3711 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3712 return error_mark_node
;
3716 /* It may be resolved via Koenig lookup. */
3717 *idk
= CP_ID_KIND_UNQUALIFIED
;
3718 return id_expression
;
3721 decl
= id_expression
;
3724 /* Remember that the name was used in the definition of
3725 the current class so that we can check later to see if
3726 the meaning would have been different after the class
3727 was entirely defined. */
3728 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3729 maybe_note_name_used_in_class (id_expression
, decl
);
3731 /* A use in unevaluated operand might not be instantiated appropriately
3732 if tsubst_copy builds a dummy parm, or if we never instantiate a
3733 generic lambda, so mark it now. */
3734 if (processing_template_decl
&& cp_unevaluated_operand
)
3735 mark_type_use (decl
);
3737 /* Disallow uses of local variables from containing functions, except
3738 within lambda-expressions. */
3739 if (outer_automatic_var_p (decl
))
3741 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3742 if (decl
== error_mark_node
)
3743 return error_mark_node
;
3746 /* Also disallow uses of function parameters outside the function
3747 body, except inside an unevaluated context (i.e. decltype). */
3748 if (TREE_CODE (decl
) == PARM_DECL
3749 && DECL_CONTEXT (decl
) == NULL_TREE
3750 && !cp_unevaluated_operand
)
3752 *error_msg
= G_("use of parameter outside function body");
3753 return error_mark_node
;
3757 /* If we didn't find anything, or what we found was a type,
3758 then this wasn't really an id-expression. */
3759 if (TREE_CODE (decl
) == TEMPLATE_DECL
3760 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3762 *error_msg
= G_("missing template arguments");
3763 return error_mark_node
;
3765 else if (TREE_CODE (decl
) == TYPE_DECL
3766 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3768 *error_msg
= G_("expected primary-expression");
3769 return error_mark_node
;
3772 /* If the name resolved to a template parameter, there is no
3773 need to look it up again later. */
3774 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3775 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3779 *idk
= CP_ID_KIND_NONE
;
3780 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3781 decl
= TEMPLATE_PARM_DECL (decl
);
3782 r
= DECL_INITIAL (decl
);
3783 if (CLASS_TYPE_P (TREE_TYPE (r
)) && !CP_TYPE_CONST_P (TREE_TYPE (r
)))
3785 /* If the entity is a template parameter object for a template
3786 parameter of type T, the type of the expression is const T. */
3787 tree ctype
= TREE_TYPE (r
);
3788 ctype
= cp_build_qualified_type (ctype
, (cp_type_quals (ctype
)
3789 | TYPE_QUAL_CONST
));
3790 r
= build1 (VIEW_CONVERT_EXPR
, ctype
, r
);
3792 r
= convert_from_reference (r
);
3793 if (integral_constant_expression_p
3794 && !dependent_type_p (TREE_TYPE (decl
))
3795 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3797 if (!allow_non_integral_constant_expression_p
)
3798 error ("template parameter %qD of type %qT is not allowed in "
3799 "an integral constant expression because it is not of "
3800 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3801 *non_integral_constant_expression_p
= true;
3807 bool dependent_p
= type_dependent_expression_p (decl
);
3809 /* If the declaration was explicitly qualified indicate
3810 that. The semantics of `A::f(3)' are different than
3811 `f(3)' if `f' is virtual. */
3813 ? CP_ID_KIND_QUALIFIED
3814 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3815 ? CP_ID_KIND_TEMPLATE_ID
3817 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3818 : CP_ID_KIND_UNQUALIFIED
)));
3822 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3823 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3824 wrong, so just return the identifier. */
3825 return id_expression
;
3827 if (DECL_CLASS_TEMPLATE_P (decl
))
3829 error ("use of class template %qT as expression", decl
);
3830 return error_mark_node
;
3833 if (TREE_CODE (decl
) == TREE_LIST
)
3835 /* Ambiguous reference to base members. */
3836 error ("request for member %qD is ambiguous in "
3837 "multiple inheritance lattice", id_expression
);
3838 print_candidates (decl
);
3839 return error_mark_node
;
3842 /* Mark variable-like entities as used. Functions are similarly
3843 marked either below or after overload resolution. */
3845 || TREE_CODE (decl
) == PARM_DECL
3846 || TREE_CODE (decl
) == CONST_DECL
3847 || TREE_CODE (decl
) == RESULT_DECL
)
3848 && !mark_used (decl
))
3849 return error_mark_node
;
3851 /* Only certain kinds of names are allowed in constant
3852 expression. Template parameters have already
3853 been handled above. */
3854 if (! error_operand_p (decl
)
3856 && integral_constant_expression_p
3857 && !decl_constant_var_p (decl
)
3858 && TREE_CODE (decl
) != CONST_DECL
3859 && !builtin_valid_in_constant_expr_p (decl
)
3860 && !concept_check_p (decl
))
3862 if (!allow_non_integral_constant_expression_p
)
3864 error ("%qD cannot appear in a constant-expression", decl
);
3865 return error_mark_node
;
3867 *non_integral_constant_expression_p
= true;
3870 if (tree wrap
= maybe_get_tls_wrapper_call (decl
))
3871 /* Replace an evaluated use of the thread_local variable with
3872 a call to its wrapper. */
3874 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3876 && variable_template_p (TREE_OPERAND (decl
, 0))
3877 && !concept_check_p (decl
))
3879 decl
= finish_template_variable (decl
);
3881 decl
= convert_from_reference (decl
);
3883 else if (concept_check_p (decl
))
3885 /* If this is a standard or variable concept check, potentially
3886 evaluate it. Function concepts need to be called as functions,
3887 so don't try evaluating them here. */
3888 tree tmpl
= TREE_OPERAND (decl
, 0);
3889 tree args
= TREE_OPERAND (decl
, 1);
3890 if (!function_concept_p (tmpl
) && !uses_template_parms (args
))
3891 decl
= evaluate_concept_check (decl
, tf_warning_or_error
);
3895 if (TREE_CODE (decl
) == SCOPE_REF
)
3897 gcc_assert (same_type_p (scope
, TREE_OPERAND (decl
, 0)));
3898 decl
= TREE_OPERAND (decl
, 1);
3901 decl
= (adjust_result_of_qualified_name_lookup
3902 (decl
, scope
, current_nonlambda_class_type()));
3904 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3907 cp_warn_deprecated_use_scopes (scope
);
3910 decl
= finish_qualified_id_expr (scope
,
3916 tf_warning_or_error
);
3918 decl
= convert_from_reference (decl
);
3920 else if (TREE_CODE (decl
) == FIELD_DECL
)
3922 /* Since SCOPE is NULL here, this is an unqualified name.
3923 Access checking has been performed during name lookup
3924 already. Turn off checking to avoid duplicate errors. */
3925 push_deferring_access_checks (dk_no_check
);
3926 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3927 /*qualifying_scope=*/NULL_TREE
);
3928 pop_deferring_access_checks ();
3930 else if (is_overloaded_fn (decl
))
3932 /* We only need to look at the first function,
3933 because all the fns share the attribute we're
3934 concerned with (all member fns or all non-members). */
3935 tree first_fn
= get_first_fn (decl
);
3936 first_fn
= STRIP_TEMPLATE (first_fn
);
3938 /* [basic.def.odr]: "A function whose name appears as a
3939 potentially-evaluated expression is odr-used if it is the unique
3942 But only mark it if it's a complete postfix-expression; in a call,
3943 ADL might select a different function, and we'll call mark_used in
3946 && !really_overloaded_fn (decl
)
3947 && !mark_used (first_fn
))
3948 return error_mark_node
;
3951 && (TREE_CODE (first_fn
) == USING_DECL
3952 || (TREE_CODE (first_fn
) == FUNCTION_DECL
3953 && DECL_FUNCTION_MEMBER_P (first_fn
)
3954 && !shared_member_p (decl
))))
3956 /* A set of member functions. */
3957 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3958 return finish_class_member_access_expr (decl
, id_expression
,
3959 /*template_p=*/false,
3960 tf_warning_or_error
);
3963 decl
= baselink_for_fns (decl
);
3965 else if (concept_check_p (decl
))
3967 /* If this is a standard or variable concept check, potentially
3968 evaluate it. Function concepts need to be called as functions,
3969 so don't try evaluating them here. */
3970 tree tmpl
= TREE_OPERAND (decl
, 0);
3971 tree args
= TREE_OPERAND (decl
, 1);
3972 if (!function_concept_p (tmpl
) && !uses_template_parms (args
))
3973 decl
= evaluate_concept_check (decl
, tf_warning_or_error
);
3977 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3978 && DECL_CLASS_SCOPE_P (decl
))
3980 tree context
= context_for_name_lookup (decl
);
3981 if (context
!= current_class_type
)
3983 tree path
= currently_open_derived_class (context
);
3984 perform_or_defer_access_check (TYPE_BINFO (path
),
3986 tf_warning_or_error
);
3990 decl
= convert_from_reference (decl
);
3994 return cp_expr (decl
, location
);
3997 /* As per finish_id_expression_1, but adding a wrapper node
3998 around the result if needed to express LOCATION. */
4001 finish_id_expression (tree id_expression
,
4005 bool integral_constant_expression_p
,
4006 bool allow_non_integral_constant_expression_p
,
4007 bool *non_integral_constant_expression_p
,
4011 bool template_arg_p
,
4012 const char **error_msg
,
4013 location_t location
)
4016 = finish_id_expression_1 (id_expression
, decl
, scope
, idk
,
4017 integral_constant_expression_p
,
4018 allow_non_integral_constant_expression_p
,
4019 non_integral_constant_expression_p
,
4020 template_p
, done
, address_p
, template_arg_p
,
4021 error_msg
, location
);
4022 return result
.maybe_add_location_wrapper ();
4025 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
4026 use as a type-specifier. */
4029 finish_typeof (tree expr
)
4033 if (type_dependent_expression_p (expr
))
4035 type
= cxx_make_type (TYPEOF_TYPE
);
4036 TYPEOF_TYPE_EXPR (type
) = expr
;
4037 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4042 expr
= mark_type_use (expr
);
4044 type
= unlowered_expr_type (expr
);
4046 if (!type
|| type
== unknown_type_node
)
4048 error ("type of %qE is unknown", expr
);
4049 return error_mark_node
;
4055 /* Implement the __underlying_type keyword: Return the underlying
4056 type of TYPE, suitable for use as a type-specifier. */
4059 finish_underlying_type (tree type
)
4061 tree underlying_type
;
4063 if (processing_template_decl
)
4065 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
4066 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
4067 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
4069 return underlying_type
;
4072 if (!complete_type_or_else (type
, NULL_TREE
))
4073 return error_mark_node
;
4075 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
4077 error ("%qT is not an enumeration type", type
);
4078 return error_mark_node
;
4081 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
4083 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
4084 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
4085 See finish_enum_value_list for details. */
4086 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
4088 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
4089 TYPE_UNSIGNED (underlying_type
));
4091 return underlying_type
;
4094 /* Implement the __direct_bases keyword: Return the direct base classes
4098 calculate_direct_bases (tree type
, tsubst_flags_t complain
)
4100 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
4101 || !NON_UNION_CLASS_TYPE_P (type
))
4102 return make_tree_vec (0);
4104 releasing_vec vector
;
4105 vec
<tree
, va_gc
> *base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
4109 /* Virtual bases are initialized first */
4110 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
4111 if (BINFO_VIRTUAL_P (binfo
))
4112 vec_safe_push (vector
, binfo
);
4114 /* Now non-virtuals */
4115 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
4116 if (!BINFO_VIRTUAL_P (binfo
))
4117 vec_safe_push (vector
, binfo
);
4119 tree bases_vec
= make_tree_vec (vector
->length ());
4121 for (i
= 0; i
< vector
->length (); ++i
)
4122 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
4127 /* Implement the __bases keyword: Return the base classes
4130 /* Find morally non-virtual base classes by walking binfo hierarchy */
4131 /* Virtual base classes are handled separately in finish_bases */
4134 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
4136 /* Don't walk bases of virtual bases */
4137 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
4141 dfs_calculate_bases_post (tree binfo
, void *data_
)
4143 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
4144 if (!BINFO_VIRTUAL_P (binfo
))
4145 vec_safe_push (*data
, BINFO_TYPE (binfo
));
4149 /* Calculates the morally non-virtual base classes of a class */
4150 static vec
<tree
, va_gc
> *
4151 calculate_bases_helper (tree type
)
4153 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
4155 /* Now add non-virtual base classes in order of construction */
4156 if (TYPE_BINFO (type
))
4157 dfs_walk_all (TYPE_BINFO (type
),
4158 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
4163 calculate_bases (tree type
, tsubst_flags_t complain
)
4165 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
4166 || !NON_UNION_CLASS_TYPE_P (type
))
4167 return make_tree_vec (0);
4169 releasing_vec vector
;
4170 tree bases_vec
= NULL_TREE
;
4172 vec
<tree
, va_gc
> *vbases
;
4175 /* First go through virtual base classes */
4176 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
4177 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
4179 releasing_vec vbase_bases
4180 = calculate_bases_helper (BINFO_TYPE (binfo
));
4181 vec_safe_splice (vector
, vbase_bases
);
4184 /* Now for the non-virtual bases */
4185 releasing_vec nonvbases
= calculate_bases_helper (type
);
4186 vec_safe_splice (vector
, nonvbases
);
4188 /* Note that during error recovery vector->length can even be zero. */
4189 if (vector
->length () > 1)
4191 /* Last element is entire class, so don't copy */
4192 bases_vec
= make_tree_vec (vector
->length () - 1);
4194 for (i
= 0; i
< vector
->length () - 1; ++i
)
4195 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
4198 bases_vec
= make_tree_vec (0);
4204 finish_bases (tree type
, bool direct
)
4206 tree bases
= NULL_TREE
;
4208 if (!processing_template_decl
)
4210 /* Parameter packs can only be used in templates */
4211 error ("parameter pack %<__bases%> only valid in template declaration");
4212 return error_mark_node
;
4215 bases
= cxx_make_type (BASES
);
4216 BASES_TYPE (bases
) = type
;
4217 BASES_DIRECT (bases
) = direct
;
4218 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
4223 /* Perform C++-specific checks for __builtin_offsetof before calling
4227 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
4229 /* If we're processing a template, we can't finish the semantics yet.
4230 Otherwise we can fold the entire expression now. */
4231 if (processing_template_decl
)
4233 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4234 SET_EXPR_LOCATION (expr
, loc
);
4238 if (expr
== error_mark_node
)
4239 return error_mark_node
;
4241 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4243 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4244 TREE_OPERAND (expr
, 2));
4245 return error_mark_node
;
4247 if (FUNC_OR_METHOD_TYPE_P (TREE_TYPE (expr
))
4248 || TREE_TYPE (expr
) == unknown_type_node
)
4250 while (TREE_CODE (expr
) == COMPONENT_REF
4251 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4252 expr
= TREE_OPERAND (expr
, 1);
4256 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4257 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
4260 error ("cannot apply %<offsetof%> to member function");
4261 return error_mark_node
;
4263 if (TREE_CODE (expr
) == CONST_DECL
)
4265 error ("cannot apply %<offsetof%> to an enumerator %qD", expr
);
4266 return error_mark_node
;
4268 if (REFERENCE_REF_P (expr
))
4269 expr
= TREE_OPERAND (expr
, 0);
4270 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4271 return error_mark_node
;
4272 if (warn_invalid_offsetof
4273 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4274 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4275 && cp_unevaluated_operand
== 0)
4276 warning_at (loc
, OPT_Winvalid_offsetof
, "%<offsetof%> within "
4277 "non-standard-layout type %qT is conditionally-supported",
4278 TREE_TYPE (TREE_TYPE (object_ptr
)));
4279 return fold_offsetof (expr
);
4282 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4283 function is broken out from the above for the benefit of the tree-ssa
4287 simplify_aggr_init_expr (tree
*tp
)
4289 tree aggr_init_expr
= *tp
;
4291 /* Form an appropriate CALL_EXPR. */
4292 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4293 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4294 tree type
= TREE_TYPE (slot
);
4297 enum style_t
{ ctor
, arg
, pcc
} style
;
4299 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4301 #ifdef PCC_STATIC_STRUCT_RETURN
4307 gcc_assert (TREE_ADDRESSABLE (type
));
4311 call_expr
= build_call_array_loc (input_location
,
4312 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4314 aggr_init_expr_nargs (aggr_init_expr
),
4315 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4316 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4317 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4318 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4319 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4320 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4321 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4325 /* Replace the first argument to the ctor with the address of the
4327 cxx_mark_addressable (slot
);
4328 CALL_EXPR_ARG (call_expr
, 0) =
4329 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4331 else if (style
== arg
)
4333 /* Just mark it addressable here, and leave the rest to
4334 expand_call{,_inline}. */
4335 cxx_mark_addressable (slot
);
4336 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4337 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4339 else if (style
== pcc
)
4341 /* If we're using the non-reentrant PCC calling convention, then we
4342 need to copy the returned value out of the static buffer into the
4344 push_deferring_access_checks (dk_no_check
);
4345 call_expr
= build_aggr_init (slot
, call_expr
,
4346 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4347 tf_warning_or_error
);
4348 pop_deferring_access_checks ();
4349 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4352 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4354 tree init
= build_zero_init (type
, NULL_TREE
,
4355 /*static_storage_p=*/false);
4356 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4357 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4364 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4367 emit_associated_thunks (tree fn
)
4369 /* When we use vcall offsets, we emit thunks with the virtual
4370 functions to which they thunk. The whole point of vcall offsets
4371 is so that you can know statically the entire set of thunks that
4372 will ever be needed for a given virtual function, thereby
4373 enabling you to output all the thunks with the function itself. */
4374 if (DECL_VIRTUAL_P (fn
)
4375 /* Do not emit thunks for extern template instantiations. */
4376 && ! DECL_REALLY_EXTERN (fn
))
4380 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4382 if (!THUNK_ALIAS (thunk
))
4384 use_thunk (thunk
, /*emit_p=*/1);
4385 if (DECL_RESULT_THUNK_P (thunk
))
4389 for (probe
= DECL_THUNKS (thunk
);
4390 probe
; probe
= DECL_CHAIN (probe
))
4391 use_thunk (probe
, /*emit_p=*/1);
4395 gcc_assert (!DECL_THUNKS (thunk
));
4400 /* Generate RTL for FN. */
4403 expand_or_defer_fn_1 (tree fn
)
4405 /* When the parser calls us after finishing the body of a template
4406 function, we don't really want to expand the body. */
4407 if (processing_template_decl
)
4409 /* Normally, collection only occurs in rest_of_compilation. So,
4410 if we don't collect here, we never collect junk generated
4411 during the processing of templates until we hit a
4412 non-template function. It's not safe to do this inside a
4413 nested class, though, as the parser may have local state that
4414 is not a GC root. */
4415 if (!function_depth
)
4420 gcc_assert (DECL_SAVED_TREE (fn
));
4422 /* We make a decision about linkage for these functions at the end
4423 of the compilation. Until that point, we do not want the back
4424 end to output them -- but we do want it to see the bodies of
4425 these functions so that it can inline them as appropriate. */
4426 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4428 if (DECL_INTERFACE_KNOWN (fn
))
4429 /* We've already made a decision as to how this function will
4431 else if (!at_eof
|| DECL_IMMEDIATE_FUNCTION_P (fn
))
4432 tentative_decl_linkage (fn
);
4434 import_export_decl (fn
);
4436 /* If the user wants us to keep all inline functions, then mark
4437 this function as needed so that finish_file will make sure to
4438 output it later. Similarly, all dllexport'd functions must
4439 be emitted; there may be callers in other DLLs. */
4440 if (DECL_DECLARED_INLINE_P (fn
)
4441 && !DECL_REALLY_EXTERN (fn
)
4442 && !DECL_IMMEDIATE_FUNCTION_P (fn
)
4443 && (flag_keep_inline_functions
4444 || (flag_keep_inline_dllexport
4445 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4448 DECL_EXTERNAL (fn
) = 0;
4452 /* If this is a constructor or destructor body, we have to clone
4454 if (maybe_clone_body (fn
))
4456 /* We don't want to process FN again, so pretend we've written
4457 it out, even though we haven't. */
4458 TREE_ASM_WRITTEN (fn
) = 1;
4459 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4460 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4461 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4465 /* There's no reason to do any of the work here if we're only doing
4466 semantic analysis; this code just generates RTL. */
4467 if (flag_syntax_only
)
4469 /* Pretend that this function has been written out so that we don't try
4470 to expand it again. */
4471 TREE_ASM_WRITTEN (fn
) = 1;
4479 expand_or_defer_fn (tree fn
)
4481 if (expand_or_defer_fn_1 (fn
))
4485 /* Expand or defer, at the whim of the compilation unit manager. */
4486 cgraph_node::finalize_function (fn
, function_depth
> 1);
4487 emit_associated_thunks (fn
);
4496 nrv_data () : visited (37) {}
4500 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4503 /* Helper function for walk_tree, used by finalize_nrv below. */
4506 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4508 class nrv_data
*dp
= (class nrv_data
*)data
;
4511 /* No need to walk into types. There wouldn't be any need to walk into
4512 non-statements, except that we have to consider STMT_EXPRs. */
4515 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4516 but differs from using NULL_TREE in that it indicates that we care
4517 about the value of the RESULT_DECL. */
4518 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4519 TREE_OPERAND (*tp
, 0) = dp
->result
;
4520 /* Change all cleanups for the NRV to only run when an exception is
4522 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4523 && CLEANUP_DECL (*tp
) == dp
->var
)
4524 CLEANUP_EH_ONLY (*tp
) = 1;
4525 /* Replace the DECL_EXPR for the NRV with an initialization of the
4526 RESULT_DECL, if needed. */
4527 else if (TREE_CODE (*tp
) == DECL_EXPR
4528 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4531 if (DECL_INITIAL (dp
->var
)
4532 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4533 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4534 DECL_INITIAL (dp
->var
));
4536 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4537 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4538 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4541 /* And replace all uses of the NRV with the RESULT_DECL. */
4542 else if (*tp
== dp
->var
)
4545 /* Avoid walking into the same tree more than once. Unfortunately, we
4546 can't just use walk_tree_without duplicates because it would only call
4547 us for the first occurrence of dp->var in the function body. */
4548 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4554 /* Keep iterating. */
4558 /* Called from finish_function to implement the named return value
4559 optimization by overriding all the RETURN_EXPRs and pertinent
4560 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4561 RESULT_DECL for the function. */
4564 finalize_nrv (tree
*tp
, tree var
, tree result
)
4566 class nrv_data data
;
4568 /* Copy name from VAR to RESULT. */
4569 DECL_NAME (result
) = DECL_NAME (var
);
4570 /* Don't forget that we take its address. */
4571 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4572 /* Finally set DECL_VALUE_EXPR to avoid assigning
4573 a stack slot at -O0 for the original var and debug info
4574 uses RESULT location for VAR. */
4575 SET_DECL_VALUE_EXPR (var
, result
);
4576 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4579 data
.result
= result
;
4580 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4583 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4586 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4587 bool need_copy_ctor
, bool need_copy_assignment
,
4590 int save_errorcount
= errorcount
;
4593 /* Always allocate 3 elements for simplicity. These are the
4594 function decls for the ctor, dtor, and assignment op.
4595 This layout is known to the three lang hooks,
4596 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4597 and cxx_omp_clause_assign_op. */
4598 info
= make_tree_vec (3);
4599 CP_OMP_CLAUSE_INFO (c
) = info
;
4601 if (need_default_ctor
|| need_copy_ctor
)
4603 if (need_default_ctor
)
4604 t
= get_default_ctor (type
);
4606 t
= get_copy_ctor (type
, tf_warning_or_error
);
4608 if (t
&& !trivial_fn_p (t
))
4609 TREE_VEC_ELT (info
, 0) = t
;
4612 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4613 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4615 if (need_copy_assignment
)
4617 t
= get_copy_assign (type
);
4619 if (t
&& !trivial_fn_p (t
))
4620 TREE_VEC_ELT (info
, 2) = t
;
4623 return errorcount
!= save_errorcount
;
4626 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4627 FIELD_DECL, otherwise return DECL itself. */
4630 omp_clause_decl_field (tree decl
)
4633 && DECL_HAS_VALUE_EXPR_P (decl
)
4634 && DECL_ARTIFICIAL (decl
)
4635 && DECL_LANG_SPECIFIC (decl
)
4636 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4638 tree f
= DECL_VALUE_EXPR (decl
);
4639 if (INDIRECT_REF_P (f
))
4640 f
= TREE_OPERAND (f
, 0);
4641 if (TREE_CODE (f
) == COMPONENT_REF
)
4643 f
= TREE_OPERAND (f
, 1);
4644 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4651 /* Adjust DECL if needed for printing using %qE. */
4654 omp_clause_printable_decl (tree decl
)
4656 tree t
= omp_clause_decl_field (decl
);
4662 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4663 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4667 omp_note_field_privatization (tree f
, tree t
)
4669 if (!omp_private_member_map
)
4670 omp_private_member_map
= new hash_map
<tree
, tree
>;
4671 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4675 omp_private_member_vec
.safe_push (f
);
4676 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4677 omp_private_member_vec
.safe_push (integer_zero_node
);
4681 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4685 omp_privatize_field (tree t
, bool shared
)
4687 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4688 if (m
== error_mark_node
)
4689 return error_mark_node
;
4690 if (!omp_private_member_map
&& !shared
)
4691 omp_private_member_map
= new hash_map
<tree
, tree
>;
4692 if (TYPE_REF_P (TREE_TYPE (t
)))
4694 gcc_assert (INDIRECT_REF_P (m
));
4695 m
= TREE_OPERAND (m
, 0);
4697 tree vb
= NULL_TREE
;
4698 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4701 v
= create_temporary_var (TREE_TYPE (m
));
4702 retrofit_lang_decl (v
);
4703 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4704 SET_DECL_VALUE_EXPR (v
, m
);
4705 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4707 omp_private_member_vec
.safe_push (t
);
4712 /* Helper function for handle_omp_array_sections. Called recursively
4713 to handle multiple array-section-subscripts. C is the clause,
4714 T current expression (initially OMP_CLAUSE_DECL), which is either
4715 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4716 expression if specified, TREE_VALUE length expression if specified,
4717 TREE_CHAIN is what it has been specified after, or some decl.
4718 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4719 set to true if any of the array-section-subscript could have length
4720 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4721 first array-section-subscript which is known not to have length
4723 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4724 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4725 all are or may have length of 1, array-section-subscript [:2] is the
4726 first one known not to have length 1. For array-section-subscript
4727 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4728 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4729 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4730 case though, as some lengths could be zero. */
4733 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4734 bool &maybe_zero_len
, unsigned int &first_non_one
,
4735 enum c_omp_region_type ort
)
4737 tree ret
, low_bound
, length
, type
;
4738 if (TREE_CODE (t
) != TREE_LIST
)
4740 if (error_operand_p (t
))
4741 return error_mark_node
;
4742 if (REFERENCE_REF_P (t
)
4743 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4744 t
= TREE_OPERAND (t
, 0);
4746 if (TREE_CODE (t
) == COMPONENT_REF
4748 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4749 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4750 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4751 && !type_dependent_expression_p (t
))
4753 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4754 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4756 error_at (OMP_CLAUSE_LOCATION (c
),
4757 "bit-field %qE in %qs clause",
4758 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4759 return error_mark_node
;
4761 while (TREE_CODE (t
) == COMPONENT_REF
)
4763 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4764 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4766 error_at (OMP_CLAUSE_LOCATION (c
),
4767 "%qE is a member of a union", t
);
4768 return error_mark_node
;
4770 t
= TREE_OPERAND (t
, 0);
4772 if (REFERENCE_REF_P (t
))
4773 t
= TREE_OPERAND (t
, 0);
4775 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4777 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
4780 error_at (OMP_CLAUSE_LOCATION (c
),
4781 "%qD is not a variable in %qs clause", t
,
4782 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4784 error_at (OMP_CLAUSE_LOCATION (c
),
4785 "%qE is not a variable in %qs clause", t
,
4786 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4787 return error_mark_node
;
4789 else if (ort
== C_ORT_OMP
4790 && TREE_CODE (t
) == PARM_DECL
4791 && DECL_ARTIFICIAL (t
)
4792 && DECL_NAME (t
) == this_identifier
)
4794 error_at (OMP_CLAUSE_LOCATION (c
),
4795 "%<this%> allowed in OpenMP only in %<declare simd%>"
4797 return error_mark_node
;
4799 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4800 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4802 error_at (OMP_CLAUSE_LOCATION (c
),
4803 "%qD is threadprivate variable in %qs clause", t
,
4804 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4805 return error_mark_node
;
4807 if (type_dependent_expression_p (ret
))
4809 ret
= convert_from_reference (ret
);
4813 if (ort
== C_ORT_OMP
4814 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4815 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4816 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4817 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4818 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4819 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4820 maybe_zero_len
, first_non_one
, ort
);
4821 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4824 type
= TREE_TYPE (ret
);
4825 low_bound
= TREE_PURPOSE (t
);
4826 length
= TREE_VALUE (t
);
4827 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4828 || (length
&& type_dependent_expression_p (length
)))
4831 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4832 return error_mark_node
;
4834 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4836 error_at (OMP_CLAUSE_LOCATION (c
),
4837 "low bound %qE of array section does not have integral type",
4839 return error_mark_node
;
4841 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4843 error_at (OMP_CLAUSE_LOCATION (c
),
4844 "length %qE of array section does not have integral type",
4846 return error_mark_node
;
4849 low_bound
= mark_rvalue_use (low_bound
);
4851 length
= mark_rvalue_use (length
);
4852 /* We need to reduce to real constant-values for checks below. */
4854 length
= fold_simple (length
);
4856 low_bound
= fold_simple (low_bound
);
4858 && TREE_CODE (low_bound
) == INTEGER_CST
4859 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4860 > TYPE_PRECISION (sizetype
))
4861 low_bound
= fold_convert (sizetype
, low_bound
);
4863 && TREE_CODE (length
) == INTEGER_CST
4864 && TYPE_PRECISION (TREE_TYPE (length
))
4865 > TYPE_PRECISION (sizetype
))
4866 length
= fold_convert (sizetype
, length
);
4867 if (low_bound
== NULL_TREE
)
4868 low_bound
= integer_zero_node
;
4870 if (length
!= NULL_TREE
)
4872 if (!integer_nonzerop (length
))
4874 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4875 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4876 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4877 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4879 if (integer_zerop (length
))
4881 error_at (OMP_CLAUSE_LOCATION (c
),
4882 "zero length array section in %qs clause",
4883 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4884 return error_mark_node
;
4888 maybe_zero_len
= true;
4890 if (first_non_one
== types
.length ()
4891 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4894 if (TREE_CODE (type
) == ARRAY_TYPE
)
4896 if (length
== NULL_TREE
4897 && (TYPE_DOMAIN (type
) == NULL_TREE
4898 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4900 error_at (OMP_CLAUSE_LOCATION (c
),
4901 "for unknown bound array type length expression must "
4903 return error_mark_node
;
4905 if (TREE_CODE (low_bound
) == INTEGER_CST
4906 && tree_int_cst_sgn (low_bound
) == -1)
4908 error_at (OMP_CLAUSE_LOCATION (c
),
4909 "negative low bound in array section in %qs clause",
4910 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4911 return error_mark_node
;
4913 if (length
!= NULL_TREE
4914 && TREE_CODE (length
) == INTEGER_CST
4915 && tree_int_cst_sgn (length
) == -1)
4917 error_at (OMP_CLAUSE_LOCATION (c
),
4918 "negative length in array section in %qs clause",
4919 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4920 return error_mark_node
;
4922 if (TYPE_DOMAIN (type
)
4923 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4924 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4928 = fold_convert (sizetype
, TYPE_MAX_VALUE (TYPE_DOMAIN (type
)));
4929 size
= size_binop (PLUS_EXPR
, size
, size_one_node
);
4930 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4932 if (tree_int_cst_lt (size
, low_bound
))
4934 error_at (OMP_CLAUSE_LOCATION (c
),
4935 "low bound %qE above array section size "
4936 "in %qs clause", low_bound
,
4937 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4938 return error_mark_node
;
4940 if (tree_int_cst_equal (size
, low_bound
))
4942 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4943 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4944 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4945 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4947 error_at (OMP_CLAUSE_LOCATION (c
),
4948 "zero length array section in %qs clause",
4949 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4950 return error_mark_node
;
4952 maybe_zero_len
= true;
4954 else if (length
== NULL_TREE
4955 && first_non_one
== types
.length ()
4956 && tree_int_cst_equal
4957 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4961 else if (length
== NULL_TREE
)
4963 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4964 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
4965 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_IN_REDUCTION
4966 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_TASK_REDUCTION
)
4967 maybe_zero_len
= true;
4968 if (first_non_one
== types
.length ())
4971 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4973 if (tree_int_cst_lt (size
, length
))
4975 error_at (OMP_CLAUSE_LOCATION (c
),
4976 "length %qE above array section size "
4977 "in %qs clause", length
,
4978 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4979 return error_mark_node
;
4981 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4984 = size_binop (PLUS_EXPR
,
4985 fold_convert (sizetype
, low_bound
),
4986 fold_convert (sizetype
, length
));
4987 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4988 && tree_int_cst_lt (size
, lbpluslen
))
4990 error_at (OMP_CLAUSE_LOCATION (c
),
4991 "high bound %qE above array section size "
4992 "in %qs clause", lbpluslen
,
4993 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4994 return error_mark_node
;
4999 else if (length
== NULL_TREE
)
5001 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
5002 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
5003 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_IN_REDUCTION
5004 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_TASK_REDUCTION
)
5005 maybe_zero_len
= true;
5006 if (first_non_one
== types
.length ())
5010 /* For [lb:] we will need to evaluate lb more than once. */
5011 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
5013 tree lb
= cp_save_expr (low_bound
);
5014 if (lb
!= low_bound
)
5016 TREE_PURPOSE (t
) = lb
;
5021 else if (TYPE_PTR_P (type
))
5023 if (length
== NULL_TREE
)
5025 error_at (OMP_CLAUSE_LOCATION (c
),
5026 "for pointer type length expression must be specified");
5027 return error_mark_node
;
5029 if (length
!= NULL_TREE
5030 && TREE_CODE (length
) == INTEGER_CST
5031 && tree_int_cst_sgn (length
) == -1)
5033 error_at (OMP_CLAUSE_LOCATION (c
),
5034 "negative length in array section in %qs clause",
5035 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5036 return error_mark_node
;
5038 /* If there is a pointer type anywhere but in the very first
5039 array-section-subscript, the array section can't be contiguous. */
5040 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
5041 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
5043 error_at (OMP_CLAUSE_LOCATION (c
),
5044 "array section is not contiguous in %qs clause",
5045 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5046 return error_mark_node
;
5051 error_at (OMP_CLAUSE_LOCATION (c
),
5052 "%qE does not have pointer or array type", ret
);
5053 return error_mark_node
;
5055 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
5056 types
.safe_push (TREE_TYPE (ret
));
5057 /* We will need to evaluate lb more than once. */
5058 tree lb
= cp_save_expr (low_bound
);
5059 if (lb
!= low_bound
)
5061 TREE_PURPOSE (t
) = lb
;
5064 /* Temporarily disable -fstrong-eval-order for array reductions.
5065 The SAVE_EXPR and COMPOUND_EXPR added if low_bound has side-effects
5066 is something the middle-end can't cope with and more importantly,
5067 it needs to be the actual base variable that is privatized, not some
5068 temporary assigned previous value of it. That, together with OpenMP
5069 saying how many times the side-effects are evaluated is unspecified,
5070 makes int *a, *b; ... reduction(+:a[a = b, 3:10]) really unspecified. */
5071 warning_sentinel
s (flag_strong_eval_order
,
5072 OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5073 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5074 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
);
5075 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
5079 /* Handle array sections for clause C. */
5082 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
5084 bool maybe_zero_len
= false;
5085 unsigned int first_non_one
= 0;
5086 auto_vec
<tree
, 10> types
;
5087 tree
*tp
= &OMP_CLAUSE_DECL (c
);
5088 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
5089 && TREE_CODE (*tp
) == TREE_LIST
5090 && TREE_PURPOSE (*tp
)
5091 && TREE_CODE (TREE_PURPOSE (*tp
)) == TREE_VEC
)
5092 tp
= &TREE_VALUE (*tp
);
5093 tree first
= handle_omp_array_sections_1 (c
, *tp
, types
,
5094 maybe_zero_len
, first_non_one
,
5096 if (first
== error_mark_node
)
5098 if (first
== NULL_TREE
)
5100 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
5103 tree tem
= NULL_TREE
;
5104 if (processing_template_decl
)
5106 /* Need to evaluate side effects in the length expressions
5108 while (TREE_CODE (t
) == TREE_LIST
)
5110 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
5112 if (tem
== NULL_TREE
)
5113 tem
= TREE_VALUE (t
);
5115 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
5116 TREE_VALUE (t
), tem
);
5121 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
5126 unsigned int num
= types
.length (), i
;
5127 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
5128 tree condition
= NULL_TREE
;
5130 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
5131 maybe_zero_len
= true;
5132 if (processing_template_decl
&& maybe_zero_len
)
5135 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
5138 tree low_bound
= TREE_PURPOSE (t
);
5139 tree length
= TREE_VALUE (t
);
5143 && TREE_CODE (low_bound
) == INTEGER_CST
5144 && TYPE_PRECISION (TREE_TYPE (low_bound
))
5145 > TYPE_PRECISION (sizetype
))
5146 low_bound
= fold_convert (sizetype
, low_bound
);
5148 && TREE_CODE (length
) == INTEGER_CST
5149 && TYPE_PRECISION (TREE_TYPE (length
))
5150 > TYPE_PRECISION (sizetype
))
5151 length
= fold_convert (sizetype
, length
);
5152 if (low_bound
== NULL_TREE
)
5153 low_bound
= integer_zero_node
;
5154 if (!maybe_zero_len
&& i
> first_non_one
)
5156 if (integer_nonzerop (low_bound
))
5157 goto do_warn_noncontiguous
;
5158 if (length
!= NULL_TREE
5159 && TREE_CODE (length
) == INTEGER_CST
5160 && TYPE_DOMAIN (types
[i
])
5161 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
5162 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
5166 size
= size_binop (PLUS_EXPR
,
5167 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
5169 if (!tree_int_cst_equal (length
, size
))
5171 do_warn_noncontiguous
:
5172 error_at (OMP_CLAUSE_LOCATION (c
),
5173 "array section is not contiguous in %qs "
5175 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5179 if (!processing_template_decl
5180 && length
!= NULL_TREE
5181 && TREE_SIDE_EFFECTS (length
))
5183 if (side_effects
== NULL_TREE
)
5184 side_effects
= length
;
5186 side_effects
= build2 (COMPOUND_EXPR
,
5187 TREE_TYPE (side_effects
),
5188 length
, side_effects
);
5191 else if (processing_template_decl
)
5197 if (i
> first_non_one
5198 && ((length
&& integer_nonzerop (length
))
5199 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5200 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5201 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
))
5204 l
= fold_convert (sizetype
, length
);
5207 l
= size_binop (PLUS_EXPR
,
5208 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
5210 l
= size_binop (MINUS_EXPR
, l
,
5211 fold_convert (sizetype
, low_bound
));
5213 if (i
> first_non_one
)
5215 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
5217 if (condition
== NULL_TREE
)
5220 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
5223 else if (size
== NULL_TREE
)
5225 size
= size_in_bytes (TREE_TYPE (types
[i
]));
5226 tree eltype
= TREE_TYPE (types
[num
- 1]);
5227 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5228 eltype
= TREE_TYPE (eltype
);
5229 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5230 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5231 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
5232 size
= size_binop (EXACT_DIV_EXPR
, size
,
5233 size_in_bytes (eltype
));
5234 size
= size_binop (MULT_EXPR
, size
, l
);
5236 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
5237 size
, size_zero_node
);
5240 size
= size_binop (MULT_EXPR
, size
, l
);
5243 if (!processing_template_decl
)
5246 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
5247 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5248 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5249 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
5251 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5252 size
= save_expr (size
);
5253 tree index_type
= build_index_type (size
);
5254 tree eltype
= TREE_TYPE (first
);
5255 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5256 eltype
= TREE_TYPE (eltype
);
5257 tree type
= build_array_type (eltype
, index_type
);
5258 tree ptype
= build_pointer_type (eltype
);
5259 if (TYPE_REF_P (TREE_TYPE (t
))
5260 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
5261 t
= convert_from_reference (t
);
5262 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5263 t
= build_fold_addr_expr (t
);
5264 tree t2
= build_fold_addr_expr (first
);
5265 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5266 ptrdiff_type_node
, t2
);
5267 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5268 ptrdiff_type_node
, t2
,
5269 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5270 ptrdiff_type_node
, t
));
5271 if (tree_fits_shwi_p (t2
))
5272 t
= build2 (MEM_REF
, type
, t
,
5273 build_int_cst (ptype
, tree_to_shwi (t2
)));
5276 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5278 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5279 TREE_TYPE (t
), t
, t2
);
5280 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5282 OMP_CLAUSE_DECL (c
) = t
;
5285 OMP_CLAUSE_DECL (c
) = first
;
5286 OMP_CLAUSE_SIZE (c
) = size
;
5287 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5288 || (TREE_CODE (t
) == COMPONENT_REF
5289 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5291 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5292 switch (OMP_CLAUSE_MAP_KIND (c
))
5294 case GOMP_MAP_ALLOC
:
5297 case GOMP_MAP_TOFROM
:
5298 case GOMP_MAP_ALWAYS_TO
:
5299 case GOMP_MAP_ALWAYS_FROM
:
5300 case GOMP_MAP_ALWAYS_TOFROM
:
5301 case GOMP_MAP_RELEASE
:
5302 case GOMP_MAP_DELETE
:
5303 case GOMP_MAP_FORCE_TO
:
5304 case GOMP_MAP_FORCE_FROM
:
5305 case GOMP_MAP_FORCE_TOFROM
:
5306 case GOMP_MAP_FORCE_PRESENT
:
5307 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5312 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5314 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5315 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5316 else if (TREE_CODE (t
) == COMPONENT_REF
)
5317 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5318 else if (REFERENCE_REF_P (t
)
5319 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5321 t
= TREE_OPERAND (t
, 0);
5322 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5325 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5326 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5327 && !cxx_mark_addressable (t
))
5329 OMP_CLAUSE_DECL (c2
) = t
;
5330 t
= build_fold_addr_expr (first
);
5331 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5332 ptrdiff_type_node
, t
);
5333 tree ptr
= OMP_CLAUSE_DECL (c2
);
5334 ptr
= convert_from_reference (ptr
);
5335 if (!INDIRECT_TYPE_P (TREE_TYPE (ptr
)))
5336 ptr
= build_fold_addr_expr (ptr
);
5337 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5338 ptrdiff_type_node
, t
,
5339 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5340 ptrdiff_type_node
, ptr
));
5341 OMP_CLAUSE_SIZE (c2
) = t
;
5342 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5343 OMP_CLAUSE_CHAIN (c
) = c2
;
5344 ptr
= OMP_CLAUSE_DECL (c2
);
5345 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5346 && TYPE_REF_P (TREE_TYPE (ptr
))
5347 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5349 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5351 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5352 OMP_CLAUSE_DECL (c3
) = ptr
;
5353 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5354 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5356 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5357 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5358 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5359 OMP_CLAUSE_CHAIN (c2
) = c3
;
5366 /* Return identifier to look up for omp declare reduction. */
5369 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5371 const char *p
= NULL
;
5372 const char *m
= NULL
;
5373 switch (reduction_code
)
5381 case TRUTH_ANDIF_EXPR
:
5382 case TRUTH_ORIF_EXPR
:
5383 reduction_id
= ovl_op_identifier (false, reduction_code
);
5397 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5398 return error_mark_node
;
5399 p
= IDENTIFIER_POINTER (reduction_id
);
5402 if (type
!= NULL_TREE
)
5403 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5405 const char prefix
[] = "omp declare reduction ";
5406 size_t lenp
= sizeof (prefix
);
5407 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5409 size_t len
= strlen (p
);
5410 size_t lenm
= m
? strlen (m
) + 1 : 0;
5411 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5413 memcpy (name
, prefix
, lenp
- 1);
5414 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5417 name
[lenp
+ len
- 1] = '~';
5418 memcpy (name
+ lenp
+ len
, m
, lenm
);
5420 return get_identifier (name
);
5423 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5424 FUNCTION_DECL or NULL_TREE if not found. */
5427 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5428 vec
<tree
> *ambiguousp
)
5431 tree baselink
= NULL_TREE
;
5432 if (identifier_p (id
))
5435 bool nonint_cst_expression_p
;
5436 const char *error_msg
;
5437 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5438 tree decl
= lookup_name (id
);
5439 if (decl
== NULL_TREE
)
5440 decl
= error_mark_node
;
5441 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5442 &nonint_cst_expression_p
, false, true, false,
5443 false, &error_msg
, loc
);
5444 if (idk
== CP_ID_KIND_UNQUALIFIED
5445 && identifier_p (id
))
5447 vec
<tree
, va_gc
> *args
= NULL
;
5448 vec_safe_push (args
, build_reference_type (type
));
5449 id
= perform_koenig_lookup (id
, args
, tf_none
);
5452 else if (TREE_CODE (id
) == SCOPE_REF
)
5453 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5454 omp_reduction_id (ERROR_MARK
,
5455 TREE_OPERAND (id
, 1),
5460 if (fns
&& is_overloaded_fn (fns
))
5462 for (lkp_iterator
iter (get_fns (fns
)); iter
; ++iter
)
5464 tree fndecl
= *iter
;
5465 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5467 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5468 if (same_type_p (TREE_TYPE (argtype
), type
))
5476 if (id
&& BASELINK_P (fns
))
5485 if (!id
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5487 vec
<tree
> ambiguous
= vNULL
;
5488 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5490 if (ambiguousp
== NULL
)
5491 ambiguousp
= &ambiguous
;
5492 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5494 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5495 baselinkp
? baselinkp
: &baselink
,
5497 if (id
== NULL_TREE
)
5499 if (!ambiguousp
->is_empty ())
5500 ambiguousp
->safe_push (id
);
5501 else if (ret
!= NULL_TREE
)
5503 ambiguousp
->safe_push (ret
);
5504 ambiguousp
->safe_push (id
);
5510 if (ambiguousp
!= &ambiguous
)
5512 if (!ambiguous
.is_empty ())
5514 const char *str
= _("candidates are:");
5517 error_at (loc
, "user defined reduction lookup is ambiguous");
5518 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5520 inform (DECL_SOURCE_LOCATION (udr
), "%s %#qD", str
, udr
);
5522 str
= get_spaces (str
);
5524 ambiguous
.release ();
5525 ret
= error_mark_node
;
5526 baselink
= NULL_TREE
;
5531 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5532 id
, id
, tf_warning_or_error
);
5536 /* Helper function for cp_parser_omp_declare_reduction_exprs
5538 Remove CLEANUP_STMT for data (omp_priv variable).
5539 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5543 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5547 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5548 *tp
= CLEANUP_BODY (*tp
);
5549 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5551 tree decl
= DECL_EXPR_DECL (*tp
);
5552 if (!processing_template_decl
5553 && decl
== (tree
) data
5554 && DECL_INITIAL (decl
)
5555 && DECL_INITIAL (decl
) != error_mark_node
)
5557 tree list
= NULL_TREE
;
5558 append_to_statement_list_force (*tp
, &list
);
5559 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5560 decl
, DECL_INITIAL (decl
));
5561 DECL_INITIAL (decl
) = NULL_TREE
;
5562 append_to_statement_list_force (init_expr
, &list
);
5569 /* Data passed from cp_check_omp_declare_reduction to
5570 cp_check_omp_declare_reduction_r. */
5572 struct cp_check_omp_declare_reduction_data
5579 /* Helper function for cp_check_omp_declare_reduction, called via
5583 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5585 struct cp_check_omp_declare_reduction_data
*udr_data
5586 = (struct cp_check_omp_declare_reduction_data
*) data
;
5588 && !DECL_ARTIFICIAL (*tp
)
5589 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5590 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5592 location_t loc
= udr_data
->loc
;
5593 if (udr_data
->combiner_p
)
5594 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5595 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5598 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5599 "to variable %qD which is not %<omp_priv%> nor "
5607 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5610 cp_check_omp_declare_reduction (tree udr
)
5612 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5613 gcc_assert (TYPE_REF_P (type
));
5614 type
= TREE_TYPE (type
);
5616 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5618 if (type
== error_mark_node
)
5620 if (ARITHMETIC_TYPE_P (type
))
5622 static enum tree_code predef_codes
[]
5623 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5624 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5625 for (i
= 0; i
< 8; i
++)
5627 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5628 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5629 const char *n2
= IDENTIFIER_POINTER (id
);
5630 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5631 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5632 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5637 && TREE_CODE (type
) != COMPLEX_EXPR
)
5639 const char prefix_minmax
[] = "omp declare reduction m";
5640 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5641 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5642 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5643 prefix_minmax
, prefix_size
) == 0
5644 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5645 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5646 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5651 error_at (loc
, "predeclared arithmetic type %qT in "
5652 "%<#pragma omp declare reduction%>", type
);
5656 else if (FUNC_OR_METHOD_TYPE_P (type
)
5657 || TREE_CODE (type
) == ARRAY_TYPE
)
5659 error_at (loc
, "function or array type %qT in "
5660 "%<#pragma omp declare reduction%>", type
);
5663 else if (TYPE_REF_P (type
))
5665 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5669 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5671 error_at (loc
, "%<const%>, %<volatile%> or %<__restrict%>-qualified "
5672 "type %qT in %<#pragma omp declare reduction%>", type
);
5676 tree body
= DECL_SAVED_TREE (udr
);
5677 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5680 tree_stmt_iterator tsi
;
5681 struct cp_check_omp_declare_reduction_data data
;
5682 memset (data
.stmts
, 0, sizeof data
.stmts
);
5683 for (i
= 0, tsi
= tsi_start (body
);
5684 i
< 7 && !tsi_end_p (tsi
);
5685 i
++, tsi_next (&tsi
))
5686 data
.stmts
[i
] = tsi_stmt (tsi
);
5688 gcc_assert (tsi_end_p (tsi
));
5691 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5692 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5693 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5695 data
.combiner_p
= true;
5696 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5698 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5702 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5703 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5704 data
.combiner_p
= false;
5705 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5707 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5708 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5709 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5711 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5715 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5716 an inline call. But, remap
5717 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5718 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5721 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5722 tree decl
, tree placeholder
)
5725 hash_map
<tree
, tree
> decl_map
;
5727 decl_map
.put (omp_decl1
, placeholder
);
5728 decl_map
.put (omp_decl2
, decl
);
5729 memset (&id
, 0, sizeof (id
));
5730 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5731 id
.dst_fn
= current_function_decl
;
5732 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5733 id
.decl_map
= &decl_map
;
5735 id
.copy_decl
= copy_decl_no_change
;
5736 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5737 id
.transform_new_cfg
= true;
5738 id
.transform_return_to_modify
= false;
5739 id
.transform_lang_insert_block
= NULL
;
5741 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5745 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5746 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5749 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5751 if (*tp
== (tree
) data
)
5756 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5757 Return true if there is some error and the clause should be removed. */
5760 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5762 tree t
= OMP_CLAUSE_DECL (c
);
5763 bool predefined
= false;
5764 if (TREE_CODE (t
) == TREE_LIST
)
5766 gcc_assert (processing_template_decl
);
5769 tree type
= TREE_TYPE (t
);
5770 if (TREE_CODE (t
) == MEM_REF
)
5771 type
= TREE_TYPE (type
);
5772 if (TYPE_REF_P (type
))
5773 type
= TREE_TYPE (type
);
5774 if (TREE_CODE (type
) == ARRAY_TYPE
)
5777 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5778 while (TREE_CODE (type
) == ARRAY_TYPE
)
5779 type
= TREE_TYPE (type
);
5780 if (!processing_template_decl
)
5782 t
= require_complete_type (t
);
5783 if (t
== error_mark_node
)
5785 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5786 TYPE_SIZE_UNIT (type
));
5787 if (integer_zerop (size
))
5789 error_at (OMP_CLAUSE_LOCATION (c
),
5790 "%qE in %<reduction%> clause is a zero size array",
5791 omp_clause_printable_decl (t
));
5794 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5795 size
= save_expr (size
);
5796 tree index_type
= build_index_type (size
);
5797 tree atype
= build_array_type (type
, index_type
);
5798 tree ptype
= build_pointer_type (type
);
5799 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5800 t
= build_fold_addr_expr (t
);
5801 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5802 OMP_CLAUSE_DECL (c
) = t
;
5805 if (type
== error_mark_node
)
5807 else if (ARITHMETIC_TYPE_P (type
))
5808 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5817 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5824 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5828 case TRUTH_ANDIF_EXPR
:
5829 case TRUTH_ORIF_EXPR
:
5830 if (FLOAT_TYPE_P (type
))
5837 else if (TYPE_READONLY (type
))
5839 error_at (OMP_CLAUSE_LOCATION (c
),
5840 "%qE has const type for %<reduction%>",
5841 omp_clause_printable_decl (t
));
5844 else if (!processing_template_decl
)
5846 t
= require_complete_type (t
);
5847 if (t
== error_mark_node
)
5849 OMP_CLAUSE_DECL (c
) = t
;
5854 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5857 else if (processing_template_decl
)
5859 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) == error_mark_node
)
5864 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5866 type
= TYPE_MAIN_VARIANT (type
);
5867 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5868 if (id
== NULL_TREE
)
5869 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5870 NULL_TREE
, NULL_TREE
);
5871 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5874 if (id
== error_mark_node
)
5877 tree body
= DECL_SAVED_TREE (id
);
5880 if (TREE_CODE (body
) == STATEMENT_LIST
)
5882 tree_stmt_iterator tsi
;
5883 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5886 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5887 atype
= TREE_TYPE (atype
);
5888 bool need_static_cast
= !same_type_p (type
, atype
);
5889 memset (stmts
, 0, sizeof stmts
);
5890 for (i
= 0, tsi
= tsi_start (body
);
5891 i
< 7 && !tsi_end_p (tsi
);
5892 i
++, tsi_next (&tsi
))
5893 stmts
[i
] = tsi_stmt (tsi
);
5894 gcc_assert (tsi_end_p (tsi
));
5898 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5899 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5900 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5901 DECL_ARTIFICIAL (placeholder
) = 1;
5902 DECL_IGNORED_P (placeholder
) = 1;
5903 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5904 if (TREE_CODE (t
) == MEM_REF
)
5906 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5908 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5909 DECL_IGNORED_P (decl_placeholder
) = 1;
5910 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5912 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5913 cxx_mark_addressable (placeholder
);
5914 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5915 && (decl_placeholder
5916 || !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
)))))
5917 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5918 : OMP_CLAUSE_DECL (c
));
5919 tree omp_out
= placeholder
;
5920 tree omp_in
= decl_placeholder
? decl_placeholder
5921 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5922 if (need_static_cast
)
5924 tree rtype
= build_reference_type (atype
);
5925 omp_out
= build_static_cast (rtype
, omp_out
,
5926 tf_warning_or_error
);
5927 omp_in
= build_static_cast (rtype
, omp_in
,
5928 tf_warning_or_error
);
5929 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5931 omp_out
= convert_from_reference (omp_out
);
5932 omp_in
= convert_from_reference (omp_in
);
5934 OMP_CLAUSE_REDUCTION_MERGE (c
)
5935 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5936 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5940 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5941 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5942 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3]))
5943 && (decl_placeholder
5944 || !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
)))))
5945 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5946 : OMP_CLAUSE_DECL (c
));
5947 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5948 cxx_mark_addressable (placeholder
);
5949 tree omp_priv
= decl_placeholder
? decl_placeholder
5950 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5951 tree omp_orig
= placeholder
;
5952 if (need_static_cast
)
5956 error_at (OMP_CLAUSE_LOCATION (c
),
5957 "user defined reduction with constructor "
5958 "initializer for base class %qT", atype
);
5961 tree rtype
= build_reference_type (atype
);
5962 omp_priv
= build_static_cast (rtype
, omp_priv
,
5963 tf_warning_or_error
);
5964 omp_orig
= build_static_cast (rtype
, omp_orig
,
5965 tf_warning_or_error
);
5966 if (omp_priv
== error_mark_node
5967 || omp_orig
== error_mark_node
)
5969 omp_priv
= convert_from_reference (omp_priv
);
5970 omp_orig
= convert_from_reference (omp_orig
);
5973 *need_default_ctor
= true;
5974 OMP_CLAUSE_REDUCTION_INIT (c
)
5975 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5976 DECL_EXPR_DECL (stmts
[3]),
5977 omp_priv
, omp_orig
);
5978 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5979 find_omp_placeholder_r
, placeholder
, NULL
))
5980 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5984 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5985 *need_default_ctor
= true;
5989 tree v
= decl_placeholder
? decl_placeholder
5990 : convert_from_reference (t
);
5991 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5992 init
= build_constructor (TREE_TYPE (v
), NULL
);
5994 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5995 OMP_CLAUSE_REDUCTION_INIT (c
)
5996 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
6001 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
6005 error_at (OMP_CLAUSE_LOCATION (c
),
6006 "user defined reduction not found for %qE",
6007 omp_clause_printable_decl (t
));
6010 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
6011 gcc_assert (TYPE_SIZE_UNIT (type
)
6012 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
6016 /* Called from finish_struct_1. linear(this) or linear(this:step)
6017 clauses might not be finalized yet because the class has been incomplete
6018 when parsing #pragma omp declare simd methods. Fix those up now. */
6021 finish_omp_declare_simd_methods (tree t
)
6023 if (processing_template_decl
)
6026 for (tree x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6028 if (TREE_CODE (x
) == USING_DECL
6029 || !DECL_NONSTATIC_MEMBER_FUNCTION_P (x
))
6031 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
6032 if (!ods
|| !TREE_VALUE (ods
))
6034 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
6035 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
6036 && integer_zerop (OMP_CLAUSE_DECL (c
))
6037 && OMP_CLAUSE_LINEAR_STEP (c
)
6038 && TYPE_PTR_P (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
))))
6040 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
6041 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
6042 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
6043 sizetype
, s
, TYPE_SIZE_UNIT (t
));
6044 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
6049 /* Adjust sink depend clause to take into account pointer offsets.
6051 Return TRUE if there was a problem processing the offset, and the
6052 whole clause should be removed. */
6055 cp_finish_omp_clause_depend_sink (tree sink_clause
)
6057 tree t
= OMP_CLAUSE_DECL (sink_clause
);
6058 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
6060 /* Make sure we don't adjust things twice for templates. */
6061 if (processing_template_decl
)
6064 for (; t
; t
= TREE_CHAIN (t
))
6066 tree decl
= TREE_VALUE (t
);
6067 if (TYPE_PTR_P (TREE_TYPE (decl
)))
6069 tree offset
= TREE_PURPOSE (t
);
6070 bool neg
= wi::neg_p (wi::to_wide (offset
));
6071 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
6072 decl
= mark_rvalue_use (decl
);
6073 decl
= convert_from_reference (decl
);
6074 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
6075 neg
? MINUS_EXPR
: PLUS_EXPR
,
6077 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
6078 MINUS_EXPR
, sizetype
,
6079 fold_convert (sizetype
, t2
),
6080 fold_convert (sizetype
, decl
));
6081 if (t2
== error_mark_node
)
6083 TREE_PURPOSE (t
) = t2
;
6089 /* Finish OpenMP iterators ITER. Return true if they are errorneous
6090 and clauses containing them should be removed. */
6093 cp_omp_finish_iterators (tree iter
)
6096 for (tree it
= iter
; it
; it
= TREE_CHAIN (it
))
6098 tree var
= TREE_VEC_ELT (it
, 0);
6099 tree begin
= TREE_VEC_ELT (it
, 1);
6100 tree end
= TREE_VEC_ELT (it
, 2);
6101 tree step
= TREE_VEC_ELT (it
, 3);
6103 tree type
= TREE_TYPE (var
);
6104 location_t loc
= DECL_SOURCE_LOCATION (var
);
6105 if (type
== error_mark_node
)
6110 if (type_dependent_expression_p (var
))
6112 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6114 error_at (loc
, "iterator %qD has neither integral nor pointer type",
6119 else if (TYPE_READONLY (type
))
6121 error_at (loc
, "iterator %qD has const qualified type", var
);
6125 if (type_dependent_expression_p (begin
)
6126 || type_dependent_expression_p (end
)
6127 || type_dependent_expression_p (step
))
6129 else if (error_operand_p (step
))
6134 else if (!INTEGRAL_TYPE_P (TREE_TYPE (step
)))
6136 error_at (EXPR_LOC_OR_LOC (step
, loc
),
6137 "iterator step with non-integral type");
6142 begin
= mark_rvalue_use (begin
);
6143 end
= mark_rvalue_use (end
);
6144 step
= mark_rvalue_use (step
);
6145 begin
= cp_build_c_cast (type
, begin
, tf_warning_or_error
);
6146 end
= cp_build_c_cast (type
, end
, tf_warning_or_error
);
6148 if (!processing_template_decl
)
6149 step
= orig_step
= save_expr (step
);
6150 tree stype
= POINTER_TYPE_P (type
) ? sizetype
: type
;
6151 step
= cp_build_c_cast (stype
, step
, tf_warning_or_error
);
6152 if (POINTER_TYPE_P (type
) && !processing_template_decl
)
6154 begin
= save_expr (begin
);
6155 step
= pointer_int_sum (loc
, PLUS_EXPR
, begin
, step
);
6156 step
= fold_build2_loc (loc
, MINUS_EXPR
, sizetype
,
6157 fold_convert (sizetype
, step
),
6158 fold_convert (sizetype
, begin
));
6159 step
= fold_convert (ssizetype
, step
);
6161 if (!processing_template_decl
)
6163 begin
= maybe_constant_value (begin
);
6164 end
= maybe_constant_value (end
);
6165 step
= maybe_constant_value (step
);
6166 orig_step
= maybe_constant_value (orig_step
);
6168 if (integer_zerop (step
))
6170 error_at (loc
, "iterator %qD has zero step", var
);
6175 if (begin
== error_mark_node
6176 || end
== error_mark_node
6177 || step
== error_mark_node
6178 || orig_step
== error_mark_node
)
6184 if (!processing_template_decl
)
6186 begin
= fold_build_cleanup_point_expr (TREE_TYPE (begin
), begin
);
6187 end
= fold_build_cleanup_point_expr (TREE_TYPE (end
), end
);
6188 step
= fold_build_cleanup_point_expr (TREE_TYPE (step
), step
);
6189 orig_step
= fold_build_cleanup_point_expr (TREE_TYPE (orig_step
),
6192 hash_set
<tree
> pset
;
6194 for (it2
= TREE_CHAIN (it
); it2
; it2
= TREE_CHAIN (it2
))
6196 tree var2
= TREE_VEC_ELT (it2
, 0);
6197 tree begin2
= TREE_VEC_ELT (it2
, 1);
6198 tree end2
= TREE_VEC_ELT (it2
, 2);
6199 tree step2
= TREE_VEC_ELT (it2
, 3);
6200 location_t loc2
= DECL_SOURCE_LOCATION (var2
);
6201 if (cp_walk_tree (&begin2
, find_omp_placeholder_r
, var
, &pset
))
6203 error_at (EXPR_LOC_OR_LOC (begin2
, loc2
),
6204 "begin expression refers to outer iterator %qD", var
);
6207 else if (cp_walk_tree (&end2
, find_omp_placeholder_r
, var
, &pset
))
6209 error_at (EXPR_LOC_OR_LOC (end2
, loc2
),
6210 "end expression refers to outer iterator %qD", var
);
6213 else if (cp_walk_tree (&step2
, find_omp_placeholder_r
, var
, &pset
))
6215 error_at (EXPR_LOC_OR_LOC (step2
, loc2
),
6216 "step expression refers to outer iterator %qD", var
);
6225 TREE_VEC_ELT (it
, 1) = begin
;
6226 TREE_VEC_ELT (it
, 2) = end
;
6227 if (processing_template_decl
)
6228 TREE_VEC_ELT (it
, 3) = orig_step
;
6231 TREE_VEC_ELT (it
, 3) = step
;
6232 TREE_VEC_ELT (it
, 4) = orig_step
;
6238 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
6239 Remove any elements from the list that are invalid. */
6242 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
6244 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
6245 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
6247 tree safelen
= NULL_TREE
;
6248 bool branch_seen
= false;
6249 bool copyprivate_seen
= false;
6250 bool ordered_seen
= false;
6251 bool order_seen
= false;
6252 bool schedule_seen
= false;
6253 bool oacc_async
= false;
6254 tree last_iterators
= NULL_TREE
;
6255 bool last_iterators_remove
= false;
6256 /* 1 if normal/task reduction has been seen, -1 if inscan reduction
6257 has been seen, -2 if mixed inscan/normal reduction diagnosed. */
6258 int reduction_seen
= 0;
6260 bitmap_obstack_initialize (NULL
);
6261 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
6262 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
6263 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
6264 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
6265 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
6266 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
6267 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
6268 /* If ort == C_ORT_OMP used as nontemporal_head or use_device_xxx_head
6270 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
6272 if (ort
& C_ORT_ACC
)
6273 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
6274 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
6280 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
6282 bool remove
= false;
6283 bool field_ok
= false;
6285 switch (OMP_CLAUSE_CODE (c
))
6287 case OMP_CLAUSE_SHARED
:
6288 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6289 goto check_dup_generic
;
6290 case OMP_CLAUSE_PRIVATE
:
6291 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6292 goto check_dup_generic
;
6293 case OMP_CLAUSE_REDUCTION
:
6294 if (reduction_seen
== 0)
6295 reduction_seen
= OMP_CLAUSE_REDUCTION_INSCAN (c
) ? -1 : 1;
6296 else if (reduction_seen
!= -2
6297 && reduction_seen
!= (OMP_CLAUSE_REDUCTION_INSCAN (c
)
6300 error_at (OMP_CLAUSE_LOCATION (c
),
6301 "%<inscan%> and non-%<inscan%> %<reduction%> clauses "
6302 "on the same construct");
6303 reduction_seen
= -2;
6306 case OMP_CLAUSE_IN_REDUCTION
:
6307 case OMP_CLAUSE_TASK_REDUCTION
:
6308 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6309 t
= OMP_CLAUSE_DECL (c
);
6310 if (TREE_CODE (t
) == TREE_LIST
)
6312 if (handle_omp_array_sections (c
, ort
))
6317 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
6318 && OMP_CLAUSE_REDUCTION_INSCAN (c
))
6320 error_at (OMP_CLAUSE_LOCATION (c
),
6321 "%<inscan%> %<reduction%> clause with array "
6326 if (TREE_CODE (t
) == TREE_LIST
)
6328 while (TREE_CODE (t
) == TREE_LIST
)
6333 gcc_assert (TREE_CODE (t
) == MEM_REF
);
6334 t
= TREE_OPERAND (t
, 0);
6335 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
6336 t
= TREE_OPERAND (t
, 0);
6337 if (TREE_CODE (t
) == ADDR_EXPR
6338 || INDIRECT_REF_P (t
))
6339 t
= TREE_OPERAND (t
, 0);
6341 tree n
= omp_clause_decl_field (t
);
6344 goto check_dup_generic_t
;
6347 cxx_mark_addressable (t
);
6348 goto check_dup_generic
;
6349 case OMP_CLAUSE_COPYPRIVATE
:
6350 copyprivate_seen
= true;
6351 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6352 goto check_dup_generic
;
6353 case OMP_CLAUSE_COPYIN
:
6354 goto check_dup_generic
;
6355 case OMP_CLAUSE_LINEAR
:
6356 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6357 t
= OMP_CLAUSE_DECL (c
);
6358 if (ort
!= C_ORT_OMP_DECLARE_SIMD
6359 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
6361 error_at (OMP_CLAUSE_LOCATION (c
),
6362 "modifier should not be specified in %<linear%> "
6363 "clause on %<simd%> or %<for%> constructs");
6364 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
6366 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6367 && !type_dependent_expression_p (t
))
6369 tree type
= TREE_TYPE (t
);
6370 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
6371 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
6372 && !TYPE_REF_P (type
))
6374 error_at (OMP_CLAUSE_LOCATION (c
),
6375 "linear clause with %qs modifier applied to "
6376 "non-reference variable with %qT type",
6377 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
6378 ? "ref" : "uval", TREE_TYPE (t
));
6382 if (TYPE_REF_P (type
))
6383 type
= TREE_TYPE (type
);
6384 if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
6386 if (!INTEGRAL_TYPE_P (type
)
6387 && !TYPE_PTR_P (type
))
6389 error_at (OMP_CLAUSE_LOCATION (c
),
6390 "linear clause applied to non-integral "
6391 "non-pointer variable with %qT type",
6398 t
= OMP_CLAUSE_LINEAR_STEP (c
);
6400 t
= integer_one_node
;
6401 if (t
== error_mark_node
)
6406 else if (!type_dependent_expression_p (t
)
6407 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
6408 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6409 || TREE_CODE (t
) != PARM_DECL
6410 || !TYPE_REF_P (TREE_TYPE (t
))
6411 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
6413 error_at (OMP_CLAUSE_LOCATION (c
),
6414 "linear step expression must be integral");
6420 t
= mark_rvalue_use (t
);
6421 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
6423 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
6424 goto check_dup_generic
;
6426 if (!processing_template_decl
6427 && (VAR_P (OMP_CLAUSE_DECL (c
))
6428 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
6430 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
6432 t
= maybe_constant_value (t
);
6433 if (TREE_CODE (t
) != INTEGER_CST
)
6435 error_at (OMP_CLAUSE_LOCATION (c
),
6436 "%<linear%> clause step %qE is neither "
6437 "constant nor a parameter", t
);
6442 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6443 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
6444 if (TYPE_REF_P (type
))
6445 type
= TREE_TYPE (type
);
6446 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
6448 type
= build_pointer_type (type
);
6449 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
6450 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6452 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6453 MINUS_EXPR
, sizetype
,
6454 fold_convert (sizetype
, t
),
6455 fold_convert (sizetype
, d
));
6456 if (t
== error_mark_node
)
6462 else if (TYPE_PTR_P (type
)
6463 /* Can't multiply the step yet if *this
6464 is still incomplete type. */
6465 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6466 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6467 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6468 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6470 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6472 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6473 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6475 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6476 MINUS_EXPR
, sizetype
,
6477 fold_convert (sizetype
, t
),
6478 fold_convert (sizetype
, d
));
6479 if (t
== error_mark_node
)
6486 t
= fold_convert (type
, t
);
6488 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6490 goto check_dup_generic
;
6492 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6495 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6496 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6499 t
= OMP_CLAUSE_DECL (c
);
6500 check_dup_generic_t
:
6501 if (t
== current_class_ptr
6502 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6503 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6504 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6506 error_at (OMP_CLAUSE_LOCATION (c
),
6507 "%<this%> allowed in OpenMP only in %<declare simd%>"
6512 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6513 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6515 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6518 error_at (OMP_CLAUSE_LOCATION (c
),
6519 "%qD is not a variable in clause %qs", t
,
6520 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6522 error_at (OMP_CLAUSE_LOCATION (c
),
6523 "%qE is not a variable in clause %qs", t
,
6524 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6527 else if ((ort
== C_ORT_ACC
6528 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6529 || (ort
== C_ORT_OMP
6530 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_USE_DEVICE_PTR
6531 || (OMP_CLAUSE_CODE (c
)
6532 == OMP_CLAUSE_USE_DEVICE_ADDR
))))
6534 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6536 error_at (OMP_CLAUSE_LOCATION (c
),
6538 ? "%qD appears more than once in reduction clauses"
6539 : "%qD appears more than once in data clauses",
6544 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6546 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6547 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6548 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6550 error_at (OMP_CLAUSE_LOCATION (c
),
6551 "%qD appears more than once in data clauses", t
);
6554 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6555 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6557 if (ort
== C_ORT_ACC
)
6558 error_at (OMP_CLAUSE_LOCATION (c
),
6559 "%qD appears more than once in data clauses", t
);
6561 error_at (OMP_CLAUSE_LOCATION (c
),
6562 "%qD appears both in data and map clauses", t
);
6566 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6571 && TREE_CODE (t
) == FIELD_DECL
6572 && t
== OMP_CLAUSE_DECL (c
)
6573 && ort
!= C_ORT_ACC
)
6576 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6577 == OMP_CLAUSE_SHARED
));
6578 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6583 case OMP_CLAUSE_FIRSTPRIVATE
:
6584 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6586 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6588 t
= OMP_CLAUSE_DECL (c
);
6589 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6591 error_at (OMP_CLAUSE_LOCATION (c
),
6592 "%<this%> allowed in OpenMP only in %<declare simd%>"
6597 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6598 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6599 || TREE_CODE (t
) != FIELD_DECL
))
6601 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6604 error_at (OMP_CLAUSE_LOCATION (c
),
6605 "%qD is not a variable in clause %<firstprivate%>",
6608 error_at (OMP_CLAUSE_LOCATION (c
),
6609 "%qE is not a variable in clause %<firstprivate%>",
6613 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6614 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6616 error_at (OMP_CLAUSE_LOCATION (c
),
6617 "%qD appears more than once in data clauses", t
);
6620 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6622 if (ort
== C_ORT_ACC
)
6623 error_at (OMP_CLAUSE_LOCATION (c
),
6624 "%qD appears more than once in data clauses", t
);
6626 error_at (OMP_CLAUSE_LOCATION (c
),
6627 "%qD appears both in data and map clauses", t
);
6631 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6632 goto handle_field_decl
;
6634 case OMP_CLAUSE_LASTPRIVATE
:
6635 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6637 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6639 t
= OMP_CLAUSE_DECL (c
);
6640 if (t
== current_class_ptr
)
6642 error_at (OMP_CLAUSE_LOCATION (c
),
6643 "%<this%> allowed in OpenMP only in %<declare simd%>"
6648 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6649 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6650 || TREE_CODE (t
) != FIELD_DECL
))
6652 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6655 error_at (OMP_CLAUSE_LOCATION (c
),
6656 "%qD is not a variable in clause %<lastprivate%>",
6659 error_at (OMP_CLAUSE_LOCATION (c
),
6660 "%qE is not a variable in clause %<lastprivate%>",
6664 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6665 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6667 error_at (OMP_CLAUSE_LOCATION (c
),
6668 "%qD appears more than once in data clauses", t
);
6672 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6673 goto handle_field_decl
;
6676 t
= OMP_CLAUSE_IF_EXPR (c
);
6677 t
= maybe_convert_cond (t
);
6678 if (t
== error_mark_node
)
6680 else if (!processing_template_decl
)
6681 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6682 OMP_CLAUSE_IF_EXPR (c
) = t
;
6685 case OMP_CLAUSE_FINAL
:
6686 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6687 t
= maybe_convert_cond (t
);
6688 if (t
== error_mark_node
)
6690 else if (!processing_template_decl
)
6691 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6692 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6695 case OMP_CLAUSE_GANG
:
6696 /* Operand 1 is the gang static: argument. */
6697 t
= OMP_CLAUSE_OPERAND (c
, 1);
6700 if (t
== error_mark_node
)
6702 else if (!type_dependent_expression_p (t
)
6703 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6705 error_at (OMP_CLAUSE_LOCATION (c
),
6706 "%<gang%> static expression must be integral");
6711 t
= mark_rvalue_use (t
);
6712 if (!processing_template_decl
)
6714 t
= maybe_constant_value (t
);
6715 if (TREE_CODE (t
) == INTEGER_CST
6716 && tree_int_cst_sgn (t
) != 1
6717 && t
!= integer_minus_one_node
)
6719 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6720 "%<gang%> static value must be "
6722 t
= integer_one_node
;
6724 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6727 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6729 /* Check operand 0, the num argument. */
6732 case OMP_CLAUSE_WORKER
:
6733 case OMP_CLAUSE_VECTOR
:
6734 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6738 case OMP_CLAUSE_NUM_TASKS
:
6739 case OMP_CLAUSE_NUM_TEAMS
:
6740 case OMP_CLAUSE_NUM_THREADS
:
6741 case OMP_CLAUSE_NUM_GANGS
:
6742 case OMP_CLAUSE_NUM_WORKERS
:
6743 case OMP_CLAUSE_VECTOR_LENGTH
:
6744 t
= OMP_CLAUSE_OPERAND (c
, 0);
6745 if (t
== error_mark_node
)
6747 else if (!type_dependent_expression_p (t
)
6748 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6750 switch (OMP_CLAUSE_CODE (c
))
6752 case OMP_CLAUSE_GANG
:
6753 error_at (OMP_CLAUSE_LOCATION (c
),
6754 "%<gang%> num expression must be integral"); break;
6755 case OMP_CLAUSE_VECTOR
:
6756 error_at (OMP_CLAUSE_LOCATION (c
),
6757 "%<vector%> length expression must be integral");
6759 case OMP_CLAUSE_WORKER
:
6760 error_at (OMP_CLAUSE_LOCATION (c
),
6761 "%<worker%> num expression must be integral");
6764 error_at (OMP_CLAUSE_LOCATION (c
),
6765 "%qs expression must be integral",
6766 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6772 t
= mark_rvalue_use (t
);
6773 if (!processing_template_decl
)
6775 t
= maybe_constant_value (t
);
6776 if (TREE_CODE (t
) == INTEGER_CST
6777 && tree_int_cst_sgn (t
) != 1)
6779 switch (OMP_CLAUSE_CODE (c
))
6781 case OMP_CLAUSE_GANG
:
6782 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6783 "%<gang%> num value must be positive");
6785 case OMP_CLAUSE_VECTOR
:
6786 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6787 "%<vector%> length value must be "
6790 case OMP_CLAUSE_WORKER
:
6791 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6792 "%<worker%> num value must be "
6796 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6797 "%qs value must be positive",
6798 omp_clause_code_name
6799 [OMP_CLAUSE_CODE (c
)]);
6801 t
= integer_one_node
;
6803 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6805 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6809 case OMP_CLAUSE_SCHEDULE
:
6810 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6813 else if (t
== error_mark_node
)
6815 else if (!type_dependent_expression_p (t
)
6816 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6818 error_at (OMP_CLAUSE_LOCATION (c
),
6819 "schedule chunk size expression must be integral");
6824 t
= mark_rvalue_use (t
);
6825 if (!processing_template_decl
)
6827 t
= maybe_constant_value (t
);
6828 if (TREE_CODE (t
) == INTEGER_CST
6829 && tree_int_cst_sgn (t
) != 1)
6831 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6832 "chunk size value must be positive");
6833 t
= integer_one_node
;
6835 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6837 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6840 schedule_seen
= true;
6843 case OMP_CLAUSE_SIMDLEN
:
6844 case OMP_CLAUSE_SAFELEN
:
6845 t
= OMP_CLAUSE_OPERAND (c
, 0);
6846 if (t
== error_mark_node
)
6848 else if (!type_dependent_expression_p (t
)
6849 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6851 error_at (OMP_CLAUSE_LOCATION (c
),
6852 "%qs length expression must be integral",
6853 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6858 t
= mark_rvalue_use (t
);
6859 if (!processing_template_decl
)
6861 t
= maybe_constant_value (t
);
6862 if (TREE_CODE (t
) != INTEGER_CST
6863 || tree_int_cst_sgn (t
) != 1)
6865 error_at (OMP_CLAUSE_LOCATION (c
),
6866 "%qs length expression must be positive "
6867 "constant integer expression",
6868 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6872 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6873 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6878 case OMP_CLAUSE_ASYNC
:
6879 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6880 if (t
== error_mark_node
)
6882 else if (!type_dependent_expression_p (t
)
6883 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6885 error_at (OMP_CLAUSE_LOCATION (c
),
6886 "%<async%> expression must be integral");
6891 t
= mark_rvalue_use (t
);
6892 if (!processing_template_decl
)
6893 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6894 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6898 case OMP_CLAUSE_WAIT
:
6899 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6900 if (t
== error_mark_node
)
6902 else if (!processing_template_decl
)
6903 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6904 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6907 case OMP_CLAUSE_THREAD_LIMIT
:
6908 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6909 if (t
== error_mark_node
)
6911 else if (!type_dependent_expression_p (t
)
6912 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6914 error_at (OMP_CLAUSE_LOCATION (c
),
6915 "%<thread_limit%> expression must be integral");
6920 t
= mark_rvalue_use (t
);
6921 if (!processing_template_decl
)
6923 t
= maybe_constant_value (t
);
6924 if (TREE_CODE (t
) == INTEGER_CST
6925 && tree_int_cst_sgn (t
) != 1)
6927 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6928 "%<thread_limit%> value must be positive");
6929 t
= integer_one_node
;
6931 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6933 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6937 case OMP_CLAUSE_DEVICE
:
6938 t
= OMP_CLAUSE_DEVICE_ID (c
);
6939 if (t
== error_mark_node
)
6941 else if (!type_dependent_expression_p (t
)
6942 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6944 error_at (OMP_CLAUSE_LOCATION (c
),
6945 "%<device%> id must be integral");
6950 t
= mark_rvalue_use (t
);
6951 if (!processing_template_decl
)
6952 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6953 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6957 case OMP_CLAUSE_DIST_SCHEDULE
:
6958 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6961 else if (t
== error_mark_node
)
6963 else if (!type_dependent_expression_p (t
)
6964 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6966 error_at (OMP_CLAUSE_LOCATION (c
),
6967 "%<dist_schedule%> chunk size expression must be "
6973 t
= mark_rvalue_use (t
);
6974 if (!processing_template_decl
)
6975 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6976 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6980 case OMP_CLAUSE_ALIGNED
:
6981 t
= OMP_CLAUSE_DECL (c
);
6982 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6984 error_at (OMP_CLAUSE_LOCATION (c
),
6985 "%<this%> allowed in OpenMP only in %<declare simd%>"
6990 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6992 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6995 error_at (OMP_CLAUSE_LOCATION (c
),
6996 "%qD is not a variable in %<aligned%> clause", t
);
6998 error_at (OMP_CLAUSE_LOCATION (c
),
6999 "%qE is not a variable in %<aligned%> clause", t
);
7002 else if (!type_dependent_expression_p (t
)
7003 && !TYPE_PTR_P (TREE_TYPE (t
))
7004 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
7005 && (!TYPE_REF_P (TREE_TYPE (t
))
7006 || (!INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
7007 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
7010 error_at (OMP_CLAUSE_LOCATION (c
),
7011 "%qE in %<aligned%> clause is neither a pointer nor "
7012 "an array nor a reference to pointer or array", t
);
7015 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
7017 error_at (OMP_CLAUSE_LOCATION (c
),
7018 "%qD appears more than once in %<aligned%> clauses",
7023 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
7024 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
7025 if (t
== error_mark_node
)
7027 else if (t
== NULL_TREE
)
7029 else if (!type_dependent_expression_p (t
)
7030 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7032 error_at (OMP_CLAUSE_LOCATION (c
),
7033 "%<aligned%> clause alignment expression must "
7039 t
= mark_rvalue_use (t
);
7040 if (!processing_template_decl
)
7042 t
= maybe_constant_value (t
);
7043 if (TREE_CODE (t
) != INTEGER_CST
7044 || tree_int_cst_sgn (t
) != 1)
7046 error_at (OMP_CLAUSE_LOCATION (c
),
7047 "%<aligned%> clause alignment expression must "
7048 "be positive constant integer expression");
7052 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7054 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
7058 case OMP_CLAUSE_NONTEMPORAL
:
7059 t
= OMP_CLAUSE_DECL (c
);
7060 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7062 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7065 error_at (OMP_CLAUSE_LOCATION (c
),
7066 "%qD is not a variable in %<nontemporal%> clause",
7069 error_at (OMP_CLAUSE_LOCATION (c
),
7070 "%qE is not a variable in %<nontemporal%> clause",
7074 else if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
7076 error_at (OMP_CLAUSE_LOCATION (c
),
7077 "%qD appears more than once in %<nontemporal%> "
7082 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
7085 case OMP_CLAUSE_DEPEND
:
7086 t
= OMP_CLAUSE_DECL (c
);
7089 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
7090 == OMP_CLAUSE_DEPEND_SOURCE
);
7093 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
7095 if (cp_finish_omp_clause_depend_sink (c
))
7099 if (TREE_CODE (t
) == TREE_LIST
7101 && TREE_CODE (TREE_PURPOSE (t
)) == TREE_VEC
)
7103 if (TREE_PURPOSE (t
) != last_iterators
)
7104 last_iterators_remove
7105 = cp_omp_finish_iterators (TREE_PURPOSE (t
));
7106 last_iterators
= TREE_PURPOSE (t
);
7108 if (last_iterators_remove
)
7109 t
= error_mark_node
;
7112 last_iterators
= NULL_TREE
;
7114 if (TREE_CODE (t
) == TREE_LIST
)
7116 if (handle_omp_array_sections (c
, ort
))
7118 else if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_DEPOBJ
)
7120 error_at (OMP_CLAUSE_LOCATION (c
),
7121 "%<depend%> clause with %<depobj%> dependence "
7122 "type on array section");
7127 if (t
== error_mark_node
)
7129 else if (t
== current_class_ptr
)
7131 error_at (OMP_CLAUSE_LOCATION (c
),
7132 "%<this%> allowed in OpenMP only in %<declare simd%>"
7136 else if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7138 else if (!lvalue_p (t
))
7141 error_at (OMP_CLAUSE_LOCATION (c
),
7142 "%qD is not lvalue expression nor array section "
7143 "in %<depend%> clause", t
);
7145 error_at (OMP_CLAUSE_LOCATION (c
),
7146 "%qE is not lvalue expression nor array section "
7147 "in %<depend%> clause", t
);
7150 else if (TREE_CODE (t
) == COMPONENT_REF
7151 && TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
7152 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
7154 error_at (OMP_CLAUSE_LOCATION (c
),
7155 "bit-field %qE in %qs clause", t
, "depend");
7158 else if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_DEPOBJ
)
7160 if (!c_omp_depend_t_p (TYPE_REF_P (TREE_TYPE (t
))
7161 ? TREE_TYPE (TREE_TYPE (t
))
7164 error_at (OMP_CLAUSE_LOCATION (c
),
7165 "%qE does not have %<omp_depend_t%> type in "
7166 "%<depend%> clause with %<depobj%> dependence "
7171 else if (c_omp_depend_t_p (TYPE_REF_P (TREE_TYPE (t
))
7172 ? TREE_TYPE (TREE_TYPE (t
))
7175 error_at (OMP_CLAUSE_LOCATION (c
),
7176 "%qE should not have %<omp_depend_t%> type in "
7177 "%<depend%> clause with dependence type other than "
7183 tree addr
= cp_build_addr_expr (t
, tf_warning_or_error
);
7184 if (addr
== error_mark_node
)
7188 t
= cp_build_indirect_ref (addr
, RO_UNARY_STAR
,
7189 tf_warning_or_error
);
7190 if (t
== error_mark_node
)
7192 else if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == TREE_LIST
7193 && TREE_PURPOSE (OMP_CLAUSE_DECL (c
))
7194 && (TREE_CODE (TREE_PURPOSE (OMP_CLAUSE_DECL (c
)))
7196 TREE_VALUE (OMP_CLAUSE_DECL (c
)) = t
;
7198 OMP_CLAUSE_DECL (c
) = t
;
7203 case OMP_CLAUSE_MAP
:
7205 case OMP_CLAUSE_FROM
:
7206 case OMP_CLAUSE__CACHE_
:
7207 t
= OMP_CLAUSE_DECL (c
);
7208 if (TREE_CODE (t
) == TREE_LIST
)
7210 if (handle_omp_array_sections (c
, ort
))
7214 t
= OMP_CLAUSE_DECL (c
);
7215 if (TREE_CODE (t
) != TREE_LIST
7216 && !type_dependent_expression_p (t
)
7217 && !cp_omp_mappable_type (TREE_TYPE (t
)))
7219 error_at (OMP_CLAUSE_LOCATION (c
),
7220 "array section does not have mappable type "
7222 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7223 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7226 while (TREE_CODE (t
) == ARRAY_REF
)
7227 t
= TREE_OPERAND (t
, 0);
7228 if (TREE_CODE (t
) == COMPONENT_REF
7229 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
7231 while (TREE_CODE (t
) == COMPONENT_REF
)
7232 t
= TREE_OPERAND (t
, 0);
7233 if (REFERENCE_REF_P (t
))
7234 t
= TREE_OPERAND (t
, 0);
7235 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
7237 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7239 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7240 error_at (OMP_CLAUSE_LOCATION (c
),
7241 "%qD appears more than once in motion"
7243 else if (ort
== C_ORT_ACC
)
7244 error_at (OMP_CLAUSE_LOCATION (c
),
7245 "%qD appears more than once in data"
7248 error_at (OMP_CLAUSE_LOCATION (c
),
7249 "%qD appears more than once in map"
7255 bitmap_set_bit (&map_head
, DECL_UID (t
));
7256 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
7262 if (t
== error_mark_node
)
7267 if (REFERENCE_REF_P (t
)
7268 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
7270 t
= TREE_OPERAND (t
, 0);
7271 OMP_CLAUSE_DECL (c
) = t
;
7273 if (TREE_CODE (t
) == COMPONENT_REF
7274 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
7275 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
7277 if (type_dependent_expression_p (t
))
7279 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
7280 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
7282 error_at (OMP_CLAUSE_LOCATION (c
),
7283 "bit-field %qE in %qs clause",
7284 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7287 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
7289 error_at (OMP_CLAUSE_LOCATION (c
),
7290 "%qE does not have a mappable type in %qs clause",
7291 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7292 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7295 while (TREE_CODE (t
) == COMPONENT_REF
)
7297 if (TREE_TYPE (TREE_OPERAND (t
, 0))
7298 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
7301 error_at (OMP_CLAUSE_LOCATION (c
),
7302 "%qE is a member of a union", t
);
7306 t
= TREE_OPERAND (t
, 0);
7310 if (REFERENCE_REF_P (t
))
7311 t
= TREE_OPERAND (t
, 0);
7312 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
7314 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
7315 goto handle_map_references
;
7318 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7320 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7322 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7323 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
7324 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
7327 error_at (OMP_CLAUSE_LOCATION (c
),
7328 "%qD is not a variable in %qs clause", t
,
7329 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7331 error_at (OMP_CLAUSE_LOCATION (c
),
7332 "%qE is not a variable in %qs clause", t
,
7333 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7336 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7338 error_at (OMP_CLAUSE_LOCATION (c
),
7339 "%qD is threadprivate variable in %qs clause", t
,
7340 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7343 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
7345 error_at (OMP_CLAUSE_LOCATION (c
),
7346 "%<this%> allowed in OpenMP only in %<declare simd%>"
7351 else if (!processing_template_decl
7352 && !TYPE_REF_P (TREE_TYPE (t
))
7353 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
7354 || (OMP_CLAUSE_MAP_KIND (c
)
7355 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
7356 && !cxx_mark_addressable (t
))
7358 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7359 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
7360 || (OMP_CLAUSE_MAP_KIND (c
)
7361 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
7362 && t
== OMP_CLAUSE_DECL (c
)
7363 && !type_dependent_expression_p (t
)
7364 && !cp_omp_mappable_type (TYPE_REF_P (TREE_TYPE (t
))
7365 ? TREE_TYPE (TREE_TYPE (t
))
7368 error_at (OMP_CLAUSE_LOCATION (c
),
7369 "%qD does not have a mappable type in %qs clause", t
,
7370 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7371 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7374 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7375 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
7376 && !type_dependent_expression_p (t
)
7377 && !INDIRECT_TYPE_P (TREE_TYPE (t
)))
7379 error_at (OMP_CLAUSE_LOCATION (c
),
7380 "%qD is not a pointer variable", t
);
7383 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7384 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
7386 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
7387 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7389 error_at (OMP_CLAUSE_LOCATION (c
),
7390 "%qD appears more than once in data clauses", t
);
7393 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7395 if (ort
== C_ORT_ACC
)
7396 error_at (OMP_CLAUSE_LOCATION (c
),
7397 "%qD appears more than once in data clauses", t
);
7399 error_at (OMP_CLAUSE_LOCATION (c
),
7400 "%qD appears both in data and map clauses", t
);
7404 bitmap_set_bit (&generic_head
, DECL_UID (t
));
7406 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7408 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7409 error_at (OMP_CLAUSE_LOCATION (c
),
7410 "%qD appears more than once in motion clauses", t
);
7411 if (ort
== C_ORT_ACC
)
7412 error_at (OMP_CLAUSE_LOCATION (c
),
7413 "%qD appears more than once in data clauses", t
);
7415 error_at (OMP_CLAUSE_LOCATION (c
),
7416 "%qD appears more than once in map clauses", t
);
7419 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
7420 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7422 if (ort
== C_ORT_ACC
)
7423 error_at (OMP_CLAUSE_LOCATION (c
),
7424 "%qD appears more than once in data clauses", t
);
7426 error_at (OMP_CLAUSE_LOCATION (c
),
7427 "%qD appears both in data and map clauses", t
);
7432 bitmap_set_bit (&map_head
, DECL_UID (t
));
7433 if (t
!= OMP_CLAUSE_DECL (c
)
7434 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
7435 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
7437 handle_map_references
:
7439 && !processing_template_decl
7440 && ort
!= C_ORT_DECLARE_SIMD
7441 && TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
))))
7443 t
= OMP_CLAUSE_DECL (c
);
7444 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7446 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
7447 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
7449 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
7451 else if (OMP_CLAUSE_MAP_KIND (c
)
7452 != GOMP_MAP_FIRSTPRIVATE_POINTER
7453 && (OMP_CLAUSE_MAP_KIND (c
)
7454 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
7455 && (OMP_CLAUSE_MAP_KIND (c
)
7456 != GOMP_MAP_ALWAYS_POINTER
))
7458 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
7460 if (TREE_CODE (t
) == COMPONENT_REF
)
7461 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
7463 OMP_CLAUSE_SET_MAP_KIND (c2
,
7464 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
7465 OMP_CLAUSE_DECL (c2
) = t
;
7466 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
7467 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
7468 OMP_CLAUSE_CHAIN (c
) = c2
;
7469 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
7470 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
7472 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
7478 case OMP_CLAUSE_TO_DECLARE
:
7479 case OMP_CLAUSE_LINK
:
7480 t
= OMP_CLAUSE_DECL (c
);
7481 if (TREE_CODE (t
) == FUNCTION_DECL
7482 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
7484 else if (!VAR_P (t
))
7486 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
7488 if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
7489 error_at (OMP_CLAUSE_LOCATION (c
),
7490 "template %qE in clause %qs", t
,
7491 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7492 else if (really_overloaded_fn (t
))
7493 error_at (OMP_CLAUSE_LOCATION (c
),
7494 "overloaded function name %qE in clause %qs", t
,
7495 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7497 error_at (OMP_CLAUSE_LOCATION (c
),
7498 "%qE is neither a variable nor a function name "
7500 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7503 error_at (OMP_CLAUSE_LOCATION (c
),
7504 "%qE is not a variable in clause %qs", t
,
7505 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7508 else if (DECL_THREAD_LOCAL_P (t
))
7510 error_at (OMP_CLAUSE_LOCATION (c
),
7511 "%qD is threadprivate variable in %qs clause", t
,
7512 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7515 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
7517 error_at (OMP_CLAUSE_LOCATION (c
),
7518 "%qD does not have a mappable type in %qs clause", t
,
7519 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7520 cp_omp_emit_unmappable_type_notes (TREE_TYPE (t
));
7525 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
7527 error_at (OMP_CLAUSE_LOCATION (c
),
7528 "%qE appears more than once on the same "
7529 "%<declare target%> directive", t
);
7533 bitmap_set_bit (&generic_head
, DECL_UID (t
));
7536 case OMP_CLAUSE_UNIFORM
:
7537 t
= OMP_CLAUSE_DECL (c
);
7538 if (TREE_CODE (t
) != PARM_DECL
)
7540 if (processing_template_decl
)
7543 error_at (OMP_CLAUSE_LOCATION (c
),
7544 "%qD is not an argument in %<uniform%> clause", t
);
7546 error_at (OMP_CLAUSE_LOCATION (c
),
7547 "%qE is not an argument in %<uniform%> clause", t
);
7551 /* map_head bitmap is used as uniform_head if declare_simd. */
7552 bitmap_set_bit (&map_head
, DECL_UID (t
));
7553 goto check_dup_generic
;
7555 case OMP_CLAUSE_GRAINSIZE
:
7556 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
7557 if (t
== error_mark_node
)
7559 else if (!type_dependent_expression_p (t
)
7560 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7562 error_at (OMP_CLAUSE_LOCATION (c
),
7563 "%<grainsize%> expression must be integral");
7568 t
= mark_rvalue_use (t
);
7569 if (!processing_template_decl
)
7571 t
= maybe_constant_value (t
);
7572 if (TREE_CODE (t
) == INTEGER_CST
7573 && tree_int_cst_sgn (t
) != 1)
7575 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7576 "%<grainsize%> value must be positive");
7577 t
= integer_one_node
;
7579 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7581 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
7585 case OMP_CLAUSE_PRIORITY
:
7586 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
7587 if (t
== error_mark_node
)
7589 else if (!type_dependent_expression_p (t
)
7590 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7592 error_at (OMP_CLAUSE_LOCATION (c
),
7593 "%<priority%> expression must be integral");
7598 t
= mark_rvalue_use (t
);
7599 if (!processing_template_decl
)
7601 t
= maybe_constant_value (t
);
7602 if (TREE_CODE (t
) == INTEGER_CST
7603 && tree_int_cst_sgn (t
) == -1)
7605 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7606 "%<priority%> value must be non-negative");
7607 t
= integer_one_node
;
7609 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7611 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7615 case OMP_CLAUSE_HINT
:
7616 t
= OMP_CLAUSE_HINT_EXPR (c
);
7617 if (t
== error_mark_node
)
7619 else if (!type_dependent_expression_p (t
)
7620 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7622 error_at (OMP_CLAUSE_LOCATION (c
),
7623 "%<hint%> expression must be integral");
7628 t
= mark_rvalue_use (t
);
7629 if (!processing_template_decl
)
7631 t
= maybe_constant_value (t
);
7632 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7633 if (TREE_CODE (t
) != INTEGER_CST
)
7635 error_at (OMP_CLAUSE_LOCATION (c
),
7636 "%<hint%> expression must be constant integer "
7641 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7645 case OMP_CLAUSE_IS_DEVICE_PTR
:
7646 case OMP_CLAUSE_USE_DEVICE_PTR
:
7647 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7648 t
= OMP_CLAUSE_DECL (c
);
7649 if (!type_dependent_expression_p (t
))
7651 tree type
= TREE_TYPE (t
);
7652 if (!TYPE_PTR_P (type
)
7653 && (!TYPE_REF_P (type
) || !TYPE_PTR_P (TREE_TYPE (type
))))
7655 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_USE_DEVICE_PTR
7656 && ort
== C_ORT_OMP
)
7658 error_at (OMP_CLAUSE_LOCATION (c
),
7659 "%qs variable is neither a pointer "
7660 "nor reference to pointer",
7661 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7664 else if (TREE_CODE (type
) != ARRAY_TYPE
7665 && (!TYPE_REF_P (type
)
7666 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7668 error_at (OMP_CLAUSE_LOCATION (c
),
7669 "%qs variable is neither a pointer, nor an "
7670 "array nor reference to pointer or array",
7671 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7676 goto check_dup_generic
;
7678 case OMP_CLAUSE_USE_DEVICE_ADDR
:
7680 t
= OMP_CLAUSE_DECL (c
);
7681 if (!processing_template_decl
7682 && (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
7683 && !TYPE_REF_P (TREE_TYPE (t
))
7684 && !cxx_mark_addressable (t
))
7686 goto check_dup_generic
;
7688 case OMP_CLAUSE_NOWAIT
:
7689 case OMP_CLAUSE_DEFAULT
:
7690 case OMP_CLAUSE_UNTIED
:
7691 case OMP_CLAUSE_COLLAPSE
:
7692 case OMP_CLAUSE_MERGEABLE
:
7693 case OMP_CLAUSE_PARALLEL
:
7694 case OMP_CLAUSE_FOR
:
7695 case OMP_CLAUSE_SECTIONS
:
7696 case OMP_CLAUSE_TASKGROUP
:
7697 case OMP_CLAUSE_PROC_BIND
:
7698 case OMP_CLAUSE_DEVICE_TYPE
:
7699 case OMP_CLAUSE_NOGROUP
:
7700 case OMP_CLAUSE_THREADS
:
7701 case OMP_CLAUSE_SIMD
:
7702 case OMP_CLAUSE_DEFAULTMAP
:
7703 case OMP_CLAUSE_BIND
:
7704 case OMP_CLAUSE_AUTO
:
7705 case OMP_CLAUSE_INDEPENDENT
:
7706 case OMP_CLAUSE_SEQ
:
7707 case OMP_CLAUSE_IF_PRESENT
:
7708 case OMP_CLAUSE_FINALIZE
:
7711 case OMP_CLAUSE_TILE
:
7712 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7713 list
= TREE_CHAIN (list
))
7715 t
= TREE_VALUE (list
);
7717 if (t
== error_mark_node
)
7719 else if (!type_dependent_expression_p (t
)
7720 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7722 error_at (OMP_CLAUSE_LOCATION (c
),
7723 "%<tile%> argument needs integral type");
7728 t
= mark_rvalue_use (t
);
7729 if (!processing_template_decl
)
7731 /* Zero is used to indicate '*', we permit you
7732 to get there via an ICE of value zero. */
7733 t
= maybe_constant_value (t
);
7734 if (!tree_fits_shwi_p (t
)
7735 || tree_to_shwi (t
) < 0)
7737 error_at (OMP_CLAUSE_LOCATION (c
),
7738 "%<tile%> argument needs positive "
7739 "integral constant");
7742 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7746 /* Update list item. */
7747 TREE_VALUE (list
) = t
;
7751 case OMP_CLAUSE_ORDERED
:
7752 ordered_seen
= true;
7755 case OMP_CLAUSE_ORDER
:
7762 case OMP_CLAUSE_INBRANCH
:
7763 case OMP_CLAUSE_NOTINBRANCH
:
7766 error_at (OMP_CLAUSE_LOCATION (c
),
7767 "%<inbranch%> clause is incompatible with "
7774 case OMP_CLAUSE_INCLUSIVE
:
7775 case OMP_CLAUSE_EXCLUSIVE
:
7776 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7778 t
= OMP_CLAUSE_DECL (c
);
7779 if (t
== current_class_ptr
)
7781 error_at (OMP_CLAUSE_LOCATION (c
),
7782 "%<this%> allowed in OpenMP only in %<declare simd%>"
7788 && TREE_CODE (t
) != PARM_DECL
7789 && TREE_CODE (t
) != FIELD_DECL
)
7791 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7794 error_at (OMP_CLAUSE_LOCATION (c
),
7795 "%qD is not a variable in clause %qs", t
,
7796 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7798 error_at (OMP_CLAUSE_LOCATION (c
),
7799 "%qE is not a variable in clause %qs", t
,
7800 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7810 *pc
= OMP_CLAUSE_CHAIN (c
);
7812 pc
= &OMP_CLAUSE_CHAIN (c
);
7815 if (reduction_seen
< 0 && (ordered_seen
|| schedule_seen
))
7816 reduction_seen
= -2;
7818 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7820 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7821 bool remove
= false;
7822 bool need_complete_type
= false;
7823 bool need_default_ctor
= false;
7824 bool need_copy_ctor
= false;
7825 bool need_copy_assignment
= false;
7826 bool need_implicitly_determined
= false;
7827 bool need_dtor
= false;
7828 tree type
, inner_type
;
7832 case OMP_CLAUSE_SHARED
:
7833 need_implicitly_determined
= true;
7835 case OMP_CLAUSE_PRIVATE
:
7836 need_complete_type
= true;
7837 need_default_ctor
= true;
7839 need_implicitly_determined
= true;
7841 case OMP_CLAUSE_FIRSTPRIVATE
:
7842 need_complete_type
= true;
7843 need_copy_ctor
= true;
7845 need_implicitly_determined
= true;
7847 case OMP_CLAUSE_LASTPRIVATE
:
7848 need_complete_type
= true;
7849 need_copy_assignment
= true;
7850 need_implicitly_determined
= true;
7852 case OMP_CLAUSE_REDUCTION
:
7853 if (reduction_seen
== -2)
7854 OMP_CLAUSE_REDUCTION_INSCAN (c
) = 0;
7855 if (OMP_CLAUSE_REDUCTION_INSCAN (c
))
7856 need_copy_assignment
= true;
7857 need_implicitly_determined
= true;
7859 case OMP_CLAUSE_IN_REDUCTION
:
7860 case OMP_CLAUSE_TASK_REDUCTION
:
7861 case OMP_CLAUSE_INCLUSIVE
:
7862 case OMP_CLAUSE_EXCLUSIVE
:
7863 need_implicitly_determined
= true;
7865 case OMP_CLAUSE_LINEAR
:
7866 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7867 need_implicitly_determined
= true;
7868 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7869 && !bitmap_bit_p (&map_head
,
7870 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7872 error_at (OMP_CLAUSE_LOCATION (c
),
7873 "%<linear%> clause step is a parameter %qD not "
7874 "specified in %<uniform%> clause",
7875 OMP_CLAUSE_LINEAR_STEP (c
));
7876 *pc
= OMP_CLAUSE_CHAIN (c
);
7880 case OMP_CLAUSE_COPYPRIVATE
:
7881 need_copy_assignment
= true;
7883 case OMP_CLAUSE_COPYIN
:
7884 need_copy_assignment
= true;
7886 case OMP_CLAUSE_SIMDLEN
:
7888 && !processing_template_decl
7889 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7890 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7892 error_at (OMP_CLAUSE_LOCATION (c
),
7893 "%<simdlen%> clause value is bigger than "
7894 "%<safelen%> clause value");
7895 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7896 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7898 pc
= &OMP_CLAUSE_CHAIN (c
);
7900 case OMP_CLAUSE_SCHEDULE
:
7902 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7903 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7905 error_at (OMP_CLAUSE_LOCATION (c
),
7906 "%<nonmonotonic%> schedule modifier specified "
7907 "together with %<ordered%> clause");
7908 OMP_CLAUSE_SCHEDULE_KIND (c
)
7909 = (enum omp_clause_schedule_kind
)
7910 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7911 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7913 if (reduction_seen
== -2)
7914 error_at (OMP_CLAUSE_LOCATION (c
),
7915 "%qs clause specified together with %<inscan%> "
7916 "%<reduction%> clause", "schedule");
7917 pc
= &OMP_CLAUSE_CHAIN (c
);
7919 case OMP_CLAUSE_NOGROUP
:
7922 error_at (OMP_CLAUSE_LOCATION (c
),
7923 "%<nogroup%> clause must not be used together with "
7924 "%<reduction%> clause");
7925 *pc
= OMP_CLAUSE_CHAIN (c
);
7928 pc
= &OMP_CLAUSE_CHAIN (c
);
7930 case OMP_CLAUSE_ORDERED
:
7931 if (reduction_seen
== -2)
7932 error_at (OMP_CLAUSE_LOCATION (c
),
7933 "%qs clause specified together with %<inscan%> "
7934 "%<reduction%> clause", "ordered");
7935 pc
= &OMP_CLAUSE_CHAIN (c
);
7937 case OMP_CLAUSE_ORDER
:
7940 error_at (OMP_CLAUSE_LOCATION (c
),
7941 "%<order%> clause must not be used together "
7942 "with %<ordered%>");
7943 *pc
= OMP_CLAUSE_CHAIN (c
);
7946 pc
= &OMP_CLAUSE_CHAIN (c
);
7948 case OMP_CLAUSE_NOWAIT
:
7949 if (copyprivate_seen
)
7951 error_at (OMP_CLAUSE_LOCATION (c
),
7952 "%<nowait%> clause must not be used together "
7953 "with %<copyprivate%>");
7954 *pc
= OMP_CLAUSE_CHAIN (c
);
7959 pc
= &OMP_CLAUSE_CHAIN (c
);
7963 t
= OMP_CLAUSE_DECL (c
);
7964 if (processing_template_decl
7965 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7967 pc
= &OMP_CLAUSE_CHAIN (c
);
7973 case OMP_CLAUSE_LASTPRIVATE
:
7974 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7976 need_default_ctor
= true;
7981 case OMP_CLAUSE_REDUCTION
:
7982 case OMP_CLAUSE_IN_REDUCTION
:
7983 case OMP_CLAUSE_TASK_REDUCTION
:
7984 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7988 t
= OMP_CLAUSE_DECL (c
);
7991 case OMP_CLAUSE_COPYIN
:
7992 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7994 error_at (OMP_CLAUSE_LOCATION (c
),
7995 "%qE must be %<threadprivate%> for %<copyin%>", t
);
8004 if (need_complete_type
|| need_copy_assignment
)
8006 t
= require_complete_type (t
);
8007 if (t
== error_mark_node
)
8009 else if (!processing_template_decl
8010 && TYPE_REF_P (TREE_TYPE (t
))
8011 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
8014 if (need_implicitly_determined
)
8016 const char *share_name
= NULL
;
8018 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
8019 share_name
= "threadprivate";
8020 else switch (cxx_omp_predetermined_sharing_1 (t
))
8022 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
8024 case OMP_CLAUSE_DEFAULT_SHARED
:
8025 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
8026 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
)
8027 && c_omp_predefined_variable (t
))
8028 /* The __func__ variable and similar function-local predefined
8029 variables may be listed in a shared or firstprivate
8033 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
8035 && cxx_omp_const_qual_no_mutable (t
))
8037 tree ctx
= CP_DECL_CONTEXT (t
);
8038 /* const qualified static data members without mutable
8039 member may be specified in firstprivate clause. */
8040 if (TYPE_P (ctx
) && MAYBE_CLASS_TYPE_P (ctx
))
8043 share_name
= "shared";
8045 case OMP_CLAUSE_DEFAULT_PRIVATE
:
8046 share_name
= "private";
8053 error_at (OMP_CLAUSE_LOCATION (c
),
8054 "%qE is predetermined %qs for %qs",
8055 omp_clause_printable_decl (t
), share_name
,
8056 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
8059 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
8060 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_FIRSTPRIVATE
8061 && cxx_omp_const_qual_no_mutable (t
))
8063 error_at (OMP_CLAUSE_LOCATION (c
),
8064 "%<const%> qualified %qE without %<mutable%> member "
8065 "may appear only in %<shared%> or %<firstprivate%> "
8066 "clauses", omp_clause_printable_decl (t
));
8071 /* We're interested in the base element, not arrays. */
8072 inner_type
= type
= TREE_TYPE (t
);
8073 if ((need_complete_type
8074 || need_copy_assignment
8075 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
8076 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
8077 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
8078 && TYPE_REF_P (inner_type
))
8079 inner_type
= TREE_TYPE (inner_type
);
8080 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
8081 inner_type
= TREE_TYPE (inner_type
);
8083 /* Check for special function availability by building a call to one.
8084 Save the results, because later we won't be in the right context
8085 for making these queries. */
8086 if (CLASS_TYPE_P (inner_type
)
8087 && COMPLETE_TYPE_P (inner_type
)
8088 && (need_default_ctor
|| need_copy_ctor
8089 || need_copy_assignment
|| need_dtor
)
8090 && !type_dependent_expression_p (t
)
8091 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
8092 need_copy_ctor
, need_copy_assignment
,
8097 && c_kind
== OMP_CLAUSE_SHARED
8098 && processing_template_decl
)
8100 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
8102 OMP_CLAUSE_DECL (c
) = t
;
8106 *pc
= OMP_CLAUSE_CHAIN (c
);
8108 pc
= &OMP_CLAUSE_CHAIN (c
);
8111 bitmap_obstack_release (NULL
);
8115 /* Start processing OpenMP clauses that can include any
8116 privatization clauses for non-static data members. */
8119 push_omp_privatization_clauses (bool ignore_next
)
8121 if (omp_private_member_ignore_next
)
8123 omp_private_member_ignore_next
= ignore_next
;
8126 omp_private_member_ignore_next
= ignore_next
;
8127 if (omp_private_member_map
)
8128 omp_private_member_vec
.safe_push (error_mark_node
);
8129 return push_stmt_list ();
8132 /* Revert remapping of any non-static data members since
8133 the last push_omp_privatization_clauses () call. */
8136 pop_omp_privatization_clauses (tree stmt
)
8138 if (stmt
== NULL_TREE
)
8140 stmt
= pop_stmt_list (stmt
);
8141 if (omp_private_member_map
)
8143 while (!omp_private_member_vec
.is_empty ())
8145 tree t
= omp_private_member_vec
.pop ();
8146 if (t
== error_mark_node
)
8151 bool no_decl_expr
= t
== integer_zero_node
;
8153 t
= omp_private_member_vec
.pop ();
8154 tree
*v
= omp_private_member_map
->get (t
);
8158 omp_private_member_map
->remove (t
);
8160 delete omp_private_member_map
;
8161 omp_private_member_map
= NULL
;
8166 /* Remember OpenMP privatization clauses mapping and clear it.
8167 Used for lambdas. */
8170 save_omp_privatization_clauses (vec
<tree
> &save
)
8173 if (omp_private_member_ignore_next
)
8174 save
.safe_push (integer_one_node
);
8175 omp_private_member_ignore_next
= false;
8176 if (!omp_private_member_map
)
8179 while (!omp_private_member_vec
.is_empty ())
8181 tree t
= omp_private_member_vec
.pop ();
8182 if (t
== error_mark_node
)
8188 if (t
== integer_zero_node
)
8189 t
= omp_private_member_vec
.pop ();
8190 tree
*v
= omp_private_member_map
->get (t
);
8192 save
.safe_push (*v
);
8197 delete omp_private_member_map
;
8198 omp_private_member_map
= NULL
;
8201 /* Restore OpenMP privatization clauses mapping saved by the
8205 restore_omp_privatization_clauses (vec
<tree
> &save
)
8207 gcc_assert (omp_private_member_vec
.is_empty ());
8208 omp_private_member_ignore_next
= false;
8209 if (save
.is_empty ())
8211 if (save
.length () == 1 && save
[0] == integer_one_node
)
8213 omp_private_member_ignore_next
= true;
8218 omp_private_member_map
= new hash_map
<tree
, tree
>;
8219 while (!save
.is_empty ())
8221 tree t
= save
.pop ();
8223 if (t
!= error_mark_node
)
8225 if (t
== integer_one_node
)
8227 omp_private_member_ignore_next
= true;
8228 gcc_assert (save
.is_empty ());
8231 if (t
== integer_zero_node
)
8233 tree
&v
= omp_private_member_map
->get_or_insert (t
);
8236 omp_private_member_vec
.safe_push (t
);
8238 omp_private_member_vec
.safe_push (n
);
8243 /* For all variables in the tree_list VARS, mark them as thread local. */
8246 finish_omp_threadprivate (tree vars
)
8250 /* Mark every variable in VARS to be assigned thread local storage. */
8251 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
8253 tree v
= TREE_PURPOSE (t
);
8255 if (error_operand_p (v
))
8257 else if (!VAR_P (v
))
8258 error ("%<threadprivate%> %qD is not file, namespace "
8259 "or block scope variable", v
);
8260 /* If V had already been marked threadprivate, it doesn't matter
8261 whether it had been used prior to this point. */
8262 else if (TREE_USED (v
)
8263 && (DECL_LANG_SPECIFIC (v
) == NULL
8264 || !CP_DECL_THREADPRIVATE_P (v
)))
8265 error ("%qE declared %<threadprivate%> after first use", v
);
8266 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
8267 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
8268 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
8269 error ("%<threadprivate%> %qE has incomplete type", v
);
8270 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
8271 && CP_DECL_CONTEXT (v
) != current_class_type
)
8272 error ("%<threadprivate%> %qE directive not "
8273 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
8276 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
8277 if (DECL_LANG_SPECIFIC (v
) == NULL
)
8278 retrofit_lang_decl (v
);
8280 if (! CP_DECL_THREAD_LOCAL_P (v
))
8282 CP_DECL_THREAD_LOCAL_P (v
) = true;
8283 set_decl_tls_model (v
, decl_default_tls_model (v
));
8284 /* If rtl has been already set for this var, call
8285 make_decl_rtl once again, so that encode_section_info
8286 has a chance to look at the new decl flags. */
8287 if (DECL_RTL_SET_P (v
))
8290 CP_DECL_THREADPRIVATE_P (v
) = 1;
8295 /* Build an OpenMP structured block. */
8298 begin_omp_structured_block (void)
8300 return do_pushlevel (sk_omp
);
8304 finish_omp_structured_block (tree block
)
8306 return do_poplevel (block
);
8309 /* Similarly, except force the retention of the BLOCK. */
8312 begin_omp_parallel (void)
8314 keep_next_level (true);
8315 return begin_omp_structured_block ();
8318 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
8322 finish_oacc_data (tree clauses
, tree block
)
8326 block
= finish_omp_structured_block (block
);
8328 stmt
= make_node (OACC_DATA
);
8329 TREE_TYPE (stmt
) = void_type_node
;
8330 OACC_DATA_CLAUSES (stmt
) = clauses
;
8331 OACC_DATA_BODY (stmt
) = block
;
8333 return add_stmt (stmt
);
8336 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
8340 finish_oacc_host_data (tree clauses
, tree block
)
8344 block
= finish_omp_structured_block (block
);
8346 stmt
= make_node (OACC_HOST_DATA
);
8347 TREE_TYPE (stmt
) = void_type_node
;
8348 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
8349 OACC_HOST_DATA_BODY (stmt
) = block
;
8351 return add_stmt (stmt
);
8354 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
8358 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
8360 body
= finish_omp_structured_block (body
);
8362 tree stmt
= make_node (code
);
8363 TREE_TYPE (stmt
) = void_type_node
;
8364 OMP_BODY (stmt
) = body
;
8365 OMP_CLAUSES (stmt
) = clauses
;
8367 return add_stmt (stmt
);
8371 finish_omp_parallel (tree clauses
, tree body
)
8375 body
= finish_omp_structured_block (body
);
8377 stmt
= make_node (OMP_PARALLEL
);
8378 TREE_TYPE (stmt
) = void_type_node
;
8379 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
8380 OMP_PARALLEL_BODY (stmt
) = body
;
8382 return add_stmt (stmt
);
8386 begin_omp_task (void)
8388 keep_next_level (true);
8389 return begin_omp_structured_block ();
8393 finish_omp_task (tree clauses
, tree body
)
8397 body
= finish_omp_structured_block (body
);
8399 stmt
= make_node (OMP_TASK
);
8400 TREE_TYPE (stmt
) = void_type_node
;
8401 OMP_TASK_CLAUSES (stmt
) = clauses
;
8402 OMP_TASK_BODY (stmt
) = body
;
8404 return add_stmt (stmt
);
8407 /* Helper function for finish_omp_for. Convert Ith random access iterator
8408 into integral iterator. Return FALSE if successful. */
8411 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
8412 tree declv
, tree orig_declv
, tree initv
,
8413 tree condv
, tree incrv
, tree
*body
,
8414 tree
*pre_body
, tree
&clauses
,
8415 int collapse
, int ordered
)
8417 tree diff
, iter_init
, iter_incr
= NULL
, last
;
8418 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
8419 tree decl
= TREE_VEC_ELT (declv
, i
);
8420 tree init
= TREE_VEC_ELT (initv
, i
);
8421 tree cond
= TREE_VEC_ELT (condv
, i
);
8422 tree incr
= TREE_VEC_ELT (incrv
, i
);
8424 location_t elocus
= locus
;
8426 if (init
&& EXPR_HAS_LOCATION (init
))
8427 elocus
= EXPR_LOCATION (init
);
8429 cond
= cp_fully_fold (cond
);
8430 switch (TREE_CODE (cond
))
8437 if (TREE_OPERAND (cond
, 1) == iter
)
8438 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
8439 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
8440 if (TREE_OPERAND (cond
, 0) != iter
)
8441 cond
= error_mark_node
;
8444 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
8447 TREE_OPERAND (cond
, 1), ERROR_MARK
,
8448 NULL
, tf_warning_or_error
);
8449 if (error_operand_p (tem
))
8454 cond
= error_mark_node
;
8457 if (cond
== error_mark_node
)
8459 error_at (elocus
, "invalid controlling predicate");
8462 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
8463 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
8464 tf_warning_or_error
);
8465 diff
= cp_fully_fold (diff
);
8466 if (error_operand_p (diff
))
8468 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
8470 error_at (elocus
, "difference between %qE and %qD does not have integer type",
8471 TREE_OPERAND (cond
, 1), iter
);
8474 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
8475 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
8476 cond
, cp_walk_subtrees
))
8479 switch (TREE_CODE (incr
))
8481 case PREINCREMENT_EXPR
:
8482 case PREDECREMENT_EXPR
:
8483 case POSTINCREMENT_EXPR
:
8484 case POSTDECREMENT_EXPR
:
8485 if (TREE_OPERAND (incr
, 0) != iter
)
8487 incr
= error_mark_node
;
8490 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
8491 TREE_CODE (incr
), iter
,
8492 tf_warning_or_error
);
8493 if (error_operand_p (iter_incr
))
8495 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
8496 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
8497 incr
= integer_one_node
;
8499 incr
= integer_minus_one_node
;
8502 if (TREE_OPERAND (incr
, 0) != iter
)
8503 incr
= error_mark_node
;
8504 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
8505 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
8507 tree rhs
= TREE_OPERAND (incr
, 1);
8508 if (TREE_OPERAND (rhs
, 0) == iter
)
8510 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
8512 incr
= error_mark_node
;
8515 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
8516 iter
, TREE_CODE (rhs
),
8517 TREE_OPERAND (rhs
, 1),
8518 tf_warning_or_error
);
8519 if (error_operand_p (iter_incr
))
8521 incr
= TREE_OPERAND (rhs
, 1);
8522 incr
= cp_convert (TREE_TYPE (diff
), incr
,
8523 tf_warning_or_error
);
8524 if (TREE_CODE (rhs
) == MINUS_EXPR
)
8526 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
8527 incr
= fold_simple (incr
);
8529 if (TREE_CODE (incr
) != INTEGER_CST
8530 && (TREE_CODE (incr
) != NOP_EXPR
8531 || (TREE_CODE (TREE_OPERAND (incr
, 0))
8536 else if (TREE_OPERAND (rhs
, 1) == iter
)
8538 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
8539 || TREE_CODE (rhs
) != PLUS_EXPR
)
8540 incr
= error_mark_node
;
8543 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
8545 TREE_OPERAND (rhs
, 0),
8548 tf_warning_or_error
);
8549 if (error_operand_p (iter_incr
))
8551 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
8554 tf_warning_or_error
);
8555 if (error_operand_p (iter_incr
))
8557 incr
= TREE_OPERAND (rhs
, 0);
8562 incr
= error_mark_node
;
8565 incr
= error_mark_node
;
8568 incr
= error_mark_node
;
8572 if (incr
== error_mark_node
)
8574 error_at (elocus
, "invalid increment expression");
8578 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
8579 incr
= cp_fully_fold (incr
);
8580 tree loop_iv_seen
= NULL_TREE
;
8581 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
8582 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
8583 && OMP_CLAUSE_DECL (c
) == iter
)
8585 if (code
== OMP_TASKLOOP
|| code
== OMP_LOOP
)
8588 OMP_CLAUSE_LASTPRIVATE_LOOP_IV (c
) = 1;
8592 else if ((code
== OMP_TASKLOOP
|| code
== OMP_LOOP
)
8593 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
8594 && OMP_CLAUSE_DECL (c
) == iter
)
8597 if (code
== OMP_TASKLOOP
)
8598 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
8601 decl
= create_temporary_var (TREE_TYPE (diff
));
8603 add_decl_expr (decl
);
8604 last
= create_temporary_var (TREE_TYPE (diff
));
8606 add_decl_expr (last
);
8607 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
8608 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
8610 incr_var
= create_temporary_var (TREE_TYPE (diff
));
8611 pushdecl (incr_var
);
8612 add_decl_expr (incr_var
);
8614 gcc_assert (stmts_are_full_exprs_p ());
8615 tree diffvar
= NULL_TREE
;
8616 if (code
== OMP_TASKLOOP
)
8620 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8621 OMP_CLAUSE_DECL (ivc
) = iter
;
8622 cxx_omp_finish_clause (ivc
, NULL
);
8623 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
8626 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8627 OMP_CLAUSE_DECL (lvc
) = last
;
8628 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
8630 diffvar
= create_temporary_var (TREE_TYPE (diff
));
8632 add_decl_expr (diffvar
);
8634 else if (code
== OMP_LOOP
)
8638 /* While iterators on the loop construct are predetermined
8639 lastprivate, if the decl is not declared inside of the
8640 loop, OMP_CLAUSE_LASTPRIVATE should have been added
8642 loop_iv_seen
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8643 OMP_CLAUSE_DECL (loop_iv_seen
) = iter
;
8644 OMP_CLAUSE_CHAIN (loop_iv_seen
) = clauses
;
8645 clauses
= loop_iv_seen
;
8647 else if (OMP_CLAUSE_CODE (loop_iv_seen
) == OMP_CLAUSE_PRIVATE
)
8649 OMP_CLAUSE_PRIVATE_DEBUG (loop_iv_seen
) = 0;
8650 OMP_CLAUSE_PRIVATE_OUTER_REF (loop_iv_seen
) = 0;
8651 OMP_CLAUSE_CODE (loop_iv_seen
) = OMP_CLAUSE_FIRSTPRIVATE
;
8653 if (OMP_CLAUSE_CODE (loop_iv_seen
) == OMP_CLAUSE_FIRSTPRIVATE
)
8654 cxx_omp_finish_clause (loop_iv_seen
, NULL
);
8657 orig_pre_body
= *pre_body
;
8658 *pre_body
= push_stmt_list ();
8660 add_stmt (orig_pre_body
);
8662 finish_expr_stmt (build_x_modify_expr (elocus
,
8663 iter
, NOP_EXPR
, init
,
8664 tf_warning_or_error
));
8665 init
= build_int_cst (TREE_TYPE (diff
), 0);
8666 if (c
&& iter_incr
== NULL
8667 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
8671 finish_expr_stmt (build_x_modify_expr (elocus
,
8673 incr
, tf_warning_or_error
));
8676 iter_incr
= build_x_modify_expr (elocus
,
8677 iter
, PLUS_EXPR
, incr
,
8678 tf_warning_or_error
);
8680 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
8682 finish_expr_stmt (build_x_modify_expr (elocus
,
8683 last
, NOP_EXPR
, init
,
8684 tf_warning_or_error
));
8687 finish_expr_stmt (build_x_modify_expr (elocus
,
8689 diff
, tf_warning_or_error
));
8692 *pre_body
= pop_stmt_list (*pre_body
);
8694 cond
= cp_build_binary_op (elocus
,
8695 TREE_CODE (cond
), decl
, diff
,
8696 tf_warning_or_error
);
8697 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
8698 elocus
, incr
, NULL_TREE
);
8701 *body
= push_stmt_list ();
8702 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
8703 iter_init
= build_x_modify_expr (elocus
,
8704 iter
, PLUS_EXPR
, iter_init
,
8705 tf_warning_or_error
);
8706 if (iter_init
!= error_mark_node
)
8707 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
8708 finish_expr_stmt (iter_init
);
8709 finish_expr_stmt (build_x_modify_expr (elocus
,
8710 last
, NOP_EXPR
, decl
,
8711 tf_warning_or_error
));
8712 add_stmt (orig_body
);
8713 *body
= pop_stmt_list (*body
);
8717 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
8719 finish_expr_stmt (iter_incr
);
8723 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
8724 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
8725 iter_init
, iter_incr
);
8726 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
8727 iter_init
= build_x_modify_expr (elocus
,
8728 iter
, PLUS_EXPR
, iter_init
,
8729 tf_warning_or_error
);
8730 if (iter_init
!= error_mark_node
)
8731 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
8732 finish_expr_stmt (iter_init
);
8734 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
8735 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
8738 if (TREE_CODE (TREE_VEC_ELT (orig_declv
, i
)) == TREE_LIST
)
8740 tree t
= TREE_VEC_ELT (orig_declv
, i
);
8741 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8742 && TREE_VALUE (t
) == NULL_TREE
8743 && TREE_CODE (TREE_CHAIN (t
)) == TREE_VEC
);
8744 TREE_PURPOSE (t
) = TREE_VEC_ELT (declv
, i
);
8745 TREE_VALUE (t
) = last
;
8748 TREE_VEC_ELT (orig_declv
, i
)
8749 = tree_cons (TREE_VEC_ELT (declv
, i
), last
, NULL_TREE
);
8750 TREE_VEC_ELT (declv
, i
) = decl
;
8751 TREE_VEC_ELT (initv
, i
) = init
;
8752 TREE_VEC_ELT (condv
, i
) = cond
;
8753 TREE_VEC_ELT (incrv
, i
) = incr
;
8758 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
8759 are directly for their associated operands in the statement. DECL
8760 and INIT are a combo; if DECL is NULL then INIT ought to be a
8761 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
8762 optional statements that need to go before the loop into its
8766 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
8767 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
8768 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
8770 tree omp_for
= NULL
, orig_incr
= NULL
;
8771 tree decl
= NULL
, init
, cond
, incr
;
8777 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8778 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8779 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8780 if (TREE_VEC_LENGTH (declv
) > 1)
8784 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8786 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8789 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8791 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8792 if (collapse
!= TREE_VEC_LENGTH (declv
))
8793 ordered
= TREE_VEC_LENGTH (declv
);
8796 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8798 decl
= TREE_VEC_ELT (declv
, i
);
8799 init
= TREE_VEC_ELT (initv
, i
);
8800 cond
= TREE_VEC_ELT (condv
, i
);
8801 incr
= TREE_VEC_ELT (incrv
, i
);
8807 switch (TREE_CODE (init
))
8810 decl
= TREE_OPERAND (init
, 0);
8811 init
= TREE_OPERAND (init
, 1);
8814 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8816 decl
= TREE_OPERAND (init
, 0);
8817 init
= TREE_OPERAND (init
, 2);
8827 "expected iteration declaration or initialization");
8832 if (init
&& EXPR_HAS_LOCATION (init
))
8833 elocus
= EXPR_LOCATION (init
);
8835 if (cond
== global_namespace
)
8840 error_at (elocus
, "missing controlling predicate");
8846 error_at (elocus
, "missing increment expression");
8850 TREE_VEC_ELT (declv
, i
) = decl
;
8851 TREE_VEC_ELT (initv
, i
) = init
;
8858 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8860 && !c_omp_check_loop_iv_exprs (locus
, orig_declv
8861 ? orig_declv
: declv
,
8862 TREE_VEC_ELT (declv
, i
), orig_init
,
8863 NULL_TREE
, cp_walk_subtrees
))
8869 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8873 stmt
= make_node (code
);
8875 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8877 /* This is really just a place-holder. We'll be decomposing this
8878 again and going through the cp_build_modify_expr path below when
8879 we instantiate the thing. */
8880 TREE_VEC_ELT (initv
, i
)
8881 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8882 TREE_VEC_ELT (initv
, i
));
8885 TREE_TYPE (stmt
) = void_type_node
;
8886 OMP_FOR_INIT (stmt
) = initv
;
8887 OMP_FOR_COND (stmt
) = condv
;
8888 OMP_FOR_INCR (stmt
) = incrv
;
8889 OMP_FOR_BODY (stmt
) = body
;
8890 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8891 OMP_FOR_CLAUSES (stmt
) = clauses
;
8893 SET_EXPR_LOCATION (stmt
, locus
);
8894 return add_stmt (stmt
);
8898 orig_declv
= copy_node (declv
);
8900 if (processing_template_decl
)
8901 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8903 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8905 decl
= TREE_VEC_ELT (declv
, i
);
8906 init
= TREE_VEC_ELT (initv
, i
);
8907 cond
= TREE_VEC_ELT (condv
, i
);
8908 incr
= TREE_VEC_ELT (incrv
, i
);
8910 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8913 if (init
&& EXPR_HAS_LOCATION (init
))
8914 elocus
= EXPR_LOCATION (init
);
8918 error_at (elocus
, "expected iteration declaration or initialization");
8922 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8925 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8926 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8927 TREE_CODE (TREE_OPERAND (incr
, 1)),
8928 TREE_OPERAND (incr
, 2),
8929 tf_warning_or_error
);
8932 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8934 if (code
== OMP_SIMD
)
8936 error_at (elocus
, "%<#pragma omp simd%> used with class "
8937 "iteration variable %qE", decl
);
8940 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8941 initv
, condv
, incrv
, &body
,
8948 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8949 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8951 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8955 if (!processing_template_decl
)
8957 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8958 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8959 tf_warning_or_error
);
8962 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8964 && TREE_SIDE_EFFECTS (cond
)
8965 && COMPARISON_CLASS_P (cond
)
8966 && !processing_template_decl
)
8968 tree t
= TREE_OPERAND (cond
, 0);
8969 if (TREE_SIDE_EFFECTS (t
)
8971 && (TREE_CODE (t
) != NOP_EXPR
8972 || TREE_OPERAND (t
, 0) != decl
))
8973 TREE_OPERAND (cond
, 0)
8974 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8976 t
= TREE_OPERAND (cond
, 1);
8977 if (TREE_SIDE_EFFECTS (t
)
8979 && (TREE_CODE (t
) != NOP_EXPR
8980 || TREE_OPERAND (t
, 0) != decl
))
8981 TREE_OPERAND (cond
, 1)
8982 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8984 if (decl
== error_mark_node
|| init
== error_mark_node
)
8987 TREE_VEC_ELT (declv
, i
) = decl
;
8988 TREE_VEC_ELT (initv
, i
) = init
;
8989 TREE_VEC_ELT (condv
, i
) = cond
;
8990 TREE_VEC_ELT (incrv
, i
) = incr
;
8994 if (pre_body
&& IS_EMPTY_STMT (pre_body
))
8997 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8998 incrv
, body
, pre_body
,
8999 !processing_template_decl
);
9001 /* Check for iterators appearing in lb, b or incr expressions. */
9002 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
9003 omp_for
= NULL_TREE
;
9005 if (omp_for
== NULL
)
9010 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
9012 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
9013 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
9015 if (TREE_CODE (incr
) != MODIFY_EXPR
)
9018 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
9019 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
9020 && !processing_template_decl
)
9022 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
9023 if (TREE_SIDE_EFFECTS (t
)
9025 && (TREE_CODE (t
) != NOP_EXPR
9026 || TREE_OPERAND (t
, 0) != decl
))
9027 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
9028 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
9030 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
9031 if (TREE_SIDE_EFFECTS (t
)
9033 && (TREE_CODE (t
) != NOP_EXPR
9034 || TREE_OPERAND (t
, 0) != decl
))
9035 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
9036 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
9040 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
9042 OMP_FOR_CLAUSES (omp_for
) = clauses
;
9044 /* For simd loops with non-static data member iterators, we could have added
9045 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
9046 step at this point, fill it in. */
9047 if (code
== OMP_SIMD
&& !processing_template_decl
9048 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
9049 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
9050 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
9051 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
9053 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
9054 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
9055 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
9057 switch (TREE_CODE (incr
))
9059 case PREINCREMENT_EXPR
:
9060 case POSTINCREMENT_EXPR
:
9061 /* c_omp_for_incr_canonicalize_ptr() should have been
9062 called to massage things appropriately. */
9063 gcc_assert (!INDIRECT_TYPE_P (TREE_TYPE (decl
)));
9064 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
9066 case PREDECREMENT_EXPR
:
9067 case POSTDECREMENT_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
)
9072 = build_int_cst (TREE_TYPE (decl
), -1);
9075 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
9076 incr
= TREE_OPERAND (incr
, 1);
9077 switch (TREE_CODE (incr
))
9080 if (TREE_OPERAND (incr
, 1) == decl
)
9081 step
= TREE_OPERAND (incr
, 0);
9083 step
= TREE_OPERAND (incr
, 1);
9086 case POINTER_PLUS_EXPR
:
9087 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
9088 step
= TREE_OPERAND (incr
, 1);
9093 stept
= TREE_TYPE (decl
);
9094 if (INDIRECT_TYPE_P (stept
))
9096 step
= fold_convert (stept
, step
);
9097 if (TREE_CODE (incr
) == MINUS_EXPR
)
9098 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
9099 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
9105 /* Override saved methods on OMP_LOOP's OMP_CLAUSE_LASTPRIVATE_LOOP_IV
9106 clauses, we need copy ctor for those rather than default ctor,
9107 plus as for other lastprivates assignment op and dtor. */
9108 if (code
== OMP_LOOP
&& !processing_template_decl
)
9109 for (tree c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
9110 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
9111 && OMP_CLAUSE_LASTPRIVATE_LOOP_IV (c
)
9112 && cxx_omp_create_clause_info (c
, TREE_TYPE (OMP_CLAUSE_DECL (c
)),
9113 false, true, true, true))
9114 CP_OMP_CLAUSE_INFO (c
) = NULL_TREE
;
9119 /* Fix up range for decls. Those decls were pushed into BIND's BIND_EXPR_VARS
9120 and need to be moved into the BIND_EXPR inside of the OMP_FOR's body. */
9123 finish_omp_for_block (tree bind
, tree omp_for
)
9125 if (omp_for
== NULL_TREE
9126 || !OMP_FOR_ORIG_DECLS (omp_for
)
9127 || bind
== NULL_TREE
9128 || TREE_CODE (bind
) != BIND_EXPR
)
9131 for (int i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (omp_for
)); i
++)
9132 if (TREE_CODE (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
)) == TREE_LIST
9133 && TREE_CHAIN (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
)))
9135 tree v
= TREE_CHAIN (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
));
9136 gcc_assert (BIND_EXPR_BLOCK (bind
)
9137 && (BIND_EXPR_VARS (bind
)
9138 == BLOCK_VARS (BIND_EXPR_BLOCK (bind
))));
9139 for (int j
= 2; j
< TREE_VEC_LENGTH (v
); j
++)
9140 for (tree
*p
= &BIND_EXPR_VARS (bind
); *p
; p
= &DECL_CHAIN (*p
))
9142 if (*p
== TREE_VEC_ELT (v
, j
))
9145 *p
= DECL_CHAIN (*p
);
9148 b
= make_node (BLOCK
);
9149 b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
9150 OMP_FOR_BODY (omp_for
), b
);
9151 TREE_SIDE_EFFECTS (b
) = 1;
9152 OMP_FOR_BODY (omp_for
) = b
;
9154 DECL_CHAIN (var
) = BIND_EXPR_VARS (b
);
9155 BIND_EXPR_VARS (b
) = var
;
9156 BLOCK_VARS (BIND_EXPR_BLOCK (b
)) = var
;
9159 BLOCK_VARS (BIND_EXPR_BLOCK (bind
)) = BIND_EXPR_VARS (bind
);
9165 finish_omp_atomic (location_t loc
, enum tree_code code
, enum tree_code opcode
,
9166 tree lhs
, tree rhs
, tree v
, tree lhs1
, tree rhs1
,
9167 tree clauses
, enum omp_memory_order mo
)
9182 dependent_p
= false;
9185 /* Even in a template, we can detect invalid uses of the atomic
9186 pragma if neither LHS nor RHS is type-dependent. */
9187 if (processing_template_decl
)
9189 dependent_p
= (type_dependent_expression_p (lhs
)
9190 || (rhs
&& type_dependent_expression_p (rhs
))
9191 || (v
&& type_dependent_expression_p (v
))
9192 || (lhs1
&& type_dependent_expression_p (lhs1
))
9193 || (rhs1
&& type_dependent_expression_p (rhs1
)));
9196 gcc_assert (TREE_CODE (clauses
) == OMP_CLAUSE
9197 && OMP_CLAUSE_CODE (clauses
) == OMP_CLAUSE_HINT
9198 && OMP_CLAUSE_CHAIN (clauses
) == NULL_TREE
);
9199 if (type_dependent_expression_p (OMP_CLAUSE_HINT_EXPR (clauses
))
9200 || TREE_CODE (OMP_CLAUSE_HINT_EXPR (clauses
)) != INTEGER_CST
)
9205 lhs
= build_non_dependent_expr (lhs
);
9207 rhs
= build_non_dependent_expr (rhs
);
9209 v
= build_non_dependent_expr (v
);
9211 lhs1
= build_non_dependent_expr (lhs1
);
9213 rhs1
= build_non_dependent_expr (rhs1
);
9218 bool swapped
= false;
9219 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
9221 std::swap (rhs
, rhs1
);
9222 swapped
= !commutative_tree_code (opcode
);
9224 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
9226 if (code
== OMP_ATOMIC
)
9227 error ("%<#pragma omp atomic update%> uses two different "
9228 "expressions for memory");
9230 error ("%<#pragma omp atomic capture%> uses two different "
9231 "expressions for memory");
9234 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
9236 if (code
== OMP_ATOMIC
)
9237 error ("%<#pragma omp atomic update%> uses two different "
9238 "expressions for memory");
9240 error ("%<#pragma omp atomic capture%> uses two different "
9241 "expressions for memory");
9244 stmt
= c_finish_omp_atomic (loc
, code
, opcode
, lhs
, rhs
,
9245 v
, lhs1
, rhs1
, swapped
, mo
,
9246 processing_template_decl
!= 0);
9247 if (stmt
== error_mark_node
)
9250 if (processing_template_decl
)
9252 if (code
== OMP_ATOMIC_READ
)
9254 stmt
= build_min_nt_loc (loc
, OMP_ATOMIC_READ
, orig_lhs
);
9255 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
9256 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
9260 if (opcode
== NOP_EXPR
)
9261 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
9263 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
9265 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
9266 COMPOUND_EXPR
, orig_rhs1
, stmt
);
9267 if (code
!= OMP_ATOMIC
)
9269 stmt
= build_min_nt_loc (loc
, code
, orig_lhs1
, stmt
);
9270 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
9271 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
9274 stmt
= build2 (OMP_ATOMIC
, void_type_node
,
9275 clauses
? clauses
: integer_zero_node
, stmt
);
9276 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
9277 SET_EXPR_LOCATION (stmt
, loc
);
9280 /* Avoid -Wunused-value warnings here, the whole construct has side-effects
9281 and even if it might be wrapped from fold-const.c or c-omp.c wrapped
9282 in some tree that appears to be unused, the value is not unused. */
9283 warning_sentinel
w (warn_unused_value
);
9284 finish_expr_stmt (stmt
);
9288 finish_omp_barrier (void)
9290 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
9292 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9293 finish_expr_stmt (stmt
);
9297 finish_omp_depobj (location_t loc
, tree depobj
,
9298 enum omp_clause_depend_kind kind
, tree clause
)
9300 if (!error_operand_p (depobj
) && !type_dependent_expression_p (depobj
))
9302 if (!lvalue_p (depobj
))
9304 error_at (EXPR_LOC_OR_LOC (depobj
, loc
),
9305 "%<depobj%> expression is not lvalue expression");
9306 depobj
= error_mark_node
;
9310 if (processing_template_decl
)
9312 if (clause
== NULL_TREE
)
9313 clause
= build_int_cst (integer_type_node
, kind
);
9314 add_stmt (build_min_nt_loc (loc
, OMP_DEPOBJ
, depobj
, clause
));
9318 if (!error_operand_p (depobj
))
9320 tree addr
= cp_build_addr_expr (depobj
, tf_warning_or_error
);
9321 if (addr
== error_mark_node
)
9322 depobj
= error_mark_node
;
9324 depobj
= cp_build_indirect_ref (addr
, RO_UNARY_STAR
,
9325 tf_warning_or_error
);
9328 c_finish_omp_depobj (loc
, depobj
, kind
, clause
);
9332 finish_omp_flush (int mo
)
9334 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
9336 if (mo
!= MEMMODEL_LAST
)
9338 fn
= builtin_decl_explicit (BUILT_IN_ATOMIC_THREAD_FENCE
);
9339 vec
->quick_push (build_int_cst (integer_type_node
, mo
));
9341 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9342 finish_expr_stmt (stmt
);
9346 finish_omp_taskwait (void)
9348 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
9350 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9351 finish_expr_stmt (stmt
);
9355 finish_omp_taskyield (void)
9357 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
9359 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9360 finish_expr_stmt (stmt
);
9364 finish_omp_cancel (tree clauses
)
9366 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
9368 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
9370 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
9372 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
9374 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
9378 error ("%<#pragma omp cancel%> must specify one of "
9379 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
9383 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
9384 if (ifc
!= NULL_TREE
)
9386 if (OMP_CLAUSE_IF_MODIFIER (ifc
) != ERROR_MARK
9387 && OMP_CLAUSE_IF_MODIFIER (ifc
) != VOID_CST
)
9388 error_at (OMP_CLAUSE_LOCATION (ifc
),
9389 "expected %<cancel%> %<if%> clause modifier");
9392 tree ifc2
= omp_find_clause (OMP_CLAUSE_CHAIN (ifc
), OMP_CLAUSE_IF
);
9393 if (ifc2
!= NULL_TREE
)
9395 gcc_assert (OMP_CLAUSE_IF_MODIFIER (ifc
) == VOID_CST
9396 && OMP_CLAUSE_IF_MODIFIER (ifc2
) != ERROR_MARK
9397 && OMP_CLAUSE_IF_MODIFIER (ifc2
) != VOID_CST
);
9398 error_at (OMP_CLAUSE_LOCATION (ifc2
),
9399 "expected %<cancel%> %<if%> clause modifier");
9403 if (!processing_template_decl
)
9404 ifc
= maybe_convert_cond (OMP_CLAUSE_IF_EXPR (ifc
));
9406 ifc
= build_x_binary_op (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
9407 OMP_CLAUSE_IF_EXPR (ifc
), ERROR_MARK
,
9408 integer_zero_node
, ERROR_MARK
,
9409 NULL
, tf_warning_or_error
);
9412 ifc
= boolean_true_node
;
9413 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
9414 vec
->quick_push (ifc
);
9415 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9416 finish_expr_stmt (stmt
);
9420 finish_omp_cancellation_point (tree clauses
)
9422 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
9424 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
9426 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
9428 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
9430 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
9434 error ("%<#pragma omp cancellation point%> must specify one of "
9435 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
9439 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
9440 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9441 finish_expr_stmt (stmt
);
9444 /* Begin a __transaction_atomic or __transaction_relaxed statement.
9445 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
9446 should create an extra compound stmt. */
9449 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
9454 *pcompound
= begin_compound_stmt (0);
9456 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
9458 /* Only add the statement to the function if support enabled. */
9462 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
9463 ? G_("%<__transaction_relaxed%> without "
9464 "transactional memory support enabled")
9465 : G_("%<__transaction_atomic%> without "
9466 "transactional memory support enabled")));
9468 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
9469 TREE_SIDE_EFFECTS (r
) = 1;
9473 /* End a __transaction_atomic or __transaction_relaxed statement.
9474 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
9475 and we should end the compound. If NOEX is non-NULL, we wrap the body in
9476 a MUST_NOT_THROW_EXPR with NOEX as condition. */
9479 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
9481 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
9482 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
9483 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
9484 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
9486 /* noexcept specifications are not allowed for function transactions. */
9487 gcc_assert (!(noex
&& compound_stmt
));
9490 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
9492 protected_set_expr_location
9493 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
9494 TREE_SIDE_EFFECTS (body
) = 1;
9495 TRANSACTION_EXPR_BODY (stmt
) = body
;
9499 finish_compound_stmt (compound_stmt
);
9502 /* Build a __transaction_atomic or __transaction_relaxed expression. If
9503 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
9507 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
9512 expr
= build_must_not_throw_expr (expr
, noex
);
9513 protected_set_expr_location (expr
, loc
);
9514 TREE_SIDE_EFFECTS (expr
) = 1;
9516 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
9517 if (flags
& TM_STMT_ATTR_RELAXED
)
9518 TRANSACTION_EXPR_RELAXED (ret
) = 1;
9519 TREE_SIDE_EFFECTS (ret
) = 1;
9520 SET_EXPR_LOCATION (ret
, loc
);
9525 init_cp_semantics (void)
9529 /* Build a STATIC_ASSERT for a static assertion with the condition
9530 CONDITION and the message text MESSAGE. LOCATION is the location
9531 of the static assertion in the source code. When MEMBER_P, this
9532 static assertion is a member of a class. */
9534 finish_static_assert (tree condition
, tree message
, location_t location
,
9537 tsubst_flags_t complain
= tf_warning_or_error
;
9539 if (message
== NULL_TREE
9540 || message
== error_mark_node
9541 || condition
== NULL_TREE
9542 || condition
== error_mark_node
)
9545 if (check_for_bare_parameter_packs (condition
))
9546 condition
= error_mark_node
;
9548 if (instantiation_dependent_expression_p (condition
))
9550 /* We're in a template; build a STATIC_ASSERT and put it in
9554 assertion
= make_node (STATIC_ASSERT
);
9555 STATIC_ASSERT_CONDITION (assertion
) = condition
;
9556 STATIC_ASSERT_MESSAGE (assertion
) = message
;
9557 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
9560 maybe_add_class_template_decl_list (current_class_type
,
9564 add_stmt (assertion
);
9569 /* Fold the expression and convert it to a boolean value. */
9570 condition
= perform_implicit_conversion_flags (boolean_type_node
, condition
,
9571 complain
, LOOKUP_NORMAL
);
9572 condition
= fold_non_dependent_expr (condition
, complain
,
9573 /*manifestly_const_eval=*/true);
9575 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
9576 /* Do nothing; the condition is satisfied. */
9580 location_t saved_loc
= input_location
;
9582 input_location
= location
;
9583 if (TREE_CODE (condition
) == INTEGER_CST
9584 && integer_zerop (condition
))
9586 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
9587 (TREE_TYPE (TREE_TYPE (message
))));
9588 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
9589 /* Report the error. */
9591 error ("static assertion failed");
9593 error ("static assertion failed: %s",
9594 TREE_STRING_POINTER (message
));
9596 else if (condition
&& condition
!= error_mark_node
)
9598 error ("non-constant condition for static assertion");
9599 if (require_rvalue_constant_expression (condition
))
9600 cxx_constant_value (condition
);
9602 input_location
= saved_loc
;
9606 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
9607 suitable for use as a type-specifier.
9609 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
9610 id-expression or a class member access, FALSE when it was parsed as
9611 a full expression. */
9614 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
9615 tsubst_flags_t complain
)
9617 tree type
= NULL_TREE
;
9619 if (!expr
|| error_operand_p (expr
))
9620 return error_mark_node
;
9623 || TREE_CODE (expr
) == TYPE_DECL
9624 || (TREE_CODE (expr
) == BIT_NOT_EXPR
9625 && TYPE_P (TREE_OPERAND (expr
, 0))))
9627 if (complain
& tf_error
)
9628 error ("argument to %<decltype%> must be an expression");
9629 return error_mark_node
;
9632 /* Depending on the resolution of DR 1172, we may later need to distinguish
9633 instantiation-dependent but not type-dependent expressions so that, say,
9634 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
9635 if (instantiation_dependent_uneval_expression_p (expr
))
9637 type
= cxx_make_type (DECLTYPE_TYPE
);
9638 DECLTYPE_TYPE_EXPR (type
) = expr
;
9639 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
9640 = id_expression_or_member_access_p
;
9641 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9646 /* The type denoted by decltype(e) is defined as follows: */
9648 expr
= resolve_nondeduced_context (expr
, complain
);
9650 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
9651 return error_mark_node
;
9653 if (type_unknown_p (expr
))
9655 if (complain
& tf_error
)
9656 error ("%<decltype%> cannot resolve address of overloaded function");
9657 return error_mark_node
;
9660 /* To get the size of a static data member declared as an array of
9661 unknown bound, we need to instantiate it. */
9663 && VAR_HAD_UNKNOWN_BOUND (expr
)
9664 && DECL_TEMPLATE_INSTANTIATION (expr
))
9665 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
9667 if (id_expression_or_member_access_p
)
9669 /* If e is an id-expression or a class member access (5.2.5
9670 [expr.ref]), decltype(e) is defined as the type of the entity
9671 named by e. If there is no such entity, or e names a set of
9672 overloaded functions, the program is ill-formed. */
9673 if (identifier_p (expr
))
9674 expr
= lookup_name (expr
);
9676 if (INDIRECT_REF_P (expr
)
9677 || TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
9678 /* This can happen when the expression is, e.g., "a.b". Just
9679 look at the underlying operand. */
9680 expr
= TREE_OPERAND (expr
, 0);
9682 if (TREE_CODE (expr
) == OFFSET_REF
9683 || TREE_CODE (expr
) == MEMBER_REF
9684 || TREE_CODE (expr
) == SCOPE_REF
)
9685 /* We're only interested in the field itself. If it is a
9686 BASELINK, we will need to see through it in the next
9688 expr
= TREE_OPERAND (expr
, 1);
9690 if (BASELINK_P (expr
))
9691 /* See through BASELINK nodes to the underlying function. */
9692 expr
= BASELINK_FUNCTIONS (expr
);
9694 /* decltype of a decomposition name drops references in the tuple case
9695 (unlike decltype of a normal variable) and keeps cv-qualifiers from
9696 the containing object in the other cases (unlike decltype of a member
9697 access expression). */
9698 if (DECL_DECOMPOSITION_P (expr
))
9700 if (DECL_HAS_VALUE_EXPR_P (expr
))
9701 /* Expr is an array or struct subobject proxy, handle
9702 bit-fields properly. */
9703 return unlowered_expr_type (expr
);
9705 /* Expr is a reference variable for the tuple case. */
9706 return lookup_decomp_type (expr
);
9709 switch (TREE_CODE (expr
))
9712 if (DECL_BIT_FIELD_TYPE (expr
))
9714 type
= DECL_BIT_FIELD_TYPE (expr
);
9717 /* Fall through for fields that aren't bitfields. */
9725 case TEMPLATE_PARM_INDEX
:
9726 expr
= mark_type_use (expr
);
9727 type
= TREE_TYPE (expr
);
9731 type
= error_mark_node
;
9736 mark_type_use (expr
);
9737 type
= is_bitfield_expr_with_lowered_type (expr
);
9739 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
9747 /* We can get here when the id-expression refers to an
9748 enumerator or non-type template parameter. */
9749 type
= TREE_TYPE (expr
);
9753 /* Handle instantiated template non-type arguments. */
9754 type
= TREE_TYPE (expr
);
9760 /* Within a lambda-expression:
9762 Every occurrence of decltype((x)) where x is a possibly
9763 parenthesized id-expression that names an entity of
9764 automatic storage duration is treated as if x were
9765 transformed into an access to a corresponding data member
9766 of the closure type that would have been declared if x
9767 were a use of the denoted entity. */
9768 if (outer_automatic_var_p (expr
)
9769 && current_function_decl
9770 && LAMBDA_FUNCTION_P (current_function_decl
))
9771 type
= capture_decltype (expr
);
9772 else if (error_operand_p (expr
))
9773 type
= error_mark_node
;
9774 else if (expr
== current_class_ptr
)
9775 /* If the expression is just "this", we want the
9776 cv-unqualified pointer for the "this" type. */
9777 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
9780 /* Otherwise, where T is the type of e, if e is an lvalue,
9781 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
9782 cp_lvalue_kind clk
= lvalue_kind (expr
);
9783 type
= unlowered_expr_type (expr
);
9784 gcc_assert (!TYPE_REF_P (type
));
9786 /* For vector types, pick a non-opaque variant. */
9787 if (VECTOR_TYPE_P (type
))
9788 type
= strip_typedefs (type
);
9790 if (clk
!= clk_none
&& !(clk
& clk_class
))
9791 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
9798 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
9799 __has_nothrow_copy, depending on assign_p. Returns true iff all
9800 the copy {ctor,assign} fns are nothrow. */
9803 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
9805 tree fns
= NULL_TREE
;
9807 if (assign_p
|| TYPE_HAS_COPY_CTOR (type
))
9808 fns
= get_class_binding (type
, assign_p
? assign_op_identifier
9811 bool saw_copy
= false;
9812 for (ovl_iterator
iter (fns
); iter
; ++iter
)
9816 if (copy_fn_p (fn
) > 0)
9819 if (!maybe_instantiate_noexcept (fn
)
9820 || !TYPE_NOTHROW_P (TREE_TYPE (fn
)))
9828 /* Actually evaluates the trait. */
9831 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
9833 enum tree_code type_code1
;
9836 type_code1
= TREE_CODE (type1
);
9840 case CPTK_HAS_NOTHROW_ASSIGN
:
9841 type1
= strip_array_types (type1
);
9842 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9843 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
9844 || (CLASS_TYPE_P (type1
)
9845 && classtype_has_nothrow_assign_or_copy_p (type1
,
9848 case CPTK_HAS_TRIVIAL_ASSIGN
:
9849 /* ??? The standard seems to be missing the "or array of such a class
9850 type" wording for this trait. */
9851 type1
= strip_array_types (type1
);
9852 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9853 && (trivial_type_p (type1
)
9854 || (CLASS_TYPE_P (type1
)
9855 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
9857 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9858 type1
= strip_array_types (type1
);
9859 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
9860 || (CLASS_TYPE_P (type1
)
9861 && (t
= locate_ctor (type1
))
9862 && maybe_instantiate_noexcept (t
)
9863 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
9865 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9866 type1
= strip_array_types (type1
);
9867 return (trivial_type_p (type1
)
9868 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
9870 case CPTK_HAS_NOTHROW_COPY
:
9871 type1
= strip_array_types (type1
);
9872 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
9873 || (CLASS_TYPE_P (type1
)
9874 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
9876 case CPTK_HAS_TRIVIAL_COPY
:
9877 /* ??? The standard seems to be missing the "or array of such a class
9878 type" wording for this trait. */
9879 type1
= strip_array_types (type1
);
9880 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9881 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
9883 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9884 type1
= strip_array_types (type1
);
9885 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9886 || (CLASS_TYPE_P (type1
)
9887 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
9889 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9890 return type_has_virtual_destructor (type1
);
9892 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9893 return type_has_unique_obj_representations (type1
);
9895 case CPTK_IS_ABSTRACT
:
9896 return ABSTRACT_CLASS_TYPE_P (type1
);
9898 case CPTK_IS_AGGREGATE
:
9899 return CP_AGGREGATE_TYPE_P (type1
);
9901 case CPTK_IS_BASE_OF
:
9902 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9903 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9904 || DERIVED_FROM_P (type1
, type2
)));
9907 return NON_UNION_CLASS_TYPE_P (type1
);
9910 return NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
);
9913 return type_code1
== ENUMERAL_TYPE
;
9916 return CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
);
9918 case CPTK_IS_LITERAL_TYPE
:
9919 return literal_type_p (type1
);
9922 return pod_type_p (type1
);
9924 case CPTK_IS_POLYMORPHIC
:
9925 return CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
);
9927 case CPTK_IS_SAME_AS
:
9928 return same_type_p (type1
, type2
);
9930 case CPTK_IS_STD_LAYOUT
:
9931 return std_layout_type_p (type1
);
9933 case CPTK_IS_TRIVIAL
:
9934 return trivial_type_p (type1
);
9936 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9937 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9939 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9940 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9942 case CPTK_IS_TRIVIALLY_COPYABLE
:
9943 return trivially_copyable_p (type1
);
9946 return type_code1
== UNION_TYPE
;
9948 case CPTK_IS_ASSIGNABLE
:
9949 return is_xible (MODIFY_EXPR
, type1
, type2
);
9951 case CPTK_IS_CONSTRUCTIBLE
:
9952 return is_xible (INIT_EXPR
, type1
, type2
);
9960 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9961 void, or a complete type, returns true, otherwise false. */
9964 check_trait_type (tree type
)
9966 if (type
== NULL_TREE
)
9969 if (TREE_CODE (type
) == TREE_LIST
)
9970 return (check_trait_type (TREE_VALUE (type
))
9971 && check_trait_type (TREE_CHAIN (type
)));
9973 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9974 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9977 if (VOID_TYPE_P (type
))
9980 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9983 /* Process a trait expression. */
9986 finish_trait_expr (location_t loc
, cp_trait_kind kind
, tree type1
, tree type2
)
9988 if (type1
== error_mark_node
9989 || type2
== error_mark_node
)
9990 return error_mark_node
;
9992 if (processing_template_decl
)
9994 tree trait_expr
= make_node (TRAIT_EXPR
);
9995 TREE_TYPE (trait_expr
) = boolean_type_node
;
9996 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9997 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9998 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9999 TRAIT_EXPR_LOCATION (trait_expr
) = loc
;
10005 case CPTK_HAS_NOTHROW_ASSIGN
:
10006 case CPTK_HAS_TRIVIAL_ASSIGN
:
10007 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
10008 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
10009 case CPTK_HAS_NOTHROW_COPY
:
10010 case CPTK_HAS_TRIVIAL_COPY
:
10011 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
10012 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
10013 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
10014 case CPTK_IS_ABSTRACT
:
10015 case CPTK_IS_AGGREGATE
:
10016 case CPTK_IS_EMPTY
:
10017 case CPTK_IS_FINAL
:
10018 case CPTK_IS_LITERAL_TYPE
:
10020 case CPTK_IS_POLYMORPHIC
:
10021 case CPTK_IS_STD_LAYOUT
:
10022 case CPTK_IS_TRIVIAL
:
10023 case CPTK_IS_TRIVIALLY_COPYABLE
:
10024 if (!check_trait_type (type1
))
10025 return error_mark_node
;
10028 case CPTK_IS_ASSIGNABLE
:
10029 case CPTK_IS_CONSTRUCTIBLE
:
10032 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
10033 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
10034 if (!check_trait_type (type1
)
10035 || !check_trait_type (type2
))
10036 return error_mark_node
;
10039 case CPTK_IS_BASE_OF
:
10040 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
10041 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
10042 && !complete_type_or_else (type2
, NULL_TREE
))
10043 /* We already issued an error. */
10044 return error_mark_node
;
10047 case CPTK_IS_CLASS
:
10049 case CPTK_IS_UNION
:
10050 case CPTK_IS_SAME_AS
:
10054 gcc_unreachable ();
10057 tree val
= (trait_expr_value (kind
, type1
, type2
)
10058 ? boolean_true_node
: boolean_false_node
);
10059 return maybe_wrap_with_location (val
, loc
);
10062 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
10063 which is ignored for C++. */
10066 set_float_const_decimal64 (void)
10071 clear_float_const_decimal64 (void)
10076 float_const_decimal64_p (void)
10082 /* Return true if T designates the implied `this' parameter. */
10085 is_this_parameter (tree t
)
10087 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
10089 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
10090 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
10094 /* Insert the deduced return type for an auto function. */
10097 apply_deduced_return_type (tree fco
, tree return_type
)
10101 if (return_type
== error_mark_node
)
10104 if (DECL_CONV_FN_P (fco
))
10105 DECL_NAME (fco
) = make_conv_op_name (return_type
);
10107 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
10109 result
= DECL_RESULT (fco
);
10110 if (result
== NULL_TREE
)
10112 if (TREE_TYPE (result
) == return_type
)
10115 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
10116 && !complete_type_or_else (return_type
, NULL_TREE
))
10119 /* We already have a DECL_RESULT from start_preparsed_function.
10120 Now we need to redo the work it and allocate_struct_function
10121 did to reflect the new type. */
10122 gcc_assert (current_function_decl
== fco
);
10123 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
10124 TYPE_MAIN_VARIANT (return_type
));
10125 DECL_ARTIFICIAL (result
) = 1;
10126 DECL_IGNORED_P (result
) = 1;
10127 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
10130 DECL_RESULT (fco
) = result
;
10132 if (!processing_template_decl
)
10134 bool aggr
= aggregate_value_p (result
, fco
);
10135 #ifdef PCC_STATIC_STRUCT_RETURN
10136 cfun
->returns_pcc_struct
= aggr
;
10138 cfun
->returns_struct
= aggr
;
10142 /* DECL is a local variable or parameter from the surrounding scope of a
10143 lambda-expression. Returns the decltype for a use of the capture field
10144 for DECL even if it hasn't been captured yet. */
10147 capture_decltype (tree decl
)
10149 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
10150 tree cap
= lookup_name_real (DECL_NAME (decl
), /*type*/0, /*nonclass*/1,
10151 /*block_p=*/true, /*ns*/0, LOOKUP_HIDDEN
);
10154 if (cap
&& is_capture_proxy (cap
))
10155 type
= TREE_TYPE (cap
);
10157 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
10160 error ("%qD is not captured", decl
);
10161 return error_mark_node
;
10164 type
= TREE_TYPE (decl
);
10165 if (TYPE_REF_P (type
)
10166 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
10167 type
= TREE_TYPE (type
);
10170 case CPLD_REFERENCE
:
10171 type
= TREE_TYPE (decl
);
10172 if (!TYPE_REF_P (type
))
10173 type
= build_reference_type (TREE_TYPE (decl
));
10177 gcc_unreachable ();
10180 if (!TYPE_REF_P (type
))
10182 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
10183 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
10184 |TYPE_QUAL_CONST
));
10185 type
= build_reference_type (type
);
10190 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
10191 this is a right unary fold. Otherwise it is a left unary fold. */
10194 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
10196 /* Build a pack expansion (assuming expr has pack type). */
10197 if (!uses_parameter_packs (expr
))
10199 error_at (location_of (expr
), "operand of fold expression has no "
10200 "unexpanded parameter packs");
10201 return error_mark_node
;
10203 tree pack
= make_pack_expansion (expr
);
10205 /* Build the fold expression. */
10206 tree code
= build_int_cstu (integer_type_node
, abs (op
));
10207 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
10208 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
10213 finish_left_unary_fold_expr (tree expr
, int op
)
10215 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
10219 finish_right_unary_fold_expr (tree expr
, int op
)
10221 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
10224 /* Build a binary fold expression over EXPR1 and EXPR2. The
10225 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
10226 has an unexpanded parameter pack). */
10229 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
10231 pack
= make_pack_expansion (pack
);
10232 tree code
= build_int_cstu (integer_type_node
, abs (op
));
10233 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
10234 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
10239 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
10241 // Determine which expr has an unexpanded parameter pack and
10242 // set the pack and initial term.
10243 bool pack1
= uses_parameter_packs (expr1
);
10244 bool pack2
= uses_parameter_packs (expr2
);
10245 if (pack1
&& !pack2
)
10246 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
10247 else if (pack2
&& !pack1
)
10248 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
10252 error ("both arguments in binary fold have unexpanded parameter packs");
10254 error ("no unexpanded parameter packs in binary fold");
10256 return error_mark_node
;
10259 /* Finish __builtin_launder (arg). */
10262 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
10264 tree orig_arg
= arg
;
10265 if (!type_dependent_expression_p (arg
))
10266 arg
= decay_conversion (arg
, complain
);
10267 if (error_operand_p (arg
))
10268 return error_mark_node
;
10269 if (!type_dependent_expression_p (arg
)
10270 && !TYPE_PTR_P (TREE_TYPE (arg
)))
10272 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
10273 return error_mark_node
;
10275 if (processing_template_decl
)
10277 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
10278 TREE_TYPE (arg
), 1, arg
);
10281 /* Finish __builtin_convertvector (arg, type). */
10284 cp_build_vec_convert (tree arg
, location_t loc
, tree type
,
10285 tsubst_flags_t complain
)
10287 if (error_operand_p (type
))
10288 return error_mark_node
;
10289 if (error_operand_p (arg
))
10290 return error_mark_node
;
10292 tree ret
= NULL_TREE
;
10293 if (!type_dependent_expression_p (arg
) && !dependent_type_p (type
))
10294 ret
= c_build_vec_convert (cp_expr_loc_or_input_loc (arg
), arg
,
10295 loc
, type
, (complain
& tf_error
) != 0);
10297 if (!processing_template_decl
)
10300 return build_call_expr_internal_loc (loc
, IFN_VEC_CONVERT
, type
, 1, arg
);
10303 #include "gt-cp-semantics.h"