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-2018 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 (processing_template_decl
)
652 if (warn_sequence_point
)
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
)
662 warning_at (cp_expr_loc_or_loc (cond
, input_location
), OPT_Wparentheses
,
663 "suggest parentheses around assignment used as truth value");
664 TREE_NO_WARNING (cond
) = 1;
667 return condition_conversion (cond
);
670 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
673 finish_expr_stmt (tree expr
)
676 location_t loc
= EXPR_LOCATION (expr
);
678 if (expr
!= NULL_TREE
)
680 /* If we ran into a problem, make sure we complained. */
681 gcc_assert (expr
!= error_mark_node
|| seen_error ());
683 if (!processing_template_decl
)
685 if (warn_sequence_point
)
686 verify_sequence_points (expr
);
687 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
689 else if (!type_dependent_expression_p (expr
))
690 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
691 tf_warning_or_error
);
693 if (check_for_bare_parameter_packs (expr
))
694 expr
= error_mark_node
;
696 /* Simplification of inner statement expressions, compound exprs,
697 etc can result in us already having an EXPR_STMT. */
698 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
700 if (TREE_CODE (expr
) != EXPR_STMT
)
701 expr
= build_stmt (loc
, EXPR_STMT
, expr
);
702 expr
= maybe_cleanup_point_expr_void (expr
);
712 /* Begin an if-statement. Returns a newly created IF_STMT if
719 scope
= do_pushlevel (sk_cond
);
720 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
721 NULL_TREE
, NULL_TREE
, scope
);
722 current_binding_level
->this_entity
= r
;
723 begin_cond (&IF_COND (r
));
727 /* Process the COND of an if-statement, which may be given by
731 finish_if_stmt_cond (tree cond
, tree if_stmt
)
733 cond
= maybe_convert_cond (cond
);
734 if (IF_STMT_CONSTEXPR_P (if_stmt
)
735 && !type_dependent_expression_p (cond
)
736 && require_constant_expression (cond
)
737 && !instantiation_dependent_expression_p (cond
)
738 /* Wait until instantiation time, since only then COND has been
739 converted to bool. */
740 && TYPE_MAIN_VARIANT (TREE_TYPE (cond
)) == boolean_type_node
)
742 cond
= instantiate_non_dependent_expr (cond
);
743 cond
= cxx_constant_value (cond
, NULL_TREE
);
745 finish_cond (&IF_COND (if_stmt
), cond
);
747 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
751 /* Finish the then-clause of an if-statement, which may be given by
755 finish_then_clause (tree if_stmt
)
757 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
761 /* Begin the else-clause of an if-statement. */
764 begin_else_clause (tree if_stmt
)
766 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
769 /* Finish the else-clause of an if-statement, which may be given by
773 finish_else_clause (tree if_stmt
)
775 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
778 /* Finish an if-statement. */
781 finish_if_stmt (tree if_stmt
)
783 tree scope
= IF_SCOPE (if_stmt
);
784 IF_SCOPE (if_stmt
) = NULL
;
785 add_stmt (do_poplevel (scope
));
788 /* Begin a while-statement. Returns a newly created WHILE_STMT if
792 begin_while_stmt (void)
795 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
797 WHILE_BODY (r
) = do_pushlevel (sk_block
);
798 begin_cond (&WHILE_COND (r
));
802 /* Process the COND of a while-statement, which may be given by
806 finish_while_stmt_cond (tree cond
, tree while_stmt
, bool ivdep
,
807 unsigned short unroll
)
809 cond
= maybe_convert_cond (cond
);
810 finish_cond (&WHILE_COND (while_stmt
), cond
);
811 begin_maybe_infinite_loop (cond
);
812 if (ivdep
&& cond
!= error_mark_node
)
813 WHILE_COND (while_stmt
) = build3 (ANNOTATE_EXPR
,
814 TREE_TYPE (WHILE_COND (while_stmt
)),
815 WHILE_COND (while_stmt
),
816 build_int_cst (integer_type_node
,
817 annot_expr_ivdep_kind
),
819 if (unroll
&& cond
!= error_mark_node
)
820 WHILE_COND (while_stmt
) = build3 (ANNOTATE_EXPR
,
821 TREE_TYPE (WHILE_COND (while_stmt
)),
822 WHILE_COND (while_stmt
),
823 build_int_cst (integer_type_node
,
824 annot_expr_unroll_kind
),
825 build_int_cst (integer_type_node
,
827 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
830 /* Finish a while-statement, which may be given by WHILE_STMT. */
833 finish_while_stmt (tree while_stmt
)
835 end_maybe_infinite_loop (boolean_true_node
);
836 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
839 /* Begin a do-statement. Returns a newly created DO_STMT if
845 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
846 begin_maybe_infinite_loop (boolean_true_node
);
848 DO_BODY (r
) = push_stmt_list ();
852 /* Finish the body of a do-statement, which may be given by DO_STMT. */
855 finish_do_body (tree do_stmt
)
857 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
859 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
860 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
862 if (IS_EMPTY_STMT (body
))
863 warning (OPT_Wempty_body
,
864 "suggest explicit braces around empty body in %<do%> statement");
867 /* Finish a do-statement, which may be given by DO_STMT, and whose
868 COND is as indicated. */
871 finish_do_stmt (tree cond
, tree do_stmt
, bool ivdep
, unsigned short unroll
)
873 cond
= maybe_convert_cond (cond
);
874 end_maybe_infinite_loop (cond
);
875 if (ivdep
&& cond
!= error_mark_node
)
876 cond
= build3 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
877 build_int_cst (integer_type_node
, annot_expr_ivdep_kind
),
879 if (unroll
&& cond
!= error_mark_node
)
880 cond
= build3 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
881 build_int_cst (integer_type_node
, annot_expr_unroll_kind
),
882 build_int_cst (integer_type_node
, unroll
));
883 DO_COND (do_stmt
) = cond
;
886 /* Finish a return-statement. The EXPRESSION returned, if any, is as
890 finish_return_stmt (tree expr
)
895 expr
= check_return_expr (expr
, &no_warning
);
897 if (error_operand_p (expr
)
898 || (flag_openmp
&& !check_omp_return ()))
900 /* Suppress -Wreturn-type for this function. */
901 if (warn_return_type
)
902 TREE_NO_WARNING (current_function_decl
) = true;
903 return error_mark_node
;
906 if (!processing_template_decl
)
908 if (warn_sequence_point
)
909 verify_sequence_points (expr
);
911 if (DECL_DESTRUCTOR_P (current_function_decl
)
912 || (DECL_CONSTRUCTOR_P (current_function_decl
)
913 && targetm
.cxx
.cdtor_returns_this ()))
915 /* Similarly, all destructors must run destructors for
916 base-classes before returning. So, all returns in a
917 destructor get sent to the DTOR_LABEL; finish_function emits
918 code to return a value there. */
919 return finish_goto_stmt (cdtor_label
);
923 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
924 TREE_NO_WARNING (r
) |= no_warning
;
925 r
= maybe_cleanup_point_expr_void (r
);
931 /* Begin the scope of a for-statement or a range-for-statement.
932 Both the returned trees are to be used in a call to
933 begin_for_stmt or begin_range_for_stmt. */
936 begin_for_scope (tree
*init
)
938 tree scope
= do_pushlevel (sk_for
);
940 if (processing_template_decl
)
941 *init
= push_stmt_list ();
948 /* Begin a for-statement. Returns a new FOR_STMT.
949 SCOPE and INIT should be the return of begin_for_scope,
953 begin_for_stmt (tree scope
, tree init
)
957 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
958 NULL_TREE
, NULL_TREE
, NULL_TREE
);
960 if (scope
== NULL_TREE
)
963 scope
= begin_for_scope (&init
);
966 FOR_INIT_STMT (r
) = init
;
967 FOR_SCOPE (r
) = scope
;
972 /* Finish the init-statement of a for-statement, which may be
973 given by FOR_STMT. */
976 finish_init_stmt (tree for_stmt
)
978 if (processing_template_decl
)
979 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
981 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
982 begin_cond (&FOR_COND (for_stmt
));
985 /* Finish the COND of a for-statement, which may be given by
989 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
, unsigned short unroll
)
991 cond
= maybe_convert_cond (cond
);
992 finish_cond (&FOR_COND (for_stmt
), cond
);
993 begin_maybe_infinite_loop (cond
);
994 if (ivdep
&& cond
!= error_mark_node
)
995 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
996 TREE_TYPE (FOR_COND (for_stmt
)),
998 build_int_cst (integer_type_node
,
999 annot_expr_ivdep_kind
),
1001 if (unroll
&& cond
!= error_mark_node
)
1002 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
1003 TREE_TYPE (FOR_COND (for_stmt
)),
1004 FOR_COND (for_stmt
),
1005 build_int_cst (integer_type_node
,
1006 annot_expr_unroll_kind
),
1007 build_int_cst (integer_type_node
,
1009 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
1012 /* Finish the increment-EXPRESSION in a for-statement, which may be
1013 given by FOR_STMT. */
1016 finish_for_expr (tree expr
, tree for_stmt
)
1020 /* If EXPR is an overloaded function, issue an error; there is no
1021 context available to use to perform overload resolution. */
1022 if (type_unknown_p (expr
))
1024 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
1025 expr
= error_mark_node
;
1027 if (!processing_template_decl
)
1029 if (warn_sequence_point
)
1030 verify_sequence_points (expr
);
1031 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1032 tf_warning_or_error
);
1034 else if (!type_dependent_expression_p (expr
))
1035 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1036 tf_warning_or_error
);
1037 expr
= maybe_cleanup_point_expr_void (expr
);
1038 if (check_for_bare_parameter_packs (expr
))
1039 expr
= error_mark_node
;
1040 FOR_EXPR (for_stmt
) = expr
;
1043 /* Finish the body of a for-statement, which may be given by
1044 FOR_STMT. The increment-EXPR for the loop must be
1046 It can also finish RANGE_FOR_STMT. */
1049 finish_for_stmt (tree for_stmt
)
1051 end_maybe_infinite_loop (boolean_true_node
);
1053 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1054 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1056 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1058 /* Pop the scope for the body of the loop. */
1059 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1060 ? &RANGE_FOR_SCOPE (for_stmt
)
1061 : &FOR_SCOPE (for_stmt
));
1062 tree scope
= *scope_ptr
;
1065 /* During parsing of the body, range for uses "__for_{range,begin,end} "
1066 decl names to make those unaccessible by code in the body.
1067 Change it to ones with underscore instead of space, so that it can
1068 be inspected in the debugger. */
1069 tree range_for_decl
[3] = { NULL_TREE
, NULL_TREE
, NULL_TREE
};
1070 gcc_assert (CPTI_FOR_BEGIN__IDENTIFIER
== CPTI_FOR_RANGE__IDENTIFIER
+ 1
1071 && CPTI_FOR_END__IDENTIFIER
== CPTI_FOR_RANGE__IDENTIFIER
+ 2
1072 && CPTI_FOR_RANGE_IDENTIFIER
== CPTI_FOR_RANGE__IDENTIFIER
+ 3
1073 && CPTI_FOR_BEGIN_IDENTIFIER
== CPTI_FOR_BEGIN__IDENTIFIER
+ 3
1074 && CPTI_FOR_END_IDENTIFIER
== CPTI_FOR_END__IDENTIFIER
+ 3);
1075 for (int i
= 0; i
< 3; i
++)
1077 tree id
= cp_global_trees
[CPTI_FOR_RANGE__IDENTIFIER
+ i
];
1078 if (IDENTIFIER_BINDING (id
)
1079 && IDENTIFIER_BINDING (id
)->scope
== current_binding_level
)
1081 range_for_decl
[i
] = IDENTIFIER_BINDING (id
)->value
;
1082 gcc_assert (VAR_P (range_for_decl
[i
])
1083 && DECL_ARTIFICIAL (range_for_decl
[i
]));
1087 add_stmt (do_poplevel (scope
));
1089 for (int i
= 0; i
< 3; i
++)
1090 if (range_for_decl
[i
])
1091 DECL_NAME (range_for_decl
[i
])
1092 = cp_global_trees
[CPTI_FOR_RANGE_IDENTIFIER
+ i
];
1095 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1096 SCOPE and INIT should be the return of begin_for_scope,
1098 To finish it call finish_for_stmt(). */
1101 begin_range_for_stmt (tree scope
, tree init
)
1103 begin_maybe_infinite_loop (boolean_false_node
);
1105 tree r
= build_stmt (input_location
, RANGE_FOR_STMT
, NULL_TREE
, NULL_TREE
,
1106 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1108 if (scope
== NULL_TREE
)
1111 scope
= begin_for_scope (&init
);
1114 /* Since C++20, RANGE_FOR_STMTs can use the init tree, so save it. */
1115 RANGE_FOR_INIT_STMT (r
) = init
;
1116 RANGE_FOR_SCOPE (r
) = scope
;
1121 /* Finish the head of a range-based for statement, which may
1122 be given by RANGE_FOR_STMT. DECL must be the declaration
1123 and EXPR must be the loop expression. */
1126 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
1128 if (processing_template_decl
)
1129 RANGE_FOR_INIT_STMT (range_for_stmt
)
1130 = pop_stmt_list (RANGE_FOR_INIT_STMT (range_for_stmt
));
1131 RANGE_FOR_DECL (range_for_stmt
) = decl
;
1132 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
1133 add_stmt (range_for_stmt
);
1134 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
1137 /* Finish a break-statement. */
1140 finish_break_stmt (void)
1142 /* In switch statements break is sometimes stylistically used after
1143 a return statement. This can lead to spurious warnings about
1144 control reaching the end of a non-void function when it is
1145 inlined. Note that we are calling block_may_fallthru with
1146 language specific tree nodes; this works because
1147 block_may_fallthru returns true when given something it does not
1149 if (!block_may_fallthru (cur_stmt_list
))
1152 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1155 /* Finish a continue-statement. */
1158 finish_continue_stmt (void)
1160 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1163 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1167 begin_switch_stmt (void)
1171 scope
= do_pushlevel (sk_cond
);
1172 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1174 begin_cond (&SWITCH_STMT_COND (r
));
1179 /* Finish the cond of a switch-statement. */
1182 finish_switch_cond (tree cond
, tree switch_stmt
)
1184 tree orig_type
= NULL
;
1186 if (!processing_template_decl
)
1188 /* Convert the condition to an integer or enumeration type. */
1189 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1190 if (cond
== NULL_TREE
)
1192 error ("switch quantity not an integer");
1193 cond
= error_mark_node
;
1195 /* We want unlowered type here to handle enum bit-fields. */
1196 orig_type
= unlowered_expr_type (cond
);
1197 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1198 orig_type
= TREE_TYPE (cond
);
1199 if (cond
!= error_mark_node
)
1203 Integral promotions are performed. */
1204 cond
= perform_integral_promotions (cond
);
1205 cond
= maybe_cleanup_point_expr (cond
);
1208 if (check_for_bare_parameter_packs (cond
))
1209 cond
= error_mark_node
;
1210 else if (!processing_template_decl
&& warn_sequence_point
)
1211 verify_sequence_points (cond
);
1213 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1214 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1215 add_stmt (switch_stmt
);
1216 push_switch (switch_stmt
);
1217 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1220 /* Finish the body of a switch-statement, which may be given by
1221 SWITCH_STMT. The COND to switch on is indicated. */
1224 finish_switch_stmt (tree switch_stmt
)
1228 SWITCH_STMT_BODY (switch_stmt
) =
1229 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1232 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1233 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1234 add_stmt (do_poplevel (scope
));
1237 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1241 begin_try_block (void)
1243 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1245 TRY_STMTS (r
) = push_stmt_list ();
1249 /* Likewise, for a function-try-block. The block returned in
1250 *COMPOUND_STMT is an artificial outer scope, containing the
1251 function-try-block. */
1254 begin_function_try_block (tree
*compound_stmt
)
1257 /* This outer scope does not exist in the C++ standard, but we need
1258 a place to put __FUNCTION__ and similar variables. */
1259 *compound_stmt
= begin_compound_stmt (0);
1260 r
= begin_try_block ();
1261 FN_TRY_BLOCK_P (r
) = 1;
1265 /* Finish a try-block, which may be given by TRY_BLOCK. */
1268 finish_try_block (tree try_block
)
1270 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1271 TRY_HANDLERS (try_block
) = push_stmt_list ();
1274 /* Finish the body of a cleanup try-block, which may be given by
1278 finish_cleanup_try_block (tree try_block
)
1280 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1283 /* Finish an implicitly generated try-block, with a cleanup is given
1287 finish_cleanup (tree cleanup
, tree try_block
)
1289 TRY_HANDLERS (try_block
) = cleanup
;
1290 CLEANUP_P (try_block
) = 1;
1293 /* Likewise, for a function-try-block. */
1296 finish_function_try_block (tree try_block
)
1298 finish_try_block (try_block
);
1299 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1300 the try block, but moving it inside. */
1301 in_function_try_handler
= 1;
1304 /* Finish a handler-sequence for a try-block, which may be given by
1308 finish_handler_sequence (tree try_block
)
1310 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1311 check_handlers (TRY_HANDLERS (try_block
));
1314 /* Finish the handler-seq for a function-try-block, given by
1315 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1316 begin_function_try_block. */
1319 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1321 in_function_try_handler
= 0;
1322 finish_handler_sequence (try_block
);
1323 finish_compound_stmt (compound_stmt
);
1326 /* Begin a handler. Returns a HANDLER if appropriate. */
1329 begin_handler (void)
1333 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1336 /* Create a binding level for the eh_info and the exception object
1338 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1343 /* Finish the handler-parameters for a handler, which may be given by
1344 HANDLER. DECL is the declaration for the catch parameter, or NULL
1345 if this is a `catch (...)' clause. */
1348 finish_handler_parms (tree decl
, tree handler
)
1350 tree type
= NULL_TREE
;
1351 if (processing_template_decl
)
1355 decl
= pushdecl (decl
);
1356 decl
= push_template_decl (decl
);
1357 HANDLER_PARMS (handler
) = decl
;
1358 type
= TREE_TYPE (decl
);
1363 type
= expand_start_catch_block (decl
);
1364 if (warn_catch_value
1365 && type
!= NULL_TREE
1366 && type
!= error_mark_node
1367 && !TYPE_REF_P (TREE_TYPE (decl
)))
1369 tree orig_type
= TREE_TYPE (decl
);
1370 if (CLASS_TYPE_P (orig_type
))
1372 if (TYPE_POLYMORPHIC_P (orig_type
))
1373 warning (OPT_Wcatch_value_
,
1374 "catching polymorphic type %q#T by value", orig_type
);
1375 else if (warn_catch_value
> 1)
1376 warning (OPT_Wcatch_value_
,
1377 "catching type %q#T by value", orig_type
);
1379 else if (warn_catch_value
> 2)
1380 warning (OPT_Wcatch_value_
,
1381 "catching non-reference type %q#T", orig_type
);
1384 HANDLER_TYPE (handler
) = type
;
1387 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1388 the return value from the matching call to finish_handler_parms. */
1391 finish_handler (tree handler
)
1393 if (!processing_template_decl
)
1394 expand_end_catch_block ();
1395 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1398 /* Begin a compound statement. FLAGS contains some bits that control the
1399 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1400 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1401 block of a function. If BCS_TRY_BLOCK is set, this is the block
1402 created on behalf of a TRY statement. Returns a token to be passed to
1403 finish_compound_stmt. */
1406 begin_compound_stmt (unsigned int flags
)
1410 if (flags
& BCS_NO_SCOPE
)
1412 r
= push_stmt_list ();
1413 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1415 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1416 But, if it's a statement-expression with a scopeless block, there's
1417 nothing to keep, and we don't want to accidentally keep a block
1418 *inside* the scopeless block. */
1419 keep_next_level (false);
1423 scope_kind sk
= sk_block
;
1424 if (flags
& BCS_TRY_BLOCK
)
1426 else if (flags
& BCS_TRANSACTION
)
1427 sk
= sk_transaction
;
1428 r
= do_pushlevel (sk
);
1431 /* When processing a template, we need to remember where the braces were,
1432 so that we can set up identical scopes when instantiating the template
1433 later. BIND_EXPR is a handy candidate for this.
1434 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1435 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1436 processing templates. */
1437 if (processing_template_decl
)
1439 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1440 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1441 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1442 TREE_SIDE_EFFECTS (r
) = 1;
1448 /* Finish a compound-statement, which is given by STMT. */
1451 finish_compound_stmt (tree stmt
)
1453 if (TREE_CODE (stmt
) == BIND_EXPR
)
1455 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1456 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1457 discard the BIND_EXPR so it can be merged with the containing
1459 if (TREE_CODE (body
) == STATEMENT_LIST
1460 && STATEMENT_LIST_HEAD (body
) == NULL
1461 && !BIND_EXPR_BODY_BLOCK (stmt
)
1462 && !BIND_EXPR_TRY_BLOCK (stmt
))
1465 BIND_EXPR_BODY (stmt
) = body
;
1467 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1468 stmt
= pop_stmt_list (stmt
);
1471 /* Destroy any ObjC "super" receivers that may have been
1473 objc_clear_super_receiver ();
1475 stmt
= do_poplevel (stmt
);
1478 /* ??? See c_end_compound_stmt wrt statement expressions. */
1482 /* Finish an asm-statement, whose components are a STRING, some
1483 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1484 LABELS. Also note whether the asm-statement should be
1485 considered volatile. */
1488 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1489 tree input_operands
, tree clobbers
, tree labels
)
1493 int ninputs
= list_length (input_operands
);
1494 int noutputs
= list_length (output_operands
);
1496 if (!processing_template_decl
)
1498 const char *constraint
;
1499 const char **oconstraints
;
1500 bool allows_mem
, allows_reg
, is_inout
;
1504 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1506 string
= resolve_asm_operand_names (string
, output_operands
,
1507 input_operands
, labels
);
1509 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1511 operand
= TREE_VALUE (t
);
1513 /* ??? Really, this should not be here. Users should be using a
1514 proper lvalue, dammit. But there's a long history of using
1515 casts in the output operands. In cases like longlong.h, this
1516 becomes a primitive form of typechecking -- if the cast can be
1517 removed, then the output operand had a type of the proper width;
1518 otherwise we'll get an error. Gross, but ... */
1519 STRIP_NOPS (operand
);
1521 operand
= mark_lvalue_use (operand
);
1523 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1524 operand
= error_mark_node
;
1526 if (operand
!= error_mark_node
1527 && (TREE_READONLY (operand
)
1528 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1529 /* Functions are not modifiable, even though they are
1531 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1532 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1533 /* If it's an aggregate and any field is const, then it is
1534 effectively const. */
1535 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1536 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1537 cxx_readonly_error (input_location
, operand
, lv_asm
);
1539 tree
*op
= &operand
;
1540 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1541 op
= &TREE_OPERAND (*op
, 1);
1542 switch (TREE_CODE (*op
))
1544 case PREINCREMENT_EXPR
:
1545 case PREDECREMENT_EXPR
:
1547 *op
= genericize_compound_lvalue (*op
);
1548 op
= &TREE_OPERAND (*op
, 1);
1554 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1555 oconstraints
[i
] = constraint
;
1557 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1558 &allows_mem
, &allows_reg
, &is_inout
))
1560 /* If the operand is going to end up in memory,
1561 mark it addressable. */
1562 if (!allows_reg
&& !cxx_mark_addressable (*op
))
1563 operand
= error_mark_node
;
1566 operand
= error_mark_node
;
1568 TREE_VALUE (t
) = operand
;
1571 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1573 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1574 bool constraint_parsed
1575 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1576 oconstraints
, &allows_mem
, &allows_reg
);
1577 /* If the operand is going to end up in memory, don't call
1578 decay_conversion. */
1579 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1580 operand
= mark_lvalue_use (TREE_VALUE (t
));
1582 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1584 /* If the type of the operand hasn't been determined (e.g.,
1585 because it involves an overloaded function), then issue
1586 an error message. There's no context available to
1587 resolve the overloading. */
1588 if (TREE_TYPE (operand
) == unknown_type_node
)
1590 error ("type of asm operand %qE could not be determined",
1592 operand
= error_mark_node
;
1595 if (constraint_parsed
)
1597 /* If the operand is going to end up in memory,
1598 mark it addressable. */
1599 if (!allows_reg
&& allows_mem
)
1601 /* Strip the nops as we allow this case. FIXME, this really
1602 should be rejected or made deprecated. */
1603 STRIP_NOPS (operand
);
1605 tree
*op
= &operand
;
1606 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1607 op
= &TREE_OPERAND (*op
, 1);
1608 switch (TREE_CODE (*op
))
1610 case PREINCREMENT_EXPR
:
1611 case PREDECREMENT_EXPR
:
1613 *op
= genericize_compound_lvalue (*op
);
1614 op
= &TREE_OPERAND (*op
, 1);
1620 if (!cxx_mark_addressable (*op
))
1621 operand
= error_mark_node
;
1623 else if (!allows_reg
&& !allows_mem
)
1625 /* If constraint allows neither register nor memory,
1626 try harder to get a constant. */
1627 tree constop
= maybe_constant_value (operand
);
1628 if (TREE_CONSTANT (constop
))
1633 operand
= error_mark_node
;
1635 TREE_VALUE (t
) = operand
;
1639 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1640 output_operands
, input_operands
,
1642 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1643 r
= maybe_cleanup_point_expr_void (r
);
1644 return add_stmt (r
);
1647 /* Finish a label with the indicated NAME. Returns the new label. */
1650 finish_label_stmt (tree name
)
1652 tree decl
= define_label (input_location
, name
);
1654 if (decl
== error_mark_node
)
1655 return error_mark_node
;
1657 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1662 /* Finish a series of declarations for local labels. G++ allows users
1663 to declare "local" labels, i.e., labels with scope. This extension
1664 is useful when writing code involving statement-expressions. */
1667 finish_label_decl (tree name
)
1669 if (!at_function_scope_p ())
1671 error ("__label__ declarations are only allowed in function scopes");
1675 add_decl_expr (declare_local_label (name
));
1678 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1681 finish_decl_cleanup (tree decl
, tree cleanup
)
1683 push_cleanup (decl
, cleanup
, false);
1686 /* If the current scope exits with an exception, run CLEANUP. */
1689 finish_eh_cleanup (tree cleanup
)
1691 push_cleanup (NULL
, cleanup
, true);
1694 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1695 order they were written by the user. Each node is as for
1696 emit_mem_initializers. */
1699 finish_mem_initializers (tree mem_inits
)
1701 /* Reorder the MEM_INITS so that they are in the order they appeared
1702 in the source program. */
1703 mem_inits
= nreverse (mem_inits
);
1705 if (processing_template_decl
)
1709 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1711 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1712 check for bare parameter packs in the TREE_VALUE, because
1713 any parameter packs in the TREE_VALUE have already been
1714 bound as part of the TREE_PURPOSE. See
1715 make_pack_expansion for more information. */
1716 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1717 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1718 TREE_VALUE (mem
) = error_mark_node
;
1721 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1722 CTOR_INITIALIZER
, mem_inits
));
1725 emit_mem_initializers (mem_inits
);
1728 /* Obfuscate EXPR if it looks like an id-expression or member access so
1729 that the call to finish_decltype in do_auto_deduction will give the
1733 force_paren_expr (tree expr
)
1735 /* This is only needed for decltype(auto) in C++14. */
1736 if (cxx_dialect
< cxx14
)
1739 /* If we're in unevaluated context, we can't be deducing a
1740 return/initializer type, so we don't need to mess with this. */
1741 if (cp_unevaluated_operand
)
1744 if (!DECL_P (expr
) && TREE_CODE (expr
) != COMPONENT_REF
1745 && TREE_CODE (expr
) != SCOPE_REF
)
1748 if (TREE_CODE (expr
) == COMPONENT_REF
1749 || TREE_CODE (expr
) == SCOPE_REF
)
1750 REF_PARENTHESIZED_P (expr
) = true;
1751 else if (processing_template_decl
)
1752 expr
= build1 (PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1755 expr
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (expr
), expr
);
1756 REF_PARENTHESIZED_P (expr
) = true;
1762 /* If T is an id-expression obfuscated by force_paren_expr, undo the
1763 obfuscation and return the underlying id-expression. Otherwise
1767 maybe_undo_parenthesized_ref (tree t
)
1769 if (cxx_dialect
< cxx14
)
1772 if (INDIRECT_REF_P (t
) && REF_PARENTHESIZED_P (t
))
1774 t
= TREE_OPERAND (t
, 0);
1775 while (TREE_CODE (t
) == NON_LVALUE_EXPR
1776 || TREE_CODE (t
) == NOP_EXPR
)
1777 t
= TREE_OPERAND (t
, 0);
1779 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
1780 || TREE_CODE (t
) == STATIC_CAST_EXPR
);
1781 t
= TREE_OPERAND (t
, 0);
1783 else if (TREE_CODE (t
) == PAREN_EXPR
)
1784 t
= TREE_OPERAND (t
, 0);
1785 else if (TREE_CODE (t
) == VIEW_CONVERT_EXPR
1786 && REF_PARENTHESIZED_P (t
))
1787 t
= TREE_OPERAND (t
, 0);
1792 /* Finish a parenthesized expression EXPR. */
1795 finish_parenthesized_expr (cp_expr expr
)
1798 /* This inhibits warnings in c_common_truthvalue_conversion. */
1799 TREE_NO_WARNING (expr
) = 1;
1801 if (TREE_CODE (expr
) == OFFSET_REF
1802 || TREE_CODE (expr
) == SCOPE_REF
)
1803 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1804 enclosed in parentheses. */
1805 PTRMEM_OK_P (expr
) = 0;
1807 if (TREE_CODE (expr
) == STRING_CST
)
1808 PAREN_STRING_LITERAL_P (expr
) = 1;
1810 expr
= cp_expr (force_paren_expr (expr
), expr
.get_location ());
1815 /* Finish a reference to a non-static data member (DECL) that is not
1816 preceded by `.' or `->'. */
1819 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1821 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1822 bool try_omp_private
= !object
&& omp_private_member_map
;
1827 tree scope
= qualifying_scope
;
1828 if (scope
== NULL_TREE
)
1829 scope
= context_for_name_lookup (decl
);
1830 object
= maybe_dummy_object (scope
, NULL
);
1833 object
= maybe_resolve_dummy (object
, true);
1834 if (object
== error_mark_node
)
1835 return error_mark_node
;
1837 /* DR 613/850: Can use non-static data members without an associated
1838 object in sizeof/decltype/alignof. */
1839 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1840 && (!processing_template_decl
|| !current_class_ref
))
1842 if (current_function_decl
1843 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1844 error ("invalid use of member %qD in static member function", decl
);
1846 error ("invalid use of non-static data member %qD", decl
);
1847 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1849 return error_mark_node
;
1852 if (current_class_ptr
)
1853 TREE_USED (current_class_ptr
) = 1;
1854 if (processing_template_decl
&& !qualifying_scope
)
1856 tree type
= TREE_TYPE (decl
);
1858 if (TYPE_REF_P (type
))
1859 /* Quals on the object don't matter. */;
1860 else if (PACK_EXPANSION_P (type
))
1861 /* Don't bother trying to represent this. */
1865 /* Set the cv qualifiers. */
1866 int quals
= cp_type_quals (TREE_TYPE (object
));
1868 if (DECL_MUTABLE_P (decl
))
1869 quals
&= ~TYPE_QUAL_CONST
;
1871 quals
|= cp_type_quals (TREE_TYPE (decl
));
1872 type
= cp_build_qualified_type (type
, quals
);
1875 ret
= (convert_from_reference
1876 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1878 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1879 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1881 else if (processing_template_decl
)
1882 ret
= build_qualified_name (TREE_TYPE (decl
),
1885 /*template_p=*/false);
1888 tree access_type
= TREE_TYPE (object
);
1890 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1891 decl
, tf_warning_or_error
);
1893 /* If the data member was named `C::M', convert `*this' to `C'
1895 if (qualifying_scope
)
1897 tree binfo
= NULL_TREE
;
1898 object
= build_scoped_ref (object
, qualifying_scope
,
1902 ret
= build_class_member_access_expr (object
, decl
,
1903 /*access_path=*/NULL_TREE
,
1904 /*preserve_reference=*/false,
1905 tf_warning_or_error
);
1907 if (try_omp_private
)
1909 tree
*v
= omp_private_member_map
->get (decl
);
1911 ret
= convert_from_reference (*v
);
1916 /* If we are currently parsing a template and we encountered a typedef
1917 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1918 adds the typedef to a list tied to the current template.
1919 At template instantiation time, that list is walked and access check
1920 performed for each typedef.
1921 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1924 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1926 location_t location
)
1928 tree template_info
= NULL
;
1929 tree cs
= current_scope ();
1931 if (!is_typedef_decl (typedef_decl
)
1933 || !CLASS_TYPE_P (context
)
1937 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1938 template_info
= get_template_info (cs
);
1941 && TI_TEMPLATE (template_info
)
1942 && !currently_open_class (context
))
1943 append_type_to_template_for_access_check (cs
, typedef_decl
,
1947 /* DECL was the declaration to which a qualified-id resolved. Issue
1948 an error message if it is not accessible. If OBJECT_TYPE is
1949 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1950 type of `*x', or `x', respectively. If the DECL was named as
1951 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1954 check_accessibility_of_qualified_id (tree decl
,
1956 tree nested_name_specifier
)
1959 tree qualifying_type
= NULL_TREE
;
1961 /* If we are parsing a template declaration and if decl is a typedef,
1962 add it to a list tied to the template.
1963 At template instantiation time, that list will be walked and
1964 access check performed. */
1965 add_typedef_to_current_template_for_access_check (decl
,
1966 nested_name_specifier
1967 ? nested_name_specifier
1968 : DECL_CONTEXT (decl
),
1971 /* If we're not checking, return immediately. */
1972 if (deferred_access_no_check
)
1975 /* Determine the SCOPE of DECL. */
1976 scope
= context_for_name_lookup (decl
);
1977 /* If the SCOPE is not a type, then DECL is not a member. */
1978 if (!TYPE_P (scope
))
1980 /* Compute the scope through which DECL is being accessed. */
1982 /* OBJECT_TYPE might not be a class type; consider:
1984 class A { typedef int I; };
1988 In this case, we will have "A::I" as the DECL, but "I" as the
1990 && CLASS_TYPE_P (object_type
)
1991 && DERIVED_FROM_P (scope
, object_type
))
1992 /* If we are processing a `->' or `.' expression, use the type of the
1994 qualifying_type
= object_type
;
1995 else if (nested_name_specifier
)
1997 /* If the reference is to a non-static member of the
1998 current class, treat it as if it were referenced through
2001 if (DECL_NONSTATIC_MEMBER_P (decl
)
2002 && current_class_ptr
2003 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
2004 qualifying_type
= ct
;
2005 /* Otherwise, use the type indicated by the
2006 nested-name-specifier. */
2008 qualifying_type
= nested_name_specifier
;
2011 /* Otherwise, the name must be from the current class or one of
2013 qualifying_type
= currently_open_derived_class (scope
);
2016 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
2017 or similar in a default argument value. */
2018 && CLASS_TYPE_P (qualifying_type
)
2019 && !dependent_type_p (qualifying_type
))
2020 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
2021 decl
, tf_warning_or_error
);
2024 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
2025 class named to the left of the "::" operator. DONE is true if this
2026 expression is a complete postfix-expression; it is false if this
2027 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
2028 iff this expression is the operand of '&'. TEMPLATE_P is true iff
2029 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
2030 is true iff this qualified name appears as a template argument. */
2033 finish_qualified_id_expr (tree qualifying_class
,
2038 bool template_arg_p
,
2039 tsubst_flags_t complain
)
2041 gcc_assert (TYPE_P (qualifying_class
));
2043 if (error_operand_p (expr
))
2044 return error_mark_node
;
2046 if ((DECL_P (expr
) || BASELINK_P (expr
))
2047 && !mark_used (expr
, complain
))
2048 return error_mark_node
;
2052 if (TREE_CODE (expr
) == UNBOUND_CLASS_TEMPLATE
)
2054 /* cp_parser_lookup_name thought we were looking for a type,
2055 but we're actually looking for a declaration. */
2056 qualifying_class
= TYPE_CONTEXT (expr
);
2057 expr
= TYPE_IDENTIFIER (expr
);
2060 check_template_keyword (expr
);
2063 /* If EXPR occurs as the operand of '&', use special handling that
2064 permits a pointer-to-member. */
2065 if (address_p
&& done
)
2067 if (TREE_CODE (expr
) == SCOPE_REF
)
2068 expr
= TREE_OPERAND (expr
, 1);
2069 expr
= build_offset_ref (qualifying_class
, expr
,
2070 /*address_p=*/true, complain
);
2074 /* No need to check access within an enum. */
2075 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
2076 && TREE_CODE (expr
) != IDENTIFIER_NODE
)
2079 /* Within the scope of a class, turn references to non-static
2080 members into expression of the form "this->...". */
2082 /* But, within a template argument, we do not want make the
2083 transformation, as there is no "this" pointer. */
2085 else if (TREE_CODE (expr
) == FIELD_DECL
)
2087 push_deferring_access_checks (dk_no_check
);
2088 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
2090 pop_deferring_access_checks ();
2092 else if (BASELINK_P (expr
))
2094 /* See if any of the functions are non-static members. */
2095 /* If so, the expression may be relative to 'this'. */
2096 if (!shared_member_p (expr
)
2097 && current_class_ptr
2098 && DERIVED_FROM_P (qualifying_class
,
2099 current_nonlambda_class_type ()))
2100 expr
= (build_class_member_access_expr
2101 (maybe_dummy_object (qualifying_class
, NULL
),
2103 BASELINK_ACCESS_BINFO (expr
),
2104 /*preserve_reference=*/false,
2107 /* The expression is a qualified name whose address is not
2109 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
2114 /* In a template, return a SCOPE_REF for most qualified-ids
2115 so that we can check access at instantiation time. But if
2116 we're looking at a member of the current instantiation, we
2117 know we have access and building up the SCOPE_REF confuses
2118 non-type template argument handling. */
2119 if (processing_template_decl
2120 && (!currently_open_class (qualifying_class
)
2121 || TREE_CODE (expr
) == IDENTIFIER_NODE
2122 || TREE_CODE (expr
) == TEMPLATE_ID_EXPR
2123 || TREE_CODE (expr
) == BIT_NOT_EXPR
))
2124 expr
= build_qualified_name (TREE_TYPE (expr
),
2125 qualifying_class
, expr
,
2128 expr
= convert_from_reference (expr
);
2134 /* Begin a statement-expression. The value returned must be passed to
2135 finish_stmt_expr. */
2138 begin_stmt_expr (void)
2140 return push_stmt_list ();
2143 /* Process the final expression of a statement expression. EXPR can be
2144 NULL, if the final expression is empty. Return a STATEMENT_LIST
2145 containing all the statements in the statement-expression, or
2146 ERROR_MARK_NODE if there was an error. */
2149 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2151 if (error_operand_p (expr
))
2153 /* The type of the statement-expression is the type of the last
2155 TREE_TYPE (stmt_expr
) = error_mark_node
;
2156 return error_mark_node
;
2159 /* If the last statement does not have "void" type, then the value
2160 of the last statement is the value of the entire expression. */
2163 tree type
= TREE_TYPE (expr
);
2165 if (type
&& type_unknown_p (type
))
2167 error ("a statement expression is an insufficient context"
2168 " for overload resolution");
2169 TREE_TYPE (stmt_expr
) = error_mark_node
;
2170 return error_mark_node
;
2172 else if (processing_template_decl
)
2174 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2175 expr
= add_stmt (expr
);
2176 /* Mark the last statement so that we can recognize it as such at
2177 template-instantiation time. */
2178 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2180 else if (VOID_TYPE_P (type
))
2182 /* Just treat this like an ordinary statement. */
2183 expr
= finish_expr_stmt (expr
);
2187 /* It actually has a value we need to deal with. First, force it
2188 to be an rvalue so that we won't need to build up a copy
2189 constructor call later when we try to assign it to something. */
2190 expr
= force_rvalue (expr
, tf_warning_or_error
);
2191 if (error_operand_p (expr
))
2192 return error_mark_node
;
2194 /* Update for array-to-pointer decay. */
2195 type
= TREE_TYPE (expr
);
2197 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2198 normal statement, but don't convert to void or actually add
2200 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2201 expr
= maybe_cleanup_point_expr (expr
);
2205 /* The type of the statement-expression is the type of the last
2207 TREE_TYPE (stmt_expr
) = type
;
2213 /* Finish a statement-expression. EXPR should be the value returned
2214 by the previous begin_stmt_expr. Returns an expression
2215 representing the statement-expression. */
2218 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2223 if (error_operand_p (stmt_expr
))
2225 pop_stmt_list (stmt_expr
);
2226 return error_mark_node
;
2229 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2231 type
= TREE_TYPE (stmt_expr
);
2232 result
= pop_stmt_list (stmt_expr
);
2233 TREE_TYPE (result
) = type
;
2235 if (processing_template_decl
)
2237 result
= build_min (STMT_EXPR
, type
, result
);
2238 TREE_SIDE_EFFECTS (result
) = 1;
2239 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2241 else if (CLASS_TYPE_P (type
))
2243 /* Wrap the statement-expression in a TARGET_EXPR so that the
2244 temporary object created by the final expression is destroyed at
2245 the end of the full-expression containing the
2246 statement-expression. */
2247 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2253 /* Returns the expression which provides the value of STMT_EXPR. */
2256 stmt_expr_value_expr (tree stmt_expr
)
2258 tree t
= STMT_EXPR_STMT (stmt_expr
);
2260 if (TREE_CODE (t
) == BIND_EXPR
)
2261 t
= BIND_EXPR_BODY (t
);
2263 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2264 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2266 if (TREE_CODE (t
) == EXPR_STMT
)
2267 t
= EXPR_STMT_EXPR (t
);
2272 /* Return TRUE iff EXPR_STMT is an empty list of
2273 expression statements. */
2276 empty_expr_stmt_p (tree expr_stmt
)
2278 tree body
= NULL_TREE
;
2280 if (expr_stmt
== void_node
)
2285 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2286 body
= EXPR_STMT_EXPR (expr_stmt
);
2287 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2293 if (TREE_CODE (body
) == STATEMENT_LIST
)
2294 return tsi_end_p (tsi_start (body
));
2296 return empty_expr_stmt_p (body
);
2301 /* Perform Koenig lookup. FN is the postfix-expression representing
2302 the function (or functions) to call; ARGS are the arguments to the
2303 call. Returns the functions to be considered by overload resolution. */
2306 perform_koenig_lookup (cp_expr fn
, vec
<tree
, va_gc
> *args
,
2307 tsubst_flags_t complain
)
2309 tree identifier
= NULL_TREE
;
2310 tree functions
= NULL_TREE
;
2311 tree tmpl_args
= NULL_TREE
;
2312 bool template_id
= false;
2313 location_t loc
= fn
.get_location ();
2315 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2317 /* Use a separate flag to handle null args. */
2319 tmpl_args
= TREE_OPERAND (fn
, 1);
2320 fn
= TREE_OPERAND (fn
, 0);
2323 /* Find the name of the overloaded function. */
2324 if (identifier_p (fn
))
2329 identifier
= OVL_NAME (functions
);
2332 /* A call to a namespace-scope function using an unqualified name.
2334 Do Koenig lookup -- unless any of the arguments are
2336 if (!any_type_dependent_arguments_p (args
)
2337 && !any_dependent_template_arguments_p (tmpl_args
))
2339 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2342 /* The unqualified name could not be resolved. */
2343 if (complain
& tf_error
)
2344 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2350 if (fn
&& template_id
&& fn
!= error_mark_node
)
2351 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2356 /* Generate an expression for `FN (ARGS)'. This may change the
2359 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2360 as a virtual call, even if FN is virtual. (This flag is set when
2361 encountering an expression where the function name is explicitly
2362 qualified. For example a call to `X::f' never generates a virtual
2365 Returns code for the call. */
2368 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2369 bool koenig_p
, tsubst_flags_t complain
)
2373 vec
<tree
, va_gc
> *orig_args
= *args
;
2375 if (fn
== error_mark_node
)
2376 return error_mark_node
;
2378 gcc_assert (!TYPE_P (fn
));
2380 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2381 it so that we can tell this is a call to a known function. */
2382 fn
= maybe_undo_parenthesized_ref (fn
);
2386 if (processing_template_decl
)
2388 /* If FN is a local extern declaration or set thereof, look them up
2389 again at instantiation time. */
2390 if (is_overloaded_fn (fn
))
2392 tree ifn
= get_first_fn (fn
);
2393 if (TREE_CODE (ifn
) == FUNCTION_DECL
2394 && DECL_LOCAL_FUNCTION_P (ifn
))
2395 orig_fn
= DECL_NAME (ifn
);
2398 /* If the call expression is dependent, build a CALL_EXPR node
2399 with no type; type_dependent_expression_p recognizes
2400 expressions with no type as being dependent. */
2401 if (type_dependent_expression_p (fn
)
2402 || any_type_dependent_arguments_p (*args
))
2404 result
= build_min_nt_call_vec (orig_fn
, *args
);
2405 SET_EXPR_LOCATION (result
, cp_expr_loc_or_loc (fn
, input_location
));
2406 KOENIG_LOOKUP_P (result
) = koenig_p
;
2407 if (is_overloaded_fn (fn
))
2412 bool abnormal
= true;
2413 for (lkp_iterator
iter (fn
); abnormal
&& iter
; ++iter
)
2415 tree fndecl
= *iter
;
2416 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2417 || !TREE_THIS_VOLATILE (fndecl
))
2420 /* FIXME: Stop warning about falling off end of non-void
2421 function. But this is wrong. Even if we only see
2422 no-return fns at this point, we could select a
2423 future-defined return fn during instantiation. Or
2426 current_function_returns_abnormally
= 1;
2430 orig_args
= make_tree_vector_copy (*args
);
2431 if (!BASELINK_P (fn
)
2432 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2433 && TREE_TYPE (fn
) != unknown_type_node
)
2434 fn
= build_non_dependent_expr (fn
);
2435 make_args_non_dependent (*args
);
2438 if (TREE_CODE (fn
) == COMPONENT_REF
)
2440 tree member
= TREE_OPERAND (fn
, 1);
2441 if (BASELINK_P (member
))
2443 tree object
= TREE_OPERAND (fn
, 0);
2444 return build_new_method_call (object
, member
,
2447 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2454 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2455 if (TREE_CODE (fn
) == ADDR_EXPR
2456 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2457 fn
= TREE_OPERAND (fn
, 0);
2459 if (is_overloaded_fn (fn
))
2460 fn
= baselink_for_fns (fn
);
2463 if (BASELINK_P (fn
))
2467 /* A call to a member function. From [over.call.func]:
2469 If the keyword this is in scope and refers to the class of
2470 that member function, or a derived class thereof, then the
2471 function call is transformed into a qualified function call
2472 using (*this) as the postfix-expression to the left of the
2473 . operator.... [Otherwise] a contrived object of type T
2474 becomes the implied object argument.
2478 struct A { void f(); };
2479 struct B : public A {};
2480 struct C : public A { void g() { B::f(); }};
2482 "the class of that member function" refers to `A'. But 11.2
2483 [class.access.base] says that we need to convert 'this' to B* as
2484 part of the access, so we pass 'B' to maybe_dummy_object. */
2486 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2488 /* A constructor call always uses a dummy object. (This constructor
2489 call which has the form A::A () is actually invalid and we are
2490 going to reject it later in build_new_method_call.) */
2491 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2494 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2497 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2499 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2504 else if (is_overloaded_fn (fn
))
2506 /* If the function is an overloaded builtin, resolve it. */
2507 if (TREE_CODE (fn
) == FUNCTION_DECL
2508 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2509 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2510 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2514 if (warn_sizeof_pointer_memaccess
2515 && (complain
& tf_warning
)
2516 && !vec_safe_is_empty (*args
)
2517 && !processing_template_decl
)
2519 location_t sizeof_arg_loc
[3];
2522 for (i
= 0; i
< 3; i
++)
2526 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2527 sizeof_arg
[i
] = NULL_TREE
;
2528 if (i
>= (*args
)->length ())
2531 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2533 if (SIZEOF_EXPR_TYPE_P (t
))
2534 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2536 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2537 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2539 sizeof_pointer_memaccess_warning
2540 (sizeof_arg_loc
, fn
, *args
,
2541 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2544 if ((complain
& tf_warning
)
2545 && TREE_CODE (fn
) == FUNCTION_DECL
2546 && fndecl_built_in_p (fn
, BUILT_IN_MEMSET
)
2547 && vec_safe_length (*args
) == 3
2548 && !any_type_dependent_arguments_p (*args
))
2550 tree arg0
= (*orig_args
)[0];
2551 tree arg1
= (*orig_args
)[1];
2552 tree arg2
= (*orig_args
)[2];
2553 int literal_mask
= ((literal_integer_zerop (arg1
) << 1)
2554 | (literal_integer_zerop (arg2
) << 2));
2555 arg2
= instantiate_non_dependent_expr (arg2
);
2556 warn_for_memset (input_location
, arg0
, arg2
, literal_mask
);
2559 /* A call to a namespace-scope function. */
2560 result
= build_new_function_call (fn
, args
, complain
);
2563 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2565 if (!vec_safe_is_empty (*args
))
2566 error ("arguments to destructor are not allowed");
2567 /* Mark the pseudo-destructor call as having side-effects so
2568 that we do not issue warnings about its use. */
2569 result
= build1 (NOP_EXPR
,
2571 TREE_OPERAND (fn
, 0));
2572 TREE_SIDE_EFFECTS (result
) = 1;
2574 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2575 /* If the "function" is really an object of class type, it might
2576 have an overloaded `operator ()'. */
2577 result
= build_op_call (fn
, args
, complain
);
2580 /* A call where the function is unknown. */
2581 result
= cp_build_function_call_vec (fn
, args
, complain
);
2583 if (processing_template_decl
&& result
!= error_mark_node
)
2585 if (INDIRECT_REF_P (result
))
2586 result
= TREE_OPERAND (result
, 0);
2587 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2588 SET_EXPR_LOCATION (result
, input_location
);
2589 KOENIG_LOOKUP_P (result
) = koenig_p
;
2590 release_tree_vector (orig_args
);
2591 result
= convert_from_reference (result
);
2597 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2598 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2599 POSTDECREMENT_EXPR.) */
2602 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2604 /* input_location holds the location of the trailing operator token.
2605 Build a location of the form:
2608 with the caret at the operator token, ranging from the start
2609 of EXPR to the end of the operator token. */
2610 location_t combined_loc
= make_location (input_location
,
2612 get_finish (input_location
));
2613 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2614 tf_warning_or_error
);
2615 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2616 result
.set_location (combined_loc
);
2620 /* Finish a use of `this'. Returns an expression for `this'. */
2623 finish_this_expr (void)
2625 tree result
= NULL_TREE
;
2627 if (current_class_ptr
)
2629 tree type
= TREE_TYPE (current_class_ref
);
2631 /* In a lambda expression, 'this' refers to the captured 'this'. */
2632 if (LAMBDA_TYPE_P (type
))
2633 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2635 result
= current_class_ptr
;
2639 /* The keyword 'this' is a prvalue expression. */
2640 return rvalue (result
);
2642 tree fn
= current_nonlambda_function ();
2643 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2644 error ("%<this%> is unavailable for static member functions");
2646 error ("invalid use of %<this%> in non-member function");
2648 error ("invalid use of %<this%> at top level");
2649 return error_mark_node
;
2652 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2653 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2654 the TYPE for the type given. If SCOPE is non-NULL, the expression
2655 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2658 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2661 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2662 return error_mark_node
;
2664 gcc_assert (TYPE_P (destructor
));
2666 if (!processing_template_decl
)
2668 if (scope
== error_mark_node
)
2670 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2671 return error_mark_node
;
2673 if (is_auto (destructor
))
2674 destructor
= TREE_TYPE (object
);
2675 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2678 "qualified type %qT does not match destructor name ~%qT",
2680 return error_mark_node
;
2684 /* [expr.pseudo] says both:
2686 The type designated by the pseudo-destructor-name shall be
2687 the same as the object type.
2691 The cv-unqualified versions of the object type and of the
2692 type designated by the pseudo-destructor-name shall be the
2695 We implement the more generous second sentence, since that is
2696 what most other compilers do. */
2697 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2700 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2701 return error_mark_node
;
2705 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2709 /* Finish an expression of the form CODE EXPR. */
2712 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2713 tsubst_flags_t complain
)
2715 /* Build a location of the form:
2718 with the caret at the operator token, ranging from the start
2719 of the operator token to the end of EXPR. */
2720 location_t combined_loc
= make_location (op_loc
,
2721 op_loc
, expr
.get_finish ());
2722 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2723 /* TODO: build_x_unary_op doesn't always honor the location. */
2724 result
.set_location (combined_loc
);
2726 if (result
== error_mark_node
)
2729 if (!(complain
& tf_warning
))
2732 tree result_ovl
= result
;
2733 tree expr_ovl
= expr
;
2735 if (!processing_template_decl
)
2736 expr_ovl
= cp_fully_fold (expr_ovl
);
2738 if (!CONSTANT_CLASS_P (expr_ovl
)
2739 || TREE_OVERFLOW_P (expr_ovl
))
2742 if (!processing_template_decl
)
2743 result_ovl
= cp_fully_fold (result_ovl
);
2745 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2746 overflow_warning (combined_loc
, result_ovl
);
2751 /* Finish a compound-literal expression or C++11 functional cast with aggregate
2752 initializer. TYPE is the type to which the CONSTRUCTOR in COMPOUND_LITERAL
2756 finish_compound_literal (tree type
, tree compound_literal
,
2757 tsubst_flags_t complain
,
2760 if (type
== error_mark_node
)
2761 return error_mark_node
;
2763 if (TYPE_REF_P (type
))
2766 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2767 complain
, fcl_context
);
2768 /* The prvalue is then used to direct-initialize the reference. */
2769 tree r
= (perform_implicit_conversion_flags
2770 (type
, compound_literal
, complain
, LOOKUP_NORMAL
));
2771 return convert_from_reference (r
);
2774 if (!TYPE_OBJ_P (type
))
2776 if (complain
& tf_error
)
2777 error ("compound literal of non-object type %qT", type
);
2778 return error_mark_node
;
2781 if (tree anode
= type_uses_auto (type
))
2782 if (CLASS_PLACEHOLDER_TEMPLATE (anode
))
2784 type
= do_auto_deduction (type
, compound_literal
, anode
, complain
,
2786 if (type
== error_mark_node
)
2787 return error_mark_node
;
2790 if (processing_template_decl
)
2792 TREE_TYPE (compound_literal
) = type
;
2793 /* Mark the expression as a compound literal. */
2794 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2795 if (fcl_context
== fcl_c99
)
2796 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2797 return compound_literal
;
2800 type
= complete_type (type
);
2802 if (TYPE_NON_AGGREGATE_CLASS (type
))
2804 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2805 everywhere that deals with function arguments would be a pain, so
2806 just wrap it in a TREE_LIST. The parser set a flag so we know
2807 that it came from T{} rather than T({}). */
2808 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2809 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2810 return build_functional_cast (type
, compound_literal
, complain
);
2813 if (TREE_CODE (type
) == ARRAY_TYPE
2814 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2815 return error_mark_node
;
2816 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2817 if (SCALAR_TYPE_P (type
)
2818 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2819 && !check_narrowing (type
, compound_literal
, complain
))
2820 return error_mark_node
;
2821 if (TREE_CODE (type
) == ARRAY_TYPE
2822 && TYPE_DOMAIN (type
) == NULL_TREE
)
2824 cp_complete_array_type_or_error (&type
, compound_literal
,
2826 if (type
== error_mark_node
)
2827 return error_mark_node
;
2829 compound_literal
= digest_init_flags (type
, compound_literal
, LOOKUP_NORMAL
,
2831 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2833 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2834 if (fcl_context
== fcl_c99
)
2835 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2838 /* Put static/constant array temporaries in static variables. */
2839 /* FIXME all C99 compound literals should be variables rather than C++
2840 temporaries, unless they are used as an aggregate initializer. */
2841 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2842 && fcl_context
== fcl_c99
2843 && TREE_CODE (type
) == ARRAY_TYPE
2844 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2845 && initializer_constant_valid_p (compound_literal
, type
))
2847 tree decl
= create_temporary_var (type
);
2848 DECL_INITIAL (decl
) = compound_literal
;
2849 TREE_STATIC (decl
) = 1;
2850 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2852 /* 5.19 says that a constant expression can include an
2853 lvalue-rvalue conversion applied to "a glvalue of literal type
2854 that refers to a non-volatile temporary object initialized
2855 with a constant expression". Rather than try to communicate
2856 that this VAR_DECL is a temporary, just mark it constexpr. */
2857 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2858 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2859 TREE_CONSTANT (decl
) = true;
2861 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2862 decl
= pushdecl_top_level (decl
);
2863 DECL_NAME (decl
) = make_anon_name ();
2864 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2865 /* Make sure the destructor is callable. */
2866 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2867 if (clean
== error_mark_node
)
2868 return error_mark_node
;
2872 /* Represent other compound literals with TARGET_EXPR so we produce
2873 an lvalue, but can elide copies. */
2874 if (!VECTOR_TYPE_P (type
))
2875 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2877 return compound_literal
;
2880 /* Return the declaration for the function-name variable indicated by
2884 finish_fname (tree id
)
2888 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2889 if (processing_template_decl
&& current_function_decl
2890 && decl
!= error_mark_node
)
2891 decl
= DECL_NAME (decl
);
2895 /* Finish a translation unit. */
2898 finish_translation_unit (void)
2900 /* In case there were missing closebraces,
2901 get us back to the global binding level. */
2903 while (current_namespace
!= global_namespace
)
2906 /* Do file scope __FUNCTION__ et al. */
2907 finish_fname_decls ();
2910 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2911 Returns the parameter. */
2914 finish_template_type_parm (tree aggr
, tree identifier
)
2916 if (aggr
!= class_type_node
)
2918 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2919 aggr
= class_type_node
;
2922 return build_tree_list (aggr
, identifier
);
2925 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2926 Returns the parameter. */
2929 finish_template_template_parm (tree aggr
, tree identifier
)
2931 tree decl
= build_decl (input_location
,
2932 TYPE_DECL
, identifier
, NULL_TREE
);
2934 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2935 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2936 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2937 DECL_ARTIFICIAL (decl
) = 1;
2939 // Associate the constraints with the underlying declaration,
2940 // not the template.
2941 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2942 tree constr
= build_constraints (reqs
, NULL_TREE
);
2943 set_constraints (decl
, constr
);
2945 end_template_decl ();
2947 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2949 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2950 /*is_primary=*/true, /*is_partial=*/false,
2953 return finish_template_type_parm (aggr
, tmpl
);
2956 /* ARGUMENT is the default-argument value for a template template
2957 parameter. If ARGUMENT is invalid, issue error messages and return
2958 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2961 check_template_template_default_arg (tree argument
)
2963 if (TREE_CODE (argument
) != TEMPLATE_DECL
2964 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2965 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2967 if (TREE_CODE (argument
) == TYPE_DECL
)
2968 error ("invalid use of type %qT as a default value for a template "
2969 "template-parameter", TREE_TYPE (argument
));
2971 error ("invalid default argument for a template template parameter");
2972 return error_mark_node
;
2978 /* Begin a class definition, as indicated by T. */
2981 begin_class_definition (tree t
)
2983 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2984 return error_mark_node
;
2986 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2987 are passed the same as decimal scalar types. */
2988 if (TREE_CODE (t
) == RECORD_TYPE
2989 && !processing_template_decl
)
2991 tree ns
= TYPE_CONTEXT (t
);
2992 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2993 && DECL_CONTEXT (ns
) == std_node
2995 && id_equal (DECL_NAME (ns
), "decimal"))
2997 const char *n
= TYPE_NAME_STRING (t
);
2998 if ((strcmp (n
, "decimal32") == 0)
2999 || (strcmp (n
, "decimal64") == 0)
3000 || (strcmp (n
, "decimal128") == 0))
3001 TYPE_TRANSPARENT_AGGR (t
) = 1;
3005 /* A non-implicit typename comes from code like:
3007 template <typename T> struct A {
3008 template <typename U> struct A<T>::B ...
3010 This is erroneous. */
3011 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
3013 error ("invalid definition of qualified type %qT", t
);
3014 t
= error_mark_node
;
3017 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
3019 t
= make_class_type (RECORD_TYPE
);
3020 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
3023 if (TYPE_BEING_DEFINED (t
))
3025 t
= make_class_type (TREE_CODE (t
));
3026 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
3028 maybe_process_partial_specialization (t
);
3030 TYPE_BEING_DEFINED (t
) = 1;
3031 class_binding_level
->defining_class_p
= 1;
3033 if (flag_pack_struct
)
3036 TYPE_PACKED (t
) = 1;
3037 /* Even though the type is being defined for the first time
3038 here, there might have been a forward declaration, so there
3039 might be cv-qualified variants of T. */
3040 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
3041 TYPE_PACKED (v
) = 1;
3043 /* Reset the interface data, at the earliest possible
3044 moment, as it might have been set via a class foo;
3046 if (! TYPE_UNNAMED_P (t
))
3048 struct c_fileinfo
*finfo
= \
3049 get_fileinfo (LOCATION_FILE (input_location
));
3050 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
3051 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
3052 (t
, finfo
->interface_unknown
);
3054 reset_specialization();
3056 /* Make a declaration for this class in its own scope. */
3057 build_self_reference ();
3062 /* Finish the member declaration given by DECL. */
3065 finish_member_declaration (tree decl
)
3067 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
3070 if (decl
== void_type_node
)
3071 /* The COMPONENT was a friend, not a member, and so there's
3072 nothing for us to do. */
3075 /* We should see only one DECL at a time. */
3076 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
3078 /* Don't add decls after definition. */
3079 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3080 /* We can add lambda types when late parsing default
3082 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3084 /* Set up access control for DECL. */
3086 = (current_access_specifier
== access_private_node
);
3087 TREE_PROTECTED (decl
)
3088 = (current_access_specifier
== access_protected_node
);
3089 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3091 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
3092 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
3095 /* Mark the DECL as a member of the current class, unless it's
3096 a member of an enumeration. */
3097 if (TREE_CODE (decl
) != CONST_DECL
)
3098 DECL_CONTEXT (decl
) = current_class_type
;
3100 if (TREE_CODE (decl
) == USING_DECL
)
3101 /* For now, ignore class-scope USING_DECLS, so that debugging
3102 backends do not see them. */
3103 DECL_IGNORED_P (decl
) = 1;
3105 /* Check for bare parameter packs in the non-static data member
3107 if (TREE_CODE (decl
) == FIELD_DECL
)
3109 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3110 TREE_TYPE (decl
) = error_mark_node
;
3111 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
3112 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
3117 A C language linkage is ignored for the names of class members
3118 and the member function type of class member functions. */
3119 if (DECL_LANG_SPECIFIC (decl
))
3120 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3124 /* Functions and non-functions are added differently. */
3125 if (DECL_DECLARES_FUNCTION_P (decl
))
3126 add
= add_method (current_class_type
, decl
, false);
3127 /* Enter the DECL into the scope of the class, if the class
3128 isn't a closure (whose fields are supposed to be unnamed). */
3129 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3130 || pushdecl_class_level (decl
))
3135 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3136 go at the beginning. The reason is that
3137 legacy_nonfn_member_lookup searches the list in order, and we
3138 want a field name to override a type name so that the "struct
3139 stat hack" will work. In particular:
3141 struct S { enum E { }; static const int E = 5; int ary[S::E]; } s;
3145 if (TREE_CODE (decl
) == TYPE_DECL
)
3146 TYPE_FIELDS (current_class_type
)
3147 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3150 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3151 TYPE_FIELDS (current_class_type
) = decl
;
3154 maybe_add_class_template_decl_list (current_class_type
, decl
,
3159 /* Finish processing a complete template declaration. The PARMS are
3160 the template parameters. */
3163 finish_template_decl (tree parms
)
3166 end_template_decl ();
3168 end_specialization ();
3171 // Returns the template type of the class scope being entered. If we're
3172 // entering a constrained class scope. TYPE is the class template
3173 // scope being entered and we may need to match the intended type with
3174 // a constrained specialization. For example:
3176 // template<Object T>
3177 // struct S { void f(); }; #1
3179 // template<Object T>
3180 // void S<T>::f() { } #2
3182 // We check, in #2, that S<T> refers precisely to the type declared by
3183 // #1 (i.e., that the constraints match). Note that the following should
3184 // be an error since there is no specialization of S<T> that is
3185 // unconstrained, but this is not diagnosed here.
3187 // template<typename T>
3188 // void S<T>::f() { }
3190 // We cannot diagnose this problem here since this function also matches
3191 // qualified template names that are not part of a definition. For example:
3193 // template<Integral T, Floating_point U>
3194 // typename pair<T, U>::first_type void f(T, U);
3196 // Here, it is unlikely that there is a partial specialization of
3197 // pair constrained for for Integral and Floating_point arguments.
3199 // The general rule is: if a constrained specialization with matching
3200 // constraints is found return that type. Also note that if TYPE is not a
3201 // class-type (e.g. a typename type), then no fixup is needed.
3204 fixup_template_type (tree type
)
3206 // Find the template parameter list at the a depth appropriate to
3207 // the scope we're trying to enter.
3208 tree parms
= current_template_parms
;
3209 int depth
= template_class_depth (type
);
3210 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3211 parms
= TREE_CHAIN (parms
);
3214 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3215 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3217 // Search for a specialization whose type and constraints match.
3218 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3219 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3222 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3224 // If the type and constraints match a specialization, then we
3225 // are entering that type.
3226 if (same_type_p (type
, TREE_TYPE (specs
))
3227 && equivalent_constraints (cur_constr
, spec_constr
))
3228 return TREE_TYPE (specs
);
3229 specs
= TREE_CHAIN (specs
);
3232 // If no specialization matches, then must return the type
3233 // previously found.
3237 /* Finish processing a template-id (which names a type) of the form
3238 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3239 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3240 the scope of template-id indicated. */
3243 finish_template_type (tree name
, tree args
, int entering_scope
)
3247 type
= lookup_template_class (name
, args
,
3248 NULL_TREE
, NULL_TREE
, entering_scope
,
3249 tf_warning_or_error
| tf_user
);
3251 /* If we might be entering the scope of a partial specialization,
3252 find the one with the right constraints. */
3255 && CLASS_TYPE_P (type
)
3256 && CLASSTYPE_TEMPLATE_INFO (type
)
3257 && dependent_type_p (type
)
3258 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3259 type
= fixup_template_type (type
);
3261 if (type
== error_mark_node
)
3263 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3264 return TYPE_STUB_DECL (type
);
3266 return TYPE_NAME (type
);
3269 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3270 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3271 BASE_CLASS, or NULL_TREE if an error occurred. The
3272 ACCESS_SPECIFIER is one of
3273 access_{default,public,protected_private}_node. For a virtual base
3274 we set TREE_TYPE. */
3277 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3281 if (base
== error_mark_node
)
3283 error ("invalid base-class specification");
3286 else if (! MAYBE_CLASS_TYPE_P (base
))
3288 error ("%qT is not a class type", base
);
3293 if (cp_type_quals (base
) != 0)
3295 /* DR 484: Can a base-specifier name a cv-qualified
3297 base
= TYPE_MAIN_VARIANT (base
);
3299 result
= build_tree_list (access
, base
);
3301 TREE_TYPE (result
) = integer_type_node
;
3307 /* If FNS is a member function, a set of member functions, or a
3308 template-id referring to one or more member functions, return a
3309 BASELINK for FNS, incorporating the current access context.
3310 Otherwise, return FNS unchanged. */
3313 baselink_for_fns (tree fns
)
3318 if (BASELINK_P (fns
)
3319 || error_operand_p (fns
))
3322 scope
= ovl_scope (fns
);
3323 if (!CLASS_TYPE_P (scope
))
3326 cl
= currently_open_derived_class (scope
);
3329 cl
= TYPE_BINFO (cl
);
3330 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3333 /* Returns true iff DECL is a variable from a function outside
3337 outer_var_p (tree decl
)
3339 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3340 && DECL_FUNCTION_SCOPE_P (decl
)
3341 /* Don't get confused by temporaries. */
3343 && (DECL_CONTEXT (decl
) != current_function_decl
3344 || parsing_nsdmi ()));
3347 /* As above, but also checks that DECL is automatic. */
3350 outer_automatic_var_p (tree decl
)
3352 return (outer_var_p (decl
)
3353 && !TREE_STATIC (decl
));
3356 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3357 rewrite it for lambda capture.
3359 If ODR_USE is true, we're being called from mark_use, and we complain about
3360 use of constant variables. If ODR_USE is false, we're being called for the
3361 id-expression, and we do lambda capture. */
3364 process_outer_var_ref (tree decl
, tsubst_flags_t complain
, bool odr_use
)
3366 if (cp_unevaluated_operand
)
3367 /* It's not a use (3.2) if we're in an unevaluated context. */
3369 if (decl
== error_mark_node
)
3372 tree context
= DECL_CONTEXT (decl
);
3373 tree containing_function
= current_function_decl
;
3374 tree lambda_stack
= NULL_TREE
;
3375 tree lambda_expr
= NULL_TREE
;
3376 tree initializer
= convert_from_reference (decl
);
3378 /* Mark it as used now even if the use is ill-formed. */
3379 if (!mark_used (decl
, complain
))
3380 return error_mark_node
;
3382 if (parsing_nsdmi ())
3383 containing_function
= NULL_TREE
;
3385 if (containing_function
&& LAMBDA_FUNCTION_P (containing_function
))
3387 /* Check whether we've already built a proxy. */
3389 while (is_normal_capture_proxy (var
))
3390 var
= DECL_CAPTURED_VARIABLE (var
);
3391 tree d
= retrieve_local_specialization (var
);
3393 if (d
&& d
!= decl
&& is_capture_proxy (d
))
3395 if (DECL_CONTEXT (d
) == containing_function
)
3396 /* We already have an inner proxy. */
3399 /* We need to capture an outer proxy. */
3400 return process_outer_var_ref (d
, complain
, odr_use
);
3404 /* If we are in a lambda function, we can move out until we hit
3406 2. a non-lambda function, or
3407 3. a non-default capturing lambda function. */
3408 while (context
!= containing_function
3409 /* containing_function can be null with invalid generic lambdas. */
3410 && containing_function
3411 && LAMBDA_FUNCTION_P (containing_function
))
3413 tree closure
= DECL_CONTEXT (containing_function
);
3414 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3416 if (TYPE_CLASS_SCOPE_P (closure
))
3417 /* A lambda in an NSDMI (c++/64496). */
3420 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3424 lambda_stack
= tree_cons (NULL_TREE
,
3429 = decl_function_context (containing_function
);
3432 /* In a lambda within a template, wait until instantiation
3433 time to implicitly capture. */
3434 if (context
== containing_function
3435 && DECL_TEMPLATE_INFO (containing_function
)
3436 && uses_template_parms (DECL_TI_ARGS (containing_function
)))
3439 if (lambda_expr
&& VAR_P (decl
)
3440 && DECL_ANON_UNION_VAR_P (decl
))
3442 if (complain
& tf_error
)
3443 error ("cannot capture member %qD of anonymous union", decl
);
3444 return error_mark_node
;
3446 /* Do lambda capture when processing the id-expression, not when
3447 odr-using a variable. */
3448 if (!odr_use
&& context
== containing_function
)
3450 decl
= add_default_capture (lambda_stack
,
3451 /*id=*/DECL_NAME (decl
),
3454 /* Only an odr-use of an outer automatic variable causes an
3455 error, and a constant variable can decay to a prvalue
3456 constant without odr-use. So don't complain yet. */
3457 else if (!odr_use
&& decl_constant_var_p (decl
))
3459 else if (lambda_expr
)
3461 if (complain
& tf_error
)
3463 error ("%qD is not captured", decl
);
3464 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3465 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3467 inform (location_of (closure
),
3468 "the lambda has no capture-default");
3469 else if (TYPE_CLASS_SCOPE_P (closure
))
3470 inform (UNKNOWN_LOCATION
, "lambda in local class %q+T cannot "
3471 "capture variables from the enclosing context",
3472 TYPE_CONTEXT (closure
));
3473 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3475 return error_mark_node
;
3479 if (complain
& tf_error
)
3482 ? G_("use of local variable with automatic storage from "
3483 "containing function")
3484 : G_("use of parameter from containing function"));
3485 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3487 return error_mark_node
;
3492 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3493 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3494 if non-NULL, is the type or namespace used to explicitly qualify
3495 ID_EXPRESSION. DECL is the entity to which that name has been
3498 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3499 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3500 be set to true if this expression isn't permitted in a
3501 constant-expression, but it is otherwise not set by this function.
3502 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3503 constant-expression, but a non-constant expression is also
3506 DONE is true if this expression is a complete postfix-expression;
3507 it is false if this expression is followed by '->', '[', '(', etc.
3508 ADDRESS_P is true iff this expression is the operand of '&'.
3509 TEMPLATE_P is true iff the qualified-id was of the form
3510 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3511 appears as a template argument.
3513 If an error occurs, and it is the kind of error that might cause
3514 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3515 is the caller's responsibility to issue the message. *ERROR_MSG
3516 will be a string with static storage duration, so the caller need
3519 Return an expression for the entity, after issuing appropriate
3520 diagnostics. This function is also responsible for transforming a
3521 reference to a non-static member into a COMPONENT_REF that makes
3522 the use of "this" explicit.
3524 Upon return, *IDK will be filled in appropriately. */
3526 finish_id_expression (tree id_expression
,
3530 bool integral_constant_expression_p
,
3531 bool allow_non_integral_constant_expression_p
,
3532 bool *non_integral_constant_expression_p
,
3536 bool template_arg_p
,
3537 const char **error_msg
,
3538 location_t location
)
3540 decl
= strip_using_decl (decl
);
3542 /* Initialize the output parameters. */
3543 *idk
= CP_ID_KIND_NONE
;
3546 if (id_expression
== error_mark_node
)
3547 return error_mark_node
;
3548 /* If we have a template-id, then no further lookup is
3549 required. If the template-id was for a template-class, we
3550 will sometimes have a TYPE_DECL at this point. */
3551 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3552 || TREE_CODE (decl
) == TYPE_DECL
)
3554 /* Look up the name. */
3557 if (decl
== error_mark_node
)
3559 /* Name lookup failed. */
3562 || (!dependent_type_p (scope
)
3563 && !(identifier_p (id_expression
)
3564 && IDENTIFIER_CONV_OP_P (id_expression
)
3565 && dependent_type_p (TREE_TYPE (id_expression
))))))
3567 /* If the qualifying type is non-dependent (and the name
3568 does not name a conversion operator to a dependent
3569 type), issue an error. */
3570 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3571 return error_mark_node
;
3575 /* It may be resolved via Koenig lookup. */
3576 *idk
= CP_ID_KIND_UNQUALIFIED
;
3577 return id_expression
;
3580 decl
= id_expression
;
3583 /* Remember that the name was used in the definition of
3584 the current class so that we can check later to see if
3585 the meaning would have been different after the class
3586 was entirely defined. */
3587 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3588 maybe_note_name_used_in_class (id_expression
, decl
);
3590 /* A use in unevaluated operand might not be instantiated appropriately
3591 if tsubst_copy builds a dummy parm, or if we never instantiate a
3592 generic lambda, so mark it now. */
3593 if (processing_template_decl
&& cp_unevaluated_operand
)
3594 mark_type_use (decl
);
3596 /* Disallow uses of local variables from containing functions, except
3597 within lambda-expressions. */
3598 if (outer_automatic_var_p (decl
))
3600 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3601 if (decl
== error_mark_node
)
3602 return error_mark_node
;
3605 /* Also disallow uses of function parameters outside the function
3606 body, except inside an unevaluated context (i.e. decltype). */
3607 if (TREE_CODE (decl
) == PARM_DECL
3608 && DECL_CONTEXT (decl
) == NULL_TREE
3609 && !cp_unevaluated_operand
)
3611 *error_msg
= G_("use of parameter outside function body");
3612 return error_mark_node
;
3616 /* If we didn't find anything, or what we found was a type,
3617 then this wasn't really an id-expression. */
3618 if (TREE_CODE (decl
) == TEMPLATE_DECL
3619 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3621 *error_msg
= G_("missing template arguments");
3622 return error_mark_node
;
3624 else if (TREE_CODE (decl
) == TYPE_DECL
3625 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3627 *error_msg
= G_("expected primary-expression");
3628 return error_mark_node
;
3631 /* If the name resolved to a template parameter, there is no
3632 need to look it up again later. */
3633 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3634 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3638 *idk
= CP_ID_KIND_NONE
;
3639 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3640 decl
= TEMPLATE_PARM_DECL (decl
);
3641 r
= DECL_INITIAL (decl
);
3642 if (CLASS_TYPE_P (TREE_TYPE (r
)) && !CP_TYPE_CONST_P (TREE_TYPE (r
)))
3644 /* If the entity is a template parameter object for a template
3645 parameter of type T, the type of the expression is const T. */
3646 tree ctype
= TREE_TYPE (r
);
3647 ctype
= cp_build_qualified_type (ctype
, (cp_type_quals (ctype
)
3648 | TYPE_QUAL_CONST
));
3649 r
= build1 (VIEW_CONVERT_EXPR
, ctype
, r
);
3651 r
= convert_from_reference (r
);
3652 if (integral_constant_expression_p
3653 && !dependent_type_p (TREE_TYPE (decl
))
3654 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3656 if (!allow_non_integral_constant_expression_p
)
3657 error ("template parameter %qD of type %qT is not allowed in "
3658 "an integral constant expression because it is not of "
3659 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3660 *non_integral_constant_expression_p
= true;
3666 bool dependent_p
= type_dependent_expression_p (decl
);
3668 /* If the declaration was explicitly qualified indicate
3669 that. The semantics of `A::f(3)' are different than
3670 `f(3)' if `f' is virtual. */
3672 ? CP_ID_KIND_QUALIFIED
3673 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3674 ? CP_ID_KIND_TEMPLATE_ID
3676 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3677 : CP_ID_KIND_UNQUALIFIED
)));
3681 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3682 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3683 wrong, so just return the identifier. */
3684 return id_expression
;
3686 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3688 error ("use of namespace %qD as expression", decl
);
3689 return error_mark_node
;
3691 else if (DECL_CLASS_TEMPLATE_P (decl
))
3693 error ("use of class template %qT as expression", decl
);
3694 return error_mark_node
;
3696 else if (TREE_CODE (decl
) == TREE_LIST
)
3698 /* Ambiguous reference to base members. */
3699 error ("request for member %qD is ambiguous in "
3700 "multiple inheritance lattice", id_expression
);
3701 print_candidates (decl
);
3702 return error_mark_node
;
3705 /* Mark variable-like entities as used. Functions are similarly
3706 marked either below or after overload resolution. */
3708 || TREE_CODE (decl
) == PARM_DECL
3709 || TREE_CODE (decl
) == CONST_DECL
3710 || TREE_CODE (decl
) == RESULT_DECL
)
3711 && !mark_used (decl
))
3712 return error_mark_node
;
3714 /* Only certain kinds of names are allowed in constant
3715 expression. Template parameters have already
3716 been handled above. */
3717 if (! error_operand_p (decl
)
3719 && integral_constant_expression_p
3720 && ! decl_constant_var_p (decl
)
3721 && TREE_CODE (decl
) != CONST_DECL
3722 && ! builtin_valid_in_constant_expr_p (decl
))
3724 if (!allow_non_integral_constant_expression_p
)
3726 error ("%qD cannot appear in a constant-expression", decl
);
3727 return error_mark_node
;
3729 *non_integral_constant_expression_p
= true;
3734 && !cp_unevaluated_operand
3735 && !processing_template_decl
3736 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3737 && CP_DECL_THREAD_LOCAL_P (decl
)
3738 && (wrap
= get_tls_wrapper_fn (decl
)))
3740 /* Replace an evaluated use of the thread_local variable with
3741 a call to its wrapper. */
3742 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3744 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3746 && variable_template_p (TREE_OPERAND (decl
, 0)))
3748 decl
= finish_template_variable (decl
);
3750 decl
= convert_from_reference (decl
);
3754 if (TREE_CODE (decl
) == SCOPE_REF
)
3756 gcc_assert (same_type_p (scope
, TREE_OPERAND (decl
, 0)));
3757 decl
= TREE_OPERAND (decl
, 1);
3760 decl
= (adjust_result_of_qualified_name_lookup
3761 (decl
, scope
, current_nonlambda_class_type()));
3763 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3767 decl
= finish_qualified_id_expr (scope
,
3773 tf_warning_or_error
);
3775 decl
= convert_from_reference (decl
);
3777 else if (TREE_CODE (decl
) == FIELD_DECL
)
3779 /* Since SCOPE is NULL here, this is an unqualified name.
3780 Access checking has been performed during name lookup
3781 already. Turn off checking to avoid duplicate errors. */
3782 push_deferring_access_checks (dk_no_check
);
3783 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3784 /*qualifying_scope=*/NULL_TREE
);
3785 pop_deferring_access_checks ();
3787 else if (is_overloaded_fn (decl
))
3789 tree first_fn
= get_first_fn (decl
);
3791 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3792 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3794 /* [basic.def.odr]: "A function whose name appears as a
3795 potentially-evaluated expression is odr-used if it is the unique
3798 But only mark it if it's a complete postfix-expression; in a call,
3799 ADL might select a different function, and we'll call mark_used in
3802 && !really_overloaded_fn (decl
)
3803 && !mark_used (first_fn
))
3804 return error_mark_node
;
3807 && TREE_CODE (first_fn
) == FUNCTION_DECL
3808 && DECL_FUNCTION_MEMBER_P (first_fn
)
3809 && !shared_member_p (decl
))
3811 /* A set of member functions. */
3812 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3813 return finish_class_member_access_expr (decl
, id_expression
,
3814 /*template_p=*/false,
3815 tf_warning_or_error
);
3818 decl
= baselink_for_fns (decl
);
3822 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3823 && DECL_CLASS_SCOPE_P (decl
))
3825 tree context
= context_for_name_lookup (decl
);
3826 if (context
!= current_class_type
)
3828 tree path
= currently_open_derived_class (context
);
3829 perform_or_defer_access_check (TYPE_BINFO (path
),
3831 tf_warning_or_error
);
3835 decl
= convert_from_reference (decl
);
3839 return cp_expr (decl
, location
);
3842 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3843 use as a type-specifier. */
3846 finish_typeof (tree expr
)
3850 if (type_dependent_expression_p (expr
))
3852 type
= cxx_make_type (TYPEOF_TYPE
);
3853 TYPEOF_TYPE_EXPR (type
) = expr
;
3854 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3859 expr
= mark_type_use (expr
);
3861 type
= unlowered_expr_type (expr
);
3863 if (!type
|| type
== unknown_type_node
)
3865 error ("type of %qE is unknown", expr
);
3866 return error_mark_node
;
3872 /* Implement the __underlying_type keyword: Return the underlying
3873 type of TYPE, suitable for use as a type-specifier. */
3876 finish_underlying_type (tree type
)
3878 tree underlying_type
;
3880 if (processing_template_decl
)
3882 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3883 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3884 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3886 return underlying_type
;
3889 if (!complete_type_or_else (type
, NULL_TREE
))
3890 return error_mark_node
;
3892 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3894 error ("%qT is not an enumeration type", type
);
3895 return error_mark_node
;
3898 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3900 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3901 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3902 See finish_enum_value_list for details. */
3903 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3905 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3906 TYPE_UNSIGNED (underlying_type
));
3908 return underlying_type
;
3911 /* Implement the __direct_bases keyword: Return the direct base classes
3915 calculate_direct_bases (tree type
, tsubst_flags_t complain
)
3917 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3918 || !NON_UNION_CLASS_TYPE_P (type
))
3919 return make_tree_vec (0);
3921 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3922 vec
<tree
, va_gc
> *base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3926 /* Virtual bases are initialized first */
3927 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3928 if (BINFO_VIRTUAL_P (binfo
))
3929 vec_safe_push (vector
, binfo
);
3931 /* Now non-virtuals */
3932 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3933 if (!BINFO_VIRTUAL_P (binfo
))
3934 vec_safe_push (vector
, binfo
);
3936 tree bases_vec
= make_tree_vec (vector
->length ());
3938 for (i
= 0; i
< vector
->length (); ++i
)
3939 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3941 release_tree_vector (vector
);
3945 /* Implement the __bases keyword: Return the base classes
3948 /* Find morally non-virtual base classes by walking binfo hierarchy */
3949 /* Virtual base classes are handled separately in finish_bases */
3952 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3954 /* Don't walk bases of virtual bases */
3955 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3959 dfs_calculate_bases_post (tree binfo
, void *data_
)
3961 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3962 if (!BINFO_VIRTUAL_P (binfo
))
3963 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3967 /* Calculates the morally non-virtual base classes of a class */
3968 static vec
<tree
, va_gc
> *
3969 calculate_bases_helper (tree type
)
3971 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3973 /* Now add non-virtual base classes in order of construction */
3974 if (TYPE_BINFO (type
))
3975 dfs_walk_all (TYPE_BINFO (type
),
3976 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3981 calculate_bases (tree type
, tsubst_flags_t complain
)
3983 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3984 || !NON_UNION_CLASS_TYPE_P (type
))
3985 return make_tree_vec (0);
3987 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3988 tree bases_vec
= NULL_TREE
;
3990 vec
<tree
, va_gc
> *vbases
;
3991 vec
<tree
, va_gc
> *nonvbases
;
3994 /* First go through virtual base classes */
3995 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3996 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3998 vec
<tree
, va_gc
> *vbase_bases
3999 = calculate_bases_helper (BINFO_TYPE (binfo
));
4000 vec_safe_splice (vector
, vbase_bases
);
4001 release_tree_vector (vbase_bases
);
4004 /* Now for the non-virtual bases */
4005 nonvbases
= calculate_bases_helper (type
);
4006 vec_safe_splice (vector
, nonvbases
);
4007 release_tree_vector (nonvbases
);
4009 /* Note that during error recovery vector->length can even be zero. */
4010 if (vector
->length () > 1)
4012 /* Last element is entire class, so don't copy */
4013 bases_vec
= make_tree_vec (vector
->length () - 1);
4015 for (i
= 0; i
< vector
->length () - 1; ++i
)
4016 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
4019 bases_vec
= make_tree_vec (0);
4021 release_tree_vector (vector
);
4026 finish_bases (tree type
, bool direct
)
4028 tree bases
= NULL_TREE
;
4030 if (!processing_template_decl
)
4032 /* Parameter packs can only be used in templates */
4033 error ("Parameter pack __bases only valid in template declaration");
4034 return error_mark_node
;
4037 bases
= cxx_make_type (BASES
);
4038 BASES_TYPE (bases
) = type
;
4039 BASES_DIRECT (bases
) = direct
;
4040 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
4045 /* Perform C++-specific checks for __builtin_offsetof before calling
4049 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
4051 /* If we're processing a template, we can't finish the semantics yet.
4052 Otherwise we can fold the entire expression now. */
4053 if (processing_template_decl
)
4055 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4056 SET_EXPR_LOCATION (expr
, loc
);
4060 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4062 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4063 TREE_OPERAND (expr
, 2));
4064 return error_mark_node
;
4066 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
4067 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
4068 || TREE_TYPE (expr
) == unknown_type_node
)
4070 while (TREE_CODE (expr
) == COMPONENT_REF
4071 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4072 expr
= TREE_OPERAND (expr
, 1);
4076 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4077 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
4080 error ("cannot apply %<offsetof%> to member function");
4081 return error_mark_node
;
4083 if (TREE_CODE (expr
) == CONST_DECL
)
4085 error ("cannot apply %<offsetof%> to an enumerator %qD", expr
);
4086 return error_mark_node
;
4088 if (REFERENCE_REF_P (expr
))
4089 expr
= TREE_OPERAND (expr
, 0);
4090 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4091 return error_mark_node
;
4092 if (warn_invalid_offsetof
4093 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4094 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4095 && cp_unevaluated_operand
== 0)
4096 warning_at (loc
, OPT_Winvalid_offsetof
, "offsetof within "
4097 "non-standard-layout type %qT is conditionally-supported",
4098 TREE_TYPE (TREE_TYPE (object_ptr
)));
4099 return fold_offsetof (expr
);
4102 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4103 function is broken out from the above for the benefit of the tree-ssa
4107 simplify_aggr_init_expr (tree
*tp
)
4109 tree aggr_init_expr
= *tp
;
4111 /* Form an appropriate CALL_EXPR. */
4112 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4113 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4114 tree type
= TREE_TYPE (slot
);
4117 enum style_t
{ ctor
, arg
, pcc
} style
;
4119 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4121 #ifdef PCC_STATIC_STRUCT_RETURN
4127 gcc_assert (TREE_ADDRESSABLE (type
));
4131 call_expr
= build_call_array_loc (input_location
,
4132 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4134 aggr_init_expr_nargs (aggr_init_expr
),
4135 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4136 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4137 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4138 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4139 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4140 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4141 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4145 /* Replace the first argument to the ctor with the address of the
4147 cxx_mark_addressable (slot
);
4148 CALL_EXPR_ARG (call_expr
, 0) =
4149 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4151 else if (style
== arg
)
4153 /* Just mark it addressable here, and leave the rest to
4154 expand_call{,_inline}. */
4155 cxx_mark_addressable (slot
);
4156 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4157 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4159 else if (style
== pcc
)
4161 /* If we're using the non-reentrant PCC calling convention, then we
4162 need to copy the returned value out of the static buffer into the
4164 push_deferring_access_checks (dk_no_check
);
4165 call_expr
= build_aggr_init (slot
, call_expr
,
4166 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4167 tf_warning_or_error
);
4168 pop_deferring_access_checks ();
4169 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4172 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4174 tree init
= build_zero_init (type
, NULL_TREE
,
4175 /*static_storage_p=*/false);
4176 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4177 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4184 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4187 emit_associated_thunks (tree fn
)
4189 /* When we use vcall offsets, we emit thunks with the virtual
4190 functions to which they thunk. The whole point of vcall offsets
4191 is so that you can know statically the entire set of thunks that
4192 will ever be needed for a given virtual function, thereby
4193 enabling you to output all the thunks with the function itself. */
4194 if (DECL_VIRTUAL_P (fn
)
4195 /* Do not emit thunks for extern template instantiations. */
4196 && ! DECL_REALLY_EXTERN (fn
))
4200 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4202 if (!THUNK_ALIAS (thunk
))
4204 use_thunk (thunk
, /*emit_p=*/1);
4205 if (DECL_RESULT_THUNK_P (thunk
))
4209 for (probe
= DECL_THUNKS (thunk
);
4210 probe
; probe
= DECL_CHAIN (probe
))
4211 use_thunk (probe
, /*emit_p=*/1);
4215 gcc_assert (!DECL_THUNKS (thunk
));
4220 /* Generate RTL for FN. */
4223 expand_or_defer_fn_1 (tree fn
)
4225 /* When the parser calls us after finishing the body of a template
4226 function, we don't really want to expand the body. */
4227 if (processing_template_decl
)
4229 /* Normally, collection only occurs in rest_of_compilation. So,
4230 if we don't collect here, we never collect junk generated
4231 during the processing of templates until we hit a
4232 non-template function. It's not safe to do this inside a
4233 nested class, though, as the parser may have local state that
4234 is not a GC root. */
4235 if (!function_depth
)
4240 gcc_assert (DECL_SAVED_TREE (fn
));
4242 /* We make a decision about linkage for these functions at the end
4243 of the compilation. Until that point, we do not want the back
4244 end to output them -- but we do want it to see the bodies of
4245 these functions so that it can inline them as appropriate. */
4246 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4248 if (DECL_INTERFACE_KNOWN (fn
))
4249 /* We've already made a decision as to how this function will
4252 tentative_decl_linkage (fn
);
4254 import_export_decl (fn
);
4256 /* If the user wants us to keep all inline functions, then mark
4257 this function as needed so that finish_file will make sure to
4258 output it later. Similarly, all dllexport'd functions must
4259 be emitted; there may be callers in other DLLs. */
4260 if (DECL_DECLARED_INLINE_P (fn
)
4261 && !DECL_REALLY_EXTERN (fn
)
4262 && (flag_keep_inline_functions
4263 || (flag_keep_inline_dllexport
4264 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4267 DECL_EXTERNAL (fn
) = 0;
4271 /* If this is a constructor or destructor body, we have to clone
4273 if (maybe_clone_body (fn
))
4275 /* We don't want to process FN again, so pretend we've written
4276 it out, even though we haven't. */
4277 TREE_ASM_WRITTEN (fn
) = 1;
4278 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4279 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4280 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4284 /* There's no reason to do any of the work here if we're only doing
4285 semantic analysis; this code just generates RTL. */
4286 if (flag_syntax_only
)
4293 expand_or_defer_fn (tree fn
)
4295 if (expand_or_defer_fn_1 (fn
))
4299 /* Expand or defer, at the whim of the compilation unit manager. */
4300 cgraph_node::finalize_function (fn
, function_depth
> 1);
4301 emit_associated_thunks (fn
);
4309 nrv_data () : visited (37) {}
4313 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4316 /* Helper function for walk_tree, used by finalize_nrv below. */
4319 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4321 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4324 /* No need to walk into types. There wouldn't be any need to walk into
4325 non-statements, except that we have to consider STMT_EXPRs. */
4328 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4329 but differs from using NULL_TREE in that it indicates that we care
4330 about the value of the RESULT_DECL. */
4331 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4332 TREE_OPERAND (*tp
, 0) = dp
->result
;
4333 /* Change all cleanups for the NRV to only run when an exception is
4335 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4336 && CLEANUP_DECL (*tp
) == dp
->var
)
4337 CLEANUP_EH_ONLY (*tp
) = 1;
4338 /* Replace the DECL_EXPR for the NRV with an initialization of the
4339 RESULT_DECL, if needed. */
4340 else if (TREE_CODE (*tp
) == DECL_EXPR
4341 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4344 if (DECL_INITIAL (dp
->var
)
4345 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4346 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4347 DECL_INITIAL (dp
->var
));
4349 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4350 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4351 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4354 /* And replace all uses of the NRV with the RESULT_DECL. */
4355 else if (*tp
== dp
->var
)
4358 /* Avoid walking into the same tree more than once. Unfortunately, we
4359 can't just use walk_tree_without duplicates because it would only call
4360 us for the first occurrence of dp->var in the function body. */
4361 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4367 /* Keep iterating. */
4371 /* Called from finish_function to implement the named return value
4372 optimization by overriding all the RETURN_EXPRs and pertinent
4373 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4374 RESULT_DECL for the function. */
4377 finalize_nrv (tree
*tp
, tree var
, tree result
)
4379 struct nrv_data data
;
4381 /* Copy name from VAR to RESULT. */
4382 DECL_NAME (result
) = DECL_NAME (var
);
4383 /* Don't forget that we take its address. */
4384 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4385 /* Finally set DECL_VALUE_EXPR to avoid assigning
4386 a stack slot at -O0 for the original var and debug info
4387 uses RESULT location for VAR. */
4388 SET_DECL_VALUE_EXPR (var
, result
);
4389 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4392 data
.result
= result
;
4393 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4396 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4399 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4400 bool need_copy_ctor
, bool need_copy_assignment
,
4403 int save_errorcount
= errorcount
;
4406 /* Always allocate 3 elements for simplicity. These are the
4407 function decls for the ctor, dtor, and assignment op.
4408 This layout is known to the three lang hooks,
4409 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4410 and cxx_omp_clause_assign_op. */
4411 info
= make_tree_vec (3);
4412 CP_OMP_CLAUSE_INFO (c
) = info
;
4414 if (need_default_ctor
|| need_copy_ctor
)
4416 if (need_default_ctor
)
4417 t
= get_default_ctor (type
);
4419 t
= get_copy_ctor (type
, tf_warning_or_error
);
4421 if (t
&& !trivial_fn_p (t
))
4422 TREE_VEC_ELT (info
, 0) = t
;
4425 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4426 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4428 if (need_copy_assignment
)
4430 t
= get_copy_assign (type
);
4432 if (t
&& !trivial_fn_p (t
))
4433 TREE_VEC_ELT (info
, 2) = t
;
4436 return errorcount
!= save_errorcount
;
4439 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4440 FIELD_DECL, otherwise return DECL itself. */
4443 omp_clause_decl_field (tree decl
)
4446 && DECL_HAS_VALUE_EXPR_P (decl
)
4447 && DECL_ARTIFICIAL (decl
)
4448 && DECL_LANG_SPECIFIC (decl
)
4449 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4451 tree f
= DECL_VALUE_EXPR (decl
);
4452 if (INDIRECT_REF_P (f
))
4453 f
= TREE_OPERAND (f
, 0);
4454 if (TREE_CODE (f
) == COMPONENT_REF
)
4456 f
= TREE_OPERAND (f
, 1);
4457 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4464 /* Adjust DECL if needed for printing using %qE. */
4467 omp_clause_printable_decl (tree decl
)
4469 tree t
= omp_clause_decl_field (decl
);
4475 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4476 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4480 omp_note_field_privatization (tree f
, tree t
)
4482 if (!omp_private_member_map
)
4483 omp_private_member_map
= new hash_map
<tree
, tree
>;
4484 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4488 omp_private_member_vec
.safe_push (f
);
4489 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4490 omp_private_member_vec
.safe_push (integer_zero_node
);
4494 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4498 omp_privatize_field (tree t
, bool shared
)
4500 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4501 if (m
== error_mark_node
)
4502 return error_mark_node
;
4503 if (!omp_private_member_map
&& !shared
)
4504 omp_private_member_map
= new hash_map
<tree
, tree
>;
4505 if (TYPE_REF_P (TREE_TYPE (t
)))
4507 gcc_assert (INDIRECT_REF_P (m
));
4508 m
= TREE_OPERAND (m
, 0);
4510 tree vb
= NULL_TREE
;
4511 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4514 v
= create_temporary_var (TREE_TYPE (m
));
4515 retrofit_lang_decl (v
);
4516 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4517 SET_DECL_VALUE_EXPR (v
, m
);
4518 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4520 omp_private_member_vec
.safe_push (t
);
4525 /* Helper function for handle_omp_array_sections. Called recursively
4526 to handle multiple array-section-subscripts. C is the clause,
4527 T current expression (initially OMP_CLAUSE_DECL), which is either
4528 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4529 expression if specified, TREE_VALUE length expression if specified,
4530 TREE_CHAIN is what it has been specified after, or some decl.
4531 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4532 set to true if any of the array-section-subscript could have length
4533 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4534 first array-section-subscript which is known not to have length
4536 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4537 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4538 all are or may have length of 1, array-section-subscript [:2] is the
4539 first one known not to have length 1. For array-section-subscript
4540 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4541 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4542 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4543 case though, as some lengths could be zero. */
4546 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4547 bool &maybe_zero_len
, unsigned int &first_non_one
,
4548 enum c_omp_region_type ort
)
4550 tree ret
, low_bound
, length
, type
;
4551 if (TREE_CODE (t
) != TREE_LIST
)
4553 if (error_operand_p (t
))
4554 return error_mark_node
;
4555 if (REFERENCE_REF_P (t
)
4556 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4557 t
= TREE_OPERAND (t
, 0);
4559 if (TREE_CODE (t
) == COMPONENT_REF
4561 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4562 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4563 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4564 && !type_dependent_expression_p (t
))
4566 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4567 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4569 error_at (OMP_CLAUSE_LOCATION (c
),
4570 "bit-field %qE in %qs clause",
4571 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4572 return error_mark_node
;
4574 while (TREE_CODE (t
) == COMPONENT_REF
)
4576 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4577 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4579 error_at (OMP_CLAUSE_LOCATION (c
),
4580 "%qE is a member of a union", t
);
4581 return error_mark_node
;
4583 t
= TREE_OPERAND (t
, 0);
4585 if (REFERENCE_REF_P (t
))
4586 t
= TREE_OPERAND (t
, 0);
4588 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4590 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
4593 error_at (OMP_CLAUSE_LOCATION (c
),
4594 "%qD is not a variable in %qs clause", t
,
4595 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4597 error_at (OMP_CLAUSE_LOCATION (c
),
4598 "%qE is not a variable in %qs clause", t
,
4599 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4600 return error_mark_node
;
4602 else if (ort
== C_ORT_OMP
4603 && TREE_CODE (t
) == PARM_DECL
4604 && DECL_ARTIFICIAL (t
)
4605 && DECL_NAME (t
) == this_identifier
)
4607 error_at (OMP_CLAUSE_LOCATION (c
),
4608 "%<this%> allowed in OpenMP only in %<declare simd%>"
4610 return error_mark_node
;
4612 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4613 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4615 error_at (OMP_CLAUSE_LOCATION (c
),
4616 "%qD is threadprivate variable in %qs clause", t
,
4617 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4618 return error_mark_node
;
4620 if (type_dependent_expression_p (ret
))
4622 ret
= convert_from_reference (ret
);
4626 if (ort
== C_ORT_OMP
4627 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4628 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4629 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4630 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4631 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4632 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4633 maybe_zero_len
, first_non_one
, ort
);
4634 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4637 type
= TREE_TYPE (ret
);
4638 low_bound
= TREE_PURPOSE (t
);
4639 length
= TREE_VALUE (t
);
4640 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4641 || (length
&& type_dependent_expression_p (length
)))
4644 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4645 return error_mark_node
;
4647 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4649 error_at (OMP_CLAUSE_LOCATION (c
),
4650 "low bound %qE of array section does not have integral type",
4652 return error_mark_node
;
4654 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4656 error_at (OMP_CLAUSE_LOCATION (c
),
4657 "length %qE of array section does not have integral type",
4659 return error_mark_node
;
4662 low_bound
= mark_rvalue_use (low_bound
);
4664 length
= mark_rvalue_use (length
);
4665 /* We need to reduce to real constant-values for checks below. */
4667 length
= fold_simple (length
);
4669 low_bound
= fold_simple (low_bound
);
4671 && TREE_CODE (low_bound
) == INTEGER_CST
4672 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4673 > TYPE_PRECISION (sizetype
))
4674 low_bound
= fold_convert (sizetype
, low_bound
);
4676 && TREE_CODE (length
) == INTEGER_CST
4677 && TYPE_PRECISION (TREE_TYPE (length
))
4678 > TYPE_PRECISION (sizetype
))
4679 length
= fold_convert (sizetype
, length
);
4680 if (low_bound
== NULL_TREE
)
4681 low_bound
= integer_zero_node
;
4683 if (length
!= NULL_TREE
)
4685 if (!integer_nonzerop (length
))
4687 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4688 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4689 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4690 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4692 if (integer_zerop (length
))
4694 error_at (OMP_CLAUSE_LOCATION (c
),
4695 "zero length array section in %qs clause",
4696 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4697 return error_mark_node
;
4701 maybe_zero_len
= true;
4703 if (first_non_one
== types
.length ()
4704 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4707 if (TREE_CODE (type
) == ARRAY_TYPE
)
4709 if (length
== NULL_TREE
4710 && (TYPE_DOMAIN (type
) == NULL_TREE
4711 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4713 error_at (OMP_CLAUSE_LOCATION (c
),
4714 "for unknown bound array type length expression must "
4716 return error_mark_node
;
4718 if (TREE_CODE (low_bound
) == INTEGER_CST
4719 && tree_int_cst_sgn (low_bound
) == -1)
4721 error_at (OMP_CLAUSE_LOCATION (c
),
4722 "negative low bound in array section in %qs clause",
4723 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4724 return error_mark_node
;
4726 if (length
!= NULL_TREE
4727 && TREE_CODE (length
) == INTEGER_CST
4728 && tree_int_cst_sgn (length
) == -1)
4730 error_at (OMP_CLAUSE_LOCATION (c
),
4731 "negative length in array section in %qs clause",
4732 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4733 return error_mark_node
;
4735 if (TYPE_DOMAIN (type
)
4736 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4737 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4741 = fold_convert (sizetype
, TYPE_MAX_VALUE (TYPE_DOMAIN (type
)));
4742 size
= size_binop (PLUS_EXPR
, size
, size_one_node
);
4743 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4745 if (tree_int_cst_lt (size
, low_bound
))
4747 error_at (OMP_CLAUSE_LOCATION (c
),
4748 "low bound %qE above array section size "
4749 "in %qs clause", low_bound
,
4750 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4751 return error_mark_node
;
4753 if (tree_int_cst_equal (size
, low_bound
))
4755 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4756 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4757 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
4758 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
4760 error_at (OMP_CLAUSE_LOCATION (c
),
4761 "zero length array section in %qs clause",
4762 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4763 return error_mark_node
;
4765 maybe_zero_len
= true;
4767 else if (length
== NULL_TREE
4768 && first_non_one
== types
.length ()
4769 && tree_int_cst_equal
4770 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4774 else if (length
== NULL_TREE
)
4776 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4777 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
4778 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_IN_REDUCTION
4779 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_TASK_REDUCTION
)
4780 maybe_zero_len
= true;
4781 if (first_non_one
== types
.length ())
4784 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4786 if (tree_int_cst_lt (size
, length
))
4788 error_at (OMP_CLAUSE_LOCATION (c
),
4789 "length %qE above array section size "
4790 "in %qs clause", length
,
4791 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4792 return error_mark_node
;
4794 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4797 = size_binop (PLUS_EXPR
,
4798 fold_convert (sizetype
, low_bound
),
4799 fold_convert (sizetype
, length
));
4800 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4801 && tree_int_cst_lt (size
, lbpluslen
))
4803 error_at (OMP_CLAUSE_LOCATION (c
),
4804 "high bound %qE above array section size "
4805 "in %qs clause", lbpluslen
,
4806 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4807 return error_mark_node
;
4812 else if (length
== NULL_TREE
)
4814 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4815 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
4816 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_IN_REDUCTION
4817 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_TASK_REDUCTION
)
4818 maybe_zero_len
= true;
4819 if (first_non_one
== types
.length ())
4823 /* For [lb:] we will need to evaluate lb more than once. */
4824 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4826 tree lb
= cp_save_expr (low_bound
);
4827 if (lb
!= low_bound
)
4829 TREE_PURPOSE (t
) = lb
;
4834 else if (TYPE_PTR_P (type
))
4836 if (length
== NULL_TREE
)
4838 error_at (OMP_CLAUSE_LOCATION (c
),
4839 "for pointer type length expression must be specified");
4840 return error_mark_node
;
4842 if (length
!= NULL_TREE
4843 && TREE_CODE (length
) == INTEGER_CST
4844 && tree_int_cst_sgn (length
) == -1)
4846 error_at (OMP_CLAUSE_LOCATION (c
),
4847 "negative length in array section in %qs clause",
4848 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4849 return error_mark_node
;
4851 /* If there is a pointer type anywhere but in the very first
4852 array-section-subscript, the array section can't be contiguous. */
4853 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4854 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4856 error_at (OMP_CLAUSE_LOCATION (c
),
4857 "array section is not contiguous in %qs clause",
4858 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4859 return error_mark_node
;
4864 error_at (OMP_CLAUSE_LOCATION (c
),
4865 "%qE does not have pointer or array type", ret
);
4866 return error_mark_node
;
4868 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4869 types
.safe_push (TREE_TYPE (ret
));
4870 /* We will need to evaluate lb more than once. */
4871 tree lb
= cp_save_expr (low_bound
);
4872 if (lb
!= low_bound
)
4874 TREE_PURPOSE (t
) = lb
;
4877 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4881 /* Handle array sections for clause C. */
4884 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4886 bool maybe_zero_len
= false;
4887 unsigned int first_non_one
= 0;
4888 auto_vec
<tree
, 10> types
;
4889 tree
*tp
= &OMP_CLAUSE_DECL (c
);
4890 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4891 && TREE_CODE (*tp
) == TREE_LIST
4892 && TREE_PURPOSE (*tp
)
4893 && TREE_CODE (TREE_PURPOSE (*tp
)) == TREE_VEC
)
4894 tp
= &TREE_VALUE (*tp
);
4895 tree first
= handle_omp_array_sections_1 (c
, *tp
, types
,
4896 maybe_zero_len
, first_non_one
,
4898 if (first
== error_mark_node
)
4900 if (first
== NULL_TREE
)
4902 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4905 tree tem
= NULL_TREE
;
4906 if (processing_template_decl
)
4908 /* Need to evaluate side effects in the length expressions
4910 while (TREE_CODE (t
) == TREE_LIST
)
4912 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4914 if (tem
== NULL_TREE
)
4915 tem
= TREE_VALUE (t
);
4917 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4918 TREE_VALUE (t
), tem
);
4923 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4928 unsigned int num
= types
.length (), i
;
4929 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4930 tree condition
= NULL_TREE
;
4932 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4933 maybe_zero_len
= true;
4934 if (processing_template_decl
&& maybe_zero_len
)
4937 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4940 tree low_bound
= TREE_PURPOSE (t
);
4941 tree length
= TREE_VALUE (t
);
4945 && TREE_CODE (low_bound
) == INTEGER_CST
4946 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4947 > TYPE_PRECISION (sizetype
))
4948 low_bound
= fold_convert (sizetype
, low_bound
);
4950 && TREE_CODE (length
) == INTEGER_CST
4951 && TYPE_PRECISION (TREE_TYPE (length
))
4952 > TYPE_PRECISION (sizetype
))
4953 length
= fold_convert (sizetype
, length
);
4954 if (low_bound
== NULL_TREE
)
4955 low_bound
= integer_zero_node
;
4956 if (!maybe_zero_len
&& i
> first_non_one
)
4958 if (integer_nonzerop (low_bound
))
4959 goto do_warn_noncontiguous
;
4960 if (length
!= NULL_TREE
4961 && TREE_CODE (length
) == INTEGER_CST
4962 && TYPE_DOMAIN (types
[i
])
4963 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4964 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4968 size
= size_binop (PLUS_EXPR
,
4969 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4971 if (!tree_int_cst_equal (length
, size
))
4973 do_warn_noncontiguous
:
4974 error_at (OMP_CLAUSE_LOCATION (c
),
4975 "array section is not contiguous in %qs "
4977 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4981 if (!processing_template_decl
4982 && length
!= NULL_TREE
4983 && TREE_SIDE_EFFECTS (length
))
4985 if (side_effects
== NULL_TREE
)
4986 side_effects
= length
;
4988 side_effects
= build2 (COMPOUND_EXPR
,
4989 TREE_TYPE (side_effects
),
4990 length
, side_effects
);
4993 else if (processing_template_decl
)
4999 if (i
> first_non_one
5000 && ((length
&& integer_nonzerop (length
))
5001 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5002 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5003 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
))
5006 l
= fold_convert (sizetype
, length
);
5009 l
= size_binop (PLUS_EXPR
,
5010 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
5012 l
= size_binop (MINUS_EXPR
, l
,
5013 fold_convert (sizetype
, low_bound
));
5015 if (i
> first_non_one
)
5017 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
5019 if (condition
== NULL_TREE
)
5022 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
5025 else if (size
== NULL_TREE
)
5027 size
= size_in_bytes (TREE_TYPE (types
[i
]));
5028 tree eltype
= TREE_TYPE (types
[num
- 1]);
5029 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5030 eltype
= TREE_TYPE (eltype
);
5031 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5032 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5033 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
5034 size
= size_binop (EXACT_DIV_EXPR
, size
,
5035 size_in_bytes (eltype
));
5036 size
= size_binop (MULT_EXPR
, size
, l
);
5038 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
5039 size
, size_zero_node
);
5042 size
= size_binop (MULT_EXPR
, size
, l
);
5045 if (!processing_template_decl
)
5048 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
5049 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5050 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
5051 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
5053 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5054 size
= save_expr (size
);
5055 tree index_type
= build_index_type (size
);
5056 tree eltype
= TREE_TYPE (first
);
5057 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5058 eltype
= TREE_TYPE (eltype
);
5059 tree type
= build_array_type (eltype
, index_type
);
5060 tree ptype
= build_pointer_type (eltype
);
5061 if (TYPE_REF_P (TREE_TYPE (t
))
5062 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
5063 t
= convert_from_reference (t
);
5064 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5065 t
= build_fold_addr_expr (t
);
5066 tree t2
= build_fold_addr_expr (first
);
5067 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5068 ptrdiff_type_node
, t2
);
5069 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5070 ptrdiff_type_node
, t2
,
5071 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5072 ptrdiff_type_node
, t
));
5073 if (tree_fits_shwi_p (t2
))
5074 t
= build2 (MEM_REF
, type
, t
,
5075 build_int_cst (ptype
, tree_to_shwi (t2
)));
5078 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5080 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5081 TREE_TYPE (t
), t
, t2
);
5082 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5084 OMP_CLAUSE_DECL (c
) = t
;
5087 OMP_CLAUSE_DECL (c
) = first
;
5088 OMP_CLAUSE_SIZE (c
) = size
;
5089 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5090 || (TREE_CODE (t
) == COMPONENT_REF
5091 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5093 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5094 switch (OMP_CLAUSE_MAP_KIND (c
))
5096 case GOMP_MAP_ALLOC
:
5099 case GOMP_MAP_TOFROM
:
5100 case GOMP_MAP_ALWAYS_TO
:
5101 case GOMP_MAP_ALWAYS_FROM
:
5102 case GOMP_MAP_ALWAYS_TOFROM
:
5103 case GOMP_MAP_RELEASE
:
5104 case GOMP_MAP_DELETE
:
5105 case GOMP_MAP_FORCE_TO
:
5106 case GOMP_MAP_FORCE_FROM
:
5107 case GOMP_MAP_FORCE_TOFROM
:
5108 case GOMP_MAP_FORCE_PRESENT
:
5109 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5114 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5116 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5117 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5118 else if (TREE_CODE (t
) == COMPONENT_REF
)
5119 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5120 else if (REFERENCE_REF_P (t
)
5121 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5123 t
= TREE_OPERAND (t
, 0);
5124 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5127 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5128 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5129 && !cxx_mark_addressable (t
))
5131 OMP_CLAUSE_DECL (c2
) = t
;
5132 t
= build_fold_addr_expr (first
);
5133 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5134 ptrdiff_type_node
, t
);
5135 tree ptr
= OMP_CLAUSE_DECL (c2
);
5136 ptr
= convert_from_reference (ptr
);
5137 if (!INDIRECT_TYPE_P (TREE_TYPE (ptr
)))
5138 ptr
= build_fold_addr_expr (ptr
);
5139 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5140 ptrdiff_type_node
, t
,
5141 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5142 ptrdiff_type_node
, ptr
));
5143 OMP_CLAUSE_SIZE (c2
) = t
;
5144 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5145 OMP_CLAUSE_CHAIN (c
) = c2
;
5146 ptr
= OMP_CLAUSE_DECL (c2
);
5147 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5148 && TYPE_REF_P (TREE_TYPE (ptr
))
5149 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5151 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5153 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5154 OMP_CLAUSE_DECL (c3
) = ptr
;
5155 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5156 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5158 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5159 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5160 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5161 OMP_CLAUSE_CHAIN (c2
) = c3
;
5168 /* Return identifier to look up for omp declare reduction. */
5171 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5173 const char *p
= NULL
;
5174 const char *m
= NULL
;
5175 switch (reduction_code
)
5183 case TRUTH_ANDIF_EXPR
:
5184 case TRUTH_ORIF_EXPR
:
5185 reduction_id
= ovl_op_identifier (false, reduction_code
);
5199 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5200 return error_mark_node
;
5201 p
= IDENTIFIER_POINTER (reduction_id
);
5204 if (type
!= NULL_TREE
)
5205 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5207 const char prefix
[] = "omp declare reduction ";
5208 size_t lenp
= sizeof (prefix
);
5209 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5211 size_t len
= strlen (p
);
5212 size_t lenm
= m
? strlen (m
) + 1 : 0;
5213 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5215 memcpy (name
, prefix
, lenp
- 1);
5216 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5219 name
[lenp
+ len
- 1] = '~';
5220 memcpy (name
+ lenp
+ len
, m
, lenm
);
5222 return get_identifier (name
);
5225 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5226 FUNCTION_DECL or NULL_TREE if not found. */
5229 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5230 vec
<tree
> *ambiguousp
)
5233 tree baselink
= NULL_TREE
;
5234 if (identifier_p (id
))
5237 bool nonint_cst_expression_p
;
5238 const char *error_msg
;
5239 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5240 tree decl
= lookup_name (id
);
5241 if (decl
== NULL_TREE
)
5242 decl
= error_mark_node
;
5243 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5244 &nonint_cst_expression_p
, false, true, false,
5245 false, &error_msg
, loc
);
5246 if (idk
== CP_ID_KIND_UNQUALIFIED
5247 && identifier_p (id
))
5249 vec
<tree
, va_gc
> *args
= NULL
;
5250 vec_safe_push (args
, build_reference_type (type
));
5251 id
= perform_koenig_lookup (id
, args
, tf_none
);
5254 else if (TREE_CODE (id
) == SCOPE_REF
)
5255 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5256 omp_reduction_id (ERROR_MARK
,
5257 TREE_OPERAND (id
, 1),
5262 if (fns
&& is_overloaded_fn (fns
))
5264 for (lkp_iterator
iter (get_fns (fns
)); iter
; ++iter
)
5266 tree fndecl
= *iter
;
5267 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5269 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5270 if (same_type_p (TREE_TYPE (argtype
), type
))
5278 if (id
&& BASELINK_P (fns
))
5287 if (!id
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5289 vec
<tree
> ambiguous
= vNULL
;
5290 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5292 if (ambiguousp
== NULL
)
5293 ambiguousp
= &ambiguous
;
5294 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5296 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5297 baselinkp
? baselinkp
: &baselink
,
5299 if (id
== NULL_TREE
)
5301 if (!ambiguousp
->is_empty ())
5302 ambiguousp
->safe_push (id
);
5303 else if (ret
!= NULL_TREE
)
5305 ambiguousp
->safe_push (ret
);
5306 ambiguousp
->safe_push (id
);
5312 if (ambiguousp
!= &ambiguous
)
5314 if (!ambiguous
.is_empty ())
5316 const char *str
= _("candidates are:");
5319 error_at (loc
, "user defined reduction lookup is ambiguous");
5320 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5322 inform (DECL_SOURCE_LOCATION (udr
), "%s %#qD", str
, udr
);
5324 str
= get_spaces (str
);
5326 ambiguous
.release ();
5327 ret
= error_mark_node
;
5328 baselink
= NULL_TREE
;
5333 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5334 id
, id
, tf_warning_or_error
);
5338 /* Helper function for cp_parser_omp_declare_reduction_exprs
5340 Remove CLEANUP_STMT for data (omp_priv variable).
5341 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5345 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5349 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5350 *tp
= CLEANUP_BODY (*tp
);
5351 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5353 tree decl
= DECL_EXPR_DECL (*tp
);
5354 if (!processing_template_decl
5355 && decl
== (tree
) data
5356 && DECL_INITIAL (decl
)
5357 && DECL_INITIAL (decl
) != error_mark_node
)
5359 tree list
= NULL_TREE
;
5360 append_to_statement_list_force (*tp
, &list
);
5361 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5362 decl
, DECL_INITIAL (decl
));
5363 DECL_INITIAL (decl
) = NULL_TREE
;
5364 append_to_statement_list_force (init_expr
, &list
);
5371 /* Data passed from cp_check_omp_declare_reduction to
5372 cp_check_omp_declare_reduction_r. */
5374 struct cp_check_omp_declare_reduction_data
5381 /* Helper function for cp_check_omp_declare_reduction, called via
5385 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5387 struct cp_check_omp_declare_reduction_data
*udr_data
5388 = (struct cp_check_omp_declare_reduction_data
*) data
;
5390 && !DECL_ARTIFICIAL (*tp
)
5391 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5392 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5394 location_t loc
= udr_data
->loc
;
5395 if (udr_data
->combiner_p
)
5396 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5397 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5400 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5401 "to variable %qD which is not %<omp_priv%> nor "
5409 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5412 cp_check_omp_declare_reduction (tree udr
)
5414 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5415 gcc_assert (TYPE_REF_P (type
));
5416 type
= TREE_TYPE (type
);
5418 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5420 if (type
== error_mark_node
)
5422 if (ARITHMETIC_TYPE_P (type
))
5424 static enum tree_code predef_codes
[]
5425 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5426 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5427 for (i
= 0; i
< 8; i
++)
5429 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5430 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5431 const char *n2
= IDENTIFIER_POINTER (id
);
5432 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5433 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5434 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5439 && TREE_CODE (type
) != COMPLEX_EXPR
)
5441 const char prefix_minmax
[] = "omp declare reduction m";
5442 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5443 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5444 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5445 prefix_minmax
, prefix_size
) == 0
5446 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5447 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5448 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5453 error_at (loc
, "predeclared arithmetic type %qT in "
5454 "%<#pragma omp declare reduction%>", type
);
5458 else if (TREE_CODE (type
) == FUNCTION_TYPE
5459 || TREE_CODE (type
) == METHOD_TYPE
5460 || TREE_CODE (type
) == ARRAY_TYPE
)
5462 error_at (loc
, "function or array type %qT in "
5463 "%<#pragma omp declare reduction%>", type
);
5466 else if (TYPE_REF_P (type
))
5468 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5472 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5474 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5475 "%<#pragma omp declare reduction%>", type
);
5479 tree body
= DECL_SAVED_TREE (udr
);
5480 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5483 tree_stmt_iterator tsi
;
5484 struct cp_check_omp_declare_reduction_data data
;
5485 memset (data
.stmts
, 0, sizeof data
.stmts
);
5486 for (i
= 0, tsi
= tsi_start (body
);
5487 i
< 7 && !tsi_end_p (tsi
);
5488 i
++, tsi_next (&tsi
))
5489 data
.stmts
[i
] = tsi_stmt (tsi
);
5491 gcc_assert (tsi_end_p (tsi
));
5494 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5495 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5496 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5498 data
.combiner_p
= true;
5499 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5501 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5505 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5506 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5507 data
.combiner_p
= false;
5508 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5510 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5511 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5512 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5514 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5518 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5519 an inline call. But, remap
5520 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5521 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5524 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5525 tree decl
, tree placeholder
)
5528 hash_map
<tree
, tree
> decl_map
;
5530 decl_map
.put (omp_decl1
, placeholder
);
5531 decl_map
.put (omp_decl2
, decl
);
5532 memset (&id
, 0, sizeof (id
));
5533 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5534 id
.dst_fn
= current_function_decl
;
5535 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5536 id
.decl_map
= &decl_map
;
5538 id
.copy_decl
= copy_decl_no_change
;
5539 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5540 id
.transform_new_cfg
= true;
5541 id
.transform_return_to_modify
= false;
5542 id
.transform_lang_insert_block
= NULL
;
5544 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5548 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5549 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5552 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5554 if (*tp
== (tree
) data
)
5559 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5560 Return true if there is some error and the clause should be removed. */
5563 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5565 tree t
= OMP_CLAUSE_DECL (c
);
5566 bool predefined
= false;
5567 if (TREE_CODE (t
) == TREE_LIST
)
5569 gcc_assert (processing_template_decl
);
5572 tree type
= TREE_TYPE (t
);
5573 if (TREE_CODE (t
) == MEM_REF
)
5574 type
= TREE_TYPE (type
);
5575 if (TYPE_REF_P (type
))
5576 type
= TREE_TYPE (type
);
5577 if (TREE_CODE (type
) == ARRAY_TYPE
)
5580 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5581 while (TREE_CODE (type
) == ARRAY_TYPE
)
5582 type
= TREE_TYPE (type
);
5583 if (!processing_template_decl
)
5585 t
= require_complete_type (t
);
5586 if (t
== error_mark_node
)
5588 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5589 TYPE_SIZE_UNIT (type
));
5590 if (integer_zerop (size
))
5592 error_at (OMP_CLAUSE_LOCATION (c
),
5593 "%qE in %<reduction%> clause is a zero size array",
5594 omp_clause_printable_decl (t
));
5597 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5598 size
= save_expr (size
);
5599 tree index_type
= build_index_type (size
);
5600 tree atype
= build_array_type (type
, index_type
);
5601 tree ptype
= build_pointer_type (type
);
5602 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5603 t
= build_fold_addr_expr (t
);
5604 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5605 OMP_CLAUSE_DECL (c
) = t
;
5608 if (type
== error_mark_node
)
5610 else if (ARITHMETIC_TYPE_P (type
))
5611 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5620 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5627 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5631 case TRUTH_ANDIF_EXPR
:
5632 case TRUTH_ORIF_EXPR
:
5633 if (FLOAT_TYPE_P (type
))
5640 else if (TYPE_READONLY (type
))
5642 error_at (OMP_CLAUSE_LOCATION (c
),
5643 "%qE has const type for %<reduction%>",
5644 omp_clause_printable_decl (t
));
5647 else if (!processing_template_decl
)
5649 t
= require_complete_type (t
);
5650 if (t
== error_mark_node
)
5652 OMP_CLAUSE_DECL (c
) = t
;
5657 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5660 else if (processing_template_decl
)
5662 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) == error_mark_node
)
5667 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5669 type
= TYPE_MAIN_VARIANT (type
);
5670 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5671 if (id
== NULL_TREE
)
5672 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5673 NULL_TREE
, NULL_TREE
);
5674 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5677 if (id
== error_mark_node
)
5680 tree body
= DECL_SAVED_TREE (id
);
5683 if (TREE_CODE (body
) == STATEMENT_LIST
)
5685 tree_stmt_iterator tsi
;
5686 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5689 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5690 atype
= TREE_TYPE (atype
);
5691 bool need_static_cast
= !same_type_p (type
, atype
);
5692 memset (stmts
, 0, sizeof stmts
);
5693 for (i
= 0, tsi
= tsi_start (body
);
5694 i
< 7 && !tsi_end_p (tsi
);
5695 i
++, tsi_next (&tsi
))
5696 stmts
[i
] = tsi_stmt (tsi
);
5697 gcc_assert (tsi_end_p (tsi
));
5701 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5702 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5703 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5704 DECL_ARTIFICIAL (placeholder
) = 1;
5705 DECL_IGNORED_P (placeholder
) = 1;
5706 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5707 if (TREE_CODE (t
) == MEM_REF
)
5709 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5711 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5712 DECL_IGNORED_P (decl_placeholder
) = 1;
5713 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5715 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5716 cxx_mark_addressable (placeholder
);
5717 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5718 && (decl_placeholder
5719 || !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
)))))
5720 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5721 : OMP_CLAUSE_DECL (c
));
5722 tree omp_out
= placeholder
;
5723 tree omp_in
= decl_placeholder
? decl_placeholder
5724 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5725 if (need_static_cast
)
5727 tree rtype
= build_reference_type (atype
);
5728 omp_out
= build_static_cast (rtype
, omp_out
,
5729 tf_warning_or_error
);
5730 omp_in
= build_static_cast (rtype
, omp_in
,
5731 tf_warning_or_error
);
5732 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5734 omp_out
= convert_from_reference (omp_out
);
5735 omp_in
= convert_from_reference (omp_in
);
5737 OMP_CLAUSE_REDUCTION_MERGE (c
)
5738 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5739 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5743 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5744 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5745 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3]))
5746 && (decl_placeholder
5747 || !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
)))))
5748 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5749 : OMP_CLAUSE_DECL (c
));
5750 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5751 cxx_mark_addressable (placeholder
);
5752 tree omp_priv
= decl_placeholder
? decl_placeholder
5753 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5754 tree omp_orig
= placeholder
;
5755 if (need_static_cast
)
5759 error_at (OMP_CLAUSE_LOCATION (c
),
5760 "user defined reduction with constructor "
5761 "initializer for base class %qT", atype
);
5764 tree rtype
= build_reference_type (atype
);
5765 omp_priv
= build_static_cast (rtype
, omp_priv
,
5766 tf_warning_or_error
);
5767 omp_orig
= build_static_cast (rtype
, omp_orig
,
5768 tf_warning_or_error
);
5769 if (omp_priv
== error_mark_node
5770 || omp_orig
== error_mark_node
)
5772 omp_priv
= convert_from_reference (omp_priv
);
5773 omp_orig
= convert_from_reference (omp_orig
);
5776 *need_default_ctor
= true;
5777 OMP_CLAUSE_REDUCTION_INIT (c
)
5778 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5779 DECL_EXPR_DECL (stmts
[3]),
5780 omp_priv
, omp_orig
);
5781 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5782 find_omp_placeholder_r
, placeholder
, NULL
))
5783 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5787 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5788 *need_default_ctor
= true;
5792 tree v
= decl_placeholder
? decl_placeholder
5793 : convert_from_reference (t
);
5794 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5795 init
= build_constructor (TREE_TYPE (v
), NULL
);
5797 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5798 OMP_CLAUSE_REDUCTION_INIT (c
)
5799 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5804 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5808 error_at (OMP_CLAUSE_LOCATION (c
),
5809 "user defined reduction not found for %qE",
5810 omp_clause_printable_decl (t
));
5813 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5814 gcc_assert (TYPE_SIZE_UNIT (type
)
5815 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5819 /* Called from finish_struct_1. linear(this) or linear(this:step)
5820 clauses might not be finalized yet because the class has been incomplete
5821 when parsing #pragma omp declare simd methods. Fix those up now. */
5824 finish_omp_declare_simd_methods (tree t
)
5826 if (processing_template_decl
)
5829 for (tree x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
5831 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5833 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5834 if (!ods
|| !TREE_VALUE (ods
))
5836 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5837 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5838 && integer_zerop (OMP_CLAUSE_DECL (c
))
5839 && OMP_CLAUSE_LINEAR_STEP (c
)
5840 && TYPE_PTR_P (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
))))
5842 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5843 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5844 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5845 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5846 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5851 /* Adjust sink depend clause to take into account pointer offsets.
5853 Return TRUE if there was a problem processing the offset, and the
5854 whole clause should be removed. */
5857 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5859 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5860 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5862 /* Make sure we don't adjust things twice for templates. */
5863 if (processing_template_decl
)
5866 for (; t
; t
= TREE_CHAIN (t
))
5868 tree decl
= TREE_VALUE (t
);
5869 if (TYPE_PTR_P (TREE_TYPE (decl
)))
5871 tree offset
= TREE_PURPOSE (t
);
5872 bool neg
= wi::neg_p (wi::to_wide (offset
));
5873 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5874 decl
= mark_rvalue_use (decl
);
5875 decl
= convert_from_reference (decl
);
5876 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5877 neg
? MINUS_EXPR
: PLUS_EXPR
,
5879 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5880 MINUS_EXPR
, sizetype
,
5881 fold_convert (sizetype
, t2
),
5882 fold_convert (sizetype
, decl
));
5883 if (t2
== error_mark_node
)
5885 TREE_PURPOSE (t
) = t2
;
5891 /* Finish OpenMP iterators ITER. Return true if they are errorneous
5892 and clauses containing them should be removed. */
5895 cp_omp_finish_iterators (tree iter
)
5898 for (tree it
= iter
; it
; it
= TREE_CHAIN (it
))
5900 tree var
= TREE_VEC_ELT (it
, 0);
5901 tree begin
= TREE_VEC_ELT (it
, 1);
5902 tree end
= TREE_VEC_ELT (it
, 2);
5903 tree step
= TREE_VEC_ELT (it
, 3);
5905 tree type
= TREE_TYPE (var
);
5906 location_t loc
= DECL_SOURCE_LOCATION (var
);
5907 if (type
== error_mark_node
)
5912 if (type_dependent_expression_p (var
))
5914 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
5916 error_at (loc
, "iterator %qD has neither integral nor pointer type",
5921 else if (TYPE_READONLY (type
))
5923 error_at (loc
, "iterator %qD has const qualified type", var
);
5927 if (type_dependent_expression_p (begin
)
5928 || type_dependent_expression_p (end
)
5929 || type_dependent_expression_p (step
))
5931 else if (error_operand_p (step
))
5936 else if (!INTEGRAL_TYPE_P (TREE_TYPE (step
)))
5938 error_at (EXPR_LOC_OR_LOC (step
, loc
),
5939 "iterator step with non-integral type");
5944 begin
= mark_rvalue_use (begin
);
5945 end
= mark_rvalue_use (end
);
5946 step
= mark_rvalue_use (step
);
5947 begin
= cp_build_c_cast (type
, begin
, tf_warning_or_error
);
5948 end
= cp_build_c_cast (type
, end
, tf_warning_or_error
);
5950 if (!processing_template_decl
)
5951 step
= orig_step
= save_expr (step
);
5952 tree stype
= POINTER_TYPE_P (type
) ? sizetype
: type
;
5953 step
= cp_build_c_cast (stype
, step
, tf_warning_or_error
);
5954 if (POINTER_TYPE_P (type
) && !processing_template_decl
)
5956 begin
= save_expr (begin
);
5957 step
= pointer_int_sum (loc
, PLUS_EXPR
, begin
, step
);
5958 step
= fold_build2_loc (loc
, MINUS_EXPR
, sizetype
,
5959 fold_convert (sizetype
, step
),
5960 fold_convert (sizetype
, begin
));
5961 step
= fold_convert (ssizetype
, step
);
5963 if (!processing_template_decl
)
5965 begin
= maybe_constant_value (begin
);
5966 end
= maybe_constant_value (end
);
5967 step
= maybe_constant_value (step
);
5968 orig_step
= maybe_constant_value (orig_step
);
5970 if (integer_zerop (step
))
5972 error_at (loc
, "iterator %qD has zero step", var
);
5977 if (begin
== error_mark_node
5978 || end
== error_mark_node
5979 || step
== error_mark_node
5980 || orig_step
== error_mark_node
)
5986 if (!processing_template_decl
)
5988 begin
= fold_build_cleanup_point_expr (TREE_TYPE (begin
), begin
);
5989 end
= fold_build_cleanup_point_expr (TREE_TYPE (end
), end
);
5990 step
= fold_build_cleanup_point_expr (TREE_TYPE (step
), step
);
5991 orig_step
= fold_build_cleanup_point_expr (TREE_TYPE (orig_step
),
5994 hash_set
<tree
> pset
;
5996 for (it2
= TREE_CHAIN (it
); it2
; it2
= TREE_CHAIN (it2
))
5998 tree var2
= TREE_VEC_ELT (it2
, 0);
5999 tree begin2
= TREE_VEC_ELT (it2
, 1);
6000 tree end2
= TREE_VEC_ELT (it2
, 2);
6001 tree step2
= TREE_VEC_ELT (it2
, 3);
6002 location_t loc2
= DECL_SOURCE_LOCATION (var2
);
6003 if (cp_walk_tree (&begin2
, find_omp_placeholder_r
, var
, &pset
))
6005 error_at (EXPR_LOC_OR_LOC (begin2
, loc2
),
6006 "begin expression refers to outer iterator %qD", var
);
6009 else if (cp_walk_tree (&end2
, find_omp_placeholder_r
, var
, &pset
))
6011 error_at (EXPR_LOC_OR_LOC (end2
, loc2
),
6012 "end expression refers to outer iterator %qD", var
);
6015 else if (cp_walk_tree (&step2
, find_omp_placeholder_r
, var
, &pset
))
6017 error_at (EXPR_LOC_OR_LOC (step2
, loc2
),
6018 "step expression refers to outer iterator %qD", var
);
6027 TREE_VEC_ELT (it
, 1) = begin
;
6028 TREE_VEC_ELT (it
, 2) = end
;
6029 if (processing_template_decl
)
6030 TREE_VEC_ELT (it
, 3) = orig_step
;
6033 TREE_VEC_ELT (it
, 3) = step
;
6034 TREE_VEC_ELT (it
, 4) = orig_step
;
6040 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
6041 Remove any elements from the list that are invalid. */
6044 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
6046 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
6047 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
6049 tree safelen
= NULL_TREE
;
6050 bool branch_seen
= false;
6051 bool copyprivate_seen
= false;
6052 bool ordered_seen
= false;
6053 bool oacc_async
= false;
6054 tree last_iterators
= NULL_TREE
;
6055 bool last_iterators_remove
= false;
6056 bool reduction_seen
= false;
6058 bitmap_obstack_initialize (NULL
);
6059 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
6060 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
6061 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
6062 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
6063 /* If ort == C_ORT_OMP_DECLARE_SIMD used as uniform_head instead. */
6064 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
6065 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
6066 /* If ort == C_ORT_OMP used as nontemporal_head instead. */
6067 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
6069 if (ort
& C_ORT_ACC
)
6070 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
6071 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
6077 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
6079 bool remove
= false;
6080 bool field_ok
= false;
6082 switch (OMP_CLAUSE_CODE (c
))
6084 case OMP_CLAUSE_SHARED
:
6085 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6086 goto check_dup_generic
;
6087 case OMP_CLAUSE_PRIVATE
:
6088 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6089 goto check_dup_generic
;
6090 case OMP_CLAUSE_REDUCTION
:
6091 reduction_seen
= true;
6093 case OMP_CLAUSE_IN_REDUCTION
:
6094 case OMP_CLAUSE_TASK_REDUCTION
:
6095 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6096 t
= OMP_CLAUSE_DECL (c
);
6097 if (TREE_CODE (t
) == TREE_LIST
)
6099 if (handle_omp_array_sections (c
, ort
))
6104 if (TREE_CODE (t
) == TREE_LIST
)
6106 while (TREE_CODE (t
) == TREE_LIST
)
6111 gcc_assert (TREE_CODE (t
) == MEM_REF
);
6112 t
= TREE_OPERAND (t
, 0);
6113 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
6114 t
= TREE_OPERAND (t
, 0);
6115 if (TREE_CODE (t
) == ADDR_EXPR
6116 || INDIRECT_REF_P (t
))
6117 t
= TREE_OPERAND (t
, 0);
6119 tree n
= omp_clause_decl_field (t
);
6122 goto check_dup_generic_t
;
6125 cxx_mark_addressable (t
);
6126 goto check_dup_generic
;
6127 case OMP_CLAUSE_COPYPRIVATE
:
6128 copyprivate_seen
= true;
6129 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6130 goto check_dup_generic
;
6131 case OMP_CLAUSE_COPYIN
:
6132 goto check_dup_generic
;
6133 case OMP_CLAUSE_LINEAR
:
6134 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
6135 t
= OMP_CLAUSE_DECL (c
);
6136 if (ort
!= C_ORT_OMP_DECLARE_SIMD
6137 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
6139 error_at (OMP_CLAUSE_LOCATION (c
),
6140 "modifier should not be specified in %<linear%> "
6141 "clause on %<simd%> or %<for%> constructs");
6142 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
6144 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6145 && !type_dependent_expression_p (t
))
6147 tree type
= TREE_TYPE (t
);
6148 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
6149 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
6150 && !TYPE_REF_P (type
))
6152 error_at (OMP_CLAUSE_LOCATION (c
),
6153 "linear clause with %qs modifier applied to "
6154 "non-reference variable with %qT type",
6155 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
6156 ? "ref" : "uval", TREE_TYPE (t
));
6160 if (TYPE_REF_P (type
))
6161 type
= TREE_TYPE (type
);
6162 if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
6164 if (!INTEGRAL_TYPE_P (type
)
6165 && !TYPE_PTR_P (type
))
6167 error_at (OMP_CLAUSE_LOCATION (c
),
6168 "linear clause applied to non-integral "
6169 "non-pointer variable with %qT type",
6176 t
= OMP_CLAUSE_LINEAR_STEP (c
);
6178 t
= integer_one_node
;
6179 if (t
== error_mark_node
)
6184 else if (!type_dependent_expression_p (t
)
6185 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
6186 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6187 || TREE_CODE (t
) != PARM_DECL
6188 || !TYPE_REF_P (TREE_TYPE (t
))
6189 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
6191 error_at (OMP_CLAUSE_LOCATION (c
),
6192 "linear step expression must be integral");
6198 t
= mark_rvalue_use (t
);
6199 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
6201 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
6202 goto check_dup_generic
;
6204 if (!processing_template_decl
6205 && (VAR_P (OMP_CLAUSE_DECL (c
))
6206 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
6208 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
6210 t
= maybe_constant_value (t
);
6211 if (TREE_CODE (t
) != INTEGER_CST
)
6213 error_at (OMP_CLAUSE_LOCATION (c
),
6214 "%<linear%> clause step %qE is neither "
6215 "constant nor a parameter", t
);
6220 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6221 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
6222 if (TYPE_REF_P (type
))
6223 type
= TREE_TYPE (type
);
6224 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
6226 type
= build_pointer_type (type
);
6227 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
6228 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6230 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6231 MINUS_EXPR
, sizetype
,
6232 fold_convert (sizetype
, t
),
6233 fold_convert (sizetype
, d
));
6234 if (t
== error_mark_node
)
6240 else if (TYPE_PTR_P (type
)
6241 /* Can't multiply the step yet if *this
6242 is still incomplete type. */
6243 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6244 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6245 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6246 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6248 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6250 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6251 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6253 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6254 MINUS_EXPR
, sizetype
,
6255 fold_convert (sizetype
, t
),
6256 fold_convert (sizetype
, d
));
6257 if (t
== error_mark_node
)
6264 t
= fold_convert (type
, t
);
6266 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6268 goto check_dup_generic
;
6270 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6273 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6274 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6277 t
= OMP_CLAUSE_DECL (c
);
6278 check_dup_generic_t
:
6279 if (t
== current_class_ptr
6280 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6281 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6282 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6284 error_at (OMP_CLAUSE_LOCATION (c
),
6285 "%<this%> allowed in OpenMP only in %<declare simd%>"
6290 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6291 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6293 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6296 error_at (OMP_CLAUSE_LOCATION (c
),
6297 "%qD is not a variable in clause %qs", t
,
6298 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6300 error_at (OMP_CLAUSE_LOCATION (c
),
6301 "%qE is not a variable in clause %qs", t
,
6302 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6305 else if (ort
== C_ORT_ACC
6306 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6308 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6310 error_at (OMP_CLAUSE_LOCATION (c
),
6311 "%qD appears more than once in reduction clauses",
6316 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6318 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6319 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6320 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6322 error_at (OMP_CLAUSE_LOCATION (c
),
6323 "%qD appears more than once in data clauses", t
);
6326 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6327 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6329 if (ort
== C_ORT_ACC
)
6330 error_at (OMP_CLAUSE_LOCATION (c
),
6331 "%qD appears more than once in data clauses", t
);
6333 error_at (OMP_CLAUSE_LOCATION (c
),
6334 "%qD appears both in data and map clauses", t
);
6338 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6343 && TREE_CODE (t
) == FIELD_DECL
6344 && t
== OMP_CLAUSE_DECL (c
)
6345 && ort
!= C_ORT_ACC
)
6348 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6349 == OMP_CLAUSE_SHARED
));
6350 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6355 case OMP_CLAUSE_FIRSTPRIVATE
:
6356 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6358 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6360 t
= OMP_CLAUSE_DECL (c
);
6361 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6363 error_at (OMP_CLAUSE_LOCATION (c
),
6364 "%<this%> allowed in OpenMP only in %<declare simd%>"
6369 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6370 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6371 || TREE_CODE (t
) != FIELD_DECL
))
6373 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6376 error_at (OMP_CLAUSE_LOCATION (c
),
6377 "%qD is not a variable in clause %<firstprivate%>",
6380 error_at (OMP_CLAUSE_LOCATION (c
),
6381 "%qE is not a variable in clause %<firstprivate%>",
6385 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6386 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6388 error_at (OMP_CLAUSE_LOCATION (c
),
6389 "%qD appears more than once in data clauses", t
);
6392 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6394 if (ort
== C_ORT_ACC
)
6395 error_at (OMP_CLAUSE_LOCATION (c
),
6396 "%qD appears more than once in data clauses", t
);
6398 error_at (OMP_CLAUSE_LOCATION (c
),
6399 "%qD appears both in data and map clauses", t
);
6403 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6404 goto handle_field_decl
;
6406 case OMP_CLAUSE_LASTPRIVATE
:
6407 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6409 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6411 t
= OMP_CLAUSE_DECL (c
);
6412 if (t
== current_class_ptr
)
6414 error_at (OMP_CLAUSE_LOCATION (c
),
6415 "%<this%> allowed in OpenMP only in %<declare simd%>"
6420 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6421 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6422 || TREE_CODE (t
) != FIELD_DECL
))
6424 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6427 error_at (OMP_CLAUSE_LOCATION (c
),
6428 "%qD is not a variable in clause %<lastprivate%>",
6431 error_at (OMP_CLAUSE_LOCATION (c
),
6432 "%qE is not a variable in clause %<lastprivate%>",
6436 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6437 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6439 error_at (OMP_CLAUSE_LOCATION (c
),
6440 "%qD appears more than once in data clauses", t
);
6444 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6445 goto handle_field_decl
;
6448 t
= OMP_CLAUSE_IF_EXPR (c
);
6449 t
= maybe_convert_cond (t
);
6450 if (t
== error_mark_node
)
6452 else if (!processing_template_decl
)
6453 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6454 OMP_CLAUSE_IF_EXPR (c
) = t
;
6457 case OMP_CLAUSE_FINAL
:
6458 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6459 t
= maybe_convert_cond (t
);
6460 if (t
== error_mark_node
)
6462 else if (!processing_template_decl
)
6463 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6464 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6467 case OMP_CLAUSE_GANG
:
6468 /* Operand 1 is the gang static: argument. */
6469 t
= OMP_CLAUSE_OPERAND (c
, 1);
6472 if (t
== error_mark_node
)
6474 else if (!type_dependent_expression_p (t
)
6475 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6477 error_at (OMP_CLAUSE_LOCATION (c
),
6478 "%<gang%> static expression must be integral");
6483 t
= mark_rvalue_use (t
);
6484 if (!processing_template_decl
)
6486 t
= maybe_constant_value (t
);
6487 if (TREE_CODE (t
) == INTEGER_CST
6488 && tree_int_cst_sgn (t
) != 1
6489 && t
!= integer_minus_one_node
)
6491 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6492 "%<gang%> static value must be "
6494 t
= integer_one_node
;
6496 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6499 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6501 /* Check operand 0, the num argument. */
6504 case OMP_CLAUSE_WORKER
:
6505 case OMP_CLAUSE_VECTOR
:
6506 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6510 case OMP_CLAUSE_NUM_TASKS
:
6511 case OMP_CLAUSE_NUM_TEAMS
:
6512 case OMP_CLAUSE_NUM_THREADS
:
6513 case OMP_CLAUSE_NUM_GANGS
:
6514 case OMP_CLAUSE_NUM_WORKERS
:
6515 case OMP_CLAUSE_VECTOR_LENGTH
:
6516 t
= OMP_CLAUSE_OPERAND (c
, 0);
6517 if (t
== error_mark_node
)
6519 else if (!type_dependent_expression_p (t
)
6520 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6522 switch (OMP_CLAUSE_CODE (c
))
6524 case OMP_CLAUSE_GANG
:
6525 error_at (OMP_CLAUSE_LOCATION (c
),
6526 "%<gang%> num expression must be integral"); break;
6527 case OMP_CLAUSE_VECTOR
:
6528 error_at (OMP_CLAUSE_LOCATION (c
),
6529 "%<vector%> length expression must be integral");
6531 case OMP_CLAUSE_WORKER
:
6532 error_at (OMP_CLAUSE_LOCATION (c
),
6533 "%<worker%> num expression must be integral");
6536 error_at (OMP_CLAUSE_LOCATION (c
),
6537 "%qs expression must be integral",
6538 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6544 t
= mark_rvalue_use (t
);
6545 if (!processing_template_decl
)
6547 t
= maybe_constant_value (t
);
6548 if (TREE_CODE (t
) == INTEGER_CST
6549 && tree_int_cst_sgn (t
) != 1)
6551 switch (OMP_CLAUSE_CODE (c
))
6553 case OMP_CLAUSE_GANG
:
6554 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6555 "%<gang%> num value must be positive");
6557 case OMP_CLAUSE_VECTOR
:
6558 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6559 "%<vector%> length value must be "
6562 case OMP_CLAUSE_WORKER
:
6563 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6564 "%<worker%> num value must be "
6568 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6569 "%qs value must be positive",
6570 omp_clause_code_name
6571 [OMP_CLAUSE_CODE (c
)]);
6573 t
= integer_one_node
;
6575 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6577 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6581 case OMP_CLAUSE_SCHEDULE
:
6582 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6585 else if (t
== error_mark_node
)
6587 else if (!type_dependent_expression_p (t
)
6588 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6590 error_at (OMP_CLAUSE_LOCATION (c
),
6591 "schedule chunk size expression must be integral");
6596 t
= mark_rvalue_use (t
);
6597 if (!processing_template_decl
)
6599 t
= maybe_constant_value (t
);
6600 if (TREE_CODE (t
) == INTEGER_CST
6601 && tree_int_cst_sgn (t
) != 1)
6603 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6604 "chunk size value must be positive");
6605 t
= integer_one_node
;
6607 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6609 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6613 case OMP_CLAUSE_SIMDLEN
:
6614 case OMP_CLAUSE_SAFELEN
:
6615 t
= OMP_CLAUSE_OPERAND (c
, 0);
6616 if (t
== error_mark_node
)
6618 else if (!type_dependent_expression_p (t
)
6619 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6621 error_at (OMP_CLAUSE_LOCATION (c
),
6622 "%qs length expression must be integral",
6623 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6628 t
= mark_rvalue_use (t
);
6629 if (!processing_template_decl
)
6631 t
= maybe_constant_value (t
);
6632 if (TREE_CODE (t
) != INTEGER_CST
6633 || tree_int_cst_sgn (t
) != 1)
6635 error_at (OMP_CLAUSE_LOCATION (c
),
6636 "%qs length expression must be positive "
6637 "constant integer expression",
6638 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6642 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6643 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6648 case OMP_CLAUSE_ASYNC
:
6649 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6650 if (t
== error_mark_node
)
6652 else if (!type_dependent_expression_p (t
)
6653 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6655 error_at (OMP_CLAUSE_LOCATION (c
),
6656 "%<async%> expression must be integral");
6661 t
= mark_rvalue_use (t
);
6662 if (!processing_template_decl
)
6663 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6664 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6668 case OMP_CLAUSE_WAIT
:
6669 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6670 if (t
== error_mark_node
)
6672 else if (!processing_template_decl
)
6673 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6674 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6677 case OMP_CLAUSE_THREAD_LIMIT
:
6678 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6679 if (t
== error_mark_node
)
6681 else if (!type_dependent_expression_p (t
)
6682 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6684 error_at (OMP_CLAUSE_LOCATION (c
),
6685 "%<thread_limit%> expression must be integral");
6690 t
= mark_rvalue_use (t
);
6691 if (!processing_template_decl
)
6693 t
= maybe_constant_value (t
);
6694 if (TREE_CODE (t
) == INTEGER_CST
6695 && tree_int_cst_sgn (t
) != 1)
6697 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6698 "%<thread_limit%> value must be positive");
6699 t
= integer_one_node
;
6701 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6703 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6707 case OMP_CLAUSE_DEVICE
:
6708 t
= OMP_CLAUSE_DEVICE_ID (c
);
6709 if (t
== error_mark_node
)
6711 else if (!type_dependent_expression_p (t
)
6712 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6714 error_at (OMP_CLAUSE_LOCATION (c
),
6715 "%<device%> id must be integral");
6720 t
= mark_rvalue_use (t
);
6721 if (!processing_template_decl
)
6722 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6723 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6727 case OMP_CLAUSE_DIST_SCHEDULE
:
6728 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6731 else if (t
== error_mark_node
)
6733 else if (!type_dependent_expression_p (t
)
6734 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6736 error_at (OMP_CLAUSE_LOCATION (c
),
6737 "%<dist_schedule%> chunk size expression must be "
6743 t
= mark_rvalue_use (t
);
6744 if (!processing_template_decl
)
6745 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6746 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6750 case OMP_CLAUSE_ALIGNED
:
6751 t
= OMP_CLAUSE_DECL (c
);
6752 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6754 error_at (OMP_CLAUSE_LOCATION (c
),
6755 "%<this%> allowed in OpenMP only in %<declare simd%>"
6760 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6762 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6765 error_at (OMP_CLAUSE_LOCATION (c
),
6766 "%qD is not a variable in %<aligned%> clause", t
);
6768 error_at (OMP_CLAUSE_LOCATION (c
),
6769 "%qE is not a variable in %<aligned%> clause", t
);
6772 else if (!type_dependent_expression_p (t
)
6773 && !TYPE_PTR_P (TREE_TYPE (t
))
6774 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6775 && (!TYPE_REF_P (TREE_TYPE (t
))
6776 || (!INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6777 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6780 error_at (OMP_CLAUSE_LOCATION (c
),
6781 "%qE in %<aligned%> clause is neither a pointer nor "
6782 "an array nor a reference to pointer or array", t
);
6785 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6787 error_at (OMP_CLAUSE_LOCATION (c
),
6788 "%qD appears more than once in %<aligned%> clauses",
6793 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6794 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6795 if (t
== error_mark_node
)
6797 else if (t
== NULL_TREE
)
6799 else if (!type_dependent_expression_p (t
)
6800 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6802 error_at (OMP_CLAUSE_LOCATION (c
),
6803 "%<aligned%> clause alignment expression must "
6809 t
= mark_rvalue_use (t
);
6810 if (!processing_template_decl
)
6812 t
= maybe_constant_value (t
);
6813 if (TREE_CODE (t
) != INTEGER_CST
6814 || tree_int_cst_sgn (t
) != 1)
6816 error_at (OMP_CLAUSE_LOCATION (c
),
6817 "%<aligned%> clause alignment expression must "
6818 "be positive constant integer expression");
6822 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6824 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6828 case OMP_CLAUSE_NONTEMPORAL
:
6829 t
= OMP_CLAUSE_DECL (c
);
6830 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6832 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6835 error_at (OMP_CLAUSE_LOCATION (c
),
6836 "%qD is not a variable in %<nontemporal%> clause",
6839 error_at (OMP_CLAUSE_LOCATION (c
),
6840 "%qE is not a variable in %<nontemporal%> clause",
6844 else if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6846 error_at (OMP_CLAUSE_LOCATION (c
),
6847 "%qD appears more than once in %<nontemporal%> "
6852 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6855 case OMP_CLAUSE_DEPEND
:
6856 t
= OMP_CLAUSE_DECL (c
);
6859 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6860 == OMP_CLAUSE_DEPEND_SOURCE
);
6863 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6865 if (cp_finish_omp_clause_depend_sink (c
))
6869 if (TREE_CODE (t
) == TREE_LIST
6871 && TREE_CODE (TREE_PURPOSE (t
)) == TREE_VEC
)
6873 if (TREE_PURPOSE (t
) != last_iterators
)
6874 last_iterators_remove
6875 = cp_omp_finish_iterators (TREE_PURPOSE (t
));
6876 last_iterators
= TREE_PURPOSE (t
);
6878 if (last_iterators_remove
)
6879 t
= error_mark_node
;
6882 last_iterators
= NULL_TREE
;
6884 if (TREE_CODE (t
) == TREE_LIST
)
6886 if (handle_omp_array_sections (c
, ort
))
6888 else if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_DEPOBJ
)
6890 error_at (OMP_CLAUSE_LOCATION (c
),
6891 "%<depend%> clause with %<depobj%> dependence "
6892 "type on array section");
6897 if (t
== error_mark_node
)
6899 else if (t
== current_class_ptr
)
6901 error_at (OMP_CLAUSE_LOCATION (c
),
6902 "%<this%> allowed in OpenMP only in %<declare simd%>"
6906 else if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6908 else if (!lvalue_p (t
))
6911 error_at (OMP_CLAUSE_LOCATION (c
),
6912 "%qD is not lvalue expression nor array section "
6913 "in %<depend%> clause", t
);
6915 error_at (OMP_CLAUSE_LOCATION (c
),
6916 "%qE is not lvalue expression nor array section "
6917 "in %<depend%> clause", t
);
6920 else if (TREE_CODE (t
) == COMPONENT_REF
6921 && TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
6922 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6924 error_at (OMP_CLAUSE_LOCATION (c
),
6925 "bit-field %qE in %qs clause", t
, "depend");
6928 else if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_DEPOBJ
)
6930 if (!c_omp_depend_t_p (TYPE_REF_P (TREE_TYPE (t
))
6931 ? TREE_TYPE (TREE_TYPE (t
))
6934 error_at (OMP_CLAUSE_LOCATION (c
),
6935 "%qE does not have %<omp_depend_t%> type in "
6936 "%<depend%> clause with %<depobj%> dependence "
6941 else if (c_omp_depend_t_p (TYPE_REF_P (TREE_TYPE (t
))
6942 ? TREE_TYPE (TREE_TYPE (t
))
6945 error_at (OMP_CLAUSE_LOCATION (c
),
6946 "%qE should not have %<omp_depend_t%> type in "
6947 "%<depend%> clause with dependence type other than "
6953 tree addr
= cp_build_addr_expr (t
, tf_warning_or_error
);
6954 if (addr
== error_mark_node
)
6958 t
= cp_build_indirect_ref (addr
, RO_UNARY_STAR
,
6959 tf_warning_or_error
);
6960 if (t
== error_mark_node
)
6962 else if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == TREE_LIST
6963 && TREE_PURPOSE (OMP_CLAUSE_DECL (c
))
6964 && (TREE_CODE (TREE_PURPOSE (OMP_CLAUSE_DECL (c
)))
6966 TREE_VALUE (OMP_CLAUSE_DECL (c
)) = t
;
6968 OMP_CLAUSE_DECL (c
) = t
;
6973 case OMP_CLAUSE_MAP
:
6975 case OMP_CLAUSE_FROM
:
6976 case OMP_CLAUSE__CACHE_
:
6977 t
= OMP_CLAUSE_DECL (c
);
6978 if (TREE_CODE (t
) == TREE_LIST
)
6980 if (handle_omp_array_sections (c
, ort
))
6984 t
= OMP_CLAUSE_DECL (c
);
6985 if (TREE_CODE (t
) != TREE_LIST
6986 && !type_dependent_expression_p (t
)
6987 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6989 error_at (OMP_CLAUSE_LOCATION (c
),
6990 "array section does not have mappable type "
6992 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6995 while (TREE_CODE (t
) == ARRAY_REF
)
6996 t
= TREE_OPERAND (t
, 0);
6997 if (TREE_CODE (t
) == COMPONENT_REF
6998 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
7000 while (TREE_CODE (t
) == COMPONENT_REF
)
7001 t
= TREE_OPERAND (t
, 0);
7002 if (REFERENCE_REF_P (t
))
7003 t
= TREE_OPERAND (t
, 0);
7004 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
7006 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7008 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7009 error_at (OMP_CLAUSE_LOCATION (c
),
7010 "%qD appears more than once in motion"
7012 else if (ort
== C_ORT_ACC
)
7013 error_at (OMP_CLAUSE_LOCATION (c
),
7014 "%qD appears more than once in data"
7017 error_at (OMP_CLAUSE_LOCATION (c
),
7018 "%qD appears more than once in map"
7024 bitmap_set_bit (&map_head
, DECL_UID (t
));
7025 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
7031 if (t
== error_mark_node
)
7036 if (REFERENCE_REF_P (t
)
7037 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
7039 t
= TREE_OPERAND (t
, 0);
7040 OMP_CLAUSE_DECL (c
) = t
;
7042 if (TREE_CODE (t
) == COMPONENT_REF
7043 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
7044 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
7046 if (type_dependent_expression_p (t
))
7048 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
7049 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
7051 error_at (OMP_CLAUSE_LOCATION (c
),
7052 "bit-field %qE in %qs clause",
7053 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7056 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
7058 error_at (OMP_CLAUSE_LOCATION (c
),
7059 "%qE does not have a mappable type in %qs clause",
7060 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7063 while (TREE_CODE (t
) == COMPONENT_REF
)
7065 if (TREE_TYPE (TREE_OPERAND (t
, 0))
7066 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
7069 error_at (OMP_CLAUSE_LOCATION (c
),
7070 "%qE is a member of a union", t
);
7074 t
= TREE_OPERAND (t
, 0);
7078 if (REFERENCE_REF_P (t
))
7079 t
= TREE_OPERAND (t
, 0);
7080 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
7082 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
7083 goto handle_map_references
;
7086 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7088 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
7090 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7091 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
7092 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
7095 error_at (OMP_CLAUSE_LOCATION (c
),
7096 "%qD is not a variable in %qs clause", t
,
7097 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7099 error_at (OMP_CLAUSE_LOCATION (c
),
7100 "%qE is not a variable in %qs clause", t
,
7101 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7104 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7106 error_at (OMP_CLAUSE_LOCATION (c
),
7107 "%qD is threadprivate variable in %qs clause", t
,
7108 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7111 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
7113 error_at (OMP_CLAUSE_LOCATION (c
),
7114 "%<this%> allowed in OpenMP only in %<declare simd%>"
7119 else if (!processing_template_decl
7120 && !TYPE_REF_P (TREE_TYPE (t
))
7121 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
7122 || (OMP_CLAUSE_MAP_KIND (c
)
7123 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
7124 && !cxx_mark_addressable (t
))
7126 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7127 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
7128 || (OMP_CLAUSE_MAP_KIND (c
)
7129 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
7130 && t
== OMP_CLAUSE_DECL (c
)
7131 && !type_dependent_expression_p (t
)
7132 && !cp_omp_mappable_type (TYPE_REF_P (TREE_TYPE (t
))
7133 ? TREE_TYPE (TREE_TYPE (t
))
7136 error_at (OMP_CLAUSE_LOCATION (c
),
7137 "%qD does not have a mappable type in %qs clause", t
,
7138 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7141 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7142 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
7143 && !type_dependent_expression_p (t
)
7144 && !INDIRECT_TYPE_P (TREE_TYPE (t
)))
7146 error_at (OMP_CLAUSE_LOCATION (c
),
7147 "%qD is not a pointer variable", t
);
7150 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
7151 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
7153 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
7154 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7156 error_at (OMP_CLAUSE_LOCATION (c
),
7157 "%qD appears more than once in data clauses", t
);
7160 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7162 if (ort
== C_ORT_ACC
)
7163 error_at (OMP_CLAUSE_LOCATION (c
),
7164 "%qD appears more than once in data clauses", t
);
7166 error_at (OMP_CLAUSE_LOCATION (c
),
7167 "%qD appears both in data and map clauses", t
);
7171 bitmap_set_bit (&generic_head
, DECL_UID (t
));
7173 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
7175 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7176 error_at (OMP_CLAUSE_LOCATION (c
),
7177 "%qD appears more than once in motion clauses", t
);
7178 if (ort
== C_ORT_ACC
)
7179 error_at (OMP_CLAUSE_LOCATION (c
),
7180 "%qD appears more than once in data clauses", t
);
7182 error_at (OMP_CLAUSE_LOCATION (c
),
7183 "%qD appears more than once in map clauses", t
);
7186 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
7187 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7189 if (ort
== C_ORT_ACC
)
7190 error_at (OMP_CLAUSE_LOCATION (c
),
7191 "%qD appears more than once in data clauses", t
);
7193 error_at (OMP_CLAUSE_LOCATION (c
),
7194 "%qD appears both in data and map clauses", t
);
7199 bitmap_set_bit (&map_head
, DECL_UID (t
));
7200 if (t
!= OMP_CLAUSE_DECL (c
)
7201 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
7202 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
7204 handle_map_references
:
7206 && !processing_template_decl
7207 && ort
!= C_ORT_DECLARE_SIMD
7208 && TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
))))
7210 t
= OMP_CLAUSE_DECL (c
);
7211 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
7213 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
7214 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
7216 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
7218 else if (OMP_CLAUSE_MAP_KIND (c
)
7219 != GOMP_MAP_FIRSTPRIVATE_POINTER
7220 && (OMP_CLAUSE_MAP_KIND (c
)
7221 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
7222 && (OMP_CLAUSE_MAP_KIND (c
)
7223 != GOMP_MAP_ALWAYS_POINTER
))
7225 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
7227 if (TREE_CODE (t
) == COMPONENT_REF
)
7228 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
7230 OMP_CLAUSE_SET_MAP_KIND (c2
,
7231 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
7232 OMP_CLAUSE_DECL (c2
) = t
;
7233 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
7234 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
7235 OMP_CLAUSE_CHAIN (c
) = c2
;
7236 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
7237 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
7239 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
7245 case OMP_CLAUSE_TO_DECLARE
:
7246 case OMP_CLAUSE_LINK
:
7247 t
= OMP_CLAUSE_DECL (c
);
7248 if (TREE_CODE (t
) == FUNCTION_DECL
7249 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
7251 else if (!VAR_P (t
))
7253 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
7255 if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
7256 error_at (OMP_CLAUSE_LOCATION (c
),
7257 "template %qE in clause %qs", t
,
7258 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7259 else if (really_overloaded_fn (t
))
7260 error_at (OMP_CLAUSE_LOCATION (c
),
7261 "overloaded function name %qE in clause %qs", t
,
7262 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7264 error_at (OMP_CLAUSE_LOCATION (c
),
7265 "%qE is neither a variable nor a function name "
7267 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7270 error_at (OMP_CLAUSE_LOCATION (c
),
7271 "%qE is not a variable in clause %qs", t
,
7272 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7275 else if (DECL_THREAD_LOCAL_P (t
))
7277 error_at (OMP_CLAUSE_LOCATION (c
),
7278 "%qD is threadprivate variable in %qs clause", t
,
7279 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7282 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
7284 error_at (OMP_CLAUSE_LOCATION (c
),
7285 "%qD does not have a mappable type in %qs clause", t
,
7286 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7291 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
7293 error_at (OMP_CLAUSE_LOCATION (c
),
7294 "%qE appears more than once on the same "
7295 "%<declare target%> directive", t
);
7299 bitmap_set_bit (&generic_head
, DECL_UID (t
));
7302 case OMP_CLAUSE_UNIFORM
:
7303 t
= OMP_CLAUSE_DECL (c
);
7304 if (TREE_CODE (t
) != PARM_DECL
)
7306 if (processing_template_decl
)
7309 error_at (OMP_CLAUSE_LOCATION (c
),
7310 "%qD is not an argument in %<uniform%> clause", t
);
7312 error_at (OMP_CLAUSE_LOCATION (c
),
7313 "%qE is not an argument in %<uniform%> clause", t
);
7317 /* map_head bitmap is used as uniform_head if declare_simd. */
7318 bitmap_set_bit (&map_head
, DECL_UID (t
));
7319 goto check_dup_generic
;
7321 case OMP_CLAUSE_GRAINSIZE
:
7322 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
7323 if (t
== error_mark_node
)
7325 else if (!type_dependent_expression_p (t
)
7326 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7328 error_at (OMP_CLAUSE_LOCATION (c
),
7329 "%<grainsize%> expression must be integral");
7334 t
= mark_rvalue_use (t
);
7335 if (!processing_template_decl
)
7337 t
= maybe_constant_value (t
);
7338 if (TREE_CODE (t
) == INTEGER_CST
7339 && tree_int_cst_sgn (t
) != 1)
7341 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7342 "%<grainsize%> value must be positive");
7343 t
= integer_one_node
;
7345 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7347 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
7351 case OMP_CLAUSE_PRIORITY
:
7352 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
7353 if (t
== error_mark_node
)
7355 else if (!type_dependent_expression_p (t
)
7356 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7358 error_at (OMP_CLAUSE_LOCATION (c
),
7359 "%<priority%> expression must be integral");
7364 t
= mark_rvalue_use (t
);
7365 if (!processing_template_decl
)
7367 t
= maybe_constant_value (t
);
7368 if (TREE_CODE (t
) == INTEGER_CST
7369 && tree_int_cst_sgn (t
) == -1)
7371 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7372 "%<priority%> value must be non-negative");
7373 t
= integer_one_node
;
7375 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7377 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7381 case OMP_CLAUSE_HINT
:
7382 t
= OMP_CLAUSE_HINT_EXPR (c
);
7383 if (t
== error_mark_node
)
7385 else if (!type_dependent_expression_p (t
)
7386 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7388 error_at (OMP_CLAUSE_LOCATION (c
),
7389 "%<hint%> expression must be integral");
7394 t
= mark_rvalue_use (t
);
7395 if (!processing_template_decl
)
7397 t
= maybe_constant_value (t
);
7398 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7399 if (TREE_CODE (t
) != INTEGER_CST
)
7401 error_at (OMP_CLAUSE_LOCATION (c
),
7402 "%<hint%> expression must be constant integer "
7407 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7411 case OMP_CLAUSE_IS_DEVICE_PTR
:
7412 case OMP_CLAUSE_USE_DEVICE_PTR
:
7413 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7414 t
= OMP_CLAUSE_DECL (c
);
7415 if (!type_dependent_expression_p (t
))
7417 tree type
= TREE_TYPE (t
);
7418 if (!TYPE_PTR_P (type
)
7419 && TREE_CODE (type
) != ARRAY_TYPE
7420 && (!TYPE_REF_P (type
)
7421 || (!TYPE_PTR_P (TREE_TYPE (type
))
7422 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
7424 error_at (OMP_CLAUSE_LOCATION (c
),
7425 "%qs variable is neither a pointer, nor an array "
7426 "nor reference to pointer or array",
7427 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7431 goto check_dup_generic
;
7433 case OMP_CLAUSE_NOWAIT
:
7434 case OMP_CLAUSE_DEFAULT
:
7435 case OMP_CLAUSE_UNTIED
:
7436 case OMP_CLAUSE_COLLAPSE
:
7437 case OMP_CLAUSE_MERGEABLE
:
7438 case OMP_CLAUSE_PARALLEL
:
7439 case OMP_CLAUSE_FOR
:
7440 case OMP_CLAUSE_SECTIONS
:
7441 case OMP_CLAUSE_TASKGROUP
:
7442 case OMP_CLAUSE_PROC_BIND
:
7443 case OMP_CLAUSE_NOGROUP
:
7444 case OMP_CLAUSE_THREADS
:
7445 case OMP_CLAUSE_SIMD
:
7446 case OMP_CLAUSE_DEFAULTMAP
:
7447 case OMP_CLAUSE_AUTO
:
7448 case OMP_CLAUSE_INDEPENDENT
:
7449 case OMP_CLAUSE_SEQ
:
7450 case OMP_CLAUSE_IF_PRESENT
:
7451 case OMP_CLAUSE_FINALIZE
:
7454 case OMP_CLAUSE_TILE
:
7455 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7456 list
= TREE_CHAIN (list
))
7458 t
= TREE_VALUE (list
);
7460 if (t
== error_mark_node
)
7462 else if (!type_dependent_expression_p (t
)
7463 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7465 error_at (OMP_CLAUSE_LOCATION (c
),
7466 "%<tile%> argument needs integral type");
7471 t
= mark_rvalue_use (t
);
7472 if (!processing_template_decl
)
7474 /* Zero is used to indicate '*', we permit you
7475 to get there via an ICE of value zero. */
7476 t
= maybe_constant_value (t
);
7477 if (!tree_fits_shwi_p (t
)
7478 || tree_to_shwi (t
) < 0)
7480 error_at (OMP_CLAUSE_LOCATION (c
),
7481 "%<tile%> argument needs positive "
7482 "integral constant");
7485 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7489 /* Update list item. */
7490 TREE_VALUE (list
) = t
;
7494 case OMP_CLAUSE_ORDERED
:
7495 ordered_seen
= true;
7498 case OMP_CLAUSE_INBRANCH
:
7499 case OMP_CLAUSE_NOTINBRANCH
:
7502 error_at (OMP_CLAUSE_LOCATION (c
),
7503 "%<inbranch%> clause is incompatible with "
7515 *pc
= OMP_CLAUSE_CHAIN (c
);
7517 pc
= &OMP_CLAUSE_CHAIN (c
);
7520 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7522 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7523 bool remove
= false;
7524 bool need_complete_type
= false;
7525 bool need_default_ctor
= false;
7526 bool need_copy_ctor
= false;
7527 bool need_copy_assignment
= false;
7528 bool need_implicitly_determined
= false;
7529 bool need_dtor
= false;
7530 tree type
, inner_type
;
7534 case OMP_CLAUSE_SHARED
:
7535 need_implicitly_determined
= true;
7537 case OMP_CLAUSE_PRIVATE
:
7538 need_complete_type
= true;
7539 need_default_ctor
= true;
7541 need_implicitly_determined
= true;
7543 case OMP_CLAUSE_FIRSTPRIVATE
:
7544 need_complete_type
= true;
7545 need_copy_ctor
= true;
7547 need_implicitly_determined
= true;
7549 case OMP_CLAUSE_LASTPRIVATE
:
7550 need_complete_type
= true;
7551 need_copy_assignment
= true;
7552 need_implicitly_determined
= true;
7554 case OMP_CLAUSE_REDUCTION
:
7555 case OMP_CLAUSE_IN_REDUCTION
:
7556 case OMP_CLAUSE_TASK_REDUCTION
:
7557 need_implicitly_determined
= true;
7559 case OMP_CLAUSE_LINEAR
:
7560 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7561 need_implicitly_determined
= true;
7562 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7563 && !bitmap_bit_p (&map_head
,
7564 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7566 error_at (OMP_CLAUSE_LOCATION (c
),
7567 "%<linear%> clause step is a parameter %qD not "
7568 "specified in %<uniform%> clause",
7569 OMP_CLAUSE_LINEAR_STEP (c
));
7570 *pc
= OMP_CLAUSE_CHAIN (c
);
7574 case OMP_CLAUSE_COPYPRIVATE
:
7575 need_copy_assignment
= true;
7577 case OMP_CLAUSE_COPYIN
:
7578 need_copy_assignment
= true;
7580 case OMP_CLAUSE_SIMDLEN
:
7582 && !processing_template_decl
7583 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7584 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7586 error_at (OMP_CLAUSE_LOCATION (c
),
7587 "%<simdlen%> clause value is bigger than "
7588 "%<safelen%> clause value");
7589 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7590 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7592 pc
= &OMP_CLAUSE_CHAIN (c
);
7594 case OMP_CLAUSE_SCHEDULE
:
7596 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7597 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7599 error_at (OMP_CLAUSE_LOCATION (c
),
7600 "%<nonmonotonic%> schedule modifier specified "
7601 "together with %<ordered%> clause");
7602 OMP_CLAUSE_SCHEDULE_KIND (c
)
7603 = (enum omp_clause_schedule_kind
)
7604 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7605 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7607 pc
= &OMP_CLAUSE_CHAIN (c
);
7609 case OMP_CLAUSE_NOGROUP
:
7612 error_at (OMP_CLAUSE_LOCATION (c
),
7613 "%<nogroup%> clause must not be used together with "
7614 "%<reduction%> clause");
7615 *pc
= OMP_CLAUSE_CHAIN (c
);
7618 pc
= &OMP_CLAUSE_CHAIN (c
);
7620 case OMP_CLAUSE_NOWAIT
:
7621 if (copyprivate_seen
)
7623 error_at (OMP_CLAUSE_LOCATION (c
),
7624 "%<nowait%> clause must not be used together "
7625 "with %<copyprivate%>");
7626 *pc
= OMP_CLAUSE_CHAIN (c
);
7631 pc
= &OMP_CLAUSE_CHAIN (c
);
7635 t
= OMP_CLAUSE_DECL (c
);
7636 if (processing_template_decl
7637 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7639 pc
= &OMP_CLAUSE_CHAIN (c
);
7645 case OMP_CLAUSE_LASTPRIVATE
:
7646 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7648 need_default_ctor
= true;
7653 case OMP_CLAUSE_REDUCTION
:
7654 case OMP_CLAUSE_IN_REDUCTION
:
7655 case OMP_CLAUSE_TASK_REDUCTION
:
7656 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7660 t
= OMP_CLAUSE_DECL (c
);
7663 case OMP_CLAUSE_COPYIN
:
7664 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7666 error_at (OMP_CLAUSE_LOCATION (c
),
7667 "%qE must be %<threadprivate%> for %<copyin%>", t
);
7676 if (need_complete_type
|| need_copy_assignment
)
7678 t
= require_complete_type (t
);
7679 if (t
== error_mark_node
)
7681 else if (TYPE_REF_P (TREE_TYPE (t
))
7682 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7685 if (need_implicitly_determined
)
7687 const char *share_name
= NULL
;
7689 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7690 share_name
= "threadprivate";
7691 else switch (cxx_omp_predetermined_sharing_1 (t
))
7693 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7695 case OMP_CLAUSE_DEFAULT_SHARED
:
7697 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7699 && cxx_omp_const_qual_no_mutable (t
))
7701 tree ctx
= CP_DECL_CONTEXT (t
);
7702 /* const qualified static data members without mutable
7703 member may be specified in firstprivate clause. */
7704 if (TYPE_P (ctx
) && MAYBE_CLASS_TYPE_P (ctx
))
7707 share_name
= "shared";
7709 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7710 share_name
= "private";
7717 error_at (OMP_CLAUSE_LOCATION (c
),
7718 "%qE is predetermined %qs for %qs",
7719 omp_clause_printable_decl (t
), share_name
,
7720 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7723 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
7724 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_FIRSTPRIVATE
7725 && cxx_omp_const_qual_no_mutable (t
))
7727 error_at (OMP_CLAUSE_LOCATION (c
),
7728 "%<const%> qualified %qE without %<mutable%> member "
7729 "may appear only in %<shared%> or %<firstprivate%> "
7730 "clauses", omp_clause_printable_decl (t
));
7735 /* We're interested in the base element, not arrays. */
7736 inner_type
= type
= TREE_TYPE (t
);
7737 if ((need_complete_type
7738 || need_copy_assignment
7739 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
7740 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_IN_REDUCTION
7741 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TASK_REDUCTION
)
7742 && TYPE_REF_P (inner_type
))
7743 inner_type
= TREE_TYPE (inner_type
);
7744 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7745 inner_type
= TREE_TYPE (inner_type
);
7747 /* Check for special function availability by building a call to one.
7748 Save the results, because later we won't be in the right context
7749 for making these queries. */
7750 if (CLASS_TYPE_P (inner_type
)
7751 && COMPLETE_TYPE_P (inner_type
)
7752 && (need_default_ctor
|| need_copy_ctor
7753 || need_copy_assignment
|| need_dtor
)
7754 && !type_dependent_expression_p (t
)
7755 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7756 need_copy_ctor
, need_copy_assignment
,
7761 && c_kind
== OMP_CLAUSE_SHARED
7762 && processing_template_decl
)
7764 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7766 OMP_CLAUSE_DECL (c
) = t
;
7770 *pc
= OMP_CLAUSE_CHAIN (c
);
7772 pc
= &OMP_CLAUSE_CHAIN (c
);
7775 bitmap_obstack_release (NULL
);
7779 /* Start processing OpenMP clauses that can include any
7780 privatization clauses for non-static data members. */
7783 push_omp_privatization_clauses (bool ignore_next
)
7785 if (omp_private_member_ignore_next
)
7787 omp_private_member_ignore_next
= ignore_next
;
7790 omp_private_member_ignore_next
= ignore_next
;
7791 if (omp_private_member_map
)
7792 omp_private_member_vec
.safe_push (error_mark_node
);
7793 return push_stmt_list ();
7796 /* Revert remapping of any non-static data members since
7797 the last push_omp_privatization_clauses () call. */
7800 pop_omp_privatization_clauses (tree stmt
)
7802 if (stmt
== NULL_TREE
)
7804 stmt
= pop_stmt_list (stmt
);
7805 if (omp_private_member_map
)
7807 while (!omp_private_member_vec
.is_empty ())
7809 tree t
= omp_private_member_vec
.pop ();
7810 if (t
== error_mark_node
)
7815 bool no_decl_expr
= t
== integer_zero_node
;
7817 t
= omp_private_member_vec
.pop ();
7818 tree
*v
= omp_private_member_map
->get (t
);
7822 omp_private_member_map
->remove (t
);
7824 delete omp_private_member_map
;
7825 omp_private_member_map
= NULL
;
7830 /* Remember OpenMP privatization clauses mapping and clear it.
7831 Used for lambdas. */
7834 save_omp_privatization_clauses (vec
<tree
> &save
)
7837 if (omp_private_member_ignore_next
)
7838 save
.safe_push (integer_one_node
);
7839 omp_private_member_ignore_next
= false;
7840 if (!omp_private_member_map
)
7843 while (!omp_private_member_vec
.is_empty ())
7845 tree t
= omp_private_member_vec
.pop ();
7846 if (t
== error_mark_node
)
7852 if (t
== integer_zero_node
)
7853 t
= omp_private_member_vec
.pop ();
7854 tree
*v
= omp_private_member_map
->get (t
);
7856 save
.safe_push (*v
);
7861 delete omp_private_member_map
;
7862 omp_private_member_map
= NULL
;
7865 /* Restore OpenMP privatization clauses mapping saved by the
7869 restore_omp_privatization_clauses (vec
<tree
> &save
)
7871 gcc_assert (omp_private_member_vec
.is_empty ());
7872 omp_private_member_ignore_next
= false;
7873 if (save
.is_empty ())
7875 if (save
.length () == 1 && save
[0] == integer_one_node
)
7877 omp_private_member_ignore_next
= true;
7882 omp_private_member_map
= new hash_map
<tree
, tree
>;
7883 while (!save
.is_empty ())
7885 tree t
= save
.pop ();
7887 if (t
!= error_mark_node
)
7889 if (t
== integer_one_node
)
7891 omp_private_member_ignore_next
= true;
7892 gcc_assert (save
.is_empty ());
7895 if (t
== integer_zero_node
)
7897 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7900 omp_private_member_vec
.safe_push (t
);
7902 omp_private_member_vec
.safe_push (n
);
7907 /* For all variables in the tree_list VARS, mark them as thread local. */
7910 finish_omp_threadprivate (tree vars
)
7914 /* Mark every variable in VARS to be assigned thread local storage. */
7915 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7917 tree v
= TREE_PURPOSE (t
);
7919 if (error_operand_p (v
))
7921 else if (!VAR_P (v
))
7922 error ("%<threadprivate%> %qD is not file, namespace "
7923 "or block scope variable", v
);
7924 /* If V had already been marked threadprivate, it doesn't matter
7925 whether it had been used prior to this point. */
7926 else if (TREE_USED (v
)
7927 && (DECL_LANG_SPECIFIC (v
) == NULL
7928 || !CP_DECL_THREADPRIVATE_P (v
)))
7929 error ("%qE declared %<threadprivate%> after first use", v
);
7930 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7931 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7932 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7933 error ("%<threadprivate%> %qE has incomplete type", v
);
7934 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7935 && CP_DECL_CONTEXT (v
) != current_class_type
)
7936 error ("%<threadprivate%> %qE directive not "
7937 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7940 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7941 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7942 retrofit_lang_decl (v
);
7944 if (! CP_DECL_THREAD_LOCAL_P (v
))
7946 CP_DECL_THREAD_LOCAL_P (v
) = true;
7947 set_decl_tls_model (v
, decl_default_tls_model (v
));
7948 /* If rtl has been already set for this var, call
7949 make_decl_rtl once again, so that encode_section_info
7950 has a chance to look at the new decl flags. */
7951 if (DECL_RTL_SET_P (v
))
7954 CP_DECL_THREADPRIVATE_P (v
) = 1;
7959 /* Build an OpenMP structured block. */
7962 begin_omp_structured_block (void)
7964 return do_pushlevel (sk_omp
);
7968 finish_omp_structured_block (tree block
)
7970 return do_poplevel (block
);
7973 /* Similarly, except force the retention of the BLOCK. */
7976 begin_omp_parallel (void)
7978 keep_next_level (true);
7979 return begin_omp_structured_block ();
7982 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7986 finish_oacc_data (tree clauses
, tree block
)
7990 block
= finish_omp_structured_block (block
);
7992 stmt
= make_node (OACC_DATA
);
7993 TREE_TYPE (stmt
) = void_type_node
;
7994 OACC_DATA_CLAUSES (stmt
) = clauses
;
7995 OACC_DATA_BODY (stmt
) = block
;
7997 return add_stmt (stmt
);
8000 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
8004 finish_oacc_host_data (tree clauses
, tree block
)
8008 block
= finish_omp_structured_block (block
);
8010 stmt
= make_node (OACC_HOST_DATA
);
8011 TREE_TYPE (stmt
) = void_type_node
;
8012 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
8013 OACC_HOST_DATA_BODY (stmt
) = block
;
8015 return add_stmt (stmt
);
8018 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
8022 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
8024 body
= finish_omp_structured_block (body
);
8026 tree stmt
= make_node (code
);
8027 TREE_TYPE (stmt
) = void_type_node
;
8028 OMP_BODY (stmt
) = body
;
8029 OMP_CLAUSES (stmt
) = clauses
;
8031 return add_stmt (stmt
);
8035 finish_omp_parallel (tree clauses
, tree body
)
8039 body
= finish_omp_structured_block (body
);
8041 stmt
= make_node (OMP_PARALLEL
);
8042 TREE_TYPE (stmt
) = void_type_node
;
8043 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
8044 OMP_PARALLEL_BODY (stmt
) = body
;
8046 return add_stmt (stmt
);
8050 begin_omp_task (void)
8052 keep_next_level (true);
8053 return begin_omp_structured_block ();
8057 finish_omp_task (tree clauses
, tree body
)
8061 body
= finish_omp_structured_block (body
);
8063 stmt
= make_node (OMP_TASK
);
8064 TREE_TYPE (stmt
) = void_type_node
;
8065 OMP_TASK_CLAUSES (stmt
) = clauses
;
8066 OMP_TASK_BODY (stmt
) = body
;
8068 return add_stmt (stmt
);
8071 /* Helper function for finish_omp_for. Convert Ith random access iterator
8072 into integral iterator. Return FALSE if successful. */
8075 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
8076 tree declv
, tree orig_declv
, tree initv
,
8077 tree condv
, tree incrv
, tree
*body
,
8078 tree
*pre_body
, tree
&clauses
,
8079 int collapse
, int ordered
)
8081 tree diff
, iter_init
, iter_incr
= NULL
, last
;
8082 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
8083 tree decl
= TREE_VEC_ELT (declv
, i
);
8084 tree init
= TREE_VEC_ELT (initv
, i
);
8085 tree cond
= TREE_VEC_ELT (condv
, i
);
8086 tree incr
= TREE_VEC_ELT (incrv
, i
);
8088 location_t elocus
= locus
;
8090 if (init
&& EXPR_HAS_LOCATION (init
))
8091 elocus
= EXPR_LOCATION (init
);
8093 cond
= cp_fully_fold (cond
);
8094 switch (TREE_CODE (cond
))
8101 if (TREE_OPERAND (cond
, 1) == iter
)
8102 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
8103 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
8104 if (TREE_OPERAND (cond
, 0) != iter
)
8105 cond
= error_mark_node
;
8108 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
8111 TREE_OPERAND (cond
, 1), ERROR_MARK
,
8112 NULL
, tf_warning_or_error
);
8113 if (error_operand_p (tem
))
8118 cond
= error_mark_node
;
8121 if (cond
== error_mark_node
)
8123 error_at (elocus
, "invalid controlling predicate");
8126 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
8127 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
8128 tf_warning_or_error
);
8129 diff
= cp_fully_fold (diff
);
8130 if (error_operand_p (diff
))
8132 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
8134 error_at (elocus
, "difference between %qE and %qD does not have integer type",
8135 TREE_OPERAND (cond
, 1), iter
);
8138 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
8139 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
8140 cond
, cp_walk_subtrees
))
8143 switch (TREE_CODE (incr
))
8145 case PREINCREMENT_EXPR
:
8146 case PREDECREMENT_EXPR
:
8147 case POSTINCREMENT_EXPR
:
8148 case POSTDECREMENT_EXPR
:
8149 if (TREE_OPERAND (incr
, 0) != iter
)
8151 incr
= error_mark_node
;
8154 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
8155 TREE_CODE (incr
), iter
,
8156 tf_warning_or_error
);
8157 if (error_operand_p (iter_incr
))
8159 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
8160 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
8161 incr
= integer_one_node
;
8163 incr
= integer_minus_one_node
;
8166 if (TREE_OPERAND (incr
, 0) != iter
)
8167 incr
= error_mark_node
;
8168 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
8169 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
8171 tree rhs
= TREE_OPERAND (incr
, 1);
8172 if (TREE_OPERAND (rhs
, 0) == iter
)
8174 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
8176 incr
= error_mark_node
;
8179 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
8180 iter
, TREE_CODE (rhs
),
8181 TREE_OPERAND (rhs
, 1),
8182 tf_warning_or_error
);
8183 if (error_operand_p (iter_incr
))
8185 incr
= TREE_OPERAND (rhs
, 1);
8186 incr
= cp_convert (TREE_TYPE (diff
), incr
,
8187 tf_warning_or_error
);
8188 if (TREE_CODE (rhs
) == MINUS_EXPR
)
8190 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
8191 incr
= fold_simple (incr
);
8193 if (TREE_CODE (incr
) != INTEGER_CST
8194 && (TREE_CODE (incr
) != NOP_EXPR
8195 || (TREE_CODE (TREE_OPERAND (incr
, 0))
8200 else if (TREE_OPERAND (rhs
, 1) == iter
)
8202 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
8203 || TREE_CODE (rhs
) != PLUS_EXPR
)
8204 incr
= error_mark_node
;
8207 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
8209 TREE_OPERAND (rhs
, 0),
8212 tf_warning_or_error
);
8213 if (error_operand_p (iter_incr
))
8215 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
8218 tf_warning_or_error
);
8219 if (error_operand_p (iter_incr
))
8221 incr
= TREE_OPERAND (rhs
, 0);
8226 incr
= error_mark_node
;
8229 incr
= error_mark_node
;
8232 incr
= error_mark_node
;
8236 if (incr
== error_mark_node
)
8238 error_at (elocus
, "invalid increment expression");
8242 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
8243 incr
= cp_fully_fold (incr
);
8244 bool taskloop_iv_seen
= false;
8245 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
8246 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
8247 && OMP_CLAUSE_DECL (c
) == iter
)
8249 if (code
== OMP_TASKLOOP
)
8251 taskloop_iv_seen
= true;
8252 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
8256 else if (code
== OMP_TASKLOOP
8257 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
8258 && OMP_CLAUSE_DECL (c
) == iter
)
8260 taskloop_iv_seen
= true;
8261 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
8264 decl
= create_temporary_var (TREE_TYPE (diff
));
8266 add_decl_expr (decl
);
8267 last
= create_temporary_var (TREE_TYPE (diff
));
8269 add_decl_expr (last
);
8270 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
8271 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
8273 incr_var
= create_temporary_var (TREE_TYPE (diff
));
8274 pushdecl (incr_var
);
8275 add_decl_expr (incr_var
);
8277 gcc_assert (stmts_are_full_exprs_p ());
8278 tree diffvar
= NULL_TREE
;
8279 if (code
== OMP_TASKLOOP
)
8281 if (!taskloop_iv_seen
)
8283 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8284 OMP_CLAUSE_DECL (ivc
) = iter
;
8285 cxx_omp_finish_clause (ivc
, NULL
);
8286 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
8289 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
8290 OMP_CLAUSE_DECL (lvc
) = last
;
8291 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
8293 diffvar
= create_temporary_var (TREE_TYPE (diff
));
8295 add_decl_expr (diffvar
);
8298 orig_pre_body
= *pre_body
;
8299 *pre_body
= push_stmt_list ();
8301 add_stmt (orig_pre_body
);
8303 finish_expr_stmt (build_x_modify_expr (elocus
,
8304 iter
, NOP_EXPR
, init
,
8305 tf_warning_or_error
));
8306 init
= build_int_cst (TREE_TYPE (diff
), 0);
8307 if (c
&& iter_incr
== NULL
8308 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
8312 finish_expr_stmt (build_x_modify_expr (elocus
,
8314 incr
, tf_warning_or_error
));
8317 iter_incr
= build_x_modify_expr (elocus
,
8318 iter
, PLUS_EXPR
, incr
,
8319 tf_warning_or_error
);
8321 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
8323 finish_expr_stmt (build_x_modify_expr (elocus
,
8324 last
, NOP_EXPR
, init
,
8325 tf_warning_or_error
));
8328 finish_expr_stmt (build_x_modify_expr (elocus
,
8330 diff
, tf_warning_or_error
));
8333 *pre_body
= pop_stmt_list (*pre_body
);
8335 cond
= cp_build_binary_op (elocus
,
8336 TREE_CODE (cond
), decl
, diff
,
8337 tf_warning_or_error
);
8338 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
8339 elocus
, incr
, NULL_TREE
);
8342 *body
= push_stmt_list ();
8343 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
8344 iter_init
= build_x_modify_expr (elocus
,
8345 iter
, PLUS_EXPR
, iter_init
,
8346 tf_warning_or_error
);
8347 if (iter_init
!= error_mark_node
)
8348 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
8349 finish_expr_stmt (iter_init
);
8350 finish_expr_stmt (build_x_modify_expr (elocus
,
8351 last
, NOP_EXPR
, decl
,
8352 tf_warning_or_error
));
8353 add_stmt (orig_body
);
8354 *body
= pop_stmt_list (*body
);
8358 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
8360 finish_expr_stmt (iter_incr
);
8364 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
8365 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
8366 iter_init
, iter_incr
);
8367 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
8368 iter_init
= build_x_modify_expr (elocus
,
8369 iter
, PLUS_EXPR
, iter_init
,
8370 tf_warning_or_error
);
8371 if (iter_init
!= error_mark_node
)
8372 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
8373 finish_expr_stmt (iter_init
);
8375 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
8376 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
8379 if (TREE_CODE (TREE_VEC_ELT (orig_declv
, i
)) == TREE_LIST
)
8381 tree t
= TREE_VEC_ELT (orig_declv
, i
);
8382 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8383 && TREE_VALUE (t
) == NULL_TREE
8384 && TREE_CODE (TREE_CHAIN (t
)) == TREE_VEC
);
8385 TREE_PURPOSE (t
) = TREE_VEC_ELT (declv
, i
);
8386 TREE_VALUE (t
) = last
;
8389 TREE_VEC_ELT (orig_declv
, i
)
8390 = tree_cons (TREE_VEC_ELT (declv
, i
), last
, NULL_TREE
);
8391 TREE_VEC_ELT (declv
, i
) = decl
;
8392 TREE_VEC_ELT (initv
, i
) = init
;
8393 TREE_VEC_ELT (condv
, i
) = cond
;
8394 TREE_VEC_ELT (incrv
, i
) = incr
;
8399 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
8400 are directly for their associated operands in the statement. DECL
8401 and INIT are a combo; if DECL is NULL then INIT ought to be a
8402 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
8403 optional statements that need to go before the loop into its
8407 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
8408 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
8409 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
8411 tree omp_for
= NULL
, orig_incr
= NULL
;
8412 tree decl
= NULL
, init
, cond
, incr
;
8418 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8419 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8420 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8421 if (TREE_VEC_LENGTH (declv
) > 1)
8425 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8427 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8430 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8432 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8433 if (collapse
!= TREE_VEC_LENGTH (declv
))
8434 ordered
= TREE_VEC_LENGTH (declv
);
8437 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8439 decl
= TREE_VEC_ELT (declv
, i
);
8440 init
= TREE_VEC_ELT (initv
, i
);
8441 cond
= TREE_VEC_ELT (condv
, i
);
8442 incr
= TREE_VEC_ELT (incrv
, i
);
8448 switch (TREE_CODE (init
))
8451 decl
= TREE_OPERAND (init
, 0);
8452 init
= TREE_OPERAND (init
, 1);
8455 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8457 decl
= TREE_OPERAND (init
, 0);
8458 init
= TREE_OPERAND (init
, 2);
8468 "expected iteration declaration or initialization");
8473 if (init
&& EXPR_HAS_LOCATION (init
))
8474 elocus
= EXPR_LOCATION (init
);
8476 if (cond
== global_namespace
)
8481 error_at (elocus
, "missing controlling predicate");
8487 error_at (elocus
, "missing increment expression");
8491 TREE_VEC_ELT (declv
, i
) = decl
;
8492 TREE_VEC_ELT (initv
, i
) = init
;
8499 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8501 && !c_omp_check_loop_iv_exprs (locus
, orig_declv
8502 ? orig_declv
: declv
,
8503 TREE_VEC_ELT (declv
, i
), orig_init
,
8504 NULL_TREE
, cp_walk_subtrees
))
8510 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8514 stmt
= make_node (code
);
8516 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8518 /* This is really just a place-holder. We'll be decomposing this
8519 again and going through the cp_build_modify_expr path below when
8520 we instantiate the thing. */
8521 TREE_VEC_ELT (initv
, i
)
8522 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8523 TREE_VEC_ELT (initv
, i
));
8526 TREE_TYPE (stmt
) = void_type_node
;
8527 OMP_FOR_INIT (stmt
) = initv
;
8528 OMP_FOR_COND (stmt
) = condv
;
8529 OMP_FOR_INCR (stmt
) = incrv
;
8530 OMP_FOR_BODY (stmt
) = body
;
8531 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8532 OMP_FOR_CLAUSES (stmt
) = clauses
;
8534 SET_EXPR_LOCATION (stmt
, locus
);
8535 return add_stmt (stmt
);
8539 orig_declv
= copy_node (declv
);
8541 if (processing_template_decl
)
8542 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8544 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8546 decl
= TREE_VEC_ELT (declv
, i
);
8547 init
= TREE_VEC_ELT (initv
, i
);
8548 cond
= TREE_VEC_ELT (condv
, i
);
8549 incr
= TREE_VEC_ELT (incrv
, i
);
8551 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8554 if (init
&& EXPR_HAS_LOCATION (init
))
8555 elocus
= EXPR_LOCATION (init
);
8559 error_at (elocus
, "expected iteration declaration or initialization");
8563 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8566 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8567 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8568 TREE_CODE (TREE_OPERAND (incr
, 1)),
8569 TREE_OPERAND (incr
, 2),
8570 tf_warning_or_error
);
8573 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8575 if (code
== OMP_SIMD
)
8577 error_at (elocus
, "%<#pragma omp simd%> used with class "
8578 "iteration variable %qE", decl
);
8581 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8582 initv
, condv
, incrv
, &body
,
8589 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8590 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8592 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8596 if (!processing_template_decl
)
8598 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8599 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8600 tf_warning_or_error
);
8603 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8605 && TREE_SIDE_EFFECTS (cond
)
8606 && COMPARISON_CLASS_P (cond
)
8607 && !processing_template_decl
)
8609 tree t
= TREE_OPERAND (cond
, 0);
8610 if (TREE_SIDE_EFFECTS (t
)
8612 && (TREE_CODE (t
) != NOP_EXPR
8613 || TREE_OPERAND (t
, 0) != decl
))
8614 TREE_OPERAND (cond
, 0)
8615 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8617 t
= TREE_OPERAND (cond
, 1);
8618 if (TREE_SIDE_EFFECTS (t
)
8620 && (TREE_CODE (t
) != NOP_EXPR
8621 || TREE_OPERAND (t
, 0) != decl
))
8622 TREE_OPERAND (cond
, 1)
8623 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8625 if (decl
== error_mark_node
|| init
== error_mark_node
)
8628 TREE_VEC_ELT (declv
, i
) = decl
;
8629 TREE_VEC_ELT (initv
, i
) = init
;
8630 TREE_VEC_ELT (condv
, i
) = cond
;
8631 TREE_VEC_ELT (incrv
, i
) = incr
;
8635 if (pre_body
&& IS_EMPTY_STMT (pre_body
))
8638 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8639 incrv
, body
, pre_body
,
8640 !processing_template_decl
);
8642 /* Check for iterators appearing in lb, b or incr expressions. */
8643 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8644 omp_for
= NULL_TREE
;
8646 if (omp_for
== NULL
)
8653 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8655 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8656 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8658 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8661 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8662 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8663 && !processing_template_decl
)
8665 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8666 if (TREE_SIDE_EFFECTS (t
)
8668 && (TREE_CODE (t
) != NOP_EXPR
8669 || TREE_OPERAND (t
, 0) != decl
))
8670 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8671 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8673 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8674 if (TREE_SIDE_EFFECTS (t
)
8676 && (TREE_CODE (t
) != NOP_EXPR
8677 || TREE_OPERAND (t
, 0) != decl
))
8678 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8679 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8683 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8685 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8687 /* For simd loops with non-static data member iterators, we could have added
8688 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8689 step at this point, fill it in. */
8690 if (code
== OMP_SIMD
&& !processing_template_decl
8691 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8692 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8693 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8694 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8696 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8697 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8698 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8700 switch (TREE_CODE (incr
))
8702 case PREINCREMENT_EXPR
:
8703 case POSTINCREMENT_EXPR
:
8704 /* c_omp_for_incr_canonicalize_ptr() should have been
8705 called to massage things appropriately. */
8706 gcc_assert (!INDIRECT_TYPE_P (TREE_TYPE (decl
)));
8707 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8709 case PREDECREMENT_EXPR
:
8710 case POSTDECREMENT_EXPR
:
8711 /* c_omp_for_incr_canonicalize_ptr() should have been
8712 called to massage things appropriately. */
8713 gcc_assert (!INDIRECT_TYPE_P (TREE_TYPE (decl
)));
8714 OMP_CLAUSE_LINEAR_STEP (c
)
8715 = build_int_cst (TREE_TYPE (decl
), -1);
8718 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8719 incr
= TREE_OPERAND (incr
, 1);
8720 switch (TREE_CODE (incr
))
8723 if (TREE_OPERAND (incr
, 1) == decl
)
8724 step
= TREE_OPERAND (incr
, 0);
8726 step
= TREE_OPERAND (incr
, 1);
8729 case POINTER_PLUS_EXPR
:
8730 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8731 step
= TREE_OPERAND (incr
, 1);
8736 stept
= TREE_TYPE (decl
);
8737 if (INDIRECT_TYPE_P (stept
))
8739 step
= fold_convert (stept
, step
);
8740 if (TREE_CODE (incr
) == MINUS_EXPR
)
8741 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8742 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8752 /* Fix up range for decls. Those decls were pushed into BIND's BIND_EXPR_VARS
8753 and need to be moved into the BIND_EXPR inside of the OMP_FOR's body. */
8756 finish_omp_for_block (tree bind
, tree omp_for
)
8758 if (omp_for
== NULL_TREE
8759 || !OMP_FOR_ORIG_DECLS (omp_for
)
8760 || bind
== NULL_TREE
8761 || TREE_CODE (bind
) != BIND_EXPR
)
8764 for (int i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (omp_for
)); i
++)
8765 if (TREE_CODE (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
)) == TREE_LIST
8766 && TREE_CHAIN (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
)))
8768 tree v
= TREE_CHAIN (TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (omp_for
), i
));
8769 gcc_assert (BIND_EXPR_BLOCK (bind
)
8770 && (BIND_EXPR_VARS (bind
)
8771 == BLOCK_VARS (BIND_EXPR_BLOCK (bind
))));
8772 for (int j
= 2; j
< TREE_VEC_LENGTH (v
); j
++)
8773 for (tree
*p
= &BIND_EXPR_VARS (bind
); *p
; p
= &DECL_CHAIN (*p
))
8775 if (*p
== TREE_VEC_ELT (v
, j
))
8778 *p
= DECL_CHAIN (*p
);
8781 b
= make_node (BLOCK
);
8782 b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
8783 OMP_FOR_BODY (omp_for
), b
);
8784 TREE_SIDE_EFFECTS (b
) = 1;
8785 OMP_FOR_BODY (omp_for
) = b
;
8787 DECL_CHAIN (var
) = BIND_EXPR_VARS (b
);
8788 BIND_EXPR_VARS (b
) = var
;
8789 BLOCK_VARS (BIND_EXPR_BLOCK (b
)) = var
;
8792 BLOCK_VARS (BIND_EXPR_BLOCK (bind
)) = BIND_EXPR_VARS (bind
);
8798 finish_omp_atomic (location_t loc
, enum tree_code code
, enum tree_code opcode
,
8799 tree lhs
, tree rhs
, tree v
, tree lhs1
, tree rhs1
,
8800 tree clauses
, enum omp_memory_order mo
)
8815 dependent_p
= false;
8818 /* Even in a template, we can detect invalid uses of the atomic
8819 pragma if neither LHS nor RHS is type-dependent. */
8820 if (processing_template_decl
)
8822 dependent_p
= (type_dependent_expression_p (lhs
)
8823 || (rhs
&& type_dependent_expression_p (rhs
))
8824 || (v
&& type_dependent_expression_p (v
))
8825 || (lhs1
&& type_dependent_expression_p (lhs1
))
8826 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8829 gcc_assert (TREE_CODE (clauses
) == OMP_CLAUSE
8830 && OMP_CLAUSE_CODE (clauses
) == OMP_CLAUSE_HINT
8831 && OMP_CLAUSE_CHAIN (clauses
) == NULL_TREE
);
8832 if (type_dependent_expression_p (OMP_CLAUSE_HINT_EXPR (clauses
))
8833 || TREE_CODE (OMP_CLAUSE_HINT_EXPR (clauses
)) != INTEGER_CST
)
8838 lhs
= build_non_dependent_expr (lhs
);
8840 rhs
= build_non_dependent_expr (rhs
);
8842 v
= build_non_dependent_expr (v
);
8844 lhs1
= build_non_dependent_expr (lhs1
);
8846 rhs1
= build_non_dependent_expr (rhs1
);
8851 bool swapped
= false;
8852 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8854 std::swap (rhs
, rhs1
);
8855 swapped
= !commutative_tree_code (opcode
);
8857 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8859 if (code
== OMP_ATOMIC
)
8860 error ("%<#pragma omp atomic update%> uses two different "
8861 "expressions for memory");
8863 error ("%<#pragma omp atomic capture%> uses two different "
8864 "expressions for memory");
8867 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8869 if (code
== OMP_ATOMIC
)
8870 error ("%<#pragma omp atomic update%> uses two different "
8871 "expressions for memory");
8873 error ("%<#pragma omp atomic capture%> uses two different "
8874 "expressions for memory");
8877 stmt
= c_finish_omp_atomic (loc
, code
, opcode
, lhs
, rhs
,
8878 v
, lhs1
, rhs1
, swapped
, mo
,
8879 processing_template_decl
!= 0);
8880 if (stmt
== error_mark_node
)
8883 if (processing_template_decl
)
8885 if (code
== OMP_ATOMIC_READ
)
8887 stmt
= build_min_nt_loc (loc
, OMP_ATOMIC_READ
, orig_lhs
);
8888 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
8889 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8893 if (opcode
== NOP_EXPR
)
8894 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8896 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8898 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8899 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8900 if (code
!= OMP_ATOMIC
)
8902 stmt
= build_min_nt_loc (loc
, code
, orig_lhs1
, stmt
);
8903 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
8904 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8907 stmt
= build2 (OMP_ATOMIC
, void_type_node
,
8908 clauses
? clauses
: integer_zero_node
, stmt
);
8909 OMP_ATOMIC_MEMORY_ORDER (stmt
) = mo
;
8910 SET_EXPR_LOCATION (stmt
, loc
);
8912 finish_expr_stmt (stmt
);
8916 finish_omp_barrier (void)
8918 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
8919 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8920 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8921 release_tree_vector (vec
);
8922 finish_expr_stmt (stmt
);
8926 finish_omp_depobj (location_t loc
, tree depobj
,
8927 enum omp_clause_depend_kind kind
, tree clause
)
8929 if (!error_operand_p (depobj
) && !type_dependent_expression_p (depobj
))
8931 if (!lvalue_p (depobj
))
8933 error_at (EXPR_LOC_OR_LOC (depobj
, loc
),
8934 "%<depobj%> expression is not lvalue expression");
8935 depobj
= error_mark_node
;
8939 if (processing_template_decl
)
8941 if (clause
== NULL_TREE
)
8942 clause
= build_int_cst (integer_type_node
, kind
);
8943 add_stmt (build_min_nt_loc (loc
, OMP_DEPOBJ
, depobj
, clause
));
8947 if (!error_operand_p (depobj
))
8949 tree addr
= cp_build_addr_expr (depobj
, tf_warning_or_error
);
8950 if (addr
== error_mark_node
)
8951 depobj
= error_mark_node
;
8953 depobj
= cp_build_indirect_ref (addr
, RO_UNARY_STAR
,
8954 tf_warning_or_error
);
8957 c_finish_omp_depobj (loc
, depobj
, kind
, clause
);
8961 finish_omp_flush (int mo
)
8963 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8964 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8965 if (mo
!= MEMMODEL_LAST
)
8967 fn
= builtin_decl_explicit (BUILT_IN_ATOMIC_THREAD_FENCE
);
8968 vec
->quick_push (build_int_cst (integer_type_node
, mo
));
8970 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8971 release_tree_vector (vec
);
8972 finish_expr_stmt (stmt
);
8976 finish_omp_taskwait (void)
8978 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8979 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8980 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8981 release_tree_vector (vec
);
8982 finish_expr_stmt (stmt
);
8986 finish_omp_taskyield (void)
8988 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8989 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8990 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8991 release_tree_vector (vec
);
8992 finish_expr_stmt (stmt
);
8996 finish_omp_cancel (tree clauses
)
8998 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
9000 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
9002 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
9004 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
9006 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
9010 error ("%<#pragma omp cancel%> must specify one of "
9011 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
9014 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
9015 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
9016 if (ifc
!= NULL_TREE
)
9018 if (OMP_CLAUSE_IF_MODIFIER (ifc
) != ERROR_MARK
9019 && OMP_CLAUSE_IF_MODIFIER (ifc
) != VOID_CST
)
9020 error_at (OMP_CLAUSE_LOCATION (ifc
),
9021 "expected %<cancel%> %<if%> clause modifier");
9023 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
9024 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
9025 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
9026 build_zero_cst (type
));
9029 ifc
= boolean_true_node
;
9030 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
9031 vec
->quick_push (ifc
);
9032 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9033 release_tree_vector (vec
);
9034 finish_expr_stmt (stmt
);
9038 finish_omp_cancellation_point (tree clauses
)
9040 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
9042 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
9044 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
9046 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
9048 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
9052 error ("%<#pragma omp cancellation point%> must specify one of "
9053 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
9056 vec
<tree
, va_gc
> *vec
9057 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
9058 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
9059 release_tree_vector (vec
);
9060 finish_expr_stmt (stmt
);
9063 /* Begin a __transaction_atomic or __transaction_relaxed statement.
9064 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
9065 should create an extra compound stmt. */
9068 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
9073 *pcompound
= begin_compound_stmt (0);
9075 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
9077 /* Only add the statement to the function if support enabled. */
9081 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
9082 ? G_("%<__transaction_relaxed%> without "
9083 "transactional memory support enabled")
9084 : G_("%<__transaction_atomic%> without "
9085 "transactional memory support enabled")));
9087 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
9088 TREE_SIDE_EFFECTS (r
) = 1;
9092 /* End a __transaction_atomic or __transaction_relaxed statement.
9093 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
9094 and we should end the compound. If NOEX is non-NULL, we wrap the body in
9095 a MUST_NOT_THROW_EXPR with NOEX as condition. */
9098 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
9100 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
9101 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
9102 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
9103 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
9105 /* noexcept specifications are not allowed for function transactions. */
9106 gcc_assert (!(noex
&& compound_stmt
));
9109 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
9111 protected_set_expr_location
9112 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
9113 TREE_SIDE_EFFECTS (body
) = 1;
9114 TRANSACTION_EXPR_BODY (stmt
) = body
;
9118 finish_compound_stmt (compound_stmt
);
9121 /* Build a __transaction_atomic or __transaction_relaxed expression. If
9122 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
9126 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
9131 expr
= build_must_not_throw_expr (expr
, noex
);
9132 protected_set_expr_location (expr
, loc
);
9133 TREE_SIDE_EFFECTS (expr
) = 1;
9135 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
9136 if (flags
& TM_STMT_ATTR_RELAXED
)
9137 TRANSACTION_EXPR_RELAXED (ret
) = 1;
9138 TREE_SIDE_EFFECTS (ret
) = 1;
9139 SET_EXPR_LOCATION (ret
, loc
);
9144 init_cp_semantics (void)
9148 /* Build a STATIC_ASSERT for a static assertion with the condition
9149 CONDITION and the message text MESSAGE. LOCATION is the location
9150 of the static assertion in the source code. When MEMBER_P, this
9151 static assertion is a member of a class. */
9153 finish_static_assert (tree condition
, tree message
, location_t location
,
9156 tsubst_flags_t complain
= tf_warning_or_error
;
9158 if (message
== NULL_TREE
9159 || message
== error_mark_node
9160 || condition
== NULL_TREE
9161 || condition
== error_mark_node
)
9164 if (check_for_bare_parameter_packs (condition
))
9165 condition
= error_mark_node
;
9167 if (instantiation_dependent_expression_p (condition
))
9169 /* We're in a template; build a STATIC_ASSERT and put it in
9173 assertion
= make_node (STATIC_ASSERT
);
9174 STATIC_ASSERT_CONDITION (assertion
) = condition
;
9175 STATIC_ASSERT_MESSAGE (assertion
) = message
;
9176 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
9179 maybe_add_class_template_decl_list (current_class_type
,
9183 add_stmt (assertion
);
9188 /* Fold the expression and convert it to a boolean value. */
9189 condition
= perform_implicit_conversion_flags (boolean_type_node
, condition
,
9190 complain
, LOOKUP_NORMAL
);
9191 condition
= fold_non_dependent_expr (condition
, complain
);
9193 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
9194 /* Do nothing; the condition is satisfied. */
9198 location_t saved_loc
= input_location
;
9200 input_location
= location
;
9201 if (TREE_CODE (condition
) == INTEGER_CST
9202 && integer_zerop (condition
))
9204 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
9205 (TREE_TYPE (TREE_TYPE (message
))));
9206 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
9207 /* Report the error. */
9209 error ("static assertion failed");
9211 error ("static assertion failed: %s",
9212 TREE_STRING_POINTER (message
));
9214 else if (condition
&& condition
!= error_mark_node
)
9216 error ("non-constant condition for static assertion");
9217 if (require_rvalue_constant_expression (condition
))
9218 cxx_constant_value (condition
);
9220 input_location
= saved_loc
;
9224 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
9225 suitable for use as a type-specifier.
9227 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
9228 id-expression or a class member access, FALSE when it was parsed as
9229 a full expression. */
9232 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
9233 tsubst_flags_t complain
)
9235 tree type
= NULL_TREE
;
9237 if (!expr
|| error_operand_p (expr
))
9238 return error_mark_node
;
9241 || TREE_CODE (expr
) == TYPE_DECL
9242 || (TREE_CODE (expr
) == BIT_NOT_EXPR
9243 && TYPE_P (TREE_OPERAND (expr
, 0))))
9245 if (complain
& tf_error
)
9246 error ("argument to decltype must be an expression");
9247 return error_mark_node
;
9250 /* Depending on the resolution of DR 1172, we may later need to distinguish
9251 instantiation-dependent but not type-dependent expressions so that, say,
9252 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
9253 if (instantiation_dependent_uneval_expression_p (expr
))
9255 type
= cxx_make_type (DECLTYPE_TYPE
);
9256 DECLTYPE_TYPE_EXPR (type
) = expr
;
9257 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
9258 = id_expression_or_member_access_p
;
9259 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9264 /* The type denoted by decltype(e) is defined as follows: */
9266 expr
= resolve_nondeduced_context (expr
, complain
);
9268 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
9269 return error_mark_node
;
9271 if (type_unknown_p (expr
))
9273 if (complain
& tf_error
)
9274 error ("decltype cannot resolve address of overloaded function");
9275 return error_mark_node
;
9278 /* To get the size of a static data member declared as an array of
9279 unknown bound, we need to instantiate it. */
9281 && VAR_HAD_UNKNOWN_BOUND (expr
)
9282 && DECL_TEMPLATE_INSTANTIATION (expr
))
9283 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
9285 if (id_expression_or_member_access_p
)
9287 /* If e is an id-expression or a class member access (5.2.5
9288 [expr.ref]), decltype(e) is defined as the type of the entity
9289 named by e. If there is no such entity, or e names a set of
9290 overloaded functions, the program is ill-formed. */
9291 if (identifier_p (expr
))
9292 expr
= lookup_name (expr
);
9294 if (INDIRECT_REF_P (expr
)
9295 || TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
9296 /* This can happen when the expression is, e.g., "a.b". Just
9297 look at the underlying operand. */
9298 expr
= TREE_OPERAND (expr
, 0);
9300 if (TREE_CODE (expr
) == OFFSET_REF
9301 || TREE_CODE (expr
) == MEMBER_REF
9302 || TREE_CODE (expr
) == SCOPE_REF
)
9303 /* We're only interested in the field itself. If it is a
9304 BASELINK, we will need to see through it in the next
9306 expr
= TREE_OPERAND (expr
, 1);
9308 if (BASELINK_P (expr
))
9309 /* See through BASELINK nodes to the underlying function. */
9310 expr
= BASELINK_FUNCTIONS (expr
);
9312 /* decltype of a decomposition name drops references in the tuple case
9313 (unlike decltype of a normal variable) and keeps cv-qualifiers from
9314 the containing object in the other cases (unlike decltype of a member
9315 access expression). */
9316 if (DECL_DECOMPOSITION_P (expr
))
9318 if (DECL_HAS_VALUE_EXPR_P (expr
))
9319 /* Expr is an array or struct subobject proxy, handle
9320 bit-fields properly. */
9321 return unlowered_expr_type (expr
);
9323 /* Expr is a reference variable for the tuple case. */
9324 return lookup_decomp_type (expr
);
9327 switch (TREE_CODE (expr
))
9330 if (DECL_BIT_FIELD_TYPE (expr
))
9332 type
= DECL_BIT_FIELD_TYPE (expr
);
9335 /* Fall through for fields that aren't bitfields. */
9343 case TEMPLATE_PARM_INDEX
:
9344 expr
= mark_type_use (expr
);
9345 type
= TREE_TYPE (expr
);
9349 type
= error_mark_node
;
9354 mark_type_use (expr
);
9355 type
= is_bitfield_expr_with_lowered_type (expr
);
9357 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
9365 /* We can get here when the id-expression refers to an
9366 enumerator or non-type template parameter. */
9367 type
= TREE_TYPE (expr
);
9371 /* Handle instantiated template non-type arguments. */
9372 type
= TREE_TYPE (expr
);
9378 /* Within a lambda-expression:
9380 Every occurrence of decltype((x)) where x is a possibly
9381 parenthesized id-expression that names an entity of
9382 automatic storage duration is treated as if x were
9383 transformed into an access to a corresponding data member
9384 of the closure type that would have been declared if x
9385 were a use of the denoted entity. */
9386 if (outer_automatic_var_p (expr
)
9387 && current_function_decl
9388 && LAMBDA_FUNCTION_P (current_function_decl
))
9389 type
= capture_decltype (expr
);
9390 else if (error_operand_p (expr
))
9391 type
= error_mark_node
;
9392 else if (expr
== current_class_ptr
)
9393 /* If the expression is just "this", we want the
9394 cv-unqualified pointer for the "this" type. */
9395 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
9398 /* Otherwise, where T is the type of e, if e is an lvalue,
9399 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
9400 cp_lvalue_kind clk
= lvalue_kind (expr
);
9401 type
= unlowered_expr_type (expr
);
9402 gcc_assert (!TYPE_REF_P (type
));
9404 /* For vector types, pick a non-opaque variant. */
9405 if (VECTOR_TYPE_P (type
))
9406 type
= strip_typedefs (type
);
9408 if (clk
!= clk_none
&& !(clk
& clk_class
))
9409 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
9416 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
9417 __has_nothrow_copy, depending on assign_p. Returns true iff all
9418 the copy {ctor,assign} fns are nothrow. */
9421 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
9423 tree fns
= NULL_TREE
;
9425 if (assign_p
|| TYPE_HAS_COPY_CTOR (type
))
9426 fns
= get_class_binding (type
, assign_p
? assign_op_identifier
9429 bool saw_copy
= false;
9430 for (ovl_iterator
iter (fns
); iter
; ++iter
)
9434 if (copy_fn_p (fn
) > 0)
9437 maybe_instantiate_noexcept (fn
);
9438 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
9446 /* Actually evaluates the trait. */
9449 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
9451 enum tree_code type_code1
;
9454 type_code1
= TREE_CODE (type1
);
9458 case CPTK_HAS_NOTHROW_ASSIGN
:
9459 type1
= strip_array_types (type1
);
9460 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9461 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
9462 || (CLASS_TYPE_P (type1
)
9463 && classtype_has_nothrow_assign_or_copy_p (type1
,
9466 case CPTK_HAS_TRIVIAL_ASSIGN
:
9467 /* ??? The standard seems to be missing the "or array of such a class
9468 type" wording for this trait. */
9469 type1
= strip_array_types (type1
);
9470 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9471 && (trivial_type_p (type1
)
9472 || (CLASS_TYPE_P (type1
)
9473 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
9475 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9476 type1
= strip_array_types (type1
);
9477 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
9478 || (CLASS_TYPE_P (type1
)
9479 && (t
= locate_ctor (type1
))
9480 && (maybe_instantiate_noexcept (t
),
9481 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
9483 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9484 type1
= strip_array_types (type1
);
9485 return (trivial_type_p (type1
)
9486 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
9488 case CPTK_HAS_NOTHROW_COPY
:
9489 type1
= strip_array_types (type1
);
9490 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
9491 || (CLASS_TYPE_P (type1
)
9492 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
9494 case CPTK_HAS_TRIVIAL_COPY
:
9495 /* ??? The standard seems to be missing the "or array of such a class
9496 type" wording for this trait. */
9497 type1
= strip_array_types (type1
);
9498 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9499 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
9501 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9502 type1
= strip_array_types (type1
);
9503 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9504 || (CLASS_TYPE_P (type1
)
9505 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
9507 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9508 return type_has_virtual_destructor (type1
);
9510 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9511 return type_has_unique_obj_representations (type1
);
9513 case CPTK_IS_ABSTRACT
:
9514 return ABSTRACT_CLASS_TYPE_P (type1
);
9516 case CPTK_IS_AGGREGATE
:
9517 return CP_AGGREGATE_TYPE_P (type1
);
9519 case CPTK_IS_BASE_OF
:
9520 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9521 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9522 || DERIVED_FROM_P (type1
, type2
)));
9525 return NON_UNION_CLASS_TYPE_P (type1
);
9528 return NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
);
9531 return type_code1
== ENUMERAL_TYPE
;
9534 return CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
);
9536 case CPTK_IS_LITERAL_TYPE
:
9537 return literal_type_p (type1
);
9540 return pod_type_p (type1
);
9542 case CPTK_IS_POLYMORPHIC
:
9543 return CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
);
9545 case CPTK_IS_SAME_AS
:
9546 return same_type_p (type1
, type2
);
9548 case CPTK_IS_STD_LAYOUT
:
9549 return std_layout_type_p (type1
);
9551 case CPTK_IS_TRIVIAL
:
9552 return trivial_type_p (type1
);
9554 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9555 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9557 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9558 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9560 case CPTK_IS_TRIVIALLY_COPYABLE
:
9561 return trivially_copyable_p (type1
);
9564 return type_code1
== UNION_TYPE
;
9566 case CPTK_IS_ASSIGNABLE
:
9567 return is_xible (MODIFY_EXPR
, type1
, type2
);
9569 case CPTK_IS_CONSTRUCTIBLE
:
9570 return is_xible (INIT_EXPR
, type1
, type2
);
9578 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9579 void, or a complete type, returns true, otherwise false. */
9582 check_trait_type (tree type
)
9584 if (type
== NULL_TREE
)
9587 if (TREE_CODE (type
) == TREE_LIST
)
9588 return (check_trait_type (TREE_VALUE (type
))
9589 && check_trait_type (TREE_CHAIN (type
)));
9591 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9592 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9595 if (VOID_TYPE_P (type
))
9598 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9601 /* Process a trait expression. */
9604 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9606 if (type1
== error_mark_node
9607 || type2
== error_mark_node
)
9608 return error_mark_node
;
9610 if (processing_template_decl
)
9612 tree trait_expr
= make_node (TRAIT_EXPR
);
9613 TREE_TYPE (trait_expr
) = boolean_type_node
;
9614 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9615 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9616 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9622 case CPTK_HAS_NOTHROW_ASSIGN
:
9623 case CPTK_HAS_TRIVIAL_ASSIGN
:
9624 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9625 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9626 case CPTK_HAS_NOTHROW_COPY
:
9627 case CPTK_HAS_TRIVIAL_COPY
:
9628 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9629 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9630 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9631 case CPTK_IS_ABSTRACT
:
9632 case CPTK_IS_AGGREGATE
:
9635 case CPTK_IS_LITERAL_TYPE
:
9637 case CPTK_IS_POLYMORPHIC
:
9638 case CPTK_IS_STD_LAYOUT
:
9639 case CPTK_IS_TRIVIAL
:
9640 case CPTK_IS_TRIVIALLY_COPYABLE
:
9641 if (!check_trait_type (type1
))
9642 return error_mark_node
;
9645 case CPTK_IS_ASSIGNABLE
:
9646 case CPTK_IS_CONSTRUCTIBLE
:
9649 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9650 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9651 if (!check_trait_type (type1
)
9652 || !check_trait_type (type2
))
9653 return error_mark_node
;
9656 case CPTK_IS_BASE_OF
:
9657 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9658 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9659 && !complete_type_or_else (type2
, NULL_TREE
))
9660 /* We already issued an error. */
9661 return error_mark_node
;
9667 case CPTK_IS_SAME_AS
:
9674 return (trait_expr_value (kind
, type1
, type2
)
9675 ? boolean_true_node
: boolean_false_node
);
9678 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9679 which is ignored for C++. */
9682 set_float_const_decimal64 (void)
9687 clear_float_const_decimal64 (void)
9692 float_const_decimal64_p (void)
9698 /* Return true if T designates the implied `this' parameter. */
9701 is_this_parameter (tree t
)
9703 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9705 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
9706 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
9710 /* Insert the deduced return type for an auto function. */
9713 apply_deduced_return_type (tree fco
, tree return_type
)
9717 if (return_type
== error_mark_node
)
9720 if (DECL_CONV_FN_P (fco
))
9721 DECL_NAME (fco
) = make_conv_op_name (return_type
);
9723 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9725 result
= DECL_RESULT (fco
);
9726 if (result
== NULL_TREE
)
9728 if (TREE_TYPE (result
) == return_type
)
9731 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
9732 && !complete_type_or_else (return_type
, NULL_TREE
))
9735 /* We already have a DECL_RESULT from start_preparsed_function.
9736 Now we need to redo the work it and allocate_struct_function
9737 did to reflect the new type. */
9738 gcc_assert (current_function_decl
== fco
);
9739 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9740 TYPE_MAIN_VARIANT (return_type
));
9741 DECL_ARTIFICIAL (result
) = 1;
9742 DECL_IGNORED_P (result
) = 1;
9743 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9746 DECL_RESULT (fco
) = result
;
9748 if (!processing_template_decl
)
9750 bool aggr
= aggregate_value_p (result
, fco
);
9751 #ifdef PCC_STATIC_STRUCT_RETURN
9752 cfun
->returns_pcc_struct
= aggr
;
9754 cfun
->returns_struct
= aggr
;
9759 /* DECL is a local variable or parameter from the surrounding scope of a
9760 lambda-expression. Returns the decltype for a use of the capture field
9761 for DECL even if it hasn't been captured yet. */
9764 capture_decltype (tree decl
)
9766 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9767 /* FIXME do lookup instead of list walk? */
9768 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9772 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9774 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9777 error ("%qD is not captured", decl
);
9778 return error_mark_node
;
9781 type
= TREE_TYPE (decl
);
9782 if (TYPE_REF_P (type
)
9783 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9784 type
= TREE_TYPE (type
);
9787 case CPLD_REFERENCE
:
9788 type
= TREE_TYPE (decl
);
9789 if (!TYPE_REF_P (type
))
9790 type
= build_reference_type (TREE_TYPE (decl
));
9797 if (!TYPE_REF_P (type
))
9799 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9800 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9802 type
= build_reference_type (type
);
9807 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9808 this is a right unary fold. Otherwise it is a left unary fold. */
9811 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9813 // Build a pack expansion (assuming expr has pack type).
9814 if (!uses_parameter_packs (expr
))
9816 error_at (location_of (expr
), "operand of fold expression has no "
9817 "unexpanded parameter packs");
9818 return error_mark_node
;
9820 tree pack
= make_pack_expansion (expr
);
9822 // Build the fold expression.
9823 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9824 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
9825 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9830 finish_left_unary_fold_expr (tree expr
, int op
)
9832 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9836 finish_right_unary_fold_expr (tree expr
, int op
)
9838 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9841 /* Build a binary fold expression over EXPR1 and EXPR2. The
9842 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9843 has an unexpanded parameter pack). */
9846 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9848 pack
= make_pack_expansion (pack
);
9849 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9850 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
9851 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9856 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9858 // Determine which expr has an unexpanded parameter pack and
9859 // set the pack and initial term.
9860 bool pack1
= uses_parameter_packs (expr1
);
9861 bool pack2
= uses_parameter_packs (expr2
);
9862 if (pack1
&& !pack2
)
9863 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9864 else if (pack2
&& !pack1
)
9865 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9869 error ("both arguments in binary fold have unexpanded parameter packs");
9871 error ("no unexpanded parameter packs in binary fold");
9873 return error_mark_node
;
9876 /* Finish __builtin_launder (arg). */
9879 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
9881 tree orig_arg
= arg
;
9882 if (!type_dependent_expression_p (arg
))
9883 arg
= decay_conversion (arg
, complain
);
9884 if (error_operand_p (arg
))
9885 return error_mark_node
;
9886 if (!type_dependent_expression_p (arg
)
9887 && !TYPE_PTR_P (TREE_TYPE (arg
)))
9889 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
9890 return error_mark_node
;
9892 if (processing_template_decl
)
9894 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
9895 TREE_TYPE (arg
), 1, arg
);
9898 #include "gt-cp-semantics.h"