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 && 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
= NULL_TREE
;
938 if (flag_new_for_scope
)
939 scope
= do_pushlevel (sk_for
);
941 if (processing_template_decl
)
942 *init
= push_stmt_list ();
949 /* Begin a for-statement. Returns a new FOR_STMT.
950 SCOPE and INIT should be the return of begin_for_scope,
954 begin_for_stmt (tree scope
, tree init
)
958 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
959 NULL_TREE
, NULL_TREE
, NULL_TREE
);
961 if (scope
== NULL_TREE
)
963 gcc_assert (!init
|| !flag_new_for_scope
);
965 scope
= begin_for_scope (&init
);
967 FOR_INIT_STMT (r
) = init
;
968 FOR_SCOPE (r
) = scope
;
973 /* Finish the init-statement of a for-statement, which may be
974 given by FOR_STMT. */
977 finish_init_stmt (tree for_stmt
)
979 if (processing_template_decl
)
980 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
982 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
983 begin_cond (&FOR_COND (for_stmt
));
986 /* Finish the COND of a for-statement, which may be given by
990 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
, unsigned short unroll
)
992 cond
= maybe_convert_cond (cond
);
993 finish_cond (&FOR_COND (for_stmt
), cond
);
994 begin_maybe_infinite_loop (cond
);
995 if (ivdep
&& cond
!= error_mark_node
)
996 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
997 TREE_TYPE (FOR_COND (for_stmt
)),
999 build_int_cst (integer_type_node
,
1000 annot_expr_ivdep_kind
),
1002 if (unroll
&& cond
!= error_mark_node
)
1003 FOR_COND (for_stmt
) = build3 (ANNOTATE_EXPR
,
1004 TREE_TYPE (FOR_COND (for_stmt
)),
1005 FOR_COND (for_stmt
),
1006 build_int_cst (integer_type_node
,
1007 annot_expr_unroll_kind
),
1008 build_int_cst (integer_type_node
,
1010 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
1013 /* Finish the increment-EXPRESSION in a for-statement, which may be
1014 given by FOR_STMT. */
1017 finish_for_expr (tree expr
, tree for_stmt
)
1021 /* If EXPR is an overloaded function, issue an error; there is no
1022 context available to use to perform overload resolution. */
1023 if (type_unknown_p (expr
))
1025 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
1026 expr
= error_mark_node
;
1028 if (!processing_template_decl
)
1030 if (warn_sequence_point
)
1031 verify_sequence_points (expr
);
1032 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1033 tf_warning_or_error
);
1035 else if (!type_dependent_expression_p (expr
))
1036 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1037 tf_warning_or_error
);
1038 expr
= maybe_cleanup_point_expr_void (expr
);
1039 if (check_for_bare_parameter_packs (expr
))
1040 expr
= error_mark_node
;
1041 FOR_EXPR (for_stmt
) = expr
;
1044 /* Finish the body of a for-statement, which may be given by
1045 FOR_STMT. The increment-EXPR for the loop must be
1047 It can also finish RANGE_FOR_STMT. */
1050 finish_for_stmt (tree for_stmt
)
1052 end_maybe_infinite_loop (boolean_true_node
);
1054 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1055 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1057 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1059 /* Pop the scope for the body of the loop. */
1060 if (flag_new_for_scope
)
1063 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1064 ? &RANGE_FOR_SCOPE (for_stmt
)
1065 : &FOR_SCOPE (for_stmt
));
1068 add_stmt (do_poplevel (scope
));
1072 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1073 SCOPE and INIT should be the return of begin_for_scope,
1075 To finish it call finish_for_stmt(). */
1078 begin_range_for_stmt (tree scope
, tree init
)
1082 begin_maybe_infinite_loop (boolean_false_node
);
1084 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
1085 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1087 if (scope
== NULL_TREE
)
1089 gcc_assert (!init
|| !flag_new_for_scope
);
1091 scope
= begin_for_scope (&init
);
1094 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
1097 pop_stmt_list (init
);
1098 RANGE_FOR_SCOPE (r
) = scope
;
1103 /* Finish the head of a range-based for statement, which may
1104 be given by RANGE_FOR_STMT. DECL must be the declaration
1105 and EXPR must be the loop expression. */
1108 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
1110 RANGE_FOR_DECL (range_for_stmt
) = decl
;
1111 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
1112 add_stmt (range_for_stmt
);
1113 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
1116 /* Finish a break-statement. */
1119 finish_break_stmt (void)
1121 /* In switch statements break is sometimes stylistically used after
1122 a return statement. This can lead to spurious warnings about
1123 control reaching the end of a non-void function when it is
1124 inlined. Note that we are calling block_may_fallthru with
1125 language specific tree nodes; this works because
1126 block_may_fallthru returns true when given something it does not
1128 if (!block_may_fallthru (cur_stmt_list
))
1131 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1134 /* Finish a continue-statement. */
1137 finish_continue_stmt (void)
1139 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1142 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1146 begin_switch_stmt (void)
1150 scope
= do_pushlevel (sk_cond
);
1151 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1153 begin_cond (&SWITCH_STMT_COND (r
));
1158 /* Finish the cond of a switch-statement. */
1161 finish_switch_cond (tree cond
, tree switch_stmt
)
1163 tree orig_type
= NULL
;
1165 if (!processing_template_decl
)
1167 /* Convert the condition to an integer or enumeration type. */
1168 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1169 if (cond
== NULL_TREE
)
1171 error ("switch quantity not an integer");
1172 cond
= error_mark_node
;
1174 /* We want unlowered type here to handle enum bit-fields. */
1175 orig_type
= unlowered_expr_type (cond
);
1176 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1177 orig_type
= TREE_TYPE (cond
);
1178 if (cond
!= error_mark_node
)
1182 Integral promotions are performed. */
1183 cond
= perform_integral_promotions (cond
);
1184 cond
= maybe_cleanup_point_expr (cond
);
1187 if (check_for_bare_parameter_packs (cond
))
1188 cond
= error_mark_node
;
1189 else if (!processing_template_decl
&& warn_sequence_point
)
1190 verify_sequence_points (cond
);
1192 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1193 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1194 add_stmt (switch_stmt
);
1195 push_switch (switch_stmt
);
1196 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1199 /* Finish the body of a switch-statement, which may be given by
1200 SWITCH_STMT. The COND to switch on is indicated. */
1203 finish_switch_stmt (tree switch_stmt
)
1207 SWITCH_STMT_BODY (switch_stmt
) =
1208 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1211 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1212 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1213 add_stmt (do_poplevel (scope
));
1216 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1220 begin_try_block (void)
1222 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1224 TRY_STMTS (r
) = push_stmt_list ();
1228 /* Likewise, for a function-try-block. The block returned in
1229 *COMPOUND_STMT is an artificial outer scope, containing the
1230 function-try-block. */
1233 begin_function_try_block (tree
*compound_stmt
)
1236 /* This outer scope does not exist in the C++ standard, but we need
1237 a place to put __FUNCTION__ and similar variables. */
1238 *compound_stmt
= begin_compound_stmt (0);
1239 r
= begin_try_block ();
1240 FN_TRY_BLOCK_P (r
) = 1;
1244 /* Finish a try-block, which may be given by TRY_BLOCK. */
1247 finish_try_block (tree try_block
)
1249 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1250 TRY_HANDLERS (try_block
) = push_stmt_list ();
1253 /* Finish the body of a cleanup try-block, which may be given by
1257 finish_cleanup_try_block (tree try_block
)
1259 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1262 /* Finish an implicitly generated try-block, with a cleanup is given
1266 finish_cleanup (tree cleanup
, tree try_block
)
1268 TRY_HANDLERS (try_block
) = cleanup
;
1269 CLEANUP_P (try_block
) = 1;
1272 /* Likewise, for a function-try-block. */
1275 finish_function_try_block (tree try_block
)
1277 finish_try_block (try_block
);
1278 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1279 the try block, but moving it inside. */
1280 in_function_try_handler
= 1;
1283 /* Finish a handler-sequence for a try-block, which may be given by
1287 finish_handler_sequence (tree try_block
)
1289 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1290 check_handlers (TRY_HANDLERS (try_block
));
1293 /* Finish the handler-seq for a function-try-block, given by
1294 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1295 begin_function_try_block. */
1298 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1300 in_function_try_handler
= 0;
1301 finish_handler_sequence (try_block
);
1302 finish_compound_stmt (compound_stmt
);
1305 /* Begin a handler. Returns a HANDLER if appropriate. */
1308 begin_handler (void)
1312 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1315 /* Create a binding level for the eh_info and the exception object
1317 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1322 /* Finish the handler-parameters for a handler, which may be given by
1323 HANDLER. DECL is the declaration for the catch parameter, or NULL
1324 if this is a `catch (...)' clause. */
1327 finish_handler_parms (tree decl
, tree handler
)
1329 tree type
= NULL_TREE
;
1330 if (processing_template_decl
)
1334 decl
= pushdecl (decl
);
1335 decl
= push_template_decl (decl
);
1336 HANDLER_PARMS (handler
) = decl
;
1337 type
= TREE_TYPE (decl
);
1342 type
= expand_start_catch_block (decl
);
1343 if (warn_catch_value
1344 && type
!= NULL_TREE
1345 && type
!= error_mark_node
1346 && TREE_CODE (TREE_TYPE (decl
)) != REFERENCE_TYPE
)
1348 tree orig_type
= TREE_TYPE (decl
);
1349 if (CLASS_TYPE_P (orig_type
))
1351 if (TYPE_POLYMORPHIC_P (orig_type
))
1352 warning (OPT_Wcatch_value_
,
1353 "catching polymorphic type %q#T by value", orig_type
);
1354 else if (warn_catch_value
> 1)
1355 warning (OPT_Wcatch_value_
,
1356 "catching type %q#T by value", orig_type
);
1358 else if (warn_catch_value
> 2)
1359 warning (OPT_Wcatch_value_
,
1360 "catching non-reference type %q#T", orig_type
);
1363 HANDLER_TYPE (handler
) = type
;
1366 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1367 the return value from the matching call to finish_handler_parms. */
1370 finish_handler (tree handler
)
1372 if (!processing_template_decl
)
1373 expand_end_catch_block ();
1374 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1377 /* Begin a compound statement. FLAGS contains some bits that control the
1378 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1379 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1380 block of a function. If BCS_TRY_BLOCK is set, this is the block
1381 created on behalf of a TRY statement. Returns a token to be passed to
1382 finish_compound_stmt. */
1385 begin_compound_stmt (unsigned int flags
)
1389 if (flags
& BCS_NO_SCOPE
)
1391 r
= push_stmt_list ();
1392 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1394 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1395 But, if it's a statement-expression with a scopeless block, there's
1396 nothing to keep, and we don't want to accidentally keep a block
1397 *inside* the scopeless block. */
1398 keep_next_level (false);
1402 scope_kind sk
= sk_block
;
1403 if (flags
& BCS_TRY_BLOCK
)
1405 else if (flags
& BCS_TRANSACTION
)
1406 sk
= sk_transaction
;
1407 r
= do_pushlevel (sk
);
1410 /* When processing a template, we need to remember where the braces were,
1411 so that we can set up identical scopes when instantiating the template
1412 later. BIND_EXPR is a handy candidate for this.
1413 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1414 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1415 processing templates. */
1416 if (processing_template_decl
)
1418 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1419 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1420 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1421 TREE_SIDE_EFFECTS (r
) = 1;
1427 /* Finish a compound-statement, which is given by STMT. */
1430 finish_compound_stmt (tree stmt
)
1432 if (TREE_CODE (stmt
) == BIND_EXPR
)
1434 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1435 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1436 discard the BIND_EXPR so it can be merged with the containing
1438 if (TREE_CODE (body
) == STATEMENT_LIST
1439 && STATEMENT_LIST_HEAD (body
) == NULL
1440 && !BIND_EXPR_BODY_BLOCK (stmt
)
1441 && !BIND_EXPR_TRY_BLOCK (stmt
))
1444 BIND_EXPR_BODY (stmt
) = body
;
1446 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1447 stmt
= pop_stmt_list (stmt
);
1450 /* Destroy any ObjC "super" receivers that may have been
1452 objc_clear_super_receiver ();
1454 stmt
= do_poplevel (stmt
);
1457 /* ??? See c_end_compound_stmt wrt statement expressions. */
1461 /* Finish an asm-statement, whose components are a STRING, some
1462 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1463 LABELS. Also note whether the asm-statement should be
1464 considered volatile. */
1467 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1468 tree input_operands
, tree clobbers
, tree labels
)
1472 int ninputs
= list_length (input_operands
);
1473 int noutputs
= list_length (output_operands
);
1475 if (!processing_template_decl
)
1477 const char *constraint
;
1478 const char **oconstraints
;
1479 bool allows_mem
, allows_reg
, is_inout
;
1483 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1485 string
= resolve_asm_operand_names (string
, output_operands
,
1486 input_operands
, labels
);
1488 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1490 operand
= TREE_VALUE (t
);
1492 /* ??? Really, this should not be here. Users should be using a
1493 proper lvalue, dammit. But there's a long history of using
1494 casts in the output operands. In cases like longlong.h, this
1495 becomes a primitive form of typechecking -- if the cast can be
1496 removed, then the output operand had a type of the proper width;
1497 otherwise we'll get an error. Gross, but ... */
1498 STRIP_NOPS (operand
);
1500 operand
= mark_lvalue_use (operand
);
1502 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1503 operand
= error_mark_node
;
1505 if (operand
!= error_mark_node
1506 && (TREE_READONLY (operand
)
1507 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1508 /* Functions are not modifiable, even though they are
1510 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1511 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1512 /* If it's an aggregate and any field is const, then it is
1513 effectively const. */
1514 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1515 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1516 cxx_readonly_error (operand
, lv_asm
);
1518 tree
*op
= &operand
;
1519 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1520 op
= &TREE_OPERAND (*op
, 1);
1521 switch (TREE_CODE (*op
))
1523 case PREINCREMENT_EXPR
:
1524 case PREDECREMENT_EXPR
:
1526 *op
= genericize_compound_lvalue (*op
);
1527 op
= &TREE_OPERAND (*op
, 1);
1533 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1534 oconstraints
[i
] = constraint
;
1536 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1537 &allows_mem
, &allows_reg
, &is_inout
))
1539 /* If the operand is going to end up in memory,
1540 mark it addressable. */
1541 if (!allows_reg
&& !cxx_mark_addressable (*op
))
1542 operand
= error_mark_node
;
1545 operand
= error_mark_node
;
1547 TREE_VALUE (t
) = operand
;
1550 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1552 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1553 bool constraint_parsed
1554 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1555 oconstraints
, &allows_mem
, &allows_reg
);
1556 /* If the operand is going to end up in memory, don't call
1557 decay_conversion. */
1558 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1559 operand
= mark_lvalue_use (TREE_VALUE (t
));
1561 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1563 /* If the type of the operand hasn't been determined (e.g.,
1564 because it involves an overloaded function), then issue
1565 an error message. There's no context available to
1566 resolve the overloading. */
1567 if (TREE_TYPE (operand
) == unknown_type_node
)
1569 error ("type of asm operand %qE could not be determined",
1571 operand
= error_mark_node
;
1574 if (constraint_parsed
)
1576 /* If the operand is going to end up in memory,
1577 mark it addressable. */
1578 if (!allows_reg
&& allows_mem
)
1580 /* Strip the nops as we allow this case. FIXME, this really
1581 should be rejected or made deprecated. */
1582 STRIP_NOPS (operand
);
1584 tree
*op
= &operand
;
1585 while (TREE_CODE (*op
) == COMPOUND_EXPR
)
1586 op
= &TREE_OPERAND (*op
, 1);
1587 switch (TREE_CODE (*op
))
1589 case PREINCREMENT_EXPR
:
1590 case PREDECREMENT_EXPR
:
1592 *op
= genericize_compound_lvalue (*op
);
1593 op
= &TREE_OPERAND (*op
, 1);
1599 if (!cxx_mark_addressable (*op
))
1600 operand
= error_mark_node
;
1602 else if (!allows_reg
&& !allows_mem
)
1604 /* If constraint allows neither register nor memory,
1605 try harder to get a constant. */
1606 tree constop
= maybe_constant_value (operand
);
1607 if (TREE_CONSTANT (constop
))
1612 operand
= error_mark_node
;
1614 TREE_VALUE (t
) = operand
;
1618 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1619 output_operands
, input_operands
,
1621 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1622 r
= maybe_cleanup_point_expr_void (r
);
1623 return add_stmt (r
);
1626 /* Finish a label with the indicated NAME. Returns the new label. */
1629 finish_label_stmt (tree name
)
1631 tree decl
= define_label (input_location
, name
);
1633 if (decl
== error_mark_node
)
1634 return error_mark_node
;
1636 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1641 /* Finish a series of declarations for local labels. G++ allows users
1642 to declare "local" labels, i.e., labels with scope. This extension
1643 is useful when writing code involving statement-expressions. */
1646 finish_label_decl (tree name
)
1648 if (!at_function_scope_p ())
1650 error ("__label__ declarations are only allowed in function scopes");
1654 add_decl_expr (declare_local_label (name
));
1657 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1660 finish_decl_cleanup (tree decl
, tree cleanup
)
1662 push_cleanup (decl
, cleanup
, false);
1665 /* If the current scope exits with an exception, run CLEANUP. */
1668 finish_eh_cleanup (tree cleanup
)
1670 push_cleanup (NULL
, cleanup
, true);
1673 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1674 order they were written by the user. Each node is as for
1675 emit_mem_initializers. */
1678 finish_mem_initializers (tree mem_inits
)
1680 /* Reorder the MEM_INITS so that they are in the order they appeared
1681 in the source program. */
1682 mem_inits
= nreverse (mem_inits
);
1684 if (processing_template_decl
)
1688 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1690 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1691 check for bare parameter packs in the TREE_VALUE, because
1692 any parameter packs in the TREE_VALUE have already been
1693 bound as part of the TREE_PURPOSE. See
1694 make_pack_expansion for more information. */
1695 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1696 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1697 TREE_VALUE (mem
) = error_mark_node
;
1700 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1701 CTOR_INITIALIZER
, mem_inits
));
1704 emit_mem_initializers (mem_inits
);
1707 /* Obfuscate EXPR if it looks like an id-expression or member access so
1708 that the call to finish_decltype in do_auto_deduction will give the
1712 force_paren_expr (tree expr
)
1714 /* This is only needed for decltype(auto) in C++14. */
1715 if (cxx_dialect
< cxx14
)
1718 /* If we're in unevaluated context, we can't be deducing a
1719 return/initializer type, so we don't need to mess with this. */
1720 if (cp_unevaluated_operand
)
1723 if (!DECL_P (expr
) && TREE_CODE (expr
) != COMPONENT_REF
1724 && TREE_CODE (expr
) != SCOPE_REF
)
1727 if (TREE_CODE (expr
) == COMPONENT_REF
1728 || TREE_CODE (expr
) == SCOPE_REF
)
1729 REF_PARENTHESIZED_P (expr
) = true;
1730 else if (processing_template_decl
)
1731 expr
= build1 (PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1732 else if (VAR_P (expr
) && DECL_HARD_REGISTER (expr
))
1733 /* We can't bind a hard register variable to a reference. */;
1736 cp_lvalue_kind kind
= lvalue_kind (expr
);
1737 if ((kind
& ~clk_class
) != clk_none
)
1739 tree type
= unlowered_expr_type (expr
);
1740 bool rval
= !!(kind
& clk_rvalueref
);
1741 type
= cp_build_reference_type (type
, rval
);
1742 /* This inhibits warnings in, eg, cxx_mark_addressable
1744 warning_sentinel
s (extra_warnings
);
1745 expr
= build_static_cast (type
, expr
, tf_error
);
1746 if (expr
!= error_mark_node
)
1747 REF_PARENTHESIZED_P (expr
) = true;
1754 /* If T is an id-expression obfuscated by force_paren_expr, undo the
1755 obfuscation and return the underlying id-expression. Otherwise
1759 maybe_undo_parenthesized_ref (tree t
)
1761 if (cxx_dialect
< cxx14
)
1764 if (INDIRECT_REF_P (t
) && REF_PARENTHESIZED_P (t
))
1766 t
= TREE_OPERAND (t
, 0);
1767 while (TREE_CODE (t
) == NON_LVALUE_EXPR
1768 || TREE_CODE (t
) == NOP_EXPR
)
1769 t
= TREE_OPERAND (t
, 0);
1771 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
1772 || TREE_CODE (t
) == STATIC_CAST_EXPR
);
1773 t
= TREE_OPERAND (t
, 0);
1775 else if (TREE_CODE (t
) == PAREN_EXPR
)
1776 t
= TREE_OPERAND (t
, 0);
1781 /* Finish a parenthesized expression EXPR. */
1784 finish_parenthesized_expr (cp_expr expr
)
1787 /* This inhibits warnings in c_common_truthvalue_conversion. */
1788 TREE_NO_WARNING (expr
) = 1;
1790 if (TREE_CODE (expr
) == OFFSET_REF
1791 || TREE_CODE (expr
) == SCOPE_REF
)
1792 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1793 enclosed in parentheses. */
1794 PTRMEM_OK_P (expr
) = 0;
1796 if (TREE_CODE (expr
) == STRING_CST
)
1797 PAREN_STRING_LITERAL_P (expr
) = 1;
1799 expr
= cp_expr (force_paren_expr (expr
), expr
.get_location ());
1804 /* Finish a reference to a non-static data member (DECL) that is not
1805 preceded by `.' or `->'. */
1808 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1810 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1811 bool try_omp_private
= !object
&& omp_private_member_map
;
1816 tree scope
= qualifying_scope
;
1817 if (scope
== NULL_TREE
)
1818 scope
= context_for_name_lookup (decl
);
1819 object
= maybe_dummy_object (scope
, NULL
);
1822 object
= maybe_resolve_dummy (object
, true);
1823 if (object
== error_mark_node
)
1824 return error_mark_node
;
1826 /* DR 613/850: Can use non-static data members without an associated
1827 object in sizeof/decltype/alignof. */
1828 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1829 && (!processing_template_decl
|| !current_class_ref
))
1831 if (current_function_decl
1832 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1833 error ("invalid use of member %qD in static member function", decl
);
1835 error ("invalid use of non-static data member %qD", decl
);
1836 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1838 return error_mark_node
;
1841 if (current_class_ptr
)
1842 TREE_USED (current_class_ptr
) = 1;
1843 if (processing_template_decl
&& !qualifying_scope
)
1845 tree type
= TREE_TYPE (decl
);
1847 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1848 /* Quals on the object don't matter. */;
1849 else if (PACK_EXPANSION_P (type
))
1850 /* Don't bother trying to represent this. */
1854 /* Set the cv qualifiers. */
1855 int quals
= cp_type_quals (TREE_TYPE (object
));
1857 if (DECL_MUTABLE_P (decl
))
1858 quals
&= ~TYPE_QUAL_CONST
;
1860 quals
|= cp_type_quals (TREE_TYPE (decl
));
1861 type
= cp_build_qualified_type (type
, quals
);
1864 ret
= (convert_from_reference
1865 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1867 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1868 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1870 else if (processing_template_decl
)
1871 ret
= build_qualified_name (TREE_TYPE (decl
),
1874 /*template_p=*/false);
1877 tree access_type
= TREE_TYPE (object
);
1879 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1880 decl
, tf_warning_or_error
);
1882 /* If the data member was named `C::M', convert `*this' to `C'
1884 if (qualifying_scope
)
1886 tree binfo
= NULL_TREE
;
1887 object
= build_scoped_ref (object
, qualifying_scope
,
1891 ret
= build_class_member_access_expr (object
, decl
,
1892 /*access_path=*/NULL_TREE
,
1893 /*preserve_reference=*/false,
1894 tf_warning_or_error
);
1896 if (try_omp_private
)
1898 tree
*v
= omp_private_member_map
->get (decl
);
1900 ret
= convert_from_reference (*v
);
1905 /* If we are currently parsing a template and we encountered a typedef
1906 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1907 adds the typedef to a list tied to the current template.
1908 At template instantiation time, that list is walked and access check
1909 performed for each typedef.
1910 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1913 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1915 location_t location
)
1917 tree template_info
= NULL
;
1918 tree cs
= current_scope ();
1920 if (!is_typedef_decl (typedef_decl
)
1922 || !CLASS_TYPE_P (context
)
1926 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1927 template_info
= get_template_info (cs
);
1930 && TI_TEMPLATE (template_info
)
1931 && !currently_open_class (context
))
1932 append_type_to_template_for_access_check (cs
, typedef_decl
,
1936 /* DECL was the declaration to which a qualified-id resolved. Issue
1937 an error message if it is not accessible. If OBJECT_TYPE is
1938 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1939 type of `*x', or `x', respectively. If the DECL was named as
1940 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1943 check_accessibility_of_qualified_id (tree decl
,
1945 tree nested_name_specifier
)
1948 tree qualifying_type
= NULL_TREE
;
1950 /* If we are parsing a template declaration and if decl is a typedef,
1951 add it to a list tied to the template.
1952 At template instantiation time, that list will be walked and
1953 access check performed. */
1954 add_typedef_to_current_template_for_access_check (decl
,
1955 nested_name_specifier
1956 ? nested_name_specifier
1957 : DECL_CONTEXT (decl
),
1960 /* If we're not checking, return immediately. */
1961 if (deferred_access_no_check
)
1964 /* Determine the SCOPE of DECL. */
1965 scope
= context_for_name_lookup (decl
);
1966 /* If the SCOPE is not a type, then DECL is not a member. */
1967 if (!TYPE_P (scope
))
1969 /* Compute the scope through which DECL is being accessed. */
1971 /* OBJECT_TYPE might not be a class type; consider:
1973 class A { typedef int I; };
1977 In this case, we will have "A::I" as the DECL, but "I" as the
1979 && CLASS_TYPE_P (object_type
)
1980 && DERIVED_FROM_P (scope
, object_type
))
1981 /* If we are processing a `->' or `.' expression, use the type of the
1983 qualifying_type
= object_type
;
1984 else if (nested_name_specifier
)
1986 /* If the reference is to a non-static member of the
1987 current class, treat it as if it were referenced through
1990 if (DECL_NONSTATIC_MEMBER_P (decl
)
1991 && current_class_ptr
1992 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
1993 qualifying_type
= ct
;
1994 /* Otherwise, use the type indicated by the
1995 nested-name-specifier. */
1997 qualifying_type
= nested_name_specifier
;
2000 /* Otherwise, the name must be from the current class or one of
2002 qualifying_type
= currently_open_derived_class (scope
);
2005 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
2006 or similar in a default argument value. */
2007 && CLASS_TYPE_P (qualifying_type
)
2008 && !dependent_type_p (qualifying_type
))
2009 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
2010 decl
, tf_warning_or_error
);
2013 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
2014 class named to the left of the "::" operator. DONE is true if this
2015 expression is a complete postfix-expression; it is false if this
2016 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
2017 iff this expression is the operand of '&'. TEMPLATE_P is true iff
2018 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
2019 is true iff this qualified name appears as a template argument. */
2022 finish_qualified_id_expr (tree qualifying_class
,
2027 bool template_arg_p
,
2028 tsubst_flags_t complain
)
2030 gcc_assert (TYPE_P (qualifying_class
));
2032 if (error_operand_p (expr
))
2033 return error_mark_node
;
2035 if ((DECL_P (expr
) || BASELINK_P (expr
))
2036 && !mark_used (expr
, complain
))
2037 return error_mark_node
;
2041 if (TREE_CODE (expr
) == UNBOUND_CLASS_TEMPLATE
)
2043 /* cp_parser_lookup_name thought we were looking for a type,
2044 but we're actually looking for a declaration. */
2045 qualifying_class
= TYPE_CONTEXT (expr
);
2046 expr
= TYPE_IDENTIFIER (expr
);
2049 check_template_keyword (expr
);
2052 /* If EXPR occurs as the operand of '&', use special handling that
2053 permits a pointer-to-member. */
2054 if (address_p
&& done
)
2056 if (TREE_CODE (expr
) == SCOPE_REF
)
2057 expr
= TREE_OPERAND (expr
, 1);
2058 expr
= build_offset_ref (qualifying_class
, expr
,
2059 /*address_p=*/true, complain
);
2063 /* No need to check access within an enum. */
2064 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
)
2067 /* Within the scope of a class, turn references to non-static
2068 members into expression of the form "this->...". */
2070 /* But, within a template argument, we do not want make the
2071 transformation, as there is no "this" pointer. */
2073 else if (TREE_CODE (expr
) == FIELD_DECL
)
2075 push_deferring_access_checks (dk_no_check
);
2076 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
2078 pop_deferring_access_checks ();
2080 else if (BASELINK_P (expr
))
2082 /* See if any of the functions are non-static members. */
2083 /* If so, the expression may be relative to 'this'. */
2084 if (!shared_member_p (expr
)
2085 && current_class_ptr
2086 && DERIVED_FROM_P (qualifying_class
,
2087 current_nonlambda_class_type ()))
2088 expr
= (build_class_member_access_expr
2089 (maybe_dummy_object (qualifying_class
, NULL
),
2091 BASELINK_ACCESS_BINFO (expr
),
2092 /*preserve_reference=*/false,
2095 /* The expression is a qualified name whose address is not
2097 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
2102 /* In a template, return a SCOPE_REF for most qualified-ids
2103 so that we can check access at instantiation time. But if
2104 we're looking at a member of the current instantiation, we
2105 know we have access and building up the SCOPE_REF confuses
2106 non-type template argument handling. */
2107 if (processing_template_decl
2108 && (!currently_open_class (qualifying_class
)
2109 || TREE_CODE (expr
) == BIT_NOT_EXPR
))
2110 expr
= build_qualified_name (TREE_TYPE (expr
),
2111 qualifying_class
, expr
,
2114 expr
= convert_from_reference (expr
);
2120 /* Begin a statement-expression. The value returned must be passed to
2121 finish_stmt_expr. */
2124 begin_stmt_expr (void)
2126 return push_stmt_list ();
2129 /* Process the final expression of a statement expression. EXPR can be
2130 NULL, if the final expression is empty. Return a STATEMENT_LIST
2131 containing all the statements in the statement-expression, or
2132 ERROR_MARK_NODE if there was an error. */
2135 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2137 if (error_operand_p (expr
))
2139 /* The type of the statement-expression is the type of the last
2141 TREE_TYPE (stmt_expr
) = error_mark_node
;
2142 return error_mark_node
;
2145 /* If the last statement does not have "void" type, then the value
2146 of the last statement is the value of the entire expression. */
2149 tree type
= TREE_TYPE (expr
);
2151 if (type
&& type_unknown_p (type
))
2153 error ("a statement expression is an insufficient context"
2154 " for overload resolution");
2155 TREE_TYPE (stmt_expr
) = error_mark_node
;
2156 return error_mark_node
;
2158 else if (processing_template_decl
)
2160 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2161 expr
= add_stmt (expr
);
2162 /* Mark the last statement so that we can recognize it as such at
2163 template-instantiation time. */
2164 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2166 else if (VOID_TYPE_P (type
))
2168 /* Just treat this like an ordinary statement. */
2169 expr
= finish_expr_stmt (expr
);
2173 /* It actually has a value we need to deal with. First, force it
2174 to be an rvalue so that we won't need to build up a copy
2175 constructor call later when we try to assign it to something. */
2176 expr
= force_rvalue (expr
, tf_warning_or_error
);
2177 if (error_operand_p (expr
))
2178 return error_mark_node
;
2180 /* Update for array-to-pointer decay. */
2181 type
= TREE_TYPE (expr
);
2183 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2184 normal statement, but don't convert to void or actually add
2186 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2187 expr
= maybe_cleanup_point_expr (expr
);
2191 /* The type of the statement-expression is the type of the last
2193 TREE_TYPE (stmt_expr
) = type
;
2199 /* Finish a statement-expression. EXPR should be the value returned
2200 by the previous begin_stmt_expr. Returns an expression
2201 representing the statement-expression. */
2204 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2209 if (error_operand_p (stmt_expr
))
2211 pop_stmt_list (stmt_expr
);
2212 return error_mark_node
;
2215 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2217 type
= TREE_TYPE (stmt_expr
);
2218 result
= pop_stmt_list (stmt_expr
);
2219 TREE_TYPE (result
) = type
;
2221 if (processing_template_decl
)
2223 result
= build_min (STMT_EXPR
, type
, result
);
2224 TREE_SIDE_EFFECTS (result
) = 1;
2225 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2227 else if (CLASS_TYPE_P (type
))
2229 /* Wrap the statement-expression in a TARGET_EXPR so that the
2230 temporary object created by the final expression is destroyed at
2231 the end of the full-expression containing the
2232 statement-expression. */
2233 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2239 /* Returns the expression which provides the value of STMT_EXPR. */
2242 stmt_expr_value_expr (tree stmt_expr
)
2244 tree t
= STMT_EXPR_STMT (stmt_expr
);
2246 if (TREE_CODE (t
) == BIND_EXPR
)
2247 t
= BIND_EXPR_BODY (t
);
2249 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2250 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2252 if (TREE_CODE (t
) == EXPR_STMT
)
2253 t
= EXPR_STMT_EXPR (t
);
2258 /* Return TRUE iff EXPR_STMT is an empty list of
2259 expression statements. */
2262 empty_expr_stmt_p (tree expr_stmt
)
2264 tree body
= NULL_TREE
;
2266 if (expr_stmt
== void_node
)
2271 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2272 body
= EXPR_STMT_EXPR (expr_stmt
);
2273 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2279 if (TREE_CODE (body
) == STATEMENT_LIST
)
2280 return tsi_end_p (tsi_start (body
));
2282 return empty_expr_stmt_p (body
);
2287 /* Perform Koenig lookup. FN is the postfix-expression representing
2288 the function (or functions) to call; ARGS are the arguments to the
2289 call. Returns the functions to be considered by overload resolution. */
2292 perform_koenig_lookup (cp_expr fn
, vec
<tree
, va_gc
> *args
,
2293 tsubst_flags_t complain
)
2295 tree identifier
= NULL_TREE
;
2296 tree functions
= NULL_TREE
;
2297 tree tmpl_args
= NULL_TREE
;
2298 bool template_id
= false;
2299 location_t loc
= fn
.get_location ();
2301 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2303 /* Use a separate flag to handle null args. */
2305 tmpl_args
= TREE_OPERAND (fn
, 1);
2306 fn
= TREE_OPERAND (fn
, 0);
2309 /* Find the name of the overloaded function. */
2310 if (identifier_p (fn
))
2315 identifier
= OVL_NAME (functions
);
2318 /* A call to a namespace-scope function using an unqualified name.
2320 Do Koenig lookup -- unless any of the arguments are
2322 if (!any_type_dependent_arguments_p (args
)
2323 && !any_dependent_template_arguments_p (tmpl_args
))
2325 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2328 /* The unqualified name could not be resolved. */
2329 if (complain
& tf_error
)
2330 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2336 if (fn
&& template_id
&& fn
!= error_mark_node
)
2337 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2342 /* Generate an expression for `FN (ARGS)'. This may change the
2345 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2346 as a virtual call, even if FN is virtual. (This flag is set when
2347 encountering an expression where the function name is explicitly
2348 qualified. For example a call to `X::f' never generates a virtual
2351 Returns code for the call. */
2354 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2355 bool koenig_p
, tsubst_flags_t complain
)
2359 vec
<tree
, va_gc
> *orig_args
= NULL
;
2361 if (fn
== error_mark_node
)
2362 return error_mark_node
;
2364 gcc_assert (!TYPE_P (fn
));
2366 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2367 it so that we can tell this is a call to a known function. */
2368 fn
= maybe_undo_parenthesized_ref (fn
);
2372 if (processing_template_decl
)
2374 /* If FN is a local extern declaration or set thereof, look them up
2375 again at instantiation time. */
2376 if (is_overloaded_fn (fn
))
2378 tree ifn
= get_first_fn (fn
);
2379 if (TREE_CODE (ifn
) == FUNCTION_DECL
2380 && DECL_LOCAL_FUNCTION_P (ifn
))
2381 orig_fn
= DECL_NAME (ifn
);
2384 /* If the call expression is dependent, build a CALL_EXPR node
2385 with no type; type_dependent_expression_p recognizes
2386 expressions with no type as being dependent. */
2387 if (type_dependent_expression_p (fn
)
2388 || any_type_dependent_arguments_p (*args
))
2390 result
= build_min_nt_call_vec (orig_fn
, *args
);
2391 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2392 KOENIG_LOOKUP_P (result
) = koenig_p
;
2393 if (is_overloaded_fn (fn
))
2396 lookup_keep (fn
, true);
2401 bool abnormal
= true;
2402 for (lkp_iterator
iter (fn
); abnormal
&& iter
; ++iter
)
2404 tree fndecl
= *iter
;
2405 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2406 || !TREE_THIS_VOLATILE (fndecl
))
2409 /* FIXME: Stop warning about falling off end of non-void
2410 function. But this is wrong. Even if we only see
2411 no-return fns at this point, we could select a
2412 future-defined return fn during instantiation. Or
2415 current_function_returns_abnormally
= 1;
2419 orig_args
= make_tree_vector_copy (*args
);
2420 if (!BASELINK_P (fn
)
2421 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2422 && TREE_TYPE (fn
) != unknown_type_node
)
2423 fn
= build_non_dependent_expr (fn
);
2424 make_args_non_dependent (*args
);
2427 if (TREE_CODE (fn
) == COMPONENT_REF
)
2429 tree member
= TREE_OPERAND (fn
, 1);
2430 if (BASELINK_P (member
))
2432 tree object
= TREE_OPERAND (fn
, 0);
2433 return build_new_method_call (object
, member
,
2436 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2443 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2444 if (TREE_CODE (fn
) == ADDR_EXPR
2445 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2446 fn
= TREE_OPERAND (fn
, 0);
2448 if (is_overloaded_fn (fn
))
2449 fn
= baselink_for_fns (fn
);
2452 if (BASELINK_P (fn
))
2456 /* A call to a member function. From [over.call.func]:
2458 If the keyword this is in scope and refers to the class of
2459 that member function, or a derived class thereof, then the
2460 function call is transformed into a qualified function call
2461 using (*this) as the postfix-expression to the left of the
2462 . operator.... [Otherwise] a contrived object of type T
2463 becomes the implied object argument.
2467 struct A { void f(); };
2468 struct B : public A {};
2469 struct C : public A { void g() { B::f(); }};
2471 "the class of that member function" refers to `A'. But 11.2
2472 [class.access.base] says that we need to convert 'this' to B* as
2473 part of the access, so we pass 'B' to maybe_dummy_object. */
2475 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2477 /* A constructor call always uses a dummy object. (This constructor
2478 call which has the form A::A () is actually invalid and we are
2479 going to reject it later in build_new_method_call.) */
2480 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2483 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2486 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2488 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2493 else if (is_overloaded_fn (fn
))
2495 /* If the function is an overloaded builtin, resolve it. */
2496 if (TREE_CODE (fn
) == FUNCTION_DECL
2497 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2498 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2499 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2503 if (warn_sizeof_pointer_memaccess
2504 && (complain
& tf_warning
)
2505 && !vec_safe_is_empty (*args
)
2506 && !processing_template_decl
)
2508 location_t sizeof_arg_loc
[3];
2511 for (i
= 0; i
< 3; i
++)
2515 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2516 sizeof_arg
[i
] = NULL_TREE
;
2517 if (i
>= (*args
)->length ())
2520 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2522 if (SIZEOF_EXPR_TYPE_P (t
))
2523 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2525 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2526 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2528 sizeof_pointer_memaccess_warning
2529 (sizeof_arg_loc
, fn
, *args
,
2530 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2533 /* A call to a namespace-scope function. */
2534 result
= build_new_function_call (fn
, args
, complain
);
2537 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2539 if (!vec_safe_is_empty (*args
))
2540 error ("arguments to destructor are not allowed");
2541 /* Mark the pseudo-destructor call as having side-effects so
2542 that we do not issue warnings about its use. */
2543 result
= build1 (NOP_EXPR
,
2545 TREE_OPERAND (fn
, 0));
2546 TREE_SIDE_EFFECTS (result
) = 1;
2548 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2549 /* If the "function" is really an object of class type, it might
2550 have an overloaded `operator ()'. */
2551 result
= build_op_call (fn
, args
, complain
);
2554 /* A call where the function is unknown. */
2555 result
= cp_build_function_call_vec (fn
, args
, complain
);
2557 if (processing_template_decl
&& result
!= error_mark_node
)
2559 if (INDIRECT_REF_P (result
))
2560 result
= TREE_OPERAND (result
, 0);
2561 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2562 SET_EXPR_LOCATION (result
, input_location
);
2563 KOENIG_LOOKUP_P (result
) = koenig_p
;
2564 release_tree_vector (orig_args
);
2565 result
= convert_from_reference (result
);
2568 /* Free or retain OVERLOADs from lookup. */
2569 if (is_overloaded_fn (orig_fn
))
2570 lookup_keep (get_fns (orig_fn
), processing_template_decl
);
2575 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2576 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2577 POSTDECREMENT_EXPR.) */
2580 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2582 /* input_location holds the location of the trailing operator token.
2583 Build a location of the form:
2586 with the caret at the operator token, ranging from the start
2587 of EXPR to the end of the operator token. */
2588 location_t combined_loc
= make_location (input_location
,
2590 get_finish (input_location
));
2591 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2592 tf_warning_or_error
);
2593 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2594 result
.set_location (combined_loc
);
2598 /* Finish a use of `this'. Returns an expression for `this'. */
2601 finish_this_expr (void)
2603 tree result
= NULL_TREE
;
2605 if (current_class_ptr
)
2607 tree type
= TREE_TYPE (current_class_ref
);
2609 /* In a lambda expression, 'this' refers to the captured 'this'. */
2610 if (LAMBDA_TYPE_P (type
))
2611 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2613 result
= current_class_ptr
;
2617 /* The keyword 'this' is a prvalue expression. */
2618 return rvalue (result
);
2620 tree fn
= current_nonlambda_function ();
2621 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2622 error ("%<this%> is unavailable for static member functions");
2624 error ("invalid use of %<this%> in non-member function");
2626 error ("invalid use of %<this%> at top level");
2627 return error_mark_node
;
2630 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2631 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2632 the TYPE for the type given. If SCOPE is non-NULL, the expression
2633 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2636 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2639 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2640 return error_mark_node
;
2642 gcc_assert (TYPE_P (destructor
));
2644 if (!processing_template_decl
)
2646 if (scope
== error_mark_node
)
2648 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2649 return error_mark_node
;
2651 if (is_auto (destructor
))
2652 destructor
= TREE_TYPE (object
);
2653 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2656 "qualified type %qT does not match destructor name ~%qT",
2658 return error_mark_node
;
2662 /* [expr.pseudo] says both:
2664 The type designated by the pseudo-destructor-name shall be
2665 the same as the object type.
2669 The cv-unqualified versions of the object type and of the
2670 type designated by the pseudo-destructor-name shall be the
2673 We implement the more generous second sentence, since that is
2674 what most other compilers do. */
2675 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2678 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2679 return error_mark_node
;
2683 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2687 /* Finish an expression of the form CODE EXPR. */
2690 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2691 tsubst_flags_t complain
)
2693 /* Build a location of the form:
2696 with the caret at the operator token, ranging from the start
2697 of the operator token to the end of EXPR. */
2698 location_t combined_loc
= make_location (op_loc
,
2699 op_loc
, expr
.get_finish ());
2700 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2701 /* TODO: build_x_unary_op doesn't always honor the location. */
2702 result
.set_location (combined_loc
);
2704 tree result_ovl
, expr_ovl
;
2706 if (!(complain
& tf_warning
))
2709 result_ovl
= result
;
2712 if (!processing_template_decl
)
2713 expr_ovl
= cp_fully_fold (expr_ovl
);
2715 if (!CONSTANT_CLASS_P (expr_ovl
)
2716 || TREE_OVERFLOW_P (expr_ovl
))
2719 if (!processing_template_decl
)
2720 result_ovl
= cp_fully_fold (result_ovl
);
2722 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2723 overflow_warning (combined_loc
, result_ovl
);
2728 /* Finish a compound-literal expression or C++11 functional cast with aggregate
2729 initializer. TYPE is the type to which the CONSTRUCTOR in COMPOUND_LITERAL
2733 finish_compound_literal (tree type
, tree compound_literal
,
2734 tsubst_flags_t complain
,
2737 if (type
== error_mark_node
)
2738 return error_mark_node
;
2740 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2743 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2744 complain
, fcl_context
);
2745 return cp_build_c_cast (type
, compound_literal
, complain
);
2748 if (!TYPE_OBJ_P (type
))
2750 if (complain
& tf_error
)
2751 error ("compound literal of non-object type %qT", type
);
2752 return error_mark_node
;
2755 if (tree anode
= type_uses_auto (type
))
2756 if (CLASS_PLACEHOLDER_TEMPLATE (anode
))
2758 type
= do_auto_deduction (type
, compound_literal
, anode
, complain
,
2760 if (type
== error_mark_node
)
2761 return error_mark_node
;
2764 if (processing_template_decl
)
2766 TREE_TYPE (compound_literal
) = type
;
2767 /* Mark the expression as a compound literal. */
2768 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2769 if (fcl_context
== fcl_c99
)
2770 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2771 return compound_literal
;
2774 type
= complete_type (type
);
2776 if (TYPE_NON_AGGREGATE_CLASS (type
))
2778 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2779 everywhere that deals with function arguments would be a pain, so
2780 just wrap it in a TREE_LIST. The parser set a flag so we know
2781 that it came from T{} rather than T({}). */
2782 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2783 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2784 return build_functional_cast (type
, compound_literal
, complain
);
2787 if (TREE_CODE (type
) == ARRAY_TYPE
2788 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2789 return error_mark_node
;
2790 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2791 if (SCALAR_TYPE_P (type
)
2792 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2793 && !check_narrowing (type
, compound_literal
, complain
))
2794 return error_mark_node
;
2795 if (TREE_CODE (type
) == ARRAY_TYPE
2796 && TYPE_DOMAIN (type
) == NULL_TREE
)
2798 cp_complete_array_type_or_error (&type
, compound_literal
,
2800 if (type
== error_mark_node
)
2801 return error_mark_node
;
2803 compound_literal
= digest_init_flags (type
, compound_literal
, LOOKUP_NORMAL
,
2805 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2807 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2808 if (fcl_context
== fcl_c99
)
2809 CONSTRUCTOR_C99_COMPOUND_LITERAL (compound_literal
) = 1;
2812 /* Put static/constant array temporaries in static variables. */
2813 /* FIXME all C99 compound literals should be variables rather than C++
2814 temporaries, unless they are used as an aggregate initializer. */
2815 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2816 && fcl_context
== fcl_c99
2817 && TREE_CODE (type
) == ARRAY_TYPE
2818 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2819 && initializer_constant_valid_p (compound_literal
, type
))
2821 tree decl
= create_temporary_var (type
);
2822 DECL_INITIAL (decl
) = compound_literal
;
2823 TREE_STATIC (decl
) = 1;
2824 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2826 /* 5.19 says that a constant expression can include an
2827 lvalue-rvalue conversion applied to "a glvalue of literal type
2828 that refers to a non-volatile temporary object initialized
2829 with a constant expression". Rather than try to communicate
2830 that this VAR_DECL is a temporary, just mark it constexpr. */
2831 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2832 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2833 TREE_CONSTANT (decl
) = true;
2835 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2836 decl
= pushdecl_top_level (decl
);
2837 DECL_NAME (decl
) = make_anon_name ();
2838 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2839 /* Make sure the destructor is callable. */
2840 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2841 if (clean
== error_mark_node
)
2842 return error_mark_node
;
2846 /* Represent other compound literals with TARGET_EXPR so we produce
2847 an lvalue, but can elide copies. */
2848 if (!VECTOR_TYPE_P (type
))
2849 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2851 return compound_literal
;
2854 /* Return the declaration for the function-name variable indicated by
2858 finish_fname (tree id
)
2862 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2863 if (processing_template_decl
&& current_function_decl
2864 && decl
!= error_mark_node
)
2865 decl
= DECL_NAME (decl
);
2869 /* Finish a translation unit. */
2872 finish_translation_unit (void)
2874 /* In case there were missing closebraces,
2875 get us back to the global binding level. */
2877 while (current_namespace
!= global_namespace
)
2880 /* Do file scope __FUNCTION__ et al. */
2881 finish_fname_decls ();
2884 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2885 Returns the parameter. */
2888 finish_template_type_parm (tree aggr
, tree identifier
)
2890 if (aggr
!= class_type_node
)
2892 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2893 aggr
= class_type_node
;
2896 return build_tree_list (aggr
, identifier
);
2899 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2900 Returns the parameter. */
2903 finish_template_template_parm (tree aggr
, tree identifier
)
2905 tree decl
= build_decl (input_location
,
2906 TYPE_DECL
, identifier
, NULL_TREE
);
2908 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2909 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2910 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2911 DECL_ARTIFICIAL (decl
) = 1;
2913 // Associate the constraints with the underlying declaration,
2914 // not the template.
2915 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2916 tree constr
= build_constraints (reqs
, NULL_TREE
);
2917 set_constraints (decl
, constr
);
2919 end_template_decl ();
2921 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2923 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2924 /*is_primary=*/true, /*is_partial=*/false,
2927 return finish_template_type_parm (aggr
, tmpl
);
2930 /* ARGUMENT is the default-argument value for a template template
2931 parameter. If ARGUMENT is invalid, issue error messages and return
2932 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2935 check_template_template_default_arg (tree argument
)
2937 if (TREE_CODE (argument
) != TEMPLATE_DECL
2938 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2939 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2941 if (TREE_CODE (argument
) == TYPE_DECL
)
2942 error ("invalid use of type %qT as a default value for a template "
2943 "template-parameter", TREE_TYPE (argument
));
2945 error ("invalid default argument for a template template parameter");
2946 return error_mark_node
;
2952 /* Begin a class definition, as indicated by T. */
2955 begin_class_definition (tree t
)
2957 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2958 return error_mark_node
;
2960 if (processing_template_parmlist
)
2962 error ("definition of %q#T inside template parameter list", t
);
2963 return error_mark_node
;
2966 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2967 are passed the same as decimal scalar types. */
2968 if (TREE_CODE (t
) == RECORD_TYPE
2969 && !processing_template_decl
)
2971 tree ns
= TYPE_CONTEXT (t
);
2972 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2973 && DECL_CONTEXT (ns
) == std_node
2975 && id_equal (DECL_NAME (ns
), "decimal"))
2977 const char *n
= TYPE_NAME_STRING (t
);
2978 if ((strcmp (n
, "decimal32") == 0)
2979 || (strcmp (n
, "decimal64") == 0)
2980 || (strcmp (n
, "decimal128") == 0))
2981 TYPE_TRANSPARENT_AGGR (t
) = 1;
2985 /* A non-implicit typename comes from code like:
2987 template <typename T> struct A {
2988 template <typename U> struct A<T>::B ...
2990 This is erroneous. */
2991 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2993 error ("invalid definition of qualified type %qT", t
);
2994 t
= error_mark_node
;
2997 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2999 t
= make_class_type (RECORD_TYPE
);
3000 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
3003 if (TYPE_BEING_DEFINED (t
))
3005 t
= make_class_type (TREE_CODE (t
));
3006 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
3008 maybe_process_partial_specialization (t
);
3010 TYPE_BEING_DEFINED (t
) = 1;
3011 class_binding_level
->defining_class_p
= 1;
3013 if (flag_pack_struct
)
3016 TYPE_PACKED (t
) = 1;
3017 /* Even though the type is being defined for the first time
3018 here, there might have been a forward declaration, so there
3019 might be cv-qualified variants of T. */
3020 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
3021 TYPE_PACKED (v
) = 1;
3023 /* Reset the interface data, at the earliest possible
3024 moment, as it might have been set via a class foo;
3026 if (! TYPE_UNNAMED_P (t
))
3028 struct c_fileinfo
*finfo
= \
3029 get_fileinfo (LOCATION_FILE (input_location
));
3030 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
3031 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
3032 (t
, finfo
->interface_unknown
);
3034 reset_specialization();
3036 /* Make a declaration for this class in its own scope. */
3037 build_self_reference ();
3042 /* Finish the member declaration given by DECL. */
3045 finish_member_declaration (tree decl
)
3047 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
3050 if (decl
== void_type_node
)
3051 /* The COMPONENT was a friend, not a member, and so there's
3052 nothing for us to do. */
3055 /* We should see only one DECL at a time. */
3056 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
3058 /* Don't add decls after definition. */
3059 gcc_assert (TYPE_BEING_DEFINED (current_class_type
)
3060 /* We can add lambda types when late parsing default
3062 || LAMBDA_TYPE_P (TREE_TYPE (decl
)));
3064 /* Set up access control for DECL. */
3066 = (current_access_specifier
== access_private_node
);
3067 TREE_PROTECTED (decl
)
3068 = (current_access_specifier
== access_protected_node
);
3069 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3071 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
3072 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
3075 /* Mark the DECL as a member of the current class, unless it's
3076 a member of an enumeration. */
3077 if (TREE_CODE (decl
) != CONST_DECL
)
3078 DECL_CONTEXT (decl
) = current_class_type
;
3080 if (TREE_CODE (decl
) == USING_DECL
)
3081 /* For now, ignore class-scope USING_DECLS, so that debugging
3082 backends do not see them. */
3083 DECL_IGNORED_P (decl
) = 1;
3085 /* Check for bare parameter packs in the non-static data member
3087 if (TREE_CODE (decl
) == FIELD_DECL
)
3089 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
3090 TREE_TYPE (decl
) = error_mark_node
;
3091 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
3092 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
3097 A C language linkage is ignored for the names of class members
3098 and the member function type of class member functions. */
3099 if (DECL_LANG_SPECIFIC (decl
))
3100 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
3104 /* Functions and non-functions are added differently. */
3105 if (DECL_DECLARES_FUNCTION_P (decl
))
3106 add
= add_method (current_class_type
, decl
, false);
3107 /* Enter the DECL into the scope of the class, if the class
3108 isn't a closure (whose fields are supposed to be unnamed). */
3109 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3110 || pushdecl_class_level (decl
))
3115 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3116 go at the beginning. The reason is that
3117 legacy_nonfn_member_lookup searches the list in order, and we
3118 want a field name to override a type name so that the "struct
3119 stat hack" will work. In particular:
3121 struct S { enum E { }; static const int E = 5; int ary[S::E]; } s;
3125 if (TREE_CODE (decl
) == TYPE_DECL
)
3126 TYPE_FIELDS (current_class_type
)
3127 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3130 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3131 TYPE_FIELDS (current_class_type
) = decl
;
3134 maybe_add_class_template_decl_list (current_class_type
, decl
,
3139 /* Finish processing a complete template declaration. The PARMS are
3140 the template parameters. */
3143 finish_template_decl (tree parms
)
3146 end_template_decl ();
3148 end_specialization ();
3151 // Returns the template type of the class scope being entered. If we're
3152 // entering a constrained class scope. TYPE is the class template
3153 // scope being entered and we may need to match the intended type with
3154 // a constrained specialization. For example:
3156 // template<Object T>
3157 // struct S { void f(); }; #1
3159 // template<Object T>
3160 // void S<T>::f() { } #2
3162 // We check, in #2, that S<T> refers precisely to the type declared by
3163 // #1 (i.e., that the constraints match). Note that the following should
3164 // be an error since there is no specialization of S<T> that is
3165 // unconstrained, but this is not diagnosed here.
3167 // template<typename T>
3168 // void S<T>::f() { }
3170 // We cannot diagnose this problem here since this function also matches
3171 // qualified template names that are not part of a definition. For example:
3173 // template<Integral T, Floating_point U>
3174 // typename pair<T, U>::first_type void f(T, U);
3176 // Here, it is unlikely that there is a partial specialization of
3177 // pair constrained for for Integral and Floating_point arguments.
3179 // The general rule is: if a constrained specialization with matching
3180 // constraints is found return that type. Also note that if TYPE is not a
3181 // class-type (e.g. a typename type), then no fixup is needed.
3184 fixup_template_type (tree type
)
3186 // Find the template parameter list at the a depth appropriate to
3187 // the scope we're trying to enter.
3188 tree parms
= current_template_parms
;
3189 int depth
= template_class_depth (type
);
3190 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3191 parms
= TREE_CHAIN (parms
);
3194 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3195 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3197 // Search for a specialization whose type and constraints match.
3198 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3199 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3202 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3204 // If the type and constraints match a specialization, then we
3205 // are entering that type.
3206 if (same_type_p (type
, TREE_TYPE (specs
))
3207 && equivalent_constraints (cur_constr
, spec_constr
))
3208 return TREE_TYPE (specs
);
3209 specs
= TREE_CHAIN (specs
);
3212 // If no specialization matches, then must return the type
3213 // previously found.
3217 /* Finish processing a template-id (which names a type) of the form
3218 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3219 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3220 the scope of template-id indicated. */
3223 finish_template_type (tree name
, tree args
, int entering_scope
)
3227 type
= lookup_template_class (name
, args
,
3228 NULL_TREE
, NULL_TREE
, entering_scope
,
3229 tf_warning_or_error
| tf_user
);
3231 /* If we might be entering the scope of a partial specialization,
3232 find the one with the right constraints. */
3235 && CLASS_TYPE_P (type
)
3236 && CLASSTYPE_TEMPLATE_INFO (type
)
3237 && dependent_type_p (type
)
3238 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3239 type
= fixup_template_type (type
);
3241 if (type
== error_mark_node
)
3243 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3244 return TYPE_STUB_DECL (type
);
3246 return TYPE_NAME (type
);
3249 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3250 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3251 BASE_CLASS, or NULL_TREE if an error occurred. The
3252 ACCESS_SPECIFIER is one of
3253 access_{default,public,protected_private}_node. For a virtual base
3254 we set TREE_TYPE. */
3257 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3261 if (base
== error_mark_node
)
3263 error ("invalid base-class specification");
3266 else if (! MAYBE_CLASS_TYPE_P (base
))
3268 error ("%qT is not a class type", base
);
3273 if (cp_type_quals (base
) != 0)
3275 /* DR 484: Can a base-specifier name a cv-qualified
3277 base
= TYPE_MAIN_VARIANT (base
);
3279 result
= build_tree_list (access
, base
);
3281 TREE_TYPE (result
) = integer_type_node
;
3287 /* If FNS is a member function, a set of member functions, or a
3288 template-id referring to one or more member functions, return a
3289 BASELINK for FNS, incorporating the current access context.
3290 Otherwise, return FNS unchanged. */
3293 baselink_for_fns (tree fns
)
3298 if (BASELINK_P (fns
)
3299 || error_operand_p (fns
))
3302 scope
= ovl_scope (fns
);
3303 if (!CLASS_TYPE_P (scope
))
3306 cl
= currently_open_derived_class (scope
);
3309 cl
= TYPE_BINFO (cl
);
3310 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3313 /* Returns true iff DECL is a variable from a function outside
3317 outer_var_p (tree decl
)
3319 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3320 && DECL_FUNCTION_SCOPE_P (decl
)
3321 /* Don't get confused by temporaries. */
3323 && (DECL_CONTEXT (decl
) != current_function_decl
3324 || parsing_nsdmi ()));
3327 /* As above, but also checks that DECL is automatic. */
3330 outer_automatic_var_p (tree decl
)
3332 return (outer_var_p (decl
)
3333 && !TREE_STATIC (decl
));
3336 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3337 rewrite it for lambda capture.
3339 If ODR_USE is true, we're being called from mark_use, and we complain about
3340 use of constant variables. If ODR_USE is false, we're being called for the
3341 id-expression, and we do lambda capture. */
3344 process_outer_var_ref (tree decl
, tsubst_flags_t complain
, bool odr_use
)
3346 if (cp_unevaluated_operand
)
3347 /* It's not a use (3.2) if we're in an unevaluated context. */
3349 if (decl
== error_mark_node
)
3352 tree context
= DECL_CONTEXT (decl
);
3353 tree containing_function
= current_function_decl
;
3354 tree lambda_stack
= NULL_TREE
;
3355 tree lambda_expr
= NULL_TREE
;
3356 tree initializer
= convert_from_reference (decl
);
3358 /* Mark it as used now even if the use is ill-formed. */
3359 if (!mark_used (decl
, complain
))
3360 return error_mark_node
;
3362 if (parsing_nsdmi ())
3363 containing_function
= NULL_TREE
;
3365 if (containing_function
&& LAMBDA_FUNCTION_P (containing_function
))
3367 /* Check whether we've already built a proxy. */
3369 while (is_normal_capture_proxy (var
))
3370 var
= DECL_CAPTURED_VARIABLE (var
);
3371 tree d
= retrieve_local_specialization (var
);
3373 if (d
&& d
!= decl
&& is_capture_proxy (d
))
3375 if (DECL_CONTEXT (d
) == containing_function
)
3376 /* We already have an inner proxy. */
3379 /* We need to capture an outer proxy. */
3380 return process_outer_var_ref (d
, complain
, odr_use
);
3384 /* If we are in a lambda function, we can move out until we hit
3386 2. a non-lambda function, or
3387 3. a non-default capturing lambda function. */
3388 while (context
!= containing_function
3389 /* containing_function can be null with invalid generic lambdas. */
3390 && containing_function
3391 && LAMBDA_FUNCTION_P (containing_function
))
3393 tree closure
= DECL_CONTEXT (containing_function
);
3394 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3396 if (TYPE_CLASS_SCOPE_P (closure
))
3397 /* A lambda in an NSDMI (c++/64496). */
3400 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3404 lambda_stack
= tree_cons (NULL_TREE
,
3409 = decl_function_context (containing_function
);
3412 /* In a lambda within a template, wait until instantiation
3413 time to implicitly capture. */
3414 if (context
== containing_function
3415 && DECL_TEMPLATE_INFO (containing_function
)
3416 && uses_template_parms (DECL_TI_ARGS (containing_function
)))
3419 if (lambda_expr
&& VAR_P (decl
)
3420 && DECL_ANON_UNION_VAR_P (decl
))
3422 if (complain
& tf_error
)
3423 error ("cannot capture member %qD of anonymous union", decl
);
3424 return error_mark_node
;
3426 /* Do lambda capture when processing the id-expression, not when
3427 odr-using a variable. */
3428 if (!odr_use
&& context
== containing_function
)
3430 decl
= add_default_capture (lambda_stack
,
3431 /*id=*/DECL_NAME (decl
),
3434 /* Only an odr-use of an outer automatic variable causes an
3435 error, and a constant variable can decay to a prvalue
3436 constant without odr-use. So don't complain yet. */
3437 else if (!odr_use
&& decl_constant_var_p (decl
))
3439 else if (lambda_expr
)
3441 if (complain
& tf_error
)
3443 error ("%qD is not captured", decl
);
3444 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3445 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3447 inform (location_of (closure
),
3448 "the lambda has no capture-default");
3449 else if (TYPE_CLASS_SCOPE_P (closure
))
3450 inform (UNKNOWN_LOCATION
, "lambda in local class %q+T cannot "
3451 "capture variables from the enclosing context",
3452 TYPE_CONTEXT (closure
));
3453 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3455 return error_mark_node
;
3459 if (complain
& tf_error
)
3462 ? G_("use of local variable with automatic storage from "
3463 "containing function")
3464 : G_("use of parameter from containing function"));
3465 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3467 return error_mark_node
;
3472 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3473 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3474 if non-NULL, is the type or namespace used to explicitly qualify
3475 ID_EXPRESSION. DECL is the entity to which that name has been
3478 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3479 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3480 be set to true if this expression isn't permitted in a
3481 constant-expression, but it is otherwise not set by this function.
3482 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3483 constant-expression, but a non-constant expression is also
3486 DONE is true if this expression is a complete postfix-expression;
3487 it is false if this expression is followed by '->', '[', '(', etc.
3488 ADDRESS_P is true iff this expression is the operand of '&'.
3489 TEMPLATE_P is true iff the qualified-id was of the form
3490 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3491 appears as a template argument.
3493 If an error occurs, and it is the kind of error that might cause
3494 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3495 is the caller's responsibility to issue the message. *ERROR_MSG
3496 will be a string with static storage duration, so the caller need
3499 Return an expression for the entity, after issuing appropriate
3500 diagnostics. This function is also responsible for transforming a
3501 reference to a non-static member into a COMPONENT_REF that makes
3502 the use of "this" explicit.
3504 Upon return, *IDK will be filled in appropriately. */
3506 finish_id_expression (tree id_expression
,
3510 bool integral_constant_expression_p
,
3511 bool allow_non_integral_constant_expression_p
,
3512 bool *non_integral_constant_expression_p
,
3516 bool template_arg_p
,
3517 const char **error_msg
,
3518 location_t location
)
3520 decl
= strip_using_decl (decl
);
3522 /* Initialize the output parameters. */
3523 *idk
= CP_ID_KIND_NONE
;
3526 if (id_expression
== error_mark_node
)
3527 return error_mark_node
;
3528 /* If we have a template-id, then no further lookup is
3529 required. If the template-id was for a template-class, we
3530 will sometimes have a TYPE_DECL at this point. */
3531 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3532 || TREE_CODE (decl
) == TYPE_DECL
)
3534 /* Look up the name. */
3537 if (decl
== error_mark_node
)
3539 /* Name lookup failed. */
3542 || (!dependent_type_p (scope
)
3543 && !(identifier_p (id_expression
)
3544 && IDENTIFIER_CONV_OP_P (id_expression
)
3545 && dependent_type_p (TREE_TYPE (id_expression
))))))
3547 /* If the qualifying type is non-dependent (and the name
3548 does not name a conversion operator to a dependent
3549 type), issue an error. */
3550 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3551 return error_mark_node
;
3555 /* It may be resolved via Koenig lookup. */
3556 *idk
= CP_ID_KIND_UNQUALIFIED
;
3557 return id_expression
;
3560 decl
= id_expression
;
3562 /* If DECL is a variable that would be out of scope under
3563 ANSI/ISO rules, but in scope in the ARM, name lookup
3564 will succeed. Issue a diagnostic here. */
3566 decl
= check_for_out_of_scope_variable (decl
);
3568 /* Remember that the name was used in the definition of
3569 the current class so that we can check later to see if
3570 the meaning would have been different after the class
3571 was entirely defined. */
3572 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3573 maybe_note_name_used_in_class (id_expression
, decl
);
3575 /* A use in unevaluated operand might not be instantiated appropriately
3576 if tsubst_copy builds a dummy parm, or if we never instantiate a
3577 generic lambda, so mark it now. */
3578 if (processing_template_decl
&& cp_unevaluated_operand
)
3579 mark_type_use (decl
);
3581 /* Disallow uses of local variables from containing functions, except
3582 within lambda-expressions. */
3583 if (outer_automatic_var_p (decl
))
3585 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3586 if (decl
== error_mark_node
)
3587 return error_mark_node
;
3590 /* Also disallow uses of function parameters outside the function
3591 body, except inside an unevaluated context (i.e. decltype). */
3592 if (TREE_CODE (decl
) == PARM_DECL
3593 && DECL_CONTEXT (decl
) == NULL_TREE
3594 && !cp_unevaluated_operand
)
3596 *error_msg
= G_("use of parameter outside function body");
3597 return error_mark_node
;
3601 /* If we didn't find anything, or what we found was a type,
3602 then this wasn't really an id-expression. */
3603 if (TREE_CODE (decl
) == TEMPLATE_DECL
3604 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3606 *error_msg
= G_("missing template arguments");
3607 return error_mark_node
;
3609 else if (TREE_CODE (decl
) == TYPE_DECL
3610 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3612 *error_msg
= G_("expected primary-expression");
3613 return error_mark_node
;
3616 /* If the name resolved to a template parameter, there is no
3617 need to look it up again later. */
3618 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3619 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3623 *idk
= CP_ID_KIND_NONE
;
3624 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3625 decl
= TEMPLATE_PARM_DECL (decl
);
3626 r
= convert_from_reference (DECL_INITIAL (decl
));
3628 if (integral_constant_expression_p
3629 && !dependent_type_p (TREE_TYPE (decl
))
3630 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3632 if (!allow_non_integral_constant_expression_p
)
3633 error ("template parameter %qD of type %qT is not allowed in "
3634 "an integral constant expression because it is not of "
3635 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3636 *non_integral_constant_expression_p
= true;
3642 bool dependent_p
= type_dependent_expression_p (decl
);
3644 /* If the declaration was explicitly qualified indicate
3645 that. The semantics of `A::f(3)' are different than
3646 `f(3)' if `f' is virtual. */
3648 ? CP_ID_KIND_QUALIFIED
3649 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3650 ? CP_ID_KIND_TEMPLATE_ID
3652 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3653 : CP_ID_KIND_UNQUALIFIED
)));
3657 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (decl
)))
3658 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3659 wrong, so just return the identifier. */
3660 return id_expression
;
3662 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3664 error ("use of namespace %qD as expression", decl
);
3665 return error_mark_node
;
3667 else if (DECL_CLASS_TEMPLATE_P (decl
))
3669 error ("use of class template %qT as expression", decl
);
3670 return error_mark_node
;
3672 else if (TREE_CODE (decl
) == TREE_LIST
)
3674 /* Ambiguous reference to base members. */
3675 error ("request for member %qD is ambiguous in "
3676 "multiple inheritance lattice", id_expression
);
3677 print_candidates (decl
);
3678 return error_mark_node
;
3681 /* Mark variable-like entities as used. Functions are similarly
3682 marked either below or after overload resolution. */
3684 || TREE_CODE (decl
) == PARM_DECL
3685 || TREE_CODE (decl
) == CONST_DECL
3686 || TREE_CODE (decl
) == RESULT_DECL
)
3687 && !mark_used (decl
))
3688 return error_mark_node
;
3690 /* Only certain kinds of names are allowed in constant
3691 expression. Template parameters have already
3692 been handled above. */
3693 if (! error_operand_p (decl
)
3695 && integral_constant_expression_p
3696 && ! decl_constant_var_p (decl
)
3697 && TREE_CODE (decl
) != CONST_DECL
3698 && ! builtin_valid_in_constant_expr_p (decl
))
3700 if (!allow_non_integral_constant_expression_p
)
3702 error ("%qD cannot appear in a constant-expression", decl
);
3703 return error_mark_node
;
3705 *non_integral_constant_expression_p
= true;
3710 && !cp_unevaluated_operand
3711 && !processing_template_decl
3712 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3713 && CP_DECL_THREAD_LOCAL_P (decl
)
3714 && (wrap
= get_tls_wrapper_fn (decl
)))
3716 /* Replace an evaluated use of the thread_local variable with
3717 a call to its wrapper. */
3718 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3720 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3722 && variable_template_p (TREE_OPERAND (decl
, 0)))
3724 decl
= finish_template_variable (decl
);
3726 decl
= convert_from_reference (decl
);
3730 if (TREE_CODE (decl
) == SCOPE_REF
)
3732 gcc_assert (same_type_p (scope
, TREE_OPERAND (decl
, 0)));
3733 decl
= TREE_OPERAND (decl
, 1);
3736 decl
= (adjust_result_of_qualified_name_lookup
3737 (decl
, scope
, current_nonlambda_class_type()));
3739 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3743 decl
= finish_qualified_id_expr (scope
,
3749 tf_warning_or_error
);
3751 decl
= convert_from_reference (decl
);
3753 else if (TREE_CODE (decl
) == FIELD_DECL
)
3755 /* Since SCOPE is NULL here, this is an unqualified name.
3756 Access checking has been performed during name lookup
3757 already. Turn off checking to avoid duplicate errors. */
3758 push_deferring_access_checks (dk_no_check
);
3759 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3760 /*qualifying_scope=*/NULL_TREE
);
3761 pop_deferring_access_checks ();
3763 else if (is_overloaded_fn (decl
))
3765 tree first_fn
= get_first_fn (decl
);
3767 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3768 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3770 /* [basic.def.odr]: "A function whose name appears as a
3771 potentially-evaluated expression is odr-used if it is the unique
3774 But only mark it if it's a complete postfix-expression; in a call,
3775 ADL might select a different function, and we'll call mark_used in
3778 && !really_overloaded_fn (decl
)
3779 && !mark_used (first_fn
))
3780 return error_mark_node
;
3783 && TREE_CODE (first_fn
) == FUNCTION_DECL
3784 && DECL_FUNCTION_MEMBER_P (first_fn
)
3785 && !shared_member_p (decl
))
3787 /* A set of member functions. */
3788 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3789 return finish_class_member_access_expr (decl
, id_expression
,
3790 /*template_p=*/false,
3791 tf_warning_or_error
);
3794 decl
= baselink_for_fns (decl
);
3798 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3799 && DECL_CLASS_SCOPE_P (decl
))
3801 tree context
= context_for_name_lookup (decl
);
3802 if (context
!= current_class_type
)
3804 tree path
= currently_open_derived_class (context
);
3805 perform_or_defer_access_check (TYPE_BINFO (path
),
3807 tf_warning_or_error
);
3811 decl
= convert_from_reference (decl
);
3815 return cp_expr (decl
, location
);
3818 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3819 use as a type-specifier. */
3822 finish_typeof (tree expr
)
3826 if (type_dependent_expression_p (expr
))
3828 type
= cxx_make_type (TYPEOF_TYPE
);
3829 TYPEOF_TYPE_EXPR (type
) = expr
;
3830 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3835 expr
= mark_type_use (expr
);
3837 type
= unlowered_expr_type (expr
);
3839 if (!type
|| type
== unknown_type_node
)
3841 error ("type of %qE is unknown", expr
);
3842 return error_mark_node
;
3848 /* Implement the __underlying_type keyword: Return the underlying
3849 type of TYPE, suitable for use as a type-specifier. */
3852 finish_underlying_type (tree type
)
3854 tree underlying_type
;
3856 if (processing_template_decl
)
3858 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3859 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3860 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3862 return underlying_type
;
3865 if (!complete_type_or_else (type
, NULL_TREE
))
3866 return error_mark_node
;
3868 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3870 error ("%qT is not an enumeration type", type
);
3871 return error_mark_node
;
3874 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3876 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3877 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3878 See finish_enum_value_list for details. */
3879 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3881 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3882 TYPE_UNSIGNED (underlying_type
));
3884 return underlying_type
;
3887 /* Implement the __direct_bases keyword: Return the direct base classes
3891 calculate_direct_bases (tree type
, tsubst_flags_t complain
)
3893 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3894 || !NON_UNION_CLASS_TYPE_P (type
))
3895 return make_tree_vec (0);
3897 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3898 vec
<tree
, va_gc
> *base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3902 /* Virtual bases are initialized first */
3903 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3904 if (BINFO_VIRTUAL_P (binfo
))
3905 vec_safe_push (vector
, binfo
);
3907 /* Now non-virtuals */
3908 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3909 if (!BINFO_VIRTUAL_P (binfo
))
3910 vec_safe_push (vector
, binfo
);
3912 tree bases_vec
= make_tree_vec (vector
->length ());
3914 for (i
= 0; i
< vector
->length (); ++i
)
3915 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3917 release_tree_vector (vector
);
3921 /* Implement the __bases keyword: Return the base classes
3924 /* Find morally non-virtual base classes by walking binfo hierarchy */
3925 /* Virtual base classes are handled separately in finish_bases */
3928 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3930 /* Don't walk bases of virtual bases */
3931 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3935 dfs_calculate_bases_post (tree binfo
, void *data_
)
3937 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3938 if (!BINFO_VIRTUAL_P (binfo
))
3939 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3943 /* Calculates the morally non-virtual base classes of a class */
3944 static vec
<tree
, va_gc
> *
3945 calculate_bases_helper (tree type
)
3947 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3949 /* Now add non-virtual base classes in order of construction */
3950 if (TYPE_BINFO (type
))
3951 dfs_walk_all (TYPE_BINFO (type
),
3952 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3957 calculate_bases (tree type
, tsubst_flags_t complain
)
3959 if (!complete_type_or_maybe_complain (type
, NULL_TREE
, complain
)
3960 || !NON_UNION_CLASS_TYPE_P (type
))
3961 return make_tree_vec (0);
3963 vec
<tree
, va_gc
> *vector
= make_tree_vector ();
3964 tree bases_vec
= NULL_TREE
;
3966 vec
<tree
, va_gc
> *vbases
;
3967 vec
<tree
, va_gc
> *nonvbases
;
3970 /* First go through virtual base classes */
3971 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3972 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3974 vec
<tree
, va_gc
> *vbase_bases
3975 = calculate_bases_helper (BINFO_TYPE (binfo
));
3976 vec_safe_splice (vector
, vbase_bases
);
3977 release_tree_vector (vbase_bases
);
3980 /* Now for the non-virtual bases */
3981 nonvbases
= calculate_bases_helper (type
);
3982 vec_safe_splice (vector
, nonvbases
);
3983 release_tree_vector (nonvbases
);
3985 /* Note that during error recovery vector->length can even be zero. */
3986 if (vector
->length () > 1)
3988 /* Last element is entire class, so don't copy */
3989 bases_vec
= make_tree_vec (vector
->length () - 1);
3991 for (i
= 0; i
< vector
->length () - 1; ++i
)
3992 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3995 bases_vec
= make_tree_vec (0);
3997 release_tree_vector (vector
);
4002 finish_bases (tree type
, bool direct
)
4004 tree bases
= NULL_TREE
;
4006 if (!processing_template_decl
)
4008 /* Parameter packs can only be used in templates */
4009 error ("Parameter pack __bases only valid in template declaration");
4010 return error_mark_node
;
4013 bases
= cxx_make_type (BASES
);
4014 BASES_TYPE (bases
) = type
;
4015 BASES_DIRECT (bases
) = direct
;
4016 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
4021 /* Perform C++-specific checks for __builtin_offsetof before calling
4025 finish_offsetof (tree object_ptr
, tree expr
, location_t loc
)
4027 /* If we're processing a template, we can't finish the semantics yet.
4028 Otherwise we can fold the entire expression now. */
4029 if (processing_template_decl
)
4031 expr
= build2 (OFFSETOF_EXPR
, size_type_node
, expr
, object_ptr
);
4032 SET_EXPR_LOCATION (expr
, loc
);
4036 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
4038 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
4039 TREE_OPERAND (expr
, 2));
4040 return error_mark_node
;
4042 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
4043 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
4044 || TREE_TYPE (expr
) == unknown_type_node
)
4046 while (TREE_CODE (expr
) == COMPONENT_REF
4047 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4048 expr
= TREE_OPERAND (expr
, 1);
4052 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4053 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
4056 error ("cannot apply %<offsetof%> to member function");
4057 return error_mark_node
;
4059 if (TREE_CODE (expr
) == CONST_DECL
)
4061 error ("cannot apply %<offsetof%> to an enumerator %qD", expr
);
4062 return error_mark_node
;
4064 if (REFERENCE_REF_P (expr
))
4065 expr
= TREE_OPERAND (expr
, 0);
4066 if (!complete_type_or_else (TREE_TYPE (TREE_TYPE (object_ptr
)), object_ptr
))
4067 return error_mark_node
;
4068 if (warn_invalid_offsetof
4069 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (object_ptr
)))
4070 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (TREE_TYPE (object_ptr
)))
4071 && cp_unevaluated_operand
== 0)
4072 warning_at (loc
, OPT_Winvalid_offsetof
, "offsetof within "
4073 "non-standard-layout type %qT is conditionally-supported",
4074 TREE_TYPE (TREE_TYPE (object_ptr
)));
4075 return fold_offsetof (expr
);
4078 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4079 function is broken out from the above for the benefit of the tree-ssa
4083 simplify_aggr_init_expr (tree
*tp
)
4085 tree aggr_init_expr
= *tp
;
4087 /* Form an appropriate CALL_EXPR. */
4088 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4089 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4090 tree type
= TREE_TYPE (slot
);
4093 enum style_t
{ ctor
, arg
, pcc
} style
;
4095 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4097 #ifdef PCC_STATIC_STRUCT_RETURN
4103 gcc_assert (TREE_ADDRESSABLE (type
));
4107 call_expr
= build_call_array_loc (input_location
,
4108 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4110 aggr_init_expr_nargs (aggr_init_expr
),
4111 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4112 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4113 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4114 CALL_EXPR_OPERATOR_SYNTAX (call_expr
)
4115 = CALL_EXPR_OPERATOR_SYNTAX (aggr_init_expr
);
4116 CALL_EXPR_ORDERED_ARGS (call_expr
) = CALL_EXPR_ORDERED_ARGS (aggr_init_expr
);
4117 CALL_EXPR_REVERSE_ARGS (call_expr
) = CALL_EXPR_REVERSE_ARGS (aggr_init_expr
);
4121 /* Replace the first argument to the ctor with the address of the
4123 cxx_mark_addressable (slot
);
4124 CALL_EXPR_ARG (call_expr
, 0) =
4125 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4127 else if (style
== arg
)
4129 /* Just mark it addressable here, and leave the rest to
4130 expand_call{,_inline}. */
4131 cxx_mark_addressable (slot
);
4132 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4133 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4135 else if (style
== pcc
)
4137 /* If we're using the non-reentrant PCC calling convention, then we
4138 need to copy the returned value out of the static buffer into the
4140 push_deferring_access_checks (dk_no_check
);
4141 call_expr
= build_aggr_init (slot
, call_expr
,
4142 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4143 tf_warning_or_error
);
4144 pop_deferring_access_checks ();
4145 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4148 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4150 tree init
= build_zero_init (type
, NULL_TREE
,
4151 /*static_storage_p=*/false);
4152 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4153 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4160 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4163 emit_associated_thunks (tree fn
)
4165 /* When we use vcall offsets, we emit thunks with the virtual
4166 functions to which they thunk. The whole point of vcall offsets
4167 is so that you can know statically the entire set of thunks that
4168 will ever be needed for a given virtual function, thereby
4169 enabling you to output all the thunks with the function itself. */
4170 if (DECL_VIRTUAL_P (fn
)
4171 /* Do not emit thunks for extern template instantiations. */
4172 && ! DECL_REALLY_EXTERN (fn
))
4176 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4178 if (!THUNK_ALIAS (thunk
))
4180 use_thunk (thunk
, /*emit_p=*/1);
4181 if (DECL_RESULT_THUNK_P (thunk
))
4185 for (probe
= DECL_THUNKS (thunk
);
4186 probe
; probe
= DECL_CHAIN (probe
))
4187 use_thunk (probe
, /*emit_p=*/1);
4191 gcc_assert (!DECL_THUNKS (thunk
));
4196 /* Generate RTL for FN. */
4199 expand_or_defer_fn_1 (tree fn
)
4201 /* When the parser calls us after finishing the body of a template
4202 function, we don't really want to expand the body. */
4203 if (processing_template_decl
)
4205 /* Normally, collection only occurs in rest_of_compilation. So,
4206 if we don't collect here, we never collect junk generated
4207 during the processing of templates until we hit a
4208 non-template function. It's not safe to do this inside a
4209 nested class, though, as the parser may have local state that
4210 is not a GC root. */
4211 if (!function_depth
)
4216 gcc_assert (DECL_SAVED_TREE (fn
));
4218 /* We make a decision about linkage for these functions at the end
4219 of the compilation. Until that point, we do not want the back
4220 end to output them -- but we do want it to see the bodies of
4221 these functions so that it can inline them as appropriate. */
4222 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4224 if (DECL_INTERFACE_KNOWN (fn
))
4225 /* We've already made a decision as to how this function will
4228 tentative_decl_linkage (fn
);
4230 import_export_decl (fn
);
4232 /* If the user wants us to keep all inline functions, then mark
4233 this function as needed so that finish_file will make sure to
4234 output it later. Similarly, all dllexport'd functions must
4235 be emitted; there may be callers in other DLLs. */
4236 if (DECL_DECLARED_INLINE_P (fn
)
4237 && !DECL_REALLY_EXTERN (fn
)
4238 && (flag_keep_inline_functions
4239 || (flag_keep_inline_dllexport
4240 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4243 DECL_EXTERNAL (fn
) = 0;
4247 /* If this is a constructor or destructor body, we have to clone
4249 if (maybe_clone_body (fn
))
4251 /* We don't want to process FN again, so pretend we've written
4252 it out, even though we haven't. */
4253 TREE_ASM_WRITTEN (fn
) = 1;
4254 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4255 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4256 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4260 /* There's no reason to do any of the work here if we're only doing
4261 semantic analysis; this code just generates RTL. */
4262 if (flag_syntax_only
)
4269 expand_or_defer_fn (tree fn
)
4271 if (expand_or_defer_fn_1 (fn
))
4275 /* Expand or defer, at the whim of the compilation unit manager. */
4276 cgraph_node::finalize_function (fn
, function_depth
> 1);
4277 emit_associated_thunks (fn
);
4285 nrv_data () : visited (37) {}
4289 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4292 /* Helper function for walk_tree, used by finalize_nrv below. */
4295 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4297 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4300 /* No need to walk into types. There wouldn't be any need to walk into
4301 non-statements, except that we have to consider STMT_EXPRs. */
4304 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4305 but differs from using NULL_TREE in that it indicates that we care
4306 about the value of the RESULT_DECL. */
4307 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4308 TREE_OPERAND (*tp
, 0) = dp
->result
;
4309 /* Change all cleanups for the NRV to only run when an exception is
4311 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4312 && CLEANUP_DECL (*tp
) == dp
->var
)
4313 CLEANUP_EH_ONLY (*tp
) = 1;
4314 /* Replace the DECL_EXPR for the NRV with an initialization of the
4315 RESULT_DECL, if needed. */
4316 else if (TREE_CODE (*tp
) == DECL_EXPR
4317 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4320 if (DECL_INITIAL (dp
->var
)
4321 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4322 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4323 DECL_INITIAL (dp
->var
));
4325 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4326 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4327 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4330 /* And replace all uses of the NRV with the RESULT_DECL. */
4331 else if (*tp
== dp
->var
)
4334 /* Avoid walking into the same tree more than once. Unfortunately, we
4335 can't just use walk_tree_without duplicates because it would only call
4336 us for the first occurrence of dp->var in the function body. */
4337 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4343 /* Keep iterating. */
4347 /* Called from finish_function to implement the named return value
4348 optimization by overriding all the RETURN_EXPRs and pertinent
4349 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4350 RESULT_DECL for the function. */
4353 finalize_nrv (tree
*tp
, tree var
, tree result
)
4355 struct nrv_data data
;
4357 /* Copy name from VAR to RESULT. */
4358 DECL_NAME (result
) = DECL_NAME (var
);
4359 /* Don't forget that we take its address. */
4360 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4361 /* Finally set DECL_VALUE_EXPR to avoid assigning
4362 a stack slot at -O0 for the original var and debug info
4363 uses RESULT location for VAR. */
4364 SET_DECL_VALUE_EXPR (var
, result
);
4365 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4368 data
.result
= result
;
4369 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4372 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4375 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4376 bool need_copy_ctor
, bool need_copy_assignment
,
4379 int save_errorcount
= errorcount
;
4382 /* Always allocate 3 elements for simplicity. These are the
4383 function decls for the ctor, dtor, and assignment op.
4384 This layout is known to the three lang hooks,
4385 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4386 and cxx_omp_clause_assign_op. */
4387 info
= make_tree_vec (3);
4388 CP_OMP_CLAUSE_INFO (c
) = info
;
4390 if (need_default_ctor
|| need_copy_ctor
)
4392 if (need_default_ctor
)
4393 t
= get_default_ctor (type
);
4395 t
= get_copy_ctor (type
, tf_warning_or_error
);
4397 if (t
&& !trivial_fn_p (t
))
4398 TREE_VEC_ELT (info
, 0) = t
;
4401 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4402 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4404 if (need_copy_assignment
)
4406 t
= get_copy_assign (type
);
4408 if (t
&& !trivial_fn_p (t
))
4409 TREE_VEC_ELT (info
, 2) = t
;
4412 return errorcount
!= save_errorcount
;
4415 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4416 FIELD_DECL, otherwise return DECL itself. */
4419 omp_clause_decl_field (tree decl
)
4422 && DECL_HAS_VALUE_EXPR_P (decl
)
4423 && DECL_ARTIFICIAL (decl
)
4424 && DECL_LANG_SPECIFIC (decl
)
4425 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4427 tree f
= DECL_VALUE_EXPR (decl
);
4428 if (INDIRECT_REF_P (f
))
4429 f
= TREE_OPERAND (f
, 0);
4430 if (TREE_CODE (f
) == COMPONENT_REF
)
4432 f
= TREE_OPERAND (f
, 1);
4433 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4440 /* Adjust DECL if needed for printing using %qE. */
4443 omp_clause_printable_decl (tree decl
)
4445 tree t
= omp_clause_decl_field (decl
);
4451 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4452 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4456 omp_note_field_privatization (tree f
, tree t
)
4458 if (!omp_private_member_map
)
4459 omp_private_member_map
= new hash_map
<tree
, tree
>;
4460 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4464 omp_private_member_vec
.safe_push (f
);
4465 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4466 omp_private_member_vec
.safe_push (integer_zero_node
);
4470 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4474 omp_privatize_field (tree t
, bool shared
)
4476 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4477 if (m
== error_mark_node
)
4478 return error_mark_node
;
4479 if (!omp_private_member_map
&& !shared
)
4480 omp_private_member_map
= new hash_map
<tree
, tree
>;
4481 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4483 gcc_assert (INDIRECT_REF_P (m
));
4484 m
= TREE_OPERAND (m
, 0);
4486 tree vb
= NULL_TREE
;
4487 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4490 v
= create_temporary_var (TREE_TYPE (m
));
4491 retrofit_lang_decl (v
);
4492 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4493 SET_DECL_VALUE_EXPR (v
, m
);
4494 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4496 omp_private_member_vec
.safe_push (t
);
4501 /* Helper function for handle_omp_array_sections. Called recursively
4502 to handle multiple array-section-subscripts. C is the clause,
4503 T current expression (initially OMP_CLAUSE_DECL), which is either
4504 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4505 expression if specified, TREE_VALUE length expression if specified,
4506 TREE_CHAIN is what it has been specified after, or some decl.
4507 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4508 set to true if any of the array-section-subscript could have length
4509 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4510 first array-section-subscript which is known not to have length
4512 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4513 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4514 all are or may have length of 1, array-section-subscript [:2] is the
4515 first one known not to have length 1. For array-section-subscript
4516 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4517 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4518 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4519 case though, as some lengths could be zero. */
4522 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4523 bool &maybe_zero_len
, unsigned int &first_non_one
,
4524 enum c_omp_region_type ort
)
4526 tree ret
, low_bound
, length
, type
;
4527 if (TREE_CODE (t
) != TREE_LIST
)
4529 if (error_operand_p (t
))
4530 return error_mark_node
;
4531 if (REFERENCE_REF_P (t
)
4532 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4533 t
= TREE_OPERAND (t
, 0);
4535 if (TREE_CODE (t
) == COMPONENT_REF
4537 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4538 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4539 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4540 && !type_dependent_expression_p (t
))
4542 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
4543 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4545 error_at (OMP_CLAUSE_LOCATION (c
),
4546 "bit-field %qE in %qs clause",
4547 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4548 return error_mark_node
;
4550 while (TREE_CODE (t
) == COMPONENT_REF
)
4552 if (TREE_TYPE (TREE_OPERAND (t
, 0))
4553 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4555 error_at (OMP_CLAUSE_LOCATION (c
),
4556 "%qE is a member of a union", t
);
4557 return error_mark_node
;
4559 t
= TREE_OPERAND (t
, 0);
4561 if (REFERENCE_REF_P (t
))
4562 t
= TREE_OPERAND (t
, 0);
4564 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4566 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
4569 error_at (OMP_CLAUSE_LOCATION (c
),
4570 "%qD is not a variable in %qs clause", t
,
4571 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4573 error_at (OMP_CLAUSE_LOCATION (c
),
4574 "%qE is not a variable in %qs clause", t
,
4575 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4576 return error_mark_node
;
4578 else if (TREE_CODE (t
) == PARM_DECL
4579 && DECL_ARTIFICIAL (t
)
4580 && DECL_NAME (t
) == this_identifier
)
4582 error_at (OMP_CLAUSE_LOCATION (c
),
4583 "%<this%> allowed in OpenMP only in %<declare simd%>"
4585 return error_mark_node
;
4587 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4588 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4590 error_at (OMP_CLAUSE_LOCATION (c
),
4591 "%qD is threadprivate variable in %qs clause", t
,
4592 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4593 return error_mark_node
;
4595 if (type_dependent_expression_p (ret
))
4597 ret
= convert_from_reference (ret
);
4601 if (ort
== C_ORT_OMP
4602 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4603 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4604 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4605 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4606 maybe_zero_len
, first_non_one
, ort
);
4607 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4610 type
= TREE_TYPE (ret
);
4611 low_bound
= TREE_PURPOSE (t
);
4612 length
= TREE_VALUE (t
);
4613 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4614 || (length
&& type_dependent_expression_p (length
)))
4617 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4618 return error_mark_node
;
4620 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4622 error_at (OMP_CLAUSE_LOCATION (c
),
4623 "low bound %qE of array section does not have integral type",
4625 return error_mark_node
;
4627 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4629 error_at (OMP_CLAUSE_LOCATION (c
),
4630 "length %qE of array section does not have integral type",
4632 return error_mark_node
;
4635 low_bound
= mark_rvalue_use (low_bound
);
4637 length
= mark_rvalue_use (length
);
4638 /* We need to reduce to real constant-values for checks below. */
4640 length
= fold_simple (length
);
4642 low_bound
= fold_simple (low_bound
);
4644 && TREE_CODE (low_bound
) == INTEGER_CST
4645 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4646 > TYPE_PRECISION (sizetype
))
4647 low_bound
= fold_convert (sizetype
, low_bound
);
4649 && TREE_CODE (length
) == INTEGER_CST
4650 && TYPE_PRECISION (TREE_TYPE (length
))
4651 > TYPE_PRECISION (sizetype
))
4652 length
= fold_convert (sizetype
, length
);
4653 if (low_bound
== NULL_TREE
)
4654 low_bound
= integer_zero_node
;
4656 if (length
!= NULL_TREE
)
4658 if (!integer_nonzerop (length
))
4660 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4661 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4663 if (integer_zerop (length
))
4665 error_at (OMP_CLAUSE_LOCATION (c
),
4666 "zero length array section in %qs clause",
4667 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4668 return error_mark_node
;
4672 maybe_zero_len
= true;
4674 if (first_non_one
== types
.length ()
4675 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4678 if (TREE_CODE (type
) == ARRAY_TYPE
)
4680 if (length
== NULL_TREE
4681 && (TYPE_DOMAIN (type
) == NULL_TREE
4682 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4684 error_at (OMP_CLAUSE_LOCATION (c
),
4685 "for unknown bound array type length expression must "
4687 return error_mark_node
;
4689 if (TREE_CODE (low_bound
) == INTEGER_CST
4690 && tree_int_cst_sgn (low_bound
) == -1)
4692 error_at (OMP_CLAUSE_LOCATION (c
),
4693 "negative low bound in array section in %qs clause",
4694 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4695 return error_mark_node
;
4697 if (length
!= NULL_TREE
4698 && TREE_CODE (length
) == INTEGER_CST
4699 && tree_int_cst_sgn (length
) == -1)
4701 error_at (OMP_CLAUSE_LOCATION (c
),
4702 "negative length in array section in %qs clause",
4703 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4704 return error_mark_node
;
4706 if (TYPE_DOMAIN (type
)
4707 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4708 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4712 = fold_convert (sizetype
, TYPE_MAX_VALUE (TYPE_DOMAIN (type
)));
4713 size
= size_binop (PLUS_EXPR
, size
, size_one_node
);
4714 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4716 if (tree_int_cst_lt (size
, low_bound
))
4718 error_at (OMP_CLAUSE_LOCATION (c
),
4719 "low bound %qE above array section size "
4720 "in %qs clause", low_bound
,
4721 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4722 return error_mark_node
;
4724 if (tree_int_cst_equal (size
, low_bound
))
4726 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4727 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4729 error_at (OMP_CLAUSE_LOCATION (c
),
4730 "zero length array section in %qs clause",
4731 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4732 return error_mark_node
;
4734 maybe_zero_len
= true;
4736 else if (length
== NULL_TREE
4737 && first_non_one
== types
.length ()
4738 && tree_int_cst_equal
4739 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4743 else if (length
== NULL_TREE
)
4745 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4746 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4747 maybe_zero_len
= true;
4748 if (first_non_one
== types
.length ())
4751 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4753 if (tree_int_cst_lt (size
, length
))
4755 error_at (OMP_CLAUSE_LOCATION (c
),
4756 "length %qE above array section size "
4757 "in %qs clause", length
,
4758 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4759 return error_mark_node
;
4761 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4764 = size_binop (PLUS_EXPR
,
4765 fold_convert (sizetype
, low_bound
),
4766 fold_convert (sizetype
, length
));
4767 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4768 && tree_int_cst_lt (size
, lbpluslen
))
4770 error_at (OMP_CLAUSE_LOCATION (c
),
4771 "high bound %qE above array section size "
4772 "in %qs clause", lbpluslen
,
4773 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4774 return error_mark_node
;
4779 else if (length
== NULL_TREE
)
4781 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4782 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4783 maybe_zero_len
= true;
4784 if (first_non_one
== types
.length ())
4788 /* For [lb:] we will need to evaluate lb more than once. */
4789 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4791 tree lb
= cp_save_expr (low_bound
);
4792 if (lb
!= low_bound
)
4794 TREE_PURPOSE (t
) = lb
;
4799 else if (TREE_CODE (type
) == POINTER_TYPE
)
4801 if (length
== NULL_TREE
)
4803 error_at (OMP_CLAUSE_LOCATION (c
),
4804 "for pointer type length expression must be specified");
4805 return error_mark_node
;
4807 if (length
!= NULL_TREE
4808 && TREE_CODE (length
) == INTEGER_CST
4809 && tree_int_cst_sgn (length
) == -1)
4811 error_at (OMP_CLAUSE_LOCATION (c
),
4812 "negative length in array section in %qs clause",
4813 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4814 return error_mark_node
;
4816 /* If there is a pointer type anywhere but in the very first
4817 array-section-subscript, the array section can't be contiguous. */
4818 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4819 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4821 error_at (OMP_CLAUSE_LOCATION (c
),
4822 "array section is not contiguous in %qs clause",
4823 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4824 return error_mark_node
;
4829 error_at (OMP_CLAUSE_LOCATION (c
),
4830 "%qE does not have pointer or array type", ret
);
4831 return error_mark_node
;
4833 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4834 types
.safe_push (TREE_TYPE (ret
));
4835 /* We will need to evaluate lb more than once. */
4836 tree lb
= cp_save_expr (low_bound
);
4837 if (lb
!= low_bound
)
4839 TREE_PURPOSE (t
) = lb
;
4842 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4846 /* Handle array sections for clause C. */
4849 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4851 bool maybe_zero_len
= false;
4852 unsigned int first_non_one
= 0;
4853 auto_vec
<tree
, 10> types
;
4854 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4855 maybe_zero_len
, first_non_one
,
4857 if (first
== error_mark_node
)
4859 if (first
== NULL_TREE
)
4861 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4863 tree t
= OMP_CLAUSE_DECL (c
);
4864 tree tem
= NULL_TREE
;
4865 if (processing_template_decl
)
4867 /* Need to evaluate side effects in the length expressions
4869 while (TREE_CODE (t
) == TREE_LIST
)
4871 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4873 if (tem
== NULL_TREE
)
4874 tem
= TREE_VALUE (t
);
4876 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4877 TREE_VALUE (t
), tem
);
4882 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4883 OMP_CLAUSE_DECL (c
) = first
;
4887 unsigned int num
= types
.length (), i
;
4888 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4889 tree condition
= NULL_TREE
;
4891 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4892 maybe_zero_len
= true;
4893 if (processing_template_decl
&& maybe_zero_len
)
4896 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4899 tree low_bound
= TREE_PURPOSE (t
);
4900 tree length
= TREE_VALUE (t
);
4904 && TREE_CODE (low_bound
) == INTEGER_CST
4905 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4906 > TYPE_PRECISION (sizetype
))
4907 low_bound
= fold_convert (sizetype
, low_bound
);
4909 && TREE_CODE (length
) == INTEGER_CST
4910 && TYPE_PRECISION (TREE_TYPE (length
))
4911 > TYPE_PRECISION (sizetype
))
4912 length
= fold_convert (sizetype
, length
);
4913 if (low_bound
== NULL_TREE
)
4914 low_bound
= integer_zero_node
;
4915 if (!maybe_zero_len
&& i
> first_non_one
)
4917 if (integer_nonzerop (low_bound
))
4918 goto do_warn_noncontiguous
;
4919 if (length
!= NULL_TREE
4920 && TREE_CODE (length
) == INTEGER_CST
4921 && TYPE_DOMAIN (types
[i
])
4922 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4923 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4927 size
= size_binop (PLUS_EXPR
,
4928 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4930 if (!tree_int_cst_equal (length
, size
))
4932 do_warn_noncontiguous
:
4933 error_at (OMP_CLAUSE_LOCATION (c
),
4934 "array section is not contiguous in %qs "
4936 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4940 if (!processing_template_decl
4941 && length
!= NULL_TREE
4942 && TREE_SIDE_EFFECTS (length
))
4944 if (side_effects
== NULL_TREE
)
4945 side_effects
= length
;
4947 side_effects
= build2 (COMPOUND_EXPR
,
4948 TREE_TYPE (side_effects
),
4949 length
, side_effects
);
4952 else if (processing_template_decl
)
4958 if (i
> first_non_one
4959 && ((length
&& integer_nonzerop (length
))
4960 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
))
4963 l
= fold_convert (sizetype
, length
);
4966 l
= size_binop (PLUS_EXPR
,
4967 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4969 l
= size_binop (MINUS_EXPR
, l
,
4970 fold_convert (sizetype
, low_bound
));
4972 if (i
> first_non_one
)
4974 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4976 if (condition
== NULL_TREE
)
4979 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4982 else if (size
== NULL_TREE
)
4984 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4985 tree eltype
= TREE_TYPE (types
[num
- 1]);
4986 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4987 eltype
= TREE_TYPE (eltype
);
4988 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4989 size
= size_binop (EXACT_DIV_EXPR
, size
,
4990 size_in_bytes (eltype
));
4991 size
= size_binop (MULT_EXPR
, size
, l
);
4993 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4994 size
, size_zero_node
);
4997 size
= size_binop (MULT_EXPR
, size
, l
);
5000 if (!processing_template_decl
)
5003 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
5004 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
5006 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5007 tree index_type
= build_index_type (size
);
5008 tree eltype
= TREE_TYPE (first
);
5009 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
5010 eltype
= TREE_TYPE (eltype
);
5011 tree type
= build_array_type (eltype
, index_type
);
5012 tree ptype
= build_pointer_type (eltype
);
5013 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
5014 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
5015 t
= convert_from_reference (t
);
5016 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5017 t
= build_fold_addr_expr (t
);
5018 tree t2
= build_fold_addr_expr (first
);
5019 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5020 ptrdiff_type_node
, t2
);
5021 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5022 ptrdiff_type_node
, t2
,
5023 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5024 ptrdiff_type_node
, t
));
5025 if (tree_fits_shwi_p (t2
))
5026 t
= build2 (MEM_REF
, type
, t
,
5027 build_int_cst (ptype
, tree_to_shwi (t2
)));
5030 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5032 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
5033 TREE_TYPE (t
), t
, t2
);
5034 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
5036 OMP_CLAUSE_DECL (c
) = t
;
5039 OMP_CLAUSE_DECL (c
) = first
;
5040 OMP_CLAUSE_SIZE (c
) = size
;
5041 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
5042 || (TREE_CODE (t
) == COMPONENT_REF
5043 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
5045 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
5046 switch (OMP_CLAUSE_MAP_KIND (c
))
5048 case GOMP_MAP_ALLOC
:
5051 case GOMP_MAP_TOFROM
:
5052 case GOMP_MAP_ALWAYS_TO
:
5053 case GOMP_MAP_ALWAYS_FROM
:
5054 case GOMP_MAP_ALWAYS_TOFROM
:
5055 case GOMP_MAP_RELEASE
:
5056 case GOMP_MAP_DELETE
:
5057 case GOMP_MAP_FORCE_TO
:
5058 case GOMP_MAP_FORCE_FROM
:
5059 case GOMP_MAP_FORCE_TOFROM
:
5060 case GOMP_MAP_FORCE_PRESENT
:
5061 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5066 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5068 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5069 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5070 else if (TREE_CODE (t
) == COMPONENT_REF
)
5071 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5072 else if (REFERENCE_REF_P (t
)
5073 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5075 t
= TREE_OPERAND (t
, 0);
5076 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5079 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5080 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5081 && !cxx_mark_addressable (t
))
5083 OMP_CLAUSE_DECL (c2
) = t
;
5084 t
= build_fold_addr_expr (first
);
5085 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5086 ptrdiff_type_node
, t
);
5087 tree ptr
= OMP_CLAUSE_DECL (c2
);
5088 ptr
= convert_from_reference (ptr
);
5089 if (!POINTER_TYPE_P (TREE_TYPE (ptr
)))
5090 ptr
= build_fold_addr_expr (ptr
);
5091 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5092 ptrdiff_type_node
, t
,
5093 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5094 ptrdiff_type_node
, ptr
));
5095 OMP_CLAUSE_SIZE (c2
) = t
;
5096 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5097 OMP_CLAUSE_CHAIN (c
) = c2
;
5098 ptr
= OMP_CLAUSE_DECL (c2
);
5099 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5100 && TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
5101 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5103 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5105 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5106 OMP_CLAUSE_DECL (c3
) = ptr
;
5107 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5108 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5110 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5111 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5112 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5113 OMP_CLAUSE_CHAIN (c2
) = c3
;
5120 /* Return identifier to look up for omp declare reduction. */
5123 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5125 const char *p
= NULL
;
5126 const char *m
= NULL
;
5127 switch (reduction_code
)
5135 case TRUTH_ANDIF_EXPR
:
5136 case TRUTH_ORIF_EXPR
:
5137 reduction_id
= ovl_op_identifier (false, reduction_code
);
5151 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5152 return error_mark_node
;
5153 p
= IDENTIFIER_POINTER (reduction_id
);
5156 if (type
!= NULL_TREE
)
5157 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5159 const char prefix
[] = "omp declare reduction ";
5160 size_t lenp
= sizeof (prefix
);
5161 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5163 size_t len
= strlen (p
);
5164 size_t lenm
= m
? strlen (m
) + 1 : 0;
5165 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5167 memcpy (name
, prefix
, lenp
- 1);
5168 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5171 name
[lenp
+ len
- 1] = '~';
5172 memcpy (name
+ lenp
+ len
, m
, lenm
);
5174 return get_identifier (name
);
5177 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5178 FUNCTION_DECL or NULL_TREE if not found. */
5181 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5182 vec
<tree
> *ambiguousp
)
5185 tree baselink
= NULL_TREE
;
5186 if (identifier_p (id
))
5189 bool nonint_cst_expression_p
;
5190 const char *error_msg
;
5191 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5192 tree decl
= lookup_name (id
);
5193 if (decl
== NULL_TREE
)
5194 decl
= error_mark_node
;
5195 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5196 &nonint_cst_expression_p
, false, true, false,
5197 false, &error_msg
, loc
);
5198 if (idk
== CP_ID_KIND_UNQUALIFIED
5199 && identifier_p (id
))
5201 vec
<tree
, va_gc
> *args
= NULL
;
5202 vec_safe_push (args
, build_reference_type (type
));
5203 id
= perform_koenig_lookup (id
, args
, tf_none
);
5206 else if (TREE_CODE (id
) == SCOPE_REF
)
5207 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5208 omp_reduction_id (ERROR_MARK
,
5209 TREE_OPERAND (id
, 1),
5214 if (fns
&& is_overloaded_fn (fns
))
5216 for (lkp_iterator
iter (get_fns (fns
)); iter
; ++iter
)
5218 tree fndecl
= *iter
;
5219 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5221 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5222 if (same_type_p (TREE_TYPE (argtype
), type
))
5230 if (id
&& BASELINK_P (fns
))
5239 if (!id
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5241 vec
<tree
> ambiguous
= vNULL
;
5242 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5244 if (ambiguousp
== NULL
)
5245 ambiguousp
= &ambiguous
;
5246 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5248 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5249 baselinkp
? baselinkp
: &baselink
,
5251 if (id
== NULL_TREE
)
5253 if (!ambiguousp
->is_empty ())
5254 ambiguousp
->safe_push (id
);
5255 else if (ret
!= NULL_TREE
)
5257 ambiguousp
->safe_push (ret
);
5258 ambiguousp
->safe_push (id
);
5264 if (ambiguousp
!= &ambiguous
)
5266 if (!ambiguous
.is_empty ())
5268 const char *str
= _("candidates are:");
5271 error_at (loc
, "user defined reduction lookup is ambiguous");
5272 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5274 inform (DECL_SOURCE_LOCATION (udr
), "%s %#qD", str
, udr
);
5276 str
= get_spaces (str
);
5278 ambiguous
.release ();
5279 ret
= error_mark_node
;
5280 baselink
= NULL_TREE
;
5285 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5286 id
, id
, tf_warning_or_error
);
5290 /* Helper function for cp_parser_omp_declare_reduction_exprs
5292 Remove CLEANUP_STMT for data (omp_priv variable).
5293 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5297 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5301 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5302 *tp
= CLEANUP_BODY (*tp
);
5303 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5305 tree decl
= DECL_EXPR_DECL (*tp
);
5306 if (!processing_template_decl
5307 && decl
== (tree
) data
5308 && DECL_INITIAL (decl
)
5309 && DECL_INITIAL (decl
) != error_mark_node
)
5311 tree list
= NULL_TREE
;
5312 append_to_statement_list_force (*tp
, &list
);
5313 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5314 decl
, DECL_INITIAL (decl
));
5315 DECL_INITIAL (decl
) = NULL_TREE
;
5316 append_to_statement_list_force (init_expr
, &list
);
5323 /* Data passed from cp_check_omp_declare_reduction to
5324 cp_check_omp_declare_reduction_r. */
5326 struct cp_check_omp_declare_reduction_data
5333 /* Helper function for cp_check_omp_declare_reduction, called via
5337 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5339 struct cp_check_omp_declare_reduction_data
*udr_data
5340 = (struct cp_check_omp_declare_reduction_data
*) data
;
5342 && !DECL_ARTIFICIAL (*tp
)
5343 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5344 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5346 location_t loc
= udr_data
->loc
;
5347 if (udr_data
->combiner_p
)
5348 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5349 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5352 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5353 "to variable %qD which is not %<omp_priv%> nor "
5361 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5364 cp_check_omp_declare_reduction (tree udr
)
5366 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5367 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
5368 type
= TREE_TYPE (type
);
5370 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5372 if (type
== error_mark_node
)
5374 if (ARITHMETIC_TYPE_P (type
))
5376 static enum tree_code predef_codes
[]
5377 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5378 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5379 for (i
= 0; i
< 8; i
++)
5381 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5382 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5383 const char *n2
= IDENTIFIER_POINTER (id
);
5384 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5385 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5386 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5391 && TREE_CODE (type
) != COMPLEX_EXPR
)
5393 const char prefix_minmax
[] = "omp declare reduction m";
5394 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5395 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5396 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5397 prefix_minmax
, prefix_size
) == 0
5398 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5399 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5400 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5405 error_at (loc
, "predeclared arithmetic type %qT in "
5406 "%<#pragma omp declare reduction%>", type
);
5410 else if (TREE_CODE (type
) == FUNCTION_TYPE
5411 || TREE_CODE (type
) == METHOD_TYPE
5412 || TREE_CODE (type
) == ARRAY_TYPE
)
5414 error_at (loc
, "function or array type %qT in "
5415 "%<#pragma omp declare reduction%>", type
);
5418 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5420 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5424 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5426 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5427 "%<#pragma omp declare reduction%>", type
);
5431 tree body
= DECL_SAVED_TREE (udr
);
5432 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5435 tree_stmt_iterator tsi
;
5436 struct cp_check_omp_declare_reduction_data data
;
5437 memset (data
.stmts
, 0, sizeof data
.stmts
);
5438 for (i
= 0, tsi
= tsi_start (body
);
5439 i
< 7 && !tsi_end_p (tsi
);
5440 i
++, tsi_next (&tsi
))
5441 data
.stmts
[i
] = tsi_stmt (tsi
);
5443 gcc_assert (tsi_end_p (tsi
));
5446 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5447 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5448 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5450 data
.combiner_p
= true;
5451 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5453 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5457 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5458 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5459 data
.combiner_p
= false;
5460 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5462 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5463 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5464 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5466 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5470 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5471 an inline call. But, remap
5472 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5473 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5476 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5477 tree decl
, tree placeholder
)
5480 hash_map
<tree
, tree
> decl_map
;
5482 decl_map
.put (omp_decl1
, placeholder
);
5483 decl_map
.put (omp_decl2
, decl
);
5484 memset (&id
, 0, sizeof (id
));
5485 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5486 id
.dst_fn
= current_function_decl
;
5487 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5488 id
.decl_map
= &decl_map
;
5490 id
.copy_decl
= copy_decl_no_change
;
5491 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5492 id
.transform_new_cfg
= true;
5493 id
.transform_return_to_modify
= false;
5494 id
.transform_lang_insert_block
= NULL
;
5496 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5500 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5501 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5504 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5506 if (*tp
== (tree
) data
)
5511 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5512 Return true if there is some error and the clause should be removed. */
5515 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5517 tree t
= OMP_CLAUSE_DECL (c
);
5518 bool predefined
= false;
5519 if (TREE_CODE (t
) == TREE_LIST
)
5521 gcc_assert (processing_template_decl
);
5524 tree type
= TREE_TYPE (t
);
5525 if (TREE_CODE (t
) == MEM_REF
)
5526 type
= TREE_TYPE (type
);
5527 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5528 type
= TREE_TYPE (type
);
5529 if (TREE_CODE (type
) == ARRAY_TYPE
)
5532 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5533 while (TREE_CODE (type
) == ARRAY_TYPE
)
5534 type
= TREE_TYPE (type
);
5535 if (!processing_template_decl
)
5537 t
= require_complete_type (t
);
5538 if (t
== error_mark_node
)
5540 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5541 TYPE_SIZE_UNIT (type
));
5542 if (integer_zerop (size
))
5544 error ("%qE in %<reduction%> clause is a zero size array",
5545 omp_clause_printable_decl (t
));
5548 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5549 tree index_type
= build_index_type (size
);
5550 tree atype
= build_array_type (type
, index_type
);
5551 tree ptype
= build_pointer_type (type
);
5552 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5553 t
= build_fold_addr_expr (t
);
5554 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5555 OMP_CLAUSE_DECL (c
) = t
;
5558 if (type
== error_mark_node
)
5560 else if (ARITHMETIC_TYPE_P (type
))
5561 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5570 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5577 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5581 case TRUTH_ANDIF_EXPR
:
5582 case TRUTH_ORIF_EXPR
:
5583 if (FLOAT_TYPE_P (type
))
5590 else if (TYPE_READONLY (type
))
5592 error ("%qE has const type for %<reduction%>",
5593 omp_clause_printable_decl (t
));
5596 else if (!processing_template_decl
)
5598 t
= require_complete_type (t
);
5599 if (t
== error_mark_node
)
5601 OMP_CLAUSE_DECL (c
) = t
;
5606 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5609 else if (processing_template_decl
)
5611 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) == error_mark_node
)
5616 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5618 type
= TYPE_MAIN_VARIANT (type
);
5619 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5620 if (id
== NULL_TREE
)
5621 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5622 NULL_TREE
, NULL_TREE
);
5623 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5626 if (id
== error_mark_node
)
5629 tree body
= DECL_SAVED_TREE (id
);
5632 if (TREE_CODE (body
) == STATEMENT_LIST
)
5634 tree_stmt_iterator tsi
;
5635 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5638 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5639 atype
= TREE_TYPE (atype
);
5640 bool need_static_cast
= !same_type_p (type
, atype
);
5641 memset (stmts
, 0, sizeof stmts
);
5642 for (i
= 0, tsi
= tsi_start (body
);
5643 i
< 7 && !tsi_end_p (tsi
);
5644 i
++, tsi_next (&tsi
))
5645 stmts
[i
] = tsi_stmt (tsi
);
5646 gcc_assert (tsi_end_p (tsi
));
5650 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5651 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5652 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5653 DECL_ARTIFICIAL (placeholder
) = 1;
5654 DECL_IGNORED_P (placeholder
) = 1;
5655 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5656 if (TREE_CODE (t
) == MEM_REF
)
5658 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5660 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5661 DECL_IGNORED_P (decl_placeholder
) = 1;
5662 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5664 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5665 cxx_mark_addressable (placeholder
);
5666 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5667 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
)))
5669 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5670 : OMP_CLAUSE_DECL (c
));
5671 tree omp_out
= placeholder
;
5672 tree omp_in
= decl_placeholder
? decl_placeholder
5673 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5674 if (need_static_cast
)
5676 tree rtype
= build_reference_type (atype
);
5677 omp_out
= build_static_cast (rtype
, omp_out
,
5678 tf_warning_or_error
);
5679 omp_in
= build_static_cast (rtype
, omp_in
,
5680 tf_warning_or_error
);
5681 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5683 omp_out
= convert_from_reference (omp_out
);
5684 omp_in
= convert_from_reference (omp_in
);
5686 OMP_CLAUSE_REDUCTION_MERGE (c
)
5687 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5688 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5692 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5693 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5694 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5695 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5696 : OMP_CLAUSE_DECL (c
));
5697 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5698 cxx_mark_addressable (placeholder
);
5699 tree omp_priv
= decl_placeholder
? decl_placeholder
5700 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5701 tree omp_orig
= placeholder
;
5702 if (need_static_cast
)
5706 error_at (OMP_CLAUSE_LOCATION (c
),
5707 "user defined reduction with constructor "
5708 "initializer for base class %qT", atype
);
5711 tree rtype
= build_reference_type (atype
);
5712 omp_priv
= build_static_cast (rtype
, omp_priv
,
5713 tf_warning_or_error
);
5714 omp_orig
= build_static_cast (rtype
, omp_orig
,
5715 tf_warning_or_error
);
5716 if (omp_priv
== error_mark_node
5717 || omp_orig
== error_mark_node
)
5719 omp_priv
= convert_from_reference (omp_priv
);
5720 omp_orig
= convert_from_reference (omp_orig
);
5723 *need_default_ctor
= true;
5724 OMP_CLAUSE_REDUCTION_INIT (c
)
5725 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5726 DECL_EXPR_DECL (stmts
[3]),
5727 omp_priv
, omp_orig
);
5728 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5729 find_omp_placeholder_r
, placeholder
, NULL
))
5730 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5734 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5735 *need_default_ctor
= true;
5739 tree v
= decl_placeholder
? decl_placeholder
5740 : convert_from_reference (t
);
5741 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5742 init
= build_constructor (TREE_TYPE (v
), NULL
);
5744 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5745 OMP_CLAUSE_REDUCTION_INIT (c
)
5746 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5751 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5755 error ("user defined reduction not found for %qE",
5756 omp_clause_printable_decl (t
));
5759 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5760 gcc_assert (TYPE_SIZE_UNIT (type
)
5761 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5765 /* Called from finish_struct_1. linear(this) or linear(this:step)
5766 clauses might not be finalized yet because the class has been incomplete
5767 when parsing #pragma omp declare simd methods. Fix those up now. */
5770 finish_omp_declare_simd_methods (tree t
)
5772 if (processing_template_decl
)
5775 for (tree x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
5777 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5779 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5780 if (!ods
|| !TREE_VALUE (ods
))
5782 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5783 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5784 && integer_zerop (OMP_CLAUSE_DECL (c
))
5785 && OMP_CLAUSE_LINEAR_STEP (c
)
5786 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
)))
5789 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5790 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5791 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5792 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5793 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5798 /* Adjust sink depend clause to take into account pointer offsets.
5800 Return TRUE if there was a problem processing the offset, and the
5801 whole clause should be removed. */
5804 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5806 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5807 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5809 /* Make sure we don't adjust things twice for templates. */
5810 if (processing_template_decl
)
5813 for (; t
; t
= TREE_CHAIN (t
))
5815 tree decl
= TREE_VALUE (t
);
5816 if (TREE_CODE (TREE_TYPE (decl
)) == POINTER_TYPE
)
5818 tree offset
= TREE_PURPOSE (t
);
5819 bool neg
= wi::neg_p (wi::to_wide (offset
));
5820 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5821 decl
= mark_rvalue_use (decl
);
5822 decl
= convert_from_reference (decl
);
5823 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5824 neg
? MINUS_EXPR
: PLUS_EXPR
,
5826 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5827 MINUS_EXPR
, sizetype
,
5828 fold_convert (sizetype
, t2
),
5829 fold_convert (sizetype
, decl
));
5830 if (t2
== error_mark_node
)
5832 TREE_PURPOSE (t
) = t2
;
5838 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5839 Remove any elements from the list that are invalid. */
5842 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
5844 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5845 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
5847 tree safelen
= NULL_TREE
;
5848 bool branch_seen
= false;
5849 bool copyprivate_seen
= false;
5850 bool ordered_seen
= false;
5851 bool oacc_async
= false;
5853 bitmap_obstack_initialize (NULL
);
5854 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5855 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5856 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5857 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5858 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
5859 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
5860 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
5862 if (ort
& C_ORT_ACC
)
5863 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
5864 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
5870 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5872 bool remove
= false;
5873 bool field_ok
= false;
5875 switch (OMP_CLAUSE_CODE (c
))
5877 case OMP_CLAUSE_SHARED
:
5878 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5879 goto check_dup_generic
;
5880 case OMP_CLAUSE_PRIVATE
:
5881 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5882 goto check_dup_generic
;
5883 case OMP_CLAUSE_REDUCTION
:
5884 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5885 t
= OMP_CLAUSE_DECL (c
);
5886 if (TREE_CODE (t
) == TREE_LIST
)
5888 if (handle_omp_array_sections (c
, ort
))
5893 if (TREE_CODE (t
) == TREE_LIST
)
5895 while (TREE_CODE (t
) == TREE_LIST
)
5900 gcc_assert (TREE_CODE (t
) == MEM_REF
);
5901 t
= TREE_OPERAND (t
, 0);
5902 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
5903 t
= TREE_OPERAND (t
, 0);
5904 if (TREE_CODE (t
) == ADDR_EXPR
5905 || INDIRECT_REF_P (t
))
5906 t
= TREE_OPERAND (t
, 0);
5908 tree n
= omp_clause_decl_field (t
);
5911 goto check_dup_generic_t
;
5914 cxx_mark_addressable (t
);
5915 goto check_dup_generic
;
5916 case OMP_CLAUSE_COPYPRIVATE
:
5917 copyprivate_seen
= true;
5918 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5919 goto check_dup_generic
;
5920 case OMP_CLAUSE_COPYIN
:
5921 goto check_dup_generic
;
5922 case OMP_CLAUSE_LINEAR
:
5923 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5924 t
= OMP_CLAUSE_DECL (c
);
5925 if (ort
!= C_ORT_OMP_DECLARE_SIMD
5926 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
5928 error_at (OMP_CLAUSE_LOCATION (c
),
5929 "modifier should not be specified in %<linear%> "
5930 "clause on %<simd%> or %<for%> constructs");
5931 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
5933 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5934 && !type_dependent_expression_p (t
))
5936 tree type
= TREE_TYPE (t
);
5937 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5938 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
5939 && TREE_CODE (type
) != REFERENCE_TYPE
)
5941 error ("linear clause with %qs modifier applied to "
5942 "non-reference variable with %qT type",
5943 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5944 ? "ref" : "uval", TREE_TYPE (t
));
5948 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5949 type
= TREE_TYPE (type
);
5950 if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
5952 if (!INTEGRAL_TYPE_P (type
)
5953 && TREE_CODE (type
) != POINTER_TYPE
)
5955 error ("linear clause applied to non-integral non-pointer"
5956 " variable with %qT type", TREE_TYPE (t
));
5962 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5964 t
= integer_one_node
;
5965 if (t
== error_mark_node
)
5970 else if (!type_dependent_expression_p (t
)
5971 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5972 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5973 || TREE_CODE (t
) != PARM_DECL
5974 || TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
5975 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
5977 error ("linear step expression must be integral");
5983 t
= mark_rvalue_use (t
);
5984 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
5986 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
5987 goto check_dup_generic
;
5989 if (!processing_template_decl
5990 && (VAR_P (OMP_CLAUSE_DECL (c
))
5991 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
5993 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
5995 t
= maybe_constant_value (t
);
5996 if (TREE_CODE (t
) != INTEGER_CST
)
5998 error_at (OMP_CLAUSE_LOCATION (c
),
5999 "%<linear%> clause step %qE is neither "
6000 "constant nor a parameter", t
);
6005 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6006 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
6007 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6008 type
= TREE_TYPE (type
);
6009 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
6011 type
= build_pointer_type (type
);
6012 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
6013 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6015 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6016 MINUS_EXPR
, sizetype
,
6017 fold_convert (sizetype
, t
),
6018 fold_convert (sizetype
, d
));
6019 if (t
== error_mark_node
)
6025 else if (TREE_CODE (type
) == POINTER_TYPE
6026 /* Can't multiply the step yet if *this
6027 is still incomplete type. */
6028 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6029 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
6030 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
6031 || DECL_NAME (OMP_CLAUSE_DECL (c
))
6033 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
6035 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
6036 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
6038 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
6039 MINUS_EXPR
, sizetype
,
6040 fold_convert (sizetype
, t
),
6041 fold_convert (sizetype
, d
));
6042 if (t
== error_mark_node
)
6049 t
= fold_convert (type
, t
);
6051 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
6053 goto check_dup_generic
;
6055 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6058 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
6059 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6062 t
= OMP_CLAUSE_DECL (c
);
6063 check_dup_generic_t
:
6064 if (t
== current_class_ptr
6065 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6066 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6067 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6069 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6074 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6075 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6077 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6080 error ("%qD is not a variable in clause %qs", t
,
6081 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6083 error ("%qE is not a variable in clause %qs", t
,
6084 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6087 else if (ort
== C_ORT_ACC
6088 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6090 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6092 error ("%qD appears more than once in reduction clauses", t
);
6096 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6098 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6099 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6100 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6102 error ("%qD appears more than once in data clauses", t
);
6105 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6106 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6108 if (ort
== C_ORT_ACC
)
6109 error ("%qD appears more than once in data clauses", t
);
6111 error ("%qD appears both in data and map clauses", t
);
6115 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6120 && TREE_CODE (t
) == FIELD_DECL
6121 && t
== OMP_CLAUSE_DECL (c
)
6122 && ort
!= C_ORT_ACC
)
6125 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6126 == OMP_CLAUSE_SHARED
));
6127 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6132 case OMP_CLAUSE_FIRSTPRIVATE
:
6133 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6135 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6137 t
= OMP_CLAUSE_DECL (c
);
6138 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6140 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6145 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6146 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6147 || TREE_CODE (t
) != FIELD_DECL
))
6149 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6152 error ("%qD is not a variable in clause %<firstprivate%>", t
);
6154 error ("%qE is not a variable in clause %<firstprivate%>", t
);
6157 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6158 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6160 error ("%qD appears more than once in data clauses", t
);
6163 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6165 if (ort
== C_ORT_ACC
)
6166 error ("%qD appears more than once in data clauses", t
);
6168 error ("%qD appears both in data and map clauses", t
);
6172 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6173 goto handle_field_decl
;
6175 case OMP_CLAUSE_LASTPRIVATE
:
6176 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6178 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6180 t
= OMP_CLAUSE_DECL (c
);
6181 if (t
== current_class_ptr
)
6183 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6188 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6189 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6190 || TREE_CODE (t
) != FIELD_DECL
))
6192 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6195 error ("%qD is not a variable in clause %<lastprivate%>", t
);
6197 error ("%qE is not a variable in clause %<lastprivate%>", t
);
6200 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6201 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6203 error ("%qD appears more than once in data clauses", t
);
6207 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6208 goto handle_field_decl
;
6211 t
= OMP_CLAUSE_IF_EXPR (c
);
6212 t
= maybe_convert_cond (t
);
6213 if (t
== error_mark_node
)
6215 else if (!processing_template_decl
)
6216 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6217 OMP_CLAUSE_IF_EXPR (c
) = t
;
6220 case OMP_CLAUSE_FINAL
:
6221 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6222 t
= maybe_convert_cond (t
);
6223 if (t
== error_mark_node
)
6225 else if (!processing_template_decl
)
6226 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6227 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6230 case OMP_CLAUSE_GANG
:
6231 /* Operand 1 is the gang static: argument. */
6232 t
= OMP_CLAUSE_OPERAND (c
, 1);
6235 if (t
== error_mark_node
)
6237 else if (!type_dependent_expression_p (t
)
6238 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6240 error ("%<gang%> static expression must be integral");
6245 t
= mark_rvalue_use (t
);
6246 if (!processing_template_decl
)
6248 t
= maybe_constant_value (t
);
6249 if (TREE_CODE (t
) == INTEGER_CST
6250 && tree_int_cst_sgn (t
) != 1
6251 && t
!= integer_minus_one_node
)
6253 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6254 "%<gang%> static value must be "
6256 t
= integer_one_node
;
6258 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6261 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6263 /* Check operand 0, the num argument. */
6266 case OMP_CLAUSE_WORKER
:
6267 case OMP_CLAUSE_VECTOR
:
6268 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6272 case OMP_CLAUSE_NUM_TASKS
:
6273 case OMP_CLAUSE_NUM_TEAMS
:
6274 case OMP_CLAUSE_NUM_THREADS
:
6275 case OMP_CLAUSE_NUM_GANGS
:
6276 case OMP_CLAUSE_NUM_WORKERS
:
6277 case OMP_CLAUSE_VECTOR_LENGTH
:
6278 t
= OMP_CLAUSE_OPERAND (c
, 0);
6279 if (t
== error_mark_node
)
6281 else if (!type_dependent_expression_p (t
)
6282 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6284 switch (OMP_CLAUSE_CODE (c
))
6286 case OMP_CLAUSE_GANG
:
6287 error_at (OMP_CLAUSE_LOCATION (c
),
6288 "%<gang%> num expression must be integral"); break;
6289 case OMP_CLAUSE_VECTOR
:
6290 error_at (OMP_CLAUSE_LOCATION (c
),
6291 "%<vector%> length expression must be integral");
6293 case OMP_CLAUSE_WORKER
:
6294 error_at (OMP_CLAUSE_LOCATION (c
),
6295 "%<worker%> num expression must be integral");
6298 error_at (OMP_CLAUSE_LOCATION (c
),
6299 "%qs expression must be integral",
6300 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6306 t
= mark_rvalue_use (t
);
6307 if (!processing_template_decl
)
6309 t
= maybe_constant_value (t
);
6310 if (TREE_CODE (t
) == INTEGER_CST
6311 && tree_int_cst_sgn (t
) != 1)
6313 switch (OMP_CLAUSE_CODE (c
))
6315 case OMP_CLAUSE_GANG
:
6316 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6317 "%<gang%> num value must be positive");
6319 case OMP_CLAUSE_VECTOR
:
6320 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6321 "%<vector%> length value must be "
6324 case OMP_CLAUSE_WORKER
:
6325 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6326 "%<worker%> num value must be "
6330 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6331 "%qs value must be positive",
6332 omp_clause_code_name
6333 [OMP_CLAUSE_CODE (c
)]);
6335 t
= integer_one_node
;
6337 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6339 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6343 case OMP_CLAUSE_SCHEDULE
:
6344 if (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
)
6346 const char *p
= NULL
;
6347 switch (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_MASK
)
6349 case OMP_CLAUSE_SCHEDULE_STATIC
: p
= "static"; break;
6350 case OMP_CLAUSE_SCHEDULE_DYNAMIC
: break;
6351 case OMP_CLAUSE_SCHEDULE_GUIDED
: break;
6352 case OMP_CLAUSE_SCHEDULE_AUTO
: p
= "auto"; break;
6353 case OMP_CLAUSE_SCHEDULE_RUNTIME
: p
= "runtime"; break;
6354 default: gcc_unreachable ();
6358 error_at (OMP_CLAUSE_LOCATION (c
),
6359 "%<nonmonotonic%> modifier specified for %qs "
6360 "schedule kind", p
);
6361 OMP_CLAUSE_SCHEDULE_KIND (c
)
6362 = (enum omp_clause_schedule_kind
)
6363 (OMP_CLAUSE_SCHEDULE_KIND (c
)
6364 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
6368 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6371 else if (t
== error_mark_node
)
6373 else if (!type_dependent_expression_p (t
)
6374 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6376 error ("schedule chunk size expression must be integral");
6381 t
= mark_rvalue_use (t
);
6382 if (!processing_template_decl
)
6384 t
= maybe_constant_value (t
);
6385 if (TREE_CODE (t
) == INTEGER_CST
6386 && tree_int_cst_sgn (t
) != 1)
6388 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6389 "chunk size value must be positive");
6390 t
= integer_one_node
;
6392 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6394 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6398 case OMP_CLAUSE_SIMDLEN
:
6399 case OMP_CLAUSE_SAFELEN
:
6400 t
= OMP_CLAUSE_OPERAND (c
, 0);
6401 if (t
== error_mark_node
)
6403 else if (!type_dependent_expression_p (t
)
6404 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6406 error ("%qs length expression must be integral",
6407 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6412 t
= mark_rvalue_use (t
);
6413 if (!processing_template_decl
)
6415 t
= maybe_constant_value (t
);
6416 if (TREE_CODE (t
) != INTEGER_CST
6417 || tree_int_cst_sgn (t
) != 1)
6419 error ("%qs length expression must be positive constant"
6420 " integer expression",
6421 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6425 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6426 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6431 case OMP_CLAUSE_ASYNC
:
6432 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6433 if (t
== error_mark_node
)
6435 else if (!type_dependent_expression_p (t
)
6436 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6438 error ("%<async%> expression must be integral");
6443 t
= mark_rvalue_use (t
);
6444 if (!processing_template_decl
)
6445 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6446 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6450 case OMP_CLAUSE_WAIT
:
6451 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6452 if (t
== error_mark_node
)
6454 else if (!processing_template_decl
)
6455 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6456 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6459 case OMP_CLAUSE_THREAD_LIMIT
:
6460 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6461 if (t
== error_mark_node
)
6463 else if (!type_dependent_expression_p (t
)
6464 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6466 error ("%<thread_limit%> expression must be integral");
6471 t
= mark_rvalue_use (t
);
6472 if (!processing_template_decl
)
6474 t
= maybe_constant_value (t
);
6475 if (TREE_CODE (t
) == INTEGER_CST
6476 && tree_int_cst_sgn (t
) != 1)
6478 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6479 "%<thread_limit%> value must be positive");
6480 t
= integer_one_node
;
6482 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6484 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6488 case OMP_CLAUSE_DEVICE
:
6489 t
= OMP_CLAUSE_DEVICE_ID (c
);
6490 if (t
== error_mark_node
)
6492 else if (!type_dependent_expression_p (t
)
6493 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6495 error ("%<device%> id must be integral");
6500 t
= mark_rvalue_use (t
);
6501 if (!processing_template_decl
)
6502 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6503 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6507 case OMP_CLAUSE_DIST_SCHEDULE
:
6508 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6511 else if (t
== error_mark_node
)
6513 else if (!type_dependent_expression_p (t
)
6514 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6516 error ("%<dist_schedule%> chunk size expression must be "
6522 t
= mark_rvalue_use (t
);
6523 if (!processing_template_decl
)
6524 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6525 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6529 case OMP_CLAUSE_ALIGNED
:
6530 t
= OMP_CLAUSE_DECL (c
);
6531 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6533 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6538 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6540 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6543 error ("%qD is not a variable in %<aligned%> clause", t
);
6545 error ("%qE is not a variable in %<aligned%> clause", t
);
6548 else if (!type_dependent_expression_p (t
)
6549 && TREE_CODE (TREE_TYPE (t
)) != POINTER_TYPE
6550 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6551 && (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6552 || (!POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6553 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6556 error_at (OMP_CLAUSE_LOCATION (c
),
6557 "%qE in %<aligned%> clause is neither a pointer nor "
6558 "an array nor a reference to pointer or array", t
);
6561 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6563 error ("%qD appears more than once in %<aligned%> clauses", t
);
6567 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6568 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6569 if (t
== error_mark_node
)
6571 else if (t
== NULL_TREE
)
6573 else if (!type_dependent_expression_p (t
)
6574 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6576 error ("%<aligned%> clause alignment expression must "
6582 t
= mark_rvalue_use (t
);
6583 if (!processing_template_decl
)
6585 t
= maybe_constant_value (t
);
6586 if (TREE_CODE (t
) != INTEGER_CST
6587 || tree_int_cst_sgn (t
) != 1)
6589 error ("%<aligned%> clause alignment expression must be "
6590 "positive constant integer expression");
6594 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6598 case OMP_CLAUSE_DEPEND
:
6599 t
= OMP_CLAUSE_DECL (c
);
6602 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6603 == OMP_CLAUSE_DEPEND_SOURCE
);
6606 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6608 if (cp_finish_omp_clause_depend_sink (c
))
6612 if (TREE_CODE (t
) == TREE_LIST
)
6614 if (handle_omp_array_sections (c
, ort
))
6618 if (t
== error_mark_node
)
6620 else if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6622 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6625 error ("%qD is not a variable in %<depend%> clause", t
);
6627 error ("%qE is not a variable in %<depend%> clause", t
);
6630 else if (t
== current_class_ptr
)
6632 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6636 else if (!processing_template_decl
6637 && !cxx_mark_addressable (t
))
6641 case OMP_CLAUSE_MAP
:
6643 case OMP_CLAUSE_FROM
:
6644 case OMP_CLAUSE__CACHE_
:
6645 t
= OMP_CLAUSE_DECL (c
);
6646 if (TREE_CODE (t
) == TREE_LIST
)
6648 if (handle_omp_array_sections (c
, ort
))
6652 t
= OMP_CLAUSE_DECL (c
);
6653 if (TREE_CODE (t
) != TREE_LIST
6654 && !type_dependent_expression_p (t
)
6655 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6657 error_at (OMP_CLAUSE_LOCATION (c
),
6658 "array section does not have mappable type "
6660 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6663 while (TREE_CODE (t
) == ARRAY_REF
)
6664 t
= TREE_OPERAND (t
, 0);
6665 if (TREE_CODE (t
) == COMPONENT_REF
6666 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
6668 while (TREE_CODE (t
) == COMPONENT_REF
)
6669 t
= TREE_OPERAND (t
, 0);
6670 if (REFERENCE_REF_P (t
))
6671 t
= TREE_OPERAND (t
, 0);
6672 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6674 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6676 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6677 error ("%qD appears more than once in motion"
6679 else if (ort
== C_ORT_ACC
)
6680 error ("%qD appears more than once in data"
6683 error ("%qD appears more than once in map"
6689 bitmap_set_bit (&map_head
, DECL_UID (t
));
6690 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6696 if (t
== error_mark_node
)
6701 if (REFERENCE_REF_P (t
)
6702 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
6704 t
= TREE_OPERAND (t
, 0);
6705 OMP_CLAUSE_DECL (c
) = t
;
6707 if (TREE_CODE (t
) == COMPONENT_REF
6708 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6709 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
6711 if (type_dependent_expression_p (t
))
6713 if (TREE_CODE (TREE_OPERAND (t
, 1)) == FIELD_DECL
6714 && DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6716 error_at (OMP_CLAUSE_LOCATION (c
),
6717 "bit-field %qE in %qs clause",
6718 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6721 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6723 error_at (OMP_CLAUSE_LOCATION (c
),
6724 "%qE does not have a mappable type in %qs clause",
6725 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6728 while (TREE_CODE (t
) == COMPONENT_REF
)
6730 if (TREE_TYPE (TREE_OPERAND (t
, 0))
6731 && (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
6734 error_at (OMP_CLAUSE_LOCATION (c
),
6735 "%qE is a member of a union", t
);
6739 t
= TREE_OPERAND (t
, 0);
6743 if (REFERENCE_REF_P (t
))
6744 t
= TREE_OPERAND (t
, 0);
6745 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6747 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6748 goto handle_map_references
;
6751 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6753 if (processing_template_decl
&& TREE_CODE (t
) != OVERLOAD
)
6755 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6756 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6757 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
6760 error ("%qD is not a variable in %qs clause", t
,
6761 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6763 error ("%qE is not a variable in %qs clause", t
,
6764 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6767 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
6769 error ("%qD is threadprivate variable in %qs clause", t
,
6770 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6773 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6775 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6780 else if (!processing_template_decl
6781 && TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6782 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
6783 || (OMP_CLAUSE_MAP_KIND (c
)
6784 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
6785 && !cxx_mark_addressable (t
))
6787 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6788 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6789 || (OMP_CLAUSE_MAP_KIND (c
)
6790 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
6791 && t
== OMP_CLAUSE_DECL (c
)
6792 && !type_dependent_expression_p (t
)
6793 && !cp_omp_mappable_type ((TREE_CODE (TREE_TYPE (t
))
6795 ? TREE_TYPE (TREE_TYPE (t
))
6798 error_at (OMP_CLAUSE_LOCATION (c
),
6799 "%qD does not have a mappable type in %qs clause", t
,
6800 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6803 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6804 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
6805 && !type_dependent_expression_p (t
)
6806 && !POINTER_TYPE_P (TREE_TYPE (t
)))
6808 error ("%qD is not a pointer variable", t
);
6811 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6812 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
6814 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6815 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6817 error ("%qD appears more than once in data clauses", t
);
6820 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6822 if (ort
== C_ORT_ACC
)
6823 error ("%qD appears more than once in data clauses", t
);
6825 error ("%qD appears both in data and map clauses", t
);
6829 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6831 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6833 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6834 error ("%qD appears more than once in motion clauses", t
);
6835 if (ort
== C_ORT_ACC
)
6836 error ("%qD appears more than once in data clauses", t
);
6838 error ("%qD appears more than once in map clauses", t
);
6841 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6842 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6844 if (ort
== C_ORT_ACC
)
6845 error ("%qD appears more than once in data clauses", t
);
6847 error ("%qD appears both in data and map clauses", t
);
6852 bitmap_set_bit (&map_head
, DECL_UID (t
));
6853 if (t
!= OMP_CLAUSE_DECL (c
)
6854 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
6855 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6857 handle_map_references
:
6859 && !processing_template_decl
6860 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6861 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
))) == REFERENCE_TYPE
)
6863 t
= OMP_CLAUSE_DECL (c
);
6864 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6866 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6867 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6869 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6871 else if (OMP_CLAUSE_MAP_KIND (c
)
6872 != GOMP_MAP_FIRSTPRIVATE_POINTER
6873 && (OMP_CLAUSE_MAP_KIND (c
)
6874 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
6875 && (OMP_CLAUSE_MAP_KIND (c
)
6876 != GOMP_MAP_ALWAYS_POINTER
))
6878 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
6880 if (TREE_CODE (t
) == COMPONENT_REF
)
6881 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
6883 OMP_CLAUSE_SET_MAP_KIND (c2
,
6884 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
6885 OMP_CLAUSE_DECL (c2
) = t
;
6886 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
6887 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
6888 OMP_CLAUSE_CHAIN (c
) = c2
;
6889 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6890 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6892 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6898 case OMP_CLAUSE_TO_DECLARE
:
6899 case OMP_CLAUSE_LINK
:
6900 t
= OMP_CLAUSE_DECL (c
);
6901 if (TREE_CODE (t
) == FUNCTION_DECL
6902 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6904 else if (!VAR_P (t
))
6906 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6908 if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
6909 error_at (OMP_CLAUSE_LOCATION (c
),
6910 "template %qE in clause %qs", t
,
6911 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6912 else if (really_overloaded_fn (t
))
6913 error_at (OMP_CLAUSE_LOCATION (c
),
6914 "overloaded function name %qE in clause %qs", t
,
6915 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6917 error_at (OMP_CLAUSE_LOCATION (c
),
6918 "%qE is neither a variable nor a function name "
6920 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6923 error_at (OMP_CLAUSE_LOCATION (c
),
6924 "%qE is not a variable in clause %qs", t
,
6925 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6928 else if (DECL_THREAD_LOCAL_P (t
))
6930 error_at (OMP_CLAUSE_LOCATION (c
),
6931 "%qD is threadprivate variable in %qs clause", t
,
6932 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6935 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6937 error_at (OMP_CLAUSE_LOCATION (c
),
6938 "%qD does not have a mappable type in %qs clause", t
,
6939 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6944 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
6946 error_at (OMP_CLAUSE_LOCATION (c
),
6947 "%qE appears more than once on the same "
6948 "%<declare target%> directive", t
);
6952 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6955 case OMP_CLAUSE_UNIFORM
:
6956 t
= OMP_CLAUSE_DECL (c
);
6957 if (TREE_CODE (t
) != PARM_DECL
)
6959 if (processing_template_decl
)
6962 error ("%qD is not an argument in %<uniform%> clause", t
);
6964 error ("%qE is not an argument in %<uniform%> clause", t
);
6968 /* map_head bitmap is used as uniform_head if declare_simd. */
6969 bitmap_set_bit (&map_head
, DECL_UID (t
));
6970 goto check_dup_generic
;
6972 case OMP_CLAUSE_GRAINSIZE
:
6973 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
6974 if (t
== error_mark_node
)
6976 else if (!type_dependent_expression_p (t
)
6977 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6979 error ("%<grainsize%> expression must be integral");
6984 t
= mark_rvalue_use (t
);
6985 if (!processing_template_decl
)
6987 t
= maybe_constant_value (t
);
6988 if (TREE_CODE (t
) == INTEGER_CST
6989 && tree_int_cst_sgn (t
) != 1)
6991 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6992 "%<grainsize%> value must be positive");
6993 t
= integer_one_node
;
6995 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6997 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
7001 case OMP_CLAUSE_PRIORITY
:
7002 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
7003 if (t
== error_mark_node
)
7005 else if (!type_dependent_expression_p (t
)
7006 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7008 error ("%<priority%> expression must be integral");
7013 t
= mark_rvalue_use (t
);
7014 if (!processing_template_decl
)
7016 t
= maybe_constant_value (t
);
7017 if (TREE_CODE (t
) == INTEGER_CST
7018 && tree_int_cst_sgn (t
) == -1)
7020 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7021 "%<priority%> value must be non-negative");
7022 t
= integer_one_node
;
7024 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7026 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
7030 case OMP_CLAUSE_HINT
:
7031 t
= OMP_CLAUSE_HINT_EXPR (c
);
7032 if (t
== error_mark_node
)
7034 else if (!type_dependent_expression_p (t
)
7035 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7037 error ("%<num_tasks%> expression must be integral");
7042 t
= mark_rvalue_use (t
);
7043 if (!processing_template_decl
)
7045 t
= maybe_constant_value (t
);
7046 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7048 OMP_CLAUSE_HINT_EXPR (c
) = t
;
7052 case OMP_CLAUSE_IS_DEVICE_PTR
:
7053 case OMP_CLAUSE_USE_DEVICE_PTR
:
7054 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7055 t
= OMP_CLAUSE_DECL (c
);
7056 if (!type_dependent_expression_p (t
))
7058 tree type
= TREE_TYPE (t
);
7059 if (TREE_CODE (type
) != POINTER_TYPE
7060 && TREE_CODE (type
) != ARRAY_TYPE
7061 && (TREE_CODE (type
) != REFERENCE_TYPE
7062 || (TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
7063 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
7065 error_at (OMP_CLAUSE_LOCATION (c
),
7066 "%qs variable is neither a pointer, nor an array "
7067 "nor reference to pointer or array",
7068 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7072 goto check_dup_generic
;
7074 case OMP_CLAUSE_NOWAIT
:
7075 case OMP_CLAUSE_DEFAULT
:
7076 case OMP_CLAUSE_UNTIED
:
7077 case OMP_CLAUSE_COLLAPSE
:
7078 case OMP_CLAUSE_MERGEABLE
:
7079 case OMP_CLAUSE_PARALLEL
:
7080 case OMP_CLAUSE_FOR
:
7081 case OMP_CLAUSE_SECTIONS
:
7082 case OMP_CLAUSE_TASKGROUP
:
7083 case OMP_CLAUSE_PROC_BIND
:
7084 case OMP_CLAUSE_NOGROUP
:
7085 case OMP_CLAUSE_THREADS
:
7086 case OMP_CLAUSE_SIMD
:
7087 case OMP_CLAUSE_DEFAULTMAP
:
7088 case OMP_CLAUSE_AUTO
:
7089 case OMP_CLAUSE_INDEPENDENT
:
7090 case OMP_CLAUSE_SEQ
:
7093 case OMP_CLAUSE_TILE
:
7094 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7095 list
= TREE_CHAIN (list
))
7097 t
= TREE_VALUE (list
);
7099 if (t
== error_mark_node
)
7101 else if (!type_dependent_expression_p (t
)
7102 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7104 error_at (OMP_CLAUSE_LOCATION (c
),
7105 "%<tile%> argument needs integral type");
7110 t
= mark_rvalue_use (t
);
7111 if (!processing_template_decl
)
7113 /* Zero is used to indicate '*', we permit you
7114 to get there via an ICE of value zero. */
7115 t
= maybe_constant_value (t
);
7116 if (!tree_fits_shwi_p (t
)
7117 || tree_to_shwi (t
) < 0)
7119 error_at (OMP_CLAUSE_LOCATION (c
),
7120 "%<tile%> argument needs positive "
7121 "integral constant");
7124 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7128 /* Update list item. */
7129 TREE_VALUE (list
) = t
;
7133 case OMP_CLAUSE_ORDERED
:
7134 ordered_seen
= true;
7137 case OMP_CLAUSE_INBRANCH
:
7138 case OMP_CLAUSE_NOTINBRANCH
:
7141 error ("%<inbranch%> clause is incompatible with "
7153 *pc
= OMP_CLAUSE_CHAIN (c
);
7155 pc
= &OMP_CLAUSE_CHAIN (c
);
7158 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7160 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7161 bool remove
= false;
7162 bool need_complete_type
= false;
7163 bool need_default_ctor
= false;
7164 bool need_copy_ctor
= false;
7165 bool need_copy_assignment
= false;
7166 bool need_implicitly_determined
= false;
7167 bool need_dtor
= false;
7168 tree type
, inner_type
;
7172 case OMP_CLAUSE_SHARED
:
7173 need_implicitly_determined
= true;
7175 case OMP_CLAUSE_PRIVATE
:
7176 need_complete_type
= true;
7177 need_default_ctor
= true;
7179 need_implicitly_determined
= true;
7181 case OMP_CLAUSE_FIRSTPRIVATE
:
7182 need_complete_type
= true;
7183 need_copy_ctor
= true;
7185 need_implicitly_determined
= true;
7187 case OMP_CLAUSE_LASTPRIVATE
:
7188 need_complete_type
= true;
7189 need_copy_assignment
= true;
7190 need_implicitly_determined
= true;
7192 case OMP_CLAUSE_REDUCTION
:
7193 need_implicitly_determined
= true;
7195 case OMP_CLAUSE_LINEAR
:
7196 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7197 need_implicitly_determined
= true;
7198 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7199 && !bitmap_bit_p (&map_head
,
7200 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7202 error_at (OMP_CLAUSE_LOCATION (c
),
7203 "%<linear%> clause step is a parameter %qD not "
7204 "specified in %<uniform%> clause",
7205 OMP_CLAUSE_LINEAR_STEP (c
));
7206 *pc
= OMP_CLAUSE_CHAIN (c
);
7210 case OMP_CLAUSE_COPYPRIVATE
:
7211 need_copy_assignment
= true;
7213 case OMP_CLAUSE_COPYIN
:
7214 need_copy_assignment
= true;
7216 case OMP_CLAUSE_SIMDLEN
:
7218 && !processing_template_decl
7219 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7220 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7222 error_at (OMP_CLAUSE_LOCATION (c
),
7223 "%<simdlen%> clause value is bigger than "
7224 "%<safelen%> clause value");
7225 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7226 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7228 pc
= &OMP_CLAUSE_CHAIN (c
);
7230 case OMP_CLAUSE_SCHEDULE
:
7232 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7233 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7235 error_at (OMP_CLAUSE_LOCATION (c
),
7236 "%<nonmonotonic%> schedule modifier specified "
7237 "together with %<ordered%> clause");
7238 OMP_CLAUSE_SCHEDULE_KIND (c
)
7239 = (enum omp_clause_schedule_kind
)
7240 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7241 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7243 pc
= &OMP_CLAUSE_CHAIN (c
);
7245 case OMP_CLAUSE_NOWAIT
:
7246 if (copyprivate_seen
)
7248 error_at (OMP_CLAUSE_LOCATION (c
),
7249 "%<nowait%> clause must not be used together "
7250 "with %<copyprivate%>");
7251 *pc
= OMP_CLAUSE_CHAIN (c
);
7256 pc
= &OMP_CLAUSE_CHAIN (c
);
7260 t
= OMP_CLAUSE_DECL (c
);
7261 if (processing_template_decl
7262 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7264 pc
= &OMP_CLAUSE_CHAIN (c
);
7270 case OMP_CLAUSE_LASTPRIVATE
:
7271 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7273 need_default_ctor
= true;
7278 case OMP_CLAUSE_REDUCTION
:
7279 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7283 t
= OMP_CLAUSE_DECL (c
);
7286 case OMP_CLAUSE_COPYIN
:
7287 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7289 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
7298 if (need_complete_type
|| need_copy_assignment
)
7300 t
= require_complete_type (t
);
7301 if (t
== error_mark_node
)
7303 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
7304 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7307 if (need_implicitly_determined
)
7309 const char *share_name
= NULL
;
7311 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7312 share_name
= "threadprivate";
7313 else switch (cxx_omp_predetermined_sharing (t
))
7315 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7317 case OMP_CLAUSE_DEFAULT_SHARED
:
7318 /* const vars may be specified in firstprivate clause. */
7319 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7320 && cxx_omp_const_qual_no_mutable (t
))
7322 share_name
= "shared";
7324 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7325 share_name
= "private";
7332 error ("%qE is predetermined %qs for %qs",
7333 omp_clause_printable_decl (t
), share_name
,
7334 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7339 /* We're interested in the base element, not arrays. */
7340 inner_type
= type
= TREE_TYPE (t
);
7341 if ((need_complete_type
7342 || need_copy_assignment
7343 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
7344 && TREE_CODE (inner_type
) == REFERENCE_TYPE
)
7345 inner_type
= TREE_TYPE (inner_type
);
7346 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7347 inner_type
= TREE_TYPE (inner_type
);
7349 /* Check for special function availability by building a call to one.
7350 Save the results, because later we won't be in the right context
7351 for making these queries. */
7352 if (CLASS_TYPE_P (inner_type
)
7353 && COMPLETE_TYPE_P (inner_type
)
7354 && (need_default_ctor
|| need_copy_ctor
7355 || need_copy_assignment
|| need_dtor
)
7356 && !type_dependent_expression_p (t
)
7357 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7358 need_copy_ctor
, need_copy_assignment
,
7363 && c_kind
== OMP_CLAUSE_SHARED
7364 && processing_template_decl
)
7366 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7368 OMP_CLAUSE_DECL (c
) = t
;
7372 *pc
= OMP_CLAUSE_CHAIN (c
);
7374 pc
= &OMP_CLAUSE_CHAIN (c
);
7377 bitmap_obstack_release (NULL
);
7381 /* Start processing OpenMP clauses that can include any
7382 privatization clauses for non-static data members. */
7385 push_omp_privatization_clauses (bool ignore_next
)
7387 if (omp_private_member_ignore_next
)
7389 omp_private_member_ignore_next
= ignore_next
;
7392 omp_private_member_ignore_next
= ignore_next
;
7393 if (omp_private_member_map
)
7394 omp_private_member_vec
.safe_push (error_mark_node
);
7395 return push_stmt_list ();
7398 /* Revert remapping of any non-static data members since
7399 the last push_omp_privatization_clauses () call. */
7402 pop_omp_privatization_clauses (tree stmt
)
7404 if (stmt
== NULL_TREE
)
7406 stmt
= pop_stmt_list (stmt
);
7407 if (omp_private_member_map
)
7409 while (!omp_private_member_vec
.is_empty ())
7411 tree t
= omp_private_member_vec
.pop ();
7412 if (t
== error_mark_node
)
7417 bool no_decl_expr
= t
== integer_zero_node
;
7419 t
= omp_private_member_vec
.pop ();
7420 tree
*v
= omp_private_member_map
->get (t
);
7424 omp_private_member_map
->remove (t
);
7426 delete omp_private_member_map
;
7427 omp_private_member_map
= NULL
;
7432 /* Remember OpenMP privatization clauses mapping and clear it.
7433 Used for lambdas. */
7436 save_omp_privatization_clauses (vec
<tree
> &save
)
7439 if (omp_private_member_ignore_next
)
7440 save
.safe_push (integer_one_node
);
7441 omp_private_member_ignore_next
= false;
7442 if (!omp_private_member_map
)
7445 while (!omp_private_member_vec
.is_empty ())
7447 tree t
= omp_private_member_vec
.pop ();
7448 if (t
== error_mark_node
)
7454 if (t
== integer_zero_node
)
7455 t
= omp_private_member_vec
.pop ();
7456 tree
*v
= omp_private_member_map
->get (t
);
7458 save
.safe_push (*v
);
7463 delete omp_private_member_map
;
7464 omp_private_member_map
= NULL
;
7467 /* Restore OpenMP privatization clauses mapping saved by the
7471 restore_omp_privatization_clauses (vec
<tree
> &save
)
7473 gcc_assert (omp_private_member_vec
.is_empty ());
7474 omp_private_member_ignore_next
= false;
7475 if (save
.is_empty ())
7477 if (save
.length () == 1 && save
[0] == integer_one_node
)
7479 omp_private_member_ignore_next
= true;
7484 omp_private_member_map
= new hash_map
<tree
, tree
>;
7485 while (!save
.is_empty ())
7487 tree t
= save
.pop ();
7489 if (t
!= error_mark_node
)
7491 if (t
== integer_one_node
)
7493 omp_private_member_ignore_next
= true;
7494 gcc_assert (save
.is_empty ());
7497 if (t
== integer_zero_node
)
7499 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7502 omp_private_member_vec
.safe_push (t
);
7504 omp_private_member_vec
.safe_push (n
);
7509 /* For all variables in the tree_list VARS, mark them as thread local. */
7512 finish_omp_threadprivate (tree vars
)
7516 /* Mark every variable in VARS to be assigned thread local storage. */
7517 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7519 tree v
= TREE_PURPOSE (t
);
7521 if (error_operand_p (v
))
7523 else if (!VAR_P (v
))
7524 error ("%<threadprivate%> %qD is not file, namespace "
7525 "or block scope variable", v
);
7526 /* If V had already been marked threadprivate, it doesn't matter
7527 whether it had been used prior to this point. */
7528 else if (TREE_USED (v
)
7529 && (DECL_LANG_SPECIFIC (v
) == NULL
7530 || !CP_DECL_THREADPRIVATE_P (v
)))
7531 error ("%qE declared %<threadprivate%> after first use", v
);
7532 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7533 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7534 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7535 error ("%<threadprivate%> %qE has incomplete type", v
);
7536 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7537 && CP_DECL_CONTEXT (v
) != current_class_type
)
7538 error ("%<threadprivate%> %qE directive not "
7539 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7542 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7543 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7545 retrofit_lang_decl (v
);
7547 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
7548 after the allocation of the lang_decl structure. */
7549 if (DECL_DISCRIMINATOR_P (v
))
7550 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
7553 if (! CP_DECL_THREAD_LOCAL_P (v
))
7555 CP_DECL_THREAD_LOCAL_P (v
) = true;
7556 set_decl_tls_model (v
, decl_default_tls_model (v
));
7557 /* If rtl has been already set for this var, call
7558 make_decl_rtl once again, so that encode_section_info
7559 has a chance to look at the new decl flags. */
7560 if (DECL_RTL_SET_P (v
))
7563 CP_DECL_THREADPRIVATE_P (v
) = 1;
7568 /* Build an OpenMP structured block. */
7571 begin_omp_structured_block (void)
7573 return do_pushlevel (sk_omp
);
7577 finish_omp_structured_block (tree block
)
7579 return do_poplevel (block
);
7582 /* Similarly, except force the retention of the BLOCK. */
7585 begin_omp_parallel (void)
7587 keep_next_level (true);
7588 return begin_omp_structured_block ();
7591 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7595 finish_oacc_data (tree clauses
, tree block
)
7599 block
= finish_omp_structured_block (block
);
7601 stmt
= make_node (OACC_DATA
);
7602 TREE_TYPE (stmt
) = void_type_node
;
7603 OACC_DATA_CLAUSES (stmt
) = clauses
;
7604 OACC_DATA_BODY (stmt
) = block
;
7606 return add_stmt (stmt
);
7609 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
7613 finish_oacc_host_data (tree clauses
, tree block
)
7617 block
= finish_omp_structured_block (block
);
7619 stmt
= make_node (OACC_HOST_DATA
);
7620 TREE_TYPE (stmt
) = void_type_node
;
7621 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
7622 OACC_HOST_DATA_BODY (stmt
) = block
;
7624 return add_stmt (stmt
);
7627 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
7631 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
7633 body
= finish_omp_structured_block (body
);
7635 tree stmt
= make_node (code
);
7636 TREE_TYPE (stmt
) = void_type_node
;
7637 OMP_BODY (stmt
) = body
;
7638 OMP_CLAUSES (stmt
) = clauses
;
7640 return add_stmt (stmt
);
7644 finish_omp_parallel (tree clauses
, tree body
)
7648 body
= finish_omp_structured_block (body
);
7650 stmt
= make_node (OMP_PARALLEL
);
7651 TREE_TYPE (stmt
) = void_type_node
;
7652 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
7653 OMP_PARALLEL_BODY (stmt
) = body
;
7655 return add_stmt (stmt
);
7659 begin_omp_task (void)
7661 keep_next_level (true);
7662 return begin_omp_structured_block ();
7666 finish_omp_task (tree clauses
, tree body
)
7670 body
= finish_omp_structured_block (body
);
7672 stmt
= make_node (OMP_TASK
);
7673 TREE_TYPE (stmt
) = void_type_node
;
7674 OMP_TASK_CLAUSES (stmt
) = clauses
;
7675 OMP_TASK_BODY (stmt
) = body
;
7677 return add_stmt (stmt
);
7680 /* Helper function for finish_omp_for. Convert Ith random access iterator
7681 into integral iterator. Return FALSE if successful. */
7684 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
7685 tree declv
, tree orig_declv
, tree initv
,
7686 tree condv
, tree incrv
, tree
*body
,
7687 tree
*pre_body
, tree
&clauses
, tree
*lastp
,
7688 int collapse
, int ordered
)
7690 tree diff
, iter_init
, iter_incr
= NULL
, last
;
7691 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
7692 tree decl
= TREE_VEC_ELT (declv
, i
);
7693 tree init
= TREE_VEC_ELT (initv
, i
);
7694 tree cond
= TREE_VEC_ELT (condv
, i
);
7695 tree incr
= TREE_VEC_ELT (incrv
, i
);
7697 location_t elocus
= locus
;
7699 if (init
&& EXPR_HAS_LOCATION (init
))
7700 elocus
= EXPR_LOCATION (init
);
7702 cond
= cp_fully_fold (cond
);
7703 switch (TREE_CODE (cond
))
7710 if (TREE_OPERAND (cond
, 1) == iter
)
7711 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
7712 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
7713 if (TREE_OPERAND (cond
, 0) != iter
)
7714 cond
= error_mark_node
;
7717 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
7720 TREE_OPERAND (cond
, 1), ERROR_MARK
,
7721 NULL
, tf_warning_or_error
);
7722 if (error_operand_p (tem
))
7727 cond
= error_mark_node
;
7730 if (cond
== error_mark_node
)
7732 error_at (elocus
, "invalid controlling predicate");
7735 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
7736 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
7737 tf_warning_or_error
);
7738 diff
= cp_fully_fold (diff
);
7739 if (error_operand_p (diff
))
7741 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
7743 error_at (elocus
, "difference between %qE and %qD does not have integer type",
7744 TREE_OPERAND (cond
, 1), iter
);
7747 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
7748 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
7749 cond
, cp_walk_subtrees
))
7752 switch (TREE_CODE (incr
))
7754 case PREINCREMENT_EXPR
:
7755 case PREDECREMENT_EXPR
:
7756 case POSTINCREMENT_EXPR
:
7757 case POSTDECREMENT_EXPR
:
7758 if (TREE_OPERAND (incr
, 0) != iter
)
7760 incr
= error_mark_node
;
7763 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
7764 TREE_CODE (incr
), iter
,
7765 tf_warning_or_error
);
7766 if (error_operand_p (iter_incr
))
7768 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
7769 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
7770 incr
= integer_one_node
;
7772 incr
= integer_minus_one_node
;
7775 if (TREE_OPERAND (incr
, 0) != iter
)
7776 incr
= error_mark_node
;
7777 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
7778 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
7780 tree rhs
= TREE_OPERAND (incr
, 1);
7781 if (TREE_OPERAND (rhs
, 0) == iter
)
7783 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
7785 incr
= error_mark_node
;
7788 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7789 iter
, TREE_CODE (rhs
),
7790 TREE_OPERAND (rhs
, 1),
7791 tf_warning_or_error
);
7792 if (error_operand_p (iter_incr
))
7794 incr
= TREE_OPERAND (rhs
, 1);
7795 incr
= cp_convert (TREE_TYPE (diff
), incr
,
7796 tf_warning_or_error
);
7797 if (TREE_CODE (rhs
) == MINUS_EXPR
)
7799 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
7800 incr
= fold_simple (incr
);
7802 if (TREE_CODE (incr
) != INTEGER_CST
7803 && (TREE_CODE (incr
) != NOP_EXPR
7804 || (TREE_CODE (TREE_OPERAND (incr
, 0))
7809 else if (TREE_OPERAND (rhs
, 1) == iter
)
7811 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
7812 || TREE_CODE (rhs
) != PLUS_EXPR
)
7813 incr
= error_mark_node
;
7816 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
7818 TREE_OPERAND (rhs
, 0),
7821 tf_warning_or_error
);
7822 if (error_operand_p (iter_incr
))
7824 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7827 tf_warning_or_error
);
7828 if (error_operand_p (iter_incr
))
7830 incr
= TREE_OPERAND (rhs
, 0);
7835 incr
= error_mark_node
;
7838 incr
= error_mark_node
;
7841 incr
= error_mark_node
;
7845 if (incr
== error_mark_node
)
7847 error_at (elocus
, "invalid increment expression");
7851 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
7852 bool taskloop_iv_seen
= false;
7853 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
7854 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
7855 && OMP_CLAUSE_DECL (c
) == iter
)
7857 if (code
== OMP_TASKLOOP
)
7859 taskloop_iv_seen
= true;
7860 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
7864 else if (code
== OMP_TASKLOOP
7865 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
7866 && OMP_CLAUSE_DECL (c
) == iter
)
7868 taskloop_iv_seen
= true;
7869 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
7872 decl
= create_temporary_var (TREE_TYPE (diff
));
7874 add_decl_expr (decl
);
7875 last
= create_temporary_var (TREE_TYPE (diff
));
7877 add_decl_expr (last
);
7878 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
7879 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7881 incr_var
= create_temporary_var (TREE_TYPE (diff
));
7882 pushdecl (incr_var
);
7883 add_decl_expr (incr_var
);
7885 gcc_assert (stmts_are_full_exprs_p ());
7886 tree diffvar
= NULL_TREE
;
7887 if (code
== OMP_TASKLOOP
)
7889 if (!taskloop_iv_seen
)
7891 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7892 OMP_CLAUSE_DECL (ivc
) = iter
;
7893 cxx_omp_finish_clause (ivc
, NULL
);
7894 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
7897 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7898 OMP_CLAUSE_DECL (lvc
) = last
;
7899 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
7901 diffvar
= create_temporary_var (TREE_TYPE (diff
));
7903 add_decl_expr (diffvar
);
7906 orig_pre_body
= *pre_body
;
7907 *pre_body
= push_stmt_list ();
7909 add_stmt (orig_pre_body
);
7911 finish_expr_stmt (build_x_modify_expr (elocus
,
7912 iter
, NOP_EXPR
, init
,
7913 tf_warning_or_error
));
7914 init
= build_int_cst (TREE_TYPE (diff
), 0);
7915 if (c
&& iter_incr
== NULL
7916 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7920 finish_expr_stmt (build_x_modify_expr (elocus
,
7922 incr
, tf_warning_or_error
));
7925 iter_incr
= build_x_modify_expr (elocus
,
7926 iter
, PLUS_EXPR
, incr
,
7927 tf_warning_or_error
);
7929 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
7931 finish_expr_stmt (build_x_modify_expr (elocus
,
7932 last
, NOP_EXPR
, init
,
7933 tf_warning_or_error
));
7936 finish_expr_stmt (build_x_modify_expr (elocus
,
7938 diff
, tf_warning_or_error
));
7941 *pre_body
= pop_stmt_list (*pre_body
);
7943 cond
= cp_build_binary_op (elocus
,
7944 TREE_CODE (cond
), decl
, diff
,
7945 tf_warning_or_error
);
7946 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
7947 elocus
, incr
, NULL_TREE
);
7950 *body
= push_stmt_list ();
7951 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
7952 iter_init
= build_x_modify_expr (elocus
,
7953 iter
, PLUS_EXPR
, iter_init
,
7954 tf_warning_or_error
);
7955 if (iter_init
!= error_mark_node
)
7956 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7957 finish_expr_stmt (iter_init
);
7958 finish_expr_stmt (build_x_modify_expr (elocus
,
7959 last
, NOP_EXPR
, decl
,
7960 tf_warning_or_error
));
7961 add_stmt (orig_body
);
7962 *body
= pop_stmt_list (*body
);
7966 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
7968 finish_expr_stmt (iter_incr
);
7972 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
7973 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
7974 iter_init
, iter_incr
);
7975 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
7976 iter_init
= build_x_modify_expr (elocus
,
7977 iter
, PLUS_EXPR
, iter_init
,
7978 tf_warning_or_error
);
7979 if (iter_init
!= error_mark_node
)
7980 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7981 finish_expr_stmt (iter_init
);
7983 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
7984 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
7987 TREE_VEC_ELT (declv
, i
) = decl
;
7988 TREE_VEC_ELT (initv
, i
) = init
;
7989 TREE_VEC_ELT (condv
, i
) = cond
;
7990 TREE_VEC_ELT (incrv
, i
) = incr
;
7996 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
7997 are directly for their associated operands in the statement. DECL
7998 and INIT are a combo; if DECL is NULL then INIT ought to be a
7999 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
8000 optional statements that need to go before the loop into its
8004 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
8005 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
8006 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
8008 tree omp_for
= NULL
, orig_incr
= NULL
;
8009 tree decl
= NULL
, init
, cond
, incr
;
8010 tree last
= NULL_TREE
;
8016 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
8017 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
8018 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
8019 if (TREE_VEC_LENGTH (declv
) > 1)
8023 c
= omp_find_clause (clauses
, OMP_CLAUSE_TILE
);
8025 collapse
= list_length (OMP_CLAUSE_TILE_LIST (c
));
8028 c
= omp_find_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
8030 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
8031 if (collapse
!= TREE_VEC_LENGTH (declv
))
8032 ordered
= TREE_VEC_LENGTH (declv
);
8035 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8037 decl
= TREE_VEC_ELT (declv
, i
);
8038 init
= TREE_VEC_ELT (initv
, i
);
8039 cond
= TREE_VEC_ELT (condv
, i
);
8040 incr
= TREE_VEC_ELT (incrv
, i
);
8046 switch (TREE_CODE (init
))
8049 decl
= TREE_OPERAND (init
, 0);
8050 init
= TREE_OPERAND (init
, 1);
8053 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
8055 decl
= TREE_OPERAND (init
, 0);
8056 init
= TREE_OPERAND (init
, 2);
8066 "expected iteration declaration or initialization");
8071 if (init
&& EXPR_HAS_LOCATION (init
))
8072 elocus
= EXPR_LOCATION (init
);
8076 error_at (elocus
, "missing controlling predicate");
8082 error_at (elocus
, "missing increment expression");
8086 TREE_VEC_ELT (declv
, i
) = decl
;
8087 TREE_VEC_ELT (initv
, i
) = init
;
8094 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8096 && !c_omp_check_loop_iv_exprs (locus
, declv
,
8097 TREE_VEC_ELT (declv
, i
), orig_init
,
8098 NULL_TREE
, cp_walk_subtrees
))
8104 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8108 stmt
= make_node (code
);
8110 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8112 /* This is really just a place-holder. We'll be decomposing this
8113 again and going through the cp_build_modify_expr path below when
8114 we instantiate the thing. */
8115 TREE_VEC_ELT (initv
, i
)
8116 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8117 TREE_VEC_ELT (initv
, i
));
8120 TREE_TYPE (stmt
) = void_type_node
;
8121 OMP_FOR_INIT (stmt
) = initv
;
8122 OMP_FOR_COND (stmt
) = condv
;
8123 OMP_FOR_INCR (stmt
) = incrv
;
8124 OMP_FOR_BODY (stmt
) = body
;
8125 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8126 OMP_FOR_CLAUSES (stmt
) = clauses
;
8128 SET_EXPR_LOCATION (stmt
, locus
);
8129 return add_stmt (stmt
);
8133 orig_declv
= copy_node (declv
);
8135 if (processing_template_decl
)
8136 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8138 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8140 decl
= TREE_VEC_ELT (declv
, i
);
8141 init
= TREE_VEC_ELT (initv
, i
);
8142 cond
= TREE_VEC_ELT (condv
, i
);
8143 incr
= TREE_VEC_ELT (incrv
, i
);
8145 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8148 if (init
&& EXPR_HAS_LOCATION (init
))
8149 elocus
= EXPR_LOCATION (init
);
8153 error_at (elocus
, "expected iteration declaration or initialization");
8157 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8160 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8161 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8162 TREE_CODE (TREE_OPERAND (incr
, 1)),
8163 TREE_OPERAND (incr
, 2),
8164 tf_warning_or_error
);
8167 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8169 if (code
== OMP_SIMD
)
8171 error_at (elocus
, "%<#pragma omp simd%> used with class "
8172 "iteration variable %qE", decl
);
8175 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8176 initv
, condv
, incrv
, &body
,
8177 &pre_body
, clauses
, &last
,
8183 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8184 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8186 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8190 if (!processing_template_decl
)
8192 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8193 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8194 tf_warning_or_error
);
8197 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8199 && TREE_SIDE_EFFECTS (cond
)
8200 && COMPARISON_CLASS_P (cond
)
8201 && !processing_template_decl
)
8203 tree t
= TREE_OPERAND (cond
, 0);
8204 if (TREE_SIDE_EFFECTS (t
)
8206 && (TREE_CODE (t
) != NOP_EXPR
8207 || TREE_OPERAND (t
, 0) != decl
))
8208 TREE_OPERAND (cond
, 0)
8209 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8211 t
= TREE_OPERAND (cond
, 1);
8212 if (TREE_SIDE_EFFECTS (t
)
8214 && (TREE_CODE (t
) != NOP_EXPR
8215 || TREE_OPERAND (t
, 0) != decl
))
8216 TREE_OPERAND (cond
, 1)
8217 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8219 if (decl
== error_mark_node
|| init
== error_mark_node
)
8222 TREE_VEC_ELT (declv
, i
) = decl
;
8223 TREE_VEC_ELT (initv
, i
) = init
;
8224 TREE_VEC_ELT (condv
, i
) = cond
;
8225 TREE_VEC_ELT (incrv
, i
) = incr
;
8229 if (IS_EMPTY_STMT (pre_body
))
8232 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8233 incrv
, body
, pre_body
);
8235 /* Check for iterators appearing in lb, b or incr expressions. */
8236 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8237 omp_for
= NULL_TREE
;
8239 if (omp_for
== NULL
)
8246 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8248 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8249 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8251 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8254 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8255 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8256 && !processing_template_decl
)
8258 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8259 if (TREE_SIDE_EFFECTS (t
)
8261 && (TREE_CODE (t
) != NOP_EXPR
8262 || TREE_OPERAND (t
, 0) != decl
))
8263 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8264 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8266 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8267 if (TREE_SIDE_EFFECTS (t
)
8269 && (TREE_CODE (t
) != NOP_EXPR
8270 || TREE_OPERAND (t
, 0) != decl
))
8271 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8272 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8276 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8278 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8280 /* For simd loops with non-static data member iterators, we could have added
8281 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8282 step at this point, fill it in. */
8283 if (code
== OMP_SIMD
&& !processing_template_decl
8284 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8285 for (tree c
= omp_find_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8286 c
= omp_find_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8287 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8289 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8290 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8291 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8293 switch (TREE_CODE (incr
))
8295 case PREINCREMENT_EXPR
:
8296 case POSTINCREMENT_EXPR
:
8297 /* c_omp_for_incr_canonicalize_ptr() should have been
8298 called to massage things appropriately. */
8299 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8300 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8302 case PREDECREMENT_EXPR
:
8303 case POSTDECREMENT_EXPR
:
8304 /* c_omp_for_incr_canonicalize_ptr() should have been
8305 called to massage things appropriately. */
8306 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8307 OMP_CLAUSE_LINEAR_STEP (c
)
8308 = build_int_cst (TREE_TYPE (decl
), -1);
8311 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8312 incr
= TREE_OPERAND (incr
, 1);
8313 switch (TREE_CODE (incr
))
8316 if (TREE_OPERAND (incr
, 1) == decl
)
8317 step
= TREE_OPERAND (incr
, 0);
8319 step
= TREE_OPERAND (incr
, 1);
8322 case POINTER_PLUS_EXPR
:
8323 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8324 step
= TREE_OPERAND (incr
, 1);
8329 stept
= TREE_TYPE (decl
);
8330 if (POINTER_TYPE_P (stept
))
8332 step
= fold_convert (stept
, step
);
8333 if (TREE_CODE (incr
) == MINUS_EXPR
)
8334 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8335 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8346 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
8347 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
8362 dependent_p
= false;
8365 /* Even in a template, we can detect invalid uses of the atomic
8366 pragma if neither LHS nor RHS is type-dependent. */
8367 if (processing_template_decl
)
8369 dependent_p
= (type_dependent_expression_p (lhs
)
8370 || (rhs
&& type_dependent_expression_p (rhs
))
8371 || (v
&& type_dependent_expression_p (v
))
8372 || (lhs1
&& type_dependent_expression_p (lhs1
))
8373 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8376 lhs
= build_non_dependent_expr (lhs
);
8378 rhs
= build_non_dependent_expr (rhs
);
8380 v
= build_non_dependent_expr (v
);
8382 lhs1
= build_non_dependent_expr (lhs1
);
8384 rhs1
= build_non_dependent_expr (rhs1
);
8389 bool swapped
= false;
8390 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8392 std::swap (rhs
, rhs1
);
8393 swapped
= !commutative_tree_code (opcode
);
8395 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8397 if (code
== OMP_ATOMIC
)
8398 error ("%<#pragma omp atomic update%> uses two different "
8399 "expressions for memory");
8401 error ("%<#pragma omp atomic capture%> uses two different "
8402 "expressions for memory");
8405 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8407 if (code
== OMP_ATOMIC
)
8408 error ("%<#pragma omp atomic update%> uses two different "
8409 "expressions for memory");
8411 error ("%<#pragma omp atomic capture%> uses two different "
8412 "expressions for memory");
8415 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
8416 v
, lhs1
, rhs1
, swapped
, seq_cst
,
8417 processing_template_decl
!= 0);
8418 if (stmt
== error_mark_node
)
8421 if (processing_template_decl
)
8423 if (code
== OMP_ATOMIC_READ
)
8425 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
8426 OMP_ATOMIC_READ
, orig_lhs
);
8427 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8428 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8432 if (opcode
== NOP_EXPR
)
8433 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8435 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8437 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8438 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8439 if (code
!= OMP_ATOMIC
)
8441 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
8442 code
, orig_lhs1
, stmt
);
8443 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8444 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8447 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
8448 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8450 finish_expr_stmt (stmt
);
8454 finish_omp_barrier (void)
8456 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
8457 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8458 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8459 release_tree_vector (vec
);
8460 finish_expr_stmt (stmt
);
8464 finish_omp_flush (void)
8466 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8467 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8468 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8469 release_tree_vector (vec
);
8470 finish_expr_stmt (stmt
);
8474 finish_omp_taskwait (void)
8476 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8477 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8478 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8479 release_tree_vector (vec
);
8480 finish_expr_stmt (stmt
);
8484 finish_omp_taskyield (void)
8486 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8487 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8488 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8489 release_tree_vector (vec
);
8490 finish_expr_stmt (stmt
);
8494 finish_omp_cancel (tree clauses
)
8496 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
8498 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8500 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8502 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8504 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8508 error ("%<#pragma omp cancel%> must specify one of "
8509 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8512 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8513 tree ifc
= omp_find_clause (clauses
, OMP_CLAUSE_IF
);
8514 if (ifc
!= NULL_TREE
)
8516 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
8517 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
8518 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
8519 build_zero_cst (type
));
8522 ifc
= boolean_true_node
;
8523 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
8524 vec
->quick_push (ifc
);
8525 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8526 release_tree_vector (vec
);
8527 finish_expr_stmt (stmt
);
8531 finish_omp_cancellation_point (tree clauses
)
8533 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
8535 if (omp_find_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8537 else if (omp_find_clause (clauses
, OMP_CLAUSE_FOR
))
8539 else if (omp_find_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8541 else if (omp_find_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8545 error ("%<#pragma omp cancellation point%> must specify one of "
8546 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8549 vec
<tree
, va_gc
> *vec
8550 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
8551 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8552 release_tree_vector (vec
);
8553 finish_expr_stmt (stmt
);
8556 /* Begin a __transaction_atomic or __transaction_relaxed statement.
8557 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
8558 should create an extra compound stmt. */
8561 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
8566 *pcompound
= begin_compound_stmt (0);
8568 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
8570 /* Only add the statement to the function if support enabled. */
8574 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
8575 ? G_("%<__transaction_relaxed%> without "
8576 "transactional memory support enabled")
8577 : G_("%<__transaction_atomic%> without "
8578 "transactional memory support enabled")));
8580 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
8581 TREE_SIDE_EFFECTS (r
) = 1;
8585 /* End a __transaction_atomic or __transaction_relaxed statement.
8586 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
8587 and we should end the compound. If NOEX is non-NULL, we wrap the body in
8588 a MUST_NOT_THROW_EXPR with NOEX as condition. */
8591 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
8593 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
8594 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
8595 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
8596 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
8598 /* noexcept specifications are not allowed for function transactions. */
8599 gcc_assert (!(noex
&& compound_stmt
));
8602 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
8604 protected_set_expr_location
8605 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
8606 TREE_SIDE_EFFECTS (body
) = 1;
8607 TRANSACTION_EXPR_BODY (stmt
) = body
;
8611 finish_compound_stmt (compound_stmt
);
8614 /* Build a __transaction_atomic or __transaction_relaxed expression. If
8615 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
8619 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
8624 expr
= build_must_not_throw_expr (expr
, noex
);
8625 protected_set_expr_location (expr
, loc
);
8626 TREE_SIDE_EFFECTS (expr
) = 1;
8628 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
8629 if (flags
& TM_STMT_ATTR_RELAXED
)
8630 TRANSACTION_EXPR_RELAXED (ret
) = 1;
8631 TREE_SIDE_EFFECTS (ret
) = 1;
8632 SET_EXPR_LOCATION (ret
, loc
);
8637 init_cp_semantics (void)
8641 /* Build a STATIC_ASSERT for a static assertion with the condition
8642 CONDITION and the message text MESSAGE. LOCATION is the location
8643 of the static assertion in the source code. When MEMBER_P, this
8644 static assertion is a member of a class. */
8646 finish_static_assert (tree condition
, tree message
, location_t location
,
8649 tsubst_flags_t complain
= tf_warning_or_error
;
8651 if (message
== NULL_TREE
8652 || message
== error_mark_node
8653 || condition
== NULL_TREE
8654 || condition
== error_mark_node
)
8657 if (check_for_bare_parameter_packs (condition
))
8658 condition
= error_mark_node
;
8660 if (instantiation_dependent_expression_p (condition
))
8662 /* We're in a template; build a STATIC_ASSERT and put it in
8666 assertion
= make_node (STATIC_ASSERT
);
8667 STATIC_ASSERT_CONDITION (assertion
) = condition
;
8668 STATIC_ASSERT_MESSAGE (assertion
) = message
;
8669 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
8672 maybe_add_class_template_decl_list (current_class_type
,
8676 add_stmt (assertion
);
8681 /* Fold the expression and convert it to a boolean value. */
8682 condition
= perform_implicit_conversion_flags (boolean_type_node
, condition
,
8683 complain
, LOOKUP_NORMAL
);
8684 condition
= fold_non_dependent_expr (condition
);
8686 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
8687 /* Do nothing; the condition is satisfied. */
8691 location_t saved_loc
= input_location
;
8693 input_location
= location
;
8694 if (TREE_CODE (condition
) == INTEGER_CST
8695 && integer_zerop (condition
))
8697 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
8698 (TREE_TYPE (TREE_TYPE (message
))));
8699 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
8700 /* Report the error. */
8702 error ("static assertion failed");
8704 error ("static assertion failed: %s",
8705 TREE_STRING_POINTER (message
));
8707 else if (condition
&& condition
!= error_mark_node
)
8709 error ("non-constant condition for static assertion");
8710 if (require_rvalue_constant_expression (condition
))
8711 cxx_constant_value (condition
);
8713 input_location
= saved_loc
;
8717 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
8718 suitable for use as a type-specifier.
8720 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
8721 id-expression or a class member access, FALSE when it was parsed as
8722 a full expression. */
8725 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
8726 tsubst_flags_t complain
)
8728 tree type
= NULL_TREE
;
8730 if (!expr
|| error_operand_p (expr
))
8731 return error_mark_node
;
8734 || TREE_CODE (expr
) == TYPE_DECL
8735 || (TREE_CODE (expr
) == BIT_NOT_EXPR
8736 && TYPE_P (TREE_OPERAND (expr
, 0))))
8738 if (complain
& tf_error
)
8739 error ("argument to decltype must be an expression");
8740 return error_mark_node
;
8743 /* Depending on the resolution of DR 1172, we may later need to distinguish
8744 instantiation-dependent but not type-dependent expressions so that, say,
8745 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
8746 if (instantiation_dependent_uneval_expression_p (expr
))
8748 type
= cxx_make_type (DECLTYPE_TYPE
);
8749 DECLTYPE_TYPE_EXPR (type
) = expr
;
8750 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
8751 = id_expression_or_member_access_p
;
8752 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8757 /* The type denoted by decltype(e) is defined as follows: */
8759 expr
= resolve_nondeduced_context (expr
, complain
);
8761 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
8762 return error_mark_node
;
8764 if (type_unknown_p (expr
))
8766 if (complain
& tf_error
)
8767 error ("decltype cannot resolve address of overloaded function");
8768 return error_mark_node
;
8771 /* To get the size of a static data member declared as an array of
8772 unknown bound, we need to instantiate it. */
8774 && VAR_HAD_UNKNOWN_BOUND (expr
)
8775 && DECL_TEMPLATE_INSTANTIATION (expr
))
8776 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
8778 if (id_expression_or_member_access_p
)
8780 /* If e is an id-expression or a class member access (5.2.5
8781 [expr.ref]), decltype(e) is defined as the type of the entity
8782 named by e. If there is no such entity, or e names a set of
8783 overloaded functions, the program is ill-formed. */
8784 if (identifier_p (expr
))
8785 expr
= lookup_name (expr
);
8787 if (INDIRECT_REF_P (expr
))
8788 /* This can happen when the expression is, e.g., "a.b". Just
8789 look at the underlying operand. */
8790 expr
= TREE_OPERAND (expr
, 0);
8792 if (TREE_CODE (expr
) == OFFSET_REF
8793 || TREE_CODE (expr
) == MEMBER_REF
8794 || TREE_CODE (expr
) == SCOPE_REF
)
8795 /* We're only interested in the field itself. If it is a
8796 BASELINK, we will need to see through it in the next
8798 expr
= TREE_OPERAND (expr
, 1);
8800 if (BASELINK_P (expr
))
8801 /* See through BASELINK nodes to the underlying function. */
8802 expr
= BASELINK_FUNCTIONS (expr
);
8804 /* decltype of a decomposition name drops references in the tuple case
8805 (unlike decltype of a normal variable) and keeps cv-qualifiers from
8806 the containing object in the other cases (unlike decltype of a member
8807 access expression). */
8808 if (DECL_DECOMPOSITION_P (expr
))
8810 if (DECL_HAS_VALUE_EXPR_P (expr
))
8811 /* Expr is an array or struct subobject proxy, handle
8812 bit-fields properly. */
8813 return unlowered_expr_type (expr
);
8815 /* Expr is a reference variable for the tuple case. */
8816 return lookup_decomp_type (expr
);
8819 switch (TREE_CODE (expr
))
8822 if (DECL_BIT_FIELD_TYPE (expr
))
8824 type
= DECL_BIT_FIELD_TYPE (expr
);
8827 /* Fall through for fields that aren't bitfields. */
8835 case TEMPLATE_PARM_INDEX
:
8836 expr
= mark_type_use (expr
);
8837 type
= TREE_TYPE (expr
);
8841 type
= error_mark_node
;
8846 mark_type_use (expr
);
8847 type
= is_bitfield_expr_with_lowered_type (expr
);
8849 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
8857 /* We can get here when the id-expression refers to an
8858 enumerator or non-type template parameter. */
8859 type
= TREE_TYPE (expr
);
8863 /* Handle instantiated template non-type arguments. */
8864 type
= TREE_TYPE (expr
);
8870 /* Within a lambda-expression:
8872 Every occurrence of decltype((x)) where x is a possibly
8873 parenthesized id-expression that names an entity of
8874 automatic storage duration is treated as if x were
8875 transformed into an access to a corresponding data member
8876 of the closure type that would have been declared if x
8877 were a use of the denoted entity. */
8878 if (outer_automatic_var_p (expr
)
8879 && current_function_decl
8880 && LAMBDA_FUNCTION_P (current_function_decl
))
8881 type
= capture_decltype (expr
);
8882 else if (error_operand_p (expr
))
8883 type
= error_mark_node
;
8884 else if (expr
== current_class_ptr
)
8885 /* If the expression is just "this", we want the
8886 cv-unqualified pointer for the "this" type. */
8887 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
8890 /* Otherwise, where T is the type of e, if e is an lvalue,
8891 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
8892 cp_lvalue_kind clk
= lvalue_kind (expr
);
8893 type
= unlowered_expr_type (expr
);
8894 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
8896 /* For vector types, pick a non-opaque variant. */
8897 if (VECTOR_TYPE_P (type
))
8898 type
= strip_typedefs (type
);
8900 if (clk
!= clk_none
&& !(clk
& clk_class
))
8901 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
8908 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
8909 __has_nothrow_copy, depending on assign_p. Returns true iff all
8910 the copy {ctor,assign} fns are nothrow. */
8913 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
8915 tree fns
= NULL_TREE
;
8917 if (assign_p
|| TYPE_HAS_COPY_CTOR (type
))
8918 fns
= get_class_binding (type
, assign_p
? assign_op_identifier
8921 bool saw_copy
= false;
8922 for (ovl_iterator
iter (fns
); iter
; ++iter
)
8926 if (copy_fn_p (fn
) > 0)
8929 maybe_instantiate_noexcept (fn
);
8930 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
8938 /* Actually evaluates the trait. */
8941 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
8943 enum tree_code type_code1
;
8946 type_code1
= TREE_CODE (type1
);
8950 case CPTK_HAS_NOTHROW_ASSIGN
:
8951 type1
= strip_array_types (type1
);
8952 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8953 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
8954 || (CLASS_TYPE_P (type1
)
8955 && classtype_has_nothrow_assign_or_copy_p (type1
,
8958 case CPTK_HAS_TRIVIAL_ASSIGN
:
8959 /* ??? The standard seems to be missing the "or array of such a class
8960 type" wording for this trait. */
8961 type1
= strip_array_types (type1
);
8962 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8963 && (trivial_type_p (type1
)
8964 || (CLASS_TYPE_P (type1
)
8965 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
8967 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
8968 type1
= strip_array_types (type1
);
8969 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
8970 || (CLASS_TYPE_P (type1
)
8971 && (t
= locate_ctor (type1
))
8972 && (maybe_instantiate_noexcept (t
),
8973 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
8975 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
8976 type1
= strip_array_types (type1
);
8977 return (trivial_type_p (type1
)
8978 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
8980 case CPTK_HAS_NOTHROW_COPY
:
8981 type1
= strip_array_types (type1
);
8982 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
8983 || (CLASS_TYPE_P (type1
)
8984 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
8986 case CPTK_HAS_TRIVIAL_COPY
:
8987 /* ??? The standard seems to be missing the "or array of such a class
8988 type" wording for this trait. */
8989 type1
= strip_array_types (type1
);
8990 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
8991 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
8993 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
8994 type1
= strip_array_types (type1
);
8995 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
8996 || (CLASS_TYPE_P (type1
)
8997 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
8999 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9000 return type_has_virtual_destructor (type1
);
9002 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9003 return type_has_unique_obj_representations (type1
);
9005 case CPTK_IS_ABSTRACT
:
9006 return ABSTRACT_CLASS_TYPE_P (type1
);
9008 case CPTK_IS_AGGREGATE
:
9009 return CP_AGGREGATE_TYPE_P (type1
);
9011 case CPTK_IS_BASE_OF
:
9012 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9013 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9014 || DERIVED_FROM_P (type1
, type2
)));
9017 return NON_UNION_CLASS_TYPE_P (type1
);
9020 return NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
);
9023 return type_code1
== ENUMERAL_TYPE
;
9026 return CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
);
9028 case CPTK_IS_LITERAL_TYPE
:
9029 return literal_type_p (type1
);
9032 return pod_type_p (type1
);
9034 case CPTK_IS_POLYMORPHIC
:
9035 return CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
);
9037 case CPTK_IS_SAME_AS
:
9038 return same_type_p (type1
, type2
);
9040 case CPTK_IS_STD_LAYOUT
:
9041 return std_layout_type_p (type1
);
9043 case CPTK_IS_TRIVIAL
:
9044 return trivial_type_p (type1
);
9046 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9047 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9049 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9050 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9052 case CPTK_IS_TRIVIALLY_COPYABLE
:
9053 return trivially_copyable_p (type1
);
9056 return type_code1
== UNION_TYPE
;
9058 case CPTK_IS_ASSIGNABLE
:
9059 return is_xible (MODIFY_EXPR
, type1
, type2
);
9061 case CPTK_IS_CONSTRUCTIBLE
:
9062 return is_xible (INIT_EXPR
, type1
, type2
);
9070 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9071 void, or a complete type, returns true, otherwise false. */
9074 check_trait_type (tree type
)
9076 if (type
== NULL_TREE
)
9079 if (TREE_CODE (type
) == TREE_LIST
)
9080 return (check_trait_type (TREE_VALUE (type
))
9081 && check_trait_type (TREE_CHAIN (type
)));
9083 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9084 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9087 if (VOID_TYPE_P (type
))
9090 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9093 /* Process a trait expression. */
9096 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9098 if (type1
== error_mark_node
9099 || type2
== error_mark_node
)
9100 return error_mark_node
;
9102 if (processing_template_decl
)
9104 tree trait_expr
= make_node (TRAIT_EXPR
);
9105 TREE_TYPE (trait_expr
) = boolean_type_node
;
9106 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9107 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9108 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9114 case CPTK_HAS_NOTHROW_ASSIGN
:
9115 case CPTK_HAS_TRIVIAL_ASSIGN
:
9116 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9117 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9118 case CPTK_HAS_NOTHROW_COPY
:
9119 case CPTK_HAS_TRIVIAL_COPY
:
9120 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9121 case CPTK_HAS_UNIQUE_OBJ_REPRESENTATIONS
:
9122 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9123 case CPTK_IS_ABSTRACT
:
9124 case CPTK_IS_AGGREGATE
:
9127 case CPTK_IS_LITERAL_TYPE
:
9129 case CPTK_IS_POLYMORPHIC
:
9130 case CPTK_IS_STD_LAYOUT
:
9131 case CPTK_IS_TRIVIAL
:
9132 case CPTK_IS_TRIVIALLY_COPYABLE
:
9133 if (!check_trait_type (type1
))
9134 return error_mark_node
;
9137 case CPTK_IS_ASSIGNABLE
:
9138 case CPTK_IS_CONSTRUCTIBLE
:
9141 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9142 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9143 if (!check_trait_type (type1
)
9144 || !check_trait_type (type2
))
9145 return error_mark_node
;
9148 case CPTK_IS_BASE_OF
:
9149 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9150 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9151 && !complete_type_or_else (type2
, NULL_TREE
))
9152 /* We already issued an error. */
9153 return error_mark_node
;
9159 case CPTK_IS_SAME_AS
:
9166 return (trait_expr_value (kind
, type1
, type2
)
9167 ? boolean_true_node
: boolean_false_node
);
9170 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9171 which is ignored for C++. */
9174 set_float_const_decimal64 (void)
9179 clear_float_const_decimal64 (void)
9184 float_const_decimal64_p (void)
9190 /* Return true if T designates the implied `this' parameter. */
9193 is_this_parameter (tree t
)
9195 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9197 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
)
9198 || (cp_binding_oracle
&& TREE_CODE (t
) == VAR_DECL
));
9202 /* Insert the deduced return type for an auto function. */
9205 apply_deduced_return_type (tree fco
, tree return_type
)
9209 if (return_type
== error_mark_node
)
9212 if (DECL_CONV_FN_P (fco
))
9213 DECL_NAME (fco
) = make_conv_op_name (return_type
);
9215 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9217 result
= DECL_RESULT (fco
);
9218 if (result
== NULL_TREE
)
9220 if (TREE_TYPE (result
) == return_type
)
9223 if (!processing_template_decl
&& !VOID_TYPE_P (return_type
)
9224 && !complete_type_or_else (return_type
, NULL_TREE
))
9227 /* We already have a DECL_RESULT from start_preparsed_function.
9228 Now we need to redo the work it and allocate_struct_function
9229 did to reflect the new type. */
9230 gcc_assert (current_function_decl
== fco
);
9231 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9232 TYPE_MAIN_VARIANT (return_type
));
9233 DECL_ARTIFICIAL (result
) = 1;
9234 DECL_IGNORED_P (result
) = 1;
9235 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9238 DECL_RESULT (fco
) = result
;
9240 if (!processing_template_decl
)
9242 bool aggr
= aggregate_value_p (result
, fco
);
9243 #ifdef PCC_STATIC_STRUCT_RETURN
9244 cfun
->returns_pcc_struct
= aggr
;
9246 cfun
->returns_struct
= aggr
;
9251 /* DECL is a local variable or parameter from the surrounding scope of a
9252 lambda-expression. Returns the decltype for a use of the capture field
9253 for DECL even if it hasn't been captured yet. */
9256 capture_decltype (tree decl
)
9258 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9259 /* FIXME do lookup instead of list walk? */
9260 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9264 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9266 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9269 error ("%qD is not captured", decl
);
9270 return error_mark_node
;
9273 type
= TREE_TYPE (decl
);
9274 if (TREE_CODE (type
) == REFERENCE_TYPE
9275 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9276 type
= TREE_TYPE (type
);
9279 case CPLD_REFERENCE
:
9280 type
= TREE_TYPE (decl
);
9281 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9282 type
= build_reference_type (TREE_TYPE (decl
));
9289 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9291 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9292 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9294 type
= build_reference_type (type
);
9299 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9300 this is a right unary fold. Otherwise it is a left unary fold. */
9303 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9305 // Build a pack expansion (assuming expr has pack type).
9306 if (!uses_parameter_packs (expr
))
9308 error_at (location_of (expr
), "operand of fold expression has no "
9309 "unexpanded parameter packs");
9310 return error_mark_node
;
9312 tree pack
= make_pack_expansion (expr
);
9314 // Build the fold expression.
9315 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9316 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
);
9317 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9322 finish_left_unary_fold_expr (tree expr
, int op
)
9324 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9328 finish_right_unary_fold_expr (tree expr
, int op
)
9330 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9333 /* Build a binary fold expression over EXPR1 and EXPR2. The
9334 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9335 has an unexpanded parameter pack). */
9338 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9340 pack
= make_pack_expansion (pack
);
9341 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9342 tree fold
= build_min_nt_loc (UNKNOWN_LOCATION
, dir
, code
, pack
, init
);
9343 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9348 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9350 // Determine which expr has an unexpanded parameter pack and
9351 // set the pack and initial term.
9352 bool pack1
= uses_parameter_packs (expr1
);
9353 bool pack2
= uses_parameter_packs (expr2
);
9354 if (pack1
&& !pack2
)
9355 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9356 else if (pack2
&& !pack1
)
9357 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9361 error ("both arguments in binary fold have unexpanded parameter packs");
9363 error ("no unexpanded parameter packs in binary fold");
9365 return error_mark_node
;
9368 /* Finish __builtin_launder (arg). */
9371 finish_builtin_launder (location_t loc
, tree arg
, tsubst_flags_t complain
)
9373 tree orig_arg
= arg
;
9374 if (!type_dependent_expression_p (arg
))
9375 arg
= decay_conversion (arg
, complain
);
9376 if (error_operand_p (arg
))
9377 return error_mark_node
;
9378 if (!type_dependent_expression_p (arg
)
9379 && TREE_CODE (TREE_TYPE (arg
)) != POINTER_TYPE
)
9381 error_at (loc
, "non-pointer argument to %<__builtin_launder%>");
9382 return error_mark_node
;
9384 if (processing_template_decl
)
9386 return build_call_expr_internal_loc (loc
, IFN_LAUNDER
,
9387 TREE_TYPE (arg
), 1, arg
);
9390 #include "gt-cp-semantics.h"