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-2017 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 "gomp-constants.h"
45 /* There routines provide a modular interface to perform many parsing
46 operations. They may therefore be used during actual parsing, or
47 during template instantiation, which may be regarded as a
48 degenerate form of parsing. */
50 static tree
maybe_convert_cond (tree
);
51 static tree
finalize_nrv_r (tree
*, int *, void *);
52 static tree
capture_decltype (tree
);
54 /* Used for OpenMP non-static data member privatization. */
56 static hash_map
<tree
, tree
> *omp_private_member_map
;
57 static vec
<tree
> omp_private_member_vec
;
58 static bool omp_private_member_ignore_next
;
61 /* Deferred Access Checking Overview
62 ---------------------------------
64 Most C++ expressions and declarations require access checking
65 to be performed during parsing. However, in several cases,
66 this has to be treated differently.
68 For member declarations, access checking has to be deferred
69 until more information about the declaration is known. For
81 When we are parsing the function return type `A::X', we don't
82 really know if this is allowed until we parse the function name.
84 Furthermore, some contexts require that access checking is
85 never performed at all. These include class heads, and template
88 Typical use of access checking functions is described here:
90 1. When we enter a context that requires certain access checking
91 mode, the function `push_deferring_access_checks' is called with
92 DEFERRING argument specifying the desired mode. Access checking
93 may be performed immediately (dk_no_deferred), deferred
94 (dk_deferred), or not performed (dk_no_check).
96 2. When a declaration such as a type, or a variable, is encountered,
97 the function `perform_or_defer_access_check' is called. It
98 maintains a vector of all deferred checks.
100 3. The global `current_class_type' or `current_function_decl' is then
101 setup by the parser. `enforce_access' relies on these information
104 4. Upon exiting the context mentioned in step 1,
105 `perform_deferred_access_checks' is called to check all declaration
106 stored in the vector. `pop_deferring_access_checks' is then
107 called to restore the previous access checking mode.
109 In case of parsing error, we simply call `pop_deferring_access_checks'
110 without `perform_deferred_access_checks'. */
112 struct GTY(()) deferred_access
{
113 /* A vector representing name-lookups for which we have deferred
114 checking access controls. We cannot check the accessibility of
115 names used in a decl-specifier-seq until we know what is being
116 declared because code like:
123 A::B* A::f() { return 0; }
125 is valid, even though `A::B' is not generally accessible. */
126 vec
<deferred_access_check
, va_gc
> * GTY(()) deferred_access_checks
;
128 /* The current mode of access checks. */
129 enum deferring_kind deferring_access_checks_kind
;
133 /* Data for deferred access checking. */
134 static GTY(()) vec
<deferred_access
, va_gc
> *deferred_access_stack
;
135 static GTY(()) unsigned deferred_access_no_check
;
137 /* Save the current deferred access states and start deferred
138 access checking iff DEFER_P is true. */
141 push_deferring_access_checks (deferring_kind deferring
)
143 /* For context like template instantiation, access checking
144 disabling applies to all nested context. */
145 if (deferred_access_no_check
|| deferring
== dk_no_check
)
146 deferred_access_no_check
++;
149 deferred_access e
= {NULL
, deferring
};
150 vec_safe_push (deferred_access_stack
, e
);
154 /* Save the current deferred access states and start deferred access
155 checking, continuing the set of deferred checks in CHECKS. */
158 reopen_deferring_access_checks (vec
<deferred_access_check
, va_gc
> * checks
)
160 push_deferring_access_checks (dk_deferred
);
161 if (!deferred_access_no_check
)
162 deferred_access_stack
->last().deferred_access_checks
= checks
;
165 /* Resume deferring access checks again after we stopped doing
169 resume_deferring_access_checks (void)
171 if (!deferred_access_no_check
)
172 deferred_access_stack
->last().deferring_access_checks_kind
= dk_deferred
;
175 /* Stop deferring access checks. */
178 stop_deferring_access_checks (void)
180 if (!deferred_access_no_check
)
181 deferred_access_stack
->last().deferring_access_checks_kind
= dk_no_deferred
;
184 /* Discard the current deferred access checks and restore the
188 pop_deferring_access_checks (void)
190 if (deferred_access_no_check
)
191 deferred_access_no_check
--;
193 deferred_access_stack
->pop ();
196 /* Returns a TREE_LIST representing the deferred checks.
197 The TREE_PURPOSE of each node is the type through which the
198 access occurred; the TREE_VALUE is the declaration named.
201 vec
<deferred_access_check
, va_gc
> *
202 get_deferred_access_checks (void)
204 if (deferred_access_no_check
)
207 return (deferred_access_stack
->last().deferred_access_checks
);
210 /* Take current deferred checks and combine with the
211 previous states if we also defer checks previously.
212 Otherwise perform checks now. */
215 pop_to_parent_deferring_access_checks (void)
217 if (deferred_access_no_check
)
218 deferred_access_no_check
--;
221 vec
<deferred_access_check
, va_gc
> *checks
;
222 deferred_access
*ptr
;
224 checks
= (deferred_access_stack
->last ().deferred_access_checks
);
226 deferred_access_stack
->pop ();
227 ptr
= &deferred_access_stack
->last ();
228 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
231 perform_access_checks (checks
, tf_warning_or_error
);
235 /* Merge with parent. */
237 deferred_access_check
*chk
, *probe
;
239 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
241 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, j
, probe
)
243 if (probe
->binfo
== chk
->binfo
&&
244 probe
->decl
== chk
->decl
&&
245 probe
->diag_decl
== chk
->diag_decl
)
248 /* Insert into parent's checks. */
249 vec_safe_push (ptr
->deferred_access_checks
, *chk
);
256 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
257 is the BINFO indicating the qualifying scope used to access the
258 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
259 or we aren't in SFINAE context or all the checks succeed return TRUE,
263 perform_access_checks (vec
<deferred_access_check
, va_gc
> *checks
,
264 tsubst_flags_t complain
)
267 deferred_access_check
*chk
;
268 location_t loc
= input_location
;
274 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
276 input_location
= chk
->loc
;
277 ok
&= enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
, complain
);
280 input_location
= loc
;
281 return (complain
& tf_error
) ? true : ok
;
284 /* Perform the deferred access checks.
286 After performing the checks, we still have to keep the list
287 `deferred_access_stack->deferred_access_checks' since we may want
288 to check access for them again later in a different context.
295 A::X A::a, x; // No error for `A::a', error for `x'
297 We have to perform deferred access of `A::X', first with `A::a',
298 next with `x'. Return value like perform_access_checks above. */
301 perform_deferred_access_checks (tsubst_flags_t complain
)
303 return perform_access_checks (get_deferred_access_checks (), complain
);
306 /* Defer checking the accessibility of DECL, when looked up in
307 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
308 Return value like perform_access_checks above. */
311 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
,
312 tsubst_flags_t complain
)
315 deferred_access
*ptr
;
316 deferred_access_check
*chk
;
319 /* Exit if we are in a context that no access checking is performed.
321 if (deferred_access_no_check
)
324 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
326 ptr
= &deferred_access_stack
->last ();
328 /* If we are not supposed to defer access checks, just check now. */
329 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
331 bool ok
= enforce_access (binfo
, decl
, diag_decl
, complain
);
332 return (complain
& tf_error
) ? true : ok
;
335 /* See if we are already going to perform this check. */
336 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, i
, chk
)
338 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
339 chk
->diag_decl
== diag_decl
)
344 /* If not, record the check. */
345 deferred_access_check new_access
= {binfo
, decl
, diag_decl
, input_location
};
346 vec_safe_push (ptr
->deferred_access_checks
, new_access
);
351 /* Returns nonzero if the current statement is a full expression,
352 i.e. temporaries created during that statement should be destroyed
353 at the end of the statement. */
356 stmts_are_full_exprs_p (void)
358 return current_stmt_tree ()->stmts_are_full_exprs_p
;
361 /* T is a statement. Add it to the statement-tree. This is the C++
362 version. The C/ObjC frontends have a slightly different version of
368 enum tree_code code
= TREE_CODE (t
);
370 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
372 if (!EXPR_HAS_LOCATION (t
))
373 SET_EXPR_LOCATION (t
, input_location
);
375 /* When we expand a statement-tree, we must know whether or not the
376 statements are full-expressions. We record that fact here. */
377 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
380 if (code
== LABEL_EXPR
|| code
== CASE_LABEL_EXPR
)
381 STATEMENT_LIST_HAS_LABEL (cur_stmt_list
) = 1;
383 /* Add T to the statement-tree. Non-side-effect statements need to be
384 recorded during statement expressions. */
385 gcc_checking_assert (!stmt_list_stack
->is_empty ());
386 append_to_statement_list_force (t
, &cur_stmt_list
);
391 /* Returns the stmt_tree to which statements are currently being added. */
394 current_stmt_tree (void)
397 ? &cfun
->language
->base
.x_stmt_tree
398 : &scope_chain
->x_stmt_tree
);
401 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
404 maybe_cleanup_point_expr (tree expr
)
406 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
407 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
411 /* Like maybe_cleanup_point_expr except have the type of the new expression be
412 void so we don't need to create a temporary variable to hold the inner
413 expression. The reason why we do this is because the original type might be
414 an aggregate and we cannot create a temporary variable for that type. */
417 maybe_cleanup_point_expr_void (tree expr
)
419 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
420 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
426 /* Create a declaration statement for the declaration given by the DECL. */
429 add_decl_expr (tree decl
)
431 tree r
= build_stmt (DECL_SOURCE_LOCATION (decl
), DECL_EXPR
, decl
);
432 if (DECL_INITIAL (decl
)
433 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
434 r
= maybe_cleanup_point_expr_void (r
);
438 /* Finish a scope. */
441 do_poplevel (tree stmt_list
)
445 if (stmts_are_full_exprs_p ())
446 block
= poplevel (kept_level_p (), 1, 0);
448 stmt_list
= pop_stmt_list (stmt_list
);
450 if (!processing_template_decl
)
452 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
453 /* ??? See c_end_compound_stmt re statement expressions. */
459 /* Begin a new scope. */
462 do_pushlevel (scope_kind sk
)
464 tree ret
= push_stmt_list ();
465 if (stmts_are_full_exprs_p ())
466 begin_scope (sk
, NULL
);
470 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
471 when the current scope is exited. EH_ONLY is true when this is not
472 meant to apply to normal control flow transfer. */
475 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
477 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
478 CLEANUP_EH_ONLY (stmt
) = eh_only
;
480 CLEANUP_BODY (stmt
) = push_stmt_list ();
483 /* Simple infinite loop tracking for -Wreturn-type. We keep a stack of all
484 the current loops, represented by 'NULL_TREE' if we've seen a possible
485 exit, and 'error_mark_node' if not. This is currently used only to
486 suppress the warning about a function with no return statements, and
487 therefore we don't bother noting returns as possible exits. We also
488 don't bother with gotos. */
491 begin_maybe_infinite_loop (tree cond
)
493 /* Only track this while parsing a function, not during instantiation. */
494 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
495 && !processing_template_decl
))
497 bool maybe_infinite
= true;
500 cond
= fold_non_dependent_expr (cond
);
501 maybe_infinite
= integer_nonzerop (cond
);
503 vec_safe_push (cp_function_chain
->infinite_loops
,
504 maybe_infinite
? error_mark_node
: NULL_TREE
);
508 /* A break is a possible exit for the current loop. */
511 break_maybe_infinite_loop (void)
515 cp_function_chain
->infinite_loops
->last() = NULL_TREE
;
518 /* If we reach the end of the loop without seeing a possible exit, we have
522 end_maybe_infinite_loop (tree cond
)
524 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
525 && !processing_template_decl
))
527 tree current
= cp_function_chain
->infinite_loops
->pop();
528 if (current
!= NULL_TREE
)
530 cond
= fold_non_dependent_expr (cond
);
531 if (integer_nonzerop (cond
))
532 current_function_infinite_loop
= 1;
537 /* Begin a conditional that might contain a declaration. When generating
538 normal code, we want the declaration to appear before the statement
539 containing the conditional. When generating template code, we want the
540 conditional to be rendered as the raw DECL_EXPR. */
543 begin_cond (tree
*cond_p
)
545 if (processing_template_decl
)
546 *cond_p
= push_stmt_list ();
549 /* Finish such a conditional. */
552 finish_cond (tree
*cond_p
, tree expr
)
554 if (processing_template_decl
)
556 tree cond
= pop_stmt_list (*cond_p
);
558 if (expr
== NULL_TREE
)
559 /* Empty condition in 'for'. */
560 gcc_assert (empty_expr_stmt_p (cond
));
561 else if (check_for_bare_parameter_packs (expr
))
562 expr
= error_mark_node
;
563 else if (!empty_expr_stmt_p (cond
))
564 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), cond
, expr
);
569 /* If *COND_P specifies a conditional with a declaration, transform the
572 for (; A x = 42;) { }
574 while (true) { A x = 42; if (!x) break; }
575 for (;;) { A x = 42; if (!x) break; }
576 The statement list for BODY will be empty if the conditional did
577 not declare anything. */
580 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
584 if (!TREE_SIDE_EFFECTS (body
))
588 *cond_p
= boolean_true_node
;
590 if_stmt
= begin_if_stmt ();
591 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, false, tf_warning_or_error
);
592 finish_if_stmt_cond (cond
, if_stmt
);
593 finish_break_stmt ();
594 finish_then_clause (if_stmt
);
595 finish_if_stmt (if_stmt
);
598 /* Finish a goto-statement. */
601 finish_goto_stmt (tree destination
)
603 if (identifier_p (destination
))
604 destination
= lookup_label (destination
);
606 /* We warn about unused labels with -Wunused. That means we have to
607 mark the used labels as used. */
608 if (TREE_CODE (destination
) == LABEL_DECL
)
609 TREE_USED (destination
) = 1;
612 if (check_no_cilk (destination
,
613 "Cilk array notation cannot be used as a computed goto expression",
614 "%<_Cilk_spawn%> statement cannot be used as a computed goto expression"))
615 destination
= error_mark_node
;
616 destination
= mark_rvalue_use (destination
);
617 if (!processing_template_decl
)
619 destination
= cp_convert (ptr_type_node
, destination
,
620 tf_warning_or_error
);
621 if (error_operand_p (destination
))
624 = fold_build_cleanup_point_expr (TREE_TYPE (destination
),
629 check_goto (destination
);
631 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
634 /* COND is the condition-expression for an if, while, etc.,
635 statement. Convert it to a boolean value, if appropriate.
636 In addition, verify sequence points if -Wsequence-point is enabled. */
639 maybe_convert_cond (tree cond
)
641 /* Empty conditions remain empty. */
645 /* Wait until we instantiate templates before doing conversion. */
646 if (processing_template_decl
)
649 if (warn_sequence_point
)
650 verify_sequence_points (cond
);
652 /* Do the conversion. */
653 cond
= convert_from_reference (cond
);
655 if (TREE_CODE (cond
) == MODIFY_EXPR
656 && !TREE_NO_WARNING (cond
)
659 warning_at (EXPR_LOC_OR_LOC (cond
, input_location
), OPT_Wparentheses
,
660 "suggest parentheses around assignment used as truth value");
661 TREE_NO_WARNING (cond
) = 1;
664 return condition_conversion (cond
);
667 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
670 finish_expr_stmt (tree expr
)
673 location_t loc
= EXPR_LOCATION (expr
);
675 if (expr
!= NULL_TREE
)
677 /* If we ran into a problem, make sure we complained. */
678 gcc_assert (expr
!= error_mark_node
|| seen_error ());
680 if (!processing_template_decl
)
682 if (warn_sequence_point
)
683 verify_sequence_points (expr
);
684 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
686 else if (!type_dependent_expression_p (expr
))
687 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
688 tf_warning_or_error
);
690 if (check_for_bare_parameter_packs (expr
))
691 expr
= error_mark_node
;
693 /* Simplification of inner statement expressions, compound exprs,
694 etc can result in us already having an EXPR_STMT. */
695 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
697 if (TREE_CODE (expr
) != EXPR_STMT
)
698 expr
= build_stmt (loc
, EXPR_STMT
, expr
);
699 expr
= maybe_cleanup_point_expr_void (expr
);
709 /* Begin an if-statement. Returns a newly created IF_STMT if
716 scope
= do_pushlevel (sk_cond
);
717 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
718 NULL_TREE
, NULL_TREE
, scope
);
719 current_binding_level
->this_entity
= r
;
720 begin_cond (&IF_COND (r
));
724 /* Process the COND of an if-statement, which may be given by
728 finish_if_stmt_cond (tree cond
, tree if_stmt
)
730 cond
= maybe_convert_cond (cond
);
731 if (IF_STMT_CONSTEXPR_P (if_stmt
)
732 && require_potential_rvalue_constant_expression (cond
)
733 && !value_dependent_expression_p (cond
))
734 cond
= cxx_constant_value (cond
, NULL_TREE
);
735 finish_cond (&IF_COND (if_stmt
), cond
);
737 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
741 /* Finish the then-clause of an if-statement, which may be given by
745 finish_then_clause (tree if_stmt
)
747 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
751 /* Begin the else-clause of an if-statement. */
754 begin_else_clause (tree if_stmt
)
756 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
759 /* Finish the else-clause of an if-statement, which may be given by
763 finish_else_clause (tree if_stmt
)
765 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
768 /* Finish an if-statement. */
771 finish_if_stmt (tree if_stmt
)
773 tree scope
= IF_SCOPE (if_stmt
);
774 IF_SCOPE (if_stmt
) = NULL
;
775 add_stmt (do_poplevel (scope
));
778 /* Begin a while-statement. Returns a newly created WHILE_STMT if
782 begin_while_stmt (void)
785 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
787 WHILE_BODY (r
) = do_pushlevel (sk_block
);
788 begin_cond (&WHILE_COND (r
));
792 /* Process the COND of a while-statement, which may be given by
796 finish_while_stmt_cond (tree cond
, tree while_stmt
, bool ivdep
)
798 if (check_no_cilk (cond
,
799 "Cilk array notation cannot be used as a condition for while statement",
800 "%<_Cilk_spawn%> statement cannot be used as a condition for while statement"))
801 cond
= error_mark_node
;
802 cond
= maybe_convert_cond (cond
);
803 finish_cond (&WHILE_COND (while_stmt
), cond
);
804 begin_maybe_infinite_loop (cond
);
805 if (ivdep
&& cond
!= error_mark_node
)
806 WHILE_COND (while_stmt
) = build2 (ANNOTATE_EXPR
,
807 TREE_TYPE (WHILE_COND (while_stmt
)),
808 WHILE_COND (while_stmt
),
809 build_int_cst (integer_type_node
,
810 annot_expr_ivdep_kind
));
811 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
814 /* Finish a while-statement, which may be given by WHILE_STMT. */
817 finish_while_stmt (tree while_stmt
)
819 end_maybe_infinite_loop (boolean_true_node
);
820 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
823 /* Begin a do-statement. Returns a newly created DO_STMT if
829 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
830 begin_maybe_infinite_loop (boolean_true_node
);
832 DO_BODY (r
) = push_stmt_list ();
836 /* Finish the body of a do-statement, which may be given by DO_STMT. */
839 finish_do_body (tree do_stmt
)
841 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
843 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
844 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
846 if (IS_EMPTY_STMT (body
))
847 warning (OPT_Wempty_body
,
848 "suggest explicit braces around empty body in %<do%> statement");
851 /* Finish a do-statement, which may be given by DO_STMT, and whose
852 COND is as indicated. */
855 finish_do_stmt (tree cond
, tree do_stmt
, bool ivdep
)
857 if (check_no_cilk (cond
,
858 "Cilk array notation cannot be used as a condition for a do-while statement",
859 "%<_Cilk_spawn%> statement cannot be used as a condition for a do-while statement"))
860 cond
= error_mark_node
;
861 cond
= maybe_convert_cond (cond
);
862 end_maybe_infinite_loop (cond
);
863 if (ivdep
&& cond
!= error_mark_node
)
864 cond
= build2 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
865 build_int_cst (integer_type_node
, annot_expr_ivdep_kind
));
866 DO_COND (do_stmt
) = cond
;
869 /* Finish a return-statement. The EXPRESSION returned, if any, is as
873 finish_return_stmt (tree expr
)
878 expr
= check_return_expr (expr
, &no_warning
);
880 if (error_operand_p (expr
)
881 || (flag_openmp
&& !check_omp_return ()))
883 /* Suppress -Wreturn-type for this function. */
884 if (warn_return_type
)
885 TREE_NO_WARNING (current_function_decl
) = true;
886 return error_mark_node
;
889 if (!processing_template_decl
)
891 if (warn_sequence_point
)
892 verify_sequence_points (expr
);
894 if (DECL_DESTRUCTOR_P (current_function_decl
)
895 || (DECL_CONSTRUCTOR_P (current_function_decl
)
896 && targetm
.cxx
.cdtor_returns_this ()))
898 /* Similarly, all destructors must run destructors for
899 base-classes before returning. So, all returns in a
900 destructor get sent to the DTOR_LABEL; finish_function emits
901 code to return a value there. */
902 return finish_goto_stmt (cdtor_label
);
906 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
907 TREE_NO_WARNING (r
) |= no_warning
;
908 r
= maybe_cleanup_point_expr_void (r
);
914 /* Begin the scope of a for-statement or a range-for-statement.
915 Both the returned trees are to be used in a call to
916 begin_for_stmt or begin_range_for_stmt. */
919 begin_for_scope (tree
*init
)
921 tree scope
= NULL_TREE
;
922 if (flag_new_for_scope
> 0)
923 scope
= do_pushlevel (sk_for
);
925 if (processing_template_decl
)
926 *init
= push_stmt_list ();
933 /* Begin a for-statement. Returns a new FOR_STMT.
934 SCOPE and INIT should be the return of begin_for_scope,
938 begin_for_stmt (tree scope
, tree init
)
942 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
943 NULL_TREE
, NULL_TREE
, NULL_TREE
);
945 if (scope
== NULL_TREE
)
947 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
949 scope
= begin_for_scope (&init
);
951 FOR_INIT_STMT (r
) = init
;
952 FOR_SCOPE (r
) = scope
;
957 /* Finish the init-statement of a for-statement, which may be
958 given by FOR_STMT. */
961 finish_init_stmt (tree for_stmt
)
963 if (processing_template_decl
)
964 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
966 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
967 begin_cond (&FOR_COND (for_stmt
));
970 /* Finish the COND of a for-statement, which may be given by
974 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
)
976 if (check_no_cilk (cond
,
977 "Cilk array notation cannot be used in a condition for a for-loop",
978 "%<_Cilk_spawn%> statement cannot be used in a condition for a for-loop"))
979 cond
= error_mark_node
;
980 cond
= maybe_convert_cond (cond
);
981 finish_cond (&FOR_COND (for_stmt
), cond
);
982 begin_maybe_infinite_loop (cond
);
983 if (ivdep
&& cond
!= error_mark_node
)
984 FOR_COND (for_stmt
) = build2 (ANNOTATE_EXPR
,
985 TREE_TYPE (FOR_COND (for_stmt
)),
987 build_int_cst (integer_type_node
,
988 annot_expr_ivdep_kind
));
989 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
992 /* Finish the increment-EXPRESSION in a for-statement, which may be
993 given by FOR_STMT. */
996 finish_for_expr (tree expr
, tree for_stmt
)
1000 /* If EXPR is an overloaded function, issue an error; there is no
1001 context available to use to perform overload resolution. */
1002 if (type_unknown_p (expr
))
1004 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
1005 expr
= error_mark_node
;
1007 if (!processing_template_decl
)
1009 if (warn_sequence_point
)
1010 verify_sequence_points (expr
);
1011 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1012 tf_warning_or_error
);
1014 else if (!type_dependent_expression_p (expr
))
1015 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1016 tf_warning_or_error
);
1017 expr
= maybe_cleanup_point_expr_void (expr
);
1018 if (check_for_bare_parameter_packs (expr
))
1019 expr
= error_mark_node
;
1020 FOR_EXPR (for_stmt
) = expr
;
1023 /* Finish the body of a for-statement, which may be given by
1024 FOR_STMT. The increment-EXPR for the loop must be
1026 It can also finish RANGE_FOR_STMT. */
1029 finish_for_stmt (tree for_stmt
)
1031 end_maybe_infinite_loop (boolean_true_node
);
1033 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1034 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1036 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1038 /* Pop the scope for the body of the loop. */
1039 if (flag_new_for_scope
> 0)
1042 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1043 ? &RANGE_FOR_SCOPE (for_stmt
)
1044 : &FOR_SCOPE (for_stmt
));
1047 add_stmt (do_poplevel (scope
));
1051 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1052 SCOPE and INIT should be the return of begin_for_scope,
1054 To finish it call finish_for_stmt(). */
1057 begin_range_for_stmt (tree scope
, tree init
)
1061 begin_maybe_infinite_loop (boolean_false_node
);
1063 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
1064 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1066 if (scope
== NULL_TREE
)
1068 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
1070 scope
= begin_for_scope (&init
);
1073 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
1076 pop_stmt_list (init
);
1077 RANGE_FOR_SCOPE (r
) = scope
;
1082 /* Finish the head of a range-based for statement, which may
1083 be given by RANGE_FOR_STMT. DECL must be the declaration
1084 and EXPR must be the loop expression. */
1087 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
1089 RANGE_FOR_DECL (range_for_stmt
) = decl
;
1090 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
1091 add_stmt (range_for_stmt
);
1092 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
1095 /* Finish a break-statement. */
1098 finish_break_stmt (void)
1100 /* In switch statements break is sometimes stylistically used after
1101 a return statement. This can lead to spurious warnings about
1102 control reaching the end of a non-void function when it is
1103 inlined. Note that we are calling block_may_fallthru with
1104 language specific tree nodes; this works because
1105 block_may_fallthru returns true when given something it does not
1107 if (!block_may_fallthru (cur_stmt_list
))
1109 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1112 /* Finish a continue-statement. */
1115 finish_continue_stmt (void)
1117 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1120 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1124 begin_switch_stmt (void)
1128 scope
= do_pushlevel (sk_cond
);
1129 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1131 begin_cond (&SWITCH_STMT_COND (r
));
1136 /* Finish the cond of a switch-statement. */
1139 finish_switch_cond (tree cond
, tree switch_stmt
)
1141 tree orig_type
= NULL
;
1143 if (check_no_cilk (cond
,
1144 "Cilk array notation cannot be used as a condition for switch statement",
1145 "%<_Cilk_spawn%> statement cannot be used as a condition for switch statement"))
1146 cond
= error_mark_node
;
1148 if (!processing_template_decl
)
1150 /* Convert the condition to an integer or enumeration type. */
1151 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1152 if (cond
== NULL_TREE
)
1154 error ("switch quantity not an integer");
1155 cond
= error_mark_node
;
1157 /* We want unlowered type here to handle enum bit-fields. */
1158 orig_type
= unlowered_expr_type (cond
);
1159 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1160 orig_type
= TREE_TYPE (cond
);
1161 if (cond
!= error_mark_node
)
1165 Integral promotions are performed. */
1166 cond
= perform_integral_promotions (cond
);
1167 cond
= maybe_cleanup_point_expr (cond
);
1170 if (check_for_bare_parameter_packs (cond
))
1171 cond
= error_mark_node
;
1172 else if (!processing_template_decl
&& warn_sequence_point
)
1173 verify_sequence_points (cond
);
1175 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1176 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1177 add_stmt (switch_stmt
);
1178 push_switch (switch_stmt
);
1179 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1182 /* Finish the body of a switch-statement, which may be given by
1183 SWITCH_STMT. The COND to switch on is indicated. */
1186 finish_switch_stmt (tree switch_stmt
)
1190 SWITCH_STMT_BODY (switch_stmt
) =
1191 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1194 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1195 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1196 add_stmt (do_poplevel (scope
));
1199 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1203 begin_try_block (void)
1205 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1207 TRY_STMTS (r
) = push_stmt_list ();
1211 /* Likewise, for a function-try-block. The block returned in
1212 *COMPOUND_STMT is an artificial outer scope, containing the
1213 function-try-block. */
1216 begin_function_try_block (tree
*compound_stmt
)
1219 /* This outer scope does not exist in the C++ standard, but we need
1220 a place to put __FUNCTION__ and similar variables. */
1221 *compound_stmt
= begin_compound_stmt (0);
1222 r
= begin_try_block ();
1223 FN_TRY_BLOCK_P (r
) = 1;
1227 /* Finish a try-block, which may be given by TRY_BLOCK. */
1230 finish_try_block (tree try_block
)
1232 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1233 TRY_HANDLERS (try_block
) = push_stmt_list ();
1236 /* Finish the body of a cleanup try-block, which may be given by
1240 finish_cleanup_try_block (tree try_block
)
1242 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1245 /* Finish an implicitly generated try-block, with a cleanup is given
1249 finish_cleanup (tree cleanup
, tree try_block
)
1251 TRY_HANDLERS (try_block
) = cleanup
;
1252 CLEANUP_P (try_block
) = 1;
1255 /* Likewise, for a function-try-block. */
1258 finish_function_try_block (tree try_block
)
1260 finish_try_block (try_block
);
1261 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1262 the try block, but moving it inside. */
1263 in_function_try_handler
= 1;
1266 /* Finish a handler-sequence for a try-block, which may be given by
1270 finish_handler_sequence (tree try_block
)
1272 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1273 check_handlers (TRY_HANDLERS (try_block
));
1276 /* Finish the handler-seq for a function-try-block, given by
1277 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1278 begin_function_try_block. */
1281 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1283 in_function_try_handler
= 0;
1284 finish_handler_sequence (try_block
);
1285 finish_compound_stmt (compound_stmt
);
1288 /* Begin a handler. Returns a HANDLER if appropriate. */
1291 begin_handler (void)
1295 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1298 /* Create a binding level for the eh_info and the exception object
1300 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1305 /* Finish the handler-parameters for a handler, which may be given by
1306 HANDLER. DECL is the declaration for the catch parameter, or NULL
1307 if this is a `catch (...)' clause. */
1310 finish_handler_parms (tree decl
, tree handler
)
1312 tree type
= NULL_TREE
;
1313 if (processing_template_decl
)
1317 decl
= pushdecl (decl
);
1318 decl
= push_template_decl (decl
);
1319 HANDLER_PARMS (handler
) = decl
;
1320 type
= TREE_TYPE (decl
);
1324 type
= expand_start_catch_block (decl
);
1325 HANDLER_TYPE (handler
) = type
;
1328 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1329 the return value from the matching call to finish_handler_parms. */
1332 finish_handler (tree handler
)
1334 if (!processing_template_decl
)
1335 expand_end_catch_block ();
1336 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1339 /* Begin a compound statement. FLAGS contains some bits that control the
1340 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1341 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1342 block of a function. If BCS_TRY_BLOCK is set, this is the block
1343 created on behalf of a TRY statement. Returns a token to be passed to
1344 finish_compound_stmt. */
1347 begin_compound_stmt (unsigned int flags
)
1351 if (flags
& BCS_NO_SCOPE
)
1353 r
= push_stmt_list ();
1354 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1356 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1357 But, if it's a statement-expression with a scopeless block, there's
1358 nothing to keep, and we don't want to accidentally keep a block
1359 *inside* the scopeless block. */
1360 keep_next_level (false);
1364 scope_kind sk
= sk_block
;
1365 if (flags
& BCS_TRY_BLOCK
)
1367 else if (flags
& BCS_TRANSACTION
)
1368 sk
= sk_transaction
;
1369 r
= do_pushlevel (sk
);
1372 /* When processing a template, we need to remember where the braces were,
1373 so that we can set up identical scopes when instantiating the template
1374 later. BIND_EXPR is a handy candidate for this.
1375 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1376 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1377 processing templates. */
1378 if (processing_template_decl
)
1380 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1381 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1382 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1383 TREE_SIDE_EFFECTS (r
) = 1;
1389 /* Finish a compound-statement, which is given by STMT. */
1392 finish_compound_stmt (tree stmt
)
1394 if (TREE_CODE (stmt
) == BIND_EXPR
)
1396 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1397 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1398 discard the BIND_EXPR so it can be merged with the containing
1400 if (TREE_CODE (body
) == STATEMENT_LIST
1401 && STATEMENT_LIST_HEAD (body
) == NULL
1402 && !BIND_EXPR_BODY_BLOCK (stmt
)
1403 && !BIND_EXPR_TRY_BLOCK (stmt
))
1406 BIND_EXPR_BODY (stmt
) = body
;
1408 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1409 stmt
= pop_stmt_list (stmt
);
1412 /* Destroy any ObjC "super" receivers that may have been
1414 objc_clear_super_receiver ();
1416 stmt
= do_poplevel (stmt
);
1419 /* ??? See c_end_compound_stmt wrt statement expressions. */
1423 /* Finish an asm-statement, whose components are a STRING, some
1424 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1425 LABELS. Also note whether the asm-statement should be
1426 considered volatile. */
1429 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1430 tree input_operands
, tree clobbers
, tree labels
)
1434 int ninputs
= list_length (input_operands
);
1435 int noutputs
= list_length (output_operands
);
1437 if (!processing_template_decl
)
1439 const char *constraint
;
1440 const char **oconstraints
;
1441 bool allows_mem
, allows_reg
, is_inout
;
1445 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1447 string
= resolve_asm_operand_names (string
, output_operands
,
1448 input_operands
, labels
);
1450 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1452 operand
= TREE_VALUE (t
);
1454 /* ??? Really, this should not be here. Users should be using a
1455 proper lvalue, dammit. But there's a long history of using
1456 casts in the output operands. In cases like longlong.h, this
1457 becomes a primitive form of typechecking -- if the cast can be
1458 removed, then the output operand had a type of the proper width;
1459 otherwise we'll get an error. Gross, but ... */
1460 STRIP_NOPS (operand
);
1462 operand
= mark_lvalue_use (operand
);
1464 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1465 operand
= error_mark_node
;
1467 if (operand
!= error_mark_node
1468 && (TREE_READONLY (operand
)
1469 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1470 /* Functions are not modifiable, even though they are
1472 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1473 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1474 /* If it's an aggregate and any field is const, then it is
1475 effectively const. */
1476 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1477 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1478 cxx_readonly_error (operand
, lv_asm
);
1480 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1481 oconstraints
[i
] = constraint
;
1483 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1484 &allows_mem
, &allows_reg
, &is_inout
))
1486 /* If the operand is going to end up in memory,
1487 mark it addressable. */
1488 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1489 operand
= error_mark_node
;
1492 operand
= error_mark_node
;
1494 TREE_VALUE (t
) = operand
;
1497 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1499 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1500 bool constraint_parsed
1501 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1502 oconstraints
, &allows_mem
, &allows_reg
);
1503 /* If the operand is going to end up in memory, don't call
1504 decay_conversion. */
1505 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1506 operand
= mark_lvalue_use (TREE_VALUE (t
));
1508 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1510 /* If the type of the operand hasn't been determined (e.g.,
1511 because it involves an overloaded function), then issue
1512 an error message. There's no context available to
1513 resolve the overloading. */
1514 if (TREE_TYPE (operand
) == unknown_type_node
)
1516 error ("type of asm operand %qE could not be determined",
1518 operand
= error_mark_node
;
1521 if (constraint_parsed
)
1523 /* If the operand is going to end up in memory,
1524 mark it addressable. */
1525 if (!allows_reg
&& allows_mem
)
1527 /* Strip the nops as we allow this case. FIXME, this really
1528 should be rejected or made deprecated. */
1529 STRIP_NOPS (operand
);
1530 if (!cxx_mark_addressable (operand
))
1531 operand
= error_mark_node
;
1533 else if (!allows_reg
&& !allows_mem
)
1535 /* If constraint allows neither register nor memory,
1536 try harder to get a constant. */
1537 tree constop
= maybe_constant_value (operand
);
1538 if (TREE_CONSTANT (constop
))
1543 operand
= error_mark_node
;
1545 TREE_VALUE (t
) = operand
;
1549 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1550 output_operands
, input_operands
,
1552 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1553 r
= maybe_cleanup_point_expr_void (r
);
1554 return add_stmt (r
);
1557 /* Finish a label with the indicated NAME. Returns the new label. */
1560 finish_label_stmt (tree name
)
1562 tree decl
= define_label (input_location
, name
);
1564 if (decl
== error_mark_node
)
1565 return error_mark_node
;
1567 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1572 /* Finish a series of declarations for local labels. G++ allows users
1573 to declare "local" labels, i.e., labels with scope. This extension
1574 is useful when writing code involving statement-expressions. */
1577 finish_label_decl (tree name
)
1579 if (!at_function_scope_p ())
1581 error ("__label__ declarations are only allowed in function scopes");
1585 add_decl_expr (declare_local_label (name
));
1588 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1591 finish_decl_cleanup (tree decl
, tree cleanup
)
1593 push_cleanup (decl
, cleanup
, false);
1596 /* If the current scope exits with an exception, run CLEANUP. */
1599 finish_eh_cleanup (tree cleanup
)
1601 push_cleanup (NULL
, cleanup
, true);
1604 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1605 order they were written by the user. Each node is as for
1606 emit_mem_initializers. */
1609 finish_mem_initializers (tree mem_inits
)
1611 /* Reorder the MEM_INITS so that they are in the order they appeared
1612 in the source program. */
1613 mem_inits
= nreverse (mem_inits
);
1615 if (processing_template_decl
)
1619 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1621 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1622 check for bare parameter packs in the TREE_VALUE, because
1623 any parameter packs in the TREE_VALUE have already been
1624 bound as part of the TREE_PURPOSE. See
1625 make_pack_expansion for more information. */
1626 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1627 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1628 TREE_VALUE (mem
) = error_mark_node
;
1631 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1632 CTOR_INITIALIZER
, mem_inits
));
1635 emit_mem_initializers (mem_inits
);
1638 /* Obfuscate EXPR if it looks like an id-expression or member access so
1639 that the call to finish_decltype in do_auto_deduction will give the
1643 force_paren_expr (tree expr
)
1645 /* This is only needed for decltype(auto) in C++14. */
1646 if (cxx_dialect
< cxx14
)
1649 /* If we're in unevaluated context, we can't be deducing a
1650 return/initializer type, so we don't need to mess with this. */
1651 if (cp_unevaluated_operand
)
1654 if (!DECL_P (expr
) && TREE_CODE (expr
) != COMPONENT_REF
1655 && TREE_CODE (expr
) != SCOPE_REF
)
1658 if (TREE_CODE (expr
) == COMPONENT_REF
1659 || TREE_CODE (expr
) == SCOPE_REF
)
1660 REF_PARENTHESIZED_P (expr
) = true;
1661 else if (type_dependent_expression_p (expr
))
1662 expr
= build1 (PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1663 else if (VAR_P (expr
) && DECL_HARD_REGISTER (expr
))
1664 /* We can't bind a hard register variable to a reference. */;
1667 cp_lvalue_kind kind
= lvalue_kind (expr
);
1668 if ((kind
& ~clk_class
) != clk_none
)
1670 tree type
= unlowered_expr_type (expr
);
1671 bool rval
= !!(kind
& clk_rvalueref
);
1672 type
= cp_build_reference_type (type
, rval
);
1673 /* This inhibits warnings in, eg, cxx_mark_addressable
1675 warning_sentinel
s (extra_warnings
);
1676 expr
= build_static_cast (type
, expr
, tf_error
);
1677 if (expr
!= error_mark_node
)
1678 REF_PARENTHESIZED_P (expr
) = true;
1685 /* If T is an id-expression obfuscated by force_paren_expr, undo the
1686 obfuscation and return the underlying id-expression. Otherwise
1690 maybe_undo_parenthesized_ref (tree t
)
1692 if (cxx_dialect
>= cxx14
1693 && INDIRECT_REF_P (t
)
1694 && REF_PARENTHESIZED_P (t
))
1696 t
= TREE_OPERAND (t
, 0);
1697 while (TREE_CODE (t
) == NON_LVALUE_EXPR
1698 || TREE_CODE (t
) == NOP_EXPR
)
1699 t
= TREE_OPERAND (t
, 0);
1701 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
1702 || TREE_CODE (t
) == STATIC_CAST_EXPR
);
1703 t
= TREE_OPERAND (t
, 0);
1709 /* Finish a parenthesized expression EXPR. */
1712 finish_parenthesized_expr (cp_expr expr
)
1715 /* This inhibits warnings in c_common_truthvalue_conversion. */
1716 TREE_NO_WARNING (expr
) = 1;
1718 if (TREE_CODE (expr
) == OFFSET_REF
1719 || TREE_CODE (expr
) == SCOPE_REF
)
1720 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1721 enclosed in parentheses. */
1722 PTRMEM_OK_P (expr
) = 0;
1724 if (TREE_CODE (expr
) == STRING_CST
)
1725 PAREN_STRING_LITERAL_P (expr
) = 1;
1727 expr
= cp_expr (force_paren_expr (expr
), expr
.get_location ());
1732 /* Finish a reference to a non-static data member (DECL) that is not
1733 preceded by `.' or `->'. */
1736 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1738 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1739 bool try_omp_private
= !object
&& omp_private_member_map
;
1744 tree scope
= qualifying_scope
;
1745 if (scope
== NULL_TREE
)
1746 scope
= context_for_name_lookup (decl
);
1747 object
= maybe_dummy_object (scope
, NULL
);
1750 object
= maybe_resolve_dummy (object
, true);
1751 if (object
== error_mark_node
)
1752 return error_mark_node
;
1754 /* DR 613/850: Can use non-static data members without an associated
1755 object in sizeof/decltype/alignof. */
1756 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1757 && (!processing_template_decl
|| !current_class_ref
))
1759 if (current_function_decl
1760 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1761 error ("invalid use of member %qD in static member function", decl
);
1763 error ("invalid use of non-static data member %qD", decl
);
1764 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1766 return error_mark_node
;
1769 if (current_class_ptr
)
1770 TREE_USED (current_class_ptr
) = 1;
1771 if (processing_template_decl
&& !qualifying_scope
)
1773 tree type
= TREE_TYPE (decl
);
1775 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1776 /* Quals on the object don't matter. */;
1777 else if (PACK_EXPANSION_P (type
))
1778 /* Don't bother trying to represent this. */
1782 /* Set the cv qualifiers. */
1783 int quals
= cp_type_quals (TREE_TYPE (object
));
1785 if (DECL_MUTABLE_P (decl
))
1786 quals
&= ~TYPE_QUAL_CONST
;
1788 quals
|= cp_type_quals (TREE_TYPE (decl
));
1789 type
= cp_build_qualified_type (type
, quals
);
1792 ret
= (convert_from_reference
1793 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1795 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1796 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1798 else if (processing_template_decl
)
1799 ret
= build_qualified_name (TREE_TYPE (decl
),
1802 /*template_p=*/false);
1805 tree access_type
= TREE_TYPE (object
);
1807 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1808 decl
, tf_warning_or_error
);
1810 /* If the data member was named `C::M', convert `*this' to `C'
1812 if (qualifying_scope
)
1814 tree binfo
= NULL_TREE
;
1815 object
= build_scoped_ref (object
, qualifying_scope
,
1819 ret
= build_class_member_access_expr (object
, decl
,
1820 /*access_path=*/NULL_TREE
,
1821 /*preserve_reference=*/false,
1822 tf_warning_or_error
);
1824 if (try_omp_private
)
1826 tree
*v
= omp_private_member_map
->get (decl
);
1828 ret
= convert_from_reference (*v
);
1833 /* If we are currently parsing a template and we encountered a typedef
1834 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1835 adds the typedef to a list tied to the current template.
1836 At template instantiation time, that list is walked and access check
1837 performed for each typedef.
1838 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1841 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1843 location_t location
)
1845 tree template_info
= NULL
;
1846 tree cs
= current_scope ();
1848 if (!is_typedef_decl (typedef_decl
)
1850 || !CLASS_TYPE_P (context
)
1854 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1855 template_info
= get_template_info (cs
);
1858 && TI_TEMPLATE (template_info
)
1859 && !currently_open_class (context
))
1860 append_type_to_template_for_access_check (cs
, typedef_decl
,
1864 /* DECL was the declaration to which a qualified-id resolved. Issue
1865 an error message if it is not accessible. If OBJECT_TYPE is
1866 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1867 type of `*x', or `x', respectively. If the DECL was named as
1868 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1871 check_accessibility_of_qualified_id (tree decl
,
1873 tree nested_name_specifier
)
1876 tree qualifying_type
= NULL_TREE
;
1878 /* If we are parsing a template declaration and if decl is a typedef,
1879 add it to a list tied to the template.
1880 At template instantiation time, that list will be walked and
1881 access check performed. */
1882 add_typedef_to_current_template_for_access_check (decl
,
1883 nested_name_specifier
1884 ? nested_name_specifier
1885 : DECL_CONTEXT (decl
),
1888 /* If we're not checking, return immediately. */
1889 if (deferred_access_no_check
)
1892 /* Determine the SCOPE of DECL. */
1893 scope
= context_for_name_lookup (decl
);
1894 /* If the SCOPE is not a type, then DECL is not a member. */
1895 if (!TYPE_P (scope
))
1897 /* Compute the scope through which DECL is being accessed. */
1899 /* OBJECT_TYPE might not be a class type; consider:
1901 class A { typedef int I; };
1905 In this case, we will have "A::I" as the DECL, but "I" as the
1907 && CLASS_TYPE_P (object_type
)
1908 && DERIVED_FROM_P (scope
, object_type
))
1909 /* If we are processing a `->' or `.' expression, use the type of the
1911 qualifying_type
= object_type
;
1912 else if (nested_name_specifier
)
1914 /* If the reference is to a non-static member of the
1915 current class, treat it as if it were referenced through
1918 if (DECL_NONSTATIC_MEMBER_P (decl
)
1919 && current_class_ptr
1920 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
1921 qualifying_type
= ct
;
1922 /* Otherwise, use the type indicated by the
1923 nested-name-specifier. */
1925 qualifying_type
= nested_name_specifier
;
1928 /* Otherwise, the name must be from the current class or one of
1930 qualifying_type
= currently_open_derived_class (scope
);
1933 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1934 or similar in a default argument value. */
1935 && CLASS_TYPE_P (qualifying_type
)
1936 && !dependent_type_p (qualifying_type
))
1937 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1938 decl
, tf_warning_or_error
);
1941 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1942 class named to the left of the "::" operator. DONE is true if this
1943 expression is a complete postfix-expression; it is false if this
1944 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1945 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1946 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1947 is true iff this qualified name appears as a template argument. */
1950 finish_qualified_id_expr (tree qualifying_class
,
1955 bool template_arg_p
,
1956 tsubst_flags_t complain
)
1958 gcc_assert (TYPE_P (qualifying_class
));
1960 if (error_operand_p (expr
))
1961 return error_mark_node
;
1963 if ((DECL_P (expr
) || BASELINK_P (expr
))
1964 && !mark_used (expr
, complain
))
1965 return error_mark_node
;
1969 if (TREE_CODE (expr
) == UNBOUND_CLASS_TEMPLATE
)
1970 /* cp_parser_lookup_name thought we were looking for a type,
1971 but we're actually looking for a declaration. */
1972 expr
= build_qualified_name (/*type*/NULL_TREE
,
1973 TYPE_CONTEXT (expr
),
1974 TYPE_IDENTIFIER (expr
),
1975 /*template_p*/true);
1977 check_template_keyword (expr
);
1980 /* If EXPR occurs as the operand of '&', use special handling that
1981 permits a pointer-to-member. */
1982 if (address_p
&& done
)
1984 if (TREE_CODE (expr
) == SCOPE_REF
)
1985 expr
= TREE_OPERAND (expr
, 1);
1986 expr
= build_offset_ref (qualifying_class
, expr
,
1987 /*address_p=*/true, complain
);
1991 /* No need to check access within an enum. */
1992 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
)
1995 /* Within the scope of a class, turn references to non-static
1996 members into expression of the form "this->...". */
1998 /* But, within a template argument, we do not want make the
1999 transformation, as there is no "this" pointer. */
2001 else if (TREE_CODE (expr
) == FIELD_DECL
)
2003 push_deferring_access_checks (dk_no_check
);
2004 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
2006 pop_deferring_access_checks ();
2008 else if (BASELINK_P (expr
) && !processing_template_decl
)
2010 /* See if any of the functions are non-static members. */
2011 /* If so, the expression may be relative to 'this'. */
2012 if (!shared_member_p (expr
)
2013 && current_class_ptr
2014 && DERIVED_FROM_P (qualifying_class
,
2015 current_nonlambda_class_type ()))
2016 expr
= (build_class_member_access_expr
2017 (maybe_dummy_object (qualifying_class
, NULL
),
2019 BASELINK_ACCESS_BINFO (expr
),
2020 /*preserve_reference=*/false,
2023 /* The expression is a qualified name whose address is not
2025 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
2028 else if (BASELINK_P (expr
))
2032 /* In a template, return a SCOPE_REF for most qualified-ids
2033 so that we can check access at instantiation time. But if
2034 we're looking at a member of the current instantiation, we
2035 know we have access and building up the SCOPE_REF confuses
2036 non-type template argument handling. */
2037 if (processing_template_decl
2038 && !currently_open_class (qualifying_class
))
2039 expr
= build_qualified_name (TREE_TYPE (expr
),
2040 qualifying_class
, expr
,
2043 expr
= convert_from_reference (expr
);
2049 /* Begin a statement-expression. The value returned must be passed to
2050 finish_stmt_expr. */
2053 begin_stmt_expr (void)
2055 return push_stmt_list ();
2058 /* Process the final expression of a statement expression. EXPR can be
2059 NULL, if the final expression is empty. Return a STATEMENT_LIST
2060 containing all the statements in the statement-expression, or
2061 ERROR_MARK_NODE if there was an error. */
2064 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2066 if (error_operand_p (expr
))
2068 /* The type of the statement-expression is the type of the last
2070 TREE_TYPE (stmt_expr
) = error_mark_node
;
2071 return error_mark_node
;
2074 /* If the last statement does not have "void" type, then the value
2075 of the last statement is the value of the entire expression. */
2078 tree type
= TREE_TYPE (expr
);
2080 if (processing_template_decl
)
2082 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2083 expr
= add_stmt (expr
);
2084 /* Mark the last statement so that we can recognize it as such at
2085 template-instantiation time. */
2086 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2088 else if (VOID_TYPE_P (type
))
2090 /* Just treat this like an ordinary statement. */
2091 expr
= finish_expr_stmt (expr
);
2095 /* It actually has a value we need to deal with. First, force it
2096 to be an rvalue so that we won't need to build up a copy
2097 constructor call later when we try to assign it to something. */
2098 expr
= force_rvalue (expr
, tf_warning_or_error
);
2099 if (error_operand_p (expr
))
2100 return error_mark_node
;
2102 /* Update for array-to-pointer decay. */
2103 type
= TREE_TYPE (expr
);
2105 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2106 normal statement, but don't convert to void or actually add
2108 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2109 expr
= maybe_cleanup_point_expr (expr
);
2113 /* The type of the statement-expression is the type of the last
2115 TREE_TYPE (stmt_expr
) = type
;
2121 /* Finish a statement-expression. EXPR should be the value returned
2122 by the previous begin_stmt_expr. Returns an expression
2123 representing the statement-expression. */
2126 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2131 if (error_operand_p (stmt_expr
))
2133 pop_stmt_list (stmt_expr
);
2134 return error_mark_node
;
2137 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2139 type
= TREE_TYPE (stmt_expr
);
2140 result
= pop_stmt_list (stmt_expr
);
2141 TREE_TYPE (result
) = type
;
2143 if (processing_template_decl
)
2145 result
= build_min (STMT_EXPR
, type
, result
);
2146 TREE_SIDE_EFFECTS (result
) = 1;
2147 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2149 else if (CLASS_TYPE_P (type
))
2151 /* Wrap the statement-expression in a TARGET_EXPR so that the
2152 temporary object created by the final expression is destroyed at
2153 the end of the full-expression containing the
2154 statement-expression. */
2155 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2161 /* Returns the expression which provides the value of STMT_EXPR. */
2164 stmt_expr_value_expr (tree stmt_expr
)
2166 tree t
= STMT_EXPR_STMT (stmt_expr
);
2168 if (TREE_CODE (t
) == BIND_EXPR
)
2169 t
= BIND_EXPR_BODY (t
);
2171 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2172 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2174 if (TREE_CODE (t
) == EXPR_STMT
)
2175 t
= EXPR_STMT_EXPR (t
);
2180 /* Return TRUE iff EXPR_STMT is an empty list of
2181 expression statements. */
2184 empty_expr_stmt_p (tree expr_stmt
)
2186 tree body
= NULL_TREE
;
2188 if (expr_stmt
== void_node
)
2193 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2194 body
= EXPR_STMT_EXPR (expr_stmt
);
2195 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2201 if (TREE_CODE (body
) == STATEMENT_LIST
)
2202 return tsi_end_p (tsi_start (body
));
2204 return empty_expr_stmt_p (body
);
2209 /* Perform Koenig lookup. FN is the postfix-expression representing
2210 the function (or functions) to call; ARGS are the arguments to the
2211 call. Returns the functions to be considered by overload resolution. */
2214 perform_koenig_lookup (cp_expr fn
, vec
<tree
, va_gc
> *args
,
2215 tsubst_flags_t complain
)
2217 tree identifier
= NULL_TREE
;
2218 tree functions
= NULL_TREE
;
2219 tree tmpl_args
= NULL_TREE
;
2220 bool template_id
= false;
2221 location_t loc
= fn
.get_location ();
2223 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2225 /* Use a separate flag to handle null args. */
2227 tmpl_args
= TREE_OPERAND (fn
, 1);
2228 fn
= TREE_OPERAND (fn
, 0);
2231 /* Find the name of the overloaded function. */
2232 if (identifier_p (fn
))
2234 else if (is_overloaded_fn (fn
))
2237 identifier
= DECL_NAME (get_first_fn (functions
));
2239 else if (DECL_P (fn
))
2242 identifier
= DECL_NAME (fn
);
2245 /* A call to a namespace-scope function using an unqualified name.
2247 Do Koenig lookup -- unless any of the arguments are
2249 if (!any_type_dependent_arguments_p (args
)
2250 && !any_dependent_template_arguments_p (tmpl_args
))
2252 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2255 /* The unqualified name could not be resolved. */
2256 if (complain
& tf_error
)
2257 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2263 if (fn
&& template_id
&& fn
!= error_mark_node
)
2264 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2269 /* Generate an expression for `FN (ARGS)'. This may change the
2272 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2273 as a virtual call, even if FN is virtual. (This flag is set when
2274 encountering an expression where the function name is explicitly
2275 qualified. For example a call to `X::f' never generates a virtual
2278 Returns code for the call. */
2281 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2282 bool koenig_p
, tsubst_flags_t complain
)
2286 vec
<tree
, va_gc
> *orig_args
= NULL
;
2288 if (fn
== error_mark_node
)
2289 return error_mark_node
;
2291 gcc_assert (!TYPE_P (fn
));
2293 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2294 it so that we can tell this is a call to a known function. */
2295 fn
= maybe_undo_parenthesized_ref (fn
);
2299 if (processing_template_decl
)
2301 /* If the call expression is dependent, build a CALL_EXPR node
2302 with no type; type_dependent_expression_p recognizes
2303 expressions with no type as being dependent. */
2304 if (type_dependent_expression_p (fn
)
2305 || any_type_dependent_arguments_p (*args
))
2307 result
= build_nt_call_vec (fn
, *args
);
2308 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2309 KOENIG_LOOKUP_P (result
) = koenig_p
;
2314 tree fndecl
= OVL_CURRENT (fn
);
2315 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2316 || !TREE_THIS_VOLATILE (fndecl
))
2322 current_function_returns_abnormally
= 1;
2326 orig_args
= make_tree_vector_copy (*args
);
2327 if (!BASELINK_P (fn
)
2328 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2329 && TREE_TYPE (fn
) != unknown_type_node
)
2330 fn
= build_non_dependent_expr (fn
);
2331 make_args_non_dependent (*args
);
2334 if (TREE_CODE (fn
) == COMPONENT_REF
)
2336 tree member
= TREE_OPERAND (fn
, 1);
2337 if (BASELINK_P (member
))
2339 tree object
= TREE_OPERAND (fn
, 0);
2340 return build_new_method_call (object
, member
,
2343 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2350 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2351 if (TREE_CODE (fn
) == ADDR_EXPR
2352 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2353 fn
= TREE_OPERAND (fn
, 0);
2355 if (is_overloaded_fn (fn
))
2356 fn
= baselink_for_fns (fn
);
2359 if (BASELINK_P (fn
))
2363 /* A call to a member function. From [over.call.func]:
2365 If the keyword this is in scope and refers to the class of
2366 that member function, or a derived class thereof, then the
2367 function call is transformed into a qualified function call
2368 using (*this) as the postfix-expression to the left of the
2369 . operator.... [Otherwise] a contrived object of type T
2370 becomes the implied object argument.
2374 struct A { void f(); };
2375 struct B : public A {};
2376 struct C : public A { void g() { B::f(); }};
2378 "the class of that member function" refers to `A'. But 11.2
2379 [class.access.base] says that we need to convert 'this' to B* as
2380 part of the access, so we pass 'B' to maybe_dummy_object. */
2382 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2384 /* A constructor call always uses a dummy object. (This constructor
2385 call which has the form A::A () is actually invalid and we are
2386 going to reject it later in build_new_method_call.) */
2387 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2390 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2393 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2395 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2400 else if (is_overloaded_fn (fn
))
2402 /* If the function is an overloaded builtin, resolve it. */
2403 if (TREE_CODE (fn
) == FUNCTION_DECL
2404 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2405 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2406 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2410 if (warn_sizeof_pointer_memaccess
2411 && (complain
& tf_warning
)
2412 && !vec_safe_is_empty (*args
)
2413 && !processing_template_decl
)
2415 location_t sizeof_arg_loc
[3];
2418 for (i
= 0; i
< 3; i
++)
2422 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2423 sizeof_arg
[i
] = NULL_TREE
;
2424 if (i
>= (*args
)->length ())
2427 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2429 if (SIZEOF_EXPR_TYPE_P (t
))
2430 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2432 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2433 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2435 sizeof_pointer_memaccess_warning
2436 (sizeof_arg_loc
, fn
, *args
,
2437 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2440 /* A call to a namespace-scope function. */
2441 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2444 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2446 if (!vec_safe_is_empty (*args
))
2447 error ("arguments to destructor are not allowed");
2448 /* Mark the pseudo-destructor call as having side-effects so
2449 that we do not issue warnings about its use. */
2450 result
= build1 (NOP_EXPR
,
2452 TREE_OPERAND (fn
, 0));
2453 TREE_SIDE_EFFECTS (result
) = 1;
2455 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2456 /* If the "function" is really an object of class type, it might
2457 have an overloaded `operator ()'. */
2458 result
= build_op_call (fn
, args
, complain
);
2461 /* A call where the function is unknown. */
2462 result
= cp_build_function_call_vec (fn
, args
, complain
);
2464 if (processing_template_decl
&& result
!= error_mark_node
)
2466 if (INDIRECT_REF_P (result
))
2467 result
= TREE_OPERAND (result
, 0);
2468 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2469 SET_EXPR_LOCATION (result
, input_location
);
2470 KOENIG_LOOKUP_P (result
) = koenig_p
;
2471 release_tree_vector (orig_args
);
2472 result
= convert_from_reference (result
);
2477 /* Free garbage OVERLOADs from arg-dependent lookup. */
2478 tree next
= NULL_TREE
;
2480 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2483 if (processing_template_decl
)
2484 /* In a template, we'll re-use them at instantiation time. */
2485 OVL_ARG_DEPENDENT (fn
) = false;
2488 next
= OVL_CHAIN (fn
);
2497 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2498 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2499 POSTDECREMENT_EXPR.) */
2502 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2504 /* input_location holds the location of the trailing operator token.
2505 Build a location of the form:
2508 with the caret at the operator token, ranging from the start
2509 of EXPR to the end of the operator token. */
2510 location_t combined_loc
= make_location (input_location
,
2512 get_finish (input_location
));
2513 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2514 tf_warning_or_error
);
2515 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2516 result
.set_location (combined_loc
);
2520 /* Finish a use of `this'. Returns an expression for `this'. */
2523 finish_this_expr (void)
2525 tree result
= NULL_TREE
;
2527 if (current_class_ptr
)
2529 tree type
= TREE_TYPE (current_class_ref
);
2531 /* In a lambda expression, 'this' refers to the captured 'this'. */
2532 if (LAMBDA_TYPE_P (type
))
2533 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2535 result
= current_class_ptr
;
2539 /* The keyword 'this' is a prvalue expression. */
2540 return rvalue (result
);
2542 tree fn
= current_nonlambda_function ();
2543 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2544 error ("%<this%> is unavailable for static member functions");
2546 error ("invalid use of %<this%> in non-member function");
2548 error ("invalid use of %<this%> at top level");
2549 return error_mark_node
;
2552 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2553 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2554 the TYPE for the type given. If SCOPE is non-NULL, the expression
2555 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2558 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2561 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2562 return error_mark_node
;
2564 gcc_assert (TYPE_P (destructor
));
2566 if (!processing_template_decl
)
2568 if (scope
== error_mark_node
)
2570 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2571 return error_mark_node
;
2573 if (is_auto (destructor
))
2574 destructor
= TREE_TYPE (object
);
2575 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2578 "qualified type %qT does not match destructor name ~%qT",
2580 return error_mark_node
;
2584 /* [expr.pseudo] says both:
2586 The type designated by the pseudo-destructor-name shall be
2587 the same as the object type.
2591 The cv-unqualified versions of the object type and of the
2592 type designated by the pseudo-destructor-name shall be the
2595 We implement the more generous second sentence, since that is
2596 what most other compilers do. */
2597 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2600 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2601 return error_mark_node
;
2605 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2609 /* Finish an expression of the form CODE EXPR. */
2612 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2613 tsubst_flags_t complain
)
2615 /* Build a location of the form:
2618 with the caret at the operator token, ranging from the start
2619 of the operator token to the end of EXPR. */
2620 location_t combined_loc
= make_location (op_loc
,
2621 op_loc
, expr
.get_finish ());
2622 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2623 /* TODO: build_x_unary_op doesn't always honor the location. */
2624 result
.set_location (combined_loc
);
2626 tree result_ovl
, expr_ovl
;
2628 if (!(complain
& tf_warning
))
2631 result_ovl
= result
;
2634 if (!processing_template_decl
)
2635 expr_ovl
= cp_fully_fold (expr_ovl
);
2637 if (!CONSTANT_CLASS_P (expr_ovl
)
2638 || TREE_OVERFLOW_P (expr_ovl
))
2641 if (!processing_template_decl
)
2642 result_ovl
= cp_fully_fold (result_ovl
);
2644 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2645 overflow_warning (combined_loc
, result_ovl
);
2650 /* Finish a compound-literal expression. TYPE is the type to which
2651 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2654 finish_compound_literal (tree type
, tree compound_literal
,
2655 tsubst_flags_t complain
)
2657 if (type
== error_mark_node
)
2658 return error_mark_node
;
2660 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2663 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2665 return cp_build_c_cast (type
, compound_literal
, complain
);
2668 if (!TYPE_OBJ_P (type
))
2670 if (complain
& tf_error
)
2671 error ("compound literal of non-object type %qT", type
);
2672 return error_mark_node
;
2675 if (tree anode
= type_uses_auto (type
))
2676 if (CLASS_PLACEHOLDER_TEMPLATE (anode
))
2677 type
= do_auto_deduction (type
, compound_literal
, anode
, complain
,
2680 if (processing_template_decl
)
2682 TREE_TYPE (compound_literal
) = type
;
2683 /* Mark the expression as a compound literal. */
2684 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2685 return compound_literal
;
2688 type
= complete_type (type
);
2690 if (TYPE_NON_AGGREGATE_CLASS (type
))
2692 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2693 everywhere that deals with function arguments would be a pain, so
2694 just wrap it in a TREE_LIST. The parser set a flag so we know
2695 that it came from T{} rather than T({}). */
2696 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2697 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2698 return build_functional_cast (type
, compound_literal
, complain
);
2701 if (TREE_CODE (type
) == ARRAY_TYPE
2702 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2703 return error_mark_node
;
2704 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2705 if (SCALAR_TYPE_P (type
)
2706 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2707 && !check_narrowing (type
, compound_literal
, complain
))
2708 return error_mark_node
;
2709 if (TREE_CODE (type
) == ARRAY_TYPE
2710 && TYPE_DOMAIN (type
) == NULL_TREE
)
2712 cp_complete_array_type_or_error (&type
, compound_literal
,
2714 if (type
== error_mark_node
)
2715 return error_mark_node
;
2717 compound_literal
= digest_init_flags (type
, compound_literal
, LOOKUP_NORMAL
,
2719 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2720 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2722 /* Put static/constant array temporaries in static variables. */
2723 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2724 && TREE_CODE (type
) == ARRAY_TYPE
2725 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2726 && initializer_constant_valid_p (compound_literal
, type
))
2728 tree decl
= create_temporary_var (type
);
2729 DECL_INITIAL (decl
) = compound_literal
;
2730 TREE_STATIC (decl
) = 1;
2731 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2733 /* 5.19 says that a constant expression can include an
2734 lvalue-rvalue conversion applied to "a glvalue of literal type
2735 that refers to a non-volatile temporary object initialized
2736 with a constant expression". Rather than try to communicate
2737 that this VAR_DECL is a temporary, just mark it constexpr. */
2738 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2739 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2740 TREE_CONSTANT (decl
) = true;
2742 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2743 decl
= pushdecl_top_level (decl
);
2744 DECL_NAME (decl
) = make_anon_name ();
2745 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2746 /* Make sure the destructor is callable. */
2747 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2748 if (clean
== error_mark_node
)
2749 return error_mark_node
;
2753 /* Represent other compound literals with TARGET_EXPR so we produce
2754 an lvalue, but can elide copies. */
2755 if (!VECTOR_TYPE_P (type
))
2756 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2758 return compound_literal
;
2761 /* Return the declaration for the function-name variable indicated by
2765 finish_fname (tree id
)
2769 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2770 if (processing_template_decl
&& current_function_decl
2771 && decl
!= error_mark_node
)
2772 decl
= DECL_NAME (decl
);
2776 /* Finish a translation unit. */
2779 finish_translation_unit (void)
2781 /* In case there were missing closebraces,
2782 get us back to the global binding level. */
2784 while (current_namespace
!= global_namespace
)
2787 /* Do file scope __FUNCTION__ et al. */
2788 finish_fname_decls ();
2791 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2792 Returns the parameter. */
2795 finish_template_type_parm (tree aggr
, tree identifier
)
2797 if (aggr
!= class_type_node
)
2799 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2800 aggr
= class_type_node
;
2803 return build_tree_list (aggr
, identifier
);
2806 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2807 Returns the parameter. */
2810 finish_template_template_parm (tree aggr
, tree identifier
)
2812 tree decl
= build_decl (input_location
,
2813 TYPE_DECL
, identifier
, NULL_TREE
);
2815 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2816 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2817 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2818 DECL_ARTIFICIAL (decl
) = 1;
2820 // Associate the constraints with the underlying declaration,
2821 // not the template.
2822 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2823 tree constr
= build_constraints (reqs
, NULL_TREE
);
2824 set_constraints (decl
, constr
);
2826 end_template_decl ();
2828 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2830 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2831 /*is_primary=*/true, /*is_partial=*/false,
2834 return finish_template_type_parm (aggr
, tmpl
);
2837 /* ARGUMENT is the default-argument value for a template template
2838 parameter. If ARGUMENT is invalid, issue error messages and return
2839 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2842 check_template_template_default_arg (tree argument
)
2844 if (TREE_CODE (argument
) != TEMPLATE_DECL
2845 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2846 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2848 if (TREE_CODE (argument
) == TYPE_DECL
)
2849 error ("invalid use of type %qT as a default value for a template "
2850 "template-parameter", TREE_TYPE (argument
));
2852 error ("invalid default argument for a template template parameter");
2853 return error_mark_node
;
2859 /* Begin a class definition, as indicated by T. */
2862 begin_class_definition (tree t
)
2864 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2865 return error_mark_node
;
2867 if (processing_template_parmlist
)
2869 error ("definition of %q#T inside template parameter list", t
);
2870 return error_mark_node
;
2873 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2874 are passed the same as decimal scalar types. */
2875 if (TREE_CODE (t
) == RECORD_TYPE
2876 && !processing_template_decl
)
2878 tree ns
= TYPE_CONTEXT (t
);
2879 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2880 && DECL_CONTEXT (ns
) == std_node
2882 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2884 const char *n
= TYPE_NAME_STRING (t
);
2885 if ((strcmp (n
, "decimal32") == 0)
2886 || (strcmp (n
, "decimal64") == 0)
2887 || (strcmp (n
, "decimal128") == 0))
2888 TYPE_TRANSPARENT_AGGR (t
) = 1;
2892 /* A non-implicit typename comes from code like:
2894 template <typename T> struct A {
2895 template <typename U> struct A<T>::B ...
2897 This is erroneous. */
2898 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2900 error ("invalid definition of qualified type %qT", t
);
2901 t
= error_mark_node
;
2904 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2906 t
= make_class_type (RECORD_TYPE
);
2907 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2910 if (TYPE_BEING_DEFINED (t
))
2912 t
= make_class_type (TREE_CODE (t
));
2913 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2915 maybe_process_partial_specialization (t
);
2917 TYPE_BEING_DEFINED (t
) = 1;
2918 class_binding_level
->defining_class_p
= 1;
2920 if (flag_pack_struct
)
2923 TYPE_PACKED (t
) = 1;
2924 /* Even though the type is being defined for the first time
2925 here, there might have been a forward declaration, so there
2926 might be cv-qualified variants of T. */
2927 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2928 TYPE_PACKED (v
) = 1;
2930 /* Reset the interface data, at the earliest possible
2931 moment, as it might have been set via a class foo;
2933 if (! TYPE_UNNAMED_P (t
))
2935 struct c_fileinfo
*finfo
= \
2936 get_fileinfo (LOCATION_FILE (input_location
));
2937 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2938 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2939 (t
, finfo
->interface_unknown
);
2941 reset_specialization();
2943 /* Make a declaration for this class in its own scope. */
2944 build_self_reference ();
2949 /* Finish the member declaration given by DECL. */
2952 finish_member_declaration (tree decl
)
2954 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2957 if (decl
== void_type_node
)
2958 /* The COMPONENT was a friend, not a member, and so there's
2959 nothing for us to do. */
2962 /* We should see only one DECL at a time. */
2963 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2965 /* Don't add decls after definition. */
2966 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
2967 /* We can add lambda types when late parsing default
2969 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
2971 /* Set up access control for DECL. */
2973 = (current_access_specifier
== access_private_node
);
2974 TREE_PROTECTED (decl
)
2975 = (current_access_specifier
== access_protected_node
);
2976 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2978 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2979 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2982 /* Mark the DECL as a member of the current class, unless it's
2983 a member of an enumeration. */
2984 if (TREE_CODE (decl
) != CONST_DECL
)
2985 DECL_CONTEXT (decl
) = current_class_type
;
2987 /* Check for bare parameter packs in the member variable declaration. */
2988 if (TREE_CODE (decl
) == FIELD_DECL
)
2990 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2991 TREE_TYPE (decl
) = error_mark_node
;
2992 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2993 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2998 A C language linkage is ignored for the names of class members
2999 and the member function type of class member functions. */
3000 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
3001 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3003 /* Put functions on the TYPE_METHODS list and everything else on the
3004 TYPE_FIELDS list. Note that these are built up in reverse order.
3005 We reverse them (to obtain declaration order) in finish_struct. */
3006 if (DECL_DECLARES_FUNCTION_P (decl
))
3008 /* We also need to add this function to the
3009 CLASSTYPE_METHOD_VEC. */
3010 if (add_method (current_class_type
, decl
, NULL_TREE
))
3012 gcc_assert (TYPE_MAIN_VARIANT (current_class_type
) == current_class_type
);
3013 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
3014 TYPE_METHODS (current_class_type
) = decl
;
3016 maybe_add_class_template_decl_list (current_class_type
, decl
,
3020 /* Enter the DECL into the scope of the class, if the class
3021 isn't a closure (whose fields are supposed to be unnamed). */
3022 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3023 || pushdecl_class_level (decl
))
3025 if (TREE_CODE (decl
) == USING_DECL
)
3027 /* For now, ignore class-scope USING_DECLS, so that
3028 debugging backends do not see them. */
3029 DECL_IGNORED_P (decl
) = 1;
3032 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3033 go at the beginning. The reason is that lookup_field_1
3034 searches the list in order, and we want a field name to
3035 override a type name so that the "struct stat hack" will
3036 work. In particular:
3038 struct S { enum E { }; int E } s;
3041 is valid. In addition, the FIELD_DECLs must be maintained in
3042 declaration order so that class layout works as expected.
3043 However, we don't need that order until class layout, so we
3044 save a little time by putting FIELD_DECLs on in reverse order
3045 here, and then reversing them in finish_struct_1. (We could
3046 also keep a pointer to the correct insertion points in the
3049 if (TREE_CODE (decl
) == TYPE_DECL
)
3050 TYPE_FIELDS (current_class_type
)
3051 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3054 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3055 TYPE_FIELDS (current_class_type
) = decl
;
3058 maybe_add_class_template_decl_list (current_class_type
, decl
,
3063 /* Finish processing a complete template declaration. The PARMS are
3064 the template parameters. */
3067 finish_template_decl (tree parms
)
3070 end_template_decl ();
3072 end_specialization ();
3075 // Returns the template type of the class scope being entered. If we're
3076 // entering a constrained class scope. TYPE is the class template
3077 // scope being entered and we may need to match the intended type with
3078 // a constrained specialization. For example:
3080 // template<Object T>
3081 // struct S { void f(); }; #1
3083 // template<Object T>
3084 // void S<T>::f() { } #2
3086 // We check, in #2, that S<T> refers precisely to the type declared by
3087 // #1 (i.e., that the constraints match). Note that the following should
3088 // be an error since there is no specialization of S<T> that is
3089 // unconstrained, but this is not diagnosed here.
3091 // template<typename T>
3092 // void S<T>::f() { }
3094 // We cannot diagnose this problem here since this function also matches
3095 // qualified template names that are not part of a definition. For example:
3097 // template<Integral T, Floating_point U>
3098 // typename pair<T, U>::first_type void f(T, U);
3100 // Here, it is unlikely that there is a partial specialization of
3101 // pair constrained for for Integral and Floating_point arguments.
3103 // The general rule is: if a constrained specialization with matching
3104 // constraints is found return that type. Also note that if TYPE is not a
3105 // class-type (e.g. a typename type), then no fixup is needed.
3108 fixup_template_type (tree type
)
3110 // Find the template parameter list at the a depth appropriate to
3111 // the scope we're trying to enter.
3112 tree parms
= current_template_parms
;
3113 int depth
= template_class_depth (type
);
3114 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3115 parms
= TREE_CHAIN (parms
);
3118 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3119 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3121 // Search for a specialization whose type and constraints match.
3122 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3123 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3126 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3128 // If the type and constraints match a specialization, then we
3129 // are entering that type.
3130 if (same_type_p (type
, TREE_TYPE (specs
))
3131 && equivalent_constraints (cur_constr
, spec_constr
))
3132 return TREE_TYPE (specs
);
3133 specs
= TREE_CHAIN (specs
);
3136 // If no specialization matches, then must return the type
3137 // previously found.
3141 /* Finish processing a template-id (which names a type) of the form
3142 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3143 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3144 the scope of template-id indicated. */
3147 finish_template_type (tree name
, tree args
, int entering_scope
)
3151 type
= lookup_template_class (name
, args
,
3152 NULL_TREE
, NULL_TREE
, entering_scope
,
3153 tf_warning_or_error
| tf_user
);
3155 /* If we might be entering the scope of a partial specialization,
3156 find the one with the right constraints. */
3159 && CLASS_TYPE_P (type
)
3160 && dependent_type_p (type
)
3161 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3162 type
= fixup_template_type (type
);
3164 if (type
== error_mark_node
)
3166 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3167 return TYPE_STUB_DECL (type
);
3169 return TYPE_NAME (type
);
3172 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3173 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3174 BASE_CLASS, or NULL_TREE if an error occurred. The
3175 ACCESS_SPECIFIER is one of
3176 access_{default,public,protected_private}_node. For a virtual base
3177 we set TREE_TYPE. */
3180 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3184 if (base
== error_mark_node
)
3186 error ("invalid base-class specification");
3189 else if (! MAYBE_CLASS_TYPE_P (base
))
3191 error ("%qT is not a class type", base
);
3196 if (cp_type_quals (base
) != 0)
3198 /* DR 484: Can a base-specifier name a cv-qualified
3200 base
= TYPE_MAIN_VARIANT (base
);
3202 result
= build_tree_list (access
, base
);
3204 TREE_TYPE (result
) = integer_type_node
;
3210 /* If FNS is a member function, a set of member functions, or a
3211 template-id referring to one or more member functions, return a
3212 BASELINK for FNS, incorporating the current access context.
3213 Otherwise, return FNS unchanged. */
3216 baselink_for_fns (tree fns
)
3221 if (BASELINK_P (fns
)
3222 || error_operand_p (fns
))
3225 scope
= ovl_scope (fns
);
3226 if (!CLASS_TYPE_P (scope
))
3229 cl
= currently_open_derived_class (scope
);
3232 cl
= TYPE_BINFO (cl
);
3233 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3236 /* Returns true iff DECL is a variable from a function outside
3240 outer_var_p (tree decl
)
3242 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3243 && DECL_FUNCTION_SCOPE_P (decl
)
3244 && (DECL_CONTEXT (decl
) != current_function_decl
3245 || parsing_nsdmi ()));
3248 /* As above, but also checks that DECL is automatic. */
3251 outer_automatic_var_p (tree decl
)
3253 return (outer_var_p (decl
)
3254 && !TREE_STATIC (decl
));
3257 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3258 rewrite it for lambda capture. */
3261 process_outer_var_ref (tree decl
, tsubst_flags_t complain
)
3263 if (cp_unevaluated_operand
)
3264 /* It's not a use (3.2) if we're in an unevaluated context. */
3266 if (decl
== error_mark_node
)
3269 tree context
= DECL_CONTEXT (decl
);
3270 tree containing_function
= current_function_decl
;
3271 tree lambda_stack
= NULL_TREE
;
3272 tree lambda_expr
= NULL_TREE
;
3273 tree initializer
= convert_from_reference (decl
);
3275 /* Mark it as used now even if the use is ill-formed. */
3276 if (!mark_used (decl
, complain
))
3277 return error_mark_node
;
3279 bool saw_generic_lambda
= false;
3280 if (parsing_nsdmi ())
3281 containing_function
= NULL_TREE
;
3283 /* If we are in a lambda function, we can move out until we hit
3285 2. a non-lambda function, or
3286 3. a non-default capturing lambda function. */
3287 while (context
!= containing_function
3288 /* containing_function can be null with invalid generic lambdas. */
3289 && containing_function
3290 && LAMBDA_FUNCTION_P (containing_function
))
3292 tree closure
= DECL_CONTEXT (containing_function
);
3293 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3295 if (generic_lambda_fn_p (containing_function
))
3296 saw_generic_lambda
= true;
3298 if (TYPE_CLASS_SCOPE_P (closure
))
3299 /* A lambda in an NSDMI (c++/64496). */
3302 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3306 lambda_stack
= tree_cons (NULL_TREE
,
3311 = decl_function_context (containing_function
);
3314 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3315 support for an approach in which a reference to a local
3316 [constant] automatic variable in a nested class or lambda body
3317 would enter the expression as an rvalue, which would reduce
3318 the complexity of the problem"
3320 FIXME update for final resolution of core issue 696. */
3321 if (decl_maybe_constant_var_p (decl
))
3323 if (processing_template_decl
&& !saw_generic_lambda
)
3324 /* In a non-generic lambda within a template, wait until instantiation
3325 time to decide whether to capture. For a generic lambda, we can't
3326 wait until we instantiate the op() because the closure class is
3327 already defined at that point. FIXME to get the semantics exactly
3328 right we need to partially-instantiate the lambda body so the only
3329 dependencies left are on the generic parameters themselves. This
3330 probably means moving away from our current model of lambdas in
3331 templates (instantiating the closure type) to one based on creating
3332 the closure type when instantiating the lambda context. That is
3333 probably also the way to handle lambdas within pack expansions. */
3335 else if (decl_constant_var_p (decl
))
3337 tree t
= maybe_constant_value (convert_from_reference (decl
));
3338 if (TREE_CONSTANT (t
))
3343 if (lambda_expr
&& VAR_P (decl
)
3344 && DECL_ANON_UNION_VAR_P (decl
))
3346 if (complain
& tf_error
)
3347 error ("cannot capture member %qD of anonymous union", decl
);
3348 return error_mark_node
;
3350 if (context
== containing_function
)
3352 decl
= add_default_capture (lambda_stack
,
3353 /*id=*/DECL_NAME (decl
),
3356 else if (lambda_expr
)
3358 if (complain
& tf_error
)
3360 error ("%qD is not captured", decl
);
3361 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3362 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3364 inform (location_of (closure
),
3365 "the lambda has no capture-default");
3366 else if (TYPE_CLASS_SCOPE_P (closure
))
3367 inform (0, "lambda in local class %q+T cannot "
3368 "capture variables from the enclosing context",
3369 TYPE_CONTEXT (closure
));
3370 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3372 return error_mark_node
;
3376 if (complain
& tf_error
)
3379 ? G_("use of local variable with automatic storage from "
3380 "containing function")
3381 : G_("use of parameter from containing function"));
3382 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3384 return error_mark_node
;
3389 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3390 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3391 if non-NULL, is the type or namespace used to explicitly qualify
3392 ID_EXPRESSION. DECL is the entity to which that name has been
3395 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3396 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3397 be set to true if this expression isn't permitted in a
3398 constant-expression, but it is otherwise not set by this function.
3399 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3400 constant-expression, but a non-constant expression is also
3403 DONE is true if this expression is a complete postfix-expression;
3404 it is false if this expression is followed by '->', '[', '(', etc.
3405 ADDRESS_P is true iff this expression is the operand of '&'.
3406 TEMPLATE_P is true iff the qualified-id was of the form
3407 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3408 appears as a template argument.
3410 If an error occurs, and it is the kind of error that might cause
3411 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3412 is the caller's responsibility to issue the message. *ERROR_MSG
3413 will be a string with static storage duration, so the caller need
3416 Return an expression for the entity, after issuing appropriate
3417 diagnostics. This function is also responsible for transforming a
3418 reference to a non-static member into a COMPONENT_REF that makes
3419 the use of "this" explicit.
3421 Upon return, *IDK will be filled in appropriately. */
3423 finish_id_expression (tree id_expression
,
3427 bool integral_constant_expression_p
,
3428 bool allow_non_integral_constant_expression_p
,
3429 bool *non_integral_constant_expression_p
,
3433 bool template_arg_p
,
3434 const char **error_msg
,
3435 location_t location
)
3437 decl
= strip_using_decl (decl
);
3439 /* Initialize the output parameters. */
3440 *idk
= CP_ID_KIND_NONE
;
3443 if (id_expression
== error_mark_node
)
3444 return error_mark_node
;
3445 /* If we have a template-id, then no further lookup is
3446 required. If the template-id was for a template-class, we
3447 will sometimes have a TYPE_DECL at this point. */
3448 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3449 || TREE_CODE (decl
) == TYPE_DECL
)
3451 /* Look up the name. */
3454 if (decl
== error_mark_node
)
3456 /* Name lookup failed. */
3459 || (!dependent_type_p (scope
)
3460 && !(identifier_p (id_expression
)
3461 && IDENTIFIER_TYPENAME_P (id_expression
)
3462 && dependent_type_p (TREE_TYPE (id_expression
))))))
3464 /* If the qualifying type is non-dependent (and the name
3465 does not name a conversion operator to a dependent
3466 type), issue an error. */
3467 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3468 return error_mark_node
;
3472 /* It may be resolved via Koenig lookup. */
3473 *idk
= CP_ID_KIND_UNQUALIFIED
;
3474 return id_expression
;
3477 decl
= id_expression
;
3479 /* If DECL is a variable that would be out of scope under
3480 ANSI/ISO rules, but in scope in the ARM, name lookup
3481 will succeed. Issue a diagnostic here. */
3483 decl
= check_for_out_of_scope_variable (decl
);
3485 /* Remember that the name was used in the definition of
3486 the current class so that we can check later to see if
3487 the meaning would have been different after the class
3488 was entirely defined. */
3489 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3490 maybe_note_name_used_in_class (id_expression
, decl
);
3492 /* A use in unevaluated operand might not be instantiated appropriately
3493 if tsubst_copy builds a dummy parm, or if we never instantiate a
3494 generic lambda, so mark it now. */
3495 if (processing_template_decl
&& cp_unevaluated_operand
)
3496 mark_type_use (decl
);
3498 /* Disallow uses of local variables from containing functions, except
3499 within lambda-expressions. */
3500 if (outer_automatic_var_p (decl
))
3502 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3503 if (decl
== error_mark_node
)
3504 return error_mark_node
;
3507 /* Also disallow uses of function parameters outside the function
3508 body, except inside an unevaluated context (i.e. decltype). */
3509 if (TREE_CODE (decl
) == PARM_DECL
3510 && DECL_CONTEXT (decl
) == NULL_TREE
3511 && !cp_unevaluated_operand
)
3513 *error_msg
= "use of parameter outside function body";
3514 return error_mark_node
;
3518 /* If we didn't find anything, or what we found was a type,
3519 then this wasn't really an id-expression. */
3520 if (TREE_CODE (decl
) == TEMPLATE_DECL
3521 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3523 *error_msg
= "missing template arguments";
3524 return error_mark_node
;
3526 else if (TREE_CODE (decl
) == TYPE_DECL
3527 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3529 *error_msg
= "expected primary-expression";
3530 return error_mark_node
;
3533 /* If the name resolved to a template parameter, there is no
3534 need to look it up again later. */
3535 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3536 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3540 *idk
= CP_ID_KIND_NONE
;
3541 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3542 decl
= TEMPLATE_PARM_DECL (decl
);
3543 r
= convert_from_reference (DECL_INITIAL (decl
));
3545 if (integral_constant_expression_p
3546 && !dependent_type_p (TREE_TYPE (decl
))
3547 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3549 if (!allow_non_integral_constant_expression_p
)
3550 error ("template parameter %qD of type %qT is not allowed in "
3551 "an integral constant expression because it is not of "
3552 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3553 *non_integral_constant_expression_p
= true;
3559 bool dependent_p
= type_dependent_expression_p (decl
);
3561 /* If the declaration was explicitly qualified indicate
3562 that. The semantics of `A::f(3)' are different than
3563 `f(3)' if `f' is virtual. */
3565 ? CP_ID_KIND_QUALIFIED
3566 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3567 ? CP_ID_KIND_TEMPLATE_ID
3569 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3570 : CP_ID_KIND_UNQUALIFIED
)));
3572 /* If the name was dependent on a template parameter and we're not in a
3573 default capturing generic lambda within a template, we will resolve the
3574 name at instantiation time. FIXME: For lambdas, we should defer
3575 building the closure type until instantiation time then we won't need
3576 the extra test here. */
3578 && !parsing_default_capturing_generic_lambda_in_template ())
3581 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3582 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3583 wrong, so just return the identifier. */
3584 return id_expression
;
3586 /* If we found a variable, then name lookup during the
3587 instantiation will always resolve to the same VAR_DECL
3588 (or an instantiation thereof). */
3590 || TREE_CODE (decl
) == CONST_DECL
3591 || TREE_CODE (decl
) == PARM_DECL
)
3594 return convert_from_reference (decl
);
3597 /* Create a SCOPE_REF for qualified names, if the scope is
3603 if (address_p
&& done
)
3604 decl
= finish_qualified_id_expr (scope
, decl
,
3608 tf_warning_or_error
);
3611 tree type
= NULL_TREE
;
3612 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3613 type
= TREE_TYPE (decl
);
3614 decl
= build_qualified_name (type
,
3620 if (TREE_TYPE (decl
))
3621 decl
= convert_from_reference (decl
);
3624 /* A TEMPLATE_ID already contains all the information we
3626 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3627 return id_expression
;
3628 /* The same is true for FIELD_DECL, but we also need to
3629 make sure that the syntax is correct. */
3630 else if (TREE_CODE (decl
) == FIELD_DECL
)
3632 /* Since SCOPE is NULL here, this is an unqualified name.
3633 Access checking has been performed during name lookup
3634 already. Turn off checking to avoid duplicate errors. */
3635 push_deferring_access_checks (dk_no_check
);
3636 decl
= finish_non_static_data_member
3638 /*qualifying_scope=*/NULL_TREE
);
3639 pop_deferring_access_checks ();
3642 return id_expression
;
3645 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3647 error ("use of namespace %qD as expression", decl
);
3648 return error_mark_node
;
3650 else if (DECL_CLASS_TEMPLATE_P (decl
))
3652 error ("use of class template %qT as expression", decl
);
3653 return error_mark_node
;
3655 else if (TREE_CODE (decl
) == TREE_LIST
)
3657 /* Ambiguous reference to base members. */
3658 error ("request for member %qD is ambiguous in "
3659 "multiple inheritance lattice", id_expression
);
3660 print_candidates (decl
);
3661 return error_mark_node
;
3664 /* Mark variable-like entities as used. Functions are similarly
3665 marked either below or after overload resolution. */
3667 || TREE_CODE (decl
) == PARM_DECL
3668 || TREE_CODE (decl
) == CONST_DECL
3669 || TREE_CODE (decl
) == RESULT_DECL
)
3670 && !mark_used (decl
))
3671 return error_mark_node
;
3673 /* Only certain kinds of names are allowed in constant
3674 expression. Template parameters have already
3675 been handled above. */
3676 if (! error_operand_p (decl
)
3677 && integral_constant_expression_p
3678 && ! decl_constant_var_p (decl
)
3679 && TREE_CODE (decl
) != CONST_DECL
3680 && ! builtin_valid_in_constant_expr_p (decl
))
3682 if (!allow_non_integral_constant_expression_p
)
3684 error ("%qD cannot appear in a constant-expression", decl
);
3685 return error_mark_node
;
3687 *non_integral_constant_expression_p
= true;
3692 && !cp_unevaluated_operand
3693 && !processing_template_decl
3694 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3695 && CP_DECL_THREAD_LOCAL_P (decl
)
3696 && (wrap
= get_tls_wrapper_fn (decl
)))
3698 /* Replace an evaluated use of the thread_local variable with
3699 a call to its wrapper. */
3700 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3702 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3703 && variable_template_p (TREE_OPERAND (decl
, 0)))
3705 decl
= finish_template_variable (decl
);
3707 decl
= convert_from_reference (decl
);
3711 decl
= (adjust_result_of_qualified_name_lookup
3712 (decl
, scope
, current_nonlambda_class_type()));
3714 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3718 decl
= finish_qualified_id_expr (scope
,
3724 tf_warning_or_error
);
3726 decl
= convert_from_reference (decl
);
3728 else if (TREE_CODE (decl
) == FIELD_DECL
)
3730 /* Since SCOPE is NULL here, this is an unqualified name.
3731 Access checking has been performed during name lookup
3732 already. Turn off checking to avoid duplicate errors. */
3733 push_deferring_access_checks (dk_no_check
);
3734 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3735 /*qualifying_scope=*/NULL_TREE
);
3736 pop_deferring_access_checks ();
3738 else if (is_overloaded_fn (decl
))
3742 first_fn
= get_first_fn (decl
);
3743 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3744 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3746 /* [basic.def.odr]: "A function whose name appears as a
3747 potentially-evaluated expression is odr-used if it is the unique
3750 But only mark it if it's a complete postfix-expression; in a call,
3751 ADL might select a different function, and we'll call mark_used in
3754 && !really_overloaded_fn (decl
)
3755 && !mark_used (first_fn
))
3756 return error_mark_node
;
3759 && TREE_CODE (first_fn
) == FUNCTION_DECL
3760 && DECL_FUNCTION_MEMBER_P (first_fn
)
3761 && !shared_member_p (decl
))
3763 /* A set of member functions. */
3764 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3765 return finish_class_member_access_expr (decl
, id_expression
,
3766 /*template_p=*/false,
3767 tf_warning_or_error
);
3770 decl
= baselink_for_fns (decl
);
3774 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3775 && DECL_CLASS_SCOPE_P (decl
))
3777 tree context
= context_for_name_lookup (decl
);
3778 if (context
!= current_class_type
)
3780 tree path
= currently_open_derived_class (context
);
3781 perform_or_defer_access_check (TYPE_BINFO (path
),
3783 tf_warning_or_error
);
3787 decl
= convert_from_reference (decl
);
3791 return cp_expr (decl
, location
);
3794 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3795 use as a type-specifier. */
3798 finish_typeof (tree expr
)
3802 if (type_dependent_expression_p (expr
))
3804 type
= cxx_make_type (TYPEOF_TYPE
);
3805 TYPEOF_TYPE_EXPR (type
) = expr
;
3806 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3811 expr
= mark_type_use (expr
);
3813 type
= unlowered_expr_type (expr
);
3815 if (!type
|| type
== unknown_type_node
)
3817 error ("type of %qE is unknown", expr
);
3818 return error_mark_node
;
3824 /* Implement the __underlying_type keyword: Return the underlying
3825 type of TYPE, suitable for use as a type-specifier. */
3828 finish_underlying_type (tree type
)
3830 tree underlying_type
;
3832 if (processing_template_decl
)
3834 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3835 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3836 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3838 return underlying_type
;
3841 complete_type (type
);
3843 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3845 error ("%qT is not an enumeration type", type
);
3846 return error_mark_node
;
3849 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3851 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3852 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3853 See finish_enum_value_list for details. */
3854 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3856 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3857 TYPE_UNSIGNED (underlying_type
));
3859 return underlying_type
;
3862 /* Implement the __direct_bases keyword: Return the direct base classes
3866 calculate_direct_bases (tree type
)
3868 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3869 tree bases_vec
= NULL_TREE
;
3870 vec
<tree
, va_gc
> *base_binfos
;
3874 complete_type (type
);
3876 if (!NON_UNION_CLASS_TYPE_P (type
))
3877 return make_tree_vec (0);
3879 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3881 /* Virtual bases are initialized first */
3882 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3884 if (BINFO_VIRTUAL_P (binfo
))
3886 vec_safe_push (vector
, binfo
);
3890 /* Now non-virtuals */
3891 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3893 if (!BINFO_VIRTUAL_P (binfo
))
3895 vec_safe_push (vector
, binfo
);
3900 bases_vec
= make_tree_vec (vector
->length ());
3902 for (i
= 0; i
< vector
->length (); ++i
)
3904 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3909 /* Implement the __bases keyword: Return the base classes
3912 /* Find morally non-virtual base classes by walking binfo hierarchy */
3913 /* Virtual base classes are handled separately in finish_bases */
3916 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3918 /* Don't walk bases of virtual bases */
3919 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3923 dfs_calculate_bases_post (tree binfo
, void *data_
)
3925 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3926 if (!BINFO_VIRTUAL_P (binfo
))
3928 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3933 /* Calculates the morally non-virtual base classes of a class */
3934 static vec
<tree
, va_gc
> *
3935 calculate_bases_helper (tree type
)
3937 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3939 /* Now add non-virtual base classes in order of construction */
3940 if (TYPE_BINFO (type
))
3941 dfs_walk_all (TYPE_BINFO (type
),
3942 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3947 calculate_bases (tree type
)
3949 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3950 tree bases_vec
= NULL_TREE
;
3952 vec
<tree
, va_gc
> *vbases
;
3953 vec
<tree
, va_gc
> *nonvbases
;
3956 complete_type (type
);
3958 if (!NON_UNION_CLASS_TYPE_P (type
))
3959 return make_tree_vec (0);
3961 /* First go through virtual base classes */
3962 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3963 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3965 vec
<tree
, va_gc
> *vbase_bases
;
3966 vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3967 vec_safe_splice (vector
, vbase_bases
);
3968 release_tree_vector (vbase_bases
);
3971 /* Now for the non-virtual bases */
3972 nonvbases
= calculate_bases_helper (type
);
3973 vec_safe_splice (vector
, nonvbases
);
3974 release_tree_vector (nonvbases
);
3976 /* Note that during error recovery vector->length can even be zero. */
3977 if (vector
->length () > 1)
3979 /* Last element is entire class, so don't copy */
3980 bases_vec
= make_tree_vec (vector
->length() - 1);
3982 for (i
= 0; i
< vector
->length () - 1; ++i
)
3983 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3986 bases_vec
= make_tree_vec (0);
3988 release_tree_vector (vector
);
3993 finish_bases (tree type
, bool direct
)
3995 tree bases
= NULL_TREE
;
3997 if (!processing_template_decl
)
3999 /* Parameter packs can only be used in templates */
4000 error ("Parameter pack __bases only valid in template declaration");
4001 return error_mark_node
;
4004 bases
= cxx_make_type (BASES
);
4005 BASES_TYPE (bases
) = type
;
4006 BASES_DIRECT (bases
) = direct
;
4007 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
4012 /* Perform C++-specific checks for __builtin_offsetof before calling
4016 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
4018 /* If we're processing a template, we can't finish the semantics yet.
4019 Otherwise we can fold the entire expression now. */
4020 if (processing_template_decl
)
4022 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4023 SET_EXPR_LOCATION (expr
, loc
);
4027 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4029 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4030 TREE_OPERAND (expr
, 2));
4031 return error_mark_node
;
4033 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
4034 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
4035 || TREE_TYPE (expr
) == unknown_type_node
)
4037 if (INDIRECT_REF_P (expr
))
4038 error ("second operand of %<offsetof%> is neither a single "
4039 "identifier nor a sequence of member accesses and "
4040 "array references");
4043 if (TREE_CODE (expr
) == COMPONENT_REF
4044 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4045 expr
= TREE_OPERAND (expr
, 1);
4046 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4048 return error_mark_node
;
4050 if (REFERENCE_REF_P (expr
))
4051 expr
= TREE_OPERAND (expr
, 0);
4052 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4053 return error_mark_node
;
4054 if (warn_invalid_offsetof
4055 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4056 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4057 && cp_unevaluated_operand
== 0)
4058 pedwarn (loc
, OPT_Winvalid_offsetof
,
4059 "offsetof within non-standard-layout type %qT is undefined",
4060 TREE_TYPE (TREE_TYPE (object_ptr
)));
4061 return fold_offsetof (expr
);
4064 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4065 function is broken out from the above for the benefit of the tree-ssa
4069 simplify_aggr_init_expr (tree
*tp
)
4071 tree aggr_init_expr
= *tp
;
4073 /* Form an appropriate CALL_EXPR. */
4074 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4075 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4076 tree type
= TREE_TYPE (slot
);
4079 enum style_t
{ ctor
, arg
, pcc
} style
;
4081 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4083 #ifdef PCC_STATIC_STRUCT_RETURN
4089 gcc_assert (TREE_ADDRESSABLE (type
));
4093 call_expr
= build_call_array_loc (input_location
,
4094 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4096 aggr_init_expr_nargs (aggr_init_expr
),
4097 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4098 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4099 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4100 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4101 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4102 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4103 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4107 /* Replace the first argument to the ctor with the address of the
4109 cxx_mark_addressable (slot
);
4110 CALL_EXPR_ARG (call_expr
, 0) =
4111 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4113 else if (style
== arg
)
4115 /* Just mark it addressable here, and leave the rest to
4116 expand_call{,_inline}. */
4117 cxx_mark_addressable (slot
);
4118 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4119 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4121 else if (style
== pcc
)
4123 /* If we're using the non-reentrant PCC calling convention, then we
4124 need to copy the returned value out of the static buffer into the
4126 push_deferring_access_checks (dk_no_check
);
4127 call_expr
= build_aggr_init (slot
, call_expr
,
4128 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4129 tf_warning_or_error
);
4130 pop_deferring_access_checks ();
4131 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4134 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4136 tree init
= build_zero_init (type
, NULL_TREE
,
4137 /*static_storage_p=*/false);
4138 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4139 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4146 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4149 emit_associated_thunks (tree fn
)
4151 /* When we use vcall offsets, we emit thunks with the virtual
4152 functions to which they thunk. The whole point of vcall offsets
4153 is so that you can know statically the entire set of thunks that
4154 will ever be needed for a given virtual function, thereby
4155 enabling you to output all the thunks with the function itself. */
4156 if (DECL_VIRTUAL_P (fn
)
4157 /* Do not emit thunks for extern template instantiations. */
4158 && ! DECL_REALLY_EXTERN (fn
))
4162 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4164 if (!THUNK_ALIAS (thunk
))
4166 use_thunk (thunk
, /*emit_p=*/1);
4167 if (DECL_RESULT_THUNK_P (thunk
))
4171 for (probe
= DECL_THUNKS (thunk
);
4172 probe
; probe
= DECL_CHAIN (probe
))
4173 use_thunk (probe
, /*emit_p=*/1);
4177 gcc_assert (!DECL_THUNKS (thunk
));
4182 /* Generate RTL for FN. */
4185 expand_or_defer_fn_1 (tree fn
)
4187 /* When the parser calls us after finishing the body of a template
4188 function, we don't really want to expand the body. */
4189 if (processing_template_decl
)
4191 /* Normally, collection only occurs in rest_of_compilation. So,
4192 if we don't collect here, we never collect junk generated
4193 during the processing of templates until we hit a
4194 non-template function. It's not safe to do this inside a
4195 nested class, though, as the parser may have local state that
4196 is not a GC root. */
4197 if (!function_depth
)
4202 gcc_assert (DECL_SAVED_TREE (fn
));
4204 /* We make a decision about linkage for these functions at the end
4205 of the compilation. Until that point, we do not want the back
4206 end to output them -- but we do want it to see the bodies of
4207 these functions so that it can inline them as appropriate. */
4208 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4210 if (DECL_INTERFACE_KNOWN (fn
))
4211 /* We've already made a decision as to how this function will
4214 tentative_decl_linkage (fn
);
4216 import_export_decl (fn
);
4218 /* If the user wants us to keep all inline functions, then mark
4219 this function as needed so that finish_file will make sure to
4220 output it later. Similarly, all dllexport'd functions must
4221 be emitted; there may be callers in other DLLs. */
4222 if (DECL_DECLARED_INLINE_P (fn
)
4223 && !DECL_REALLY_EXTERN (fn
)
4224 && (flag_keep_inline_functions
4225 || (flag_keep_inline_dllexport
4226 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4229 DECL_EXTERNAL (fn
) = 0;
4233 /* If this is a constructor or destructor body, we have to clone
4235 if (maybe_clone_body (fn
))
4237 /* We don't want to process FN again, so pretend we've written
4238 it out, even though we haven't. */
4239 TREE_ASM_WRITTEN (fn
) = 1;
4240 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4241 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4242 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4246 /* There's no reason to do any of the work here if we're only doing
4247 semantic analysis; this code just generates RTL. */
4248 if (flag_syntax_only
)
4255 expand_or_defer_fn (tree fn
)
4257 if (expand_or_defer_fn_1 (fn
))
4261 /* Expand or defer, at the whim of the compilation unit manager. */
4262 cgraph_node::finalize_function (fn
, function_depth
> 1);
4263 emit_associated_thunks (fn
);
4271 nrv_data () : visited (37) {}
4275 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4278 /* Helper function for walk_tree, used by finalize_nrv below. */
4281 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4283 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4286 /* No need to walk into types. There wouldn't be any need to walk into
4287 non-statements, except that we have to consider STMT_EXPRs. */
4290 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4291 but differs from using NULL_TREE in that it indicates that we care
4292 about the value of the RESULT_DECL. */
4293 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4294 TREE_OPERAND (*tp
, 0) = dp
->result
;
4295 /* Change all cleanups for the NRV to only run when an exception is
4297 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4298 && CLEANUP_DECL (*tp
) == dp
->var
)
4299 CLEANUP_EH_ONLY (*tp
) = 1;
4300 /* Replace the DECL_EXPR for the NRV with an initialization of the
4301 RESULT_DECL, if needed. */
4302 else if (TREE_CODE (*tp
) == DECL_EXPR
4303 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4306 if (DECL_INITIAL (dp
->var
)
4307 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4308 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4309 DECL_INITIAL (dp
->var
));
4311 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4312 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4313 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4316 /* And replace all uses of the NRV with the RESULT_DECL. */
4317 else if (*tp
== dp
->var
)
4320 /* Avoid walking into the same tree more than once. Unfortunately, we
4321 can't just use walk_tree_without duplicates because it would only call
4322 us for the first occurrence of dp->var in the function body. */
4323 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4329 /* Keep iterating. */
4333 /* Called from finish_function to implement the named return value
4334 optimization by overriding all the RETURN_EXPRs and pertinent
4335 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4336 RESULT_DECL for the function. */
4339 finalize_nrv (tree
*tp
, tree var
, tree result
)
4341 struct nrv_data data
;
4343 /* Copy name from VAR to RESULT. */
4344 DECL_NAME (result
) = DECL_NAME (var
);
4345 /* Don't forget that we take its address. */
4346 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4347 /* Finally set DECL_VALUE_EXPR to avoid assigning
4348 a stack slot at -O0 for the original var and debug info
4349 uses RESULT location for VAR. */
4350 SET_DECL_VALUE_EXPR (var
, result
);
4351 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4354 data
.result
= result
;
4355 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4358 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4361 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4362 bool need_copy_ctor
, bool need_copy_assignment
,
4365 int save_errorcount
= errorcount
;
4368 /* Always allocate 3 elements for simplicity. These are the
4369 function decls for the ctor, dtor, and assignment op.
4370 This layout is known to the three lang hooks,
4371 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4372 and cxx_omp_clause_assign_op. */
4373 info
= make_tree_vec (3);
4374 CP_OMP_CLAUSE_INFO (c
) = info
;
4376 if (need_default_ctor
|| need_copy_ctor
)
4378 if (need_default_ctor
)
4379 t
= get_default_ctor (type
);
4381 t
= get_copy_ctor (type
, tf_warning_or_error
);
4383 if (t
&& !trivial_fn_p (t
))
4384 TREE_VEC_ELT (info
, 0) = t
;
4387 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4388 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4390 if (need_copy_assignment
)
4392 t
= get_copy_assign (type
);
4394 if (t
&& !trivial_fn_p (t
))
4395 TREE_VEC_ELT (info
, 2) = t
;
4398 return errorcount
!= save_errorcount
;
4401 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4402 FIELD_DECL, otherwise return DECL itself. */
4405 omp_clause_decl_field (tree decl
)
4408 && DECL_HAS_VALUE_EXPR_P (decl
)
4409 && DECL_ARTIFICIAL (decl
)
4410 && DECL_LANG_SPECIFIC (decl
)
4411 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4413 tree f
= DECL_VALUE_EXPR (decl
);
4414 if (TREE_CODE (f
) == INDIRECT_REF
)
4415 f
= TREE_OPERAND (f
, 0);
4416 if (TREE_CODE (f
) == COMPONENT_REF
)
4418 f
= TREE_OPERAND (f
, 1);
4419 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4426 /* Adjust DECL if needed for printing using %qE. */
4429 omp_clause_printable_decl (tree decl
)
4431 tree t
= omp_clause_decl_field (decl
);
4437 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4438 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4442 omp_note_field_privatization (tree f
, tree t
)
4444 if (!omp_private_member_map
)
4445 omp_private_member_map
= new hash_map
<tree
, tree
>;
4446 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4450 omp_private_member_vec
.safe_push (f
);
4451 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4452 omp_private_member_vec
.safe_push (integer_zero_node
);
4456 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4460 omp_privatize_field (tree t
, bool shared
)
4462 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4463 if (m
== error_mark_node
)
4464 return error_mark_node
;
4465 if (!omp_private_member_map
&& !shared
)
4466 omp_private_member_map
= new hash_map
<tree
, tree
>;
4467 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4469 gcc_assert (TREE_CODE (m
) == INDIRECT_REF
);
4470 m
= TREE_OPERAND (m
, 0);
4472 tree vb
= NULL_TREE
;
4473 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4476 v
= create_temporary_var (TREE_TYPE (m
));
4477 if (!DECL_LANG_SPECIFIC (v
))
4478 retrofit_lang_decl (v
);
4479 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4480 SET_DECL_VALUE_EXPR (v
, m
);
4481 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4483 omp_private_member_vec
.safe_push (t
);
4488 /* Helper function for handle_omp_array_sections. Called recursively
4489 to handle multiple array-section-subscripts. C is the clause,
4490 T current expression (initially OMP_CLAUSE_DECL), which is either
4491 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4492 expression if specified, TREE_VALUE length expression if specified,
4493 TREE_CHAIN is what it has been specified after, or some decl.
4494 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4495 set to true if any of the array-section-subscript could have length
4496 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4497 first array-section-subscript which is known not to have length
4499 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4500 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4501 all are or may have length of 1, array-section-subscript [:2] is the
4502 first one known not to have length 1. For array-section-subscript
4503 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4504 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4505 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4506 case though, as some lengths could be zero. */
4509 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4510 bool &maybe_zero_len
, unsigned int &first_non_one
,
4511 enum c_omp_region_type ort
)
4513 tree ret
, low_bound
, length
, type
;
4514 if (TREE_CODE (t
) != TREE_LIST
)
4516 if (error_operand_p (t
))
4517 return error_mark_node
;
4518 if (REFERENCE_REF_P (t
)
4519 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4520 t
= TREE_OPERAND (t
, 0);
4522 if (TREE_CODE (t
) == COMPONENT_REF
4524 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4525 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4526 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4527 && !type_dependent_expression_p (t
))
4529 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4530 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4532 error_at (OMP_CLAUSE_LOCATION (c
),
4533 "bit-field %qE in %qs clause",
4534 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4535 return error_mark_node
;
4537 while (TREE_CODE (t
) == COMPONENT_REF
)
4539 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4540 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4542 error_at (OMP_CLAUSE_LOCATION (c
),
4543 "%qE is a member of a union", t
);
4544 return error_mark_node
;
4546 t
= TREE_OPERAND (t
, 0);
4548 if (REFERENCE_REF_P (t
))
4549 t
= TREE_OPERAND (t
, 0);
4551 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4553 if (processing_template_decl
)
4556 error_at (OMP_CLAUSE_LOCATION (c
),
4557 "%qD is not a variable in %qs clause", t
,
4558 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4560 error_at (OMP_CLAUSE_LOCATION (c
),
4561 "%qE is not a variable in %qs clause", t
,
4562 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4563 return error_mark_node
;
4565 else if (TREE_CODE (t
) == PARM_DECL
4566 && DECL_ARTIFICIAL (t
)
4567 && DECL_NAME (t
) == this_identifier
)
4569 error_at (OMP_CLAUSE_LOCATION (c
),
4570 "%<this%> allowed in OpenMP only in %<declare simd%>"
4572 return error_mark_node
;
4574 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4575 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4577 error_at (OMP_CLAUSE_LOCATION (c
),
4578 "%qD is threadprivate variable in %qs clause", t
,
4579 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4580 return error_mark_node
;
4582 if (type_dependent_expression_p (ret
))
4584 ret
= convert_from_reference (ret
);
4588 if (ort
== C_ORT_OMP
4589 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4590 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4591 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4592 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4593 maybe_zero_len
, first_non_one
, ort
);
4594 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4597 type
= TREE_TYPE (ret
);
4598 low_bound
= TREE_PURPOSE (t
);
4599 length
= TREE_VALUE (t
);
4600 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4601 || (length
&& type_dependent_expression_p (length
)))
4604 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4605 return error_mark_node
;
4607 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4609 error_at (OMP_CLAUSE_LOCATION (c
),
4610 "low bound %qE of array section does not have integral type",
4612 return error_mark_node
;
4614 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4616 error_at (OMP_CLAUSE_LOCATION (c
),
4617 "length %qE of array section does not have integral type",
4619 return error_mark_node
;
4622 low_bound
= mark_rvalue_use (low_bound
);
4624 length
= mark_rvalue_use (length
);
4625 /* We need to reduce to real constant-values for checks below. */
4627 length
= fold_simple (length
);
4629 low_bound
= fold_simple (low_bound
);
4631 && TREE_CODE (low_bound
) == INTEGER_CST
4632 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4633 > TYPE_PRECISION (sizetype
))
4634 low_bound
= fold_convert (sizetype
, low_bound
);
4636 && TREE_CODE (length
) == INTEGER_CST
4637 && TYPE_PRECISION (TREE_TYPE (length
))
4638 > TYPE_PRECISION (sizetype
))
4639 length
= fold_convert (sizetype
, length
);
4640 if (low_bound
== NULL_TREE
)
4641 low_bound
= integer_zero_node
;
4643 if (length
!= NULL_TREE
)
4645 if (!integer_nonzerop (length
))
4647 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4648 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4650 if (integer_zerop (length
))
4652 error_at (OMP_CLAUSE_LOCATION (c
),
4653 "zero length array section in %qs clause",
4654 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4655 return error_mark_node
;
4659 maybe_zero_len
= true;
4661 if (first_non_one
== types
.length ()
4662 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4665 if (TREE_CODE (type
) == ARRAY_TYPE
)
4667 if (length
== NULL_TREE
4668 && (TYPE_DOMAIN (type
) == NULL_TREE
4669 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4671 error_at (OMP_CLAUSE_LOCATION (c
),
4672 "for unknown bound array type length expression must "
4674 return error_mark_node
;
4676 if (TREE_CODE (low_bound
) == INTEGER_CST
4677 && tree_int_cst_sgn (low_bound
) == -1)
4679 error_at (OMP_CLAUSE_LOCATION (c
),
4680 "negative low bound in array section in %qs clause",
4681 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4682 return error_mark_node
;
4684 if (length
!= NULL_TREE
4685 && TREE_CODE (length
) == INTEGER_CST
4686 && tree_int_cst_sgn (length
) == -1)
4688 error_at (OMP_CLAUSE_LOCATION (c
),
4689 "negative length in array section in %qs clause",
4690 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4691 return error_mark_node
;
4693 if (TYPE_DOMAIN (type
)
4694 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4695 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4698 tree size
= size_binop (PLUS_EXPR
,
4699 TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4701 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4703 if (tree_int_cst_lt (size
, low_bound
))
4705 error_at (OMP_CLAUSE_LOCATION (c
),
4706 "low bound %qE above array section size "
4707 "in %qs clause", low_bound
,
4708 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4709 return error_mark_node
;
4711 if (tree_int_cst_equal (size
, low_bound
))
4713 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4714 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4716 error_at (OMP_CLAUSE_LOCATION (c
),
4717 "zero length array section in %qs clause",
4718 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4719 return error_mark_node
;
4721 maybe_zero_len
= true;
4723 else if (length
== NULL_TREE
4724 && first_non_one
== types
.length ()
4725 && tree_int_cst_equal
4726 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4730 else if (length
== NULL_TREE
)
4732 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4733 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4734 maybe_zero_len
= true;
4735 if (first_non_one
== types
.length ())
4738 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4740 if (tree_int_cst_lt (size
, length
))
4742 error_at (OMP_CLAUSE_LOCATION (c
),
4743 "length %qE above array section size "
4744 "in %qs clause", length
,
4745 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4746 return error_mark_node
;
4748 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4751 = size_binop (PLUS_EXPR
,
4752 fold_convert (sizetype
, low_bound
),
4753 fold_convert (sizetype
, length
));
4754 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4755 && tree_int_cst_lt (size
, lbpluslen
))
4757 error_at (OMP_CLAUSE_LOCATION (c
),
4758 "high bound %qE above array section size "
4759 "in %qs clause", lbpluslen
,
4760 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4761 return error_mark_node
;
4766 else if (length
== NULL_TREE
)
4768 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4769 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4770 maybe_zero_len
= true;
4771 if (first_non_one
== types
.length ())
4775 /* For [lb:] we will need to evaluate lb more than once. */
4776 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4778 tree lb
= cp_save_expr (low_bound
);
4779 if (lb
!= low_bound
)
4781 TREE_PURPOSE (t
) = lb
;
4786 else if (TREE_CODE (type
) == POINTER_TYPE
)
4788 if (length
== NULL_TREE
)
4790 error_at (OMP_CLAUSE_LOCATION (c
),
4791 "for pointer type length expression must be specified");
4792 return error_mark_node
;
4794 if (length
!= NULL_TREE
4795 && TREE_CODE (length
) == INTEGER_CST
4796 && tree_int_cst_sgn (length
) == -1)
4798 error_at (OMP_CLAUSE_LOCATION (c
),
4799 "negative length in array section in %qs clause",
4800 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4801 return error_mark_node
;
4803 /* If there is a pointer type anywhere but in the very first
4804 array-section-subscript, the array section can't be contiguous. */
4805 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4806 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4808 error_at (OMP_CLAUSE_LOCATION (c
),
4809 "array section is not contiguous in %qs clause",
4810 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4811 return error_mark_node
;
4816 error_at (OMP_CLAUSE_LOCATION (c
),
4817 "%qE does not have pointer or array type", ret
);
4818 return error_mark_node
;
4820 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4821 types
.safe_push (TREE_TYPE (ret
));
4822 /* We will need to evaluate lb more than once. */
4823 tree lb
= cp_save_expr (low_bound
);
4824 if (lb
!= low_bound
)
4826 TREE_PURPOSE (t
) = lb
;
4829 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4833 /* Handle array sections for clause C. */
4836 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4838 bool maybe_zero_len
= false;
4839 unsigned int first_non_one
= 0;
4840 auto_vec
<tree
, 10> types
;
4841 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4842 maybe_zero_len
, first_non_one
,
4844 if (first
== error_mark_node
)
4846 if (first
== NULL_TREE
)
4848 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4850 tree t
= OMP_CLAUSE_DECL (c
);
4851 tree tem
= NULL_TREE
;
4852 if (processing_template_decl
)
4854 /* Need to evaluate side effects in the length expressions
4856 while (TREE_CODE (t
) == TREE_LIST
)
4858 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4860 if (tem
== NULL_TREE
)
4861 tem
= TREE_VALUE (t
);
4863 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4864 TREE_VALUE (t
), tem
);
4869 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4870 OMP_CLAUSE_DECL (c
) = first
;
4874 unsigned int num
= types
.length (), i
;
4875 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4876 tree condition
= NULL_TREE
;
4878 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4879 maybe_zero_len
= true;
4880 if (processing_template_decl
&& maybe_zero_len
)
4883 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4886 tree low_bound
= TREE_PURPOSE (t
);
4887 tree length
= TREE_VALUE (t
);
4891 && TREE_CODE (low_bound
) == INTEGER_CST
4892 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4893 > TYPE_PRECISION (sizetype
))
4894 low_bound
= fold_convert (sizetype
, low_bound
);
4896 && TREE_CODE (length
) == INTEGER_CST
4897 && TYPE_PRECISION (TREE_TYPE (length
))
4898 > TYPE_PRECISION (sizetype
))
4899 length
= fold_convert (sizetype
, length
);
4900 if (low_bound
== NULL_TREE
)
4901 low_bound
= integer_zero_node
;
4902 if (!maybe_zero_len
&& i
> first_non_one
)
4904 if (integer_nonzerop (low_bound
))
4905 goto do_warn_noncontiguous
;
4906 if (length
!= NULL_TREE
4907 && TREE_CODE (length
) == INTEGER_CST
4908 && TYPE_DOMAIN (types
[i
])
4909 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4910 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4914 size
= size_binop (PLUS_EXPR
,
4915 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4917 if (!tree_int_cst_equal (length
, size
))
4919 do_warn_noncontiguous
:
4920 error_at (OMP_CLAUSE_LOCATION (c
),
4921 "array section is not contiguous in %qs "
4923 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4927 if (!processing_template_decl
4928 && length
!= NULL_TREE
4929 && TREE_SIDE_EFFECTS (length
))
4931 if (side_effects
== NULL_TREE
)
4932 side_effects
= length
;
4934 side_effects
= build2 (COMPOUND_EXPR
,
4935 TREE_TYPE (side_effects
),
4936 length
, side_effects
);
4939 else if (processing_template_decl
)
4945 if (i
> first_non_one
4946 && ((length
&& integer_nonzerop (length
))
4947 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
))
4950 l
= fold_convert (sizetype
, length
);
4953 l
= size_binop (PLUS_EXPR
,
4954 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4956 l
= size_binop (MINUS_EXPR
, l
,
4957 fold_convert (sizetype
, low_bound
));
4959 if (i
> first_non_one
)
4961 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4963 if (condition
== NULL_TREE
)
4966 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4969 else if (size
== NULL_TREE
)
4971 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4972 tree eltype
= TREE_TYPE (types
[num
- 1]);
4973 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4974 eltype
= TREE_TYPE (eltype
);
4975 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4976 size
= size_binop (EXACT_DIV_EXPR
, size
,
4977 size_in_bytes (eltype
));
4978 size
= size_binop (MULT_EXPR
, size
, l
);
4980 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4981 size
, size_zero_node
);
4984 size
= size_binop (MULT_EXPR
, size
, l
);
4987 if (!processing_template_decl
)
4990 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
4991 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4993 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
4994 tree index_type
= build_index_type (size
);
4995 tree eltype
= TREE_TYPE (first
);
4996 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4997 eltype
= TREE_TYPE (eltype
);
4998 tree type
= build_array_type (eltype
, index_type
);
4999 tree ptype
= build_pointer_type (eltype
);
5000 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
5001 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
5002 t
= convert_from_reference (t
);
5003 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5004 t
= build_fold_addr_expr (t
);
5005 tree t2
= build_fold_addr_expr (first
);
5006 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5007 ptrdiff_type_node
, t2
);
5008 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5009 ptrdiff_type_node
, t2
,
5010 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5011 ptrdiff_type_node
, t
));
5012 if (tree_fits_shwi_p (t2
))
5013 t
= build2 (MEM_REF
, type
, t
,
5014 build_int_cst (ptype
, tree_to_shwi (t2
)));
5017 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5019 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5020 TREE_TYPE (t
), t
, t2
);
5021 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5023 OMP_CLAUSE_DECL (c
) = t
;
5026 OMP_CLAUSE_DECL (c
) = first
;
5027 OMP_CLAUSE_SIZE (c
) = size
;
5028 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5029 || (TREE_CODE (t
) == COMPONENT_REF
5030 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5032 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5033 switch (OMP_CLAUSE_MAP_KIND (c
))
5035 case GOMP_MAP_ALLOC
:
5038 case GOMP_MAP_TOFROM
:
5039 case GOMP_MAP_ALWAYS_TO
:
5040 case GOMP_MAP_ALWAYS_FROM
:
5041 case GOMP_MAP_ALWAYS_TOFROM
:
5042 case GOMP_MAP_RELEASE
:
5043 case GOMP_MAP_DELETE
:
5044 case GOMP_MAP_FORCE_TO
:
5045 case GOMP_MAP_FORCE_FROM
:
5046 case GOMP_MAP_FORCE_TOFROM
:
5047 case GOMP_MAP_FORCE_PRESENT
:
5048 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5053 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5055 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5056 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5057 else if (TREE_CODE (t
) == COMPONENT_REF
)
5058 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5059 else if (REFERENCE_REF_P (t
)
5060 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5062 t
= TREE_OPERAND (t
, 0);
5063 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5066 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5067 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5068 && !cxx_mark_addressable (t
))
5070 OMP_CLAUSE_DECL (c2
) = t
;
5071 t
= build_fold_addr_expr (first
);
5072 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5073 ptrdiff_type_node
, t
);
5074 tree ptr
= OMP_CLAUSE_DECL (c2
);
5075 ptr
= convert_from_reference (ptr
);
5076 if (!POINTER_TYPE_P (TREE_TYPE (ptr
)))
5077 ptr
= build_fold_addr_expr (ptr
);
5078 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5079 ptrdiff_type_node
, t
,
5080 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5081 ptrdiff_type_node
, ptr
));
5082 OMP_CLAUSE_SIZE (c2
) = t
;
5083 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5084 OMP_CLAUSE_CHAIN (c
) = c2
;
5085 ptr
= OMP_CLAUSE_DECL (c2
);
5086 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5087 && TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
5088 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5090 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5092 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5093 OMP_CLAUSE_DECL (c3
) = ptr
;
5094 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5095 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5097 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5098 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5099 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5100 OMP_CLAUSE_CHAIN (c2
) = c3
;
5107 /* Return identifier to look up for omp declare reduction. */
5110 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5112 const char *p
= NULL
;
5113 const char *m
= NULL
;
5114 switch (reduction_code
)
5122 case TRUTH_ANDIF_EXPR
:
5123 case TRUTH_ORIF_EXPR
:
5124 reduction_id
= cp_operator_id (reduction_code
);
5138 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5139 return error_mark_node
;
5140 p
= IDENTIFIER_POINTER (reduction_id
);
5143 if (type
!= NULL_TREE
)
5144 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5146 const char prefix
[] = "omp declare reduction ";
5147 size_t lenp
= sizeof (prefix
);
5148 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5150 size_t len
= strlen (p
);
5151 size_t lenm
= m
? strlen (m
) + 1 : 0;
5152 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5154 memcpy (name
, prefix
, lenp
- 1);
5155 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5158 name
[lenp
+ len
- 1] = '~';
5159 memcpy (name
+ lenp
+ len
, m
, lenm
);
5161 return get_identifier (name
);
5164 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5165 FUNCTION_DECL or NULL_TREE if not found. */
5168 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5169 vec
<tree
> *ambiguousp
)
5172 tree baselink
= NULL_TREE
;
5173 if (identifier_p (id
))
5176 bool nonint_cst_expression_p
;
5177 const char *error_msg
;
5178 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5179 tree decl
= lookup_name (id
);
5180 if (decl
== NULL_TREE
)
5181 decl
= error_mark_node
;
5182 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5183 &nonint_cst_expression_p
, false, true, false,
5184 false, &error_msg
, loc
);
5185 if (idk
== CP_ID_KIND_UNQUALIFIED
5186 && identifier_p (id
))
5188 vec
<tree
, va_gc
> *args
= NULL
;
5189 vec_safe_push (args
, build_reference_type (type
));
5190 id
= perform_koenig_lookup (id
, args
, tf_none
);
5193 else if (TREE_CODE (id
) == SCOPE_REF
)
5194 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5195 omp_reduction_id (ERROR_MARK
,
5196 TREE_OPERAND (id
, 1),
5200 if (id
&& is_overloaded_fn (id
))
5202 for (; id
; id
= OVL_NEXT (id
))
5204 tree fndecl
= OVL_CURRENT (id
);
5205 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5207 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5208 if (same_type_p (TREE_TYPE (argtype
), type
))
5212 if (id
&& BASELINK_P (fns
))
5219 if (id
== NULL_TREE
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5221 vec
<tree
> ambiguous
= vNULL
;
5222 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5224 if (ambiguousp
== NULL
)
5225 ambiguousp
= &ambiguous
;
5226 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5228 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5229 baselinkp
? baselinkp
: &baselink
,
5231 if (id
== NULL_TREE
)
5233 if (!ambiguousp
->is_empty ())
5234 ambiguousp
->safe_push (id
);
5235 else if (ret
!= NULL_TREE
)
5237 ambiguousp
->safe_push (ret
);
5238 ambiguousp
->safe_push (id
);
5244 if (ambiguousp
!= &ambiguous
)
5246 if (!ambiguous
.is_empty ())
5248 const char *str
= _("candidates are:");
5251 error_at (loc
, "user defined reduction lookup is ambiguous");
5252 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5254 inform (DECL_SOURCE_LOCATION (udr
), "%s %#D", str
, udr
);
5256 str
= get_spaces (str
);
5258 ambiguous
.release ();
5259 ret
= error_mark_node
;
5260 baselink
= NULL_TREE
;
5265 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5266 id
, id
, tf_warning_or_error
);
5270 /* Helper function for cp_parser_omp_declare_reduction_exprs
5272 Remove CLEANUP_STMT for data (omp_priv variable).
5273 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5277 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5281 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5282 *tp
= CLEANUP_BODY (*tp
);
5283 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5285 tree decl
= DECL_EXPR_DECL (*tp
);
5286 if (!processing_template_decl
5287 && decl
== (tree
) data
5288 && DECL_INITIAL (decl
)
5289 && DECL_INITIAL (decl
) != error_mark_node
)
5291 tree list
= NULL_TREE
;
5292 append_to_statement_list_force (*tp
, &list
);
5293 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5294 decl
, DECL_INITIAL (decl
));
5295 DECL_INITIAL (decl
) = NULL_TREE
;
5296 append_to_statement_list_force (init_expr
, &list
);
5303 /* Data passed from cp_check_omp_declare_reduction to
5304 cp_check_omp_declare_reduction_r. */
5306 struct cp_check_omp_declare_reduction_data
5313 /* Helper function for cp_check_omp_declare_reduction, called via
5317 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5319 struct cp_check_omp_declare_reduction_data
*udr_data
5320 = (struct cp_check_omp_declare_reduction_data
*) data
;
5322 && !DECL_ARTIFICIAL (*tp
)
5323 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5324 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5326 location_t loc
= udr_data
->loc
;
5327 if (udr_data
->combiner_p
)
5328 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5329 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5332 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5333 "to variable %qD which is not %<omp_priv%> nor "
5341 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5344 cp_check_omp_declare_reduction (tree udr
)
5346 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5347 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
5348 type
= TREE_TYPE (type
);
5350 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5352 if (type
== error_mark_node
)
5354 if (ARITHMETIC_TYPE_P (type
))
5356 static enum tree_code predef_codes
[]
5357 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5358 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5359 for (i
= 0; i
< 8; i
++)
5361 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5362 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5363 const char *n2
= IDENTIFIER_POINTER (id
);
5364 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5365 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5366 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5371 && TREE_CODE (type
) != COMPLEX_EXPR
)
5373 const char prefix_minmax
[] = "omp declare reduction m";
5374 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5375 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5376 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5377 prefix_minmax
, prefix_size
) == 0
5378 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5379 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5380 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5385 error_at (loc
, "predeclared arithmetic type %qT in "
5386 "%<#pragma omp declare reduction%>", type
);
5390 else if (TREE_CODE (type
) == FUNCTION_TYPE
5391 || TREE_CODE (type
) == METHOD_TYPE
5392 || TREE_CODE (type
) == ARRAY_TYPE
)
5394 error_at (loc
, "function or array type %qT in "
5395 "%<#pragma omp declare reduction%>", type
);
5398 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5400 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5404 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5406 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5407 "%<#pragma omp declare reduction%>", type
);
5411 tree body
= DECL_SAVED_TREE (udr
);
5412 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5415 tree_stmt_iterator tsi
;
5416 struct cp_check_omp_declare_reduction_data data
;
5417 memset (data
.stmts
, 0, sizeof data
.stmts
);
5418 for (i
= 0, tsi
= tsi_start (body
);
5419 i
< 7 && !tsi_end_p (tsi
);
5420 i
++, tsi_next (&tsi
))
5421 data
.stmts
[i
] = tsi_stmt (tsi
);
5423 gcc_assert (tsi_end_p (tsi
));
5426 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5427 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5428 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5430 data
.combiner_p
= true;
5431 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5433 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5437 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5438 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5439 data
.combiner_p
= false;
5440 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5442 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5443 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5444 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5446 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5450 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5451 an inline call. But, remap
5452 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5453 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5456 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5457 tree decl
, tree placeholder
)
5460 hash_map
<tree
, tree
> decl_map
;
5462 decl_map
.put (omp_decl1
, placeholder
);
5463 decl_map
.put (omp_decl2
, decl
);
5464 memset (&id
, 0, sizeof (id
));
5465 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5466 id
.dst_fn
= current_function_decl
;
5467 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5468 id
.decl_map
= &decl_map
;
5470 id
.copy_decl
= copy_decl_no_change
;
5471 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5472 id
.transform_new_cfg
= true;
5473 id
.transform_return_to_modify
= false;
5474 id
.transform_lang_insert_block
= NULL
;
5476 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5480 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5481 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5484 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5486 if (*tp
== (tree
) data
)
5491 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5492 Return true if there is some error and the clause should be removed. */
5495 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5497 tree t
= OMP_CLAUSE_DECL (c
);
5498 bool predefined
= false;
5499 if (TREE_CODE (t
) == TREE_LIST
)
5501 gcc_assert (processing_template_decl
);
5504 tree type
= TREE_TYPE (t
);
5505 if (TREE_CODE (t
) == MEM_REF
)
5506 type
= TREE_TYPE (type
);
5507 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5508 type
= TREE_TYPE (type
);
5509 if (TREE_CODE (type
) == ARRAY_TYPE
)
5512 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5513 while (TREE_CODE (type
) == ARRAY_TYPE
)
5514 type
= TREE_TYPE (type
);
5515 if (!processing_template_decl
)
5517 t
= require_complete_type (t
);
5518 if (t
== error_mark_node
)
5520 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5521 TYPE_SIZE_UNIT (type
));
5522 if (integer_zerop (size
))
5524 error ("%qE in %<reduction%> clause is a zero size array",
5525 omp_clause_printable_decl (t
));
5528 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5529 tree index_type
= build_index_type (size
);
5530 tree atype
= build_array_type (type
, index_type
);
5531 tree ptype
= build_pointer_type (type
);
5532 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5533 t
= build_fold_addr_expr (t
);
5534 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5535 OMP_CLAUSE_DECL (c
) = t
;
5538 if (type
== error_mark_node
)
5540 else if (ARITHMETIC_TYPE_P (type
))
5541 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5550 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5557 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5561 case TRUTH_ANDIF_EXPR
:
5562 case TRUTH_ORIF_EXPR
:
5563 if (FLOAT_TYPE_P (type
))
5570 else if (TYPE_READONLY (type
))
5572 error ("%qE has const type for %<reduction%>",
5573 omp_clause_printable_decl (t
));
5576 else if (!processing_template_decl
)
5578 t
= require_complete_type (t
);
5579 if (t
== error_mark_node
)
5581 OMP_CLAUSE_DECL (c
) = t
;
5586 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5589 else if (processing_template_decl
)
5592 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5594 type
= TYPE_MAIN_VARIANT (type
);
5595 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5596 if (id
== NULL_TREE
)
5597 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5598 NULL_TREE
, NULL_TREE
);
5599 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5602 if (id
== error_mark_node
)
5604 id
= OVL_CURRENT (id
);
5606 tree body
= DECL_SAVED_TREE (id
);
5609 if (TREE_CODE (body
) == STATEMENT_LIST
)
5611 tree_stmt_iterator tsi
;
5612 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5615 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5616 atype
= TREE_TYPE (atype
);
5617 bool need_static_cast
= !same_type_p (type
, atype
);
5618 memset (stmts
, 0, sizeof stmts
);
5619 for (i
= 0, tsi
= tsi_start (body
);
5620 i
< 7 && !tsi_end_p (tsi
);
5621 i
++, tsi_next (&tsi
))
5622 stmts
[i
] = tsi_stmt (tsi
);
5623 gcc_assert (tsi_end_p (tsi
));
5627 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5628 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5629 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5630 DECL_ARTIFICIAL (placeholder
) = 1;
5631 DECL_IGNORED_P (placeholder
) = 1;
5632 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5633 if (TREE_CODE (t
) == MEM_REF
)
5635 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5637 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5638 DECL_IGNORED_P (decl_placeholder
) = 1;
5639 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5641 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5642 cxx_mark_addressable (placeholder
);
5643 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5644 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
)))
5646 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5647 : OMP_CLAUSE_DECL (c
));
5648 tree omp_out
= placeholder
;
5649 tree omp_in
= decl_placeholder
? decl_placeholder
5650 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5651 if (need_static_cast
)
5653 tree rtype
= build_reference_type (atype
);
5654 omp_out
= build_static_cast (rtype
, omp_out
,
5655 tf_warning_or_error
);
5656 omp_in
= build_static_cast (rtype
, omp_in
,
5657 tf_warning_or_error
);
5658 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5660 omp_out
= convert_from_reference (omp_out
);
5661 omp_in
= convert_from_reference (omp_in
);
5663 OMP_CLAUSE_REDUCTION_MERGE (c
)
5664 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5665 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5669 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5670 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5671 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5672 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5673 : OMP_CLAUSE_DECL (c
));
5674 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5675 cxx_mark_addressable (placeholder
);
5676 tree omp_priv
= decl_placeholder
? decl_placeholder
5677 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5678 tree omp_orig
= placeholder
;
5679 if (need_static_cast
)
5683 error_at (OMP_CLAUSE_LOCATION (c
),
5684 "user defined reduction with constructor "
5685 "initializer for base class %qT", atype
);
5688 tree rtype
= build_reference_type (atype
);
5689 omp_priv
= build_static_cast (rtype
, omp_priv
,
5690 tf_warning_or_error
);
5691 omp_orig
= build_static_cast (rtype
, omp_orig
,
5692 tf_warning_or_error
);
5693 if (omp_priv
== error_mark_node
5694 || omp_orig
== error_mark_node
)
5696 omp_priv
= convert_from_reference (omp_priv
);
5697 omp_orig
= convert_from_reference (omp_orig
);
5700 *need_default_ctor
= true;
5701 OMP_CLAUSE_REDUCTION_INIT (c
)
5702 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5703 DECL_EXPR_DECL (stmts
[3]),
5704 omp_priv
, omp_orig
);
5705 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5706 find_omp_placeholder_r
, placeholder
, NULL
))
5707 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5711 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5712 *need_default_ctor
= true;
5716 tree v
= decl_placeholder
? decl_placeholder
5717 : convert_from_reference (t
);
5718 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5719 init
= build_constructor (TREE_TYPE (v
), NULL
);
5721 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5722 OMP_CLAUSE_REDUCTION_INIT (c
)
5723 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5728 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5732 error ("user defined reduction not found for %qE",
5733 omp_clause_printable_decl (t
));
5736 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5737 gcc_assert (TYPE_SIZE_UNIT (type
)
5738 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5742 /* Called from finish_struct_1. linear(this) or linear(this:step)
5743 clauses might not be finalized yet because the class has been incomplete
5744 when parsing #pragma omp declare simd methods. Fix those up now. */
5747 finish_omp_declare_simd_methods (tree t
)
5749 if (processing_template_decl
)
5752 for (tree x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
5754 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5756 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5757 if (!ods
|| !TREE_VALUE (ods
))
5759 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5760 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5761 && integer_zerop (OMP_CLAUSE_DECL (c
))
5762 && OMP_CLAUSE_LINEAR_STEP (c
)
5763 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
)))
5766 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5767 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5768 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5769 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5770 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5775 /* Adjust sink depend clause to take into account pointer offsets.
5777 Return TRUE if there was a problem processing the offset, and the
5778 whole clause should be removed. */
5781 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5783 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5784 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5786 /* Make sure we don't adjust things twice for templates. */
5787 if (processing_template_decl
)
5790 for (; t
; t
= TREE_CHAIN (t
))
5792 tree decl
= TREE_VALUE (t
);
5793 if (TREE_CODE (TREE_TYPE (decl
)) == POINTER_TYPE
)
5795 tree offset
= TREE_PURPOSE (t
);
5796 bool neg
= wi::neg_p ((wide_int
) offset
);
5797 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5798 decl
= mark_rvalue_use (decl
);
5799 decl
= convert_from_reference (decl
);
5800 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5801 neg
? MINUS_EXPR
: PLUS_EXPR
,
5803 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5804 MINUS_EXPR
, sizetype
,
5805 fold_convert (sizetype
, t2
),
5806 fold_convert (sizetype
, decl
));
5807 if (t2
== error_mark_node
)
5809 TREE_PURPOSE (t
) = t2
;
5815 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5816 Remove any elements from the list that are invalid. */
5819 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
5821 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5822 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
5824 tree safelen
= NULL_TREE
;
5825 bool branch_seen
= false;
5826 bool copyprivate_seen
= false;
5827 bool ordered_seen
= false;
5828 bool oacc_async
= false;
5830 bitmap_obstack_initialize (NULL
);
5831 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5832 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5833 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5834 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5835 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
5836 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
5837 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
5839 if (ort
& C_ORT_ACC
)
5840 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
5841 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
5847 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5849 bool remove
= false;
5850 bool field_ok
= false;
5852 switch (OMP_CLAUSE_CODE (c
))
5854 case OMP_CLAUSE_SHARED
:
5855 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5856 goto check_dup_generic
;
5857 case OMP_CLAUSE_PRIVATE
:
5858 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5859 goto check_dup_generic
;
5860 case OMP_CLAUSE_REDUCTION
:
5861 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5862 t
= OMP_CLAUSE_DECL (c
);
5863 if (TREE_CODE (t
) == TREE_LIST
)
5865 if (handle_omp_array_sections (c
, ort
))
5870 if (TREE_CODE (t
) == TREE_LIST
)
5872 while (TREE_CODE (t
) == TREE_LIST
)
5877 gcc_assert (TREE_CODE (t
) == MEM_REF
);
5878 t
= TREE_OPERAND (t
, 0);
5879 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
5880 t
= TREE_OPERAND (t
, 0);
5881 if (TREE_CODE (t
) == ADDR_EXPR
5882 || TREE_CODE (t
) == INDIRECT_REF
)
5883 t
= TREE_OPERAND (t
, 0);
5885 tree n
= omp_clause_decl_field (t
);
5888 goto check_dup_generic_t
;
5891 cxx_mark_addressable (t
);
5892 goto check_dup_generic
;
5893 case OMP_CLAUSE_COPYPRIVATE
:
5894 copyprivate_seen
= true;
5895 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5896 goto check_dup_generic
;
5897 case OMP_CLAUSE_COPYIN
:
5898 goto check_dup_generic
;
5899 case OMP_CLAUSE_LINEAR
:
5900 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5901 t
= OMP_CLAUSE_DECL (c
);
5902 if (ort
!= C_ORT_OMP_DECLARE_SIMD
5903 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
5905 error_at (OMP_CLAUSE_LOCATION (c
),
5906 "modifier should not be specified in %<linear%> "
5907 "clause on %<simd%> or %<for%> constructs");
5908 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
5910 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5911 && !type_dependent_expression_p (t
))
5913 tree type
= TREE_TYPE (t
);
5914 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5915 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
5916 && TREE_CODE (type
) != REFERENCE_TYPE
)
5918 error ("linear clause with %qs modifier applied to "
5919 "non-reference variable with %qT type",
5920 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5921 ? "ref" : "uval", TREE_TYPE (t
));
5925 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5926 type
= TREE_TYPE (type
);
5927 if (ort
== C_ORT_CILK
)
5929 if (!INTEGRAL_TYPE_P (type
)
5930 && !SCALAR_FLOAT_TYPE_P (type
)
5931 && TREE_CODE (type
) != POINTER_TYPE
)
5933 error ("linear clause applied to non-integral, "
5934 "non-floating, non-pointer variable with %qT type",
5940 else if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
5942 if (!INTEGRAL_TYPE_P (type
)
5943 && TREE_CODE (type
) != POINTER_TYPE
)
5945 error ("linear clause applied to non-integral non-pointer"
5946 " variable with %qT type", TREE_TYPE (t
));
5952 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5954 t
= integer_one_node
;
5955 if (t
== error_mark_node
)
5960 else if (!type_dependent_expression_p (t
)
5961 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5962 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5963 || TREE_CODE (t
) != PARM_DECL
5964 || TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
5965 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
5967 error ("linear step expression must be integral");
5973 t
= mark_rvalue_use (t
);
5974 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
5976 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
5977 goto check_dup_generic
;
5979 if (!processing_template_decl
5980 && (VAR_P (OMP_CLAUSE_DECL (c
))
5981 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
5983 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
5985 t
= maybe_constant_value (t
);
5986 if (TREE_CODE (t
) != INTEGER_CST
)
5988 error_at (OMP_CLAUSE_LOCATION (c
),
5989 "%<linear%> clause step %qE is neither "
5990 "constant nor a parameter", t
);
5995 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5996 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
5997 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5998 type
= TREE_TYPE (type
);
5999 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
6001 type
= build_pointer_type (type
);
6002 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
6003 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6005 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6006 MINUS_EXPR
, sizetype
,
6007 fold_convert (sizetype
, t
),
6008 fold_convert (sizetype
, d
));
6009 if (t
== error_mark_node
)
6015 else if (TREE_CODE (type
) == POINTER_TYPE
6016 /* Can't multiply the step yet if *this
6017 is still incomplete type. */
6018 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6019 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6020 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6021 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6023 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6025 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6026 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6028 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6029 MINUS_EXPR
, sizetype
,
6030 fold_convert (sizetype
, t
),
6031 fold_convert (sizetype
, d
));
6032 if (t
== error_mark_node
)
6039 t
= fold_convert (type
, t
);
6041 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6043 goto check_dup_generic
;
6045 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6048 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6049 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6052 t
= OMP_CLAUSE_DECL (c
);
6053 check_dup_generic_t
:
6054 if (t
== current_class_ptr
6055 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6056 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6057 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6059 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6064 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6065 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6067 if (processing_template_decl
)
6070 error ("%qD is not a variable in clause %qs", t
,
6071 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6073 error ("%qE is not a variable in clause %qs", t
,
6074 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6077 else if (ort
== C_ORT_ACC
6078 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6080 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6082 error ("%qD appears more than once in reduction clauses", t
);
6086 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6088 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6089 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6090 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6092 error ("%qD appears more than once in data clauses", t
);
6095 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6096 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6098 if (ort
== C_ORT_ACC
)
6099 error ("%qD appears more than once in data clauses", t
);
6101 error ("%qD appears both in data and map clauses", t
);
6105 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6110 && TREE_CODE (t
) == FIELD_DECL
6111 && t
== OMP_CLAUSE_DECL (c
)
6112 && ort
!= C_ORT_ACC
)
6115 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6116 == OMP_CLAUSE_SHARED
));
6117 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6122 case OMP_CLAUSE_FIRSTPRIVATE
:
6123 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6125 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6127 t
= OMP_CLAUSE_DECL (c
);
6128 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6130 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6135 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6136 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6137 || TREE_CODE (t
) != FIELD_DECL
))
6139 if (processing_template_decl
)
6142 error ("%qD is not a variable in clause %<firstprivate%>", t
);
6144 error ("%qE is not a variable in clause %<firstprivate%>", t
);
6147 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6148 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6150 error ("%qD appears more than once in data clauses", t
);
6153 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6155 if (ort
== C_ORT_ACC
)
6156 error ("%qD appears more than once in data clauses", t
);
6158 error ("%qD appears both in data and map clauses", t
);
6162 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6163 goto handle_field_decl
;
6165 case OMP_CLAUSE_LASTPRIVATE
:
6166 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6168 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6170 t
= OMP_CLAUSE_DECL (c
);
6171 if (t
== current_class_ptr
)
6173 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6178 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6179 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6180 || TREE_CODE (t
) != FIELD_DECL
))
6182 if (processing_template_decl
)
6185 error ("%qD is not a variable in clause %<lastprivate%>", t
);
6187 error ("%qE is not a variable in clause %<lastprivate%>", t
);
6190 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6191 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6193 error ("%qD appears more than once in data clauses", t
);
6197 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6198 goto handle_field_decl
;
6201 t
= OMP_CLAUSE_IF_EXPR (c
);
6202 t
= maybe_convert_cond (t
);
6203 if (t
== error_mark_node
)
6205 else if (!processing_template_decl
)
6206 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6207 OMP_CLAUSE_IF_EXPR (c
) = t
;
6210 case OMP_CLAUSE_FINAL
:
6211 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6212 t
= maybe_convert_cond (t
);
6213 if (t
== error_mark_node
)
6215 else if (!processing_template_decl
)
6216 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6217 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6220 case OMP_CLAUSE_GANG
:
6221 /* Operand 1 is the gang static: argument. */
6222 t
= OMP_CLAUSE_OPERAND (c
, 1);
6225 if (t
== error_mark_node
)
6227 else if (!type_dependent_expression_p (t
)
6228 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6230 error ("%<gang%> static expression must be integral");
6235 t
= mark_rvalue_use (t
);
6236 if (!processing_template_decl
)
6238 t
= maybe_constant_value (t
);
6239 if (TREE_CODE (t
) == INTEGER_CST
6240 && tree_int_cst_sgn (t
) != 1
6241 && t
!= integer_minus_one_node
)
6243 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6244 "%<gang%> static value must be "
6246 t
= integer_one_node
;
6249 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6251 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6253 /* Check operand 0, the num argument. */
6256 case OMP_CLAUSE_WORKER
:
6257 case OMP_CLAUSE_VECTOR
:
6258 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6262 case OMP_CLAUSE_NUM_TASKS
:
6263 case OMP_CLAUSE_NUM_TEAMS
:
6264 case OMP_CLAUSE_NUM_THREADS
:
6265 case OMP_CLAUSE_NUM_GANGS
:
6266 case OMP_CLAUSE_NUM_WORKERS
:
6267 case OMP_CLAUSE_VECTOR_LENGTH
:
6268 t
= OMP_CLAUSE_OPERAND (c
, 0);
6269 if (t
== error_mark_node
)
6271 else if (!type_dependent_expression_p (t
)
6272 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6274 switch (OMP_CLAUSE_CODE (c
))
6276 case OMP_CLAUSE_GANG
:
6277 error_at (OMP_CLAUSE_LOCATION (c
),
6278 "%<gang%> num expression must be integral"); break;
6279 case OMP_CLAUSE_VECTOR
:
6280 error_at (OMP_CLAUSE_LOCATION (c
),
6281 "%<vector%> length expression must be integral");
6283 case OMP_CLAUSE_WORKER
:
6284 error_at (OMP_CLAUSE_LOCATION (c
),
6285 "%<worker%> num expression must be integral");
6288 error_at (OMP_CLAUSE_LOCATION (c
),
6289 "%qs expression must be integral",
6290 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6296 t
= mark_rvalue_use (t
);
6297 if (!processing_template_decl
)
6299 t
= maybe_constant_value (t
);
6300 if (TREE_CODE (t
) == INTEGER_CST
6301 && tree_int_cst_sgn (t
) != 1)
6303 switch (OMP_CLAUSE_CODE (c
))
6305 case OMP_CLAUSE_GANG
:
6306 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6307 "%<gang%> num value must be positive");
6309 case OMP_CLAUSE_VECTOR
:
6310 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6311 "%<vector%> length value must be "
6314 case OMP_CLAUSE_WORKER
:
6315 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6316 "%<worker%> num value must be "
6320 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6321 "%qs value must be positive",
6322 omp_clause_code_name
6323 [OMP_CLAUSE_CODE (c
)]);
6325 t
= integer_one_node
;
6327 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6329 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6333 case OMP_CLAUSE_SCHEDULE
:
6334 if (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
)
6336 const char *p
= NULL
;
6337 switch (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_MASK
)
6339 case OMP_CLAUSE_SCHEDULE_STATIC
: p
= "static"; break;
6340 case OMP_CLAUSE_SCHEDULE_DYNAMIC
: break;
6341 case OMP_CLAUSE_SCHEDULE_GUIDED
: break;
6342 case OMP_CLAUSE_SCHEDULE_AUTO
: p
= "auto"; break;
6343 case OMP_CLAUSE_SCHEDULE_RUNTIME
: p
= "runtime"; break;
6344 default: gcc_unreachable ();
6348 error_at (OMP_CLAUSE_LOCATION (c
),
6349 "%<nonmonotonic%> modifier specified for %qs "
6350 "schedule kind", p
);
6351 OMP_CLAUSE_SCHEDULE_KIND (c
)
6352 = (enum omp_clause_schedule_kind
)
6353 (OMP_CLAUSE_SCHEDULE_KIND (c
)
6354 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
6358 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6361 else if (t
== error_mark_node
)
6363 else if (!type_dependent_expression_p (t
)
6364 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
6365 != OMP_CLAUSE_SCHEDULE_CILKFOR
)
6366 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6368 error ("schedule chunk size expression must be integral");
6373 t
= mark_rvalue_use (t
);
6374 if (!processing_template_decl
)
6376 if (OMP_CLAUSE_SCHEDULE_KIND (c
)
6377 == OMP_CLAUSE_SCHEDULE_CILKFOR
)
6379 t
= convert_to_integer (long_integer_type_node
, t
);
6380 if (t
== error_mark_node
)
6388 t
= maybe_constant_value (t
);
6389 if (TREE_CODE (t
) == INTEGER_CST
6390 && tree_int_cst_sgn (t
) != 1)
6392 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6393 "chunk size value must be positive");
6394 t
= integer_one_node
;
6397 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6399 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6403 case OMP_CLAUSE_SIMDLEN
:
6404 case OMP_CLAUSE_SAFELEN
:
6405 t
= OMP_CLAUSE_OPERAND (c
, 0);
6406 if (t
== error_mark_node
)
6408 else if (!type_dependent_expression_p (t
)
6409 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6411 error ("%qs length expression must be integral",
6412 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6417 t
= mark_rvalue_use (t
);
6418 t
= maybe_constant_value (t
);
6419 if (!processing_template_decl
)
6421 if (TREE_CODE (t
) != INTEGER_CST
6422 || tree_int_cst_sgn (t
) != 1)
6424 error ("%qs length expression must be positive constant"
6425 " integer expression",
6426 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6430 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6431 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6436 case OMP_CLAUSE_ASYNC
:
6437 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6438 if (t
== error_mark_node
)
6440 else if (!type_dependent_expression_p (t
)
6441 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6443 error ("%<async%> expression must be integral");
6448 t
= mark_rvalue_use (t
);
6449 if (!processing_template_decl
)
6450 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6451 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6455 case OMP_CLAUSE_WAIT
:
6456 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6457 if (t
== error_mark_node
)
6459 else if (!processing_template_decl
)
6460 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6461 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6464 case OMP_CLAUSE_THREAD_LIMIT
:
6465 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6466 if (t
== error_mark_node
)
6468 else if (!type_dependent_expression_p (t
)
6469 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6471 error ("%<thread_limit%> expression must be integral");
6476 t
= mark_rvalue_use (t
);
6477 if (!processing_template_decl
)
6479 t
= maybe_constant_value (t
);
6480 if (TREE_CODE (t
) == INTEGER_CST
6481 && tree_int_cst_sgn (t
) != 1)
6483 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6484 "%<thread_limit%> value must be positive");
6485 t
= integer_one_node
;
6487 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6489 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6493 case OMP_CLAUSE_DEVICE
:
6494 t
= OMP_CLAUSE_DEVICE_ID (c
);
6495 if (t
== error_mark_node
)
6497 else if (!type_dependent_expression_p (t
)
6498 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6500 error ("%<device%> id must be integral");
6505 t
= mark_rvalue_use (t
);
6506 if (!processing_template_decl
)
6507 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6508 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6512 case OMP_CLAUSE_DIST_SCHEDULE
:
6513 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6516 else if (t
== error_mark_node
)
6518 else if (!type_dependent_expression_p (t
)
6519 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6521 error ("%<dist_schedule%> chunk size expression must be "
6527 t
= mark_rvalue_use (t
);
6528 if (!processing_template_decl
)
6529 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6530 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6534 case OMP_CLAUSE_ALIGNED
:
6535 t
= OMP_CLAUSE_DECL (c
);
6536 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6538 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6543 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6545 if (processing_template_decl
)
6548 error ("%qD is not a variable in %<aligned%> clause", t
);
6550 error ("%qE is not a variable in %<aligned%> clause", t
);
6553 else if (!type_dependent_expression_p (t
)
6554 && TREE_CODE (TREE_TYPE (t
)) != POINTER_TYPE
6555 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6556 && (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6557 || (!POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6558 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6561 error_at (OMP_CLAUSE_LOCATION (c
),
6562 "%qE in %<aligned%> clause is neither a pointer nor "
6563 "an array nor a reference to pointer or array", t
);
6566 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6568 error ("%qD appears more than once in %<aligned%> clauses", t
);
6572 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6573 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6574 if (t
== error_mark_node
)
6576 else if (t
== NULL_TREE
)
6578 else if (!type_dependent_expression_p (t
)
6579 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6581 error ("%<aligned%> clause alignment expression must "
6587 t
= mark_rvalue_use (t
);
6588 t
= maybe_constant_value (t
);
6589 if (!processing_template_decl
)
6591 if (TREE_CODE (t
) != INTEGER_CST
6592 || tree_int_cst_sgn (t
) != 1)
6594 error ("%<aligned%> clause alignment expression must be "
6595 "positive constant integer expression");
6599 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6603 case OMP_CLAUSE_DEPEND
:
6604 t
= OMP_CLAUSE_DECL (c
);
6607 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6608 == OMP_CLAUSE_DEPEND_SOURCE
);
6611 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6613 if (cp_finish_omp_clause_depend_sink (c
))
6617 if (TREE_CODE (t
) == TREE_LIST
)
6619 if (handle_omp_array_sections (c
, ort
))
6623 if (t
== error_mark_node
)
6625 else if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6627 if (processing_template_decl
)
6630 error ("%qD is not a variable in %<depend%> clause", t
);
6632 error ("%qE is not a variable in %<depend%> clause", t
);
6635 else if (t
== current_class_ptr
)
6637 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6641 else if (!processing_template_decl
6642 && !cxx_mark_addressable (t
))
6646 case OMP_CLAUSE_MAP
:
6648 case OMP_CLAUSE_FROM
:
6649 case OMP_CLAUSE__CACHE_
:
6650 t
= OMP_CLAUSE_DECL (c
);
6651 if (TREE_CODE (t
) == TREE_LIST
)
6653 if (handle_omp_array_sections (c
, ort
))
6657 t
= OMP_CLAUSE_DECL (c
);
6658 if (TREE_CODE (t
) != TREE_LIST
6659 && !type_dependent_expression_p (t
)
6660 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6662 error_at (OMP_CLAUSE_LOCATION (c
),
6663 "array section does not have mappable type "
6665 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6668 while (TREE_CODE (t
) == ARRAY_REF
)
6669 t
= TREE_OPERAND (t
, 0);
6670 if (TREE_CODE (t
) == COMPONENT_REF
6671 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
6673 while (TREE_CODE (t
) == COMPONENT_REF
)
6674 t
= TREE_OPERAND (t
, 0);
6675 if (REFERENCE_REF_P (t
))
6676 t
= TREE_OPERAND (t
, 0);
6677 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6679 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6681 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6682 error ("%qD appears more than once in motion"
6684 else if (ort
== C_ORT_ACC
)
6685 error ("%qD appears more than once in data"
6688 error ("%qD appears more than once in map"
6694 bitmap_set_bit (&map_head
, DECL_UID (t
));
6695 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6701 if (t
== error_mark_node
)
6706 if (REFERENCE_REF_P (t
)
6707 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
6709 t
= TREE_OPERAND (t
, 0);
6710 OMP_CLAUSE_DECL (c
) = t
;
6712 if (TREE_CODE (t
) == COMPONENT_REF
6713 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6714 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
6716 if (type_dependent_expression_p (t
))
6718 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
6719 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6721 error_at (OMP_CLAUSE_LOCATION (c
),
6722 "bit-field %qE in %qs clause",
6723 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6726 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6728 error_at (OMP_CLAUSE_LOCATION (c
),
6729 "%qE does not have a mappable type in %qs clause",
6730 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6733 while (TREE_CODE (t
) == COMPONENT_REF
)
6735 if (TREE_TYPE (TREE_OPERAND (t
, 0))
6736 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
6739 error_at (OMP_CLAUSE_LOCATION (c
),
6740 "%qE is a member of a union", t
);
6744 t
= TREE_OPERAND (t
, 0);
6748 if (REFERENCE_REF_P (t
))
6749 t
= TREE_OPERAND (t
, 0);
6750 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6752 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6753 goto handle_map_references
;
6756 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6758 if (processing_template_decl
)
6760 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6761 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6762 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
6765 error ("%qD is not a variable in %qs clause", t
,
6766 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6768 error ("%qE is not a variable in %qs clause", t
,
6769 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6772 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
6774 error ("%qD is threadprivate variable in %qs clause", t
,
6775 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6778 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6780 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6785 else if (!processing_template_decl
6786 && TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6787 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
6788 || (OMP_CLAUSE_MAP_KIND (c
)
6789 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
6790 && !cxx_mark_addressable (t
))
6792 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6793 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6794 || (OMP_CLAUSE_MAP_KIND (c
)
6795 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
6796 && t
== OMP_CLAUSE_DECL (c
)
6797 && !type_dependent_expression_p (t
)
6798 && !cp_omp_mappable_type ((TREE_CODE (TREE_TYPE (t
))
6800 ? TREE_TYPE (TREE_TYPE (t
))
6803 error_at (OMP_CLAUSE_LOCATION (c
),
6804 "%qD does not have a mappable type in %qs clause", t
,
6805 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6808 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6809 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
6810 && !type_dependent_expression_p (t
)
6811 && !POINTER_TYPE_P (TREE_TYPE (t
)))
6813 error ("%qD is not a pointer variable", t
);
6816 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6817 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
6819 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6820 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6822 error ("%qD appears more than once in data clauses", t
);
6825 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6827 if (ort
== C_ORT_ACC
)
6828 error ("%qD appears more than once in data clauses", t
);
6830 error ("%qD appears both in data and map clauses", t
);
6834 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6836 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6838 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6839 error ("%qD appears more than once in motion clauses", t
);
6840 if (ort
== C_ORT_ACC
)
6841 error ("%qD appears more than once in data clauses", t
);
6843 error ("%qD appears more than once in map clauses", t
);
6846 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6847 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6849 if (ort
== C_ORT_ACC
)
6850 error ("%qD appears more than once in data clauses", t
);
6852 error ("%qD appears both in data and map clauses", t
);
6857 bitmap_set_bit (&map_head
, DECL_UID (t
));
6858 if (t
!= OMP_CLAUSE_DECL (c
)
6859 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
6860 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6862 handle_map_references
:
6864 && !processing_template_decl
6865 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6866 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
))) == REFERENCE_TYPE
)
6868 t
= OMP_CLAUSE_DECL (c
);
6869 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6871 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6872 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6874 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6876 else if (OMP_CLAUSE_MAP_KIND (c
)
6877 != GOMP_MAP_FIRSTPRIVATE_POINTER
6878 && (OMP_CLAUSE_MAP_KIND (c
)
6879 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
6880 && (OMP_CLAUSE_MAP_KIND (c
)
6881 != GOMP_MAP_ALWAYS_POINTER
))
6883 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
6885 if (TREE_CODE (t
) == COMPONENT_REF
)
6886 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
6888 OMP_CLAUSE_SET_MAP_KIND (c2
,
6889 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
6890 OMP_CLAUSE_DECL (c2
) = t
;
6891 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
6892 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
6893 OMP_CLAUSE_CHAIN (c
) = c2
;
6894 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6895 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6897 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6903 case OMP_CLAUSE_TO_DECLARE
:
6904 case OMP_CLAUSE_LINK
:
6905 t
= OMP_CLAUSE_DECL (c
);
6906 if (TREE_CODE (t
) == FUNCTION_DECL
6907 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6909 else if (!VAR_P (t
))
6911 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6913 if (TREE_CODE (t
) == OVERLOAD
&& OVL_CHAIN (t
))
6914 error_at (OMP_CLAUSE_LOCATION (c
),
6915 "overloaded function name %qE in clause %qs", t
,
6916 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6917 else if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
6918 error_at (OMP_CLAUSE_LOCATION (c
),
6919 "template %qE in clause %qs", t
,
6920 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6922 error_at (OMP_CLAUSE_LOCATION (c
),
6923 "%qE is neither a variable nor a function name "
6925 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6928 error_at (OMP_CLAUSE_LOCATION (c
),
6929 "%qE is not a variable in clause %qs", t
,
6930 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6933 else if (DECL_THREAD_LOCAL_P (t
))
6935 error_at (OMP_CLAUSE_LOCATION (c
),
6936 "%qD is threadprivate variable in %qs clause", t
,
6937 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6940 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6942 error_at (OMP_CLAUSE_LOCATION (c
),
6943 "%qD does not have a mappable type in %qs clause", t
,
6944 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6949 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
6951 error_at (OMP_CLAUSE_LOCATION (c
),
6952 "%qE appears more than once on the same "
6953 "%<declare target%> directive", t
);
6957 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6960 case OMP_CLAUSE_UNIFORM
:
6961 t
= OMP_CLAUSE_DECL (c
);
6962 if (TREE_CODE (t
) != PARM_DECL
)
6964 if (processing_template_decl
)
6967 error ("%qD is not an argument in %<uniform%> clause", t
);
6969 error ("%qE is not an argument in %<uniform%> clause", t
);
6973 /* map_head bitmap is used as uniform_head if declare_simd. */
6974 bitmap_set_bit (&map_head
, DECL_UID (t
));
6975 goto check_dup_generic
;
6977 case OMP_CLAUSE_GRAINSIZE
:
6978 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
6979 if (t
== error_mark_node
)
6981 else if (!type_dependent_expression_p (t
)
6982 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6984 error ("%<grainsize%> expression must be integral");
6989 t
= mark_rvalue_use (t
);
6990 if (!processing_template_decl
)
6992 t
= maybe_constant_value (t
);
6993 if (TREE_CODE (t
) == INTEGER_CST
6994 && tree_int_cst_sgn (t
) != 1)
6996 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6997 "%<grainsize%> value must be positive");
6998 t
= integer_one_node
;
7000 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7002 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
7006 case OMP_CLAUSE_PRIORITY
:
7007 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
7008 if (t
== error_mark_node
)
7010 else if (!type_dependent_expression_p (t
)
7011 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7013 error ("%<priority%> expression must be integral");
7018 t
= mark_rvalue_use (t
);
7019 if (!processing_template_decl
)
7021 t
= maybe_constant_value (t
);
7022 if (TREE_CODE (t
) == INTEGER_CST
7023 && tree_int_cst_sgn (t
) == -1)
7025 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7026 "%<priority%> value must be non-negative");
7027 t
= integer_one_node
;
7029 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7031 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7035 case OMP_CLAUSE_HINT
:
7036 t
= OMP_CLAUSE_HINT_EXPR (c
);
7037 if (t
== error_mark_node
)
7039 else if (!type_dependent_expression_p (t
)
7040 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7042 error ("%<num_tasks%> expression must be integral");
7047 t
= mark_rvalue_use (t
);
7048 if (!processing_template_decl
)
7050 t
= maybe_constant_value (t
);
7051 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7053 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7057 case OMP_CLAUSE_IS_DEVICE_PTR
:
7058 case OMP_CLAUSE_USE_DEVICE_PTR
:
7059 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7060 t
= OMP_CLAUSE_DECL (c
);
7061 if (!type_dependent_expression_p (t
))
7063 tree type
= TREE_TYPE (t
);
7064 if (TREE_CODE (type
) != POINTER_TYPE
7065 && TREE_CODE (type
) != ARRAY_TYPE
7066 && (TREE_CODE (type
) != REFERENCE_TYPE
7067 || (TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
7068 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
7070 error_at (OMP_CLAUSE_LOCATION (c
),
7071 "%qs variable is neither a pointer, nor an array "
7072 "nor reference to pointer or array",
7073 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7077 goto check_dup_generic
;
7079 case OMP_CLAUSE_NOWAIT
:
7080 case OMP_CLAUSE_DEFAULT
:
7081 case OMP_CLAUSE_UNTIED
:
7082 case OMP_CLAUSE_COLLAPSE
:
7083 case OMP_CLAUSE_MERGEABLE
:
7084 case OMP_CLAUSE_PARALLEL
:
7085 case OMP_CLAUSE_FOR
:
7086 case OMP_CLAUSE_SECTIONS
:
7087 case OMP_CLAUSE_TASKGROUP
:
7088 case OMP_CLAUSE_PROC_BIND
:
7089 case OMP_CLAUSE_NOGROUP
:
7090 case OMP_CLAUSE_THREADS
:
7091 case OMP_CLAUSE_SIMD
:
7092 case OMP_CLAUSE_DEFAULTMAP
:
7093 case OMP_CLAUSE__CILK_FOR_COUNT_
:
7094 case OMP_CLAUSE_AUTO
:
7095 case OMP_CLAUSE_INDEPENDENT
:
7096 case OMP_CLAUSE_SEQ
:
7099 case OMP_CLAUSE_TILE
:
7100 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7101 list
= TREE_CHAIN (list
))
7103 t
= TREE_VALUE (list
);
7105 if (t
== error_mark_node
)
7107 else if (!type_dependent_expression_p (t
)
7108 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7110 error_at (OMP_CLAUSE_LOCATION (c
),
7111 "%<tile%> argument needs integral type");
7116 t
= mark_rvalue_use (t
);
7117 if (!processing_template_decl
)
7119 /* Zero is used to indicate '*', we permit you
7120 to get there via an ICE of value zero. */
7121 t
= maybe_constant_value (t
);
7122 if (!tree_fits_shwi_p (t
)
7123 || tree_to_shwi (t
) < 0)
7125 error_at (OMP_CLAUSE_LOCATION (c
),
7126 "%<tile%> argument needs positive "
7127 "integral constant");
7131 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7134 /* Update list item. */
7135 TREE_VALUE (list
) = t
;
7139 case OMP_CLAUSE_ORDERED
:
7140 ordered_seen
= true;
7143 case OMP_CLAUSE_INBRANCH
:
7144 case OMP_CLAUSE_NOTINBRANCH
:
7147 error ("%<inbranch%> clause is incompatible with "
7159 *pc
= OMP_CLAUSE_CHAIN (c
);
7161 pc
= &OMP_CLAUSE_CHAIN (c
);
7164 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7166 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7167 bool remove
= false;
7168 bool need_complete_type
= false;
7169 bool need_default_ctor
= false;
7170 bool need_copy_ctor
= false;
7171 bool need_copy_assignment
= false;
7172 bool need_implicitly_determined
= false;
7173 bool need_dtor
= false;
7174 tree type
, inner_type
;
7178 case OMP_CLAUSE_SHARED
:
7179 need_implicitly_determined
= true;
7181 case OMP_CLAUSE_PRIVATE
:
7182 need_complete_type
= true;
7183 need_default_ctor
= true;
7185 need_implicitly_determined
= true;
7187 case OMP_CLAUSE_FIRSTPRIVATE
:
7188 need_complete_type
= true;
7189 need_copy_ctor
= true;
7191 need_implicitly_determined
= true;
7193 case OMP_CLAUSE_LASTPRIVATE
:
7194 need_complete_type
= true;
7195 need_copy_assignment
= true;
7196 need_implicitly_determined
= true;
7198 case OMP_CLAUSE_REDUCTION
:
7199 need_implicitly_determined
= true;
7201 case OMP_CLAUSE_LINEAR
:
7202 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7203 need_implicitly_determined
= true;
7204 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7205 && !bitmap_bit_p (&map_head
,
7206 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7208 error_at (OMP_CLAUSE_LOCATION (c
),
7209 "%<linear%> clause step is a parameter %qD not "
7210 "specified in %<uniform%> clause",
7211 OMP_CLAUSE_LINEAR_STEP (c
));
7212 *pc
= OMP_CLAUSE_CHAIN (c
);
7216 case OMP_CLAUSE_COPYPRIVATE
:
7217 need_copy_assignment
= true;
7219 case OMP_CLAUSE_COPYIN
:
7220 need_copy_assignment
= true;
7222 case OMP_CLAUSE_SIMDLEN
:
7224 && !processing_template_decl
7225 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7226 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7228 error_at (OMP_CLAUSE_LOCATION (c
),
7229 "%<simdlen%> clause value is bigger than "
7230 "%<safelen%> clause value");
7231 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7232 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7234 pc
= &OMP_CLAUSE_CHAIN (c
);
7236 case OMP_CLAUSE_SCHEDULE
:
7238 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7239 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7241 error_at (OMP_CLAUSE_LOCATION (c
),
7242 "%<nonmonotonic%> schedule modifier specified "
7243 "together with %<ordered%> clause");
7244 OMP_CLAUSE_SCHEDULE_KIND (c
)
7245 = (enum omp_clause_schedule_kind
)
7246 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7247 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7249 pc
= &OMP_CLAUSE_CHAIN (c
);
7251 case OMP_CLAUSE_NOWAIT
:
7252 if (copyprivate_seen
)
7254 error_at (OMP_CLAUSE_LOCATION (c
),
7255 "%<nowait%> clause must not be used together "
7256 "with %<copyprivate%>");
7257 *pc
= OMP_CLAUSE_CHAIN (c
);
7262 pc
= &OMP_CLAUSE_CHAIN (c
);
7266 t
= OMP_CLAUSE_DECL (c
);
7267 if (processing_template_decl
7268 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7270 pc
= &OMP_CLAUSE_CHAIN (c
);
7276 case OMP_CLAUSE_LASTPRIVATE
:
7277 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7279 need_default_ctor
= true;
7284 case OMP_CLAUSE_REDUCTION
:
7285 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7289 t
= OMP_CLAUSE_DECL (c
);
7292 case OMP_CLAUSE_COPYIN
:
7293 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7295 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
7304 if (need_complete_type
|| need_copy_assignment
)
7306 t
= require_complete_type (t
);
7307 if (t
== error_mark_node
)
7309 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
7310 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7313 if (need_implicitly_determined
)
7315 const char *share_name
= NULL
;
7317 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7318 share_name
= "threadprivate";
7319 else switch (cxx_omp_predetermined_sharing (t
))
7321 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7323 case OMP_CLAUSE_DEFAULT_SHARED
:
7324 /* const vars may be specified in firstprivate clause. */
7325 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7326 && cxx_omp_const_qual_no_mutable (t
))
7328 share_name
= "shared";
7330 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7331 share_name
= "private";
7338 error ("%qE is predetermined %qs for %qs",
7339 omp_clause_printable_decl (t
), share_name
,
7340 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7345 /* We're interested in the base element, not arrays. */
7346 inner_type
= type
= TREE_TYPE (t
);
7347 if ((need_complete_type
7348 || need_copy_assignment
7349 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
7350 && TREE_CODE (inner_type
) == REFERENCE_TYPE
)
7351 inner_type
= TREE_TYPE (inner_type
);
7352 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7353 inner_type
= TREE_TYPE (inner_type
);
7355 /* Check for special function availability by building a call to one.
7356 Save the results, because later we won't be in the right context
7357 for making these queries. */
7358 if (CLASS_TYPE_P (inner_type
)
7359 && COMPLETE_TYPE_P (inner_type
)
7360 && (need_default_ctor
|| need_copy_ctor
7361 || need_copy_assignment
|| need_dtor
)
7362 && !type_dependent_expression_p (t
)
7363 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7364 need_copy_ctor
, need_copy_assignment
,
7369 && c_kind
== OMP_CLAUSE_SHARED
7370 && processing_template_decl
)
7372 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7374 OMP_CLAUSE_DECL (c
) = t
;
7378 *pc
= OMP_CLAUSE_CHAIN (c
);
7380 pc
= &OMP_CLAUSE_CHAIN (c
);
7383 bitmap_obstack_release (NULL
);
7387 /* Start processing OpenMP clauses that can include any
7388 privatization clauses for non-static data members. */
7391 push_omp_privatization_clauses (bool ignore_next
)
7393 if (omp_private_member_ignore_next
)
7395 omp_private_member_ignore_next
= ignore_next
;
7398 omp_private_member_ignore_next
= ignore_next
;
7399 if (omp_private_member_map
)
7400 omp_private_member_vec
.safe_push (error_mark_node
);
7401 return push_stmt_list ();
7404 /* Revert remapping of any non-static data members since
7405 the last push_omp_privatization_clauses () call. */
7408 pop_omp_privatization_clauses (tree stmt
)
7410 if (stmt
== NULL_TREE
)
7412 stmt
= pop_stmt_list (stmt
);
7413 if (omp_private_member_map
)
7415 while (!omp_private_member_vec
.is_empty ())
7417 tree t
= omp_private_member_vec
.pop ();
7418 if (t
== error_mark_node
)
7423 bool no_decl_expr
= t
== integer_zero_node
;
7425 t
= omp_private_member_vec
.pop ();
7426 tree
*v
= omp_private_member_map
->get (t
);
7430 omp_private_member_map
->remove (t
);
7432 delete omp_private_member_map
;
7433 omp_private_member_map
= NULL
;
7438 /* Remember OpenMP privatization clauses mapping and clear it.
7439 Used for lambdas. */
7442 save_omp_privatization_clauses (vec
<tree
> &save
)
7445 if (omp_private_member_ignore_next
)
7446 save
.safe_push (integer_one_node
);
7447 omp_private_member_ignore_next
= false;
7448 if (!omp_private_member_map
)
7451 while (!omp_private_member_vec
.is_empty ())
7453 tree t
= omp_private_member_vec
.pop ();
7454 if (t
== error_mark_node
)
7460 if (t
== integer_zero_node
)
7461 t
= omp_private_member_vec
.pop ();
7462 tree
*v
= omp_private_member_map
->get (t
);
7464 save
.safe_push (*v
);
7469 delete omp_private_member_map
;
7470 omp_private_member_map
= NULL
;
7473 /* Restore OpenMP privatization clauses mapping saved by the
7477 restore_omp_privatization_clauses (vec
<tree
> &save
)
7479 gcc_assert (omp_private_member_vec
.is_empty ());
7480 omp_private_member_ignore_next
= false;
7481 if (save
.is_empty ())
7483 if (save
.length () == 1 && save
[0] == integer_one_node
)
7485 omp_private_member_ignore_next
= true;
7490 omp_private_member_map
= new hash_map
<tree
, tree
>;
7491 while (!save
.is_empty ())
7493 tree t
= save
.pop ();
7495 if (t
!= error_mark_node
)
7497 if (t
== integer_one_node
)
7499 omp_private_member_ignore_next
= true;
7500 gcc_assert (save
.is_empty ());
7503 if (t
== integer_zero_node
)
7505 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7508 omp_private_member_vec
.safe_push (t
);
7510 omp_private_member_vec
.safe_push (n
);
7515 /* For all variables in the tree_list VARS, mark them as thread local. */
7518 finish_omp_threadprivate (tree vars
)
7522 /* Mark every variable in VARS to be assigned thread local storage. */
7523 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7525 tree v
= TREE_PURPOSE (t
);
7527 if (error_operand_p (v
))
7529 else if (!VAR_P (v
))
7530 error ("%<threadprivate%> %qD is not file, namespace "
7531 "or block scope variable", v
);
7532 /* If V had already been marked threadprivate, it doesn't matter
7533 whether it had been used prior to this point. */
7534 else if (TREE_USED (v
)
7535 && (DECL_LANG_SPECIFIC (v
) == NULL
7536 || !CP_DECL_THREADPRIVATE_P (v
)))
7537 error ("%qE declared %<threadprivate%> after first use", v
);
7538 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7539 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7540 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7541 error ("%<threadprivate%> %qE has incomplete type", v
);
7542 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7543 && CP_DECL_CONTEXT (v
) != current_class_type
)
7544 error ("%<threadprivate%> %qE directive not "
7545 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7548 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7549 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7551 retrofit_lang_decl (v
);
7553 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
7554 after the allocation of the lang_decl structure. */
7555 if (DECL_DISCRIMINATOR_P (v
))
7556 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
7559 if (! CP_DECL_THREAD_LOCAL_P (v
))
7561 CP_DECL_THREAD_LOCAL_P (v
) = true;
7562 set_decl_tls_model (v
, decl_default_tls_model (v
));
7563 /* If rtl has been already set for this var, call
7564 make_decl_rtl once again, so that encode_section_info
7565 has a chance to look at the new decl flags. */
7566 if (DECL_RTL_SET_P (v
))
7569 CP_DECL_THREADPRIVATE_P (v
) = 1;
7574 /* Build an OpenMP structured block. */
7577 begin_omp_structured_block (void)
7579 return do_pushlevel (sk_omp
);
7583 finish_omp_structured_block (tree block
)
7585 return do_poplevel (block
);
7588 /* Similarly, except force the retention of the BLOCK. */
7591 begin_omp_parallel (void)
7593 keep_next_level (true);
7594 return begin_omp_structured_block ();
7597 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7601 finish_oacc_data (tree clauses
, tree block
)
7605 block
= finish_omp_structured_block (block
);
7607 stmt
= make_node (OACC_DATA
);
7608 TREE_TYPE (stmt
) = void_type_node
;
7609 OACC_DATA_CLAUSES (stmt
) = clauses
;
7610 OACC_DATA_BODY (stmt
) = block
;
7612 return add_stmt (stmt
);
7615 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
7619 finish_oacc_host_data (tree clauses
, tree block
)
7623 block
= finish_omp_structured_block (block
);
7625 stmt
= make_node (OACC_HOST_DATA
);
7626 TREE_TYPE (stmt
) = void_type_node
;
7627 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
7628 OACC_HOST_DATA_BODY (stmt
) = block
;
7630 return add_stmt (stmt
);
7633 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
7637 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
7639 body
= finish_omp_structured_block (body
);
7641 tree stmt
= make_node (code
);
7642 TREE_TYPE (stmt
) = void_type_node
;
7643 OMP_BODY (stmt
) = body
;
7644 OMP_CLAUSES (stmt
) = clauses
;
7646 return add_stmt (stmt
);
7650 finish_omp_parallel (tree clauses
, tree body
)
7654 body
= finish_omp_structured_block (body
);
7656 stmt
= make_node (OMP_PARALLEL
);
7657 TREE_TYPE (stmt
) = void_type_node
;
7658 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
7659 OMP_PARALLEL_BODY (stmt
) = body
;
7661 return add_stmt (stmt
);
7665 begin_omp_task (void)
7667 keep_next_level (true);
7668 return begin_omp_structured_block ();
7672 finish_omp_task (tree clauses
, tree body
)
7676 body
= finish_omp_structured_block (body
);
7678 stmt
= make_node (OMP_TASK
);
7679 TREE_TYPE (stmt
) = void_type_node
;
7680 OMP_TASK_CLAUSES (stmt
) = clauses
;
7681 OMP_TASK_BODY (stmt
) = body
;
7683 return add_stmt (stmt
);
7686 /* Helper function for finish_omp_for. Convert Ith random access iterator
7687 into integral iterator. Return FALSE if successful. */
7690 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
7691 tree declv
, tree orig_declv
, tree initv
,
7692 tree condv
, tree incrv
, tree
*body
,
7693 tree
*pre_body
, tree
&clauses
, tree
*lastp
,
7694 int collapse
, int ordered
)
7696 tree diff
, iter_init
, iter_incr
= NULL
, last
;
7697 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
7698 tree decl
= TREE_VEC_ELT (declv
, i
);
7699 tree init
= TREE_VEC_ELT (initv
, i
);
7700 tree cond
= TREE_VEC_ELT (condv
, i
);
7701 tree incr
= TREE_VEC_ELT (incrv
, i
);
7703 location_t elocus
= locus
;
7705 if (init
&& EXPR_HAS_LOCATION (init
))
7706 elocus
= EXPR_LOCATION (init
);
7708 cond
= cp_fully_fold (cond
);
7709 switch (TREE_CODE (cond
))
7716 if (TREE_OPERAND (cond
, 1) == iter
)
7717 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
7718 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
7719 if (TREE_OPERAND (cond
, 0) != iter
)
7720 cond
= error_mark_node
;
7723 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
7726 TREE_OPERAND (cond
, 1), ERROR_MARK
,
7727 NULL
, tf_warning_or_error
);
7728 if (error_operand_p (tem
))
7733 cond
= error_mark_node
;
7736 if (cond
== error_mark_node
)
7738 error_at (elocus
, "invalid controlling predicate");
7741 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
7742 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
7743 tf_warning_or_error
);
7744 diff
= cp_fully_fold (diff
);
7745 if (error_operand_p (diff
))
7747 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
7749 error_at (elocus
, "difference between %qE and %qD does not have integer type",
7750 TREE_OPERAND (cond
, 1), iter
);
7753 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
7754 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
7755 cond
, cp_walk_subtrees
))
7758 switch (TREE_CODE (incr
))
7760 case PREINCREMENT_EXPR
:
7761 case PREDECREMENT_EXPR
:
7762 case POSTINCREMENT_EXPR
:
7763 case POSTDECREMENT_EXPR
:
7764 if (TREE_OPERAND (incr
, 0) != iter
)
7766 incr
= error_mark_node
;
7769 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
7770 TREE_CODE (incr
), iter
,
7771 tf_warning_or_error
);
7772 if (error_operand_p (iter_incr
))
7774 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
7775 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
7776 incr
= integer_one_node
;
7778 incr
= integer_minus_one_node
;
7781 if (TREE_OPERAND (incr
, 0) != iter
)
7782 incr
= error_mark_node
;
7783 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
7784 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
7786 tree rhs
= TREE_OPERAND (incr
, 1);
7787 if (TREE_OPERAND (rhs
, 0) == iter
)
7789 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
7791 incr
= error_mark_node
;
7794 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7795 iter
, TREE_CODE (rhs
),
7796 TREE_OPERAND (rhs
, 1),
7797 tf_warning_or_error
);
7798 if (error_operand_p (iter_incr
))
7800 incr
= TREE_OPERAND (rhs
, 1);
7801 incr
= cp_convert (TREE_TYPE (diff
), incr
,
7802 tf_warning_or_error
);
7803 if (TREE_CODE (rhs
) == MINUS_EXPR
)
7805 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
7806 incr
= fold_simple (incr
);
7808 if (TREE_CODE (incr
) != INTEGER_CST
7809 && (TREE_CODE (incr
) != NOP_EXPR
7810 || (TREE_CODE (TREE_OPERAND (incr
, 0))
7815 else if (TREE_OPERAND (rhs
, 1) == iter
)
7817 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
7818 || TREE_CODE (rhs
) != PLUS_EXPR
)
7819 incr
= error_mark_node
;
7822 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
7824 TREE_OPERAND (rhs
, 0),
7827 tf_warning_or_error
);
7828 if (error_operand_p (iter_incr
))
7830 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7833 tf_warning_or_error
);
7834 if (error_operand_p (iter_incr
))
7836 incr
= TREE_OPERAND (rhs
, 0);
7841 incr
= error_mark_node
;
7844 incr
= error_mark_node
;
7847 incr
= error_mark_node
;
7851 if (incr
== error_mark_node
)
7853 error_at (elocus
, "invalid increment expression");
7857 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
7858 bool taskloop_iv_seen
= false;
7859 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
7860 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
7861 && OMP_CLAUSE_DECL (c
) == iter
)
7863 if (code
== OMP_TASKLOOP
)
7865 taskloop_iv_seen
= true;
7866 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
7870 else if (code
== OMP_TASKLOOP
7871 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
7872 && OMP_CLAUSE_DECL (c
) == iter
)
7874 taskloop_iv_seen
= true;
7875 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
7878 decl
= create_temporary_var (TREE_TYPE (diff
));
7880 add_decl_expr (decl
);
7881 last
= create_temporary_var (TREE_TYPE (diff
));
7883 add_decl_expr (last
);
7884 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
7885 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7887 incr_var
= create_temporary_var (TREE_TYPE (diff
));
7888 pushdecl (incr_var
);
7889 add_decl_expr (incr_var
);
7891 gcc_assert (stmts_are_full_exprs_p ());
7892 tree diffvar
= NULL_TREE
;
7893 if (code
== OMP_TASKLOOP
)
7895 if (!taskloop_iv_seen
)
7897 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7898 OMP_CLAUSE_DECL (ivc
) = iter
;
7899 cxx_omp_finish_clause (ivc
, NULL
);
7900 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
7903 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7904 OMP_CLAUSE_DECL (lvc
) = last
;
7905 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
7907 diffvar
= create_temporary_var (TREE_TYPE (diff
));
7909 add_decl_expr (diffvar
);
7912 orig_pre_body
= *pre_body
;
7913 *pre_body
= push_stmt_list ();
7915 add_stmt (orig_pre_body
);
7917 finish_expr_stmt (build_x_modify_expr (elocus
,
7918 iter
, NOP_EXPR
, init
,
7919 tf_warning_or_error
));
7920 init
= build_int_cst (TREE_TYPE (diff
), 0);
7921 if (c
&& iter_incr
== NULL
7922 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7926 finish_expr_stmt (build_x_modify_expr (elocus
,
7928 incr
, tf_warning_or_error
));
7931 iter_incr
= build_x_modify_expr (elocus
,
7932 iter
, PLUS_EXPR
, incr
,
7933 tf_warning_or_error
);
7935 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
7937 finish_expr_stmt (build_x_modify_expr (elocus
,
7938 last
, NOP_EXPR
, init
,
7939 tf_warning_or_error
));
7942 finish_expr_stmt (build_x_modify_expr (elocus
,
7944 diff
, tf_warning_or_error
));
7947 *pre_body
= pop_stmt_list (*pre_body
);
7949 cond
= cp_build_binary_op (elocus
,
7950 TREE_CODE (cond
), decl
, diff
,
7951 tf_warning_or_error
);
7952 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
7953 elocus
, incr
, NULL_TREE
);
7956 *body
= push_stmt_list ();
7957 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
7958 iter_init
= build_x_modify_expr (elocus
,
7959 iter
, PLUS_EXPR
, iter_init
,
7960 tf_warning_or_error
);
7961 if (iter_init
!= error_mark_node
)
7962 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7963 finish_expr_stmt (iter_init
);
7964 finish_expr_stmt (build_x_modify_expr (elocus
,
7965 last
, NOP_EXPR
, decl
,
7966 tf_warning_or_error
));
7967 add_stmt (orig_body
);
7968 *body
= pop_stmt_list (*body
);
7972 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
7974 finish_expr_stmt (iter_incr
);
7978 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
7979 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
7980 iter_init
, iter_incr
);
7981 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
7982 iter_init
= build_x_modify_expr (elocus
,
7983 iter
, PLUS_EXPR
, iter_init
,
7984 tf_warning_or_error
);
7985 if (iter_init
!= error_mark_node
)
7986 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7987 finish_expr_stmt (iter_init
);
7989 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
7990 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
7993 TREE_VEC_ELT (declv
, i
) = decl
;
7994 TREE_VEC_ELT (initv
, i
) = init
;
7995 TREE_VEC_ELT (condv
, i
) = cond
;
7996 TREE_VEC_ELT (incrv
, i
) = incr
;
8002 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
8003 are directly for their associated operands in the statement. DECL
8004 and INIT are a combo; if DECL is NULL then INIT ought to be a
8005 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
8006 optional statements that need to go before the loop into its
8010 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
8011 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
8012 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
8014 tree omp_for
= NULL
, orig_incr
= NULL
;
8015 tree decl
= NULL
, init
, cond
, incr
, orig_decl
= NULL_TREE
, block
= NULL_TREE
;
8016 tree last
= NULL_TREE
;
8022 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8023 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8024 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8025 if (TREE_VEC_LENGTH (declv
) > 1)
8029 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8031 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8034 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8036 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8037 if (collapse
!= TREE_VEC_LENGTH (declv
))
8038 ordered
= TREE_VEC_LENGTH (declv
);
8041 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8043 decl
= TREE_VEC_ELT (declv
, i
);
8044 init
= TREE_VEC_ELT (initv
, i
);
8045 cond
= TREE_VEC_ELT (condv
, i
);
8046 incr
= TREE_VEC_ELT (incrv
, i
);
8052 switch (TREE_CODE (init
))
8055 decl
= TREE_OPERAND (init
, 0);
8056 init
= TREE_OPERAND (init
, 1);
8059 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8061 decl
= TREE_OPERAND (init
, 0);
8062 init
= TREE_OPERAND (init
, 2);
8072 "expected iteration declaration or initialization");
8077 if (init
&& EXPR_HAS_LOCATION (init
))
8078 elocus
= EXPR_LOCATION (init
);
8082 error_at (elocus
, "missing controlling predicate");
8088 error_at (elocus
, "missing increment expression");
8092 TREE_VEC_ELT (declv
, i
) = decl
;
8093 TREE_VEC_ELT (initv
, i
) = init
;
8100 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8102 && !c_omp_check_loop_iv_exprs (locus
, declv
,
8103 TREE_VEC_ELT (declv
, i
), orig_init
,
8104 NULL_TREE
, cp_walk_subtrees
))
8110 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8114 stmt
= make_node (code
);
8116 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8118 /* This is really just a place-holder. We'll be decomposing this
8119 again and going through the cp_build_modify_expr path below when
8120 we instantiate the thing. */
8121 TREE_VEC_ELT (initv
, i
)
8122 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8123 TREE_VEC_ELT (initv
, i
));
8126 TREE_TYPE (stmt
) = void_type_node
;
8127 OMP_FOR_INIT (stmt
) = initv
;
8128 OMP_FOR_COND (stmt
) = condv
;
8129 OMP_FOR_INCR (stmt
) = incrv
;
8130 OMP_FOR_BODY (stmt
) = body
;
8131 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8132 OMP_FOR_CLAUSES (stmt
) = clauses
;
8134 SET_EXPR_LOCATION (stmt
, locus
);
8135 return add_stmt (stmt
);
8139 orig_declv
= copy_node (declv
);
8141 if (processing_template_decl
)
8142 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8144 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8146 decl
= TREE_VEC_ELT (declv
, i
);
8147 init
= TREE_VEC_ELT (initv
, i
);
8148 cond
= TREE_VEC_ELT (condv
, i
);
8149 incr
= TREE_VEC_ELT (incrv
, i
);
8151 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8154 if (init
&& EXPR_HAS_LOCATION (init
))
8155 elocus
= EXPR_LOCATION (init
);
8159 error_at (elocus
, "expected iteration declaration or initialization");
8163 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8166 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8167 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8168 TREE_CODE (TREE_OPERAND (incr
, 1)),
8169 TREE_OPERAND (incr
, 2),
8170 tf_warning_or_error
);
8173 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8175 if (code
== OMP_SIMD
)
8177 error_at (elocus
, "%<#pragma omp simd%> used with class "
8178 "iteration variable %qE", decl
);
8181 if (code
== CILK_FOR
&& i
== 0)
8183 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8184 initv
, condv
, incrv
, &body
,
8185 &pre_body
, clauses
, &last
,
8191 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8192 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8194 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8198 if (!processing_template_decl
)
8200 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8201 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8202 tf_warning_or_error
);
8205 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8207 && TREE_SIDE_EFFECTS (cond
)
8208 && COMPARISON_CLASS_P (cond
)
8209 && !processing_template_decl
)
8211 tree t
= TREE_OPERAND (cond
, 0);
8212 if (TREE_SIDE_EFFECTS (t
)
8214 && (TREE_CODE (t
) != NOP_EXPR
8215 || TREE_OPERAND (t
, 0) != decl
))
8216 TREE_OPERAND (cond
, 0)
8217 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8219 t
= TREE_OPERAND (cond
, 1);
8220 if (TREE_SIDE_EFFECTS (t
)
8222 && (TREE_CODE (t
) != NOP_EXPR
8223 || TREE_OPERAND (t
, 0) != decl
))
8224 TREE_OPERAND (cond
, 1)
8225 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8227 if (decl
== error_mark_node
|| init
== error_mark_node
)
8230 TREE_VEC_ELT (declv
, i
) = decl
;
8231 TREE_VEC_ELT (initv
, i
) = init
;
8232 TREE_VEC_ELT (condv
, i
) = cond
;
8233 TREE_VEC_ELT (incrv
, i
) = incr
;
8237 if (IS_EMPTY_STMT (pre_body
))
8240 if (code
== CILK_FOR
&& !processing_template_decl
)
8241 block
= push_stmt_list ();
8243 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8244 incrv
, body
, pre_body
);
8246 /* Check for iterators appearing in lb, b or incr expressions. */
8247 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8248 omp_for
= NULL_TREE
;
8250 if (omp_for
== NULL
)
8253 pop_stmt_list (block
);
8259 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8261 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8262 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8264 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8267 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8268 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8269 && !processing_template_decl
)
8271 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8272 if (TREE_SIDE_EFFECTS (t
)
8274 && (TREE_CODE (t
) != NOP_EXPR
8275 || TREE_OPERAND (t
, 0) != decl
))
8276 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8277 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8279 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8280 if (TREE_SIDE_EFFECTS (t
)
8282 && (TREE_CODE (t
) != NOP_EXPR
8283 || TREE_OPERAND (t
, 0) != decl
))
8284 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8285 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8289 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8291 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8293 /* For simd loops with non-static data member iterators, we could have added
8294 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8295 step at this point, fill it in. */
8296 if (code
== OMP_SIMD
&& !processing_template_decl
8297 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8298 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8299 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8300 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8302 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8303 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8304 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8306 switch (TREE_CODE (incr
))
8308 case PREINCREMENT_EXPR
:
8309 case POSTINCREMENT_EXPR
:
8310 /* c_omp_for_incr_canonicalize_ptr() should have been
8311 called to massage things appropriately. */
8312 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8313 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8315 case PREDECREMENT_EXPR
:
8316 case POSTDECREMENT_EXPR
:
8317 /* c_omp_for_incr_canonicalize_ptr() should have been
8318 called to massage things appropriately. */
8319 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8320 OMP_CLAUSE_LINEAR_STEP (c
)
8321 = build_int_cst (TREE_TYPE (decl
), -1);
8324 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8325 incr
= TREE_OPERAND (incr
, 1);
8326 switch (TREE_CODE (incr
))
8329 if (TREE_OPERAND (incr
, 1) == decl
)
8330 step
= TREE_OPERAND (incr
, 0);
8332 step
= TREE_OPERAND (incr
, 1);
8335 case POINTER_PLUS_EXPR
:
8336 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8337 step
= TREE_OPERAND (incr
, 1);
8342 stept
= TREE_TYPE (decl
);
8343 if (POINTER_TYPE_P (stept
))
8345 step
= fold_convert (stept
, step
);
8346 if (TREE_CODE (incr
) == MINUS_EXPR
)
8347 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8348 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8357 tree omp_par
= make_node (OMP_PARALLEL
);
8358 TREE_TYPE (omp_par
) = void_type_node
;
8359 OMP_PARALLEL_CLAUSES (omp_par
) = NULL_TREE
;
8360 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
8361 TREE_SIDE_EFFECTS (bind
) = 1;
8362 BIND_EXPR_BODY (bind
) = pop_stmt_list (block
);
8363 OMP_PARALLEL_BODY (omp_par
) = bind
;
8364 if (OMP_FOR_PRE_BODY (omp_for
))
8366 add_stmt (OMP_FOR_PRE_BODY (omp_for
));
8367 OMP_FOR_PRE_BODY (omp_for
) = NULL_TREE
;
8369 init
= TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0);
8370 decl
= TREE_OPERAND (init
, 0);
8371 cond
= TREE_VEC_ELT (OMP_FOR_COND (omp_for
), 0);
8372 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8373 tree t
= TREE_OPERAND (cond
, 1), c
, clauses
, *pc
;
8374 clauses
= OMP_FOR_CLAUSES (omp_for
);
8375 OMP_FOR_CLAUSES (omp_for
) = NULL_TREE
;
8376 for (pc
= &clauses
; *pc
; )
8377 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_SCHEDULE
)
8379 gcc_assert (OMP_FOR_CLAUSES (omp_for
) == NULL_TREE
);
8380 OMP_FOR_CLAUSES (omp_for
) = *pc
;
8381 *pc
= OMP_CLAUSE_CHAIN (*pc
);
8382 OMP_CLAUSE_CHAIN (OMP_FOR_CLAUSES (omp_for
)) = NULL_TREE
;
8386 gcc_assert (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
);
8387 pc
= &OMP_CLAUSE_CHAIN (*pc
);
8389 if (TREE_CODE (t
) != INTEGER_CST
)
8391 TREE_OPERAND (cond
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8392 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8393 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (cond
, 1);
8394 OMP_CLAUSE_CHAIN (c
) = clauses
;
8397 if (TREE_CODE (incr
) == MODIFY_EXPR
)
8399 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8400 if (TREE_CODE (t
) != INTEGER_CST
)
8402 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8403 = get_temp_regvar (TREE_TYPE (t
), t
);
8404 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8405 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8406 OMP_CLAUSE_CHAIN (c
) = clauses
;
8410 t
= TREE_OPERAND (init
, 1);
8411 if (TREE_CODE (t
) != INTEGER_CST
)
8413 TREE_OPERAND (init
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8414 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8415 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (init
, 1);
8416 OMP_CLAUSE_CHAIN (c
) = clauses
;
8419 if (orig_decl
&& orig_decl
!= decl
)
8421 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8422 OMP_CLAUSE_DECL (c
) = orig_decl
;
8423 OMP_CLAUSE_CHAIN (c
) = clauses
;
8428 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8429 OMP_CLAUSE_DECL (c
) = last
;
8430 OMP_CLAUSE_CHAIN (c
) = clauses
;
8433 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
8434 OMP_CLAUSE_DECL (c
) = decl
;
8435 OMP_CLAUSE_CHAIN (c
) = clauses
;
8437 c
= build_omp_clause (input_location
, OMP_CLAUSE__CILK_FOR_COUNT_
);
8438 OMP_CLAUSE_OPERAND (c
, 0)
8439 = cilk_for_number_of_iterations (omp_for
);
8440 OMP_CLAUSE_CHAIN (c
) = clauses
;
8441 OMP_PARALLEL_CLAUSES (omp_par
) = finish_omp_clauses (c
, C_ORT_CILK
);
8445 else if (code
== CILK_FOR
&& processing_template_decl
)
8447 tree c
, clauses
= OMP_FOR_CLAUSES (omp_for
);
8448 if (orig_decl
&& orig_decl
!= decl
)
8450 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8451 OMP_CLAUSE_DECL (c
) = orig_decl
;
8452 OMP_CLAUSE_CHAIN (c
) = clauses
;
8457 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8458 OMP_CLAUSE_DECL (c
) = last
;
8459 OMP_CLAUSE_CHAIN (c
) = clauses
;
8462 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8468 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
8469 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
8484 dependent_p
= false;
8487 /* Even in a template, we can detect invalid uses of the atomic
8488 pragma if neither LHS nor RHS is type-dependent. */
8489 if (processing_template_decl
)
8491 dependent_p
= (type_dependent_expression_p (lhs
)
8492 || (rhs
&& type_dependent_expression_p (rhs
))
8493 || (v
&& type_dependent_expression_p (v
))
8494 || (lhs1
&& type_dependent_expression_p (lhs1
))
8495 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8498 lhs
= build_non_dependent_expr (lhs
);
8500 rhs
= build_non_dependent_expr (rhs
);
8502 v
= build_non_dependent_expr (v
);
8504 lhs1
= build_non_dependent_expr (lhs1
);
8506 rhs1
= build_non_dependent_expr (rhs1
);
8511 bool swapped
= false;
8512 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8514 std::swap (rhs
, rhs1
);
8515 swapped
= !commutative_tree_code (opcode
);
8517 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8519 if (code
== OMP_ATOMIC
)
8520 error ("%<#pragma omp atomic update%> uses two different "
8521 "expressions for memory");
8523 error ("%<#pragma omp atomic capture%> uses two different "
8524 "expressions for memory");
8527 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8529 if (code
== OMP_ATOMIC
)
8530 error ("%<#pragma omp atomic update%> uses two different "
8531 "expressions for memory");
8533 error ("%<#pragma omp atomic capture%> uses two different "
8534 "expressions for memory");
8537 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
8538 v
, lhs1
, rhs1
, swapped
, seq_cst
,
8539 processing_template_decl
!= 0);
8540 if (stmt
== error_mark_node
)
8543 if (processing_template_decl
)
8545 if (code
== OMP_ATOMIC_READ
)
8547 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
8548 OMP_ATOMIC_READ
, orig_lhs
);
8549 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8550 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8554 if (opcode
== NOP_EXPR
)
8555 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8557 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8559 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8560 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8561 if (code
!= OMP_ATOMIC
)
8563 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
8564 code
, orig_lhs1
, stmt
);
8565 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8566 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8569 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
8570 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8572 finish_expr_stmt (stmt
);
8576 finish_omp_barrier (void)
8578 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
8579 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8580 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8581 release_tree_vector (vec
);
8582 finish_expr_stmt (stmt
);
8586 finish_omp_flush (void)
8588 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8589 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8590 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8591 release_tree_vector (vec
);
8592 finish_expr_stmt (stmt
);
8596 finish_omp_taskwait (void)
8598 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8599 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8600 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8601 release_tree_vector (vec
);
8602 finish_expr_stmt (stmt
);
8606 finish_omp_taskyield (void)
8608 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8609 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8610 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8611 release_tree_vector (vec
);
8612 finish_expr_stmt (stmt
);
8616 finish_omp_cancel (tree clauses
)
8618 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
8620 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8622 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8624 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8626 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8630 error ("%<#pragma omp cancel%> must specify one of "
8631 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8634 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8635 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
8636 if (ifc
!= NULL_TREE
)
8638 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
8639 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
8640 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
8641 build_zero_cst (type
));
8644 ifc
= boolean_true_node
;
8645 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
8646 vec
->quick_push (ifc
);
8647 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8648 release_tree_vector (vec
);
8649 finish_expr_stmt (stmt
);
8653 finish_omp_cancellation_point (tree clauses
)
8655 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
8657 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8659 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8661 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8663 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8667 error ("%<#pragma omp cancellation point%> must specify one of "
8668 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8671 vec
<tree
, va_gc
> *vec
8672 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
8673 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8674 release_tree_vector (vec
);
8675 finish_expr_stmt (stmt
);
8678 /* Begin a __transaction_atomic or __transaction_relaxed statement.
8679 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
8680 should create an extra compound stmt. */
8683 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
8688 *pcompound
= begin_compound_stmt (0);
8690 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
8692 /* Only add the statement to the function if support enabled. */
8696 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
8697 ? G_("%<__transaction_relaxed%> without "
8698 "transactional memory support enabled")
8699 : G_("%<__transaction_atomic%> without "
8700 "transactional memory support enabled")));
8702 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
8703 TREE_SIDE_EFFECTS (r
) = 1;
8707 /* End a __transaction_atomic or __transaction_relaxed statement.
8708 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
8709 and we should end the compound. If NOEX is non-NULL, we wrap the body in
8710 a MUST_NOT_THROW_EXPR with NOEX as condition. */
8713 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
8715 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
8716 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
8717 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
8718 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
8720 /* noexcept specifications are not allowed for function transactions. */
8721 gcc_assert (!(noex
&& compound_stmt
));
8724 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
8726 protected_set_expr_location
8727 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
8728 TREE_SIDE_EFFECTS (body
) = 1;
8729 TRANSACTION_EXPR_BODY (stmt
) = body
;
8733 finish_compound_stmt (compound_stmt
);
8736 /* Build a __transaction_atomic or __transaction_relaxed expression. If
8737 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
8741 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
8746 expr
= build_must_not_throw_expr (expr
, noex
);
8747 protected_set_expr_location (expr
, loc
);
8748 TREE_SIDE_EFFECTS (expr
) = 1;
8750 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
8751 if (flags
& TM_STMT_ATTR_RELAXED
)
8752 TRANSACTION_EXPR_RELAXED (ret
) = 1;
8753 TREE_SIDE_EFFECTS (ret
) = 1;
8754 SET_EXPR_LOCATION (ret
, loc
);
8759 init_cp_semantics (void)
8763 /* Build a STATIC_ASSERT for a static assertion with the condition
8764 CONDITION and the message text MESSAGE. LOCATION is the location
8765 of the static assertion in the source code. When MEMBER_P, this
8766 static assertion is a member of a class. */
8768 finish_static_assert (tree condition
, tree message
, location_t location
,
8771 if (message
== NULL_TREE
8772 || message
== error_mark_node
8773 || condition
== NULL_TREE
8774 || condition
== error_mark_node
)
8777 if (check_for_bare_parameter_packs (condition
))
8778 condition
= error_mark_node
;
8780 if (type_dependent_expression_p (condition
)
8781 || value_dependent_expression_p (condition
))
8783 /* We're in a template; build a STATIC_ASSERT and put it in
8787 assertion
= make_node (STATIC_ASSERT
);
8788 STATIC_ASSERT_CONDITION (assertion
) = condition
;
8789 STATIC_ASSERT_MESSAGE (assertion
) = message
;
8790 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
8793 maybe_add_class_template_decl_list (current_class_type
,
8797 add_stmt (assertion
);
8802 /* Fold the expression and convert it to a boolean value. */
8803 condition
= instantiate_non_dependent_expr (condition
);
8804 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
8805 condition
= maybe_constant_value (condition
);
8807 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
8808 /* Do nothing; the condition is satisfied. */
8812 location_t saved_loc
= input_location
;
8814 input_location
= location
;
8815 if (TREE_CODE (condition
) == INTEGER_CST
8816 && integer_zerop (condition
))
8818 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
8819 (TREE_TYPE (TREE_TYPE (message
))));
8820 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
8821 /* Report the error. */
8823 error ("static assertion failed");
8825 error ("static assertion failed: %s",
8826 TREE_STRING_POINTER (message
));
8828 else if (condition
&& condition
!= error_mark_node
)
8830 error ("non-constant condition for static assertion");
8831 if (require_potential_rvalue_constant_expression (condition
))
8832 cxx_constant_value (condition
);
8834 input_location
= saved_loc
;
8838 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
8839 suitable for use as a type-specifier.
8841 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
8842 id-expression or a class member access, FALSE when it was parsed as
8843 a full expression. */
8846 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
8847 tsubst_flags_t complain
)
8849 tree type
= NULL_TREE
;
8851 if (!expr
|| error_operand_p (expr
))
8852 return error_mark_node
;
8855 || TREE_CODE (expr
) == TYPE_DECL
8856 || (TREE_CODE (expr
) == BIT_NOT_EXPR
8857 && TYPE_P (TREE_OPERAND (expr
, 0))))
8859 if (complain
& tf_error
)
8860 error ("argument to decltype must be an expression");
8861 return error_mark_node
;
8864 /* Depending on the resolution of DR 1172, we may later need to distinguish
8865 instantiation-dependent but not type-dependent expressions so that, say,
8866 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
8867 if (instantiation_dependent_uneval_expression_p (expr
))
8869 type
= cxx_make_type (DECLTYPE_TYPE
);
8870 DECLTYPE_TYPE_EXPR (type
) = expr
;
8871 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
8872 = id_expression_or_member_access_p
;
8873 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8878 /* The type denoted by decltype(e) is defined as follows: */
8880 expr
= resolve_nondeduced_context (expr
, complain
);
8882 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
8883 return error_mark_node
;
8885 if (type_unknown_p (expr
))
8887 if (complain
& tf_error
)
8888 error ("decltype cannot resolve address of overloaded function");
8889 return error_mark_node
;
8892 /* To get the size of a static data member declared as an array of
8893 unknown bound, we need to instantiate it. */
8895 && VAR_HAD_UNKNOWN_BOUND (expr
)
8896 && DECL_TEMPLATE_INSTANTIATION (expr
))
8897 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
8899 if (id_expression_or_member_access_p
)
8901 /* If e is an id-expression or a class member access (5.2.5
8902 [expr.ref]), decltype(e) is defined as the type of the entity
8903 named by e. If there is no such entity, or e names a set of
8904 overloaded functions, the program is ill-formed. */
8905 if (identifier_p (expr
))
8906 expr
= lookup_name (expr
);
8908 if (INDIRECT_REF_P (expr
))
8909 /* This can happen when the expression is, e.g., "a.b". Just
8910 look at the underlying operand. */
8911 expr
= TREE_OPERAND (expr
, 0);
8913 if (TREE_CODE (expr
) == OFFSET_REF
8914 || TREE_CODE (expr
) == MEMBER_REF
8915 || TREE_CODE (expr
) == SCOPE_REF
)
8916 /* We're only interested in the field itself. If it is a
8917 BASELINK, we will need to see through it in the next
8919 expr
= TREE_OPERAND (expr
, 1);
8921 if (BASELINK_P (expr
))
8922 /* See through BASELINK nodes to the underlying function. */
8923 expr
= BASELINK_FUNCTIONS (expr
);
8925 /* decltype of a decomposition name drops references in the tuple case
8926 (unlike decltype of a normal variable) and keeps cv-qualifiers from
8927 the containing object in the other cases (unlike decltype of a member
8928 access expression). */
8929 if (DECL_DECOMPOSITION_P (expr
))
8931 if (DECL_HAS_VALUE_EXPR_P (expr
))
8932 /* Expr is an array or struct subobject proxy, handle
8933 bit-fields properly. */
8934 return unlowered_expr_type (expr
);
8936 /* Expr is a reference variable for the tuple case. */
8937 return lookup_decomp_type (expr
);
8940 switch (TREE_CODE (expr
))
8943 if (DECL_BIT_FIELD_TYPE (expr
))
8945 type
= DECL_BIT_FIELD_TYPE (expr
);
8948 /* Fall through for fields that aren't bitfields. */
8956 case TEMPLATE_PARM_INDEX
:
8957 expr
= mark_type_use (expr
);
8958 type
= TREE_TYPE (expr
);
8962 type
= error_mark_node
;
8967 mark_type_use (expr
);
8968 type
= is_bitfield_expr_with_lowered_type (expr
);
8970 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
8978 /* We can get here when the id-expression refers to an
8979 enumerator or non-type template parameter. */
8980 type
= TREE_TYPE (expr
);
8984 /* Handle instantiated template non-type arguments. */
8985 type
= TREE_TYPE (expr
);
8991 /* Within a lambda-expression:
8993 Every occurrence of decltype((x)) where x is a possibly
8994 parenthesized id-expression that names an entity of
8995 automatic storage duration is treated as if x were
8996 transformed into an access to a corresponding data member
8997 of the closure type that would have been declared if x
8998 were a use of the denoted entity. */
8999 if (outer_automatic_var_p (expr
)
9000 && current_function_decl
9001 && LAMBDA_FUNCTION_P (current_function_decl
))
9002 type
= capture_decltype (expr
);
9003 else if (error_operand_p (expr
))
9004 type
= error_mark_node
;
9005 else if (expr
== current_class_ptr
)
9006 /* If the expression is just "this", we want the
9007 cv-unqualified pointer for the "this" type. */
9008 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
9011 /* Otherwise, where T is the type of e, if e is an lvalue,
9012 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
9013 cp_lvalue_kind clk
= lvalue_kind (expr
);
9014 type
= unlowered_expr_type (expr
);
9015 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
9017 /* For vector types, pick a non-opaque variant. */
9018 if (VECTOR_TYPE_P (type
))
9019 type
= strip_typedefs (type
);
9021 if (clk
!= clk_none
&& !(clk
& clk_class
))
9022 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
9029 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
9030 __has_nothrow_copy, depending on assign_p. */
9033 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
9040 ix
= lookup_fnfields_1 (type
, cp_assignment_operator_id (NOP_EXPR
));
9043 fns
= (*CLASSTYPE_METHOD_VEC (type
))[ix
];
9045 else if (TYPE_HAS_COPY_CTOR (type
))
9047 /* If construction of the copy constructor was postponed, create
9049 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
9050 lazily_declare_fn (sfk_copy_constructor
, type
);
9051 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
9052 lazily_declare_fn (sfk_move_constructor
, type
);
9053 fns
= CLASSTYPE_CONSTRUCTORS (type
);
9058 for (; fns
; fns
= OVL_NEXT (fns
))
9060 tree fn
= OVL_CURRENT (fns
);
9064 if (copy_fn_p (fn
) == 0)
9067 else if (copy_fn_p (fn
) <= 0)
9070 maybe_instantiate_noexcept (fn
);
9071 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
9078 /* Actually evaluates the trait. */
9081 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
9083 enum tree_code type_code1
;
9086 type_code1
= TREE_CODE (type1
);
9090 case CPTK_HAS_NOTHROW_ASSIGN
:
9091 type1
= strip_array_types (type1
);
9092 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9093 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
9094 || (CLASS_TYPE_P (type1
)
9095 && classtype_has_nothrow_assign_or_copy_p (type1
,
9098 case CPTK_HAS_TRIVIAL_ASSIGN
:
9099 /* ??? The standard seems to be missing the "or array of such a class
9100 type" wording for this trait. */
9101 type1
= strip_array_types (type1
);
9102 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9103 && (trivial_type_p (type1
)
9104 || (CLASS_TYPE_P (type1
)
9105 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
9107 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9108 type1
= strip_array_types (type1
);
9109 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
9110 || (CLASS_TYPE_P (type1
)
9111 && (t
= locate_ctor (type1
))
9112 && (maybe_instantiate_noexcept (t
),
9113 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
9115 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9116 type1
= strip_array_types (type1
);
9117 return (trivial_type_p (type1
)
9118 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
9120 case CPTK_HAS_NOTHROW_COPY
:
9121 type1
= strip_array_types (type1
);
9122 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
9123 || (CLASS_TYPE_P (type1
)
9124 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
9126 case CPTK_HAS_TRIVIAL_COPY
:
9127 /* ??? The standard seems to be missing the "or array of such a class
9128 type" wording for this trait. */
9129 type1
= strip_array_types (type1
);
9130 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9131 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
9133 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9134 type1
= strip_array_types (type1
);
9135 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9136 || (CLASS_TYPE_P (type1
)
9137 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
9139 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9140 return type_has_virtual_destructor (type1
);
9142 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9143 return type_has_unique_obj_representations (type1
);
9145 case CPTK_IS_ABSTRACT
:
9146 return (ABSTRACT_CLASS_TYPE_P (type1
));
9148 case CPTK_IS_BASE_OF
:
9149 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9150 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9151 || DERIVED_FROM_P (type1
, type2
)));
9154 return (NON_UNION_CLASS_TYPE_P (type1
));
9157 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
9160 return (type_code1
== ENUMERAL_TYPE
);
9163 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
9165 case CPTK_IS_LITERAL_TYPE
:
9166 return (literal_type_p (type1
));
9169 return (pod_type_p (type1
));
9171 case CPTK_IS_POLYMORPHIC
:
9172 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
9174 case CPTK_IS_SAME_AS
:
9175 return same_type_p (type1
, type2
);
9177 case CPTK_IS_STD_LAYOUT
:
9178 return (std_layout_type_p (type1
));
9180 case CPTK_IS_TRIVIAL
:
9181 return (trivial_type_p (type1
));
9183 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9184 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9186 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9187 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9189 case CPTK_IS_TRIVIALLY_COPYABLE
:
9190 return (trivially_copyable_p (type1
));
9193 return (type_code1
== UNION_TYPE
);
9201 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9202 void, or a complete type, returns true, otherwise false. */
9205 check_trait_type (tree type
)
9207 if (type
== NULL_TREE
)
9210 if (TREE_CODE (type
) == TREE_LIST
)
9211 return (check_trait_type (TREE_VALUE (type
))
9212 && check_trait_type (TREE_CHAIN (type
)));
9214 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9215 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9218 if (VOID_TYPE_P (type
))
9221 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9224 /* Process a trait expression. */
9227 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9229 if (type1
== error_mark_node
9230 || type2
== error_mark_node
)
9231 return error_mark_node
;
9233 if (processing_template_decl
)
9235 tree trait_expr
= make_node (TRAIT_EXPR
);
9236 TREE_TYPE (trait_expr
) = boolean_type_node
;
9237 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9238 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9239 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9245 case CPTK_HAS_NOTHROW_ASSIGN
:
9246 case CPTK_HAS_TRIVIAL_ASSIGN
:
9247 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9248 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9249 case CPTK_HAS_NOTHROW_COPY
:
9250 case CPTK_HAS_TRIVIAL_COPY
:
9251 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9252 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9253 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9254 case CPTK_IS_ABSTRACT
:
9257 case CPTK_IS_LITERAL_TYPE
:
9259 case CPTK_IS_POLYMORPHIC
:
9260 case CPTK_IS_STD_LAYOUT
:
9261 case CPTK_IS_TRIVIAL
:
9262 case CPTK_IS_TRIVIALLY_COPYABLE
:
9263 if (!check_trait_type (type1
))
9264 return error_mark_node
;
9267 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9268 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9269 if (!check_trait_type (type1
)
9270 || !check_trait_type (type2
))
9271 return error_mark_node
;
9274 case CPTK_IS_BASE_OF
:
9275 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9276 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9277 && !complete_type_or_else (type2
, NULL_TREE
))
9278 /* We already issued an error. */
9279 return error_mark_node
;
9285 case CPTK_IS_SAME_AS
:
9292 return (trait_expr_value (kind
, type1
, type2
)
9293 ? boolean_true_node
: boolean_false_node
);
9296 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9297 which is ignored for C++. */
9300 set_float_const_decimal64 (void)
9305 clear_float_const_decimal64 (void)
9310 float_const_decimal64_p (void)
9316 /* Return true if T designates the implied `this' parameter. */
9319 is_this_parameter (tree t
)
9321 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9323 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
9324 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
9328 /* Insert the deduced return type for an auto function. */
9331 apply_deduced_return_type (tree fco
, tree return_type
)
9335 if (return_type
== error_mark_node
)
9338 if (LAMBDA_FUNCTION_P (fco
))
9340 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
9341 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
9344 if (DECL_CONV_FN_P (fco
))
9345 DECL_NAME (fco
) = mangle_conv_op_name_for_type (return_type
);
9347 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9349 result
= DECL_RESULT (fco
);
9350 if (result
== NULL_TREE
)
9352 if (TREE_TYPE (result
) == return_type
)
9355 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
9356 && !complete_type_or_else (return_type
, NULL_TREE
))
9359 /* We already have a DECL_RESULT from start_preparsed_function.
9360 Now we need to redo the work it and allocate_struct_function
9361 did to reflect the new type. */
9362 gcc_assert (current_function_decl
== fco
);
9363 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9364 TYPE_MAIN_VARIANT (return_type
));
9365 DECL_ARTIFICIAL (result
) = 1;
9366 DECL_IGNORED_P (result
) = 1;
9367 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9370 DECL_RESULT (fco
) = result
;
9372 if (!processing_template_decl
)
9374 bool aggr
= aggregate_value_p (result
, fco
);
9375 #ifdef PCC_STATIC_STRUCT_RETURN
9376 cfun
->returns_pcc_struct
= aggr
;
9378 cfun
->returns_struct
= aggr
;
9383 /* DECL is a local variable or parameter from the surrounding scope of a
9384 lambda-expression. Returns the decltype for a use of the capture field
9385 for DECL even if it hasn't been captured yet. */
9388 capture_decltype (tree decl
)
9390 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9391 /* FIXME do lookup instead of list walk? */
9392 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9396 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9398 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9401 error ("%qD is not captured", decl
);
9402 return error_mark_node
;
9405 type
= TREE_TYPE (decl
);
9406 if (TREE_CODE (type
) == REFERENCE_TYPE
9407 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9408 type
= TREE_TYPE (type
);
9411 case CPLD_REFERENCE
:
9412 type
= TREE_TYPE (decl
);
9413 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9414 type
= build_reference_type (TREE_TYPE (decl
));
9421 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9423 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9424 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9426 type
= build_reference_type (type
);
9431 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9432 this is a right unary fold. Otherwise it is a left unary fold. */
9435 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9437 // Build a pack expansion (assuming expr has pack type).
9438 if (!uses_parameter_packs (expr
))
9440 error_at (location_of (expr
), "operand of fold expression has no "
9441 "unexpanded parameter packs");
9442 return error_mark_node
;
9444 tree pack
= make_pack_expansion (expr
);
9446 // Build the fold expression.
9447 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9448 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
9449 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9454 finish_left_unary_fold_expr (tree expr
, int op
)
9456 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9460 finish_right_unary_fold_expr (tree expr
, int op
)
9462 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9465 /* Build a binary fold expression over EXPR1 and EXPR2. The
9466 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9467 has an unexpanded parameter pack). */
9470 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9472 pack
= make_pack_expansion (pack
);
9473 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9474 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
9475 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9480 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9482 // Determine which expr has an unexpanded parameter pack and
9483 // set the pack and initial term.
9484 bool pack1
= uses_parameter_packs (expr1
);
9485 bool pack2
= uses_parameter_packs (expr2
);
9486 if (pack1
&& !pack2
)
9487 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9488 else if (pack2
&& !pack1
)
9489 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9493 error ("both arguments in binary fold have unexpanded parameter packs");
9495 error ("no unexpanded parameter packs in binary fold");
9497 return error_mark_node
;
9500 /* Finish __builtin_launder (arg). */
9503 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
9505 tree orig_arg
= arg
;
9506 if (!type_dependent_expression_p (arg
))
9507 arg
= decay_conversion (arg
, complain
);
9508 if (error_operand_p (arg
))
9509 return error_mark_node
;
9510 if (!type_dependent_expression_p (arg
)
9511 && TREE_CODE (TREE_TYPE (arg
)) != POINTER_TYPE
)
9513 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
9514 return error_mark_node
;
9516 if (processing_template_decl
)
9518 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
9519 TREE_TYPE (arg
), 1, arg
);
9522 #include "gt-cp-semantics.h"