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 "stringpool.h"
45 #include "gomp-constants.h"
48 /* There routines provide a modular interface to perform many parsing
49 operations. They may therefore be used during actual parsing, or
50 during template instantiation, which may be regarded as a
51 degenerate form of parsing. */
53 static tree
maybe_convert_cond (tree
);
54 static tree
finalize_nrv_r (tree
*, int *, void *);
55 static tree
capture_decltype (tree
);
57 /* Used for OpenMP non-static data member privatization. */
59 static hash_map
<tree
, tree
> *omp_private_member_map
;
60 static vec
<tree
> omp_private_member_vec
;
61 static bool omp_private_member_ignore_next
;
64 /* Deferred Access Checking Overview
65 ---------------------------------
67 Most C++ expressions and declarations require access checking
68 to be performed during parsing. However, in several cases,
69 this has to be treated differently.
71 For member declarations, access checking has to be deferred
72 until more information about the declaration is known. For
84 When we are parsing the function return type `A::X', we don't
85 really know if this is allowed until we parse the function name.
87 Furthermore, some contexts require that access checking is
88 never performed at all. These include class heads, and template
91 Typical use of access checking functions is described here:
93 1. When we enter a context that requires certain access checking
94 mode, the function `push_deferring_access_checks' is called with
95 DEFERRING argument specifying the desired mode. Access checking
96 may be performed immediately (dk_no_deferred), deferred
97 (dk_deferred), or not performed (dk_no_check).
99 2. When a declaration such as a type, or a variable, is encountered,
100 the function `perform_or_defer_access_check' is called. It
101 maintains a vector of all deferred checks.
103 3. The global `current_class_type' or `current_function_decl' is then
104 setup by the parser. `enforce_access' relies on these information
107 4. Upon exiting the context mentioned in step 1,
108 `perform_deferred_access_checks' is called to check all declaration
109 stored in the vector. `pop_deferring_access_checks' is then
110 called to restore the previous access checking mode.
112 In case of parsing error, we simply call `pop_deferring_access_checks'
113 without `perform_deferred_access_checks'. */
115 struct GTY(()) deferred_access
{
116 /* A vector representing name-lookups for which we have deferred
117 checking access controls. We cannot check the accessibility of
118 names used in a decl-specifier-seq until we know what is being
119 declared because code like:
126 A::B* A::f() { return 0; }
128 is valid, even though `A::B' is not generally accessible. */
129 vec
<deferred_access_check
, va_gc
> * GTY(()) deferred_access_checks
;
131 /* The current mode of access checks. */
132 enum deferring_kind deferring_access_checks_kind
;
136 /* Data for deferred access checking. */
137 static GTY(()) vec
<deferred_access
, va_gc
> *deferred_access_stack
;
138 static GTY(()) unsigned deferred_access_no_check
;
140 /* Save the current deferred access states and start deferred
141 access checking iff DEFER_P is true. */
144 push_deferring_access_checks (deferring_kind deferring
)
146 /* For context like template instantiation, access checking
147 disabling applies to all nested context. */
148 if (deferred_access_no_check
|| deferring
== dk_no_check
)
149 deferred_access_no_check
++;
152 deferred_access e
= {NULL
, deferring
};
153 vec_safe_push (deferred_access_stack
, e
);
157 /* Save the current deferred access states and start deferred access
158 checking, continuing the set of deferred checks in CHECKS. */
161 reopen_deferring_access_checks (vec
<deferred_access_check
, va_gc
> * checks
)
163 push_deferring_access_checks (dk_deferred
);
164 if (!deferred_access_no_check
)
165 deferred_access_stack
->last().deferred_access_checks
= checks
;
168 /* Resume deferring access checks again after we stopped doing
172 resume_deferring_access_checks (void)
174 if (!deferred_access_no_check
)
175 deferred_access_stack
->last().deferring_access_checks_kind
= dk_deferred
;
178 /* Stop deferring access checks. */
181 stop_deferring_access_checks (void)
183 if (!deferred_access_no_check
)
184 deferred_access_stack
->last().deferring_access_checks_kind
= dk_no_deferred
;
187 /* Discard the current deferred access checks and restore the
191 pop_deferring_access_checks (void)
193 if (deferred_access_no_check
)
194 deferred_access_no_check
--;
196 deferred_access_stack
->pop ();
199 /* Returns a TREE_LIST representing the deferred checks.
200 The TREE_PURPOSE of each node is the type through which the
201 access occurred; the TREE_VALUE is the declaration named.
204 vec
<deferred_access_check
, va_gc
> *
205 get_deferred_access_checks (void)
207 if (deferred_access_no_check
)
210 return (deferred_access_stack
->last().deferred_access_checks
);
213 /* Take current deferred checks and combine with the
214 previous states if we also defer checks previously.
215 Otherwise perform checks now. */
218 pop_to_parent_deferring_access_checks (void)
220 if (deferred_access_no_check
)
221 deferred_access_no_check
--;
224 vec
<deferred_access_check
, va_gc
> *checks
;
225 deferred_access
*ptr
;
227 checks
= (deferred_access_stack
->last ().deferred_access_checks
);
229 deferred_access_stack
->pop ();
230 ptr
= &deferred_access_stack
->last ();
231 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
234 perform_access_checks (checks
, tf_warning_or_error
);
238 /* Merge with parent. */
240 deferred_access_check
*chk
, *probe
;
242 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
244 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, j
, probe
)
246 if (probe
->binfo
== chk
->binfo
&&
247 probe
->decl
== chk
->decl
&&
248 probe
->diag_decl
== chk
->diag_decl
)
251 /* Insert into parent's checks. */
252 vec_safe_push (ptr
->deferred_access_checks
, *chk
);
259 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
260 is the BINFO indicating the qualifying scope used to access the
261 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
262 or we aren't in SFINAE context or all the checks succeed return TRUE,
266 perform_access_checks (vec
<deferred_access_check
, va_gc
> *checks
,
267 tsubst_flags_t complain
)
270 deferred_access_check
*chk
;
271 location_t loc
= input_location
;
277 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
279 input_location
= chk
->loc
;
280 ok
&= enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
, complain
);
283 input_location
= loc
;
284 return (complain
& tf_error
) ? true : ok
;
287 /* Perform the deferred access checks.
289 After performing the checks, we still have to keep the list
290 `deferred_access_stack->deferred_access_checks' since we may want
291 to check access for them again later in a different context.
298 A::X A::a, x; // No error for `A::a', error for `x'
300 We have to perform deferred access of `A::X', first with `A::a',
301 next with `x'. Return value like perform_access_checks above. */
304 perform_deferred_access_checks (tsubst_flags_t complain
)
306 return perform_access_checks (get_deferred_access_checks (), complain
);
309 /* Defer checking the accessibility of DECL, when looked up in
310 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
311 Return value like perform_access_checks above.
312 If non-NULL, report failures to AFI. */
315 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
,
316 tsubst_flags_t complain
,
317 access_failure_info
*afi
)
320 deferred_access
*ptr
;
321 deferred_access_check
*chk
;
324 /* Exit if we are in a context that no access checking is performed.
326 if (deferred_access_no_check
)
329 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
331 ptr
= &deferred_access_stack
->last ();
333 /* If we are not supposed to defer access checks, just check now. */
334 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
336 bool ok
= enforce_access (binfo
, decl
, diag_decl
, complain
, afi
);
337 return (complain
& tf_error
) ? true : ok
;
340 /* See if we are already going to perform this check. */
341 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, i
, chk
)
343 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
344 chk
->diag_decl
== diag_decl
)
349 /* If not, record the check. */
350 deferred_access_check new_access
= {binfo
, decl
, diag_decl
, input_location
};
351 vec_safe_push (ptr
->deferred_access_checks
, new_access
);
356 /* Returns nonzero if the current statement is a full expression,
357 i.e. temporaries created during that statement should be destroyed
358 at the end of the statement. */
361 stmts_are_full_exprs_p (void)
363 return current_stmt_tree ()->stmts_are_full_exprs_p
;
366 /* T is a statement. Add it to the statement-tree. This is the C++
367 version. The C/ObjC frontends have a slightly different version of
373 enum tree_code code
= TREE_CODE (t
);
375 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
377 if (!EXPR_HAS_LOCATION (t
))
378 SET_EXPR_LOCATION (t
, input_location
);
380 /* When we expand a statement-tree, we must know whether or not the
381 statements are full-expressions. We record that fact here. */
382 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
385 if (code
== LABEL_EXPR
|| code
== CASE_LABEL_EXPR
)
386 STATEMENT_LIST_HAS_LABEL (cur_stmt_list
) = 1;
388 /* Add T to the statement-tree. Non-side-effect statements need to be
389 recorded during statement expressions. */
390 gcc_checking_assert (!stmt_list_stack
->is_empty ());
391 append_to_statement_list_force (t
, &cur_stmt_list
);
396 /* Returns the stmt_tree to which statements are currently being added. */
399 current_stmt_tree (void)
402 ? &cfun
->language
->base
.x_stmt_tree
403 : &scope_chain
->x_stmt_tree
);
406 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
409 maybe_cleanup_point_expr (tree expr
)
411 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
412 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
416 /* Like maybe_cleanup_point_expr except have the type of the new expression be
417 void so we don't need to create a temporary variable to hold the inner
418 expression. The reason why we do this is because the original type might be
419 an aggregate and we cannot create a temporary variable for that type. */
422 maybe_cleanup_point_expr_void (tree expr
)
424 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
425 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
431 /* Create a declaration statement for the declaration given by the DECL. */
434 add_decl_expr (tree decl
)
436 tree r
= build_stmt (DECL_SOURCE_LOCATION (decl
), DECL_EXPR
, decl
);
437 if (DECL_INITIAL (decl
)
438 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
439 r
= maybe_cleanup_point_expr_void (r
);
443 /* Finish a scope. */
446 do_poplevel (tree stmt_list
)
450 if (stmts_are_full_exprs_p ())
451 block
= poplevel (kept_level_p (), 1, 0);
453 stmt_list
= pop_stmt_list (stmt_list
);
455 if (!processing_template_decl
)
457 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
458 /* ??? See c_end_compound_stmt re statement expressions. */
464 /* Begin a new scope. */
467 do_pushlevel (scope_kind sk
)
469 tree ret
= push_stmt_list ();
470 if (stmts_are_full_exprs_p ())
471 begin_scope (sk
, NULL
);
475 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
476 when the current scope is exited. EH_ONLY is true when this is not
477 meant to apply to normal control flow transfer. */
480 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
482 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
483 CLEANUP_EH_ONLY (stmt
) = eh_only
;
485 CLEANUP_BODY (stmt
) = push_stmt_list ();
488 /* Simple infinite loop tracking for -Wreturn-type. We keep a stack of all
489 the current loops, represented by 'NULL_TREE' if we've seen a possible
490 exit, and 'error_mark_node' if not. This is currently used only to
491 suppress the warning about a function with no return statements, and
492 therefore we don't bother noting returns as possible exits. We also
493 don't bother with gotos. */
496 begin_maybe_infinite_loop (tree cond
)
498 /* Only track this while parsing a function, not during instantiation. */
499 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
500 && !processing_template_decl
))
502 bool maybe_infinite
= true;
505 cond
= fold_non_dependent_expr (cond
);
506 maybe_infinite
= integer_nonzerop (cond
);
508 vec_safe_push (cp_function_chain
->infinite_loops
,
509 maybe_infinite
? error_mark_node
: NULL_TREE
);
513 /* A break is a possible exit for the current loop. */
516 break_maybe_infinite_loop (void)
520 cp_function_chain
->infinite_loops
->last() = NULL_TREE
;
523 /* If we reach the end of the loop without seeing a possible exit, we have
527 end_maybe_infinite_loop (tree cond
)
529 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
530 && !processing_template_decl
))
532 tree current
= cp_function_chain
->infinite_loops
->pop();
533 if (current
!= NULL_TREE
)
535 cond
= fold_non_dependent_expr (cond
);
536 if (integer_nonzerop (cond
))
537 current_function_infinite_loop
= 1;
542 /* Begin a conditional that might contain a declaration. When generating
543 normal code, we want the declaration to appear before the statement
544 containing the conditional. When generating template code, we want the
545 conditional to be rendered as the raw DECL_EXPR. */
548 begin_cond (tree
*cond_p
)
550 if (processing_template_decl
)
551 *cond_p
= push_stmt_list ();
554 /* Finish such a conditional. */
557 finish_cond (tree
*cond_p
, tree expr
)
559 if (processing_template_decl
)
561 tree cond
= pop_stmt_list (*cond_p
);
563 if (expr
== NULL_TREE
)
564 /* Empty condition in 'for'. */
565 gcc_assert (empty_expr_stmt_p (cond
));
566 else if (check_for_bare_parameter_packs (expr
))
567 expr
= error_mark_node
;
568 else if (!empty_expr_stmt_p (cond
))
569 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), cond
, expr
);
574 /* If *COND_P specifies a conditional with a declaration, transform the
577 for (; A x = 42;) { }
579 while (true) { A x = 42; if (!x) break; }
580 for (;;) { A x = 42; if (!x) break; }
581 The statement list for BODY will be empty if the conditional did
582 not declare anything. */
585 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
589 if (!TREE_SIDE_EFFECTS (body
))
593 *cond_p
= boolean_true_node
;
595 if_stmt
= begin_if_stmt ();
596 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, false, tf_warning_or_error
);
597 finish_if_stmt_cond (cond
, if_stmt
);
598 finish_break_stmt ();
599 finish_then_clause (if_stmt
);
600 finish_if_stmt (if_stmt
);
603 /* Finish a goto-statement. */
606 finish_goto_stmt (tree destination
)
608 if (identifier_p (destination
))
609 destination
= lookup_label (destination
);
611 /* We warn about unused labels with -Wunused. That means we have to
612 mark the used labels as used. */
613 if (TREE_CODE (destination
) == LABEL_DECL
)
614 TREE_USED (destination
) = 1;
617 if (check_no_cilk (destination
,
618 "Cilk array notation cannot be used as a computed goto expression",
619 "%<_Cilk_spawn%> statement cannot be used as a computed goto expression"))
620 destination
= error_mark_node
;
621 destination
= mark_rvalue_use (destination
);
622 if (!processing_template_decl
)
624 destination
= cp_convert (ptr_type_node
, destination
,
625 tf_warning_or_error
);
626 if (error_operand_p (destination
))
629 = fold_build_cleanup_point_expr (TREE_TYPE (destination
),
634 check_goto (destination
);
636 add_stmt (build_predict_expr (PRED_GOTO
, NOT_TAKEN
));
637 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
640 /* COND is the condition-expression for an if, while, etc.,
641 statement. Convert it to a boolean value, if appropriate.
642 In addition, verify sequence points if -Wsequence-point is enabled. */
645 maybe_convert_cond (tree cond
)
647 /* Empty conditions remain empty. */
651 /* Wait until we instantiate templates before doing conversion. */
652 if (processing_template_decl
)
655 if (warn_sequence_point
)
656 verify_sequence_points (cond
);
658 /* Do the conversion. */
659 cond
= convert_from_reference (cond
);
661 if (TREE_CODE (cond
) == MODIFY_EXPR
662 && !TREE_NO_WARNING (cond
)
665 warning_at (EXPR_LOC_OR_LOC (cond
, input_location
), OPT_Wparentheses
,
666 "suggest parentheses around assignment used as truth value");
667 TREE_NO_WARNING (cond
) = 1;
670 return condition_conversion (cond
);
673 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
676 finish_expr_stmt (tree expr
)
679 location_t loc
= EXPR_LOCATION (expr
);
681 if (expr
!= NULL_TREE
)
683 /* If we ran into a problem, make sure we complained. */
684 gcc_assert (expr
!= error_mark_node
|| seen_error ());
686 if (!processing_template_decl
)
688 if (warn_sequence_point
)
689 verify_sequence_points (expr
);
690 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
692 else if (!type_dependent_expression_p (expr
))
693 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
694 tf_warning_or_error
);
696 if (check_for_bare_parameter_packs (expr
))
697 expr
= error_mark_node
;
699 /* Simplification of inner statement expressions, compound exprs,
700 etc can result in us already having an EXPR_STMT. */
701 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
703 if (TREE_CODE (expr
) != EXPR_STMT
)
704 expr
= build_stmt (loc
, EXPR_STMT
, expr
);
705 expr
= maybe_cleanup_point_expr_void (expr
);
715 /* Begin an if-statement. Returns a newly created IF_STMT if
722 scope
= do_pushlevel (sk_cond
);
723 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
724 NULL_TREE
, NULL_TREE
, scope
);
725 current_binding_level
->this_entity
= r
;
726 begin_cond (&IF_COND (r
));
730 /* Process the COND of an if-statement, which may be given by
734 finish_if_stmt_cond (tree cond
, tree if_stmt
)
736 cond
= maybe_convert_cond (cond
);
737 if (IF_STMT_CONSTEXPR_P (if_stmt
)
738 && is_constant_expression (cond
)
739 && !value_dependent_expression_p (cond
))
741 cond
= instantiate_non_dependent_expr (cond
);
742 cond
= cxx_constant_value (cond
, NULL_TREE
);
744 finish_cond (&IF_COND (if_stmt
), cond
);
746 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
750 /* Finish the then-clause of an if-statement, which may be given by
754 finish_then_clause (tree if_stmt
)
756 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
760 /* Begin the else-clause of an if-statement. */
763 begin_else_clause (tree if_stmt
)
765 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
768 /* Finish the else-clause of an if-statement, which may be given by
772 finish_else_clause (tree if_stmt
)
774 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
777 /* Finish an if-statement. */
780 finish_if_stmt (tree if_stmt
)
782 tree scope
= IF_SCOPE (if_stmt
);
783 IF_SCOPE (if_stmt
) = NULL
;
784 add_stmt (do_poplevel (scope
));
787 /* Begin a while-statement. Returns a newly created WHILE_STMT if
791 begin_while_stmt (void)
794 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
796 WHILE_BODY (r
) = do_pushlevel (sk_block
);
797 begin_cond (&WHILE_COND (r
));
801 /* Process the COND of a while-statement, which may be given by
805 finish_while_stmt_cond (tree cond
, tree while_stmt
, bool ivdep
)
807 if (check_no_cilk (cond
,
808 "Cilk array notation cannot be used as a condition for while statement",
809 "%<_Cilk_spawn%> statement cannot be used as a condition for while statement"))
810 cond
= error_mark_node
;
811 cond
= maybe_convert_cond (cond
);
812 finish_cond (&WHILE_COND (while_stmt
), cond
);
813 begin_maybe_infinite_loop (cond
);
814 if (ivdep
&& cond
!= error_mark_node
)
815 WHILE_COND (while_stmt
) = build3 (ANNOTATE_EXPR
,
816 TREE_TYPE (WHILE_COND (while_stmt
)),
817 WHILE_COND (while_stmt
),
818 build_int_cst (integer_type_node
,
819 annot_expr_ivdep_kind
),
821 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
824 /* Finish a while-statement, which may be given by WHILE_STMT. */
827 finish_while_stmt (tree while_stmt
)
829 end_maybe_infinite_loop (boolean_true_node
);
830 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
833 /* Begin a do-statement. Returns a newly created DO_STMT if
839 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
840 begin_maybe_infinite_loop (boolean_true_node
);
842 DO_BODY (r
) = push_stmt_list ();
846 /* Finish the body of a do-statement, which may be given by DO_STMT. */
849 finish_do_body (tree do_stmt
)
851 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
853 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
854 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
856 if (IS_EMPTY_STMT (body
))
857 warning (OPT_Wempty_body
,
858 "suggest explicit braces around empty body in %<do%> statement");
861 /* Finish a do-statement, which may be given by DO_STMT, and whose
862 COND is as indicated. */
865 finish_do_stmt (tree cond
, tree do_stmt
, bool ivdep
)
867 if (check_no_cilk (cond
,
868 "Cilk array notation cannot be used as a condition for a do-while statement",
869 "%<_Cilk_spawn%> statement cannot be used as a condition for a do-while statement"))
870 cond
= error_mark_node
;
871 cond
= maybe_convert_cond (cond
);
872 end_maybe_infinite_loop (cond
);
873 if (ivdep
&& cond
!= error_mark_node
)
874 cond
= build3 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
875 build_int_cst (integer_type_node
, annot_expr_ivdep_kind
),
877 DO_COND (do_stmt
) = cond
;
880 /* Finish a return-statement. The EXPRESSION returned, if any, is as
884 finish_return_stmt (tree expr
)
889 expr
= check_return_expr (expr
, &no_warning
);
891 if (error_operand_p (expr
)
892 || (flag_openmp
&& !check_omp_return ()))
894 /* Suppress -Wreturn-type for this function. */
895 if (warn_return_type
)
896 TREE_NO_WARNING (current_function_decl
) = true;
897 return error_mark_node
;
900 if (!processing_template_decl
)
902 if (warn_sequence_point
)
903 verify_sequence_points (expr
);
905 if (DECL_DESTRUCTOR_P (current_function_decl
)
906 || (DECL_CONSTRUCTOR_P (current_function_decl
)
907 && targetm
.cxx
.cdtor_returns_this ()))
909 /* Similarly, all destructors must run destructors for
910 base-classes before returning. So, all returns in a
911 destructor get sent to the DTOR_LABEL; finish_function emits
912 code to return a value there. */
913 return finish_goto_stmt (cdtor_label
);
917 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
918 TREE_NO_WARNING (r
) |= no_warning
;
919 r
= maybe_cleanup_point_expr_void (r
);
925 /* Begin the scope of a for-statement or a range-for-statement.
926 Both the returned trees are to be used in a call to
927 begin_for_stmt or begin_range_for_stmt. */
930 begin_for_scope (tree
*init
)
932 tree scope
= NULL_TREE
;
933 if (flag_new_for_scope
> 0)
934 scope
= do_pushlevel (sk_for
);
936 if (processing_template_decl
)
937 *init
= push_stmt_list ();
944 /* Begin a for-statement. Returns a new FOR_STMT.
945 SCOPE and INIT should be the return of begin_for_scope,
949 begin_for_stmt (tree scope
, tree init
)
953 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
954 NULL_TREE
, NULL_TREE
, NULL_TREE
);
956 if (scope
== NULL_TREE
)
958 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
960 scope
= begin_for_scope (&init
);
962 FOR_INIT_STMT (r
) = init
;
963 FOR_SCOPE (r
) = scope
;
968 /* Finish the init-statement of a for-statement, which may be
969 given by FOR_STMT. */
972 finish_init_stmt (tree for_stmt
)
974 if (processing_template_decl
)
975 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
977 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
978 begin_cond (&FOR_COND (for_stmt
));
981 /* Finish the COND of a for-statement, which may be given by
985 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
)
987 if (check_no_cilk (cond
,
988 "Cilk array notation cannot be used in a condition for a for-loop",
989 "%<_Cilk_spawn%> statement cannot be used in a condition for a for-loop"))
990 cond
= error_mark_node
;
991 cond
= maybe_convert_cond (cond
);
992 finish_cond (&FOR_COND (for_stmt
), cond
);
993 begin_maybe_infinite_loop (cond
);
994 if (ivdep
&& cond
!= error_mark_node
)
995 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
996 TREE_TYPE (FOR_COND (for_stmt
)),
998 build_int_cst (integer_type_node
,
999 annot_expr_ivdep_kind
),
1001 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
1004 /* Finish the increment-EXPRESSION in a for-statement, which may be
1005 given by FOR_STMT. */
1008 finish_for_expr (tree expr
, tree for_stmt
)
1012 /* If EXPR is an overloaded function, issue an error; there is no
1013 context available to use to perform overload resolution. */
1014 if (type_unknown_p (expr
))
1016 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
1017 expr
= error_mark_node
;
1019 if (!processing_template_decl
)
1021 if (warn_sequence_point
)
1022 verify_sequence_points (expr
);
1023 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1024 tf_warning_or_error
);
1026 else if (!type_dependent_expression_p (expr
))
1027 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1028 tf_warning_or_error
);
1029 expr
= maybe_cleanup_point_expr_void (expr
);
1030 if (check_for_bare_parameter_packs (expr
))
1031 expr
= error_mark_node
;
1032 FOR_EXPR (for_stmt
) = expr
;
1035 /* Finish the body of a for-statement, which may be given by
1036 FOR_STMT. The increment-EXPR for the loop must be
1038 It can also finish RANGE_FOR_STMT. */
1041 finish_for_stmt (tree for_stmt
)
1043 end_maybe_infinite_loop (boolean_true_node
);
1045 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1046 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1048 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1050 /* Pop the scope for the body of the loop. */
1051 if (flag_new_for_scope
> 0)
1054 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1055 ? &RANGE_FOR_SCOPE (for_stmt
)
1056 : &FOR_SCOPE (for_stmt
));
1059 add_stmt (do_poplevel (scope
));
1063 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1064 SCOPE and INIT should be the return of begin_for_scope,
1066 To finish it call finish_for_stmt(). */
1069 begin_range_for_stmt (tree scope
, tree init
)
1073 begin_maybe_infinite_loop (boolean_false_node
);
1075 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
1076 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1078 if (scope
== NULL_TREE
)
1080 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
1082 scope
= begin_for_scope (&init
);
1085 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
1088 pop_stmt_list (init
);
1089 RANGE_FOR_SCOPE (r
) = scope
;
1094 /* Finish the head of a range-based for statement, which may
1095 be given by RANGE_FOR_STMT. DECL must be the declaration
1096 and EXPR must be the loop expression. */
1099 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
1101 RANGE_FOR_DECL (range_for_stmt
) = decl
;
1102 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
1103 add_stmt (range_for_stmt
);
1104 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
1107 /* Finish a break-statement. */
1110 finish_break_stmt (void)
1112 /* In switch statements break is sometimes stylistically used after
1113 a return statement. This can lead to spurious warnings about
1114 control reaching the end of a non-void function when it is
1115 inlined. Note that we are calling block_may_fallthru with
1116 language specific tree nodes; this works because
1117 block_may_fallthru returns true when given something it does not
1119 if (!block_may_fallthru (cur_stmt_list
))
1121 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1124 /* Finish a continue-statement. */
1127 finish_continue_stmt (void)
1129 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1132 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1136 begin_switch_stmt (void)
1140 scope
= do_pushlevel (sk_cond
);
1141 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1143 begin_cond (&SWITCH_STMT_COND (r
));
1148 /* Finish the cond of a switch-statement. */
1151 finish_switch_cond (tree cond
, tree switch_stmt
)
1153 tree orig_type
= NULL
;
1155 if (check_no_cilk (cond
,
1156 "Cilk array notation cannot be used as a condition for switch statement",
1157 "%<_Cilk_spawn%> statement cannot be used as a condition for switch statement"))
1158 cond
= error_mark_node
;
1160 if (!processing_template_decl
)
1162 /* Convert the condition to an integer or enumeration type. */
1163 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1164 if (cond
== NULL_TREE
)
1166 error ("switch quantity not an integer");
1167 cond
= error_mark_node
;
1169 /* We want unlowered type here to handle enum bit-fields. */
1170 orig_type
= unlowered_expr_type (cond
);
1171 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1172 orig_type
= TREE_TYPE (cond
);
1173 if (cond
!= error_mark_node
)
1177 Integral promotions are performed. */
1178 cond
= perform_integral_promotions (cond
);
1179 cond
= maybe_cleanup_point_expr (cond
);
1182 if (check_for_bare_parameter_packs (cond
))
1183 cond
= error_mark_node
;
1184 else if (!processing_template_decl
&& warn_sequence_point
)
1185 verify_sequence_points (cond
);
1187 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1188 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1189 add_stmt (switch_stmt
);
1190 push_switch (switch_stmt
);
1191 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1194 /* Finish the body of a switch-statement, which may be given by
1195 SWITCH_STMT. The COND to switch on is indicated. */
1198 finish_switch_stmt (tree switch_stmt
)
1202 SWITCH_STMT_BODY (switch_stmt
) =
1203 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1206 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1207 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1208 add_stmt (do_poplevel (scope
));
1211 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1215 begin_try_block (void)
1217 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1219 TRY_STMTS (r
) = push_stmt_list ();
1223 /* Likewise, for a function-try-block. The block returned in
1224 *COMPOUND_STMT is an artificial outer scope, containing the
1225 function-try-block. */
1228 begin_function_try_block (tree
*compound_stmt
)
1231 /* This outer scope does not exist in the C++ standard, but we need
1232 a place to put __FUNCTION__ and similar variables. */
1233 *compound_stmt
= begin_compound_stmt (0);
1234 r
= begin_try_block ();
1235 FN_TRY_BLOCK_P (r
) = 1;
1239 /* Finish a try-block, which may be given by TRY_BLOCK. */
1242 finish_try_block (tree try_block
)
1244 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1245 TRY_HANDLERS (try_block
) = push_stmt_list ();
1248 /* Finish the body of a cleanup try-block, which may be given by
1252 finish_cleanup_try_block (tree try_block
)
1254 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1257 /* Finish an implicitly generated try-block, with a cleanup is given
1261 finish_cleanup (tree cleanup
, tree try_block
)
1263 TRY_HANDLERS (try_block
) = cleanup
;
1264 CLEANUP_P (try_block
) = 1;
1267 /* Likewise, for a function-try-block. */
1270 finish_function_try_block (tree try_block
)
1272 finish_try_block (try_block
);
1273 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1274 the try block, but moving it inside. */
1275 in_function_try_handler
= 1;
1278 /* Finish a handler-sequence for a try-block, which may be given by
1282 finish_handler_sequence (tree try_block
)
1284 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1285 check_handlers (TRY_HANDLERS (try_block
));
1288 /* Finish the handler-seq for a function-try-block, given by
1289 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1290 begin_function_try_block. */
1293 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1295 in_function_try_handler
= 0;
1296 finish_handler_sequence (try_block
);
1297 finish_compound_stmt (compound_stmt
);
1300 /* Begin a handler. Returns a HANDLER if appropriate. */
1303 begin_handler (void)
1307 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1310 /* Create a binding level for the eh_info and the exception object
1312 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1317 /* Finish the handler-parameters for a handler, which may be given by
1318 HANDLER. DECL is the declaration for the catch parameter, or NULL
1319 if this is a `catch (...)' clause. */
1322 finish_handler_parms (tree decl
, tree handler
)
1324 tree type
= NULL_TREE
;
1325 if (processing_template_decl
)
1329 decl
= pushdecl (decl
);
1330 decl
= push_template_decl (decl
);
1331 HANDLER_PARMS (handler
) = decl
;
1332 type
= TREE_TYPE (decl
);
1337 type
= expand_start_catch_block (decl
);
1338 if (warn_catch_value
1339 && type
!= NULL_TREE
1340 && type
!= error_mark_node
1341 && TREE_CODE (TREE_TYPE (decl
)) != REFERENCE_TYPE
)
1343 tree orig_type
= TREE_TYPE (decl
);
1344 if (CLASS_TYPE_P (orig_type
))
1346 if (TYPE_POLYMORPHIC_P (orig_type
))
1347 warning (OPT_Wcatch_value_
,
1348 "catching polymorphic type %q#T by value", orig_type
);
1349 else if (warn_catch_value
> 1)
1350 warning (OPT_Wcatch_value_
,
1351 "catching type %q#T by value", orig_type
);
1353 else if (warn_catch_value
> 2)
1354 warning (OPT_Wcatch_value_
,
1355 "catching non-reference type %q#T", orig_type
);
1358 HANDLER_TYPE (handler
) = type
;
1361 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1362 the return value from the matching call to finish_handler_parms. */
1365 finish_handler (tree handler
)
1367 if (!processing_template_decl
)
1368 expand_end_catch_block ();
1369 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1372 /* Begin a compound statement. FLAGS contains some bits that control the
1373 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1374 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1375 block of a function. If BCS_TRY_BLOCK is set, this is the block
1376 created on behalf of a TRY statement. Returns a token to be passed to
1377 finish_compound_stmt. */
1380 begin_compound_stmt (unsigned int flags
)
1384 if (flags
& BCS_NO_SCOPE
)
1386 r
= push_stmt_list ();
1387 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1389 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1390 But, if it's a statement-expression with a scopeless block, there's
1391 nothing to keep, and we don't want to accidentally keep a block
1392 *inside* the scopeless block. */
1393 keep_next_level (false);
1397 scope_kind sk
= sk_block
;
1398 if (flags
& BCS_TRY_BLOCK
)
1400 else if (flags
& BCS_TRANSACTION
)
1401 sk
= sk_transaction
;
1402 r
= do_pushlevel (sk
);
1405 /* When processing a template, we need to remember where the braces were,
1406 so that we can set up identical scopes when instantiating the template
1407 later. BIND_EXPR is a handy candidate for this.
1408 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1409 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1410 processing templates. */
1411 if (processing_template_decl
)
1413 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1414 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1415 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1416 TREE_SIDE_EFFECTS (r
) = 1;
1422 /* Finish a compound-statement, which is given by STMT. */
1425 finish_compound_stmt (tree stmt
)
1427 if (TREE_CODE (stmt
) == BIND_EXPR
)
1429 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1430 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1431 discard the BIND_EXPR so it can be merged with the containing
1433 if (TREE_CODE (body
) == STATEMENT_LIST
1434 && STATEMENT_LIST_HEAD (body
) == NULL
1435 && !BIND_EXPR_BODY_BLOCK (stmt
)
1436 && !BIND_EXPR_TRY_BLOCK (stmt
))
1439 BIND_EXPR_BODY (stmt
) = body
;
1441 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1442 stmt
= pop_stmt_list (stmt
);
1445 /* Destroy any ObjC "super" receivers that may have been
1447 objc_clear_super_receiver ();
1449 stmt
= do_poplevel (stmt
);
1452 /* ??? See c_end_compound_stmt wrt statement expressions. */
1456 /* Finish an asm-statement, whose components are a STRING, some
1457 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1458 LABELS. Also note whether the asm-statement should be
1459 considered volatile. */
1462 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1463 tree input_operands
, tree clobbers
, tree labels
)
1467 int ninputs
= list_length (input_operands
);
1468 int noutputs
= list_length (output_operands
);
1470 if (!processing_template_decl
)
1472 const char *constraint
;
1473 const char **oconstraints
;
1474 bool allows_mem
, allows_reg
, is_inout
;
1478 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1480 string
= resolve_asm_operand_names (string
, output_operands
,
1481 input_operands
, labels
);
1483 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1485 operand
= TREE_VALUE (t
);
1487 /* ??? Really, this should not be here. Users should be using a
1488 proper lvalue, dammit. But there's a long history of using
1489 casts in the output operands. In cases like longlong.h, this
1490 becomes a primitive form of typechecking -- if the cast can be
1491 removed, then the output operand had a type of the proper width;
1492 otherwise we'll get an error. Gross, but ... */
1493 STRIP_NOPS (operand
);
1495 operand
= mark_lvalue_use (operand
);
1497 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1498 operand
= error_mark_node
;
1500 if (operand
!= error_mark_node
1501 && (TREE_READONLY (operand
)
1502 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1503 /* Functions are not modifiable, even though they are
1505 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1506 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1507 /* If it's an aggregate and any field is const, then it is
1508 effectively const. */
1509 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1510 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1511 cxx_readonly_error (operand
, lv_asm
);
1513 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1514 oconstraints
[i
] = constraint
;
1516 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1517 &allows_mem
, &allows_reg
, &is_inout
))
1519 /* If the operand is going to end up in memory,
1520 mark it addressable. */
1521 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1522 operand
= error_mark_node
;
1525 operand
= error_mark_node
;
1527 TREE_VALUE (t
) = operand
;
1530 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1532 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1533 bool constraint_parsed
1534 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1535 oconstraints
, &allows_mem
, &allows_reg
);
1536 /* If the operand is going to end up in memory, don't call
1537 decay_conversion. */
1538 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1539 operand
= mark_lvalue_use (TREE_VALUE (t
));
1541 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1543 /* If the type of the operand hasn't been determined (e.g.,
1544 because it involves an overloaded function), then issue
1545 an error message. There's no context available to
1546 resolve the overloading. */
1547 if (TREE_TYPE (operand
) == unknown_type_node
)
1549 error ("type of asm operand %qE could not be determined",
1551 operand
= error_mark_node
;
1554 if (constraint_parsed
)
1556 /* If the operand is going to end up in memory,
1557 mark it addressable. */
1558 if (!allows_reg
&& allows_mem
)
1560 /* Strip the nops as we allow this case. FIXME, this really
1561 should be rejected or made deprecated. */
1562 STRIP_NOPS (operand
);
1563 if (!cxx_mark_addressable (operand
))
1564 operand
= error_mark_node
;
1566 else if (!allows_reg
&& !allows_mem
)
1568 /* If constraint allows neither register nor memory,
1569 try harder to get a constant. */
1570 tree constop
= maybe_constant_value (operand
);
1571 if (TREE_CONSTANT (constop
))
1576 operand
= error_mark_node
;
1578 TREE_VALUE (t
) = operand
;
1582 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1583 output_operands
, input_operands
,
1585 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1586 r
= maybe_cleanup_point_expr_void (r
);
1587 return add_stmt (r
);
1590 /* Finish a label with the indicated NAME. Returns the new label. */
1593 finish_label_stmt (tree name
)
1595 tree decl
= define_label (input_location
, name
);
1597 if (decl
== error_mark_node
)
1598 return error_mark_node
;
1600 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1605 /* Finish a series of declarations for local labels. G++ allows users
1606 to declare "local" labels, i.e., labels with scope. This extension
1607 is useful when writing code involving statement-expressions. */
1610 finish_label_decl (tree name
)
1612 if (!at_function_scope_p ())
1614 error ("__label__ declarations are only allowed in function scopes");
1618 add_decl_expr (declare_local_label (name
));
1621 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1624 finish_decl_cleanup (tree decl
, tree cleanup
)
1626 push_cleanup (decl
, cleanup
, false);
1629 /* If the current scope exits with an exception, run CLEANUP. */
1632 finish_eh_cleanup (tree cleanup
)
1634 push_cleanup (NULL
, cleanup
, true);
1637 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1638 order they were written by the user. Each node is as for
1639 emit_mem_initializers. */
1642 finish_mem_initializers (tree mem_inits
)
1644 /* Reorder the MEM_INITS so that they are in the order they appeared
1645 in the source program. */
1646 mem_inits
= nreverse (mem_inits
);
1648 if (processing_template_decl
)
1652 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1654 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1655 check for bare parameter packs in the TREE_VALUE, because
1656 any parameter packs in the TREE_VALUE have already been
1657 bound as part of the TREE_PURPOSE. See
1658 make_pack_expansion for more information. */
1659 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1660 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1661 TREE_VALUE (mem
) = error_mark_node
;
1664 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1665 CTOR_INITIALIZER
, mem_inits
));
1668 emit_mem_initializers (mem_inits
);
1671 /* Obfuscate EXPR if it looks like an id-expression or member access so
1672 that the call to finish_decltype in do_auto_deduction will give the
1676 force_paren_expr (tree expr
)
1678 /* This is only needed for decltype(auto) in C++14. */
1679 if (cxx_dialect
< cxx14
)
1682 /* If we're in unevaluated context, we can't be deducing a
1683 return/initializer type, so we don't need to mess with this. */
1684 if (cp_unevaluated_operand
)
1687 if (!DECL_P (expr
) && TREE_CODE (expr
) != COMPONENT_REF
1688 && TREE_CODE (expr
) != SCOPE_REF
)
1691 if (TREE_CODE (expr
) == COMPONENT_REF
1692 || TREE_CODE (expr
) == SCOPE_REF
)
1693 REF_PARENTHESIZED_P (expr
) = true;
1694 else if (type_dependent_expression_p (expr
))
1695 expr
= build1 (PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1696 else if (VAR_P (expr
) && DECL_HARD_REGISTER (expr
))
1697 /* We can't bind a hard register variable to a reference. */;
1700 cp_lvalue_kind kind
= lvalue_kind (expr
);
1701 if ((kind
& ~clk_class
) != clk_none
)
1703 tree type
= unlowered_expr_type (expr
);
1704 bool rval
= !!(kind
& clk_rvalueref
);
1705 type
= cp_build_reference_type (type
, rval
);
1706 /* This inhibits warnings in, eg, cxx_mark_addressable
1708 warning_sentinel
s (extra_warnings
);
1709 expr
= build_static_cast (type
, expr
, tf_error
);
1710 if (expr
!= error_mark_node
)
1711 REF_PARENTHESIZED_P (expr
) = true;
1718 /* If T is an id-expression obfuscated by force_paren_expr, undo the
1719 obfuscation and return the underlying id-expression. Otherwise
1723 maybe_undo_parenthesized_ref (tree t
)
1725 if (cxx_dialect
>= cxx14
1726 && INDIRECT_REF_P (t
)
1727 && REF_PARENTHESIZED_P (t
))
1729 t
= TREE_OPERAND (t
, 0);
1730 while (TREE_CODE (t
) == NON_LVALUE_EXPR
1731 || TREE_CODE (t
) == NOP_EXPR
)
1732 t
= TREE_OPERAND (t
, 0);
1734 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
1735 || TREE_CODE (t
) == STATIC_CAST_EXPR
);
1736 t
= TREE_OPERAND (t
, 0);
1742 /* Finish a parenthesized expression EXPR. */
1745 finish_parenthesized_expr (cp_expr expr
)
1748 /* This inhibits warnings in c_common_truthvalue_conversion. */
1749 TREE_NO_WARNING (expr
) = 1;
1751 if (TREE_CODE (expr
) == OFFSET_REF
1752 || TREE_CODE (expr
) == SCOPE_REF
)
1753 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1754 enclosed in parentheses. */
1755 PTRMEM_OK_P (expr
) = 0;
1757 if (TREE_CODE (expr
) == STRING_CST
)
1758 PAREN_STRING_LITERAL_P (expr
) = 1;
1760 expr
= cp_expr (force_paren_expr (expr
), expr
.get_location ());
1765 /* Finish a reference to a non-static data member (DECL) that is not
1766 preceded by `.' or `->'. */
1769 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1771 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1772 bool try_omp_private
= !object
&& omp_private_member_map
;
1777 tree scope
= qualifying_scope
;
1778 if (scope
== NULL_TREE
)
1779 scope
= context_for_name_lookup (decl
);
1780 object
= maybe_dummy_object (scope
, NULL
);
1783 object
= maybe_resolve_dummy (object
, true);
1784 if (object
== error_mark_node
)
1785 return error_mark_node
;
1787 /* DR 613/850: Can use non-static data members without an associated
1788 object in sizeof/decltype/alignof. */
1789 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1790 && (!processing_template_decl
|| !current_class_ref
))
1792 if (current_function_decl
1793 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1794 error ("invalid use of member %qD in static member function", decl
);
1796 error ("invalid use of non-static data member %qD", decl
);
1797 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1799 return error_mark_node
;
1802 if (current_class_ptr
)
1803 TREE_USED (current_class_ptr
) = 1;
1804 if (processing_template_decl
&& !qualifying_scope
)
1806 tree type
= TREE_TYPE (decl
);
1808 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1809 /* Quals on the object don't matter. */;
1810 else if (PACK_EXPANSION_P (type
))
1811 /* Don't bother trying to represent this. */
1815 /* Set the cv qualifiers. */
1816 int quals
= cp_type_quals (TREE_TYPE (object
));
1818 if (DECL_MUTABLE_P (decl
))
1819 quals
&= ~TYPE_QUAL_CONST
;
1821 quals
|= cp_type_quals (TREE_TYPE (decl
));
1822 type
= cp_build_qualified_type (type
, quals
);
1825 ret
= (convert_from_reference
1826 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1828 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1829 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1831 else if (processing_template_decl
)
1832 ret
= build_qualified_name (TREE_TYPE (decl
),
1835 /*template_p=*/false);
1838 tree access_type
= TREE_TYPE (object
);
1840 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1841 decl
, tf_warning_or_error
);
1843 /* If the data member was named `C::M', convert `*this' to `C'
1845 if (qualifying_scope
)
1847 tree binfo
= NULL_TREE
;
1848 object
= build_scoped_ref (object
, qualifying_scope
,
1852 ret
= build_class_member_access_expr (object
, decl
,
1853 /*access_path=*/NULL_TREE
,
1854 /*preserve_reference=*/false,
1855 tf_warning_or_error
);
1857 if (try_omp_private
)
1859 tree
*v
= omp_private_member_map
->get (decl
);
1861 ret
= convert_from_reference (*v
);
1866 /* If we are currently parsing a template and we encountered a typedef
1867 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1868 adds the typedef to a list tied to the current template.
1869 At template instantiation time, that list is walked and access check
1870 performed for each typedef.
1871 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1874 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1876 location_t location
)
1878 tree template_info
= NULL
;
1879 tree cs
= current_scope ();
1881 if (!is_typedef_decl (typedef_decl
)
1883 || !CLASS_TYPE_P (context
)
1887 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1888 template_info
= get_template_info (cs
);
1891 && TI_TEMPLATE (template_info
)
1892 && !currently_open_class (context
))
1893 append_type_to_template_for_access_check (cs
, typedef_decl
,
1897 /* DECL was the declaration to which a qualified-id resolved. Issue
1898 an error message if it is not accessible. If OBJECT_TYPE is
1899 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1900 type of `*x', or `x', respectively. If the DECL was named as
1901 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1904 check_accessibility_of_qualified_id (tree decl
,
1906 tree nested_name_specifier
)
1909 tree qualifying_type
= NULL_TREE
;
1911 /* If we are parsing a template declaration and if decl is a typedef,
1912 add it to a list tied to the template.
1913 At template instantiation time, that list will be walked and
1914 access check performed. */
1915 add_typedef_to_current_template_for_access_check (decl
,
1916 nested_name_specifier
1917 ? nested_name_specifier
1918 : DECL_CONTEXT (decl
),
1921 /* If we're not checking, return immediately. */
1922 if (deferred_access_no_check
)
1925 /* Determine the SCOPE of DECL. */
1926 scope
= context_for_name_lookup (decl
);
1927 /* If the SCOPE is not a type, then DECL is not a member. */
1928 if (!TYPE_P (scope
))
1930 /* Compute the scope through which DECL is being accessed. */
1932 /* OBJECT_TYPE might not be a class type; consider:
1934 class A { typedef int I; };
1938 In this case, we will have "A::I" as the DECL, but "I" as the
1940 && CLASS_TYPE_P (object_type
)
1941 && DERIVED_FROM_P (scope
, object_type
))
1942 /* If we are processing a `->' or `.' expression, use the type of the
1944 qualifying_type
= object_type
;
1945 else if (nested_name_specifier
)
1947 /* If the reference is to a non-static member of the
1948 current class, treat it as if it were referenced through
1951 if (DECL_NONSTATIC_MEMBER_P (decl
)
1952 && current_class_ptr
1953 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
1954 qualifying_type
= ct
;
1955 /* Otherwise, use the type indicated by the
1956 nested-name-specifier. */
1958 qualifying_type
= nested_name_specifier
;
1961 /* Otherwise, the name must be from the current class or one of
1963 qualifying_type
= currently_open_derived_class (scope
);
1966 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1967 or similar in a default argument value. */
1968 && CLASS_TYPE_P (qualifying_type
)
1969 && !dependent_type_p (qualifying_type
))
1970 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1971 decl
, tf_warning_or_error
);
1974 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1975 class named to the left of the "::" operator. DONE is true if this
1976 expression is a complete postfix-expression; it is false if this
1977 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1978 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1979 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1980 is true iff this qualified name appears as a template argument. */
1983 finish_qualified_id_expr (tree qualifying_class
,
1988 bool template_arg_p
,
1989 tsubst_flags_t complain
)
1991 gcc_assert (TYPE_P (qualifying_class
));
1993 if (error_operand_p (expr
))
1994 return error_mark_node
;
1996 if ((DECL_P (expr
) || BASELINK_P (expr
))
1997 && !mark_used (expr
, complain
))
1998 return error_mark_node
;
2002 if (TREE_CODE (expr
) == UNBOUND_CLASS_TEMPLATE
)
2003 /* cp_parser_lookup_name thought we were looking for a type,
2004 but we're actually looking for a declaration. */
2005 expr
= build_qualified_name (/*type*/NULL_TREE
,
2006 TYPE_CONTEXT (expr
),
2007 TYPE_IDENTIFIER (expr
),
2008 /*template_p*/true);
2010 check_template_keyword (expr
);
2013 /* If EXPR occurs as the operand of '&', use special handling that
2014 permits a pointer-to-member. */
2015 if (address_p
&& done
)
2017 if (TREE_CODE (expr
) == SCOPE_REF
)
2018 expr
= TREE_OPERAND (expr
, 1);
2019 expr
= build_offset_ref (qualifying_class
, expr
,
2020 /*address_p=*/true, complain
);
2024 /* No need to check access within an enum. */
2025 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
)
2028 /* Within the scope of a class, turn references to non-static
2029 members into expression of the form "this->...". */
2031 /* But, within a template argument, we do not want make the
2032 transformation, as there is no "this" pointer. */
2034 else if (TREE_CODE (expr
) == FIELD_DECL
)
2036 push_deferring_access_checks (dk_no_check
);
2037 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
2039 pop_deferring_access_checks ();
2041 else if (BASELINK_P (expr
))
2043 /* See if any of the functions are non-static members. */
2044 /* If so, the expression may be relative to 'this'. */
2045 if (!shared_member_p (expr
)
2046 && current_class_ptr
2047 && DERIVED_FROM_P (qualifying_class
,
2048 current_nonlambda_class_type ()))
2049 expr
= (build_class_member_access_expr
2050 (maybe_dummy_object (qualifying_class
, NULL
),
2052 BASELINK_ACCESS_BINFO (expr
),
2053 /*preserve_reference=*/false,
2056 /* The expression is a qualified name whose address is not
2058 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
2063 /* In a template, return a SCOPE_REF for most qualified-ids
2064 so that we can check access at instantiation time. But if
2065 we're looking at a member of the current instantiation, we
2066 know we have access and building up the SCOPE_REF confuses
2067 non-type template argument handling. */
2068 if (processing_template_decl
2069 && (!currently_open_class (qualifying_class
)
2070 || TREE_CODE (expr
) == BIT_NOT_EXPR
))
2071 expr
= build_qualified_name (TREE_TYPE (expr
),
2072 qualifying_class
, expr
,
2075 expr
= convert_from_reference (expr
);
2081 /* Begin a statement-expression. The value returned must be passed to
2082 finish_stmt_expr. */
2085 begin_stmt_expr (void)
2087 return push_stmt_list ();
2090 /* Process the final expression of a statement expression. EXPR can be
2091 NULL, if the final expression is empty. Return a STATEMENT_LIST
2092 containing all the statements in the statement-expression, or
2093 ERROR_MARK_NODE if there was an error. */
2096 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2098 if (error_operand_p (expr
))
2100 /* The type of the statement-expression is the type of the last
2102 TREE_TYPE (stmt_expr
) = error_mark_node
;
2103 return error_mark_node
;
2106 /* If the last statement does not have "void" type, then the value
2107 of the last statement is the value of the entire expression. */
2110 tree type
= TREE_TYPE (expr
);
2112 if (processing_template_decl
)
2114 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2115 expr
= add_stmt (expr
);
2116 /* Mark the last statement so that we can recognize it as such at
2117 template-instantiation time. */
2118 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2120 else if (VOID_TYPE_P (type
))
2122 /* Just treat this like an ordinary statement. */
2123 expr
= finish_expr_stmt (expr
);
2127 /* It actually has a value we need to deal with. First, force it
2128 to be an rvalue so that we won't need to build up a copy
2129 constructor call later when we try to assign it to something. */
2130 expr
= force_rvalue (expr
, tf_warning_or_error
);
2131 if (error_operand_p (expr
))
2132 return error_mark_node
;
2134 /* Update for array-to-pointer decay. */
2135 type
= TREE_TYPE (expr
);
2137 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2138 normal statement, but don't convert to void or actually add
2140 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2141 expr
= maybe_cleanup_point_expr (expr
);
2145 /* The type of the statement-expression is the type of the last
2147 TREE_TYPE (stmt_expr
) = type
;
2153 /* Finish a statement-expression. EXPR should be the value returned
2154 by the previous begin_stmt_expr. Returns an expression
2155 representing the statement-expression. */
2158 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2163 if (error_operand_p (stmt_expr
))
2165 pop_stmt_list (stmt_expr
);
2166 return error_mark_node
;
2169 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2171 type
= TREE_TYPE (stmt_expr
);
2172 result
= pop_stmt_list (stmt_expr
);
2173 TREE_TYPE (result
) = type
;
2175 if (processing_template_decl
)
2177 result
= build_min (STMT_EXPR
, type
, result
);
2178 TREE_SIDE_EFFECTS (result
) = 1;
2179 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2181 else if (CLASS_TYPE_P (type
))
2183 /* Wrap the statement-expression in a TARGET_EXPR so that the
2184 temporary object created by the final expression is destroyed at
2185 the end of the full-expression containing the
2186 statement-expression. */
2187 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2193 /* Returns the expression which provides the value of STMT_EXPR. */
2196 stmt_expr_value_expr (tree stmt_expr
)
2198 tree t
= STMT_EXPR_STMT (stmt_expr
);
2200 if (TREE_CODE (t
) == BIND_EXPR
)
2201 t
= BIND_EXPR_BODY (t
);
2203 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2204 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2206 if (TREE_CODE (t
) == EXPR_STMT
)
2207 t
= EXPR_STMT_EXPR (t
);
2212 /* Return TRUE iff EXPR_STMT is an empty list of
2213 expression statements. */
2216 empty_expr_stmt_p (tree expr_stmt
)
2218 tree body
= NULL_TREE
;
2220 if (expr_stmt
== void_node
)
2225 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2226 body
= EXPR_STMT_EXPR (expr_stmt
);
2227 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2233 if (TREE_CODE (body
) == STATEMENT_LIST
)
2234 return tsi_end_p (tsi_start (body
));
2236 return empty_expr_stmt_p (body
);
2241 /* Perform Koenig lookup. FN is the postfix-expression representing
2242 the function (or functions) to call; ARGS are the arguments to the
2243 call. Returns the functions to be considered by overload resolution. */
2246 perform_koenig_lookup (cp_expr fn
, vec
<tree
, va_gc
> *args
,
2247 tsubst_flags_t complain
)
2249 tree identifier
= NULL_TREE
;
2250 tree functions
= NULL_TREE
;
2251 tree tmpl_args
= NULL_TREE
;
2252 bool template_id
= false;
2253 location_t loc
= fn
.get_location ();
2255 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2257 /* Use a separate flag to handle null args. */
2259 tmpl_args
= TREE_OPERAND (fn
, 1);
2260 fn
= TREE_OPERAND (fn
, 0);
2263 /* Find the name of the overloaded function. */
2264 if (identifier_p (fn
))
2269 identifier
= OVL_NAME (functions
);
2272 /* A call to a namespace-scope function using an unqualified name.
2274 Do Koenig lookup -- unless any of the arguments are
2276 if (!any_type_dependent_arguments_p (args
)
2277 && !any_dependent_template_arguments_p (tmpl_args
))
2279 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2282 /* The unqualified name could not be resolved. */
2283 if (complain
& tf_error
)
2284 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2290 if (fn
&& template_id
&& fn
!= error_mark_node
)
2291 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2296 /* Generate an expression for `FN (ARGS)'. This may change the
2299 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2300 as a virtual call, even if FN is virtual. (This flag is set when
2301 encountering an expression where the function name is explicitly
2302 qualified. For example a call to `X::f' never generates a virtual
2305 Returns code for the call. */
2308 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2309 bool koenig_p
, tsubst_flags_t complain
)
2313 vec
<tree
, va_gc
> *orig_args
= NULL
;
2315 if (fn
== error_mark_node
)
2316 return error_mark_node
;
2318 gcc_assert (!TYPE_P (fn
));
2320 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2321 it so that we can tell this is a call to a known function. */
2322 fn
= maybe_undo_parenthesized_ref (fn
);
2326 if (processing_template_decl
)
2328 /* If FN is a local extern declaration or set thereof, look them up
2329 again at instantiation time. */
2330 if (is_overloaded_fn (fn
))
2332 tree ifn
= get_first_fn (fn
);
2333 if (TREE_CODE (ifn
) == FUNCTION_DECL
2334 && DECL_LOCAL_FUNCTION_P (ifn
))
2335 orig_fn
= DECL_NAME (ifn
);
2338 /* If the call expression is dependent, build a CALL_EXPR node
2339 with no type; type_dependent_expression_p recognizes
2340 expressions with no type as being dependent. */
2341 if (type_dependent_expression_p (fn
)
2342 || any_type_dependent_arguments_p (*args
))
2344 result
= build_min_nt_call_vec (orig_fn
, *args
);
2345 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2346 KOENIG_LOOKUP_P (result
) = koenig_p
;
2347 if (is_overloaded_fn (fn
))
2350 lookup_keep (fn
, true);
2355 bool abnormal
= true;
2356 for (lkp_iterator
iter (fn
); abnormal
&& iter
; ++iter
)
2358 tree fndecl
= *iter
;
2359 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2360 || !TREE_THIS_VOLATILE (fndecl
))
2363 /* FIXME: Stop warning about falling off end of non-void
2364 function. But this is wrong. Even if we only see
2365 no-return fns at this point, we could select a
2366 future-defined return fn during instantiation. Or
2369 current_function_returns_abnormally
= 1;
2373 orig_args
= make_tree_vector_copy (*args
);
2374 if (!BASELINK_P (fn
)
2375 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2376 && TREE_TYPE (fn
) != unknown_type_node
)
2377 fn
= build_non_dependent_expr (fn
);
2378 make_args_non_dependent (*args
);
2381 if (TREE_CODE (fn
) == COMPONENT_REF
)
2383 tree member
= TREE_OPERAND (fn
, 1);
2384 if (BASELINK_P (member
))
2386 tree object
= TREE_OPERAND (fn
, 0);
2387 return build_new_method_call (object
, member
,
2390 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2397 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2398 if (TREE_CODE (fn
) == ADDR_EXPR
2399 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2400 fn
= TREE_OPERAND (fn
, 0);
2402 if (is_overloaded_fn (fn
))
2403 fn
= baselink_for_fns (fn
);
2406 if (BASELINK_P (fn
))
2410 /* A call to a member function. From [over.call.func]:
2412 If the keyword this is in scope and refers to the class of
2413 that member function, or a derived class thereof, then the
2414 function call is transformed into a qualified function call
2415 using (*this) as the postfix-expression to the left of the
2416 . operator.... [Otherwise] a contrived object of type T
2417 becomes the implied object argument.
2421 struct A { void f(); };
2422 struct B : public A {};
2423 struct C : public A { void g() { B::f(); }};
2425 "the class of that member function" refers to `A'. But 11.2
2426 [class.access.base] says that we need to convert 'this' to B* as
2427 part of the access, so we pass 'B' to maybe_dummy_object. */
2429 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2431 /* A constructor call always uses a dummy object. (This constructor
2432 call which has the form A::A () is actually invalid and we are
2433 going to reject it later in build_new_method_call.) */
2434 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2437 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2440 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2442 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2447 else if (is_overloaded_fn (fn
))
2449 /* If the function is an overloaded builtin, resolve it. */
2450 if (TREE_CODE (fn
) == FUNCTION_DECL
2451 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2452 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2453 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2457 if (warn_sizeof_pointer_memaccess
2458 && (complain
& tf_warning
)
2459 && !vec_safe_is_empty (*args
)
2460 && !processing_template_decl
)
2462 location_t sizeof_arg_loc
[3];
2465 for (i
= 0; i
< 3; i
++)
2469 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2470 sizeof_arg
[i
] = NULL_TREE
;
2471 if (i
>= (*args
)->length ())
2474 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2476 if (SIZEOF_EXPR_TYPE_P (t
))
2477 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2479 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2480 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2482 sizeof_pointer_memaccess_warning
2483 (sizeof_arg_loc
, fn
, *args
,
2484 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2487 /* A call to a namespace-scope function. */
2488 result
= build_new_function_call (fn
, args
, complain
);
2491 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2493 if (!vec_safe_is_empty (*args
))
2494 error ("arguments to destructor are not allowed");
2495 /* Mark the pseudo-destructor call as having side-effects so
2496 that we do not issue warnings about its use. */
2497 result
= build1 (NOP_EXPR
,
2499 TREE_OPERAND (fn
, 0));
2500 TREE_SIDE_EFFECTS (result
) = 1;
2502 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2503 /* If the "function" is really an object of class type, it might
2504 have an overloaded `operator ()'. */
2505 result
= build_op_call (fn
, args
, complain
);
2508 /* A call where the function is unknown. */
2509 result
= cp_build_function_call_vec (fn
, args
, complain
);
2511 if (processing_template_decl
&& result
!= error_mark_node
)
2513 if (INDIRECT_REF_P (result
))
2514 result
= TREE_OPERAND (result
, 0);
2515 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2516 SET_EXPR_LOCATION (result
, input_location
);
2517 KOENIG_LOOKUP_P (result
) = koenig_p
;
2518 release_tree_vector (orig_args
);
2519 result
= convert_from_reference (result
);
2522 /* Free or retain OVERLOADs from lookup. */
2523 if (is_overloaded_fn (orig_fn
))
2524 lookup_keep (get_fns (orig_fn
), processing_template_decl
);
2529 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2530 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2531 POSTDECREMENT_EXPR.) */
2534 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2536 /* input_location holds the location of the trailing operator token.
2537 Build a location of the form:
2540 with the caret at the operator token, ranging from the start
2541 of EXPR to the end of the operator token. */
2542 location_t combined_loc
= make_location (input_location
,
2544 get_finish (input_location
));
2545 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2546 tf_warning_or_error
);
2547 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2548 result
.set_location (combined_loc
);
2552 /* Finish a use of `this'. Returns an expression for `this'. */
2555 finish_this_expr (void)
2557 tree result
= NULL_TREE
;
2559 if (current_class_ptr
)
2561 tree type
= TREE_TYPE (current_class_ref
);
2563 /* In a lambda expression, 'this' refers to the captured 'this'. */
2564 if (LAMBDA_TYPE_P (type
))
2565 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2567 result
= current_class_ptr
;
2571 /* The keyword 'this' is a prvalue expression. */
2572 return rvalue (result
);
2574 tree fn
= current_nonlambda_function ();
2575 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2576 error ("%<this%> is unavailable for static member functions");
2578 error ("invalid use of %<this%> in non-member function");
2580 error ("invalid use of %<this%> at top level");
2581 return error_mark_node
;
2584 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2585 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2586 the TYPE for the type given. If SCOPE is non-NULL, the expression
2587 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2590 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2593 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2594 return error_mark_node
;
2596 gcc_assert (TYPE_P (destructor
));
2598 if (!processing_template_decl
)
2600 if (scope
== error_mark_node
)
2602 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2603 return error_mark_node
;
2605 if (is_auto (destructor
))
2606 destructor
= TREE_TYPE (object
);
2607 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2610 "qualified type %qT does not match destructor name ~%qT",
2612 return error_mark_node
;
2616 /* [expr.pseudo] says both:
2618 The type designated by the pseudo-destructor-name shall be
2619 the same as the object type.
2623 The cv-unqualified versions of the object type and of the
2624 type designated by the pseudo-destructor-name shall be the
2627 We implement the more generous second sentence, since that is
2628 what most other compilers do. */
2629 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2632 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2633 return error_mark_node
;
2637 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2641 /* Finish an expression of the form CODE EXPR. */
2644 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2645 tsubst_flags_t complain
)
2647 /* Build a location of the form:
2650 with the caret at the operator token, ranging from the start
2651 of the operator token to the end of EXPR. */
2652 location_t combined_loc
= make_location (op_loc
,
2653 op_loc
, expr
.get_finish ());
2654 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2655 /* TODO: build_x_unary_op doesn't always honor the location. */
2656 result
.set_location (combined_loc
);
2658 tree result_ovl
, expr_ovl
;
2660 if (!(complain
& tf_warning
))
2663 result_ovl
= result
;
2666 if (!processing_template_decl
)
2667 expr_ovl
= cp_fully_fold (expr_ovl
);
2669 if (!CONSTANT_CLASS_P (expr_ovl
)
2670 || TREE_OVERFLOW_P (expr_ovl
))
2673 if (!processing_template_decl
)
2674 result_ovl
= cp_fully_fold (result_ovl
);
2676 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2677 overflow_warning (combined_loc
, result_ovl
);
2682 /* Finish a compound-literal expression or C++11 functional cast with aggregate
2683 initializer. TYPE is the type to which the CONSTRUCTOR in COMPOUND_LITERAL
2687 finish_compound_literal (tree type
, tree compound_literal
,
2688 tsubst_flags_t complain
,
2691 if (type
== error_mark_node
)
2692 return error_mark_node
;
2694 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2697 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2698 complain
, fcl_context
);
2699 return cp_build_c_cast (type
, compound_literal
, complain
);
2702 if (!TYPE_OBJ_P (type
))
2704 if (complain
& tf_error
)
2705 error ("compound literal of non-object type %qT", type
);
2706 return error_mark_node
;
2709 if (tree anode
= type_uses_auto (type
))
2710 if (CLASS_PLACEHOLDER_TEMPLATE (anode
))
2712 type
= do_auto_deduction (type
, compound_literal
, anode
, complain
,
2714 if (type
== error_mark_node
)
2715 return error_mark_node
;
2718 if (processing_template_decl
)
2720 TREE_TYPE (compound_literal
) = type
;
2721 /* Mark the expression as a compound literal. */
2722 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2723 if (fcl_context
== fcl_c99
)
2724 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2725 return compound_literal
;
2728 type
= complete_type (type
);
2730 if (TYPE_NON_AGGREGATE_CLASS (type
))
2732 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2733 everywhere that deals with function arguments would be a pain, so
2734 just wrap it in a TREE_LIST. The parser set a flag so we know
2735 that it came from T{} rather than T({}). */
2736 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2737 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2738 return build_functional_cast (type
, compound_literal
, complain
);
2741 if (TREE_CODE (type
) == ARRAY_TYPE
2742 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2743 return error_mark_node
;
2744 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2745 if (SCALAR_TYPE_P (type
)
2746 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2747 && !check_narrowing (type
, compound_literal
, complain
))
2748 return error_mark_node
;
2749 if (TREE_CODE (type
) == ARRAY_TYPE
2750 && TYPE_DOMAIN (type
) == NULL_TREE
)
2752 cp_complete_array_type_or_error (&type
, compound_literal
,
2754 if (type
== error_mark_node
)
2755 return error_mark_node
;
2757 compound_literal
= digest_init_flags (type
, compound_literal
, LOOKUP_NORMAL
,
2759 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2761 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2762 if (fcl_context
== fcl_c99
)
2763 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2766 /* Put static/constant array temporaries in static variables. */
2767 /* FIXME all C99 compound literals should be variables rather than C++
2768 temporaries, unless they are used as an aggregate initializer. */
2769 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2770 && fcl_context
== fcl_c99
2771 && TREE_CODE (type
) == ARRAY_TYPE
2772 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2773 && initializer_constant_valid_p (compound_literal
, type
))
2775 tree decl
= create_temporary_var (type
);
2776 DECL_INITIAL (decl
) = compound_literal
;
2777 TREE_STATIC (decl
) = 1;
2778 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2780 /* 5.19 says that a constant expression can include an
2781 lvalue-rvalue conversion applied to "a glvalue of literal type
2782 that refers to a non-volatile temporary object initialized
2783 with a constant expression". Rather than try to communicate
2784 that this VAR_DECL is a temporary, just mark it constexpr. */
2785 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2786 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2787 TREE_CONSTANT (decl
) = true;
2789 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2790 decl
= pushdecl_top_level (decl
);
2791 DECL_NAME (decl
) = make_anon_name ();
2792 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2793 /* Make sure the destructor is callable. */
2794 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2795 if (clean
== error_mark_node
)
2796 return error_mark_node
;
2800 /* Represent other compound literals with TARGET_EXPR so we produce
2801 an lvalue, but can elide copies. */
2802 if (!VECTOR_TYPE_P (type
))
2803 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2805 return compound_literal
;
2808 /* Return the declaration for the function-name variable indicated by
2812 finish_fname (tree id
)
2816 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2817 if (processing_template_decl
&& current_function_decl
2818 && decl
!= error_mark_node
)
2819 decl
= DECL_NAME (decl
);
2823 /* Finish a translation unit. */
2826 finish_translation_unit (void)
2828 /* In case there were missing closebraces,
2829 get us back to the global binding level. */
2831 while (current_namespace
!= global_namespace
)
2834 /* Do file scope __FUNCTION__ et al. */
2835 finish_fname_decls ();
2838 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2839 Returns the parameter. */
2842 finish_template_type_parm (tree aggr
, tree identifier
)
2844 if (aggr
!= class_type_node
)
2846 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2847 aggr
= class_type_node
;
2850 return build_tree_list (aggr
, identifier
);
2853 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2854 Returns the parameter. */
2857 finish_template_template_parm (tree aggr
, tree identifier
)
2859 tree decl
= build_decl (input_location
,
2860 TYPE_DECL
, identifier
, NULL_TREE
);
2862 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2863 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2864 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2865 DECL_ARTIFICIAL (decl
) = 1;
2867 // Associate the constraints with the underlying declaration,
2868 // not the template.
2869 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2870 tree constr
= build_constraints (reqs
, NULL_TREE
);
2871 set_constraints (decl
, constr
);
2873 end_template_decl ();
2875 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2877 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2878 /*is_primary=*/true, /*is_partial=*/false,
2881 return finish_template_type_parm (aggr
, tmpl
);
2884 /* ARGUMENT is the default-argument value for a template template
2885 parameter. If ARGUMENT is invalid, issue error messages and return
2886 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2889 check_template_template_default_arg (tree argument
)
2891 if (TREE_CODE (argument
) != TEMPLATE_DECL
2892 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2893 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2895 if (TREE_CODE (argument
) == TYPE_DECL
)
2896 error ("invalid use of type %qT as a default value for a template "
2897 "template-parameter", TREE_TYPE (argument
));
2899 error ("invalid default argument for a template template parameter");
2900 return error_mark_node
;
2906 /* Begin a class definition, as indicated by T. */
2909 begin_class_definition (tree t
)
2911 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2912 return error_mark_node
;
2914 if (processing_template_parmlist
)
2916 error ("definition of %q#T inside template parameter list", t
);
2917 return error_mark_node
;
2920 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2921 are passed the same as decimal scalar types. */
2922 if (TREE_CODE (t
) == RECORD_TYPE
2923 && !processing_template_decl
)
2925 tree ns
= TYPE_CONTEXT (t
);
2926 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2927 && DECL_CONTEXT (ns
) == std_node
2929 && id_equal (DECL_NAME (ns
), "decimal"))
2931 const char *n
= TYPE_NAME_STRING (t
);
2932 if ((strcmp (n
, "decimal32") == 0)
2933 || (strcmp (n
, "decimal64") == 0)
2934 || (strcmp (n
, "decimal128") == 0))
2935 TYPE_TRANSPARENT_AGGR (t
) = 1;
2939 /* A non-implicit typename comes from code like:
2941 template <typename T> struct A {
2942 template <typename U> struct A<T>::B ...
2944 This is erroneous. */
2945 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2947 error ("invalid definition of qualified type %qT", t
);
2948 t
= error_mark_node
;
2951 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2953 t
= make_class_type (RECORD_TYPE
);
2954 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2957 if (TYPE_BEING_DEFINED (t
))
2959 t
= make_class_type (TREE_CODE (t
));
2960 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2962 maybe_process_partial_specialization (t
);
2964 TYPE_BEING_DEFINED (t
) = 1;
2965 class_binding_level
->defining_class_p
= 1;
2967 if (flag_pack_struct
)
2970 TYPE_PACKED (t
) = 1;
2971 /* Even though the type is being defined for the first time
2972 here, there might have been a forward declaration, so there
2973 might be cv-qualified variants of T. */
2974 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2975 TYPE_PACKED (v
) = 1;
2977 /* Reset the interface data, at the earliest possible
2978 moment, as it might have been set via a class foo;
2980 if (! TYPE_UNNAMED_P (t
))
2982 struct c_fileinfo
*finfo
= \
2983 get_fileinfo (LOCATION_FILE (input_location
));
2984 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2985 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2986 (t
, finfo
->interface_unknown
);
2988 reset_specialization();
2990 /* Make a declaration for this class in its own scope. */
2991 build_self_reference ();
2996 /* Finish the member declaration given by DECL. */
2999 finish_member_declaration (tree decl
)
3001 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
3004 if (decl
== void_type_node
)
3005 /* The COMPONENT was a friend, not a member, and so there's
3006 nothing for us to do. */
3009 /* We should see only one DECL at a time. */
3010 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
3012 /* Don't add decls after definition. */
3013 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3014 /* We can add lambda types when late parsing default
3016 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3018 /* Set up access control for DECL. */
3020 = (current_access_specifier
== access_private_node
);
3021 TREE_PROTECTED (decl
)
3022 = (current_access_specifier
== access_protected_node
);
3023 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3025 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
3026 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
3029 /* Mark the DECL as a member of the current class, unless it's
3030 a member of an enumeration. */
3031 if (TREE_CODE (decl
) != CONST_DECL
)
3032 DECL_CONTEXT (decl
) = current_class_type
;
3034 if (TREE_CODE (decl
) == USING_DECL
)
3035 /* For now, ignore class-scope USING_DECLS, so that debugging
3036 backends do not see them. */
3037 DECL_IGNORED_P (decl
) = 1;
3039 /* Check for bare parameter packs in the non-static data member
3041 if (TREE_CODE (decl
) == FIELD_DECL
)
3043 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3044 TREE_TYPE (decl
) = error_mark_node
;
3045 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
3046 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
3051 A C language linkage is ignored for the names of class members
3052 and the member function type of class member functions. */
3053 if (DECL_LANG_SPECIFIC (decl
))
3054 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3058 /* Functions and non-functions are added differently. */
3059 if (DECL_DECLARES_FUNCTION_P (decl
))
3060 add
= add_method (current_class_type
, decl
, false);
3061 /* Enter the DECL into the scope of the class, if the class
3062 isn't a closure (whose fields are supposed to be unnamed). */
3063 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3064 || pushdecl_class_level (decl
))
3069 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3070 go at the beginning. The reason is that
3071 legacy_nonfn_member_lookup searches the list in order, and we
3072 want a field name to override a type name so that the "struct
3073 stat hack" will work. In particular:
3075 struct S { enum E { }; static const int E = 5; int ary[S::E]; } s;
3079 if (TREE_CODE (decl
) == TYPE_DECL
)
3080 TYPE_FIELDS (current_class_type
)
3081 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3084 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3085 TYPE_FIELDS (current_class_type
) = decl
;
3088 maybe_add_class_template_decl_list (current_class_type
, decl
,
3093 /* Finish processing a complete template declaration. The PARMS are
3094 the template parameters. */
3097 finish_template_decl (tree parms
)
3100 end_template_decl ();
3102 end_specialization ();
3105 // Returns the template type of the class scope being entered. If we're
3106 // entering a constrained class scope. TYPE is the class template
3107 // scope being entered and we may need to match the intended type with
3108 // a constrained specialization. For example:
3110 // template<Object T>
3111 // struct S { void f(); }; #1
3113 // template<Object T>
3114 // void S<T>::f() { } #2
3116 // We check, in #2, that S<T> refers precisely to the type declared by
3117 // #1 (i.e., that the constraints match). Note that the following should
3118 // be an error since there is no specialization of S<T> that is
3119 // unconstrained, but this is not diagnosed here.
3121 // template<typename T>
3122 // void S<T>::f() { }
3124 // We cannot diagnose this problem here since this function also matches
3125 // qualified template names that are not part of a definition. For example:
3127 // template<Integral T, Floating_point U>
3128 // typename pair<T, U>::first_type void f(T, U);
3130 // Here, it is unlikely that there is a partial specialization of
3131 // pair constrained for for Integral and Floating_point arguments.
3133 // The general rule is: if a constrained specialization with matching
3134 // constraints is found return that type. Also note that if TYPE is not a
3135 // class-type (e.g. a typename type), then no fixup is needed.
3138 fixup_template_type (tree type
)
3140 // Find the template parameter list at the a depth appropriate to
3141 // the scope we're trying to enter.
3142 tree parms
= current_template_parms
;
3143 int depth
= template_class_depth (type
);
3144 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3145 parms
= TREE_CHAIN (parms
);
3148 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3149 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3151 // Search for a specialization whose type and constraints match.
3152 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3153 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3156 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3158 // If the type and constraints match a specialization, then we
3159 // are entering that type.
3160 if (same_type_p (type
, TREE_TYPE (specs
))
3161 && equivalent_constraints (cur_constr
, spec_constr
))
3162 return TREE_TYPE (specs
);
3163 specs
= TREE_CHAIN (specs
);
3166 // If no specialization matches, then must return the type
3167 // previously found.
3171 /* Finish processing a template-id (which names a type) of the form
3172 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3173 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3174 the scope of template-id indicated. */
3177 finish_template_type (tree name
, tree args
, int entering_scope
)
3181 type
= lookup_template_class (name
, args
,
3182 NULL_TREE
, NULL_TREE
, entering_scope
,
3183 tf_warning_or_error
| tf_user
);
3185 /* If we might be entering the scope of a partial specialization,
3186 find the one with the right constraints. */
3189 && CLASS_TYPE_P (type
)
3190 && CLASSTYPE_TEMPLATE_INFO (type
)
3191 && dependent_type_p (type
)
3192 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3193 type
= fixup_template_type (type
);
3195 if (type
== error_mark_node
)
3197 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3198 return TYPE_STUB_DECL (type
);
3200 return TYPE_NAME (type
);
3203 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3204 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3205 BASE_CLASS, or NULL_TREE if an error occurred. The
3206 ACCESS_SPECIFIER is one of
3207 access_{default,public,protected_private}_node. For a virtual base
3208 we set TREE_TYPE. */
3211 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3215 if (base
== error_mark_node
)
3217 error ("invalid base-class specification");
3220 else if (! MAYBE_CLASS_TYPE_P (base
))
3222 error ("%qT is not a class type", base
);
3227 if (cp_type_quals (base
) != 0)
3229 /* DR 484: Can a base-specifier name a cv-qualified
3231 base
= TYPE_MAIN_VARIANT (base
);
3233 result
= build_tree_list (access
, base
);
3235 TREE_TYPE (result
) = integer_type_node
;
3241 /* If FNS is a member function, a set of member functions, or a
3242 template-id referring to one or more member functions, return a
3243 BASELINK for FNS, incorporating the current access context.
3244 Otherwise, return FNS unchanged. */
3247 baselink_for_fns (tree fns
)
3252 if (BASELINK_P (fns
)
3253 || error_operand_p (fns
))
3256 scope
= ovl_scope (fns
);
3257 if (!CLASS_TYPE_P (scope
))
3260 cl
= currently_open_derived_class (scope
);
3263 cl
= TYPE_BINFO (cl
);
3264 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3267 /* Returns true iff DECL is a variable from a function outside
3271 outer_var_p (tree decl
)
3273 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3274 && DECL_FUNCTION_SCOPE_P (decl
)
3275 /* Don't get confused by temporaries. */
3277 && (DECL_CONTEXT (decl
) != current_function_decl
3278 || parsing_nsdmi ()));
3281 /* As above, but also checks that DECL is automatic. */
3284 outer_automatic_var_p (tree decl
)
3286 return (outer_var_p (decl
)
3287 && !TREE_STATIC (decl
));
3290 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3291 rewrite it for lambda capture.
3293 If ODR_USE is true, we're being called from mark_use, and we complain about
3294 use of constant variables. If ODR_USE is false, we're being called for the
3295 id-expression, and we do lambda capture. */
3298 process_outer_var_ref (tree decl
, tsubst_flags_t complain
, bool odr_use
)
3300 if (cp_unevaluated_operand
)
3301 /* It's not a use (3.2) if we're in an unevaluated context. */
3303 if (decl
== error_mark_node
)
3306 tree context
= DECL_CONTEXT (decl
);
3307 tree containing_function
= current_function_decl
;
3308 tree lambda_stack
= NULL_TREE
;
3309 tree lambda_expr
= NULL_TREE
;
3310 tree initializer
= convert_from_reference (decl
);
3312 /* Mark it as used now even if the use is ill-formed. */
3313 if (!mark_used (decl
, complain
))
3314 return error_mark_node
;
3316 if (parsing_nsdmi ())
3317 containing_function
= NULL_TREE
;
3319 if (containing_function
&& LAMBDA_FUNCTION_P (containing_function
))
3321 /* Check whether we've already built a proxy. */
3323 while (is_normal_capture_proxy (var
))
3324 var
= DECL_CAPTURED_VARIABLE (var
);
3325 tree d
= retrieve_local_specialization (var
);
3327 if (d
&& d
!= decl
&& is_capture_proxy (d
))
3329 if (DECL_CONTEXT (d
) == containing_function
)
3330 /* We already have an inner proxy. */
3333 /* We need to capture an outer proxy. */
3334 return process_outer_var_ref (d
, complain
, odr_use
);
3338 /* If we are in a lambda function, we can move out until we hit
3340 2. a non-lambda function, or
3341 3. a non-default capturing lambda function. */
3342 while (context
!= containing_function
3343 /* containing_function can be null with invalid generic lambdas. */
3344 && containing_function
3345 && LAMBDA_FUNCTION_P (containing_function
))
3347 tree closure
= DECL_CONTEXT (containing_function
);
3348 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3350 if (TYPE_CLASS_SCOPE_P (closure
))
3351 /* A lambda in an NSDMI (c++/64496). */
3354 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3358 lambda_stack
= tree_cons (NULL_TREE
,
3363 = decl_function_context (containing_function
);
3366 /* In a lambda within a template, wait until instantiation
3367 time to implicitly capture. */
3368 if (context
== containing_function
3369 && DECL_TEMPLATE_INFO (containing_function
)
3370 && uses_template_parms (DECL_TI_ARGS (containing_function
)))
3373 if (lambda_expr
&& VAR_P (decl
)
3374 && DECL_ANON_UNION_VAR_P (decl
))
3376 if (complain
& tf_error
)
3377 error ("cannot capture member %qD of anonymous union", decl
);
3378 return error_mark_node
;
3380 /* Do lambda capture when processing the id-expression, not when
3381 odr-using a variable. */
3382 if (!odr_use
&& context
== containing_function
)
3384 decl
= add_default_capture (lambda_stack
,
3385 /*id=*/DECL_NAME (decl
),
3388 /* Only an odr-use of an outer automatic variable causes an
3389 error, and a constant variable can decay to a prvalue
3390 constant without odr-use. So don't complain yet. */
3391 else if (!odr_use
&& decl_constant_var_p (decl
))
3393 else if (lambda_expr
)
3395 if (complain
& tf_error
)
3397 error ("%qD is not captured", decl
);
3398 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3399 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3401 inform (location_of (closure
),
3402 "the lambda has no capture-default");
3403 else if (TYPE_CLASS_SCOPE_P (closure
))
3404 inform (UNKNOWN_LOCATION
, "lambda in local class %q+T cannot "
3405 "capture variables from the enclosing context",
3406 TYPE_CONTEXT (closure
));
3407 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3409 return error_mark_node
;
3413 if (complain
& tf_error
)
3416 ? G_("use of local variable with automatic storage from "
3417 "containing function")
3418 : G_("use of parameter from containing function"));
3419 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3421 return error_mark_node
;
3426 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3427 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3428 if non-NULL, is the type or namespace used to explicitly qualify
3429 ID_EXPRESSION. DECL is the entity to which that name has been
3432 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3433 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3434 be set to true if this expression isn't permitted in a
3435 constant-expression, but it is otherwise not set by this function.
3436 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3437 constant-expression, but a non-constant expression is also
3440 DONE is true if this expression is a complete postfix-expression;
3441 it is false if this expression is followed by '->', '[', '(', etc.
3442 ADDRESS_P is true iff this expression is the operand of '&'.
3443 TEMPLATE_P is true iff the qualified-id was of the form
3444 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3445 appears as a template argument.
3447 If an error occurs, and it is the kind of error that might cause
3448 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3449 is the caller's responsibility to issue the message. *ERROR_MSG
3450 will be a string with static storage duration, so the caller need
3453 Return an expression for the entity, after issuing appropriate
3454 diagnostics. This function is also responsible for transforming a
3455 reference to a non-static member into a COMPONENT_REF that makes
3456 the use of "this" explicit.
3458 Upon return, *IDK will be filled in appropriately. */
3460 finish_id_expression (tree id_expression
,
3464 bool integral_constant_expression_p
,
3465 bool allow_non_integral_constant_expression_p
,
3466 bool *non_integral_constant_expression_p
,
3470 bool template_arg_p
,
3471 const char **error_msg
,
3472 location_t location
)
3474 decl
= strip_using_decl (decl
);
3476 /* Initialize the output parameters. */
3477 *idk
= CP_ID_KIND_NONE
;
3480 if (id_expression
== error_mark_node
)
3481 return error_mark_node
;
3482 /* If we have a template-id, then no further lookup is
3483 required. If the template-id was for a template-class, we
3484 will sometimes have a TYPE_DECL at this point. */
3485 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3486 || TREE_CODE (decl
) == TYPE_DECL
)
3488 /* Look up the name. */
3491 if (decl
== error_mark_node
)
3493 /* Name lookup failed. */
3496 || (!dependent_type_p (scope
)
3497 && !(identifier_p (id_expression
)
3498 && IDENTIFIER_CONV_OP_P (id_expression
)
3499 && dependent_type_p (TREE_TYPE (id_expression
))))))
3501 /* If the qualifying type is non-dependent (and the name
3502 does not name a conversion operator to a dependent
3503 type), issue an error. */
3504 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3505 return error_mark_node
;
3509 /* It may be resolved via Koenig lookup. */
3510 *idk
= CP_ID_KIND_UNQUALIFIED
;
3511 return id_expression
;
3514 decl
= id_expression
;
3516 /* If DECL is a variable that would be out of scope under
3517 ANSI/ISO rules, but in scope in the ARM, name lookup
3518 will succeed. Issue a diagnostic here. */
3520 decl
= check_for_out_of_scope_variable (decl
);
3522 /* Remember that the name was used in the definition of
3523 the current class so that we can check later to see if
3524 the meaning would have been different after the class
3525 was entirely defined. */
3526 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3527 maybe_note_name_used_in_class (id_expression
, decl
);
3529 /* A use in unevaluated operand might not be instantiated appropriately
3530 if tsubst_copy builds a dummy parm, or if we never instantiate a
3531 generic lambda, so mark it now. */
3532 if (processing_template_decl
&& cp_unevaluated_operand
)
3533 mark_type_use (decl
);
3535 /* Disallow uses of local variables from containing functions, except
3536 within lambda-expressions. */
3537 if (outer_automatic_var_p (decl
))
3539 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3540 if (decl
== error_mark_node
)
3541 return error_mark_node
;
3544 /* Also disallow uses of function parameters outside the function
3545 body, except inside an unevaluated context (i.e. decltype). */
3546 if (TREE_CODE (decl
) == PARM_DECL
3547 && DECL_CONTEXT (decl
) == NULL_TREE
3548 && !cp_unevaluated_operand
)
3550 *error_msg
= G_("use of parameter outside function body");
3551 return error_mark_node
;
3555 /* If we didn't find anything, or what we found was a type,
3556 then this wasn't really an id-expression. */
3557 if (TREE_CODE (decl
) == TEMPLATE_DECL
3558 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3560 *error_msg
= G_("missing template arguments");
3561 return error_mark_node
;
3563 else if (TREE_CODE (decl
) == TYPE_DECL
3564 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3566 *error_msg
= G_("expected primary-expression");
3567 return error_mark_node
;
3570 /* If the name resolved to a template parameter, there is no
3571 need to look it up again later. */
3572 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3573 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3577 *idk
= CP_ID_KIND_NONE
;
3578 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3579 decl
= TEMPLATE_PARM_DECL (decl
);
3580 r
= convert_from_reference (DECL_INITIAL (decl
));
3582 if (integral_constant_expression_p
3583 && !dependent_type_p (TREE_TYPE (decl
))
3584 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3586 if (!allow_non_integral_constant_expression_p
)
3587 error ("template parameter %qD of type %qT is not allowed in "
3588 "an integral constant expression because it is not of "
3589 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3590 *non_integral_constant_expression_p
= true;
3596 bool dependent_p
= type_dependent_expression_p (decl
);
3598 /* If the declaration was explicitly qualified indicate
3599 that. The semantics of `A::f(3)' are different than
3600 `f(3)' if `f' is virtual. */
3602 ? CP_ID_KIND_QUALIFIED
3603 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3604 ? CP_ID_KIND_TEMPLATE_ID
3606 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3607 : CP_ID_KIND_UNQUALIFIED
)));
3611 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3612 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3613 wrong, so just return the identifier. */
3614 return id_expression
;
3616 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3618 error ("use of namespace %qD as expression", decl
);
3619 return error_mark_node
;
3621 else if (DECL_CLASS_TEMPLATE_P (decl
))
3623 error ("use of class template %qT as expression", decl
);
3624 return error_mark_node
;
3626 else if (TREE_CODE (decl
) == TREE_LIST
)
3628 /* Ambiguous reference to base members. */
3629 error ("request for member %qD is ambiguous in "
3630 "multiple inheritance lattice", id_expression
);
3631 print_candidates (decl
);
3632 return error_mark_node
;
3635 /* Mark variable-like entities as used. Functions are similarly
3636 marked either below or after overload resolution. */
3638 || TREE_CODE (decl
) == PARM_DECL
3639 || TREE_CODE (decl
) == CONST_DECL
3640 || TREE_CODE (decl
) == RESULT_DECL
)
3641 && !mark_used (decl
))
3642 return error_mark_node
;
3644 /* Only certain kinds of names are allowed in constant
3645 expression. Template parameters have already
3646 been handled above. */
3647 if (! error_operand_p (decl
)
3649 && integral_constant_expression_p
3650 && ! decl_constant_var_p (decl
)
3651 && TREE_CODE (decl
) != CONST_DECL
3652 && ! builtin_valid_in_constant_expr_p (decl
))
3654 if (!allow_non_integral_constant_expression_p
)
3656 error ("%qD cannot appear in a constant-expression", decl
);
3657 return error_mark_node
;
3659 *non_integral_constant_expression_p
= true;
3664 && !cp_unevaluated_operand
3665 && !processing_template_decl
3666 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3667 && CP_DECL_THREAD_LOCAL_P (decl
)
3668 && (wrap
= get_tls_wrapper_fn (decl
)))
3670 /* Replace an evaluated use of the thread_local variable with
3671 a call to its wrapper. */
3672 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3674 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3676 && variable_template_p (TREE_OPERAND (decl
, 0)))
3678 decl
= finish_template_variable (decl
);
3680 decl
= convert_from_reference (decl
);
3684 if (TREE_CODE (decl
) == SCOPE_REF
)
3686 gcc_assert (same_type_p (scope
, TREE_OPERAND (decl
, 0)));
3687 decl
= TREE_OPERAND (decl
, 1);
3690 decl
= (adjust_result_of_qualified_name_lookup
3691 (decl
, scope
, current_nonlambda_class_type()));
3693 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3697 decl
= finish_qualified_id_expr (scope
,
3703 tf_warning_or_error
);
3705 decl
= convert_from_reference (decl
);
3707 else if (TREE_CODE (decl
) == FIELD_DECL
)
3709 /* Since SCOPE is NULL here, this is an unqualified name.
3710 Access checking has been performed during name lookup
3711 already. Turn off checking to avoid duplicate errors. */
3712 push_deferring_access_checks (dk_no_check
);
3713 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3714 /*qualifying_scope=*/NULL_TREE
);
3715 pop_deferring_access_checks ();
3717 else if (is_overloaded_fn (decl
))
3719 tree first_fn
= get_first_fn (decl
);
3721 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3722 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3724 /* [basic.def.odr]: "A function whose name appears as a
3725 potentially-evaluated expression is odr-used if it is the unique
3728 But only mark it if it's a complete postfix-expression; in a call,
3729 ADL might select a different function, and we'll call mark_used in
3732 && !really_overloaded_fn (decl
)
3733 && !mark_used (first_fn
))
3734 return error_mark_node
;
3737 && TREE_CODE (first_fn
) == FUNCTION_DECL
3738 && DECL_FUNCTION_MEMBER_P (first_fn
)
3739 && !shared_member_p (decl
))
3741 /* A set of member functions. */
3742 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3743 return finish_class_member_access_expr (decl
, id_expression
,
3744 /*template_p=*/false,
3745 tf_warning_or_error
);
3748 decl
= baselink_for_fns (decl
);
3752 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3753 && DECL_CLASS_SCOPE_P (decl
))
3755 tree context
= context_for_name_lookup (decl
);
3756 if (context
!= current_class_type
)
3758 tree path
= currently_open_derived_class (context
);
3759 perform_or_defer_access_check (TYPE_BINFO (path
),
3761 tf_warning_or_error
);
3765 decl
= convert_from_reference (decl
);
3769 return cp_expr (decl
, location
);
3772 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3773 use as a type-specifier. */
3776 finish_typeof (tree expr
)
3780 if (type_dependent_expression_p (expr
))
3782 type
= cxx_make_type (TYPEOF_TYPE
);
3783 TYPEOF_TYPE_EXPR (type
) = expr
;
3784 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3789 expr
= mark_type_use (expr
);
3791 type
= unlowered_expr_type (expr
);
3793 if (!type
|| type
== unknown_type_node
)
3795 error ("type of %qE is unknown", expr
);
3796 return error_mark_node
;
3802 /* Implement the __underlying_type keyword: Return the underlying
3803 type of TYPE, suitable for use as a type-specifier. */
3806 finish_underlying_type (tree type
)
3808 tree underlying_type
;
3810 if (processing_template_decl
)
3812 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3813 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3814 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3816 return underlying_type
;
3819 if (!complete_type_or_else (type
, NULL_TREE
))
3820 return error_mark_node
;
3822 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3824 error ("%qT is not an enumeration type", type
);
3825 return error_mark_node
;
3828 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3830 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3831 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3832 See finish_enum_value_list for details. */
3833 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3835 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3836 TYPE_UNSIGNED (underlying_type
));
3838 return underlying_type
;
3841 /* Implement the __direct_bases keyword: Return the direct base classes
3845 calculate_direct_bases (tree type
)
3847 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3848 tree bases_vec
= NULL_TREE
;
3849 vec
<tree
, va_gc
> *base_binfos
;
3853 complete_type (type
);
3855 if (!NON_UNION_CLASS_TYPE_P (type
))
3856 return make_tree_vec (0);
3858 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3860 /* Virtual bases are initialized first */
3861 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3863 if (BINFO_VIRTUAL_P (binfo
))
3865 vec_safe_push (vector
, binfo
);
3869 /* Now non-virtuals */
3870 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3872 if (!BINFO_VIRTUAL_P (binfo
))
3874 vec_safe_push (vector
, binfo
);
3879 bases_vec
= make_tree_vec (vector
->length ());
3881 for (i
= 0; i
< vector
->length (); ++i
)
3883 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3888 /* Implement the __bases keyword: Return the base classes
3891 /* Find morally non-virtual base classes by walking binfo hierarchy */
3892 /* Virtual base classes are handled separately in finish_bases */
3895 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3897 /* Don't walk bases of virtual bases */
3898 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3902 dfs_calculate_bases_post (tree binfo
, void *data_
)
3904 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3905 if (!BINFO_VIRTUAL_P (binfo
))
3907 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3912 /* Calculates the morally non-virtual base classes of a class */
3913 static vec
<tree
, va_gc
> *
3914 calculate_bases_helper (tree type
)
3916 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3918 /* Now add non-virtual base classes in order of construction */
3919 if (TYPE_BINFO (type
))
3920 dfs_walk_all (TYPE_BINFO (type
),
3921 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3926 calculate_bases (tree type
)
3928 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3929 tree bases_vec
= NULL_TREE
;
3931 vec
<tree
, va_gc
> *vbases
;
3932 vec
<tree
, va_gc
> *nonvbases
;
3935 complete_type (type
);
3937 if (!NON_UNION_CLASS_TYPE_P (type
))
3938 return make_tree_vec (0);
3940 /* First go through virtual base classes */
3941 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3942 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3944 vec
<tree
, va_gc
> *vbase_bases
;
3945 vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3946 vec_safe_splice (vector
, vbase_bases
);
3947 release_tree_vector (vbase_bases
);
3950 /* Now for the non-virtual bases */
3951 nonvbases
= calculate_bases_helper (type
);
3952 vec_safe_splice (vector
, nonvbases
);
3953 release_tree_vector (nonvbases
);
3955 /* Note that during error recovery vector->length can even be zero. */
3956 if (vector
->length () > 1)
3958 /* Last element is entire class, so don't copy */
3959 bases_vec
= make_tree_vec (vector
->length() - 1);
3961 for (i
= 0; i
< vector
->length () - 1; ++i
)
3962 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3965 bases_vec
= make_tree_vec (0);
3967 release_tree_vector (vector
);
3972 finish_bases (tree type
, bool direct
)
3974 tree bases
= NULL_TREE
;
3976 if (!processing_template_decl
)
3978 /* Parameter packs can only be used in templates */
3979 error ("Parameter pack __bases only valid in template declaration");
3980 return error_mark_node
;
3983 bases
= cxx_make_type (BASES
);
3984 BASES_TYPE (bases
) = type
;
3985 BASES_DIRECT (bases
) = direct
;
3986 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3991 /* Perform C++-specific checks for __builtin_offsetof before calling
3995 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
3997 /* If we're processing a template, we can't finish the semantics yet.
3998 Otherwise we can fold the entire expression now. */
3999 if (processing_template_decl
)
4001 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4002 SET_EXPR_LOCATION (expr
, loc
);
4006 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4008 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4009 TREE_OPERAND (expr
, 2));
4010 return error_mark_node
;
4012 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
4013 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
4014 || TREE_TYPE (expr
) == unknown_type_node
)
4016 if (INDIRECT_REF_P (expr
))
4017 error ("second operand of %<offsetof%> is neither a single "
4018 "identifier nor a sequence of member accesses and "
4019 "array references");
4022 if (TREE_CODE (expr
) == COMPONENT_REF
4023 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4024 expr
= TREE_OPERAND (expr
, 1);
4025 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4027 return error_mark_node
;
4029 if (REFERENCE_REF_P (expr
))
4030 expr
= TREE_OPERAND (expr
, 0);
4031 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4032 return error_mark_node
;
4033 if (warn_invalid_offsetof
4034 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4035 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4036 && cp_unevaluated_operand
== 0)
4037 pedwarn (loc
, OPT_Winvalid_offsetof
,
4038 "offsetof within non-standard-layout type %qT is undefined",
4039 TREE_TYPE (TREE_TYPE (object_ptr
)));
4040 return fold_offsetof (expr
);
4043 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4044 function is broken out from the above for the benefit of the tree-ssa
4048 simplify_aggr_init_expr (tree
*tp
)
4050 tree aggr_init_expr
= *tp
;
4052 /* Form an appropriate CALL_EXPR. */
4053 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4054 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4055 tree type
= TREE_TYPE (slot
);
4058 enum style_t
{ ctor
, arg
, pcc
} style
;
4060 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4062 #ifdef PCC_STATIC_STRUCT_RETURN
4068 gcc_assert (TREE_ADDRESSABLE (type
));
4072 call_expr
= build_call_array_loc (input_location
,
4073 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4075 aggr_init_expr_nargs (aggr_init_expr
),
4076 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4077 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4078 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4079 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4080 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4081 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4082 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4083 /* Preserve CILK_SPAWN flag. */
4084 EXPR_CILK_SPAWN (call_expr
) = EXPR_CILK_SPAWN (aggr_init_expr
);
4088 /* Replace the first argument to the ctor with the address of the
4090 cxx_mark_addressable (slot
);
4091 CALL_EXPR_ARG (call_expr
, 0) =
4092 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4094 else if (style
== arg
)
4096 /* Just mark it addressable here, and leave the rest to
4097 expand_call{,_inline}. */
4098 cxx_mark_addressable (slot
);
4099 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4100 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4102 else if (style
== pcc
)
4104 /* If we're using the non-reentrant PCC calling convention, then we
4105 need to copy the returned value out of the static buffer into the
4107 push_deferring_access_checks (dk_no_check
);
4108 call_expr
= build_aggr_init (slot
, call_expr
,
4109 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4110 tf_warning_or_error
);
4111 pop_deferring_access_checks ();
4112 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4115 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4117 tree init
= build_zero_init (type
, NULL_TREE
,
4118 /*static_storage_p=*/false);
4119 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4120 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4127 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4130 emit_associated_thunks (tree fn
)
4132 /* When we use vcall offsets, we emit thunks with the virtual
4133 functions to which they thunk. The whole point of vcall offsets
4134 is so that you can know statically the entire set of thunks that
4135 will ever be needed for a given virtual function, thereby
4136 enabling you to output all the thunks with the function itself. */
4137 if (DECL_VIRTUAL_P (fn
)
4138 /* Do not emit thunks for extern template instantiations. */
4139 && ! DECL_REALLY_EXTERN (fn
))
4143 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4145 if (!THUNK_ALIAS (thunk
))
4147 use_thunk (thunk
, /*emit_p=*/1);
4148 if (DECL_RESULT_THUNK_P (thunk
))
4152 for (probe
= DECL_THUNKS (thunk
);
4153 probe
; probe
= DECL_CHAIN (probe
))
4154 use_thunk (probe
, /*emit_p=*/1);
4158 gcc_assert (!DECL_THUNKS (thunk
));
4163 /* Generate RTL for FN. */
4166 expand_or_defer_fn_1 (tree fn
)
4168 /* When the parser calls us after finishing the body of a template
4169 function, we don't really want to expand the body. */
4170 if (processing_template_decl
)
4172 /* Normally, collection only occurs in rest_of_compilation. So,
4173 if we don't collect here, we never collect junk generated
4174 during the processing of templates until we hit a
4175 non-template function. It's not safe to do this inside a
4176 nested class, though, as the parser may have local state that
4177 is not a GC root. */
4178 if (!function_depth
)
4183 gcc_assert (DECL_SAVED_TREE (fn
));
4185 /* We make a decision about linkage for these functions at the end
4186 of the compilation. Until that point, we do not want the back
4187 end to output them -- but we do want it to see the bodies of
4188 these functions so that it can inline them as appropriate. */
4189 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4191 if (DECL_INTERFACE_KNOWN (fn
))
4192 /* We've already made a decision as to how this function will
4195 tentative_decl_linkage (fn
);
4197 import_export_decl (fn
);
4199 /* If the user wants us to keep all inline functions, then mark
4200 this function as needed so that finish_file will make sure to
4201 output it later. Similarly, all dllexport'd functions must
4202 be emitted; there may be callers in other DLLs. */
4203 if (DECL_DECLARED_INLINE_P (fn
)
4204 && !DECL_REALLY_EXTERN (fn
)
4205 && (flag_keep_inline_functions
4206 || (flag_keep_inline_dllexport
4207 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4210 DECL_EXTERNAL (fn
) = 0;
4214 /* If this is a constructor or destructor body, we have to clone
4216 if (maybe_clone_body (fn
))
4218 /* We don't want to process FN again, so pretend we've written
4219 it out, even though we haven't. */
4220 TREE_ASM_WRITTEN (fn
) = 1;
4221 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4222 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4223 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4227 /* There's no reason to do any of the work here if we're only doing
4228 semantic analysis; this code just generates RTL. */
4229 if (flag_syntax_only
)
4236 expand_or_defer_fn (tree fn
)
4238 if (expand_or_defer_fn_1 (fn
))
4242 /* Expand or defer, at the whim of the compilation unit manager. */
4243 cgraph_node::finalize_function (fn
, function_depth
> 1);
4244 emit_associated_thunks (fn
);
4252 nrv_data () : visited (37) {}
4256 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4259 /* Helper function for walk_tree, used by finalize_nrv below. */
4262 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4264 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4267 /* No need to walk into types. There wouldn't be any need to walk into
4268 non-statements, except that we have to consider STMT_EXPRs. */
4271 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4272 but differs from using NULL_TREE in that it indicates that we care
4273 about the value of the RESULT_DECL. */
4274 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4275 TREE_OPERAND (*tp
, 0) = dp
->result
;
4276 /* Change all cleanups for the NRV to only run when an exception is
4278 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4279 && CLEANUP_DECL (*tp
) == dp
->var
)
4280 CLEANUP_EH_ONLY (*tp
) = 1;
4281 /* Replace the DECL_EXPR for the NRV with an initialization of the
4282 RESULT_DECL, if needed. */
4283 else if (TREE_CODE (*tp
) == DECL_EXPR
4284 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4287 if (DECL_INITIAL (dp
->var
)
4288 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4289 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4290 DECL_INITIAL (dp
->var
));
4292 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4293 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4294 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4297 /* And replace all uses of the NRV with the RESULT_DECL. */
4298 else if (*tp
== dp
->var
)
4301 /* Avoid walking into the same tree more than once. Unfortunately, we
4302 can't just use walk_tree_without duplicates because it would only call
4303 us for the first occurrence of dp->var in the function body. */
4304 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4310 /* Keep iterating. */
4314 /* Called from finish_function to implement the named return value
4315 optimization by overriding all the RETURN_EXPRs and pertinent
4316 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4317 RESULT_DECL for the function. */
4320 finalize_nrv (tree
*tp
, tree var
, tree result
)
4322 struct nrv_data data
;
4324 /* Copy name from VAR to RESULT. */
4325 DECL_NAME (result
) = DECL_NAME (var
);
4326 /* Don't forget that we take its address. */
4327 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4328 /* Finally set DECL_VALUE_EXPR to avoid assigning
4329 a stack slot at -O0 for the original var and debug info
4330 uses RESULT location for VAR. */
4331 SET_DECL_VALUE_EXPR (var
, result
);
4332 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4335 data
.result
= result
;
4336 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4339 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4342 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4343 bool need_copy_ctor
, bool need_copy_assignment
,
4346 int save_errorcount
= errorcount
;
4349 /* Always allocate 3 elements for simplicity. These are the
4350 function decls for the ctor, dtor, and assignment op.
4351 This layout is known to the three lang hooks,
4352 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4353 and cxx_omp_clause_assign_op. */
4354 info
= make_tree_vec (3);
4355 CP_OMP_CLAUSE_INFO (c
) = info
;
4357 if (need_default_ctor
|| need_copy_ctor
)
4359 if (need_default_ctor
)
4360 t
= get_default_ctor (type
);
4362 t
= get_copy_ctor (type
, tf_warning_or_error
);
4364 if (t
&& !trivial_fn_p (t
))
4365 TREE_VEC_ELT (info
, 0) = t
;
4368 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4369 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4371 if (need_copy_assignment
)
4373 t
= get_copy_assign (type
);
4375 if (t
&& !trivial_fn_p (t
))
4376 TREE_VEC_ELT (info
, 2) = t
;
4379 return errorcount
!= save_errorcount
;
4382 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4383 FIELD_DECL, otherwise return DECL itself. */
4386 omp_clause_decl_field (tree decl
)
4389 && DECL_HAS_VALUE_EXPR_P (decl
)
4390 && DECL_ARTIFICIAL (decl
)
4391 && DECL_LANG_SPECIFIC (decl
)
4392 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4394 tree f
= DECL_VALUE_EXPR (decl
);
4395 if (TREE_CODE (f
) == INDIRECT_REF
)
4396 f
= TREE_OPERAND (f
, 0);
4397 if (TREE_CODE (f
) == COMPONENT_REF
)
4399 f
= TREE_OPERAND (f
, 1);
4400 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4407 /* Adjust DECL if needed for printing using %qE. */
4410 omp_clause_printable_decl (tree decl
)
4412 tree t
= omp_clause_decl_field (decl
);
4418 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4419 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4423 omp_note_field_privatization (tree f
, tree t
)
4425 if (!omp_private_member_map
)
4426 omp_private_member_map
= new hash_map
<tree
, tree
>;
4427 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4431 omp_private_member_vec
.safe_push (f
);
4432 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4433 omp_private_member_vec
.safe_push (integer_zero_node
);
4437 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4441 omp_privatize_field (tree t
, bool shared
)
4443 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4444 if (m
== error_mark_node
)
4445 return error_mark_node
;
4446 if (!omp_private_member_map
&& !shared
)
4447 omp_private_member_map
= new hash_map
<tree
, tree
>;
4448 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4450 gcc_assert (TREE_CODE (m
) == INDIRECT_REF
);
4451 m
= TREE_OPERAND (m
, 0);
4453 tree vb
= NULL_TREE
;
4454 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4457 v
= create_temporary_var (TREE_TYPE (m
));
4458 retrofit_lang_decl (v
);
4459 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4460 SET_DECL_VALUE_EXPR (v
, m
);
4461 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4463 omp_private_member_vec
.safe_push (t
);
4468 /* Helper function for handle_omp_array_sections. Called recursively
4469 to handle multiple array-section-subscripts. C is the clause,
4470 T current expression (initially OMP_CLAUSE_DECL), which is either
4471 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4472 expression if specified, TREE_VALUE length expression if specified,
4473 TREE_CHAIN is what it has been specified after, or some decl.
4474 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4475 set to true if any of the array-section-subscript could have length
4476 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4477 first array-section-subscript which is known not to have length
4479 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4480 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4481 all are or may have length of 1, array-section-subscript [:2] is the
4482 first one known not to have length 1. For array-section-subscript
4483 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4484 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4485 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4486 case though, as some lengths could be zero. */
4489 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4490 bool &maybe_zero_len
, unsigned int &first_non_one
,
4491 enum c_omp_region_type ort
)
4493 tree ret
, low_bound
, length
, type
;
4494 if (TREE_CODE (t
) != TREE_LIST
)
4496 if (error_operand_p (t
))
4497 return error_mark_node
;
4498 if (REFERENCE_REF_P (t
)
4499 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4500 t
= TREE_OPERAND (t
, 0);
4502 if (TREE_CODE (t
) == COMPONENT_REF
4504 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4505 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4506 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4507 && !type_dependent_expression_p (t
))
4509 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4510 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4512 error_at (OMP_CLAUSE_LOCATION (c
),
4513 "bit-field %qE in %qs clause",
4514 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4515 return error_mark_node
;
4517 while (TREE_CODE (t
) == COMPONENT_REF
)
4519 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4520 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4522 error_at (OMP_CLAUSE_LOCATION (c
),
4523 "%qE is a member of a union", t
);
4524 return error_mark_node
;
4526 t
= TREE_OPERAND (t
, 0);
4528 if (REFERENCE_REF_P (t
))
4529 t
= TREE_OPERAND (t
, 0);
4531 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4533 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
4536 error_at (OMP_CLAUSE_LOCATION (c
),
4537 "%qD is not a variable in %qs clause", t
,
4538 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4540 error_at (OMP_CLAUSE_LOCATION (c
),
4541 "%qE is not a variable in %qs clause", t
,
4542 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4543 return error_mark_node
;
4545 else if (TREE_CODE (t
) == PARM_DECL
4546 && DECL_ARTIFICIAL (t
)
4547 && DECL_NAME (t
) == this_identifier
)
4549 error_at (OMP_CLAUSE_LOCATION (c
),
4550 "%<this%> allowed in OpenMP only in %<declare simd%>"
4552 return error_mark_node
;
4554 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4555 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4557 error_at (OMP_CLAUSE_LOCATION (c
),
4558 "%qD is threadprivate variable in %qs clause", t
,
4559 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4560 return error_mark_node
;
4562 if (type_dependent_expression_p (ret
))
4564 ret
= convert_from_reference (ret
);
4568 if (ort
== C_ORT_OMP
4569 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4570 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4571 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4572 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4573 maybe_zero_len
, first_non_one
, ort
);
4574 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4577 type
= TREE_TYPE (ret
);
4578 low_bound
= TREE_PURPOSE (t
);
4579 length
= TREE_VALUE (t
);
4580 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4581 || (length
&& type_dependent_expression_p (length
)))
4584 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4585 return error_mark_node
;
4587 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4589 error_at (OMP_CLAUSE_LOCATION (c
),
4590 "low bound %qE of array section does not have integral type",
4592 return error_mark_node
;
4594 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4596 error_at (OMP_CLAUSE_LOCATION (c
),
4597 "length %qE of array section does not have integral type",
4599 return error_mark_node
;
4602 low_bound
= mark_rvalue_use (low_bound
);
4604 length
= mark_rvalue_use (length
);
4605 /* We need to reduce to real constant-values for checks below. */
4607 length
= fold_simple (length
);
4609 low_bound
= fold_simple (low_bound
);
4611 && TREE_CODE (low_bound
) == INTEGER_CST
4612 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4613 > TYPE_PRECISION (sizetype
))
4614 low_bound
= fold_convert (sizetype
, low_bound
);
4616 && TREE_CODE (length
) == INTEGER_CST
4617 && TYPE_PRECISION (TREE_TYPE (length
))
4618 > TYPE_PRECISION (sizetype
))
4619 length
= fold_convert (sizetype
, length
);
4620 if (low_bound
== NULL_TREE
)
4621 low_bound
= integer_zero_node
;
4623 if (length
!= NULL_TREE
)
4625 if (!integer_nonzerop (length
))
4627 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4628 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4630 if (integer_zerop (length
))
4632 error_at (OMP_CLAUSE_LOCATION (c
),
4633 "zero length array section in %qs clause",
4634 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4635 return error_mark_node
;
4639 maybe_zero_len
= true;
4641 if (first_non_one
== types
.length ()
4642 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4645 if (TREE_CODE (type
) == ARRAY_TYPE
)
4647 if (length
== NULL_TREE
4648 && (TYPE_DOMAIN (type
) == NULL_TREE
4649 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4651 error_at (OMP_CLAUSE_LOCATION (c
),
4652 "for unknown bound array type length expression must "
4654 return error_mark_node
;
4656 if (TREE_CODE (low_bound
) == INTEGER_CST
4657 && tree_int_cst_sgn (low_bound
) == -1)
4659 error_at (OMP_CLAUSE_LOCATION (c
),
4660 "negative low bound in array section in %qs clause",
4661 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4662 return error_mark_node
;
4664 if (length
!= NULL_TREE
4665 && TREE_CODE (length
) == INTEGER_CST
4666 && tree_int_cst_sgn (length
) == -1)
4668 error_at (OMP_CLAUSE_LOCATION (c
),
4669 "negative length in array section in %qs clause",
4670 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4671 return error_mark_node
;
4673 if (TYPE_DOMAIN (type
)
4674 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4675 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4679 = fold_convert (sizetype
, TYPE_MAX_VALUE (TYPE_DOMAIN (type
)));
4680 size
= size_binop (PLUS_EXPR
, size
, size_one_node
);
4681 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4683 if (tree_int_cst_lt (size
, low_bound
))
4685 error_at (OMP_CLAUSE_LOCATION (c
),
4686 "low bound %qE above array section size "
4687 "in %qs clause", low_bound
,
4688 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4689 return error_mark_node
;
4691 if (tree_int_cst_equal (size
, low_bound
))
4693 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4694 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4696 error_at (OMP_CLAUSE_LOCATION (c
),
4697 "zero length array section in %qs clause",
4698 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4699 return error_mark_node
;
4701 maybe_zero_len
= true;
4703 else if (length
== NULL_TREE
4704 && first_non_one
== types
.length ()
4705 && tree_int_cst_equal
4706 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4710 else if (length
== NULL_TREE
)
4712 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4713 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4714 maybe_zero_len
= true;
4715 if (first_non_one
== types
.length ())
4718 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4720 if (tree_int_cst_lt (size
, length
))
4722 error_at (OMP_CLAUSE_LOCATION (c
),
4723 "length %qE above array section size "
4724 "in %qs clause", length
,
4725 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4726 return error_mark_node
;
4728 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4731 = size_binop (PLUS_EXPR
,
4732 fold_convert (sizetype
, low_bound
),
4733 fold_convert (sizetype
, length
));
4734 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4735 && tree_int_cst_lt (size
, lbpluslen
))
4737 error_at (OMP_CLAUSE_LOCATION (c
),
4738 "high bound %qE above array section size "
4739 "in %qs clause", lbpluslen
,
4740 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4741 return error_mark_node
;
4746 else if (length
== NULL_TREE
)
4748 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4749 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4750 maybe_zero_len
= true;
4751 if (first_non_one
== types
.length ())
4755 /* For [lb:] we will need to evaluate lb more than once. */
4756 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4758 tree lb
= cp_save_expr (low_bound
);
4759 if (lb
!= low_bound
)
4761 TREE_PURPOSE (t
) = lb
;
4766 else if (TREE_CODE (type
) == POINTER_TYPE
)
4768 if (length
== NULL_TREE
)
4770 error_at (OMP_CLAUSE_LOCATION (c
),
4771 "for pointer type length expression must be specified");
4772 return error_mark_node
;
4774 if (length
!= NULL_TREE
4775 && TREE_CODE (length
) == INTEGER_CST
4776 && tree_int_cst_sgn (length
) == -1)
4778 error_at (OMP_CLAUSE_LOCATION (c
),
4779 "negative length in array section in %qs clause",
4780 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4781 return error_mark_node
;
4783 /* If there is a pointer type anywhere but in the very first
4784 array-section-subscript, the array section can't be contiguous. */
4785 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4786 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4788 error_at (OMP_CLAUSE_LOCATION (c
),
4789 "array section is not contiguous in %qs clause",
4790 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4791 return error_mark_node
;
4796 error_at (OMP_CLAUSE_LOCATION (c
),
4797 "%qE does not have pointer or array type", ret
);
4798 return error_mark_node
;
4800 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4801 types
.safe_push (TREE_TYPE (ret
));
4802 /* We will need to evaluate lb more than once. */
4803 tree lb
= cp_save_expr (low_bound
);
4804 if (lb
!= low_bound
)
4806 TREE_PURPOSE (t
) = lb
;
4809 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4813 /* Handle array sections for clause C. */
4816 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4818 bool maybe_zero_len
= false;
4819 unsigned int first_non_one
= 0;
4820 auto_vec
<tree
, 10> types
;
4821 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4822 maybe_zero_len
, first_non_one
,
4824 if (first
== error_mark_node
)
4826 if (first
== NULL_TREE
)
4828 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4830 tree t
= OMP_CLAUSE_DECL (c
);
4831 tree tem
= NULL_TREE
;
4832 if (processing_template_decl
)
4834 /* Need to evaluate side effects in the length expressions
4836 while (TREE_CODE (t
) == TREE_LIST
)
4838 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4840 if (tem
== NULL_TREE
)
4841 tem
= TREE_VALUE (t
);
4843 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4844 TREE_VALUE (t
), tem
);
4849 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4850 OMP_CLAUSE_DECL (c
) = first
;
4854 unsigned int num
= types
.length (), i
;
4855 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4856 tree condition
= NULL_TREE
;
4858 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4859 maybe_zero_len
= true;
4860 if (processing_template_decl
&& maybe_zero_len
)
4863 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4866 tree low_bound
= TREE_PURPOSE (t
);
4867 tree length
= TREE_VALUE (t
);
4871 && TREE_CODE (low_bound
) == INTEGER_CST
4872 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4873 > TYPE_PRECISION (sizetype
))
4874 low_bound
= fold_convert (sizetype
, low_bound
);
4876 && TREE_CODE (length
) == INTEGER_CST
4877 && TYPE_PRECISION (TREE_TYPE (length
))
4878 > TYPE_PRECISION (sizetype
))
4879 length
= fold_convert (sizetype
, length
);
4880 if (low_bound
== NULL_TREE
)
4881 low_bound
= integer_zero_node
;
4882 if (!maybe_zero_len
&& i
> first_non_one
)
4884 if (integer_nonzerop (low_bound
))
4885 goto do_warn_noncontiguous
;
4886 if (length
!= NULL_TREE
4887 && TREE_CODE (length
) == INTEGER_CST
4888 && TYPE_DOMAIN (types
[i
])
4889 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4890 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4894 size
= size_binop (PLUS_EXPR
,
4895 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4897 if (!tree_int_cst_equal (length
, size
))
4899 do_warn_noncontiguous
:
4900 error_at (OMP_CLAUSE_LOCATION (c
),
4901 "array section is not contiguous in %qs "
4903 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4907 if (!processing_template_decl
4908 && length
!= NULL_TREE
4909 && TREE_SIDE_EFFECTS (length
))
4911 if (side_effects
== NULL_TREE
)
4912 side_effects
= length
;
4914 side_effects
= build2 (COMPOUND_EXPR
,
4915 TREE_TYPE (side_effects
),
4916 length
, side_effects
);
4919 else if (processing_template_decl
)
4925 if (i
> first_non_one
4926 && ((length
&& integer_nonzerop (length
))
4927 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
))
4930 l
= fold_convert (sizetype
, length
);
4933 l
= size_binop (PLUS_EXPR
,
4934 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4936 l
= size_binop (MINUS_EXPR
, l
,
4937 fold_convert (sizetype
, low_bound
));
4939 if (i
> first_non_one
)
4941 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4943 if (condition
== NULL_TREE
)
4946 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4949 else if (size
== NULL_TREE
)
4951 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4952 tree eltype
= TREE_TYPE (types
[num
- 1]);
4953 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4954 eltype
= TREE_TYPE (eltype
);
4955 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4956 size
= size_binop (EXACT_DIV_EXPR
, size
,
4957 size_in_bytes (eltype
));
4958 size
= size_binop (MULT_EXPR
, size
, l
);
4960 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4961 size
, size_zero_node
);
4964 size
= size_binop (MULT_EXPR
, size
, l
);
4967 if (!processing_template_decl
)
4970 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
4971 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4973 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
4974 tree index_type
= build_index_type (size
);
4975 tree eltype
= TREE_TYPE (first
);
4976 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4977 eltype
= TREE_TYPE (eltype
);
4978 tree type
= build_array_type (eltype
, index_type
);
4979 tree ptype
= build_pointer_type (eltype
);
4980 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4981 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
4982 t
= convert_from_reference (t
);
4983 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
4984 t
= build_fold_addr_expr (t
);
4985 tree t2
= build_fold_addr_expr (first
);
4986 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4987 ptrdiff_type_node
, t2
);
4988 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
4989 ptrdiff_type_node
, t2
,
4990 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4991 ptrdiff_type_node
, t
));
4992 if (tree_fits_shwi_p (t2
))
4993 t
= build2 (MEM_REF
, type
, t
,
4994 build_int_cst (ptype
, tree_to_shwi (t2
)));
4997 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4999 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5000 TREE_TYPE (t
), t
, t2
);
5001 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5003 OMP_CLAUSE_DECL (c
) = t
;
5006 OMP_CLAUSE_DECL (c
) = first
;
5007 OMP_CLAUSE_SIZE (c
) = size
;
5008 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5009 || (TREE_CODE (t
) == COMPONENT_REF
5010 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5012 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5013 switch (OMP_CLAUSE_MAP_KIND (c
))
5015 case GOMP_MAP_ALLOC
:
5018 case GOMP_MAP_TOFROM
:
5019 case GOMP_MAP_ALWAYS_TO
:
5020 case GOMP_MAP_ALWAYS_FROM
:
5021 case GOMP_MAP_ALWAYS_TOFROM
:
5022 case GOMP_MAP_RELEASE
:
5023 case GOMP_MAP_DELETE
:
5024 case GOMP_MAP_FORCE_TO
:
5025 case GOMP_MAP_FORCE_FROM
:
5026 case GOMP_MAP_FORCE_TOFROM
:
5027 case GOMP_MAP_FORCE_PRESENT
:
5028 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5033 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5035 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5036 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5037 else if (TREE_CODE (t
) == COMPONENT_REF
)
5038 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5039 else if (REFERENCE_REF_P (t
)
5040 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5042 t
= TREE_OPERAND (t
, 0);
5043 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5046 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5047 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5048 && !cxx_mark_addressable (t
))
5050 OMP_CLAUSE_DECL (c2
) = t
;
5051 t
= build_fold_addr_expr (first
);
5052 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5053 ptrdiff_type_node
, t
);
5054 tree ptr
= OMP_CLAUSE_DECL (c2
);
5055 ptr
= convert_from_reference (ptr
);
5056 if (!POINTER_TYPE_P (TREE_TYPE (ptr
)))
5057 ptr
= build_fold_addr_expr (ptr
);
5058 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5059 ptrdiff_type_node
, t
,
5060 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5061 ptrdiff_type_node
, ptr
));
5062 OMP_CLAUSE_SIZE (c2
) = t
;
5063 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5064 OMP_CLAUSE_CHAIN (c
) = c2
;
5065 ptr
= OMP_CLAUSE_DECL (c2
);
5066 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5067 && TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
5068 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5070 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5072 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5073 OMP_CLAUSE_DECL (c3
) = ptr
;
5074 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5075 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5077 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5078 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5079 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5080 OMP_CLAUSE_CHAIN (c2
) = c3
;
5087 /* Return identifier to look up for omp declare reduction. */
5090 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5092 const char *p
= NULL
;
5093 const char *m
= NULL
;
5094 switch (reduction_code
)
5102 case TRUTH_ANDIF_EXPR
:
5103 case TRUTH_ORIF_EXPR
:
5104 reduction_id
= ovl_op_identifier (false, reduction_code
);
5118 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5119 return error_mark_node
;
5120 p
= IDENTIFIER_POINTER (reduction_id
);
5123 if (type
!= NULL_TREE
)
5124 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5126 const char prefix
[] = "omp declare reduction ";
5127 size_t lenp
= sizeof (prefix
);
5128 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5130 size_t len
= strlen (p
);
5131 size_t lenm
= m
? strlen (m
) + 1 : 0;
5132 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5134 memcpy (name
, prefix
, lenp
- 1);
5135 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5138 name
[lenp
+ len
- 1] = '~';
5139 memcpy (name
+ lenp
+ len
, m
, lenm
);
5141 return get_identifier (name
);
5144 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5145 FUNCTION_DECL or NULL_TREE if not found. */
5148 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5149 vec
<tree
> *ambiguousp
)
5152 tree baselink
= NULL_TREE
;
5153 if (identifier_p (id
))
5156 bool nonint_cst_expression_p
;
5157 const char *error_msg
;
5158 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5159 tree decl
= lookup_name (id
);
5160 if (decl
== NULL_TREE
)
5161 decl
= error_mark_node
;
5162 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5163 &nonint_cst_expression_p
, false, true, false,
5164 false, &error_msg
, loc
);
5165 if (idk
== CP_ID_KIND_UNQUALIFIED
5166 && identifier_p (id
))
5168 vec
<tree
, va_gc
> *args
= NULL
;
5169 vec_safe_push (args
, build_reference_type (type
));
5170 id
= perform_koenig_lookup (id
, args
, tf_none
);
5173 else if (TREE_CODE (id
) == SCOPE_REF
)
5174 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5175 omp_reduction_id (ERROR_MARK
,
5176 TREE_OPERAND (id
, 1),
5181 if (fns
&& is_overloaded_fn (fns
))
5183 for (lkp_iterator
iter (get_fns (fns
)); iter
; ++iter
)
5185 tree fndecl
= *iter
;
5186 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5188 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5189 if (same_type_p (TREE_TYPE (argtype
), type
))
5197 if (id
&& BASELINK_P (fns
))
5206 if (!id
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5208 vec
<tree
> ambiguous
= vNULL
;
5209 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5211 if (ambiguousp
== NULL
)
5212 ambiguousp
= &ambiguous
;
5213 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5215 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5216 baselinkp
? baselinkp
: &baselink
,
5218 if (id
== NULL_TREE
)
5220 if (!ambiguousp
->is_empty ())
5221 ambiguousp
->safe_push (id
);
5222 else if (ret
!= NULL_TREE
)
5224 ambiguousp
->safe_push (ret
);
5225 ambiguousp
->safe_push (id
);
5231 if (ambiguousp
!= &ambiguous
)
5233 if (!ambiguous
.is_empty ())
5235 const char *str
= _("candidates are:");
5238 error_at (loc
, "user defined reduction lookup is ambiguous");
5239 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5241 inform (DECL_SOURCE_LOCATION (udr
), "%s %#qD", str
, udr
);
5243 str
= get_spaces (str
);
5245 ambiguous
.release ();
5246 ret
= error_mark_node
;
5247 baselink
= NULL_TREE
;
5252 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5253 id
, id
, tf_warning_or_error
);
5257 /* Helper function for cp_parser_omp_declare_reduction_exprs
5259 Remove CLEANUP_STMT for data (omp_priv variable).
5260 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5264 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5268 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5269 *tp
= CLEANUP_BODY (*tp
);
5270 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5272 tree decl
= DECL_EXPR_DECL (*tp
);
5273 if (!processing_template_decl
5274 && decl
== (tree
) data
5275 && DECL_INITIAL (decl
)
5276 && DECL_INITIAL (decl
) != error_mark_node
)
5278 tree list
= NULL_TREE
;
5279 append_to_statement_list_force (*tp
, &list
);
5280 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5281 decl
, DECL_INITIAL (decl
));
5282 DECL_INITIAL (decl
) = NULL_TREE
;
5283 append_to_statement_list_force (init_expr
, &list
);
5290 /* Data passed from cp_check_omp_declare_reduction to
5291 cp_check_omp_declare_reduction_r. */
5293 struct cp_check_omp_declare_reduction_data
5300 /* Helper function for cp_check_omp_declare_reduction, called via
5304 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5306 struct cp_check_omp_declare_reduction_data
*udr_data
5307 = (struct cp_check_omp_declare_reduction_data
*) data
;
5309 && !DECL_ARTIFICIAL (*tp
)
5310 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5311 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5313 location_t loc
= udr_data
->loc
;
5314 if (udr_data
->combiner_p
)
5315 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5316 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5319 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5320 "to variable %qD which is not %<omp_priv%> nor "
5328 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5331 cp_check_omp_declare_reduction (tree udr
)
5333 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5334 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
5335 type
= TREE_TYPE (type
);
5337 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5339 if (type
== error_mark_node
)
5341 if (ARITHMETIC_TYPE_P (type
))
5343 static enum tree_code predef_codes
[]
5344 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5345 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5346 for (i
= 0; i
< 8; i
++)
5348 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5349 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5350 const char *n2
= IDENTIFIER_POINTER (id
);
5351 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5352 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5353 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5358 && TREE_CODE (type
) != COMPLEX_EXPR
)
5360 const char prefix_minmax
[] = "omp declare reduction m";
5361 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5362 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5363 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5364 prefix_minmax
, prefix_size
) == 0
5365 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5366 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5367 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5372 error_at (loc
, "predeclared arithmetic type %qT in "
5373 "%<#pragma omp declare reduction%>", type
);
5377 else if (TREE_CODE (type
) == FUNCTION_TYPE
5378 || TREE_CODE (type
) == METHOD_TYPE
5379 || TREE_CODE (type
) == ARRAY_TYPE
)
5381 error_at (loc
, "function or array type %qT in "
5382 "%<#pragma omp declare reduction%>", type
);
5385 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5387 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5391 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5393 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5394 "%<#pragma omp declare reduction%>", type
);
5398 tree body
= DECL_SAVED_TREE (udr
);
5399 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5402 tree_stmt_iterator tsi
;
5403 struct cp_check_omp_declare_reduction_data data
;
5404 memset (data
.stmts
, 0, sizeof data
.stmts
);
5405 for (i
= 0, tsi
= tsi_start (body
);
5406 i
< 7 && !tsi_end_p (tsi
);
5407 i
++, tsi_next (&tsi
))
5408 data
.stmts
[i
] = tsi_stmt (tsi
);
5410 gcc_assert (tsi_end_p (tsi
));
5413 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5414 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5415 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5417 data
.combiner_p
= true;
5418 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5420 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5424 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5425 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5426 data
.combiner_p
= false;
5427 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5429 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5430 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5431 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5433 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5437 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5438 an inline call. But, remap
5439 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5440 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5443 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5444 tree decl
, tree placeholder
)
5447 hash_map
<tree
, tree
> decl_map
;
5449 decl_map
.put (omp_decl1
, placeholder
);
5450 decl_map
.put (omp_decl2
, decl
);
5451 memset (&id
, 0, sizeof (id
));
5452 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5453 id
.dst_fn
= current_function_decl
;
5454 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5455 id
.decl_map
= &decl_map
;
5457 id
.copy_decl
= copy_decl_no_change
;
5458 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5459 id
.transform_new_cfg
= true;
5460 id
.transform_return_to_modify
= false;
5461 id
.transform_lang_insert_block
= NULL
;
5463 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5467 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5468 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5471 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5473 if (*tp
== (tree
) data
)
5478 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5479 Return true if there is some error and the clause should be removed. */
5482 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5484 tree t
= OMP_CLAUSE_DECL (c
);
5485 bool predefined
= false;
5486 if (TREE_CODE (t
) == TREE_LIST
)
5488 gcc_assert (processing_template_decl
);
5491 tree type
= TREE_TYPE (t
);
5492 if (TREE_CODE (t
) == MEM_REF
)
5493 type
= TREE_TYPE (type
);
5494 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5495 type
= TREE_TYPE (type
);
5496 if (TREE_CODE (type
) == ARRAY_TYPE
)
5499 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5500 while (TREE_CODE (type
) == ARRAY_TYPE
)
5501 type
= TREE_TYPE (type
);
5502 if (!processing_template_decl
)
5504 t
= require_complete_type (t
);
5505 if (t
== error_mark_node
)
5507 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5508 TYPE_SIZE_UNIT (type
));
5509 if (integer_zerop (size
))
5511 error ("%qE in %<reduction%> clause is a zero size array",
5512 omp_clause_printable_decl (t
));
5515 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5516 tree index_type
= build_index_type (size
);
5517 tree atype
= build_array_type (type
, index_type
);
5518 tree ptype
= build_pointer_type (type
);
5519 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5520 t
= build_fold_addr_expr (t
);
5521 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5522 OMP_CLAUSE_DECL (c
) = t
;
5525 if (type
== error_mark_node
)
5527 else if (ARITHMETIC_TYPE_P (type
))
5528 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5537 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5544 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5548 case TRUTH_ANDIF_EXPR
:
5549 case TRUTH_ORIF_EXPR
:
5550 if (FLOAT_TYPE_P (type
))
5557 else if (TYPE_READONLY (type
))
5559 error ("%qE has const type for %<reduction%>",
5560 omp_clause_printable_decl (t
));
5563 else if (!processing_template_decl
)
5565 t
= require_complete_type (t
);
5566 if (t
== error_mark_node
)
5568 OMP_CLAUSE_DECL (c
) = t
;
5573 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5576 else if (processing_template_decl
)
5579 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5581 type
= TYPE_MAIN_VARIANT (type
);
5582 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5583 if (id
== NULL_TREE
)
5584 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5585 NULL_TREE
, NULL_TREE
);
5586 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5589 if (id
== error_mark_node
)
5592 tree body
= DECL_SAVED_TREE (id
);
5595 if (TREE_CODE (body
) == STATEMENT_LIST
)
5597 tree_stmt_iterator tsi
;
5598 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5601 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5602 atype
= TREE_TYPE (atype
);
5603 bool need_static_cast
= !same_type_p (type
, atype
);
5604 memset (stmts
, 0, sizeof stmts
);
5605 for (i
= 0, tsi
= tsi_start (body
);
5606 i
< 7 && !tsi_end_p (tsi
);
5607 i
++, tsi_next (&tsi
))
5608 stmts
[i
] = tsi_stmt (tsi
);
5609 gcc_assert (tsi_end_p (tsi
));
5613 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5614 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5615 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5616 DECL_ARTIFICIAL (placeholder
) = 1;
5617 DECL_IGNORED_P (placeholder
) = 1;
5618 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5619 if (TREE_CODE (t
) == MEM_REF
)
5621 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5623 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5624 DECL_IGNORED_P (decl_placeholder
) = 1;
5625 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5627 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5628 cxx_mark_addressable (placeholder
);
5629 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5630 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
)))
5632 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5633 : OMP_CLAUSE_DECL (c
));
5634 tree omp_out
= placeholder
;
5635 tree omp_in
= decl_placeholder
? decl_placeholder
5636 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5637 if (need_static_cast
)
5639 tree rtype
= build_reference_type (atype
);
5640 omp_out
= build_static_cast (rtype
, omp_out
,
5641 tf_warning_or_error
);
5642 omp_in
= build_static_cast (rtype
, omp_in
,
5643 tf_warning_or_error
);
5644 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5646 omp_out
= convert_from_reference (omp_out
);
5647 omp_in
= convert_from_reference (omp_in
);
5649 OMP_CLAUSE_REDUCTION_MERGE (c
)
5650 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5651 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5655 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5656 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5657 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5658 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5659 : OMP_CLAUSE_DECL (c
));
5660 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5661 cxx_mark_addressable (placeholder
);
5662 tree omp_priv
= decl_placeholder
? decl_placeholder
5663 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5664 tree omp_orig
= placeholder
;
5665 if (need_static_cast
)
5669 error_at (OMP_CLAUSE_LOCATION (c
),
5670 "user defined reduction with constructor "
5671 "initializer for base class %qT", atype
);
5674 tree rtype
= build_reference_type (atype
);
5675 omp_priv
= build_static_cast (rtype
, omp_priv
,
5676 tf_warning_or_error
);
5677 omp_orig
= build_static_cast (rtype
, omp_orig
,
5678 tf_warning_or_error
);
5679 if (omp_priv
== error_mark_node
5680 || omp_orig
== error_mark_node
)
5682 omp_priv
= convert_from_reference (omp_priv
);
5683 omp_orig
= convert_from_reference (omp_orig
);
5686 *need_default_ctor
= true;
5687 OMP_CLAUSE_REDUCTION_INIT (c
)
5688 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5689 DECL_EXPR_DECL (stmts
[3]),
5690 omp_priv
, omp_orig
);
5691 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5692 find_omp_placeholder_r
, placeholder
, NULL
))
5693 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5697 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5698 *need_default_ctor
= true;
5702 tree v
= decl_placeholder
? decl_placeholder
5703 : convert_from_reference (t
);
5704 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5705 init
= build_constructor (TREE_TYPE (v
), NULL
);
5707 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5708 OMP_CLAUSE_REDUCTION_INIT (c
)
5709 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5714 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5718 error ("user defined reduction not found for %qE",
5719 omp_clause_printable_decl (t
));
5722 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5723 gcc_assert (TYPE_SIZE_UNIT (type
)
5724 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5728 /* Called from finish_struct_1. linear(this) or linear(this:step)
5729 clauses might not be finalized yet because the class has been incomplete
5730 when parsing #pragma omp declare simd methods. Fix those up now. */
5733 finish_omp_declare_simd_methods (tree t
)
5735 if (processing_template_decl
)
5738 for (tree x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
5740 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5742 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5743 if (!ods
|| !TREE_VALUE (ods
))
5745 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5746 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5747 && integer_zerop (OMP_CLAUSE_DECL (c
))
5748 && OMP_CLAUSE_LINEAR_STEP (c
)
5749 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
)))
5752 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5753 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5754 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5755 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5756 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5761 /* Adjust sink depend clause to take into account pointer offsets.
5763 Return TRUE if there was a problem processing the offset, and the
5764 whole clause should be removed. */
5767 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5769 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5770 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5772 /* Make sure we don't adjust things twice for templates. */
5773 if (processing_template_decl
)
5776 for (; t
; t
= TREE_CHAIN (t
))
5778 tree decl
= TREE_VALUE (t
);
5779 if (TREE_CODE (TREE_TYPE (decl
)) == POINTER_TYPE
)
5781 tree offset
= TREE_PURPOSE (t
);
5782 bool neg
= wi::neg_p (wi::to_wide (offset
));
5783 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5784 decl
= mark_rvalue_use (decl
);
5785 decl
= convert_from_reference (decl
);
5786 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5787 neg
? MINUS_EXPR
: PLUS_EXPR
,
5789 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5790 MINUS_EXPR
, sizetype
,
5791 fold_convert (sizetype
, t2
),
5792 fold_convert (sizetype
, decl
));
5793 if (t2
== error_mark_node
)
5795 TREE_PURPOSE (t
) = t2
;
5801 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5802 Remove any elements from the list that are invalid. */
5805 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
5807 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5808 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
5810 tree safelen
= NULL_TREE
;
5811 bool branch_seen
= false;
5812 bool copyprivate_seen
= false;
5813 bool ordered_seen
= false;
5814 bool oacc_async
= false;
5816 bitmap_obstack_initialize (NULL
);
5817 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5818 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5819 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5820 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5821 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
5822 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
5823 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
5825 if (ort
& C_ORT_ACC
)
5826 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
5827 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
5833 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5835 bool remove
= false;
5836 bool field_ok
= false;
5838 switch (OMP_CLAUSE_CODE (c
))
5840 case OMP_CLAUSE_SHARED
:
5841 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5842 goto check_dup_generic
;
5843 case OMP_CLAUSE_PRIVATE
:
5844 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5845 goto check_dup_generic
;
5846 case OMP_CLAUSE_REDUCTION
:
5847 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5848 t
= OMP_CLAUSE_DECL (c
);
5849 if (TREE_CODE (t
) == TREE_LIST
)
5851 if (handle_omp_array_sections (c
, ort
))
5856 if (TREE_CODE (t
) == TREE_LIST
)
5858 while (TREE_CODE (t
) == TREE_LIST
)
5863 gcc_assert (TREE_CODE (t
) == MEM_REF
);
5864 t
= TREE_OPERAND (t
, 0);
5865 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
5866 t
= TREE_OPERAND (t
, 0);
5867 if (TREE_CODE (t
) == ADDR_EXPR
5868 || TREE_CODE (t
) == INDIRECT_REF
)
5869 t
= TREE_OPERAND (t
, 0);
5871 tree n
= omp_clause_decl_field (t
);
5874 goto check_dup_generic_t
;
5877 cxx_mark_addressable (t
);
5878 goto check_dup_generic
;
5879 case OMP_CLAUSE_COPYPRIVATE
:
5880 copyprivate_seen
= true;
5881 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5882 goto check_dup_generic
;
5883 case OMP_CLAUSE_COPYIN
:
5884 goto check_dup_generic
;
5885 case OMP_CLAUSE_LINEAR
:
5886 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5887 t
= OMP_CLAUSE_DECL (c
);
5888 if (ort
!= C_ORT_OMP_DECLARE_SIMD
5889 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
5891 error_at (OMP_CLAUSE_LOCATION (c
),
5892 "modifier should not be specified in %<linear%> "
5893 "clause on %<simd%> or %<for%> constructs");
5894 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
5896 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5897 && !type_dependent_expression_p (t
))
5899 tree type
= TREE_TYPE (t
);
5900 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5901 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
5902 && TREE_CODE (type
) != REFERENCE_TYPE
)
5904 error ("linear clause with %qs modifier applied to "
5905 "non-reference variable with %qT type",
5906 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5907 ? "ref" : "uval", TREE_TYPE (t
));
5911 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5912 type
= TREE_TYPE (type
);
5913 if (ort
== C_ORT_CILK
)
5915 if (!INTEGRAL_TYPE_P (type
)
5916 && !SCALAR_FLOAT_TYPE_P (type
)
5917 && TREE_CODE (type
) != POINTER_TYPE
)
5919 error ("linear clause applied to non-integral, "
5920 "non-floating, non-pointer variable with %qT type",
5926 else if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
5928 if (!INTEGRAL_TYPE_P (type
)
5929 && TREE_CODE (type
) != POINTER_TYPE
)
5931 error ("linear clause applied to non-integral non-pointer"
5932 " variable with %qT type", TREE_TYPE (t
));
5938 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5940 t
= integer_one_node
;
5941 if (t
== error_mark_node
)
5946 else if (!type_dependent_expression_p (t
)
5947 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5948 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5949 || TREE_CODE (t
) != PARM_DECL
5950 || TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
5951 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
5953 error ("linear step expression must be integral");
5959 t
= mark_rvalue_use (t
);
5960 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
5962 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
5963 goto check_dup_generic
;
5965 if (!processing_template_decl
5966 && (VAR_P (OMP_CLAUSE_DECL (c
))
5967 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
5969 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
5971 t
= maybe_constant_value (t
);
5972 if (TREE_CODE (t
) != INTEGER_CST
)
5974 error_at (OMP_CLAUSE_LOCATION (c
),
5975 "%<linear%> clause step %qE is neither "
5976 "constant nor a parameter", t
);
5981 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5982 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
5983 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5984 type
= TREE_TYPE (type
);
5985 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
5987 type
= build_pointer_type (type
);
5988 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
5989 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
5991 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
5992 MINUS_EXPR
, sizetype
,
5993 fold_convert (sizetype
, t
),
5994 fold_convert (sizetype
, d
));
5995 if (t
== error_mark_node
)
6001 else if (TREE_CODE (type
) == POINTER_TYPE
6002 /* Can't multiply the step yet if *this
6003 is still incomplete type. */
6004 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6005 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6006 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6007 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6009 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6011 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6012 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6014 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6015 MINUS_EXPR
, sizetype
,
6016 fold_convert (sizetype
, t
),
6017 fold_convert (sizetype
, d
));
6018 if (t
== error_mark_node
)
6025 t
= fold_convert (type
, t
);
6027 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6029 goto check_dup_generic
;
6031 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6034 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6035 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6038 t
= OMP_CLAUSE_DECL (c
);
6039 check_dup_generic_t
:
6040 if (t
== current_class_ptr
6041 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6042 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6043 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6045 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6050 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6051 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6053 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6056 error ("%qD is not a variable in clause %qs", t
,
6057 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6059 error ("%qE is not a variable in clause %qs", t
,
6060 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6063 else if (ort
== C_ORT_ACC
6064 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6066 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6068 error ("%qD appears more than once in reduction clauses", t
);
6072 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6074 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6075 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6076 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6078 error ("%qD appears more than once in data clauses", t
);
6081 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6082 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6084 if (ort
== C_ORT_ACC
)
6085 error ("%qD appears more than once in data clauses", t
);
6087 error ("%qD appears both in data and map clauses", t
);
6091 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6096 && TREE_CODE (t
) == FIELD_DECL
6097 && t
== OMP_CLAUSE_DECL (c
)
6098 && ort
!= C_ORT_ACC
)
6101 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6102 == OMP_CLAUSE_SHARED
));
6103 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6108 case OMP_CLAUSE_FIRSTPRIVATE
:
6109 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6111 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6113 t
= OMP_CLAUSE_DECL (c
);
6114 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6116 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6121 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6122 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6123 || TREE_CODE (t
) != FIELD_DECL
))
6125 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6128 error ("%qD is not a variable in clause %<firstprivate%>", t
);
6130 error ("%qE is not a variable in clause %<firstprivate%>", t
);
6133 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6134 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6136 error ("%qD appears more than once in data clauses", t
);
6139 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6141 if (ort
== C_ORT_ACC
)
6142 error ("%qD appears more than once in data clauses", t
);
6144 error ("%qD appears both in data and map clauses", t
);
6148 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6149 goto handle_field_decl
;
6151 case OMP_CLAUSE_LASTPRIVATE
:
6152 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6154 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6156 t
= OMP_CLAUSE_DECL (c
);
6157 if (t
== current_class_ptr
)
6159 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6164 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6165 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6166 || TREE_CODE (t
) != FIELD_DECL
))
6168 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6171 error ("%qD is not a variable in clause %<lastprivate%>", t
);
6173 error ("%qE is not a variable in clause %<lastprivate%>", t
);
6176 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6177 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6179 error ("%qD appears more than once in data clauses", t
);
6183 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6184 goto handle_field_decl
;
6187 t
= OMP_CLAUSE_IF_EXPR (c
);
6188 t
= maybe_convert_cond (t
);
6189 if (t
== error_mark_node
)
6191 else if (!processing_template_decl
)
6192 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6193 OMP_CLAUSE_IF_EXPR (c
) = t
;
6196 case OMP_CLAUSE_FINAL
:
6197 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6198 t
= maybe_convert_cond (t
);
6199 if (t
== error_mark_node
)
6201 else if (!processing_template_decl
)
6202 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6203 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6206 case OMP_CLAUSE_GANG
:
6207 /* Operand 1 is the gang static: argument. */
6208 t
= OMP_CLAUSE_OPERAND (c
, 1);
6211 if (t
== error_mark_node
)
6213 else if (!type_dependent_expression_p (t
)
6214 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6216 error ("%<gang%> static expression must be integral");
6221 t
= mark_rvalue_use (t
);
6222 if (!processing_template_decl
)
6224 t
= maybe_constant_value (t
);
6225 if (TREE_CODE (t
) == INTEGER_CST
6226 && tree_int_cst_sgn (t
) != 1
6227 && t
!= integer_minus_one_node
)
6229 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6230 "%<gang%> static value must be "
6232 t
= integer_one_node
;
6234 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6237 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6239 /* Check operand 0, the num argument. */
6242 case OMP_CLAUSE_WORKER
:
6243 case OMP_CLAUSE_VECTOR
:
6244 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6248 case OMP_CLAUSE_NUM_TASKS
:
6249 case OMP_CLAUSE_NUM_TEAMS
:
6250 case OMP_CLAUSE_NUM_THREADS
:
6251 case OMP_CLAUSE_NUM_GANGS
:
6252 case OMP_CLAUSE_NUM_WORKERS
:
6253 case OMP_CLAUSE_VECTOR_LENGTH
:
6254 t
= OMP_CLAUSE_OPERAND (c
, 0);
6255 if (t
== error_mark_node
)
6257 else if (!type_dependent_expression_p (t
)
6258 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6260 switch (OMP_CLAUSE_CODE (c
))
6262 case OMP_CLAUSE_GANG
:
6263 error_at (OMP_CLAUSE_LOCATION (c
),
6264 "%<gang%> num expression must be integral"); break;
6265 case OMP_CLAUSE_VECTOR
:
6266 error_at (OMP_CLAUSE_LOCATION (c
),
6267 "%<vector%> length expression must be integral");
6269 case OMP_CLAUSE_WORKER
:
6270 error_at (OMP_CLAUSE_LOCATION (c
),
6271 "%<worker%> num expression must be integral");
6274 error_at (OMP_CLAUSE_LOCATION (c
),
6275 "%qs expression must be integral",
6276 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6282 t
= mark_rvalue_use (t
);
6283 if (!processing_template_decl
)
6285 t
= maybe_constant_value (t
);
6286 if (TREE_CODE (t
) == INTEGER_CST
6287 && tree_int_cst_sgn (t
) != 1)
6289 switch (OMP_CLAUSE_CODE (c
))
6291 case OMP_CLAUSE_GANG
:
6292 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6293 "%<gang%> num value must be positive");
6295 case OMP_CLAUSE_VECTOR
:
6296 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6297 "%<vector%> length value must be "
6300 case OMP_CLAUSE_WORKER
:
6301 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6302 "%<worker%> num value must be "
6306 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6307 "%qs value must be positive",
6308 omp_clause_code_name
6309 [OMP_CLAUSE_CODE (c
)]);
6311 t
= integer_one_node
;
6313 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6315 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6319 case OMP_CLAUSE_SCHEDULE
:
6320 if (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
)
6322 const char *p
= NULL
;
6323 switch (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_MASK
)
6325 case OMP_CLAUSE_SCHEDULE_STATIC
: p
= "static"; break;
6326 case OMP_CLAUSE_SCHEDULE_DYNAMIC
: break;
6327 case OMP_CLAUSE_SCHEDULE_GUIDED
: break;
6328 case OMP_CLAUSE_SCHEDULE_AUTO
: p
= "auto"; break;
6329 case OMP_CLAUSE_SCHEDULE_RUNTIME
: p
= "runtime"; break;
6330 default: gcc_unreachable ();
6334 error_at (OMP_CLAUSE_LOCATION (c
),
6335 "%<nonmonotonic%> modifier specified for %qs "
6336 "schedule kind", p
);
6337 OMP_CLAUSE_SCHEDULE_KIND (c
)
6338 = (enum omp_clause_schedule_kind
)
6339 (OMP_CLAUSE_SCHEDULE_KIND (c
)
6340 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
6344 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6347 else if (t
== error_mark_node
)
6349 else if (!type_dependent_expression_p (t
)
6350 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
6351 != OMP_CLAUSE_SCHEDULE_CILKFOR
)
6352 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6354 error ("schedule chunk size expression must be integral");
6359 t
= mark_rvalue_use (t
);
6360 if (!processing_template_decl
)
6362 if (OMP_CLAUSE_SCHEDULE_KIND (c
)
6363 == OMP_CLAUSE_SCHEDULE_CILKFOR
)
6365 t
= convert_to_integer (long_integer_type_node
, t
);
6366 if (t
== error_mark_node
)
6374 t
= maybe_constant_value (t
);
6375 if (TREE_CODE (t
) == INTEGER_CST
6376 && tree_int_cst_sgn (t
) != 1)
6378 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6379 "chunk size value must be positive");
6380 t
= integer_one_node
;
6383 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6385 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6389 case OMP_CLAUSE_SIMDLEN
:
6390 case OMP_CLAUSE_SAFELEN
:
6391 t
= OMP_CLAUSE_OPERAND (c
, 0);
6392 if (t
== error_mark_node
)
6394 else if (!type_dependent_expression_p (t
)
6395 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6397 error ("%qs length expression must be integral",
6398 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6403 t
= mark_rvalue_use (t
);
6404 if (!processing_template_decl
)
6406 t
= maybe_constant_value (t
);
6407 if (TREE_CODE (t
) != INTEGER_CST
6408 || tree_int_cst_sgn (t
) != 1)
6410 error ("%qs length expression must be positive constant"
6411 " integer expression",
6412 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6416 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6417 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6422 case OMP_CLAUSE_ASYNC
:
6423 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6424 if (t
== error_mark_node
)
6426 else if (!type_dependent_expression_p (t
)
6427 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6429 error ("%<async%> expression must be integral");
6434 t
= mark_rvalue_use (t
);
6435 if (!processing_template_decl
)
6436 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6437 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6441 case OMP_CLAUSE_WAIT
:
6442 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6443 if (t
== error_mark_node
)
6445 else if (!processing_template_decl
)
6446 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6447 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6450 case OMP_CLAUSE_THREAD_LIMIT
:
6451 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6452 if (t
== error_mark_node
)
6454 else if (!type_dependent_expression_p (t
)
6455 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6457 error ("%<thread_limit%> expression must be integral");
6462 t
= mark_rvalue_use (t
);
6463 if (!processing_template_decl
)
6465 t
= maybe_constant_value (t
);
6466 if (TREE_CODE (t
) == INTEGER_CST
6467 && tree_int_cst_sgn (t
) != 1)
6469 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6470 "%<thread_limit%> value must be positive");
6471 t
= integer_one_node
;
6473 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6475 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6479 case OMP_CLAUSE_DEVICE
:
6480 t
= OMP_CLAUSE_DEVICE_ID (c
);
6481 if (t
== error_mark_node
)
6483 else if (!type_dependent_expression_p (t
)
6484 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6486 error ("%<device%> id must be integral");
6491 t
= mark_rvalue_use (t
);
6492 if (!processing_template_decl
)
6493 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6494 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6498 case OMP_CLAUSE_DIST_SCHEDULE
:
6499 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6502 else if (t
== error_mark_node
)
6504 else if (!type_dependent_expression_p (t
)
6505 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6507 error ("%<dist_schedule%> chunk size expression must be "
6513 t
= mark_rvalue_use (t
);
6514 if (!processing_template_decl
)
6515 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6516 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6520 case OMP_CLAUSE_ALIGNED
:
6521 t
= OMP_CLAUSE_DECL (c
);
6522 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6524 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6529 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6531 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6534 error ("%qD is not a variable in %<aligned%> clause", t
);
6536 error ("%qE is not a variable in %<aligned%> clause", t
);
6539 else if (!type_dependent_expression_p (t
)
6540 && TREE_CODE (TREE_TYPE (t
)) != POINTER_TYPE
6541 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6542 && (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6543 || (!POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6544 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6547 error_at (OMP_CLAUSE_LOCATION (c
),
6548 "%qE in %<aligned%> clause is neither a pointer nor "
6549 "an array nor a reference to pointer or array", t
);
6552 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6554 error ("%qD appears more than once in %<aligned%> clauses", t
);
6558 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6559 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6560 if (t
== error_mark_node
)
6562 else if (t
== NULL_TREE
)
6564 else if (!type_dependent_expression_p (t
)
6565 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6567 error ("%<aligned%> clause alignment expression must "
6573 t
= mark_rvalue_use (t
);
6574 if (!processing_template_decl
)
6576 t
= maybe_constant_value (t
);
6577 if (TREE_CODE (t
) != INTEGER_CST
6578 || tree_int_cst_sgn (t
) != 1)
6580 error ("%<aligned%> clause alignment expression must be "
6581 "positive constant integer expression");
6585 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6589 case OMP_CLAUSE_DEPEND
:
6590 t
= OMP_CLAUSE_DECL (c
);
6593 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6594 == OMP_CLAUSE_DEPEND_SOURCE
);
6597 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6599 if (cp_finish_omp_clause_depend_sink (c
))
6603 if (TREE_CODE (t
) == TREE_LIST
)
6605 if (handle_omp_array_sections (c
, ort
))
6609 if (t
== error_mark_node
)
6611 else if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6613 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6616 error ("%qD is not a variable in %<depend%> clause", t
);
6618 error ("%qE is not a variable in %<depend%> clause", t
);
6621 else if (t
== current_class_ptr
)
6623 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6627 else if (!processing_template_decl
6628 && !cxx_mark_addressable (t
))
6632 case OMP_CLAUSE_MAP
:
6634 case OMP_CLAUSE_FROM
:
6635 case OMP_CLAUSE__CACHE_
:
6636 t
= OMP_CLAUSE_DECL (c
);
6637 if (TREE_CODE (t
) == TREE_LIST
)
6639 if (handle_omp_array_sections (c
, ort
))
6643 t
= OMP_CLAUSE_DECL (c
);
6644 if (TREE_CODE (t
) != TREE_LIST
6645 && !type_dependent_expression_p (t
)
6646 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6648 error_at (OMP_CLAUSE_LOCATION (c
),
6649 "array section does not have mappable type "
6651 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6654 while (TREE_CODE (t
) == ARRAY_REF
)
6655 t
= TREE_OPERAND (t
, 0);
6656 if (TREE_CODE (t
) == COMPONENT_REF
6657 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
6659 while (TREE_CODE (t
) == COMPONENT_REF
)
6660 t
= TREE_OPERAND (t
, 0);
6661 if (REFERENCE_REF_P (t
))
6662 t
= TREE_OPERAND (t
, 0);
6663 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6665 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6667 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6668 error ("%qD appears more than once in motion"
6670 else if (ort
== C_ORT_ACC
)
6671 error ("%qD appears more than once in data"
6674 error ("%qD appears more than once in map"
6680 bitmap_set_bit (&map_head
, DECL_UID (t
));
6681 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6687 if (t
== error_mark_node
)
6692 if (REFERENCE_REF_P (t
)
6693 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
6695 t
= TREE_OPERAND (t
, 0);
6696 OMP_CLAUSE_DECL (c
) = t
;
6698 if (TREE_CODE (t
) == COMPONENT_REF
6699 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6700 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
6702 if (type_dependent_expression_p (t
))
6704 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
6705 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6707 error_at (OMP_CLAUSE_LOCATION (c
),
6708 "bit-field %qE in %qs clause",
6709 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6712 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6714 error_at (OMP_CLAUSE_LOCATION (c
),
6715 "%qE does not have a mappable type in %qs clause",
6716 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6719 while (TREE_CODE (t
) == COMPONENT_REF
)
6721 if (TREE_TYPE (TREE_OPERAND (t
, 0))
6722 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
6725 error_at (OMP_CLAUSE_LOCATION (c
),
6726 "%qE is a member of a union", t
);
6730 t
= TREE_OPERAND (t
, 0);
6734 if (REFERENCE_REF_P (t
))
6735 t
= TREE_OPERAND (t
, 0);
6736 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6738 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6739 goto handle_map_references
;
6742 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6744 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6746 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6747 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6748 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
6751 error ("%qD is not a variable in %qs clause", t
,
6752 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6754 error ("%qE is not a variable in %qs clause", t
,
6755 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6758 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
6760 error ("%qD is threadprivate variable in %qs clause", t
,
6761 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6764 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6766 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6771 else if (!processing_template_decl
6772 && TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6773 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
6774 || (OMP_CLAUSE_MAP_KIND (c
)
6775 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
6776 && !cxx_mark_addressable (t
))
6778 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6779 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6780 || (OMP_CLAUSE_MAP_KIND (c
)
6781 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
6782 && t
== OMP_CLAUSE_DECL (c
)
6783 && !type_dependent_expression_p (t
)
6784 && !cp_omp_mappable_type ((TREE_CODE (TREE_TYPE (t
))
6786 ? TREE_TYPE (TREE_TYPE (t
))
6789 error_at (OMP_CLAUSE_LOCATION (c
),
6790 "%qD does not have a mappable type in %qs clause", t
,
6791 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6794 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6795 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
6796 && !type_dependent_expression_p (t
)
6797 && !POINTER_TYPE_P (TREE_TYPE (t
)))
6799 error ("%qD is not a pointer variable", t
);
6802 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6803 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
6805 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6806 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6808 error ("%qD appears more than once in data clauses", t
);
6811 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6813 if (ort
== C_ORT_ACC
)
6814 error ("%qD appears more than once in data clauses", t
);
6816 error ("%qD appears both in data and map clauses", t
);
6820 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6822 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6824 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6825 error ("%qD appears more than once in motion clauses", t
);
6826 if (ort
== C_ORT_ACC
)
6827 error ("%qD appears more than once in data clauses", t
);
6829 error ("%qD appears more than once in map clauses", t
);
6832 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6833 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6835 if (ort
== C_ORT_ACC
)
6836 error ("%qD appears more than once in data clauses", t
);
6838 error ("%qD appears both in data and map clauses", t
);
6843 bitmap_set_bit (&map_head
, DECL_UID (t
));
6844 if (t
!= OMP_CLAUSE_DECL (c
)
6845 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
6846 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6848 handle_map_references
:
6850 && !processing_template_decl
6851 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6852 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
))) == REFERENCE_TYPE
)
6854 t
= OMP_CLAUSE_DECL (c
);
6855 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6857 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6858 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6860 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6862 else if (OMP_CLAUSE_MAP_KIND (c
)
6863 != GOMP_MAP_FIRSTPRIVATE_POINTER
6864 && (OMP_CLAUSE_MAP_KIND (c
)
6865 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
6866 && (OMP_CLAUSE_MAP_KIND (c
)
6867 != GOMP_MAP_ALWAYS_POINTER
))
6869 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
6871 if (TREE_CODE (t
) == COMPONENT_REF
)
6872 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
6874 OMP_CLAUSE_SET_MAP_KIND (c2
,
6875 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
6876 OMP_CLAUSE_DECL (c2
) = t
;
6877 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
6878 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
6879 OMP_CLAUSE_CHAIN (c
) = c2
;
6880 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6881 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6883 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6889 case OMP_CLAUSE_TO_DECLARE
:
6890 case OMP_CLAUSE_LINK
:
6891 t
= OMP_CLAUSE_DECL (c
);
6892 if (TREE_CODE (t
) == FUNCTION_DECL
6893 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6895 else if (!VAR_P (t
))
6897 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6899 if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
6900 error_at (OMP_CLAUSE_LOCATION (c
),
6901 "template %qE in clause %qs", t
,
6902 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6903 else if (really_overloaded_fn (t
))
6904 error_at (OMP_CLAUSE_LOCATION (c
),
6905 "overloaded function name %qE in clause %qs", t
,
6906 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6908 error_at (OMP_CLAUSE_LOCATION (c
),
6909 "%qE is neither a variable nor a function name "
6911 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6914 error_at (OMP_CLAUSE_LOCATION (c
),
6915 "%qE is not a variable in clause %qs", t
,
6916 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6919 else if (DECL_THREAD_LOCAL_P (t
))
6921 error_at (OMP_CLAUSE_LOCATION (c
),
6922 "%qD is threadprivate variable in %qs clause", t
,
6923 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6926 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6928 error_at (OMP_CLAUSE_LOCATION (c
),
6929 "%qD does not have a mappable type in %qs clause", t
,
6930 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6935 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
6937 error_at (OMP_CLAUSE_LOCATION (c
),
6938 "%qE appears more than once on the same "
6939 "%<declare target%> directive", t
);
6943 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6946 case OMP_CLAUSE_UNIFORM
:
6947 t
= OMP_CLAUSE_DECL (c
);
6948 if (TREE_CODE (t
) != PARM_DECL
)
6950 if (processing_template_decl
)
6953 error ("%qD is not an argument in %<uniform%> clause", t
);
6955 error ("%qE is not an argument in %<uniform%> clause", t
);
6959 /* map_head bitmap is used as uniform_head if declare_simd. */
6960 bitmap_set_bit (&map_head
, DECL_UID (t
));
6961 goto check_dup_generic
;
6963 case OMP_CLAUSE_GRAINSIZE
:
6964 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
6965 if (t
== error_mark_node
)
6967 else if (!type_dependent_expression_p (t
)
6968 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6970 error ("%<grainsize%> expression must be integral");
6975 t
= mark_rvalue_use (t
);
6976 if (!processing_template_decl
)
6978 t
= maybe_constant_value (t
);
6979 if (TREE_CODE (t
) == INTEGER_CST
6980 && tree_int_cst_sgn (t
) != 1)
6982 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6983 "%<grainsize%> value must be positive");
6984 t
= integer_one_node
;
6986 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6988 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
6992 case OMP_CLAUSE_PRIORITY
:
6993 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
6994 if (t
== error_mark_node
)
6996 else if (!type_dependent_expression_p (t
)
6997 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6999 error ("%<priority%> expression must be integral");
7004 t
= mark_rvalue_use (t
);
7005 if (!processing_template_decl
)
7007 t
= maybe_constant_value (t
);
7008 if (TREE_CODE (t
) == INTEGER_CST
7009 && tree_int_cst_sgn (t
) == -1)
7011 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7012 "%<priority%> value must be non-negative");
7013 t
= integer_one_node
;
7015 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7017 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7021 case OMP_CLAUSE_HINT
:
7022 t
= OMP_CLAUSE_HINT_EXPR (c
);
7023 if (t
== error_mark_node
)
7025 else if (!type_dependent_expression_p (t
)
7026 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7028 error ("%<num_tasks%> expression must be integral");
7033 t
= mark_rvalue_use (t
);
7034 if (!processing_template_decl
)
7036 t
= maybe_constant_value (t
);
7037 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7039 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7043 case OMP_CLAUSE_IS_DEVICE_PTR
:
7044 case OMP_CLAUSE_USE_DEVICE_PTR
:
7045 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7046 t
= OMP_CLAUSE_DECL (c
);
7047 if (!type_dependent_expression_p (t
))
7049 tree type
= TREE_TYPE (t
);
7050 if (TREE_CODE (type
) != POINTER_TYPE
7051 && TREE_CODE (type
) != ARRAY_TYPE
7052 && (TREE_CODE (type
) != REFERENCE_TYPE
7053 || (TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
7054 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
7056 error_at (OMP_CLAUSE_LOCATION (c
),
7057 "%qs variable is neither a pointer, nor an array "
7058 "nor reference to pointer or array",
7059 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7063 goto check_dup_generic
;
7065 case OMP_CLAUSE_NOWAIT
:
7066 case OMP_CLAUSE_DEFAULT
:
7067 case OMP_CLAUSE_UNTIED
:
7068 case OMP_CLAUSE_COLLAPSE
:
7069 case OMP_CLAUSE_MERGEABLE
:
7070 case OMP_CLAUSE_PARALLEL
:
7071 case OMP_CLAUSE_FOR
:
7072 case OMP_CLAUSE_SECTIONS
:
7073 case OMP_CLAUSE_TASKGROUP
:
7074 case OMP_CLAUSE_PROC_BIND
:
7075 case OMP_CLAUSE_NOGROUP
:
7076 case OMP_CLAUSE_THREADS
:
7077 case OMP_CLAUSE_SIMD
:
7078 case OMP_CLAUSE_DEFAULTMAP
:
7079 case OMP_CLAUSE__CILK_FOR_COUNT_
:
7080 case OMP_CLAUSE_AUTO
:
7081 case OMP_CLAUSE_INDEPENDENT
:
7082 case OMP_CLAUSE_SEQ
:
7085 case OMP_CLAUSE_TILE
:
7086 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7087 list
= TREE_CHAIN (list
))
7089 t
= TREE_VALUE (list
);
7091 if (t
== error_mark_node
)
7093 else if (!type_dependent_expression_p (t
)
7094 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7096 error_at (OMP_CLAUSE_LOCATION (c
),
7097 "%<tile%> argument needs integral type");
7102 t
= mark_rvalue_use (t
);
7103 if (!processing_template_decl
)
7105 /* Zero is used to indicate '*', we permit you
7106 to get there via an ICE of value zero. */
7107 t
= maybe_constant_value (t
);
7108 if (!tree_fits_shwi_p (t
)
7109 || tree_to_shwi (t
) < 0)
7111 error_at (OMP_CLAUSE_LOCATION (c
),
7112 "%<tile%> argument needs positive "
7113 "integral constant");
7116 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7120 /* Update list item. */
7121 TREE_VALUE (list
) = t
;
7125 case OMP_CLAUSE_ORDERED
:
7126 ordered_seen
= true;
7129 case OMP_CLAUSE_INBRANCH
:
7130 case OMP_CLAUSE_NOTINBRANCH
:
7133 error ("%<inbranch%> clause is incompatible with "
7145 *pc
= OMP_CLAUSE_CHAIN (c
);
7147 pc
= &OMP_CLAUSE_CHAIN (c
);
7150 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7152 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7153 bool remove
= false;
7154 bool need_complete_type
= false;
7155 bool need_default_ctor
= false;
7156 bool need_copy_ctor
= false;
7157 bool need_copy_assignment
= false;
7158 bool need_implicitly_determined
= false;
7159 bool need_dtor
= false;
7160 tree type
, inner_type
;
7164 case OMP_CLAUSE_SHARED
:
7165 need_implicitly_determined
= true;
7167 case OMP_CLAUSE_PRIVATE
:
7168 need_complete_type
= true;
7169 need_default_ctor
= true;
7171 need_implicitly_determined
= true;
7173 case OMP_CLAUSE_FIRSTPRIVATE
:
7174 need_complete_type
= true;
7175 need_copy_ctor
= true;
7177 need_implicitly_determined
= true;
7179 case OMP_CLAUSE_LASTPRIVATE
:
7180 need_complete_type
= true;
7181 need_copy_assignment
= true;
7182 need_implicitly_determined
= true;
7184 case OMP_CLAUSE_REDUCTION
:
7185 need_implicitly_determined
= true;
7187 case OMP_CLAUSE_LINEAR
:
7188 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7189 need_implicitly_determined
= true;
7190 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7191 && !bitmap_bit_p (&map_head
,
7192 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7194 error_at (OMP_CLAUSE_LOCATION (c
),
7195 "%<linear%> clause step is a parameter %qD not "
7196 "specified in %<uniform%> clause",
7197 OMP_CLAUSE_LINEAR_STEP (c
));
7198 *pc
= OMP_CLAUSE_CHAIN (c
);
7202 case OMP_CLAUSE_COPYPRIVATE
:
7203 need_copy_assignment
= true;
7205 case OMP_CLAUSE_COPYIN
:
7206 need_copy_assignment
= true;
7208 case OMP_CLAUSE_SIMDLEN
:
7210 && !processing_template_decl
7211 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7212 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7214 error_at (OMP_CLAUSE_LOCATION (c
),
7215 "%<simdlen%> clause value is bigger than "
7216 "%<safelen%> clause value");
7217 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7218 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7220 pc
= &OMP_CLAUSE_CHAIN (c
);
7222 case OMP_CLAUSE_SCHEDULE
:
7224 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7225 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7227 error_at (OMP_CLAUSE_LOCATION (c
),
7228 "%<nonmonotonic%> schedule modifier specified "
7229 "together with %<ordered%> clause");
7230 OMP_CLAUSE_SCHEDULE_KIND (c
)
7231 = (enum omp_clause_schedule_kind
)
7232 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7233 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7235 pc
= &OMP_CLAUSE_CHAIN (c
);
7237 case OMP_CLAUSE_NOWAIT
:
7238 if (copyprivate_seen
)
7240 error_at (OMP_CLAUSE_LOCATION (c
),
7241 "%<nowait%> clause must not be used together "
7242 "with %<copyprivate%>");
7243 *pc
= OMP_CLAUSE_CHAIN (c
);
7248 pc
= &OMP_CLAUSE_CHAIN (c
);
7252 t
= OMP_CLAUSE_DECL (c
);
7253 if (processing_template_decl
7254 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7256 pc
= &OMP_CLAUSE_CHAIN (c
);
7262 case OMP_CLAUSE_LASTPRIVATE
:
7263 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7265 need_default_ctor
= true;
7270 case OMP_CLAUSE_REDUCTION
:
7271 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7275 t
= OMP_CLAUSE_DECL (c
);
7278 case OMP_CLAUSE_COPYIN
:
7279 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7281 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
7290 if (need_complete_type
|| need_copy_assignment
)
7292 t
= require_complete_type (t
);
7293 if (t
== error_mark_node
)
7295 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
7296 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7299 if (need_implicitly_determined
)
7301 const char *share_name
= NULL
;
7303 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7304 share_name
= "threadprivate";
7305 else switch (cxx_omp_predetermined_sharing (t
))
7307 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7309 case OMP_CLAUSE_DEFAULT_SHARED
:
7310 /* const vars may be specified in firstprivate clause. */
7311 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7312 && cxx_omp_const_qual_no_mutable (t
))
7314 share_name
= "shared";
7316 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7317 share_name
= "private";
7324 error ("%qE is predetermined %qs for %qs",
7325 omp_clause_printable_decl (t
), share_name
,
7326 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7331 /* We're interested in the base element, not arrays. */
7332 inner_type
= type
= TREE_TYPE (t
);
7333 if ((need_complete_type
7334 || need_copy_assignment
7335 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
7336 && TREE_CODE (inner_type
) == REFERENCE_TYPE
)
7337 inner_type
= TREE_TYPE (inner_type
);
7338 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7339 inner_type
= TREE_TYPE (inner_type
);
7341 /* Check for special function availability by building a call to one.
7342 Save the results, because later we won't be in the right context
7343 for making these queries. */
7344 if (CLASS_TYPE_P (inner_type
)
7345 && COMPLETE_TYPE_P (inner_type
)
7346 && (need_default_ctor
|| need_copy_ctor
7347 || need_copy_assignment
|| need_dtor
)
7348 && !type_dependent_expression_p (t
)
7349 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7350 need_copy_ctor
, need_copy_assignment
,
7355 && c_kind
== OMP_CLAUSE_SHARED
7356 && processing_template_decl
)
7358 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7360 OMP_CLAUSE_DECL (c
) = t
;
7364 *pc
= OMP_CLAUSE_CHAIN (c
);
7366 pc
= &OMP_CLAUSE_CHAIN (c
);
7369 bitmap_obstack_release (NULL
);
7373 /* Start processing OpenMP clauses that can include any
7374 privatization clauses for non-static data members. */
7377 push_omp_privatization_clauses (bool ignore_next
)
7379 if (omp_private_member_ignore_next
)
7381 omp_private_member_ignore_next
= ignore_next
;
7384 omp_private_member_ignore_next
= ignore_next
;
7385 if (omp_private_member_map
)
7386 omp_private_member_vec
.safe_push (error_mark_node
);
7387 return push_stmt_list ();
7390 /* Revert remapping of any non-static data members since
7391 the last push_omp_privatization_clauses () call. */
7394 pop_omp_privatization_clauses (tree stmt
)
7396 if (stmt
== NULL_TREE
)
7398 stmt
= pop_stmt_list (stmt
);
7399 if (omp_private_member_map
)
7401 while (!omp_private_member_vec
.is_empty ())
7403 tree t
= omp_private_member_vec
.pop ();
7404 if (t
== error_mark_node
)
7409 bool no_decl_expr
= t
== integer_zero_node
;
7411 t
= omp_private_member_vec
.pop ();
7412 tree
*v
= omp_private_member_map
->get (t
);
7416 omp_private_member_map
->remove (t
);
7418 delete omp_private_member_map
;
7419 omp_private_member_map
= NULL
;
7424 /* Remember OpenMP privatization clauses mapping and clear it.
7425 Used for lambdas. */
7428 save_omp_privatization_clauses (vec
<tree
> &save
)
7431 if (omp_private_member_ignore_next
)
7432 save
.safe_push (integer_one_node
);
7433 omp_private_member_ignore_next
= false;
7434 if (!omp_private_member_map
)
7437 while (!omp_private_member_vec
.is_empty ())
7439 tree t
= omp_private_member_vec
.pop ();
7440 if (t
== error_mark_node
)
7446 if (t
== integer_zero_node
)
7447 t
= omp_private_member_vec
.pop ();
7448 tree
*v
= omp_private_member_map
->get (t
);
7450 save
.safe_push (*v
);
7455 delete omp_private_member_map
;
7456 omp_private_member_map
= NULL
;
7459 /* Restore OpenMP privatization clauses mapping saved by the
7463 restore_omp_privatization_clauses (vec
<tree
> &save
)
7465 gcc_assert (omp_private_member_vec
.is_empty ());
7466 omp_private_member_ignore_next
= false;
7467 if (save
.is_empty ())
7469 if (save
.length () == 1 && save
[0] == integer_one_node
)
7471 omp_private_member_ignore_next
= true;
7476 omp_private_member_map
= new hash_map
<tree
, tree
>;
7477 while (!save
.is_empty ())
7479 tree t
= save
.pop ();
7481 if (t
!= error_mark_node
)
7483 if (t
== integer_one_node
)
7485 omp_private_member_ignore_next
= true;
7486 gcc_assert (save
.is_empty ());
7489 if (t
== integer_zero_node
)
7491 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7494 omp_private_member_vec
.safe_push (t
);
7496 omp_private_member_vec
.safe_push (n
);
7501 /* For all variables in the tree_list VARS, mark them as thread local. */
7504 finish_omp_threadprivate (tree vars
)
7508 /* Mark every variable in VARS to be assigned thread local storage. */
7509 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7511 tree v
= TREE_PURPOSE (t
);
7513 if (error_operand_p (v
))
7515 else if (!VAR_P (v
))
7516 error ("%<threadprivate%> %qD is not file, namespace "
7517 "or block scope variable", v
);
7518 /* If V had already been marked threadprivate, it doesn't matter
7519 whether it had been used prior to this point. */
7520 else if (TREE_USED (v
)
7521 && (DECL_LANG_SPECIFIC (v
) == NULL
7522 || !CP_DECL_THREADPRIVATE_P (v
)))
7523 error ("%qE declared %<threadprivate%> after first use", v
);
7524 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7525 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7526 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7527 error ("%<threadprivate%> %qE has incomplete type", v
);
7528 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7529 && CP_DECL_CONTEXT (v
) != current_class_type
)
7530 error ("%<threadprivate%> %qE directive not "
7531 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7534 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7535 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7537 retrofit_lang_decl (v
);
7539 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
7540 after the allocation of the lang_decl structure. */
7541 if (DECL_DISCRIMINATOR_P (v
))
7542 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
7545 if (! CP_DECL_THREAD_LOCAL_P (v
))
7547 CP_DECL_THREAD_LOCAL_P (v
) = true;
7548 set_decl_tls_model (v
, decl_default_tls_model (v
));
7549 /* If rtl has been already set for this var, call
7550 make_decl_rtl once again, so that encode_section_info
7551 has a chance to look at the new decl flags. */
7552 if (DECL_RTL_SET_P (v
))
7555 CP_DECL_THREADPRIVATE_P (v
) = 1;
7560 /* Build an OpenMP structured block. */
7563 begin_omp_structured_block (void)
7565 return do_pushlevel (sk_omp
);
7569 finish_omp_structured_block (tree block
)
7571 return do_poplevel (block
);
7574 /* Similarly, except force the retention of the BLOCK. */
7577 begin_omp_parallel (void)
7579 keep_next_level (true);
7580 return begin_omp_structured_block ();
7583 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7587 finish_oacc_data (tree clauses
, tree block
)
7591 block
= finish_omp_structured_block (block
);
7593 stmt
= make_node (OACC_DATA
);
7594 TREE_TYPE (stmt
) = void_type_node
;
7595 OACC_DATA_CLAUSES (stmt
) = clauses
;
7596 OACC_DATA_BODY (stmt
) = block
;
7598 return add_stmt (stmt
);
7601 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
7605 finish_oacc_host_data (tree clauses
, tree block
)
7609 block
= finish_omp_structured_block (block
);
7611 stmt
= make_node (OACC_HOST_DATA
);
7612 TREE_TYPE (stmt
) = void_type_node
;
7613 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
7614 OACC_HOST_DATA_BODY (stmt
) = block
;
7616 return add_stmt (stmt
);
7619 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
7623 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
7625 body
= finish_omp_structured_block (body
);
7627 tree stmt
= make_node (code
);
7628 TREE_TYPE (stmt
) = void_type_node
;
7629 OMP_BODY (stmt
) = body
;
7630 OMP_CLAUSES (stmt
) = clauses
;
7632 return add_stmt (stmt
);
7636 finish_omp_parallel (tree clauses
, tree body
)
7640 body
= finish_omp_structured_block (body
);
7642 stmt
= make_node (OMP_PARALLEL
);
7643 TREE_TYPE (stmt
) = void_type_node
;
7644 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
7645 OMP_PARALLEL_BODY (stmt
) = body
;
7647 return add_stmt (stmt
);
7651 begin_omp_task (void)
7653 keep_next_level (true);
7654 return begin_omp_structured_block ();
7658 finish_omp_task (tree clauses
, tree body
)
7662 body
= finish_omp_structured_block (body
);
7664 stmt
= make_node (OMP_TASK
);
7665 TREE_TYPE (stmt
) = void_type_node
;
7666 OMP_TASK_CLAUSES (stmt
) = clauses
;
7667 OMP_TASK_BODY (stmt
) = body
;
7669 return add_stmt (stmt
);
7672 /* Helper function for finish_omp_for. Convert Ith random access iterator
7673 into integral iterator. Return FALSE if successful. */
7676 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
7677 tree declv
, tree orig_declv
, tree initv
,
7678 tree condv
, tree incrv
, tree
*body
,
7679 tree
*pre_body
, tree
&clauses
, tree
*lastp
,
7680 int collapse
, int ordered
)
7682 tree diff
, iter_init
, iter_incr
= NULL
, last
;
7683 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
7684 tree decl
= TREE_VEC_ELT (declv
, i
);
7685 tree init
= TREE_VEC_ELT (initv
, i
);
7686 tree cond
= TREE_VEC_ELT (condv
, i
);
7687 tree incr
= TREE_VEC_ELT (incrv
, i
);
7689 location_t elocus
= locus
;
7691 if (init
&& EXPR_HAS_LOCATION (init
))
7692 elocus
= EXPR_LOCATION (init
);
7694 cond
= cp_fully_fold (cond
);
7695 switch (TREE_CODE (cond
))
7702 if (TREE_OPERAND (cond
, 1) == iter
)
7703 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
7704 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
7705 if (TREE_OPERAND (cond
, 0) != iter
)
7706 cond
= error_mark_node
;
7709 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
7712 TREE_OPERAND (cond
, 1), ERROR_MARK
,
7713 NULL
, tf_warning_or_error
);
7714 if (error_operand_p (tem
))
7719 cond
= error_mark_node
;
7722 if (cond
== error_mark_node
)
7724 error_at (elocus
, "invalid controlling predicate");
7727 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
7728 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
7729 tf_warning_or_error
);
7730 diff
= cp_fully_fold (diff
);
7731 if (error_operand_p (diff
))
7733 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
7735 error_at (elocus
, "difference between %qE and %qD does not have integer type",
7736 TREE_OPERAND (cond
, 1), iter
);
7739 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
7740 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
7741 cond
, cp_walk_subtrees
))
7744 switch (TREE_CODE (incr
))
7746 case PREINCREMENT_EXPR
:
7747 case PREDECREMENT_EXPR
:
7748 case POSTINCREMENT_EXPR
:
7749 case POSTDECREMENT_EXPR
:
7750 if (TREE_OPERAND (incr
, 0) != iter
)
7752 incr
= error_mark_node
;
7755 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
7756 TREE_CODE (incr
), iter
,
7757 tf_warning_or_error
);
7758 if (error_operand_p (iter_incr
))
7760 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
7761 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
7762 incr
= integer_one_node
;
7764 incr
= integer_minus_one_node
;
7767 if (TREE_OPERAND (incr
, 0) != iter
)
7768 incr
= error_mark_node
;
7769 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
7770 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
7772 tree rhs
= TREE_OPERAND (incr
, 1);
7773 if (TREE_OPERAND (rhs
, 0) == iter
)
7775 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
7777 incr
= error_mark_node
;
7780 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7781 iter
, TREE_CODE (rhs
),
7782 TREE_OPERAND (rhs
, 1),
7783 tf_warning_or_error
);
7784 if (error_operand_p (iter_incr
))
7786 incr
= TREE_OPERAND (rhs
, 1);
7787 incr
= cp_convert (TREE_TYPE (diff
), incr
,
7788 tf_warning_or_error
);
7789 if (TREE_CODE (rhs
) == MINUS_EXPR
)
7791 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
7792 incr
= fold_simple (incr
);
7794 if (TREE_CODE (incr
) != INTEGER_CST
7795 && (TREE_CODE (incr
) != NOP_EXPR
7796 || (TREE_CODE (TREE_OPERAND (incr
, 0))
7801 else if (TREE_OPERAND (rhs
, 1) == iter
)
7803 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
7804 || TREE_CODE (rhs
) != PLUS_EXPR
)
7805 incr
= error_mark_node
;
7808 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
7810 TREE_OPERAND (rhs
, 0),
7813 tf_warning_or_error
);
7814 if (error_operand_p (iter_incr
))
7816 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7819 tf_warning_or_error
);
7820 if (error_operand_p (iter_incr
))
7822 incr
= TREE_OPERAND (rhs
, 0);
7827 incr
= error_mark_node
;
7830 incr
= error_mark_node
;
7833 incr
= error_mark_node
;
7837 if (incr
== error_mark_node
)
7839 error_at (elocus
, "invalid increment expression");
7843 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
7844 bool taskloop_iv_seen
= false;
7845 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
7846 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
7847 && OMP_CLAUSE_DECL (c
) == iter
)
7849 if (code
== OMP_TASKLOOP
)
7851 taskloop_iv_seen
= true;
7852 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
7856 else if (code
== OMP_TASKLOOP
7857 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
7858 && OMP_CLAUSE_DECL (c
) == iter
)
7860 taskloop_iv_seen
= true;
7861 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
7864 decl
= create_temporary_var (TREE_TYPE (diff
));
7866 add_decl_expr (decl
);
7867 last
= create_temporary_var (TREE_TYPE (diff
));
7869 add_decl_expr (last
);
7870 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
7871 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7873 incr_var
= create_temporary_var (TREE_TYPE (diff
));
7874 pushdecl (incr_var
);
7875 add_decl_expr (incr_var
);
7877 gcc_assert (stmts_are_full_exprs_p ());
7878 tree diffvar
= NULL_TREE
;
7879 if (code
== OMP_TASKLOOP
)
7881 if (!taskloop_iv_seen
)
7883 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7884 OMP_CLAUSE_DECL (ivc
) = iter
;
7885 cxx_omp_finish_clause (ivc
, NULL
);
7886 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
7889 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7890 OMP_CLAUSE_DECL (lvc
) = last
;
7891 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
7893 diffvar
= create_temporary_var (TREE_TYPE (diff
));
7895 add_decl_expr (diffvar
);
7898 orig_pre_body
= *pre_body
;
7899 *pre_body
= push_stmt_list ();
7901 add_stmt (orig_pre_body
);
7903 finish_expr_stmt (build_x_modify_expr (elocus
,
7904 iter
, NOP_EXPR
, init
,
7905 tf_warning_or_error
));
7906 init
= build_int_cst (TREE_TYPE (diff
), 0);
7907 if (c
&& iter_incr
== NULL
7908 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7912 finish_expr_stmt (build_x_modify_expr (elocus
,
7914 incr
, tf_warning_or_error
));
7917 iter_incr
= build_x_modify_expr (elocus
,
7918 iter
, PLUS_EXPR
, incr
,
7919 tf_warning_or_error
);
7921 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
7923 finish_expr_stmt (build_x_modify_expr (elocus
,
7924 last
, NOP_EXPR
, init
,
7925 tf_warning_or_error
));
7928 finish_expr_stmt (build_x_modify_expr (elocus
,
7930 diff
, tf_warning_or_error
));
7933 *pre_body
= pop_stmt_list (*pre_body
);
7935 cond
= cp_build_binary_op (elocus
,
7936 TREE_CODE (cond
), decl
, diff
,
7937 tf_warning_or_error
);
7938 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
7939 elocus
, incr
, NULL_TREE
);
7942 *body
= push_stmt_list ();
7943 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
7944 iter_init
= build_x_modify_expr (elocus
,
7945 iter
, PLUS_EXPR
, iter_init
,
7946 tf_warning_or_error
);
7947 if (iter_init
!= error_mark_node
)
7948 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7949 finish_expr_stmt (iter_init
);
7950 finish_expr_stmt (build_x_modify_expr (elocus
,
7951 last
, NOP_EXPR
, decl
,
7952 tf_warning_or_error
));
7953 add_stmt (orig_body
);
7954 *body
= pop_stmt_list (*body
);
7958 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
7960 finish_expr_stmt (iter_incr
);
7964 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
7965 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
7966 iter_init
, iter_incr
);
7967 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
7968 iter_init
= build_x_modify_expr (elocus
,
7969 iter
, PLUS_EXPR
, iter_init
,
7970 tf_warning_or_error
);
7971 if (iter_init
!= error_mark_node
)
7972 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7973 finish_expr_stmt (iter_init
);
7975 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
7976 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
7979 TREE_VEC_ELT (declv
, i
) = decl
;
7980 TREE_VEC_ELT (initv
, i
) = init
;
7981 TREE_VEC_ELT (condv
, i
) = cond
;
7982 TREE_VEC_ELT (incrv
, i
) = incr
;
7988 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
7989 are directly for their associated operands in the statement. DECL
7990 and INIT are a combo; if DECL is NULL then INIT ought to be a
7991 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
7992 optional statements that need to go before the loop into its
7996 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
7997 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
7998 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
8000 tree omp_for
= NULL
, orig_incr
= NULL
;
8001 tree decl
= NULL
, init
, cond
, incr
, orig_decl
= NULL_TREE
, block
= NULL_TREE
;
8002 tree last
= NULL_TREE
;
8008 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8009 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8010 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8011 if (TREE_VEC_LENGTH (declv
) > 1)
8015 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8017 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8020 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8022 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8023 if (collapse
!= TREE_VEC_LENGTH (declv
))
8024 ordered
= TREE_VEC_LENGTH (declv
);
8027 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8029 decl
= TREE_VEC_ELT (declv
, i
);
8030 init
= TREE_VEC_ELT (initv
, i
);
8031 cond
= TREE_VEC_ELT (condv
, i
);
8032 incr
= TREE_VEC_ELT (incrv
, i
);
8038 switch (TREE_CODE (init
))
8041 decl
= TREE_OPERAND (init
, 0);
8042 init
= TREE_OPERAND (init
, 1);
8045 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8047 decl
= TREE_OPERAND (init
, 0);
8048 init
= TREE_OPERAND (init
, 2);
8058 "expected iteration declaration or initialization");
8063 if (init
&& EXPR_HAS_LOCATION (init
))
8064 elocus
= EXPR_LOCATION (init
);
8068 error_at (elocus
, "missing controlling predicate");
8074 error_at (elocus
, "missing increment expression");
8078 TREE_VEC_ELT (declv
, i
) = decl
;
8079 TREE_VEC_ELT (initv
, i
) = init
;
8086 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8088 && !c_omp_check_loop_iv_exprs (locus
, declv
,
8089 TREE_VEC_ELT (declv
, i
), orig_init
,
8090 NULL_TREE
, cp_walk_subtrees
))
8096 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8100 stmt
= make_node (code
);
8102 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8104 /* This is really just a place-holder. We'll be decomposing this
8105 again and going through the cp_build_modify_expr path below when
8106 we instantiate the thing. */
8107 TREE_VEC_ELT (initv
, i
)
8108 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8109 TREE_VEC_ELT (initv
, i
));
8112 TREE_TYPE (stmt
) = void_type_node
;
8113 OMP_FOR_INIT (stmt
) = initv
;
8114 OMP_FOR_COND (stmt
) = condv
;
8115 OMP_FOR_INCR (stmt
) = incrv
;
8116 OMP_FOR_BODY (stmt
) = body
;
8117 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8118 OMP_FOR_CLAUSES (stmt
) = clauses
;
8120 SET_EXPR_LOCATION (stmt
, locus
);
8121 return add_stmt (stmt
);
8125 orig_declv
= copy_node (declv
);
8127 if (processing_template_decl
)
8128 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8130 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8132 decl
= TREE_VEC_ELT (declv
, i
);
8133 init
= TREE_VEC_ELT (initv
, i
);
8134 cond
= TREE_VEC_ELT (condv
, i
);
8135 incr
= TREE_VEC_ELT (incrv
, i
);
8137 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8140 if (init
&& EXPR_HAS_LOCATION (init
))
8141 elocus
= EXPR_LOCATION (init
);
8145 error_at (elocus
, "expected iteration declaration or initialization");
8149 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8152 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8153 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8154 TREE_CODE (TREE_OPERAND (incr
, 1)),
8155 TREE_OPERAND (incr
, 2),
8156 tf_warning_or_error
);
8159 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8161 if (code
== OMP_SIMD
)
8163 error_at (elocus
, "%<#pragma omp simd%> used with class "
8164 "iteration variable %qE", decl
);
8167 if (code
== CILK_FOR
&& i
== 0)
8169 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8170 initv
, condv
, incrv
, &body
,
8171 &pre_body
, clauses
, &last
,
8177 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8178 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8180 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8184 if (!processing_template_decl
)
8186 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8187 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8188 tf_warning_or_error
);
8191 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8193 && TREE_SIDE_EFFECTS (cond
)
8194 && COMPARISON_CLASS_P (cond
)
8195 && !processing_template_decl
)
8197 tree t
= TREE_OPERAND (cond
, 0);
8198 if (TREE_SIDE_EFFECTS (t
)
8200 && (TREE_CODE (t
) != NOP_EXPR
8201 || TREE_OPERAND (t
, 0) != decl
))
8202 TREE_OPERAND (cond
, 0)
8203 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8205 t
= TREE_OPERAND (cond
, 1);
8206 if (TREE_SIDE_EFFECTS (t
)
8208 && (TREE_CODE (t
) != NOP_EXPR
8209 || TREE_OPERAND (t
, 0) != decl
))
8210 TREE_OPERAND (cond
, 1)
8211 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8213 if (decl
== error_mark_node
|| init
== error_mark_node
)
8216 TREE_VEC_ELT (declv
, i
) = decl
;
8217 TREE_VEC_ELT (initv
, i
) = init
;
8218 TREE_VEC_ELT (condv
, i
) = cond
;
8219 TREE_VEC_ELT (incrv
, i
) = incr
;
8223 if (IS_EMPTY_STMT (pre_body
))
8226 if (code
== CILK_FOR
&& !processing_template_decl
)
8227 block
= push_stmt_list ();
8229 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8230 incrv
, body
, pre_body
);
8232 /* Check for iterators appearing in lb, b or incr expressions. */
8233 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8234 omp_for
= NULL_TREE
;
8236 if (omp_for
== NULL
)
8239 pop_stmt_list (block
);
8245 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8247 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8248 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8250 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8253 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8254 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8255 && !processing_template_decl
)
8257 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8258 if (TREE_SIDE_EFFECTS (t
)
8260 && (TREE_CODE (t
) != NOP_EXPR
8261 || TREE_OPERAND (t
, 0) != decl
))
8262 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8263 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8265 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8266 if (TREE_SIDE_EFFECTS (t
)
8268 && (TREE_CODE (t
) != NOP_EXPR
8269 || TREE_OPERAND (t
, 0) != decl
))
8270 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8271 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8275 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8277 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8279 /* For simd loops with non-static data member iterators, we could have added
8280 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8281 step at this point, fill it in. */
8282 if (code
== OMP_SIMD
&& !processing_template_decl
8283 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8284 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8285 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8286 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8288 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8289 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8290 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8292 switch (TREE_CODE (incr
))
8294 case PREINCREMENT_EXPR
:
8295 case POSTINCREMENT_EXPR
:
8296 /* c_omp_for_incr_canonicalize_ptr() should have been
8297 called to massage things appropriately. */
8298 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8299 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8301 case PREDECREMENT_EXPR
:
8302 case POSTDECREMENT_EXPR
:
8303 /* c_omp_for_incr_canonicalize_ptr() should have been
8304 called to massage things appropriately. */
8305 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8306 OMP_CLAUSE_LINEAR_STEP (c
)
8307 = build_int_cst (TREE_TYPE (decl
), -1);
8310 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8311 incr
= TREE_OPERAND (incr
, 1);
8312 switch (TREE_CODE (incr
))
8315 if (TREE_OPERAND (incr
, 1) == decl
)
8316 step
= TREE_OPERAND (incr
, 0);
8318 step
= TREE_OPERAND (incr
, 1);
8321 case POINTER_PLUS_EXPR
:
8322 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8323 step
= TREE_OPERAND (incr
, 1);
8328 stept
= TREE_TYPE (decl
);
8329 if (POINTER_TYPE_P (stept
))
8331 step
= fold_convert (stept
, step
);
8332 if (TREE_CODE (incr
) == MINUS_EXPR
)
8333 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8334 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8343 tree omp_par
= make_node (OMP_PARALLEL
);
8344 TREE_TYPE (omp_par
) = void_type_node
;
8345 OMP_PARALLEL_CLAUSES (omp_par
) = NULL_TREE
;
8346 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
8347 TREE_SIDE_EFFECTS (bind
) = 1;
8348 BIND_EXPR_BODY (bind
) = pop_stmt_list (block
);
8349 OMP_PARALLEL_BODY (omp_par
) = bind
;
8350 if (OMP_FOR_PRE_BODY (omp_for
))
8352 add_stmt (OMP_FOR_PRE_BODY (omp_for
));
8353 OMP_FOR_PRE_BODY (omp_for
) = NULL_TREE
;
8355 init
= TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0);
8356 decl
= TREE_OPERAND (init
, 0);
8357 cond
= TREE_VEC_ELT (OMP_FOR_COND (omp_for
), 0);
8358 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8359 tree t
= TREE_OPERAND (cond
, 1), c
, clauses
, *pc
;
8360 clauses
= OMP_FOR_CLAUSES (omp_for
);
8361 OMP_FOR_CLAUSES (omp_for
) = NULL_TREE
;
8362 for (pc
= &clauses
; *pc
; )
8363 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_SCHEDULE
)
8365 gcc_assert (OMP_FOR_CLAUSES (omp_for
) == NULL_TREE
);
8366 OMP_FOR_CLAUSES (omp_for
) = *pc
;
8367 *pc
= OMP_CLAUSE_CHAIN (*pc
);
8368 OMP_CLAUSE_CHAIN (OMP_FOR_CLAUSES (omp_for
)) = NULL_TREE
;
8372 gcc_assert (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
);
8373 pc
= &OMP_CLAUSE_CHAIN (*pc
);
8375 if (TREE_CODE (t
) != INTEGER_CST
)
8377 TREE_OPERAND (cond
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8378 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8379 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (cond
, 1);
8380 OMP_CLAUSE_CHAIN (c
) = clauses
;
8383 if (TREE_CODE (incr
) == MODIFY_EXPR
)
8385 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8386 if (TREE_CODE (t
) != INTEGER_CST
)
8388 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8389 = get_temp_regvar (TREE_TYPE (t
), t
);
8390 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8391 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8392 OMP_CLAUSE_CHAIN (c
) = clauses
;
8396 t
= TREE_OPERAND (init
, 1);
8397 if (TREE_CODE (t
) != INTEGER_CST
)
8399 TREE_OPERAND (init
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8400 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8401 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (init
, 1);
8402 OMP_CLAUSE_CHAIN (c
) = clauses
;
8405 if (orig_decl
&& orig_decl
!= decl
)
8407 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8408 OMP_CLAUSE_DECL (c
) = orig_decl
;
8409 OMP_CLAUSE_CHAIN (c
) = clauses
;
8414 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8415 OMP_CLAUSE_DECL (c
) = last
;
8416 OMP_CLAUSE_CHAIN (c
) = clauses
;
8419 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
8420 OMP_CLAUSE_DECL (c
) = decl
;
8421 OMP_CLAUSE_CHAIN (c
) = clauses
;
8423 c
= build_omp_clause (input_location
, OMP_CLAUSE__CILK_FOR_COUNT_
);
8424 OMP_CLAUSE_OPERAND (c
, 0)
8425 = cilk_for_number_of_iterations (omp_for
);
8426 OMP_CLAUSE_CHAIN (c
) = clauses
;
8427 OMP_PARALLEL_CLAUSES (omp_par
) = finish_omp_clauses (c
, C_ORT_CILK
);
8431 else if (code
== CILK_FOR
&& processing_template_decl
)
8433 tree c
, clauses
= OMP_FOR_CLAUSES (omp_for
);
8434 if (orig_decl
&& orig_decl
!= decl
)
8436 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8437 OMP_CLAUSE_DECL (c
) = orig_decl
;
8438 OMP_CLAUSE_CHAIN (c
) = clauses
;
8443 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8444 OMP_CLAUSE_DECL (c
) = last
;
8445 OMP_CLAUSE_CHAIN (c
) = clauses
;
8448 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8454 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
8455 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
8470 dependent_p
= false;
8473 /* Even in a template, we can detect invalid uses of the atomic
8474 pragma if neither LHS nor RHS is type-dependent. */
8475 if (processing_template_decl
)
8477 dependent_p
= (type_dependent_expression_p (lhs
)
8478 || (rhs
&& type_dependent_expression_p (rhs
))
8479 || (v
&& type_dependent_expression_p (v
))
8480 || (lhs1
&& type_dependent_expression_p (lhs1
))
8481 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8484 lhs
= build_non_dependent_expr (lhs
);
8486 rhs
= build_non_dependent_expr (rhs
);
8488 v
= build_non_dependent_expr (v
);
8490 lhs1
= build_non_dependent_expr (lhs1
);
8492 rhs1
= build_non_dependent_expr (rhs1
);
8497 bool swapped
= false;
8498 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8500 std::swap (rhs
, rhs1
);
8501 swapped
= !commutative_tree_code (opcode
);
8503 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8505 if (code
== OMP_ATOMIC
)
8506 error ("%<#pragma omp atomic update%> uses two different "
8507 "expressions for memory");
8509 error ("%<#pragma omp atomic capture%> uses two different "
8510 "expressions for memory");
8513 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8515 if (code
== OMP_ATOMIC
)
8516 error ("%<#pragma omp atomic update%> uses two different "
8517 "expressions for memory");
8519 error ("%<#pragma omp atomic capture%> uses two different "
8520 "expressions for memory");
8523 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
8524 v
, lhs1
, rhs1
, swapped
, seq_cst
,
8525 processing_template_decl
!= 0);
8526 if (stmt
== error_mark_node
)
8529 if (processing_template_decl
)
8531 if (code
== OMP_ATOMIC_READ
)
8533 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
8534 OMP_ATOMIC_READ
, orig_lhs
);
8535 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8536 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8540 if (opcode
== NOP_EXPR
)
8541 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8543 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8545 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8546 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8547 if (code
!= OMP_ATOMIC
)
8549 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
8550 code
, orig_lhs1
, stmt
);
8551 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8552 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8555 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
8556 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8558 finish_expr_stmt (stmt
);
8562 finish_omp_barrier (void)
8564 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
8565 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8566 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8567 release_tree_vector (vec
);
8568 finish_expr_stmt (stmt
);
8572 finish_omp_flush (void)
8574 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8575 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8576 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8577 release_tree_vector (vec
);
8578 finish_expr_stmt (stmt
);
8582 finish_omp_taskwait (void)
8584 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8585 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8586 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8587 release_tree_vector (vec
);
8588 finish_expr_stmt (stmt
);
8592 finish_omp_taskyield (void)
8594 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8595 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8596 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8597 release_tree_vector (vec
);
8598 finish_expr_stmt (stmt
);
8602 finish_omp_cancel (tree clauses
)
8604 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
8606 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8608 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8610 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8612 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8616 error ("%<#pragma omp cancel%> must specify one of "
8617 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8620 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8621 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
8622 if (ifc
!= NULL_TREE
)
8624 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
8625 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
8626 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
8627 build_zero_cst (type
));
8630 ifc
= boolean_true_node
;
8631 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
8632 vec
->quick_push (ifc
);
8633 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8634 release_tree_vector (vec
);
8635 finish_expr_stmt (stmt
);
8639 finish_omp_cancellation_point (tree clauses
)
8641 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
8643 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8645 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8647 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8649 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8653 error ("%<#pragma omp cancellation point%> must specify one of "
8654 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8657 vec
<tree
, va_gc
> *vec
8658 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
8659 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8660 release_tree_vector (vec
);
8661 finish_expr_stmt (stmt
);
8664 /* Begin a __transaction_atomic or __transaction_relaxed statement.
8665 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
8666 should create an extra compound stmt. */
8669 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
8674 *pcompound
= begin_compound_stmt (0);
8676 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
8678 /* Only add the statement to the function if support enabled. */
8682 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
8683 ? G_("%<__transaction_relaxed%> without "
8684 "transactional memory support enabled")
8685 : G_("%<__transaction_atomic%> without "
8686 "transactional memory support enabled")));
8688 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
8689 TREE_SIDE_EFFECTS (r
) = 1;
8693 /* End a __transaction_atomic or __transaction_relaxed statement.
8694 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
8695 and we should end the compound. If NOEX is non-NULL, we wrap the body in
8696 a MUST_NOT_THROW_EXPR with NOEX as condition. */
8699 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
8701 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
8702 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
8703 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
8704 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
8706 /* noexcept specifications are not allowed for function transactions. */
8707 gcc_assert (!(noex
&& compound_stmt
));
8710 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
8712 protected_set_expr_location
8713 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
8714 TREE_SIDE_EFFECTS (body
) = 1;
8715 TRANSACTION_EXPR_BODY (stmt
) = body
;
8719 finish_compound_stmt (compound_stmt
);
8722 /* Build a __transaction_atomic or __transaction_relaxed expression. If
8723 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
8727 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
8732 expr
= build_must_not_throw_expr (expr
, noex
);
8733 protected_set_expr_location (expr
, loc
);
8734 TREE_SIDE_EFFECTS (expr
) = 1;
8736 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
8737 if (flags
& TM_STMT_ATTR_RELAXED
)
8738 TRANSACTION_EXPR_RELAXED (ret
) = 1;
8739 TREE_SIDE_EFFECTS (ret
) = 1;
8740 SET_EXPR_LOCATION (ret
, loc
);
8745 init_cp_semantics (void)
8749 /* Build a STATIC_ASSERT for a static assertion with the condition
8750 CONDITION and the message text MESSAGE. LOCATION is the location
8751 of the static assertion in the source code. When MEMBER_P, this
8752 static assertion is a member of a class. */
8754 finish_static_assert (tree condition
, tree message
, location_t location
,
8757 if (message
== NULL_TREE
8758 || message
== error_mark_node
8759 || condition
== NULL_TREE
8760 || condition
== error_mark_node
)
8763 if (check_for_bare_parameter_packs (condition
))
8764 condition
= error_mark_node
;
8766 if (type_dependent_expression_p (condition
)
8767 || value_dependent_expression_p (condition
))
8769 /* We're in a template; build a STATIC_ASSERT and put it in
8773 assertion
= make_node (STATIC_ASSERT
);
8774 STATIC_ASSERT_CONDITION (assertion
) = condition
;
8775 STATIC_ASSERT_MESSAGE (assertion
) = message
;
8776 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
8779 maybe_add_class_template_decl_list (current_class_type
,
8783 add_stmt (assertion
);
8788 /* Fold the expression and convert it to a boolean value. */
8789 condition
= instantiate_non_dependent_expr (condition
);
8790 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
8791 condition
= maybe_constant_value (condition
);
8793 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
8794 /* Do nothing; the condition is satisfied. */
8798 location_t saved_loc
= input_location
;
8800 input_location
= location
;
8801 if (TREE_CODE (condition
) == INTEGER_CST
8802 && integer_zerop (condition
))
8804 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
8805 (TREE_TYPE (TREE_TYPE (message
))));
8806 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
8807 /* Report the error. */
8809 error ("static assertion failed");
8811 error ("static assertion failed: %s",
8812 TREE_STRING_POINTER (message
));
8814 else if (condition
&& condition
!= error_mark_node
)
8816 error ("non-constant condition for static assertion");
8817 if (require_potential_rvalue_constant_expression (condition
))
8818 cxx_constant_value (condition
);
8820 input_location
= saved_loc
;
8824 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
8825 suitable for use as a type-specifier.
8827 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
8828 id-expression or a class member access, FALSE when it was parsed as
8829 a full expression. */
8832 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
8833 tsubst_flags_t complain
)
8835 tree type
= NULL_TREE
;
8837 if (!expr
|| error_operand_p (expr
))
8838 return error_mark_node
;
8841 || TREE_CODE (expr
) == TYPE_DECL
8842 || (TREE_CODE (expr
) == BIT_NOT_EXPR
8843 && TYPE_P (TREE_OPERAND (expr
, 0))))
8845 if (complain
& tf_error
)
8846 error ("argument to decltype must be an expression");
8847 return error_mark_node
;
8850 /* Depending on the resolution of DR 1172, we may later need to distinguish
8851 instantiation-dependent but not type-dependent expressions so that, say,
8852 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
8853 if (instantiation_dependent_uneval_expression_p (expr
))
8855 type
= cxx_make_type (DECLTYPE_TYPE
);
8856 DECLTYPE_TYPE_EXPR (type
) = expr
;
8857 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
8858 = id_expression_or_member_access_p
;
8859 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8864 /* The type denoted by decltype(e) is defined as follows: */
8866 expr
= resolve_nondeduced_context (expr
, complain
);
8868 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
8869 return error_mark_node
;
8871 if (type_unknown_p (expr
))
8873 if (complain
& tf_error
)
8874 error ("decltype cannot resolve address of overloaded function");
8875 return error_mark_node
;
8878 /* To get the size of a static data member declared as an array of
8879 unknown bound, we need to instantiate it. */
8881 && VAR_HAD_UNKNOWN_BOUND (expr
)
8882 && DECL_TEMPLATE_INSTANTIATION (expr
))
8883 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
8885 if (id_expression_or_member_access_p
)
8887 /* If e is an id-expression or a class member access (5.2.5
8888 [expr.ref]), decltype(e) is defined as the type of the entity
8889 named by e. If there is no such entity, or e names a set of
8890 overloaded functions, the program is ill-formed. */
8891 if (identifier_p (expr
))
8892 expr
= lookup_name (expr
);
8894 if (INDIRECT_REF_P (expr
))
8895 /* This can happen when the expression is, e.g., "a.b". Just
8896 look at the underlying operand. */
8897 expr
= TREE_OPERAND (expr
, 0);
8899 if (TREE_CODE (expr
) == OFFSET_REF
8900 || TREE_CODE (expr
) == MEMBER_REF
8901 || TREE_CODE (expr
) == SCOPE_REF
)
8902 /* We're only interested in the field itself. If it is a
8903 BASELINK, we will need to see through it in the next
8905 expr
= TREE_OPERAND (expr
, 1);
8907 if (BASELINK_P (expr
))
8908 /* See through BASELINK nodes to the underlying function. */
8909 expr
= BASELINK_FUNCTIONS (expr
);
8911 /* decltype of a decomposition name drops references in the tuple case
8912 (unlike decltype of a normal variable) and keeps cv-qualifiers from
8913 the containing object in the other cases (unlike decltype of a member
8914 access expression). */
8915 if (DECL_DECOMPOSITION_P (expr
))
8917 if (DECL_HAS_VALUE_EXPR_P (expr
))
8918 /* Expr is an array or struct subobject proxy, handle
8919 bit-fields properly. */
8920 return unlowered_expr_type (expr
);
8922 /* Expr is a reference variable for the tuple case. */
8923 return lookup_decomp_type (expr
);
8926 switch (TREE_CODE (expr
))
8929 if (DECL_BIT_FIELD_TYPE (expr
))
8931 type
= DECL_BIT_FIELD_TYPE (expr
);
8934 /* Fall through for fields that aren't bitfields. */
8942 case TEMPLATE_PARM_INDEX
:
8943 expr
= mark_type_use (expr
);
8944 type
= TREE_TYPE (expr
);
8948 type
= error_mark_node
;
8953 mark_type_use (expr
);
8954 type
= is_bitfield_expr_with_lowered_type (expr
);
8956 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
8964 /* We can get here when the id-expression refers to an
8965 enumerator or non-type template parameter. */
8966 type
= TREE_TYPE (expr
);
8970 /* Handle instantiated template non-type arguments. */
8971 type
= TREE_TYPE (expr
);
8977 /* Within a lambda-expression:
8979 Every occurrence of decltype((x)) where x is a possibly
8980 parenthesized id-expression that names an entity of
8981 automatic storage duration is treated as if x were
8982 transformed into an access to a corresponding data member
8983 of the closure type that would have been declared if x
8984 were a use of the denoted entity. */
8985 if (outer_automatic_var_p (expr
)
8986 && current_function_decl
8987 && LAMBDA_FUNCTION_P (current_function_decl
))
8988 type
= capture_decltype (expr
);
8989 else if (error_operand_p (expr
))
8990 type
= error_mark_node
;
8991 else if (expr
== current_class_ptr
)
8992 /* If the expression is just "this", we want the
8993 cv-unqualified pointer for the "this" type. */
8994 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
8997 /* Otherwise, where T is the type of e, if e is an lvalue,
8998 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
8999 cp_lvalue_kind clk
= lvalue_kind (expr
);
9000 type
= unlowered_expr_type (expr
);
9001 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
9003 /* For vector types, pick a non-opaque variant. */
9004 if (VECTOR_TYPE_P (type
))
9005 type
= strip_typedefs (type
);
9007 if (clk
!= clk_none
&& !(clk
& clk_class
))
9008 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
9015 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
9016 __has_nothrow_copy, depending on assign_p. Returns true iff all
9017 the copy {ctor,assign} fns are nothrow. */
9020 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
9022 tree fns
= NULL_TREE
;
9024 if (assign_p
|| TYPE_HAS_COPY_CTOR (type
))
9025 fns
= get_class_binding (type
, assign_p
? assign_op_identifier
9028 bool saw_copy
= false;
9029 for (ovl_iterator
iter (fns
); iter
; ++iter
)
9033 if (copy_fn_p (fn
) > 0)
9036 maybe_instantiate_noexcept (fn
);
9037 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
9045 /* Actually evaluates the trait. */
9048 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
9050 enum tree_code type_code1
;
9053 type_code1
= TREE_CODE (type1
);
9057 case CPTK_HAS_NOTHROW_ASSIGN
:
9058 type1
= strip_array_types (type1
);
9059 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9060 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
9061 || (CLASS_TYPE_P (type1
)
9062 && classtype_has_nothrow_assign_or_copy_p (type1
,
9065 case CPTK_HAS_TRIVIAL_ASSIGN
:
9066 /* ??? The standard seems to be missing the "or array of such a class
9067 type" wording for this trait. */
9068 type1
= strip_array_types (type1
);
9069 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9070 && (trivial_type_p (type1
)
9071 || (CLASS_TYPE_P (type1
)
9072 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
9074 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9075 type1
= strip_array_types (type1
);
9076 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
9077 || (CLASS_TYPE_P (type1
)
9078 && (t
= locate_ctor (type1
))
9079 && (maybe_instantiate_noexcept (t
),
9080 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
9082 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9083 type1
= strip_array_types (type1
);
9084 return (trivial_type_p (type1
)
9085 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
9087 case CPTK_HAS_NOTHROW_COPY
:
9088 type1
= strip_array_types (type1
);
9089 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
9090 || (CLASS_TYPE_P (type1
)
9091 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
9093 case CPTK_HAS_TRIVIAL_COPY
:
9094 /* ??? The standard seems to be missing the "or array of such a class
9095 type" wording for this trait. */
9096 type1
= strip_array_types (type1
);
9097 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9098 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
9100 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9101 type1
= strip_array_types (type1
);
9102 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9103 || (CLASS_TYPE_P (type1
)
9104 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
9106 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9107 return type_has_virtual_destructor (type1
);
9109 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9110 return type_has_unique_obj_representations (type1
);
9112 case CPTK_IS_ABSTRACT
:
9113 return ABSTRACT_CLASS_TYPE_P (type1
);
9115 case CPTK_IS_AGGREGATE
:
9116 return CP_AGGREGATE_TYPE_P (type1
);
9118 case CPTK_IS_BASE_OF
:
9119 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9120 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9121 || DERIVED_FROM_P (type1
, type2
)));
9124 return NON_UNION_CLASS_TYPE_P (type1
);
9127 return NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
);
9130 return type_code1
== ENUMERAL_TYPE
;
9133 return CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
);
9135 case CPTK_IS_LITERAL_TYPE
:
9136 return literal_type_p (type1
);
9139 return pod_type_p (type1
);
9141 case CPTK_IS_POLYMORPHIC
:
9142 return CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
);
9144 case CPTK_IS_SAME_AS
:
9145 return same_type_p (type1
, type2
);
9147 case CPTK_IS_STD_LAYOUT
:
9148 return std_layout_type_p (type1
);
9150 case CPTK_IS_TRIVIAL
:
9151 return trivial_type_p (type1
);
9153 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9154 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9156 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9157 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9159 case CPTK_IS_TRIVIALLY_COPYABLE
:
9160 return trivially_copyable_p (type1
);
9163 return type_code1
== UNION_TYPE
;
9165 case CPTK_IS_ASSIGNABLE
:
9166 return is_xible (MODIFY_EXPR
, type1
, type2
);
9168 case CPTK_IS_CONSTRUCTIBLE
:
9169 return is_xible (INIT_EXPR
, type1
, type2
);
9177 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9178 void, or a complete type, returns true, otherwise false. */
9181 check_trait_type (tree type
)
9183 if (type
== NULL_TREE
)
9186 if (TREE_CODE (type
) == TREE_LIST
)
9187 return (check_trait_type (TREE_VALUE (type
))
9188 && check_trait_type (TREE_CHAIN (type
)));
9190 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9191 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9194 if (VOID_TYPE_P (type
))
9197 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9200 /* Process a trait expression. */
9203 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9205 if (type1
== error_mark_node
9206 || type2
== error_mark_node
)
9207 return error_mark_node
;
9209 if (processing_template_decl
)
9211 tree trait_expr
= make_node (TRAIT_EXPR
);
9212 TREE_TYPE (trait_expr
) = boolean_type_node
;
9213 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9214 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9215 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9221 case CPTK_HAS_NOTHROW_ASSIGN
:
9222 case CPTK_HAS_TRIVIAL_ASSIGN
:
9223 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9224 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9225 case CPTK_HAS_NOTHROW_COPY
:
9226 case CPTK_HAS_TRIVIAL_COPY
:
9227 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9228 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9229 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9230 case CPTK_IS_ABSTRACT
:
9231 case CPTK_IS_AGGREGATE
:
9234 case CPTK_IS_LITERAL_TYPE
:
9236 case CPTK_IS_POLYMORPHIC
:
9237 case CPTK_IS_STD_LAYOUT
:
9238 case CPTK_IS_TRIVIAL
:
9239 case CPTK_IS_TRIVIALLY_COPYABLE
:
9240 if (!check_trait_type (type1
))
9241 return error_mark_node
;
9244 case CPTK_IS_ASSIGNABLE
:
9245 case CPTK_IS_CONSTRUCTIBLE
:
9248 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9249 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9250 if (!check_trait_type (type1
)
9251 || !check_trait_type (type2
))
9252 return error_mark_node
;
9255 case CPTK_IS_BASE_OF
:
9256 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9257 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9258 && !complete_type_or_else (type2
, NULL_TREE
))
9259 /* We already issued an error. */
9260 return error_mark_node
;
9266 case CPTK_IS_SAME_AS
:
9273 return (trait_expr_value (kind
, type1
, type2
)
9274 ? boolean_true_node
: boolean_false_node
);
9277 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9278 which is ignored for C++. */
9281 set_float_const_decimal64 (void)
9286 clear_float_const_decimal64 (void)
9291 float_const_decimal64_p (void)
9297 /* Return true if T designates the implied `this' parameter. */
9300 is_this_parameter (tree t
)
9302 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9304 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
9305 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
9309 /* Insert the deduced return type for an auto function. */
9312 apply_deduced_return_type (tree fco
, tree return_type
)
9316 if (return_type
== error_mark_node
)
9319 if (DECL_CONV_FN_P (fco
))
9320 DECL_NAME (fco
) = make_conv_op_name (return_type
);
9322 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9324 result
= DECL_RESULT (fco
);
9325 if (result
== NULL_TREE
)
9327 if (TREE_TYPE (result
) == return_type
)
9330 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
9331 && !complete_type_or_else (return_type
, NULL_TREE
))
9334 /* We already have a DECL_RESULT from start_preparsed_function.
9335 Now we need to redo the work it and allocate_struct_function
9336 did to reflect the new type. */
9337 gcc_assert (current_function_decl
== fco
);
9338 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9339 TYPE_MAIN_VARIANT (return_type
));
9340 DECL_ARTIFICIAL (result
) = 1;
9341 DECL_IGNORED_P (result
) = 1;
9342 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9345 DECL_RESULT (fco
) = result
;
9347 if (!processing_template_decl
)
9349 bool aggr
= aggregate_value_p (result
, fco
);
9350 #ifdef PCC_STATIC_STRUCT_RETURN
9351 cfun
->returns_pcc_struct
= aggr
;
9353 cfun
->returns_struct
= aggr
;
9358 /* DECL is a local variable or parameter from the surrounding scope of a
9359 lambda-expression. Returns the decltype for a use of the capture field
9360 for DECL even if it hasn't been captured yet. */
9363 capture_decltype (tree decl
)
9365 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9366 /* FIXME do lookup instead of list walk? */
9367 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9371 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9373 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9376 error ("%qD is not captured", decl
);
9377 return error_mark_node
;
9380 type
= TREE_TYPE (decl
);
9381 if (TREE_CODE (type
) == REFERENCE_TYPE
9382 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9383 type
= TREE_TYPE (type
);
9386 case CPLD_REFERENCE
:
9387 type
= TREE_TYPE (decl
);
9388 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9389 type
= build_reference_type (TREE_TYPE (decl
));
9396 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9398 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9399 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9401 type
= build_reference_type (type
);
9406 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9407 this is a right unary fold. Otherwise it is a left unary fold. */
9410 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9412 // Build a pack expansion (assuming expr has pack type).
9413 if (!uses_parameter_packs (expr
))
9415 error_at (location_of (expr
), "operand of fold expression has no "
9416 "unexpanded parameter packs");
9417 return error_mark_node
;
9419 tree pack
= make_pack_expansion (expr
);
9421 // Build the fold expression.
9422 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9423 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
9424 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9429 finish_left_unary_fold_expr (tree expr
, int op
)
9431 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9435 finish_right_unary_fold_expr (tree expr
, int op
)
9437 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9440 /* Build a binary fold expression over EXPR1 and EXPR2. The
9441 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9442 has an unexpanded parameter pack). */
9445 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9447 pack
= make_pack_expansion (pack
);
9448 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9449 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
9450 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9455 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9457 // Determine which expr has an unexpanded parameter pack and
9458 // set the pack and initial term.
9459 bool pack1
= uses_parameter_packs (expr1
);
9460 bool pack2
= uses_parameter_packs (expr2
);
9461 if (pack1
&& !pack2
)
9462 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9463 else if (pack2
&& !pack1
)
9464 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9468 error ("both arguments in binary fold have unexpanded parameter packs");
9470 error ("no unexpanded parameter packs in binary fold");
9472 return error_mark_node
;
9475 /* Finish __builtin_launder (arg). */
9478 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
9480 tree orig_arg
= arg
;
9481 if (!type_dependent_expression_p (arg
))
9482 arg
= decay_conversion (arg
, complain
);
9483 if (error_operand_p (arg
))
9484 return error_mark_node
;
9485 if (!type_dependent_expression_p (arg
)
9486 && TREE_CODE (TREE_TYPE (arg
)) != POINTER_TYPE
)
9488 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
9489 return error_mark_node
;
9491 if (processing_template_decl
)
9493 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
9494 TREE_TYPE (arg
), 1, arg
);
9497 #include "gt-cp-semantics.h"