1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998-2018 Free Software Foundation, Inc.
7 Written by Mark Mitchell (mmitchell@usa.net) based on code found
8 formerly in parse.y and pt.c.
10 This file is part of GCC.
12 GCC is free software; you can redistribute it and/or modify it
13 under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 3, or (at your option)
17 GCC is distributed in the hope that it will be useful, but
18 WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 General Public License for more details.
22 You should have received a copy of the GNU General Public License
23 along with GCC; see the file COPYING3. If not see
24 <http://www.gnu.org/licenses/>. */
28 #include "coretypes.h"
32 #include "stringpool.h"
36 #include "stor-layout.h"
37 #include "c-family/c-objc.h"
38 #include "tree-inline.h"
40 #include "tree-iterator.h"
41 #include "omp-general.h"
43 #include "stringpool.h"
45 #include "gomp-constants.h"
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 destination
= mark_rvalue_use (destination
);
618 if (!processing_template_decl
)
620 destination
= cp_convert (ptr_type_node
, destination
,
621 tf_warning_or_error
);
622 if (error_operand_p (destination
))
625 = fold_build_cleanup_point_expr (TREE_TYPE (destination
),
630 check_goto (destination
);
632 add_stmt (build_predict_expr (PRED_GOTO
, NOT_TAKEN
));
633 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
636 /* COND is the condition-expression for an if, while, etc.,
637 statement. Convert it to a boolean value, if appropriate.
638 In addition, verify sequence points if -Wsequence-point is enabled. */
641 maybe_convert_cond (tree cond
)
643 /* Empty conditions remain empty. */
647 /* Wait until we instantiate templates before doing conversion. */
648 if (processing_template_decl
)
651 if (warn_sequence_point
)
652 verify_sequence_points (cond
);
654 /* Do the conversion. */
655 cond
= convert_from_reference (cond
);
657 if (TREE_CODE (cond
) == MODIFY_EXPR
658 && !TREE_NO_WARNING (cond
)
661 warning_at (EXPR_LOC_OR_LOC (cond
, input_location
), OPT_Wparentheses
,
662 "suggest parentheses around assignment used as truth value");
663 TREE_NO_WARNING (cond
) = 1;
666 return condition_conversion (cond
);
669 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
672 finish_expr_stmt (tree expr
)
675 location_t loc
= EXPR_LOCATION (expr
);
677 if (expr
!= NULL_TREE
)
679 /* If we ran into a problem, make sure we complained. */
680 gcc_assert (expr
!= error_mark_node
|| seen_error ());
682 if (!processing_template_decl
)
684 if (warn_sequence_point
)
685 verify_sequence_points (expr
);
686 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
688 else if (!type_dependent_expression_p (expr
))
689 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
690 tf_warning_or_error
);
692 if (check_for_bare_parameter_packs (expr
))
693 expr
= error_mark_node
;
695 /* Simplification of inner statement expressions, compound exprs,
696 etc can result in us already having an EXPR_STMT. */
697 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
699 if (TREE_CODE (expr
) != EXPR_STMT
)
700 expr
= build_stmt (loc
, EXPR_STMT
, expr
);
701 expr
= maybe_cleanup_point_expr_void (expr
);
711 /* Begin an if-statement. Returns a newly created IF_STMT if
718 scope
= do_pushlevel (sk_cond
);
719 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
720 NULL_TREE
, NULL_TREE
, scope
);
721 current_binding_level
->this_entity
= r
;
722 begin_cond (&IF_COND (r
));
726 /* Process the COND of an if-statement, which may be given by
730 finish_if_stmt_cond (tree cond
, tree if_stmt
)
732 cond
= maybe_convert_cond (cond
);
733 if (IF_STMT_CONSTEXPR_P (if_stmt
)
734 && !type_dependent_expression_p (cond
)
735 && require_constant_expression (cond
)
736 && !instantiation_dependent_expression_p (cond
)
737 /* Wait until instantiation time, since only then COND has been
738 converted to bool. */
739 && TYPE_MAIN_VARIANT (TREE_TYPE (cond
)) == boolean_type_node
)
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
,
806 unsigned short unroll
)
808 cond
= maybe_convert_cond (cond
);
809 finish_cond (&WHILE_COND (while_stmt
), cond
);
810 begin_maybe_infinite_loop (cond
);
811 if (ivdep
&& cond
!= error_mark_node
)
812 WHILE_COND (while_stmt
) = build3 (ANNOTATE_EXPR
,
813 TREE_TYPE (WHILE_COND (while_stmt
)),
814 WHILE_COND (while_stmt
),
815 build_int_cst (integer_type_node
,
816 annot_expr_ivdep_kind
),
818 if (unroll
&& cond
!= error_mark_node
)
819 WHILE_COND (while_stmt
) = build3 (ANNOTATE_EXPR
,
820 TREE_TYPE (WHILE_COND (while_stmt
)),
821 WHILE_COND (while_stmt
),
822 build_int_cst (integer_type_node
,
823 annot_expr_unroll_kind
),
824 build_int_cst (integer_type_node
,
826 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
829 /* Finish a while-statement, which may be given by WHILE_STMT. */
832 finish_while_stmt (tree while_stmt
)
834 end_maybe_infinite_loop (boolean_true_node
);
835 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
838 /* Begin a do-statement. Returns a newly created DO_STMT if
844 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
845 begin_maybe_infinite_loop (boolean_true_node
);
847 DO_BODY (r
) = push_stmt_list ();
851 /* Finish the body of a do-statement, which may be given by DO_STMT. */
854 finish_do_body (tree do_stmt
)
856 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
858 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
859 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
861 if (IS_EMPTY_STMT (body
))
862 warning (OPT_Wempty_body
,
863 "suggest explicit braces around empty body in %<do%> statement");
866 /* Finish a do-statement, which may be given by DO_STMT, and whose
867 COND is as indicated. */
870 finish_do_stmt (tree cond
, tree do_stmt
, bool ivdep
, unsigned short unroll
)
872 cond
= maybe_convert_cond (cond
);
873 end_maybe_infinite_loop (cond
);
874 if (ivdep
&& cond
!= error_mark_node
)
875 cond
= build3 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
876 build_int_cst (integer_type_node
, annot_expr_ivdep_kind
),
878 if (unroll
&& cond
!= error_mark_node
)
879 cond
= build3 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
880 build_int_cst (integer_type_node
, annot_expr_unroll_kind
),
881 build_int_cst (integer_type_node
, unroll
));
882 DO_COND (do_stmt
) = cond
;
885 /* Finish a return-statement. The EXPRESSION returned, if any, is as
889 finish_return_stmt (tree expr
)
894 expr
= check_return_expr (expr
, &no_warning
);
896 if (error_operand_p (expr
)
897 || (flag_openmp
&& !check_omp_return ()))
899 /* Suppress -Wreturn-type for this function. */
900 if (warn_return_type
)
901 TREE_NO_WARNING (current_function_decl
) = true;
902 return error_mark_node
;
905 if (!processing_template_decl
)
907 if (warn_sequence_point
)
908 verify_sequence_points (expr
);
910 if (DECL_DESTRUCTOR_P (current_function_decl
)
911 || (DECL_CONSTRUCTOR_P (current_function_decl
)
912 && targetm
.cxx
.cdtor_returns_this ()))
914 /* Similarly, all destructors must run destructors for
915 base-classes before returning. So, all returns in a
916 destructor get sent to the DTOR_LABEL; finish_function emits
917 code to return a value there. */
918 return finish_goto_stmt (cdtor_label
);
922 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
923 TREE_NO_WARNING (r
) |= no_warning
;
924 r
= maybe_cleanup_point_expr_void (r
);
930 /* Begin the scope of a for-statement or a range-for-statement.
931 Both the returned trees are to be used in a call to
932 begin_for_stmt or begin_range_for_stmt. */
935 begin_for_scope (tree
*init
)
937 tree scope
= do_pushlevel (sk_for
);
939 if (processing_template_decl
)
940 *init
= push_stmt_list ();
947 /* Begin a for-statement. Returns a new FOR_STMT.
948 SCOPE and INIT should be the return of begin_for_scope,
952 begin_for_stmt (tree scope
, tree init
)
956 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
957 NULL_TREE
, NULL_TREE
, NULL_TREE
);
959 if (scope
== NULL_TREE
)
962 scope
= begin_for_scope (&init
);
965 FOR_INIT_STMT (r
) = init
;
966 FOR_SCOPE (r
) = scope
;
971 /* Finish the init-statement of a for-statement, which may be
972 given by FOR_STMT. */
975 finish_init_stmt (tree for_stmt
)
977 if (processing_template_decl
)
978 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
980 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
981 begin_cond (&FOR_COND (for_stmt
));
984 /* Finish the COND of a for-statement, which may be given by
988 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
, unsigned short unroll
)
990 cond
= maybe_convert_cond (cond
);
991 finish_cond (&FOR_COND (for_stmt
), cond
);
992 begin_maybe_infinite_loop (cond
);
993 if (ivdep
&& cond
!= error_mark_node
)
994 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
995 TREE_TYPE (FOR_COND (for_stmt
)),
997 build_int_cst (integer_type_node
,
998 annot_expr_ivdep_kind
),
1000 if (unroll
&& cond
!= error_mark_node
)
1001 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
1002 TREE_TYPE (FOR_COND (for_stmt
)),
1003 FOR_COND (for_stmt
),
1004 build_int_cst (integer_type_node
,
1005 annot_expr_unroll_kind
),
1006 build_int_cst (integer_type_node
,
1008 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
1011 /* Finish the increment-EXPRESSION in a for-statement, which may be
1012 given by FOR_STMT. */
1015 finish_for_expr (tree expr
, tree for_stmt
)
1019 /* If EXPR is an overloaded function, issue an error; there is no
1020 context available to use to perform overload resolution. */
1021 if (type_unknown_p (expr
))
1023 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
1024 expr
= error_mark_node
;
1026 if (!processing_template_decl
)
1028 if (warn_sequence_point
)
1029 verify_sequence_points (expr
);
1030 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1031 tf_warning_or_error
);
1033 else if (!type_dependent_expression_p (expr
))
1034 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1035 tf_warning_or_error
);
1036 expr
= maybe_cleanup_point_expr_void (expr
);
1037 if (check_for_bare_parameter_packs (expr
))
1038 expr
= error_mark_node
;
1039 FOR_EXPR (for_stmt
) = expr
;
1042 /* Finish the body of a for-statement, which may be given by
1043 FOR_STMT. The increment-EXPR for the loop must be
1045 It can also finish RANGE_FOR_STMT. */
1048 finish_for_stmt (tree for_stmt
)
1050 end_maybe_infinite_loop (boolean_true_node
);
1052 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1053 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1055 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1057 /* Pop the scope for the body of the loop. */
1058 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1059 ? &RANGE_FOR_SCOPE (for_stmt
)
1060 : &FOR_SCOPE (for_stmt
));
1061 tree scope
= *scope_ptr
;
1063 add_stmt (do_poplevel (scope
));
1066 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1067 SCOPE and INIT should be the return of begin_for_scope,
1069 To finish it call finish_for_stmt(). */
1072 begin_range_for_stmt (tree scope
, tree init
)
1074 begin_maybe_infinite_loop (boolean_false_node
);
1076 tree r
= build_stmt (input_location
, RANGE_FOR_STMT
,
1077 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1079 if (scope
== NULL_TREE
)
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
))
1122 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1125 /* Finish a continue-statement. */
1128 finish_continue_stmt (void)
1130 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1133 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1137 begin_switch_stmt (void)
1141 scope
= do_pushlevel (sk_cond
);
1142 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1144 begin_cond (&SWITCH_STMT_COND (r
));
1149 /* Finish the cond of a switch-statement. */
1152 finish_switch_cond (tree cond
, tree switch_stmt
)
1154 tree orig_type
= NULL
;
1156 if (!processing_template_decl
)
1158 /* Convert the condition to an integer or enumeration type. */
1159 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1160 if (cond
== NULL_TREE
)
1162 error ("switch quantity not an integer");
1163 cond
= error_mark_node
;
1165 /* We want unlowered type here to handle enum bit-fields. */
1166 orig_type
= unlowered_expr_type (cond
);
1167 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1168 orig_type
= TREE_TYPE (cond
);
1169 if (cond
!= error_mark_node
)
1173 Integral promotions are performed. */
1174 cond
= perform_integral_promotions (cond
);
1175 cond
= maybe_cleanup_point_expr (cond
);
1178 if (check_for_bare_parameter_packs (cond
))
1179 cond
= error_mark_node
;
1180 else if (!processing_template_decl
&& warn_sequence_point
)
1181 verify_sequence_points (cond
);
1183 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1184 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1185 add_stmt (switch_stmt
);
1186 push_switch (switch_stmt
);
1187 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1190 /* Finish the body of a switch-statement, which may be given by
1191 SWITCH_STMT. The COND to switch on is indicated. */
1194 finish_switch_stmt (tree switch_stmt
)
1198 SWITCH_STMT_BODY (switch_stmt
) =
1199 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1202 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1203 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1204 add_stmt (do_poplevel (scope
));
1207 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1211 begin_try_block (void)
1213 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1215 TRY_STMTS (r
) = push_stmt_list ();
1219 /* Likewise, for a function-try-block. The block returned in
1220 *COMPOUND_STMT is an artificial outer scope, containing the
1221 function-try-block. */
1224 begin_function_try_block (tree
*compound_stmt
)
1227 /* This outer scope does not exist in the C++ standard, but we need
1228 a place to put __FUNCTION__ and similar variables. */
1229 *compound_stmt
= begin_compound_stmt (0);
1230 r
= begin_try_block ();
1231 FN_TRY_BLOCK_P (r
) = 1;
1235 /* Finish a try-block, which may be given by TRY_BLOCK. */
1238 finish_try_block (tree try_block
)
1240 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1241 TRY_HANDLERS (try_block
) = push_stmt_list ();
1244 /* Finish the body of a cleanup try-block, which may be given by
1248 finish_cleanup_try_block (tree try_block
)
1250 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1253 /* Finish an implicitly generated try-block, with a cleanup is given
1257 finish_cleanup (tree cleanup
, tree try_block
)
1259 TRY_HANDLERS (try_block
) = cleanup
;
1260 CLEANUP_P (try_block
) = 1;
1263 /* Likewise, for a function-try-block. */
1266 finish_function_try_block (tree try_block
)
1268 finish_try_block (try_block
);
1269 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1270 the try block, but moving it inside. */
1271 in_function_try_handler
= 1;
1274 /* Finish a handler-sequence for a try-block, which may be given by
1278 finish_handler_sequence (tree try_block
)
1280 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1281 check_handlers (TRY_HANDLERS (try_block
));
1284 /* Finish the handler-seq for a function-try-block, given by
1285 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1286 begin_function_try_block. */
1289 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1291 in_function_try_handler
= 0;
1292 finish_handler_sequence (try_block
);
1293 finish_compound_stmt (compound_stmt
);
1296 /* Begin a handler. Returns a HANDLER if appropriate. */
1299 begin_handler (void)
1303 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1306 /* Create a binding level for the eh_info and the exception object
1308 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1313 /* Finish the handler-parameters for a handler, which may be given by
1314 HANDLER. DECL is the declaration for the catch parameter, or NULL
1315 if this is a `catch (...)' clause. */
1318 finish_handler_parms (tree decl
, tree handler
)
1320 tree type
= NULL_TREE
;
1321 if (processing_template_decl
)
1325 decl
= pushdecl (decl
);
1326 decl
= push_template_decl (decl
);
1327 HANDLER_PARMS (handler
) = decl
;
1328 type
= TREE_TYPE (decl
);
1333 type
= expand_start_catch_block (decl
);
1334 if (warn_catch_value
1335 && type
!= NULL_TREE
1336 && type
!= error_mark_node
1337 && !TYPE_REF_P (TREE_TYPE (decl
)))
1339 tree orig_type
= TREE_TYPE (decl
);
1340 if (CLASS_TYPE_P (orig_type
))
1342 if (TYPE_POLYMORPHIC_P (orig_type
))
1343 warning (OPT_Wcatch_value_
,
1344 "catching polymorphic type %q#T by value", orig_type
);
1345 else if (warn_catch_value
> 1)
1346 warning (OPT_Wcatch_value_
,
1347 "catching type %q#T by value", orig_type
);
1349 else if (warn_catch_value
> 2)
1350 warning (OPT_Wcatch_value_
,
1351 "catching non-reference type %q#T", orig_type
);
1354 HANDLER_TYPE (handler
) = type
;
1357 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1358 the return value from the matching call to finish_handler_parms. */
1361 finish_handler (tree handler
)
1363 if (!processing_template_decl
)
1364 expand_end_catch_block ();
1365 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1368 /* Begin a compound statement. FLAGS contains some bits that control the
1369 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1370 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1371 block of a function. If BCS_TRY_BLOCK is set, this is the block
1372 created on behalf of a TRY statement. Returns a token to be passed to
1373 finish_compound_stmt. */
1376 begin_compound_stmt (unsigned int flags
)
1380 if (flags
& BCS_NO_SCOPE
)
1382 r
= push_stmt_list ();
1383 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1385 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1386 But, if it's a statement-expression with a scopeless block, there's
1387 nothing to keep, and we don't want to accidentally keep a block
1388 *inside* the scopeless block. */
1389 keep_next_level (false);
1393 scope_kind sk
= sk_block
;
1394 if (flags
& BCS_TRY_BLOCK
)
1396 else if (flags
& BCS_TRANSACTION
)
1397 sk
= sk_transaction
;
1398 r
= do_pushlevel (sk
);
1401 /* When processing a template, we need to remember where the braces were,
1402 so that we can set up identical scopes when instantiating the template
1403 later. BIND_EXPR is a handy candidate for this.
1404 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1405 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1406 processing templates. */
1407 if (processing_template_decl
)
1409 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1410 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1411 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1412 TREE_SIDE_EFFECTS (r
) = 1;
1418 /* Finish a compound-statement, which is given by STMT. */
1421 finish_compound_stmt (tree stmt
)
1423 if (TREE_CODE (stmt
) == BIND_EXPR
)
1425 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1426 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1427 discard the BIND_EXPR so it can be merged with the containing
1429 if (TREE_CODE (body
) == STATEMENT_LIST
1430 && STATEMENT_LIST_HEAD (body
) == NULL
1431 && !BIND_EXPR_BODY_BLOCK (stmt
)
1432 && !BIND_EXPR_TRY_BLOCK (stmt
))
1435 BIND_EXPR_BODY (stmt
) = body
;
1437 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1438 stmt
= pop_stmt_list (stmt
);
1441 /* Destroy any ObjC "super" receivers that may have been
1443 objc_clear_super_receiver ();
1445 stmt
= do_poplevel (stmt
);
1448 /* ??? See c_end_compound_stmt wrt statement expressions. */
1452 /* Finish an asm-statement, whose components are a STRING, some
1453 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1454 LABELS. Also note whether the asm-statement should be
1455 considered volatile. */
1458 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1459 tree input_operands
, tree clobbers
, tree labels
)
1463 int ninputs
= list_length (input_operands
);
1464 int noutputs
= list_length (output_operands
);
1466 if (!processing_template_decl
)
1468 const char *constraint
;
1469 const char **oconstraints
;
1470 bool allows_mem
, allows_reg
, is_inout
;
1474 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1476 string
= resolve_asm_operand_names (string
, output_operands
,
1477 input_operands
, labels
);
1479 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1481 operand
= TREE_VALUE (t
);
1483 /* ??? Really, this should not be here. Users should be using a
1484 proper lvalue, dammit. But there's a long history of using
1485 casts in the output operands. In cases like longlong.h, this
1486 becomes a primitive form of typechecking -- if the cast can be
1487 removed, then the output operand had a type of the proper width;
1488 otherwise we'll get an error. Gross, but ... */
1489 STRIP_NOPS (operand
);
1491 operand
= mark_lvalue_use (operand
);
1493 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1494 operand
= error_mark_node
;
1496 if (operand
!= error_mark_node
1497 && (TREE_READONLY (operand
)
1498 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1499 /* Functions are not modifiable, even though they are
1501 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1502 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1503 /* If it's an aggregate and any field is const, then it is
1504 effectively const. */
1505 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1506 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1507 cxx_readonly_error (operand
, lv_asm
);
1509 tree
*op
= &operand
;
1510 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1511 op
= &TREE_OPERAND (*op
, 1);
1512 switch (TREE_CODE (*op
))
1514 case PREINCREMENT_EXPR
:
1515 case PREDECREMENT_EXPR
:
1517 *op
= genericize_compound_lvalue (*op
);
1518 op
= &TREE_OPERAND (*op
, 1);
1524 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1525 oconstraints
[i
] = constraint
;
1527 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1528 &allows_mem
, &allows_reg
, &is_inout
))
1530 /* If the operand is going to end up in memory,
1531 mark it addressable. */
1532 if (!allows_reg
&& !cxx_mark_addressable (*op
))
1533 operand
= error_mark_node
;
1536 operand
= error_mark_node
;
1538 TREE_VALUE (t
) = operand
;
1541 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1543 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1544 bool constraint_parsed
1545 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1546 oconstraints
, &allows_mem
, &allows_reg
);
1547 /* If the operand is going to end up in memory, don't call
1548 decay_conversion. */
1549 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1550 operand
= mark_lvalue_use (TREE_VALUE (t
));
1552 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1554 /* If the type of the operand hasn't been determined (e.g.,
1555 because it involves an overloaded function), then issue
1556 an error message. There's no context available to
1557 resolve the overloading. */
1558 if (TREE_TYPE (operand
) == unknown_type_node
)
1560 error ("type of asm operand %qE could not be determined",
1562 operand
= error_mark_node
;
1565 if (constraint_parsed
)
1567 /* If the operand is going to end up in memory,
1568 mark it addressable. */
1569 if (!allows_reg
&& allows_mem
)
1571 /* Strip the nops as we allow this case. FIXME, this really
1572 should be rejected or made deprecated. */
1573 STRIP_NOPS (operand
);
1575 tree
*op
= &operand
;
1576 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1577 op
= &TREE_OPERAND (*op
, 1);
1578 switch (TREE_CODE (*op
))
1580 case PREINCREMENT_EXPR
:
1581 case PREDECREMENT_EXPR
:
1583 *op
= genericize_compound_lvalue (*op
);
1584 op
= &TREE_OPERAND (*op
, 1);
1590 if (!cxx_mark_addressable (*op
))
1591 operand
= error_mark_node
;
1593 else if (!allows_reg
&& !allows_mem
)
1595 /* If constraint allows neither register nor memory,
1596 try harder to get a constant. */
1597 tree constop
= maybe_constant_value (operand
);
1598 if (TREE_CONSTANT (constop
))
1603 operand
= error_mark_node
;
1605 TREE_VALUE (t
) = operand
;
1609 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1610 output_operands
, input_operands
,
1612 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1613 r
= maybe_cleanup_point_expr_void (r
);
1614 return add_stmt (r
);
1617 /* Finish a label with the indicated NAME. Returns the new label. */
1620 finish_label_stmt (tree name
)
1622 tree decl
= define_label (input_location
, name
);
1624 if (decl
== error_mark_node
)
1625 return error_mark_node
;
1627 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1632 /* Finish a series of declarations for local labels. G++ allows users
1633 to declare "local" labels, i.e., labels with scope. This extension
1634 is useful when writing code involving statement-expressions. */
1637 finish_label_decl (tree name
)
1639 if (!at_function_scope_p ())
1641 error ("__label__ declarations are only allowed in function scopes");
1645 add_decl_expr (declare_local_label (name
));
1648 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1651 finish_decl_cleanup (tree decl
, tree cleanup
)
1653 push_cleanup (decl
, cleanup
, false);
1656 /* If the current scope exits with an exception, run CLEANUP. */
1659 finish_eh_cleanup (tree cleanup
)
1661 push_cleanup (NULL
, cleanup
, true);
1664 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1665 order they were written by the user. Each node is as for
1666 emit_mem_initializers. */
1669 finish_mem_initializers (tree mem_inits
)
1671 /* Reorder the MEM_INITS so that they are in the order they appeared
1672 in the source program. */
1673 mem_inits
= nreverse (mem_inits
);
1675 if (processing_template_decl
)
1679 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1681 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1682 check for bare parameter packs in the TREE_VALUE, because
1683 any parameter packs in the TREE_VALUE have already been
1684 bound as part of the TREE_PURPOSE. See
1685 make_pack_expansion for more information. */
1686 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1687 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1688 TREE_VALUE (mem
) = error_mark_node
;
1691 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1692 CTOR_INITIALIZER
, mem_inits
));
1695 emit_mem_initializers (mem_inits
);
1698 /* Obfuscate EXPR if it looks like an id-expression or member access so
1699 that the call to finish_decltype in do_auto_deduction will give the
1703 force_paren_expr (tree expr
)
1705 /* This is only needed for decltype(auto) in C++14. */
1706 if (cxx_dialect
< cxx14
)
1709 /* If we're in unevaluated context, we can't be deducing a
1710 return/initializer type, so we don't need to mess with this. */
1711 if (cp_unevaluated_operand
)
1714 if (!DECL_P (expr
) && TREE_CODE (expr
) != COMPONENT_REF
1715 && TREE_CODE (expr
) != SCOPE_REF
)
1718 if (TREE_CODE (expr
) == COMPONENT_REF
1719 || TREE_CODE (expr
) == SCOPE_REF
)
1720 REF_PARENTHESIZED_P (expr
) = true;
1721 else if (processing_template_decl
)
1722 expr
= build1 (PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1723 else if (VAR_P (expr
) && DECL_HARD_REGISTER (expr
))
1724 /* We can't bind a hard register variable to a reference. */;
1727 cp_lvalue_kind kind
= lvalue_kind (expr
);
1728 if ((kind
& ~clk_class
) != clk_none
)
1730 tree type
= unlowered_expr_type (expr
);
1731 bool rval
= !!(kind
& clk_rvalueref
);
1732 type
= cp_build_reference_type (type
, rval
);
1733 /* This inhibits warnings in, eg, cxx_mark_addressable
1735 warning_sentinel
s (extra_warnings
);
1736 expr
= build_static_cast (type
, expr
, tf_error
);
1737 if (expr
!= error_mark_node
)
1738 REF_PARENTHESIZED_P (expr
) = true;
1745 /* If T is an id-expression obfuscated by force_paren_expr, undo the
1746 obfuscation and return the underlying id-expression. Otherwise
1750 maybe_undo_parenthesized_ref (tree t
)
1752 if (cxx_dialect
< cxx14
)
1755 if (INDIRECT_REF_P (t
) && REF_PARENTHESIZED_P (t
))
1757 t
= TREE_OPERAND (t
, 0);
1758 while (TREE_CODE (t
) == NON_LVALUE_EXPR
1759 || TREE_CODE (t
) == NOP_EXPR
)
1760 t
= TREE_OPERAND (t
, 0);
1762 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
1763 || TREE_CODE (t
) == STATIC_CAST_EXPR
);
1764 t
= TREE_OPERAND (t
, 0);
1766 else if (TREE_CODE (t
) == PAREN_EXPR
)
1767 t
= TREE_OPERAND (t
, 0);
1772 /* Finish a parenthesized expression EXPR. */
1775 finish_parenthesized_expr (cp_expr expr
)
1778 /* This inhibits warnings in c_common_truthvalue_conversion. */
1779 TREE_NO_WARNING (expr
) = 1;
1781 if (TREE_CODE (expr
) == OFFSET_REF
1782 || TREE_CODE (expr
) == SCOPE_REF
)
1783 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1784 enclosed in parentheses. */
1785 PTRMEM_OK_P (expr
) = 0;
1787 if (TREE_CODE (expr
) == STRING_CST
)
1788 PAREN_STRING_LITERAL_P (expr
) = 1;
1790 expr
= cp_expr (force_paren_expr (expr
), expr
.get_location ());
1795 /* Finish a reference to a non-static data member (DECL) that is not
1796 preceded by `.' or `->'. */
1799 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1801 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1802 bool try_omp_private
= !object
&& omp_private_member_map
;
1807 tree scope
= qualifying_scope
;
1808 if (scope
== NULL_TREE
)
1809 scope
= context_for_name_lookup (decl
);
1810 object
= maybe_dummy_object (scope
, NULL
);
1813 object
= maybe_resolve_dummy (object
, true);
1814 if (object
== error_mark_node
)
1815 return error_mark_node
;
1817 /* DR 613/850: Can use non-static data members without an associated
1818 object in sizeof/decltype/alignof. */
1819 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1820 && (!processing_template_decl
|| !current_class_ref
))
1822 if (current_function_decl
1823 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1824 error ("invalid use of member %qD in static member function", decl
);
1826 error ("invalid use of non-static data member %qD", decl
);
1827 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1829 return error_mark_node
;
1832 if (current_class_ptr
)
1833 TREE_USED (current_class_ptr
) = 1;
1834 if (processing_template_decl
&& !qualifying_scope
)
1836 tree type
= TREE_TYPE (decl
);
1838 if (TYPE_REF_P (type
))
1839 /* Quals on the object don't matter. */;
1840 else if (PACK_EXPANSION_P (type
))
1841 /* Don't bother trying to represent this. */
1845 /* Set the cv qualifiers. */
1846 int quals
= cp_type_quals (TREE_TYPE (object
));
1848 if (DECL_MUTABLE_P (decl
))
1849 quals
&= ~TYPE_QUAL_CONST
;
1851 quals
|= cp_type_quals (TREE_TYPE (decl
));
1852 type
= cp_build_qualified_type (type
, quals
);
1855 ret
= (convert_from_reference
1856 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1858 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1859 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1861 else if (processing_template_decl
)
1862 ret
= build_qualified_name (TREE_TYPE (decl
),
1865 /*template_p=*/false);
1868 tree access_type
= TREE_TYPE (object
);
1870 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1871 decl
, tf_warning_or_error
);
1873 /* If the data member was named `C::M', convert `*this' to `C'
1875 if (qualifying_scope
)
1877 tree binfo
= NULL_TREE
;
1878 object
= build_scoped_ref (object
, qualifying_scope
,
1882 ret
= build_class_member_access_expr (object
, decl
,
1883 /*access_path=*/NULL_TREE
,
1884 /*preserve_reference=*/false,
1885 tf_warning_or_error
);
1887 if (try_omp_private
)
1889 tree
*v
= omp_private_member_map
->get (decl
);
1891 ret
= convert_from_reference (*v
);
1896 /* If we are currently parsing a template and we encountered a typedef
1897 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1898 adds the typedef to a list tied to the current template.
1899 At template instantiation time, that list is walked and access check
1900 performed for each typedef.
1901 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1904 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1906 location_t location
)
1908 tree template_info
= NULL
;
1909 tree cs
= current_scope ();
1911 if (!is_typedef_decl (typedef_decl
)
1913 || !CLASS_TYPE_P (context
)
1917 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1918 template_info
= get_template_info (cs
);
1921 && TI_TEMPLATE (template_info
)
1922 && !currently_open_class (context
))
1923 append_type_to_template_for_access_check (cs
, typedef_decl
,
1927 /* DECL was the declaration to which a qualified-id resolved. Issue
1928 an error message if it is not accessible. If OBJECT_TYPE is
1929 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1930 type of `*x', or `x', respectively. If the DECL was named as
1931 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1934 check_accessibility_of_qualified_id (tree decl
,
1936 tree nested_name_specifier
)
1939 tree qualifying_type
= NULL_TREE
;
1941 /* If we are parsing a template declaration and if decl is a typedef,
1942 add it to a list tied to the template.
1943 At template instantiation time, that list will be walked and
1944 access check performed. */
1945 add_typedef_to_current_template_for_access_check (decl
,
1946 nested_name_specifier
1947 ? nested_name_specifier
1948 : DECL_CONTEXT (decl
),
1951 /* If we're not checking, return immediately. */
1952 if (deferred_access_no_check
)
1955 /* Determine the SCOPE of DECL. */
1956 scope
= context_for_name_lookup (decl
);
1957 /* If the SCOPE is not a type, then DECL is not a member. */
1958 if (!TYPE_P (scope
))
1960 /* Compute the scope through which DECL is being accessed. */
1962 /* OBJECT_TYPE might not be a class type; consider:
1964 class A { typedef int I; };
1968 In this case, we will have "A::I" as the DECL, but "I" as the
1970 && CLASS_TYPE_P (object_type
)
1971 && DERIVED_FROM_P (scope
, object_type
))
1972 /* If we are processing a `->' or `.' expression, use the type of the
1974 qualifying_type
= object_type
;
1975 else if (nested_name_specifier
)
1977 /* If the reference is to a non-static member of the
1978 current class, treat it as if it were referenced through
1981 if (DECL_NONSTATIC_MEMBER_P (decl
)
1982 && current_class_ptr
1983 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
1984 qualifying_type
= ct
;
1985 /* Otherwise, use the type indicated by the
1986 nested-name-specifier. */
1988 qualifying_type
= nested_name_specifier
;
1991 /* Otherwise, the name must be from the current class or one of
1993 qualifying_type
= currently_open_derived_class (scope
);
1996 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1997 or similar in a default argument value. */
1998 && CLASS_TYPE_P (qualifying_type
)
1999 && !dependent_type_p (qualifying_type
))
2000 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
2001 decl
, tf_warning_or_error
);
2004 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
2005 class named to the left of the "::" operator. DONE is true if this
2006 expression is a complete postfix-expression; it is false if this
2007 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
2008 iff this expression is the operand of '&'. TEMPLATE_P is true iff
2009 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
2010 is true iff this qualified name appears as a template argument. */
2013 finish_qualified_id_expr (tree qualifying_class
,
2018 bool template_arg_p
,
2019 tsubst_flags_t complain
)
2021 gcc_assert (TYPE_P (qualifying_class
));
2023 if (error_operand_p (expr
))
2024 return error_mark_node
;
2026 if ((DECL_P (expr
) || BASELINK_P (expr
))
2027 && !mark_used (expr
, complain
))
2028 return error_mark_node
;
2032 if (TREE_CODE (expr
) == UNBOUND_CLASS_TEMPLATE
)
2034 /* cp_parser_lookup_name thought we were looking for a type,
2035 but we're actually looking for a declaration. */
2036 qualifying_class
= TYPE_CONTEXT (expr
);
2037 expr
= TYPE_IDENTIFIER (expr
);
2040 check_template_keyword (expr
);
2043 /* If EXPR occurs as the operand of '&', use special handling that
2044 permits a pointer-to-member. */
2045 if (address_p
&& done
)
2047 if (TREE_CODE (expr
) == SCOPE_REF
)
2048 expr
= TREE_OPERAND (expr
, 1);
2049 expr
= build_offset_ref (qualifying_class
, expr
,
2050 /*address_p=*/true, complain
);
2054 /* No need to check access within an enum. */
2055 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
2056 && TREE_CODE (expr
) != IDENTIFIER_NODE
)
2059 /* Within the scope of a class, turn references to non-static
2060 members into expression of the form "this->...". */
2062 /* But, within a template argument, we do not want make the
2063 transformation, as there is no "this" pointer. */
2065 else if (TREE_CODE (expr
) == FIELD_DECL
)
2067 push_deferring_access_checks (dk_no_check
);
2068 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
2070 pop_deferring_access_checks ();
2072 else if (BASELINK_P (expr
))
2074 /* See if any of the functions are non-static members. */
2075 /* If so, the expression may be relative to 'this'. */
2076 if (!shared_member_p (expr
)
2077 && current_class_ptr
2078 && DERIVED_FROM_P (qualifying_class
,
2079 current_nonlambda_class_type ()))
2080 expr
= (build_class_member_access_expr
2081 (maybe_dummy_object (qualifying_class
, NULL
),
2083 BASELINK_ACCESS_BINFO (expr
),
2084 /*preserve_reference=*/false,
2087 /* The expression is a qualified name whose address is not
2089 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
2094 /* In a template, return a SCOPE_REF for most qualified-ids
2095 so that we can check access at instantiation time. But if
2096 we're looking at a member of the current instantiation, we
2097 know we have access and building up the SCOPE_REF confuses
2098 non-type template argument handling. */
2099 if (processing_template_decl
2100 && (!currently_open_class (qualifying_class
)
2101 || TREE_CODE (expr
) == IDENTIFIER_NODE
2102 || TREE_CODE (expr
) == TEMPLATE_ID_EXPR
2103 || TREE_CODE (expr
) == BIT_NOT_EXPR
))
2104 expr
= build_qualified_name (TREE_TYPE (expr
),
2105 qualifying_class
, expr
,
2108 expr
= convert_from_reference (expr
);
2114 /* Begin a statement-expression. The value returned must be passed to
2115 finish_stmt_expr. */
2118 begin_stmt_expr (void)
2120 return push_stmt_list ();
2123 /* Process the final expression of a statement expression. EXPR can be
2124 NULL, if the final expression is empty. Return a STATEMENT_LIST
2125 containing all the statements in the statement-expression, or
2126 ERROR_MARK_NODE if there was an error. */
2129 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2131 if (error_operand_p (expr
))
2133 /* The type of the statement-expression is the type of the last
2135 TREE_TYPE (stmt_expr
) = error_mark_node
;
2136 return error_mark_node
;
2139 /* If the last statement does not have "void" type, then the value
2140 of the last statement is the value of the entire expression. */
2143 tree type
= TREE_TYPE (expr
);
2145 if (type
&& type_unknown_p (type
))
2147 error ("a statement expression is an insufficient context"
2148 " for overload resolution");
2149 TREE_TYPE (stmt_expr
) = error_mark_node
;
2150 return error_mark_node
;
2152 else if (processing_template_decl
)
2154 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2155 expr
= add_stmt (expr
);
2156 /* Mark the last statement so that we can recognize it as such at
2157 template-instantiation time. */
2158 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2160 else if (VOID_TYPE_P (type
))
2162 /* Just treat this like an ordinary statement. */
2163 expr
= finish_expr_stmt (expr
);
2167 /* It actually has a value we need to deal with. First, force it
2168 to be an rvalue so that we won't need to build up a copy
2169 constructor call later when we try to assign it to something. */
2170 expr
= force_rvalue (expr
, tf_warning_or_error
);
2171 if (error_operand_p (expr
))
2172 return error_mark_node
;
2174 /* Update for array-to-pointer decay. */
2175 type
= TREE_TYPE (expr
);
2177 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2178 normal statement, but don't convert to void or actually add
2180 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2181 expr
= maybe_cleanup_point_expr (expr
);
2185 /* The type of the statement-expression is the type of the last
2187 TREE_TYPE (stmt_expr
) = type
;
2193 /* Finish a statement-expression. EXPR should be the value returned
2194 by the previous begin_stmt_expr. Returns an expression
2195 representing the statement-expression. */
2198 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2203 if (error_operand_p (stmt_expr
))
2205 pop_stmt_list (stmt_expr
);
2206 return error_mark_node
;
2209 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2211 type
= TREE_TYPE (stmt_expr
);
2212 result
= pop_stmt_list (stmt_expr
);
2213 TREE_TYPE (result
) = type
;
2215 if (processing_template_decl
)
2217 result
= build_min (STMT_EXPR
, type
, result
);
2218 TREE_SIDE_EFFECTS (result
) = 1;
2219 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2221 else if (CLASS_TYPE_P (type
))
2223 /* Wrap the statement-expression in a TARGET_EXPR so that the
2224 temporary object created by the final expression is destroyed at
2225 the end of the full-expression containing the
2226 statement-expression. */
2227 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2233 /* Returns the expression which provides the value of STMT_EXPR. */
2236 stmt_expr_value_expr (tree stmt_expr
)
2238 tree t
= STMT_EXPR_STMT (stmt_expr
);
2240 if (TREE_CODE (t
) == BIND_EXPR
)
2241 t
= BIND_EXPR_BODY (t
);
2243 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2244 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2246 if (TREE_CODE (t
) == EXPR_STMT
)
2247 t
= EXPR_STMT_EXPR (t
);
2252 /* Return TRUE iff EXPR_STMT is an empty list of
2253 expression statements. */
2256 empty_expr_stmt_p (tree expr_stmt
)
2258 tree body
= NULL_TREE
;
2260 if (expr_stmt
== void_node
)
2265 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2266 body
= EXPR_STMT_EXPR (expr_stmt
);
2267 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2273 if (TREE_CODE (body
) == STATEMENT_LIST
)
2274 return tsi_end_p (tsi_start (body
));
2276 return empty_expr_stmt_p (body
);
2281 /* Perform Koenig lookup. FN is the postfix-expression representing
2282 the function (or functions) to call; ARGS are the arguments to the
2283 call. Returns the functions to be considered by overload resolution. */
2286 perform_koenig_lookup (cp_expr fn
, vec
<tree
, va_gc
> *args
,
2287 tsubst_flags_t complain
)
2289 tree identifier
= NULL_TREE
;
2290 tree functions
= NULL_TREE
;
2291 tree tmpl_args
= NULL_TREE
;
2292 bool template_id
= false;
2293 location_t loc
= fn
.get_location ();
2295 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2297 /* Use a separate flag to handle null args. */
2299 tmpl_args
= TREE_OPERAND (fn
, 1);
2300 fn
= TREE_OPERAND (fn
, 0);
2303 /* Find the name of the overloaded function. */
2304 if (identifier_p (fn
))
2309 identifier
= OVL_NAME (functions
);
2312 /* A call to a namespace-scope function using an unqualified name.
2314 Do Koenig lookup -- unless any of the arguments are
2316 if (!any_type_dependent_arguments_p (args
)
2317 && !any_dependent_template_arguments_p (tmpl_args
))
2319 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2322 /* The unqualified name could not be resolved. */
2323 if (complain
& tf_error
)
2324 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2330 if (fn
&& template_id
&& fn
!= error_mark_node
)
2331 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2336 /* Generate an expression for `FN (ARGS)'. This may change the
2339 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2340 as a virtual call, even if FN is virtual. (This flag is set when
2341 encountering an expression where the function name is explicitly
2342 qualified. For example a call to `X::f' never generates a virtual
2345 Returns code for the call. */
2348 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2349 bool koenig_p
, tsubst_flags_t complain
)
2353 vec
<tree
, va_gc
> *orig_args
= NULL
;
2355 if (fn
== error_mark_node
)
2356 return error_mark_node
;
2358 gcc_assert (!TYPE_P (fn
));
2360 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2361 it so that we can tell this is a call to a known function. */
2362 fn
= maybe_undo_parenthesized_ref (fn
);
2366 if (processing_template_decl
)
2368 /* If FN is a local extern declaration or set thereof, look them up
2369 again at instantiation time. */
2370 if (is_overloaded_fn (fn
))
2372 tree ifn
= get_first_fn (fn
);
2373 if (TREE_CODE (ifn
) == FUNCTION_DECL
2374 && DECL_LOCAL_FUNCTION_P (ifn
))
2375 orig_fn
= DECL_NAME (ifn
);
2378 /* If the call expression is dependent, build a CALL_EXPR node
2379 with no type; type_dependent_expression_p recognizes
2380 expressions with no type as being dependent. */
2381 if (type_dependent_expression_p (fn
)
2382 || any_type_dependent_arguments_p (*args
))
2384 result
= build_min_nt_call_vec (orig_fn
, *args
);
2385 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2386 KOENIG_LOOKUP_P (result
) = koenig_p
;
2387 if (is_overloaded_fn (fn
))
2390 lookup_keep (fn
, true);
2395 bool abnormal
= true;
2396 for (lkp_iterator
iter (fn
); abnormal
&& iter
; ++iter
)
2398 tree fndecl
= *iter
;
2399 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2400 || !TREE_THIS_VOLATILE (fndecl
))
2403 /* FIXME: Stop warning about falling off end of non-void
2404 function. But this is wrong. Even if we only see
2405 no-return fns at this point, we could select a
2406 future-defined return fn during instantiation. Or
2409 current_function_returns_abnormally
= 1;
2413 orig_args
= make_tree_vector_copy (*args
);
2414 if (!BASELINK_P (fn
)
2415 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2416 && TREE_TYPE (fn
) != unknown_type_node
)
2417 fn
= build_non_dependent_expr (fn
);
2418 make_args_non_dependent (*args
);
2421 if (TREE_CODE (fn
) == COMPONENT_REF
)
2423 tree member
= TREE_OPERAND (fn
, 1);
2424 if (BASELINK_P (member
))
2426 tree object
= TREE_OPERAND (fn
, 0);
2427 return build_new_method_call (object
, member
,
2430 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2437 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2438 if (TREE_CODE (fn
) == ADDR_EXPR
2439 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2440 fn
= TREE_OPERAND (fn
, 0);
2442 if (is_overloaded_fn (fn
))
2443 fn
= baselink_for_fns (fn
);
2446 if (BASELINK_P (fn
))
2450 /* A call to a member function. From [over.call.func]:
2452 If the keyword this is in scope and refers to the class of
2453 that member function, or a derived class thereof, then the
2454 function call is transformed into a qualified function call
2455 using (*this) as the postfix-expression to the left of the
2456 . operator.... [Otherwise] a contrived object of type T
2457 becomes the implied object argument.
2461 struct A { void f(); };
2462 struct B : public A {};
2463 struct C : public A { void g() { B::f(); }};
2465 "the class of that member function" refers to `A'. But 11.2
2466 [class.access.base] says that we need to convert 'this' to B* as
2467 part of the access, so we pass 'B' to maybe_dummy_object. */
2469 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2471 /* A constructor call always uses a dummy object. (This constructor
2472 call which has the form A::A () is actually invalid and we are
2473 going to reject it later in build_new_method_call.) */
2474 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2477 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2480 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2482 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2487 else if (is_overloaded_fn (fn
))
2489 /* If the function is an overloaded builtin, resolve it. */
2490 if (TREE_CODE (fn
) == FUNCTION_DECL
2491 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2492 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2493 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2497 if (warn_sizeof_pointer_memaccess
2498 && (complain
& tf_warning
)
2499 && !vec_safe_is_empty (*args
)
2500 && !processing_template_decl
)
2502 location_t sizeof_arg_loc
[3];
2505 for (i
= 0; i
< 3; i
++)
2509 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2510 sizeof_arg
[i
] = NULL_TREE
;
2511 if (i
>= (*args
)->length ())
2514 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2516 if (SIZEOF_EXPR_TYPE_P (t
))
2517 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2519 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2520 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2522 sizeof_pointer_memaccess_warning
2523 (sizeof_arg_loc
, fn
, *args
,
2524 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2527 /* A call to a namespace-scope function. */
2528 result
= build_new_function_call (fn
, args
, complain
);
2531 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2533 if (!vec_safe_is_empty (*args
))
2534 error ("arguments to destructor are not allowed");
2535 /* Mark the pseudo-destructor call as having side-effects so
2536 that we do not issue warnings about its use. */
2537 result
= build1 (NOP_EXPR
,
2539 TREE_OPERAND (fn
, 0));
2540 TREE_SIDE_EFFECTS (result
) = 1;
2542 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2543 /* If the "function" is really an object of class type, it might
2544 have an overloaded `operator ()'. */
2545 result
= build_op_call (fn
, args
, complain
);
2548 /* A call where the function is unknown. */
2549 result
= cp_build_function_call_vec (fn
, args
, complain
);
2551 if (processing_template_decl
&& result
!= error_mark_node
)
2553 if (INDIRECT_REF_P (result
))
2554 result
= TREE_OPERAND (result
, 0);
2555 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2556 SET_EXPR_LOCATION (result
, input_location
);
2557 KOENIG_LOOKUP_P (result
) = koenig_p
;
2558 release_tree_vector (orig_args
);
2559 result
= convert_from_reference (result
);
2562 /* Free or retain OVERLOADs from lookup. */
2563 if (is_overloaded_fn (orig_fn
))
2564 lookup_keep (get_fns (orig_fn
), processing_template_decl
);
2569 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2570 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2571 POSTDECREMENT_EXPR.) */
2574 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2576 /* input_location holds the location of the trailing operator token.
2577 Build a location of the form:
2580 with the caret at the operator token, ranging from the start
2581 of EXPR to the end of the operator token. */
2582 location_t combined_loc
= make_location (input_location
,
2584 get_finish (input_location
));
2585 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2586 tf_warning_or_error
);
2587 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2588 result
.set_location (combined_loc
);
2592 /* Finish a use of `this'. Returns an expression for `this'. */
2595 finish_this_expr (void)
2597 tree result
= NULL_TREE
;
2599 if (current_class_ptr
)
2601 tree type
= TREE_TYPE (current_class_ref
);
2603 /* In a lambda expression, 'this' refers to the captured 'this'. */
2604 if (LAMBDA_TYPE_P (type
))
2605 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2607 result
= current_class_ptr
;
2611 /* The keyword 'this' is a prvalue expression. */
2612 return rvalue (result
);
2614 tree fn
= current_nonlambda_function ();
2615 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2616 error ("%<this%> is unavailable for static member functions");
2618 error ("invalid use of %<this%> in non-member function");
2620 error ("invalid use of %<this%> at top level");
2621 return error_mark_node
;
2624 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2625 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2626 the TYPE for the type given. If SCOPE is non-NULL, the expression
2627 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2630 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2633 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2634 return error_mark_node
;
2636 gcc_assert (TYPE_P (destructor
));
2638 if (!processing_template_decl
)
2640 if (scope
== error_mark_node
)
2642 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2643 return error_mark_node
;
2645 if (is_auto (destructor
))
2646 destructor
= TREE_TYPE (object
);
2647 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2650 "qualified type %qT does not match destructor name ~%qT",
2652 return error_mark_node
;
2656 /* [expr.pseudo] says both:
2658 The type designated by the pseudo-destructor-name shall be
2659 the same as the object type.
2663 The cv-unqualified versions of the object type and of the
2664 type designated by the pseudo-destructor-name shall be the
2667 We implement the more generous second sentence, since that is
2668 what most other compilers do. */
2669 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2672 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2673 return error_mark_node
;
2677 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2681 /* Finish an expression of the form CODE EXPR. */
2684 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2685 tsubst_flags_t complain
)
2687 /* Build a location of the form:
2690 with the caret at the operator token, ranging from the start
2691 of the operator token to the end of EXPR. */
2692 location_t combined_loc
= make_location (op_loc
,
2693 op_loc
, expr
.get_finish ());
2694 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2695 /* TODO: build_x_unary_op doesn't always honor the location. */
2696 result
.set_location (combined_loc
);
2698 tree result_ovl
, expr_ovl
;
2700 if (!(complain
& tf_warning
))
2703 result_ovl
= result
;
2706 if (!processing_template_decl
)
2707 expr_ovl
= cp_fully_fold (expr_ovl
);
2709 if (!CONSTANT_CLASS_P (expr_ovl
)
2710 || TREE_OVERFLOW_P (expr_ovl
))
2713 if (!processing_template_decl
)
2714 result_ovl
= cp_fully_fold (result_ovl
);
2716 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2717 overflow_warning (combined_loc
, result_ovl
);
2722 /* Finish a compound-literal expression or C++11 functional cast with aggregate
2723 initializer. TYPE is the type to which the CONSTRUCTOR in COMPOUND_LITERAL
2727 finish_compound_literal (tree type
, tree compound_literal
,
2728 tsubst_flags_t complain
,
2731 if (type
== error_mark_node
)
2732 return error_mark_node
;
2734 if (TYPE_REF_P (type
))
2737 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2738 complain
, fcl_context
);
2739 /* The prvalue is then used to direct-initialize the reference. */
2740 tree r
= (perform_implicit_conversion_flags
2741 (type
, compound_literal
, complain
, LOOKUP_NORMAL
));
2742 return convert_from_reference (r
);
2745 if (!TYPE_OBJ_P (type
))
2747 if (complain
& tf_error
)
2748 error ("compound literal of non-object type %qT", type
);
2749 return error_mark_node
;
2752 if (tree anode
= type_uses_auto (type
))
2753 if (CLASS_PLACEHOLDER_TEMPLATE (anode
))
2755 type
= do_auto_deduction (type
, compound_literal
, anode
, complain
,
2757 if (type
== error_mark_node
)
2758 return error_mark_node
;
2761 if (processing_template_decl
)
2763 TREE_TYPE (compound_literal
) = type
;
2764 /* Mark the expression as a compound literal. */
2765 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2766 if (fcl_context
== fcl_c99
)
2767 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2768 return compound_literal
;
2771 type
= complete_type (type
);
2773 if (TYPE_NON_AGGREGATE_CLASS (type
))
2775 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2776 everywhere that deals with function arguments would be a pain, so
2777 just wrap it in a TREE_LIST. The parser set a flag so we know
2778 that it came from T{} rather than T({}). */
2779 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2780 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2781 return build_functional_cast (type
, compound_literal
, complain
);
2784 if (TREE_CODE (type
) == ARRAY_TYPE
2785 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2786 return error_mark_node
;
2787 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2788 if (SCALAR_TYPE_P (type
)
2789 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2790 && !check_narrowing (type
, compound_literal
, complain
))
2791 return error_mark_node
;
2792 if (TREE_CODE (type
) == ARRAY_TYPE
2793 && TYPE_DOMAIN (type
) == NULL_TREE
)
2795 cp_complete_array_type_or_error (&type
, compound_literal
,
2797 if (type
== error_mark_node
)
2798 return error_mark_node
;
2800 compound_literal
= digest_init_flags (type
, compound_literal
, LOOKUP_NORMAL
,
2802 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2804 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2805 if (fcl_context
== fcl_c99
)
2806 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2809 /* Put static/constant array temporaries in static variables. */
2810 /* FIXME all C99 compound literals should be variables rather than C++
2811 temporaries, unless they are used as an aggregate initializer. */
2812 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2813 && fcl_context
== fcl_c99
2814 && TREE_CODE (type
) == ARRAY_TYPE
2815 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2816 && initializer_constant_valid_p (compound_literal
, type
))
2818 tree decl
= create_temporary_var (type
);
2819 DECL_INITIAL (decl
) = compound_literal
;
2820 TREE_STATIC (decl
) = 1;
2821 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2823 /* 5.19 says that a constant expression can include an
2824 lvalue-rvalue conversion applied to "a glvalue of literal type
2825 that refers to a non-volatile temporary object initialized
2826 with a constant expression". Rather than try to communicate
2827 that this VAR_DECL is a temporary, just mark it constexpr. */
2828 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2829 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2830 TREE_CONSTANT (decl
) = true;
2832 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2833 decl
= pushdecl_top_level (decl
);
2834 DECL_NAME (decl
) = make_anon_name ();
2835 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2836 /* Make sure the destructor is callable. */
2837 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2838 if (clean
== error_mark_node
)
2839 return error_mark_node
;
2843 /* Represent other compound literals with TARGET_EXPR so we produce
2844 an lvalue, but can elide copies. */
2845 if (!VECTOR_TYPE_P (type
))
2846 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2848 return compound_literal
;
2851 /* Return the declaration for the function-name variable indicated by
2855 finish_fname (tree id
)
2859 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2860 if (processing_template_decl
&& current_function_decl
2861 && decl
!= error_mark_node
)
2862 decl
= DECL_NAME (decl
);
2866 /* Finish a translation unit. */
2869 finish_translation_unit (void)
2871 /* In case there were missing closebraces,
2872 get us back to the global binding level. */
2874 while (current_namespace
!= global_namespace
)
2877 /* Do file scope __FUNCTION__ et al. */
2878 finish_fname_decls ();
2881 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2882 Returns the parameter. */
2885 finish_template_type_parm (tree aggr
, tree identifier
)
2887 if (aggr
!= class_type_node
)
2889 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2890 aggr
= class_type_node
;
2893 return build_tree_list (aggr
, identifier
);
2896 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2897 Returns the parameter. */
2900 finish_template_template_parm (tree aggr
, tree identifier
)
2902 tree decl
= build_decl (input_location
,
2903 TYPE_DECL
, identifier
, NULL_TREE
);
2905 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2906 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2907 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2908 DECL_ARTIFICIAL (decl
) = 1;
2910 // Associate the constraints with the underlying declaration,
2911 // not the template.
2912 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2913 tree constr
= build_constraints (reqs
, NULL_TREE
);
2914 set_constraints (decl
, constr
);
2916 end_template_decl ();
2918 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2920 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2921 /*is_primary=*/true, /*is_partial=*/false,
2924 return finish_template_type_parm (aggr
, tmpl
);
2927 /* ARGUMENT is the default-argument value for a template template
2928 parameter. If ARGUMENT is invalid, issue error messages and return
2929 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2932 check_template_template_default_arg (tree argument
)
2934 if (TREE_CODE (argument
) != TEMPLATE_DECL
2935 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2936 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2938 if (TREE_CODE (argument
) == TYPE_DECL
)
2939 error ("invalid use of type %qT as a default value for a template "
2940 "template-parameter", TREE_TYPE (argument
));
2942 error ("invalid default argument for a template template parameter");
2943 return error_mark_node
;
2949 /* Begin a class definition, as indicated by T. */
2952 begin_class_definition (tree t
)
2954 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2955 return error_mark_node
;
2957 if (processing_template_parmlist
)
2959 error ("definition of %q#T inside template parameter list", t
);
2960 return error_mark_node
;
2963 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2964 are passed the same as decimal scalar types. */
2965 if (TREE_CODE (t
) == RECORD_TYPE
2966 && !processing_template_decl
)
2968 tree ns
= TYPE_CONTEXT (t
);
2969 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2970 && DECL_CONTEXT (ns
) == std_node
2972 && id_equal (DECL_NAME (ns
), "decimal"))
2974 const char *n
= TYPE_NAME_STRING (t
);
2975 if ((strcmp (n
, "decimal32") == 0)
2976 || (strcmp (n
, "decimal64") == 0)
2977 || (strcmp (n
, "decimal128") == 0))
2978 TYPE_TRANSPARENT_AGGR (t
) = 1;
2982 /* A non-implicit typename comes from code like:
2984 template <typename T> struct A {
2985 template <typename U> struct A<T>::B ...
2987 This is erroneous. */
2988 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2990 error ("invalid definition of qualified type %qT", t
);
2991 t
= error_mark_node
;
2994 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2996 t
= make_class_type (RECORD_TYPE
);
2997 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
3000 if (TYPE_BEING_DEFINED (t
))
3002 t
= make_class_type (TREE_CODE (t
));
3003 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
3005 maybe_process_partial_specialization (t
);
3007 TYPE_BEING_DEFINED (t
) = 1;
3008 class_binding_level
->defining_class_p
= 1;
3010 if (flag_pack_struct
)
3013 TYPE_PACKED (t
) = 1;
3014 /* Even though the type is being defined for the first time
3015 here, there might have been a forward declaration, so there
3016 might be cv-qualified variants of T. */
3017 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
3018 TYPE_PACKED (v
) = 1;
3020 /* Reset the interface data, at the earliest possible
3021 moment, as it might have been set via a class foo;
3023 if (! TYPE_UNNAMED_P (t
))
3025 struct c_fileinfo
*finfo
= \
3026 get_fileinfo (LOCATION_FILE (input_location
));
3027 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
3028 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
3029 (t
, finfo
->interface_unknown
);
3031 reset_specialization();
3033 /* Make a declaration for this class in its own scope. */
3034 build_self_reference ();
3039 /* Finish the member declaration given by DECL. */
3042 finish_member_declaration (tree decl
)
3044 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
3047 if (decl
== void_type_node
)
3048 /* The COMPONENT was a friend, not a member, and so there's
3049 nothing for us to do. */
3052 /* We should see only one DECL at a time. */
3053 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
3055 /* Don't add decls after definition. */
3056 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3057 /* We can add lambda types when late parsing default
3059 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3061 /* Set up access control for DECL. */
3063 = (current_access_specifier
== access_private_node
);
3064 TREE_PROTECTED (decl
)
3065 = (current_access_specifier
== access_protected_node
);
3066 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3068 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
3069 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
3072 /* Mark the DECL as a member of the current class, unless it's
3073 a member of an enumeration. */
3074 if (TREE_CODE (decl
) != CONST_DECL
)
3075 DECL_CONTEXT (decl
) = current_class_type
;
3077 if (TREE_CODE (decl
) == USING_DECL
)
3078 /* For now, ignore class-scope USING_DECLS, so that debugging
3079 backends do not see them. */
3080 DECL_IGNORED_P (decl
) = 1;
3082 /* Check for bare parameter packs in the non-static data member
3084 if (TREE_CODE (decl
) == FIELD_DECL
)
3086 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3087 TREE_TYPE (decl
) = error_mark_node
;
3088 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
3089 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
3094 A C language linkage is ignored for the names of class members
3095 and the member function type of class member functions. */
3096 if (DECL_LANG_SPECIFIC (decl
))
3097 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3101 /* Functions and non-functions are added differently. */
3102 if (DECL_DECLARES_FUNCTION_P (decl
))
3103 add
= add_method (current_class_type
, decl
, false);
3104 /* Enter the DECL into the scope of the class, if the class
3105 isn't a closure (whose fields are supposed to be unnamed). */
3106 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3107 || pushdecl_class_level (decl
))
3112 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3113 go at the beginning. The reason is that
3114 legacy_nonfn_member_lookup searches the list in order, and we
3115 want a field name to override a type name so that the "struct
3116 stat hack" will work. In particular:
3118 struct S { enum E { }; static const int E = 5; int ary[S::E]; } s;
3122 if (TREE_CODE (decl
) == TYPE_DECL
)
3123 TYPE_FIELDS (current_class_type
)
3124 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3127 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3128 TYPE_FIELDS (current_class_type
) = decl
;
3131 maybe_add_class_template_decl_list (current_class_type
, decl
,
3136 /* Finish processing a complete template declaration. The PARMS are
3137 the template parameters. */
3140 finish_template_decl (tree parms
)
3143 end_template_decl ();
3145 end_specialization ();
3148 // Returns the template type of the class scope being entered. If we're
3149 // entering a constrained class scope. TYPE is the class template
3150 // scope being entered and we may need to match the intended type with
3151 // a constrained specialization. For example:
3153 // template<Object T>
3154 // struct S { void f(); }; #1
3156 // template<Object T>
3157 // void S<T>::f() { } #2
3159 // We check, in #2, that S<T> refers precisely to the type declared by
3160 // #1 (i.e., that the constraints match). Note that the following should
3161 // be an error since there is no specialization of S<T> that is
3162 // unconstrained, but this is not diagnosed here.
3164 // template<typename T>
3165 // void S<T>::f() { }
3167 // We cannot diagnose this problem here since this function also matches
3168 // qualified template names that are not part of a definition. For example:
3170 // template<Integral T, Floating_point U>
3171 // typename pair<T, U>::first_type void f(T, U);
3173 // Here, it is unlikely that there is a partial specialization of
3174 // pair constrained for for Integral and Floating_point arguments.
3176 // The general rule is: if a constrained specialization with matching
3177 // constraints is found return that type. Also note that if TYPE is not a
3178 // class-type (e.g. a typename type), then no fixup is needed.
3181 fixup_template_type (tree type
)
3183 // Find the template parameter list at the a depth appropriate to
3184 // the scope we're trying to enter.
3185 tree parms
= current_template_parms
;
3186 int depth
= template_class_depth (type
);
3187 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3188 parms
= TREE_CHAIN (parms
);
3191 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3192 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3194 // Search for a specialization whose type and constraints match.
3195 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3196 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3199 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3201 // If the type and constraints match a specialization, then we
3202 // are entering that type.
3203 if (same_type_p (type
, TREE_TYPE (specs
))
3204 && equivalent_constraints (cur_constr
, spec_constr
))
3205 return TREE_TYPE (specs
);
3206 specs
= TREE_CHAIN (specs
);
3209 // If no specialization matches, then must return the type
3210 // previously found.
3214 /* Finish processing a template-id (which names a type) of the form
3215 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3216 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3217 the scope of template-id indicated. */
3220 finish_template_type (tree name
, tree args
, int entering_scope
)
3224 type
= lookup_template_class (name
, args
,
3225 NULL_TREE
, NULL_TREE
, entering_scope
,
3226 tf_warning_or_error
| tf_user
);
3228 /* If we might be entering the scope of a partial specialization,
3229 find the one with the right constraints. */
3232 && CLASS_TYPE_P (type
)
3233 && CLASSTYPE_TEMPLATE_INFO (type
)
3234 && dependent_type_p (type
)
3235 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3236 type
= fixup_template_type (type
);
3238 if (type
== error_mark_node
)
3240 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3241 return TYPE_STUB_DECL (type
);
3243 return TYPE_NAME (type
);
3246 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3247 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3248 BASE_CLASS, or NULL_TREE if an error occurred. The
3249 ACCESS_SPECIFIER is one of
3250 access_{default,public,protected_private}_node. For a virtual base
3251 we set TREE_TYPE. */
3254 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3258 if (base
== error_mark_node
)
3260 error ("invalid base-class specification");
3263 else if (! MAYBE_CLASS_TYPE_P (base
))
3265 error ("%qT is not a class type", base
);
3270 if (cp_type_quals (base
) != 0)
3272 /* DR 484: Can a base-specifier name a cv-qualified
3274 base
= TYPE_MAIN_VARIANT (base
);
3276 result
= build_tree_list (access
, base
);
3278 TREE_TYPE (result
) = integer_type_node
;
3284 /* If FNS is a member function, a set of member functions, or a
3285 template-id referring to one or more member functions, return a
3286 BASELINK for FNS, incorporating the current access context.
3287 Otherwise, return FNS unchanged. */
3290 baselink_for_fns (tree fns
)
3295 if (BASELINK_P (fns
)
3296 || error_operand_p (fns
))
3299 scope
= ovl_scope (fns
);
3300 if (!CLASS_TYPE_P (scope
))
3303 cl
= currently_open_derived_class (scope
);
3306 cl
= TYPE_BINFO (cl
);
3307 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3310 /* Returns true iff DECL is a variable from a function outside
3314 outer_var_p (tree decl
)
3316 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3317 && DECL_FUNCTION_SCOPE_P (decl
)
3318 /* Don't get confused by temporaries. */
3320 && (DECL_CONTEXT (decl
) != current_function_decl
3321 || parsing_nsdmi ()));
3324 /* As above, but also checks that DECL is automatic. */
3327 outer_automatic_var_p (tree decl
)
3329 return (outer_var_p (decl
)
3330 && !TREE_STATIC (decl
));
3333 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3334 rewrite it for lambda capture.
3336 If ODR_USE is true, we're being called from mark_use, and we complain about
3337 use of constant variables. If ODR_USE is false, we're being called for the
3338 id-expression, and we do lambda capture. */
3341 process_outer_var_ref (tree decl
, tsubst_flags_t complain
, bool odr_use
)
3343 if (cp_unevaluated_operand
)
3344 /* It's not a use (3.2) if we're in an unevaluated context. */
3346 if (decl
== error_mark_node
)
3349 tree context
= DECL_CONTEXT (decl
);
3350 tree containing_function
= current_function_decl
;
3351 tree lambda_stack
= NULL_TREE
;
3352 tree lambda_expr
= NULL_TREE
;
3353 tree initializer
= convert_from_reference (decl
);
3355 /* Mark it as used now even if the use is ill-formed. */
3356 if (!mark_used (decl
, complain
))
3357 return error_mark_node
;
3359 if (parsing_nsdmi ())
3360 containing_function
= NULL_TREE
;
3362 if (containing_function
&& LAMBDA_FUNCTION_P (containing_function
))
3364 /* Check whether we've already built a proxy. */
3366 while (is_normal_capture_proxy (var
))
3367 var
= DECL_CAPTURED_VARIABLE (var
);
3368 tree d
= retrieve_local_specialization (var
);
3370 if (d
&& d
!= decl
&& is_capture_proxy (d
))
3372 if (DECL_CONTEXT (d
) == containing_function
)
3373 /* We already have an inner proxy. */
3376 /* We need to capture an outer proxy. */
3377 return process_outer_var_ref (d
, complain
, odr_use
);
3381 /* If we are in a lambda function, we can move out until we hit
3383 2. a non-lambda function, or
3384 3. a non-default capturing lambda function. */
3385 while (context
!= containing_function
3386 /* containing_function can be null with invalid generic lambdas. */
3387 && containing_function
3388 && LAMBDA_FUNCTION_P (containing_function
))
3390 tree closure
= DECL_CONTEXT (containing_function
);
3391 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3393 if (TYPE_CLASS_SCOPE_P (closure
))
3394 /* A lambda in an NSDMI (c++/64496). */
3397 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3401 lambda_stack
= tree_cons (NULL_TREE
,
3406 = decl_function_context (containing_function
);
3409 /* In a lambda within a template, wait until instantiation
3410 time to implicitly capture. */
3411 if (context
== containing_function
3412 && DECL_TEMPLATE_INFO (containing_function
)
3413 && uses_template_parms (DECL_TI_ARGS (containing_function
)))
3416 if (lambda_expr
&& VAR_P (decl
)
3417 && DECL_ANON_UNION_VAR_P (decl
))
3419 if (complain
& tf_error
)
3420 error ("cannot capture member %qD of anonymous union", decl
);
3421 return error_mark_node
;
3423 /* Do lambda capture when processing the id-expression, not when
3424 odr-using a variable. */
3425 if (!odr_use
&& context
== containing_function
)
3427 decl
= add_default_capture (lambda_stack
,
3428 /*id=*/DECL_NAME (decl
),
3431 /* Only an odr-use of an outer automatic variable causes an
3432 error, and a constant variable can decay to a prvalue
3433 constant without odr-use. So don't complain yet. */
3434 else if (!odr_use
&& decl_constant_var_p (decl
))
3436 else if (lambda_expr
)
3438 if (complain
& tf_error
)
3440 error ("%qD is not captured", decl
);
3441 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3442 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3444 inform (location_of (closure
),
3445 "the lambda has no capture-default");
3446 else if (TYPE_CLASS_SCOPE_P (closure
))
3447 inform (UNKNOWN_LOCATION
, "lambda in local class %q+T cannot "
3448 "capture variables from the enclosing context",
3449 TYPE_CONTEXT (closure
));
3450 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3452 return error_mark_node
;
3456 if (complain
& tf_error
)
3459 ? G_("use of local variable with automatic storage from "
3460 "containing function")
3461 : G_("use of parameter from containing function"));
3462 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3464 return error_mark_node
;
3469 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3470 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3471 if non-NULL, is the type or namespace used to explicitly qualify
3472 ID_EXPRESSION. DECL is the entity to which that name has been
3475 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3476 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3477 be set to true if this expression isn't permitted in a
3478 constant-expression, but it is otherwise not set by this function.
3479 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3480 constant-expression, but a non-constant expression is also
3483 DONE is true if this expression is a complete postfix-expression;
3484 it is false if this expression is followed by '->', '[', '(', etc.
3485 ADDRESS_P is true iff this expression is the operand of '&'.
3486 TEMPLATE_P is true iff the qualified-id was of the form
3487 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3488 appears as a template argument.
3490 If an error occurs, and it is the kind of error that might cause
3491 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3492 is the caller's responsibility to issue the message. *ERROR_MSG
3493 will be a string with static storage duration, so the caller need
3496 Return an expression for the entity, after issuing appropriate
3497 diagnostics. This function is also responsible for transforming a
3498 reference to a non-static member into a COMPONENT_REF that makes
3499 the use of "this" explicit.
3501 Upon return, *IDK will be filled in appropriately. */
3503 finish_id_expression (tree id_expression
,
3507 bool integral_constant_expression_p
,
3508 bool allow_non_integral_constant_expression_p
,
3509 bool *non_integral_constant_expression_p
,
3513 bool template_arg_p
,
3514 const char **error_msg
,
3515 location_t location
)
3517 decl
= strip_using_decl (decl
);
3519 /* Initialize the output parameters. */
3520 *idk
= CP_ID_KIND_NONE
;
3523 if (id_expression
== error_mark_node
)
3524 return error_mark_node
;
3525 /* If we have a template-id, then no further lookup is
3526 required. If the template-id was for a template-class, we
3527 will sometimes have a TYPE_DECL at this point. */
3528 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3529 || TREE_CODE (decl
) == TYPE_DECL
)
3531 /* Look up the name. */
3534 if (decl
== error_mark_node
)
3536 /* Name lookup failed. */
3539 || (!dependent_type_p (scope
)
3540 && !(identifier_p (id_expression
)
3541 && IDENTIFIER_CONV_OP_P (id_expression
)
3542 && dependent_type_p (TREE_TYPE (id_expression
))))))
3544 /* If the qualifying type is non-dependent (and the name
3545 does not name a conversion operator to a dependent
3546 type), issue an error. */
3547 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3548 return error_mark_node
;
3552 /* It may be resolved via Koenig lookup. */
3553 *idk
= CP_ID_KIND_UNQUALIFIED
;
3554 return id_expression
;
3557 decl
= id_expression
;
3560 /* Remember that the name was used in the definition of
3561 the current class so that we can check later to see if
3562 the meaning would have been different after the class
3563 was entirely defined. */
3564 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3565 maybe_note_name_used_in_class (id_expression
, decl
);
3567 /* A use in unevaluated operand might not be instantiated appropriately
3568 if tsubst_copy builds a dummy parm, or if we never instantiate a
3569 generic lambda, so mark it now. */
3570 if (processing_template_decl
&& cp_unevaluated_operand
)
3571 mark_type_use (decl
);
3573 /* Disallow uses of local variables from containing functions, except
3574 within lambda-expressions. */
3575 if (outer_automatic_var_p (decl
))
3577 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3578 if (decl
== error_mark_node
)
3579 return error_mark_node
;
3582 /* Also disallow uses of function parameters outside the function
3583 body, except inside an unevaluated context (i.e. decltype). */
3584 if (TREE_CODE (decl
) == PARM_DECL
3585 && DECL_CONTEXT (decl
) == NULL_TREE
3586 && !cp_unevaluated_operand
)
3588 *error_msg
= G_("use of parameter outside function body");
3589 return error_mark_node
;
3593 /* If we didn't find anything, or what we found was a type,
3594 then this wasn't really an id-expression. */
3595 if (TREE_CODE (decl
) == TEMPLATE_DECL
3596 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3598 *error_msg
= G_("missing template arguments");
3599 return error_mark_node
;
3601 else if (TREE_CODE (decl
) == TYPE_DECL
3602 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3604 *error_msg
= G_("expected primary-expression");
3605 return error_mark_node
;
3608 /* If the name resolved to a template parameter, there is no
3609 need to look it up again later. */
3610 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3611 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3615 *idk
= CP_ID_KIND_NONE
;
3616 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3617 decl
= TEMPLATE_PARM_DECL (decl
);
3618 r
= convert_from_reference (DECL_INITIAL (decl
));
3620 if (integral_constant_expression_p
3621 && !dependent_type_p (TREE_TYPE (decl
))
3622 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3624 if (!allow_non_integral_constant_expression_p
)
3625 error ("template parameter %qD of type %qT is not allowed in "
3626 "an integral constant expression because it is not of "
3627 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3628 *non_integral_constant_expression_p
= true;
3634 bool dependent_p
= type_dependent_expression_p (decl
);
3636 /* If the declaration was explicitly qualified indicate
3637 that. The semantics of `A::f(3)' are different than
3638 `f(3)' if `f' is virtual. */
3640 ? CP_ID_KIND_QUALIFIED
3641 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3642 ? CP_ID_KIND_TEMPLATE_ID
3644 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3645 : CP_ID_KIND_UNQUALIFIED
)));
3649 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3650 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3651 wrong, so just return the identifier. */
3652 return id_expression
;
3654 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3656 error ("use of namespace %qD as expression", decl
);
3657 return error_mark_node
;
3659 else if (DECL_CLASS_TEMPLATE_P (decl
))
3661 error ("use of class template %qT as expression", decl
);
3662 return error_mark_node
;
3664 else if (TREE_CODE (decl
) == TREE_LIST
)
3666 /* Ambiguous reference to base members. */
3667 error ("request for member %qD is ambiguous in "
3668 "multiple inheritance lattice", id_expression
);
3669 print_candidates (decl
);
3670 return error_mark_node
;
3673 /* Mark variable-like entities as used. Functions are similarly
3674 marked either below or after overload resolution. */
3676 || TREE_CODE (decl
) == PARM_DECL
3677 || TREE_CODE (decl
) == CONST_DECL
3678 || TREE_CODE (decl
) == RESULT_DECL
)
3679 && !mark_used (decl
))
3680 return error_mark_node
;
3682 /* Only certain kinds of names are allowed in constant
3683 expression. Template parameters have already
3684 been handled above. */
3685 if (! error_operand_p (decl
)
3687 && integral_constant_expression_p
3688 && ! decl_constant_var_p (decl
)
3689 && TREE_CODE (decl
) != CONST_DECL
3690 && ! builtin_valid_in_constant_expr_p (decl
))
3692 if (!allow_non_integral_constant_expression_p
)
3694 error ("%qD cannot appear in a constant-expression", decl
);
3695 return error_mark_node
;
3697 *non_integral_constant_expression_p
= true;
3702 && !cp_unevaluated_operand
3703 && !processing_template_decl
3704 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3705 && CP_DECL_THREAD_LOCAL_P (decl
)
3706 && (wrap
= get_tls_wrapper_fn (decl
)))
3708 /* Replace an evaluated use of the thread_local variable with
3709 a call to its wrapper. */
3710 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3712 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3714 && variable_template_p (TREE_OPERAND (decl
, 0)))
3716 decl
= finish_template_variable (decl
);
3718 decl
= convert_from_reference (decl
);
3722 if (TREE_CODE (decl
) == SCOPE_REF
)
3724 gcc_assert (same_type_p (scope
, TREE_OPERAND (decl
, 0)));
3725 decl
= TREE_OPERAND (decl
, 1);
3728 decl
= (adjust_result_of_qualified_name_lookup
3729 (decl
, scope
, current_nonlambda_class_type()));
3731 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3735 decl
= finish_qualified_id_expr (scope
,
3741 tf_warning_or_error
);
3743 decl
= convert_from_reference (decl
);
3745 else if (TREE_CODE (decl
) == FIELD_DECL
)
3747 /* Since SCOPE is NULL here, this is an unqualified name.
3748 Access checking has been performed during name lookup
3749 already. Turn off checking to avoid duplicate errors. */
3750 push_deferring_access_checks (dk_no_check
);
3751 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3752 /*qualifying_scope=*/NULL_TREE
);
3753 pop_deferring_access_checks ();
3755 else if (is_overloaded_fn (decl
))
3757 tree first_fn
= get_first_fn (decl
);
3759 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3760 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3762 /* [basic.def.odr]: "A function whose name appears as a
3763 potentially-evaluated expression is odr-used if it is the unique
3766 But only mark it if it's a complete postfix-expression; in a call,
3767 ADL might select a different function, and we'll call mark_used in
3770 && !really_overloaded_fn (decl
)
3771 && !mark_used (first_fn
))
3772 return error_mark_node
;
3775 && TREE_CODE (first_fn
) == FUNCTION_DECL
3776 && DECL_FUNCTION_MEMBER_P (first_fn
)
3777 && !shared_member_p (decl
))
3779 /* A set of member functions. */
3780 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3781 return finish_class_member_access_expr (decl
, id_expression
,
3782 /*template_p=*/false,
3783 tf_warning_or_error
);
3786 decl
= baselink_for_fns (decl
);
3790 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3791 && DECL_CLASS_SCOPE_P (decl
))
3793 tree context
= context_for_name_lookup (decl
);
3794 if (context
!= current_class_type
)
3796 tree path
= currently_open_derived_class (context
);
3797 perform_or_defer_access_check (TYPE_BINFO (path
),
3799 tf_warning_or_error
);
3803 decl
= convert_from_reference (decl
);
3807 return cp_expr (decl
, location
);
3810 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3811 use as a type-specifier. */
3814 finish_typeof (tree expr
)
3818 if (type_dependent_expression_p (expr
))
3820 type
= cxx_make_type (TYPEOF_TYPE
);
3821 TYPEOF_TYPE_EXPR (type
) = expr
;
3822 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3827 expr
= mark_type_use (expr
);
3829 type
= unlowered_expr_type (expr
);
3831 if (!type
|| type
== unknown_type_node
)
3833 error ("type of %qE is unknown", expr
);
3834 return error_mark_node
;
3840 /* Implement the __underlying_type keyword: Return the underlying
3841 type of TYPE, suitable for use as a type-specifier. */
3844 finish_underlying_type (tree type
)
3846 tree underlying_type
;
3848 if (processing_template_decl
)
3850 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3851 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3852 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3854 return underlying_type
;
3857 if (!complete_type_or_else (type
, NULL_TREE
))
3858 return error_mark_node
;
3860 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3862 error ("%qT is not an enumeration type", type
);
3863 return error_mark_node
;
3866 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3868 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3869 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3870 See finish_enum_value_list for details. */
3871 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3873 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3874 TYPE_UNSIGNED (underlying_type
));
3876 return underlying_type
;
3879 /* Implement the __direct_bases keyword: Return the direct base classes
3883 calculate_direct_bases (tree type
, tsubst_flags_t complain
)
3885 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3886 || !NON_UNION_CLASS_TYPE_P (type
))
3887 return make_tree_vec (0);
3889 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3890 vec
<tree
, va_gc
> *base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3894 /* Virtual bases are initialized first */
3895 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3896 if (BINFO_VIRTUAL_P (binfo
))
3897 vec_safe_push (vector
, binfo
);
3899 /* Now non-virtuals */
3900 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3901 if (!BINFO_VIRTUAL_P (binfo
))
3902 vec_safe_push (vector
, binfo
);
3904 tree bases_vec
= make_tree_vec (vector
->length ());
3906 for (i
= 0; i
< vector
->length (); ++i
)
3907 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3909 release_tree_vector (vector
);
3913 /* Implement the __bases keyword: Return the base classes
3916 /* Find morally non-virtual base classes by walking binfo hierarchy */
3917 /* Virtual base classes are handled separately in finish_bases */
3920 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3922 /* Don't walk bases of virtual bases */
3923 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3927 dfs_calculate_bases_post (tree binfo
, void *data_
)
3929 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3930 if (!BINFO_VIRTUAL_P (binfo
))
3931 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3935 /* Calculates the morally non-virtual base classes of a class */
3936 static vec
<tree
, va_gc
> *
3937 calculate_bases_helper (tree type
)
3939 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3941 /* Now add non-virtual base classes in order of construction */
3942 if (TYPE_BINFO (type
))
3943 dfs_walk_all (TYPE_BINFO (type
),
3944 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3949 calculate_bases (tree type
, tsubst_flags_t complain
)
3951 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3952 || !NON_UNION_CLASS_TYPE_P (type
))
3953 return make_tree_vec (0);
3955 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3956 tree bases_vec
= NULL_TREE
;
3958 vec
<tree
, va_gc
> *vbases
;
3959 vec
<tree
, va_gc
> *nonvbases
;
3962 /* First go through virtual base classes */
3963 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3964 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3966 vec
<tree
, va_gc
> *vbase_bases
3967 = calculate_bases_helper (BINFO_TYPE (binfo
));
3968 vec_safe_splice (vector
, vbase_bases
);
3969 release_tree_vector (vbase_bases
);
3972 /* Now for the non-virtual bases */
3973 nonvbases
= calculate_bases_helper (type
);
3974 vec_safe_splice (vector
, nonvbases
);
3975 release_tree_vector (nonvbases
);
3977 /* Note that during error recovery vector->length can even be zero. */
3978 if (vector
->length () > 1)
3980 /* Last element is entire class, so don't copy */
3981 bases_vec
= make_tree_vec (vector
->length () - 1);
3983 for (i
= 0; i
< vector
->length () - 1; ++i
)
3984 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3987 bases_vec
= make_tree_vec (0);
3989 release_tree_vector (vector
);
3994 finish_bases (tree type
, bool direct
)
3996 tree bases
= NULL_TREE
;
3998 if (!processing_template_decl
)
4000 /* Parameter packs can only be used in templates */
4001 error ("Parameter pack __bases only valid in template declaration");
4002 return error_mark_node
;
4005 bases
= cxx_make_type (BASES
);
4006 BASES_TYPE (bases
) = type
;
4007 BASES_DIRECT (bases
) = direct
;
4008 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
4013 /* Perform C++-specific checks for __builtin_offsetof before calling
4017 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
4019 /* If we're processing a template, we can't finish the semantics yet.
4020 Otherwise we can fold the entire expression now. */
4021 if (processing_template_decl
)
4023 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4024 SET_EXPR_LOCATION (expr
, loc
);
4028 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4030 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4031 TREE_OPERAND (expr
, 2));
4032 return error_mark_node
;
4034 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
4035 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
4036 || TREE_TYPE (expr
) == unknown_type_node
)
4038 while (TREE_CODE (expr
) == COMPONENT_REF
4039 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4040 expr
= TREE_OPERAND (expr
, 1);
4044 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4045 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
4048 error ("cannot apply %<offsetof%> to member function");
4049 return error_mark_node
;
4051 if (TREE_CODE (expr
) == CONST_DECL
)
4053 error ("cannot apply %<offsetof%> to an enumerator %qD", expr
);
4054 return error_mark_node
;
4056 if (REFERENCE_REF_P (expr
))
4057 expr
= TREE_OPERAND (expr
, 0);
4058 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4059 return error_mark_node
;
4060 if (warn_invalid_offsetof
4061 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4062 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4063 && cp_unevaluated_operand
== 0)
4064 warning_at (loc
, OPT_Winvalid_offsetof
, "offsetof within "
4065 "non-standard-layout type %qT is conditionally-supported",
4066 TREE_TYPE (TREE_TYPE (object_ptr
)));
4067 return fold_offsetof (expr
);
4070 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4071 function is broken out from the above for the benefit of the tree-ssa
4075 simplify_aggr_init_expr (tree
*tp
)
4077 tree aggr_init_expr
= *tp
;
4079 /* Form an appropriate CALL_EXPR. */
4080 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4081 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4082 tree type
= TREE_TYPE (slot
);
4085 enum style_t
{ ctor
, arg
, pcc
} style
;
4087 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4089 #ifdef PCC_STATIC_STRUCT_RETURN
4095 gcc_assert (TREE_ADDRESSABLE (type
));
4099 call_expr
= build_call_array_loc (input_location
,
4100 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4102 aggr_init_expr_nargs (aggr_init_expr
),
4103 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4104 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4105 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4106 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4107 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4108 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4109 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4113 /* Replace the first argument to the ctor with the address of the
4115 cxx_mark_addressable (slot
);
4116 CALL_EXPR_ARG (call_expr
, 0) =
4117 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4119 else if (style
== arg
)
4121 /* Just mark it addressable here, and leave the rest to
4122 expand_call{,_inline}. */
4123 cxx_mark_addressable (slot
);
4124 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4125 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4127 else if (style
== pcc
)
4129 /* If we're using the non-reentrant PCC calling convention, then we
4130 need to copy the returned value out of the static buffer into the
4132 push_deferring_access_checks (dk_no_check
);
4133 call_expr
= build_aggr_init (slot
, call_expr
,
4134 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4135 tf_warning_or_error
);
4136 pop_deferring_access_checks ();
4137 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4140 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4142 tree init
= build_zero_init (type
, NULL_TREE
,
4143 /*static_storage_p=*/false);
4144 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4145 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4152 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4155 emit_associated_thunks (tree fn
)
4157 /* When we use vcall offsets, we emit thunks with the virtual
4158 functions to which they thunk. The whole point of vcall offsets
4159 is so that you can know statically the entire set of thunks that
4160 will ever be needed for a given virtual function, thereby
4161 enabling you to output all the thunks with the function itself. */
4162 if (DECL_VIRTUAL_P (fn
)
4163 /* Do not emit thunks for extern template instantiations. */
4164 && ! DECL_REALLY_EXTERN (fn
))
4168 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4170 if (!THUNK_ALIAS (thunk
))
4172 use_thunk (thunk
, /*emit_p=*/1);
4173 if (DECL_RESULT_THUNK_P (thunk
))
4177 for (probe
= DECL_THUNKS (thunk
);
4178 probe
; probe
= DECL_CHAIN (probe
))
4179 use_thunk (probe
, /*emit_p=*/1);
4183 gcc_assert (!DECL_THUNKS (thunk
));
4188 /* Generate RTL for FN. */
4191 expand_or_defer_fn_1 (tree fn
)
4193 /* When the parser calls us after finishing the body of a template
4194 function, we don't really want to expand the body. */
4195 if (processing_template_decl
)
4197 /* Normally, collection only occurs in rest_of_compilation. So,
4198 if we don't collect here, we never collect junk generated
4199 during the processing of templates until we hit a
4200 non-template function. It's not safe to do this inside a
4201 nested class, though, as the parser may have local state that
4202 is not a GC root. */
4203 if (!function_depth
)
4208 gcc_assert (DECL_SAVED_TREE (fn
));
4210 /* We make a decision about linkage for these functions at the end
4211 of the compilation. Until that point, we do not want the back
4212 end to output them -- but we do want it to see the bodies of
4213 these functions so that it can inline them as appropriate. */
4214 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4216 if (DECL_INTERFACE_KNOWN (fn
))
4217 /* We've already made a decision as to how this function will
4220 tentative_decl_linkage (fn
);
4222 import_export_decl (fn
);
4224 /* If the user wants us to keep all inline functions, then mark
4225 this function as needed so that finish_file will make sure to
4226 output it later. Similarly, all dllexport'd functions must
4227 be emitted; there may be callers in other DLLs. */
4228 if (DECL_DECLARED_INLINE_P (fn
)
4229 && !DECL_REALLY_EXTERN (fn
)
4230 && (flag_keep_inline_functions
4231 || (flag_keep_inline_dllexport
4232 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4235 DECL_EXTERNAL (fn
) = 0;
4239 /* If this is a constructor or destructor body, we have to clone
4241 if (maybe_clone_body (fn
))
4243 /* We don't want to process FN again, so pretend we've written
4244 it out, even though we haven't. */
4245 TREE_ASM_WRITTEN (fn
) = 1;
4246 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4247 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4248 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4252 /* There's no reason to do any of the work here if we're only doing
4253 semantic analysis; this code just generates RTL. */
4254 if (flag_syntax_only
)
4261 expand_or_defer_fn (tree fn
)
4263 if (expand_or_defer_fn_1 (fn
))
4267 /* Expand or defer, at the whim of the compilation unit manager. */
4268 cgraph_node::finalize_function (fn
, function_depth
> 1);
4269 emit_associated_thunks (fn
);
4277 nrv_data () : visited (37) {}
4281 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4284 /* Helper function for walk_tree, used by finalize_nrv below. */
4287 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4289 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4292 /* No need to walk into types. There wouldn't be any need to walk into
4293 non-statements, except that we have to consider STMT_EXPRs. */
4296 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4297 but differs from using NULL_TREE in that it indicates that we care
4298 about the value of the RESULT_DECL. */
4299 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4300 TREE_OPERAND (*tp
, 0) = dp
->result
;
4301 /* Change all cleanups for the NRV to only run when an exception is
4303 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4304 && CLEANUP_DECL (*tp
) == dp
->var
)
4305 CLEANUP_EH_ONLY (*tp
) = 1;
4306 /* Replace the DECL_EXPR for the NRV with an initialization of the
4307 RESULT_DECL, if needed. */
4308 else if (TREE_CODE (*tp
) == DECL_EXPR
4309 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4312 if (DECL_INITIAL (dp
->var
)
4313 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4314 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4315 DECL_INITIAL (dp
->var
));
4317 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4318 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4319 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4322 /* And replace all uses of the NRV with the RESULT_DECL. */
4323 else if (*tp
== dp
->var
)
4326 /* Avoid walking into the same tree more than once. Unfortunately, we
4327 can't just use walk_tree_without duplicates because it would only call
4328 us for the first occurrence of dp->var in the function body. */
4329 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4335 /* Keep iterating. */
4339 /* Called from finish_function to implement the named return value
4340 optimization by overriding all the RETURN_EXPRs and pertinent
4341 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4342 RESULT_DECL for the function. */
4345 finalize_nrv (tree
*tp
, tree var
, tree result
)
4347 struct nrv_data data
;
4349 /* Copy name from VAR to RESULT. */
4350 DECL_NAME (result
) = DECL_NAME (var
);
4351 /* Don't forget that we take its address. */
4352 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4353 /* Finally set DECL_VALUE_EXPR to avoid assigning
4354 a stack slot at -O0 for the original var and debug info
4355 uses RESULT location for VAR. */
4356 SET_DECL_VALUE_EXPR (var
, result
);
4357 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4360 data
.result
= result
;
4361 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4364 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4367 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4368 bool need_copy_ctor
, bool need_copy_assignment
,
4371 int save_errorcount
= errorcount
;
4374 /* Always allocate 3 elements for simplicity. These are the
4375 function decls for the ctor, dtor, and assignment op.
4376 This layout is known to the three lang hooks,
4377 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4378 and cxx_omp_clause_assign_op. */
4379 info
= make_tree_vec (3);
4380 CP_OMP_CLAUSE_INFO (c
) = info
;
4382 if (need_default_ctor
|| need_copy_ctor
)
4384 if (need_default_ctor
)
4385 t
= get_default_ctor (type
);
4387 t
= get_copy_ctor (type
, tf_warning_or_error
);
4389 if (t
&& !trivial_fn_p (t
))
4390 TREE_VEC_ELT (info
, 0) = t
;
4393 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4394 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4396 if (need_copy_assignment
)
4398 t
= get_copy_assign (type
);
4400 if (t
&& !trivial_fn_p (t
))
4401 TREE_VEC_ELT (info
, 2) = t
;
4404 return errorcount
!= save_errorcount
;
4407 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4408 FIELD_DECL, otherwise return DECL itself. */
4411 omp_clause_decl_field (tree decl
)
4414 && DECL_HAS_VALUE_EXPR_P (decl
)
4415 && DECL_ARTIFICIAL (decl
)
4416 && DECL_LANG_SPECIFIC (decl
)
4417 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4419 tree f
= DECL_VALUE_EXPR (decl
);
4420 if (INDIRECT_REF_P (f
))
4421 f
= TREE_OPERAND (f
, 0);
4422 if (TREE_CODE (f
) == COMPONENT_REF
)
4424 f
= TREE_OPERAND (f
, 1);
4425 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4432 /* Adjust DECL if needed for printing using %qE. */
4435 omp_clause_printable_decl (tree decl
)
4437 tree t
= omp_clause_decl_field (decl
);
4443 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4444 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4448 omp_note_field_privatization (tree f
, tree t
)
4450 if (!omp_private_member_map
)
4451 omp_private_member_map
= new hash_map
<tree
, tree
>;
4452 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4456 omp_private_member_vec
.safe_push (f
);
4457 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4458 omp_private_member_vec
.safe_push (integer_zero_node
);
4462 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4466 omp_privatize_field (tree t
, bool shared
)
4468 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4469 if (m
== error_mark_node
)
4470 return error_mark_node
;
4471 if (!omp_private_member_map
&& !shared
)
4472 omp_private_member_map
= new hash_map
<tree
, tree
>;
4473 if (TYPE_REF_P (TREE_TYPE (t
)))
4475 gcc_assert (INDIRECT_REF_P (m
));
4476 m
= TREE_OPERAND (m
, 0);
4478 tree vb
= NULL_TREE
;
4479 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4482 v
= create_temporary_var (TREE_TYPE (m
));
4483 retrofit_lang_decl (v
);
4484 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4485 SET_DECL_VALUE_EXPR (v
, m
);
4486 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4488 omp_private_member_vec
.safe_push (t
);
4493 /* Helper function for handle_omp_array_sections. Called recursively
4494 to handle multiple array-section-subscripts. C is the clause,
4495 T current expression (initially OMP_CLAUSE_DECL), which is either
4496 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4497 expression if specified, TREE_VALUE length expression if specified,
4498 TREE_CHAIN is what it has been specified after, or some decl.
4499 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4500 set to true if any of the array-section-subscript could have length
4501 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4502 first array-section-subscript which is known not to have length
4504 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4505 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4506 all are or may have length of 1, array-section-subscript [:2] is the
4507 first one known not to have length 1. For array-section-subscript
4508 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4509 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4510 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4511 case though, as some lengths could be zero. */
4514 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4515 bool &maybe_zero_len
, unsigned int &first_non_one
,
4516 enum c_omp_region_type ort
)
4518 tree ret
, low_bound
, length
, type
;
4519 if (TREE_CODE (t
) != TREE_LIST
)
4521 if (error_operand_p (t
))
4522 return error_mark_node
;
4523 if (REFERENCE_REF_P (t
)
4524 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4525 t
= TREE_OPERAND (t
, 0);
4527 if (TREE_CODE (t
) == COMPONENT_REF
4529 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4530 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4531 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4532 && !type_dependent_expression_p (t
))
4534 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4535 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4537 error_at (OMP_CLAUSE_LOCATION (c
),
4538 "bit-field %qE in %qs clause",
4539 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4540 return error_mark_node
;
4542 while (TREE_CODE (t
) == COMPONENT_REF
)
4544 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4545 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4547 error_at (OMP_CLAUSE_LOCATION (c
),
4548 "%qE is a member of a union", t
);
4549 return error_mark_node
;
4551 t
= TREE_OPERAND (t
, 0);
4553 if (REFERENCE_REF_P (t
))
4554 t
= TREE_OPERAND (t
, 0);
4556 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4558 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
4561 error_at (OMP_CLAUSE_LOCATION (c
),
4562 "%qD is not a variable in %qs clause", t
,
4563 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4565 error_at (OMP_CLAUSE_LOCATION (c
),
4566 "%qE is not a variable in %qs clause", t
,
4567 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4568 return error_mark_node
;
4570 else if (TREE_CODE (t
) == PARM_DECL
4571 && DECL_ARTIFICIAL (t
)
4572 && DECL_NAME (t
) == this_identifier
)
4574 error_at (OMP_CLAUSE_LOCATION (c
),
4575 "%<this%> allowed in OpenMP only in %<declare simd%>"
4577 return error_mark_node
;
4579 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4580 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4582 error_at (OMP_CLAUSE_LOCATION (c
),
4583 "%qD is threadprivate variable in %qs clause", t
,
4584 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4585 return error_mark_node
;
4587 if (type_dependent_expression_p (ret
))
4589 ret
= convert_from_reference (ret
);
4593 if (ort
== C_ORT_OMP
4594 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4595 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4596 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4597 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4598 maybe_zero_len
, first_non_one
, ort
);
4599 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4602 type
= TREE_TYPE (ret
);
4603 low_bound
= TREE_PURPOSE (t
);
4604 length
= TREE_VALUE (t
);
4605 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4606 || (length
&& type_dependent_expression_p (length
)))
4609 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4610 return error_mark_node
;
4612 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4614 error_at (OMP_CLAUSE_LOCATION (c
),
4615 "low bound %qE of array section does not have integral type",
4617 return error_mark_node
;
4619 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4621 error_at (OMP_CLAUSE_LOCATION (c
),
4622 "length %qE of array section does not have integral type",
4624 return error_mark_node
;
4627 low_bound
= mark_rvalue_use (low_bound
);
4629 length
= mark_rvalue_use (length
);
4630 /* We need to reduce to real constant-values for checks below. */
4632 length
= fold_simple (length
);
4634 low_bound
= fold_simple (low_bound
);
4636 && TREE_CODE (low_bound
) == INTEGER_CST
4637 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4638 > TYPE_PRECISION (sizetype
))
4639 low_bound
= fold_convert (sizetype
, low_bound
);
4641 && TREE_CODE (length
) == INTEGER_CST
4642 && TYPE_PRECISION (TREE_TYPE (length
))
4643 > TYPE_PRECISION (sizetype
))
4644 length
= fold_convert (sizetype
, length
);
4645 if (low_bound
== NULL_TREE
)
4646 low_bound
= integer_zero_node
;
4648 if (length
!= NULL_TREE
)
4650 if (!integer_nonzerop (length
))
4652 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4653 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4655 if (integer_zerop (length
))
4657 error_at (OMP_CLAUSE_LOCATION (c
),
4658 "zero length array section in %qs clause",
4659 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4660 return error_mark_node
;
4664 maybe_zero_len
= true;
4666 if (first_non_one
== types
.length ()
4667 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4670 if (TREE_CODE (type
) == ARRAY_TYPE
)
4672 if (length
== NULL_TREE
4673 && (TYPE_DOMAIN (type
) == NULL_TREE
4674 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4676 error_at (OMP_CLAUSE_LOCATION (c
),
4677 "for unknown bound array type length expression must "
4679 return error_mark_node
;
4681 if (TREE_CODE (low_bound
) == INTEGER_CST
4682 && tree_int_cst_sgn (low_bound
) == -1)
4684 error_at (OMP_CLAUSE_LOCATION (c
),
4685 "negative low bound in array section in %qs clause",
4686 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4687 return error_mark_node
;
4689 if (length
!= NULL_TREE
4690 && TREE_CODE (length
) == INTEGER_CST
4691 && tree_int_cst_sgn (length
) == -1)
4693 error_at (OMP_CLAUSE_LOCATION (c
),
4694 "negative length in array section in %qs clause",
4695 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4696 return error_mark_node
;
4698 if (TYPE_DOMAIN (type
)
4699 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4700 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4704 = fold_convert (sizetype
, TYPE_MAX_VALUE (TYPE_DOMAIN (type
)));
4705 size
= size_binop (PLUS_EXPR
, size
, size_one_node
);
4706 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4708 if (tree_int_cst_lt (size
, low_bound
))
4710 error_at (OMP_CLAUSE_LOCATION (c
),
4711 "low bound %qE above array section size "
4712 "in %qs clause", low_bound
,
4713 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4714 return error_mark_node
;
4716 if (tree_int_cst_equal (size
, low_bound
))
4718 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4719 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4721 error_at (OMP_CLAUSE_LOCATION (c
),
4722 "zero length array section in %qs clause",
4723 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4724 return error_mark_node
;
4726 maybe_zero_len
= true;
4728 else if (length
== NULL_TREE
4729 && first_non_one
== types
.length ()
4730 && tree_int_cst_equal
4731 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4735 else if (length
== NULL_TREE
)
4737 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4738 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4739 maybe_zero_len
= true;
4740 if (first_non_one
== types
.length ())
4743 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4745 if (tree_int_cst_lt (size
, length
))
4747 error_at (OMP_CLAUSE_LOCATION (c
),
4748 "length %qE above array section size "
4749 "in %qs clause", length
,
4750 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4751 return error_mark_node
;
4753 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4756 = size_binop (PLUS_EXPR
,
4757 fold_convert (sizetype
, low_bound
),
4758 fold_convert (sizetype
, length
));
4759 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4760 && tree_int_cst_lt (size
, lbpluslen
))
4762 error_at (OMP_CLAUSE_LOCATION (c
),
4763 "high bound %qE above array section size "
4764 "in %qs clause", lbpluslen
,
4765 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4766 return error_mark_node
;
4771 else if (length
== NULL_TREE
)
4773 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4774 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4775 maybe_zero_len
= true;
4776 if (first_non_one
== types
.length ())
4780 /* For [lb:] we will need to evaluate lb more than once. */
4781 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4783 tree lb
= cp_save_expr (low_bound
);
4784 if (lb
!= low_bound
)
4786 TREE_PURPOSE (t
) = lb
;
4791 else if (TYPE_PTR_P (type
))
4793 if (length
== NULL_TREE
)
4795 error_at (OMP_CLAUSE_LOCATION (c
),
4796 "for pointer type length expression must be specified");
4797 return error_mark_node
;
4799 if (length
!= NULL_TREE
4800 && TREE_CODE (length
) == INTEGER_CST
4801 && tree_int_cst_sgn (length
) == -1)
4803 error_at (OMP_CLAUSE_LOCATION (c
),
4804 "negative length in array section in %qs clause",
4805 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4806 return error_mark_node
;
4808 /* If there is a pointer type anywhere but in the very first
4809 array-section-subscript, the array section can't be contiguous. */
4810 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4811 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4813 error_at (OMP_CLAUSE_LOCATION (c
),
4814 "array section is not contiguous in %qs clause",
4815 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4816 return error_mark_node
;
4821 error_at (OMP_CLAUSE_LOCATION (c
),
4822 "%qE does not have pointer or array type", ret
);
4823 return error_mark_node
;
4825 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4826 types
.safe_push (TREE_TYPE (ret
));
4827 /* We will need to evaluate lb more than once. */
4828 tree lb
= cp_save_expr (low_bound
);
4829 if (lb
!= low_bound
)
4831 TREE_PURPOSE (t
) = lb
;
4834 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4838 /* Handle array sections for clause C. */
4841 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4843 bool maybe_zero_len
= false;
4844 unsigned int first_non_one
= 0;
4845 auto_vec
<tree
, 10> types
;
4846 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4847 maybe_zero_len
, first_non_one
,
4849 if (first
== error_mark_node
)
4851 if (first
== NULL_TREE
)
4853 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4855 tree t
= OMP_CLAUSE_DECL (c
);
4856 tree tem
= NULL_TREE
;
4857 if (processing_template_decl
)
4859 /* Need to evaluate side effects in the length expressions
4861 while (TREE_CODE (t
) == TREE_LIST
)
4863 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4865 if (tem
== NULL_TREE
)
4866 tem
= TREE_VALUE (t
);
4868 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4869 TREE_VALUE (t
), tem
);
4874 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4875 OMP_CLAUSE_DECL (c
) = first
;
4879 unsigned int num
= types
.length (), i
;
4880 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4881 tree condition
= NULL_TREE
;
4883 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4884 maybe_zero_len
= true;
4885 if (processing_template_decl
&& maybe_zero_len
)
4888 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4891 tree low_bound
= TREE_PURPOSE (t
);
4892 tree length
= TREE_VALUE (t
);
4896 && TREE_CODE (low_bound
) == INTEGER_CST
4897 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4898 > TYPE_PRECISION (sizetype
))
4899 low_bound
= fold_convert (sizetype
, low_bound
);
4901 && TREE_CODE (length
) == INTEGER_CST
4902 && TYPE_PRECISION (TREE_TYPE (length
))
4903 > TYPE_PRECISION (sizetype
))
4904 length
= fold_convert (sizetype
, length
);
4905 if (low_bound
== NULL_TREE
)
4906 low_bound
= integer_zero_node
;
4907 if (!maybe_zero_len
&& i
> first_non_one
)
4909 if (integer_nonzerop (low_bound
))
4910 goto do_warn_noncontiguous
;
4911 if (length
!= NULL_TREE
4912 && TREE_CODE (length
) == INTEGER_CST
4913 && TYPE_DOMAIN (types
[i
])
4914 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4915 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4919 size
= size_binop (PLUS_EXPR
,
4920 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4922 if (!tree_int_cst_equal (length
, size
))
4924 do_warn_noncontiguous
:
4925 error_at (OMP_CLAUSE_LOCATION (c
),
4926 "array section is not contiguous in %qs "
4928 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4932 if (!processing_template_decl
4933 && length
!= NULL_TREE
4934 && TREE_SIDE_EFFECTS (length
))
4936 if (side_effects
== NULL_TREE
)
4937 side_effects
= length
;
4939 side_effects
= build2 (COMPOUND_EXPR
,
4940 TREE_TYPE (side_effects
),
4941 length
, side_effects
);
4944 else if (processing_template_decl
)
4950 if (i
> first_non_one
4951 && ((length
&& integer_nonzerop (length
))
4952 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
))
4955 l
= fold_convert (sizetype
, length
);
4958 l
= size_binop (PLUS_EXPR
,
4959 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4961 l
= size_binop (MINUS_EXPR
, l
,
4962 fold_convert (sizetype
, low_bound
));
4964 if (i
> first_non_one
)
4966 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4968 if (condition
== NULL_TREE
)
4971 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4974 else if (size
== NULL_TREE
)
4976 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4977 tree eltype
= TREE_TYPE (types
[num
- 1]);
4978 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4979 eltype
= TREE_TYPE (eltype
);
4980 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4981 size
= size_binop (EXACT_DIV_EXPR
, size
,
4982 size_in_bytes (eltype
));
4983 size
= size_binop (MULT_EXPR
, size
, l
);
4985 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4986 size
, size_zero_node
);
4989 size
= size_binop (MULT_EXPR
, size
, l
);
4992 if (!processing_template_decl
)
4995 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
4996 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4998 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
4999 tree index_type
= build_index_type (size
);
5000 tree eltype
= TREE_TYPE (first
);
5001 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5002 eltype
= TREE_TYPE (eltype
);
5003 tree type
= build_array_type (eltype
, index_type
);
5004 tree ptype
= build_pointer_type (eltype
);
5005 if (TYPE_REF_P (TREE_TYPE (t
))
5006 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
5007 t
= convert_from_reference (t
);
5008 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5009 t
= build_fold_addr_expr (t
);
5010 tree t2
= build_fold_addr_expr (first
);
5011 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5012 ptrdiff_type_node
, t2
);
5013 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5014 ptrdiff_type_node
, t2
,
5015 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5016 ptrdiff_type_node
, t
));
5017 if (tree_fits_shwi_p (t2
))
5018 t
= build2 (MEM_REF
, type
, t
,
5019 build_int_cst (ptype
, tree_to_shwi (t2
)));
5022 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5024 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5025 TREE_TYPE (t
), t
, t2
);
5026 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5028 OMP_CLAUSE_DECL (c
) = t
;
5031 OMP_CLAUSE_DECL (c
) = first
;
5032 OMP_CLAUSE_SIZE (c
) = size
;
5033 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5034 || (TREE_CODE (t
) == COMPONENT_REF
5035 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5037 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5038 switch (OMP_CLAUSE_MAP_KIND (c
))
5040 case GOMP_MAP_ALLOC
:
5043 case GOMP_MAP_TOFROM
:
5044 case GOMP_MAP_ALWAYS_TO
:
5045 case GOMP_MAP_ALWAYS_FROM
:
5046 case GOMP_MAP_ALWAYS_TOFROM
:
5047 case GOMP_MAP_RELEASE
:
5048 case GOMP_MAP_DELETE
:
5049 case GOMP_MAP_FORCE_TO
:
5050 case GOMP_MAP_FORCE_FROM
:
5051 case GOMP_MAP_FORCE_TOFROM
:
5052 case GOMP_MAP_FORCE_PRESENT
:
5053 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5058 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5060 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5061 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5062 else if (TREE_CODE (t
) == COMPONENT_REF
)
5063 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5064 else if (REFERENCE_REF_P (t
)
5065 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5067 t
= TREE_OPERAND (t
, 0);
5068 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5071 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5072 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5073 && !cxx_mark_addressable (t
))
5075 OMP_CLAUSE_DECL (c2
) = t
;
5076 t
= build_fold_addr_expr (first
);
5077 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5078 ptrdiff_type_node
, t
);
5079 tree ptr
= OMP_CLAUSE_DECL (c2
);
5080 ptr
= convert_from_reference (ptr
);
5081 if (!INDIRECT_TYPE_P (TREE_TYPE (ptr
)))
5082 ptr
= build_fold_addr_expr (ptr
);
5083 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5084 ptrdiff_type_node
, t
,
5085 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5086 ptrdiff_type_node
, ptr
));
5087 OMP_CLAUSE_SIZE (c2
) = t
;
5088 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5089 OMP_CLAUSE_CHAIN (c
) = c2
;
5090 ptr
= OMP_CLAUSE_DECL (c2
);
5091 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5092 && TYPE_REF_P (TREE_TYPE (ptr
))
5093 && INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5095 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5097 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5098 OMP_CLAUSE_DECL (c3
) = ptr
;
5099 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5100 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5102 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5103 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5104 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5105 OMP_CLAUSE_CHAIN (c2
) = c3
;
5112 /* Return identifier to look up for omp declare reduction. */
5115 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5117 const char *p
= NULL
;
5118 const char *m
= NULL
;
5119 switch (reduction_code
)
5127 case TRUTH_ANDIF_EXPR
:
5128 case TRUTH_ORIF_EXPR
:
5129 reduction_id
= ovl_op_identifier (false, reduction_code
);
5143 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5144 return error_mark_node
;
5145 p
= IDENTIFIER_POINTER (reduction_id
);
5148 if (type
!= NULL_TREE
)
5149 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5151 const char prefix
[] = "omp declare reduction ";
5152 size_t lenp
= sizeof (prefix
);
5153 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5155 size_t len
= strlen (p
);
5156 size_t lenm
= m
? strlen (m
) + 1 : 0;
5157 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5159 memcpy (name
, prefix
, lenp
- 1);
5160 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5163 name
[lenp
+ len
- 1] = '~';
5164 memcpy (name
+ lenp
+ len
, m
, lenm
);
5166 return get_identifier (name
);
5169 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5170 FUNCTION_DECL or NULL_TREE if not found. */
5173 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5174 vec
<tree
> *ambiguousp
)
5177 tree baselink
= NULL_TREE
;
5178 if (identifier_p (id
))
5181 bool nonint_cst_expression_p
;
5182 const char *error_msg
;
5183 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5184 tree decl
= lookup_name (id
);
5185 if (decl
== NULL_TREE
)
5186 decl
= error_mark_node
;
5187 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5188 &nonint_cst_expression_p
, false, true, false,
5189 false, &error_msg
, loc
);
5190 if (idk
== CP_ID_KIND_UNQUALIFIED
5191 && identifier_p (id
))
5193 vec
<tree
, va_gc
> *args
= NULL
;
5194 vec_safe_push (args
, build_reference_type (type
));
5195 id
= perform_koenig_lookup (id
, args
, tf_none
);
5198 else if (TREE_CODE (id
) == SCOPE_REF
)
5199 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5200 omp_reduction_id (ERROR_MARK
,
5201 TREE_OPERAND (id
, 1),
5206 if (fns
&& is_overloaded_fn (fns
))
5208 for (lkp_iterator
iter (get_fns (fns
)); iter
; ++iter
)
5210 tree fndecl
= *iter
;
5211 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5213 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5214 if (same_type_p (TREE_TYPE (argtype
), type
))
5222 if (id
&& BASELINK_P (fns
))
5231 if (!id
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5233 vec
<tree
> ambiguous
= vNULL
;
5234 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5236 if (ambiguousp
== NULL
)
5237 ambiguousp
= &ambiguous
;
5238 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5240 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5241 baselinkp
? baselinkp
: &baselink
,
5243 if (id
== NULL_TREE
)
5245 if (!ambiguousp
->is_empty ())
5246 ambiguousp
->safe_push (id
);
5247 else if (ret
!= NULL_TREE
)
5249 ambiguousp
->safe_push (ret
);
5250 ambiguousp
->safe_push (id
);
5256 if (ambiguousp
!= &ambiguous
)
5258 if (!ambiguous
.is_empty ())
5260 const char *str
= _("candidates are:");
5263 error_at (loc
, "user defined reduction lookup is ambiguous");
5264 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5266 inform (DECL_SOURCE_LOCATION (udr
), "%s %#qD", str
, udr
);
5268 str
= get_spaces (str
);
5270 ambiguous
.release ();
5271 ret
= error_mark_node
;
5272 baselink
= NULL_TREE
;
5277 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5278 id
, id
, tf_warning_or_error
);
5282 /* Helper function for cp_parser_omp_declare_reduction_exprs
5284 Remove CLEANUP_STMT for data (omp_priv variable).
5285 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5289 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5293 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5294 *tp
= CLEANUP_BODY (*tp
);
5295 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5297 tree decl
= DECL_EXPR_DECL (*tp
);
5298 if (!processing_template_decl
5299 && decl
== (tree
) data
5300 && DECL_INITIAL (decl
)
5301 && DECL_INITIAL (decl
) != error_mark_node
)
5303 tree list
= NULL_TREE
;
5304 append_to_statement_list_force (*tp
, &list
);
5305 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5306 decl
, DECL_INITIAL (decl
));
5307 DECL_INITIAL (decl
) = NULL_TREE
;
5308 append_to_statement_list_force (init_expr
, &list
);
5315 /* Data passed from cp_check_omp_declare_reduction to
5316 cp_check_omp_declare_reduction_r. */
5318 struct cp_check_omp_declare_reduction_data
5325 /* Helper function for cp_check_omp_declare_reduction, called via
5329 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5331 struct cp_check_omp_declare_reduction_data
*udr_data
5332 = (struct cp_check_omp_declare_reduction_data
*) data
;
5334 && !DECL_ARTIFICIAL (*tp
)
5335 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5336 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5338 location_t loc
= udr_data
->loc
;
5339 if (udr_data
->combiner_p
)
5340 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5341 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5344 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5345 "to variable %qD which is not %<omp_priv%> nor "
5353 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5356 cp_check_omp_declare_reduction (tree udr
)
5358 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5359 gcc_assert (TYPE_REF_P (type
));
5360 type
= TREE_TYPE (type
);
5362 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5364 if (type
== error_mark_node
)
5366 if (ARITHMETIC_TYPE_P (type
))
5368 static enum tree_code predef_codes
[]
5369 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5370 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5371 for (i
= 0; i
< 8; i
++)
5373 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5374 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5375 const char *n2
= IDENTIFIER_POINTER (id
);
5376 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5377 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5378 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5383 && TREE_CODE (type
) != COMPLEX_EXPR
)
5385 const char prefix_minmax
[] = "omp declare reduction m";
5386 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5387 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5388 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5389 prefix_minmax
, prefix_size
) == 0
5390 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5391 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5392 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5397 error_at (loc
, "predeclared arithmetic type %qT in "
5398 "%<#pragma omp declare reduction%>", type
);
5402 else if (TREE_CODE (type
) == FUNCTION_TYPE
5403 || TREE_CODE (type
) == METHOD_TYPE
5404 || TREE_CODE (type
) == ARRAY_TYPE
)
5406 error_at (loc
, "function or array type %qT in "
5407 "%<#pragma omp declare reduction%>", type
);
5410 else if (TYPE_REF_P (type
))
5412 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5416 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5418 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5419 "%<#pragma omp declare reduction%>", type
);
5423 tree body
= DECL_SAVED_TREE (udr
);
5424 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5427 tree_stmt_iterator tsi
;
5428 struct cp_check_omp_declare_reduction_data data
;
5429 memset (data
.stmts
, 0, sizeof data
.stmts
);
5430 for (i
= 0, tsi
= tsi_start (body
);
5431 i
< 7 && !tsi_end_p (tsi
);
5432 i
++, tsi_next (&tsi
))
5433 data
.stmts
[i
] = tsi_stmt (tsi
);
5435 gcc_assert (tsi_end_p (tsi
));
5438 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5439 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5440 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5442 data
.combiner_p
= true;
5443 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5445 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5449 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5450 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5451 data
.combiner_p
= false;
5452 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5454 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5455 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5456 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5458 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5462 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5463 an inline call. But, remap
5464 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5465 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5468 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5469 tree decl
, tree placeholder
)
5472 hash_map
<tree
, tree
> decl_map
;
5474 decl_map
.put (omp_decl1
, placeholder
);
5475 decl_map
.put (omp_decl2
, decl
);
5476 memset (&id
, 0, sizeof (id
));
5477 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5478 id
.dst_fn
= current_function_decl
;
5479 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5480 id
.decl_map
= &decl_map
;
5482 id
.copy_decl
= copy_decl_no_change
;
5483 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5484 id
.transform_new_cfg
= true;
5485 id
.transform_return_to_modify
= false;
5486 id
.transform_lang_insert_block
= NULL
;
5488 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5492 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5493 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5496 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5498 if (*tp
== (tree
) data
)
5503 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5504 Return true if there is some error and the clause should be removed. */
5507 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5509 tree t
= OMP_CLAUSE_DECL (c
);
5510 bool predefined
= false;
5511 if (TREE_CODE (t
) == TREE_LIST
)
5513 gcc_assert (processing_template_decl
);
5516 tree type
= TREE_TYPE (t
);
5517 if (TREE_CODE (t
) == MEM_REF
)
5518 type
= TREE_TYPE (type
);
5519 if (TYPE_REF_P (type
))
5520 type
= TREE_TYPE (type
);
5521 if (TREE_CODE (type
) == ARRAY_TYPE
)
5524 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5525 while (TREE_CODE (type
) == ARRAY_TYPE
)
5526 type
= TREE_TYPE (type
);
5527 if (!processing_template_decl
)
5529 t
= require_complete_type (t
);
5530 if (t
== error_mark_node
)
5532 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5533 TYPE_SIZE_UNIT (type
));
5534 if (integer_zerop (size
))
5536 error ("%qE in %<reduction%> clause is a zero size array",
5537 omp_clause_printable_decl (t
));
5540 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5541 tree index_type
= build_index_type (size
);
5542 tree atype
= build_array_type (type
, index_type
);
5543 tree ptype
= build_pointer_type (type
);
5544 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5545 t
= build_fold_addr_expr (t
);
5546 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5547 OMP_CLAUSE_DECL (c
) = t
;
5550 if (type
== error_mark_node
)
5552 else if (ARITHMETIC_TYPE_P (type
))
5553 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5562 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5569 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5573 case TRUTH_ANDIF_EXPR
:
5574 case TRUTH_ORIF_EXPR
:
5575 if (FLOAT_TYPE_P (type
))
5582 else if (TYPE_READONLY (type
))
5584 error ("%qE has const type for %<reduction%>",
5585 omp_clause_printable_decl (t
));
5588 else if (!processing_template_decl
)
5590 t
= require_complete_type (t
);
5591 if (t
== error_mark_node
)
5593 OMP_CLAUSE_DECL (c
) = t
;
5598 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5601 else if (processing_template_decl
)
5603 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) == error_mark_node
)
5608 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5610 type
= TYPE_MAIN_VARIANT (type
);
5611 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5612 if (id
== NULL_TREE
)
5613 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5614 NULL_TREE
, NULL_TREE
);
5615 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5618 if (id
== error_mark_node
)
5621 tree body
= DECL_SAVED_TREE (id
);
5624 if (TREE_CODE (body
) == STATEMENT_LIST
)
5626 tree_stmt_iterator tsi
;
5627 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5630 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5631 atype
= TREE_TYPE (atype
);
5632 bool need_static_cast
= !same_type_p (type
, atype
);
5633 memset (stmts
, 0, sizeof stmts
);
5634 for (i
= 0, tsi
= tsi_start (body
);
5635 i
< 7 && !tsi_end_p (tsi
);
5636 i
++, tsi_next (&tsi
))
5637 stmts
[i
] = tsi_stmt (tsi
);
5638 gcc_assert (tsi_end_p (tsi
));
5642 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5643 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5644 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5645 DECL_ARTIFICIAL (placeholder
) = 1;
5646 DECL_IGNORED_P (placeholder
) = 1;
5647 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5648 if (TREE_CODE (t
) == MEM_REF
)
5650 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5652 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5653 DECL_IGNORED_P (decl_placeholder
) = 1;
5654 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5656 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5657 cxx_mark_addressable (placeholder
);
5658 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5659 && !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
))))
5660 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5661 : OMP_CLAUSE_DECL (c
));
5662 tree omp_out
= placeholder
;
5663 tree omp_in
= decl_placeholder
? decl_placeholder
5664 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5665 if (need_static_cast
)
5667 tree rtype
= build_reference_type (atype
);
5668 omp_out
= build_static_cast (rtype
, omp_out
,
5669 tf_warning_or_error
);
5670 omp_in
= build_static_cast (rtype
, omp_in
,
5671 tf_warning_or_error
);
5672 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5674 omp_out
= convert_from_reference (omp_out
);
5675 omp_in
= convert_from_reference (omp_in
);
5677 OMP_CLAUSE_REDUCTION_MERGE (c
)
5678 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5679 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5683 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5684 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5685 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5686 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5687 : OMP_CLAUSE_DECL (c
));
5688 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5689 cxx_mark_addressable (placeholder
);
5690 tree omp_priv
= decl_placeholder
? decl_placeholder
5691 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5692 tree omp_orig
= placeholder
;
5693 if (need_static_cast
)
5697 error_at (OMP_CLAUSE_LOCATION (c
),
5698 "user defined reduction with constructor "
5699 "initializer for base class %qT", atype
);
5702 tree rtype
= build_reference_type (atype
);
5703 omp_priv
= build_static_cast (rtype
, omp_priv
,
5704 tf_warning_or_error
);
5705 omp_orig
= build_static_cast (rtype
, omp_orig
,
5706 tf_warning_or_error
);
5707 if (omp_priv
== error_mark_node
5708 || omp_orig
== error_mark_node
)
5710 omp_priv
= convert_from_reference (omp_priv
);
5711 omp_orig
= convert_from_reference (omp_orig
);
5714 *need_default_ctor
= true;
5715 OMP_CLAUSE_REDUCTION_INIT (c
)
5716 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5717 DECL_EXPR_DECL (stmts
[3]),
5718 omp_priv
, omp_orig
);
5719 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5720 find_omp_placeholder_r
, placeholder
, NULL
))
5721 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5725 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5726 *need_default_ctor
= true;
5730 tree v
= decl_placeholder
? decl_placeholder
5731 : convert_from_reference (t
);
5732 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5733 init
= build_constructor (TREE_TYPE (v
), NULL
);
5735 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5736 OMP_CLAUSE_REDUCTION_INIT (c
)
5737 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5742 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5746 error ("user defined reduction not found for %qE",
5747 omp_clause_printable_decl (t
));
5750 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5751 gcc_assert (TYPE_SIZE_UNIT (type
)
5752 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5756 /* Called from finish_struct_1. linear(this) or linear(this:step)
5757 clauses might not be finalized yet because the class has been incomplete
5758 when parsing #pragma omp declare simd methods. Fix those up now. */
5761 finish_omp_declare_simd_methods (tree t
)
5763 if (processing_template_decl
)
5766 for (tree x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
5768 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5770 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5771 if (!ods
|| !TREE_VALUE (ods
))
5773 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5774 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5775 && integer_zerop (OMP_CLAUSE_DECL (c
))
5776 && OMP_CLAUSE_LINEAR_STEP (c
)
5777 && TYPE_PTR_P (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
))))
5779 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5780 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5781 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5782 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5783 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5788 /* Adjust sink depend clause to take into account pointer offsets.
5790 Return TRUE if there was a problem processing the offset, and the
5791 whole clause should be removed. */
5794 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5796 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5797 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5799 /* Make sure we don't adjust things twice for templates. */
5800 if (processing_template_decl
)
5803 for (; t
; t
= TREE_CHAIN (t
))
5805 tree decl
= TREE_VALUE (t
);
5806 if (TYPE_PTR_P (TREE_TYPE (decl
)))
5808 tree offset
= TREE_PURPOSE (t
);
5809 bool neg
= wi::neg_p (wi::to_wide (offset
));
5810 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5811 decl
= mark_rvalue_use (decl
);
5812 decl
= convert_from_reference (decl
);
5813 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5814 neg
? MINUS_EXPR
: PLUS_EXPR
,
5816 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5817 MINUS_EXPR
, sizetype
,
5818 fold_convert (sizetype
, t2
),
5819 fold_convert (sizetype
, decl
));
5820 if (t2
== error_mark_node
)
5822 TREE_PURPOSE (t
) = t2
;
5828 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5829 Remove any elements from the list that are invalid. */
5832 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
5834 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5835 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
5837 tree safelen
= NULL_TREE
;
5838 bool branch_seen
= false;
5839 bool copyprivate_seen
= false;
5840 bool ordered_seen
= false;
5841 bool oacc_async
= false;
5843 bitmap_obstack_initialize (NULL
);
5844 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5845 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5846 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5847 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5848 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
5849 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
5850 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
5852 if (ort
& C_ORT_ACC
)
5853 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
5854 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
5860 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5862 bool remove
= false;
5863 bool field_ok
= false;
5865 switch (OMP_CLAUSE_CODE (c
))
5867 case OMP_CLAUSE_SHARED
:
5868 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5869 goto check_dup_generic
;
5870 case OMP_CLAUSE_PRIVATE
:
5871 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5872 goto check_dup_generic
;
5873 case OMP_CLAUSE_REDUCTION
:
5874 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5875 t
= OMP_CLAUSE_DECL (c
);
5876 if (TREE_CODE (t
) == TREE_LIST
)
5878 if (handle_omp_array_sections (c
, ort
))
5883 if (TREE_CODE (t
) == TREE_LIST
)
5885 while (TREE_CODE (t
) == TREE_LIST
)
5890 gcc_assert (TREE_CODE (t
) == MEM_REF
);
5891 t
= TREE_OPERAND (t
, 0);
5892 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
5893 t
= TREE_OPERAND (t
, 0);
5894 if (TREE_CODE (t
) == ADDR_EXPR
5895 || INDIRECT_REF_P (t
))
5896 t
= TREE_OPERAND (t
, 0);
5898 tree n
= omp_clause_decl_field (t
);
5901 goto check_dup_generic_t
;
5904 cxx_mark_addressable (t
);
5905 goto check_dup_generic
;
5906 case OMP_CLAUSE_COPYPRIVATE
:
5907 copyprivate_seen
= true;
5908 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5909 goto check_dup_generic
;
5910 case OMP_CLAUSE_COPYIN
:
5911 goto check_dup_generic
;
5912 case OMP_CLAUSE_LINEAR
:
5913 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5914 t
= OMP_CLAUSE_DECL (c
);
5915 if (ort
!= C_ORT_OMP_DECLARE_SIMD
5916 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
5918 error_at (OMP_CLAUSE_LOCATION (c
),
5919 "modifier should not be specified in %<linear%> "
5920 "clause on %<simd%> or %<for%> constructs");
5921 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
5923 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5924 && !type_dependent_expression_p (t
))
5926 tree type
= TREE_TYPE (t
);
5927 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5928 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
5929 && !TYPE_REF_P (type
))
5931 error ("linear clause with %qs modifier applied to "
5932 "non-reference variable with %qT type",
5933 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5934 ? "ref" : "uval", TREE_TYPE (t
));
5938 if (TYPE_REF_P (type
))
5939 type
= TREE_TYPE (type
);
5940 if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
5942 if (!INTEGRAL_TYPE_P (type
)
5943 && !TYPE_PTR_P (type
))
5945 error ("linear clause applied to non-integral non-pointer"
5946 " variable with %qT type", TREE_TYPE (t
));
5952 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5954 t
= integer_one_node
;
5955 if (t
== error_mark_node
)
5960 else if (!type_dependent_expression_p (t
)
5961 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5962 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5963 || TREE_CODE (t
) != PARM_DECL
5964 || !TYPE_REF_P (TREE_TYPE (t
))
5965 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
5967 error ("linear step expression must be integral");
5973 t
= mark_rvalue_use (t
);
5974 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
5976 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
5977 goto check_dup_generic
;
5979 if (!processing_template_decl
5980 && (VAR_P (OMP_CLAUSE_DECL (c
))
5981 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
5983 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
5985 t
= maybe_constant_value (t
);
5986 if (TREE_CODE (t
) != INTEGER_CST
)
5988 error_at (OMP_CLAUSE_LOCATION (c
),
5989 "%<linear%> clause step %qE is neither "
5990 "constant nor a parameter", t
);
5995 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5996 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
5997 if (TYPE_REF_P (type
))
5998 type
= TREE_TYPE (type
);
5999 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
6001 type
= build_pointer_type (type
);
6002 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
6003 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6005 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6006 MINUS_EXPR
, sizetype
,
6007 fold_convert (sizetype
, t
),
6008 fold_convert (sizetype
, d
));
6009 if (t
== error_mark_node
)
6015 else if (TYPE_PTR_P (type
)
6016 /* Can't multiply the step yet if *this
6017 is still incomplete type. */
6018 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6019 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6020 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6021 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6023 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6025 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6026 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6028 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6029 MINUS_EXPR
, sizetype
,
6030 fold_convert (sizetype
, t
),
6031 fold_convert (sizetype
, d
));
6032 if (t
== error_mark_node
)
6039 t
= fold_convert (type
, t
);
6041 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6043 goto check_dup_generic
;
6045 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6048 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6049 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6052 t
= OMP_CLAUSE_DECL (c
);
6053 check_dup_generic_t
:
6054 if (t
== current_class_ptr
6055 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6056 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6057 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6059 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6064 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6065 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6067 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6070 error ("%qD is not a variable in clause %qs", t
,
6071 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6073 error ("%qE is not a variable in clause %qs", t
,
6074 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6077 else if (ort
== C_ORT_ACC
6078 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6080 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6082 error ("%qD appears more than once in reduction clauses", t
);
6086 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6088 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6089 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6090 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6092 error ("%qD appears more than once in data clauses", t
);
6095 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6096 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6098 if (ort
== C_ORT_ACC
)
6099 error ("%qD appears more than once in data clauses", t
);
6101 error ("%qD appears both in data and map clauses", t
);
6105 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6110 && TREE_CODE (t
) == FIELD_DECL
6111 && t
== OMP_CLAUSE_DECL (c
)
6112 && ort
!= C_ORT_ACC
)
6115 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6116 == OMP_CLAUSE_SHARED
));
6117 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6122 case OMP_CLAUSE_FIRSTPRIVATE
:
6123 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6125 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6127 t
= OMP_CLAUSE_DECL (c
);
6128 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6130 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6135 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6136 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6137 || TREE_CODE (t
) != FIELD_DECL
))
6139 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6142 error ("%qD is not a variable in clause %<firstprivate%>", t
);
6144 error ("%qE is not a variable in clause %<firstprivate%>", t
);
6147 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6148 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6150 error ("%qD appears more than once in data clauses", t
);
6153 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6155 if (ort
== C_ORT_ACC
)
6156 error ("%qD appears more than once in data clauses", t
);
6158 error ("%qD appears both in data and map clauses", t
);
6162 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6163 goto handle_field_decl
;
6165 case OMP_CLAUSE_LASTPRIVATE
:
6166 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6168 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6170 t
= OMP_CLAUSE_DECL (c
);
6171 if (t
== current_class_ptr
)
6173 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6178 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6179 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6180 || TREE_CODE (t
) != FIELD_DECL
))
6182 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6185 error ("%qD is not a variable in clause %<lastprivate%>", t
);
6187 error ("%qE is not a variable in clause %<lastprivate%>", t
);
6190 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6191 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6193 error ("%qD appears more than once in data clauses", t
);
6197 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6198 goto handle_field_decl
;
6201 t
= OMP_CLAUSE_IF_EXPR (c
);
6202 t
= maybe_convert_cond (t
);
6203 if (t
== error_mark_node
)
6205 else if (!processing_template_decl
)
6206 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6207 OMP_CLAUSE_IF_EXPR (c
) = t
;
6210 case OMP_CLAUSE_FINAL
:
6211 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6212 t
= maybe_convert_cond (t
);
6213 if (t
== error_mark_node
)
6215 else if (!processing_template_decl
)
6216 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6217 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6220 case OMP_CLAUSE_GANG
:
6221 /* Operand 1 is the gang static: argument. */
6222 t
= OMP_CLAUSE_OPERAND (c
, 1);
6225 if (t
== error_mark_node
)
6227 else if (!type_dependent_expression_p (t
)
6228 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6230 error ("%<gang%> static expression must be integral");
6235 t
= mark_rvalue_use (t
);
6236 if (!processing_template_decl
)
6238 t
= maybe_constant_value (t
);
6239 if (TREE_CODE (t
) == INTEGER_CST
6240 && tree_int_cst_sgn (t
) != 1
6241 && t
!= integer_minus_one_node
)
6243 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6244 "%<gang%> static value must be "
6246 t
= integer_one_node
;
6248 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6251 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6253 /* Check operand 0, the num argument. */
6256 case OMP_CLAUSE_WORKER
:
6257 case OMP_CLAUSE_VECTOR
:
6258 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6262 case OMP_CLAUSE_NUM_TASKS
:
6263 case OMP_CLAUSE_NUM_TEAMS
:
6264 case OMP_CLAUSE_NUM_THREADS
:
6265 case OMP_CLAUSE_NUM_GANGS
:
6266 case OMP_CLAUSE_NUM_WORKERS
:
6267 case OMP_CLAUSE_VECTOR_LENGTH
:
6268 t
= OMP_CLAUSE_OPERAND (c
, 0);
6269 if (t
== error_mark_node
)
6271 else if (!type_dependent_expression_p (t
)
6272 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6274 switch (OMP_CLAUSE_CODE (c
))
6276 case OMP_CLAUSE_GANG
:
6277 error_at (OMP_CLAUSE_LOCATION (c
),
6278 "%<gang%> num expression must be integral"); break;
6279 case OMP_CLAUSE_VECTOR
:
6280 error_at (OMP_CLAUSE_LOCATION (c
),
6281 "%<vector%> length expression must be integral");
6283 case OMP_CLAUSE_WORKER
:
6284 error_at (OMP_CLAUSE_LOCATION (c
),
6285 "%<worker%> num expression must be integral");
6288 error_at (OMP_CLAUSE_LOCATION (c
),
6289 "%qs expression must be integral",
6290 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6296 t
= mark_rvalue_use (t
);
6297 if (!processing_template_decl
)
6299 t
= maybe_constant_value (t
);
6300 if (TREE_CODE (t
) == INTEGER_CST
6301 && tree_int_cst_sgn (t
) != 1)
6303 switch (OMP_CLAUSE_CODE (c
))
6305 case OMP_CLAUSE_GANG
:
6306 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6307 "%<gang%> num value must be positive");
6309 case OMP_CLAUSE_VECTOR
:
6310 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6311 "%<vector%> length value must be "
6314 case OMP_CLAUSE_WORKER
:
6315 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6316 "%<worker%> num value must be "
6320 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6321 "%qs value must be positive",
6322 omp_clause_code_name
6323 [OMP_CLAUSE_CODE (c
)]);
6325 t
= integer_one_node
;
6327 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6329 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6333 case OMP_CLAUSE_SCHEDULE
:
6334 if (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
)
6336 const char *p
= NULL
;
6337 switch (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_MASK
)
6339 case OMP_CLAUSE_SCHEDULE_STATIC
: p
= "static"; break;
6340 case OMP_CLAUSE_SCHEDULE_DYNAMIC
: break;
6341 case OMP_CLAUSE_SCHEDULE_GUIDED
: break;
6342 case OMP_CLAUSE_SCHEDULE_AUTO
: p
= "auto"; break;
6343 case OMP_CLAUSE_SCHEDULE_RUNTIME
: p
= "runtime"; break;
6344 default: gcc_unreachable ();
6348 error_at (OMP_CLAUSE_LOCATION (c
),
6349 "%<nonmonotonic%> modifier specified for %qs "
6350 "schedule kind", p
);
6351 OMP_CLAUSE_SCHEDULE_KIND (c
)
6352 = (enum omp_clause_schedule_kind
)
6353 (OMP_CLAUSE_SCHEDULE_KIND (c
)
6354 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
6358 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6361 else if (t
== error_mark_node
)
6363 else if (!type_dependent_expression_p (t
)
6364 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6366 error ("schedule chunk size expression must be integral");
6371 t
= mark_rvalue_use (t
);
6372 if (!processing_template_decl
)
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
;
6382 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6384 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6388 case OMP_CLAUSE_SIMDLEN
:
6389 case OMP_CLAUSE_SAFELEN
:
6390 t
= OMP_CLAUSE_OPERAND (c
, 0);
6391 if (t
== error_mark_node
)
6393 else if (!type_dependent_expression_p (t
)
6394 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6396 error ("%qs length expression must be integral",
6397 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6402 t
= mark_rvalue_use (t
);
6403 if (!processing_template_decl
)
6405 t
= maybe_constant_value (t
);
6406 if (TREE_CODE (t
) != INTEGER_CST
6407 || tree_int_cst_sgn (t
) != 1)
6409 error ("%qs length expression must be positive constant"
6410 " integer expression",
6411 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6415 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6416 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6421 case OMP_CLAUSE_ASYNC
:
6422 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6423 if (t
== error_mark_node
)
6425 else if (!type_dependent_expression_p (t
)
6426 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6428 error ("%<async%> expression must be integral");
6433 t
= mark_rvalue_use (t
);
6434 if (!processing_template_decl
)
6435 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6436 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6440 case OMP_CLAUSE_WAIT
:
6441 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6442 if (t
== error_mark_node
)
6444 else if (!processing_template_decl
)
6445 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6446 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6449 case OMP_CLAUSE_THREAD_LIMIT
:
6450 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6451 if (t
== error_mark_node
)
6453 else if (!type_dependent_expression_p (t
)
6454 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6456 error ("%<thread_limit%> expression must be integral");
6461 t
= mark_rvalue_use (t
);
6462 if (!processing_template_decl
)
6464 t
= maybe_constant_value (t
);
6465 if (TREE_CODE (t
) == INTEGER_CST
6466 && tree_int_cst_sgn (t
) != 1)
6468 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6469 "%<thread_limit%> value must be positive");
6470 t
= integer_one_node
;
6472 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6474 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6478 case OMP_CLAUSE_DEVICE
:
6479 t
= OMP_CLAUSE_DEVICE_ID (c
);
6480 if (t
== error_mark_node
)
6482 else if (!type_dependent_expression_p (t
)
6483 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6485 error ("%<device%> id must be integral");
6490 t
= mark_rvalue_use (t
);
6491 if (!processing_template_decl
)
6492 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6493 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6497 case OMP_CLAUSE_DIST_SCHEDULE
:
6498 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6501 else if (t
== error_mark_node
)
6503 else if (!type_dependent_expression_p (t
)
6504 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6506 error ("%<dist_schedule%> chunk size expression must be "
6512 t
= mark_rvalue_use (t
);
6513 if (!processing_template_decl
)
6514 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6515 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6519 case OMP_CLAUSE_ALIGNED
:
6520 t
= OMP_CLAUSE_DECL (c
);
6521 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6523 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6528 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6530 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6533 error ("%qD is not a variable in %<aligned%> clause", t
);
6535 error ("%qE is not a variable in %<aligned%> clause", t
);
6538 else if (!type_dependent_expression_p (t
)
6539 && !TYPE_PTR_P (TREE_TYPE (t
))
6540 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6541 && (!TYPE_REF_P (TREE_TYPE (t
))
6542 || (!INDIRECT_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6543 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6546 error_at (OMP_CLAUSE_LOCATION (c
),
6547 "%qE in %<aligned%> clause is neither a pointer nor "
6548 "an array nor a reference to pointer or array", t
);
6551 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6553 error ("%qD appears more than once in %<aligned%> clauses", t
);
6557 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6558 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6559 if (t
== error_mark_node
)
6561 else if (t
== NULL_TREE
)
6563 else if (!type_dependent_expression_p (t
)
6564 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6566 error ("%<aligned%> clause alignment expression must "
6572 t
= mark_rvalue_use (t
);
6573 if (!processing_template_decl
)
6575 t
= maybe_constant_value (t
);
6576 if (TREE_CODE (t
) != INTEGER_CST
6577 || tree_int_cst_sgn (t
) != 1)
6579 error ("%<aligned%> clause alignment expression must be "
6580 "positive constant integer expression");
6584 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6588 case OMP_CLAUSE_DEPEND
:
6589 t
= OMP_CLAUSE_DECL (c
);
6592 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6593 == OMP_CLAUSE_DEPEND_SOURCE
);
6596 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6598 if (cp_finish_omp_clause_depend_sink (c
))
6602 if (TREE_CODE (t
) == TREE_LIST
)
6604 if (handle_omp_array_sections (c
, ort
))
6608 if (t
== error_mark_node
)
6610 else if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6612 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6615 error ("%qD is not a variable in %<depend%> clause", t
);
6617 error ("%qE is not a variable in %<depend%> clause", t
);
6620 else if (t
== current_class_ptr
)
6622 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6626 else if (!processing_template_decl
6627 && !cxx_mark_addressable (t
))
6631 case OMP_CLAUSE_MAP
:
6633 case OMP_CLAUSE_FROM
:
6634 case OMP_CLAUSE__CACHE_
:
6635 t
= OMP_CLAUSE_DECL (c
);
6636 if (TREE_CODE (t
) == TREE_LIST
)
6638 if (handle_omp_array_sections (c
, ort
))
6642 t
= OMP_CLAUSE_DECL (c
);
6643 if (TREE_CODE (t
) != TREE_LIST
6644 && !type_dependent_expression_p (t
)
6645 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6647 error_at (OMP_CLAUSE_LOCATION (c
),
6648 "array section does not have mappable type "
6650 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6653 while (TREE_CODE (t
) == ARRAY_REF
)
6654 t
= TREE_OPERAND (t
, 0);
6655 if (TREE_CODE (t
) == COMPONENT_REF
6656 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
6658 while (TREE_CODE (t
) == COMPONENT_REF
)
6659 t
= TREE_OPERAND (t
, 0);
6660 if (REFERENCE_REF_P (t
))
6661 t
= TREE_OPERAND (t
, 0);
6662 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6664 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6666 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6667 error ("%qD appears more than once in motion"
6669 else if (ort
== C_ORT_ACC
)
6670 error ("%qD appears more than once in data"
6673 error ("%qD appears more than once in map"
6679 bitmap_set_bit (&map_head
, DECL_UID (t
));
6680 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6686 if (t
== error_mark_node
)
6691 if (REFERENCE_REF_P (t
)
6692 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
6694 t
= TREE_OPERAND (t
, 0);
6695 OMP_CLAUSE_DECL (c
) = t
;
6697 if (TREE_CODE (t
) == COMPONENT_REF
6698 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6699 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
6701 if (type_dependent_expression_p (t
))
6703 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
6704 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6706 error_at (OMP_CLAUSE_LOCATION (c
),
6707 "bit-field %qE in %qs clause",
6708 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6711 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6713 error_at (OMP_CLAUSE_LOCATION (c
),
6714 "%qE does not have a mappable type in %qs clause",
6715 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6718 while (TREE_CODE (t
) == COMPONENT_REF
)
6720 if (TREE_TYPE (TREE_OPERAND (t
, 0))
6721 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
6724 error_at (OMP_CLAUSE_LOCATION (c
),
6725 "%qE is a member of a union", t
);
6729 t
= TREE_OPERAND (t
, 0);
6733 if (REFERENCE_REF_P (t
))
6734 t
= TREE_OPERAND (t
, 0);
6735 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6737 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6738 goto handle_map_references
;
6741 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6743 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6745 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6746 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6747 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
6750 error ("%qD is not a variable in %qs clause", t
,
6751 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6753 error ("%qE is not a variable in %qs clause", t
,
6754 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6757 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
6759 error ("%qD is threadprivate variable in %qs clause", t
,
6760 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6763 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6765 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6770 else if (!processing_template_decl
6771 && !TYPE_REF_P (TREE_TYPE (t
))
6772 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
6773 || (OMP_CLAUSE_MAP_KIND (c
)
6774 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
6775 && !cxx_mark_addressable (t
))
6777 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6778 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6779 || (OMP_CLAUSE_MAP_KIND (c
)
6780 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
6781 && t
== OMP_CLAUSE_DECL (c
)
6782 && !type_dependent_expression_p (t
)
6783 && !cp_omp_mappable_type (TYPE_REF_P (TREE_TYPE (t
))
6784 ? TREE_TYPE (TREE_TYPE (t
))
6787 error_at (OMP_CLAUSE_LOCATION (c
),
6788 "%qD does not have a mappable type in %qs clause", t
,
6789 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6792 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6793 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
6794 && !type_dependent_expression_p (t
)
6795 && !INDIRECT_TYPE_P (TREE_TYPE (t
)))
6797 error ("%qD is not a pointer variable", t
);
6800 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6801 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
6803 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6804 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6806 error ("%qD appears more than once in data clauses", t
);
6809 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6811 if (ort
== C_ORT_ACC
)
6812 error ("%qD appears more than once in data clauses", t
);
6814 error ("%qD appears both in data and map clauses", t
);
6818 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6820 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6822 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6823 error ("%qD appears more than once in motion clauses", t
);
6824 if (ort
== C_ORT_ACC
)
6825 error ("%qD appears more than once in data clauses", t
);
6827 error ("%qD appears more than once in map clauses", t
);
6830 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6831 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6833 if (ort
== C_ORT_ACC
)
6834 error ("%qD appears more than once in data clauses", t
);
6836 error ("%qD appears both in data and map clauses", t
);
6841 bitmap_set_bit (&map_head
, DECL_UID (t
));
6842 if (t
!= OMP_CLAUSE_DECL (c
)
6843 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
6844 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6846 handle_map_references
:
6848 && !processing_template_decl
6849 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6850 && TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
))))
6852 t
= OMP_CLAUSE_DECL (c
);
6853 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6855 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6856 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6858 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6860 else if (OMP_CLAUSE_MAP_KIND (c
)
6861 != GOMP_MAP_FIRSTPRIVATE_POINTER
6862 && (OMP_CLAUSE_MAP_KIND (c
)
6863 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
6864 && (OMP_CLAUSE_MAP_KIND (c
)
6865 != GOMP_MAP_ALWAYS_POINTER
))
6867 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
6869 if (TREE_CODE (t
) == COMPONENT_REF
)
6870 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
6872 OMP_CLAUSE_SET_MAP_KIND (c2
,
6873 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
6874 OMP_CLAUSE_DECL (c2
) = t
;
6875 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
6876 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
6877 OMP_CLAUSE_CHAIN (c
) = c2
;
6878 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6879 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6881 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6887 case OMP_CLAUSE_TO_DECLARE
:
6888 case OMP_CLAUSE_LINK
:
6889 t
= OMP_CLAUSE_DECL (c
);
6890 if (TREE_CODE (t
) == FUNCTION_DECL
6891 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6893 else if (!VAR_P (t
))
6895 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6897 if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
6898 error_at (OMP_CLAUSE_LOCATION (c
),
6899 "template %qE in clause %qs", t
,
6900 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6901 else if (really_overloaded_fn (t
))
6902 error_at (OMP_CLAUSE_LOCATION (c
),
6903 "overloaded function name %qE in clause %qs", t
,
6904 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6906 error_at (OMP_CLAUSE_LOCATION (c
),
6907 "%qE is neither a variable nor a function name "
6909 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6912 error_at (OMP_CLAUSE_LOCATION (c
),
6913 "%qE is not a variable in clause %qs", t
,
6914 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6917 else if (DECL_THREAD_LOCAL_P (t
))
6919 error_at (OMP_CLAUSE_LOCATION (c
),
6920 "%qD is threadprivate variable in %qs clause", t
,
6921 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6924 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6926 error_at (OMP_CLAUSE_LOCATION (c
),
6927 "%qD does not have a mappable type in %qs clause", t
,
6928 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6933 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
6935 error_at (OMP_CLAUSE_LOCATION (c
),
6936 "%qE appears more than once on the same "
6937 "%<declare target%> directive", t
);
6941 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6944 case OMP_CLAUSE_UNIFORM
:
6945 t
= OMP_CLAUSE_DECL (c
);
6946 if (TREE_CODE (t
) != PARM_DECL
)
6948 if (processing_template_decl
)
6951 error ("%qD is not an argument in %<uniform%> clause", t
);
6953 error ("%qE is not an argument in %<uniform%> clause", t
);
6957 /* map_head bitmap is used as uniform_head if declare_simd. */
6958 bitmap_set_bit (&map_head
, DECL_UID (t
));
6959 goto check_dup_generic
;
6961 case OMP_CLAUSE_GRAINSIZE
:
6962 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
6963 if (t
== error_mark_node
)
6965 else if (!type_dependent_expression_p (t
)
6966 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6968 error ("%<grainsize%> expression must be integral");
6973 t
= mark_rvalue_use (t
);
6974 if (!processing_template_decl
)
6976 t
= maybe_constant_value (t
);
6977 if (TREE_CODE (t
) == INTEGER_CST
6978 && tree_int_cst_sgn (t
) != 1)
6980 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6981 "%<grainsize%> value must be positive");
6982 t
= integer_one_node
;
6984 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6986 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
6990 case OMP_CLAUSE_PRIORITY
:
6991 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
6992 if (t
== error_mark_node
)
6994 else if (!type_dependent_expression_p (t
)
6995 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6997 error ("%<priority%> expression must be integral");
7002 t
= mark_rvalue_use (t
);
7003 if (!processing_template_decl
)
7005 t
= maybe_constant_value (t
);
7006 if (TREE_CODE (t
) == INTEGER_CST
7007 && tree_int_cst_sgn (t
) == -1)
7009 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7010 "%<priority%> value must be non-negative");
7011 t
= integer_one_node
;
7013 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7015 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7019 case OMP_CLAUSE_HINT
:
7020 t
= OMP_CLAUSE_HINT_EXPR (c
);
7021 if (t
== error_mark_node
)
7023 else if (!type_dependent_expression_p (t
)
7024 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7026 error ("%<num_tasks%> expression must be integral");
7031 t
= mark_rvalue_use (t
);
7032 if (!processing_template_decl
)
7034 t
= maybe_constant_value (t
);
7035 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7037 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7041 case OMP_CLAUSE_IS_DEVICE_PTR
:
7042 case OMP_CLAUSE_USE_DEVICE_PTR
:
7043 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7044 t
= OMP_CLAUSE_DECL (c
);
7045 if (!type_dependent_expression_p (t
))
7047 tree type
= TREE_TYPE (t
);
7048 if (!TYPE_PTR_P (type
)
7049 && TREE_CODE (type
) != ARRAY_TYPE
7050 && (!TYPE_REF_P (type
)
7051 || (!TYPE_PTR_P (TREE_TYPE (type
))
7052 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
7054 error_at (OMP_CLAUSE_LOCATION (c
),
7055 "%qs variable is neither a pointer, nor an array "
7056 "nor reference to pointer or array",
7057 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7061 goto check_dup_generic
;
7063 case OMP_CLAUSE_NOWAIT
:
7064 case OMP_CLAUSE_DEFAULT
:
7065 case OMP_CLAUSE_UNTIED
:
7066 case OMP_CLAUSE_COLLAPSE
:
7067 case OMP_CLAUSE_MERGEABLE
:
7068 case OMP_CLAUSE_PARALLEL
:
7069 case OMP_CLAUSE_FOR
:
7070 case OMP_CLAUSE_SECTIONS
:
7071 case OMP_CLAUSE_TASKGROUP
:
7072 case OMP_CLAUSE_PROC_BIND
:
7073 case OMP_CLAUSE_NOGROUP
:
7074 case OMP_CLAUSE_THREADS
:
7075 case OMP_CLAUSE_SIMD
:
7076 case OMP_CLAUSE_DEFAULTMAP
:
7077 case OMP_CLAUSE_AUTO
:
7078 case OMP_CLAUSE_INDEPENDENT
:
7079 case OMP_CLAUSE_SEQ
:
7082 case OMP_CLAUSE_TILE
:
7083 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7084 list
= TREE_CHAIN (list
))
7086 t
= TREE_VALUE (list
);
7088 if (t
== error_mark_node
)
7090 else if (!type_dependent_expression_p (t
)
7091 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7093 error_at (OMP_CLAUSE_LOCATION (c
),
7094 "%<tile%> argument needs integral type");
7099 t
= mark_rvalue_use (t
);
7100 if (!processing_template_decl
)
7102 /* Zero is used to indicate '*', we permit you
7103 to get there via an ICE of value zero. */
7104 t
= maybe_constant_value (t
);
7105 if (!tree_fits_shwi_p (t
)
7106 || tree_to_shwi (t
) < 0)
7108 error_at (OMP_CLAUSE_LOCATION (c
),
7109 "%<tile%> argument needs positive "
7110 "integral constant");
7113 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7117 /* Update list item. */
7118 TREE_VALUE (list
) = t
;
7122 case OMP_CLAUSE_ORDERED
:
7123 ordered_seen
= true;
7126 case OMP_CLAUSE_INBRANCH
:
7127 case OMP_CLAUSE_NOTINBRANCH
:
7130 error ("%<inbranch%> clause is incompatible with "
7142 *pc
= OMP_CLAUSE_CHAIN (c
);
7144 pc
= &OMP_CLAUSE_CHAIN (c
);
7147 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7149 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7150 bool remove
= false;
7151 bool need_complete_type
= false;
7152 bool need_default_ctor
= false;
7153 bool need_copy_ctor
= false;
7154 bool need_copy_assignment
= false;
7155 bool need_implicitly_determined
= false;
7156 bool need_dtor
= false;
7157 tree type
, inner_type
;
7161 case OMP_CLAUSE_SHARED
:
7162 need_implicitly_determined
= true;
7164 case OMP_CLAUSE_PRIVATE
:
7165 need_complete_type
= true;
7166 need_default_ctor
= true;
7168 need_implicitly_determined
= true;
7170 case OMP_CLAUSE_FIRSTPRIVATE
:
7171 need_complete_type
= true;
7172 need_copy_ctor
= true;
7174 need_implicitly_determined
= true;
7176 case OMP_CLAUSE_LASTPRIVATE
:
7177 need_complete_type
= true;
7178 need_copy_assignment
= true;
7179 need_implicitly_determined
= true;
7181 case OMP_CLAUSE_REDUCTION
:
7182 need_implicitly_determined
= true;
7184 case OMP_CLAUSE_LINEAR
:
7185 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7186 need_implicitly_determined
= true;
7187 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7188 && !bitmap_bit_p (&map_head
,
7189 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7191 error_at (OMP_CLAUSE_LOCATION (c
),
7192 "%<linear%> clause step is a parameter %qD not "
7193 "specified in %<uniform%> clause",
7194 OMP_CLAUSE_LINEAR_STEP (c
));
7195 *pc
= OMP_CLAUSE_CHAIN (c
);
7199 case OMP_CLAUSE_COPYPRIVATE
:
7200 need_copy_assignment
= true;
7202 case OMP_CLAUSE_COPYIN
:
7203 need_copy_assignment
= true;
7205 case OMP_CLAUSE_SIMDLEN
:
7207 && !processing_template_decl
7208 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7209 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7211 error_at (OMP_CLAUSE_LOCATION (c
),
7212 "%<simdlen%> clause value is bigger than "
7213 "%<safelen%> clause value");
7214 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7215 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7217 pc
= &OMP_CLAUSE_CHAIN (c
);
7219 case OMP_CLAUSE_SCHEDULE
:
7221 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7222 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7224 error_at (OMP_CLAUSE_LOCATION (c
),
7225 "%<nonmonotonic%> schedule modifier specified "
7226 "together with %<ordered%> clause");
7227 OMP_CLAUSE_SCHEDULE_KIND (c
)
7228 = (enum omp_clause_schedule_kind
)
7229 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7230 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7232 pc
= &OMP_CLAUSE_CHAIN (c
);
7234 case OMP_CLAUSE_NOWAIT
:
7235 if (copyprivate_seen
)
7237 error_at (OMP_CLAUSE_LOCATION (c
),
7238 "%<nowait%> clause must not be used together "
7239 "with %<copyprivate%>");
7240 *pc
= OMP_CLAUSE_CHAIN (c
);
7245 pc
= &OMP_CLAUSE_CHAIN (c
);
7249 t
= OMP_CLAUSE_DECL (c
);
7250 if (processing_template_decl
7251 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7253 pc
= &OMP_CLAUSE_CHAIN (c
);
7259 case OMP_CLAUSE_LASTPRIVATE
:
7260 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7262 need_default_ctor
= true;
7267 case OMP_CLAUSE_REDUCTION
:
7268 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7272 t
= OMP_CLAUSE_DECL (c
);
7275 case OMP_CLAUSE_COPYIN
:
7276 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7278 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
7287 if (need_complete_type
|| need_copy_assignment
)
7289 t
= require_complete_type (t
);
7290 if (t
== error_mark_node
)
7292 else if (TYPE_REF_P (TREE_TYPE (t
))
7293 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7296 if (need_implicitly_determined
)
7298 const char *share_name
= NULL
;
7300 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7301 share_name
= "threadprivate";
7302 else switch (cxx_omp_predetermined_sharing_1 (t
))
7304 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7306 case OMP_CLAUSE_DEFAULT_SHARED
:
7307 /* const vars may be specified in firstprivate clause. */
7308 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7309 && cxx_omp_const_qual_no_mutable (t
))
7311 share_name
= "shared";
7313 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7314 share_name
= "private";
7321 error ("%qE is predetermined %qs for %qs",
7322 omp_clause_printable_decl (t
), share_name
,
7323 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7328 /* We're interested in the base element, not arrays. */
7329 inner_type
= type
= TREE_TYPE (t
);
7330 if ((need_complete_type
7331 || need_copy_assignment
7332 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
7333 && TYPE_REF_P (inner_type
))
7334 inner_type
= TREE_TYPE (inner_type
);
7335 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7336 inner_type
= TREE_TYPE (inner_type
);
7338 /* Check for special function availability by building a call to one.
7339 Save the results, because later we won't be in the right context
7340 for making these queries. */
7341 if (CLASS_TYPE_P (inner_type
)
7342 && COMPLETE_TYPE_P (inner_type
)
7343 && (need_default_ctor
|| need_copy_ctor
7344 || need_copy_assignment
|| need_dtor
)
7345 && !type_dependent_expression_p (t
)
7346 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7347 need_copy_ctor
, need_copy_assignment
,
7352 && c_kind
== OMP_CLAUSE_SHARED
7353 && processing_template_decl
)
7355 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7357 OMP_CLAUSE_DECL (c
) = t
;
7361 *pc
= OMP_CLAUSE_CHAIN (c
);
7363 pc
= &OMP_CLAUSE_CHAIN (c
);
7366 bitmap_obstack_release (NULL
);
7370 /* Start processing OpenMP clauses that can include any
7371 privatization clauses for non-static data members. */
7374 push_omp_privatization_clauses (bool ignore_next
)
7376 if (omp_private_member_ignore_next
)
7378 omp_private_member_ignore_next
= ignore_next
;
7381 omp_private_member_ignore_next
= ignore_next
;
7382 if (omp_private_member_map
)
7383 omp_private_member_vec
.safe_push (error_mark_node
);
7384 return push_stmt_list ();
7387 /* Revert remapping of any non-static data members since
7388 the last push_omp_privatization_clauses () call. */
7391 pop_omp_privatization_clauses (tree stmt
)
7393 if (stmt
== NULL_TREE
)
7395 stmt
= pop_stmt_list (stmt
);
7396 if (omp_private_member_map
)
7398 while (!omp_private_member_vec
.is_empty ())
7400 tree t
= omp_private_member_vec
.pop ();
7401 if (t
== error_mark_node
)
7406 bool no_decl_expr
= t
== integer_zero_node
;
7408 t
= omp_private_member_vec
.pop ();
7409 tree
*v
= omp_private_member_map
->get (t
);
7413 omp_private_member_map
->remove (t
);
7415 delete omp_private_member_map
;
7416 omp_private_member_map
= NULL
;
7421 /* Remember OpenMP privatization clauses mapping and clear it.
7422 Used for lambdas. */
7425 save_omp_privatization_clauses (vec
<tree
> &save
)
7428 if (omp_private_member_ignore_next
)
7429 save
.safe_push (integer_one_node
);
7430 omp_private_member_ignore_next
= false;
7431 if (!omp_private_member_map
)
7434 while (!omp_private_member_vec
.is_empty ())
7436 tree t
= omp_private_member_vec
.pop ();
7437 if (t
== error_mark_node
)
7443 if (t
== integer_zero_node
)
7444 t
= omp_private_member_vec
.pop ();
7445 tree
*v
= omp_private_member_map
->get (t
);
7447 save
.safe_push (*v
);
7452 delete omp_private_member_map
;
7453 omp_private_member_map
= NULL
;
7456 /* Restore OpenMP privatization clauses mapping saved by the
7460 restore_omp_privatization_clauses (vec
<tree
> &save
)
7462 gcc_assert (omp_private_member_vec
.is_empty ());
7463 omp_private_member_ignore_next
= false;
7464 if (save
.is_empty ())
7466 if (save
.length () == 1 && save
[0] == integer_one_node
)
7468 omp_private_member_ignore_next
= true;
7473 omp_private_member_map
= new hash_map
<tree
, tree
>;
7474 while (!save
.is_empty ())
7476 tree t
= save
.pop ();
7478 if (t
!= error_mark_node
)
7480 if (t
== integer_one_node
)
7482 omp_private_member_ignore_next
= true;
7483 gcc_assert (save
.is_empty ());
7486 if (t
== integer_zero_node
)
7488 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7491 omp_private_member_vec
.safe_push (t
);
7493 omp_private_member_vec
.safe_push (n
);
7498 /* For all variables in the tree_list VARS, mark them as thread local. */
7501 finish_omp_threadprivate (tree vars
)
7505 /* Mark every variable in VARS to be assigned thread local storage. */
7506 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7508 tree v
= TREE_PURPOSE (t
);
7510 if (error_operand_p (v
))
7512 else if (!VAR_P (v
))
7513 error ("%<threadprivate%> %qD is not file, namespace "
7514 "or block scope variable", v
);
7515 /* If V had already been marked threadprivate, it doesn't matter
7516 whether it had been used prior to this point. */
7517 else if (TREE_USED (v
)
7518 && (DECL_LANG_SPECIFIC (v
) == NULL
7519 || !CP_DECL_THREADPRIVATE_P (v
)))
7520 error ("%qE declared %<threadprivate%> after first use", v
);
7521 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7522 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7523 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7524 error ("%<threadprivate%> %qE has incomplete type", v
);
7525 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7526 && CP_DECL_CONTEXT (v
) != current_class_type
)
7527 error ("%<threadprivate%> %qE directive not "
7528 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7531 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7532 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7534 retrofit_lang_decl (v
);
7536 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
7537 after the allocation of the lang_decl structure. */
7538 if (DECL_DISCRIMINATOR_P (v
))
7539 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
7542 if (! CP_DECL_THREAD_LOCAL_P (v
))
7544 CP_DECL_THREAD_LOCAL_P (v
) = true;
7545 set_decl_tls_model (v
, decl_default_tls_model (v
));
7546 /* If rtl has been already set for this var, call
7547 make_decl_rtl once again, so that encode_section_info
7548 has a chance to look at the new decl flags. */
7549 if (DECL_RTL_SET_P (v
))
7552 CP_DECL_THREADPRIVATE_P (v
) = 1;
7557 /* Build an OpenMP structured block. */
7560 begin_omp_structured_block (void)
7562 return do_pushlevel (sk_omp
);
7566 finish_omp_structured_block (tree block
)
7568 return do_poplevel (block
);
7571 /* Similarly, except force the retention of the BLOCK. */
7574 begin_omp_parallel (void)
7576 keep_next_level (true);
7577 return begin_omp_structured_block ();
7580 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7584 finish_oacc_data (tree clauses
, tree block
)
7588 block
= finish_omp_structured_block (block
);
7590 stmt
= make_node (OACC_DATA
);
7591 TREE_TYPE (stmt
) = void_type_node
;
7592 OACC_DATA_CLAUSES (stmt
) = clauses
;
7593 OACC_DATA_BODY (stmt
) = block
;
7595 return add_stmt (stmt
);
7598 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
7602 finish_oacc_host_data (tree clauses
, tree block
)
7606 block
= finish_omp_structured_block (block
);
7608 stmt
= make_node (OACC_HOST_DATA
);
7609 TREE_TYPE (stmt
) = void_type_node
;
7610 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
7611 OACC_HOST_DATA_BODY (stmt
) = block
;
7613 return add_stmt (stmt
);
7616 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
7620 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
7622 body
= finish_omp_structured_block (body
);
7624 tree stmt
= make_node (code
);
7625 TREE_TYPE (stmt
) = void_type_node
;
7626 OMP_BODY (stmt
) = body
;
7627 OMP_CLAUSES (stmt
) = clauses
;
7629 return add_stmt (stmt
);
7633 finish_omp_parallel (tree clauses
, tree body
)
7637 body
= finish_omp_structured_block (body
);
7639 stmt
= make_node (OMP_PARALLEL
);
7640 TREE_TYPE (stmt
) = void_type_node
;
7641 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
7642 OMP_PARALLEL_BODY (stmt
) = body
;
7644 return add_stmt (stmt
);
7648 begin_omp_task (void)
7650 keep_next_level (true);
7651 return begin_omp_structured_block ();
7655 finish_omp_task (tree clauses
, tree body
)
7659 body
= finish_omp_structured_block (body
);
7661 stmt
= make_node (OMP_TASK
);
7662 TREE_TYPE (stmt
) = void_type_node
;
7663 OMP_TASK_CLAUSES (stmt
) = clauses
;
7664 OMP_TASK_BODY (stmt
) = body
;
7666 return add_stmt (stmt
);
7669 /* Helper function for finish_omp_for. Convert Ith random access iterator
7670 into integral iterator. Return FALSE if successful. */
7673 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
7674 tree declv
, tree orig_declv
, tree initv
,
7675 tree condv
, tree incrv
, tree
*body
,
7676 tree
*pre_body
, tree
&clauses
, tree
*lastp
,
7677 int collapse
, int ordered
)
7679 tree diff
, iter_init
, iter_incr
= NULL
, last
;
7680 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
7681 tree decl
= TREE_VEC_ELT (declv
, i
);
7682 tree init
= TREE_VEC_ELT (initv
, i
);
7683 tree cond
= TREE_VEC_ELT (condv
, i
);
7684 tree incr
= TREE_VEC_ELT (incrv
, i
);
7686 location_t elocus
= locus
;
7688 if (init
&& EXPR_HAS_LOCATION (init
))
7689 elocus
= EXPR_LOCATION (init
);
7691 cond
= cp_fully_fold (cond
);
7692 switch (TREE_CODE (cond
))
7699 if (TREE_OPERAND (cond
, 1) == iter
)
7700 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
7701 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
7702 if (TREE_OPERAND (cond
, 0) != iter
)
7703 cond
= error_mark_node
;
7706 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
7709 TREE_OPERAND (cond
, 1), ERROR_MARK
,
7710 NULL
, tf_warning_or_error
);
7711 if (error_operand_p (tem
))
7716 cond
= error_mark_node
;
7719 if (cond
== error_mark_node
)
7721 error_at (elocus
, "invalid controlling predicate");
7724 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
7725 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
7726 tf_warning_or_error
);
7727 diff
= cp_fully_fold (diff
);
7728 if (error_operand_p (diff
))
7730 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
7732 error_at (elocus
, "difference between %qE and %qD does not have integer type",
7733 TREE_OPERAND (cond
, 1), iter
);
7736 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
7737 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
7738 cond
, cp_walk_subtrees
))
7741 switch (TREE_CODE (incr
))
7743 case PREINCREMENT_EXPR
:
7744 case PREDECREMENT_EXPR
:
7745 case POSTINCREMENT_EXPR
:
7746 case POSTDECREMENT_EXPR
:
7747 if (TREE_OPERAND (incr
, 0) != iter
)
7749 incr
= error_mark_node
;
7752 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
7753 TREE_CODE (incr
), iter
,
7754 tf_warning_or_error
);
7755 if (error_operand_p (iter_incr
))
7757 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
7758 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
7759 incr
= integer_one_node
;
7761 incr
= integer_minus_one_node
;
7764 if (TREE_OPERAND (incr
, 0) != iter
)
7765 incr
= error_mark_node
;
7766 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
7767 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
7769 tree rhs
= TREE_OPERAND (incr
, 1);
7770 if (TREE_OPERAND (rhs
, 0) == iter
)
7772 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
7774 incr
= error_mark_node
;
7777 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7778 iter
, TREE_CODE (rhs
),
7779 TREE_OPERAND (rhs
, 1),
7780 tf_warning_or_error
);
7781 if (error_operand_p (iter_incr
))
7783 incr
= TREE_OPERAND (rhs
, 1);
7784 incr
= cp_convert (TREE_TYPE (diff
), incr
,
7785 tf_warning_or_error
);
7786 if (TREE_CODE (rhs
) == MINUS_EXPR
)
7788 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
7789 incr
= fold_simple (incr
);
7791 if (TREE_CODE (incr
) != INTEGER_CST
7792 && (TREE_CODE (incr
) != NOP_EXPR
7793 || (TREE_CODE (TREE_OPERAND (incr
, 0))
7798 else if (TREE_OPERAND (rhs
, 1) == iter
)
7800 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
7801 || TREE_CODE (rhs
) != PLUS_EXPR
)
7802 incr
= error_mark_node
;
7805 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
7807 TREE_OPERAND (rhs
, 0),
7810 tf_warning_or_error
);
7811 if (error_operand_p (iter_incr
))
7813 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7816 tf_warning_or_error
);
7817 if (error_operand_p (iter_incr
))
7819 incr
= TREE_OPERAND (rhs
, 0);
7824 incr
= error_mark_node
;
7827 incr
= error_mark_node
;
7830 incr
= error_mark_node
;
7834 if (incr
== error_mark_node
)
7836 error_at (elocus
, "invalid increment expression");
7840 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
7841 bool taskloop_iv_seen
= false;
7842 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
7843 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
7844 && OMP_CLAUSE_DECL (c
) == iter
)
7846 if (code
== OMP_TASKLOOP
)
7848 taskloop_iv_seen
= true;
7849 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
7853 else if (code
== OMP_TASKLOOP
7854 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
7855 && OMP_CLAUSE_DECL (c
) == iter
)
7857 taskloop_iv_seen
= true;
7858 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
7861 decl
= create_temporary_var (TREE_TYPE (diff
));
7863 add_decl_expr (decl
);
7864 last
= create_temporary_var (TREE_TYPE (diff
));
7866 add_decl_expr (last
);
7867 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
7868 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7870 incr_var
= create_temporary_var (TREE_TYPE (diff
));
7871 pushdecl (incr_var
);
7872 add_decl_expr (incr_var
);
7874 gcc_assert (stmts_are_full_exprs_p ());
7875 tree diffvar
= NULL_TREE
;
7876 if (code
== OMP_TASKLOOP
)
7878 if (!taskloop_iv_seen
)
7880 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7881 OMP_CLAUSE_DECL (ivc
) = iter
;
7882 cxx_omp_finish_clause (ivc
, NULL
);
7883 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
7886 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7887 OMP_CLAUSE_DECL (lvc
) = last
;
7888 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
7890 diffvar
= create_temporary_var (TREE_TYPE (diff
));
7892 add_decl_expr (diffvar
);
7895 orig_pre_body
= *pre_body
;
7896 *pre_body
= push_stmt_list ();
7898 add_stmt (orig_pre_body
);
7900 finish_expr_stmt (build_x_modify_expr (elocus
,
7901 iter
, NOP_EXPR
, init
,
7902 tf_warning_or_error
));
7903 init
= build_int_cst (TREE_TYPE (diff
), 0);
7904 if (c
&& iter_incr
== NULL
7905 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7909 finish_expr_stmt (build_x_modify_expr (elocus
,
7911 incr
, tf_warning_or_error
));
7914 iter_incr
= build_x_modify_expr (elocus
,
7915 iter
, PLUS_EXPR
, incr
,
7916 tf_warning_or_error
);
7918 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
7920 finish_expr_stmt (build_x_modify_expr (elocus
,
7921 last
, NOP_EXPR
, init
,
7922 tf_warning_or_error
));
7925 finish_expr_stmt (build_x_modify_expr (elocus
,
7927 diff
, tf_warning_or_error
));
7930 *pre_body
= pop_stmt_list (*pre_body
);
7932 cond
= cp_build_binary_op (elocus
,
7933 TREE_CODE (cond
), decl
, diff
,
7934 tf_warning_or_error
);
7935 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
7936 elocus
, incr
, NULL_TREE
);
7939 *body
= push_stmt_list ();
7940 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
7941 iter_init
= build_x_modify_expr (elocus
,
7942 iter
, PLUS_EXPR
, iter_init
,
7943 tf_warning_or_error
);
7944 if (iter_init
!= error_mark_node
)
7945 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7946 finish_expr_stmt (iter_init
);
7947 finish_expr_stmt (build_x_modify_expr (elocus
,
7948 last
, NOP_EXPR
, decl
,
7949 tf_warning_or_error
));
7950 add_stmt (orig_body
);
7951 *body
= pop_stmt_list (*body
);
7955 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
7957 finish_expr_stmt (iter_incr
);
7961 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
7962 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
7963 iter_init
, iter_incr
);
7964 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
7965 iter_init
= build_x_modify_expr (elocus
,
7966 iter
, PLUS_EXPR
, iter_init
,
7967 tf_warning_or_error
);
7968 if (iter_init
!= error_mark_node
)
7969 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7970 finish_expr_stmt (iter_init
);
7972 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
7973 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
7976 TREE_VEC_ELT (declv
, i
) = decl
;
7977 TREE_VEC_ELT (initv
, i
) = init
;
7978 TREE_VEC_ELT (condv
, i
) = cond
;
7979 TREE_VEC_ELT (incrv
, i
) = incr
;
7985 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
7986 are directly for their associated operands in the statement. DECL
7987 and INIT are a combo; if DECL is NULL then INIT ought to be a
7988 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
7989 optional statements that need to go before the loop into its
7993 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
7994 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
7995 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
7997 tree omp_for
= NULL
, orig_incr
= NULL
;
7998 tree decl
= NULL
, init
, cond
, incr
;
7999 tree last
= NULL_TREE
;
8005 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8006 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8007 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8008 if (TREE_VEC_LENGTH (declv
) > 1)
8012 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8014 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8017 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8019 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8020 if (collapse
!= TREE_VEC_LENGTH (declv
))
8021 ordered
= TREE_VEC_LENGTH (declv
);
8024 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8026 decl
= TREE_VEC_ELT (declv
, i
);
8027 init
= TREE_VEC_ELT (initv
, i
);
8028 cond
= TREE_VEC_ELT (condv
, i
);
8029 incr
= TREE_VEC_ELT (incrv
, i
);
8035 switch (TREE_CODE (init
))
8038 decl
= TREE_OPERAND (init
, 0);
8039 init
= TREE_OPERAND (init
, 1);
8042 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8044 decl
= TREE_OPERAND (init
, 0);
8045 init
= TREE_OPERAND (init
, 2);
8055 "expected iteration declaration or initialization");
8060 if (init
&& EXPR_HAS_LOCATION (init
))
8061 elocus
= EXPR_LOCATION (init
);
8065 error_at (elocus
, "missing controlling predicate");
8071 error_at (elocus
, "missing increment expression");
8075 TREE_VEC_ELT (declv
, i
) = decl
;
8076 TREE_VEC_ELT (initv
, i
) = init
;
8083 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8085 && !c_omp_check_loop_iv_exprs (locus
, declv
,
8086 TREE_VEC_ELT (declv
, i
), orig_init
,
8087 NULL_TREE
, cp_walk_subtrees
))
8093 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8097 stmt
= make_node (code
);
8099 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8101 /* This is really just a place-holder. We'll be decomposing this
8102 again and going through the cp_build_modify_expr path below when
8103 we instantiate the thing. */
8104 TREE_VEC_ELT (initv
, i
)
8105 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8106 TREE_VEC_ELT (initv
, i
));
8109 TREE_TYPE (stmt
) = void_type_node
;
8110 OMP_FOR_INIT (stmt
) = initv
;
8111 OMP_FOR_COND (stmt
) = condv
;
8112 OMP_FOR_INCR (stmt
) = incrv
;
8113 OMP_FOR_BODY (stmt
) = body
;
8114 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8115 OMP_FOR_CLAUSES (stmt
) = clauses
;
8117 SET_EXPR_LOCATION (stmt
, locus
);
8118 return add_stmt (stmt
);
8122 orig_declv
= copy_node (declv
);
8124 if (processing_template_decl
)
8125 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8127 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8129 decl
= TREE_VEC_ELT (declv
, i
);
8130 init
= TREE_VEC_ELT (initv
, i
);
8131 cond
= TREE_VEC_ELT (condv
, i
);
8132 incr
= TREE_VEC_ELT (incrv
, i
);
8134 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8137 if (init
&& EXPR_HAS_LOCATION (init
))
8138 elocus
= EXPR_LOCATION (init
);
8142 error_at (elocus
, "expected iteration declaration or initialization");
8146 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8149 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8150 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8151 TREE_CODE (TREE_OPERAND (incr
, 1)),
8152 TREE_OPERAND (incr
, 2),
8153 tf_warning_or_error
);
8156 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8158 if (code
== OMP_SIMD
)
8160 error_at (elocus
, "%<#pragma omp simd%> used with class "
8161 "iteration variable %qE", decl
);
8164 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8165 initv
, condv
, incrv
, &body
,
8166 &pre_body
, clauses
, &last
,
8172 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8173 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8175 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8179 if (!processing_template_decl
)
8181 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8182 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8183 tf_warning_or_error
);
8186 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8188 && TREE_SIDE_EFFECTS (cond
)
8189 && COMPARISON_CLASS_P (cond
)
8190 && !processing_template_decl
)
8192 tree t
= TREE_OPERAND (cond
, 0);
8193 if (TREE_SIDE_EFFECTS (t
)
8195 && (TREE_CODE (t
) != NOP_EXPR
8196 || TREE_OPERAND (t
, 0) != decl
))
8197 TREE_OPERAND (cond
, 0)
8198 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8200 t
= TREE_OPERAND (cond
, 1);
8201 if (TREE_SIDE_EFFECTS (t
)
8203 && (TREE_CODE (t
) != NOP_EXPR
8204 || TREE_OPERAND (t
, 0) != decl
))
8205 TREE_OPERAND (cond
, 1)
8206 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8208 if (decl
== error_mark_node
|| init
== error_mark_node
)
8211 TREE_VEC_ELT (declv
, i
) = decl
;
8212 TREE_VEC_ELT (initv
, i
) = init
;
8213 TREE_VEC_ELT (condv
, i
) = cond
;
8214 TREE_VEC_ELT (incrv
, i
) = incr
;
8218 if (IS_EMPTY_STMT (pre_body
))
8221 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8222 incrv
, body
, pre_body
);
8224 /* Check for iterators appearing in lb, b or incr expressions. */
8225 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8226 omp_for
= NULL_TREE
;
8228 if (omp_for
== NULL
)
8235 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8237 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8238 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8240 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8243 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8244 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8245 && !processing_template_decl
)
8247 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8248 if (TREE_SIDE_EFFECTS (t
)
8250 && (TREE_CODE (t
) != NOP_EXPR
8251 || TREE_OPERAND (t
, 0) != decl
))
8252 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8253 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8255 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8256 if (TREE_SIDE_EFFECTS (t
)
8258 && (TREE_CODE (t
) != NOP_EXPR
8259 || TREE_OPERAND (t
, 0) != decl
))
8260 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8261 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8265 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8267 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8269 /* For simd loops with non-static data member iterators, we could have added
8270 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8271 step at this point, fill it in. */
8272 if (code
== OMP_SIMD
&& !processing_template_decl
8273 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8274 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8275 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8276 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8278 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8279 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8280 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8282 switch (TREE_CODE (incr
))
8284 case PREINCREMENT_EXPR
:
8285 case POSTINCREMENT_EXPR
:
8286 /* c_omp_for_incr_canonicalize_ptr() should have been
8287 called to massage things appropriately. */
8288 gcc_assert (!INDIRECT_TYPE_P (TREE_TYPE (decl
)));
8289 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8291 case PREDECREMENT_EXPR
:
8292 case POSTDECREMENT_EXPR
:
8293 /* c_omp_for_incr_canonicalize_ptr() should have been
8294 called to massage things appropriately. */
8295 gcc_assert (!INDIRECT_TYPE_P (TREE_TYPE (decl
)));
8296 OMP_CLAUSE_LINEAR_STEP (c
)
8297 = build_int_cst (TREE_TYPE (decl
), -1);
8300 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8301 incr
= TREE_OPERAND (incr
, 1);
8302 switch (TREE_CODE (incr
))
8305 if (TREE_OPERAND (incr
, 1) == decl
)
8306 step
= TREE_OPERAND (incr
, 0);
8308 step
= TREE_OPERAND (incr
, 1);
8311 case POINTER_PLUS_EXPR
:
8312 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8313 step
= TREE_OPERAND (incr
, 1);
8318 stept
= TREE_TYPE (decl
);
8319 if (INDIRECT_TYPE_P (stept
))
8321 step
= fold_convert (stept
, step
);
8322 if (TREE_CODE (incr
) == MINUS_EXPR
)
8323 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8324 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8335 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
8336 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
8351 dependent_p
= false;
8354 /* Even in a template, we can detect invalid uses of the atomic
8355 pragma if neither LHS nor RHS is type-dependent. */
8356 if (processing_template_decl
)
8358 dependent_p
= (type_dependent_expression_p (lhs
)
8359 || (rhs
&& type_dependent_expression_p (rhs
))
8360 || (v
&& type_dependent_expression_p (v
))
8361 || (lhs1
&& type_dependent_expression_p (lhs1
))
8362 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8365 lhs
= build_non_dependent_expr (lhs
);
8367 rhs
= build_non_dependent_expr (rhs
);
8369 v
= build_non_dependent_expr (v
);
8371 lhs1
= build_non_dependent_expr (lhs1
);
8373 rhs1
= build_non_dependent_expr (rhs1
);
8378 bool swapped
= false;
8379 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8381 std::swap (rhs
, rhs1
);
8382 swapped
= !commutative_tree_code (opcode
);
8384 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8386 if (code
== OMP_ATOMIC
)
8387 error ("%<#pragma omp atomic update%> uses two different "
8388 "expressions for memory");
8390 error ("%<#pragma omp atomic capture%> uses two different "
8391 "expressions for memory");
8394 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8396 if (code
== OMP_ATOMIC
)
8397 error ("%<#pragma omp atomic update%> uses two different "
8398 "expressions for memory");
8400 error ("%<#pragma omp atomic capture%> uses two different "
8401 "expressions for memory");
8404 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
8405 v
, lhs1
, rhs1
, swapped
, seq_cst
,
8406 processing_template_decl
!= 0);
8407 if (stmt
== error_mark_node
)
8410 if (processing_template_decl
)
8412 if (code
== OMP_ATOMIC_READ
)
8414 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
8415 OMP_ATOMIC_READ
, orig_lhs
);
8416 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8417 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8421 if (opcode
== NOP_EXPR
)
8422 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8424 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8426 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8427 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8428 if (code
!= OMP_ATOMIC
)
8430 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
8431 code
, orig_lhs1
, stmt
);
8432 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8433 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8436 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
8437 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8439 finish_expr_stmt (stmt
);
8443 finish_omp_barrier (void)
8445 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
8446 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8447 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8448 release_tree_vector (vec
);
8449 finish_expr_stmt (stmt
);
8453 finish_omp_flush (void)
8455 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8456 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8457 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8458 release_tree_vector (vec
);
8459 finish_expr_stmt (stmt
);
8463 finish_omp_taskwait (void)
8465 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8466 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8467 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8468 release_tree_vector (vec
);
8469 finish_expr_stmt (stmt
);
8473 finish_omp_taskyield (void)
8475 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8476 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8477 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8478 release_tree_vector (vec
);
8479 finish_expr_stmt (stmt
);
8483 finish_omp_cancel (tree clauses
)
8485 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
8487 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8489 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8491 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8493 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8497 error ("%<#pragma omp cancel%> must specify one of "
8498 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8501 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8502 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
8503 if (ifc
!= NULL_TREE
)
8505 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
8506 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
8507 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
8508 build_zero_cst (type
));
8511 ifc
= boolean_true_node
;
8512 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
8513 vec
->quick_push (ifc
);
8514 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8515 release_tree_vector (vec
);
8516 finish_expr_stmt (stmt
);
8520 finish_omp_cancellation_point (tree clauses
)
8522 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
8524 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8526 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8528 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8530 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8534 error ("%<#pragma omp cancellation point%> must specify one of "
8535 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8538 vec
<tree
, va_gc
> *vec
8539 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
8540 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8541 release_tree_vector (vec
);
8542 finish_expr_stmt (stmt
);
8545 /* Begin a __transaction_atomic or __transaction_relaxed statement.
8546 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
8547 should create an extra compound stmt. */
8550 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
8555 *pcompound
= begin_compound_stmt (0);
8557 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
8559 /* Only add the statement to the function if support enabled. */
8563 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
8564 ? G_("%<__transaction_relaxed%> without "
8565 "transactional memory support enabled")
8566 : G_("%<__transaction_atomic%> without "
8567 "transactional memory support enabled")));
8569 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
8570 TREE_SIDE_EFFECTS (r
) = 1;
8574 /* End a __transaction_atomic or __transaction_relaxed statement.
8575 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
8576 and we should end the compound. If NOEX is non-NULL, we wrap the body in
8577 a MUST_NOT_THROW_EXPR with NOEX as condition. */
8580 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
8582 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
8583 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
8584 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
8585 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
8587 /* noexcept specifications are not allowed for function transactions. */
8588 gcc_assert (!(noex
&& compound_stmt
));
8591 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
8593 protected_set_expr_location
8594 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
8595 TREE_SIDE_EFFECTS (body
) = 1;
8596 TRANSACTION_EXPR_BODY (stmt
) = body
;
8600 finish_compound_stmt (compound_stmt
);
8603 /* Build a __transaction_atomic or __transaction_relaxed expression. If
8604 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
8608 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
8613 expr
= build_must_not_throw_expr (expr
, noex
);
8614 protected_set_expr_location (expr
, loc
);
8615 TREE_SIDE_EFFECTS (expr
) = 1;
8617 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
8618 if (flags
& TM_STMT_ATTR_RELAXED
)
8619 TRANSACTION_EXPR_RELAXED (ret
) = 1;
8620 TREE_SIDE_EFFECTS (ret
) = 1;
8621 SET_EXPR_LOCATION (ret
, loc
);
8626 init_cp_semantics (void)
8630 /* Build a STATIC_ASSERT for a static assertion with the condition
8631 CONDITION and the message text MESSAGE. LOCATION is the location
8632 of the static assertion in the source code. When MEMBER_P, this
8633 static assertion is a member of a class. */
8635 finish_static_assert (tree condition
, tree message
, location_t location
,
8638 tsubst_flags_t complain
= tf_warning_or_error
;
8640 if (message
== NULL_TREE
8641 || message
== error_mark_node
8642 || condition
== NULL_TREE
8643 || condition
== error_mark_node
)
8646 if (check_for_bare_parameter_packs (condition
))
8647 condition
= error_mark_node
;
8649 if (instantiation_dependent_expression_p (condition
))
8651 /* We're in a template; build a STATIC_ASSERT and put it in
8655 assertion
= make_node (STATIC_ASSERT
);
8656 STATIC_ASSERT_CONDITION (assertion
) = condition
;
8657 STATIC_ASSERT_MESSAGE (assertion
) = message
;
8658 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
8661 maybe_add_class_template_decl_list (current_class_type
,
8665 add_stmt (assertion
);
8670 /* Fold the expression and convert it to a boolean value. */
8671 condition
= perform_implicit_conversion_flags (boolean_type_node
, condition
,
8672 complain
, LOOKUP_NORMAL
);
8673 condition
= fold_non_dependent_expr (condition
);
8675 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
8676 /* Do nothing; the condition is satisfied. */
8680 location_t saved_loc
= input_location
;
8682 input_location
= location
;
8683 if (TREE_CODE (condition
) == INTEGER_CST
8684 && integer_zerop (condition
))
8686 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
8687 (TREE_TYPE (TREE_TYPE (message
))));
8688 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
8689 /* Report the error. */
8691 error ("static assertion failed");
8693 error ("static assertion failed: %s",
8694 TREE_STRING_POINTER (message
));
8696 else if (condition
&& condition
!= error_mark_node
)
8698 error ("non-constant condition for static assertion");
8699 if (require_rvalue_constant_expression (condition
))
8700 cxx_constant_value (condition
);
8702 input_location
= saved_loc
;
8706 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
8707 suitable for use as a type-specifier.
8709 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
8710 id-expression or a class member access, FALSE when it was parsed as
8711 a full expression. */
8714 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
8715 tsubst_flags_t complain
)
8717 tree type
= NULL_TREE
;
8719 if (!expr
|| error_operand_p (expr
))
8720 return error_mark_node
;
8723 || TREE_CODE (expr
) == TYPE_DECL
8724 || (TREE_CODE (expr
) == BIT_NOT_EXPR
8725 && TYPE_P (TREE_OPERAND (expr
, 0))))
8727 if (complain
& tf_error
)
8728 error ("argument to decltype must be an expression");
8729 return error_mark_node
;
8732 /* Depending on the resolution of DR 1172, we may later need to distinguish
8733 instantiation-dependent but not type-dependent expressions so that, say,
8734 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
8735 if (instantiation_dependent_uneval_expression_p (expr
))
8737 type
= cxx_make_type (DECLTYPE_TYPE
);
8738 DECLTYPE_TYPE_EXPR (type
) = expr
;
8739 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
8740 = id_expression_or_member_access_p
;
8741 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8746 /* The type denoted by decltype(e) is defined as follows: */
8748 expr
= resolve_nondeduced_context (expr
, complain
);
8750 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
8751 return error_mark_node
;
8753 if (type_unknown_p (expr
))
8755 if (complain
& tf_error
)
8756 error ("decltype cannot resolve address of overloaded function");
8757 return error_mark_node
;
8760 /* To get the size of a static data member declared as an array of
8761 unknown bound, we need to instantiate it. */
8763 && VAR_HAD_UNKNOWN_BOUND (expr
)
8764 && DECL_TEMPLATE_INSTANTIATION (expr
))
8765 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
8767 if (id_expression_or_member_access_p
)
8769 /* If e is an id-expression or a class member access (5.2.5
8770 [expr.ref]), decltype(e) is defined as the type of the entity
8771 named by e. If there is no such entity, or e names a set of
8772 overloaded functions, the program is ill-formed. */
8773 if (identifier_p (expr
))
8774 expr
= lookup_name (expr
);
8776 if (INDIRECT_REF_P (expr
))
8777 /* This can happen when the expression is, e.g., "a.b". Just
8778 look at the underlying operand. */
8779 expr
= TREE_OPERAND (expr
, 0);
8781 if (TREE_CODE (expr
) == OFFSET_REF
8782 || TREE_CODE (expr
) == MEMBER_REF
8783 || TREE_CODE (expr
) == SCOPE_REF
)
8784 /* We're only interested in the field itself. If it is a
8785 BASELINK, we will need to see through it in the next
8787 expr
= TREE_OPERAND (expr
, 1);
8789 if (BASELINK_P (expr
))
8790 /* See through BASELINK nodes to the underlying function. */
8791 expr
= BASELINK_FUNCTIONS (expr
);
8793 /* decltype of a decomposition name drops references in the tuple case
8794 (unlike decltype of a normal variable) and keeps cv-qualifiers from
8795 the containing object in the other cases (unlike decltype of a member
8796 access expression). */
8797 if (DECL_DECOMPOSITION_P (expr
))
8799 if (DECL_HAS_VALUE_EXPR_P (expr
))
8800 /* Expr is an array or struct subobject proxy, handle
8801 bit-fields properly. */
8802 return unlowered_expr_type (expr
);
8804 /* Expr is a reference variable for the tuple case. */
8805 return lookup_decomp_type (expr
);
8808 switch (TREE_CODE (expr
))
8811 if (DECL_BIT_FIELD_TYPE (expr
))
8813 type
= DECL_BIT_FIELD_TYPE (expr
);
8816 /* Fall through for fields that aren't bitfields. */
8824 case TEMPLATE_PARM_INDEX
:
8825 expr
= mark_type_use (expr
);
8826 type
= TREE_TYPE (expr
);
8830 type
= error_mark_node
;
8835 mark_type_use (expr
);
8836 type
= is_bitfield_expr_with_lowered_type (expr
);
8838 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
8846 /* We can get here when the id-expression refers to an
8847 enumerator or non-type template parameter. */
8848 type
= TREE_TYPE (expr
);
8852 /* Handle instantiated template non-type arguments. */
8853 type
= TREE_TYPE (expr
);
8859 /* Within a lambda-expression:
8861 Every occurrence of decltype((x)) where x is a possibly
8862 parenthesized id-expression that names an entity of
8863 automatic storage duration is treated as if x were
8864 transformed into an access to a corresponding data member
8865 of the closure type that would have been declared if x
8866 were a use of the denoted entity. */
8867 if (outer_automatic_var_p (expr
)
8868 && current_function_decl
8869 && LAMBDA_FUNCTION_P (current_function_decl
))
8870 type
= capture_decltype (expr
);
8871 else if (error_operand_p (expr
))
8872 type
= error_mark_node
;
8873 else if (expr
== current_class_ptr
)
8874 /* If the expression is just "this", we want the
8875 cv-unqualified pointer for the "this" type. */
8876 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
8879 /* Otherwise, where T is the type of e, if e is an lvalue,
8880 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
8881 cp_lvalue_kind clk
= lvalue_kind (expr
);
8882 type
= unlowered_expr_type (expr
);
8883 gcc_assert (!TYPE_REF_P (type
));
8885 /* For vector types, pick a non-opaque variant. */
8886 if (VECTOR_TYPE_P (type
))
8887 type
= strip_typedefs (type
);
8889 if (clk
!= clk_none
&& !(clk
& clk_class
))
8890 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
8897 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
8898 __has_nothrow_copy, depending on assign_p. Returns true iff all
8899 the copy {ctor,assign} fns are nothrow. */
8902 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
8904 tree fns
= NULL_TREE
;
8906 if (assign_p
|| TYPE_HAS_COPY_CTOR (type
))
8907 fns
= get_class_binding (type
, assign_p
? assign_op_identifier
8910 bool saw_copy
= false;
8911 for (ovl_iterator
iter (fns
); iter
; ++iter
)
8915 if (copy_fn_p (fn
) > 0)
8918 maybe_instantiate_noexcept (fn
);
8919 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
8927 /* Actually evaluates the trait. */
8930 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
8932 enum tree_code type_code1
;
8935 type_code1
= TREE_CODE (type1
);
8939 case CPTK_HAS_NOTHROW_ASSIGN
:
8940 type1
= strip_array_types (type1
);
8941 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8942 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
8943 || (CLASS_TYPE_P (type1
)
8944 && classtype_has_nothrow_assign_or_copy_p (type1
,
8947 case CPTK_HAS_TRIVIAL_ASSIGN
:
8948 /* ??? The standard seems to be missing the "or array of such a class
8949 type" wording for this trait. */
8950 type1
= strip_array_types (type1
);
8951 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8952 && (trivial_type_p (type1
)
8953 || (CLASS_TYPE_P (type1
)
8954 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
8956 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
8957 type1
= strip_array_types (type1
);
8958 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
8959 || (CLASS_TYPE_P (type1
)
8960 && (t
= locate_ctor (type1
))
8961 && (maybe_instantiate_noexcept (t
),
8962 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
8964 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
8965 type1
= strip_array_types (type1
);
8966 return (trivial_type_p (type1
)
8967 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
8969 case CPTK_HAS_NOTHROW_COPY
:
8970 type1
= strip_array_types (type1
);
8971 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
8972 || (CLASS_TYPE_P (type1
)
8973 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
8975 case CPTK_HAS_TRIVIAL_COPY
:
8976 /* ??? The standard seems to be missing the "or array of such a class
8977 type" wording for this trait. */
8978 type1
= strip_array_types (type1
);
8979 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
8980 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
8982 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
8983 type1
= strip_array_types (type1
);
8984 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
8985 || (CLASS_TYPE_P (type1
)
8986 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
8988 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
8989 return type_has_virtual_destructor (type1
);
8991 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
8992 return type_has_unique_obj_representations (type1
);
8994 case CPTK_IS_ABSTRACT
:
8995 return ABSTRACT_CLASS_TYPE_P (type1
);
8997 case CPTK_IS_AGGREGATE
:
8998 return CP_AGGREGATE_TYPE_P (type1
);
9000 case CPTK_IS_BASE_OF
:
9001 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9002 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9003 || DERIVED_FROM_P (type1
, type2
)));
9006 return NON_UNION_CLASS_TYPE_P (type1
);
9009 return NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
);
9012 return type_code1
== ENUMERAL_TYPE
;
9015 return CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
);
9017 case CPTK_IS_LITERAL_TYPE
:
9018 return literal_type_p (type1
);
9021 return pod_type_p (type1
);
9023 case CPTK_IS_POLYMORPHIC
:
9024 return CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
);
9026 case CPTK_IS_SAME_AS
:
9027 return same_type_p (type1
, type2
);
9029 case CPTK_IS_STD_LAYOUT
:
9030 return std_layout_type_p (type1
);
9032 case CPTK_IS_TRIVIAL
:
9033 return trivial_type_p (type1
);
9035 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9036 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9038 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9039 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9041 case CPTK_IS_TRIVIALLY_COPYABLE
:
9042 return trivially_copyable_p (type1
);
9045 return type_code1
== UNION_TYPE
;
9047 case CPTK_IS_ASSIGNABLE
:
9048 return is_xible (MODIFY_EXPR
, type1
, type2
);
9050 case CPTK_IS_CONSTRUCTIBLE
:
9051 return is_xible (INIT_EXPR
, type1
, type2
);
9059 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9060 void, or a complete type, returns true, otherwise false. */
9063 check_trait_type (tree type
)
9065 if (type
== NULL_TREE
)
9068 if (TREE_CODE (type
) == TREE_LIST
)
9069 return (check_trait_type (TREE_VALUE (type
))
9070 && check_trait_type (TREE_CHAIN (type
)));
9072 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9073 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9076 if (VOID_TYPE_P (type
))
9079 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9082 /* Process a trait expression. */
9085 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9087 if (type1
== error_mark_node
9088 || type2
== error_mark_node
)
9089 return error_mark_node
;
9091 if (processing_template_decl
)
9093 tree trait_expr
= make_node (TRAIT_EXPR
);
9094 TREE_TYPE (trait_expr
) = boolean_type_node
;
9095 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9096 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9097 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9103 case CPTK_HAS_NOTHROW_ASSIGN
:
9104 case CPTK_HAS_TRIVIAL_ASSIGN
:
9105 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9106 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9107 case CPTK_HAS_NOTHROW_COPY
:
9108 case CPTK_HAS_TRIVIAL_COPY
:
9109 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9110 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9111 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9112 case CPTK_IS_ABSTRACT
:
9113 case CPTK_IS_AGGREGATE
:
9116 case CPTK_IS_LITERAL_TYPE
:
9118 case CPTK_IS_POLYMORPHIC
:
9119 case CPTK_IS_STD_LAYOUT
:
9120 case CPTK_IS_TRIVIAL
:
9121 case CPTK_IS_TRIVIALLY_COPYABLE
:
9122 if (!check_trait_type (type1
))
9123 return error_mark_node
;
9126 case CPTK_IS_ASSIGNABLE
:
9127 case CPTK_IS_CONSTRUCTIBLE
:
9130 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9131 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9132 if (!check_trait_type (type1
)
9133 || !check_trait_type (type2
))
9134 return error_mark_node
;
9137 case CPTK_IS_BASE_OF
:
9138 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9139 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9140 && !complete_type_or_else (type2
, NULL_TREE
))
9141 /* We already issued an error. */
9142 return error_mark_node
;
9148 case CPTK_IS_SAME_AS
:
9155 return (trait_expr_value (kind
, type1
, type2
)
9156 ? boolean_true_node
: boolean_false_node
);
9159 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9160 which is ignored for C++. */
9163 set_float_const_decimal64 (void)
9168 clear_float_const_decimal64 (void)
9173 float_const_decimal64_p (void)
9179 /* Return true if T designates the implied `this' parameter. */
9182 is_this_parameter (tree t
)
9184 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9186 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
9187 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
9191 /* Insert the deduced return type for an auto function. */
9194 apply_deduced_return_type (tree fco
, tree return_type
)
9198 if (return_type
== error_mark_node
)
9201 if (DECL_CONV_FN_P (fco
))
9202 DECL_NAME (fco
) = make_conv_op_name (return_type
);
9204 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9206 result
= DECL_RESULT (fco
);
9207 if (result
== NULL_TREE
)
9209 if (TREE_TYPE (result
) == return_type
)
9212 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
9213 && !complete_type_or_else (return_type
, NULL_TREE
))
9216 /* We already have a DECL_RESULT from start_preparsed_function.
9217 Now we need to redo the work it and allocate_struct_function
9218 did to reflect the new type. */
9219 gcc_assert (current_function_decl
== fco
);
9220 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9221 TYPE_MAIN_VARIANT (return_type
));
9222 DECL_ARTIFICIAL (result
) = 1;
9223 DECL_IGNORED_P (result
) = 1;
9224 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9227 DECL_RESULT (fco
) = result
;
9229 if (!processing_template_decl
)
9231 bool aggr
= aggregate_value_p (result
, fco
);
9232 #ifdef PCC_STATIC_STRUCT_RETURN
9233 cfun
->returns_pcc_struct
= aggr
;
9235 cfun
->returns_struct
= aggr
;
9240 /* DECL is a local variable or parameter from the surrounding scope of a
9241 lambda-expression. Returns the decltype for a use of the capture field
9242 for DECL even if it hasn't been captured yet. */
9245 capture_decltype (tree decl
)
9247 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9248 /* FIXME do lookup instead of list walk? */
9249 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9253 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9255 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9258 error ("%qD is not captured", decl
);
9259 return error_mark_node
;
9262 type
= TREE_TYPE (decl
);
9263 if (TYPE_REF_P (type
)
9264 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9265 type
= TREE_TYPE (type
);
9268 case CPLD_REFERENCE
:
9269 type
= TREE_TYPE (decl
);
9270 if (!TYPE_REF_P (type
))
9271 type
= build_reference_type (TREE_TYPE (decl
));
9278 if (!TYPE_REF_P (type
))
9280 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9281 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9283 type
= build_reference_type (type
);
9288 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9289 this is a right unary fold. Otherwise it is a left unary fold. */
9292 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9294 // Build a pack expansion (assuming expr has pack type).
9295 if (!uses_parameter_packs (expr
))
9297 error_at (location_of (expr
), "operand of fold expression has no "
9298 "unexpanded parameter packs");
9299 return error_mark_node
;
9301 tree pack
= make_pack_expansion (expr
);
9303 // Build the fold expression.
9304 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9305 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
9306 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9311 finish_left_unary_fold_expr (tree expr
, int op
)
9313 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9317 finish_right_unary_fold_expr (tree expr
, int op
)
9319 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9322 /* Build a binary fold expression over EXPR1 and EXPR2. The
9323 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9324 has an unexpanded parameter pack). */
9327 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9329 pack
= make_pack_expansion (pack
);
9330 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9331 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
9332 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9337 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9339 // Determine which expr has an unexpanded parameter pack and
9340 // set the pack and initial term.
9341 bool pack1
= uses_parameter_packs (expr1
);
9342 bool pack2
= uses_parameter_packs (expr2
);
9343 if (pack1
&& !pack2
)
9344 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9345 else if (pack2
&& !pack1
)
9346 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9350 error ("both arguments in binary fold have unexpanded parameter packs");
9352 error ("no unexpanded parameter packs in binary fold");
9354 return error_mark_node
;
9357 /* Finish __builtin_launder (arg). */
9360 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
9362 tree orig_arg
= arg
;
9363 if (!type_dependent_expression_p (arg
))
9364 arg
= decay_conversion (arg
, complain
);
9365 if (error_operand_p (arg
))
9366 return error_mark_node
;
9367 if (!type_dependent_expression_p (arg
)
9368 && !TYPE_PTR_P (TREE_TYPE (arg
)))
9370 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
9371 return error_mark_node
;
9373 if (processing_template_decl
)
9375 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
9376 TREE_TYPE (arg
), 1, arg
);
9379 #include "gt-cp-semantics.h"