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-2016 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"
43 #include "gomp-constants.h"
45 /* There routines provide a modular interface to perform many parsing
46 operations. They may therefore be used during actual parsing, or
47 during template instantiation, which may be regarded as a
48 degenerate form of parsing. */
50 static tree
maybe_convert_cond (tree
);
51 static tree
finalize_nrv_r (tree
*, int *, void *);
52 static tree
capture_decltype (tree
);
54 /* Used for OpenMP non-static data member privatization. */
56 static hash_map
<tree
, tree
> *omp_private_member_map
;
57 static vec
<tree
> omp_private_member_vec
;
58 static bool omp_private_member_ignore_next
;
61 /* Deferred Access Checking Overview
62 ---------------------------------
64 Most C++ expressions and declarations require access checking
65 to be performed during parsing. However, in several cases,
66 this has to be treated differently.
68 For member declarations, access checking has to be deferred
69 until more information about the declaration is known. For
81 When we are parsing the function return type `A::X', we don't
82 really know if this is allowed until we parse the function name.
84 Furthermore, some contexts require that access checking is
85 never performed at all. These include class heads, and template
88 Typical use of access checking functions is described here:
90 1. When we enter a context that requires certain access checking
91 mode, the function `push_deferring_access_checks' is called with
92 DEFERRING argument specifying the desired mode. Access checking
93 may be performed immediately (dk_no_deferred), deferred
94 (dk_deferred), or not performed (dk_no_check).
96 2. When a declaration such as a type, or a variable, is encountered,
97 the function `perform_or_defer_access_check' is called. It
98 maintains a vector of all deferred checks.
100 3. The global `current_class_type' or `current_function_decl' is then
101 setup by the parser. `enforce_access' relies on these information
104 4. Upon exiting the context mentioned in step 1,
105 `perform_deferred_access_checks' is called to check all declaration
106 stored in the vector. `pop_deferring_access_checks' is then
107 called to restore the previous access checking mode.
109 In case of parsing error, we simply call `pop_deferring_access_checks'
110 without `perform_deferred_access_checks'. */
112 struct GTY(()) deferred_access
{
113 /* A vector representing name-lookups for which we have deferred
114 checking access controls. We cannot check the accessibility of
115 names used in a decl-specifier-seq until we know what is being
116 declared because code like:
123 A::B* A::f() { return 0; }
125 is valid, even though `A::B' is not generally accessible. */
126 vec
<deferred_access_check
, va_gc
> * GTY(()) deferred_access_checks
;
128 /* The current mode of access checks. */
129 enum deferring_kind deferring_access_checks_kind
;
133 /* Data for deferred access checking. */
134 static GTY(()) vec
<deferred_access
, va_gc
> *deferred_access_stack
;
135 static GTY(()) unsigned deferred_access_no_check
;
137 /* Save the current deferred access states and start deferred
138 access checking iff DEFER_P is true. */
141 push_deferring_access_checks (deferring_kind deferring
)
143 /* For context like template instantiation, access checking
144 disabling applies to all nested context. */
145 if (deferred_access_no_check
|| deferring
== dk_no_check
)
146 deferred_access_no_check
++;
149 deferred_access e
= {NULL
, deferring
};
150 vec_safe_push (deferred_access_stack
, e
);
154 /* Save the current deferred access states and start deferred access
155 checking, continuing the set of deferred checks in CHECKS. */
158 reopen_deferring_access_checks (vec
<deferred_access_check
, va_gc
> * checks
)
160 push_deferring_access_checks (dk_deferred
);
161 if (!deferred_access_no_check
)
162 deferred_access_stack
->last().deferred_access_checks
= checks
;
165 /* Resume deferring access checks again after we stopped doing
169 resume_deferring_access_checks (void)
171 if (!deferred_access_no_check
)
172 deferred_access_stack
->last().deferring_access_checks_kind
= dk_deferred
;
175 /* Stop deferring access checks. */
178 stop_deferring_access_checks (void)
180 if (!deferred_access_no_check
)
181 deferred_access_stack
->last().deferring_access_checks_kind
= dk_no_deferred
;
184 /* Discard the current deferred access checks and restore the
188 pop_deferring_access_checks (void)
190 if (deferred_access_no_check
)
191 deferred_access_no_check
--;
193 deferred_access_stack
->pop ();
196 /* Returns a TREE_LIST representing the deferred checks.
197 The TREE_PURPOSE of each node is the type through which the
198 access occurred; the TREE_VALUE is the declaration named.
201 vec
<deferred_access_check
, va_gc
> *
202 get_deferred_access_checks (void)
204 if (deferred_access_no_check
)
207 return (deferred_access_stack
->last().deferred_access_checks
);
210 /* Take current deferred checks and combine with the
211 previous states if we also defer checks previously.
212 Otherwise perform checks now. */
215 pop_to_parent_deferring_access_checks (void)
217 if (deferred_access_no_check
)
218 deferred_access_no_check
--;
221 vec
<deferred_access_check
, va_gc
> *checks
;
222 deferred_access
*ptr
;
224 checks
= (deferred_access_stack
->last ().deferred_access_checks
);
226 deferred_access_stack
->pop ();
227 ptr
= &deferred_access_stack
->last ();
228 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
231 perform_access_checks (checks
, tf_warning_or_error
);
235 /* Merge with parent. */
237 deferred_access_check
*chk
, *probe
;
239 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
241 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, j
, probe
)
243 if (probe
->binfo
== chk
->binfo
&&
244 probe
->decl
== chk
->decl
&&
245 probe
->diag_decl
== chk
->diag_decl
)
248 /* Insert into parent's checks. */
249 vec_safe_push (ptr
->deferred_access_checks
, *chk
);
256 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
257 is the BINFO indicating the qualifying scope used to access the
258 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
259 or we aren't in SFINAE context or all the checks succeed return TRUE,
263 perform_access_checks (vec
<deferred_access_check
, va_gc
> *checks
,
264 tsubst_flags_t complain
)
267 deferred_access_check
*chk
;
268 location_t loc
= input_location
;
274 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
276 input_location
= chk
->loc
;
277 ok
&= enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
, complain
);
280 input_location
= loc
;
281 return (complain
& tf_error
) ? true : ok
;
284 /* Perform the deferred access checks.
286 After performing the checks, we still have to keep the list
287 `deferred_access_stack->deferred_access_checks' since we may want
288 to check access for them again later in a different context.
295 A::X A::a, x; // No error for `A::a', error for `x'
297 We have to perform deferred access of `A::X', first with `A::a',
298 next with `x'. Return value like perform_access_checks above. */
301 perform_deferred_access_checks (tsubst_flags_t complain
)
303 return perform_access_checks (get_deferred_access_checks (), complain
);
306 /* Defer checking the accessibility of DECL, when looked up in
307 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
308 Return value like perform_access_checks above. */
311 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
,
312 tsubst_flags_t complain
)
315 deferred_access
*ptr
;
316 deferred_access_check
*chk
;
319 /* Exit if we are in a context that no access checking is performed.
321 if (deferred_access_no_check
)
324 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
326 ptr
= &deferred_access_stack
->last ();
328 /* If we are not supposed to defer access checks, just check now. */
329 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
331 bool ok
= enforce_access (binfo
, decl
, diag_decl
, complain
);
332 return (complain
& tf_error
) ? true : ok
;
335 /* See if we are already going to perform this check. */
336 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, i
, chk
)
338 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
339 chk
->diag_decl
== diag_decl
)
344 /* If not, record the check. */
345 deferred_access_check new_access
= {binfo
, decl
, diag_decl
, input_location
};
346 vec_safe_push (ptr
->deferred_access_checks
, new_access
);
351 /* Returns nonzero if the current statement is a full expression,
352 i.e. temporaries created during that statement should be destroyed
353 at the end of the statement. */
356 stmts_are_full_exprs_p (void)
358 return current_stmt_tree ()->stmts_are_full_exprs_p
;
361 /* T is a statement. Add it to the statement-tree. This is the C++
362 version. The C/ObjC frontends have a slightly different version of
368 enum tree_code code
= TREE_CODE (t
);
370 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
372 if (!EXPR_HAS_LOCATION (t
))
373 SET_EXPR_LOCATION (t
, input_location
);
375 /* When we expand a statement-tree, we must know whether or not the
376 statements are full-expressions. We record that fact here. */
377 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
380 if (code
== LABEL_EXPR
|| code
== CASE_LABEL_EXPR
)
381 STATEMENT_LIST_HAS_LABEL (cur_stmt_list
) = 1;
383 /* Add T to the statement-tree. Non-side-effect statements need to be
384 recorded during statement expressions. */
385 gcc_checking_assert (!stmt_list_stack
->is_empty ());
386 append_to_statement_list_force (t
, &cur_stmt_list
);
391 /* Returns the stmt_tree to which statements are currently being added. */
394 current_stmt_tree (void)
397 ? &cfun
->language
->base
.x_stmt_tree
398 : &scope_chain
->x_stmt_tree
);
401 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
404 maybe_cleanup_point_expr (tree expr
)
406 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
407 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
411 /* Like maybe_cleanup_point_expr except have the type of the new expression be
412 void so we don't need to create a temporary variable to hold the inner
413 expression. The reason why we do this is because the original type might be
414 an aggregate and we cannot create a temporary variable for that type. */
417 maybe_cleanup_point_expr_void (tree expr
)
419 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
420 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
426 /* Create a declaration statement for the declaration given by the DECL. */
429 add_decl_expr (tree decl
)
431 tree r
= build_stmt (DECL_SOURCE_LOCATION (decl
), DECL_EXPR
, decl
);
432 if (DECL_INITIAL (decl
)
433 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
434 r
= maybe_cleanup_point_expr_void (r
);
438 /* Finish a scope. */
441 do_poplevel (tree stmt_list
)
445 if (stmts_are_full_exprs_p ())
446 block
= poplevel (kept_level_p (), 1, 0);
448 stmt_list
= pop_stmt_list (stmt_list
);
450 if (!processing_template_decl
)
452 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
453 /* ??? See c_end_compound_stmt re statement expressions. */
459 /* Begin a new scope. */
462 do_pushlevel (scope_kind sk
)
464 tree ret
= push_stmt_list ();
465 if (stmts_are_full_exprs_p ())
466 begin_scope (sk
, NULL
);
470 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
471 when the current scope is exited. EH_ONLY is true when this is not
472 meant to apply to normal control flow transfer. */
475 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
477 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
478 CLEANUP_EH_ONLY (stmt
) = eh_only
;
480 CLEANUP_BODY (stmt
) = push_stmt_list ();
483 /* Simple infinite loop tracking for -Wreturn-type. We keep a stack of all
484 the current loops, represented by 'NULL_TREE' if we've seen a possible
485 exit, and 'error_mark_node' if not. This is currently used only to
486 suppress the warning about a function with no return statements, and
487 therefore we don't bother noting returns as possible exits. We also
488 don't bother with gotos. */
491 begin_maybe_infinite_loop (tree cond
)
493 /* Only track this while parsing a function, not during instantiation. */
494 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
495 && !processing_template_decl
))
497 bool maybe_infinite
= true;
500 cond
= fold_non_dependent_expr (cond
);
501 maybe_infinite
= integer_nonzerop (cond
);
503 vec_safe_push (cp_function_chain
->infinite_loops
,
504 maybe_infinite
? error_mark_node
: NULL_TREE
);
508 /* A break is a possible exit for the current loop. */
511 break_maybe_infinite_loop (void)
515 cp_function_chain
->infinite_loops
->last() = NULL_TREE
;
518 /* If we reach the end of the loop without seeing a possible exit, we have
522 end_maybe_infinite_loop (tree cond
)
524 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
525 && !processing_template_decl
))
527 tree current
= cp_function_chain
->infinite_loops
->pop();
528 if (current
!= NULL_TREE
)
530 cond
= fold_non_dependent_expr (cond
);
531 if (integer_nonzerop (cond
))
532 current_function_infinite_loop
= 1;
537 /* Begin a conditional that might contain a declaration. When generating
538 normal code, we want the declaration to appear before the statement
539 containing the conditional. When generating template code, we want the
540 conditional to be rendered as the raw DECL_EXPR. */
543 begin_cond (tree
*cond_p
)
545 if (processing_template_decl
)
546 *cond_p
= push_stmt_list ();
549 /* Finish such a conditional. */
552 finish_cond (tree
*cond_p
, tree expr
)
554 if (processing_template_decl
)
556 tree cond
= pop_stmt_list (*cond_p
);
558 if (expr
== NULL_TREE
)
559 /* Empty condition in 'for'. */
560 gcc_assert (empty_expr_stmt_p (cond
));
561 else if (check_for_bare_parameter_packs (expr
))
562 expr
= error_mark_node
;
563 else if (!empty_expr_stmt_p (cond
))
564 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), cond
, expr
);
569 /* If *COND_P specifies a conditional with a declaration, transform the
572 for (; A x = 42;) { }
574 while (true) { A x = 42; if (!x) break; }
575 for (;;) { A x = 42; if (!x) break; }
576 The statement list for BODY will be empty if the conditional did
577 not declare anything. */
580 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
584 if (!TREE_SIDE_EFFECTS (body
))
588 *cond_p
= boolean_true_node
;
590 if_stmt
= begin_if_stmt ();
591 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
592 finish_if_stmt_cond (cond
, if_stmt
);
593 finish_break_stmt ();
594 finish_then_clause (if_stmt
);
595 finish_if_stmt (if_stmt
);
598 /* Finish a goto-statement. */
601 finish_goto_stmt (tree destination
)
603 if (identifier_p (destination
))
604 destination
= lookup_label (destination
);
606 /* We warn about unused labels with -Wunused. That means we have to
607 mark the used labels as used. */
608 if (TREE_CODE (destination
) == LABEL_DECL
)
609 TREE_USED (destination
) = 1;
612 if (check_no_cilk (destination
,
613 "Cilk array notation cannot be used as a computed goto expression",
614 "%<_Cilk_spawn%> statement cannot be used as a computed goto expression"))
615 destination
= error_mark_node
;
616 destination
= mark_rvalue_use (destination
);
617 if (!processing_template_decl
)
619 destination
= cp_convert (ptr_type_node
, destination
,
620 tf_warning_or_error
);
621 if (error_operand_p (destination
))
624 = fold_build_cleanup_point_expr (TREE_TYPE (destination
),
629 check_goto (destination
);
631 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
634 /* COND is the condition-expression for an if, while, etc.,
635 statement. Convert it to a boolean value, if appropriate.
636 In addition, verify sequence points if -Wsequence-point is enabled. */
639 maybe_convert_cond (tree cond
)
641 /* Empty conditions remain empty. */
645 /* Wait until we instantiate templates before doing conversion. */
646 if (processing_template_decl
)
649 if (warn_sequence_point
)
650 verify_sequence_points (cond
);
652 /* Do the conversion. */
653 cond
= convert_from_reference (cond
);
655 if (TREE_CODE (cond
) == MODIFY_EXPR
656 && !TREE_NO_WARNING (cond
)
659 warning (OPT_Wparentheses
,
660 "suggest parentheses around assignment used as truth value");
661 TREE_NO_WARNING (cond
) = 1;
664 return condition_conversion (cond
);
667 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
670 finish_expr_stmt (tree expr
)
674 if (expr
!= NULL_TREE
)
676 /* If we ran into a problem, make sure we complained. */
677 gcc_assert (expr
!= error_mark_node
|| seen_error ());
679 if (!processing_template_decl
)
681 if (warn_sequence_point
)
682 verify_sequence_points (expr
);
683 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
685 else if (!type_dependent_expression_p (expr
))
686 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
687 tf_warning_or_error
);
689 if (check_for_bare_parameter_packs (expr
))
690 expr
= error_mark_node
;
692 /* Simplification of inner statement expressions, compound exprs,
693 etc can result in us already having an EXPR_STMT. */
694 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
696 if (TREE_CODE (expr
) != EXPR_STMT
)
697 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
698 expr
= maybe_cleanup_point_expr_void (expr
);
708 /* Begin an if-statement. Returns a newly created IF_STMT if
715 scope
= do_pushlevel (sk_cond
);
716 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
717 NULL_TREE
, NULL_TREE
, scope
);
718 begin_cond (&IF_COND (r
));
722 /* Process the COND of an if-statement, which may be given by
726 finish_if_stmt_cond (tree cond
, tree if_stmt
)
728 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
730 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
733 /* Finish the then-clause of an if-statement, which may be given by
737 finish_then_clause (tree if_stmt
)
739 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
743 /* Begin the else-clause of an if-statement. */
746 begin_else_clause (tree if_stmt
)
748 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
751 /* Finish the else-clause of an if-statement, which may be given by
755 finish_else_clause (tree if_stmt
)
757 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
760 /* Finish an if-statement. */
763 finish_if_stmt (tree if_stmt
)
765 tree scope
= IF_SCOPE (if_stmt
);
766 IF_SCOPE (if_stmt
) = NULL
;
767 add_stmt (do_poplevel (scope
));
770 /* Begin a while-statement. Returns a newly created WHILE_STMT if
774 begin_while_stmt (void)
777 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
779 WHILE_BODY (r
) = do_pushlevel (sk_block
);
780 begin_cond (&WHILE_COND (r
));
784 /* Process the COND of a while-statement, which may be given by
788 finish_while_stmt_cond (tree cond
, tree while_stmt
, bool ivdep
)
790 if (check_no_cilk (cond
,
791 "Cilk array notation cannot be used as a condition for while statement",
792 "%<_Cilk_spawn%> statement cannot be used as a condition for while statement"))
793 cond
= error_mark_node
;
794 cond
= maybe_convert_cond (cond
);
795 finish_cond (&WHILE_COND (while_stmt
), cond
);
796 begin_maybe_infinite_loop (cond
);
797 if (ivdep
&& cond
!= error_mark_node
)
798 WHILE_COND (while_stmt
) = build2 (ANNOTATE_EXPR
,
799 TREE_TYPE (WHILE_COND (while_stmt
)),
800 WHILE_COND (while_stmt
),
801 build_int_cst (integer_type_node
,
802 annot_expr_ivdep_kind
));
803 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
806 /* Finish a while-statement, which may be given by WHILE_STMT. */
809 finish_while_stmt (tree while_stmt
)
811 end_maybe_infinite_loop (boolean_true_node
);
812 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
815 /* Begin a do-statement. Returns a newly created DO_STMT if
821 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
822 begin_maybe_infinite_loop (boolean_true_node
);
824 DO_BODY (r
) = push_stmt_list ();
828 /* Finish the body of a do-statement, which may be given by DO_STMT. */
831 finish_do_body (tree do_stmt
)
833 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
835 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
836 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
838 if (IS_EMPTY_STMT (body
))
839 warning (OPT_Wempty_body
,
840 "suggest explicit braces around empty body in %<do%> statement");
843 /* Finish a do-statement, which may be given by DO_STMT, and whose
844 COND is as indicated. */
847 finish_do_stmt (tree cond
, tree do_stmt
, bool ivdep
)
849 if (check_no_cilk (cond
,
850 "Cilk array notation cannot be used as a condition for a do-while statement",
851 "%<_Cilk_spawn%> statement cannot be used as a condition for a do-while statement"))
852 cond
= error_mark_node
;
853 cond
= maybe_convert_cond (cond
);
854 end_maybe_infinite_loop (cond
);
855 if (ivdep
&& cond
!= error_mark_node
)
856 cond
= build2 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
857 build_int_cst (integer_type_node
, annot_expr_ivdep_kind
));
858 DO_COND (do_stmt
) = cond
;
861 /* Finish a return-statement. The EXPRESSION returned, if any, is as
865 finish_return_stmt (tree expr
)
870 expr
= check_return_expr (expr
, &no_warning
);
872 if (error_operand_p (expr
)
873 || (flag_openmp
&& !check_omp_return ()))
875 /* Suppress -Wreturn-type for this function. */
876 if (warn_return_type
)
877 TREE_NO_WARNING (current_function_decl
) = true;
878 return error_mark_node
;
881 if (!processing_template_decl
)
883 if (warn_sequence_point
)
884 verify_sequence_points (expr
);
886 if (DECL_DESTRUCTOR_P (current_function_decl
)
887 || (DECL_CONSTRUCTOR_P (current_function_decl
)
888 && targetm
.cxx
.cdtor_returns_this ()))
890 /* Similarly, all destructors must run destructors for
891 base-classes before returning. So, all returns in a
892 destructor get sent to the DTOR_LABEL; finish_function emits
893 code to return a value there. */
894 return finish_goto_stmt (cdtor_label
);
898 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
899 TREE_NO_WARNING (r
) |= no_warning
;
900 r
= maybe_cleanup_point_expr_void (r
);
906 /* Begin the scope of a for-statement or a range-for-statement.
907 Both the returned trees are to be used in a call to
908 begin_for_stmt or begin_range_for_stmt. */
911 begin_for_scope (tree
*init
)
913 tree scope
= NULL_TREE
;
914 if (flag_new_for_scope
> 0)
915 scope
= do_pushlevel (sk_for
);
917 if (processing_template_decl
)
918 *init
= push_stmt_list ();
925 /* Begin a for-statement. Returns a new FOR_STMT.
926 SCOPE and INIT should be the return of begin_for_scope,
930 begin_for_stmt (tree scope
, tree init
)
934 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
935 NULL_TREE
, NULL_TREE
, NULL_TREE
);
937 if (scope
== NULL_TREE
)
939 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
941 scope
= begin_for_scope (&init
);
943 FOR_INIT_STMT (r
) = init
;
944 FOR_SCOPE (r
) = scope
;
949 /* Finish the for-init-statement of a for-statement, which may be
950 given by FOR_STMT. */
953 finish_for_init_stmt (tree for_stmt
)
955 if (processing_template_decl
)
956 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
958 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
959 begin_cond (&FOR_COND (for_stmt
));
962 /* Finish the COND of a for-statement, which may be given by
966 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
)
968 if (check_no_cilk (cond
,
969 "Cilk array notation cannot be used in a condition for a for-loop",
970 "%<_Cilk_spawn%> statement cannot be used in a condition for a for-loop"))
971 cond
= error_mark_node
;
972 cond
= maybe_convert_cond (cond
);
973 finish_cond (&FOR_COND (for_stmt
), cond
);
974 begin_maybe_infinite_loop (cond
);
975 if (ivdep
&& cond
!= error_mark_node
)
976 FOR_COND (for_stmt
) = build2 (ANNOTATE_EXPR
,
977 TREE_TYPE (FOR_COND (for_stmt
)),
979 build_int_cst (integer_type_node
,
980 annot_expr_ivdep_kind
));
981 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
984 /* Finish the increment-EXPRESSION in a for-statement, which may be
985 given by FOR_STMT. */
988 finish_for_expr (tree expr
, tree for_stmt
)
992 /* If EXPR is an overloaded function, issue an error; there is no
993 context available to use to perform overload resolution. */
994 if (type_unknown_p (expr
))
996 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
997 expr
= error_mark_node
;
999 if (!processing_template_decl
)
1001 if (warn_sequence_point
)
1002 verify_sequence_points (expr
);
1003 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1004 tf_warning_or_error
);
1006 else if (!type_dependent_expression_p (expr
))
1007 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1008 tf_warning_or_error
);
1009 expr
= maybe_cleanup_point_expr_void (expr
);
1010 if (check_for_bare_parameter_packs (expr
))
1011 expr
= error_mark_node
;
1012 FOR_EXPR (for_stmt
) = expr
;
1015 /* Finish the body of a for-statement, which may be given by
1016 FOR_STMT. The increment-EXPR for the loop must be
1018 It can also finish RANGE_FOR_STMT. */
1021 finish_for_stmt (tree for_stmt
)
1023 end_maybe_infinite_loop (boolean_true_node
);
1025 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1026 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1028 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1030 /* Pop the scope for the body of the loop. */
1031 if (flag_new_for_scope
> 0)
1034 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1035 ? &RANGE_FOR_SCOPE (for_stmt
)
1036 : &FOR_SCOPE (for_stmt
));
1039 add_stmt (do_poplevel (scope
));
1043 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1044 SCOPE and INIT should be the return of begin_for_scope,
1046 To finish it call finish_for_stmt(). */
1049 begin_range_for_stmt (tree scope
, tree init
)
1053 begin_maybe_infinite_loop (boolean_false_node
);
1055 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
1056 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1058 if (scope
== NULL_TREE
)
1060 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
1062 scope
= begin_for_scope (&init
);
1065 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
1068 pop_stmt_list (init
);
1069 RANGE_FOR_SCOPE (r
) = scope
;
1074 /* Finish the head of a range-based for statement, which may
1075 be given by RANGE_FOR_STMT. DECL must be the declaration
1076 and EXPR must be the loop expression. */
1079 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
1081 RANGE_FOR_DECL (range_for_stmt
) = decl
;
1082 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
1083 add_stmt (range_for_stmt
);
1084 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
1087 /* Finish a break-statement. */
1090 finish_break_stmt (void)
1092 /* In switch statements break is sometimes stylistically used after
1093 a return statement. This can lead to spurious warnings about
1094 control reaching the end of a non-void function when it is
1095 inlined. Note that we are calling block_may_fallthru with
1096 language specific tree nodes; this works because
1097 block_may_fallthru returns true when given something it does not
1099 if (!block_may_fallthru (cur_stmt_list
))
1101 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1104 /* Finish a continue-statement. */
1107 finish_continue_stmt (void)
1109 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1112 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1116 begin_switch_stmt (void)
1120 scope
= do_pushlevel (sk_cond
);
1121 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1123 begin_cond (&SWITCH_STMT_COND (r
));
1128 /* Finish the cond of a switch-statement. */
1131 finish_switch_cond (tree cond
, tree switch_stmt
)
1133 tree orig_type
= NULL
;
1135 if (check_no_cilk (cond
,
1136 "Cilk array notation cannot be used as a condition for switch statement",
1137 "%<_Cilk_spawn%> statement cannot be used as a condition for switch statement"))
1138 cond
= error_mark_node
;
1140 if (!processing_template_decl
)
1142 /* Convert the condition to an integer or enumeration type. */
1143 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1144 if (cond
== NULL_TREE
)
1146 error ("switch quantity not an integer");
1147 cond
= error_mark_node
;
1149 /* We want unlowered type here to handle enum bit-fields. */
1150 orig_type
= unlowered_expr_type (cond
);
1151 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1152 orig_type
= TREE_TYPE (cond
);
1153 if (cond
!= error_mark_node
)
1157 Integral promotions are performed. */
1158 cond
= perform_integral_promotions (cond
);
1159 cond
= maybe_cleanup_point_expr (cond
);
1162 if (check_for_bare_parameter_packs (cond
))
1163 cond
= error_mark_node
;
1164 else if (!processing_template_decl
&& warn_sequence_point
)
1165 verify_sequence_points (cond
);
1167 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1168 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1169 add_stmt (switch_stmt
);
1170 push_switch (switch_stmt
);
1171 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1174 /* Finish the body of a switch-statement, which may be given by
1175 SWITCH_STMT. The COND to switch on is indicated. */
1178 finish_switch_stmt (tree switch_stmt
)
1182 SWITCH_STMT_BODY (switch_stmt
) =
1183 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1186 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1187 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1188 add_stmt (do_poplevel (scope
));
1191 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1195 begin_try_block (void)
1197 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1199 TRY_STMTS (r
) = push_stmt_list ();
1203 /* Likewise, for a function-try-block. The block returned in
1204 *COMPOUND_STMT is an artificial outer scope, containing the
1205 function-try-block. */
1208 begin_function_try_block (tree
*compound_stmt
)
1211 /* This outer scope does not exist in the C++ standard, but we need
1212 a place to put __FUNCTION__ and similar variables. */
1213 *compound_stmt
= begin_compound_stmt (0);
1214 r
= begin_try_block ();
1215 FN_TRY_BLOCK_P (r
) = 1;
1219 /* Finish a try-block, which may be given by TRY_BLOCK. */
1222 finish_try_block (tree try_block
)
1224 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1225 TRY_HANDLERS (try_block
) = push_stmt_list ();
1228 /* Finish the body of a cleanup try-block, which may be given by
1232 finish_cleanup_try_block (tree try_block
)
1234 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1237 /* Finish an implicitly generated try-block, with a cleanup is given
1241 finish_cleanup (tree cleanup
, tree try_block
)
1243 TRY_HANDLERS (try_block
) = cleanup
;
1244 CLEANUP_P (try_block
) = 1;
1247 /* Likewise, for a function-try-block. */
1250 finish_function_try_block (tree try_block
)
1252 finish_try_block (try_block
);
1253 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1254 the try block, but moving it inside. */
1255 in_function_try_handler
= 1;
1258 /* Finish a handler-sequence for a try-block, which may be given by
1262 finish_handler_sequence (tree try_block
)
1264 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1265 check_handlers (TRY_HANDLERS (try_block
));
1268 /* Finish the handler-seq for a function-try-block, given by
1269 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1270 begin_function_try_block. */
1273 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1275 in_function_try_handler
= 0;
1276 finish_handler_sequence (try_block
);
1277 finish_compound_stmt (compound_stmt
);
1280 /* Begin a handler. Returns a HANDLER if appropriate. */
1283 begin_handler (void)
1287 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1290 /* Create a binding level for the eh_info and the exception object
1292 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1297 /* Finish the handler-parameters for a handler, which may be given by
1298 HANDLER. DECL is the declaration for the catch parameter, or NULL
1299 if this is a `catch (...)' clause. */
1302 finish_handler_parms (tree decl
, tree handler
)
1304 tree type
= NULL_TREE
;
1305 if (processing_template_decl
)
1309 decl
= pushdecl (decl
);
1310 decl
= push_template_decl (decl
);
1311 HANDLER_PARMS (handler
) = decl
;
1312 type
= TREE_TYPE (decl
);
1316 type
= expand_start_catch_block (decl
);
1317 HANDLER_TYPE (handler
) = type
;
1320 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1321 the return value from the matching call to finish_handler_parms. */
1324 finish_handler (tree handler
)
1326 if (!processing_template_decl
)
1327 expand_end_catch_block ();
1328 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1331 /* Begin a compound statement. FLAGS contains some bits that control the
1332 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1333 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1334 block of a function. If BCS_TRY_BLOCK is set, this is the block
1335 created on behalf of a TRY statement. Returns a token to be passed to
1336 finish_compound_stmt. */
1339 begin_compound_stmt (unsigned int flags
)
1343 if (flags
& BCS_NO_SCOPE
)
1345 r
= push_stmt_list ();
1346 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1348 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1349 But, if it's a statement-expression with a scopeless block, there's
1350 nothing to keep, and we don't want to accidentally keep a block
1351 *inside* the scopeless block. */
1352 keep_next_level (false);
1356 scope_kind sk
= sk_block
;
1357 if (flags
& BCS_TRY_BLOCK
)
1359 else if (flags
& BCS_TRANSACTION
)
1360 sk
= sk_transaction
;
1361 r
= do_pushlevel (sk
);
1364 /* When processing a template, we need to remember where the braces were,
1365 so that we can set up identical scopes when instantiating the template
1366 later. BIND_EXPR is a handy candidate for this.
1367 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1368 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1369 processing templates. */
1370 if (processing_template_decl
)
1372 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1373 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1374 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1375 TREE_SIDE_EFFECTS (r
) = 1;
1381 /* Finish a compound-statement, which is given by STMT. */
1384 finish_compound_stmt (tree stmt
)
1386 if (TREE_CODE (stmt
) == BIND_EXPR
)
1388 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1389 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1390 discard the BIND_EXPR so it can be merged with the containing
1392 if (TREE_CODE (body
) == STATEMENT_LIST
1393 && STATEMENT_LIST_HEAD (body
) == NULL
1394 && !BIND_EXPR_BODY_BLOCK (stmt
)
1395 && !BIND_EXPR_TRY_BLOCK (stmt
))
1398 BIND_EXPR_BODY (stmt
) = body
;
1400 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1401 stmt
= pop_stmt_list (stmt
);
1404 /* Destroy any ObjC "super" receivers that may have been
1406 objc_clear_super_receiver ();
1408 stmt
= do_poplevel (stmt
);
1411 /* ??? See c_end_compound_stmt wrt statement expressions. */
1415 /* Finish an asm-statement, whose components are a STRING, some
1416 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1417 LABELS. Also note whether the asm-statement should be
1418 considered volatile. */
1421 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1422 tree input_operands
, tree clobbers
, tree labels
)
1426 int ninputs
= list_length (input_operands
);
1427 int noutputs
= list_length (output_operands
);
1429 if (!processing_template_decl
)
1431 const char *constraint
;
1432 const char **oconstraints
;
1433 bool allows_mem
, allows_reg
, is_inout
;
1437 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1439 string
= resolve_asm_operand_names (string
, output_operands
,
1440 input_operands
, labels
);
1442 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1444 operand
= TREE_VALUE (t
);
1446 /* ??? Really, this should not be here. Users should be using a
1447 proper lvalue, dammit. But there's a long history of using
1448 casts in the output operands. In cases like longlong.h, this
1449 becomes a primitive form of typechecking -- if the cast can be
1450 removed, then the output operand had a type of the proper width;
1451 otherwise we'll get an error. Gross, but ... */
1452 STRIP_NOPS (operand
);
1454 operand
= mark_lvalue_use (operand
);
1456 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1457 operand
= error_mark_node
;
1459 if (operand
!= error_mark_node
1460 && (TREE_READONLY (operand
)
1461 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1462 /* Functions are not modifiable, even though they are
1464 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1465 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1466 /* If it's an aggregate and any field is const, then it is
1467 effectively const. */
1468 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1469 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1470 cxx_readonly_error (operand
, lv_asm
);
1472 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1473 oconstraints
[i
] = constraint
;
1475 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1476 &allows_mem
, &allows_reg
, &is_inout
))
1478 /* If the operand is going to end up in memory,
1479 mark it addressable. */
1480 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1481 operand
= error_mark_node
;
1484 operand
= error_mark_node
;
1486 TREE_VALUE (t
) = operand
;
1489 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1491 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1492 bool constraint_parsed
1493 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1494 oconstraints
, &allows_mem
, &allows_reg
);
1495 /* If the operand is going to end up in memory, don't call
1496 decay_conversion. */
1497 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1498 operand
= mark_lvalue_use (TREE_VALUE (t
));
1500 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1502 /* If the type of the operand hasn't been determined (e.g.,
1503 because it involves an overloaded function), then issue
1504 an error message. There's no context available to
1505 resolve the overloading. */
1506 if (TREE_TYPE (operand
) == unknown_type_node
)
1508 error ("type of asm operand %qE could not be determined",
1510 operand
= error_mark_node
;
1513 if (constraint_parsed
)
1515 /* If the operand is going to end up in memory,
1516 mark it addressable. */
1517 if (!allows_reg
&& allows_mem
)
1519 /* Strip the nops as we allow this case. FIXME, this really
1520 should be rejected or made deprecated. */
1521 STRIP_NOPS (operand
);
1522 if (!cxx_mark_addressable (operand
))
1523 operand
= error_mark_node
;
1525 else if (!allows_reg
&& !allows_mem
)
1527 /* If constraint allows neither register nor memory,
1528 try harder to get a constant. */
1529 tree constop
= maybe_constant_value (operand
);
1530 if (TREE_CONSTANT (constop
))
1535 operand
= error_mark_node
;
1537 TREE_VALUE (t
) = operand
;
1541 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1542 output_operands
, input_operands
,
1544 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1545 r
= maybe_cleanup_point_expr_void (r
);
1546 return add_stmt (r
);
1549 /* Finish a label with the indicated NAME. Returns the new label. */
1552 finish_label_stmt (tree name
)
1554 tree decl
= define_label (input_location
, name
);
1556 if (decl
== error_mark_node
)
1557 return error_mark_node
;
1559 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1564 /* Finish a series of declarations for local labels. G++ allows users
1565 to declare "local" labels, i.e., labels with scope. This extension
1566 is useful when writing code involving statement-expressions. */
1569 finish_label_decl (tree name
)
1571 if (!at_function_scope_p ())
1573 error ("__label__ declarations are only allowed in function scopes");
1577 add_decl_expr (declare_local_label (name
));
1580 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1583 finish_decl_cleanup (tree decl
, tree cleanup
)
1585 push_cleanup (decl
, cleanup
, false);
1588 /* If the current scope exits with an exception, run CLEANUP. */
1591 finish_eh_cleanup (tree cleanup
)
1593 push_cleanup (NULL
, cleanup
, true);
1596 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1597 order they were written by the user. Each node is as for
1598 emit_mem_initializers. */
1601 finish_mem_initializers (tree mem_inits
)
1603 /* Reorder the MEM_INITS so that they are in the order they appeared
1604 in the source program. */
1605 mem_inits
= nreverse (mem_inits
);
1607 if (processing_template_decl
)
1611 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1613 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1614 check for bare parameter packs in the TREE_VALUE, because
1615 any parameter packs in the TREE_VALUE have already been
1616 bound as part of the TREE_PURPOSE. See
1617 make_pack_expansion for more information. */
1618 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1619 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1620 TREE_VALUE (mem
) = error_mark_node
;
1623 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1624 CTOR_INITIALIZER
, mem_inits
));
1627 emit_mem_initializers (mem_inits
);
1630 /* Obfuscate EXPR if it looks like an id-expression or member access so
1631 that the call to finish_decltype in do_auto_deduction will give the
1635 force_paren_expr (tree expr
)
1637 /* This is only needed for decltype(auto) in C++14. */
1638 if (cxx_dialect
< cxx14
)
1641 /* If we're in unevaluated context, we can't be deducing a
1642 return/initializer type, so we don't need to mess with this. */
1643 if (cp_unevaluated_operand
)
1646 if (!DECL_P (expr
) && TREE_CODE (expr
) != COMPONENT_REF
1647 && TREE_CODE (expr
) != SCOPE_REF
)
1650 if (TREE_CODE (expr
) == COMPONENT_REF
1651 || TREE_CODE (expr
) == SCOPE_REF
)
1652 REF_PARENTHESIZED_P (expr
) = true;
1653 else if (type_dependent_expression_p (expr
))
1654 expr
= build1 (PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1655 else if (VAR_P (expr
) && DECL_HARD_REGISTER (expr
))
1656 /* We can't bind a hard register variable to a reference. */;
1659 cp_lvalue_kind kind
= lvalue_kind (expr
);
1660 if ((kind
& ~clk_class
) != clk_none
)
1662 tree type
= unlowered_expr_type (expr
);
1663 bool rval
= !!(kind
& clk_rvalueref
);
1664 type
= cp_build_reference_type (type
, rval
);
1665 /* This inhibits warnings in, eg, cxx_mark_addressable
1667 warning_sentinel
s (extra_warnings
);
1668 expr
= build_static_cast (type
, expr
, tf_error
);
1669 if (expr
!= error_mark_node
)
1670 REF_PARENTHESIZED_P (expr
) = true;
1677 /* If T is an id-expression obfuscated by force_paren_expr, undo the
1678 obfuscation and return the underlying id-expression. Otherwise
1682 maybe_undo_parenthesized_ref (tree t
)
1684 if (cxx_dialect
>= cxx14
1685 && INDIRECT_REF_P (t
)
1686 && REF_PARENTHESIZED_P (t
))
1688 t
= TREE_OPERAND (t
, 0);
1689 while (TREE_CODE (t
) == NON_LVALUE_EXPR
1690 || TREE_CODE (t
) == NOP_EXPR
)
1691 t
= TREE_OPERAND (t
, 0);
1693 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
1694 || TREE_CODE (t
) == STATIC_CAST_EXPR
);
1695 t
= TREE_OPERAND (t
, 0);
1701 /* Finish a parenthesized expression EXPR. */
1704 finish_parenthesized_expr (cp_expr expr
)
1707 /* This inhibits warnings in c_common_truthvalue_conversion. */
1708 TREE_NO_WARNING (expr
) = 1;
1710 if (TREE_CODE (expr
) == OFFSET_REF
1711 || TREE_CODE (expr
) == SCOPE_REF
)
1712 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1713 enclosed in parentheses. */
1714 PTRMEM_OK_P (expr
) = 0;
1716 if (TREE_CODE (expr
) == STRING_CST
)
1717 PAREN_STRING_LITERAL_P (expr
) = 1;
1719 expr
= cp_expr (force_paren_expr (expr
), expr
.get_location ());
1724 /* Finish a reference to a non-static data member (DECL) that is not
1725 preceded by `.' or `->'. */
1728 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1730 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1731 bool try_omp_private
= !object
&& omp_private_member_map
;
1736 tree scope
= qualifying_scope
;
1737 if (scope
== NULL_TREE
)
1738 scope
= context_for_name_lookup (decl
);
1739 object
= maybe_dummy_object (scope
, NULL
);
1742 object
= maybe_resolve_dummy (object
, true);
1743 if (object
== error_mark_node
)
1744 return error_mark_node
;
1746 /* DR 613/850: Can use non-static data members without an associated
1747 object in sizeof/decltype/alignof. */
1748 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1749 && (!processing_template_decl
|| !current_class_ref
))
1751 if (current_function_decl
1752 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1753 error ("invalid use of member %qD in static member function", decl
);
1755 error ("invalid use of non-static data member %qD", decl
);
1756 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1758 return error_mark_node
;
1761 if (current_class_ptr
)
1762 TREE_USED (current_class_ptr
) = 1;
1763 if (processing_template_decl
&& !qualifying_scope
)
1765 tree type
= TREE_TYPE (decl
);
1767 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1768 /* Quals on the object don't matter. */;
1769 else if (PACK_EXPANSION_P (type
))
1770 /* Don't bother trying to represent this. */
1774 /* Set the cv qualifiers. */
1775 int quals
= cp_type_quals (TREE_TYPE (object
));
1777 if (DECL_MUTABLE_P (decl
))
1778 quals
&= ~TYPE_QUAL_CONST
;
1780 quals
|= cp_type_quals (TREE_TYPE (decl
));
1781 type
= cp_build_qualified_type (type
, quals
);
1784 ret
= (convert_from_reference
1785 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1787 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1788 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1790 else if (processing_template_decl
)
1791 ret
= build_qualified_name (TREE_TYPE (decl
),
1794 /*template_p=*/false);
1797 tree access_type
= TREE_TYPE (object
);
1799 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1800 decl
, tf_warning_or_error
);
1802 /* If the data member was named `C::M', convert `*this' to `C'
1804 if (qualifying_scope
)
1806 tree binfo
= NULL_TREE
;
1807 object
= build_scoped_ref (object
, qualifying_scope
,
1811 ret
= build_class_member_access_expr (object
, decl
,
1812 /*access_path=*/NULL_TREE
,
1813 /*preserve_reference=*/false,
1814 tf_warning_or_error
);
1816 if (try_omp_private
)
1818 tree
*v
= omp_private_member_map
->get (decl
);
1820 ret
= convert_from_reference (*v
);
1825 /* If we are currently parsing a template and we encountered a typedef
1826 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1827 adds the typedef to a list tied to the current template.
1828 At template instantiation time, that list is walked and access check
1829 performed for each typedef.
1830 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1833 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1835 location_t location
)
1837 tree template_info
= NULL
;
1838 tree cs
= current_scope ();
1840 if (!is_typedef_decl (typedef_decl
)
1842 || !CLASS_TYPE_P (context
)
1846 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1847 template_info
= get_template_info (cs
);
1850 && TI_TEMPLATE (template_info
)
1851 && !currently_open_class (context
))
1852 append_type_to_template_for_access_check (cs
, typedef_decl
,
1856 /* DECL was the declaration to which a qualified-id resolved. Issue
1857 an error message if it is not accessible. If OBJECT_TYPE is
1858 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1859 type of `*x', or `x', respectively. If the DECL was named as
1860 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1863 check_accessibility_of_qualified_id (tree decl
,
1865 tree nested_name_specifier
)
1868 tree qualifying_type
= NULL_TREE
;
1870 /* If we are parsing a template declaration and if decl is a typedef,
1871 add it to a list tied to the template.
1872 At template instantiation time, that list will be walked and
1873 access check performed. */
1874 add_typedef_to_current_template_for_access_check (decl
,
1875 nested_name_specifier
1876 ? nested_name_specifier
1877 : DECL_CONTEXT (decl
),
1880 /* If we're not checking, return immediately. */
1881 if (deferred_access_no_check
)
1884 /* Determine the SCOPE of DECL. */
1885 scope
= context_for_name_lookup (decl
);
1886 /* If the SCOPE is not a type, then DECL is not a member. */
1887 if (!TYPE_P (scope
))
1889 /* Compute the scope through which DECL is being accessed. */
1891 /* OBJECT_TYPE might not be a class type; consider:
1893 class A { typedef int I; };
1897 In this case, we will have "A::I" as the DECL, but "I" as the
1899 && CLASS_TYPE_P (object_type
)
1900 && DERIVED_FROM_P (scope
, object_type
))
1901 /* If we are processing a `->' or `.' expression, use the type of the
1903 qualifying_type
= object_type
;
1904 else if (nested_name_specifier
)
1906 /* If the reference is to a non-static member of the
1907 current class, treat it as if it were referenced through
1910 if (DECL_NONSTATIC_MEMBER_P (decl
)
1911 && current_class_ptr
1912 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
1913 qualifying_type
= ct
;
1914 /* Otherwise, use the type indicated by the
1915 nested-name-specifier. */
1917 qualifying_type
= nested_name_specifier
;
1920 /* Otherwise, the name must be from the current class or one of
1922 qualifying_type
= currently_open_derived_class (scope
);
1925 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1926 or similar in a default argument value. */
1927 && CLASS_TYPE_P (qualifying_type
)
1928 && !dependent_type_p (qualifying_type
))
1929 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1930 decl
, tf_warning_or_error
);
1933 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1934 class named to the left of the "::" operator. DONE is true if this
1935 expression is a complete postfix-expression; it is false if this
1936 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1937 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1938 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1939 is true iff this qualified name appears as a template argument. */
1942 finish_qualified_id_expr (tree qualifying_class
,
1947 bool template_arg_p
,
1948 tsubst_flags_t complain
)
1950 gcc_assert (TYPE_P (qualifying_class
));
1952 if (error_operand_p (expr
))
1953 return error_mark_node
;
1955 if ((DECL_P (expr
) || BASELINK_P (expr
))
1956 && !mark_used (expr
, complain
))
1957 return error_mark_node
;
1961 if (TREE_CODE (expr
) == UNBOUND_CLASS_TEMPLATE
)
1962 /* cp_parser_lookup_name thought we were looking for a type,
1963 but we're actually looking for a declaration. */
1964 expr
= build_qualified_name (/*type*/NULL_TREE
,
1965 TYPE_CONTEXT (expr
),
1966 TYPE_IDENTIFIER (expr
),
1967 /*template_p*/true);
1969 check_template_keyword (expr
);
1972 /* If EXPR occurs as the operand of '&', use special handling that
1973 permits a pointer-to-member. */
1974 if (address_p
&& done
)
1976 if (TREE_CODE (expr
) == SCOPE_REF
)
1977 expr
= TREE_OPERAND (expr
, 1);
1978 expr
= build_offset_ref (qualifying_class
, expr
,
1979 /*address_p=*/true, complain
);
1983 /* No need to check access within an enum. */
1984 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
)
1987 /* Within the scope of a class, turn references to non-static
1988 members into expression of the form "this->...". */
1990 /* But, within a template argument, we do not want make the
1991 transformation, as there is no "this" pointer. */
1993 else if (TREE_CODE (expr
) == FIELD_DECL
)
1995 push_deferring_access_checks (dk_no_check
);
1996 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1998 pop_deferring_access_checks ();
2000 else if (BASELINK_P (expr
) && !processing_template_decl
)
2002 /* See if any of the functions are non-static members. */
2003 /* If so, the expression may be relative to 'this'. */
2004 if (!shared_member_p (expr
)
2005 && current_class_ptr
2006 && DERIVED_FROM_P (qualifying_class
,
2007 current_nonlambda_class_type ()))
2008 expr
= (build_class_member_access_expr
2009 (maybe_dummy_object (qualifying_class
, NULL
),
2011 BASELINK_ACCESS_BINFO (expr
),
2012 /*preserve_reference=*/false,
2015 /* The expression is a qualified name whose address is not
2017 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
2020 else if (BASELINK_P (expr
))
2024 /* In a template, return a SCOPE_REF for most qualified-ids
2025 so that we can check access at instantiation time. But if
2026 we're looking at a member of the current instantiation, we
2027 know we have access and building up the SCOPE_REF confuses
2028 non-type template argument handling. */
2029 if (processing_template_decl
2030 && !currently_open_class (qualifying_class
))
2031 expr
= build_qualified_name (TREE_TYPE (expr
),
2032 qualifying_class
, expr
,
2035 expr
= convert_from_reference (expr
);
2041 /* Begin a statement-expression. The value returned must be passed to
2042 finish_stmt_expr. */
2045 begin_stmt_expr (void)
2047 return push_stmt_list ();
2050 /* Process the final expression of a statement expression. EXPR can be
2051 NULL, if the final expression is empty. Return a STATEMENT_LIST
2052 containing all the statements in the statement-expression, or
2053 ERROR_MARK_NODE if there was an error. */
2056 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2058 if (error_operand_p (expr
))
2060 /* The type of the statement-expression is the type of the last
2062 TREE_TYPE (stmt_expr
) = error_mark_node
;
2063 return error_mark_node
;
2066 /* If the last statement does not have "void" type, then the value
2067 of the last statement is the value of the entire expression. */
2070 tree type
= TREE_TYPE (expr
);
2072 if (processing_template_decl
)
2074 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2075 expr
= add_stmt (expr
);
2076 /* Mark the last statement so that we can recognize it as such at
2077 template-instantiation time. */
2078 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2080 else if (VOID_TYPE_P (type
))
2082 /* Just treat this like an ordinary statement. */
2083 expr
= finish_expr_stmt (expr
);
2087 /* It actually has a value we need to deal with. First, force it
2088 to be an rvalue so that we won't need to build up a copy
2089 constructor call later when we try to assign it to something. */
2090 expr
= force_rvalue (expr
, tf_warning_or_error
);
2091 if (error_operand_p (expr
))
2092 return error_mark_node
;
2094 /* Update for array-to-pointer decay. */
2095 type
= TREE_TYPE (expr
);
2097 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2098 normal statement, but don't convert to void or actually add
2100 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2101 expr
= maybe_cleanup_point_expr (expr
);
2105 /* The type of the statement-expression is the type of the last
2107 TREE_TYPE (stmt_expr
) = type
;
2113 /* Finish a statement-expression. EXPR should be the value returned
2114 by the previous begin_stmt_expr. Returns an expression
2115 representing the statement-expression. */
2118 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2123 if (error_operand_p (stmt_expr
))
2125 pop_stmt_list (stmt_expr
);
2126 return error_mark_node
;
2129 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2131 type
= TREE_TYPE (stmt_expr
);
2132 result
= pop_stmt_list (stmt_expr
);
2133 TREE_TYPE (result
) = type
;
2135 if (processing_template_decl
)
2137 result
= build_min (STMT_EXPR
, type
, result
);
2138 TREE_SIDE_EFFECTS (result
) = 1;
2139 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2141 else if (CLASS_TYPE_P (type
))
2143 /* Wrap the statement-expression in a TARGET_EXPR so that the
2144 temporary object created by the final expression is destroyed at
2145 the end of the full-expression containing the
2146 statement-expression. */
2147 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2153 /* Returns the expression which provides the value of STMT_EXPR. */
2156 stmt_expr_value_expr (tree stmt_expr
)
2158 tree t
= STMT_EXPR_STMT (stmt_expr
);
2160 if (TREE_CODE (t
) == BIND_EXPR
)
2161 t
= BIND_EXPR_BODY (t
);
2163 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2164 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2166 if (TREE_CODE (t
) == EXPR_STMT
)
2167 t
= EXPR_STMT_EXPR (t
);
2172 /* Return TRUE iff EXPR_STMT is an empty list of
2173 expression statements. */
2176 empty_expr_stmt_p (tree expr_stmt
)
2178 tree body
= NULL_TREE
;
2180 if (expr_stmt
== void_node
)
2185 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2186 body
= EXPR_STMT_EXPR (expr_stmt
);
2187 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2193 if (TREE_CODE (body
) == STATEMENT_LIST
)
2194 return tsi_end_p (tsi_start (body
));
2196 return empty_expr_stmt_p (body
);
2201 /* Perform Koenig lookup. FN is the postfix-expression representing
2202 the function (or functions) to call; ARGS are the arguments to the
2203 call. Returns the functions to be considered by overload resolution. */
2206 perform_koenig_lookup (cp_expr fn
, vec
<tree
, va_gc
> *args
,
2207 tsubst_flags_t complain
)
2209 tree identifier
= NULL_TREE
;
2210 tree functions
= NULL_TREE
;
2211 tree tmpl_args
= NULL_TREE
;
2212 bool template_id
= false;
2214 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2216 /* Use a separate flag to handle null args. */
2218 tmpl_args
= TREE_OPERAND (fn
, 1);
2219 fn
= TREE_OPERAND (fn
, 0);
2222 /* Find the name of the overloaded function. */
2223 if (identifier_p (fn
))
2225 else if (is_overloaded_fn (fn
))
2228 identifier
= DECL_NAME (get_first_fn (functions
));
2230 else if (DECL_P (fn
))
2233 identifier
= DECL_NAME (fn
);
2236 /* A call to a namespace-scope function using an unqualified name.
2238 Do Koenig lookup -- unless any of the arguments are
2240 if (!any_type_dependent_arguments_p (args
)
2241 && !any_dependent_template_arguments_p (tmpl_args
))
2243 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2246 /* The unqualified name could not be resolved. */
2248 fn
= unqualified_fn_lookup_error (identifier
);
2254 if (fn
&& template_id
)
2255 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2260 /* Generate an expression for `FN (ARGS)'. This may change the
2263 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2264 as a virtual call, even if FN is virtual. (This flag is set when
2265 encountering an expression where the function name is explicitly
2266 qualified. For example a call to `X::f' never generates a virtual
2269 Returns code for the call. */
2272 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2273 bool koenig_p
, tsubst_flags_t complain
)
2277 vec
<tree
, va_gc
> *orig_args
= NULL
;
2279 if (fn
== error_mark_node
)
2280 return error_mark_node
;
2282 gcc_assert (!TYPE_P (fn
));
2284 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2285 it so that we can tell this is a call to a known function. */
2286 fn
= maybe_undo_parenthesized_ref (fn
);
2290 if (processing_template_decl
)
2292 /* If the call expression is dependent, build a CALL_EXPR node
2293 with no type; type_dependent_expression_p recognizes
2294 expressions with no type as being dependent. */
2295 if (type_dependent_expression_p (fn
)
2296 || any_type_dependent_arguments_p (*args
))
2298 result
= build_nt_call_vec (fn
, *args
);
2299 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2300 KOENIG_LOOKUP_P (result
) = koenig_p
;
2305 tree fndecl
= OVL_CURRENT (fn
);
2306 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2307 || !TREE_THIS_VOLATILE (fndecl
))
2313 current_function_returns_abnormally
= 1;
2317 orig_args
= make_tree_vector_copy (*args
);
2318 if (!BASELINK_P (fn
)
2319 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2320 && TREE_TYPE (fn
) != unknown_type_node
)
2321 fn
= build_non_dependent_expr (fn
);
2322 make_args_non_dependent (*args
);
2325 if (TREE_CODE (fn
) == COMPONENT_REF
)
2327 tree member
= TREE_OPERAND (fn
, 1);
2328 if (BASELINK_P (member
))
2330 tree object
= TREE_OPERAND (fn
, 0);
2331 return build_new_method_call (object
, member
,
2334 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2341 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2342 if (TREE_CODE (fn
) == ADDR_EXPR
2343 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2344 fn
= TREE_OPERAND (fn
, 0);
2346 if (is_overloaded_fn (fn
))
2347 fn
= baselink_for_fns (fn
);
2350 if (BASELINK_P (fn
))
2354 /* A call to a member function. From [over.call.func]:
2356 If the keyword this is in scope and refers to the class of
2357 that member function, or a derived class thereof, then the
2358 function call is transformed into a qualified function call
2359 using (*this) as the postfix-expression to the left of the
2360 . operator.... [Otherwise] a contrived object of type T
2361 becomes the implied object argument.
2365 struct A { void f(); };
2366 struct B : public A {};
2367 struct C : public A { void g() { B::f(); }};
2369 "the class of that member function" refers to `A'. But 11.2
2370 [class.access.base] says that we need to convert 'this' to B* as
2371 part of the access, so we pass 'B' to maybe_dummy_object. */
2373 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2375 /* A constructor call always uses a dummy object. (This constructor
2376 call which has the form A::A () is actually invalid and we are
2377 going to reject it later in build_new_method_call.) */
2378 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2381 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2384 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2386 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2391 else if (is_overloaded_fn (fn
))
2393 /* If the function is an overloaded builtin, resolve it. */
2394 if (TREE_CODE (fn
) == FUNCTION_DECL
2395 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2396 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2397 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2401 if (warn_sizeof_pointer_memaccess
2402 && (complain
& tf_warning
)
2403 && !vec_safe_is_empty (*args
)
2404 && !processing_template_decl
)
2406 location_t sizeof_arg_loc
[3];
2409 for (i
= 0; i
< 3; i
++)
2413 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2414 sizeof_arg
[i
] = NULL_TREE
;
2415 if (i
>= (*args
)->length ())
2418 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2420 if (SIZEOF_EXPR_TYPE_P (t
))
2421 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2423 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2424 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2426 sizeof_pointer_memaccess_warning
2427 (sizeof_arg_loc
, fn
, *args
,
2428 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2431 /* A call to a namespace-scope function. */
2432 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2435 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2437 if (!vec_safe_is_empty (*args
))
2438 error ("arguments to destructor are not allowed");
2439 /* Mark the pseudo-destructor call as having side-effects so
2440 that we do not issue warnings about its use. */
2441 result
= build1 (NOP_EXPR
,
2443 TREE_OPERAND (fn
, 0));
2444 TREE_SIDE_EFFECTS (result
) = 1;
2446 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2447 /* If the "function" is really an object of class type, it might
2448 have an overloaded `operator ()'. */
2449 result
= build_op_call (fn
, args
, complain
);
2452 /* A call where the function is unknown. */
2453 result
= cp_build_function_call_vec (fn
, args
, complain
);
2455 if (processing_template_decl
&& result
!= error_mark_node
)
2457 if (INDIRECT_REF_P (result
))
2458 result
= TREE_OPERAND (result
, 0);
2459 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2460 SET_EXPR_LOCATION (result
, input_location
);
2461 KOENIG_LOOKUP_P (result
) = koenig_p
;
2462 release_tree_vector (orig_args
);
2463 result
= convert_from_reference (result
);
2468 /* Free garbage OVERLOADs from arg-dependent lookup. */
2469 tree next
= NULL_TREE
;
2471 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2474 if (processing_template_decl
)
2475 /* In a template, we'll re-use them at instantiation time. */
2476 OVL_ARG_DEPENDENT (fn
) = false;
2479 next
= OVL_CHAIN (fn
);
2488 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2489 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2490 POSTDECREMENT_EXPR.) */
2493 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2495 /* input_location holds the location of the trailing operator token.
2496 Build a location of the form:
2499 with the caret at the operator token, ranging from the start
2500 of EXPR to the end of the operator token. */
2501 location_t combined_loc
= make_location (input_location
,
2503 get_finish (input_location
));
2504 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2505 tf_warning_or_error
);
2506 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2507 result
.set_location (combined_loc
);
2511 /* Finish a use of `this'. Returns an expression for `this'. */
2514 finish_this_expr (void)
2516 tree result
= NULL_TREE
;
2518 if (current_class_ptr
)
2520 tree type
= TREE_TYPE (current_class_ref
);
2522 /* In a lambda expression, 'this' refers to the captured 'this'. */
2523 if (LAMBDA_TYPE_P (type
))
2524 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2526 result
= current_class_ptr
;
2530 /* The keyword 'this' is a prvalue expression. */
2531 return rvalue (result
);
2533 tree fn
= current_nonlambda_function ();
2534 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2535 error ("%<this%> is unavailable for static member functions");
2537 error ("invalid use of %<this%> in non-member function");
2539 error ("invalid use of %<this%> at top level");
2540 return error_mark_node
;
2543 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2544 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2545 the TYPE for the type given. If SCOPE is non-NULL, the expression
2546 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2549 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2552 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2553 return error_mark_node
;
2555 gcc_assert (TYPE_P (destructor
));
2557 if (!processing_template_decl
)
2559 if (scope
== error_mark_node
)
2561 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2562 return error_mark_node
;
2564 if (is_auto (destructor
))
2565 destructor
= TREE_TYPE (object
);
2566 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2569 "qualified type %qT does not match destructor name ~%qT",
2571 return error_mark_node
;
2575 /* [expr.pseudo] says both:
2577 The type designated by the pseudo-destructor-name shall be
2578 the same as the object type.
2582 The cv-unqualified versions of the object type and of the
2583 type designated by the pseudo-destructor-name shall be the
2586 We implement the more generous second sentence, since that is
2587 what most other compilers do. */
2588 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2591 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2592 return error_mark_node
;
2596 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2600 /* Finish an expression of the form CODE EXPR. */
2603 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2604 tsubst_flags_t complain
)
2606 /* Build a location of the form:
2609 with the caret at the operator token, ranging from the start
2610 of the operator token to the end of EXPR. */
2611 location_t combined_loc
= make_location (op_loc
,
2612 op_loc
, expr
.get_finish ());
2613 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2614 /* TODO: build_x_unary_op doesn't always honor the location. */
2615 result
.set_location (combined_loc
);
2617 tree result_ovl
, expr_ovl
;
2619 if (!(complain
& tf_warning
))
2622 result_ovl
= result
;
2625 if (!processing_template_decl
)
2626 expr_ovl
= cp_fully_fold (expr_ovl
);
2628 if (!CONSTANT_CLASS_P (expr_ovl
)
2629 || TREE_OVERFLOW_P (expr_ovl
))
2632 if (!processing_template_decl
)
2633 result_ovl
= cp_fully_fold (result_ovl
);
2635 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2636 overflow_warning (combined_loc
, result_ovl
);
2641 /* Finish a compound-literal expression. TYPE is the type to which
2642 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2645 finish_compound_literal (tree type
, tree compound_literal
,
2646 tsubst_flags_t complain
)
2648 if (type
== error_mark_node
)
2649 return error_mark_node
;
2651 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2654 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2656 return cp_build_c_cast (type
, compound_literal
, complain
);
2659 if (!TYPE_OBJ_P (type
))
2661 if (complain
& tf_error
)
2662 error ("compound literal of non-object type %qT", type
);
2663 return error_mark_node
;
2666 if (processing_template_decl
)
2668 TREE_TYPE (compound_literal
) = type
;
2669 /* Mark the expression as a compound literal. */
2670 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2671 return compound_literal
;
2674 type
= complete_type (type
);
2676 if (TYPE_NON_AGGREGATE_CLASS (type
))
2678 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2679 everywhere that deals with function arguments would be a pain, so
2680 just wrap it in a TREE_LIST. The parser set a flag so we know
2681 that it came from T{} rather than T({}). */
2682 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2683 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2684 return build_functional_cast (type
, compound_literal
, complain
);
2687 if (TREE_CODE (type
) == ARRAY_TYPE
2688 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2689 return error_mark_node
;
2690 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2691 if (SCALAR_TYPE_P (type
)
2692 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2693 && !check_narrowing (type
, compound_literal
, complain
))
2694 return error_mark_node
;
2695 if (TREE_CODE (type
) == ARRAY_TYPE
2696 && TYPE_DOMAIN (type
) == NULL_TREE
)
2698 cp_complete_array_type_or_error (&type
, compound_literal
,
2700 if (type
== error_mark_node
)
2701 return error_mark_node
;
2703 compound_literal
= digest_init (type
, compound_literal
, complain
);
2704 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2705 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2707 /* Put static/constant array temporaries in static variables. */
2708 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2709 && TREE_CODE (type
) == ARRAY_TYPE
2710 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2711 && initializer_constant_valid_p (compound_literal
, type
))
2713 tree decl
= create_temporary_var (type
);
2714 DECL_INITIAL (decl
) = compound_literal
;
2715 TREE_STATIC (decl
) = 1;
2716 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2718 /* 5.19 says that a constant expression can include an
2719 lvalue-rvalue conversion applied to "a glvalue of literal type
2720 that refers to a non-volatile temporary object initialized
2721 with a constant expression". Rather than try to communicate
2722 that this VAR_DECL is a temporary, just mark it constexpr. */
2723 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2724 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2725 TREE_CONSTANT (decl
) = true;
2727 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2728 decl
= pushdecl_top_level (decl
);
2729 DECL_NAME (decl
) = make_anon_name ();
2730 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2731 /* Make sure the destructor is callable. */
2732 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2733 if (clean
== error_mark_node
)
2734 return error_mark_node
;
2738 /* Represent other compound literals with TARGET_EXPR so we produce
2739 an lvalue, but can elide copies. */
2740 if (!VECTOR_TYPE_P (type
))
2741 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2743 return compound_literal
;
2746 /* Return the declaration for the function-name variable indicated by
2750 finish_fname (tree id
)
2754 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2755 if (processing_template_decl
&& current_function_decl
2756 && decl
!= error_mark_node
)
2757 decl
= DECL_NAME (decl
);
2761 /* Finish a translation unit. */
2764 finish_translation_unit (void)
2766 /* In case there were missing closebraces,
2767 get us back to the global binding level. */
2769 while (current_namespace
!= global_namespace
)
2772 /* Do file scope __FUNCTION__ et al. */
2773 finish_fname_decls ();
2776 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2777 Returns the parameter. */
2780 finish_template_type_parm (tree aggr
, tree identifier
)
2782 if (aggr
!= class_type_node
)
2784 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2785 aggr
= class_type_node
;
2788 return build_tree_list (aggr
, identifier
);
2791 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2792 Returns the parameter. */
2795 finish_template_template_parm (tree aggr
, tree identifier
)
2797 tree decl
= build_decl (input_location
,
2798 TYPE_DECL
, identifier
, NULL_TREE
);
2800 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2801 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2802 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2803 DECL_ARTIFICIAL (decl
) = 1;
2805 // Associate the constraints with the underlying declaration,
2806 // not the template.
2807 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2808 tree constr
= build_constraints (reqs
, NULL_TREE
);
2809 set_constraints (decl
, constr
);
2811 end_template_decl ();
2813 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2815 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2816 /*is_primary=*/true, /*is_partial=*/false,
2819 return finish_template_type_parm (aggr
, tmpl
);
2822 /* ARGUMENT is the default-argument value for a template template
2823 parameter. If ARGUMENT is invalid, issue error messages and return
2824 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2827 check_template_template_default_arg (tree argument
)
2829 if (TREE_CODE (argument
) != TEMPLATE_DECL
2830 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2831 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2833 if (TREE_CODE (argument
) == TYPE_DECL
)
2834 error ("invalid use of type %qT as a default value for a template "
2835 "template-parameter", TREE_TYPE (argument
));
2837 error ("invalid default argument for a template template parameter");
2838 return error_mark_node
;
2844 /* Begin a class definition, as indicated by T. */
2847 begin_class_definition (tree t
)
2849 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2850 return error_mark_node
;
2852 if (processing_template_parmlist
)
2854 error ("definition of %q#T inside template parameter list", t
);
2855 return error_mark_node
;
2858 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2859 are passed the same as decimal scalar types. */
2860 if (TREE_CODE (t
) == RECORD_TYPE
2861 && !processing_template_decl
)
2863 tree ns
= TYPE_CONTEXT (t
);
2864 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2865 && DECL_CONTEXT (ns
) == std_node
2867 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2869 const char *n
= TYPE_NAME_STRING (t
);
2870 if ((strcmp (n
, "decimal32") == 0)
2871 || (strcmp (n
, "decimal64") == 0)
2872 || (strcmp (n
, "decimal128") == 0))
2873 TYPE_TRANSPARENT_AGGR (t
) = 1;
2877 /* A non-implicit typename comes from code like:
2879 template <typename T> struct A {
2880 template <typename U> struct A<T>::B ...
2882 This is erroneous. */
2883 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2885 error ("invalid definition of qualified type %qT", t
);
2886 t
= error_mark_node
;
2889 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2891 t
= make_class_type (RECORD_TYPE
);
2892 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2895 if (TYPE_BEING_DEFINED (t
))
2897 t
= make_class_type (TREE_CODE (t
));
2898 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2900 maybe_process_partial_specialization (t
);
2902 TYPE_BEING_DEFINED (t
) = 1;
2903 class_binding_level
->defining_class_p
= 1;
2905 if (flag_pack_struct
)
2908 TYPE_PACKED (t
) = 1;
2909 /* Even though the type is being defined for the first time
2910 here, there might have been a forward declaration, so there
2911 might be cv-qualified variants of T. */
2912 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2913 TYPE_PACKED (v
) = 1;
2915 /* Reset the interface data, at the earliest possible
2916 moment, as it might have been set via a class foo;
2918 if (! TYPE_ANONYMOUS_P (t
))
2920 struct c_fileinfo
*finfo
= \
2921 get_fileinfo (LOCATION_FILE (input_location
));
2922 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2923 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2924 (t
, finfo
->interface_unknown
);
2926 reset_specialization();
2928 /* Make a declaration for this class in its own scope. */
2929 build_self_reference ();
2934 /* Finish the member declaration given by DECL. */
2937 finish_member_declaration (tree decl
)
2939 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2942 if (decl
== void_type_node
)
2943 /* The COMPONENT was a friend, not a member, and so there's
2944 nothing for us to do. */
2947 /* We should see only one DECL at a time. */
2948 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2950 /* Set up access control for DECL. */
2952 = (current_access_specifier
== access_private_node
);
2953 TREE_PROTECTED (decl
)
2954 = (current_access_specifier
== access_protected_node
);
2955 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2957 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2958 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2961 /* Mark the DECL as a member of the current class, unless it's
2962 a member of an enumeration. */
2963 if (TREE_CODE (decl
) != CONST_DECL
)
2964 DECL_CONTEXT (decl
) = current_class_type
;
2966 /* Check for bare parameter packs in the member variable declaration. */
2967 if (TREE_CODE (decl
) == FIELD_DECL
)
2969 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2970 TREE_TYPE (decl
) = error_mark_node
;
2971 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2972 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2977 A C language linkage is ignored for the names of class members
2978 and the member function type of class member functions. */
2979 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2980 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2982 /* Put functions on the TYPE_METHODS list and everything else on the
2983 TYPE_FIELDS list. Note that these are built up in reverse order.
2984 We reverse them (to obtain declaration order) in finish_struct. */
2985 if (DECL_DECLARES_FUNCTION_P (decl
))
2987 /* We also need to add this function to the
2988 CLASSTYPE_METHOD_VEC. */
2989 if (add_method (current_class_type
, decl
, NULL_TREE
))
2991 gcc_assert (TYPE_MAIN_VARIANT (current_class_type
) == current_class_type
);
2992 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2993 TYPE_METHODS (current_class_type
) = decl
;
2995 maybe_add_class_template_decl_list (current_class_type
, decl
,
2999 /* Enter the DECL into the scope of the class, if the class
3000 isn't a closure (whose fields are supposed to be unnamed). */
3001 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3002 || pushdecl_class_level (decl
))
3004 if (TREE_CODE (decl
) == USING_DECL
)
3006 /* For now, ignore class-scope USING_DECLS, so that
3007 debugging backends do not see them. */
3008 DECL_IGNORED_P (decl
) = 1;
3011 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3012 go at the beginning. The reason is that lookup_field_1
3013 searches the list in order, and we want a field name to
3014 override a type name so that the "struct stat hack" will
3015 work. In particular:
3017 struct S { enum E { }; int E } s;
3020 is valid. In addition, the FIELD_DECLs must be maintained in
3021 declaration order so that class layout works as expected.
3022 However, we don't need that order until class layout, so we
3023 save a little time by putting FIELD_DECLs on in reverse order
3024 here, and then reversing them in finish_struct_1. (We could
3025 also keep a pointer to the correct insertion points in the
3028 if (TREE_CODE (decl
) == TYPE_DECL
)
3029 TYPE_FIELDS (current_class_type
)
3030 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3033 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3034 TYPE_FIELDS (current_class_type
) = decl
;
3037 maybe_add_class_template_decl_list (current_class_type
, decl
,
3042 /* Finish processing a complete template declaration. The PARMS are
3043 the template parameters. */
3046 finish_template_decl (tree parms
)
3049 end_template_decl ();
3051 end_specialization ();
3054 // Returns the template type of the class scope being entered. If we're
3055 // entering a constrained class scope. TYPE is the class template
3056 // scope being entered and we may need to match the intended type with
3057 // a constrained specialization. For example:
3059 // template<Object T>
3060 // struct S { void f(); }; #1
3062 // template<Object T>
3063 // void S<T>::f() { } #2
3065 // We check, in #2, that S<T> refers precisely to the type declared by
3066 // #1 (i.e., that the constraints match). Note that the following should
3067 // be an error since there is no specialization of S<T> that is
3068 // unconstrained, but this is not diagnosed here.
3070 // template<typename T>
3071 // void S<T>::f() { }
3073 // We cannot diagnose this problem here since this function also matches
3074 // qualified template names that are not part of a definition. For example:
3076 // template<Integral T, Floating_point U>
3077 // typename pair<T, U>::first_type void f(T, U);
3079 // Here, it is unlikely that there is a partial specialization of
3080 // pair constrained for for Integral and Floating_point arguments.
3082 // The general rule is: if a constrained specialization with matching
3083 // constraints is found return that type. Also note that if TYPE is not a
3084 // class-type (e.g. a typename type), then no fixup is needed.
3087 fixup_template_type (tree type
)
3089 // Find the template parameter list at the a depth appropriate to
3090 // the scope we're trying to enter.
3091 tree parms
= current_template_parms
;
3092 int depth
= template_class_depth (type
);
3093 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3094 parms
= TREE_CHAIN (parms
);
3097 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3098 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3100 // Search for a specialization whose type and constraints match.
3101 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3102 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3105 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3107 // If the type and constraints match a specialization, then we
3108 // are entering that type.
3109 if (same_type_p (type
, TREE_TYPE (specs
))
3110 && equivalent_constraints (cur_constr
, spec_constr
))
3111 return TREE_TYPE (specs
);
3112 specs
= TREE_CHAIN (specs
);
3115 // If no specialization matches, then must return the type
3116 // previously found.
3120 /* Finish processing a template-id (which names a type) of the form
3121 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3122 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3123 the scope of template-id indicated. */
3126 finish_template_type (tree name
, tree args
, int entering_scope
)
3130 type
= lookup_template_class (name
, args
,
3131 NULL_TREE
, NULL_TREE
, entering_scope
,
3132 tf_warning_or_error
| tf_user
);
3134 /* If we might be entering the scope of a partial specialization,
3135 find the one with the right constraints. */
3138 && CLASS_TYPE_P (type
)
3139 && dependent_type_p (type
)
3140 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3141 type
= fixup_template_type (type
);
3143 if (type
== error_mark_node
)
3145 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3146 return TYPE_STUB_DECL (type
);
3148 return TYPE_NAME (type
);
3151 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3152 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3153 BASE_CLASS, or NULL_TREE if an error occurred. The
3154 ACCESS_SPECIFIER is one of
3155 access_{default,public,protected_private}_node. For a virtual base
3156 we set TREE_TYPE. */
3159 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3163 if (base
== error_mark_node
)
3165 error ("invalid base-class specification");
3168 else if (! MAYBE_CLASS_TYPE_P (base
))
3170 error ("%qT is not a class type", base
);
3175 if (cp_type_quals (base
) != 0)
3177 /* DR 484: Can a base-specifier name a cv-qualified
3179 base
= TYPE_MAIN_VARIANT (base
);
3181 result
= build_tree_list (access
, base
);
3183 TREE_TYPE (result
) = integer_type_node
;
3189 /* If FNS is a member function, a set of member functions, or a
3190 template-id referring to one or more member functions, return a
3191 BASELINK for FNS, incorporating the current access context.
3192 Otherwise, return FNS unchanged. */
3195 baselink_for_fns (tree fns
)
3200 if (BASELINK_P (fns
)
3201 || error_operand_p (fns
))
3204 scope
= ovl_scope (fns
);
3205 if (!CLASS_TYPE_P (scope
))
3208 cl
= currently_open_derived_class (scope
);
3211 cl
= TYPE_BINFO (cl
);
3212 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3215 /* Returns true iff DECL is a variable from a function outside
3219 outer_var_p (tree decl
)
3221 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3222 && DECL_FUNCTION_SCOPE_P (decl
)
3223 && (DECL_CONTEXT (decl
) != current_function_decl
3224 || parsing_nsdmi ()));
3227 /* As above, but also checks that DECL is automatic. */
3230 outer_automatic_var_p (tree decl
)
3232 return (outer_var_p (decl
)
3233 && !TREE_STATIC (decl
));
3236 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3237 rewrite it for lambda capture. */
3240 process_outer_var_ref (tree decl
, tsubst_flags_t complain
)
3242 if (cp_unevaluated_operand
)
3243 /* It's not a use (3.2) if we're in an unevaluated context. */
3245 if (decl
== error_mark_node
)
3248 tree context
= DECL_CONTEXT (decl
);
3249 tree containing_function
= current_function_decl
;
3250 tree lambda_stack
= NULL_TREE
;
3251 tree lambda_expr
= NULL_TREE
;
3252 tree initializer
= convert_from_reference (decl
);
3254 /* Mark it as used now even if the use is ill-formed. */
3255 if (!mark_used (decl
, complain
))
3256 return error_mark_node
;
3258 bool saw_generic_lambda
= false;
3259 if (parsing_nsdmi ())
3260 containing_function
= NULL_TREE
;
3262 /* If we are in a lambda function, we can move out until we hit
3264 2. a non-lambda function, or
3265 3. a non-default capturing lambda function. */
3266 while (context
!= containing_function
3267 && LAMBDA_FUNCTION_P (containing_function
))
3269 tree closure
= DECL_CONTEXT (containing_function
);
3270 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3272 if (generic_lambda_fn_p (containing_function
))
3273 saw_generic_lambda
= true;
3275 if (TYPE_CLASS_SCOPE_P (closure
))
3276 /* A lambda in an NSDMI (c++/64496). */
3279 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3283 lambda_stack
= tree_cons (NULL_TREE
,
3288 = decl_function_context (containing_function
);
3291 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3292 support for an approach in which a reference to a local
3293 [constant] automatic variable in a nested class or lambda body
3294 would enter the expression as an rvalue, which would reduce
3295 the complexity of the problem"
3297 FIXME update for final resolution of core issue 696. */
3298 if (decl_maybe_constant_var_p (decl
))
3300 if (processing_template_decl
&& !saw_generic_lambda
)
3301 /* In a non-generic lambda within a template, wait until instantiation
3302 time to decide whether to capture. For a generic lambda, we can't
3303 wait until we instantiate the op() because the closure class is
3304 already defined at that point. FIXME to get the semantics exactly
3305 right we need to partially-instantiate the lambda body so the only
3306 dependencies left are on the generic parameters themselves. This
3307 probably means moving away from our current model of lambdas in
3308 templates (instantiating the closure type) to one based on creating
3309 the closure type when instantiating the lambda context. That is
3310 probably also the way to handle lambdas within pack expansions. */
3312 else if (decl_constant_var_p (decl
))
3314 tree t
= maybe_constant_value (convert_from_reference (decl
));
3315 if (TREE_CONSTANT (t
))
3320 if (lambda_expr
&& VAR_P (decl
)
3321 && DECL_ANON_UNION_VAR_P (decl
))
3323 if (complain
& tf_error
)
3324 error ("cannot capture member %qD of anonymous union", decl
);
3325 return error_mark_node
;
3327 if (context
== containing_function
)
3329 decl
= add_default_capture (lambda_stack
,
3330 /*id=*/DECL_NAME (decl
),
3333 else if (lambda_expr
)
3335 if (complain
& tf_error
)
3337 error ("%qD is not captured", decl
);
3338 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3339 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3341 inform (location_of (closure
),
3342 "the lambda has no capture-default");
3343 else if (TYPE_CLASS_SCOPE_P (closure
))
3344 inform (0, "lambda in local class %q+T cannot "
3345 "capture variables from the enclosing context",
3346 TYPE_CONTEXT (closure
));
3347 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3349 return error_mark_node
;
3353 if (complain
& tf_error
)
3355 ? G_("use of local variable with automatic storage from containing function")
3356 : G_("use of parameter from containing function"));
3357 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3358 return error_mark_node
;
3363 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3364 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3365 if non-NULL, is the type or namespace used to explicitly qualify
3366 ID_EXPRESSION. DECL is the entity to which that name has been
3369 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3370 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3371 be set to true if this expression isn't permitted in a
3372 constant-expression, but it is otherwise not set by this function.
3373 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3374 constant-expression, but a non-constant expression is also
3377 DONE is true if this expression is a complete postfix-expression;
3378 it is false if this expression is followed by '->', '[', '(', etc.
3379 ADDRESS_P is true iff this expression is the operand of '&'.
3380 TEMPLATE_P is true iff the qualified-id was of the form
3381 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3382 appears as a template argument.
3384 If an error occurs, and it is the kind of error that might cause
3385 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3386 is the caller's responsibility to issue the message. *ERROR_MSG
3387 will be a string with static storage duration, so the caller need
3390 Return an expression for the entity, after issuing appropriate
3391 diagnostics. This function is also responsible for transforming a
3392 reference to a non-static member into a COMPONENT_REF that makes
3393 the use of "this" explicit.
3395 Upon return, *IDK will be filled in appropriately. */
3397 finish_id_expression (tree id_expression
,
3401 bool integral_constant_expression_p
,
3402 bool allow_non_integral_constant_expression_p
,
3403 bool *non_integral_constant_expression_p
,
3407 bool template_arg_p
,
3408 const char **error_msg
,
3409 location_t location
)
3411 decl
= strip_using_decl (decl
);
3413 /* Initialize the output parameters. */
3414 *idk
= CP_ID_KIND_NONE
;
3417 if (id_expression
== error_mark_node
)
3418 return error_mark_node
;
3419 /* If we have a template-id, then no further lookup is
3420 required. If the template-id was for a template-class, we
3421 will sometimes have a TYPE_DECL at this point. */
3422 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3423 || TREE_CODE (decl
) == TYPE_DECL
)
3425 /* Look up the name. */
3428 if (decl
== error_mark_node
)
3430 /* Name lookup failed. */
3433 || (!dependent_type_p (scope
)
3434 && !(identifier_p (id_expression
)
3435 && IDENTIFIER_TYPENAME_P (id_expression
)
3436 && dependent_type_p (TREE_TYPE (id_expression
))))))
3438 /* If the qualifying type is non-dependent (and the name
3439 does not name a conversion operator to a dependent
3440 type), issue an error. */
3441 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3442 return error_mark_node
;
3446 /* It may be resolved via Koenig lookup. */
3447 *idk
= CP_ID_KIND_UNQUALIFIED
;
3448 return id_expression
;
3451 decl
= id_expression
;
3453 /* If DECL is a variable that would be out of scope under
3454 ANSI/ISO rules, but in scope in the ARM, name lookup
3455 will succeed. Issue a diagnostic here. */
3457 decl
= check_for_out_of_scope_variable (decl
);
3459 /* Remember that the name was used in the definition of
3460 the current class so that we can check later to see if
3461 the meaning would have been different after the class
3462 was entirely defined. */
3463 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3464 maybe_note_name_used_in_class (id_expression
, decl
);
3466 /* A use in unevaluated operand might not be instantiated appropriately
3467 if tsubst_copy builds a dummy parm, or if we never instantiate a
3468 generic lambda, so mark it now. */
3469 if (processing_template_decl
&& cp_unevaluated_operand
)
3470 mark_type_use (decl
);
3472 /* Disallow uses of local variables from containing functions, except
3473 within lambda-expressions. */
3474 if (outer_automatic_var_p (decl
))
3476 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3477 if (decl
== error_mark_node
)
3478 return error_mark_node
;
3481 /* Also disallow uses of function parameters outside the function
3482 body, except inside an unevaluated context (i.e. decltype). */
3483 if (TREE_CODE (decl
) == PARM_DECL
3484 && DECL_CONTEXT (decl
) == NULL_TREE
3485 && !cp_unevaluated_operand
)
3487 *error_msg
= "use of parameter outside function body";
3488 return error_mark_node
;
3492 /* If we didn't find anything, or what we found was a type,
3493 then this wasn't really an id-expression. */
3494 if (TREE_CODE (decl
) == TEMPLATE_DECL
3495 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3497 *error_msg
= "missing template arguments";
3498 return error_mark_node
;
3500 else if (TREE_CODE (decl
) == TYPE_DECL
3501 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3503 *error_msg
= "expected primary-expression";
3504 return error_mark_node
;
3507 /* If the name resolved to a template parameter, there is no
3508 need to look it up again later. */
3509 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3510 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3514 *idk
= CP_ID_KIND_NONE
;
3515 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3516 decl
= TEMPLATE_PARM_DECL (decl
);
3517 r
= convert_from_reference (DECL_INITIAL (decl
));
3519 if (integral_constant_expression_p
3520 && !dependent_type_p (TREE_TYPE (decl
))
3521 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3523 if (!allow_non_integral_constant_expression_p
)
3524 error ("template parameter %qD of type %qT is not allowed in "
3525 "an integral constant expression because it is not of "
3526 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3527 *non_integral_constant_expression_p
= true;
3533 bool dependent_p
= type_dependent_expression_p (decl
);
3535 /* If the declaration was explicitly qualified indicate
3536 that. The semantics of `A::f(3)' are different than
3537 `f(3)' if `f' is virtual. */
3539 ? CP_ID_KIND_QUALIFIED
3540 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3541 ? CP_ID_KIND_TEMPLATE_ID
3543 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3544 : CP_ID_KIND_UNQUALIFIED
)));
3546 /* If the name was dependent on a template parameter, we will
3547 resolve the name at instantiation time. */
3550 /* If we found a variable, then name lookup during the
3551 instantiation will always resolve to the same VAR_DECL
3552 (or an instantiation thereof). */
3554 || TREE_CODE (decl
) == CONST_DECL
3555 || TREE_CODE (decl
) == PARM_DECL
)
3558 return convert_from_reference (decl
);
3561 /* Create a SCOPE_REF for qualified names, if the scope is
3567 if (address_p
&& done
)
3568 decl
= finish_qualified_id_expr (scope
, decl
,
3572 tf_warning_or_error
);
3575 tree type
= NULL_TREE
;
3576 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3577 type
= TREE_TYPE (decl
);
3578 decl
= build_qualified_name (type
,
3584 if (TREE_TYPE (decl
))
3585 decl
= convert_from_reference (decl
);
3588 /* A TEMPLATE_ID already contains all the information we
3590 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3591 return id_expression
;
3592 /* The same is true for FIELD_DECL, but we also need to
3593 make sure that the syntax is correct. */
3594 else if (TREE_CODE (decl
) == FIELD_DECL
)
3596 /* Since SCOPE is NULL here, this is an unqualified name.
3597 Access checking has been performed during name lookup
3598 already. Turn off checking to avoid duplicate errors. */
3599 push_deferring_access_checks (dk_no_check
);
3600 decl
= finish_non_static_data_member
3602 /*qualifying_scope=*/NULL_TREE
);
3603 pop_deferring_access_checks ();
3606 return id_expression
;
3609 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3611 error ("use of namespace %qD as expression", decl
);
3612 return error_mark_node
;
3614 else if (DECL_CLASS_TEMPLATE_P (decl
))
3616 error ("use of class template %qT as expression", decl
);
3617 return error_mark_node
;
3619 else if (TREE_CODE (decl
) == TREE_LIST
)
3621 /* Ambiguous reference to base members. */
3622 error ("request for member %qD is ambiguous in "
3623 "multiple inheritance lattice", id_expression
);
3624 print_candidates (decl
);
3625 return error_mark_node
;
3628 /* Mark variable-like entities as used. Functions are similarly
3629 marked either below or after overload resolution. */
3631 || TREE_CODE (decl
) == PARM_DECL
3632 || TREE_CODE (decl
) == CONST_DECL
3633 || TREE_CODE (decl
) == RESULT_DECL
)
3634 && !mark_used (decl
))
3635 return error_mark_node
;
3637 /* Only certain kinds of names are allowed in constant
3638 expression. Template parameters have already
3639 been handled above. */
3640 if (! error_operand_p (decl
)
3641 && integral_constant_expression_p
3642 && ! decl_constant_var_p (decl
)
3643 && TREE_CODE (decl
) != CONST_DECL
3644 && ! builtin_valid_in_constant_expr_p (decl
))
3646 if (!allow_non_integral_constant_expression_p
)
3648 error ("%qD cannot appear in a constant-expression", decl
);
3649 return error_mark_node
;
3651 *non_integral_constant_expression_p
= true;
3656 && !cp_unevaluated_operand
3657 && !processing_template_decl
3658 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3659 && CP_DECL_THREAD_LOCAL_P (decl
)
3660 && (wrap
= get_tls_wrapper_fn (decl
)))
3662 /* Replace an evaluated use of the thread_local variable with
3663 a call to its wrapper. */
3664 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3666 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3667 && variable_template_p (TREE_OPERAND (decl
, 0)))
3669 decl
= finish_template_variable (decl
);
3671 decl
= convert_from_reference (decl
);
3675 decl
= (adjust_result_of_qualified_name_lookup
3676 (decl
, scope
, current_nonlambda_class_type()));
3678 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3682 decl
= finish_qualified_id_expr (scope
,
3688 tf_warning_or_error
);
3690 decl
= convert_from_reference (decl
);
3692 else if (TREE_CODE (decl
) == FIELD_DECL
)
3694 /* Since SCOPE is NULL here, this is an unqualified name.
3695 Access checking has been performed during name lookup
3696 already. Turn off checking to avoid duplicate errors. */
3697 push_deferring_access_checks (dk_no_check
);
3698 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3699 /*qualifying_scope=*/NULL_TREE
);
3700 pop_deferring_access_checks ();
3702 else if (is_overloaded_fn (decl
))
3706 first_fn
= get_first_fn (decl
);
3707 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3708 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3710 if (!really_overloaded_fn (decl
)
3711 && !mark_used (first_fn
))
3712 return error_mark_node
;
3715 && TREE_CODE (first_fn
) == FUNCTION_DECL
3716 && DECL_FUNCTION_MEMBER_P (first_fn
)
3717 && !shared_member_p (decl
))
3719 /* A set of member functions. */
3720 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3721 return finish_class_member_access_expr (decl
, id_expression
,
3722 /*template_p=*/false,
3723 tf_warning_or_error
);
3726 decl
= baselink_for_fns (decl
);
3730 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3731 && DECL_CLASS_SCOPE_P (decl
))
3733 tree context
= context_for_name_lookup (decl
);
3734 if (context
!= current_class_type
)
3736 tree path
= currently_open_derived_class (context
);
3737 perform_or_defer_access_check (TYPE_BINFO (path
),
3739 tf_warning_or_error
);
3743 decl
= convert_from_reference (decl
);
3747 return cp_expr (decl
, location
);
3750 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3751 use as a type-specifier. */
3754 finish_typeof (tree expr
)
3758 if (type_dependent_expression_p (expr
))
3760 type
= cxx_make_type (TYPEOF_TYPE
);
3761 TYPEOF_TYPE_EXPR (type
) = expr
;
3762 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3767 expr
= mark_type_use (expr
);
3769 type
= unlowered_expr_type (expr
);
3771 if (!type
|| type
== unknown_type_node
)
3773 error ("type of %qE is unknown", expr
);
3774 return error_mark_node
;
3780 /* Implement the __underlying_type keyword: Return the underlying
3781 type of TYPE, suitable for use as a type-specifier. */
3784 finish_underlying_type (tree type
)
3786 tree underlying_type
;
3788 if (processing_template_decl
)
3790 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3791 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3792 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3794 return underlying_type
;
3797 complete_type (type
);
3799 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3801 error ("%qT is not an enumeration type", type
);
3802 return error_mark_node
;
3805 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3807 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3808 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3809 See finish_enum_value_list for details. */
3810 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3812 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3813 TYPE_UNSIGNED (underlying_type
));
3815 return underlying_type
;
3818 /* Implement the __direct_bases keyword: Return the direct base classes
3822 calculate_direct_bases (tree type
)
3824 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3825 tree bases_vec
= NULL_TREE
;
3826 vec
<tree
, va_gc
> *base_binfos
;
3830 complete_type (type
);
3832 if (!NON_UNION_CLASS_TYPE_P (type
))
3833 return make_tree_vec (0);
3835 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3837 /* Virtual bases are initialized first */
3838 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3840 if (BINFO_VIRTUAL_P (binfo
))
3842 vec_safe_push (vector
, binfo
);
3846 /* Now non-virtuals */
3847 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3849 if (!BINFO_VIRTUAL_P (binfo
))
3851 vec_safe_push (vector
, binfo
);
3856 bases_vec
= make_tree_vec (vector
->length ());
3858 for (i
= 0; i
< vector
->length (); ++i
)
3860 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3865 /* Implement the __bases keyword: Return the base classes
3868 /* Find morally non-virtual base classes by walking binfo hierarchy */
3869 /* Virtual base classes are handled separately in finish_bases */
3872 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3874 /* Don't walk bases of virtual bases */
3875 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3879 dfs_calculate_bases_post (tree binfo
, void *data_
)
3881 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3882 if (!BINFO_VIRTUAL_P (binfo
))
3884 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3889 /* Calculates the morally non-virtual base classes of a class */
3890 static vec
<tree
, va_gc
> *
3891 calculate_bases_helper (tree type
)
3893 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3895 /* Now add non-virtual base classes in order of construction */
3896 if (TYPE_BINFO (type
))
3897 dfs_walk_all (TYPE_BINFO (type
),
3898 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3903 calculate_bases (tree type
)
3905 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3906 tree bases_vec
= NULL_TREE
;
3908 vec
<tree
, va_gc
> *vbases
;
3909 vec
<tree
, va_gc
> *nonvbases
;
3912 complete_type (type
);
3914 if (!NON_UNION_CLASS_TYPE_P (type
))
3915 return make_tree_vec (0);
3917 /* First go through virtual base classes */
3918 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3919 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3921 vec
<tree
, va_gc
> *vbase_bases
;
3922 vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3923 vec_safe_splice (vector
, vbase_bases
);
3924 release_tree_vector (vbase_bases
);
3927 /* Now for the non-virtual bases */
3928 nonvbases
= calculate_bases_helper (type
);
3929 vec_safe_splice (vector
, nonvbases
);
3930 release_tree_vector (nonvbases
);
3932 /* Note that during error recovery vector->length can even be zero. */
3933 if (vector
->length () > 1)
3935 /* Last element is entire class, so don't copy */
3936 bases_vec
= make_tree_vec (vector
->length() - 1);
3938 for (i
= 0; i
< vector
->length () - 1; ++i
)
3939 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3942 bases_vec
= make_tree_vec (0);
3944 release_tree_vector (vector
);
3949 finish_bases (tree type
, bool direct
)
3951 tree bases
= NULL_TREE
;
3953 if (!processing_template_decl
)
3955 /* Parameter packs can only be used in templates */
3956 error ("Parameter pack __bases only valid in template declaration");
3957 return error_mark_node
;
3960 bases
= cxx_make_type (BASES
);
3961 BASES_TYPE (bases
) = type
;
3962 BASES_DIRECT (bases
) = direct
;
3963 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3968 /* Perform C++-specific checks for __builtin_offsetof before calling
3972 finish_offsetof (tree expr
, location_t loc
)
3974 /* If we're processing a template, we can't finish the semantics yet.
3975 Otherwise we can fold the entire expression now. */
3976 if (processing_template_decl
)
3978 expr
= build1 (OFFSETOF_EXPR
, size_type_node
, expr
);
3979 SET_EXPR_LOCATION (expr
, loc
);
3983 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3985 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3986 TREE_OPERAND (expr
, 2));
3987 return error_mark_node
;
3989 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3990 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3991 || TREE_TYPE (expr
) == unknown_type_node
)
3993 if (INDIRECT_REF_P (expr
))
3994 error ("second operand of %<offsetof%> is neither a single "
3995 "identifier nor a sequence of member accesses and "
3996 "array references");
3999 if (TREE_CODE (expr
) == COMPONENT_REF
4000 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4001 expr
= TREE_OPERAND (expr
, 1);
4002 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4004 return error_mark_node
;
4006 if (REFERENCE_REF_P (expr
))
4007 expr
= TREE_OPERAND (expr
, 0);
4008 if (TREE_CODE (expr
) == COMPONENT_REF
)
4010 tree object
= TREE_OPERAND (expr
, 0);
4011 if (!complete_type_or_else (TREE_TYPE (object
), object
))
4012 return error_mark_node
;
4013 if (warn_invalid_offsetof
4014 && CLASS_TYPE_P (TREE_TYPE (object
))
4015 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (object
))
4016 && cp_unevaluated_operand
== 0)
4017 pedwarn (loc
, OPT_Winvalid_offsetof
,
4018 "offsetof within non-standard-layout type %qT is undefined",
4019 TREE_TYPE (object
));
4021 return fold_offsetof (expr
);
4024 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4025 function is broken out from the above for the benefit of the tree-ssa
4029 simplify_aggr_init_expr (tree
*tp
)
4031 tree aggr_init_expr
= *tp
;
4033 /* Form an appropriate CALL_EXPR. */
4034 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4035 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4036 tree type
= TREE_TYPE (slot
);
4039 enum style_t
{ ctor
, arg
, pcc
} style
;
4041 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4043 #ifdef PCC_STATIC_STRUCT_RETURN
4049 gcc_assert (TREE_ADDRESSABLE (type
));
4053 call_expr
= build_call_array_loc (input_location
,
4054 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4056 aggr_init_expr_nargs (aggr_init_expr
),
4057 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4058 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4059 CALL_EXPR_LIST_INIT_P (call_expr
) = CALL_EXPR_LIST_INIT_P (aggr_init_expr
);
4060 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4064 /* Replace the first argument to the ctor with the address of the
4066 cxx_mark_addressable (slot
);
4067 CALL_EXPR_ARG (call_expr
, 0) =
4068 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4070 else if (style
== arg
)
4072 /* Just mark it addressable here, and leave the rest to
4073 expand_call{,_inline}. */
4074 cxx_mark_addressable (slot
);
4075 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4076 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4078 else if (style
== pcc
)
4080 /* If we're using the non-reentrant PCC calling convention, then we
4081 need to copy the returned value out of the static buffer into the
4083 push_deferring_access_checks (dk_no_check
);
4084 call_expr
= build_aggr_init (slot
, call_expr
,
4085 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4086 tf_warning_or_error
);
4087 pop_deferring_access_checks ();
4088 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4091 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4093 tree init
= build_zero_init (type
, NULL_TREE
,
4094 /*static_storage_p=*/false);
4095 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4096 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4103 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4106 emit_associated_thunks (tree fn
)
4108 /* When we use vcall offsets, we emit thunks with the virtual
4109 functions to which they thunk. The whole point of vcall offsets
4110 is so that you can know statically the entire set of thunks that
4111 will ever be needed for a given virtual function, thereby
4112 enabling you to output all the thunks with the function itself. */
4113 if (DECL_VIRTUAL_P (fn
)
4114 /* Do not emit thunks for extern template instantiations. */
4115 && ! DECL_REALLY_EXTERN (fn
))
4119 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4121 if (!THUNK_ALIAS (thunk
))
4123 use_thunk (thunk
, /*emit_p=*/1);
4124 if (DECL_RESULT_THUNK_P (thunk
))
4128 for (probe
= DECL_THUNKS (thunk
);
4129 probe
; probe
= DECL_CHAIN (probe
))
4130 use_thunk (probe
, /*emit_p=*/1);
4134 gcc_assert (!DECL_THUNKS (thunk
));
4139 /* Generate RTL for FN. */
4142 expand_or_defer_fn_1 (tree fn
)
4144 /* When the parser calls us after finishing the body of a template
4145 function, we don't really want to expand the body. */
4146 if (processing_template_decl
)
4148 /* Normally, collection only occurs in rest_of_compilation. So,
4149 if we don't collect here, we never collect junk generated
4150 during the processing of templates until we hit a
4151 non-template function. It's not safe to do this inside a
4152 nested class, though, as the parser may have local state that
4153 is not a GC root. */
4154 if (!function_depth
)
4159 gcc_assert (DECL_SAVED_TREE (fn
));
4161 /* We make a decision about linkage for these functions at the end
4162 of the compilation. Until that point, we do not want the back
4163 end to output them -- but we do want it to see the bodies of
4164 these functions so that it can inline them as appropriate. */
4165 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4167 if (DECL_INTERFACE_KNOWN (fn
))
4168 /* We've already made a decision as to how this function will
4171 tentative_decl_linkage (fn
);
4173 import_export_decl (fn
);
4175 /* If the user wants us to keep all inline functions, then mark
4176 this function as needed so that finish_file will make sure to
4177 output it later. Similarly, all dllexport'd functions must
4178 be emitted; there may be callers in other DLLs. */
4179 if (DECL_DECLARED_INLINE_P (fn
)
4180 && !DECL_REALLY_EXTERN (fn
)
4181 && (flag_keep_inline_functions
4182 || (flag_keep_inline_dllexport
4183 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4186 DECL_EXTERNAL (fn
) = 0;
4190 /* If this is a constructor or destructor body, we have to clone
4192 if (maybe_clone_body (fn
))
4194 /* We don't want to process FN again, so pretend we've written
4195 it out, even though we haven't. */
4196 TREE_ASM_WRITTEN (fn
) = 1;
4197 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4198 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4199 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4203 /* There's no reason to do any of the work here if we're only doing
4204 semantic analysis; this code just generates RTL. */
4205 if (flag_syntax_only
)
4212 expand_or_defer_fn (tree fn
)
4214 if (expand_or_defer_fn_1 (fn
))
4218 /* Expand or defer, at the whim of the compilation unit manager. */
4219 cgraph_node::finalize_function (fn
, function_depth
> 1);
4220 emit_associated_thunks (fn
);
4228 nrv_data () : visited (37) {}
4232 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4235 /* Helper function for walk_tree, used by finalize_nrv below. */
4238 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4240 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4243 /* No need to walk into types. There wouldn't be any need to walk into
4244 non-statements, except that we have to consider STMT_EXPRs. */
4247 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4248 but differs from using NULL_TREE in that it indicates that we care
4249 about the value of the RESULT_DECL. */
4250 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4251 TREE_OPERAND (*tp
, 0) = dp
->result
;
4252 /* Change all cleanups for the NRV to only run when an exception is
4254 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4255 && CLEANUP_DECL (*tp
) == dp
->var
)
4256 CLEANUP_EH_ONLY (*tp
) = 1;
4257 /* Replace the DECL_EXPR for the NRV with an initialization of the
4258 RESULT_DECL, if needed. */
4259 else if (TREE_CODE (*tp
) == DECL_EXPR
4260 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4263 if (DECL_INITIAL (dp
->var
)
4264 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4265 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4266 DECL_INITIAL (dp
->var
));
4268 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4269 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4270 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4273 /* And replace all uses of the NRV with the RESULT_DECL. */
4274 else if (*tp
== dp
->var
)
4277 /* Avoid walking into the same tree more than once. Unfortunately, we
4278 can't just use walk_tree_without duplicates because it would only call
4279 us for the first occurrence of dp->var in the function body. */
4280 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4286 /* Keep iterating. */
4290 /* Called from finish_function to implement the named return value
4291 optimization by overriding all the RETURN_EXPRs and pertinent
4292 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4293 RESULT_DECL for the function. */
4296 finalize_nrv (tree
*tp
, tree var
, tree result
)
4298 struct nrv_data data
;
4300 /* Copy name from VAR to RESULT. */
4301 DECL_NAME (result
) = DECL_NAME (var
);
4302 /* Don't forget that we take its address. */
4303 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4304 /* Finally set DECL_VALUE_EXPR to avoid assigning
4305 a stack slot at -O0 for the original var and debug info
4306 uses RESULT location for VAR. */
4307 SET_DECL_VALUE_EXPR (var
, result
);
4308 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4311 data
.result
= result
;
4312 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4315 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4318 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4319 bool need_copy_ctor
, bool need_copy_assignment
,
4322 int save_errorcount
= errorcount
;
4325 /* Always allocate 3 elements for simplicity. These are the
4326 function decls for the ctor, dtor, and assignment op.
4327 This layout is known to the three lang hooks,
4328 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4329 and cxx_omp_clause_assign_op. */
4330 info
= make_tree_vec (3);
4331 CP_OMP_CLAUSE_INFO (c
) = info
;
4333 if (need_default_ctor
|| need_copy_ctor
)
4335 if (need_default_ctor
)
4336 t
= get_default_ctor (type
);
4338 t
= get_copy_ctor (type
, tf_warning_or_error
);
4340 if (t
&& !trivial_fn_p (t
))
4341 TREE_VEC_ELT (info
, 0) = t
;
4344 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4345 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4347 if (need_copy_assignment
)
4349 t
= get_copy_assign (type
);
4351 if (t
&& !trivial_fn_p (t
))
4352 TREE_VEC_ELT (info
, 2) = t
;
4355 return errorcount
!= save_errorcount
;
4358 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4359 FIELD_DECL, otherwise return DECL itself. */
4362 omp_clause_decl_field (tree decl
)
4365 && DECL_HAS_VALUE_EXPR_P (decl
)
4366 && DECL_ARTIFICIAL (decl
)
4367 && DECL_LANG_SPECIFIC (decl
)
4368 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4370 tree f
= DECL_VALUE_EXPR (decl
);
4371 if (TREE_CODE (f
) == INDIRECT_REF
)
4372 f
= TREE_OPERAND (f
, 0);
4373 if (TREE_CODE (f
) == COMPONENT_REF
)
4375 f
= TREE_OPERAND (f
, 1);
4376 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4383 /* Adjust DECL if needed for printing using %qE. */
4386 omp_clause_printable_decl (tree decl
)
4388 tree t
= omp_clause_decl_field (decl
);
4394 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4395 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4399 omp_note_field_privatization (tree f
, tree t
)
4401 if (!omp_private_member_map
)
4402 omp_private_member_map
= new hash_map
<tree
, tree
>;
4403 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4407 omp_private_member_vec
.safe_push (f
);
4408 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4409 omp_private_member_vec
.safe_push (integer_zero_node
);
4413 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4417 omp_privatize_field (tree t
, bool shared
)
4419 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4420 if (m
== error_mark_node
)
4421 return error_mark_node
;
4422 if (!omp_private_member_map
&& !shared
)
4423 omp_private_member_map
= new hash_map
<tree
, tree
>;
4424 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4426 gcc_assert (TREE_CODE (m
) == INDIRECT_REF
);
4427 m
= TREE_OPERAND (m
, 0);
4429 tree vb
= NULL_TREE
;
4430 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4433 v
= create_temporary_var (TREE_TYPE (m
));
4434 if (!DECL_LANG_SPECIFIC (v
))
4435 retrofit_lang_decl (v
);
4436 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4437 SET_DECL_VALUE_EXPR (v
, m
);
4438 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4440 omp_private_member_vec
.safe_push (t
);
4445 /* Helper function for handle_omp_array_sections. Called recursively
4446 to handle multiple array-section-subscripts. C is the clause,
4447 T current expression (initially OMP_CLAUSE_DECL), which is either
4448 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4449 expression if specified, TREE_VALUE length expression if specified,
4450 TREE_CHAIN is what it has been specified after, or some decl.
4451 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4452 set to true if any of the array-section-subscript could have length
4453 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4454 first array-section-subscript which is known not to have length
4456 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4457 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4458 all are or may have length of 1, array-section-subscript [:2] is the
4459 first one known not to have length 1. For array-section-subscript
4460 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4461 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4462 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4463 case though, as some lengths could be zero. */
4466 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4467 bool &maybe_zero_len
, unsigned int &first_non_one
,
4468 enum c_omp_region_type ort
)
4470 tree ret
, low_bound
, length
, type
;
4471 if (TREE_CODE (t
) != TREE_LIST
)
4473 if (error_operand_p (t
))
4474 return error_mark_node
;
4475 if (REFERENCE_REF_P (t
)
4476 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4477 t
= TREE_OPERAND (t
, 0);
4479 if (TREE_CODE (t
) == COMPONENT_REF
4481 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4482 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4483 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4484 && !type_dependent_expression_p (t
))
4486 if (DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4488 error_at (OMP_CLAUSE_LOCATION (c
),
4489 "bit-field %qE in %qs clause",
4490 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4491 return error_mark_node
;
4493 while (TREE_CODE (t
) == COMPONENT_REF
)
4495 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4497 error_at (OMP_CLAUSE_LOCATION (c
),
4498 "%qE is a member of a union", t
);
4499 return error_mark_node
;
4501 t
= TREE_OPERAND (t
, 0);
4504 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4506 if (processing_template_decl
)
4509 error_at (OMP_CLAUSE_LOCATION (c
),
4510 "%qD is not a variable in %qs clause", t
,
4511 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4513 error_at (OMP_CLAUSE_LOCATION (c
),
4514 "%qE is not a variable in %qs clause", t
,
4515 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4516 return error_mark_node
;
4518 else if (TREE_CODE (t
) == PARM_DECL
4519 && DECL_ARTIFICIAL (t
)
4520 && DECL_NAME (t
) == this_identifier
)
4522 error_at (OMP_CLAUSE_LOCATION (c
),
4523 "%<this%> allowed in OpenMP only in %<declare simd%>"
4525 return error_mark_node
;
4527 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4528 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4530 error_at (OMP_CLAUSE_LOCATION (c
),
4531 "%qD is threadprivate variable in %qs clause", t
,
4532 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4533 return error_mark_node
;
4535 if (type_dependent_expression_p (ret
))
4537 ret
= convert_from_reference (ret
);
4541 if (ort
== C_ORT_OMP
4542 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4543 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4544 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4545 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4546 maybe_zero_len
, first_non_one
, ort
);
4547 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4550 type
= TREE_TYPE (ret
);
4551 low_bound
= TREE_PURPOSE (t
);
4552 length
= TREE_VALUE (t
);
4553 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4554 || (length
&& type_dependent_expression_p (length
)))
4557 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4558 return error_mark_node
;
4560 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4562 error_at (OMP_CLAUSE_LOCATION (c
),
4563 "low bound %qE of array section does not have integral type",
4565 return error_mark_node
;
4567 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4569 error_at (OMP_CLAUSE_LOCATION (c
),
4570 "length %qE of array section does not have integral type",
4572 return error_mark_node
;
4575 low_bound
= mark_rvalue_use (low_bound
);
4577 length
= mark_rvalue_use (length
);
4578 /* We need to reduce to real constant-values for checks below. */
4580 length
= fold_simple (length
);
4582 low_bound
= fold_simple (low_bound
);
4584 && TREE_CODE (low_bound
) == INTEGER_CST
4585 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4586 > TYPE_PRECISION (sizetype
))
4587 low_bound
= fold_convert (sizetype
, low_bound
);
4589 && TREE_CODE (length
) == INTEGER_CST
4590 && TYPE_PRECISION (TREE_TYPE (length
))
4591 > TYPE_PRECISION (sizetype
))
4592 length
= fold_convert (sizetype
, length
);
4593 if (low_bound
== NULL_TREE
)
4594 low_bound
= integer_zero_node
;
4596 if (length
!= NULL_TREE
)
4598 if (!integer_nonzerop (length
))
4600 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4601 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4603 if (integer_zerop (length
))
4605 error_at (OMP_CLAUSE_LOCATION (c
),
4606 "zero length array section in %qs clause",
4607 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4608 return error_mark_node
;
4612 maybe_zero_len
= true;
4614 if (first_non_one
== types
.length ()
4615 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4618 if (TREE_CODE (type
) == ARRAY_TYPE
)
4620 if (length
== NULL_TREE
4621 && (TYPE_DOMAIN (type
) == NULL_TREE
4622 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4624 error_at (OMP_CLAUSE_LOCATION (c
),
4625 "for unknown bound array type length expression must "
4627 return error_mark_node
;
4629 if (TREE_CODE (low_bound
) == INTEGER_CST
4630 && tree_int_cst_sgn (low_bound
) == -1)
4632 error_at (OMP_CLAUSE_LOCATION (c
),
4633 "negative low bound in array section in %qs clause",
4634 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4635 return error_mark_node
;
4637 if (length
!= NULL_TREE
4638 && TREE_CODE (length
) == INTEGER_CST
4639 && tree_int_cst_sgn (length
) == -1)
4641 error_at (OMP_CLAUSE_LOCATION (c
),
4642 "negative length in array section in %qs clause",
4643 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4644 return error_mark_node
;
4646 if (TYPE_DOMAIN (type
)
4647 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4648 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4651 tree size
= size_binop (PLUS_EXPR
,
4652 TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4654 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4656 if (tree_int_cst_lt (size
, low_bound
))
4658 error_at (OMP_CLAUSE_LOCATION (c
),
4659 "low bound %qE above array section size "
4660 "in %qs clause", low_bound
,
4661 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4662 return error_mark_node
;
4664 if (tree_int_cst_equal (size
, low_bound
))
4666 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4667 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4669 error_at (OMP_CLAUSE_LOCATION (c
),
4670 "zero length array section in %qs clause",
4671 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4672 return error_mark_node
;
4674 maybe_zero_len
= true;
4676 else if (length
== NULL_TREE
4677 && first_non_one
== types
.length ()
4678 && tree_int_cst_equal
4679 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4683 else if (length
== NULL_TREE
)
4685 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4686 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4687 maybe_zero_len
= true;
4688 if (first_non_one
== types
.length ())
4691 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4693 if (tree_int_cst_lt (size
, length
))
4695 error_at (OMP_CLAUSE_LOCATION (c
),
4696 "length %qE above array section size "
4697 "in %qs clause", length
,
4698 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4699 return error_mark_node
;
4701 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4704 = size_binop (PLUS_EXPR
,
4705 fold_convert (sizetype
, low_bound
),
4706 fold_convert (sizetype
, length
));
4707 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4708 && tree_int_cst_lt (size
, lbpluslen
))
4710 error_at (OMP_CLAUSE_LOCATION (c
),
4711 "high bound %qE above array section size "
4712 "in %qs clause", lbpluslen
,
4713 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4714 return error_mark_node
;
4719 else if (length
== NULL_TREE
)
4721 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4722 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4723 maybe_zero_len
= true;
4724 if (first_non_one
== types
.length ())
4728 /* For [lb:] we will need to evaluate lb more than once. */
4729 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4731 tree lb
= cp_save_expr (low_bound
);
4732 if (lb
!= low_bound
)
4734 TREE_PURPOSE (t
) = lb
;
4739 else if (TREE_CODE (type
) == POINTER_TYPE
)
4741 if (length
== NULL_TREE
)
4743 error_at (OMP_CLAUSE_LOCATION (c
),
4744 "for pointer type length expression must be specified");
4745 return error_mark_node
;
4747 if (length
!= NULL_TREE
4748 && TREE_CODE (length
) == INTEGER_CST
4749 && tree_int_cst_sgn (length
) == -1)
4751 error_at (OMP_CLAUSE_LOCATION (c
),
4752 "negative length in array section in %qs clause",
4753 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4754 return error_mark_node
;
4756 /* If there is a pointer type anywhere but in the very first
4757 array-section-subscript, the array section can't be contiguous. */
4758 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4759 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4761 error_at (OMP_CLAUSE_LOCATION (c
),
4762 "array section is not contiguous in %qs clause",
4763 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4764 return error_mark_node
;
4769 error_at (OMP_CLAUSE_LOCATION (c
),
4770 "%qE does not have pointer or array type", ret
);
4771 return error_mark_node
;
4773 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4774 types
.safe_push (TREE_TYPE (ret
));
4775 /* We will need to evaluate lb more than once. */
4776 tree lb
= cp_save_expr (low_bound
);
4777 if (lb
!= low_bound
)
4779 TREE_PURPOSE (t
) = lb
;
4782 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4786 /* Handle array sections for clause C. */
4789 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4791 bool maybe_zero_len
= false;
4792 unsigned int first_non_one
= 0;
4793 auto_vec
<tree
, 10> types
;
4794 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4795 maybe_zero_len
, first_non_one
,
4797 if (first
== error_mark_node
)
4799 if (first
== NULL_TREE
)
4801 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4803 tree t
= OMP_CLAUSE_DECL (c
);
4804 tree tem
= NULL_TREE
;
4805 if (processing_template_decl
)
4807 /* Need to evaluate side effects in the length expressions
4809 while (TREE_CODE (t
) == TREE_LIST
)
4811 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4813 if (tem
== NULL_TREE
)
4814 tem
= TREE_VALUE (t
);
4816 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4817 TREE_VALUE (t
), tem
);
4822 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4823 OMP_CLAUSE_DECL (c
) = first
;
4827 unsigned int num
= types
.length (), i
;
4828 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4829 tree condition
= NULL_TREE
;
4831 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4832 maybe_zero_len
= true;
4833 if (processing_template_decl
&& maybe_zero_len
)
4836 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4839 tree low_bound
= TREE_PURPOSE (t
);
4840 tree length
= TREE_VALUE (t
);
4844 && TREE_CODE (low_bound
) == INTEGER_CST
4845 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4846 > TYPE_PRECISION (sizetype
))
4847 low_bound
= fold_convert (sizetype
, low_bound
);
4849 && TREE_CODE (length
) == INTEGER_CST
4850 && TYPE_PRECISION (TREE_TYPE (length
))
4851 > TYPE_PRECISION (sizetype
))
4852 length
= fold_convert (sizetype
, length
);
4853 if (low_bound
== NULL_TREE
)
4854 low_bound
= integer_zero_node
;
4855 if (!maybe_zero_len
&& i
> first_non_one
)
4857 if (integer_nonzerop (low_bound
))
4858 goto do_warn_noncontiguous
;
4859 if (length
!= NULL_TREE
4860 && TREE_CODE (length
) == INTEGER_CST
4861 && TYPE_DOMAIN (types
[i
])
4862 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4863 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4867 size
= size_binop (PLUS_EXPR
,
4868 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4870 if (!tree_int_cst_equal (length
, size
))
4872 do_warn_noncontiguous
:
4873 error_at (OMP_CLAUSE_LOCATION (c
),
4874 "array section is not contiguous in %qs "
4876 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4880 if (!processing_template_decl
4881 && length
!= NULL_TREE
4882 && TREE_SIDE_EFFECTS (length
))
4884 if (side_effects
== NULL_TREE
)
4885 side_effects
= length
;
4887 side_effects
= build2 (COMPOUND_EXPR
,
4888 TREE_TYPE (side_effects
),
4889 length
, side_effects
);
4892 else if (processing_template_decl
)
4898 if (i
> first_non_one
4899 && ((length
&& integer_nonzerop (length
))
4900 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
))
4903 l
= fold_convert (sizetype
, length
);
4906 l
= size_binop (PLUS_EXPR
,
4907 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4909 l
= size_binop (MINUS_EXPR
, l
,
4910 fold_convert (sizetype
, low_bound
));
4912 if (i
> first_non_one
)
4914 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4916 if (condition
== NULL_TREE
)
4919 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4922 else if (size
== NULL_TREE
)
4924 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4925 tree eltype
= TREE_TYPE (types
[num
- 1]);
4926 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4927 eltype
= TREE_TYPE (eltype
);
4928 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4929 size
= size_binop (EXACT_DIV_EXPR
, size
,
4930 size_in_bytes (eltype
));
4931 size
= size_binop (MULT_EXPR
, size
, l
);
4933 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4934 size
, size_zero_node
);
4937 size
= size_binop (MULT_EXPR
, size
, l
);
4940 if (!processing_template_decl
)
4943 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
4944 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4946 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
4947 tree index_type
= build_index_type (size
);
4948 tree eltype
= TREE_TYPE (first
);
4949 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4950 eltype
= TREE_TYPE (eltype
);
4951 tree type
= build_array_type (eltype
, index_type
);
4952 tree ptype
= build_pointer_type (eltype
);
4953 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4954 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
4955 t
= convert_from_reference (t
);
4956 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
4957 t
= build_fold_addr_expr (t
);
4958 tree t2
= build_fold_addr_expr (first
);
4959 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4960 ptrdiff_type_node
, t2
);
4961 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
4962 ptrdiff_type_node
, t2
,
4963 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4964 ptrdiff_type_node
, t
));
4965 if (tree_fits_shwi_p (t2
))
4966 t
= build2 (MEM_REF
, type
, t
,
4967 build_int_cst (ptype
, tree_to_shwi (t2
)));
4970 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4972 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
4973 TREE_TYPE (t
), t
, t2
);
4974 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
4976 OMP_CLAUSE_DECL (c
) = t
;
4979 OMP_CLAUSE_DECL (c
) = first
;
4980 OMP_CLAUSE_SIZE (c
) = size
;
4981 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
4982 || (TREE_CODE (t
) == COMPONENT_REF
4983 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
4985 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
4986 switch (OMP_CLAUSE_MAP_KIND (c
))
4988 case GOMP_MAP_ALLOC
:
4991 case GOMP_MAP_TOFROM
:
4992 case GOMP_MAP_ALWAYS_TO
:
4993 case GOMP_MAP_ALWAYS_FROM
:
4994 case GOMP_MAP_ALWAYS_TOFROM
:
4995 case GOMP_MAP_RELEASE
:
4996 case GOMP_MAP_DELETE
:
4997 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5002 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5004 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5005 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5006 else if (TREE_CODE (t
) == COMPONENT_REF
)
5007 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5008 else if (REFERENCE_REF_P (t
)
5009 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5011 t
= TREE_OPERAND (t
, 0);
5012 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5015 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5016 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5017 && !cxx_mark_addressable (t
))
5019 OMP_CLAUSE_DECL (c2
) = t
;
5020 t
= build_fold_addr_expr (first
);
5021 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5022 ptrdiff_type_node
, t
);
5023 tree ptr
= OMP_CLAUSE_DECL (c2
);
5024 ptr
= convert_from_reference (ptr
);
5025 if (!POINTER_TYPE_P (TREE_TYPE (ptr
)))
5026 ptr
= build_fold_addr_expr (ptr
);
5027 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5028 ptrdiff_type_node
, t
,
5029 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5030 ptrdiff_type_node
, ptr
));
5031 OMP_CLAUSE_SIZE (c2
) = t
;
5032 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5033 OMP_CLAUSE_CHAIN (c
) = c2
;
5034 ptr
= OMP_CLAUSE_DECL (c2
);
5035 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5036 && TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
5037 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5039 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5041 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5042 OMP_CLAUSE_DECL (c3
) = ptr
;
5043 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5044 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5046 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5047 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5048 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5049 OMP_CLAUSE_CHAIN (c2
) = c3
;
5056 /* Return identifier to look up for omp declare reduction. */
5059 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5061 const char *p
= NULL
;
5062 const char *m
= NULL
;
5063 switch (reduction_code
)
5071 case TRUTH_ANDIF_EXPR
:
5072 case TRUTH_ORIF_EXPR
:
5073 reduction_id
= ansi_opname (reduction_code
);
5087 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5088 return error_mark_node
;
5089 p
= IDENTIFIER_POINTER (reduction_id
);
5092 if (type
!= NULL_TREE
)
5093 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5095 const char prefix
[] = "omp declare reduction ";
5096 size_t lenp
= sizeof (prefix
);
5097 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5099 size_t len
= strlen (p
);
5100 size_t lenm
= m
? strlen (m
) + 1 : 0;
5101 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5103 memcpy (name
, prefix
, lenp
- 1);
5104 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5107 name
[lenp
+ len
- 1] = '~';
5108 memcpy (name
+ lenp
+ len
, m
, lenm
);
5110 return get_identifier (name
);
5113 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5114 FUNCTION_DECL or NULL_TREE if not found. */
5117 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5118 vec
<tree
> *ambiguousp
)
5121 tree baselink
= NULL_TREE
;
5122 if (identifier_p (id
))
5125 bool nonint_cst_expression_p
;
5126 const char *error_msg
;
5127 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5128 tree decl
= lookup_name (id
);
5129 if (decl
== NULL_TREE
)
5130 decl
= error_mark_node
;
5131 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5132 &nonint_cst_expression_p
, false, true, false,
5133 false, &error_msg
, loc
);
5134 if (idk
== CP_ID_KIND_UNQUALIFIED
5135 && identifier_p (id
))
5137 vec
<tree
, va_gc
> *args
= NULL
;
5138 vec_safe_push (args
, build_reference_type (type
));
5139 id
= perform_koenig_lookup (id
, args
, tf_none
);
5142 else if (TREE_CODE (id
) == SCOPE_REF
)
5143 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5144 omp_reduction_id (ERROR_MARK
,
5145 TREE_OPERAND (id
, 1),
5149 if (id
&& is_overloaded_fn (id
))
5151 for (; id
; id
= OVL_NEXT (id
))
5153 tree fndecl
= OVL_CURRENT (id
);
5154 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5156 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5157 if (same_type_p (TREE_TYPE (argtype
), type
))
5161 if (id
&& BASELINK_P (fns
))
5168 if (id
== NULL_TREE
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5170 vec
<tree
> ambiguous
= vNULL
;
5171 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5173 if (ambiguousp
== NULL
)
5174 ambiguousp
= &ambiguous
;
5175 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5177 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5178 baselinkp
? baselinkp
: &baselink
,
5180 if (id
== NULL_TREE
)
5182 if (!ambiguousp
->is_empty ())
5183 ambiguousp
->safe_push (id
);
5184 else if (ret
!= NULL_TREE
)
5186 ambiguousp
->safe_push (ret
);
5187 ambiguousp
->safe_push (id
);
5193 if (ambiguousp
!= &ambiguous
)
5195 if (!ambiguous
.is_empty ())
5197 const char *str
= _("candidates are:");
5200 error_at (loc
, "user defined reduction lookup is ambiguous");
5201 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5203 inform (DECL_SOURCE_LOCATION (udr
), "%s %#D", str
, udr
);
5205 str
= get_spaces (str
);
5207 ambiguous
.release ();
5208 ret
= error_mark_node
;
5209 baselink
= NULL_TREE
;
5214 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5215 id
, id
, tf_warning_or_error
);
5219 /* Helper function for cp_parser_omp_declare_reduction_exprs
5221 Remove CLEANUP_STMT for data (omp_priv variable).
5222 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5226 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5230 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5231 *tp
= CLEANUP_BODY (*tp
);
5232 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5234 tree decl
= DECL_EXPR_DECL (*tp
);
5235 if (!processing_template_decl
5236 && decl
== (tree
) data
5237 && DECL_INITIAL (decl
)
5238 && DECL_INITIAL (decl
) != error_mark_node
)
5240 tree list
= NULL_TREE
;
5241 append_to_statement_list_force (*tp
, &list
);
5242 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5243 decl
, DECL_INITIAL (decl
));
5244 DECL_INITIAL (decl
) = NULL_TREE
;
5245 append_to_statement_list_force (init_expr
, &list
);
5252 /* Data passed from cp_check_omp_declare_reduction to
5253 cp_check_omp_declare_reduction_r. */
5255 struct cp_check_omp_declare_reduction_data
5262 /* Helper function for cp_check_omp_declare_reduction, called via
5266 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5268 struct cp_check_omp_declare_reduction_data
*udr_data
5269 = (struct cp_check_omp_declare_reduction_data
*) data
;
5271 && !DECL_ARTIFICIAL (*tp
)
5272 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5273 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5275 location_t loc
= udr_data
->loc
;
5276 if (udr_data
->combiner_p
)
5277 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5278 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5281 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5282 "to variable %qD which is not %<omp_priv%> nor "
5290 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5293 cp_check_omp_declare_reduction (tree udr
)
5295 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5296 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
5297 type
= TREE_TYPE (type
);
5299 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5301 if (type
== error_mark_node
)
5303 if (ARITHMETIC_TYPE_P (type
))
5305 static enum tree_code predef_codes
[]
5306 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5307 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5308 for (i
= 0; i
< 8; i
++)
5310 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5311 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5312 const char *n2
= IDENTIFIER_POINTER (id
);
5313 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5314 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5315 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5320 && TREE_CODE (type
) != COMPLEX_EXPR
)
5322 const char prefix_minmax
[] = "omp declare reduction m";
5323 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5324 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5325 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5326 prefix_minmax
, prefix_size
) == 0
5327 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5328 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5329 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5334 error_at (loc
, "predeclared arithmetic type %qT in "
5335 "%<#pragma omp declare reduction%>", type
);
5339 else if (TREE_CODE (type
) == FUNCTION_TYPE
5340 || TREE_CODE (type
) == METHOD_TYPE
5341 || TREE_CODE (type
) == ARRAY_TYPE
)
5343 error_at (loc
, "function or array type %qT in "
5344 "%<#pragma omp declare reduction%>", type
);
5347 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5349 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5353 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5355 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5356 "%<#pragma omp declare reduction%>", type
);
5360 tree body
= DECL_SAVED_TREE (udr
);
5361 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5364 tree_stmt_iterator tsi
;
5365 struct cp_check_omp_declare_reduction_data data
;
5366 memset (data
.stmts
, 0, sizeof data
.stmts
);
5367 for (i
= 0, tsi
= tsi_start (body
);
5368 i
< 7 && !tsi_end_p (tsi
);
5369 i
++, tsi_next (&tsi
))
5370 data
.stmts
[i
] = tsi_stmt (tsi
);
5372 gcc_assert (tsi_end_p (tsi
));
5375 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5376 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5377 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5379 data
.combiner_p
= true;
5380 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5382 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5386 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5387 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5388 data
.combiner_p
= false;
5389 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5391 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5392 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5393 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5395 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5399 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5400 an inline call. But, remap
5401 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5402 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5405 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5406 tree decl
, tree placeholder
)
5409 hash_map
<tree
, tree
> decl_map
;
5411 decl_map
.put (omp_decl1
, placeholder
);
5412 decl_map
.put (omp_decl2
, decl
);
5413 memset (&id
, 0, sizeof (id
));
5414 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5415 id
.dst_fn
= current_function_decl
;
5416 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5417 id
.decl_map
= &decl_map
;
5419 id
.copy_decl
= copy_decl_no_change
;
5420 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5421 id
.transform_new_cfg
= true;
5422 id
.transform_return_to_modify
= false;
5423 id
.transform_lang_insert_block
= NULL
;
5425 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5429 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5430 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5433 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5435 if (*tp
== (tree
) data
)
5440 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5441 Return true if there is some error and the clause should be removed. */
5444 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5446 tree t
= OMP_CLAUSE_DECL (c
);
5447 bool predefined
= false;
5448 if (TREE_CODE (t
) == TREE_LIST
)
5450 gcc_assert (processing_template_decl
);
5453 tree type
= TREE_TYPE (t
);
5454 if (TREE_CODE (t
) == MEM_REF
)
5455 type
= TREE_TYPE (type
);
5456 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5457 type
= TREE_TYPE (type
);
5458 if (TREE_CODE (type
) == ARRAY_TYPE
)
5461 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5462 while (TREE_CODE (type
) == ARRAY_TYPE
)
5463 type
= TREE_TYPE (type
);
5464 if (!processing_template_decl
)
5466 t
= require_complete_type (t
);
5467 if (t
== error_mark_node
)
5469 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5470 TYPE_SIZE_UNIT (type
));
5471 if (integer_zerop (size
))
5473 error ("%qE in %<reduction%> clause is a zero size array",
5474 omp_clause_printable_decl (t
));
5477 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5478 tree index_type
= build_index_type (size
);
5479 tree atype
= build_array_type (type
, index_type
);
5480 tree ptype
= build_pointer_type (type
);
5481 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5482 t
= build_fold_addr_expr (t
);
5483 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5484 OMP_CLAUSE_DECL (c
) = t
;
5487 if (type
== error_mark_node
)
5489 else if (ARITHMETIC_TYPE_P (type
))
5490 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5499 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5506 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5510 case TRUTH_ANDIF_EXPR
:
5511 case TRUTH_ORIF_EXPR
:
5512 if (FLOAT_TYPE_P (type
))
5519 else if (TYPE_READONLY (type
))
5521 error ("%qE has const type for %<reduction%>",
5522 omp_clause_printable_decl (t
));
5525 else if (!processing_template_decl
)
5527 t
= require_complete_type (t
);
5528 if (t
== error_mark_node
)
5530 OMP_CLAUSE_DECL (c
) = t
;
5535 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5538 else if (processing_template_decl
)
5541 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5543 type
= TYPE_MAIN_VARIANT (type
);
5544 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5545 if (id
== NULL_TREE
)
5546 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5547 NULL_TREE
, NULL_TREE
);
5548 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5551 if (id
== error_mark_node
)
5553 id
= OVL_CURRENT (id
);
5555 tree body
= DECL_SAVED_TREE (id
);
5558 if (TREE_CODE (body
) == STATEMENT_LIST
)
5560 tree_stmt_iterator tsi
;
5561 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5564 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5565 atype
= TREE_TYPE (atype
);
5566 bool need_static_cast
= !same_type_p (type
, atype
);
5567 memset (stmts
, 0, sizeof stmts
);
5568 for (i
= 0, tsi
= tsi_start (body
);
5569 i
< 7 && !tsi_end_p (tsi
);
5570 i
++, tsi_next (&tsi
))
5571 stmts
[i
] = tsi_stmt (tsi
);
5572 gcc_assert (tsi_end_p (tsi
));
5576 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5577 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5578 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5579 DECL_ARTIFICIAL (placeholder
) = 1;
5580 DECL_IGNORED_P (placeholder
) = 1;
5581 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5582 if (TREE_CODE (t
) == MEM_REF
)
5584 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5586 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5587 DECL_IGNORED_P (decl_placeholder
) = 1;
5588 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5590 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5591 cxx_mark_addressable (placeholder
);
5592 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5593 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
)))
5595 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5596 : OMP_CLAUSE_DECL (c
));
5597 tree omp_out
= placeholder
;
5598 tree omp_in
= decl_placeholder
? decl_placeholder
5599 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5600 if (need_static_cast
)
5602 tree rtype
= build_reference_type (atype
);
5603 omp_out
= build_static_cast (rtype
, omp_out
,
5604 tf_warning_or_error
);
5605 omp_in
= build_static_cast (rtype
, omp_in
,
5606 tf_warning_or_error
);
5607 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5609 omp_out
= convert_from_reference (omp_out
);
5610 omp_in
= convert_from_reference (omp_in
);
5612 OMP_CLAUSE_REDUCTION_MERGE (c
)
5613 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5614 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5618 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5619 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5620 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5621 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5622 : OMP_CLAUSE_DECL (c
));
5623 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5624 cxx_mark_addressable (placeholder
);
5625 tree omp_priv
= decl_placeholder
? decl_placeholder
5626 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5627 tree omp_orig
= placeholder
;
5628 if (need_static_cast
)
5632 error_at (OMP_CLAUSE_LOCATION (c
),
5633 "user defined reduction with constructor "
5634 "initializer for base class %qT", atype
);
5637 tree rtype
= build_reference_type (atype
);
5638 omp_priv
= build_static_cast (rtype
, omp_priv
,
5639 tf_warning_or_error
);
5640 omp_orig
= build_static_cast (rtype
, omp_orig
,
5641 tf_warning_or_error
);
5642 if (omp_priv
== error_mark_node
5643 || omp_orig
== error_mark_node
)
5645 omp_priv
= convert_from_reference (omp_priv
);
5646 omp_orig
= convert_from_reference (omp_orig
);
5649 *need_default_ctor
= true;
5650 OMP_CLAUSE_REDUCTION_INIT (c
)
5651 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5652 DECL_EXPR_DECL (stmts
[3]),
5653 omp_priv
, omp_orig
);
5654 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5655 find_omp_placeholder_r
, placeholder
, NULL
))
5656 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5660 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5661 *need_default_ctor
= true;
5665 tree v
= decl_placeholder
? decl_placeholder
5666 : convert_from_reference (t
);
5667 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5668 init
= build_constructor (TREE_TYPE (v
), NULL
);
5670 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5671 OMP_CLAUSE_REDUCTION_INIT (c
)
5672 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5677 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5681 error ("user defined reduction not found for %qE",
5682 omp_clause_printable_decl (t
));
5685 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5686 gcc_assert (TYPE_SIZE_UNIT (type
)
5687 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5691 /* Called from finish_struct_1. linear(this) or linear(this:step)
5692 clauses might not be finalized yet because the class has been incomplete
5693 when parsing #pragma omp declare simd methods. Fix those up now. */
5696 finish_omp_declare_simd_methods (tree t
)
5698 if (processing_template_decl
)
5701 for (tree x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
5703 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5705 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5706 if (!ods
|| !TREE_VALUE (ods
))
5708 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5709 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5710 && integer_zerop (OMP_CLAUSE_DECL (c
))
5711 && OMP_CLAUSE_LINEAR_STEP (c
)
5712 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
)))
5715 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5716 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5717 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5718 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5719 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5724 /* Adjust sink depend clause to take into account pointer offsets.
5726 Return TRUE if there was a problem processing the offset, and the
5727 whole clause should be removed. */
5730 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5732 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5733 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5735 /* Make sure we don't adjust things twice for templates. */
5736 if (processing_template_decl
)
5739 for (; t
; t
= TREE_CHAIN (t
))
5741 tree decl
= TREE_VALUE (t
);
5742 if (TREE_CODE (TREE_TYPE (decl
)) == POINTER_TYPE
)
5744 tree offset
= TREE_PURPOSE (t
);
5745 bool neg
= wi::neg_p ((wide_int
) offset
);
5746 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5747 decl
= mark_rvalue_use (decl
);
5748 decl
= convert_from_reference (decl
);
5749 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5750 neg
? MINUS_EXPR
: PLUS_EXPR
,
5752 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5753 MINUS_EXPR
, sizetype
,
5754 fold_convert (sizetype
, t2
),
5755 fold_convert (sizetype
, decl
));
5756 if (t2
== error_mark_node
)
5758 TREE_PURPOSE (t
) = t2
;
5764 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5765 Remove any elements from the list that are invalid. */
5768 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
5770 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5771 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
5773 tree safelen
= NULL_TREE
;
5774 bool branch_seen
= false;
5775 bool copyprivate_seen
= false;
5776 bool ordered_seen
= false;
5778 bitmap_obstack_initialize (NULL
);
5779 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5780 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5781 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5782 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5783 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
5784 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
5785 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
5787 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5789 bool remove
= false;
5790 bool field_ok
= false;
5792 switch (OMP_CLAUSE_CODE (c
))
5794 case OMP_CLAUSE_SHARED
:
5795 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5796 goto check_dup_generic
;
5797 case OMP_CLAUSE_PRIVATE
:
5798 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5799 goto check_dup_generic
;
5800 case OMP_CLAUSE_REDUCTION
:
5801 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5802 t
= OMP_CLAUSE_DECL (c
);
5803 if (TREE_CODE (t
) == TREE_LIST
)
5805 if (handle_omp_array_sections (c
, ort
))
5810 if (TREE_CODE (t
) == TREE_LIST
)
5812 while (TREE_CODE (t
) == TREE_LIST
)
5817 gcc_assert (TREE_CODE (t
) == MEM_REF
);
5818 t
= TREE_OPERAND (t
, 0);
5819 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
5820 t
= TREE_OPERAND (t
, 0);
5821 if (TREE_CODE (t
) == ADDR_EXPR
5822 || TREE_CODE (t
) == INDIRECT_REF
)
5823 t
= TREE_OPERAND (t
, 0);
5825 tree n
= omp_clause_decl_field (t
);
5828 goto check_dup_generic_t
;
5830 goto check_dup_generic
;
5831 case OMP_CLAUSE_COPYPRIVATE
:
5832 copyprivate_seen
= true;
5833 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5834 goto check_dup_generic
;
5835 case OMP_CLAUSE_COPYIN
:
5836 goto check_dup_generic
;
5837 case OMP_CLAUSE_LINEAR
:
5838 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5839 t
= OMP_CLAUSE_DECL (c
);
5840 if (ort
!= C_ORT_OMP_DECLARE_SIMD
5841 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
5843 error_at (OMP_CLAUSE_LOCATION (c
),
5844 "modifier should not be specified in %<linear%> "
5845 "clause on %<simd%> or %<for%> constructs");
5846 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
5848 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5849 && !type_dependent_expression_p (t
))
5851 tree type
= TREE_TYPE (t
);
5852 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5853 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
5854 && TREE_CODE (type
) != REFERENCE_TYPE
)
5856 error ("linear clause with %qs modifier applied to "
5857 "non-reference variable with %qT type",
5858 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5859 ? "ref" : "uval", TREE_TYPE (t
));
5863 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5864 type
= TREE_TYPE (type
);
5865 if (ort
== C_ORT_CILK
)
5867 if (!INTEGRAL_TYPE_P (type
)
5868 && !SCALAR_FLOAT_TYPE_P (type
)
5869 && TREE_CODE (type
) != POINTER_TYPE
)
5871 error ("linear clause applied to non-integral, "
5872 "non-floating, non-pointer variable with %qT type",
5878 else if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
5880 if (!INTEGRAL_TYPE_P (type
)
5881 && TREE_CODE (type
) != POINTER_TYPE
)
5883 error ("linear clause applied to non-integral non-pointer"
5884 " variable with %qT type", TREE_TYPE (t
));
5890 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5892 t
= integer_one_node
;
5893 if (t
== error_mark_node
)
5898 else if (!type_dependent_expression_p (t
)
5899 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5900 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5901 || TREE_CODE (t
) != PARM_DECL
5902 || TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
5903 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
5905 error ("linear step expression must be integral");
5911 t
= mark_rvalue_use (t
);
5912 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
5914 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
5915 goto check_dup_generic
;
5917 if (!processing_template_decl
5918 && (VAR_P (OMP_CLAUSE_DECL (c
))
5919 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
5921 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
5923 t
= maybe_constant_value (t
);
5924 if (TREE_CODE (t
) != INTEGER_CST
)
5926 error_at (OMP_CLAUSE_LOCATION (c
),
5927 "%<linear%> clause step %qE is neither "
5928 "constant nor a parameter", t
);
5933 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5934 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
5935 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5936 type
= TREE_TYPE (type
);
5937 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
5939 type
= build_pointer_type (type
);
5940 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
5941 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
5943 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
5944 MINUS_EXPR
, sizetype
,
5945 fold_convert (sizetype
, t
),
5946 fold_convert (sizetype
, d
));
5947 if (t
== error_mark_node
)
5953 else if (TREE_CODE (type
) == POINTER_TYPE
5954 /* Can't multiply the step yet if *this
5955 is still incomplete type. */
5956 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5957 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
5958 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
5959 || DECL_NAME (OMP_CLAUSE_DECL (c
))
5961 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
5963 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
5964 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
5966 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
5967 MINUS_EXPR
, sizetype
,
5968 fold_convert (sizetype
, t
),
5969 fold_convert (sizetype
, d
));
5970 if (t
== error_mark_node
)
5977 t
= fold_convert (type
, t
);
5979 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
5981 goto check_dup_generic
;
5983 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
5986 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
5987 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
5990 t
= OMP_CLAUSE_DECL (c
);
5991 check_dup_generic_t
:
5992 if (t
== current_class_ptr
5993 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5994 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
5995 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
5997 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6002 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6003 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6005 if (processing_template_decl
)
6008 error ("%qD is not a variable in clause %qs", t
,
6009 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6011 error ("%qE is not a variable in clause %qs", t
,
6012 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6015 else if (ort
== C_ORT_ACC
6016 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6018 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6020 error ("%qD appears more than once in reduction clauses", t
);
6024 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6026 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6027 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6028 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6030 error ("%qD appears more than once in data clauses", t
);
6033 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6034 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6036 if (ort
== C_ORT_ACC
)
6037 error ("%qD appears more than once in data clauses", t
);
6039 error ("%qD appears both in data and map clauses", t
);
6043 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6048 && TREE_CODE (t
) == FIELD_DECL
6049 && t
== OMP_CLAUSE_DECL (c
)
6050 && ort
!= C_ORT_ACC
)
6053 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6054 == OMP_CLAUSE_SHARED
));
6055 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6060 case OMP_CLAUSE_FIRSTPRIVATE
:
6061 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6063 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6065 t
= OMP_CLAUSE_DECL (c
);
6066 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6068 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6073 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6074 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6075 || TREE_CODE (t
) != FIELD_DECL
))
6077 if (processing_template_decl
)
6080 error ("%qD is not a variable in clause %<firstprivate%>", t
);
6082 error ("%qE is not a variable in clause %<firstprivate%>", t
);
6085 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6086 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6088 error ("%qD appears more than once in data clauses", t
);
6091 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6093 if (ort
== C_ORT_ACC
)
6094 error ("%qD appears more than once in data clauses", t
);
6096 error ("%qD appears both in data and map clauses", t
);
6100 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6101 goto handle_field_decl
;
6103 case OMP_CLAUSE_LASTPRIVATE
:
6104 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6106 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6108 t
= OMP_CLAUSE_DECL (c
);
6109 if (t
== current_class_ptr
)
6111 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6116 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6117 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6118 || TREE_CODE (t
) != FIELD_DECL
))
6120 if (processing_template_decl
)
6123 error ("%qD is not a variable in clause %<lastprivate%>", t
);
6125 error ("%qE is not a variable in clause %<lastprivate%>", t
);
6128 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6129 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6131 error ("%qD appears more than once in data clauses", t
);
6135 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6136 goto handle_field_decl
;
6139 t
= OMP_CLAUSE_IF_EXPR (c
);
6140 t
= maybe_convert_cond (t
);
6141 if (t
== error_mark_node
)
6143 else if (!processing_template_decl
)
6144 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6145 OMP_CLAUSE_IF_EXPR (c
) = t
;
6148 case OMP_CLAUSE_FINAL
:
6149 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6150 t
= maybe_convert_cond (t
);
6151 if (t
== error_mark_node
)
6153 else if (!processing_template_decl
)
6154 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6155 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6158 case OMP_CLAUSE_GANG
:
6159 /* Operand 1 is the gang static: argument. */
6160 t
= OMP_CLAUSE_OPERAND (c
, 1);
6163 if (t
== error_mark_node
)
6165 else if (!type_dependent_expression_p (t
)
6166 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6168 error ("%<gang%> static expression must be integral");
6173 t
= mark_rvalue_use (t
);
6174 if (!processing_template_decl
)
6176 t
= maybe_constant_value (t
);
6177 if (TREE_CODE (t
) == INTEGER_CST
6178 && tree_int_cst_sgn (t
) != 1
6179 && t
!= integer_minus_one_node
)
6181 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6182 "%<gang%> static value must be"
6184 t
= integer_one_node
;
6187 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6189 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6191 /* Check operand 0, the num argument. */
6193 case OMP_CLAUSE_WORKER
:
6194 case OMP_CLAUSE_VECTOR
:
6195 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6198 case OMP_CLAUSE_NUM_TASKS
:
6199 case OMP_CLAUSE_NUM_TEAMS
:
6200 case OMP_CLAUSE_NUM_THREADS
:
6201 case OMP_CLAUSE_NUM_GANGS
:
6202 case OMP_CLAUSE_NUM_WORKERS
:
6203 case OMP_CLAUSE_VECTOR_LENGTH
:
6204 t
= OMP_CLAUSE_OPERAND (c
, 0);
6205 if (t
== error_mark_node
)
6207 else if (!type_dependent_expression_p (t
)
6208 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6210 switch (OMP_CLAUSE_CODE (c
))
6212 case OMP_CLAUSE_GANG
:
6213 error_at (OMP_CLAUSE_LOCATION (c
),
6214 "%<gang%> num expression must be integral"); break;
6215 case OMP_CLAUSE_VECTOR
:
6216 error_at (OMP_CLAUSE_LOCATION (c
),
6217 "%<vector%> length expression must be integral");
6219 case OMP_CLAUSE_WORKER
:
6220 error_at (OMP_CLAUSE_LOCATION (c
),
6221 "%<worker%> num expression must be integral");
6224 error_at (OMP_CLAUSE_LOCATION (c
),
6225 "%qs expression must be integral",
6226 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6232 t
= mark_rvalue_use (t
);
6233 if (!processing_template_decl
)
6235 t
= maybe_constant_value (t
);
6236 if (TREE_CODE (t
) == INTEGER_CST
6237 && tree_int_cst_sgn (t
) != 1)
6239 switch (OMP_CLAUSE_CODE (c
))
6241 case OMP_CLAUSE_GANG
:
6242 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6243 "%<gang%> num value must be positive");
6245 case OMP_CLAUSE_VECTOR
:
6246 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6247 "%<vector%> length value must be"
6250 case OMP_CLAUSE_WORKER
:
6251 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6252 "%<worker%> num value must be"
6256 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6257 "%qs value must be positive",
6258 omp_clause_code_name
6259 [OMP_CLAUSE_CODE (c
)]);
6261 t
= integer_one_node
;
6263 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6265 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6269 case OMP_CLAUSE_SCHEDULE
:
6270 if (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
)
6272 const char *p
= NULL
;
6273 switch (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_MASK
)
6275 case OMP_CLAUSE_SCHEDULE_STATIC
: p
= "static"; break;
6276 case OMP_CLAUSE_SCHEDULE_DYNAMIC
: break;
6277 case OMP_CLAUSE_SCHEDULE_GUIDED
: break;
6278 case OMP_CLAUSE_SCHEDULE_AUTO
: p
= "auto"; break;
6279 case OMP_CLAUSE_SCHEDULE_RUNTIME
: p
= "runtime"; break;
6280 default: gcc_unreachable ();
6284 error_at (OMP_CLAUSE_LOCATION (c
),
6285 "%<nonmonotonic%> modifier specified for %qs "
6286 "schedule kind", p
);
6287 OMP_CLAUSE_SCHEDULE_KIND (c
)
6288 = (enum omp_clause_schedule_kind
)
6289 (OMP_CLAUSE_SCHEDULE_KIND (c
)
6290 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
6294 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6297 else if (t
== error_mark_node
)
6299 else if (!type_dependent_expression_p (t
)
6300 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
6301 != OMP_CLAUSE_SCHEDULE_CILKFOR
)
6302 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6304 error ("schedule chunk size expression must be integral");
6309 t
= mark_rvalue_use (t
);
6310 if (!processing_template_decl
)
6312 if (OMP_CLAUSE_SCHEDULE_KIND (c
)
6313 == OMP_CLAUSE_SCHEDULE_CILKFOR
)
6315 t
= convert_to_integer (long_integer_type_node
, t
);
6316 if (t
== error_mark_node
)
6322 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6324 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6328 case OMP_CLAUSE_SIMDLEN
:
6329 case OMP_CLAUSE_SAFELEN
:
6330 t
= OMP_CLAUSE_OPERAND (c
, 0);
6331 if (t
== error_mark_node
)
6333 else if (!type_dependent_expression_p (t
)
6334 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6336 error ("%qs length expression must be integral",
6337 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6342 t
= mark_rvalue_use (t
);
6343 t
= maybe_constant_value (t
);
6344 if (!processing_template_decl
)
6346 if (TREE_CODE (t
) != INTEGER_CST
6347 || tree_int_cst_sgn (t
) != 1)
6349 error ("%qs length expression must be positive constant"
6350 " integer expression",
6351 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6355 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6356 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6361 case OMP_CLAUSE_ASYNC
:
6362 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6363 if (t
== error_mark_node
)
6365 else if (!type_dependent_expression_p (t
)
6366 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6368 error ("%<async%> expression must be integral");
6373 t
= mark_rvalue_use (t
);
6374 if (!processing_template_decl
)
6375 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6376 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6380 case OMP_CLAUSE_WAIT
:
6381 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6382 if (t
== error_mark_node
)
6384 else if (!processing_template_decl
)
6385 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6386 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6389 case OMP_CLAUSE_THREAD_LIMIT
:
6390 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6391 if (t
== error_mark_node
)
6393 else if (!type_dependent_expression_p (t
)
6394 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6396 error ("%<thread_limit%> expression must be integral");
6401 t
= mark_rvalue_use (t
);
6402 if (!processing_template_decl
)
6404 t
= maybe_constant_value (t
);
6405 if (TREE_CODE (t
) == INTEGER_CST
6406 && tree_int_cst_sgn (t
) != 1)
6408 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6409 "%<thread_limit%> value must be positive");
6410 t
= integer_one_node
;
6412 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6414 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6418 case OMP_CLAUSE_DEVICE
:
6419 t
= OMP_CLAUSE_DEVICE_ID (c
);
6420 if (t
== error_mark_node
)
6422 else if (!type_dependent_expression_p (t
)
6423 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6425 error ("%<device%> id must be integral");
6430 t
= mark_rvalue_use (t
);
6431 if (!processing_template_decl
)
6432 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6433 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6437 case OMP_CLAUSE_DIST_SCHEDULE
:
6438 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6441 else if (t
== error_mark_node
)
6443 else if (!type_dependent_expression_p (t
)
6444 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6446 error ("%<dist_schedule%> chunk size expression must be "
6452 t
= mark_rvalue_use (t
);
6453 if (!processing_template_decl
)
6454 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6455 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6459 case OMP_CLAUSE_ALIGNED
:
6460 t
= OMP_CLAUSE_DECL (c
);
6461 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6463 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6468 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6470 if (processing_template_decl
)
6473 error ("%qD is not a variable in %<aligned%> clause", t
);
6475 error ("%qE is not a variable in %<aligned%> clause", t
);
6478 else if (!type_dependent_expression_p (t
)
6479 && TREE_CODE (TREE_TYPE (t
)) != POINTER_TYPE
6480 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6481 && (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6482 || (!POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6483 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6486 error_at (OMP_CLAUSE_LOCATION (c
),
6487 "%qE in %<aligned%> clause is neither a pointer nor "
6488 "an array nor a reference to pointer or array", t
);
6491 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6493 error ("%qD appears more than once in %<aligned%> clauses", t
);
6497 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6498 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6499 if (t
== error_mark_node
)
6501 else if (t
== NULL_TREE
)
6503 else if (!type_dependent_expression_p (t
)
6504 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6506 error ("%<aligned%> clause alignment expression must "
6512 t
= mark_rvalue_use (t
);
6513 t
= maybe_constant_value (t
);
6514 if (!processing_template_decl
)
6516 if (TREE_CODE (t
) != INTEGER_CST
6517 || tree_int_cst_sgn (t
) != 1)
6519 error ("%<aligned%> clause alignment expression must be "
6520 "positive constant integer expression");
6524 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6528 case OMP_CLAUSE_DEPEND
:
6529 t
= OMP_CLAUSE_DECL (c
);
6532 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6533 == OMP_CLAUSE_DEPEND_SOURCE
);
6536 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6538 if (cp_finish_omp_clause_depend_sink (c
))
6542 if (TREE_CODE (t
) == TREE_LIST
)
6544 if (handle_omp_array_sections (c
, ort
))
6548 if (t
== error_mark_node
)
6550 else if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6552 if (processing_template_decl
)
6555 error ("%qD is not a variable in %<depend%> clause", t
);
6557 error ("%qE is not a variable in %<depend%> clause", t
);
6560 else if (t
== current_class_ptr
)
6562 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6566 else if (!processing_template_decl
6567 && !cxx_mark_addressable (t
))
6571 case OMP_CLAUSE_MAP
:
6573 case OMP_CLAUSE_FROM
:
6574 case OMP_CLAUSE__CACHE_
:
6575 t
= OMP_CLAUSE_DECL (c
);
6576 if (TREE_CODE (t
) == TREE_LIST
)
6578 if (handle_omp_array_sections (c
, ort
))
6582 t
= OMP_CLAUSE_DECL (c
);
6583 if (TREE_CODE (t
) != TREE_LIST
6584 && !type_dependent_expression_p (t
)
6585 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6587 error_at (OMP_CLAUSE_LOCATION (c
),
6588 "array section does not have mappable type "
6590 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6593 while (TREE_CODE (t
) == ARRAY_REF
)
6594 t
= TREE_OPERAND (t
, 0);
6595 if (TREE_CODE (t
) == COMPONENT_REF
6596 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
6598 while (TREE_CODE (t
) == COMPONENT_REF
)
6599 t
= TREE_OPERAND (t
, 0);
6600 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6602 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6604 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6605 error ("%qD appears more than once in motion"
6607 else if (ort
== C_ORT_ACC
)
6608 error ("%qD appears more than once in data"
6611 error ("%qD appears more than once in map"
6617 bitmap_set_bit (&map_head
, DECL_UID (t
));
6618 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6624 if (t
== error_mark_node
)
6629 if (REFERENCE_REF_P (t
)
6630 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
6632 t
= TREE_OPERAND (t
, 0);
6633 OMP_CLAUSE_DECL (c
) = t
;
6635 if (TREE_CODE (t
) == COMPONENT_REF
6636 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6637 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
6639 if (type_dependent_expression_p (t
))
6641 if (DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6643 error_at (OMP_CLAUSE_LOCATION (c
),
6644 "bit-field %qE in %qs clause",
6645 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6648 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6650 error_at (OMP_CLAUSE_LOCATION (c
),
6651 "%qE does not have a mappable type in %qs clause",
6652 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6655 while (TREE_CODE (t
) == COMPONENT_REF
)
6657 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
6660 error_at (OMP_CLAUSE_LOCATION (c
),
6661 "%qE is a member of a union", t
);
6665 t
= TREE_OPERAND (t
, 0);
6669 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6671 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6672 goto handle_map_references
;
6675 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6677 if (processing_template_decl
)
6679 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6680 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6681 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
6684 error ("%qD is not a variable in %qs clause", t
,
6685 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6687 error ("%qE is not a variable in %qs clause", t
,
6688 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6691 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
6693 error ("%qD is threadprivate variable in %qs clause", t
,
6694 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6697 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6699 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6704 else if (!processing_template_decl
6705 && TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6706 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
6707 || (OMP_CLAUSE_MAP_KIND (c
)
6708 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
6709 && !cxx_mark_addressable (t
))
6711 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6712 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6713 || (OMP_CLAUSE_MAP_KIND (c
)
6714 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
6715 && t
== OMP_CLAUSE_DECL (c
)
6716 && !type_dependent_expression_p (t
)
6717 && !cp_omp_mappable_type ((TREE_CODE (TREE_TYPE (t
))
6719 ? TREE_TYPE (TREE_TYPE (t
))
6722 error_at (OMP_CLAUSE_LOCATION (c
),
6723 "%qD does not have a mappable type in %qs clause", t
,
6724 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6727 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6728 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
6729 && !type_dependent_expression_p (t
)
6730 && !POINTER_TYPE_P (TREE_TYPE (t
)))
6732 error ("%qD is not a pointer variable", t
);
6735 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6736 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
6738 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6739 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6741 error ("%qD appears more than once in data clauses", t
);
6744 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6746 if (ort
== C_ORT_ACC
)
6747 error ("%qD appears more than once in data clauses", t
);
6749 error ("%qD appears both in data and map clauses", t
);
6753 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6755 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6757 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6758 error ("%qD appears more than once in motion clauses", t
);
6759 if (ort
== C_ORT_ACC
)
6760 error ("%qD appears more than once in data clauses", t
);
6762 error ("%qD appears more than once in map clauses", t
);
6765 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6766 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6768 if (ort
== C_ORT_ACC
)
6769 error ("%qD appears more than once in data clauses", t
);
6771 error ("%qD appears both in data and map clauses", t
);
6776 bitmap_set_bit (&map_head
, DECL_UID (t
));
6777 if (t
!= OMP_CLAUSE_DECL (c
)
6778 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
6779 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6781 handle_map_references
:
6783 && !processing_template_decl
6784 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6785 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
))) == REFERENCE_TYPE
)
6787 t
= OMP_CLAUSE_DECL (c
);
6788 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6790 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6791 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6793 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6795 else if (OMP_CLAUSE_MAP_KIND (c
)
6796 != GOMP_MAP_FIRSTPRIVATE_POINTER
6797 && (OMP_CLAUSE_MAP_KIND (c
)
6798 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
6799 && (OMP_CLAUSE_MAP_KIND (c
)
6800 != GOMP_MAP_ALWAYS_POINTER
))
6802 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
6804 if (TREE_CODE (t
) == COMPONENT_REF
)
6805 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
6807 OMP_CLAUSE_SET_MAP_KIND (c2
,
6808 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
6809 OMP_CLAUSE_DECL (c2
) = t
;
6810 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
6811 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
6812 OMP_CLAUSE_CHAIN (c
) = c2
;
6813 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6814 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6816 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6822 case OMP_CLAUSE_TO_DECLARE
:
6823 case OMP_CLAUSE_LINK
:
6824 t
= OMP_CLAUSE_DECL (c
);
6825 if (TREE_CODE (t
) == FUNCTION_DECL
6826 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6828 else if (!VAR_P (t
))
6830 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6832 if (TREE_CODE (t
) == OVERLOAD
&& OVL_CHAIN (t
))
6833 error_at (OMP_CLAUSE_LOCATION (c
),
6834 "overloaded function name %qE in clause %qs", t
,
6835 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6836 else if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
6837 error_at (OMP_CLAUSE_LOCATION (c
),
6838 "template %qE in clause %qs", t
,
6839 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6841 error_at (OMP_CLAUSE_LOCATION (c
),
6842 "%qE is neither a variable nor a function name "
6844 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6847 error_at (OMP_CLAUSE_LOCATION (c
),
6848 "%qE is not a variable in clause %qs", t
,
6849 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6852 else if (DECL_THREAD_LOCAL_P (t
))
6854 error_at (OMP_CLAUSE_LOCATION (c
),
6855 "%qD is threadprivate variable in %qs clause", t
,
6856 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6859 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6861 error_at (OMP_CLAUSE_LOCATION (c
),
6862 "%qD does not have a mappable type in %qs clause", t
,
6863 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6868 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
6870 error_at (OMP_CLAUSE_LOCATION (c
),
6871 "%qE appears more than once on the same "
6872 "%<declare target%> directive", t
);
6876 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6879 case OMP_CLAUSE_UNIFORM
:
6880 t
= OMP_CLAUSE_DECL (c
);
6881 if (TREE_CODE (t
) != PARM_DECL
)
6883 if (processing_template_decl
)
6886 error ("%qD is not an argument in %<uniform%> clause", t
);
6888 error ("%qE is not an argument in %<uniform%> clause", t
);
6892 /* map_head bitmap is used as uniform_head if declare_simd. */
6893 bitmap_set_bit (&map_head
, DECL_UID (t
));
6894 goto check_dup_generic
;
6896 case OMP_CLAUSE_GRAINSIZE
:
6897 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
6898 if (t
== error_mark_node
)
6900 else if (!type_dependent_expression_p (t
)
6901 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6903 error ("%<grainsize%> expression must be integral");
6908 t
= mark_rvalue_use (t
);
6909 if (!processing_template_decl
)
6911 t
= maybe_constant_value (t
);
6912 if (TREE_CODE (t
) == INTEGER_CST
6913 && tree_int_cst_sgn (t
) != 1)
6915 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6916 "%<grainsize%> value must be positive");
6917 t
= integer_one_node
;
6919 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6921 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
6925 case OMP_CLAUSE_PRIORITY
:
6926 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
6927 if (t
== error_mark_node
)
6929 else if (!type_dependent_expression_p (t
)
6930 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6932 error ("%<priority%> expression must be integral");
6937 t
= mark_rvalue_use (t
);
6938 if (!processing_template_decl
)
6940 t
= maybe_constant_value (t
);
6941 if (TREE_CODE (t
) == INTEGER_CST
6942 && tree_int_cst_sgn (t
) == -1)
6944 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6945 "%<priority%> value must be non-negative");
6946 t
= integer_one_node
;
6948 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6950 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
6954 case OMP_CLAUSE_HINT
:
6955 t
= OMP_CLAUSE_HINT_EXPR (c
);
6956 if (t
== error_mark_node
)
6958 else if (!type_dependent_expression_p (t
)
6959 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6961 error ("%<num_tasks%> expression must be integral");
6966 t
= mark_rvalue_use (t
);
6967 if (!processing_template_decl
)
6969 t
= maybe_constant_value (t
);
6970 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6972 OMP_CLAUSE_HINT_EXPR (c
) = t
;
6976 case OMP_CLAUSE_IS_DEVICE_PTR
:
6977 case OMP_CLAUSE_USE_DEVICE_PTR
:
6978 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
6979 t
= OMP_CLAUSE_DECL (c
);
6980 if (!type_dependent_expression_p (t
))
6982 tree type
= TREE_TYPE (t
);
6983 if (TREE_CODE (type
) != POINTER_TYPE
6984 && TREE_CODE (type
) != ARRAY_TYPE
6985 && (TREE_CODE (type
) != REFERENCE_TYPE
6986 || (TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
6987 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
6989 error_at (OMP_CLAUSE_LOCATION (c
),
6990 "%qs variable is neither a pointer, nor an array"
6991 "nor reference to pointer or array",
6992 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6996 goto check_dup_generic
;
6998 case OMP_CLAUSE_NOWAIT
:
6999 case OMP_CLAUSE_DEFAULT
:
7000 case OMP_CLAUSE_UNTIED
:
7001 case OMP_CLAUSE_COLLAPSE
:
7002 case OMP_CLAUSE_MERGEABLE
:
7003 case OMP_CLAUSE_PARALLEL
:
7004 case OMP_CLAUSE_FOR
:
7005 case OMP_CLAUSE_SECTIONS
:
7006 case OMP_CLAUSE_TASKGROUP
:
7007 case OMP_CLAUSE_PROC_BIND
:
7008 case OMP_CLAUSE_NOGROUP
:
7009 case OMP_CLAUSE_THREADS
:
7010 case OMP_CLAUSE_SIMD
:
7011 case OMP_CLAUSE_DEFAULTMAP
:
7012 case OMP_CLAUSE__CILK_FOR_COUNT_
:
7013 case OMP_CLAUSE_AUTO
:
7014 case OMP_CLAUSE_INDEPENDENT
:
7015 case OMP_CLAUSE_SEQ
:
7018 case OMP_CLAUSE_TILE
:
7019 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7020 list
= TREE_CHAIN (list
))
7022 t
= TREE_VALUE (list
);
7024 if (t
== error_mark_node
)
7026 else if (!type_dependent_expression_p (t
)
7027 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7029 error ("%<tile%> value must be integral");
7034 t
= mark_rvalue_use (t
);
7035 if (!processing_template_decl
)
7037 t
= maybe_constant_value (t
);
7038 if (TREE_CODE (t
) == INTEGER_CST
7039 && tree_int_cst_sgn (t
) != 1
7040 && t
!= integer_minus_one_node
)
7042 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7043 "%<tile%> value must be positive");
7044 t
= integer_one_node
;
7047 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7050 /* Update list item. */
7051 TREE_VALUE (list
) = t
;
7055 case OMP_CLAUSE_ORDERED
:
7056 ordered_seen
= true;
7059 case OMP_CLAUSE_INBRANCH
:
7060 case OMP_CLAUSE_NOTINBRANCH
:
7063 error ("%<inbranch%> clause is incompatible with "
7075 *pc
= OMP_CLAUSE_CHAIN (c
);
7077 pc
= &OMP_CLAUSE_CHAIN (c
);
7080 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7082 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7083 bool remove
= false;
7084 bool need_complete_type
= false;
7085 bool need_default_ctor
= false;
7086 bool need_copy_ctor
= false;
7087 bool need_copy_assignment
= false;
7088 bool need_implicitly_determined
= false;
7089 bool need_dtor
= false;
7090 tree type
, inner_type
;
7094 case OMP_CLAUSE_SHARED
:
7095 need_implicitly_determined
= true;
7097 case OMP_CLAUSE_PRIVATE
:
7098 need_complete_type
= true;
7099 need_default_ctor
= true;
7101 need_implicitly_determined
= true;
7103 case OMP_CLAUSE_FIRSTPRIVATE
:
7104 need_complete_type
= true;
7105 need_copy_ctor
= true;
7107 need_implicitly_determined
= true;
7109 case OMP_CLAUSE_LASTPRIVATE
:
7110 need_complete_type
= true;
7111 need_copy_assignment
= true;
7112 need_implicitly_determined
= true;
7114 case OMP_CLAUSE_REDUCTION
:
7115 need_implicitly_determined
= true;
7117 case OMP_CLAUSE_LINEAR
:
7118 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7119 need_implicitly_determined
= true;
7120 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7121 && !bitmap_bit_p (&map_head
,
7122 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7124 error_at (OMP_CLAUSE_LOCATION (c
),
7125 "%<linear%> clause step is a parameter %qD not "
7126 "specified in %<uniform%> clause",
7127 OMP_CLAUSE_LINEAR_STEP (c
));
7128 *pc
= OMP_CLAUSE_CHAIN (c
);
7132 case OMP_CLAUSE_COPYPRIVATE
:
7133 need_copy_assignment
= true;
7135 case OMP_CLAUSE_COPYIN
:
7136 need_copy_assignment
= true;
7138 case OMP_CLAUSE_SIMDLEN
:
7140 && !processing_template_decl
7141 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7142 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7144 error_at (OMP_CLAUSE_LOCATION (c
),
7145 "%<simdlen%> clause value is bigger than "
7146 "%<safelen%> clause value");
7147 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7148 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7150 pc
= &OMP_CLAUSE_CHAIN (c
);
7152 case OMP_CLAUSE_SCHEDULE
:
7154 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7155 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7157 error_at (OMP_CLAUSE_LOCATION (c
),
7158 "%<nonmonotonic%> schedule modifier specified "
7159 "together with %<ordered%> clause");
7160 OMP_CLAUSE_SCHEDULE_KIND (c
)
7161 = (enum omp_clause_schedule_kind
)
7162 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7163 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7165 pc
= &OMP_CLAUSE_CHAIN (c
);
7167 case OMP_CLAUSE_NOWAIT
:
7168 if (copyprivate_seen
)
7170 error_at (OMP_CLAUSE_LOCATION (c
),
7171 "%<nowait%> clause must not be used together "
7172 "with %<copyprivate%>");
7173 *pc
= OMP_CLAUSE_CHAIN (c
);
7178 pc
= &OMP_CLAUSE_CHAIN (c
);
7182 t
= OMP_CLAUSE_DECL (c
);
7183 if (processing_template_decl
7184 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7186 pc
= &OMP_CLAUSE_CHAIN (c
);
7192 case OMP_CLAUSE_LASTPRIVATE
:
7193 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7195 need_default_ctor
= true;
7200 case OMP_CLAUSE_REDUCTION
:
7201 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7205 t
= OMP_CLAUSE_DECL (c
);
7208 case OMP_CLAUSE_COPYIN
:
7209 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7211 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
7220 if (need_complete_type
|| need_copy_assignment
)
7222 t
= require_complete_type (t
);
7223 if (t
== error_mark_node
)
7225 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
7226 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7229 if (need_implicitly_determined
)
7231 const char *share_name
= NULL
;
7233 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7234 share_name
= "threadprivate";
7235 else switch (cxx_omp_predetermined_sharing (t
))
7237 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7239 case OMP_CLAUSE_DEFAULT_SHARED
:
7240 /* const vars may be specified in firstprivate clause. */
7241 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7242 && cxx_omp_const_qual_no_mutable (t
))
7244 share_name
= "shared";
7246 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7247 share_name
= "private";
7254 error ("%qE is predetermined %qs for %qs",
7255 omp_clause_printable_decl (t
), share_name
,
7256 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7261 /* We're interested in the base element, not arrays. */
7262 inner_type
= type
= TREE_TYPE (t
);
7263 if ((need_complete_type
7264 || need_copy_assignment
7265 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
7266 && TREE_CODE (inner_type
) == REFERENCE_TYPE
)
7267 inner_type
= TREE_TYPE (inner_type
);
7268 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7269 inner_type
= TREE_TYPE (inner_type
);
7271 /* Check for special function availability by building a call to one.
7272 Save the results, because later we won't be in the right context
7273 for making these queries. */
7274 if (CLASS_TYPE_P (inner_type
)
7275 && COMPLETE_TYPE_P (inner_type
)
7276 && (need_default_ctor
|| need_copy_ctor
7277 || need_copy_assignment
|| need_dtor
)
7278 && !type_dependent_expression_p (t
)
7279 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7280 need_copy_ctor
, need_copy_assignment
,
7285 && c_kind
== OMP_CLAUSE_SHARED
7286 && processing_template_decl
)
7288 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7290 OMP_CLAUSE_DECL (c
) = t
;
7294 *pc
= OMP_CLAUSE_CHAIN (c
);
7296 pc
= &OMP_CLAUSE_CHAIN (c
);
7299 bitmap_obstack_release (NULL
);
7303 /* Start processing OpenMP clauses that can include any
7304 privatization clauses for non-static data members. */
7307 push_omp_privatization_clauses (bool ignore_next
)
7309 if (omp_private_member_ignore_next
)
7311 omp_private_member_ignore_next
= ignore_next
;
7314 omp_private_member_ignore_next
= ignore_next
;
7315 if (omp_private_member_map
)
7316 omp_private_member_vec
.safe_push (error_mark_node
);
7317 return push_stmt_list ();
7320 /* Revert remapping of any non-static data members since
7321 the last push_omp_privatization_clauses () call. */
7324 pop_omp_privatization_clauses (tree stmt
)
7326 if (stmt
== NULL_TREE
)
7328 stmt
= pop_stmt_list (stmt
);
7329 if (omp_private_member_map
)
7331 while (!omp_private_member_vec
.is_empty ())
7333 tree t
= omp_private_member_vec
.pop ();
7334 if (t
== error_mark_node
)
7339 bool no_decl_expr
= t
== integer_zero_node
;
7341 t
= omp_private_member_vec
.pop ();
7342 tree
*v
= omp_private_member_map
->get (t
);
7346 omp_private_member_map
->remove (t
);
7348 delete omp_private_member_map
;
7349 omp_private_member_map
= NULL
;
7354 /* Remember OpenMP privatization clauses mapping and clear it.
7355 Used for lambdas. */
7358 save_omp_privatization_clauses (vec
<tree
> &save
)
7361 if (omp_private_member_ignore_next
)
7362 save
.safe_push (integer_one_node
);
7363 omp_private_member_ignore_next
= false;
7364 if (!omp_private_member_map
)
7367 while (!omp_private_member_vec
.is_empty ())
7369 tree t
= omp_private_member_vec
.pop ();
7370 if (t
== error_mark_node
)
7376 if (t
== integer_zero_node
)
7377 t
= omp_private_member_vec
.pop ();
7378 tree
*v
= omp_private_member_map
->get (t
);
7380 save
.safe_push (*v
);
7385 delete omp_private_member_map
;
7386 omp_private_member_map
= NULL
;
7389 /* Restore OpenMP privatization clauses mapping saved by the
7393 restore_omp_privatization_clauses (vec
<tree
> &save
)
7395 gcc_assert (omp_private_member_vec
.is_empty ());
7396 omp_private_member_ignore_next
= false;
7397 if (save
.is_empty ())
7399 if (save
.length () == 1 && save
[0] == integer_one_node
)
7401 omp_private_member_ignore_next
= true;
7406 omp_private_member_map
= new hash_map
<tree
, tree
>;
7407 while (!save
.is_empty ())
7409 tree t
= save
.pop ();
7411 if (t
!= error_mark_node
)
7413 if (t
== integer_one_node
)
7415 omp_private_member_ignore_next
= true;
7416 gcc_assert (save
.is_empty ());
7419 if (t
== integer_zero_node
)
7421 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7424 omp_private_member_vec
.safe_push (t
);
7426 omp_private_member_vec
.safe_push (n
);
7431 /* For all variables in the tree_list VARS, mark them as thread local. */
7434 finish_omp_threadprivate (tree vars
)
7438 /* Mark every variable in VARS to be assigned thread local storage. */
7439 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7441 tree v
= TREE_PURPOSE (t
);
7443 if (error_operand_p (v
))
7445 else if (!VAR_P (v
))
7446 error ("%<threadprivate%> %qD is not file, namespace "
7447 "or block scope variable", v
);
7448 /* If V had already been marked threadprivate, it doesn't matter
7449 whether it had been used prior to this point. */
7450 else if (TREE_USED (v
)
7451 && (DECL_LANG_SPECIFIC (v
) == NULL
7452 || !CP_DECL_THREADPRIVATE_P (v
)))
7453 error ("%qE declared %<threadprivate%> after first use", v
);
7454 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7455 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7456 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7457 error ("%<threadprivate%> %qE has incomplete type", v
);
7458 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7459 && CP_DECL_CONTEXT (v
) != current_class_type
)
7460 error ("%<threadprivate%> %qE directive not "
7461 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7464 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7465 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7467 retrofit_lang_decl (v
);
7469 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
7470 after the allocation of the lang_decl structure. */
7471 if (DECL_DISCRIMINATOR_P (v
))
7472 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
7475 if (! CP_DECL_THREAD_LOCAL_P (v
))
7477 CP_DECL_THREAD_LOCAL_P (v
) = true;
7478 set_decl_tls_model (v
, decl_default_tls_model (v
));
7479 /* If rtl has been already set for this var, call
7480 make_decl_rtl once again, so that encode_section_info
7481 has a chance to look at the new decl flags. */
7482 if (DECL_RTL_SET_P (v
))
7485 CP_DECL_THREADPRIVATE_P (v
) = 1;
7490 /* Build an OpenMP structured block. */
7493 begin_omp_structured_block (void)
7495 return do_pushlevel (sk_omp
);
7499 finish_omp_structured_block (tree block
)
7501 return do_poplevel (block
);
7504 /* Similarly, except force the retention of the BLOCK. */
7507 begin_omp_parallel (void)
7509 keep_next_level (true);
7510 return begin_omp_structured_block ();
7513 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7517 finish_oacc_data (tree clauses
, tree block
)
7521 block
= finish_omp_structured_block (block
);
7523 stmt
= make_node (OACC_DATA
);
7524 TREE_TYPE (stmt
) = void_type_node
;
7525 OACC_DATA_CLAUSES (stmt
) = clauses
;
7526 OACC_DATA_BODY (stmt
) = block
;
7528 return add_stmt (stmt
);
7531 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
7535 finish_oacc_host_data (tree clauses
, tree block
)
7539 block
= finish_omp_structured_block (block
);
7541 stmt
= make_node (OACC_HOST_DATA
);
7542 TREE_TYPE (stmt
) = void_type_node
;
7543 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
7544 OACC_HOST_DATA_BODY (stmt
) = block
;
7546 return add_stmt (stmt
);
7549 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
7553 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
7555 body
= finish_omp_structured_block (body
);
7557 tree stmt
= make_node (code
);
7558 TREE_TYPE (stmt
) = void_type_node
;
7559 OMP_BODY (stmt
) = body
;
7560 OMP_CLAUSES (stmt
) = clauses
;
7562 return add_stmt (stmt
);
7566 finish_omp_parallel (tree clauses
, tree body
)
7570 body
= finish_omp_structured_block (body
);
7572 stmt
= make_node (OMP_PARALLEL
);
7573 TREE_TYPE (stmt
) = void_type_node
;
7574 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
7575 OMP_PARALLEL_BODY (stmt
) = body
;
7577 return add_stmt (stmt
);
7581 begin_omp_task (void)
7583 keep_next_level (true);
7584 return begin_omp_structured_block ();
7588 finish_omp_task (tree clauses
, tree body
)
7592 body
= finish_omp_structured_block (body
);
7594 stmt
= make_node (OMP_TASK
);
7595 TREE_TYPE (stmt
) = void_type_node
;
7596 OMP_TASK_CLAUSES (stmt
) = clauses
;
7597 OMP_TASK_BODY (stmt
) = body
;
7599 return add_stmt (stmt
);
7602 /* Helper function for finish_omp_for. Convert Ith random access iterator
7603 into integral iterator. Return FALSE if successful. */
7606 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
7607 tree declv
, tree orig_declv
, tree initv
,
7608 tree condv
, tree incrv
, tree
*body
,
7609 tree
*pre_body
, tree
&clauses
, tree
*lastp
,
7610 int collapse
, int ordered
)
7612 tree diff
, iter_init
, iter_incr
= NULL
, last
;
7613 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
7614 tree decl
= TREE_VEC_ELT (declv
, i
);
7615 tree init
= TREE_VEC_ELT (initv
, i
);
7616 tree cond
= TREE_VEC_ELT (condv
, i
);
7617 tree incr
= TREE_VEC_ELT (incrv
, i
);
7619 location_t elocus
= locus
;
7621 if (init
&& EXPR_HAS_LOCATION (init
))
7622 elocus
= EXPR_LOCATION (init
);
7624 cond
= cp_fully_fold (cond
);
7625 switch (TREE_CODE (cond
))
7632 if (TREE_OPERAND (cond
, 1) == iter
)
7633 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
7634 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
7635 if (TREE_OPERAND (cond
, 0) != iter
)
7636 cond
= error_mark_node
;
7639 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
7642 TREE_OPERAND (cond
, 1), ERROR_MARK
,
7643 NULL
, tf_warning_or_error
);
7644 if (error_operand_p (tem
))
7649 cond
= error_mark_node
;
7652 if (cond
== error_mark_node
)
7654 error_at (elocus
, "invalid controlling predicate");
7657 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
7658 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
7659 tf_warning_or_error
);
7660 diff
= cp_fully_fold (diff
);
7661 if (error_operand_p (diff
))
7663 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
7665 error_at (elocus
, "difference between %qE and %qD does not have integer type",
7666 TREE_OPERAND (cond
, 1), iter
);
7669 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
7670 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
7671 cond
, cp_walk_subtrees
))
7674 switch (TREE_CODE (incr
))
7676 case PREINCREMENT_EXPR
:
7677 case PREDECREMENT_EXPR
:
7678 case POSTINCREMENT_EXPR
:
7679 case POSTDECREMENT_EXPR
:
7680 if (TREE_OPERAND (incr
, 0) != iter
)
7682 incr
= error_mark_node
;
7685 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
7686 TREE_CODE (incr
), iter
,
7687 tf_warning_or_error
);
7688 if (error_operand_p (iter_incr
))
7690 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
7691 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
7692 incr
= integer_one_node
;
7694 incr
= integer_minus_one_node
;
7697 if (TREE_OPERAND (incr
, 0) != iter
)
7698 incr
= error_mark_node
;
7699 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
7700 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
7702 tree rhs
= TREE_OPERAND (incr
, 1);
7703 if (TREE_OPERAND (rhs
, 0) == iter
)
7705 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
7707 incr
= error_mark_node
;
7710 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7711 iter
, TREE_CODE (rhs
),
7712 TREE_OPERAND (rhs
, 1),
7713 tf_warning_or_error
);
7714 if (error_operand_p (iter_incr
))
7716 incr
= TREE_OPERAND (rhs
, 1);
7717 incr
= cp_convert (TREE_TYPE (diff
), incr
,
7718 tf_warning_or_error
);
7719 if (TREE_CODE (rhs
) == MINUS_EXPR
)
7721 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
7722 incr
= fold_simple (incr
);
7724 if (TREE_CODE (incr
) != INTEGER_CST
7725 && (TREE_CODE (incr
) != NOP_EXPR
7726 || (TREE_CODE (TREE_OPERAND (incr
, 0))
7731 else if (TREE_OPERAND (rhs
, 1) == iter
)
7733 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
7734 || TREE_CODE (rhs
) != PLUS_EXPR
)
7735 incr
= error_mark_node
;
7738 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
7740 TREE_OPERAND (rhs
, 0),
7743 tf_warning_or_error
);
7744 if (error_operand_p (iter_incr
))
7746 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7749 tf_warning_or_error
);
7750 if (error_operand_p (iter_incr
))
7752 incr
= TREE_OPERAND (rhs
, 0);
7757 incr
= error_mark_node
;
7760 incr
= error_mark_node
;
7763 incr
= error_mark_node
;
7767 if (incr
== error_mark_node
)
7769 error_at (elocus
, "invalid increment expression");
7773 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
7774 bool taskloop_iv_seen
= false;
7775 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
7776 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
7777 && OMP_CLAUSE_DECL (c
) == iter
)
7779 if (code
== OMP_TASKLOOP
)
7781 taskloop_iv_seen
= true;
7782 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
7786 else if (code
== OMP_TASKLOOP
7787 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
7788 && OMP_CLAUSE_DECL (c
) == iter
)
7790 taskloop_iv_seen
= true;
7791 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
7794 decl
= create_temporary_var (TREE_TYPE (diff
));
7796 add_decl_expr (decl
);
7797 last
= create_temporary_var (TREE_TYPE (diff
));
7799 add_decl_expr (last
);
7800 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
7801 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7803 incr_var
= create_temporary_var (TREE_TYPE (diff
));
7804 pushdecl (incr_var
);
7805 add_decl_expr (incr_var
);
7807 gcc_assert (stmts_are_full_exprs_p ());
7808 tree diffvar
= NULL_TREE
;
7809 if (code
== OMP_TASKLOOP
)
7811 if (!taskloop_iv_seen
)
7813 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7814 OMP_CLAUSE_DECL (ivc
) = iter
;
7815 cxx_omp_finish_clause (ivc
, NULL
);
7816 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
7819 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7820 OMP_CLAUSE_DECL (lvc
) = last
;
7821 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
7823 diffvar
= create_temporary_var (TREE_TYPE (diff
));
7825 add_decl_expr (diffvar
);
7828 orig_pre_body
= *pre_body
;
7829 *pre_body
= push_stmt_list ();
7831 add_stmt (orig_pre_body
);
7833 finish_expr_stmt (build_x_modify_expr (elocus
,
7834 iter
, NOP_EXPR
, init
,
7835 tf_warning_or_error
));
7836 init
= build_int_cst (TREE_TYPE (diff
), 0);
7837 if (c
&& iter_incr
== NULL
7838 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7842 finish_expr_stmt (build_x_modify_expr (elocus
,
7844 incr
, tf_warning_or_error
));
7847 iter_incr
= build_x_modify_expr (elocus
,
7848 iter
, PLUS_EXPR
, incr
,
7849 tf_warning_or_error
);
7851 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
7853 finish_expr_stmt (build_x_modify_expr (elocus
,
7854 last
, NOP_EXPR
, init
,
7855 tf_warning_or_error
));
7858 finish_expr_stmt (build_x_modify_expr (elocus
,
7860 diff
, tf_warning_or_error
));
7863 *pre_body
= pop_stmt_list (*pre_body
);
7865 cond
= cp_build_binary_op (elocus
,
7866 TREE_CODE (cond
), decl
, diff
,
7867 tf_warning_or_error
);
7868 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
7869 elocus
, incr
, NULL_TREE
);
7872 *body
= push_stmt_list ();
7873 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
7874 iter_init
= build_x_modify_expr (elocus
,
7875 iter
, PLUS_EXPR
, iter_init
,
7876 tf_warning_or_error
);
7877 if (iter_init
!= error_mark_node
)
7878 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7879 finish_expr_stmt (iter_init
);
7880 finish_expr_stmt (build_x_modify_expr (elocus
,
7881 last
, NOP_EXPR
, decl
,
7882 tf_warning_or_error
));
7883 add_stmt (orig_body
);
7884 *body
= pop_stmt_list (*body
);
7888 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
7890 finish_expr_stmt (iter_incr
);
7894 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
7895 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
7896 iter_init
, iter_incr
);
7897 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
7898 iter_init
= build_x_modify_expr (elocus
,
7899 iter
, PLUS_EXPR
, iter_init
,
7900 tf_warning_or_error
);
7901 if (iter_init
!= error_mark_node
)
7902 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7903 finish_expr_stmt (iter_init
);
7905 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
7906 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
7909 TREE_VEC_ELT (declv
, i
) = decl
;
7910 TREE_VEC_ELT (initv
, i
) = init
;
7911 TREE_VEC_ELT (condv
, i
) = cond
;
7912 TREE_VEC_ELT (incrv
, i
) = incr
;
7918 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
7919 are directly for their associated operands in the statement. DECL
7920 and INIT are a combo; if DECL is NULL then INIT ought to be a
7921 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
7922 optional statements that need to go before the loop into its
7926 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
7927 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
7928 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
7930 tree omp_for
= NULL
, orig_incr
= NULL
;
7931 tree decl
= NULL
, init
, cond
, incr
, orig_decl
= NULL_TREE
, block
= NULL_TREE
;
7932 tree last
= NULL_TREE
;
7938 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
7939 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
7940 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
7941 if (TREE_VEC_LENGTH (declv
) > 1)
7943 tree c
= find_omp_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
7945 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
7946 if (collapse
!= TREE_VEC_LENGTH (declv
))
7947 ordered
= TREE_VEC_LENGTH (declv
);
7949 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
7951 decl
= TREE_VEC_ELT (declv
, i
);
7952 init
= TREE_VEC_ELT (initv
, i
);
7953 cond
= TREE_VEC_ELT (condv
, i
);
7954 incr
= TREE_VEC_ELT (incrv
, i
);
7960 switch (TREE_CODE (init
))
7963 decl
= TREE_OPERAND (init
, 0);
7964 init
= TREE_OPERAND (init
, 1);
7967 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
7969 decl
= TREE_OPERAND (init
, 0);
7970 init
= TREE_OPERAND (init
, 2);
7980 "expected iteration declaration or initialization");
7985 if (init
&& EXPR_HAS_LOCATION (init
))
7986 elocus
= EXPR_LOCATION (init
);
7990 error_at (elocus
, "missing controlling predicate");
7996 error_at (elocus
, "missing increment expression");
8000 TREE_VEC_ELT (declv
, i
) = decl
;
8001 TREE_VEC_ELT (initv
, i
) = init
;
8008 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8010 && !c_omp_check_loop_iv_exprs (locus
, declv
,
8011 TREE_VEC_ELT (declv
, i
), orig_init
,
8012 NULL_TREE
, cp_walk_subtrees
))
8018 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8022 stmt
= make_node (code
);
8024 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8026 /* This is really just a place-holder. We'll be decomposing this
8027 again and going through the cp_build_modify_expr path below when
8028 we instantiate the thing. */
8029 TREE_VEC_ELT (initv
, i
)
8030 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8031 TREE_VEC_ELT (initv
, i
));
8034 TREE_TYPE (stmt
) = void_type_node
;
8035 OMP_FOR_INIT (stmt
) = initv
;
8036 OMP_FOR_COND (stmt
) = condv
;
8037 OMP_FOR_INCR (stmt
) = incrv
;
8038 OMP_FOR_BODY (stmt
) = body
;
8039 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8040 OMP_FOR_CLAUSES (stmt
) = clauses
;
8042 SET_EXPR_LOCATION (stmt
, locus
);
8043 return add_stmt (stmt
);
8047 orig_declv
= copy_node (declv
);
8049 if (processing_template_decl
)
8050 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8052 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8054 decl
= TREE_VEC_ELT (declv
, i
);
8055 init
= TREE_VEC_ELT (initv
, i
);
8056 cond
= TREE_VEC_ELT (condv
, i
);
8057 incr
= TREE_VEC_ELT (incrv
, i
);
8059 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8062 if (init
&& EXPR_HAS_LOCATION (init
))
8063 elocus
= EXPR_LOCATION (init
);
8067 error_at (elocus
, "expected iteration declaration or initialization");
8071 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8074 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8075 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8076 TREE_CODE (TREE_OPERAND (incr
, 1)),
8077 TREE_OPERAND (incr
, 2),
8078 tf_warning_or_error
);
8081 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8083 if (code
== OMP_SIMD
)
8085 error_at (elocus
, "%<#pragma omp simd%> used with class "
8086 "iteration variable %qE", decl
);
8089 if (code
== CILK_FOR
&& i
== 0)
8091 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8092 initv
, condv
, incrv
, &body
,
8093 &pre_body
, clauses
, &last
,
8099 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8100 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8102 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8106 if (!processing_template_decl
)
8108 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8109 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8110 tf_warning_or_error
);
8113 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8115 && TREE_SIDE_EFFECTS (cond
)
8116 && COMPARISON_CLASS_P (cond
)
8117 && !processing_template_decl
)
8119 tree t
= TREE_OPERAND (cond
, 0);
8120 if (TREE_SIDE_EFFECTS (t
)
8122 && (TREE_CODE (t
) != NOP_EXPR
8123 || TREE_OPERAND (t
, 0) != decl
))
8124 TREE_OPERAND (cond
, 0)
8125 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8127 t
= TREE_OPERAND (cond
, 1);
8128 if (TREE_SIDE_EFFECTS (t
)
8130 && (TREE_CODE (t
) != NOP_EXPR
8131 || TREE_OPERAND (t
, 0) != decl
))
8132 TREE_OPERAND (cond
, 1)
8133 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8135 if (decl
== error_mark_node
|| init
== error_mark_node
)
8138 TREE_VEC_ELT (declv
, i
) = decl
;
8139 TREE_VEC_ELT (initv
, i
) = init
;
8140 TREE_VEC_ELT (condv
, i
) = cond
;
8141 TREE_VEC_ELT (incrv
, i
) = incr
;
8145 if (IS_EMPTY_STMT (pre_body
))
8148 if (code
== CILK_FOR
&& !processing_template_decl
)
8149 block
= push_stmt_list ();
8151 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8152 incrv
, body
, pre_body
);
8154 /* Check for iterators appearing in lb, b or incr expressions. */
8155 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8156 omp_for
= NULL_TREE
;
8158 if (omp_for
== NULL
)
8161 pop_stmt_list (block
);
8167 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8169 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8170 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8172 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8175 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8176 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8177 && !processing_template_decl
)
8179 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8180 if (TREE_SIDE_EFFECTS (t
)
8182 && (TREE_CODE (t
) != NOP_EXPR
8183 || TREE_OPERAND (t
, 0) != decl
))
8184 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8185 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8187 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8188 if (TREE_SIDE_EFFECTS (t
)
8190 && (TREE_CODE (t
) != NOP_EXPR
8191 || TREE_OPERAND (t
, 0) != decl
))
8192 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8193 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8197 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8199 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8201 /* For simd loops with non-static data member iterators, we could have added
8202 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8203 step at this point, fill it in. */
8204 if (code
== OMP_SIMD
&& !processing_template_decl
8205 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8206 for (tree c
= find_omp_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8207 c
= find_omp_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8208 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8210 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8211 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8212 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8214 switch (TREE_CODE (incr
))
8216 case PREINCREMENT_EXPR
:
8217 case POSTINCREMENT_EXPR
:
8218 /* c_omp_for_incr_canonicalize_ptr() should have been
8219 called to massage things appropriately. */
8220 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8221 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8223 case PREDECREMENT_EXPR
:
8224 case POSTDECREMENT_EXPR
:
8225 /* c_omp_for_incr_canonicalize_ptr() should have been
8226 called to massage things appropriately. */
8227 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8228 OMP_CLAUSE_LINEAR_STEP (c
)
8229 = build_int_cst (TREE_TYPE (decl
), -1);
8232 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8233 incr
= TREE_OPERAND (incr
, 1);
8234 switch (TREE_CODE (incr
))
8237 if (TREE_OPERAND (incr
, 1) == decl
)
8238 step
= TREE_OPERAND (incr
, 0);
8240 step
= TREE_OPERAND (incr
, 1);
8243 case POINTER_PLUS_EXPR
:
8244 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8245 step
= TREE_OPERAND (incr
, 1);
8250 stept
= TREE_TYPE (decl
);
8251 if (POINTER_TYPE_P (stept
))
8253 step
= fold_convert (stept
, step
);
8254 if (TREE_CODE (incr
) == MINUS_EXPR
)
8255 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8256 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8265 tree omp_par
= make_node (OMP_PARALLEL
);
8266 TREE_TYPE (omp_par
) = void_type_node
;
8267 OMP_PARALLEL_CLAUSES (omp_par
) = NULL_TREE
;
8268 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
8269 TREE_SIDE_EFFECTS (bind
) = 1;
8270 BIND_EXPR_BODY (bind
) = pop_stmt_list (block
);
8271 OMP_PARALLEL_BODY (omp_par
) = bind
;
8272 if (OMP_FOR_PRE_BODY (omp_for
))
8274 add_stmt (OMP_FOR_PRE_BODY (omp_for
));
8275 OMP_FOR_PRE_BODY (omp_for
) = NULL_TREE
;
8277 init
= TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0);
8278 decl
= TREE_OPERAND (init
, 0);
8279 cond
= TREE_VEC_ELT (OMP_FOR_COND (omp_for
), 0);
8280 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8281 tree t
= TREE_OPERAND (cond
, 1), c
, clauses
, *pc
;
8282 clauses
= OMP_FOR_CLAUSES (omp_for
);
8283 OMP_FOR_CLAUSES (omp_for
) = NULL_TREE
;
8284 for (pc
= &clauses
; *pc
; )
8285 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_SCHEDULE
)
8287 gcc_assert (OMP_FOR_CLAUSES (omp_for
) == NULL_TREE
);
8288 OMP_FOR_CLAUSES (omp_for
) = *pc
;
8289 *pc
= OMP_CLAUSE_CHAIN (*pc
);
8290 OMP_CLAUSE_CHAIN (OMP_FOR_CLAUSES (omp_for
)) = NULL_TREE
;
8294 gcc_assert (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
);
8295 pc
= &OMP_CLAUSE_CHAIN (*pc
);
8297 if (TREE_CODE (t
) != INTEGER_CST
)
8299 TREE_OPERAND (cond
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8300 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8301 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (cond
, 1);
8302 OMP_CLAUSE_CHAIN (c
) = clauses
;
8305 if (TREE_CODE (incr
) == MODIFY_EXPR
)
8307 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8308 if (TREE_CODE (t
) != INTEGER_CST
)
8310 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8311 = get_temp_regvar (TREE_TYPE (t
), t
);
8312 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8313 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8314 OMP_CLAUSE_CHAIN (c
) = clauses
;
8318 t
= TREE_OPERAND (init
, 1);
8319 if (TREE_CODE (t
) != INTEGER_CST
)
8321 TREE_OPERAND (init
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8322 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8323 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (init
, 1);
8324 OMP_CLAUSE_CHAIN (c
) = clauses
;
8327 if (orig_decl
&& orig_decl
!= decl
)
8329 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8330 OMP_CLAUSE_DECL (c
) = orig_decl
;
8331 OMP_CLAUSE_CHAIN (c
) = clauses
;
8336 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8337 OMP_CLAUSE_DECL (c
) = last
;
8338 OMP_CLAUSE_CHAIN (c
) = clauses
;
8341 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
8342 OMP_CLAUSE_DECL (c
) = decl
;
8343 OMP_CLAUSE_CHAIN (c
) = clauses
;
8345 c
= build_omp_clause (input_location
, OMP_CLAUSE__CILK_FOR_COUNT_
);
8346 OMP_CLAUSE_OPERAND (c
, 0)
8347 = cilk_for_number_of_iterations (omp_for
);
8348 OMP_CLAUSE_CHAIN (c
) = clauses
;
8349 OMP_PARALLEL_CLAUSES (omp_par
) = finish_omp_clauses (c
, C_ORT_CILK
);
8353 else if (code
== CILK_FOR
&& processing_template_decl
)
8355 tree c
, clauses
= OMP_FOR_CLAUSES (omp_for
);
8356 if (orig_decl
&& orig_decl
!= decl
)
8358 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8359 OMP_CLAUSE_DECL (c
) = orig_decl
;
8360 OMP_CLAUSE_CHAIN (c
) = clauses
;
8365 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8366 OMP_CLAUSE_DECL (c
) = last
;
8367 OMP_CLAUSE_CHAIN (c
) = clauses
;
8370 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8376 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
8377 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
8392 dependent_p
= false;
8395 /* Even in a template, we can detect invalid uses of the atomic
8396 pragma if neither LHS nor RHS is type-dependent. */
8397 if (processing_template_decl
)
8399 dependent_p
= (type_dependent_expression_p (lhs
)
8400 || (rhs
&& type_dependent_expression_p (rhs
))
8401 || (v
&& type_dependent_expression_p (v
))
8402 || (lhs1
&& type_dependent_expression_p (lhs1
))
8403 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8406 lhs
= build_non_dependent_expr (lhs
);
8408 rhs
= build_non_dependent_expr (rhs
);
8410 v
= build_non_dependent_expr (v
);
8412 lhs1
= build_non_dependent_expr (lhs1
);
8414 rhs1
= build_non_dependent_expr (rhs1
);
8419 bool swapped
= false;
8420 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8422 std::swap (rhs
, rhs1
);
8423 swapped
= !commutative_tree_code (opcode
);
8425 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8427 if (code
== OMP_ATOMIC
)
8428 error ("%<#pragma omp atomic update%> uses two different "
8429 "expressions for memory");
8431 error ("%<#pragma omp atomic capture%> uses two different "
8432 "expressions for memory");
8435 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8437 if (code
== OMP_ATOMIC
)
8438 error ("%<#pragma omp atomic update%> uses two different "
8439 "expressions for memory");
8441 error ("%<#pragma omp atomic capture%> uses two different "
8442 "expressions for memory");
8445 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
8446 v
, lhs1
, rhs1
, swapped
, seq_cst
,
8447 processing_template_decl
!= 0);
8448 if (stmt
== error_mark_node
)
8451 if (processing_template_decl
)
8453 if (code
== OMP_ATOMIC_READ
)
8455 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
8456 OMP_ATOMIC_READ
, orig_lhs
);
8457 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8458 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8462 if (opcode
== NOP_EXPR
)
8463 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8465 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8467 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8468 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8469 if (code
!= OMP_ATOMIC
)
8471 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
8472 code
, orig_lhs1
, stmt
);
8473 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8474 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8477 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
8478 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8480 finish_expr_stmt (stmt
);
8484 finish_omp_barrier (void)
8486 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
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_flush (void)
8496 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8497 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8498 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8499 release_tree_vector (vec
);
8500 finish_expr_stmt (stmt
);
8504 finish_omp_taskwait (void)
8506 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8507 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8508 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8509 release_tree_vector (vec
);
8510 finish_expr_stmt (stmt
);
8514 finish_omp_taskyield (void)
8516 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8517 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8518 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8519 release_tree_vector (vec
);
8520 finish_expr_stmt (stmt
);
8524 finish_omp_cancel (tree clauses
)
8526 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
8528 if (find_omp_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8530 else if (find_omp_clause (clauses
, OMP_CLAUSE_FOR
))
8532 else if (find_omp_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8534 else if (find_omp_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8538 error ("%<#pragma omp cancel must specify one of "
8539 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8542 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8543 tree ifc
= find_omp_clause (clauses
, OMP_CLAUSE_IF
);
8544 if (ifc
!= NULL_TREE
)
8546 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
8547 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
8548 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
8549 build_zero_cst (type
));
8552 ifc
= boolean_true_node
;
8553 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
8554 vec
->quick_push (ifc
);
8555 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8556 release_tree_vector (vec
);
8557 finish_expr_stmt (stmt
);
8561 finish_omp_cancellation_point (tree clauses
)
8563 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
8565 if (find_omp_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8567 else if (find_omp_clause (clauses
, OMP_CLAUSE_FOR
))
8569 else if (find_omp_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8571 else if (find_omp_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8575 error ("%<#pragma omp cancellation point must specify one of "
8576 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8579 vec
<tree
, va_gc
> *vec
8580 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
8581 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8582 release_tree_vector (vec
);
8583 finish_expr_stmt (stmt
);
8586 /* Begin a __transaction_atomic or __transaction_relaxed statement.
8587 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
8588 should create an extra compound stmt. */
8591 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
8596 *pcompound
= begin_compound_stmt (0);
8598 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
8600 /* Only add the statement to the function if support enabled. */
8604 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
8605 ? G_("%<__transaction_relaxed%> without "
8606 "transactional memory support enabled")
8607 : G_("%<__transaction_atomic%> without "
8608 "transactional memory support enabled")));
8610 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
8611 TREE_SIDE_EFFECTS (r
) = 1;
8615 /* End a __transaction_atomic or __transaction_relaxed statement.
8616 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
8617 and we should end the compound. If NOEX is non-NULL, we wrap the body in
8618 a MUST_NOT_THROW_EXPR with NOEX as condition. */
8621 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
8623 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
8624 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
8625 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
8626 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
8628 /* noexcept specifications are not allowed for function transactions. */
8629 gcc_assert (!(noex
&& compound_stmt
));
8632 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
8634 protected_set_expr_location
8635 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
8636 TREE_SIDE_EFFECTS (body
) = 1;
8637 TRANSACTION_EXPR_BODY (stmt
) = body
;
8641 finish_compound_stmt (compound_stmt
);
8644 /* Build a __transaction_atomic or __transaction_relaxed expression. If
8645 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
8649 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
8654 expr
= build_must_not_throw_expr (expr
, noex
);
8655 protected_set_expr_location (expr
, loc
);
8656 TREE_SIDE_EFFECTS (expr
) = 1;
8658 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
8659 if (flags
& TM_STMT_ATTR_RELAXED
)
8660 TRANSACTION_EXPR_RELAXED (ret
) = 1;
8661 TREE_SIDE_EFFECTS (ret
) = 1;
8662 SET_EXPR_LOCATION (ret
, loc
);
8667 init_cp_semantics (void)
8671 /* Build a STATIC_ASSERT for a static assertion with the condition
8672 CONDITION and the message text MESSAGE. LOCATION is the location
8673 of the static assertion in the source code. When MEMBER_P, this
8674 static assertion is a member of a class. */
8676 finish_static_assert (tree condition
, tree message
, location_t location
,
8679 if (message
== NULL_TREE
8680 || message
== error_mark_node
8681 || condition
== NULL_TREE
8682 || condition
== error_mark_node
)
8685 if (check_for_bare_parameter_packs (condition
))
8686 condition
= error_mark_node
;
8688 if (type_dependent_expression_p (condition
)
8689 || value_dependent_expression_p (condition
))
8691 /* We're in a template; build a STATIC_ASSERT and put it in
8695 assertion
= make_node (STATIC_ASSERT
);
8696 STATIC_ASSERT_CONDITION (assertion
) = condition
;
8697 STATIC_ASSERT_MESSAGE (assertion
) = message
;
8698 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
8701 maybe_add_class_template_decl_list (current_class_type
,
8705 add_stmt (assertion
);
8710 /* Fold the expression and convert it to a boolean value. */
8711 condition
= instantiate_non_dependent_expr (condition
);
8712 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
8713 condition
= maybe_constant_value (condition
);
8715 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
8716 /* Do nothing; the condition is satisfied. */
8720 location_t saved_loc
= input_location
;
8722 input_location
= location
;
8723 if (TREE_CODE (condition
) == INTEGER_CST
8724 && integer_zerop (condition
))
8726 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
8727 (TREE_TYPE (TREE_TYPE (message
))));
8728 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
8729 /* Report the error. */
8731 error ("static assertion failed");
8733 error ("static assertion failed: %s",
8734 TREE_STRING_POINTER (message
));
8736 else if (condition
&& condition
!= error_mark_node
)
8738 error ("non-constant condition for static assertion");
8739 if (require_potential_rvalue_constant_expression (condition
))
8740 cxx_constant_value (condition
);
8742 input_location
= saved_loc
;
8746 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
8747 suitable for use as a type-specifier.
8749 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
8750 id-expression or a class member access, FALSE when it was parsed as
8751 a full expression. */
8754 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
8755 tsubst_flags_t complain
)
8757 tree type
= NULL_TREE
;
8759 if (!expr
|| error_operand_p (expr
))
8760 return error_mark_node
;
8763 || TREE_CODE (expr
) == TYPE_DECL
8764 || (TREE_CODE (expr
) == BIT_NOT_EXPR
8765 && TYPE_P (TREE_OPERAND (expr
, 0))))
8767 if (complain
& tf_error
)
8768 error ("argument to decltype must be an expression");
8769 return error_mark_node
;
8772 /* Depending on the resolution of DR 1172, we may later need to distinguish
8773 instantiation-dependent but not type-dependent expressions so that, say,
8774 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
8775 if (instantiation_dependent_uneval_expression_p (expr
))
8777 type
= cxx_make_type (DECLTYPE_TYPE
);
8778 DECLTYPE_TYPE_EXPR (type
) = expr
;
8779 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
8780 = id_expression_or_member_access_p
;
8781 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8786 /* The type denoted by decltype(e) is defined as follows: */
8788 expr
= resolve_nondeduced_context (expr
, complain
);
8790 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
8791 return error_mark_node
;
8793 if (type_unknown_p (expr
))
8795 if (complain
& tf_error
)
8796 error ("decltype cannot resolve address of overloaded function");
8797 return error_mark_node
;
8800 /* To get the size of a static data member declared as an array of
8801 unknown bound, we need to instantiate it. */
8803 && VAR_HAD_UNKNOWN_BOUND (expr
)
8804 && DECL_TEMPLATE_INSTANTIATION (expr
))
8805 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
8807 if (id_expression_or_member_access_p
)
8809 /* If e is an id-expression or a class member access (5.2.5
8810 [expr.ref]), decltype(e) is defined as the type of the entity
8811 named by e. If there is no such entity, or e names a set of
8812 overloaded functions, the program is ill-formed. */
8813 if (identifier_p (expr
))
8814 expr
= lookup_name (expr
);
8816 if (INDIRECT_REF_P (expr
))
8817 /* This can happen when the expression is, e.g., "a.b". Just
8818 look at the underlying operand. */
8819 expr
= TREE_OPERAND (expr
, 0);
8821 if (TREE_CODE (expr
) == OFFSET_REF
8822 || TREE_CODE (expr
) == MEMBER_REF
8823 || TREE_CODE (expr
) == SCOPE_REF
)
8824 /* We're only interested in the field itself. If it is a
8825 BASELINK, we will need to see through it in the next
8827 expr
= TREE_OPERAND (expr
, 1);
8829 if (BASELINK_P (expr
))
8830 /* See through BASELINK nodes to the underlying function. */
8831 expr
= BASELINK_FUNCTIONS (expr
);
8833 switch (TREE_CODE (expr
))
8836 if (DECL_BIT_FIELD_TYPE (expr
))
8838 type
= DECL_BIT_FIELD_TYPE (expr
);
8841 /* Fall through for fields that aren't bitfields. */
8848 case TEMPLATE_PARM_INDEX
:
8849 expr
= mark_type_use (expr
);
8850 type
= TREE_TYPE (expr
);
8854 type
= error_mark_node
;
8859 mark_type_use (expr
);
8860 type
= is_bitfield_expr_with_lowered_type (expr
);
8862 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
8870 /* We can get here when the id-expression refers to an
8871 enumerator or non-type template parameter. */
8872 type
= TREE_TYPE (expr
);
8876 /* Handle instantiated template non-type arguments. */
8877 type
= TREE_TYPE (expr
);
8883 /* Within a lambda-expression:
8885 Every occurrence of decltype((x)) where x is a possibly
8886 parenthesized id-expression that names an entity of
8887 automatic storage duration is treated as if x were
8888 transformed into an access to a corresponding data member
8889 of the closure type that would have been declared if x
8890 were a use of the denoted entity. */
8891 if (outer_automatic_var_p (expr
)
8892 && current_function_decl
8893 && LAMBDA_FUNCTION_P (current_function_decl
))
8894 type
= capture_decltype (expr
);
8895 else if (error_operand_p (expr
))
8896 type
= error_mark_node
;
8897 else if (expr
== current_class_ptr
)
8898 /* If the expression is just "this", we want the
8899 cv-unqualified pointer for the "this" type. */
8900 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
8903 /* Otherwise, where T is the type of e, if e is an lvalue,
8904 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
8905 cp_lvalue_kind clk
= lvalue_kind (expr
);
8906 type
= unlowered_expr_type (expr
);
8907 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
8909 /* For vector types, pick a non-opaque variant. */
8910 if (VECTOR_TYPE_P (type
))
8911 type
= strip_typedefs (type
);
8913 if (clk
!= clk_none
&& !(clk
& clk_class
))
8914 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
8921 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
8922 __has_nothrow_copy, depending on assign_p. */
8925 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
8932 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
8935 fns
= (*CLASSTYPE_METHOD_VEC (type
))[ix
];
8937 else if (TYPE_HAS_COPY_CTOR (type
))
8939 /* If construction of the copy constructor was postponed, create
8941 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
8942 lazily_declare_fn (sfk_copy_constructor
, type
);
8943 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
8944 lazily_declare_fn (sfk_move_constructor
, type
);
8945 fns
= CLASSTYPE_CONSTRUCTORS (type
);
8950 for (; fns
; fns
= OVL_NEXT (fns
))
8952 tree fn
= OVL_CURRENT (fns
);
8956 if (copy_fn_p (fn
) == 0)
8959 else if (copy_fn_p (fn
) <= 0)
8962 maybe_instantiate_noexcept (fn
);
8963 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
8970 /* Actually evaluates the trait. */
8973 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
8975 enum tree_code type_code1
;
8978 type_code1
= TREE_CODE (type1
);
8982 case CPTK_HAS_NOTHROW_ASSIGN
:
8983 type1
= strip_array_types (type1
);
8984 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8985 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
8986 || (CLASS_TYPE_P (type1
)
8987 && classtype_has_nothrow_assign_or_copy_p (type1
,
8990 case CPTK_HAS_TRIVIAL_ASSIGN
:
8991 /* ??? The standard seems to be missing the "or array of such a class
8992 type" wording for this trait. */
8993 type1
= strip_array_types (type1
);
8994 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
8995 && (trivial_type_p (type1
)
8996 || (CLASS_TYPE_P (type1
)
8997 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
8999 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9000 type1
= strip_array_types (type1
);
9001 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
9002 || (CLASS_TYPE_P (type1
)
9003 && (t
= locate_ctor (type1
))
9004 && (maybe_instantiate_noexcept (t
),
9005 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
9007 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9008 type1
= strip_array_types (type1
);
9009 return (trivial_type_p (type1
)
9010 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
9012 case CPTK_HAS_NOTHROW_COPY
:
9013 type1
= strip_array_types (type1
);
9014 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
9015 || (CLASS_TYPE_P (type1
)
9016 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
9018 case CPTK_HAS_TRIVIAL_COPY
:
9019 /* ??? The standard seems to be missing the "or array of such a class
9020 type" wording for this trait. */
9021 type1
= strip_array_types (type1
);
9022 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9023 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
9025 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9026 type1
= strip_array_types (type1
);
9027 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9028 || (CLASS_TYPE_P (type1
)
9029 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
9031 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9032 return type_has_virtual_destructor (type1
);
9034 case CPTK_IS_ABSTRACT
:
9035 return (ABSTRACT_CLASS_TYPE_P (type1
));
9037 case CPTK_IS_BASE_OF
:
9038 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9039 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9040 || DERIVED_FROM_P (type1
, type2
)));
9043 return (NON_UNION_CLASS_TYPE_P (type1
));
9046 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
9049 return (type_code1
== ENUMERAL_TYPE
);
9052 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
9054 case CPTK_IS_LITERAL_TYPE
:
9055 return (literal_type_p (type1
));
9058 return (pod_type_p (type1
));
9060 case CPTK_IS_POLYMORPHIC
:
9061 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
9063 case CPTK_IS_SAME_AS
:
9064 return same_type_p (type1
, type2
);
9066 case CPTK_IS_STD_LAYOUT
:
9067 return (std_layout_type_p (type1
));
9069 case CPTK_IS_TRIVIAL
:
9070 return (trivial_type_p (type1
));
9072 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9073 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9075 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9076 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9078 case CPTK_IS_TRIVIALLY_COPYABLE
:
9079 return (trivially_copyable_p (type1
));
9082 return (type_code1
== UNION_TYPE
);
9090 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9091 void, or a complete type, returns true, otherwise false. */
9094 check_trait_type (tree type
)
9096 if (type
== NULL_TREE
)
9099 if (TREE_CODE (type
) == TREE_LIST
)
9100 return (check_trait_type (TREE_VALUE (type
))
9101 && check_trait_type (TREE_CHAIN (type
)));
9103 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9104 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9107 if (VOID_TYPE_P (type
))
9110 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9113 /* Process a trait expression. */
9116 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9118 if (type1
== error_mark_node
9119 || type2
== error_mark_node
)
9120 return error_mark_node
;
9122 if (processing_template_decl
)
9124 tree trait_expr
= make_node (TRAIT_EXPR
);
9125 TREE_TYPE (trait_expr
) = boolean_type_node
;
9126 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9127 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9128 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9134 case CPTK_HAS_NOTHROW_ASSIGN
:
9135 case CPTK_HAS_TRIVIAL_ASSIGN
:
9136 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9137 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9138 case CPTK_HAS_NOTHROW_COPY
:
9139 case CPTK_HAS_TRIVIAL_COPY
:
9140 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9141 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9142 case CPTK_IS_ABSTRACT
:
9145 case CPTK_IS_LITERAL_TYPE
:
9147 case CPTK_IS_POLYMORPHIC
:
9148 case CPTK_IS_STD_LAYOUT
:
9149 case CPTK_IS_TRIVIAL
:
9150 case CPTK_IS_TRIVIALLY_COPYABLE
:
9151 if (!check_trait_type (type1
))
9152 return error_mark_node
;
9155 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9156 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9157 if (!check_trait_type (type1
)
9158 || !check_trait_type (type2
))
9159 return error_mark_node
;
9162 case CPTK_IS_BASE_OF
:
9163 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9164 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9165 && !complete_type_or_else (type2
, NULL_TREE
))
9166 /* We already issued an error. */
9167 return error_mark_node
;
9173 case CPTK_IS_SAME_AS
:
9180 return (trait_expr_value (kind
, type1
, type2
)
9181 ? boolean_true_node
: boolean_false_node
);
9184 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9185 which is ignored for C++. */
9188 set_float_const_decimal64 (void)
9193 clear_float_const_decimal64 (void)
9198 float_const_decimal64_p (void)
9204 /* Return true if T designates the implied `this' parameter. */
9207 is_this_parameter (tree t
)
9209 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9211 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
));
9215 /* Insert the deduced return type for an auto function. */
9218 apply_deduced_return_type (tree fco
, tree return_type
)
9222 if (return_type
== error_mark_node
)
9225 if (LAMBDA_FUNCTION_P (fco
))
9227 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
9228 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
9231 if (DECL_CONV_FN_P (fco
))
9232 DECL_NAME (fco
) = mangle_conv_op_name_for_type (return_type
);
9234 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9236 result
= DECL_RESULT (fco
);
9237 if (result
== NULL_TREE
)
9239 if (TREE_TYPE (result
) == return_type
)
9242 /* We already have a DECL_RESULT from start_preparsed_function.
9243 Now we need to redo the work it and allocate_struct_function
9244 did to reflect the new type. */
9245 gcc_assert (current_function_decl
== fco
);
9246 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9247 TYPE_MAIN_VARIANT (return_type
));
9248 DECL_ARTIFICIAL (result
) = 1;
9249 DECL_IGNORED_P (result
) = 1;
9250 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9253 DECL_RESULT (fco
) = result
;
9255 if (!processing_template_decl
)
9257 if (!VOID_TYPE_P (TREE_TYPE (result
)))
9258 complete_type_or_else (TREE_TYPE (result
), NULL_TREE
);
9259 bool aggr
= aggregate_value_p (result
, fco
);
9260 #ifdef PCC_STATIC_STRUCT_RETURN
9261 cfun
->returns_pcc_struct
= aggr
;
9263 cfun
->returns_struct
= aggr
;
9268 /* DECL is a local variable or parameter from the surrounding scope of a
9269 lambda-expression. Returns the decltype for a use of the capture field
9270 for DECL even if it hasn't been captured yet. */
9273 capture_decltype (tree decl
)
9275 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9276 /* FIXME do lookup instead of list walk? */
9277 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9281 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9283 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9286 error ("%qD is not captured", decl
);
9287 return error_mark_node
;
9290 type
= TREE_TYPE (decl
);
9291 if (TREE_CODE (type
) == REFERENCE_TYPE
9292 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9293 type
= TREE_TYPE (type
);
9296 case CPLD_REFERENCE
:
9297 type
= TREE_TYPE (decl
);
9298 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9299 type
= build_reference_type (TREE_TYPE (decl
));
9306 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9308 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9309 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9311 type
= build_reference_type (type
);
9316 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9317 this is a right unary fold. Otherwise it is a left unary fold. */
9320 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9322 // Build a pack expansion (assuming expr has pack type).
9323 if (!uses_parameter_packs (expr
))
9325 error_at (location_of (expr
), "operand of fold expression has no "
9326 "unexpanded parameter packs");
9327 return error_mark_node
;
9329 tree pack
= make_pack_expansion (expr
);
9331 // Build the fold expression.
9332 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9333 tree fold
= build_min (dir
, unknown_type_node
, code
, pack
);
9334 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9339 finish_left_unary_fold_expr (tree expr
, int op
)
9341 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9345 finish_right_unary_fold_expr (tree expr
, int op
)
9347 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9350 /* Build a binary fold expression over EXPR1 and EXPR2. The
9351 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9352 has an unexpanded parameter pack). */
9355 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9357 pack
= make_pack_expansion (pack
);
9358 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9359 tree fold
= build_min (dir
, unknown_type_node
, code
, pack
, init
);
9360 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9365 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9367 // Determine which expr has an unexpanded parameter pack and
9368 // set the pack and initial term.
9369 bool pack1
= uses_parameter_packs (expr1
);
9370 bool pack2
= uses_parameter_packs (expr2
);
9371 if (pack1
&& !pack2
)
9372 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9373 else if (pack2
&& !pack1
)
9374 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9378 error ("both arguments in binary fold have unexpanded parameter packs");
9380 error ("no unexpanded parameter packs in binary fold");
9382 return error_mark_node
;
9385 #include "gt-cp-semantics.h"