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
) == BIT_NOT_EXPR
))
2102 expr
= build_qualified_name (TREE_TYPE (expr
),
2103 qualifying_class
, expr
,
2106 expr
= convert_from_reference (expr
);
2112 /* Begin a statement-expression. The value returned must be passed to
2113 finish_stmt_expr. */
2116 begin_stmt_expr (void)
2118 return push_stmt_list ();
2121 /* Process the final expression of a statement expression. EXPR can be
2122 NULL, if the final expression is empty. Return a STATEMENT_LIST
2123 containing all the statements in the statement-expression, or
2124 ERROR_MARK_NODE if there was an error. */
2127 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2129 if (error_operand_p (expr
))
2131 /* The type of the statement-expression is the type of the last
2133 TREE_TYPE (stmt_expr
) = error_mark_node
;
2134 return error_mark_node
;
2137 /* If the last statement does not have "void" type, then the value
2138 of the last statement is the value of the entire expression. */
2141 tree type
= TREE_TYPE (expr
);
2143 if (type
&& type_unknown_p (type
))
2145 error ("a statement expression is an insufficient context"
2146 " for overload resolution");
2147 TREE_TYPE (stmt_expr
) = error_mark_node
;
2148 return error_mark_node
;
2150 else if (processing_template_decl
)
2152 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2153 expr
= add_stmt (expr
);
2154 /* Mark the last statement so that we can recognize it as such at
2155 template-instantiation time. */
2156 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2158 else if (VOID_TYPE_P (type
))
2160 /* Just treat this like an ordinary statement. */
2161 expr
= finish_expr_stmt (expr
);
2165 /* It actually has a value we need to deal with. First, force it
2166 to be an rvalue so that we won't need to build up a copy
2167 constructor call later when we try to assign it to something. */
2168 expr
= force_rvalue (expr
, tf_warning_or_error
);
2169 if (error_operand_p (expr
))
2170 return error_mark_node
;
2172 /* Update for array-to-pointer decay. */
2173 type
= TREE_TYPE (expr
);
2175 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2176 normal statement, but don't convert to void or actually add
2178 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2179 expr
= maybe_cleanup_point_expr (expr
);
2183 /* The type of the statement-expression is the type of the last
2185 TREE_TYPE (stmt_expr
) = type
;
2191 /* Finish a statement-expression. EXPR should be the value returned
2192 by the previous begin_stmt_expr. Returns an expression
2193 representing the statement-expression. */
2196 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2201 if (error_operand_p (stmt_expr
))
2203 pop_stmt_list (stmt_expr
);
2204 return error_mark_node
;
2207 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2209 type
= TREE_TYPE (stmt_expr
);
2210 result
= pop_stmt_list (stmt_expr
);
2211 TREE_TYPE (result
) = type
;
2213 if (processing_template_decl
)
2215 result
= build_min (STMT_EXPR
, type
, result
);
2216 TREE_SIDE_EFFECTS (result
) = 1;
2217 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2219 else if (CLASS_TYPE_P (type
))
2221 /* Wrap the statement-expression in a TARGET_EXPR so that the
2222 temporary object created by the final expression is destroyed at
2223 the end of the full-expression containing the
2224 statement-expression. */
2225 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2231 /* Returns the expression which provides the value of STMT_EXPR. */
2234 stmt_expr_value_expr (tree stmt_expr
)
2236 tree t
= STMT_EXPR_STMT (stmt_expr
);
2238 if (TREE_CODE (t
) == BIND_EXPR
)
2239 t
= BIND_EXPR_BODY (t
);
2241 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2242 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2244 if (TREE_CODE (t
) == EXPR_STMT
)
2245 t
= EXPR_STMT_EXPR (t
);
2250 /* Return TRUE iff EXPR_STMT is an empty list of
2251 expression statements. */
2254 empty_expr_stmt_p (tree expr_stmt
)
2256 tree body
= NULL_TREE
;
2258 if (expr_stmt
== void_node
)
2263 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2264 body
= EXPR_STMT_EXPR (expr_stmt
);
2265 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2271 if (TREE_CODE (body
) == STATEMENT_LIST
)
2272 return tsi_end_p (tsi_start (body
));
2274 return empty_expr_stmt_p (body
);
2279 /* Perform Koenig lookup. FN is the postfix-expression representing
2280 the function (or functions) to call; ARGS are the arguments to the
2281 call. Returns the functions to be considered by overload resolution. */
2284 perform_koenig_lookup (cp_expr fn
, vec
<tree
, va_gc
> *args
,
2285 tsubst_flags_t complain
)
2287 tree identifier
= NULL_TREE
;
2288 tree functions
= NULL_TREE
;
2289 tree tmpl_args
= NULL_TREE
;
2290 bool template_id
= false;
2291 location_t loc
= fn
.get_location ();
2293 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2295 /* Use a separate flag to handle null args. */
2297 tmpl_args
= TREE_OPERAND (fn
, 1);
2298 fn
= TREE_OPERAND (fn
, 0);
2301 /* Find the name of the overloaded function. */
2302 if (identifier_p (fn
))
2307 identifier
= OVL_NAME (functions
);
2310 /* A call to a namespace-scope function using an unqualified name.
2312 Do Koenig lookup -- unless any of the arguments are
2314 if (!any_type_dependent_arguments_p (args
)
2315 && !any_dependent_template_arguments_p (tmpl_args
))
2317 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2320 /* The unqualified name could not be resolved. */
2321 if (complain
& tf_error
)
2322 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2328 if (fn
&& template_id
&& fn
!= error_mark_node
)
2329 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2334 /* Generate an expression for `FN (ARGS)'. This may change the
2337 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2338 as a virtual call, even if FN is virtual. (This flag is set when
2339 encountering an expression where the function name is explicitly
2340 qualified. For example a call to `X::f' never generates a virtual
2343 Returns code for the call. */
2346 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2347 bool koenig_p
, tsubst_flags_t complain
)
2351 vec
<tree
, va_gc
> *orig_args
= NULL
;
2353 if (fn
== error_mark_node
)
2354 return error_mark_node
;
2356 gcc_assert (!TYPE_P (fn
));
2358 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2359 it so that we can tell this is a call to a known function. */
2360 fn
= maybe_undo_parenthesized_ref (fn
);
2364 if (processing_template_decl
)
2366 /* If FN is a local extern declaration or set thereof, look them up
2367 again at instantiation time. */
2368 if (is_overloaded_fn (fn
))
2370 tree ifn
= get_first_fn (fn
);
2371 if (TREE_CODE (ifn
) == FUNCTION_DECL
2372 && DECL_LOCAL_FUNCTION_P (ifn
))
2373 orig_fn
= DECL_NAME (ifn
);
2376 /* If the call expression is dependent, build a CALL_EXPR node
2377 with no type; type_dependent_expression_p recognizes
2378 expressions with no type as being dependent. */
2379 if (type_dependent_expression_p (fn
)
2380 || any_type_dependent_arguments_p (*args
))
2382 result
= build_min_nt_call_vec (orig_fn
, *args
);
2383 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2384 KOENIG_LOOKUP_P (result
) = koenig_p
;
2385 if (is_overloaded_fn (fn
))
2388 lookup_keep (fn
, true);
2393 bool abnormal
= true;
2394 for (lkp_iterator
iter (fn
); abnormal
&& iter
; ++iter
)
2396 tree fndecl
= *iter
;
2397 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2398 || !TREE_THIS_VOLATILE (fndecl
))
2401 /* FIXME: Stop warning about falling off end of non-void
2402 function. But this is wrong. Even if we only see
2403 no-return fns at this point, we could select a
2404 future-defined return fn during instantiation. Or
2407 current_function_returns_abnormally
= 1;
2411 orig_args
= make_tree_vector_copy (*args
);
2412 if (!BASELINK_P (fn
)
2413 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2414 && TREE_TYPE (fn
) != unknown_type_node
)
2415 fn
= build_non_dependent_expr (fn
);
2416 make_args_non_dependent (*args
);
2419 if (TREE_CODE (fn
) == COMPONENT_REF
)
2421 tree member
= TREE_OPERAND (fn
, 1);
2422 if (BASELINK_P (member
))
2424 tree object
= TREE_OPERAND (fn
, 0);
2425 return build_new_method_call (object
, member
,
2428 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2435 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2436 if (TREE_CODE (fn
) == ADDR_EXPR
2437 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2438 fn
= TREE_OPERAND (fn
, 0);
2440 if (is_overloaded_fn (fn
))
2441 fn
= baselink_for_fns (fn
);
2444 if (BASELINK_P (fn
))
2448 /* A call to a member function. From [over.call.func]:
2450 If the keyword this is in scope and refers to the class of
2451 that member function, or a derived class thereof, then the
2452 function call is transformed into a qualified function call
2453 using (*this) as the postfix-expression to the left of the
2454 . operator.... [Otherwise] a contrived object of type T
2455 becomes the implied object argument.
2459 struct A { void f(); };
2460 struct B : public A {};
2461 struct C : public A { void g() { B::f(); }};
2463 "the class of that member function" refers to `A'. But 11.2
2464 [class.access.base] says that we need to convert 'this' to B* as
2465 part of the access, so we pass 'B' to maybe_dummy_object. */
2467 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2469 /* A constructor call always uses a dummy object. (This constructor
2470 call which has the form A::A () is actually invalid and we are
2471 going to reject it later in build_new_method_call.) */
2472 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2475 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2478 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2480 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2485 else if (is_overloaded_fn (fn
))
2487 /* If the function is an overloaded builtin, resolve it. */
2488 if (TREE_CODE (fn
) == FUNCTION_DECL
2489 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2490 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2491 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2495 if (warn_sizeof_pointer_memaccess
2496 && (complain
& tf_warning
)
2497 && !vec_safe_is_empty (*args
)
2498 && !processing_template_decl
)
2500 location_t sizeof_arg_loc
[3];
2503 for (i
= 0; i
< 3; i
++)
2507 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2508 sizeof_arg
[i
] = NULL_TREE
;
2509 if (i
>= (*args
)->length ())
2512 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2514 if (SIZEOF_EXPR_TYPE_P (t
))
2515 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2517 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2518 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2520 sizeof_pointer_memaccess_warning
2521 (sizeof_arg_loc
, fn
, *args
,
2522 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2525 /* A call to a namespace-scope function. */
2526 result
= build_new_function_call (fn
, args
, complain
);
2529 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2531 if (!vec_safe_is_empty (*args
))
2532 error ("arguments to destructor are not allowed");
2533 /* Mark the pseudo-destructor call as having side-effects so
2534 that we do not issue warnings about its use. */
2535 result
= build1 (NOP_EXPR
,
2537 TREE_OPERAND (fn
, 0));
2538 TREE_SIDE_EFFECTS (result
) = 1;
2540 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2541 /* If the "function" is really an object of class type, it might
2542 have an overloaded `operator ()'. */
2543 result
= build_op_call (fn
, args
, complain
);
2546 /* A call where the function is unknown. */
2547 result
= cp_build_function_call_vec (fn
, args
, complain
);
2549 if (processing_template_decl
&& result
!= error_mark_node
)
2551 if (INDIRECT_REF_P (result
))
2552 result
= TREE_OPERAND (result
, 0);
2553 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2554 SET_EXPR_LOCATION (result
, input_location
);
2555 KOENIG_LOOKUP_P (result
) = koenig_p
;
2556 release_tree_vector (orig_args
);
2557 result
= convert_from_reference (result
);
2560 /* Free or retain OVERLOADs from lookup. */
2561 if (is_overloaded_fn (orig_fn
))
2562 lookup_keep (get_fns (orig_fn
), processing_template_decl
);
2567 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2568 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2569 POSTDECREMENT_EXPR.) */
2572 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2574 /* input_location holds the location of the trailing operator token.
2575 Build a location of the form:
2578 with the caret at the operator token, ranging from the start
2579 of EXPR to the end of the operator token. */
2580 location_t combined_loc
= make_location (input_location
,
2582 get_finish (input_location
));
2583 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2584 tf_warning_or_error
);
2585 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2586 result
.set_location (combined_loc
);
2590 /* Finish a use of `this'. Returns an expression for `this'. */
2593 finish_this_expr (void)
2595 tree result
= NULL_TREE
;
2597 if (current_class_ptr
)
2599 tree type
= TREE_TYPE (current_class_ref
);
2601 /* In a lambda expression, 'this' refers to the captured 'this'. */
2602 if (LAMBDA_TYPE_P (type
))
2603 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2605 result
= current_class_ptr
;
2609 /* The keyword 'this' is a prvalue expression. */
2610 return rvalue (result
);
2612 tree fn
= current_nonlambda_function ();
2613 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2614 error ("%<this%> is unavailable for static member functions");
2616 error ("invalid use of %<this%> in non-member function");
2618 error ("invalid use of %<this%> at top level");
2619 return error_mark_node
;
2622 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2623 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2624 the TYPE for the type given. If SCOPE is non-NULL, the expression
2625 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2628 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2631 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2632 return error_mark_node
;
2634 gcc_assert (TYPE_P (destructor
));
2636 if (!processing_template_decl
)
2638 if (scope
== error_mark_node
)
2640 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2641 return error_mark_node
;
2643 if (is_auto (destructor
))
2644 destructor
= TREE_TYPE (object
);
2645 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2648 "qualified type %qT does not match destructor name ~%qT",
2650 return error_mark_node
;
2654 /* [expr.pseudo] says both:
2656 The type designated by the pseudo-destructor-name shall be
2657 the same as the object type.
2661 The cv-unqualified versions of the object type and of the
2662 type designated by the pseudo-destructor-name shall be the
2665 We implement the more generous second sentence, since that is
2666 what most other compilers do. */
2667 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2670 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2671 return error_mark_node
;
2675 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2679 /* Finish an expression of the form CODE EXPR. */
2682 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2683 tsubst_flags_t complain
)
2685 /* Build a location of the form:
2688 with the caret at the operator token, ranging from the start
2689 of the operator token to the end of EXPR. */
2690 location_t combined_loc
= make_location (op_loc
,
2691 op_loc
, expr
.get_finish ());
2692 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2693 /* TODO: build_x_unary_op doesn't always honor the location. */
2694 result
.set_location (combined_loc
);
2696 tree result_ovl
, expr_ovl
;
2698 if (!(complain
& tf_warning
))
2701 result_ovl
= result
;
2704 if (!processing_template_decl
)
2705 expr_ovl
= cp_fully_fold (expr_ovl
);
2707 if (!CONSTANT_CLASS_P (expr_ovl
)
2708 || TREE_OVERFLOW_P (expr_ovl
))
2711 if (!processing_template_decl
)
2712 result_ovl
= cp_fully_fold (result_ovl
);
2714 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2715 overflow_warning (combined_loc
, result_ovl
);
2720 /* Finish a compound-literal expression or C++11 functional cast with aggregate
2721 initializer. TYPE is the type to which the CONSTRUCTOR in COMPOUND_LITERAL
2725 finish_compound_literal (tree type
, tree compound_literal
,
2726 tsubst_flags_t complain
,
2729 if (type
== error_mark_node
)
2730 return error_mark_node
;
2732 if (TYPE_REF_P (type
))
2735 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2736 complain
, fcl_context
);
2737 return cp_build_c_cast (type
, compound_literal
, complain
);
2740 if (!TYPE_OBJ_P (type
))
2742 if (complain
& tf_error
)
2743 error ("compound literal of non-object type %qT", type
);
2744 return error_mark_node
;
2747 if (tree anode
= type_uses_auto (type
))
2748 if (CLASS_PLACEHOLDER_TEMPLATE (anode
))
2750 type
= do_auto_deduction (type
, compound_literal
, anode
, complain
,
2752 if (type
== error_mark_node
)
2753 return error_mark_node
;
2756 if (processing_template_decl
)
2758 TREE_TYPE (compound_literal
) = type
;
2759 /* Mark the expression as a compound literal. */
2760 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2761 if (fcl_context
== fcl_c99
)
2762 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2763 return compound_literal
;
2766 type
= complete_type (type
);
2768 if (TYPE_NON_AGGREGATE_CLASS (type
))
2770 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2771 everywhere that deals with function arguments would be a pain, so
2772 just wrap it in a TREE_LIST. The parser set a flag so we know
2773 that it came from T{} rather than T({}). */
2774 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2775 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2776 return build_functional_cast (type
, compound_literal
, complain
);
2779 if (TREE_CODE (type
) == ARRAY_TYPE
2780 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2781 return error_mark_node
;
2782 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2783 if (SCALAR_TYPE_P (type
)
2784 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2785 && !check_narrowing (type
, compound_literal
, complain
))
2786 return error_mark_node
;
2787 if (TREE_CODE (type
) == ARRAY_TYPE
2788 && TYPE_DOMAIN (type
) == NULL_TREE
)
2790 cp_complete_array_type_or_error (&type
, compound_literal
,
2792 if (type
== error_mark_node
)
2793 return error_mark_node
;
2795 compound_literal
= digest_init_flags (type
, compound_literal
, LOOKUP_NORMAL
,
2797 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2799 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2800 if (fcl_context
== fcl_c99
)
2801 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2804 /* Put static/constant array temporaries in static variables. */
2805 /* FIXME all C99 compound literals should be variables rather than C++
2806 temporaries, unless they are used as an aggregate initializer. */
2807 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2808 && fcl_context
== fcl_c99
2809 && TREE_CODE (type
) == ARRAY_TYPE
2810 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2811 && initializer_constant_valid_p (compound_literal
, type
))
2813 tree decl
= create_temporary_var (type
);
2814 DECL_INITIAL (decl
) = compound_literal
;
2815 TREE_STATIC (decl
) = 1;
2816 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2818 /* 5.19 says that a constant expression can include an
2819 lvalue-rvalue conversion applied to "a glvalue of literal type
2820 that refers to a non-volatile temporary object initialized
2821 with a constant expression". Rather than try to communicate
2822 that this VAR_DECL is a temporary, just mark it constexpr. */
2823 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2824 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2825 TREE_CONSTANT (decl
) = true;
2827 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2828 decl
= pushdecl_top_level (decl
);
2829 DECL_NAME (decl
) = make_anon_name ();
2830 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2831 /* Make sure the destructor is callable. */
2832 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2833 if (clean
== error_mark_node
)
2834 return error_mark_node
;
2838 /* Represent other compound literals with TARGET_EXPR so we produce
2839 an lvalue, but can elide copies. */
2840 if (!VECTOR_TYPE_P (type
))
2841 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2843 return compound_literal
;
2846 /* Return the declaration for the function-name variable indicated by
2850 finish_fname (tree id
)
2854 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2855 if (processing_template_decl
&& current_function_decl
2856 && decl
!= error_mark_node
)
2857 decl
= DECL_NAME (decl
);
2861 /* Finish a translation unit. */
2864 finish_translation_unit (void)
2866 /* In case there were missing closebraces,
2867 get us back to the global binding level. */
2869 while (current_namespace
!= global_namespace
)
2872 /* Do file scope __FUNCTION__ et al. */
2873 finish_fname_decls ();
2876 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2877 Returns the parameter. */
2880 finish_template_type_parm (tree aggr
, tree identifier
)
2882 if (aggr
!= class_type_node
)
2884 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2885 aggr
= class_type_node
;
2888 return build_tree_list (aggr
, identifier
);
2891 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2892 Returns the parameter. */
2895 finish_template_template_parm (tree aggr
, tree identifier
)
2897 tree decl
= build_decl (input_location
,
2898 TYPE_DECL
, identifier
, NULL_TREE
);
2900 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2901 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2902 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2903 DECL_ARTIFICIAL (decl
) = 1;
2905 // Associate the constraints with the underlying declaration,
2906 // not the template.
2907 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2908 tree constr
= build_constraints (reqs
, NULL_TREE
);
2909 set_constraints (decl
, constr
);
2911 end_template_decl ();
2913 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2915 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2916 /*is_primary=*/true, /*is_partial=*/false,
2919 return finish_template_type_parm (aggr
, tmpl
);
2922 /* ARGUMENT is the default-argument value for a template template
2923 parameter. If ARGUMENT is invalid, issue error messages and return
2924 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2927 check_template_template_default_arg (tree argument
)
2929 if (TREE_CODE (argument
) != TEMPLATE_DECL
2930 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2931 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2933 if (TREE_CODE (argument
) == TYPE_DECL
)
2934 error ("invalid use of type %qT as a default value for a template "
2935 "template-parameter", TREE_TYPE (argument
));
2937 error ("invalid default argument for a template template parameter");
2938 return error_mark_node
;
2944 /* Begin a class definition, as indicated by T. */
2947 begin_class_definition (tree t
)
2949 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2950 return error_mark_node
;
2952 if (processing_template_parmlist
)
2954 error ("definition of %q#T inside template parameter list", t
);
2955 return error_mark_node
;
2958 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2959 are passed the same as decimal scalar types. */
2960 if (TREE_CODE (t
) == RECORD_TYPE
2961 && !processing_template_decl
)
2963 tree ns
= TYPE_CONTEXT (t
);
2964 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2965 && DECL_CONTEXT (ns
) == std_node
2967 && id_equal (DECL_NAME (ns
), "decimal"))
2969 const char *n
= TYPE_NAME_STRING (t
);
2970 if ((strcmp (n
, "decimal32") == 0)
2971 || (strcmp (n
, "decimal64") == 0)
2972 || (strcmp (n
, "decimal128") == 0))
2973 TYPE_TRANSPARENT_AGGR (t
) = 1;
2977 /* A non-implicit typename comes from code like:
2979 template <typename T> struct A {
2980 template <typename U> struct A<T>::B ...
2982 This is erroneous. */
2983 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2985 error ("invalid definition of qualified type %qT", t
);
2986 t
= error_mark_node
;
2989 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2991 t
= make_class_type (RECORD_TYPE
);
2992 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2995 if (TYPE_BEING_DEFINED (t
))
2997 t
= make_class_type (TREE_CODE (t
));
2998 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
3000 maybe_process_partial_specialization (t
);
3002 TYPE_BEING_DEFINED (t
) = 1;
3003 class_binding_level
->defining_class_p
= 1;
3005 if (flag_pack_struct
)
3008 TYPE_PACKED (t
) = 1;
3009 /* Even though the type is being defined for the first time
3010 here, there might have been a forward declaration, so there
3011 might be cv-qualified variants of T. */
3012 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
3013 TYPE_PACKED (v
) = 1;
3015 /* Reset the interface data, at the earliest possible
3016 moment, as it might have been set via a class foo;
3018 if (! TYPE_UNNAMED_P (t
))
3020 struct c_fileinfo
*finfo
= \
3021 get_fileinfo (LOCATION_FILE (input_location
));
3022 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
3023 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
3024 (t
, finfo
->interface_unknown
);
3026 reset_specialization();
3028 /* Make a declaration for this class in its own scope. */
3029 build_self_reference ();
3034 /* Finish the member declaration given by DECL. */
3037 finish_member_declaration (tree decl
)
3039 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
3042 if (decl
== void_type_node
)
3043 /* The COMPONENT was a friend, not a member, and so there's
3044 nothing for us to do. */
3047 /* We should see only one DECL at a time. */
3048 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
3050 /* Don't add decls after definition. */
3051 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3052 /* We can add lambda types when late parsing default
3054 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3056 /* Set up access control for DECL. */
3058 = (current_access_specifier
== access_private_node
);
3059 TREE_PROTECTED (decl
)
3060 = (current_access_specifier
== access_protected_node
);
3061 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3063 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
3064 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
3067 /* Mark the DECL as a member of the current class, unless it's
3068 a member of an enumeration. */
3069 if (TREE_CODE (decl
) != CONST_DECL
)
3070 DECL_CONTEXT (decl
) = current_class_type
;
3072 if (TREE_CODE (decl
) == USING_DECL
)
3073 /* For now, ignore class-scope USING_DECLS, so that debugging
3074 backends do not see them. */
3075 DECL_IGNORED_P (decl
) = 1;
3077 /* Check for bare parameter packs in the non-static data member
3079 if (TREE_CODE (decl
) == FIELD_DECL
)
3081 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3082 TREE_TYPE (decl
) = error_mark_node
;
3083 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
3084 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
3089 A C language linkage is ignored for the names of class members
3090 and the member function type of class member functions. */
3091 if (DECL_LANG_SPECIFIC (decl
))
3092 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3096 /* Functions and non-functions are added differently. */
3097 if (DECL_DECLARES_FUNCTION_P (decl
))
3098 add
= add_method (current_class_type
, decl
, false);
3099 /* Enter the DECL into the scope of the class, if the class
3100 isn't a closure (whose fields are supposed to be unnamed). */
3101 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3102 || pushdecl_class_level (decl
))
3107 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3108 go at the beginning. The reason is that
3109 legacy_nonfn_member_lookup searches the list in order, and we
3110 want a field name to override a type name so that the "struct
3111 stat hack" will work. In particular:
3113 struct S { enum E { }; static const int E = 5; int ary[S::E]; } s;
3117 if (TREE_CODE (decl
) == TYPE_DECL
)
3118 TYPE_FIELDS (current_class_type
)
3119 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3122 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3123 TYPE_FIELDS (current_class_type
) = decl
;
3126 maybe_add_class_template_decl_list (current_class_type
, decl
,
3131 /* Finish processing a complete template declaration. The PARMS are
3132 the template parameters. */
3135 finish_template_decl (tree parms
)
3138 end_template_decl ();
3140 end_specialization ();
3143 // Returns the template type of the class scope being entered. If we're
3144 // entering a constrained class scope. TYPE is the class template
3145 // scope being entered and we may need to match the intended type with
3146 // a constrained specialization. For example:
3148 // template<Object T>
3149 // struct S { void f(); }; #1
3151 // template<Object T>
3152 // void S<T>::f() { } #2
3154 // We check, in #2, that S<T> refers precisely to the type declared by
3155 // #1 (i.e., that the constraints match). Note that the following should
3156 // be an error since there is no specialization of S<T> that is
3157 // unconstrained, but this is not diagnosed here.
3159 // template<typename T>
3160 // void S<T>::f() { }
3162 // We cannot diagnose this problem here since this function also matches
3163 // qualified template names that are not part of a definition. For example:
3165 // template<Integral T, Floating_point U>
3166 // typename pair<T, U>::first_type void f(T, U);
3168 // Here, it is unlikely that there is a partial specialization of
3169 // pair constrained for for Integral and Floating_point arguments.
3171 // The general rule is: if a constrained specialization with matching
3172 // constraints is found return that type. Also note that if TYPE is not a
3173 // class-type (e.g. a typename type), then no fixup is needed.
3176 fixup_template_type (tree type
)
3178 // Find the template parameter list at the a depth appropriate to
3179 // the scope we're trying to enter.
3180 tree parms
= current_template_parms
;
3181 int depth
= template_class_depth (type
);
3182 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3183 parms
= TREE_CHAIN (parms
);
3186 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3187 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3189 // Search for a specialization whose type and constraints match.
3190 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3191 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3194 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3196 // If the type and constraints match a specialization, then we
3197 // are entering that type.
3198 if (same_type_p (type
, TREE_TYPE (specs
))
3199 && equivalent_constraints (cur_constr
, spec_constr
))
3200 return TREE_TYPE (specs
);
3201 specs
= TREE_CHAIN (specs
);
3204 // If no specialization matches, then must return the type
3205 // previously found.
3209 /* Finish processing a template-id (which names a type) of the form
3210 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3211 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3212 the scope of template-id indicated. */
3215 finish_template_type (tree name
, tree args
, int entering_scope
)
3219 type
= lookup_template_class (name
, args
,
3220 NULL_TREE
, NULL_TREE
, entering_scope
,
3221 tf_warning_or_error
| tf_user
);
3223 /* If we might be entering the scope of a partial specialization,
3224 find the one with the right constraints. */
3227 && CLASS_TYPE_P (type
)
3228 && CLASSTYPE_TEMPLATE_INFO (type
)
3229 && dependent_type_p (type
)
3230 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3231 type
= fixup_template_type (type
);
3233 if (type
== error_mark_node
)
3235 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3236 return TYPE_STUB_DECL (type
);
3238 return TYPE_NAME (type
);
3241 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3242 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3243 BASE_CLASS, or NULL_TREE if an error occurred. The
3244 ACCESS_SPECIFIER is one of
3245 access_{default,public,protected_private}_node. For a virtual base
3246 we set TREE_TYPE. */
3249 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3253 if (base
== error_mark_node
)
3255 error ("invalid base-class specification");
3258 else if (! MAYBE_CLASS_TYPE_P (base
))
3260 error ("%qT is not a class type", base
);
3265 if (cp_type_quals (base
) != 0)
3267 /* DR 484: Can a base-specifier name a cv-qualified
3269 base
= TYPE_MAIN_VARIANT (base
);
3271 result
= build_tree_list (access
, base
);
3273 TREE_TYPE (result
) = integer_type_node
;
3279 /* If FNS is a member function, a set of member functions, or a
3280 template-id referring to one or more member functions, return a
3281 BASELINK for FNS, incorporating the current access context.
3282 Otherwise, return FNS unchanged. */
3285 baselink_for_fns (tree fns
)
3290 if (BASELINK_P (fns
)
3291 || error_operand_p (fns
))
3294 scope
= ovl_scope (fns
);
3295 if (!CLASS_TYPE_P (scope
))
3298 cl
= currently_open_derived_class (scope
);
3301 cl
= TYPE_BINFO (cl
);
3302 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3305 /* Returns true iff DECL is a variable from a function outside
3309 outer_var_p (tree decl
)
3311 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3312 && DECL_FUNCTION_SCOPE_P (decl
)
3313 /* Don't get confused by temporaries. */
3315 && (DECL_CONTEXT (decl
) != current_function_decl
3316 || parsing_nsdmi ()));
3319 /* As above, but also checks that DECL is automatic. */
3322 outer_automatic_var_p (tree decl
)
3324 return (outer_var_p (decl
)
3325 && !TREE_STATIC (decl
));
3328 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3329 rewrite it for lambda capture.
3331 If ODR_USE is true, we're being called from mark_use, and we complain about
3332 use of constant variables. If ODR_USE is false, we're being called for the
3333 id-expression, and we do lambda capture. */
3336 process_outer_var_ref (tree decl
, tsubst_flags_t complain
, bool odr_use
)
3338 if (cp_unevaluated_operand
)
3339 /* It's not a use (3.2) if we're in an unevaluated context. */
3341 if (decl
== error_mark_node
)
3344 tree context
= DECL_CONTEXT (decl
);
3345 tree containing_function
= current_function_decl
;
3346 tree lambda_stack
= NULL_TREE
;
3347 tree lambda_expr
= NULL_TREE
;
3348 tree initializer
= convert_from_reference (decl
);
3350 /* Mark it as used now even if the use is ill-formed. */
3351 if (!mark_used (decl
, complain
))
3352 return error_mark_node
;
3354 if (parsing_nsdmi ())
3355 containing_function
= NULL_TREE
;
3357 if (containing_function
&& LAMBDA_FUNCTION_P (containing_function
))
3359 /* Check whether we've already built a proxy. */
3361 while (is_normal_capture_proxy (var
))
3362 var
= DECL_CAPTURED_VARIABLE (var
);
3363 tree d
= retrieve_local_specialization (var
);
3365 if (d
&& d
!= decl
&& is_capture_proxy (d
))
3367 if (DECL_CONTEXT (d
) == containing_function
)
3368 /* We already have an inner proxy. */
3371 /* We need to capture an outer proxy. */
3372 return process_outer_var_ref (d
, complain
, odr_use
);
3376 /* If we are in a lambda function, we can move out until we hit
3378 2. a non-lambda function, or
3379 3. a non-default capturing lambda function. */
3380 while (context
!= containing_function
3381 /* containing_function can be null with invalid generic lambdas. */
3382 && containing_function
3383 && LAMBDA_FUNCTION_P (containing_function
))
3385 tree closure
= DECL_CONTEXT (containing_function
);
3386 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3388 if (TYPE_CLASS_SCOPE_P (closure
))
3389 /* A lambda in an NSDMI (c++/64496). */
3392 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3396 lambda_stack
= tree_cons (NULL_TREE
,
3401 = decl_function_context (containing_function
);
3404 /* In a lambda within a template, wait until instantiation
3405 time to implicitly capture. */
3406 if (context
== containing_function
3407 && DECL_TEMPLATE_INFO (containing_function
)
3408 && uses_template_parms (DECL_TI_ARGS (containing_function
)))
3411 if (lambda_expr
&& VAR_P (decl
)
3412 && DECL_ANON_UNION_VAR_P (decl
))
3414 if (complain
& tf_error
)
3415 error ("cannot capture member %qD of anonymous union", decl
);
3416 return error_mark_node
;
3418 /* Do lambda capture when processing the id-expression, not when
3419 odr-using a variable. */
3420 if (!odr_use
&& context
== containing_function
)
3422 decl
= add_default_capture (lambda_stack
,
3423 /*id=*/DECL_NAME (decl
),
3426 /* Only an odr-use of an outer automatic variable causes an
3427 error, and a constant variable can decay to a prvalue
3428 constant without odr-use. So don't complain yet. */
3429 else if (!odr_use
&& decl_constant_var_p (decl
))
3431 else if (lambda_expr
)
3433 if (complain
& tf_error
)
3435 error ("%qD is not captured", decl
);
3436 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3437 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3439 inform (location_of (closure
),
3440 "the lambda has no capture-default");
3441 else if (TYPE_CLASS_SCOPE_P (closure
))
3442 inform (UNKNOWN_LOCATION
, "lambda in local class %q+T cannot "
3443 "capture variables from the enclosing context",
3444 TYPE_CONTEXT (closure
));
3445 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3447 return error_mark_node
;
3451 if (complain
& tf_error
)
3454 ? G_("use of local variable with automatic storage from "
3455 "containing function")
3456 : G_("use of parameter from containing function"));
3457 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3459 return error_mark_node
;
3464 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3465 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3466 if non-NULL, is the type or namespace used to explicitly qualify
3467 ID_EXPRESSION. DECL is the entity to which that name has been
3470 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3471 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3472 be set to true if this expression isn't permitted in a
3473 constant-expression, but it is otherwise not set by this function.
3474 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3475 constant-expression, but a non-constant expression is also
3478 DONE is true if this expression is a complete postfix-expression;
3479 it is false if this expression is followed by '->', '[', '(', etc.
3480 ADDRESS_P is true iff this expression is the operand of '&'.
3481 TEMPLATE_P is true iff the qualified-id was of the form
3482 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3483 appears as a template argument.
3485 If an error occurs, and it is the kind of error that might cause
3486 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3487 is the caller's responsibility to issue the message. *ERROR_MSG
3488 will be a string with static storage duration, so the caller need
3491 Return an expression for the entity, after issuing appropriate
3492 diagnostics. This function is also responsible for transforming a
3493 reference to a non-static member into a COMPONENT_REF that makes
3494 the use of "this" explicit.
3496 Upon return, *IDK will be filled in appropriately. */
3498 finish_id_expression (tree id_expression
,
3502 bool integral_constant_expression_p
,
3503 bool allow_non_integral_constant_expression_p
,
3504 bool *non_integral_constant_expression_p
,
3508 bool template_arg_p
,
3509 const char **error_msg
,
3510 location_t location
)
3512 decl
= strip_using_decl (decl
);
3514 /* Initialize the output parameters. */
3515 *idk
= CP_ID_KIND_NONE
;
3518 if (id_expression
== error_mark_node
)
3519 return error_mark_node
;
3520 /* If we have a template-id, then no further lookup is
3521 required. If the template-id was for a template-class, we
3522 will sometimes have a TYPE_DECL at this point. */
3523 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3524 || TREE_CODE (decl
) == TYPE_DECL
)
3526 /* Look up the name. */
3529 if (decl
== error_mark_node
)
3531 /* Name lookup failed. */
3534 || (!dependent_type_p (scope
)
3535 && !(identifier_p (id_expression
)
3536 && IDENTIFIER_CONV_OP_P (id_expression
)
3537 && dependent_type_p (TREE_TYPE (id_expression
))))))
3539 /* If the qualifying type is non-dependent (and the name
3540 does not name a conversion operator to a dependent
3541 type), issue an error. */
3542 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3543 return error_mark_node
;
3547 /* It may be resolved via Koenig lookup. */
3548 *idk
= CP_ID_KIND_UNQUALIFIED
;
3549 return id_expression
;
3552 decl
= id_expression
;
3555 /* Remember that the name was used in the definition of
3556 the current class so that we can check later to see if
3557 the meaning would have been different after the class
3558 was entirely defined. */
3559 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3560 maybe_note_name_used_in_class (id_expression
, decl
);
3562 /* A use in unevaluated operand might not be instantiated appropriately
3563 if tsubst_copy builds a dummy parm, or if we never instantiate a
3564 generic lambda, so mark it now. */
3565 if (processing_template_decl
&& cp_unevaluated_operand
)
3566 mark_type_use (decl
);
3568 /* Disallow uses of local variables from containing functions, except
3569 within lambda-expressions. */
3570 if (outer_automatic_var_p (decl
))
3572 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3573 if (decl
== error_mark_node
)
3574 return error_mark_node
;
3577 /* Also disallow uses of function parameters outside the function
3578 body, except inside an unevaluated context (i.e. decltype). */
3579 if (TREE_CODE (decl
) == PARM_DECL
3580 && DECL_CONTEXT (decl
) == NULL_TREE
3581 && !cp_unevaluated_operand
)
3583 *error_msg
= G_("use of parameter outside function body");
3584 return error_mark_node
;
3588 /* If we didn't find anything, or what we found was a type,
3589 then this wasn't really an id-expression. */
3590 if (TREE_CODE (decl
) == TEMPLATE_DECL
3591 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3593 *error_msg
= G_("missing template arguments");
3594 return error_mark_node
;
3596 else if (TREE_CODE (decl
) == TYPE_DECL
3597 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3599 *error_msg
= G_("expected primary-expression");
3600 return error_mark_node
;
3603 /* If the name resolved to a template parameter, there is no
3604 need to look it up again later. */
3605 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3606 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3610 *idk
= CP_ID_KIND_NONE
;
3611 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3612 decl
= TEMPLATE_PARM_DECL (decl
);
3613 r
= convert_from_reference (DECL_INITIAL (decl
));
3615 if (integral_constant_expression_p
3616 && !dependent_type_p (TREE_TYPE (decl
))
3617 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3619 if (!allow_non_integral_constant_expression_p
)
3620 error ("template parameter %qD of type %qT is not allowed in "
3621 "an integral constant expression because it is not of "
3622 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3623 *non_integral_constant_expression_p
= true;
3629 bool dependent_p
= type_dependent_expression_p (decl
);
3631 /* If the declaration was explicitly qualified indicate
3632 that. The semantics of `A::f(3)' are different than
3633 `f(3)' if `f' is virtual. */
3635 ? CP_ID_KIND_QUALIFIED
3636 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3637 ? CP_ID_KIND_TEMPLATE_ID
3639 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3640 : CP_ID_KIND_UNQUALIFIED
)));
3644 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3645 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3646 wrong, so just return the identifier. */
3647 return id_expression
;
3649 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3651 error ("use of namespace %qD as expression", decl
);
3652 return error_mark_node
;
3654 else if (DECL_CLASS_TEMPLATE_P (decl
))
3656 error ("use of class template %qT as expression", decl
);
3657 return error_mark_node
;
3659 else if (TREE_CODE (decl
) == TREE_LIST
)
3661 /* Ambiguous reference to base members. */
3662 error ("request for member %qD is ambiguous in "
3663 "multiple inheritance lattice", id_expression
);
3664 print_candidates (decl
);
3665 return error_mark_node
;
3668 /* Mark variable-like entities as used. Functions are similarly
3669 marked either below or after overload resolution. */
3671 || TREE_CODE (decl
) == PARM_DECL
3672 || TREE_CODE (decl
) == CONST_DECL
3673 || TREE_CODE (decl
) == RESULT_DECL
)
3674 && !mark_used (decl
))
3675 return error_mark_node
;
3677 /* Only certain kinds of names are allowed in constant
3678 expression. Template parameters have already
3679 been handled above. */
3680 if (! error_operand_p (decl
)
3682 && integral_constant_expression_p
3683 && ! decl_constant_var_p (decl
)
3684 && TREE_CODE (decl
) != CONST_DECL
3685 && ! builtin_valid_in_constant_expr_p (decl
))
3687 if (!allow_non_integral_constant_expression_p
)
3689 error ("%qD cannot appear in a constant-expression", decl
);
3690 return error_mark_node
;
3692 *non_integral_constant_expression_p
= true;
3697 && !cp_unevaluated_operand
3698 && !processing_template_decl
3699 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3700 && CP_DECL_THREAD_LOCAL_P (decl
)
3701 && (wrap
= get_tls_wrapper_fn (decl
)))
3703 /* Replace an evaluated use of the thread_local variable with
3704 a call to its wrapper. */
3705 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3707 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3709 && variable_template_p (TREE_OPERAND (decl
, 0)))
3711 decl
= finish_template_variable (decl
);
3713 decl
= convert_from_reference (decl
);
3717 if (TREE_CODE (decl
) == SCOPE_REF
)
3719 gcc_assert (same_type_p (scope
, TREE_OPERAND (decl
, 0)));
3720 decl
= TREE_OPERAND (decl
, 1);
3723 decl
= (adjust_result_of_qualified_name_lookup
3724 (decl
, scope
, current_nonlambda_class_type()));
3726 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3730 decl
= finish_qualified_id_expr (scope
,
3736 tf_warning_or_error
);
3738 decl
= convert_from_reference (decl
);
3740 else if (TREE_CODE (decl
) == FIELD_DECL
)
3742 /* Since SCOPE is NULL here, this is an unqualified name.
3743 Access checking has been performed during name lookup
3744 already. Turn off checking to avoid duplicate errors. */
3745 push_deferring_access_checks (dk_no_check
);
3746 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3747 /*qualifying_scope=*/NULL_TREE
);
3748 pop_deferring_access_checks ();
3750 else if (is_overloaded_fn (decl
))
3752 tree first_fn
= get_first_fn (decl
);
3754 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3755 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3757 /* [basic.def.odr]: "A function whose name appears as a
3758 potentially-evaluated expression is odr-used if it is the unique
3761 But only mark it if it's a complete postfix-expression; in a call,
3762 ADL might select a different function, and we'll call mark_used in
3765 && !really_overloaded_fn (decl
)
3766 && !mark_used (first_fn
))
3767 return error_mark_node
;
3770 && TREE_CODE (first_fn
) == FUNCTION_DECL
3771 && DECL_FUNCTION_MEMBER_P (first_fn
)
3772 && !shared_member_p (decl
))
3774 /* A set of member functions. */
3775 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3776 return finish_class_member_access_expr (decl
, id_expression
,
3777 /*template_p=*/false,
3778 tf_warning_or_error
);
3781 decl
= baselink_for_fns (decl
);
3785 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3786 && DECL_CLASS_SCOPE_P (decl
))
3788 tree context
= context_for_name_lookup (decl
);
3789 if (context
!= current_class_type
)
3791 tree path
= currently_open_derived_class (context
);
3792 perform_or_defer_access_check (TYPE_BINFO (path
),
3794 tf_warning_or_error
);
3798 decl
= convert_from_reference (decl
);
3802 return cp_expr (decl
, location
);
3805 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3806 use as a type-specifier. */
3809 finish_typeof (tree expr
)
3813 if (type_dependent_expression_p (expr
))
3815 type
= cxx_make_type (TYPEOF_TYPE
);
3816 TYPEOF_TYPE_EXPR (type
) = expr
;
3817 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3822 expr
= mark_type_use (expr
);
3824 type
= unlowered_expr_type (expr
);
3826 if (!type
|| type
== unknown_type_node
)
3828 error ("type of %qE is unknown", expr
);
3829 return error_mark_node
;
3835 /* Implement the __underlying_type keyword: Return the underlying
3836 type of TYPE, suitable for use as a type-specifier. */
3839 finish_underlying_type (tree type
)
3841 tree underlying_type
;
3843 if (processing_template_decl
)
3845 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3846 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3847 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3849 return underlying_type
;
3852 if (!complete_type_or_else (type
, NULL_TREE
))
3853 return error_mark_node
;
3855 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3857 error ("%qT is not an enumeration type", type
);
3858 return error_mark_node
;
3861 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3863 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3864 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3865 See finish_enum_value_list for details. */
3866 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3868 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3869 TYPE_UNSIGNED (underlying_type
));
3871 return underlying_type
;
3874 /* Implement the __direct_bases keyword: Return the direct base classes
3878 calculate_direct_bases (tree type
, tsubst_flags_t complain
)
3880 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3881 || !NON_UNION_CLASS_TYPE_P (type
))
3882 return make_tree_vec (0);
3884 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3885 vec
<tree
, va_gc
> *base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3889 /* Virtual bases are initialized first */
3890 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3891 if (BINFO_VIRTUAL_P (binfo
))
3892 vec_safe_push (vector
, binfo
);
3894 /* Now non-virtuals */
3895 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3896 if (!BINFO_VIRTUAL_P (binfo
))
3897 vec_safe_push (vector
, binfo
);
3899 tree bases_vec
= make_tree_vec (vector
->length ());
3901 for (i
= 0; i
< vector
->length (); ++i
)
3902 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3904 release_tree_vector (vector
);
3908 /* Implement the __bases keyword: Return the base classes
3911 /* Find morally non-virtual base classes by walking binfo hierarchy */
3912 /* Virtual base classes are handled separately in finish_bases */
3915 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3917 /* Don't walk bases of virtual bases */
3918 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3922 dfs_calculate_bases_post (tree binfo
, void *data_
)
3924 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3925 if (!BINFO_VIRTUAL_P (binfo
))
3926 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3930 /* Calculates the morally non-virtual base classes of a class */
3931 static vec
<tree
, va_gc
> *
3932 calculate_bases_helper (tree type
)
3934 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3936 /* Now add non-virtual base classes in order of construction */
3937 if (TYPE_BINFO (type
))
3938 dfs_walk_all (TYPE_BINFO (type
),
3939 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3944 calculate_bases (tree type
, tsubst_flags_t complain
)
3946 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3947 || !NON_UNION_CLASS_TYPE_P (type
))
3948 return make_tree_vec (0);
3950 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3951 tree bases_vec
= NULL_TREE
;
3953 vec
<tree
, va_gc
> *vbases
;
3954 vec
<tree
, va_gc
> *nonvbases
;
3957 /* First go through virtual base classes */
3958 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3959 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3961 vec
<tree
, va_gc
> *vbase_bases
3962 = calculate_bases_helper (BINFO_TYPE (binfo
));
3963 vec_safe_splice (vector
, vbase_bases
);
3964 release_tree_vector (vbase_bases
);
3967 /* Now for the non-virtual bases */
3968 nonvbases
= calculate_bases_helper (type
);
3969 vec_safe_splice (vector
, nonvbases
);
3970 release_tree_vector (nonvbases
);
3972 /* Note that during error recovery vector->length can even be zero. */
3973 if (vector
->length () > 1)
3975 /* Last element is entire class, so don't copy */
3976 bases_vec
= make_tree_vec (vector
->length () - 1);
3978 for (i
= 0; i
< vector
->length () - 1; ++i
)
3979 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3982 bases_vec
= make_tree_vec (0);
3984 release_tree_vector (vector
);
3989 finish_bases (tree type
, bool direct
)
3991 tree bases
= NULL_TREE
;
3993 if (!processing_template_decl
)
3995 /* Parameter packs can only be used in templates */
3996 error ("Parameter pack __bases only valid in template declaration");
3997 return error_mark_node
;
4000 bases
= cxx_make_type (BASES
);
4001 BASES_TYPE (bases
) = type
;
4002 BASES_DIRECT (bases
) = direct
;
4003 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
4008 /* Perform C++-specific checks for __builtin_offsetof before calling
4012 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
4014 /* If we're processing a template, we can't finish the semantics yet.
4015 Otherwise we can fold the entire expression now. */
4016 if (processing_template_decl
)
4018 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4019 SET_EXPR_LOCATION (expr
, loc
);
4023 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4025 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4026 TREE_OPERAND (expr
, 2));
4027 return error_mark_node
;
4029 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
4030 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
4031 || TREE_TYPE (expr
) == unknown_type_node
)
4033 while (TREE_CODE (expr
) == COMPONENT_REF
4034 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4035 expr
= TREE_OPERAND (expr
, 1);
4039 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4040 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
4043 error ("cannot apply %<offsetof%> to member function");
4044 return error_mark_node
;
4046 if (TREE_CODE (expr
) == CONST_DECL
)
4048 error ("cannot apply %<offsetof%> to an enumerator %qD", expr
);
4049 return error_mark_node
;
4051 if (REFERENCE_REF_P (expr
))
4052 expr
= TREE_OPERAND (expr
, 0);
4053 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4054 return error_mark_node
;
4055 if (warn_invalid_offsetof
4056 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4057 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4058 && cp_unevaluated_operand
== 0)
4059 warning_at (loc
, OPT_Winvalid_offsetof
, "offsetof within "
4060 "non-standard-layout type %qT is conditionally-supported",
4061 TREE_TYPE (TREE_TYPE (object_ptr
)));
4062 return fold_offsetof (expr
);
4065 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4066 function is broken out from the above for the benefit of the tree-ssa
4070 simplify_aggr_init_expr (tree
*tp
)
4072 tree aggr_init_expr
= *tp
;
4074 /* Form an appropriate CALL_EXPR. */
4075 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4076 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4077 tree type
= TREE_TYPE (slot
);
4080 enum style_t
{ ctor
, arg
, pcc
} style
;
4082 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4084 #ifdef PCC_STATIC_STRUCT_RETURN
4090 gcc_assert (TREE_ADDRESSABLE (type
));
4094 call_expr
= build_call_array_loc (input_location
,
4095 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4097 aggr_init_expr_nargs (aggr_init_expr
),
4098 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4099 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4100 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4101 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4102 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4103 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4104 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4108 /* Replace the first argument to the ctor with the address of the
4110 cxx_mark_addressable (slot
);
4111 CALL_EXPR_ARG (call_expr
, 0) =
4112 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4114 else if (style
== arg
)
4116 /* Just mark it addressable here, and leave the rest to
4117 expand_call{,_inline}. */
4118 cxx_mark_addressable (slot
);
4119 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4120 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4122 else if (style
== pcc
)
4124 /* If we're using the non-reentrant PCC calling convention, then we
4125 need to copy the returned value out of the static buffer into the
4127 push_deferring_access_checks (dk_no_check
);
4128 call_expr
= build_aggr_init (slot
, call_expr
,
4129 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4130 tf_warning_or_error
);
4131 pop_deferring_access_checks ();
4132 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4135 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4137 tree init
= build_zero_init (type
, NULL_TREE
,
4138 /*static_storage_p=*/false);
4139 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4140 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4147 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4150 emit_associated_thunks (tree fn
)
4152 /* When we use vcall offsets, we emit thunks with the virtual
4153 functions to which they thunk. The whole point of vcall offsets
4154 is so that you can know statically the entire set of thunks that
4155 will ever be needed for a given virtual function, thereby
4156 enabling you to output all the thunks with the function itself. */
4157 if (DECL_VIRTUAL_P (fn
)
4158 /* Do not emit thunks for extern template instantiations. */
4159 && ! DECL_REALLY_EXTERN (fn
))
4163 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4165 if (!THUNK_ALIAS (thunk
))
4167 use_thunk (thunk
, /*emit_p=*/1);
4168 if (DECL_RESULT_THUNK_P (thunk
))
4172 for (probe
= DECL_THUNKS (thunk
);
4173 probe
; probe
= DECL_CHAIN (probe
))
4174 use_thunk (probe
, /*emit_p=*/1);
4178 gcc_assert (!DECL_THUNKS (thunk
));
4183 /* Generate RTL for FN. */
4186 expand_or_defer_fn_1 (tree fn
)
4188 /* When the parser calls us after finishing the body of a template
4189 function, we don't really want to expand the body. */
4190 if (processing_template_decl
)
4192 /* Normally, collection only occurs in rest_of_compilation. So,
4193 if we don't collect here, we never collect junk generated
4194 during the processing of templates until we hit a
4195 non-template function. It's not safe to do this inside a
4196 nested class, though, as the parser may have local state that
4197 is not a GC root. */
4198 if (!function_depth
)
4203 gcc_assert (DECL_SAVED_TREE (fn
));
4205 /* We make a decision about linkage for these functions at the end
4206 of the compilation. Until that point, we do not want the back
4207 end to output them -- but we do want it to see the bodies of
4208 these functions so that it can inline them as appropriate. */
4209 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4211 if (DECL_INTERFACE_KNOWN (fn
))
4212 /* We've already made a decision as to how this function will
4215 tentative_decl_linkage (fn
);
4217 import_export_decl (fn
);
4219 /* If the user wants us to keep all inline functions, then mark
4220 this function as needed so that finish_file will make sure to
4221 output it later. Similarly, all dllexport'd functions must
4222 be emitted; there may be callers in other DLLs. */
4223 if (DECL_DECLARED_INLINE_P (fn
)
4224 && !DECL_REALLY_EXTERN (fn
)
4225 && (flag_keep_inline_functions
4226 || (flag_keep_inline_dllexport
4227 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4230 DECL_EXTERNAL (fn
) = 0;
4234 /* If this is a constructor or destructor body, we have to clone
4236 if (maybe_clone_body (fn
))
4238 /* We don't want to process FN again, so pretend we've written
4239 it out, even though we haven't. */
4240 TREE_ASM_WRITTEN (fn
) = 1;
4241 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4242 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4243 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4247 /* There's no reason to do any of the work here if we're only doing
4248 semantic analysis; this code just generates RTL. */
4249 if (flag_syntax_only
)
4256 expand_or_defer_fn (tree fn
)
4258 if (expand_or_defer_fn_1 (fn
))
4262 /* Expand or defer, at the whim of the compilation unit manager. */
4263 cgraph_node::finalize_function (fn
, function_depth
> 1);
4264 emit_associated_thunks (fn
);
4272 nrv_data () : visited (37) {}
4276 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4279 /* Helper function for walk_tree, used by finalize_nrv below. */
4282 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4284 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4287 /* No need to walk into types. There wouldn't be any need to walk into
4288 non-statements, except that we have to consider STMT_EXPRs. */
4291 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4292 but differs from using NULL_TREE in that it indicates that we care
4293 about the value of the RESULT_DECL. */
4294 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4295 TREE_OPERAND (*tp
, 0) = dp
->result
;
4296 /* Change all cleanups for the NRV to only run when an exception is
4298 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4299 && CLEANUP_DECL (*tp
) == dp
->var
)
4300 CLEANUP_EH_ONLY (*tp
) = 1;
4301 /* Replace the DECL_EXPR for the NRV with an initialization of the
4302 RESULT_DECL, if needed. */
4303 else if (TREE_CODE (*tp
) == DECL_EXPR
4304 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4307 if (DECL_INITIAL (dp
->var
)
4308 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4309 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4310 DECL_INITIAL (dp
->var
));
4312 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4313 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4314 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4317 /* And replace all uses of the NRV with the RESULT_DECL. */
4318 else if (*tp
== dp
->var
)
4321 /* Avoid walking into the same tree more than once. Unfortunately, we
4322 can't just use walk_tree_without duplicates because it would only call
4323 us for the first occurrence of dp->var in the function body. */
4324 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4330 /* Keep iterating. */
4334 /* Called from finish_function to implement the named return value
4335 optimization by overriding all the RETURN_EXPRs and pertinent
4336 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4337 RESULT_DECL for the function. */
4340 finalize_nrv (tree
*tp
, tree var
, tree result
)
4342 struct nrv_data data
;
4344 /* Copy name from VAR to RESULT. */
4345 DECL_NAME (result
) = DECL_NAME (var
);
4346 /* Don't forget that we take its address. */
4347 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4348 /* Finally set DECL_VALUE_EXPR to avoid assigning
4349 a stack slot at -O0 for the original var and debug info
4350 uses RESULT location for VAR. */
4351 SET_DECL_VALUE_EXPR (var
, result
);
4352 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4355 data
.result
= result
;
4356 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4359 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4362 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4363 bool need_copy_ctor
, bool need_copy_assignment
,
4366 int save_errorcount
= errorcount
;
4369 /* Always allocate 3 elements for simplicity. These are the
4370 function decls for the ctor, dtor, and assignment op.
4371 This layout is known to the three lang hooks,
4372 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4373 and cxx_omp_clause_assign_op. */
4374 info
= make_tree_vec (3);
4375 CP_OMP_CLAUSE_INFO (c
) = info
;
4377 if (need_default_ctor
|| need_copy_ctor
)
4379 if (need_default_ctor
)
4380 t
= get_default_ctor (type
);
4382 t
= get_copy_ctor (type
, tf_warning_or_error
);
4384 if (t
&& !trivial_fn_p (t
))
4385 TREE_VEC_ELT (info
, 0) = t
;
4388 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4389 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4391 if (need_copy_assignment
)
4393 t
= get_copy_assign (type
);
4395 if (t
&& !trivial_fn_p (t
))
4396 TREE_VEC_ELT (info
, 2) = t
;
4399 return errorcount
!= save_errorcount
;
4402 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4403 FIELD_DECL, otherwise return DECL itself. */
4406 omp_clause_decl_field (tree decl
)
4409 && DECL_HAS_VALUE_EXPR_P (decl
)
4410 && DECL_ARTIFICIAL (decl
)
4411 && DECL_LANG_SPECIFIC (decl
)
4412 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4414 tree f
= DECL_VALUE_EXPR (decl
);
4415 if (INDIRECT_REF_P (f
))
4416 f
= TREE_OPERAND (f
, 0);
4417 if (TREE_CODE (f
) == COMPONENT_REF
)
4419 f
= TREE_OPERAND (f
, 1);
4420 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4427 /* Adjust DECL if needed for printing using %qE. */
4430 omp_clause_printable_decl (tree decl
)
4432 tree t
= omp_clause_decl_field (decl
);
4438 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4439 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4443 omp_note_field_privatization (tree f
, tree t
)
4445 if (!omp_private_member_map
)
4446 omp_private_member_map
= new hash_map
<tree
, tree
>;
4447 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4451 omp_private_member_vec
.safe_push (f
);
4452 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4453 omp_private_member_vec
.safe_push (integer_zero_node
);
4457 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4461 omp_privatize_field (tree t
, bool shared
)
4463 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4464 if (m
== error_mark_node
)
4465 return error_mark_node
;
4466 if (!omp_private_member_map
&& !shared
)
4467 omp_private_member_map
= new hash_map
<tree
, tree
>;
4468 if (TYPE_REF_P (TREE_TYPE (t
)))
4470 gcc_assert (INDIRECT_REF_P (m
));
4471 m
= TREE_OPERAND (m
, 0);
4473 tree vb
= NULL_TREE
;
4474 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4477 v
= create_temporary_var (TREE_TYPE (m
));
4478 retrofit_lang_decl (v
);
4479 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4480 SET_DECL_VALUE_EXPR (v
, m
);
4481 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4483 omp_private_member_vec
.safe_push (t
);
4488 /* Helper function for handle_omp_array_sections. Called recursively
4489 to handle multiple array-section-subscripts. C is the clause,
4490 T current expression (initially OMP_CLAUSE_DECL), which is either
4491 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4492 expression if specified, TREE_VALUE length expression if specified,
4493 TREE_CHAIN is what it has been specified after, or some decl.
4494 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4495 set to true if any of the array-section-subscript could have length
4496 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4497 first array-section-subscript which is known not to have length
4499 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4500 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4501 all are or may have length of 1, array-section-subscript [:2] is the
4502 first one known not to have length 1. For array-section-subscript
4503 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4504 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4505 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4506 case though, as some lengths could be zero. */
4509 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4510 bool &maybe_zero_len
, unsigned int &first_non_one
,
4511 enum c_omp_region_type ort
)
4513 tree ret
, low_bound
, length
, type
;
4514 if (TREE_CODE (t
) != TREE_LIST
)
4516 if (error_operand_p (t
))
4517 return error_mark_node
;
4518 if (REFERENCE_REF_P (t
)
4519 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4520 t
= TREE_OPERAND (t
, 0);
4522 if (TREE_CODE (t
) == COMPONENT_REF
4524 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4525 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4526 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4527 && !type_dependent_expression_p (t
))
4529 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4530 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4532 error_at (OMP_CLAUSE_LOCATION (c
),
4533 "bit-field %qE in %qs clause",
4534 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4535 return error_mark_node
;
4537 while (TREE_CODE (t
) == COMPONENT_REF
)
4539 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4540 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4542 error_at (OMP_CLAUSE_LOCATION (c
),
4543 "%qE is a member of a union", t
);
4544 return error_mark_node
;
4546 t
= TREE_OPERAND (t
, 0);
4548 if (REFERENCE_REF_P (t
))
4549 t
= TREE_OPERAND (t
, 0);
4551 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4553 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
4556 error_at (OMP_CLAUSE_LOCATION (c
),
4557 "%qD is not a variable in %qs clause", t
,
4558 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4560 error_at (OMP_CLAUSE_LOCATION (c
),
4561 "%qE is not a variable in %qs clause", t
,
4562 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4563 return error_mark_node
;
4565 else if (TREE_CODE (t
) == PARM_DECL
4566 && DECL_ARTIFICIAL (t
)
4567 && DECL_NAME (t
) == this_identifier
)
4569 error_at (OMP_CLAUSE_LOCATION (c
),
4570 "%<this%> allowed in OpenMP only in %<declare simd%>"
4572 return error_mark_node
;
4574 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4575 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4577 error_at (OMP_CLAUSE_LOCATION (c
),
4578 "%qD is threadprivate variable in %qs clause", t
,
4579 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4580 return error_mark_node
;
4582 if (type_dependent_expression_p (ret
))
4584 ret
= convert_from_reference (ret
);
4588 if (ort
== C_ORT_OMP
4589 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4590 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4591 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4592 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4593 maybe_zero_len
, first_non_one
, ort
);
4594 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4597 type
= TREE_TYPE (ret
);
4598 low_bound
= TREE_PURPOSE (t
);
4599 length
= TREE_VALUE (t
);
4600 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4601 || (length
&& type_dependent_expression_p (length
)))
4604 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4605 return error_mark_node
;
4607 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4609 error_at (OMP_CLAUSE_LOCATION (c
),
4610 "low bound %qE of array section does not have integral type",
4612 return error_mark_node
;
4614 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4616 error_at (OMP_CLAUSE_LOCATION (c
),
4617 "length %qE of array section does not have integral type",
4619 return error_mark_node
;
4622 low_bound
= mark_rvalue_use (low_bound
);
4624 length
= mark_rvalue_use (length
);
4625 /* We need to reduce to real constant-values for checks below. */
4627 length
= fold_simple (length
);
4629 low_bound
= fold_simple (low_bound
);
4631 && TREE_CODE (low_bound
) == INTEGER_CST
4632 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4633 > TYPE_PRECISION (sizetype
))
4634 low_bound
= fold_convert (sizetype
, low_bound
);
4636 && TREE_CODE (length
) == INTEGER_CST
4637 && TYPE_PRECISION (TREE_TYPE (length
))
4638 > TYPE_PRECISION (sizetype
))
4639 length
= fold_convert (sizetype
, length
);
4640 if (low_bound
== NULL_TREE
)
4641 low_bound
= integer_zero_node
;
4643 if (length
!= NULL_TREE
)
4645 if (!integer_nonzerop (length
))
4647 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4648 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4650 if (integer_zerop (length
))
4652 error_at (OMP_CLAUSE_LOCATION (c
),
4653 "zero length array section in %qs clause",
4654 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4655 return error_mark_node
;
4659 maybe_zero_len
= true;
4661 if (first_non_one
== types
.length ()
4662 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4665 if (TREE_CODE (type
) == ARRAY_TYPE
)
4667 if (length
== NULL_TREE
4668 && (TYPE_DOMAIN (type
) == NULL_TREE
4669 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4671 error_at (OMP_CLAUSE_LOCATION (c
),
4672 "for unknown bound array type length expression must "
4674 return error_mark_node
;
4676 if (TREE_CODE (low_bound
) == INTEGER_CST
4677 && tree_int_cst_sgn (low_bound
) == -1)
4679 error_at (OMP_CLAUSE_LOCATION (c
),
4680 "negative low bound in array section in %qs clause",
4681 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4682 return error_mark_node
;
4684 if (length
!= NULL_TREE
4685 && TREE_CODE (length
) == INTEGER_CST
4686 && tree_int_cst_sgn (length
) == -1)
4688 error_at (OMP_CLAUSE_LOCATION (c
),
4689 "negative length in array section in %qs clause",
4690 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4691 return error_mark_node
;
4693 if (TYPE_DOMAIN (type
)
4694 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4695 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4699 = fold_convert (sizetype
, TYPE_MAX_VALUE (TYPE_DOMAIN (type
)));
4700 size
= size_binop (PLUS_EXPR
, size
, size_one_node
);
4701 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4703 if (tree_int_cst_lt (size
, low_bound
))
4705 error_at (OMP_CLAUSE_LOCATION (c
),
4706 "low bound %qE above array section size "
4707 "in %qs clause", low_bound
,
4708 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4709 return error_mark_node
;
4711 if (tree_int_cst_equal (size
, low_bound
))
4713 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4714 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4716 error_at (OMP_CLAUSE_LOCATION (c
),
4717 "zero length array section in %qs clause",
4718 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4719 return error_mark_node
;
4721 maybe_zero_len
= true;
4723 else if (length
== NULL_TREE
4724 && first_non_one
== types
.length ()
4725 && tree_int_cst_equal
4726 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4730 else if (length
== NULL_TREE
)
4732 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4733 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4734 maybe_zero_len
= true;
4735 if (first_non_one
== types
.length ())
4738 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4740 if (tree_int_cst_lt (size
, length
))
4742 error_at (OMP_CLAUSE_LOCATION (c
),
4743 "length %qE above array section size "
4744 "in %qs clause", length
,
4745 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4746 return error_mark_node
;
4748 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4751 = size_binop (PLUS_EXPR
,
4752 fold_convert (sizetype
, low_bound
),
4753 fold_convert (sizetype
, length
));
4754 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4755 && tree_int_cst_lt (size
, lbpluslen
))
4757 error_at (OMP_CLAUSE_LOCATION (c
),
4758 "high bound %qE above array section size "
4759 "in %qs clause", lbpluslen
,
4760 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4761 return error_mark_node
;
4766 else if (length
== NULL_TREE
)
4768 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4769 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4770 maybe_zero_len
= true;
4771 if (first_non_one
== types
.length ())
4775 /* For [lb:] we will need to evaluate lb more than once. */
4776 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4778 tree lb
= cp_save_expr (low_bound
);
4779 if (lb
!= low_bound
)
4781 TREE_PURPOSE (t
) = lb
;
4786 else if (TYPE_PTR_P (type
))
4788 if (length
== NULL_TREE
)
4790 error_at (OMP_CLAUSE_LOCATION (c
),
4791 "for pointer type length expression must be specified");
4792 return error_mark_node
;
4794 if (length
!= NULL_TREE
4795 && TREE_CODE (length
) == INTEGER_CST
4796 && tree_int_cst_sgn (length
) == -1)
4798 error_at (OMP_CLAUSE_LOCATION (c
),
4799 "negative length in array section in %qs clause",
4800 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4801 return error_mark_node
;
4803 /* If there is a pointer type anywhere but in the very first
4804 array-section-subscript, the array section can't be contiguous. */
4805 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4806 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4808 error_at (OMP_CLAUSE_LOCATION (c
),
4809 "array section is not contiguous in %qs clause",
4810 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4811 return error_mark_node
;
4816 error_at (OMP_CLAUSE_LOCATION (c
),
4817 "%qE does not have pointer or array type", ret
);
4818 return error_mark_node
;
4820 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4821 types
.safe_push (TREE_TYPE (ret
));
4822 /* We will need to evaluate lb more than once. */
4823 tree lb
= cp_save_expr (low_bound
);
4824 if (lb
!= low_bound
)
4826 TREE_PURPOSE (t
) = lb
;
4829 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4833 /* Handle array sections for clause C. */
4836 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4838 bool maybe_zero_len
= false;
4839 unsigned int first_non_one
= 0;
4840 auto_vec
<tree
, 10> types
;
4841 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4842 maybe_zero_len
, first_non_one
,
4844 if (first
== error_mark_node
)
4846 if (first
== NULL_TREE
)
4848 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4850 tree t
= OMP_CLAUSE_DECL (c
);
4851 tree tem
= NULL_TREE
;
4852 if (processing_template_decl
)
4854 /* Need to evaluate side effects in the length expressions
4856 while (TREE_CODE (t
) == TREE_LIST
)
4858 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4860 if (tem
== NULL_TREE
)
4861 tem
= TREE_VALUE (t
);
4863 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4864 TREE_VALUE (t
), tem
);
4869 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4870 OMP_CLAUSE_DECL (c
) = first
;
4874 unsigned int num
= types
.length (), i
;
4875 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4876 tree condition
= NULL_TREE
;
4878 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4879 maybe_zero_len
= true;
4880 if (processing_template_decl
&& maybe_zero_len
)
4883 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4886 tree low_bound
= TREE_PURPOSE (t
);
4887 tree length
= TREE_VALUE (t
);
4891 && TREE_CODE (low_bound
) == INTEGER_CST
4892 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4893 > TYPE_PRECISION (sizetype
))
4894 low_bound
= fold_convert (sizetype
, low_bound
);
4896 && TREE_CODE (length
) == INTEGER_CST
4897 && TYPE_PRECISION (TREE_TYPE (length
))
4898 > TYPE_PRECISION (sizetype
))
4899 length
= fold_convert (sizetype
, length
);
4900 if (low_bound
== NULL_TREE
)
4901 low_bound
= integer_zero_node
;
4902 if (!maybe_zero_len
&& i
> first_non_one
)
4904 if (integer_nonzerop (low_bound
))
4905 goto do_warn_noncontiguous
;
4906 if (length
!= NULL_TREE
4907 && TREE_CODE (length
) == INTEGER_CST
4908 && TYPE_DOMAIN (types
[i
])
4909 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4910 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4914 size
= size_binop (PLUS_EXPR
,
4915 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4917 if (!tree_int_cst_equal (length
, size
))
4919 do_warn_noncontiguous
:
4920 error_at (OMP_CLAUSE_LOCATION (c
),
4921 "array section is not contiguous in %qs "
4923 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4927 if (!processing_template_decl
4928 && length
!= NULL_TREE
4929 && TREE_SIDE_EFFECTS (length
))
4931 if (side_effects
== NULL_TREE
)
4932 side_effects
= length
;
4934 side_effects
= build2 (COMPOUND_EXPR
,
4935 TREE_TYPE (side_effects
),
4936 length
, side_effects
);
4939 else if (processing_template_decl
)
4945 if (i
> first_non_one
4946 && ((length
&& integer_nonzerop (length
))
4947 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
))
4950 l
= fold_convert (sizetype
, length
);
4953 l
= size_binop (PLUS_EXPR
,
4954 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4956 l
= size_binop (MINUS_EXPR
, l
,
4957 fold_convert (sizetype
, low_bound
));
4959 if (i
> first_non_one
)
4961 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4963 if (condition
== NULL_TREE
)
4966 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4969 else if (size
== NULL_TREE
)
4971 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4972 tree eltype
= TREE_TYPE (types
[num
- 1]);
4973 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4974 eltype
= TREE_TYPE (eltype
);
4975 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4976 size
= size_binop (EXACT_DIV_EXPR
, size
,
4977 size_in_bytes (eltype
));
4978 size
= size_binop (MULT_EXPR
, size
, l
);
4980 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4981 size
, size_zero_node
);
4984 size
= size_binop (MULT_EXPR
, size
, l
);
4987 if (!processing_template_decl
)
4990 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
4991 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4993 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
4994 tree index_type
= build_index_type (size
);
4995 tree eltype
= TREE_TYPE (first
);
4996 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4997 eltype
= TREE_TYPE (eltype
);
4998 tree type
= build_array_type (eltype
, index_type
);
4999 tree ptype
= build_pointer_type (eltype
);
5000 if (TYPE_REF_P (TREE_TYPE (t
))
5001 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
5002 t
= convert_from_reference (t
);
5003 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5004 t
= build_fold_addr_expr (t
);
5005 tree t2
= build_fold_addr_expr (first
);
5006 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5007 ptrdiff_type_node
, t2
);
5008 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5009 ptrdiff_type_node
, t2
,
5010 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5011 ptrdiff_type_node
, t
));
5012 if (tree_fits_shwi_p (t2
))
5013 t
= build2 (MEM_REF
, type
, t
,
5014 build_int_cst (ptype
, tree_to_shwi (t2
)));
5017 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5019 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5020 TREE_TYPE (t
), t
, t2
);
5021 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5023 OMP_CLAUSE_DECL (c
) = t
;
5026 OMP_CLAUSE_DECL (c
) = first
;
5027 OMP_CLAUSE_SIZE (c
) = size
;
5028 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5029 || (TREE_CODE (t
) == COMPONENT_REF
5030 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5032 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5033 switch (OMP_CLAUSE_MAP_KIND (c
))
5035 case GOMP_MAP_ALLOC
:
5038 case GOMP_MAP_TOFROM
:
5039 case GOMP_MAP_ALWAYS_TO
:
5040 case GOMP_MAP_ALWAYS_FROM
:
5041 case GOMP_MAP_ALWAYS_TOFROM
:
5042 case GOMP_MAP_RELEASE
:
5043 case GOMP_MAP_DELETE
:
5044 case GOMP_MAP_FORCE_TO
:
5045 case GOMP_MAP_FORCE_FROM
:
5046 case GOMP_MAP_FORCE_TOFROM
:
5047 case GOMP_MAP_FORCE_PRESENT
:
5048 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5053 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5055 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5056 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5057 else if (TREE_CODE (t
) == COMPONENT_REF
)
5058 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5059 else if (REFERENCE_REF_P (t
)
5060 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5062 t
= TREE_OPERAND (t
, 0);
5063 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5066 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5067 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5068 && !cxx_mark_addressable (t
))
5070 OMP_CLAUSE_DECL (c2
) = t
;
5071 t
= build_fold_addr_expr (first
);
5072 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5073 ptrdiff_type_node
, t
);
5074 tree ptr
= OMP_CLAUSE_DECL (c2
);
5075 ptr
= convert_from_reference (ptr
);
5076 if (!POINTER_TYPE_P (TREE_TYPE (ptr
)))
5077 ptr
= build_fold_addr_expr (ptr
);
5078 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5079 ptrdiff_type_node
, t
,
5080 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5081 ptrdiff_type_node
, ptr
));
5082 OMP_CLAUSE_SIZE (c2
) = t
;
5083 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5084 OMP_CLAUSE_CHAIN (c
) = c2
;
5085 ptr
= OMP_CLAUSE_DECL (c2
);
5086 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5087 && TYPE_REF_P (TREE_TYPE (ptr
))
5088 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5090 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5092 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5093 OMP_CLAUSE_DECL (c3
) = ptr
;
5094 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5095 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5097 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5098 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5099 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5100 OMP_CLAUSE_CHAIN (c2
) = c3
;
5107 /* Return identifier to look up for omp declare reduction. */
5110 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5112 const char *p
= NULL
;
5113 const char *m
= NULL
;
5114 switch (reduction_code
)
5122 case TRUTH_ANDIF_EXPR
:
5123 case TRUTH_ORIF_EXPR
:
5124 reduction_id
= ovl_op_identifier (false, reduction_code
);
5138 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5139 return error_mark_node
;
5140 p
= IDENTIFIER_POINTER (reduction_id
);
5143 if (type
!= NULL_TREE
)
5144 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5146 const char prefix
[] = "omp declare reduction ";
5147 size_t lenp
= sizeof (prefix
);
5148 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5150 size_t len
= strlen (p
);
5151 size_t lenm
= m
? strlen (m
) + 1 : 0;
5152 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5154 memcpy (name
, prefix
, lenp
- 1);
5155 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5158 name
[lenp
+ len
- 1] = '~';
5159 memcpy (name
+ lenp
+ len
, m
, lenm
);
5161 return get_identifier (name
);
5164 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5165 FUNCTION_DECL or NULL_TREE if not found. */
5168 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5169 vec
<tree
> *ambiguousp
)
5172 tree baselink
= NULL_TREE
;
5173 if (identifier_p (id
))
5176 bool nonint_cst_expression_p
;
5177 const char *error_msg
;
5178 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5179 tree decl
= lookup_name (id
);
5180 if (decl
== NULL_TREE
)
5181 decl
= error_mark_node
;
5182 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5183 &nonint_cst_expression_p
, false, true, false,
5184 false, &error_msg
, loc
);
5185 if (idk
== CP_ID_KIND_UNQUALIFIED
5186 && identifier_p (id
))
5188 vec
<tree
, va_gc
> *args
= NULL
;
5189 vec_safe_push (args
, build_reference_type (type
));
5190 id
= perform_koenig_lookup (id
, args
, tf_none
);
5193 else if (TREE_CODE (id
) == SCOPE_REF
)
5194 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5195 omp_reduction_id (ERROR_MARK
,
5196 TREE_OPERAND (id
, 1),
5201 if (fns
&& is_overloaded_fn (fns
))
5203 for (lkp_iterator
iter (get_fns (fns
)); iter
; ++iter
)
5205 tree fndecl
= *iter
;
5206 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5208 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5209 if (same_type_p (TREE_TYPE (argtype
), type
))
5217 if (id
&& BASELINK_P (fns
))
5226 if (!id
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5228 vec
<tree
> ambiguous
= vNULL
;
5229 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5231 if (ambiguousp
== NULL
)
5232 ambiguousp
= &ambiguous
;
5233 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5235 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5236 baselinkp
? baselinkp
: &baselink
,
5238 if (id
== NULL_TREE
)
5240 if (!ambiguousp
->is_empty ())
5241 ambiguousp
->safe_push (id
);
5242 else if (ret
!= NULL_TREE
)
5244 ambiguousp
->safe_push (ret
);
5245 ambiguousp
->safe_push (id
);
5251 if (ambiguousp
!= &ambiguous
)
5253 if (!ambiguous
.is_empty ())
5255 const char *str
= _("candidates are:");
5258 error_at (loc
, "user defined reduction lookup is ambiguous");
5259 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5261 inform (DECL_SOURCE_LOCATION (udr
), "%s %#qD", str
, udr
);
5263 str
= get_spaces (str
);
5265 ambiguous
.release ();
5266 ret
= error_mark_node
;
5267 baselink
= NULL_TREE
;
5272 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5273 id
, id
, tf_warning_or_error
);
5277 /* Helper function for cp_parser_omp_declare_reduction_exprs
5279 Remove CLEANUP_STMT for data (omp_priv variable).
5280 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5284 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5288 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5289 *tp
= CLEANUP_BODY (*tp
);
5290 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5292 tree decl
= DECL_EXPR_DECL (*tp
);
5293 if (!processing_template_decl
5294 && decl
== (tree
) data
5295 && DECL_INITIAL (decl
)
5296 && DECL_INITIAL (decl
) != error_mark_node
)
5298 tree list
= NULL_TREE
;
5299 append_to_statement_list_force (*tp
, &list
);
5300 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5301 decl
, DECL_INITIAL (decl
));
5302 DECL_INITIAL (decl
) = NULL_TREE
;
5303 append_to_statement_list_force (init_expr
, &list
);
5310 /* Data passed from cp_check_omp_declare_reduction to
5311 cp_check_omp_declare_reduction_r. */
5313 struct cp_check_omp_declare_reduction_data
5320 /* Helper function for cp_check_omp_declare_reduction, called via
5324 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5326 struct cp_check_omp_declare_reduction_data
*udr_data
5327 = (struct cp_check_omp_declare_reduction_data
*) data
;
5329 && !DECL_ARTIFICIAL (*tp
)
5330 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5331 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5333 location_t loc
= udr_data
->loc
;
5334 if (udr_data
->combiner_p
)
5335 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5336 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5339 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5340 "to variable %qD which is not %<omp_priv%> nor "
5348 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5351 cp_check_omp_declare_reduction (tree udr
)
5353 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5354 gcc_assert (TYPE_REF_P (type
));
5355 type
= TREE_TYPE (type
);
5357 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5359 if (type
== error_mark_node
)
5361 if (ARITHMETIC_TYPE_P (type
))
5363 static enum tree_code predef_codes
[]
5364 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5365 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5366 for (i
= 0; i
< 8; i
++)
5368 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5369 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5370 const char *n2
= IDENTIFIER_POINTER (id
);
5371 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5372 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5373 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5378 && TREE_CODE (type
) != COMPLEX_EXPR
)
5380 const char prefix_minmax
[] = "omp declare reduction m";
5381 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5382 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5383 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5384 prefix_minmax
, prefix_size
) == 0
5385 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5386 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5387 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5392 error_at (loc
, "predeclared arithmetic type %qT in "
5393 "%<#pragma omp declare reduction%>", type
);
5397 else if (TREE_CODE (type
) == FUNCTION_TYPE
5398 || TREE_CODE (type
) == METHOD_TYPE
5399 || TREE_CODE (type
) == ARRAY_TYPE
)
5401 error_at (loc
, "function or array type %qT in "
5402 "%<#pragma omp declare reduction%>", type
);
5405 else if (TYPE_REF_P (type
))
5407 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5411 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5413 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5414 "%<#pragma omp declare reduction%>", type
);
5418 tree body
= DECL_SAVED_TREE (udr
);
5419 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5422 tree_stmt_iterator tsi
;
5423 struct cp_check_omp_declare_reduction_data data
;
5424 memset (data
.stmts
, 0, sizeof data
.stmts
);
5425 for (i
= 0, tsi
= tsi_start (body
);
5426 i
< 7 && !tsi_end_p (tsi
);
5427 i
++, tsi_next (&tsi
))
5428 data
.stmts
[i
] = tsi_stmt (tsi
);
5430 gcc_assert (tsi_end_p (tsi
));
5433 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5434 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5435 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5437 data
.combiner_p
= true;
5438 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5440 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5444 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5445 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5446 data
.combiner_p
= false;
5447 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5449 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5450 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5451 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5453 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5457 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5458 an inline call. But, remap
5459 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5460 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5463 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5464 tree decl
, tree placeholder
)
5467 hash_map
<tree
, tree
> decl_map
;
5469 decl_map
.put (omp_decl1
, placeholder
);
5470 decl_map
.put (omp_decl2
, decl
);
5471 memset (&id
, 0, sizeof (id
));
5472 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5473 id
.dst_fn
= current_function_decl
;
5474 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5475 id
.decl_map
= &decl_map
;
5477 id
.copy_decl
= copy_decl_no_change
;
5478 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5479 id
.transform_new_cfg
= true;
5480 id
.transform_return_to_modify
= false;
5481 id
.transform_lang_insert_block
= NULL
;
5483 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5487 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5488 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5491 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5493 if (*tp
== (tree
) data
)
5498 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5499 Return true if there is some error and the clause should be removed. */
5502 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5504 tree t
= OMP_CLAUSE_DECL (c
);
5505 bool predefined
= false;
5506 if (TREE_CODE (t
) == TREE_LIST
)
5508 gcc_assert (processing_template_decl
);
5511 tree type
= TREE_TYPE (t
);
5512 if (TREE_CODE (t
) == MEM_REF
)
5513 type
= TREE_TYPE (type
);
5514 if (TYPE_REF_P (type
))
5515 type
= TREE_TYPE (type
);
5516 if (TREE_CODE (type
) == ARRAY_TYPE
)
5519 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5520 while (TREE_CODE (type
) == ARRAY_TYPE
)
5521 type
= TREE_TYPE (type
);
5522 if (!processing_template_decl
)
5524 t
= require_complete_type (t
);
5525 if (t
== error_mark_node
)
5527 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5528 TYPE_SIZE_UNIT (type
));
5529 if (integer_zerop (size
))
5531 error ("%qE in %<reduction%> clause is a zero size array",
5532 omp_clause_printable_decl (t
));
5535 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5536 tree index_type
= build_index_type (size
);
5537 tree atype
= build_array_type (type
, index_type
);
5538 tree ptype
= build_pointer_type (type
);
5539 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5540 t
= build_fold_addr_expr (t
);
5541 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5542 OMP_CLAUSE_DECL (c
) = t
;
5545 if (type
== error_mark_node
)
5547 else if (ARITHMETIC_TYPE_P (type
))
5548 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5557 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5564 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5568 case TRUTH_ANDIF_EXPR
:
5569 case TRUTH_ORIF_EXPR
:
5570 if (FLOAT_TYPE_P (type
))
5577 else if (TYPE_READONLY (type
))
5579 error ("%qE has const type for %<reduction%>",
5580 omp_clause_printable_decl (t
));
5583 else if (!processing_template_decl
)
5585 t
= require_complete_type (t
);
5586 if (t
== error_mark_node
)
5588 OMP_CLAUSE_DECL (c
) = t
;
5593 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5596 else if (processing_template_decl
)
5598 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) == error_mark_node
)
5603 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5605 type
= TYPE_MAIN_VARIANT (type
);
5606 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5607 if (id
== NULL_TREE
)
5608 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5609 NULL_TREE
, NULL_TREE
);
5610 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5613 if (id
== error_mark_node
)
5616 tree body
= DECL_SAVED_TREE (id
);
5619 if (TREE_CODE (body
) == STATEMENT_LIST
)
5621 tree_stmt_iterator tsi
;
5622 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5625 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5626 atype
= TREE_TYPE (atype
);
5627 bool need_static_cast
= !same_type_p (type
, atype
);
5628 memset (stmts
, 0, sizeof stmts
);
5629 for (i
= 0, tsi
= tsi_start (body
);
5630 i
< 7 && !tsi_end_p (tsi
);
5631 i
++, tsi_next (&tsi
))
5632 stmts
[i
] = tsi_stmt (tsi
);
5633 gcc_assert (tsi_end_p (tsi
));
5637 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5638 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5639 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5640 DECL_ARTIFICIAL (placeholder
) = 1;
5641 DECL_IGNORED_P (placeholder
) = 1;
5642 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5643 if (TREE_CODE (t
) == MEM_REF
)
5645 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5647 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5648 DECL_IGNORED_P (decl_placeholder
) = 1;
5649 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5651 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5652 cxx_mark_addressable (placeholder
);
5653 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5654 && !TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
))))
5655 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5656 : OMP_CLAUSE_DECL (c
));
5657 tree omp_out
= placeholder
;
5658 tree omp_in
= decl_placeholder
? decl_placeholder
5659 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5660 if (need_static_cast
)
5662 tree rtype
= build_reference_type (atype
);
5663 omp_out
= build_static_cast (rtype
, omp_out
,
5664 tf_warning_or_error
);
5665 omp_in
= build_static_cast (rtype
, omp_in
,
5666 tf_warning_or_error
);
5667 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5669 omp_out
= convert_from_reference (omp_out
);
5670 omp_in
= convert_from_reference (omp_in
);
5672 OMP_CLAUSE_REDUCTION_MERGE (c
)
5673 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5674 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5678 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5679 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5680 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5681 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5682 : OMP_CLAUSE_DECL (c
));
5683 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5684 cxx_mark_addressable (placeholder
);
5685 tree omp_priv
= decl_placeholder
? decl_placeholder
5686 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5687 tree omp_orig
= placeholder
;
5688 if (need_static_cast
)
5692 error_at (OMP_CLAUSE_LOCATION (c
),
5693 "user defined reduction with constructor "
5694 "initializer for base class %qT", atype
);
5697 tree rtype
= build_reference_type (atype
);
5698 omp_priv
= build_static_cast (rtype
, omp_priv
,
5699 tf_warning_or_error
);
5700 omp_orig
= build_static_cast (rtype
, omp_orig
,
5701 tf_warning_or_error
);
5702 if (omp_priv
== error_mark_node
5703 || omp_orig
== error_mark_node
)
5705 omp_priv
= convert_from_reference (omp_priv
);
5706 omp_orig
= convert_from_reference (omp_orig
);
5709 *need_default_ctor
= true;
5710 OMP_CLAUSE_REDUCTION_INIT (c
)
5711 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5712 DECL_EXPR_DECL (stmts
[3]),
5713 omp_priv
, omp_orig
);
5714 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5715 find_omp_placeholder_r
, placeholder
, NULL
))
5716 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5720 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5721 *need_default_ctor
= true;
5725 tree v
= decl_placeholder
? decl_placeholder
5726 : convert_from_reference (t
);
5727 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5728 init
= build_constructor (TREE_TYPE (v
), NULL
);
5730 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5731 OMP_CLAUSE_REDUCTION_INIT (c
)
5732 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5737 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5741 error ("user defined reduction not found for %qE",
5742 omp_clause_printable_decl (t
));
5745 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5746 gcc_assert (TYPE_SIZE_UNIT (type
)
5747 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5751 /* Called from finish_struct_1. linear(this) or linear(this:step)
5752 clauses might not be finalized yet because the class has been incomplete
5753 when parsing #pragma omp declare simd methods. Fix those up now. */
5756 finish_omp_declare_simd_methods (tree t
)
5758 if (processing_template_decl
)
5761 for (tree x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
5763 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5765 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5766 if (!ods
|| !TREE_VALUE (ods
))
5768 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5769 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5770 && integer_zerop (OMP_CLAUSE_DECL (c
))
5771 && OMP_CLAUSE_LINEAR_STEP (c
)
5772 && TYPE_PTR_P (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
))))
5774 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5775 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5776 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5777 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5778 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5783 /* Adjust sink depend clause to take into account pointer offsets.
5785 Return TRUE if there was a problem processing the offset, and the
5786 whole clause should be removed. */
5789 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5791 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5792 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5794 /* Make sure we don't adjust things twice for templates. */
5795 if (processing_template_decl
)
5798 for (; t
; t
= TREE_CHAIN (t
))
5800 tree decl
= TREE_VALUE (t
);
5801 if (TYPE_PTR_P (TREE_TYPE (decl
)))
5803 tree offset
= TREE_PURPOSE (t
);
5804 bool neg
= wi::neg_p (wi::to_wide (offset
));
5805 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5806 decl
= mark_rvalue_use (decl
);
5807 decl
= convert_from_reference (decl
);
5808 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5809 neg
? MINUS_EXPR
: PLUS_EXPR
,
5811 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5812 MINUS_EXPR
, sizetype
,
5813 fold_convert (sizetype
, t2
),
5814 fold_convert (sizetype
, decl
));
5815 if (t2
== error_mark_node
)
5817 TREE_PURPOSE (t
) = t2
;
5823 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5824 Remove any elements from the list that are invalid. */
5827 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
5829 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5830 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
5832 tree safelen
= NULL_TREE
;
5833 bool branch_seen
= false;
5834 bool copyprivate_seen
= false;
5835 bool ordered_seen
= false;
5836 bool oacc_async
= false;
5838 bitmap_obstack_initialize (NULL
);
5839 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5840 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5841 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5842 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5843 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
5844 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
5845 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
5847 if (ort
& C_ORT_ACC
)
5848 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
5849 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
5855 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5857 bool remove
= false;
5858 bool field_ok
= false;
5860 switch (OMP_CLAUSE_CODE (c
))
5862 case OMP_CLAUSE_SHARED
:
5863 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5864 goto check_dup_generic
;
5865 case OMP_CLAUSE_PRIVATE
:
5866 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5867 goto check_dup_generic
;
5868 case OMP_CLAUSE_REDUCTION
:
5869 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5870 t
= OMP_CLAUSE_DECL (c
);
5871 if (TREE_CODE (t
) == TREE_LIST
)
5873 if (handle_omp_array_sections (c
, ort
))
5878 if (TREE_CODE (t
) == TREE_LIST
)
5880 while (TREE_CODE (t
) == TREE_LIST
)
5885 gcc_assert (TREE_CODE (t
) == MEM_REF
);
5886 t
= TREE_OPERAND (t
, 0);
5887 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
5888 t
= TREE_OPERAND (t
, 0);
5889 if (TREE_CODE (t
) == ADDR_EXPR
5890 || INDIRECT_REF_P (t
))
5891 t
= TREE_OPERAND (t
, 0);
5893 tree n
= omp_clause_decl_field (t
);
5896 goto check_dup_generic_t
;
5899 cxx_mark_addressable (t
);
5900 goto check_dup_generic
;
5901 case OMP_CLAUSE_COPYPRIVATE
:
5902 copyprivate_seen
= true;
5903 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5904 goto check_dup_generic
;
5905 case OMP_CLAUSE_COPYIN
:
5906 goto check_dup_generic
;
5907 case OMP_CLAUSE_LINEAR
:
5908 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5909 t
= OMP_CLAUSE_DECL (c
);
5910 if (ort
!= C_ORT_OMP_DECLARE_SIMD
5911 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
5913 error_at (OMP_CLAUSE_LOCATION (c
),
5914 "modifier should not be specified in %<linear%> "
5915 "clause on %<simd%> or %<for%> constructs");
5916 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
5918 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5919 && !type_dependent_expression_p (t
))
5921 tree type
= TREE_TYPE (t
);
5922 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5923 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
5924 && !TYPE_REF_P (type
))
5926 error ("linear clause with %qs modifier applied to "
5927 "non-reference variable with %qT type",
5928 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5929 ? "ref" : "uval", TREE_TYPE (t
));
5933 if (TYPE_REF_P (type
))
5934 type
= TREE_TYPE (type
);
5935 if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
5937 if (!INTEGRAL_TYPE_P (type
)
5938 && !TYPE_PTR_P (type
))
5940 error ("linear clause applied to non-integral non-pointer"
5941 " variable with %qT type", TREE_TYPE (t
));
5947 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5949 t
= integer_one_node
;
5950 if (t
== error_mark_node
)
5955 else if (!type_dependent_expression_p (t
)
5956 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5957 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5958 || TREE_CODE (t
) != PARM_DECL
5959 || !TYPE_REF_P (TREE_TYPE (t
))
5960 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
5962 error ("linear step expression must be integral");
5968 t
= mark_rvalue_use (t
);
5969 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
5971 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
5972 goto check_dup_generic
;
5974 if (!processing_template_decl
5975 && (VAR_P (OMP_CLAUSE_DECL (c
))
5976 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
5978 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
5980 t
= maybe_constant_value (t
);
5981 if (TREE_CODE (t
) != INTEGER_CST
)
5983 error_at (OMP_CLAUSE_LOCATION (c
),
5984 "%<linear%> clause step %qE is neither "
5985 "constant nor a parameter", t
);
5990 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5991 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
5992 if (TYPE_REF_P (type
))
5993 type
= TREE_TYPE (type
);
5994 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
5996 type
= build_pointer_type (type
);
5997 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
5998 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6000 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6001 MINUS_EXPR
, sizetype
,
6002 fold_convert (sizetype
, t
),
6003 fold_convert (sizetype
, d
));
6004 if (t
== error_mark_node
)
6010 else if (TYPE_PTR_P (type
)
6011 /* Can't multiply the step yet if *this
6012 is still incomplete type. */
6013 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6014 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6015 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6016 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6018 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6020 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6021 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6023 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6024 MINUS_EXPR
, sizetype
,
6025 fold_convert (sizetype
, t
),
6026 fold_convert (sizetype
, d
));
6027 if (t
== error_mark_node
)
6034 t
= fold_convert (type
, t
);
6036 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6038 goto check_dup_generic
;
6040 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6043 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6044 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6047 t
= OMP_CLAUSE_DECL (c
);
6048 check_dup_generic_t
:
6049 if (t
== current_class_ptr
6050 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6051 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6052 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6054 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6059 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6060 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6062 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6065 error ("%qD is not a variable in clause %qs", t
,
6066 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6068 error ("%qE is not a variable in clause %qs", t
,
6069 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6072 else if (ort
== C_ORT_ACC
6073 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6075 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6077 error ("%qD appears more than once in reduction clauses", t
);
6081 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6083 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6084 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6085 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6087 error ("%qD appears more than once in data clauses", t
);
6090 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6091 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6093 if (ort
== C_ORT_ACC
)
6094 error ("%qD appears more than once in data clauses", t
);
6096 error ("%qD appears both in data and map clauses", t
);
6100 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6105 && TREE_CODE (t
) == FIELD_DECL
6106 && t
== OMP_CLAUSE_DECL (c
)
6107 && ort
!= C_ORT_ACC
)
6110 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6111 == OMP_CLAUSE_SHARED
));
6112 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6117 case OMP_CLAUSE_FIRSTPRIVATE
:
6118 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6120 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6122 t
= OMP_CLAUSE_DECL (c
);
6123 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6125 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6130 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6131 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6132 || TREE_CODE (t
) != FIELD_DECL
))
6134 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6137 error ("%qD is not a variable in clause %<firstprivate%>", t
);
6139 error ("%qE is not a variable in clause %<firstprivate%>", t
);
6142 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6143 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6145 error ("%qD appears more than once in data clauses", t
);
6148 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6150 if (ort
== C_ORT_ACC
)
6151 error ("%qD appears more than once in data clauses", t
);
6153 error ("%qD appears both in data and map clauses", t
);
6157 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6158 goto handle_field_decl
;
6160 case OMP_CLAUSE_LASTPRIVATE
:
6161 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6163 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6165 t
= OMP_CLAUSE_DECL (c
);
6166 if (t
== current_class_ptr
)
6168 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6173 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6174 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6175 || TREE_CODE (t
) != FIELD_DECL
))
6177 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6180 error ("%qD is not a variable in clause %<lastprivate%>", t
);
6182 error ("%qE is not a variable in clause %<lastprivate%>", t
);
6185 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6186 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6188 error ("%qD appears more than once in data clauses", t
);
6192 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6193 goto handle_field_decl
;
6196 t
= OMP_CLAUSE_IF_EXPR (c
);
6197 t
= maybe_convert_cond (t
);
6198 if (t
== error_mark_node
)
6200 else if (!processing_template_decl
)
6201 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6202 OMP_CLAUSE_IF_EXPR (c
) = t
;
6205 case OMP_CLAUSE_FINAL
:
6206 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6207 t
= maybe_convert_cond (t
);
6208 if (t
== error_mark_node
)
6210 else if (!processing_template_decl
)
6211 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6212 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6215 case OMP_CLAUSE_GANG
:
6216 /* Operand 1 is the gang static: argument. */
6217 t
= OMP_CLAUSE_OPERAND (c
, 1);
6220 if (t
== error_mark_node
)
6222 else if (!type_dependent_expression_p (t
)
6223 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6225 error ("%<gang%> static expression must be integral");
6230 t
= mark_rvalue_use (t
);
6231 if (!processing_template_decl
)
6233 t
= maybe_constant_value (t
);
6234 if (TREE_CODE (t
) == INTEGER_CST
6235 && tree_int_cst_sgn (t
) != 1
6236 && t
!= integer_minus_one_node
)
6238 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6239 "%<gang%> static value must be "
6241 t
= integer_one_node
;
6243 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6246 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6248 /* Check operand 0, the num argument. */
6251 case OMP_CLAUSE_WORKER
:
6252 case OMP_CLAUSE_VECTOR
:
6253 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6257 case OMP_CLAUSE_NUM_TASKS
:
6258 case OMP_CLAUSE_NUM_TEAMS
:
6259 case OMP_CLAUSE_NUM_THREADS
:
6260 case OMP_CLAUSE_NUM_GANGS
:
6261 case OMP_CLAUSE_NUM_WORKERS
:
6262 case OMP_CLAUSE_VECTOR_LENGTH
:
6263 t
= OMP_CLAUSE_OPERAND (c
, 0);
6264 if (t
== error_mark_node
)
6266 else if (!type_dependent_expression_p (t
)
6267 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6269 switch (OMP_CLAUSE_CODE (c
))
6271 case OMP_CLAUSE_GANG
:
6272 error_at (OMP_CLAUSE_LOCATION (c
),
6273 "%<gang%> num expression must be integral"); break;
6274 case OMP_CLAUSE_VECTOR
:
6275 error_at (OMP_CLAUSE_LOCATION (c
),
6276 "%<vector%> length expression must be integral");
6278 case OMP_CLAUSE_WORKER
:
6279 error_at (OMP_CLAUSE_LOCATION (c
),
6280 "%<worker%> num expression must be integral");
6283 error_at (OMP_CLAUSE_LOCATION (c
),
6284 "%qs expression must be integral",
6285 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6291 t
= mark_rvalue_use (t
);
6292 if (!processing_template_decl
)
6294 t
= maybe_constant_value (t
);
6295 if (TREE_CODE (t
) == INTEGER_CST
6296 && tree_int_cst_sgn (t
) != 1)
6298 switch (OMP_CLAUSE_CODE (c
))
6300 case OMP_CLAUSE_GANG
:
6301 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6302 "%<gang%> num value must be positive");
6304 case OMP_CLAUSE_VECTOR
:
6305 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6306 "%<vector%> length value must be "
6309 case OMP_CLAUSE_WORKER
:
6310 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6311 "%<worker%> num value must be "
6315 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6316 "%qs value must be positive",
6317 omp_clause_code_name
6318 [OMP_CLAUSE_CODE (c
)]);
6320 t
= integer_one_node
;
6322 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6324 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6328 case OMP_CLAUSE_SCHEDULE
:
6329 if (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
)
6331 const char *p
= NULL
;
6332 switch (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_MASK
)
6334 case OMP_CLAUSE_SCHEDULE_STATIC
: p
= "static"; break;
6335 case OMP_CLAUSE_SCHEDULE_DYNAMIC
: break;
6336 case OMP_CLAUSE_SCHEDULE_GUIDED
: break;
6337 case OMP_CLAUSE_SCHEDULE_AUTO
: p
= "auto"; break;
6338 case OMP_CLAUSE_SCHEDULE_RUNTIME
: p
= "runtime"; break;
6339 default: gcc_unreachable ();
6343 error_at (OMP_CLAUSE_LOCATION (c
),
6344 "%<nonmonotonic%> modifier specified for %qs "
6345 "schedule kind", p
);
6346 OMP_CLAUSE_SCHEDULE_KIND (c
)
6347 = (enum omp_clause_schedule_kind
)
6348 (OMP_CLAUSE_SCHEDULE_KIND (c
)
6349 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
6353 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6356 else if (t
== error_mark_node
)
6358 else if (!type_dependent_expression_p (t
)
6359 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6361 error ("schedule chunk size expression must be integral");
6366 t
= mark_rvalue_use (t
);
6367 if (!processing_template_decl
)
6369 t
= maybe_constant_value (t
);
6370 if (TREE_CODE (t
) == INTEGER_CST
6371 && tree_int_cst_sgn (t
) != 1)
6373 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6374 "chunk size value must be positive");
6375 t
= integer_one_node
;
6377 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6379 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6383 case OMP_CLAUSE_SIMDLEN
:
6384 case OMP_CLAUSE_SAFELEN
:
6385 t
= OMP_CLAUSE_OPERAND (c
, 0);
6386 if (t
== error_mark_node
)
6388 else if (!type_dependent_expression_p (t
)
6389 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6391 error ("%qs length expression must be integral",
6392 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6397 t
= mark_rvalue_use (t
);
6398 if (!processing_template_decl
)
6400 t
= maybe_constant_value (t
);
6401 if (TREE_CODE (t
) != INTEGER_CST
6402 || tree_int_cst_sgn (t
) != 1)
6404 error ("%qs length expression must be positive constant"
6405 " integer expression",
6406 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6410 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6411 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6416 case OMP_CLAUSE_ASYNC
:
6417 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6418 if (t
== error_mark_node
)
6420 else if (!type_dependent_expression_p (t
)
6421 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6423 error ("%<async%> expression must be integral");
6428 t
= mark_rvalue_use (t
);
6429 if (!processing_template_decl
)
6430 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6431 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6435 case OMP_CLAUSE_WAIT
:
6436 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6437 if (t
== error_mark_node
)
6439 else if (!processing_template_decl
)
6440 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6441 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6444 case OMP_CLAUSE_THREAD_LIMIT
:
6445 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6446 if (t
== error_mark_node
)
6448 else if (!type_dependent_expression_p (t
)
6449 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6451 error ("%<thread_limit%> expression must be integral");
6456 t
= mark_rvalue_use (t
);
6457 if (!processing_template_decl
)
6459 t
= maybe_constant_value (t
);
6460 if (TREE_CODE (t
) == INTEGER_CST
6461 && tree_int_cst_sgn (t
) != 1)
6463 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6464 "%<thread_limit%> value must be positive");
6465 t
= integer_one_node
;
6467 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6469 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6473 case OMP_CLAUSE_DEVICE
:
6474 t
= OMP_CLAUSE_DEVICE_ID (c
);
6475 if (t
== error_mark_node
)
6477 else if (!type_dependent_expression_p (t
)
6478 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6480 error ("%<device%> id must be integral");
6485 t
= mark_rvalue_use (t
);
6486 if (!processing_template_decl
)
6487 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6488 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6492 case OMP_CLAUSE_DIST_SCHEDULE
:
6493 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6496 else if (t
== error_mark_node
)
6498 else if (!type_dependent_expression_p (t
)
6499 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6501 error ("%<dist_schedule%> chunk size expression must be "
6507 t
= mark_rvalue_use (t
);
6508 if (!processing_template_decl
)
6509 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6510 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6514 case OMP_CLAUSE_ALIGNED
:
6515 t
= OMP_CLAUSE_DECL (c
);
6516 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6518 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6523 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6525 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6528 error ("%qD is not a variable in %<aligned%> clause", t
);
6530 error ("%qE is not a variable in %<aligned%> clause", t
);
6533 else if (!type_dependent_expression_p (t
)
6534 && !TYPE_PTR_P (TREE_TYPE (t
))
6535 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6536 && (!TYPE_REF_P (TREE_TYPE (t
))
6537 || (!POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6538 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6541 error_at (OMP_CLAUSE_LOCATION (c
),
6542 "%qE in %<aligned%> clause is neither a pointer nor "
6543 "an array nor a reference to pointer or array", t
);
6546 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6548 error ("%qD appears more than once in %<aligned%> clauses", t
);
6552 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6553 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6554 if (t
== error_mark_node
)
6556 else if (t
== NULL_TREE
)
6558 else if (!type_dependent_expression_p (t
)
6559 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6561 error ("%<aligned%> clause alignment expression must "
6567 t
= mark_rvalue_use (t
);
6568 if (!processing_template_decl
)
6570 t
= maybe_constant_value (t
);
6571 if (TREE_CODE (t
) != INTEGER_CST
6572 || tree_int_cst_sgn (t
) != 1)
6574 error ("%<aligned%> clause alignment expression must be "
6575 "positive constant integer expression");
6579 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6583 case OMP_CLAUSE_DEPEND
:
6584 t
= OMP_CLAUSE_DECL (c
);
6587 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6588 == OMP_CLAUSE_DEPEND_SOURCE
);
6591 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6593 if (cp_finish_omp_clause_depend_sink (c
))
6597 if (TREE_CODE (t
) == TREE_LIST
)
6599 if (handle_omp_array_sections (c
, ort
))
6603 if (t
== error_mark_node
)
6605 else if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6607 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6610 error ("%qD is not a variable in %<depend%> clause", t
);
6612 error ("%qE is not a variable in %<depend%> clause", t
);
6615 else if (t
== current_class_ptr
)
6617 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6621 else if (!processing_template_decl
6622 && !cxx_mark_addressable (t
))
6626 case OMP_CLAUSE_MAP
:
6628 case OMP_CLAUSE_FROM
:
6629 case OMP_CLAUSE__CACHE_
:
6630 t
= OMP_CLAUSE_DECL (c
);
6631 if (TREE_CODE (t
) == TREE_LIST
)
6633 if (handle_omp_array_sections (c
, ort
))
6637 t
= OMP_CLAUSE_DECL (c
);
6638 if (TREE_CODE (t
) != TREE_LIST
6639 && !type_dependent_expression_p (t
)
6640 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6642 error_at (OMP_CLAUSE_LOCATION (c
),
6643 "array section does not have mappable type "
6645 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6648 while (TREE_CODE (t
) == ARRAY_REF
)
6649 t
= TREE_OPERAND (t
, 0);
6650 if (TREE_CODE (t
) == COMPONENT_REF
6651 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
6653 while (TREE_CODE (t
) == COMPONENT_REF
)
6654 t
= TREE_OPERAND (t
, 0);
6655 if (REFERENCE_REF_P (t
))
6656 t
= TREE_OPERAND (t
, 0);
6657 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6659 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6661 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6662 error ("%qD appears more than once in motion"
6664 else if (ort
== C_ORT_ACC
)
6665 error ("%qD appears more than once in data"
6668 error ("%qD appears more than once in map"
6674 bitmap_set_bit (&map_head
, DECL_UID (t
));
6675 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6681 if (t
== error_mark_node
)
6686 if (REFERENCE_REF_P (t
)
6687 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
6689 t
= TREE_OPERAND (t
, 0);
6690 OMP_CLAUSE_DECL (c
) = t
;
6692 if (TREE_CODE (t
) == COMPONENT_REF
6693 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6694 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
6696 if (type_dependent_expression_p (t
))
6698 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
6699 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6701 error_at (OMP_CLAUSE_LOCATION (c
),
6702 "bit-field %qE in %qs clause",
6703 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6706 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6708 error_at (OMP_CLAUSE_LOCATION (c
),
6709 "%qE does not have a mappable type in %qs clause",
6710 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6713 while (TREE_CODE (t
) == COMPONENT_REF
)
6715 if (TREE_TYPE (TREE_OPERAND (t
, 0))
6716 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
6719 error_at (OMP_CLAUSE_LOCATION (c
),
6720 "%qE is a member of a union", t
);
6724 t
= TREE_OPERAND (t
, 0);
6728 if (REFERENCE_REF_P (t
))
6729 t
= TREE_OPERAND (t
, 0);
6730 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6732 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6733 goto handle_map_references
;
6736 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6738 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6740 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6741 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6742 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
6745 error ("%qD is not a variable in %qs clause", t
,
6746 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6748 error ("%qE is not a variable in %qs clause", t
,
6749 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6752 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
6754 error ("%qD is threadprivate variable in %qs clause", t
,
6755 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6758 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6760 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6765 else if (!processing_template_decl
6766 && !TYPE_REF_P (TREE_TYPE (t
))
6767 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
6768 || (OMP_CLAUSE_MAP_KIND (c
)
6769 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
6770 && !cxx_mark_addressable (t
))
6772 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6773 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6774 || (OMP_CLAUSE_MAP_KIND (c
)
6775 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
6776 && t
== OMP_CLAUSE_DECL (c
)
6777 && !type_dependent_expression_p (t
)
6778 && !cp_omp_mappable_type (TYPE_REF_P (TREE_TYPE (t
))
6779 ? TREE_TYPE (TREE_TYPE (t
))
6782 error_at (OMP_CLAUSE_LOCATION (c
),
6783 "%qD does not have a mappable type in %qs clause", t
,
6784 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6787 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6788 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
6789 && !type_dependent_expression_p (t
)
6790 && !POINTER_TYPE_P (TREE_TYPE (t
)))
6792 error ("%qD is not a pointer variable", t
);
6795 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6796 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
6798 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6799 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6801 error ("%qD appears more than once in data clauses", t
);
6804 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6806 if (ort
== C_ORT_ACC
)
6807 error ("%qD appears more than once in data clauses", t
);
6809 error ("%qD appears both in data and map clauses", t
);
6813 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6815 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6817 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6818 error ("%qD appears more than once in motion clauses", t
);
6819 if (ort
== C_ORT_ACC
)
6820 error ("%qD appears more than once in data clauses", t
);
6822 error ("%qD appears more than once in map clauses", t
);
6825 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6826 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6828 if (ort
== C_ORT_ACC
)
6829 error ("%qD appears more than once in data clauses", t
);
6831 error ("%qD appears both in data and map clauses", t
);
6836 bitmap_set_bit (&map_head
, DECL_UID (t
));
6837 if (t
!= OMP_CLAUSE_DECL (c
)
6838 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
6839 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6841 handle_map_references
:
6843 && !processing_template_decl
6844 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6845 && TYPE_REF_P (TREE_TYPE (OMP_CLAUSE_DECL (c
))))
6847 t
= OMP_CLAUSE_DECL (c
);
6848 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6850 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6851 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6853 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6855 else if (OMP_CLAUSE_MAP_KIND (c
)
6856 != GOMP_MAP_FIRSTPRIVATE_POINTER
6857 && (OMP_CLAUSE_MAP_KIND (c
)
6858 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
6859 && (OMP_CLAUSE_MAP_KIND (c
)
6860 != GOMP_MAP_ALWAYS_POINTER
))
6862 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
6864 if (TREE_CODE (t
) == COMPONENT_REF
)
6865 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
6867 OMP_CLAUSE_SET_MAP_KIND (c2
,
6868 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
6869 OMP_CLAUSE_DECL (c2
) = t
;
6870 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
6871 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
6872 OMP_CLAUSE_CHAIN (c
) = c2
;
6873 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6874 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6876 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6882 case OMP_CLAUSE_TO_DECLARE
:
6883 case OMP_CLAUSE_LINK
:
6884 t
= OMP_CLAUSE_DECL (c
);
6885 if (TREE_CODE (t
) == FUNCTION_DECL
6886 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6888 else if (!VAR_P (t
))
6890 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6892 if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
6893 error_at (OMP_CLAUSE_LOCATION (c
),
6894 "template %qE in clause %qs", t
,
6895 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6896 else if (really_overloaded_fn (t
))
6897 error_at (OMP_CLAUSE_LOCATION (c
),
6898 "overloaded function name %qE in clause %qs", t
,
6899 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6901 error_at (OMP_CLAUSE_LOCATION (c
),
6902 "%qE is neither a variable nor a function name "
6904 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6907 error_at (OMP_CLAUSE_LOCATION (c
),
6908 "%qE is not a variable in clause %qs", t
,
6909 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6912 else if (DECL_THREAD_LOCAL_P (t
))
6914 error_at (OMP_CLAUSE_LOCATION (c
),
6915 "%qD is threadprivate variable in %qs clause", t
,
6916 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6919 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6921 error_at (OMP_CLAUSE_LOCATION (c
),
6922 "%qD does not have a mappable type in %qs clause", t
,
6923 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6928 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
6930 error_at (OMP_CLAUSE_LOCATION (c
),
6931 "%qE appears more than once on the same "
6932 "%<declare target%> directive", t
);
6936 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6939 case OMP_CLAUSE_UNIFORM
:
6940 t
= OMP_CLAUSE_DECL (c
);
6941 if (TREE_CODE (t
) != PARM_DECL
)
6943 if (processing_template_decl
)
6946 error ("%qD is not an argument in %<uniform%> clause", t
);
6948 error ("%qE is not an argument in %<uniform%> clause", t
);
6952 /* map_head bitmap is used as uniform_head if declare_simd. */
6953 bitmap_set_bit (&map_head
, DECL_UID (t
));
6954 goto check_dup_generic
;
6956 case OMP_CLAUSE_GRAINSIZE
:
6957 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
6958 if (t
== error_mark_node
)
6960 else if (!type_dependent_expression_p (t
)
6961 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6963 error ("%<grainsize%> expression must be integral");
6968 t
= mark_rvalue_use (t
);
6969 if (!processing_template_decl
)
6971 t
= maybe_constant_value (t
);
6972 if (TREE_CODE (t
) == INTEGER_CST
6973 && tree_int_cst_sgn (t
) != 1)
6975 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6976 "%<grainsize%> value must be positive");
6977 t
= integer_one_node
;
6979 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6981 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
6985 case OMP_CLAUSE_PRIORITY
:
6986 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
6987 if (t
== error_mark_node
)
6989 else if (!type_dependent_expression_p (t
)
6990 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6992 error ("%<priority%> expression must be integral");
6997 t
= mark_rvalue_use (t
);
6998 if (!processing_template_decl
)
7000 t
= maybe_constant_value (t
);
7001 if (TREE_CODE (t
) == INTEGER_CST
7002 && tree_int_cst_sgn (t
) == -1)
7004 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7005 "%<priority%> value must be non-negative");
7006 t
= integer_one_node
;
7008 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7010 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7014 case OMP_CLAUSE_HINT
:
7015 t
= OMP_CLAUSE_HINT_EXPR (c
);
7016 if (t
== error_mark_node
)
7018 else if (!type_dependent_expression_p (t
)
7019 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7021 error ("%<num_tasks%> expression must be integral");
7026 t
= mark_rvalue_use (t
);
7027 if (!processing_template_decl
)
7029 t
= maybe_constant_value (t
);
7030 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7032 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7036 case OMP_CLAUSE_IS_DEVICE_PTR
:
7037 case OMP_CLAUSE_USE_DEVICE_PTR
:
7038 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7039 t
= OMP_CLAUSE_DECL (c
);
7040 if (!type_dependent_expression_p (t
))
7042 tree type
= TREE_TYPE (t
);
7043 if (!TYPE_PTR_P (type
)
7044 && TREE_CODE (type
) != ARRAY_TYPE
7045 && (!TYPE_REF_P (type
)
7046 || (!TYPE_PTR_P (TREE_TYPE (type
))
7047 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
7049 error_at (OMP_CLAUSE_LOCATION (c
),
7050 "%qs variable is neither a pointer, nor an array "
7051 "nor reference to pointer or array",
7052 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7056 goto check_dup_generic
;
7058 case OMP_CLAUSE_NOWAIT
:
7059 case OMP_CLAUSE_DEFAULT
:
7060 case OMP_CLAUSE_UNTIED
:
7061 case OMP_CLAUSE_COLLAPSE
:
7062 case OMP_CLAUSE_MERGEABLE
:
7063 case OMP_CLAUSE_PARALLEL
:
7064 case OMP_CLAUSE_FOR
:
7065 case OMP_CLAUSE_SECTIONS
:
7066 case OMP_CLAUSE_TASKGROUP
:
7067 case OMP_CLAUSE_PROC_BIND
:
7068 case OMP_CLAUSE_NOGROUP
:
7069 case OMP_CLAUSE_THREADS
:
7070 case OMP_CLAUSE_SIMD
:
7071 case OMP_CLAUSE_DEFAULTMAP
:
7072 case OMP_CLAUSE_AUTO
:
7073 case OMP_CLAUSE_INDEPENDENT
:
7074 case OMP_CLAUSE_SEQ
:
7077 case OMP_CLAUSE_TILE
:
7078 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7079 list
= TREE_CHAIN (list
))
7081 t
= TREE_VALUE (list
);
7083 if (t
== error_mark_node
)
7085 else if (!type_dependent_expression_p (t
)
7086 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7088 error_at (OMP_CLAUSE_LOCATION (c
),
7089 "%<tile%> argument needs integral type");
7094 t
= mark_rvalue_use (t
);
7095 if (!processing_template_decl
)
7097 /* Zero is used to indicate '*', we permit you
7098 to get there via an ICE of value zero. */
7099 t
= maybe_constant_value (t
);
7100 if (!tree_fits_shwi_p (t
)
7101 || tree_to_shwi (t
) < 0)
7103 error_at (OMP_CLAUSE_LOCATION (c
),
7104 "%<tile%> argument needs positive "
7105 "integral constant");
7108 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7112 /* Update list item. */
7113 TREE_VALUE (list
) = t
;
7117 case OMP_CLAUSE_ORDERED
:
7118 ordered_seen
= true;
7121 case OMP_CLAUSE_INBRANCH
:
7122 case OMP_CLAUSE_NOTINBRANCH
:
7125 error ("%<inbranch%> clause is incompatible with "
7137 *pc
= OMP_CLAUSE_CHAIN (c
);
7139 pc
= &OMP_CLAUSE_CHAIN (c
);
7142 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7144 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7145 bool remove
= false;
7146 bool need_complete_type
= false;
7147 bool need_default_ctor
= false;
7148 bool need_copy_ctor
= false;
7149 bool need_copy_assignment
= false;
7150 bool need_implicitly_determined
= false;
7151 bool need_dtor
= false;
7152 tree type
, inner_type
;
7156 case OMP_CLAUSE_SHARED
:
7157 need_implicitly_determined
= true;
7159 case OMP_CLAUSE_PRIVATE
:
7160 need_complete_type
= true;
7161 need_default_ctor
= true;
7163 need_implicitly_determined
= true;
7165 case OMP_CLAUSE_FIRSTPRIVATE
:
7166 need_complete_type
= true;
7167 need_copy_ctor
= true;
7169 need_implicitly_determined
= true;
7171 case OMP_CLAUSE_LASTPRIVATE
:
7172 need_complete_type
= true;
7173 need_copy_assignment
= true;
7174 need_implicitly_determined
= true;
7176 case OMP_CLAUSE_REDUCTION
:
7177 need_implicitly_determined
= true;
7179 case OMP_CLAUSE_LINEAR
:
7180 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7181 need_implicitly_determined
= true;
7182 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7183 && !bitmap_bit_p (&map_head
,
7184 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7186 error_at (OMP_CLAUSE_LOCATION (c
),
7187 "%<linear%> clause step is a parameter %qD not "
7188 "specified in %<uniform%> clause",
7189 OMP_CLAUSE_LINEAR_STEP (c
));
7190 *pc
= OMP_CLAUSE_CHAIN (c
);
7194 case OMP_CLAUSE_COPYPRIVATE
:
7195 need_copy_assignment
= true;
7197 case OMP_CLAUSE_COPYIN
:
7198 need_copy_assignment
= true;
7200 case OMP_CLAUSE_SIMDLEN
:
7202 && !processing_template_decl
7203 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7204 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7206 error_at (OMP_CLAUSE_LOCATION (c
),
7207 "%<simdlen%> clause value is bigger than "
7208 "%<safelen%> clause value");
7209 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7210 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7212 pc
= &OMP_CLAUSE_CHAIN (c
);
7214 case OMP_CLAUSE_SCHEDULE
:
7216 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7217 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7219 error_at (OMP_CLAUSE_LOCATION (c
),
7220 "%<nonmonotonic%> schedule modifier specified "
7221 "together with %<ordered%> clause");
7222 OMP_CLAUSE_SCHEDULE_KIND (c
)
7223 = (enum omp_clause_schedule_kind
)
7224 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7225 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7227 pc
= &OMP_CLAUSE_CHAIN (c
);
7229 case OMP_CLAUSE_NOWAIT
:
7230 if (copyprivate_seen
)
7232 error_at (OMP_CLAUSE_LOCATION (c
),
7233 "%<nowait%> clause must not be used together "
7234 "with %<copyprivate%>");
7235 *pc
= OMP_CLAUSE_CHAIN (c
);
7240 pc
= &OMP_CLAUSE_CHAIN (c
);
7244 t
= OMP_CLAUSE_DECL (c
);
7245 if (processing_template_decl
7246 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7248 pc
= &OMP_CLAUSE_CHAIN (c
);
7254 case OMP_CLAUSE_LASTPRIVATE
:
7255 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7257 need_default_ctor
= true;
7262 case OMP_CLAUSE_REDUCTION
:
7263 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7267 t
= OMP_CLAUSE_DECL (c
);
7270 case OMP_CLAUSE_COPYIN
:
7271 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7273 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
7282 if (need_complete_type
|| need_copy_assignment
)
7284 t
= require_complete_type (t
);
7285 if (t
== error_mark_node
)
7287 else if (TYPE_REF_P (TREE_TYPE (t
))
7288 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7291 if (need_implicitly_determined
)
7293 const char *share_name
= NULL
;
7295 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7296 share_name
= "threadprivate";
7297 else switch (cxx_omp_predetermined_sharing_1 (t
))
7299 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7301 case OMP_CLAUSE_DEFAULT_SHARED
:
7302 /* const vars may be specified in firstprivate clause. */
7303 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7304 && cxx_omp_const_qual_no_mutable (t
))
7306 share_name
= "shared";
7308 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7309 share_name
= "private";
7316 error ("%qE is predetermined %qs for %qs",
7317 omp_clause_printable_decl (t
), share_name
,
7318 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7323 /* We're interested in the base element, not arrays. */
7324 inner_type
= type
= TREE_TYPE (t
);
7325 if ((need_complete_type
7326 || need_copy_assignment
7327 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
7328 && TYPE_REF_P (inner_type
))
7329 inner_type
= TREE_TYPE (inner_type
);
7330 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7331 inner_type
= TREE_TYPE (inner_type
);
7333 /* Check for special function availability by building a call to one.
7334 Save the results, because later we won't be in the right context
7335 for making these queries. */
7336 if (CLASS_TYPE_P (inner_type
)
7337 && COMPLETE_TYPE_P (inner_type
)
7338 && (need_default_ctor
|| need_copy_ctor
7339 || need_copy_assignment
|| need_dtor
)
7340 && !type_dependent_expression_p (t
)
7341 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7342 need_copy_ctor
, need_copy_assignment
,
7347 && c_kind
== OMP_CLAUSE_SHARED
7348 && processing_template_decl
)
7350 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7352 OMP_CLAUSE_DECL (c
) = t
;
7356 *pc
= OMP_CLAUSE_CHAIN (c
);
7358 pc
= &OMP_CLAUSE_CHAIN (c
);
7361 bitmap_obstack_release (NULL
);
7365 /* Start processing OpenMP clauses that can include any
7366 privatization clauses for non-static data members. */
7369 push_omp_privatization_clauses (bool ignore_next
)
7371 if (omp_private_member_ignore_next
)
7373 omp_private_member_ignore_next
= ignore_next
;
7376 omp_private_member_ignore_next
= ignore_next
;
7377 if (omp_private_member_map
)
7378 omp_private_member_vec
.safe_push (error_mark_node
);
7379 return push_stmt_list ();
7382 /* Revert remapping of any non-static data members since
7383 the last push_omp_privatization_clauses () call. */
7386 pop_omp_privatization_clauses (tree stmt
)
7388 if (stmt
== NULL_TREE
)
7390 stmt
= pop_stmt_list (stmt
);
7391 if (omp_private_member_map
)
7393 while (!omp_private_member_vec
.is_empty ())
7395 tree t
= omp_private_member_vec
.pop ();
7396 if (t
== error_mark_node
)
7401 bool no_decl_expr
= t
== integer_zero_node
;
7403 t
= omp_private_member_vec
.pop ();
7404 tree
*v
= omp_private_member_map
->get (t
);
7408 omp_private_member_map
->remove (t
);
7410 delete omp_private_member_map
;
7411 omp_private_member_map
= NULL
;
7416 /* Remember OpenMP privatization clauses mapping and clear it.
7417 Used for lambdas. */
7420 save_omp_privatization_clauses (vec
<tree
> &save
)
7423 if (omp_private_member_ignore_next
)
7424 save
.safe_push (integer_one_node
);
7425 omp_private_member_ignore_next
= false;
7426 if (!omp_private_member_map
)
7429 while (!omp_private_member_vec
.is_empty ())
7431 tree t
= omp_private_member_vec
.pop ();
7432 if (t
== error_mark_node
)
7438 if (t
== integer_zero_node
)
7439 t
= omp_private_member_vec
.pop ();
7440 tree
*v
= omp_private_member_map
->get (t
);
7442 save
.safe_push (*v
);
7447 delete omp_private_member_map
;
7448 omp_private_member_map
= NULL
;
7451 /* Restore OpenMP privatization clauses mapping saved by the
7455 restore_omp_privatization_clauses (vec
<tree
> &save
)
7457 gcc_assert (omp_private_member_vec
.is_empty ());
7458 omp_private_member_ignore_next
= false;
7459 if (save
.is_empty ())
7461 if (save
.length () == 1 && save
[0] == integer_one_node
)
7463 omp_private_member_ignore_next
= true;
7468 omp_private_member_map
= new hash_map
<tree
, tree
>;
7469 while (!save
.is_empty ())
7471 tree t
= save
.pop ();
7473 if (t
!= error_mark_node
)
7475 if (t
== integer_one_node
)
7477 omp_private_member_ignore_next
= true;
7478 gcc_assert (save
.is_empty ());
7481 if (t
== integer_zero_node
)
7483 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7486 omp_private_member_vec
.safe_push (t
);
7488 omp_private_member_vec
.safe_push (n
);
7493 /* For all variables in the tree_list VARS, mark them as thread local. */
7496 finish_omp_threadprivate (tree vars
)
7500 /* Mark every variable in VARS to be assigned thread local storage. */
7501 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7503 tree v
= TREE_PURPOSE (t
);
7505 if (error_operand_p (v
))
7507 else if (!VAR_P (v
))
7508 error ("%<threadprivate%> %qD is not file, namespace "
7509 "or block scope variable", v
);
7510 /* If V had already been marked threadprivate, it doesn't matter
7511 whether it had been used prior to this point. */
7512 else if (TREE_USED (v
)
7513 && (DECL_LANG_SPECIFIC (v
) == NULL
7514 || !CP_DECL_THREADPRIVATE_P (v
)))
7515 error ("%qE declared %<threadprivate%> after first use", v
);
7516 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7517 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7518 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7519 error ("%<threadprivate%> %qE has incomplete type", v
);
7520 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7521 && CP_DECL_CONTEXT (v
) != current_class_type
)
7522 error ("%<threadprivate%> %qE directive not "
7523 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7526 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7527 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7529 retrofit_lang_decl (v
);
7531 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
7532 after the allocation of the lang_decl structure. */
7533 if (DECL_DISCRIMINATOR_P (v
))
7534 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
7537 if (! CP_DECL_THREAD_LOCAL_P (v
))
7539 CP_DECL_THREAD_LOCAL_P (v
) = true;
7540 set_decl_tls_model (v
, decl_default_tls_model (v
));
7541 /* If rtl has been already set for this var, call
7542 make_decl_rtl once again, so that encode_section_info
7543 has a chance to look at the new decl flags. */
7544 if (DECL_RTL_SET_P (v
))
7547 CP_DECL_THREADPRIVATE_P (v
) = 1;
7552 /* Build an OpenMP structured block. */
7555 begin_omp_structured_block (void)
7557 return do_pushlevel (sk_omp
);
7561 finish_omp_structured_block (tree block
)
7563 return do_poplevel (block
);
7566 /* Similarly, except force the retention of the BLOCK. */
7569 begin_omp_parallel (void)
7571 keep_next_level (true);
7572 return begin_omp_structured_block ();
7575 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7579 finish_oacc_data (tree clauses
, tree block
)
7583 block
= finish_omp_structured_block (block
);
7585 stmt
= make_node (OACC_DATA
);
7586 TREE_TYPE (stmt
) = void_type_node
;
7587 OACC_DATA_CLAUSES (stmt
) = clauses
;
7588 OACC_DATA_BODY (stmt
) = block
;
7590 return add_stmt (stmt
);
7593 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
7597 finish_oacc_host_data (tree clauses
, tree block
)
7601 block
= finish_omp_structured_block (block
);
7603 stmt
= make_node (OACC_HOST_DATA
);
7604 TREE_TYPE (stmt
) = void_type_node
;
7605 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
7606 OACC_HOST_DATA_BODY (stmt
) = block
;
7608 return add_stmt (stmt
);
7611 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
7615 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
7617 body
= finish_omp_structured_block (body
);
7619 tree stmt
= make_node (code
);
7620 TREE_TYPE (stmt
) = void_type_node
;
7621 OMP_BODY (stmt
) = body
;
7622 OMP_CLAUSES (stmt
) = clauses
;
7624 return add_stmt (stmt
);
7628 finish_omp_parallel (tree clauses
, tree body
)
7632 body
= finish_omp_structured_block (body
);
7634 stmt
= make_node (OMP_PARALLEL
);
7635 TREE_TYPE (stmt
) = void_type_node
;
7636 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
7637 OMP_PARALLEL_BODY (stmt
) = body
;
7639 return add_stmt (stmt
);
7643 begin_omp_task (void)
7645 keep_next_level (true);
7646 return begin_omp_structured_block ();
7650 finish_omp_task (tree clauses
, tree body
)
7654 body
= finish_omp_structured_block (body
);
7656 stmt
= make_node (OMP_TASK
);
7657 TREE_TYPE (stmt
) = void_type_node
;
7658 OMP_TASK_CLAUSES (stmt
) = clauses
;
7659 OMP_TASK_BODY (stmt
) = body
;
7661 return add_stmt (stmt
);
7664 /* Helper function for finish_omp_for. Convert Ith random access iterator
7665 into integral iterator. Return FALSE if successful. */
7668 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
7669 tree declv
, tree orig_declv
, tree initv
,
7670 tree condv
, tree incrv
, tree
*body
,
7671 tree
*pre_body
, tree
&clauses
, tree
*lastp
,
7672 int collapse
, int ordered
)
7674 tree diff
, iter_init
, iter_incr
= NULL
, last
;
7675 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
7676 tree decl
= TREE_VEC_ELT (declv
, i
);
7677 tree init
= TREE_VEC_ELT (initv
, i
);
7678 tree cond
= TREE_VEC_ELT (condv
, i
);
7679 tree incr
= TREE_VEC_ELT (incrv
, i
);
7681 location_t elocus
= locus
;
7683 if (init
&& EXPR_HAS_LOCATION (init
))
7684 elocus
= EXPR_LOCATION (init
);
7686 cond
= cp_fully_fold (cond
);
7687 switch (TREE_CODE (cond
))
7694 if (TREE_OPERAND (cond
, 1) == iter
)
7695 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
7696 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
7697 if (TREE_OPERAND (cond
, 0) != iter
)
7698 cond
= error_mark_node
;
7701 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
7704 TREE_OPERAND (cond
, 1), ERROR_MARK
,
7705 NULL
, tf_warning_or_error
);
7706 if (error_operand_p (tem
))
7711 cond
= error_mark_node
;
7714 if (cond
== error_mark_node
)
7716 error_at (elocus
, "invalid controlling predicate");
7719 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
7720 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
7721 tf_warning_or_error
);
7722 diff
= cp_fully_fold (diff
);
7723 if (error_operand_p (diff
))
7725 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
7727 error_at (elocus
, "difference between %qE and %qD does not have integer type",
7728 TREE_OPERAND (cond
, 1), iter
);
7731 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
7732 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
7733 cond
, cp_walk_subtrees
))
7736 switch (TREE_CODE (incr
))
7738 case PREINCREMENT_EXPR
:
7739 case PREDECREMENT_EXPR
:
7740 case POSTINCREMENT_EXPR
:
7741 case POSTDECREMENT_EXPR
:
7742 if (TREE_OPERAND (incr
, 0) != iter
)
7744 incr
= error_mark_node
;
7747 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
7748 TREE_CODE (incr
), iter
,
7749 tf_warning_or_error
);
7750 if (error_operand_p (iter_incr
))
7752 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
7753 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
7754 incr
= integer_one_node
;
7756 incr
= integer_minus_one_node
;
7759 if (TREE_OPERAND (incr
, 0) != iter
)
7760 incr
= error_mark_node
;
7761 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
7762 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
7764 tree rhs
= TREE_OPERAND (incr
, 1);
7765 if (TREE_OPERAND (rhs
, 0) == iter
)
7767 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
7769 incr
= error_mark_node
;
7772 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7773 iter
, TREE_CODE (rhs
),
7774 TREE_OPERAND (rhs
, 1),
7775 tf_warning_or_error
);
7776 if (error_operand_p (iter_incr
))
7778 incr
= TREE_OPERAND (rhs
, 1);
7779 incr
= cp_convert (TREE_TYPE (diff
), incr
,
7780 tf_warning_or_error
);
7781 if (TREE_CODE (rhs
) == MINUS_EXPR
)
7783 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
7784 incr
= fold_simple (incr
);
7786 if (TREE_CODE (incr
) != INTEGER_CST
7787 && (TREE_CODE (incr
) != NOP_EXPR
7788 || (TREE_CODE (TREE_OPERAND (incr
, 0))
7793 else if (TREE_OPERAND (rhs
, 1) == iter
)
7795 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
7796 || TREE_CODE (rhs
) != PLUS_EXPR
)
7797 incr
= error_mark_node
;
7800 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
7802 TREE_OPERAND (rhs
, 0),
7805 tf_warning_or_error
);
7806 if (error_operand_p (iter_incr
))
7808 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7811 tf_warning_or_error
);
7812 if (error_operand_p (iter_incr
))
7814 incr
= TREE_OPERAND (rhs
, 0);
7819 incr
= error_mark_node
;
7822 incr
= error_mark_node
;
7825 incr
= error_mark_node
;
7829 if (incr
== error_mark_node
)
7831 error_at (elocus
, "invalid increment expression");
7835 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
7836 bool taskloop_iv_seen
= false;
7837 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
7838 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
7839 && OMP_CLAUSE_DECL (c
) == iter
)
7841 if (code
== OMP_TASKLOOP
)
7843 taskloop_iv_seen
= true;
7844 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
7848 else if (code
== OMP_TASKLOOP
7849 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
7850 && OMP_CLAUSE_DECL (c
) == iter
)
7852 taskloop_iv_seen
= true;
7853 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
7856 decl
= create_temporary_var (TREE_TYPE (diff
));
7858 add_decl_expr (decl
);
7859 last
= create_temporary_var (TREE_TYPE (diff
));
7861 add_decl_expr (last
);
7862 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
7863 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7865 incr_var
= create_temporary_var (TREE_TYPE (diff
));
7866 pushdecl (incr_var
);
7867 add_decl_expr (incr_var
);
7869 gcc_assert (stmts_are_full_exprs_p ());
7870 tree diffvar
= NULL_TREE
;
7871 if (code
== OMP_TASKLOOP
)
7873 if (!taskloop_iv_seen
)
7875 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7876 OMP_CLAUSE_DECL (ivc
) = iter
;
7877 cxx_omp_finish_clause (ivc
, NULL
);
7878 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
7881 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7882 OMP_CLAUSE_DECL (lvc
) = last
;
7883 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
7885 diffvar
= create_temporary_var (TREE_TYPE (diff
));
7887 add_decl_expr (diffvar
);
7890 orig_pre_body
= *pre_body
;
7891 *pre_body
= push_stmt_list ();
7893 add_stmt (orig_pre_body
);
7895 finish_expr_stmt (build_x_modify_expr (elocus
,
7896 iter
, NOP_EXPR
, init
,
7897 tf_warning_or_error
));
7898 init
= build_int_cst (TREE_TYPE (diff
), 0);
7899 if (c
&& iter_incr
== NULL
7900 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7904 finish_expr_stmt (build_x_modify_expr (elocus
,
7906 incr
, tf_warning_or_error
));
7909 iter_incr
= build_x_modify_expr (elocus
,
7910 iter
, PLUS_EXPR
, incr
,
7911 tf_warning_or_error
);
7913 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
7915 finish_expr_stmt (build_x_modify_expr (elocus
,
7916 last
, NOP_EXPR
, init
,
7917 tf_warning_or_error
));
7920 finish_expr_stmt (build_x_modify_expr (elocus
,
7922 diff
, tf_warning_or_error
));
7925 *pre_body
= pop_stmt_list (*pre_body
);
7927 cond
= cp_build_binary_op (elocus
,
7928 TREE_CODE (cond
), decl
, diff
,
7929 tf_warning_or_error
);
7930 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
7931 elocus
, incr
, NULL_TREE
);
7934 *body
= push_stmt_list ();
7935 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
7936 iter_init
= build_x_modify_expr (elocus
,
7937 iter
, PLUS_EXPR
, iter_init
,
7938 tf_warning_or_error
);
7939 if (iter_init
!= error_mark_node
)
7940 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7941 finish_expr_stmt (iter_init
);
7942 finish_expr_stmt (build_x_modify_expr (elocus
,
7943 last
, NOP_EXPR
, decl
,
7944 tf_warning_or_error
));
7945 add_stmt (orig_body
);
7946 *body
= pop_stmt_list (*body
);
7950 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
7952 finish_expr_stmt (iter_incr
);
7956 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
7957 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
7958 iter_init
, iter_incr
);
7959 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
7960 iter_init
= build_x_modify_expr (elocus
,
7961 iter
, PLUS_EXPR
, iter_init
,
7962 tf_warning_or_error
);
7963 if (iter_init
!= error_mark_node
)
7964 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7965 finish_expr_stmt (iter_init
);
7967 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
7968 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
7971 TREE_VEC_ELT (declv
, i
) = decl
;
7972 TREE_VEC_ELT (initv
, i
) = init
;
7973 TREE_VEC_ELT (condv
, i
) = cond
;
7974 TREE_VEC_ELT (incrv
, i
) = incr
;
7980 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
7981 are directly for their associated operands in the statement. DECL
7982 and INIT are a combo; if DECL is NULL then INIT ought to be a
7983 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
7984 optional statements that need to go before the loop into its
7988 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
7989 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
7990 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
7992 tree omp_for
= NULL
, orig_incr
= NULL
;
7993 tree decl
= NULL
, init
, cond
, incr
;
7994 tree last
= NULL_TREE
;
8000 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8001 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8002 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8003 if (TREE_VEC_LENGTH (declv
) > 1)
8007 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8009 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8012 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8014 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8015 if (collapse
!= TREE_VEC_LENGTH (declv
))
8016 ordered
= TREE_VEC_LENGTH (declv
);
8019 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8021 decl
= TREE_VEC_ELT (declv
, i
);
8022 init
= TREE_VEC_ELT (initv
, i
);
8023 cond
= TREE_VEC_ELT (condv
, i
);
8024 incr
= TREE_VEC_ELT (incrv
, i
);
8030 switch (TREE_CODE (init
))
8033 decl
= TREE_OPERAND (init
, 0);
8034 init
= TREE_OPERAND (init
, 1);
8037 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8039 decl
= TREE_OPERAND (init
, 0);
8040 init
= TREE_OPERAND (init
, 2);
8050 "expected iteration declaration or initialization");
8055 if (init
&& EXPR_HAS_LOCATION (init
))
8056 elocus
= EXPR_LOCATION (init
);
8060 error_at (elocus
, "missing controlling predicate");
8066 error_at (elocus
, "missing increment expression");
8070 TREE_VEC_ELT (declv
, i
) = decl
;
8071 TREE_VEC_ELT (initv
, i
) = init
;
8078 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8080 && !c_omp_check_loop_iv_exprs (locus
, declv
,
8081 TREE_VEC_ELT (declv
, i
), orig_init
,
8082 NULL_TREE
, cp_walk_subtrees
))
8088 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8092 stmt
= make_node (code
);
8094 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8096 /* This is really just a place-holder. We'll be decomposing this
8097 again and going through the cp_build_modify_expr path below when
8098 we instantiate the thing. */
8099 TREE_VEC_ELT (initv
, i
)
8100 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8101 TREE_VEC_ELT (initv
, i
));
8104 TREE_TYPE (stmt
) = void_type_node
;
8105 OMP_FOR_INIT (stmt
) = initv
;
8106 OMP_FOR_COND (stmt
) = condv
;
8107 OMP_FOR_INCR (stmt
) = incrv
;
8108 OMP_FOR_BODY (stmt
) = body
;
8109 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8110 OMP_FOR_CLAUSES (stmt
) = clauses
;
8112 SET_EXPR_LOCATION (stmt
, locus
);
8113 return add_stmt (stmt
);
8117 orig_declv
= copy_node (declv
);
8119 if (processing_template_decl
)
8120 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8122 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8124 decl
= TREE_VEC_ELT (declv
, i
);
8125 init
= TREE_VEC_ELT (initv
, i
);
8126 cond
= TREE_VEC_ELT (condv
, i
);
8127 incr
= TREE_VEC_ELT (incrv
, i
);
8129 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8132 if (init
&& EXPR_HAS_LOCATION (init
))
8133 elocus
= EXPR_LOCATION (init
);
8137 error_at (elocus
, "expected iteration declaration or initialization");
8141 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8144 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8145 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8146 TREE_CODE (TREE_OPERAND (incr
, 1)),
8147 TREE_OPERAND (incr
, 2),
8148 tf_warning_or_error
);
8151 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8153 if (code
== OMP_SIMD
)
8155 error_at (elocus
, "%<#pragma omp simd%> used with class "
8156 "iteration variable %qE", decl
);
8159 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8160 initv
, condv
, incrv
, &body
,
8161 &pre_body
, clauses
, &last
,
8167 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8168 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8170 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8174 if (!processing_template_decl
)
8176 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8177 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8178 tf_warning_or_error
);
8181 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8183 && TREE_SIDE_EFFECTS (cond
)
8184 && COMPARISON_CLASS_P (cond
)
8185 && !processing_template_decl
)
8187 tree t
= TREE_OPERAND (cond
, 0);
8188 if (TREE_SIDE_EFFECTS (t
)
8190 && (TREE_CODE (t
) != NOP_EXPR
8191 || TREE_OPERAND (t
, 0) != decl
))
8192 TREE_OPERAND (cond
, 0)
8193 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8195 t
= TREE_OPERAND (cond
, 1);
8196 if (TREE_SIDE_EFFECTS (t
)
8198 && (TREE_CODE (t
) != NOP_EXPR
8199 || TREE_OPERAND (t
, 0) != decl
))
8200 TREE_OPERAND (cond
, 1)
8201 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8203 if (decl
== error_mark_node
|| init
== error_mark_node
)
8206 TREE_VEC_ELT (declv
, i
) = decl
;
8207 TREE_VEC_ELT (initv
, i
) = init
;
8208 TREE_VEC_ELT (condv
, i
) = cond
;
8209 TREE_VEC_ELT (incrv
, i
) = incr
;
8213 if (IS_EMPTY_STMT (pre_body
))
8216 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8217 incrv
, body
, pre_body
);
8219 /* Check for iterators appearing in lb, b or incr expressions. */
8220 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8221 omp_for
= NULL_TREE
;
8223 if (omp_for
== NULL
)
8230 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8232 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8233 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8235 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8238 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8239 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8240 && !processing_template_decl
)
8242 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8243 if (TREE_SIDE_EFFECTS (t
)
8245 && (TREE_CODE (t
) != NOP_EXPR
8246 || TREE_OPERAND (t
, 0) != decl
))
8247 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8248 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8250 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8251 if (TREE_SIDE_EFFECTS (t
)
8253 && (TREE_CODE (t
) != NOP_EXPR
8254 || TREE_OPERAND (t
, 0) != decl
))
8255 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8256 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8260 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8262 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8264 /* For simd loops with non-static data member iterators, we could have added
8265 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8266 step at this point, fill it in. */
8267 if (code
== OMP_SIMD
&& !processing_template_decl
8268 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8269 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8270 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8271 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8273 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8274 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8275 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8277 switch (TREE_CODE (incr
))
8279 case PREINCREMENT_EXPR
:
8280 case POSTINCREMENT_EXPR
:
8281 /* c_omp_for_incr_canonicalize_ptr() should have been
8282 called to massage things appropriately. */
8283 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8284 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8286 case PREDECREMENT_EXPR
:
8287 case POSTDECREMENT_EXPR
:
8288 /* c_omp_for_incr_canonicalize_ptr() should have been
8289 called to massage things appropriately. */
8290 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8291 OMP_CLAUSE_LINEAR_STEP (c
)
8292 = build_int_cst (TREE_TYPE (decl
), -1);
8295 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8296 incr
= TREE_OPERAND (incr
, 1);
8297 switch (TREE_CODE (incr
))
8300 if (TREE_OPERAND (incr
, 1) == decl
)
8301 step
= TREE_OPERAND (incr
, 0);
8303 step
= TREE_OPERAND (incr
, 1);
8306 case POINTER_PLUS_EXPR
:
8307 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8308 step
= TREE_OPERAND (incr
, 1);
8313 stept
= TREE_TYPE (decl
);
8314 if (POINTER_TYPE_P (stept
))
8316 step
= fold_convert (stept
, step
);
8317 if (TREE_CODE (incr
) == MINUS_EXPR
)
8318 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8319 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8330 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
8331 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
8346 dependent_p
= false;
8349 /* Even in a template, we can detect invalid uses of the atomic
8350 pragma if neither LHS nor RHS is type-dependent. */
8351 if (processing_template_decl
)
8353 dependent_p
= (type_dependent_expression_p (lhs
)
8354 || (rhs
&& type_dependent_expression_p (rhs
))
8355 || (v
&& type_dependent_expression_p (v
))
8356 || (lhs1
&& type_dependent_expression_p (lhs1
))
8357 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8360 lhs
= build_non_dependent_expr (lhs
);
8362 rhs
= build_non_dependent_expr (rhs
);
8364 v
= build_non_dependent_expr (v
);
8366 lhs1
= build_non_dependent_expr (lhs1
);
8368 rhs1
= build_non_dependent_expr (rhs1
);
8373 bool swapped
= false;
8374 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8376 std::swap (rhs
, rhs1
);
8377 swapped
= !commutative_tree_code (opcode
);
8379 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8381 if (code
== OMP_ATOMIC
)
8382 error ("%<#pragma omp atomic update%> uses two different "
8383 "expressions for memory");
8385 error ("%<#pragma omp atomic capture%> uses two different "
8386 "expressions for memory");
8389 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8391 if (code
== OMP_ATOMIC
)
8392 error ("%<#pragma omp atomic update%> uses two different "
8393 "expressions for memory");
8395 error ("%<#pragma omp atomic capture%> uses two different "
8396 "expressions for memory");
8399 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
8400 v
, lhs1
, rhs1
, swapped
, seq_cst
,
8401 processing_template_decl
!= 0);
8402 if (stmt
== error_mark_node
)
8405 if (processing_template_decl
)
8407 if (code
== OMP_ATOMIC_READ
)
8409 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
8410 OMP_ATOMIC_READ
, orig_lhs
);
8411 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8412 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8416 if (opcode
== NOP_EXPR
)
8417 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8419 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8421 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8422 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8423 if (code
!= OMP_ATOMIC
)
8425 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
8426 code
, orig_lhs1
, stmt
);
8427 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8428 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8431 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
8432 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8434 finish_expr_stmt (stmt
);
8438 finish_omp_barrier (void)
8440 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
8441 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8442 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8443 release_tree_vector (vec
);
8444 finish_expr_stmt (stmt
);
8448 finish_omp_flush (void)
8450 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8451 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8452 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8453 release_tree_vector (vec
);
8454 finish_expr_stmt (stmt
);
8458 finish_omp_taskwait (void)
8460 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8461 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8462 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8463 release_tree_vector (vec
);
8464 finish_expr_stmt (stmt
);
8468 finish_omp_taskyield (void)
8470 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8471 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8472 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8473 release_tree_vector (vec
);
8474 finish_expr_stmt (stmt
);
8478 finish_omp_cancel (tree clauses
)
8480 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
8482 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8484 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8486 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8488 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8492 error ("%<#pragma omp cancel%> must specify one of "
8493 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8496 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8497 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
8498 if (ifc
!= NULL_TREE
)
8500 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
8501 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
8502 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
8503 build_zero_cst (type
));
8506 ifc
= boolean_true_node
;
8507 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
8508 vec
->quick_push (ifc
);
8509 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8510 release_tree_vector (vec
);
8511 finish_expr_stmt (stmt
);
8515 finish_omp_cancellation_point (tree clauses
)
8517 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
8519 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8521 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8523 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8525 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8529 error ("%<#pragma omp cancellation point%> must specify one of "
8530 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8533 vec
<tree
, va_gc
> *vec
8534 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
8535 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8536 release_tree_vector (vec
);
8537 finish_expr_stmt (stmt
);
8540 /* Begin a __transaction_atomic or __transaction_relaxed statement.
8541 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
8542 should create an extra compound stmt. */
8545 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
8550 *pcompound
= begin_compound_stmt (0);
8552 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
8554 /* Only add the statement to the function if support enabled. */
8558 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
8559 ? G_("%<__transaction_relaxed%> without "
8560 "transactional memory support enabled")
8561 : G_("%<__transaction_atomic%> without "
8562 "transactional memory support enabled")));
8564 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
8565 TREE_SIDE_EFFECTS (r
) = 1;
8569 /* End a __transaction_atomic or __transaction_relaxed statement.
8570 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
8571 and we should end the compound. If NOEX is non-NULL, we wrap the body in
8572 a MUST_NOT_THROW_EXPR with NOEX as condition. */
8575 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
8577 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
8578 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
8579 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
8580 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
8582 /* noexcept specifications are not allowed for function transactions. */
8583 gcc_assert (!(noex
&& compound_stmt
));
8586 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
8588 protected_set_expr_location
8589 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
8590 TREE_SIDE_EFFECTS (body
) = 1;
8591 TRANSACTION_EXPR_BODY (stmt
) = body
;
8595 finish_compound_stmt (compound_stmt
);
8598 /* Build a __transaction_atomic or __transaction_relaxed expression. If
8599 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
8603 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
8608 expr
= build_must_not_throw_expr (expr
, noex
);
8609 protected_set_expr_location (expr
, loc
);
8610 TREE_SIDE_EFFECTS (expr
) = 1;
8612 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
8613 if (flags
& TM_STMT_ATTR_RELAXED
)
8614 TRANSACTION_EXPR_RELAXED (ret
) = 1;
8615 TREE_SIDE_EFFECTS (ret
) = 1;
8616 SET_EXPR_LOCATION (ret
, loc
);
8621 init_cp_semantics (void)
8625 /* Build a STATIC_ASSERT for a static assertion with the condition
8626 CONDITION and the message text MESSAGE. LOCATION is the location
8627 of the static assertion in the source code. When MEMBER_P, this
8628 static assertion is a member of a class. */
8630 finish_static_assert (tree condition
, tree message
, location_t location
,
8633 tsubst_flags_t complain
= tf_warning_or_error
;
8635 if (message
== NULL_TREE
8636 || message
== error_mark_node
8637 || condition
== NULL_TREE
8638 || condition
== error_mark_node
)
8641 if (check_for_bare_parameter_packs (condition
))
8642 condition
= error_mark_node
;
8644 if (instantiation_dependent_expression_p (condition
))
8646 /* We're in a template; build a STATIC_ASSERT and put it in
8650 assertion
= make_node (STATIC_ASSERT
);
8651 STATIC_ASSERT_CONDITION (assertion
) = condition
;
8652 STATIC_ASSERT_MESSAGE (assertion
) = message
;
8653 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
8656 maybe_add_class_template_decl_list (current_class_type
,
8660 add_stmt (assertion
);
8665 /* Fold the expression and convert it to a boolean value. */
8666 condition
= perform_implicit_conversion_flags (boolean_type_node
, condition
,
8667 complain
, LOOKUP_NORMAL
);
8668 condition
= fold_non_dependent_expr (condition
);
8670 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
8671 /* Do nothing; the condition is satisfied. */
8675 location_t saved_loc
= input_location
;
8677 input_location
= location
;
8678 if (TREE_CODE (condition
) == INTEGER_CST
8679 && integer_zerop (condition
))
8681 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
8682 (TREE_TYPE (TREE_TYPE (message
))));
8683 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
8684 /* Report the error. */
8686 error ("static assertion failed");
8688 error ("static assertion failed: %s",
8689 TREE_STRING_POINTER (message
));
8691 else if (condition
&& condition
!= error_mark_node
)
8693 error ("non-constant condition for static assertion");
8694 if (require_rvalue_constant_expression (condition
))
8695 cxx_constant_value (condition
);
8697 input_location
= saved_loc
;
8701 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
8702 suitable for use as a type-specifier.
8704 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
8705 id-expression or a class member access, FALSE when it was parsed as
8706 a full expression. */
8709 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
8710 tsubst_flags_t complain
)
8712 tree type
= NULL_TREE
;
8714 if (!expr
|| error_operand_p (expr
))
8715 return error_mark_node
;
8718 || TREE_CODE (expr
) == TYPE_DECL
8719 || (TREE_CODE (expr
) == BIT_NOT_EXPR
8720 && TYPE_P (TREE_OPERAND (expr
, 0))))
8722 if (complain
& tf_error
)
8723 error ("argument to decltype must be an expression");
8724 return error_mark_node
;
8727 /* Depending on the resolution of DR 1172, we may later need to distinguish
8728 instantiation-dependent but not type-dependent expressions so that, say,
8729 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
8730 if (instantiation_dependent_uneval_expression_p (expr
))
8732 type
= cxx_make_type (DECLTYPE_TYPE
);
8733 DECLTYPE_TYPE_EXPR (type
) = expr
;
8734 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
8735 = id_expression_or_member_access_p
;
8736 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8741 /* The type denoted by decltype(e) is defined as follows: */
8743 expr
= resolve_nondeduced_context (expr
, complain
);
8745 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
8746 return error_mark_node
;
8748 if (type_unknown_p (expr
))
8750 if (complain
& tf_error
)
8751 error ("decltype cannot resolve address of overloaded function");
8752 return error_mark_node
;
8755 /* To get the size of a static data member declared as an array of
8756 unknown bound, we need to instantiate it. */
8758 && VAR_HAD_UNKNOWN_BOUND (expr
)
8759 && DECL_TEMPLATE_INSTANTIATION (expr
))
8760 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
8762 if (id_expression_or_member_access_p
)
8764 /* If e is an id-expression or a class member access (5.2.5
8765 [expr.ref]), decltype(e) is defined as the type of the entity
8766 named by e. If there is no such entity, or e names a set of
8767 overloaded functions, the program is ill-formed. */
8768 if (identifier_p (expr
))
8769 expr
= lookup_name (expr
);
8771 if (INDIRECT_REF_P (expr
))
8772 /* This can happen when the expression is, e.g., "a.b". Just
8773 look at the underlying operand. */
8774 expr
= TREE_OPERAND (expr
, 0);
8776 if (TREE_CODE (expr
) == OFFSET_REF
8777 || TREE_CODE (expr
) == MEMBER_REF
8778 || TREE_CODE (expr
) == SCOPE_REF
)
8779 /* We're only interested in the field itself. If it is a
8780 BASELINK, we will need to see through it in the next
8782 expr
= TREE_OPERAND (expr
, 1);
8784 if (BASELINK_P (expr
))
8785 /* See through BASELINK nodes to the underlying function. */
8786 expr
= BASELINK_FUNCTIONS (expr
);
8788 /* decltype of a decomposition name drops references in the tuple case
8789 (unlike decltype of a normal variable) and keeps cv-qualifiers from
8790 the containing object in the other cases (unlike decltype of a member
8791 access expression). */
8792 if (DECL_DECOMPOSITION_P (expr
))
8794 if (DECL_HAS_VALUE_EXPR_P (expr
))
8795 /* Expr is an array or struct subobject proxy, handle
8796 bit-fields properly. */
8797 return unlowered_expr_type (expr
);
8799 /* Expr is a reference variable for the tuple case. */
8800 return lookup_decomp_type (expr
);
8803 switch (TREE_CODE (expr
))
8806 if (DECL_BIT_FIELD_TYPE (expr
))
8808 type
= DECL_BIT_FIELD_TYPE (expr
);
8811 /* Fall through for fields that aren't bitfields. */
8819 case TEMPLATE_PARM_INDEX
:
8820 expr
= mark_type_use (expr
);
8821 type
= TREE_TYPE (expr
);
8825 type
= error_mark_node
;
8830 mark_type_use (expr
);
8831 type
= is_bitfield_expr_with_lowered_type (expr
);
8833 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
8841 /* We can get here when the id-expression refers to an
8842 enumerator or non-type template parameter. */
8843 type
= TREE_TYPE (expr
);
8847 /* Handle instantiated template non-type arguments. */
8848 type
= TREE_TYPE (expr
);
8854 /* Within a lambda-expression:
8856 Every occurrence of decltype((x)) where x is a possibly
8857 parenthesized id-expression that names an entity of
8858 automatic storage duration is treated as if x were
8859 transformed into an access to a corresponding data member
8860 of the closure type that would have been declared if x
8861 were a use of the denoted entity. */
8862 if (outer_automatic_var_p (expr
)
8863 && current_function_decl
8864 && LAMBDA_FUNCTION_P (current_function_decl
))
8865 type
= capture_decltype (expr
);
8866 else if (error_operand_p (expr
))
8867 type
= error_mark_node
;
8868 else if (expr
== current_class_ptr
)
8869 /* If the expression is just "this", we want the
8870 cv-unqualified pointer for the "this" type. */
8871 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
8874 /* Otherwise, where T is the type of e, if e is an lvalue,
8875 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
8876 cp_lvalue_kind clk
= lvalue_kind (expr
);
8877 type
= unlowered_expr_type (expr
);
8878 gcc_assert (!TYPE_REF_P (type
));
8880 /* For vector types, pick a non-opaque variant. */
8881 if (VECTOR_TYPE_P (type
))
8882 type
= strip_typedefs (type
);
8884 if (clk
!= clk_none
&& !(clk
& clk_class
))
8885 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
8892 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
8893 __has_nothrow_copy, depending on assign_p. Returns true iff all
8894 the copy {ctor,assign} fns are nothrow. */
8897 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
8899 tree fns
= NULL_TREE
;
8901 if (assign_p
|| TYPE_HAS_COPY_CTOR (type
))
8902 fns
= get_class_binding (type
, assign_p
? assign_op_identifier
8905 bool saw_copy
= false;
8906 for (ovl_iterator
iter (fns
); iter
; ++iter
)
8910 if (copy_fn_p (fn
) > 0)
8913 maybe_instantiate_noexcept (fn
);
8914 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
8922 /* Actually evaluates the trait. */
8925 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
8927 enum tree_code type_code1
;
8930 type_code1
= TREE_CODE (type1
);
8934 case CPTK_HAS_NOTHROW_ASSIGN
:
8935 type1
= strip_array_types (type1
);
8936 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8937 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
8938 || (CLASS_TYPE_P (type1
)
8939 && classtype_has_nothrow_assign_or_copy_p (type1
,
8942 case CPTK_HAS_TRIVIAL_ASSIGN
:
8943 /* ??? The standard seems to be missing the "or array of such a class
8944 type" wording for this trait. */
8945 type1
= strip_array_types (type1
);
8946 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8947 && (trivial_type_p (type1
)
8948 || (CLASS_TYPE_P (type1
)
8949 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
8951 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
8952 type1
= strip_array_types (type1
);
8953 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
8954 || (CLASS_TYPE_P (type1
)
8955 && (t
= locate_ctor (type1
))
8956 && (maybe_instantiate_noexcept (t
),
8957 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
8959 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
8960 type1
= strip_array_types (type1
);
8961 return (trivial_type_p (type1
)
8962 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
8964 case CPTK_HAS_NOTHROW_COPY
:
8965 type1
= strip_array_types (type1
);
8966 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
8967 || (CLASS_TYPE_P (type1
)
8968 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
8970 case CPTK_HAS_TRIVIAL_COPY
:
8971 /* ??? The standard seems to be missing the "or array of such a class
8972 type" wording for this trait. */
8973 type1
= strip_array_types (type1
);
8974 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
8975 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
8977 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
8978 type1
= strip_array_types (type1
);
8979 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
8980 || (CLASS_TYPE_P (type1
)
8981 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
8983 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
8984 return type_has_virtual_destructor (type1
);
8986 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
8987 return type_has_unique_obj_representations (type1
);
8989 case CPTK_IS_ABSTRACT
:
8990 return ABSTRACT_CLASS_TYPE_P (type1
);
8992 case CPTK_IS_AGGREGATE
:
8993 return CP_AGGREGATE_TYPE_P (type1
);
8995 case CPTK_IS_BASE_OF
:
8996 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
8997 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
8998 || DERIVED_FROM_P (type1
, type2
)));
9001 return NON_UNION_CLASS_TYPE_P (type1
);
9004 return NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
);
9007 return type_code1
== ENUMERAL_TYPE
;
9010 return CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
);
9012 case CPTK_IS_LITERAL_TYPE
:
9013 return literal_type_p (type1
);
9016 return pod_type_p (type1
);
9018 case CPTK_IS_POLYMORPHIC
:
9019 return CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
);
9021 case CPTK_IS_SAME_AS
:
9022 return same_type_p (type1
, type2
);
9024 case CPTK_IS_STD_LAYOUT
:
9025 return std_layout_type_p (type1
);
9027 case CPTK_IS_TRIVIAL
:
9028 return trivial_type_p (type1
);
9030 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9031 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9033 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9034 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9036 case CPTK_IS_TRIVIALLY_COPYABLE
:
9037 return trivially_copyable_p (type1
);
9040 return type_code1
== UNION_TYPE
;
9042 case CPTK_IS_ASSIGNABLE
:
9043 return is_xible (MODIFY_EXPR
, type1
, type2
);
9045 case CPTK_IS_CONSTRUCTIBLE
:
9046 return is_xible (INIT_EXPR
, type1
, type2
);
9054 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9055 void, or a complete type, returns true, otherwise false. */
9058 check_trait_type (tree type
)
9060 if (type
== NULL_TREE
)
9063 if (TREE_CODE (type
) == TREE_LIST
)
9064 return (check_trait_type (TREE_VALUE (type
))
9065 && check_trait_type (TREE_CHAIN (type
)));
9067 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9068 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9071 if (VOID_TYPE_P (type
))
9074 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9077 /* Process a trait expression. */
9080 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9082 if (type1
== error_mark_node
9083 || type2
== error_mark_node
)
9084 return error_mark_node
;
9086 if (processing_template_decl
)
9088 tree trait_expr
= make_node (TRAIT_EXPR
);
9089 TREE_TYPE (trait_expr
) = boolean_type_node
;
9090 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9091 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9092 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9098 case CPTK_HAS_NOTHROW_ASSIGN
:
9099 case CPTK_HAS_TRIVIAL_ASSIGN
:
9100 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9101 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9102 case CPTK_HAS_NOTHROW_COPY
:
9103 case CPTK_HAS_TRIVIAL_COPY
:
9104 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9105 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9106 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9107 case CPTK_IS_ABSTRACT
:
9108 case CPTK_IS_AGGREGATE
:
9111 case CPTK_IS_LITERAL_TYPE
:
9113 case CPTK_IS_POLYMORPHIC
:
9114 case CPTK_IS_STD_LAYOUT
:
9115 case CPTK_IS_TRIVIAL
:
9116 case CPTK_IS_TRIVIALLY_COPYABLE
:
9117 if (!check_trait_type (type1
))
9118 return error_mark_node
;
9121 case CPTK_IS_ASSIGNABLE
:
9122 case CPTK_IS_CONSTRUCTIBLE
:
9125 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9126 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9127 if (!check_trait_type (type1
)
9128 || !check_trait_type (type2
))
9129 return error_mark_node
;
9132 case CPTK_IS_BASE_OF
:
9133 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9134 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9135 && !complete_type_or_else (type2
, NULL_TREE
))
9136 /* We already issued an error. */
9137 return error_mark_node
;
9143 case CPTK_IS_SAME_AS
:
9150 return (trait_expr_value (kind
, type1
, type2
)
9151 ? boolean_true_node
: boolean_false_node
);
9154 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9155 which is ignored for C++. */
9158 set_float_const_decimal64 (void)
9163 clear_float_const_decimal64 (void)
9168 float_const_decimal64_p (void)
9174 /* Return true if T designates the implied `this' parameter. */
9177 is_this_parameter (tree t
)
9179 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9181 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
9182 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
9186 /* Insert the deduced return type for an auto function. */
9189 apply_deduced_return_type (tree fco
, tree return_type
)
9193 if (return_type
== error_mark_node
)
9196 if (DECL_CONV_FN_P (fco
))
9197 DECL_NAME (fco
) = make_conv_op_name (return_type
);
9199 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9201 result
= DECL_RESULT (fco
);
9202 if (result
== NULL_TREE
)
9204 if (TREE_TYPE (result
) == return_type
)
9207 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
9208 && !complete_type_or_else (return_type
, NULL_TREE
))
9211 /* We already have a DECL_RESULT from start_preparsed_function.
9212 Now we need to redo the work it and allocate_struct_function
9213 did to reflect the new type. */
9214 gcc_assert (current_function_decl
== fco
);
9215 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9216 TYPE_MAIN_VARIANT (return_type
));
9217 DECL_ARTIFICIAL (result
) = 1;
9218 DECL_IGNORED_P (result
) = 1;
9219 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9222 DECL_RESULT (fco
) = result
;
9224 if (!processing_template_decl
)
9226 bool aggr
= aggregate_value_p (result
, fco
);
9227 #ifdef PCC_STATIC_STRUCT_RETURN
9228 cfun
->returns_pcc_struct
= aggr
;
9230 cfun
->returns_struct
= aggr
;
9235 /* DECL is a local variable or parameter from the surrounding scope of a
9236 lambda-expression. Returns the decltype for a use of the capture field
9237 for DECL even if it hasn't been captured yet. */
9240 capture_decltype (tree decl
)
9242 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9243 /* FIXME do lookup instead of list walk? */
9244 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9248 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9250 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9253 error ("%qD is not captured", decl
);
9254 return error_mark_node
;
9257 type
= TREE_TYPE (decl
);
9258 if (TYPE_REF_P (type
)
9259 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9260 type
= TREE_TYPE (type
);
9263 case CPLD_REFERENCE
:
9264 type
= TREE_TYPE (decl
);
9265 if (!TYPE_REF_P (type
))
9266 type
= build_reference_type (TREE_TYPE (decl
));
9273 if (!TYPE_REF_P (type
))
9275 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9276 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9278 type
= build_reference_type (type
);
9283 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9284 this is a right unary fold. Otherwise it is a left unary fold. */
9287 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9289 // Build a pack expansion (assuming expr has pack type).
9290 if (!uses_parameter_packs (expr
))
9292 error_at (location_of (expr
), "operand of fold expression has no "
9293 "unexpanded parameter packs");
9294 return error_mark_node
;
9296 tree pack
= make_pack_expansion (expr
);
9298 // Build the fold expression.
9299 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9300 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
9301 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9306 finish_left_unary_fold_expr (tree expr
, int op
)
9308 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9312 finish_right_unary_fold_expr (tree expr
, int op
)
9314 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9317 /* Build a binary fold expression over EXPR1 and EXPR2. The
9318 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9319 has an unexpanded parameter pack). */
9322 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9324 pack
= make_pack_expansion (pack
);
9325 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9326 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
9327 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9332 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9334 // Determine which expr has an unexpanded parameter pack and
9335 // set the pack and initial term.
9336 bool pack1
= uses_parameter_packs (expr1
);
9337 bool pack2
= uses_parameter_packs (expr2
);
9338 if (pack1
&& !pack2
)
9339 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9340 else if (pack2
&& !pack1
)
9341 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9345 error ("both arguments in binary fold have unexpanded parameter packs");
9347 error ("no unexpanded parameter packs in binary fold");
9349 return error_mark_node
;
9352 /* Finish __builtin_launder (arg). */
9355 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
9357 tree orig_arg
= arg
;
9358 if (!type_dependent_expression_p (arg
))
9359 arg
= decay_conversion (arg
, complain
);
9360 if (error_operand_p (arg
))
9361 return error_mark_node
;
9362 if (!type_dependent_expression_p (arg
)
9363 && !TYPE_PTR_P (TREE_TYPE (arg
)))
9365 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
9366 return error_mark_node
;
9368 if (processing_template_decl
)
9370 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
9371 TREE_TYPE (arg
), 1, arg
);
9374 #include "gt-cp-semantics.h"