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;
2213 location_t loc
= fn
.get_location ();
2215 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2217 /* Use a separate flag to handle null args. */
2219 tmpl_args
= TREE_OPERAND (fn
, 1);
2220 fn
= TREE_OPERAND (fn
, 0);
2223 /* Find the name of the overloaded function. */
2224 if (identifier_p (fn
))
2226 else if (is_overloaded_fn (fn
))
2229 identifier
= DECL_NAME (get_first_fn (functions
));
2231 else if (DECL_P (fn
))
2234 identifier
= DECL_NAME (fn
);
2237 /* A call to a namespace-scope function using an unqualified name.
2239 Do Koenig lookup -- unless any of the arguments are
2241 if (!any_type_dependent_arguments_p (args
)
2242 && !any_dependent_template_arguments_p (tmpl_args
))
2244 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2247 /* The unqualified name could not be resolved. */
2249 fn
= unqualified_fn_lookup_error (cp_expr (identifier
, loc
));
2255 if (fn
&& template_id
)
2256 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2261 /* Generate an expression for `FN (ARGS)'. This may change the
2264 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2265 as a virtual call, even if FN is virtual. (This flag is set when
2266 encountering an expression where the function name is explicitly
2267 qualified. For example a call to `X::f' never generates a virtual
2270 Returns code for the call. */
2273 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2274 bool koenig_p
, tsubst_flags_t complain
)
2278 vec
<tree
, va_gc
> *orig_args
= NULL
;
2280 if (fn
== error_mark_node
)
2281 return error_mark_node
;
2283 gcc_assert (!TYPE_P (fn
));
2285 /* If FN may be a FUNCTION_DECL obfuscated by force_paren_expr, undo
2286 it so that we can tell this is a call to a known function. */
2287 fn
= maybe_undo_parenthesized_ref (fn
);
2291 if (processing_template_decl
)
2293 /* If the call expression is dependent, build a CALL_EXPR node
2294 with no type; type_dependent_expression_p recognizes
2295 expressions with no type as being dependent. */
2296 if (type_dependent_expression_p (fn
)
2297 || any_type_dependent_arguments_p (*args
))
2299 result
= build_nt_call_vec (fn
, *args
);
2300 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2301 KOENIG_LOOKUP_P (result
) = koenig_p
;
2306 tree fndecl
= OVL_CURRENT (fn
);
2307 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2308 || !TREE_THIS_VOLATILE (fndecl
))
2314 current_function_returns_abnormally
= 1;
2318 orig_args
= make_tree_vector_copy (*args
);
2319 if (!BASELINK_P (fn
)
2320 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2321 && TREE_TYPE (fn
) != unknown_type_node
)
2322 fn
= build_non_dependent_expr (fn
);
2323 make_args_non_dependent (*args
);
2326 if (TREE_CODE (fn
) == COMPONENT_REF
)
2328 tree member
= TREE_OPERAND (fn
, 1);
2329 if (BASELINK_P (member
))
2331 tree object
= TREE_OPERAND (fn
, 0);
2332 return build_new_method_call (object
, member
,
2335 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2342 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2343 if (TREE_CODE (fn
) == ADDR_EXPR
2344 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2345 fn
= TREE_OPERAND (fn
, 0);
2347 if (is_overloaded_fn (fn
))
2348 fn
= baselink_for_fns (fn
);
2351 if (BASELINK_P (fn
))
2355 /* A call to a member function. From [over.call.func]:
2357 If the keyword this is in scope and refers to the class of
2358 that member function, or a derived class thereof, then the
2359 function call is transformed into a qualified function call
2360 using (*this) as the postfix-expression to the left of the
2361 . operator.... [Otherwise] a contrived object of type T
2362 becomes the implied object argument.
2366 struct A { void f(); };
2367 struct B : public A {};
2368 struct C : public A { void g() { B::f(); }};
2370 "the class of that member function" refers to `A'. But 11.2
2371 [class.access.base] says that we need to convert 'this' to B* as
2372 part of the access, so we pass 'B' to maybe_dummy_object. */
2374 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (get_first_fn (fn
)))
2376 /* A constructor call always uses a dummy object. (This constructor
2377 call which has the form A::A () is actually invalid and we are
2378 going to reject it later in build_new_method_call.) */
2379 object
= build_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)));
2382 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2385 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2387 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2392 else if (is_overloaded_fn (fn
))
2394 /* If the function is an overloaded builtin, resolve it. */
2395 if (TREE_CODE (fn
) == FUNCTION_DECL
2396 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2397 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2398 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2402 if (warn_sizeof_pointer_memaccess
2403 && (complain
& tf_warning
)
2404 && !vec_safe_is_empty (*args
)
2405 && !processing_template_decl
)
2407 location_t sizeof_arg_loc
[3];
2410 for (i
= 0; i
< 3; i
++)
2414 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2415 sizeof_arg
[i
] = NULL_TREE
;
2416 if (i
>= (*args
)->length ())
2419 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2421 if (SIZEOF_EXPR_TYPE_P (t
))
2422 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2424 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2425 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2427 sizeof_pointer_memaccess_warning
2428 (sizeof_arg_loc
, fn
, *args
,
2429 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2432 /* A call to a namespace-scope function. */
2433 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2436 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2438 if (!vec_safe_is_empty (*args
))
2439 error ("arguments to destructor are not allowed");
2440 /* Mark the pseudo-destructor call as having side-effects so
2441 that we do not issue warnings about its use. */
2442 result
= build1 (NOP_EXPR
,
2444 TREE_OPERAND (fn
, 0));
2445 TREE_SIDE_EFFECTS (result
) = 1;
2447 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2448 /* If the "function" is really an object of class type, it might
2449 have an overloaded `operator ()'. */
2450 result
= build_op_call (fn
, args
, complain
);
2453 /* A call where the function is unknown. */
2454 result
= cp_build_function_call_vec (fn
, args
, complain
);
2456 if (processing_template_decl
&& result
!= error_mark_node
)
2458 if (INDIRECT_REF_P (result
))
2459 result
= TREE_OPERAND (result
, 0);
2460 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2461 SET_EXPR_LOCATION (result
, input_location
);
2462 KOENIG_LOOKUP_P (result
) = koenig_p
;
2463 release_tree_vector (orig_args
);
2464 result
= convert_from_reference (result
);
2469 /* Free garbage OVERLOADs from arg-dependent lookup. */
2470 tree next
= NULL_TREE
;
2472 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2475 if (processing_template_decl
)
2476 /* In a template, we'll re-use them at instantiation time. */
2477 OVL_ARG_DEPENDENT (fn
) = false;
2480 next
= OVL_CHAIN (fn
);
2489 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2490 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2491 POSTDECREMENT_EXPR.) */
2494 finish_increment_expr (cp_expr expr
, enum tree_code code
)
2496 /* input_location holds the location of the trailing operator token.
2497 Build a location of the form:
2500 with the caret at the operator token, ranging from the start
2501 of EXPR to the end of the operator token. */
2502 location_t combined_loc
= make_location (input_location
,
2504 get_finish (input_location
));
2505 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
,
2506 tf_warning_or_error
);
2507 /* TODO: build_x_unary_op doesn't honor the location, so set it here. */
2508 result
.set_location (combined_loc
);
2512 /* Finish a use of `this'. Returns an expression for `this'. */
2515 finish_this_expr (void)
2517 tree result
= NULL_TREE
;
2519 if (current_class_ptr
)
2521 tree type
= TREE_TYPE (current_class_ref
);
2523 /* In a lambda expression, 'this' refers to the captured 'this'. */
2524 if (LAMBDA_TYPE_P (type
))
2525 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2527 result
= current_class_ptr
;
2531 /* The keyword 'this' is a prvalue expression. */
2532 return rvalue (result
);
2534 tree fn
= current_nonlambda_function ();
2535 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2536 error ("%<this%> is unavailable for static member functions");
2538 error ("invalid use of %<this%> in non-member function");
2540 error ("invalid use of %<this%> at top level");
2541 return error_mark_node
;
2544 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2545 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2546 the TYPE for the type given. If SCOPE is non-NULL, the expression
2547 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2550 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2553 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2554 return error_mark_node
;
2556 gcc_assert (TYPE_P (destructor
));
2558 if (!processing_template_decl
)
2560 if (scope
== error_mark_node
)
2562 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2563 return error_mark_node
;
2565 if (is_auto (destructor
))
2566 destructor
= TREE_TYPE (object
);
2567 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2570 "qualified type %qT does not match destructor name ~%qT",
2572 return error_mark_node
;
2576 /* [expr.pseudo] says both:
2578 The type designated by the pseudo-destructor-name shall be
2579 the same as the object type.
2583 The cv-unqualified versions of the object type and of the
2584 type designated by the pseudo-destructor-name shall be the
2587 We implement the more generous second sentence, since that is
2588 what most other compilers do. */
2589 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2592 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2593 return error_mark_node
;
2597 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2601 /* Finish an expression of the form CODE EXPR. */
2604 finish_unary_op_expr (location_t op_loc
, enum tree_code code
, cp_expr expr
,
2605 tsubst_flags_t complain
)
2607 /* Build a location of the form:
2610 with the caret at the operator token, ranging from the start
2611 of the operator token to the end of EXPR. */
2612 location_t combined_loc
= make_location (op_loc
,
2613 op_loc
, expr
.get_finish ());
2614 cp_expr result
= build_x_unary_op (combined_loc
, code
, expr
, complain
);
2615 /* TODO: build_x_unary_op doesn't always honor the location. */
2616 result
.set_location (combined_loc
);
2618 tree result_ovl
, expr_ovl
;
2620 if (!(complain
& tf_warning
))
2623 result_ovl
= result
;
2626 if (!processing_template_decl
)
2627 expr_ovl
= cp_fully_fold (expr_ovl
);
2629 if (!CONSTANT_CLASS_P (expr_ovl
)
2630 || TREE_OVERFLOW_P (expr_ovl
))
2633 if (!processing_template_decl
)
2634 result_ovl
= cp_fully_fold (result_ovl
);
2636 if (CONSTANT_CLASS_P (result_ovl
) && TREE_OVERFLOW_P (result_ovl
))
2637 overflow_warning (combined_loc
, result_ovl
);
2642 /* Finish a compound-literal expression. TYPE is the type to which
2643 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2646 finish_compound_literal (tree type
, tree compound_literal
,
2647 tsubst_flags_t complain
)
2649 if (type
== error_mark_node
)
2650 return error_mark_node
;
2652 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2655 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2657 return cp_build_c_cast (type
, compound_literal
, complain
);
2660 if (!TYPE_OBJ_P (type
))
2662 if (complain
& tf_error
)
2663 error ("compound literal of non-object type %qT", type
);
2664 return error_mark_node
;
2667 if (processing_template_decl
)
2669 TREE_TYPE (compound_literal
) = type
;
2670 /* Mark the expression as a compound literal. */
2671 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2672 return compound_literal
;
2675 type
= complete_type (type
);
2677 if (TYPE_NON_AGGREGATE_CLASS (type
))
2679 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2680 everywhere that deals with function arguments would be a pain, so
2681 just wrap it in a TREE_LIST. The parser set a flag so we know
2682 that it came from T{} rather than T({}). */
2683 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2684 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2685 return build_functional_cast (type
, compound_literal
, complain
);
2688 if (TREE_CODE (type
) == ARRAY_TYPE
2689 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2690 return error_mark_node
;
2691 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2692 if (SCALAR_TYPE_P (type
)
2693 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2694 && !check_narrowing (type
, compound_literal
, complain
))
2695 return error_mark_node
;
2696 if (TREE_CODE (type
) == ARRAY_TYPE
2697 && TYPE_DOMAIN (type
) == NULL_TREE
)
2699 cp_complete_array_type_or_error (&type
, compound_literal
,
2701 if (type
== error_mark_node
)
2702 return error_mark_node
;
2704 compound_literal
= digest_init (type
, compound_literal
, complain
);
2705 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2706 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2708 /* Put static/constant array temporaries in static variables. */
2709 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2710 && TREE_CODE (type
) == ARRAY_TYPE
2711 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2712 && initializer_constant_valid_p (compound_literal
, type
))
2714 tree decl
= create_temporary_var (type
);
2715 DECL_INITIAL (decl
) = compound_literal
;
2716 TREE_STATIC (decl
) = 1;
2717 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2719 /* 5.19 says that a constant expression can include an
2720 lvalue-rvalue conversion applied to "a glvalue of literal type
2721 that refers to a non-volatile temporary object initialized
2722 with a constant expression". Rather than try to communicate
2723 that this VAR_DECL is a temporary, just mark it constexpr. */
2724 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2725 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2726 TREE_CONSTANT (decl
) = true;
2728 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2729 decl
= pushdecl_top_level (decl
);
2730 DECL_NAME (decl
) = make_anon_name ();
2731 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2732 /* Make sure the destructor is callable. */
2733 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2734 if (clean
== error_mark_node
)
2735 return error_mark_node
;
2739 /* Represent other compound literals with TARGET_EXPR so we produce
2740 an lvalue, but can elide copies. */
2741 if (!VECTOR_TYPE_P (type
))
2742 compound_literal
= get_target_expr_sfinae (compound_literal
, complain
);
2744 return compound_literal
;
2747 /* Return the declaration for the function-name variable indicated by
2751 finish_fname (tree id
)
2755 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2756 if (processing_template_decl
&& current_function_decl
2757 && decl
!= error_mark_node
)
2758 decl
= DECL_NAME (decl
);
2762 /* Finish a translation unit. */
2765 finish_translation_unit (void)
2767 /* In case there were missing closebraces,
2768 get us back to the global binding level. */
2770 while (current_namespace
!= global_namespace
)
2773 /* Do file scope __FUNCTION__ et al. */
2774 finish_fname_decls ();
2777 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2778 Returns the parameter. */
2781 finish_template_type_parm (tree aggr
, tree identifier
)
2783 if (aggr
!= class_type_node
)
2785 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2786 aggr
= class_type_node
;
2789 return build_tree_list (aggr
, identifier
);
2792 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2793 Returns the parameter. */
2796 finish_template_template_parm (tree aggr
, tree identifier
)
2798 tree decl
= build_decl (input_location
,
2799 TYPE_DECL
, identifier
, NULL_TREE
);
2801 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2802 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2803 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2804 DECL_ARTIFICIAL (decl
) = 1;
2806 // Associate the constraints with the underlying declaration,
2807 // not the template.
2808 tree reqs
= TEMPLATE_PARMS_CONSTRAINTS (current_template_parms
);
2809 tree constr
= build_constraints (reqs
, NULL_TREE
);
2810 set_constraints (decl
, constr
);
2812 end_template_decl ();
2814 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2816 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2817 /*is_primary=*/true, /*is_partial=*/false,
2820 return finish_template_type_parm (aggr
, tmpl
);
2823 /* ARGUMENT is the default-argument value for a template template
2824 parameter. If ARGUMENT is invalid, issue error messages and return
2825 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2828 check_template_template_default_arg (tree argument
)
2830 if (TREE_CODE (argument
) != TEMPLATE_DECL
2831 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2832 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2834 if (TREE_CODE (argument
) == TYPE_DECL
)
2835 error ("invalid use of type %qT as a default value for a template "
2836 "template-parameter", TREE_TYPE (argument
));
2838 error ("invalid default argument for a template template parameter");
2839 return error_mark_node
;
2845 /* Begin a class definition, as indicated by T. */
2848 begin_class_definition (tree t
)
2850 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2851 return error_mark_node
;
2853 if (processing_template_parmlist
)
2855 error ("definition of %q#T inside template parameter list", t
);
2856 return error_mark_node
;
2859 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2860 are passed the same as decimal scalar types. */
2861 if (TREE_CODE (t
) == RECORD_TYPE
2862 && !processing_template_decl
)
2864 tree ns
= TYPE_CONTEXT (t
);
2865 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2866 && DECL_CONTEXT (ns
) == std_node
2868 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2870 const char *n
= TYPE_NAME_STRING (t
);
2871 if ((strcmp (n
, "decimal32") == 0)
2872 || (strcmp (n
, "decimal64") == 0)
2873 || (strcmp (n
, "decimal128") == 0))
2874 TYPE_TRANSPARENT_AGGR (t
) = 1;
2878 /* A non-implicit typename comes from code like:
2880 template <typename T> struct A {
2881 template <typename U> struct A<T>::B ...
2883 This is erroneous. */
2884 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2886 error ("invalid definition of qualified type %qT", t
);
2887 t
= error_mark_node
;
2890 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2892 t
= make_class_type (RECORD_TYPE
);
2893 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2896 if (TYPE_BEING_DEFINED (t
))
2898 t
= make_class_type (TREE_CODE (t
));
2899 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2901 maybe_process_partial_specialization (t
);
2903 TYPE_BEING_DEFINED (t
) = 1;
2904 class_binding_level
->defining_class_p
= 1;
2906 if (flag_pack_struct
)
2909 TYPE_PACKED (t
) = 1;
2910 /* Even though the type is being defined for the first time
2911 here, there might have been a forward declaration, so there
2912 might be cv-qualified variants of T. */
2913 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2914 TYPE_PACKED (v
) = 1;
2916 /* Reset the interface data, at the earliest possible
2917 moment, as it might have been set via a class foo;
2919 if (! TYPE_ANONYMOUS_P (t
))
2921 struct c_fileinfo
*finfo
= \
2922 get_fileinfo (LOCATION_FILE (input_location
));
2923 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2924 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2925 (t
, finfo
->interface_unknown
);
2927 reset_specialization();
2929 /* Make a declaration for this class in its own scope. */
2930 build_self_reference ();
2935 /* Finish the member declaration given by DECL. */
2938 finish_member_declaration (tree decl
)
2940 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2943 if (decl
== void_type_node
)
2944 /* The COMPONENT was a friend, not a member, and so there's
2945 nothing for us to do. */
2948 /* We should see only one DECL at a time. */
2949 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2951 /* Set up access control for DECL. */
2953 = (current_access_specifier
== access_private_node
);
2954 TREE_PROTECTED (decl
)
2955 = (current_access_specifier
== access_protected_node
);
2956 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2958 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2959 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2962 /* Mark the DECL as a member of the current class, unless it's
2963 a member of an enumeration. */
2964 if (TREE_CODE (decl
) != CONST_DECL
)
2965 DECL_CONTEXT (decl
) = current_class_type
;
2967 /* Check for bare parameter packs in the member variable declaration. */
2968 if (TREE_CODE (decl
) == FIELD_DECL
)
2970 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2971 TREE_TYPE (decl
) = error_mark_node
;
2972 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2973 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2978 A C language linkage is ignored for the names of class members
2979 and the member function type of class member functions. */
2980 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2981 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2983 /* Put functions on the TYPE_METHODS list and everything else on the
2984 TYPE_FIELDS list. Note that these are built up in reverse order.
2985 We reverse them (to obtain declaration order) in finish_struct. */
2986 if (DECL_DECLARES_FUNCTION_P (decl
))
2988 /* We also need to add this function to the
2989 CLASSTYPE_METHOD_VEC. */
2990 if (add_method (current_class_type
, decl
, NULL_TREE
))
2992 gcc_assert (TYPE_MAIN_VARIANT (current_class_type
) == current_class_type
);
2993 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2994 TYPE_METHODS (current_class_type
) = decl
;
2996 maybe_add_class_template_decl_list (current_class_type
, decl
,
3000 /* Enter the DECL into the scope of the class, if the class
3001 isn't a closure (whose fields are supposed to be unnamed). */
3002 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
3003 || pushdecl_class_level (decl
))
3005 if (TREE_CODE (decl
) == USING_DECL
)
3007 /* For now, ignore class-scope USING_DECLS, so that
3008 debugging backends do not see them. */
3009 DECL_IGNORED_P (decl
) = 1;
3012 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
3013 go at the beginning. The reason is that lookup_field_1
3014 searches the list in order, and we want a field name to
3015 override a type name so that the "struct stat hack" will
3016 work. In particular:
3018 struct S { enum E { }; int E } s;
3021 is valid. In addition, the FIELD_DECLs must be maintained in
3022 declaration order so that class layout works as expected.
3023 However, we don't need that order until class layout, so we
3024 save a little time by putting FIELD_DECLs on in reverse order
3025 here, and then reversing them in finish_struct_1. (We could
3026 also keep a pointer to the correct insertion points in the
3029 if (TREE_CODE (decl
) == TYPE_DECL
)
3030 TYPE_FIELDS (current_class_type
)
3031 = chainon (TYPE_FIELDS (current_class_type
), decl
);
3034 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
3035 TYPE_FIELDS (current_class_type
) = decl
;
3038 maybe_add_class_template_decl_list (current_class_type
, decl
,
3043 /* Finish processing a complete template declaration. The PARMS are
3044 the template parameters. */
3047 finish_template_decl (tree parms
)
3050 end_template_decl ();
3052 end_specialization ();
3055 // Returns the template type of the class scope being entered. If we're
3056 // entering a constrained class scope. TYPE is the class template
3057 // scope being entered and we may need to match the intended type with
3058 // a constrained specialization. For example:
3060 // template<Object T>
3061 // struct S { void f(); }; #1
3063 // template<Object T>
3064 // void S<T>::f() { } #2
3066 // We check, in #2, that S<T> refers precisely to the type declared by
3067 // #1 (i.e., that the constraints match). Note that the following should
3068 // be an error since there is no specialization of S<T> that is
3069 // unconstrained, but this is not diagnosed here.
3071 // template<typename T>
3072 // void S<T>::f() { }
3074 // We cannot diagnose this problem here since this function also matches
3075 // qualified template names that are not part of a definition. For example:
3077 // template<Integral T, Floating_point U>
3078 // typename pair<T, U>::first_type void f(T, U);
3080 // Here, it is unlikely that there is a partial specialization of
3081 // pair constrained for for Integral and Floating_point arguments.
3083 // The general rule is: if a constrained specialization with matching
3084 // constraints is found return that type. Also note that if TYPE is not a
3085 // class-type (e.g. a typename type), then no fixup is needed.
3088 fixup_template_type (tree type
)
3090 // Find the template parameter list at the a depth appropriate to
3091 // the scope we're trying to enter.
3092 tree parms
= current_template_parms
;
3093 int depth
= template_class_depth (type
);
3094 for (int n
= processing_template_decl
; n
> depth
&& parms
; --n
)
3095 parms
= TREE_CHAIN (parms
);
3098 tree cur_reqs
= TEMPLATE_PARMS_CONSTRAINTS (parms
);
3099 tree cur_constr
= build_constraints (cur_reqs
, NULL_TREE
);
3101 // Search for a specialization whose type and constraints match.
3102 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
3103 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3106 tree spec_constr
= get_constraints (TREE_VALUE (specs
));
3108 // If the type and constraints match a specialization, then we
3109 // are entering that type.
3110 if (same_type_p (type
, TREE_TYPE (specs
))
3111 && equivalent_constraints (cur_constr
, spec_constr
))
3112 return TREE_TYPE (specs
);
3113 specs
= TREE_CHAIN (specs
);
3116 // If no specialization matches, then must return the type
3117 // previously found.
3121 /* Finish processing a template-id (which names a type) of the form
3122 NAME < ARGS >. Return the TYPE_DECL for the type named by the
3123 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3124 the scope of template-id indicated. */
3127 finish_template_type (tree name
, tree args
, int entering_scope
)
3131 type
= lookup_template_class (name
, args
,
3132 NULL_TREE
, NULL_TREE
, entering_scope
,
3133 tf_warning_or_error
| tf_user
);
3135 /* If we might be entering the scope of a partial specialization,
3136 find the one with the right constraints. */
3139 && CLASS_TYPE_P (type
)
3140 && dependent_type_p (type
)
3141 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
3142 type
= fixup_template_type (type
);
3144 if (type
== error_mark_node
)
3146 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3147 return TYPE_STUB_DECL (type
);
3149 return TYPE_NAME (type
);
3152 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3153 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3154 BASE_CLASS, or NULL_TREE if an error occurred. The
3155 ACCESS_SPECIFIER is one of
3156 access_{default,public,protected_private}_node. For a virtual base
3157 we set TREE_TYPE. */
3160 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3164 if (base
== error_mark_node
)
3166 error ("invalid base-class specification");
3169 else if (! MAYBE_CLASS_TYPE_P (base
))
3171 error ("%qT is not a class type", base
);
3176 if (cp_type_quals (base
) != 0)
3178 /* DR 484: Can a base-specifier name a cv-qualified
3180 base
= TYPE_MAIN_VARIANT (base
);
3182 result
= build_tree_list (access
, base
);
3184 TREE_TYPE (result
) = integer_type_node
;
3190 /* If FNS is a member function, a set of member functions, or a
3191 template-id referring to one or more member functions, return a
3192 BASELINK for FNS, incorporating the current access context.
3193 Otherwise, return FNS unchanged. */
3196 baselink_for_fns (tree fns
)
3201 if (BASELINK_P (fns
)
3202 || error_operand_p (fns
))
3205 scope
= ovl_scope (fns
);
3206 if (!CLASS_TYPE_P (scope
))
3209 cl
= currently_open_derived_class (scope
);
3212 cl
= TYPE_BINFO (cl
);
3213 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3216 /* Returns true iff DECL is a variable from a function outside
3220 outer_var_p (tree decl
)
3222 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3223 && DECL_FUNCTION_SCOPE_P (decl
)
3224 && (DECL_CONTEXT (decl
) != current_function_decl
3225 || parsing_nsdmi ()));
3228 /* As above, but also checks that DECL is automatic. */
3231 outer_automatic_var_p (tree decl
)
3233 return (outer_var_p (decl
)
3234 && !TREE_STATIC (decl
));
3237 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3238 rewrite it for lambda capture. */
3241 process_outer_var_ref (tree decl
, tsubst_flags_t complain
)
3243 if (cp_unevaluated_operand
)
3244 /* It's not a use (3.2) if we're in an unevaluated context. */
3246 if (decl
== error_mark_node
)
3249 tree context
= DECL_CONTEXT (decl
);
3250 tree containing_function
= current_function_decl
;
3251 tree lambda_stack
= NULL_TREE
;
3252 tree lambda_expr
= NULL_TREE
;
3253 tree initializer
= convert_from_reference (decl
);
3255 /* Mark it as used now even if the use is ill-formed. */
3256 if (!mark_used (decl
, complain
))
3257 return error_mark_node
;
3259 bool saw_generic_lambda
= false;
3260 if (parsing_nsdmi ())
3261 containing_function
= NULL_TREE
;
3263 /* If we are in a lambda function, we can move out until we hit
3265 2. a non-lambda function, or
3266 3. a non-default capturing lambda function. */
3267 while (context
!= containing_function
3268 && LAMBDA_FUNCTION_P (containing_function
))
3270 tree closure
= DECL_CONTEXT (containing_function
);
3271 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3273 if (generic_lambda_fn_p (containing_function
))
3274 saw_generic_lambda
= true;
3276 if (TYPE_CLASS_SCOPE_P (closure
))
3277 /* A lambda in an NSDMI (c++/64496). */
3280 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3284 lambda_stack
= tree_cons (NULL_TREE
,
3289 = decl_function_context (containing_function
);
3292 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3293 support for an approach in which a reference to a local
3294 [constant] automatic variable in a nested class or lambda body
3295 would enter the expression as an rvalue, which would reduce
3296 the complexity of the problem"
3298 FIXME update for final resolution of core issue 696. */
3299 if (decl_maybe_constant_var_p (decl
))
3301 if (processing_template_decl
&& !saw_generic_lambda
)
3302 /* In a non-generic lambda within a template, wait until instantiation
3303 time to decide whether to capture. For a generic lambda, we can't
3304 wait until we instantiate the op() because the closure class is
3305 already defined at that point. FIXME to get the semantics exactly
3306 right we need to partially-instantiate the lambda body so the only
3307 dependencies left are on the generic parameters themselves. This
3308 probably means moving away from our current model of lambdas in
3309 templates (instantiating the closure type) to one based on creating
3310 the closure type when instantiating the lambda context. That is
3311 probably also the way to handle lambdas within pack expansions. */
3313 else if (decl_constant_var_p (decl
))
3315 tree t
= maybe_constant_value (convert_from_reference (decl
));
3316 if (TREE_CONSTANT (t
))
3321 if (lambda_expr
&& VAR_P (decl
)
3322 && DECL_ANON_UNION_VAR_P (decl
))
3324 if (complain
& tf_error
)
3325 error ("cannot capture member %qD of anonymous union", decl
);
3326 return error_mark_node
;
3328 if (context
== containing_function
)
3330 decl
= add_default_capture (lambda_stack
,
3331 /*id=*/DECL_NAME (decl
),
3334 else if (lambda_expr
)
3336 if (complain
& tf_error
)
3338 error ("%qD is not captured", decl
);
3339 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3340 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3342 inform (location_of (closure
),
3343 "the lambda has no capture-default");
3344 else if (TYPE_CLASS_SCOPE_P (closure
))
3345 inform (0, "lambda in local class %q+T cannot "
3346 "capture variables from the enclosing context",
3347 TYPE_CONTEXT (closure
));
3348 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3350 return error_mark_node
;
3354 if (complain
& tf_error
)
3356 ? G_("use of local variable with automatic storage from containing function")
3357 : G_("use of parameter from containing function"));
3358 inform (DECL_SOURCE_LOCATION (decl
), "%q#D declared here", decl
);
3359 return error_mark_node
;
3364 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3365 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3366 if non-NULL, is the type or namespace used to explicitly qualify
3367 ID_EXPRESSION. DECL is the entity to which that name has been
3370 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3371 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3372 be set to true if this expression isn't permitted in a
3373 constant-expression, but it is otherwise not set by this function.
3374 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3375 constant-expression, but a non-constant expression is also
3378 DONE is true if this expression is a complete postfix-expression;
3379 it is false if this expression is followed by '->', '[', '(', etc.
3380 ADDRESS_P is true iff this expression is the operand of '&'.
3381 TEMPLATE_P is true iff the qualified-id was of the form
3382 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3383 appears as a template argument.
3385 If an error occurs, and it is the kind of error that might cause
3386 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3387 is the caller's responsibility to issue the message. *ERROR_MSG
3388 will be a string with static storage duration, so the caller need
3391 Return an expression for the entity, after issuing appropriate
3392 diagnostics. This function is also responsible for transforming a
3393 reference to a non-static member into a COMPONENT_REF that makes
3394 the use of "this" explicit.
3396 Upon return, *IDK will be filled in appropriately. */
3398 finish_id_expression (tree id_expression
,
3402 bool integral_constant_expression_p
,
3403 bool allow_non_integral_constant_expression_p
,
3404 bool *non_integral_constant_expression_p
,
3408 bool template_arg_p
,
3409 const char **error_msg
,
3410 location_t location
)
3412 decl
= strip_using_decl (decl
);
3414 /* Initialize the output parameters. */
3415 *idk
= CP_ID_KIND_NONE
;
3418 if (id_expression
== error_mark_node
)
3419 return error_mark_node
;
3420 /* If we have a template-id, then no further lookup is
3421 required. If the template-id was for a template-class, we
3422 will sometimes have a TYPE_DECL at this point. */
3423 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3424 || TREE_CODE (decl
) == TYPE_DECL
)
3426 /* Look up the name. */
3429 if (decl
== error_mark_node
)
3431 /* Name lookup failed. */
3434 || (!dependent_type_p (scope
)
3435 && !(identifier_p (id_expression
)
3436 && IDENTIFIER_TYPENAME_P (id_expression
)
3437 && dependent_type_p (TREE_TYPE (id_expression
))))))
3439 /* If the qualifying type is non-dependent (and the name
3440 does not name a conversion operator to a dependent
3441 type), issue an error. */
3442 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3443 return error_mark_node
;
3447 /* It may be resolved via Koenig lookup. */
3448 *idk
= CP_ID_KIND_UNQUALIFIED
;
3449 return id_expression
;
3452 decl
= id_expression
;
3454 /* If DECL is a variable that would be out of scope under
3455 ANSI/ISO rules, but in scope in the ARM, name lookup
3456 will succeed. Issue a diagnostic here. */
3458 decl
= check_for_out_of_scope_variable (decl
);
3460 /* Remember that the name was used in the definition of
3461 the current class so that we can check later to see if
3462 the meaning would have been different after the class
3463 was entirely defined. */
3464 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3465 maybe_note_name_used_in_class (id_expression
, decl
);
3467 /* A use in unevaluated operand might not be instantiated appropriately
3468 if tsubst_copy builds a dummy parm, or if we never instantiate a
3469 generic lambda, so mark it now. */
3470 if (processing_template_decl
&& cp_unevaluated_operand
)
3471 mark_type_use (decl
);
3473 /* Disallow uses of local variables from containing functions, except
3474 within lambda-expressions. */
3475 if (outer_automatic_var_p (decl
))
3477 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3478 if (decl
== error_mark_node
)
3479 return error_mark_node
;
3482 /* Also disallow uses of function parameters outside the function
3483 body, except inside an unevaluated context (i.e. decltype). */
3484 if (TREE_CODE (decl
) == PARM_DECL
3485 && DECL_CONTEXT (decl
) == NULL_TREE
3486 && !cp_unevaluated_operand
)
3488 *error_msg
= "use of parameter outside function body";
3489 return error_mark_node
;
3493 /* If we didn't find anything, or what we found was a type,
3494 then this wasn't really an id-expression. */
3495 if (TREE_CODE (decl
) == TEMPLATE_DECL
3496 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3498 *error_msg
= "missing template arguments";
3499 return error_mark_node
;
3501 else if (TREE_CODE (decl
) == TYPE_DECL
3502 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3504 *error_msg
= "expected primary-expression";
3505 return error_mark_node
;
3508 /* If the name resolved to a template parameter, there is no
3509 need to look it up again later. */
3510 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3511 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3515 *idk
= CP_ID_KIND_NONE
;
3516 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3517 decl
= TEMPLATE_PARM_DECL (decl
);
3518 r
= convert_from_reference (DECL_INITIAL (decl
));
3520 if (integral_constant_expression_p
3521 && !dependent_type_p (TREE_TYPE (decl
))
3522 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3524 if (!allow_non_integral_constant_expression_p
)
3525 error ("template parameter %qD of type %qT is not allowed in "
3526 "an integral constant expression because it is not of "
3527 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3528 *non_integral_constant_expression_p
= true;
3534 bool dependent_p
= type_dependent_expression_p (decl
);
3536 /* If the declaration was explicitly qualified indicate
3537 that. The semantics of `A::f(3)' are different than
3538 `f(3)' if `f' is virtual. */
3540 ? CP_ID_KIND_QUALIFIED
3541 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3542 ? CP_ID_KIND_TEMPLATE_ID
3544 ? CP_ID_KIND_UNQUALIFIED_DEPENDENT
3545 : CP_ID_KIND_UNQUALIFIED
)));
3547 /* If the name was dependent on a template parameter, we will
3548 resolve the name at instantiation time. */
3551 /* If we found a variable, then name lookup during the
3552 instantiation will always resolve to the same VAR_DECL
3553 (or an instantiation thereof). */
3555 || TREE_CODE (decl
) == CONST_DECL
3556 || TREE_CODE (decl
) == PARM_DECL
)
3559 return convert_from_reference (decl
);
3562 /* Create a SCOPE_REF for qualified names, if the scope is
3568 if (address_p
&& done
)
3569 decl
= finish_qualified_id_expr (scope
, decl
,
3573 tf_warning_or_error
);
3576 tree type
= NULL_TREE
;
3577 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3578 type
= TREE_TYPE (decl
);
3579 decl
= build_qualified_name (type
,
3585 if (TREE_TYPE (decl
))
3586 decl
= convert_from_reference (decl
);
3589 /* A TEMPLATE_ID already contains all the information we
3591 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3592 return id_expression
;
3593 /* The same is true for FIELD_DECL, but we also need to
3594 make sure that the syntax is correct. */
3595 else if (TREE_CODE (decl
) == FIELD_DECL
)
3597 /* Since SCOPE is NULL here, this is an unqualified name.
3598 Access checking has been performed during name lookup
3599 already. Turn off checking to avoid duplicate errors. */
3600 push_deferring_access_checks (dk_no_check
);
3601 decl
= finish_non_static_data_member
3603 /*qualifying_scope=*/NULL_TREE
);
3604 pop_deferring_access_checks ();
3607 return id_expression
;
3610 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3612 error ("use of namespace %qD as expression", decl
);
3613 return error_mark_node
;
3615 else if (DECL_CLASS_TEMPLATE_P (decl
))
3617 error ("use of class template %qT as expression", decl
);
3618 return error_mark_node
;
3620 else if (TREE_CODE (decl
) == TREE_LIST
)
3622 /* Ambiguous reference to base members. */
3623 error ("request for member %qD is ambiguous in "
3624 "multiple inheritance lattice", id_expression
);
3625 print_candidates (decl
);
3626 return error_mark_node
;
3629 /* Mark variable-like entities as used. Functions are similarly
3630 marked either below or after overload resolution. */
3632 || TREE_CODE (decl
) == PARM_DECL
3633 || TREE_CODE (decl
) == CONST_DECL
3634 || TREE_CODE (decl
) == RESULT_DECL
)
3635 && !mark_used (decl
))
3636 return error_mark_node
;
3638 /* Only certain kinds of names are allowed in constant
3639 expression. Template parameters have already
3640 been handled above. */
3641 if (! error_operand_p (decl
)
3642 && integral_constant_expression_p
3643 && ! decl_constant_var_p (decl
)
3644 && TREE_CODE (decl
) != CONST_DECL
3645 && ! builtin_valid_in_constant_expr_p (decl
))
3647 if (!allow_non_integral_constant_expression_p
)
3649 error ("%qD cannot appear in a constant-expression", decl
);
3650 return error_mark_node
;
3652 *non_integral_constant_expression_p
= true;
3657 && !cp_unevaluated_operand
3658 && !processing_template_decl
3659 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3660 && CP_DECL_THREAD_LOCAL_P (decl
)
3661 && (wrap
= get_tls_wrapper_fn (decl
)))
3663 /* Replace an evaluated use of the thread_local variable with
3664 a call to its wrapper. */
3665 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3667 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3668 && variable_template_p (TREE_OPERAND (decl
, 0)))
3670 decl
= finish_template_variable (decl
);
3672 decl
= convert_from_reference (decl
);
3676 decl
= (adjust_result_of_qualified_name_lookup
3677 (decl
, scope
, current_nonlambda_class_type()));
3679 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3683 decl
= finish_qualified_id_expr (scope
,
3689 tf_warning_or_error
);
3691 decl
= convert_from_reference (decl
);
3693 else if (TREE_CODE (decl
) == FIELD_DECL
)
3695 /* Since SCOPE is NULL here, this is an unqualified name.
3696 Access checking has been performed during name lookup
3697 already. Turn off checking to avoid duplicate errors. */
3698 push_deferring_access_checks (dk_no_check
);
3699 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3700 /*qualifying_scope=*/NULL_TREE
);
3701 pop_deferring_access_checks ();
3703 else if (is_overloaded_fn (decl
))
3707 first_fn
= get_first_fn (decl
);
3708 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3709 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3711 if (!really_overloaded_fn (decl
)
3712 && !mark_used (first_fn
))
3713 return error_mark_node
;
3716 && TREE_CODE (first_fn
) == FUNCTION_DECL
3717 && DECL_FUNCTION_MEMBER_P (first_fn
)
3718 && !shared_member_p (decl
))
3720 /* A set of member functions. */
3721 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3722 return finish_class_member_access_expr (decl
, id_expression
,
3723 /*template_p=*/false,
3724 tf_warning_or_error
);
3727 decl
= baselink_for_fns (decl
);
3731 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3732 && DECL_CLASS_SCOPE_P (decl
))
3734 tree context
= context_for_name_lookup (decl
);
3735 if (context
!= current_class_type
)
3737 tree path
= currently_open_derived_class (context
);
3738 perform_or_defer_access_check (TYPE_BINFO (path
),
3740 tf_warning_or_error
);
3744 decl
= convert_from_reference (decl
);
3748 return cp_expr (decl
, location
);
3751 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3752 use as a type-specifier. */
3755 finish_typeof (tree expr
)
3759 if (type_dependent_expression_p (expr
))
3761 type
= cxx_make_type (TYPEOF_TYPE
);
3762 TYPEOF_TYPE_EXPR (type
) = expr
;
3763 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3768 expr
= mark_type_use (expr
);
3770 type
= unlowered_expr_type (expr
);
3772 if (!type
|| type
== unknown_type_node
)
3774 error ("type of %qE is unknown", expr
);
3775 return error_mark_node
;
3781 /* Implement the __underlying_type keyword: Return the underlying
3782 type of TYPE, suitable for use as a type-specifier. */
3785 finish_underlying_type (tree type
)
3787 tree underlying_type
;
3789 if (processing_template_decl
)
3791 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3792 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3793 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3795 return underlying_type
;
3798 complete_type (type
);
3800 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3802 error ("%qT is not an enumeration type", type
);
3803 return error_mark_node
;
3806 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3808 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3809 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3810 See finish_enum_value_list for details. */
3811 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3813 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3814 TYPE_UNSIGNED (underlying_type
));
3816 return underlying_type
;
3819 /* Implement the __direct_bases keyword: Return the direct base classes
3823 calculate_direct_bases (tree type
)
3825 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3826 tree bases_vec
= NULL_TREE
;
3827 vec
<tree
, va_gc
> *base_binfos
;
3831 complete_type (type
);
3833 if (!NON_UNION_CLASS_TYPE_P (type
))
3834 return make_tree_vec (0);
3836 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3838 /* Virtual bases are initialized first */
3839 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3841 if (BINFO_VIRTUAL_P (binfo
))
3843 vec_safe_push (vector
, binfo
);
3847 /* Now non-virtuals */
3848 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3850 if (!BINFO_VIRTUAL_P (binfo
))
3852 vec_safe_push (vector
, binfo
);
3857 bases_vec
= make_tree_vec (vector
->length ());
3859 for (i
= 0; i
< vector
->length (); ++i
)
3861 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3866 /* Implement the __bases keyword: Return the base classes
3869 /* Find morally non-virtual base classes by walking binfo hierarchy */
3870 /* Virtual base classes are handled separately in finish_bases */
3873 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3875 /* Don't walk bases of virtual bases */
3876 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3880 dfs_calculate_bases_post (tree binfo
, void *data_
)
3882 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3883 if (!BINFO_VIRTUAL_P (binfo
))
3885 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3890 /* Calculates the morally non-virtual base classes of a class */
3891 static vec
<tree
, va_gc
> *
3892 calculate_bases_helper (tree type
)
3894 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3896 /* Now add non-virtual base classes in order of construction */
3897 if (TYPE_BINFO (type
))
3898 dfs_walk_all (TYPE_BINFO (type
),
3899 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3904 calculate_bases (tree type
)
3906 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3907 tree bases_vec
= NULL_TREE
;
3909 vec
<tree
, va_gc
> *vbases
;
3910 vec
<tree
, va_gc
> *nonvbases
;
3913 complete_type (type
);
3915 if (!NON_UNION_CLASS_TYPE_P (type
))
3916 return make_tree_vec (0);
3918 /* First go through virtual base classes */
3919 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3920 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3922 vec
<tree
, va_gc
> *vbase_bases
;
3923 vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3924 vec_safe_splice (vector
, vbase_bases
);
3925 release_tree_vector (vbase_bases
);
3928 /* Now for the non-virtual bases */
3929 nonvbases
= calculate_bases_helper (type
);
3930 vec_safe_splice (vector
, nonvbases
);
3931 release_tree_vector (nonvbases
);
3933 /* Note that during error recovery vector->length can even be zero. */
3934 if (vector
->length () > 1)
3936 /* Last element is entire class, so don't copy */
3937 bases_vec
= make_tree_vec (vector
->length() - 1);
3939 for (i
= 0; i
< vector
->length () - 1; ++i
)
3940 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3943 bases_vec
= make_tree_vec (0);
3945 release_tree_vector (vector
);
3950 finish_bases (tree type
, bool direct
)
3952 tree bases
= NULL_TREE
;
3954 if (!processing_template_decl
)
3956 /* Parameter packs can only be used in templates */
3957 error ("Parameter pack __bases only valid in template declaration");
3958 return error_mark_node
;
3961 bases
= cxx_make_type (BASES
);
3962 BASES_TYPE (bases
) = type
;
3963 BASES_DIRECT (bases
) = direct
;
3964 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3969 /* Perform C++-specific checks for __builtin_offsetof before calling
3973 finish_offsetof (tree expr
, location_t loc
)
3975 /* If we're processing a template, we can't finish the semantics yet.
3976 Otherwise we can fold the entire expression now. */
3977 if (processing_template_decl
)
3979 expr
= build1 (OFFSETOF_EXPR
, size_type_node
, expr
);
3980 SET_EXPR_LOCATION (expr
, loc
);
3984 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3986 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3987 TREE_OPERAND (expr
, 2));
3988 return error_mark_node
;
3990 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3991 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3992 || TREE_TYPE (expr
) == unknown_type_node
)
3994 if (INDIRECT_REF_P (expr
))
3995 error ("second operand of %<offsetof%> is neither a single "
3996 "identifier nor a sequence of member accesses and "
3997 "array references");
4000 if (TREE_CODE (expr
) == COMPONENT_REF
4001 || TREE_CODE (expr
) == COMPOUND_EXPR
)
4002 expr
= TREE_OPERAND (expr
, 1);
4003 error ("cannot apply %<offsetof%> to member function %qD", expr
);
4005 return error_mark_node
;
4007 if (REFERENCE_REF_P (expr
))
4008 expr
= TREE_OPERAND (expr
, 0);
4009 if (TREE_CODE (expr
) == COMPONENT_REF
)
4011 tree object
= TREE_OPERAND (expr
, 0);
4012 if (!complete_type_or_else (TREE_TYPE (object
), object
))
4013 return error_mark_node
;
4014 if (warn_invalid_offsetof
4015 && CLASS_TYPE_P (TREE_TYPE (object
))
4016 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (object
))
4017 && cp_unevaluated_operand
== 0)
4018 pedwarn (loc
, OPT_Winvalid_offsetof
,
4019 "offsetof within non-standard-layout type %qT is undefined",
4020 TREE_TYPE (object
));
4022 return fold_offsetof (expr
);
4025 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
4026 function is broken out from the above for the benefit of the tree-ssa
4030 simplify_aggr_init_expr (tree
*tp
)
4032 tree aggr_init_expr
= *tp
;
4034 /* Form an appropriate CALL_EXPR. */
4035 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
4036 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
4037 tree type
= TREE_TYPE (slot
);
4040 enum style_t
{ ctor
, arg
, pcc
} style
;
4042 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
4044 #ifdef PCC_STATIC_STRUCT_RETURN
4050 gcc_assert (TREE_ADDRESSABLE (type
));
4054 call_expr
= build_call_array_loc (input_location
,
4055 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
4057 aggr_init_expr_nargs (aggr_init_expr
),
4058 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
4059 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
4060 CALL_EXPR_LIST_INIT_P (call_expr
) = CALL_EXPR_LIST_INIT_P (aggr_init_expr
);
4061 CALL_FROM_THUNK_P (call_expr
) = AGGR_INIT_FROM_THUNK_P (aggr_init_expr
);
4065 /* Replace the first argument to the ctor with the address of the
4067 cxx_mark_addressable (slot
);
4068 CALL_EXPR_ARG (call_expr
, 0) =
4069 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
4071 else if (style
== arg
)
4073 /* Just mark it addressable here, and leave the rest to
4074 expand_call{,_inline}. */
4075 cxx_mark_addressable (slot
);
4076 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
4077 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
4079 else if (style
== pcc
)
4081 /* If we're using the non-reentrant PCC calling convention, then we
4082 need to copy the returned value out of the static buffer into the
4084 push_deferring_access_checks (dk_no_check
);
4085 call_expr
= build_aggr_init (slot
, call_expr
,
4086 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
4087 tf_warning_or_error
);
4088 pop_deferring_access_checks ();
4089 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
4092 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
4094 tree init
= build_zero_init (type
, NULL_TREE
,
4095 /*static_storage_p=*/false);
4096 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4097 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4104 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4107 emit_associated_thunks (tree fn
)
4109 /* When we use vcall offsets, we emit thunks with the virtual
4110 functions to which they thunk. The whole point of vcall offsets
4111 is so that you can know statically the entire set of thunks that
4112 will ever be needed for a given virtual function, thereby
4113 enabling you to output all the thunks with the function itself. */
4114 if (DECL_VIRTUAL_P (fn
)
4115 /* Do not emit thunks for extern template instantiations. */
4116 && ! DECL_REALLY_EXTERN (fn
))
4120 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4122 if (!THUNK_ALIAS (thunk
))
4124 use_thunk (thunk
, /*emit_p=*/1);
4125 if (DECL_RESULT_THUNK_P (thunk
))
4129 for (probe
= DECL_THUNKS (thunk
);
4130 probe
; probe
= DECL_CHAIN (probe
))
4131 use_thunk (probe
, /*emit_p=*/1);
4135 gcc_assert (!DECL_THUNKS (thunk
));
4140 /* Generate RTL for FN. */
4143 expand_or_defer_fn_1 (tree fn
)
4145 /* When the parser calls us after finishing the body of a template
4146 function, we don't really want to expand the body. */
4147 if (processing_template_decl
)
4149 /* Normally, collection only occurs in rest_of_compilation. So,
4150 if we don't collect here, we never collect junk generated
4151 during the processing of templates until we hit a
4152 non-template function. It's not safe to do this inside a
4153 nested class, though, as the parser may have local state that
4154 is not a GC root. */
4155 if (!function_depth
)
4160 gcc_assert (DECL_SAVED_TREE (fn
));
4162 /* We make a decision about linkage for these functions at the end
4163 of the compilation. Until that point, we do not want the back
4164 end to output them -- but we do want it to see the bodies of
4165 these functions so that it can inline them as appropriate. */
4166 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4168 if (DECL_INTERFACE_KNOWN (fn
))
4169 /* We've already made a decision as to how this function will
4172 tentative_decl_linkage (fn
);
4174 import_export_decl (fn
);
4176 /* If the user wants us to keep all inline functions, then mark
4177 this function as needed so that finish_file will make sure to
4178 output it later. Similarly, all dllexport'd functions must
4179 be emitted; there may be callers in other DLLs. */
4180 if (DECL_DECLARED_INLINE_P (fn
)
4181 && !DECL_REALLY_EXTERN (fn
)
4182 && (flag_keep_inline_functions
4183 || (flag_keep_inline_dllexport
4184 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4187 DECL_EXTERNAL (fn
) = 0;
4191 /* If this is a constructor or destructor body, we have to clone
4193 if (maybe_clone_body (fn
))
4195 /* We don't want to process FN again, so pretend we've written
4196 it out, even though we haven't. */
4197 TREE_ASM_WRITTEN (fn
) = 1;
4198 /* If this is a constexpr function, keep DECL_SAVED_TREE. */
4199 if (!DECL_DECLARED_CONSTEXPR_P (fn
))
4200 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4204 /* There's no reason to do any of the work here if we're only doing
4205 semantic analysis; this code just generates RTL. */
4206 if (flag_syntax_only
)
4213 expand_or_defer_fn (tree fn
)
4215 if (expand_or_defer_fn_1 (fn
))
4219 /* Expand or defer, at the whim of the compilation unit manager. */
4220 cgraph_node::finalize_function (fn
, function_depth
> 1);
4221 emit_associated_thunks (fn
);
4229 nrv_data () : visited (37) {}
4233 hash_table
<nofree_ptr_hash
<tree_node
> > visited
;
4236 /* Helper function for walk_tree, used by finalize_nrv below. */
4239 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4241 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4244 /* No need to walk into types. There wouldn't be any need to walk into
4245 non-statements, except that we have to consider STMT_EXPRs. */
4248 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4249 but differs from using NULL_TREE in that it indicates that we care
4250 about the value of the RESULT_DECL. */
4251 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4252 TREE_OPERAND (*tp
, 0) = dp
->result
;
4253 /* Change all cleanups for the NRV to only run when an exception is
4255 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4256 && CLEANUP_DECL (*tp
) == dp
->var
)
4257 CLEANUP_EH_ONLY (*tp
) = 1;
4258 /* Replace the DECL_EXPR for the NRV with an initialization of the
4259 RESULT_DECL, if needed. */
4260 else if (TREE_CODE (*tp
) == DECL_EXPR
4261 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4264 if (DECL_INITIAL (dp
->var
)
4265 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4266 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4267 DECL_INITIAL (dp
->var
));
4269 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4270 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4271 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4274 /* And replace all uses of the NRV with the RESULT_DECL. */
4275 else if (*tp
== dp
->var
)
4278 /* Avoid walking into the same tree more than once. Unfortunately, we
4279 can't just use walk_tree_without duplicates because it would only call
4280 us for the first occurrence of dp->var in the function body. */
4281 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4287 /* Keep iterating. */
4291 /* Called from finish_function to implement the named return value
4292 optimization by overriding all the RETURN_EXPRs and pertinent
4293 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4294 RESULT_DECL for the function. */
4297 finalize_nrv (tree
*tp
, tree var
, tree result
)
4299 struct nrv_data data
;
4301 /* Copy name from VAR to RESULT. */
4302 DECL_NAME (result
) = DECL_NAME (var
);
4303 /* Don't forget that we take its address. */
4304 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4305 /* Finally set DECL_VALUE_EXPR to avoid assigning
4306 a stack slot at -O0 for the original var and debug info
4307 uses RESULT location for VAR. */
4308 SET_DECL_VALUE_EXPR (var
, result
);
4309 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4312 data
.result
= result
;
4313 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4316 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4319 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4320 bool need_copy_ctor
, bool need_copy_assignment
,
4323 int save_errorcount
= errorcount
;
4326 /* Always allocate 3 elements for simplicity. These are the
4327 function decls for the ctor, dtor, and assignment op.
4328 This layout is known to the three lang hooks,
4329 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4330 and cxx_omp_clause_assign_op. */
4331 info
= make_tree_vec (3);
4332 CP_OMP_CLAUSE_INFO (c
) = info
;
4334 if (need_default_ctor
|| need_copy_ctor
)
4336 if (need_default_ctor
)
4337 t
= get_default_ctor (type
);
4339 t
= get_copy_ctor (type
, tf_warning_or_error
);
4341 if (t
&& !trivial_fn_p (t
))
4342 TREE_VEC_ELT (info
, 0) = t
;
4345 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4346 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4348 if (need_copy_assignment
)
4350 t
= get_copy_assign (type
);
4352 if (t
&& !trivial_fn_p (t
))
4353 TREE_VEC_ELT (info
, 2) = t
;
4356 return errorcount
!= save_errorcount
;
4359 /* If DECL is DECL_OMP_PRIVATIZED_MEMBER, return corresponding
4360 FIELD_DECL, otherwise return DECL itself. */
4363 omp_clause_decl_field (tree decl
)
4366 && DECL_HAS_VALUE_EXPR_P (decl
)
4367 && DECL_ARTIFICIAL (decl
)
4368 && DECL_LANG_SPECIFIC (decl
)
4369 && DECL_OMP_PRIVATIZED_MEMBER (decl
))
4371 tree f
= DECL_VALUE_EXPR (decl
);
4372 if (TREE_CODE (f
) == INDIRECT_REF
)
4373 f
= TREE_OPERAND (f
, 0);
4374 if (TREE_CODE (f
) == COMPONENT_REF
)
4376 f
= TREE_OPERAND (f
, 1);
4377 gcc_assert (TREE_CODE (f
) == FIELD_DECL
);
4384 /* Adjust DECL if needed for printing using %qE. */
4387 omp_clause_printable_decl (tree decl
)
4389 tree t
= omp_clause_decl_field (decl
);
4395 /* For a FIELD_DECL F and corresponding DECL_OMP_PRIVATIZED_MEMBER
4396 VAR_DECL T that doesn't need a DECL_EXPR added, record it for
4400 omp_note_field_privatization (tree f
, tree t
)
4402 if (!omp_private_member_map
)
4403 omp_private_member_map
= new hash_map
<tree
, tree
>;
4404 tree
&v
= omp_private_member_map
->get_or_insert (f
);
4408 omp_private_member_vec
.safe_push (f
);
4409 /* Signal that we don't want to create DECL_EXPR for this dummy var. */
4410 omp_private_member_vec
.safe_push (integer_zero_node
);
4414 /* Privatize FIELD_DECL T, return corresponding DECL_OMP_PRIVATIZED_MEMBER
4418 omp_privatize_field (tree t
, bool shared
)
4420 tree m
= finish_non_static_data_member (t
, NULL_TREE
, NULL_TREE
);
4421 if (m
== error_mark_node
)
4422 return error_mark_node
;
4423 if (!omp_private_member_map
&& !shared
)
4424 omp_private_member_map
= new hash_map
<tree
, tree
>;
4425 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4427 gcc_assert (TREE_CODE (m
) == INDIRECT_REF
);
4428 m
= TREE_OPERAND (m
, 0);
4430 tree vb
= NULL_TREE
;
4431 tree
&v
= shared
? vb
: omp_private_member_map
->get_or_insert (t
);
4434 v
= create_temporary_var (TREE_TYPE (m
));
4435 if (!DECL_LANG_SPECIFIC (v
))
4436 retrofit_lang_decl (v
);
4437 DECL_OMP_PRIVATIZED_MEMBER (v
) = 1;
4438 SET_DECL_VALUE_EXPR (v
, m
);
4439 DECL_HAS_VALUE_EXPR_P (v
) = 1;
4441 omp_private_member_vec
.safe_push (t
);
4446 /* Helper function for handle_omp_array_sections. Called recursively
4447 to handle multiple array-section-subscripts. C is the clause,
4448 T current expression (initially OMP_CLAUSE_DECL), which is either
4449 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4450 expression if specified, TREE_VALUE length expression if specified,
4451 TREE_CHAIN is what it has been specified after, or some decl.
4452 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4453 set to true if any of the array-section-subscript could have length
4454 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4455 first array-section-subscript which is known not to have length
4457 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4458 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4459 all are or may have length of 1, array-section-subscript [:2] is the
4460 first one known not to have length 1. For array-section-subscript
4461 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4462 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4463 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4464 case though, as some lengths could be zero. */
4467 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4468 bool &maybe_zero_len
, unsigned int &first_non_one
,
4469 enum c_omp_region_type ort
)
4471 tree ret
, low_bound
, length
, type
;
4472 if (TREE_CODE (t
) != TREE_LIST
)
4474 if (error_operand_p (t
))
4475 return error_mark_node
;
4476 if (REFERENCE_REF_P (t
)
4477 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
4478 t
= TREE_OPERAND (t
, 0);
4480 if (TREE_CODE (t
) == COMPONENT_REF
4482 && (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
4483 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO
4484 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FROM
)
4485 && !type_dependent_expression_p (t
))
4487 if (DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
4489 error_at (OMP_CLAUSE_LOCATION (c
),
4490 "bit-field %qE in %qs clause",
4491 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4492 return error_mark_node
;
4494 while (TREE_CODE (t
) == COMPONENT_REF
)
4496 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == UNION_TYPE
)
4498 error_at (OMP_CLAUSE_LOCATION (c
),
4499 "%qE is a member of a union", t
);
4500 return error_mark_node
;
4502 t
= TREE_OPERAND (t
, 0);
4505 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
4507 if (processing_template_decl
)
4510 error_at (OMP_CLAUSE_LOCATION (c
),
4511 "%qD is not a variable in %qs clause", t
,
4512 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4514 error_at (OMP_CLAUSE_LOCATION (c
),
4515 "%qE is not a variable in %qs clause", t
,
4516 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4517 return error_mark_node
;
4519 else if (TREE_CODE (t
) == PARM_DECL
4520 && DECL_ARTIFICIAL (t
)
4521 && DECL_NAME (t
) == this_identifier
)
4523 error_at (OMP_CLAUSE_LOCATION (c
),
4524 "%<this%> allowed in OpenMP only in %<declare simd%>"
4526 return error_mark_node
;
4528 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4529 && VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
4531 error_at (OMP_CLAUSE_LOCATION (c
),
4532 "%qD is threadprivate variable in %qs clause", t
,
4533 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4534 return error_mark_node
;
4536 if (type_dependent_expression_p (ret
))
4538 ret
= convert_from_reference (ret
);
4542 if (ort
== C_ORT_OMP
4543 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4544 && TREE_CODE (TREE_CHAIN (t
)) == FIELD_DECL
)
4545 TREE_CHAIN (t
) = omp_privatize_field (TREE_CHAIN (t
), false);
4546 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4547 maybe_zero_len
, first_non_one
, ort
);
4548 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4551 type
= TREE_TYPE (ret
);
4552 low_bound
= TREE_PURPOSE (t
);
4553 length
= TREE_VALUE (t
);
4554 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4555 || (length
&& type_dependent_expression_p (length
)))
4558 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4559 return error_mark_node
;
4561 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4563 error_at (OMP_CLAUSE_LOCATION (c
),
4564 "low bound %qE of array section does not have integral type",
4566 return error_mark_node
;
4568 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4570 error_at (OMP_CLAUSE_LOCATION (c
),
4571 "length %qE of array section does not have integral type",
4573 return error_mark_node
;
4576 low_bound
= mark_rvalue_use (low_bound
);
4578 length
= mark_rvalue_use (length
);
4579 /* We need to reduce to real constant-values for checks below. */
4581 length
= fold_simple (length
);
4583 low_bound
= fold_simple (low_bound
);
4585 && TREE_CODE (low_bound
) == INTEGER_CST
4586 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4587 > TYPE_PRECISION (sizetype
))
4588 low_bound
= fold_convert (sizetype
, low_bound
);
4590 && TREE_CODE (length
) == INTEGER_CST
4591 && TYPE_PRECISION (TREE_TYPE (length
))
4592 > TYPE_PRECISION (sizetype
))
4593 length
= fold_convert (sizetype
, length
);
4594 if (low_bound
== NULL_TREE
)
4595 low_bound
= integer_zero_node
;
4597 if (length
!= NULL_TREE
)
4599 if (!integer_nonzerop (length
))
4601 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4602 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4604 if (integer_zerop (length
))
4606 error_at (OMP_CLAUSE_LOCATION (c
),
4607 "zero length array section in %qs clause",
4608 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4609 return error_mark_node
;
4613 maybe_zero_len
= true;
4615 if (first_non_one
== types
.length ()
4616 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4619 if (TREE_CODE (type
) == ARRAY_TYPE
)
4621 if (length
== NULL_TREE
4622 && (TYPE_DOMAIN (type
) == NULL_TREE
4623 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4625 error_at (OMP_CLAUSE_LOCATION (c
),
4626 "for unknown bound array type length expression must "
4628 return error_mark_node
;
4630 if (TREE_CODE (low_bound
) == INTEGER_CST
4631 && tree_int_cst_sgn (low_bound
) == -1)
4633 error_at (OMP_CLAUSE_LOCATION (c
),
4634 "negative low bound in array section in %qs clause",
4635 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4636 return error_mark_node
;
4638 if (length
!= NULL_TREE
4639 && TREE_CODE (length
) == INTEGER_CST
4640 && tree_int_cst_sgn (length
) == -1)
4642 error_at (OMP_CLAUSE_LOCATION (c
),
4643 "negative length in array section in %qs clause",
4644 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4645 return error_mark_node
;
4647 if (TYPE_DOMAIN (type
)
4648 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4649 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4652 tree size
= size_binop (PLUS_EXPR
,
4653 TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4655 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4657 if (tree_int_cst_lt (size
, low_bound
))
4659 error_at (OMP_CLAUSE_LOCATION (c
),
4660 "low bound %qE above array section size "
4661 "in %qs clause", low_bound
,
4662 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4663 return error_mark_node
;
4665 if (tree_int_cst_equal (size
, low_bound
))
4667 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
4668 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4670 error_at (OMP_CLAUSE_LOCATION (c
),
4671 "zero length array section in %qs clause",
4672 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4673 return error_mark_node
;
4675 maybe_zero_len
= true;
4677 else if (length
== NULL_TREE
4678 && first_non_one
== types
.length ()
4679 && tree_int_cst_equal
4680 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4684 else if (length
== NULL_TREE
)
4686 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4687 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4688 maybe_zero_len
= true;
4689 if (first_non_one
== types
.length ())
4692 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4694 if (tree_int_cst_lt (size
, length
))
4696 error_at (OMP_CLAUSE_LOCATION (c
),
4697 "length %qE above array section size "
4698 "in %qs clause", length
,
4699 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4700 return error_mark_node
;
4702 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4705 = size_binop (PLUS_EXPR
,
4706 fold_convert (sizetype
, low_bound
),
4707 fold_convert (sizetype
, length
));
4708 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4709 && tree_int_cst_lt (size
, lbpluslen
))
4711 error_at (OMP_CLAUSE_LOCATION (c
),
4712 "high bound %qE above array section size "
4713 "in %qs clause", lbpluslen
,
4714 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4715 return error_mark_node
;
4720 else if (length
== NULL_TREE
)
4722 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4723 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_REDUCTION
)
4724 maybe_zero_len
= true;
4725 if (first_non_one
== types
.length ())
4729 /* For [lb:] we will need to evaluate lb more than once. */
4730 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4732 tree lb
= cp_save_expr (low_bound
);
4733 if (lb
!= low_bound
)
4735 TREE_PURPOSE (t
) = lb
;
4740 else if (TREE_CODE (type
) == POINTER_TYPE
)
4742 if (length
== NULL_TREE
)
4744 error_at (OMP_CLAUSE_LOCATION (c
),
4745 "for pointer type length expression must be specified");
4746 return error_mark_node
;
4748 if (length
!= NULL_TREE
4749 && TREE_CODE (length
) == INTEGER_CST
4750 && tree_int_cst_sgn (length
) == -1)
4752 error_at (OMP_CLAUSE_LOCATION (c
),
4753 "negative length in array section in %qs clause",
4754 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4755 return error_mark_node
;
4757 /* If there is a pointer type anywhere but in the very first
4758 array-section-subscript, the array section can't be contiguous. */
4759 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4760 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4762 error_at (OMP_CLAUSE_LOCATION (c
),
4763 "array section is not contiguous in %qs clause",
4764 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4765 return error_mark_node
;
4770 error_at (OMP_CLAUSE_LOCATION (c
),
4771 "%qE does not have pointer or array type", ret
);
4772 return error_mark_node
;
4774 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4775 types
.safe_push (TREE_TYPE (ret
));
4776 /* We will need to evaluate lb more than once. */
4777 tree lb
= cp_save_expr (low_bound
);
4778 if (lb
!= low_bound
)
4780 TREE_PURPOSE (t
) = lb
;
4783 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4787 /* Handle array sections for clause C. */
4790 handle_omp_array_sections (tree c
, enum c_omp_region_type ort
)
4792 bool maybe_zero_len
= false;
4793 unsigned int first_non_one
= 0;
4794 auto_vec
<tree
, 10> types
;
4795 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4796 maybe_zero_len
, first_non_one
,
4798 if (first
== error_mark_node
)
4800 if (first
== NULL_TREE
)
4802 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4804 tree t
= OMP_CLAUSE_DECL (c
);
4805 tree tem
= NULL_TREE
;
4806 if (processing_template_decl
)
4808 /* Need to evaluate side effects in the length expressions
4810 while (TREE_CODE (t
) == TREE_LIST
)
4812 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4814 if (tem
== NULL_TREE
)
4815 tem
= TREE_VALUE (t
);
4817 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4818 TREE_VALUE (t
), tem
);
4823 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4824 OMP_CLAUSE_DECL (c
) = first
;
4828 unsigned int num
= types
.length (), i
;
4829 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4830 tree condition
= NULL_TREE
;
4832 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4833 maybe_zero_len
= true;
4834 if (processing_template_decl
&& maybe_zero_len
)
4837 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4840 tree low_bound
= TREE_PURPOSE (t
);
4841 tree length
= TREE_VALUE (t
);
4845 && TREE_CODE (low_bound
) == INTEGER_CST
4846 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4847 > TYPE_PRECISION (sizetype
))
4848 low_bound
= fold_convert (sizetype
, low_bound
);
4850 && TREE_CODE (length
) == INTEGER_CST
4851 && TYPE_PRECISION (TREE_TYPE (length
))
4852 > TYPE_PRECISION (sizetype
))
4853 length
= fold_convert (sizetype
, length
);
4854 if (low_bound
== NULL_TREE
)
4855 low_bound
= integer_zero_node
;
4856 if (!maybe_zero_len
&& i
> first_non_one
)
4858 if (integer_nonzerop (low_bound
))
4859 goto do_warn_noncontiguous
;
4860 if (length
!= NULL_TREE
4861 && TREE_CODE (length
) == INTEGER_CST
4862 && TYPE_DOMAIN (types
[i
])
4863 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4864 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4868 size
= size_binop (PLUS_EXPR
,
4869 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4871 if (!tree_int_cst_equal (length
, size
))
4873 do_warn_noncontiguous
:
4874 error_at (OMP_CLAUSE_LOCATION (c
),
4875 "array section is not contiguous in %qs "
4877 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4881 if (!processing_template_decl
4882 && length
!= NULL_TREE
4883 && TREE_SIDE_EFFECTS (length
))
4885 if (side_effects
== NULL_TREE
)
4886 side_effects
= length
;
4888 side_effects
= build2 (COMPOUND_EXPR
,
4889 TREE_TYPE (side_effects
),
4890 length
, side_effects
);
4893 else if (processing_template_decl
)
4899 if (i
> first_non_one
4900 && ((length
&& integer_nonzerop (length
))
4901 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
))
4904 l
= fold_convert (sizetype
, length
);
4907 l
= size_binop (PLUS_EXPR
,
4908 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4910 l
= size_binop (MINUS_EXPR
, l
,
4911 fold_convert (sizetype
, low_bound
));
4913 if (i
> first_non_one
)
4915 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4917 if (condition
== NULL_TREE
)
4920 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4923 else if (size
== NULL_TREE
)
4925 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4926 tree eltype
= TREE_TYPE (types
[num
- 1]);
4927 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4928 eltype
= TREE_TYPE (eltype
);
4929 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4930 size
= size_binop (EXACT_DIV_EXPR
, size
,
4931 size_in_bytes (eltype
));
4932 size
= size_binop (MULT_EXPR
, size
, l
);
4934 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4935 size
, size_zero_node
);
4938 size
= size_binop (MULT_EXPR
, size
, l
);
4941 if (!processing_template_decl
)
4944 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
4945 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
4947 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
4948 tree index_type
= build_index_type (size
);
4949 tree eltype
= TREE_TYPE (first
);
4950 while (TREE_CODE (eltype
) == ARRAY_TYPE
)
4951 eltype
= TREE_TYPE (eltype
);
4952 tree type
= build_array_type (eltype
, index_type
);
4953 tree ptype
= build_pointer_type (eltype
);
4954 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4955 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
))))
4956 t
= convert_from_reference (t
);
4957 else if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
4958 t
= build_fold_addr_expr (t
);
4959 tree t2
= build_fold_addr_expr (first
);
4960 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4961 ptrdiff_type_node
, t2
);
4962 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
4963 ptrdiff_type_node
, t2
,
4964 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4965 ptrdiff_type_node
, t
));
4966 if (tree_fits_shwi_p (t2
))
4967 t
= build2 (MEM_REF
, type
, t
,
4968 build_int_cst (ptype
, tree_to_shwi (t2
)));
4971 t2
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4973 t
= build2_loc (OMP_CLAUSE_LOCATION (c
), POINTER_PLUS_EXPR
,
4974 TREE_TYPE (t
), t
, t2
);
4975 t
= build2 (MEM_REF
, type
, t
, build_int_cst (ptype
, 0));
4977 OMP_CLAUSE_DECL (c
) = t
;
4980 OMP_CLAUSE_DECL (c
) = first
;
4981 OMP_CLAUSE_SIZE (c
) = size
;
4982 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
4983 || (TREE_CODE (t
) == COMPONENT_REF
4984 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
))
4986 if (ort
== C_ORT_OMP
|| ort
== C_ORT_ACC
)
4987 switch (OMP_CLAUSE_MAP_KIND (c
))
4989 case GOMP_MAP_ALLOC
:
4992 case GOMP_MAP_TOFROM
:
4993 case GOMP_MAP_ALWAYS_TO
:
4994 case GOMP_MAP_ALWAYS_FROM
:
4995 case GOMP_MAP_ALWAYS_TOFROM
:
4996 case GOMP_MAP_RELEASE
:
4997 case GOMP_MAP_DELETE
:
4998 OMP_CLAUSE_MAP_MAYBE_ZERO_LENGTH_ARRAY_SECTION (c
) = 1;
5003 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5005 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
&& ort
!= C_ORT_ACC
)
5006 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
5007 else if (TREE_CODE (t
) == COMPONENT_REF
)
5008 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5009 else if (REFERENCE_REF_P (t
)
5010 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
5012 t
= TREE_OPERAND (t
, 0);
5013 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
5016 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_FIRSTPRIVATE_POINTER
);
5017 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5018 && !cxx_mark_addressable (t
))
5020 OMP_CLAUSE_DECL (c2
) = t
;
5021 t
= build_fold_addr_expr (first
);
5022 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5023 ptrdiff_type_node
, t
);
5024 tree ptr
= OMP_CLAUSE_DECL (c2
);
5025 ptr
= convert_from_reference (ptr
);
5026 if (!POINTER_TYPE_P (TREE_TYPE (ptr
)))
5027 ptr
= build_fold_addr_expr (ptr
);
5028 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
5029 ptrdiff_type_node
, t
,
5030 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
5031 ptrdiff_type_node
, ptr
));
5032 OMP_CLAUSE_SIZE (c2
) = t
;
5033 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
5034 OMP_CLAUSE_CHAIN (c
) = c2
;
5035 ptr
= OMP_CLAUSE_DECL (c2
);
5036 if (OMP_CLAUSE_MAP_KIND (c2
) != GOMP_MAP_FIRSTPRIVATE_POINTER
5037 && TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
5038 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
5040 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
5042 OMP_CLAUSE_SET_MAP_KIND (c3
, OMP_CLAUSE_MAP_KIND (c2
));
5043 OMP_CLAUSE_DECL (c3
) = ptr
;
5044 if (OMP_CLAUSE_MAP_KIND (c2
) == GOMP_MAP_ALWAYS_POINTER
)
5045 OMP_CLAUSE_DECL (c2
) = build_simple_mem_ref (ptr
);
5047 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
5048 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
5049 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
5050 OMP_CLAUSE_CHAIN (c2
) = c3
;
5057 /* Return identifier to look up for omp declare reduction. */
5060 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
5062 const char *p
= NULL
;
5063 const char *m
= NULL
;
5064 switch (reduction_code
)
5072 case TRUTH_ANDIF_EXPR
:
5073 case TRUTH_ORIF_EXPR
:
5074 reduction_id
= ansi_opname (reduction_code
);
5088 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
5089 return error_mark_node
;
5090 p
= IDENTIFIER_POINTER (reduction_id
);
5093 if (type
!= NULL_TREE
)
5094 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
5096 const char prefix
[] = "omp declare reduction ";
5097 size_t lenp
= sizeof (prefix
);
5098 if (strncmp (p
, prefix
, lenp
- 1) == 0)
5100 size_t len
= strlen (p
);
5101 size_t lenm
= m
? strlen (m
) + 1 : 0;
5102 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
5104 memcpy (name
, prefix
, lenp
- 1);
5105 memcpy (name
+ lenp
- 1, p
, len
+ 1);
5108 name
[lenp
+ len
- 1] = '~';
5109 memcpy (name
+ lenp
+ len
, m
, lenm
);
5111 return get_identifier (name
);
5114 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
5115 FUNCTION_DECL or NULL_TREE if not found. */
5118 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
5119 vec
<tree
> *ambiguousp
)
5122 tree baselink
= NULL_TREE
;
5123 if (identifier_p (id
))
5126 bool nonint_cst_expression_p
;
5127 const char *error_msg
;
5128 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
5129 tree decl
= lookup_name (id
);
5130 if (decl
== NULL_TREE
)
5131 decl
= error_mark_node
;
5132 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
5133 &nonint_cst_expression_p
, false, true, false,
5134 false, &error_msg
, loc
);
5135 if (idk
== CP_ID_KIND_UNQUALIFIED
5136 && identifier_p (id
))
5138 vec
<tree
, va_gc
> *args
= NULL
;
5139 vec_safe_push (args
, build_reference_type (type
));
5140 id
= perform_koenig_lookup (id
, args
, tf_none
);
5143 else if (TREE_CODE (id
) == SCOPE_REF
)
5144 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
5145 omp_reduction_id (ERROR_MARK
,
5146 TREE_OPERAND (id
, 1),
5150 if (id
&& is_overloaded_fn (id
))
5152 for (; id
; id
= OVL_NEXT (id
))
5154 tree fndecl
= OVL_CURRENT (id
);
5155 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
5157 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
5158 if (same_type_p (TREE_TYPE (argtype
), type
))
5162 if (id
&& BASELINK_P (fns
))
5169 if (id
== NULL_TREE
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
5171 vec
<tree
> ambiguous
= vNULL
;
5172 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
5174 if (ambiguousp
== NULL
)
5175 ambiguousp
= &ambiguous
;
5176 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
5178 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
5179 baselinkp
? baselinkp
: &baselink
,
5181 if (id
== NULL_TREE
)
5183 if (!ambiguousp
->is_empty ())
5184 ambiguousp
->safe_push (id
);
5185 else if (ret
!= NULL_TREE
)
5187 ambiguousp
->safe_push (ret
);
5188 ambiguousp
->safe_push (id
);
5194 if (ambiguousp
!= &ambiguous
)
5196 if (!ambiguous
.is_empty ())
5198 const char *str
= _("candidates are:");
5201 error_at (loc
, "user defined reduction lookup is ambiguous");
5202 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
5204 inform (DECL_SOURCE_LOCATION (udr
), "%s %#D", str
, udr
);
5206 str
= get_spaces (str
);
5208 ambiguous
.release ();
5209 ret
= error_mark_node
;
5210 baselink
= NULL_TREE
;
5215 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
5216 id
, id
, tf_warning_or_error
);
5220 /* Helper function for cp_parser_omp_declare_reduction_exprs
5222 Remove CLEANUP_STMT for data (omp_priv variable).
5223 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
5227 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
5231 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
5232 *tp
= CLEANUP_BODY (*tp
);
5233 else if (TREE_CODE (*tp
) == DECL_EXPR
)
5235 tree decl
= DECL_EXPR_DECL (*tp
);
5236 if (!processing_template_decl
5237 && decl
== (tree
) data
5238 && DECL_INITIAL (decl
)
5239 && DECL_INITIAL (decl
) != error_mark_node
)
5241 tree list
= NULL_TREE
;
5242 append_to_statement_list_force (*tp
, &list
);
5243 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
5244 decl
, DECL_INITIAL (decl
));
5245 DECL_INITIAL (decl
) = NULL_TREE
;
5246 append_to_statement_list_force (init_expr
, &list
);
5253 /* Data passed from cp_check_omp_declare_reduction to
5254 cp_check_omp_declare_reduction_r. */
5256 struct cp_check_omp_declare_reduction_data
5263 /* Helper function for cp_check_omp_declare_reduction, called via
5267 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
5269 struct cp_check_omp_declare_reduction_data
*udr_data
5270 = (struct cp_check_omp_declare_reduction_data
*) data
;
5272 && !DECL_ARTIFICIAL (*tp
)
5273 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
5274 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
5276 location_t loc
= udr_data
->loc
;
5277 if (udr_data
->combiner_p
)
5278 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
5279 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
5282 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
5283 "to variable %qD which is not %<omp_priv%> nor "
5291 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
5294 cp_check_omp_declare_reduction (tree udr
)
5296 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
5297 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
5298 type
= TREE_TYPE (type
);
5300 location_t loc
= DECL_SOURCE_LOCATION (udr
);
5302 if (type
== error_mark_node
)
5304 if (ARITHMETIC_TYPE_P (type
))
5306 static enum tree_code predef_codes
[]
5307 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
5308 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
5309 for (i
= 0; i
< 8; i
++)
5311 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
5312 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5313 const char *n2
= IDENTIFIER_POINTER (id
);
5314 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
5315 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
5316 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
5321 && TREE_CODE (type
) != COMPLEX_EXPR
)
5323 const char prefix_minmax
[] = "omp declare reduction m";
5324 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
5325 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
5326 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
5327 prefix_minmax
, prefix_size
) == 0
5328 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
5329 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
5330 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
5335 error_at (loc
, "predeclared arithmetic type %qT in "
5336 "%<#pragma omp declare reduction%>", type
);
5340 else if (TREE_CODE (type
) == FUNCTION_TYPE
5341 || TREE_CODE (type
) == METHOD_TYPE
5342 || TREE_CODE (type
) == ARRAY_TYPE
)
5344 error_at (loc
, "function or array type %qT in "
5345 "%<#pragma omp declare reduction%>", type
);
5348 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5350 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5354 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5356 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5357 "%<#pragma omp declare reduction%>", type
);
5361 tree body
= DECL_SAVED_TREE (udr
);
5362 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5365 tree_stmt_iterator tsi
;
5366 struct cp_check_omp_declare_reduction_data data
;
5367 memset (data
.stmts
, 0, sizeof data
.stmts
);
5368 for (i
= 0, tsi
= tsi_start (body
);
5369 i
< 7 && !tsi_end_p (tsi
);
5370 i
++, tsi_next (&tsi
))
5371 data
.stmts
[i
] = tsi_stmt (tsi
);
5373 gcc_assert (tsi_end_p (tsi
));
5376 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5377 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5378 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5380 data
.combiner_p
= true;
5381 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5383 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5387 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5388 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5389 data
.combiner_p
= false;
5390 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5392 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5393 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5394 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5396 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5400 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5401 an inline call. But, remap
5402 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5403 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5406 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5407 tree decl
, tree placeholder
)
5410 hash_map
<tree
, tree
> decl_map
;
5412 decl_map
.put (omp_decl1
, placeholder
);
5413 decl_map
.put (omp_decl2
, decl
);
5414 memset (&id
, 0, sizeof (id
));
5415 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5416 id
.dst_fn
= current_function_decl
;
5417 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5418 id
.decl_map
= &decl_map
;
5420 id
.copy_decl
= copy_decl_no_change
;
5421 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5422 id
.transform_new_cfg
= true;
5423 id
.transform_return_to_modify
= false;
5424 id
.transform_lang_insert_block
= NULL
;
5426 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5430 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5431 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5434 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5436 if (*tp
== (tree
) data
)
5441 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5442 Return true if there is some error and the clause should be removed. */
5445 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5447 tree t
= OMP_CLAUSE_DECL (c
);
5448 bool predefined
= false;
5449 if (TREE_CODE (t
) == TREE_LIST
)
5451 gcc_assert (processing_template_decl
);
5454 tree type
= TREE_TYPE (t
);
5455 if (TREE_CODE (t
) == MEM_REF
)
5456 type
= TREE_TYPE (type
);
5457 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5458 type
= TREE_TYPE (type
);
5459 if (TREE_CODE (type
) == ARRAY_TYPE
)
5462 gcc_assert (TREE_CODE (t
) != MEM_REF
);
5463 while (TREE_CODE (type
) == ARRAY_TYPE
)
5464 type
= TREE_TYPE (type
);
5465 if (!processing_template_decl
)
5467 t
= require_complete_type (t
);
5468 if (t
== error_mark_node
)
5470 tree size
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (oatype
),
5471 TYPE_SIZE_UNIT (type
));
5472 if (integer_zerop (size
))
5474 error ("%qE in %<reduction%> clause is a zero size array",
5475 omp_clause_printable_decl (t
));
5478 size
= size_binop (MINUS_EXPR
, size
, size_one_node
);
5479 tree index_type
= build_index_type (size
);
5480 tree atype
= build_array_type (type
, index_type
);
5481 tree ptype
= build_pointer_type (type
);
5482 if (TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
5483 t
= build_fold_addr_expr (t
);
5484 t
= build2 (MEM_REF
, atype
, t
, build_int_cst (ptype
, 0));
5485 OMP_CLAUSE_DECL (c
) = t
;
5488 if (type
== error_mark_node
)
5490 else if (ARITHMETIC_TYPE_P (type
))
5491 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5500 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5507 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5511 case TRUTH_ANDIF_EXPR
:
5512 case TRUTH_ORIF_EXPR
:
5513 if (FLOAT_TYPE_P (type
))
5520 else if (TYPE_READONLY (type
))
5522 error ("%qE has const type for %<reduction%>",
5523 omp_clause_printable_decl (t
));
5526 else if (!processing_template_decl
)
5528 t
= require_complete_type (t
);
5529 if (t
== error_mark_node
)
5531 OMP_CLAUSE_DECL (c
) = t
;
5536 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5539 else if (processing_template_decl
)
5542 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5544 type
= TYPE_MAIN_VARIANT (type
);
5545 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5546 if (id
== NULL_TREE
)
5547 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5548 NULL_TREE
, NULL_TREE
);
5549 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5552 if (id
== error_mark_node
)
5554 id
= OVL_CURRENT (id
);
5556 tree body
= DECL_SAVED_TREE (id
);
5559 if (TREE_CODE (body
) == STATEMENT_LIST
)
5561 tree_stmt_iterator tsi
;
5562 tree placeholder
= NULL_TREE
, decl_placeholder
= NULL_TREE
;
5565 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5566 atype
= TREE_TYPE (atype
);
5567 bool need_static_cast
= !same_type_p (type
, atype
);
5568 memset (stmts
, 0, sizeof stmts
);
5569 for (i
= 0, tsi
= tsi_start (body
);
5570 i
< 7 && !tsi_end_p (tsi
);
5571 i
++, tsi_next (&tsi
))
5572 stmts
[i
] = tsi_stmt (tsi
);
5573 gcc_assert (tsi_end_p (tsi
));
5577 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5578 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5579 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5580 DECL_ARTIFICIAL (placeholder
) = 1;
5581 DECL_IGNORED_P (placeholder
) = 1;
5582 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5583 if (TREE_CODE (t
) == MEM_REF
)
5585 decl_placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
,
5587 DECL_ARTIFICIAL (decl_placeholder
) = 1;
5588 DECL_IGNORED_P (decl_placeholder
) = 1;
5589 OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (c
) = decl_placeholder
;
5591 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5592 cxx_mark_addressable (placeholder
);
5593 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5594 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
)))
5596 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5597 : OMP_CLAUSE_DECL (c
));
5598 tree omp_out
= placeholder
;
5599 tree omp_in
= decl_placeholder
? decl_placeholder
5600 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5601 if (need_static_cast
)
5603 tree rtype
= build_reference_type (atype
);
5604 omp_out
= build_static_cast (rtype
, omp_out
,
5605 tf_warning_or_error
);
5606 omp_in
= build_static_cast (rtype
, omp_in
,
5607 tf_warning_or_error
);
5608 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5610 omp_out
= convert_from_reference (omp_out
);
5611 omp_in
= convert_from_reference (omp_in
);
5613 OMP_CLAUSE_REDUCTION_MERGE (c
)
5614 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5615 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5619 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5620 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5621 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5622 cxx_mark_addressable (decl_placeholder
? decl_placeholder
5623 : OMP_CLAUSE_DECL (c
));
5624 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5625 cxx_mark_addressable (placeholder
);
5626 tree omp_priv
= decl_placeholder
? decl_placeholder
5627 : convert_from_reference (OMP_CLAUSE_DECL (c
));
5628 tree omp_orig
= placeholder
;
5629 if (need_static_cast
)
5633 error_at (OMP_CLAUSE_LOCATION (c
),
5634 "user defined reduction with constructor "
5635 "initializer for base class %qT", atype
);
5638 tree rtype
= build_reference_type (atype
);
5639 omp_priv
= build_static_cast (rtype
, omp_priv
,
5640 tf_warning_or_error
);
5641 omp_orig
= build_static_cast (rtype
, omp_orig
,
5642 tf_warning_or_error
);
5643 if (omp_priv
== error_mark_node
5644 || omp_orig
== error_mark_node
)
5646 omp_priv
= convert_from_reference (omp_priv
);
5647 omp_orig
= convert_from_reference (omp_orig
);
5650 *need_default_ctor
= true;
5651 OMP_CLAUSE_REDUCTION_INIT (c
)
5652 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5653 DECL_EXPR_DECL (stmts
[3]),
5654 omp_priv
, omp_orig
);
5655 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5656 find_omp_placeholder_r
, placeholder
, NULL
))
5657 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5661 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5662 *need_default_ctor
= true;
5666 tree v
= decl_placeholder
? decl_placeholder
5667 : convert_from_reference (t
);
5668 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5669 init
= build_constructor (TREE_TYPE (v
), NULL
);
5671 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5672 OMP_CLAUSE_REDUCTION_INIT (c
)
5673 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5678 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5682 error ("user defined reduction not found for %qE",
5683 omp_clause_printable_decl (t
));
5686 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == MEM_REF
)
5687 gcc_assert (TYPE_SIZE_UNIT (type
)
5688 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
5692 /* Called from finish_struct_1. linear(this) or linear(this:step)
5693 clauses might not be finalized yet because the class has been incomplete
5694 when parsing #pragma omp declare simd methods. Fix those up now. */
5697 finish_omp_declare_simd_methods (tree t
)
5699 if (processing_template_decl
)
5702 for (tree x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
5704 if (TREE_CODE (TREE_TYPE (x
)) != METHOD_TYPE
)
5706 tree ods
= lookup_attribute ("omp declare simd", DECL_ATTRIBUTES (x
));
5707 if (!ods
|| !TREE_VALUE (ods
))
5709 for (tree c
= TREE_VALUE (TREE_VALUE (ods
)); c
; c
= OMP_CLAUSE_CHAIN (c
))
5710 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LINEAR
5711 && integer_zerop (OMP_CLAUSE_DECL (c
))
5712 && OMP_CLAUSE_LINEAR_STEP (c
)
5713 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_LINEAR_STEP (c
)))
5716 tree s
= OMP_CLAUSE_LINEAR_STEP (c
);
5717 s
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
), sizetype
, s
);
5718 s
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MULT_EXPR
,
5719 sizetype
, s
, TYPE_SIZE_UNIT (t
));
5720 OMP_CLAUSE_LINEAR_STEP (c
) = s
;
5725 /* Adjust sink depend clause to take into account pointer offsets.
5727 Return TRUE if there was a problem processing the offset, and the
5728 whole clause should be removed. */
5731 cp_finish_omp_clause_depend_sink (tree sink_clause
)
5733 tree t
= OMP_CLAUSE_DECL (sink_clause
);
5734 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
5736 /* Make sure we don't adjust things twice for templates. */
5737 if (processing_template_decl
)
5740 for (; t
; t
= TREE_CHAIN (t
))
5742 tree decl
= TREE_VALUE (t
);
5743 if (TREE_CODE (TREE_TYPE (decl
)) == POINTER_TYPE
)
5745 tree offset
= TREE_PURPOSE (t
);
5746 bool neg
= wi::neg_p ((wide_int
) offset
);
5747 offset
= fold_unary (ABS_EXPR
, TREE_TYPE (offset
), offset
);
5748 decl
= mark_rvalue_use (decl
);
5749 decl
= convert_from_reference (decl
);
5750 tree t2
= pointer_int_sum (OMP_CLAUSE_LOCATION (sink_clause
),
5751 neg
? MINUS_EXPR
: PLUS_EXPR
,
5753 t2
= fold_build2_loc (OMP_CLAUSE_LOCATION (sink_clause
),
5754 MINUS_EXPR
, sizetype
,
5755 fold_convert (sizetype
, t2
),
5756 fold_convert (sizetype
, decl
));
5757 if (t2
== error_mark_node
)
5759 TREE_PURPOSE (t
) = t2
;
5765 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5766 Remove any elements from the list that are invalid. */
5769 finish_omp_clauses (tree clauses
, enum c_omp_region_type ort
)
5771 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5772 bitmap_head aligned_head
, map_head
, map_field_head
, oacc_reduction_head
;
5774 tree safelen
= NULL_TREE
;
5775 bool branch_seen
= false;
5776 bool copyprivate_seen
= false;
5777 bool ordered_seen
= false;
5778 bool oacc_async
= false;
5780 bitmap_obstack_initialize (NULL
);
5781 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5782 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5783 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5784 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5785 bitmap_initialize (&map_head
, &bitmap_default_obstack
);
5786 bitmap_initialize (&map_field_head
, &bitmap_default_obstack
);
5787 bitmap_initialize (&oacc_reduction_head
, &bitmap_default_obstack
);
5789 if (ort
& C_ORT_ACC
)
5790 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
5791 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_ASYNC
)
5797 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5799 bool remove
= false;
5800 bool field_ok
= false;
5802 switch (OMP_CLAUSE_CODE (c
))
5804 case OMP_CLAUSE_SHARED
:
5805 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5806 goto check_dup_generic
;
5807 case OMP_CLAUSE_PRIVATE
:
5808 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5809 goto check_dup_generic
;
5810 case OMP_CLAUSE_REDUCTION
:
5811 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5812 t
= OMP_CLAUSE_DECL (c
);
5813 if (TREE_CODE (t
) == TREE_LIST
)
5815 if (handle_omp_array_sections (c
, ort
))
5820 if (TREE_CODE (t
) == TREE_LIST
)
5822 while (TREE_CODE (t
) == TREE_LIST
)
5827 gcc_assert (TREE_CODE (t
) == MEM_REF
);
5828 t
= TREE_OPERAND (t
, 0);
5829 if (TREE_CODE (t
) == POINTER_PLUS_EXPR
)
5830 t
= TREE_OPERAND (t
, 0);
5831 if (TREE_CODE (t
) == ADDR_EXPR
5832 || TREE_CODE (t
) == INDIRECT_REF
)
5833 t
= TREE_OPERAND (t
, 0);
5835 tree n
= omp_clause_decl_field (t
);
5838 goto check_dup_generic_t
;
5841 cxx_mark_addressable (t
);
5842 goto check_dup_generic
;
5843 case OMP_CLAUSE_COPYPRIVATE
:
5844 copyprivate_seen
= true;
5845 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5846 goto check_dup_generic
;
5847 case OMP_CLAUSE_COPYIN
:
5848 goto check_dup_generic
;
5849 case OMP_CLAUSE_LINEAR
:
5850 field_ok
= ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
);
5851 t
= OMP_CLAUSE_DECL (c
);
5852 if (ort
!= C_ORT_OMP_DECLARE_SIMD
5853 && OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_DEFAULT
)
5855 error_at (OMP_CLAUSE_LOCATION (c
),
5856 "modifier should not be specified in %<linear%> "
5857 "clause on %<simd%> or %<for%> constructs");
5858 OMP_CLAUSE_LINEAR_KIND (c
) = OMP_CLAUSE_LINEAR_DEFAULT
;
5860 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5861 && !type_dependent_expression_p (t
))
5863 tree type
= TREE_TYPE (t
);
5864 if ((OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5865 || OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_UVAL
)
5866 && TREE_CODE (type
) != REFERENCE_TYPE
)
5868 error ("linear clause with %qs modifier applied to "
5869 "non-reference variable with %qT type",
5870 OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
5871 ? "ref" : "uval", TREE_TYPE (t
));
5875 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5876 type
= TREE_TYPE (type
);
5877 if (ort
== C_ORT_CILK
)
5879 if (!INTEGRAL_TYPE_P (type
)
5880 && !SCALAR_FLOAT_TYPE_P (type
)
5881 && TREE_CODE (type
) != POINTER_TYPE
)
5883 error ("linear clause applied to non-integral, "
5884 "non-floating, non-pointer variable with %qT type",
5890 else if (OMP_CLAUSE_LINEAR_KIND (c
) != OMP_CLAUSE_LINEAR_REF
)
5892 if (!INTEGRAL_TYPE_P (type
)
5893 && TREE_CODE (type
) != POINTER_TYPE
)
5895 error ("linear clause applied to non-integral non-pointer"
5896 " variable with %qT type", TREE_TYPE (t
));
5902 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5904 t
= integer_one_node
;
5905 if (t
== error_mark_node
)
5910 else if (!type_dependent_expression_p (t
)
5911 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5912 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5913 || TREE_CODE (t
) != PARM_DECL
5914 || TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
5915 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))))
5917 error ("linear step expression must be integral");
5923 t
= mark_rvalue_use (t
);
5924 if (ort
== C_ORT_OMP_DECLARE_SIMD
&& TREE_CODE (t
) == PARM_DECL
)
5926 OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
) = 1;
5927 goto check_dup_generic
;
5929 if (!processing_template_decl
5930 && (VAR_P (OMP_CLAUSE_DECL (c
))
5931 || TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
))
5933 if (ort
== C_ORT_OMP_DECLARE_SIMD
)
5935 t
= maybe_constant_value (t
);
5936 if (TREE_CODE (t
) != INTEGER_CST
)
5938 error_at (OMP_CLAUSE_LOCATION (c
),
5939 "%<linear%> clause step %qE is neither "
5940 "constant nor a parameter", t
);
5945 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5946 tree type
= TREE_TYPE (OMP_CLAUSE_DECL (c
));
5947 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5948 type
= TREE_TYPE (type
);
5949 if (OMP_CLAUSE_LINEAR_KIND (c
) == OMP_CLAUSE_LINEAR_REF
)
5951 type
= build_pointer_type (type
);
5952 tree d
= fold_convert (type
, OMP_CLAUSE_DECL (c
));
5953 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
5955 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
5956 MINUS_EXPR
, sizetype
,
5957 fold_convert (sizetype
, t
),
5958 fold_convert (sizetype
, d
));
5959 if (t
== error_mark_node
)
5965 else if (TREE_CODE (type
) == POINTER_TYPE
5966 /* Can't multiply the step yet if *this
5967 is still incomplete type. */
5968 && (ort
!= C_ORT_OMP_DECLARE_SIMD
5969 || TREE_CODE (OMP_CLAUSE_DECL (c
)) != PARM_DECL
5970 || !DECL_ARTIFICIAL (OMP_CLAUSE_DECL (c
))
5971 || DECL_NAME (OMP_CLAUSE_DECL (c
))
5973 || !TYPE_BEING_DEFINED (TREE_TYPE (type
))))
5975 tree d
= convert_from_reference (OMP_CLAUSE_DECL (c
));
5976 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
5978 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
5979 MINUS_EXPR
, sizetype
,
5980 fold_convert (sizetype
, t
),
5981 fold_convert (sizetype
, d
));
5982 if (t
== error_mark_node
)
5989 t
= fold_convert (type
, t
);
5991 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
5993 goto check_dup_generic
;
5995 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
5998 if (!remove
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_SHARED
)
5999 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6002 t
= OMP_CLAUSE_DECL (c
);
6003 check_dup_generic_t
:
6004 if (t
== current_class_ptr
6005 && (ort
!= C_ORT_OMP_DECLARE_SIMD
6006 || (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_LINEAR
6007 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_UNIFORM
)))
6009 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6014 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6015 && (!field_ok
|| TREE_CODE (t
) != FIELD_DECL
))
6017 if (processing_template_decl
)
6020 error ("%qD is not a variable in clause %qs", t
,
6021 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6023 error ("%qE is not a variable in clause %qs", t
,
6024 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6027 else if (ort
== C_ORT_ACC
6028 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
6030 if (bitmap_bit_p (&oacc_reduction_head
, DECL_UID (t
)))
6032 error ("%qD appears more than once in reduction clauses", t
);
6036 bitmap_set_bit (&oacc_reduction_head
, DECL_UID (t
));
6038 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6039 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
6040 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6042 error ("%qD appears more than once in data clauses", t
);
6045 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
6046 && bitmap_bit_p (&map_head
, DECL_UID (t
)))
6048 if (ort
== C_ORT_ACC
)
6049 error ("%qD appears more than once in data clauses", t
);
6051 error ("%qD appears both in data and map clauses", t
);
6055 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6060 && TREE_CODE (t
) == FIELD_DECL
6061 && t
== OMP_CLAUSE_DECL (c
)
6062 && ort
!= C_ORT_ACC
)
6065 = omp_privatize_field (t
, (OMP_CLAUSE_CODE (c
)
6066 == OMP_CLAUSE_SHARED
));
6067 if (OMP_CLAUSE_DECL (c
) == error_mark_node
)
6072 case OMP_CLAUSE_FIRSTPRIVATE
:
6073 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6075 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6077 t
= OMP_CLAUSE_DECL (c
);
6078 if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6080 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6085 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6086 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6087 || TREE_CODE (t
) != FIELD_DECL
))
6089 if (processing_template_decl
)
6092 error ("%qD is not a variable in clause %<firstprivate%>", t
);
6094 error ("%qE is not a variable in clause %<firstprivate%>", t
);
6097 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6098 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6100 error ("%qD appears more than once in data clauses", t
);
6103 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6105 if (ort
== C_ORT_ACC
)
6106 error ("%qD appears more than once in data clauses", t
);
6108 error ("%qD appears both in data and map clauses", t
);
6112 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
6113 goto handle_field_decl
;
6115 case OMP_CLAUSE_LASTPRIVATE
:
6116 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
6118 omp_note_field_privatization (t
, OMP_CLAUSE_DECL (c
));
6120 t
= OMP_CLAUSE_DECL (c
);
6121 if (t
== current_class_ptr
)
6123 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6128 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
6129 && ((ort
& C_ORT_OMP_DECLARE_SIMD
) != C_ORT_OMP
6130 || TREE_CODE (t
) != FIELD_DECL
))
6132 if (processing_template_decl
)
6135 error ("%qD is not a variable in clause %<lastprivate%>", t
);
6137 error ("%qE is not a variable in clause %<lastprivate%>", t
);
6140 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6141 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
6143 error ("%qD appears more than once in data clauses", t
);
6147 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
6148 goto handle_field_decl
;
6151 t
= OMP_CLAUSE_IF_EXPR (c
);
6152 t
= maybe_convert_cond (t
);
6153 if (t
== error_mark_node
)
6155 else if (!processing_template_decl
)
6156 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6157 OMP_CLAUSE_IF_EXPR (c
) = t
;
6160 case OMP_CLAUSE_FINAL
:
6161 t
= OMP_CLAUSE_FINAL_EXPR (c
);
6162 t
= maybe_convert_cond (t
);
6163 if (t
== error_mark_node
)
6165 else if (!processing_template_decl
)
6166 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6167 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
6170 case OMP_CLAUSE_GANG
:
6171 /* Operand 1 is the gang static: argument. */
6172 t
= OMP_CLAUSE_OPERAND (c
, 1);
6175 if (t
== error_mark_node
)
6177 else if (!type_dependent_expression_p (t
)
6178 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6180 error ("%<gang%> static expression must be integral");
6185 t
= mark_rvalue_use (t
);
6186 if (!processing_template_decl
)
6188 t
= maybe_constant_value (t
);
6189 if (TREE_CODE (t
) == INTEGER_CST
6190 && tree_int_cst_sgn (t
) != 1
6191 && t
!= integer_minus_one_node
)
6193 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6194 "%<gang%> static value must be"
6196 t
= integer_one_node
;
6199 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6201 OMP_CLAUSE_OPERAND (c
, 1) = t
;
6203 /* Check operand 0, the num argument. */
6205 case OMP_CLAUSE_WORKER
:
6206 case OMP_CLAUSE_VECTOR
:
6207 if (OMP_CLAUSE_OPERAND (c
, 0) == NULL_TREE
)
6210 case OMP_CLAUSE_NUM_TASKS
:
6211 case OMP_CLAUSE_NUM_TEAMS
:
6212 case OMP_CLAUSE_NUM_THREADS
:
6213 case OMP_CLAUSE_NUM_GANGS
:
6214 case OMP_CLAUSE_NUM_WORKERS
:
6215 case OMP_CLAUSE_VECTOR_LENGTH
:
6216 t
= OMP_CLAUSE_OPERAND (c
, 0);
6217 if (t
== error_mark_node
)
6219 else if (!type_dependent_expression_p (t
)
6220 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6222 switch (OMP_CLAUSE_CODE (c
))
6224 case OMP_CLAUSE_GANG
:
6225 error_at (OMP_CLAUSE_LOCATION (c
),
6226 "%<gang%> num expression must be integral"); break;
6227 case OMP_CLAUSE_VECTOR
:
6228 error_at (OMP_CLAUSE_LOCATION (c
),
6229 "%<vector%> length expression must be integral");
6231 case OMP_CLAUSE_WORKER
:
6232 error_at (OMP_CLAUSE_LOCATION (c
),
6233 "%<worker%> num expression must be integral");
6236 error_at (OMP_CLAUSE_LOCATION (c
),
6237 "%qs expression must be integral",
6238 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6244 t
= mark_rvalue_use (t
);
6245 if (!processing_template_decl
)
6247 t
= maybe_constant_value (t
);
6248 if (TREE_CODE (t
) == INTEGER_CST
6249 && tree_int_cst_sgn (t
) != 1)
6251 switch (OMP_CLAUSE_CODE (c
))
6253 case OMP_CLAUSE_GANG
:
6254 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6255 "%<gang%> num value must be positive");
6257 case OMP_CLAUSE_VECTOR
:
6258 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6259 "%<vector%> length value must be"
6262 case OMP_CLAUSE_WORKER
:
6263 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6264 "%<worker%> num value must be"
6268 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6269 "%qs value must be positive",
6270 omp_clause_code_name
6271 [OMP_CLAUSE_CODE (c
)]);
6273 t
= integer_one_node
;
6275 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6277 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6281 case OMP_CLAUSE_SCHEDULE
:
6282 if (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
)
6284 const char *p
= NULL
;
6285 switch (OMP_CLAUSE_SCHEDULE_KIND (c
) & OMP_CLAUSE_SCHEDULE_MASK
)
6287 case OMP_CLAUSE_SCHEDULE_STATIC
: p
= "static"; break;
6288 case OMP_CLAUSE_SCHEDULE_DYNAMIC
: break;
6289 case OMP_CLAUSE_SCHEDULE_GUIDED
: break;
6290 case OMP_CLAUSE_SCHEDULE_AUTO
: p
= "auto"; break;
6291 case OMP_CLAUSE_SCHEDULE_RUNTIME
: p
= "runtime"; break;
6292 default: gcc_unreachable ();
6296 error_at (OMP_CLAUSE_LOCATION (c
),
6297 "%<nonmonotonic%> modifier specified for %qs "
6298 "schedule kind", p
);
6299 OMP_CLAUSE_SCHEDULE_KIND (c
)
6300 = (enum omp_clause_schedule_kind
)
6301 (OMP_CLAUSE_SCHEDULE_KIND (c
)
6302 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
6306 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
6309 else if (t
== error_mark_node
)
6311 else if (!type_dependent_expression_p (t
)
6312 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
6313 != OMP_CLAUSE_SCHEDULE_CILKFOR
)
6314 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6316 error ("schedule chunk size expression must be integral");
6321 t
= mark_rvalue_use (t
);
6322 if (!processing_template_decl
)
6324 if (OMP_CLAUSE_SCHEDULE_KIND (c
)
6325 == OMP_CLAUSE_SCHEDULE_CILKFOR
)
6327 t
= convert_to_integer (long_integer_type_node
, t
);
6328 if (t
== error_mark_node
)
6336 t
= maybe_constant_value (t
);
6337 if (TREE_CODE (t
) == INTEGER_CST
6338 && tree_int_cst_sgn (t
) != 1)
6340 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6341 "chunk size value must be positive");
6342 t
= integer_one_node
;
6345 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6347 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
6351 case OMP_CLAUSE_SIMDLEN
:
6352 case OMP_CLAUSE_SAFELEN
:
6353 t
= OMP_CLAUSE_OPERAND (c
, 0);
6354 if (t
== error_mark_node
)
6356 else if (!type_dependent_expression_p (t
)
6357 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6359 error ("%qs length expression must be integral",
6360 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6365 t
= mark_rvalue_use (t
);
6366 t
= maybe_constant_value (t
);
6367 if (!processing_template_decl
)
6369 if (TREE_CODE (t
) != INTEGER_CST
6370 || tree_int_cst_sgn (t
) != 1)
6372 error ("%qs length expression must be positive constant"
6373 " integer expression",
6374 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6378 OMP_CLAUSE_OPERAND (c
, 0) = t
;
6379 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SAFELEN
)
6384 case OMP_CLAUSE_ASYNC
:
6385 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
6386 if (t
== error_mark_node
)
6388 else if (!type_dependent_expression_p (t
)
6389 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6391 error ("%<async%> expression must be integral");
6396 t
= mark_rvalue_use (t
);
6397 if (!processing_template_decl
)
6398 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6399 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
6403 case OMP_CLAUSE_WAIT
:
6404 t
= OMP_CLAUSE_WAIT_EXPR (c
);
6405 if (t
== error_mark_node
)
6407 else if (!processing_template_decl
)
6408 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6409 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
6412 case OMP_CLAUSE_THREAD_LIMIT
:
6413 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
6414 if (t
== error_mark_node
)
6416 else if (!type_dependent_expression_p (t
)
6417 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6419 error ("%<thread_limit%> expression must be integral");
6424 t
= mark_rvalue_use (t
);
6425 if (!processing_template_decl
)
6427 t
= maybe_constant_value (t
);
6428 if (TREE_CODE (t
) == INTEGER_CST
6429 && tree_int_cst_sgn (t
) != 1)
6431 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6432 "%<thread_limit%> value must be positive");
6433 t
= integer_one_node
;
6435 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6437 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
6441 case OMP_CLAUSE_DEVICE
:
6442 t
= OMP_CLAUSE_DEVICE_ID (c
);
6443 if (t
== error_mark_node
)
6445 else if (!type_dependent_expression_p (t
)
6446 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6448 error ("%<device%> id must be integral");
6453 t
= mark_rvalue_use (t
);
6454 if (!processing_template_decl
)
6455 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6456 OMP_CLAUSE_DEVICE_ID (c
) = t
;
6460 case OMP_CLAUSE_DIST_SCHEDULE
:
6461 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
6464 else if (t
== error_mark_node
)
6466 else if (!type_dependent_expression_p (t
)
6467 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6469 error ("%<dist_schedule%> chunk size expression must be "
6475 t
= mark_rvalue_use (t
);
6476 if (!processing_template_decl
)
6477 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6478 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
6482 case OMP_CLAUSE_ALIGNED
:
6483 t
= OMP_CLAUSE_DECL (c
);
6484 if (t
== current_class_ptr
&& ort
!= C_ORT_OMP_DECLARE_SIMD
)
6486 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6491 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6493 if (processing_template_decl
)
6496 error ("%qD is not a variable in %<aligned%> clause", t
);
6498 error ("%qE is not a variable in %<aligned%> clause", t
);
6501 else if (!type_dependent_expression_p (t
)
6502 && TREE_CODE (TREE_TYPE (t
)) != POINTER_TYPE
6503 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
6504 && (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6505 || (!POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
6506 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
6509 error_at (OMP_CLAUSE_LOCATION (c
),
6510 "%qE in %<aligned%> clause is neither a pointer nor "
6511 "an array nor a reference to pointer or array", t
);
6514 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
6516 error ("%qD appears more than once in %<aligned%> clauses", t
);
6520 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
6521 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
6522 if (t
== error_mark_node
)
6524 else if (t
== NULL_TREE
)
6526 else if (!type_dependent_expression_p (t
)
6527 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6529 error ("%<aligned%> clause alignment expression must "
6535 t
= mark_rvalue_use (t
);
6536 t
= maybe_constant_value (t
);
6537 if (!processing_template_decl
)
6539 if (TREE_CODE (t
) != INTEGER_CST
6540 || tree_int_cst_sgn (t
) != 1)
6542 error ("%<aligned%> clause alignment expression must be "
6543 "positive constant integer expression");
6547 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
6551 case OMP_CLAUSE_DEPEND
:
6552 t
= OMP_CLAUSE_DECL (c
);
6555 gcc_assert (OMP_CLAUSE_DEPEND_KIND (c
)
6556 == OMP_CLAUSE_DEPEND_SOURCE
);
6559 if (OMP_CLAUSE_DEPEND_KIND (c
) == OMP_CLAUSE_DEPEND_SINK
)
6561 if (cp_finish_omp_clause_depend_sink (c
))
6565 if (TREE_CODE (t
) == TREE_LIST
)
6567 if (handle_omp_array_sections (c
, ort
))
6571 if (t
== error_mark_node
)
6573 else if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6575 if (processing_template_decl
)
6578 error ("%qD is not a variable in %<depend%> clause", t
);
6580 error ("%qE is not a variable in %<depend%> clause", t
);
6583 else if (t
== current_class_ptr
)
6585 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6589 else if (!processing_template_decl
6590 && !cxx_mark_addressable (t
))
6594 case OMP_CLAUSE_MAP
:
6596 case OMP_CLAUSE_FROM
:
6597 case OMP_CLAUSE__CACHE_
:
6598 t
= OMP_CLAUSE_DECL (c
);
6599 if (TREE_CODE (t
) == TREE_LIST
)
6601 if (handle_omp_array_sections (c
, ort
))
6605 t
= OMP_CLAUSE_DECL (c
);
6606 if (TREE_CODE (t
) != TREE_LIST
6607 && !type_dependent_expression_p (t
)
6608 && !cp_omp_mappable_type (TREE_TYPE (t
)))
6610 error_at (OMP_CLAUSE_LOCATION (c
),
6611 "array section does not have mappable type "
6613 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6616 while (TREE_CODE (t
) == ARRAY_REF
)
6617 t
= TREE_OPERAND (t
, 0);
6618 if (TREE_CODE (t
) == COMPONENT_REF
6619 && TREE_CODE (TREE_TYPE (t
)) == ARRAY_TYPE
)
6621 while (TREE_CODE (t
) == COMPONENT_REF
)
6622 t
= TREE_OPERAND (t
, 0);
6623 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6625 if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6627 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6628 error ("%qD appears more than once in motion"
6630 else if (ort
== C_ORT_ACC
)
6631 error ("%qD appears more than once in data"
6634 error ("%qD appears more than once in map"
6640 bitmap_set_bit (&map_head
, DECL_UID (t
));
6641 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6647 if (t
== error_mark_node
)
6652 if (REFERENCE_REF_P (t
)
6653 && TREE_CODE (TREE_OPERAND (t
, 0)) == COMPONENT_REF
)
6655 t
= TREE_OPERAND (t
, 0);
6656 OMP_CLAUSE_DECL (c
) = t
;
6658 if (TREE_CODE (t
) == COMPONENT_REF
6659 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6660 && OMP_CLAUSE_CODE (c
) != OMP_CLAUSE__CACHE_
)
6662 if (type_dependent_expression_p (t
))
6664 if (DECL_BIT_FIELD (TREE_OPERAND (t
, 1)))
6666 error_at (OMP_CLAUSE_LOCATION (c
),
6667 "bit-field %qE in %qs clause",
6668 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6671 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6673 error_at (OMP_CLAUSE_LOCATION (c
),
6674 "%qE does not have a mappable type in %qs clause",
6675 t
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6678 while (TREE_CODE (t
) == COMPONENT_REF
)
6680 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
6683 error_at (OMP_CLAUSE_LOCATION (c
),
6684 "%qE is a member of a union", t
);
6688 t
= TREE_OPERAND (t
, 0);
6692 if (VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
6694 if (bitmap_bit_p (&map_field_head
, DECL_UID (t
)))
6695 goto handle_map_references
;
6698 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
6700 if (processing_template_decl
)
6702 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6703 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6704 || OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_ALWAYS_POINTER
))
6707 error ("%qD is not a variable in %qs clause", t
,
6708 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6710 error ("%qE is not a variable in %qs clause", t
,
6711 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6714 else if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
6716 error ("%qD is threadprivate variable in %qs clause", t
,
6717 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6720 else if (ort
!= C_ORT_ACC
&& t
== current_class_ptr
)
6722 error ("%<this%> allowed in OpenMP only in %<declare simd%>"
6727 else if (!processing_template_decl
6728 && TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
6729 && (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
6730 || (OMP_CLAUSE_MAP_KIND (c
)
6731 != GOMP_MAP_FIRSTPRIVATE_POINTER
))
6732 && !cxx_mark_addressable (t
))
6734 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6735 && (OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
6736 || (OMP_CLAUSE_MAP_KIND (c
)
6737 == GOMP_MAP_FIRSTPRIVATE_POINTER
)))
6738 && t
== OMP_CLAUSE_DECL (c
)
6739 && !type_dependent_expression_p (t
)
6740 && !cp_omp_mappable_type ((TREE_CODE (TREE_TYPE (t
))
6742 ? TREE_TYPE (TREE_TYPE (t
))
6745 error_at (OMP_CLAUSE_LOCATION (c
),
6746 "%qD does not have a mappable type in %qs clause", t
,
6747 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6750 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6751 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FORCE_DEVICEPTR
6752 && !type_dependent_expression_p (t
)
6753 && !POINTER_TYPE_P (TREE_TYPE (t
)))
6755 error ("%qD is not a pointer variable", t
);
6758 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
6759 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_FIRSTPRIVATE_POINTER
)
6761 if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6762 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6764 error ("%qD appears more than once in data clauses", t
);
6767 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6769 if (ort
== C_ORT_ACC
)
6770 error ("%qD appears more than once in data clauses", t
);
6772 error ("%qD appears both in data and map clauses", t
);
6776 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6778 else if (bitmap_bit_p (&map_head
, DECL_UID (t
)))
6780 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
6781 error ("%qD appears more than once in motion clauses", t
);
6782 if (ort
== C_ORT_ACC
)
6783 error ("%qD appears more than once in data clauses", t
);
6785 error ("%qD appears more than once in map clauses", t
);
6788 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
6789 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
6791 if (ort
== C_ORT_ACC
)
6792 error ("%qD appears more than once in data clauses", t
);
6794 error ("%qD appears both in data and map clauses", t
);
6799 bitmap_set_bit (&map_head
, DECL_UID (t
));
6800 if (t
!= OMP_CLAUSE_DECL (c
)
6801 && TREE_CODE (OMP_CLAUSE_DECL (c
)) == COMPONENT_REF
)
6802 bitmap_set_bit (&map_field_head
, DECL_UID (t
));
6804 handle_map_references
:
6806 && !processing_template_decl
6807 && (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
6808 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
))) == REFERENCE_TYPE
)
6810 t
= OMP_CLAUSE_DECL (c
);
6811 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
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
)));
6818 else if (OMP_CLAUSE_MAP_KIND (c
)
6819 != GOMP_MAP_FIRSTPRIVATE_POINTER
6820 && (OMP_CLAUSE_MAP_KIND (c
)
6821 != GOMP_MAP_FIRSTPRIVATE_REFERENCE
)
6822 && (OMP_CLAUSE_MAP_KIND (c
)
6823 != GOMP_MAP_ALWAYS_POINTER
))
6825 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
6827 if (TREE_CODE (t
) == COMPONENT_REF
)
6828 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_ALWAYS_POINTER
);
6830 OMP_CLAUSE_SET_MAP_KIND (c2
,
6831 GOMP_MAP_FIRSTPRIVATE_REFERENCE
);
6832 OMP_CLAUSE_DECL (c2
) = t
;
6833 OMP_CLAUSE_SIZE (c2
) = size_zero_node
;
6834 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
6835 OMP_CLAUSE_CHAIN (c
) = c2
;
6836 OMP_CLAUSE_DECL (c
) = build_simple_mem_ref (t
);
6837 if (OMP_CLAUSE_SIZE (c
) == NULL_TREE
)
6839 = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (t
)));
6845 case OMP_CLAUSE_TO_DECLARE
:
6846 case OMP_CLAUSE_LINK
:
6847 t
= OMP_CLAUSE_DECL (c
);
6848 if (TREE_CODE (t
) == FUNCTION_DECL
6849 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6851 else if (!VAR_P (t
))
6853 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_TO_DECLARE
)
6855 if (TREE_CODE (t
) == OVERLOAD
&& OVL_CHAIN (t
))
6856 error_at (OMP_CLAUSE_LOCATION (c
),
6857 "overloaded function name %qE in clause %qs", t
,
6858 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6859 else if (TREE_CODE (t
) == TEMPLATE_ID_EXPR
)
6860 error_at (OMP_CLAUSE_LOCATION (c
),
6861 "template %qE in clause %qs", t
,
6862 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6864 error_at (OMP_CLAUSE_LOCATION (c
),
6865 "%qE is neither a variable nor a function name "
6867 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6870 error_at (OMP_CLAUSE_LOCATION (c
),
6871 "%qE is not a variable in clause %qs", t
,
6872 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6875 else if (DECL_THREAD_LOCAL_P (t
))
6877 error_at (OMP_CLAUSE_LOCATION (c
),
6878 "%qD is threadprivate variable in %qs clause", t
,
6879 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6882 else if (!cp_omp_mappable_type (TREE_TYPE (t
)))
6884 error_at (OMP_CLAUSE_LOCATION (c
),
6885 "%qD does not have a mappable type in %qs clause", t
,
6886 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6891 if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
6893 error_at (OMP_CLAUSE_LOCATION (c
),
6894 "%qE appears more than once on the same "
6895 "%<declare target%> directive", t
);
6899 bitmap_set_bit (&generic_head
, DECL_UID (t
));
6902 case OMP_CLAUSE_UNIFORM
:
6903 t
= OMP_CLAUSE_DECL (c
);
6904 if (TREE_CODE (t
) != PARM_DECL
)
6906 if (processing_template_decl
)
6909 error ("%qD is not an argument in %<uniform%> clause", t
);
6911 error ("%qE is not an argument in %<uniform%> clause", t
);
6915 /* map_head bitmap is used as uniform_head if declare_simd. */
6916 bitmap_set_bit (&map_head
, DECL_UID (t
));
6917 goto check_dup_generic
;
6919 case OMP_CLAUSE_GRAINSIZE
:
6920 t
= OMP_CLAUSE_GRAINSIZE_EXPR (c
);
6921 if (t
== error_mark_node
)
6923 else if (!type_dependent_expression_p (t
)
6924 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6926 error ("%<grainsize%> expression must be integral");
6931 t
= mark_rvalue_use (t
);
6932 if (!processing_template_decl
)
6934 t
= maybe_constant_value (t
);
6935 if (TREE_CODE (t
) == INTEGER_CST
6936 && tree_int_cst_sgn (t
) != 1)
6938 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6939 "%<grainsize%> value must be positive");
6940 t
= integer_one_node
;
6942 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6944 OMP_CLAUSE_GRAINSIZE_EXPR (c
) = t
;
6948 case OMP_CLAUSE_PRIORITY
:
6949 t
= OMP_CLAUSE_PRIORITY_EXPR (c
);
6950 if (t
== error_mark_node
)
6952 else if (!type_dependent_expression_p (t
)
6953 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6955 error ("%<priority%> expression must be integral");
6960 t
= mark_rvalue_use (t
);
6961 if (!processing_template_decl
)
6963 t
= maybe_constant_value (t
);
6964 if (TREE_CODE (t
) == INTEGER_CST
6965 && tree_int_cst_sgn (t
) == -1)
6967 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
6968 "%<priority%> value must be non-negative");
6969 t
= integer_one_node
;
6971 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6973 OMP_CLAUSE_PRIORITY_EXPR (c
) = t
;
6977 case OMP_CLAUSE_HINT
:
6978 t
= OMP_CLAUSE_HINT_EXPR (c
);
6979 if (t
== error_mark_node
)
6981 else if (!type_dependent_expression_p (t
)
6982 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
6984 error ("%<num_tasks%> expression must be integral");
6989 t
= mark_rvalue_use (t
);
6990 if (!processing_template_decl
)
6992 t
= maybe_constant_value (t
);
6993 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6995 OMP_CLAUSE_HINT_EXPR (c
) = t
;
6999 case OMP_CLAUSE_IS_DEVICE_PTR
:
7000 case OMP_CLAUSE_USE_DEVICE_PTR
:
7001 field_ok
= (ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
;
7002 t
= OMP_CLAUSE_DECL (c
);
7003 if (!type_dependent_expression_p (t
))
7005 tree type
= TREE_TYPE (t
);
7006 if (TREE_CODE (type
) != POINTER_TYPE
7007 && TREE_CODE (type
) != ARRAY_TYPE
7008 && (TREE_CODE (type
) != REFERENCE_TYPE
7009 || (TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
7010 && TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
)))
7012 error_at (OMP_CLAUSE_LOCATION (c
),
7013 "%qs variable is neither a pointer, nor an array"
7014 "nor reference to pointer or array",
7015 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7019 goto check_dup_generic
;
7021 case OMP_CLAUSE_NOWAIT
:
7022 case OMP_CLAUSE_DEFAULT
:
7023 case OMP_CLAUSE_UNTIED
:
7024 case OMP_CLAUSE_COLLAPSE
:
7025 case OMP_CLAUSE_MERGEABLE
:
7026 case OMP_CLAUSE_PARALLEL
:
7027 case OMP_CLAUSE_FOR
:
7028 case OMP_CLAUSE_SECTIONS
:
7029 case OMP_CLAUSE_TASKGROUP
:
7030 case OMP_CLAUSE_PROC_BIND
:
7031 case OMP_CLAUSE_NOGROUP
:
7032 case OMP_CLAUSE_THREADS
:
7033 case OMP_CLAUSE_SIMD
:
7034 case OMP_CLAUSE_DEFAULTMAP
:
7035 case OMP_CLAUSE__CILK_FOR_COUNT_
:
7036 case OMP_CLAUSE_AUTO
:
7037 case OMP_CLAUSE_INDEPENDENT
:
7038 case OMP_CLAUSE_SEQ
:
7041 case OMP_CLAUSE_TILE
:
7042 for (tree list
= OMP_CLAUSE_TILE_LIST (c
); !remove
&& list
;
7043 list
= TREE_CHAIN (list
))
7045 t
= TREE_VALUE (list
);
7047 if (t
== error_mark_node
)
7049 else if (!type_dependent_expression_p (t
)
7050 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
7052 error ("%<tile%> value must be integral");
7057 t
= mark_rvalue_use (t
);
7058 if (!processing_template_decl
)
7060 t
= maybe_constant_value (t
);
7061 if (TREE_CODE (t
) == INTEGER_CST
7062 && tree_int_cst_sgn (t
) != 1
7063 && t
!= integer_minus_one_node
)
7065 warning_at (OMP_CLAUSE_LOCATION (c
), 0,
7066 "%<tile%> value must be positive");
7067 t
= integer_one_node
;
7070 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
7073 /* Update list item. */
7074 TREE_VALUE (list
) = t
;
7078 case OMP_CLAUSE_ORDERED
:
7079 ordered_seen
= true;
7082 case OMP_CLAUSE_INBRANCH
:
7083 case OMP_CLAUSE_NOTINBRANCH
:
7086 error ("%<inbranch%> clause is incompatible with "
7098 *pc
= OMP_CLAUSE_CHAIN (c
);
7100 pc
= &OMP_CLAUSE_CHAIN (c
);
7103 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
7105 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
7106 bool remove
= false;
7107 bool need_complete_type
= false;
7108 bool need_default_ctor
= false;
7109 bool need_copy_ctor
= false;
7110 bool need_copy_assignment
= false;
7111 bool need_implicitly_determined
= false;
7112 bool need_dtor
= false;
7113 tree type
, inner_type
;
7117 case OMP_CLAUSE_SHARED
:
7118 need_implicitly_determined
= true;
7120 case OMP_CLAUSE_PRIVATE
:
7121 need_complete_type
= true;
7122 need_default_ctor
= true;
7124 need_implicitly_determined
= true;
7126 case OMP_CLAUSE_FIRSTPRIVATE
:
7127 need_complete_type
= true;
7128 need_copy_ctor
= true;
7130 need_implicitly_determined
= true;
7132 case OMP_CLAUSE_LASTPRIVATE
:
7133 need_complete_type
= true;
7134 need_copy_assignment
= true;
7135 need_implicitly_determined
= true;
7137 case OMP_CLAUSE_REDUCTION
:
7138 need_implicitly_determined
= true;
7140 case OMP_CLAUSE_LINEAR
:
7141 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
7142 need_implicitly_determined
= true;
7143 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (c
)
7144 && !bitmap_bit_p (&map_head
,
7145 DECL_UID (OMP_CLAUSE_LINEAR_STEP (c
))))
7147 error_at (OMP_CLAUSE_LOCATION (c
),
7148 "%<linear%> clause step is a parameter %qD not "
7149 "specified in %<uniform%> clause",
7150 OMP_CLAUSE_LINEAR_STEP (c
));
7151 *pc
= OMP_CLAUSE_CHAIN (c
);
7155 case OMP_CLAUSE_COPYPRIVATE
:
7156 need_copy_assignment
= true;
7158 case OMP_CLAUSE_COPYIN
:
7159 need_copy_assignment
= true;
7161 case OMP_CLAUSE_SIMDLEN
:
7163 && !processing_template_decl
7164 && tree_int_cst_lt (OMP_CLAUSE_SAFELEN_EXPR (safelen
),
7165 OMP_CLAUSE_SIMDLEN_EXPR (c
)))
7167 error_at (OMP_CLAUSE_LOCATION (c
),
7168 "%<simdlen%> clause value is bigger than "
7169 "%<safelen%> clause value");
7170 OMP_CLAUSE_SIMDLEN_EXPR (c
)
7171 = OMP_CLAUSE_SAFELEN_EXPR (safelen
);
7173 pc
= &OMP_CLAUSE_CHAIN (c
);
7175 case OMP_CLAUSE_SCHEDULE
:
7177 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
7178 & OMP_CLAUSE_SCHEDULE_NONMONOTONIC
))
7180 error_at (OMP_CLAUSE_LOCATION (c
),
7181 "%<nonmonotonic%> schedule modifier specified "
7182 "together with %<ordered%> clause");
7183 OMP_CLAUSE_SCHEDULE_KIND (c
)
7184 = (enum omp_clause_schedule_kind
)
7185 (OMP_CLAUSE_SCHEDULE_KIND (c
)
7186 & ~OMP_CLAUSE_SCHEDULE_NONMONOTONIC
);
7188 pc
= &OMP_CLAUSE_CHAIN (c
);
7190 case OMP_CLAUSE_NOWAIT
:
7191 if (copyprivate_seen
)
7193 error_at (OMP_CLAUSE_LOCATION (c
),
7194 "%<nowait%> clause must not be used together "
7195 "with %<copyprivate%>");
7196 *pc
= OMP_CLAUSE_CHAIN (c
);
7201 pc
= &OMP_CLAUSE_CHAIN (c
);
7205 t
= OMP_CLAUSE_DECL (c
);
7206 if (processing_template_decl
7207 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
7209 pc
= &OMP_CLAUSE_CHAIN (c
);
7215 case OMP_CLAUSE_LASTPRIVATE
:
7216 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
7218 need_default_ctor
= true;
7223 case OMP_CLAUSE_REDUCTION
:
7224 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
7228 t
= OMP_CLAUSE_DECL (c
);
7231 case OMP_CLAUSE_COPYIN
:
7232 if (!VAR_P (t
) || !CP_DECL_THREAD_LOCAL_P (t
))
7234 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
7243 if (need_complete_type
|| need_copy_assignment
)
7245 t
= require_complete_type (t
);
7246 if (t
== error_mark_node
)
7248 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
7249 && !complete_type_or_else (TREE_TYPE (TREE_TYPE (t
)), t
))
7252 if (need_implicitly_determined
)
7254 const char *share_name
= NULL
;
7256 if (VAR_P (t
) && CP_DECL_THREAD_LOCAL_P (t
))
7257 share_name
= "threadprivate";
7258 else switch (cxx_omp_predetermined_sharing (t
))
7260 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
7262 case OMP_CLAUSE_DEFAULT_SHARED
:
7263 /* const vars may be specified in firstprivate clause. */
7264 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
7265 && cxx_omp_const_qual_no_mutable (t
))
7267 share_name
= "shared";
7269 case OMP_CLAUSE_DEFAULT_PRIVATE
:
7270 share_name
= "private";
7277 error ("%qE is predetermined %qs for %qs",
7278 omp_clause_printable_decl (t
), share_name
,
7279 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
7284 /* We're interested in the base element, not arrays. */
7285 inner_type
= type
= TREE_TYPE (t
);
7286 if ((need_complete_type
7287 || need_copy_assignment
7288 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
)
7289 && TREE_CODE (inner_type
) == REFERENCE_TYPE
)
7290 inner_type
= TREE_TYPE (inner_type
);
7291 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
7292 inner_type
= TREE_TYPE (inner_type
);
7294 /* Check for special function availability by building a call to one.
7295 Save the results, because later we won't be in the right context
7296 for making these queries. */
7297 if (CLASS_TYPE_P (inner_type
)
7298 && COMPLETE_TYPE_P (inner_type
)
7299 && (need_default_ctor
|| need_copy_ctor
7300 || need_copy_assignment
|| need_dtor
)
7301 && !type_dependent_expression_p (t
)
7302 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
7303 need_copy_ctor
, need_copy_assignment
,
7308 && c_kind
== OMP_CLAUSE_SHARED
7309 && processing_template_decl
)
7311 t
= omp_clause_decl_field (OMP_CLAUSE_DECL (c
));
7313 OMP_CLAUSE_DECL (c
) = t
;
7317 *pc
= OMP_CLAUSE_CHAIN (c
);
7319 pc
= &OMP_CLAUSE_CHAIN (c
);
7322 bitmap_obstack_release (NULL
);
7326 /* Start processing OpenMP clauses that can include any
7327 privatization clauses for non-static data members. */
7330 push_omp_privatization_clauses (bool ignore_next
)
7332 if (omp_private_member_ignore_next
)
7334 omp_private_member_ignore_next
= ignore_next
;
7337 omp_private_member_ignore_next
= ignore_next
;
7338 if (omp_private_member_map
)
7339 omp_private_member_vec
.safe_push (error_mark_node
);
7340 return push_stmt_list ();
7343 /* Revert remapping of any non-static data members since
7344 the last push_omp_privatization_clauses () call. */
7347 pop_omp_privatization_clauses (tree stmt
)
7349 if (stmt
== NULL_TREE
)
7351 stmt
= pop_stmt_list (stmt
);
7352 if (omp_private_member_map
)
7354 while (!omp_private_member_vec
.is_empty ())
7356 tree t
= omp_private_member_vec
.pop ();
7357 if (t
== error_mark_node
)
7362 bool no_decl_expr
= t
== integer_zero_node
;
7364 t
= omp_private_member_vec
.pop ();
7365 tree
*v
= omp_private_member_map
->get (t
);
7369 omp_private_member_map
->remove (t
);
7371 delete omp_private_member_map
;
7372 omp_private_member_map
= NULL
;
7377 /* Remember OpenMP privatization clauses mapping and clear it.
7378 Used for lambdas. */
7381 save_omp_privatization_clauses (vec
<tree
> &save
)
7384 if (omp_private_member_ignore_next
)
7385 save
.safe_push (integer_one_node
);
7386 omp_private_member_ignore_next
= false;
7387 if (!omp_private_member_map
)
7390 while (!omp_private_member_vec
.is_empty ())
7392 tree t
= omp_private_member_vec
.pop ();
7393 if (t
== error_mark_node
)
7399 if (t
== integer_zero_node
)
7400 t
= omp_private_member_vec
.pop ();
7401 tree
*v
= omp_private_member_map
->get (t
);
7403 save
.safe_push (*v
);
7408 delete omp_private_member_map
;
7409 omp_private_member_map
= NULL
;
7412 /* Restore OpenMP privatization clauses mapping saved by the
7416 restore_omp_privatization_clauses (vec
<tree
> &save
)
7418 gcc_assert (omp_private_member_vec
.is_empty ());
7419 omp_private_member_ignore_next
= false;
7420 if (save
.is_empty ())
7422 if (save
.length () == 1 && save
[0] == integer_one_node
)
7424 omp_private_member_ignore_next
= true;
7429 omp_private_member_map
= new hash_map
<tree
, tree
>;
7430 while (!save
.is_empty ())
7432 tree t
= save
.pop ();
7434 if (t
!= error_mark_node
)
7436 if (t
== integer_one_node
)
7438 omp_private_member_ignore_next
= true;
7439 gcc_assert (save
.is_empty ());
7442 if (t
== integer_zero_node
)
7444 tree
&v
= omp_private_member_map
->get_or_insert (t
);
7447 omp_private_member_vec
.safe_push (t
);
7449 omp_private_member_vec
.safe_push (n
);
7454 /* For all variables in the tree_list VARS, mark them as thread local. */
7457 finish_omp_threadprivate (tree vars
)
7461 /* Mark every variable in VARS to be assigned thread local storage. */
7462 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
7464 tree v
= TREE_PURPOSE (t
);
7466 if (error_operand_p (v
))
7468 else if (!VAR_P (v
))
7469 error ("%<threadprivate%> %qD is not file, namespace "
7470 "or block scope variable", v
);
7471 /* If V had already been marked threadprivate, it doesn't matter
7472 whether it had been used prior to this point. */
7473 else if (TREE_USED (v
)
7474 && (DECL_LANG_SPECIFIC (v
) == NULL
7475 || !CP_DECL_THREADPRIVATE_P (v
)))
7476 error ("%qE declared %<threadprivate%> after first use", v
);
7477 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
7478 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
7479 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
7480 error ("%<threadprivate%> %qE has incomplete type", v
);
7481 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
7482 && CP_DECL_CONTEXT (v
) != current_class_type
)
7483 error ("%<threadprivate%> %qE directive not "
7484 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
7487 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
7488 if (DECL_LANG_SPECIFIC (v
) == NULL
)
7490 retrofit_lang_decl (v
);
7492 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
7493 after the allocation of the lang_decl structure. */
7494 if (DECL_DISCRIMINATOR_P (v
))
7495 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
7498 if (! CP_DECL_THREAD_LOCAL_P (v
))
7500 CP_DECL_THREAD_LOCAL_P (v
) = true;
7501 set_decl_tls_model (v
, decl_default_tls_model (v
));
7502 /* If rtl has been already set for this var, call
7503 make_decl_rtl once again, so that encode_section_info
7504 has a chance to look at the new decl flags. */
7505 if (DECL_RTL_SET_P (v
))
7508 CP_DECL_THREADPRIVATE_P (v
) = 1;
7513 /* Build an OpenMP structured block. */
7516 begin_omp_structured_block (void)
7518 return do_pushlevel (sk_omp
);
7522 finish_omp_structured_block (tree block
)
7524 return do_poplevel (block
);
7527 /* Similarly, except force the retention of the BLOCK. */
7530 begin_omp_parallel (void)
7532 keep_next_level (true);
7533 return begin_omp_structured_block ();
7536 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
7540 finish_oacc_data (tree clauses
, tree block
)
7544 block
= finish_omp_structured_block (block
);
7546 stmt
= make_node (OACC_DATA
);
7547 TREE_TYPE (stmt
) = void_type_node
;
7548 OACC_DATA_CLAUSES (stmt
) = clauses
;
7549 OACC_DATA_BODY (stmt
) = block
;
7551 return add_stmt (stmt
);
7554 /* Generate OACC_HOST_DATA, with CLAUSES and BLOCK as its compound
7558 finish_oacc_host_data (tree clauses
, tree block
)
7562 block
= finish_omp_structured_block (block
);
7564 stmt
= make_node (OACC_HOST_DATA
);
7565 TREE_TYPE (stmt
) = void_type_node
;
7566 OACC_HOST_DATA_CLAUSES (stmt
) = clauses
;
7567 OACC_HOST_DATA_BODY (stmt
) = block
;
7569 return add_stmt (stmt
);
7572 /* Generate OMP construct CODE, with BODY and CLAUSES as its compound
7576 finish_omp_construct (enum tree_code code
, tree body
, tree clauses
)
7578 body
= finish_omp_structured_block (body
);
7580 tree stmt
= make_node (code
);
7581 TREE_TYPE (stmt
) = void_type_node
;
7582 OMP_BODY (stmt
) = body
;
7583 OMP_CLAUSES (stmt
) = clauses
;
7585 return add_stmt (stmt
);
7589 finish_omp_parallel (tree clauses
, tree body
)
7593 body
= finish_omp_structured_block (body
);
7595 stmt
= make_node (OMP_PARALLEL
);
7596 TREE_TYPE (stmt
) = void_type_node
;
7597 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
7598 OMP_PARALLEL_BODY (stmt
) = body
;
7600 return add_stmt (stmt
);
7604 begin_omp_task (void)
7606 keep_next_level (true);
7607 return begin_omp_structured_block ();
7611 finish_omp_task (tree clauses
, tree body
)
7615 body
= finish_omp_structured_block (body
);
7617 stmt
= make_node (OMP_TASK
);
7618 TREE_TYPE (stmt
) = void_type_node
;
7619 OMP_TASK_CLAUSES (stmt
) = clauses
;
7620 OMP_TASK_BODY (stmt
) = body
;
7622 return add_stmt (stmt
);
7625 /* Helper function for finish_omp_for. Convert Ith random access iterator
7626 into integral iterator. Return FALSE if successful. */
7629 handle_omp_for_class_iterator (int i
, location_t locus
, enum tree_code code
,
7630 tree declv
, tree orig_declv
, tree initv
,
7631 tree condv
, tree incrv
, tree
*body
,
7632 tree
*pre_body
, tree
&clauses
, tree
*lastp
,
7633 int collapse
, int ordered
)
7635 tree diff
, iter_init
, iter_incr
= NULL
, last
;
7636 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
7637 tree decl
= TREE_VEC_ELT (declv
, i
);
7638 tree init
= TREE_VEC_ELT (initv
, i
);
7639 tree cond
= TREE_VEC_ELT (condv
, i
);
7640 tree incr
= TREE_VEC_ELT (incrv
, i
);
7642 location_t elocus
= locus
;
7644 if (init
&& EXPR_HAS_LOCATION (init
))
7645 elocus
= EXPR_LOCATION (init
);
7647 cond
= cp_fully_fold (cond
);
7648 switch (TREE_CODE (cond
))
7655 if (TREE_OPERAND (cond
, 1) == iter
)
7656 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
7657 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
7658 if (TREE_OPERAND (cond
, 0) != iter
)
7659 cond
= error_mark_node
;
7662 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
7665 TREE_OPERAND (cond
, 1), ERROR_MARK
,
7666 NULL
, tf_warning_or_error
);
7667 if (error_operand_p (tem
))
7672 cond
= error_mark_node
;
7675 if (cond
== error_mark_node
)
7677 error_at (elocus
, "invalid controlling predicate");
7680 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
7681 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
7682 tf_warning_or_error
);
7683 diff
= cp_fully_fold (diff
);
7684 if (error_operand_p (diff
))
7686 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
7688 error_at (elocus
, "difference between %qE and %qD does not have integer type",
7689 TREE_OPERAND (cond
, 1), iter
);
7692 if (!c_omp_check_loop_iv_exprs (locus
, orig_declv
,
7693 TREE_VEC_ELT (declv
, i
), NULL_TREE
,
7694 cond
, cp_walk_subtrees
))
7697 switch (TREE_CODE (incr
))
7699 case PREINCREMENT_EXPR
:
7700 case PREDECREMENT_EXPR
:
7701 case POSTINCREMENT_EXPR
:
7702 case POSTDECREMENT_EXPR
:
7703 if (TREE_OPERAND (incr
, 0) != iter
)
7705 incr
= error_mark_node
;
7708 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
7709 TREE_CODE (incr
), iter
,
7710 tf_warning_or_error
);
7711 if (error_operand_p (iter_incr
))
7713 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
7714 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
7715 incr
= integer_one_node
;
7717 incr
= integer_minus_one_node
;
7720 if (TREE_OPERAND (incr
, 0) != iter
)
7721 incr
= error_mark_node
;
7722 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
7723 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
7725 tree rhs
= TREE_OPERAND (incr
, 1);
7726 if (TREE_OPERAND (rhs
, 0) == iter
)
7728 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
7730 incr
= error_mark_node
;
7733 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7734 iter
, TREE_CODE (rhs
),
7735 TREE_OPERAND (rhs
, 1),
7736 tf_warning_or_error
);
7737 if (error_operand_p (iter_incr
))
7739 incr
= TREE_OPERAND (rhs
, 1);
7740 incr
= cp_convert (TREE_TYPE (diff
), incr
,
7741 tf_warning_or_error
);
7742 if (TREE_CODE (rhs
) == MINUS_EXPR
)
7744 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
7745 incr
= fold_simple (incr
);
7747 if (TREE_CODE (incr
) != INTEGER_CST
7748 && (TREE_CODE (incr
) != NOP_EXPR
7749 || (TREE_CODE (TREE_OPERAND (incr
, 0))
7754 else if (TREE_OPERAND (rhs
, 1) == iter
)
7756 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
7757 || TREE_CODE (rhs
) != PLUS_EXPR
)
7758 incr
= error_mark_node
;
7761 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
7763 TREE_OPERAND (rhs
, 0),
7766 tf_warning_or_error
);
7767 if (error_operand_p (iter_incr
))
7769 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
7772 tf_warning_or_error
);
7773 if (error_operand_p (iter_incr
))
7775 incr
= TREE_OPERAND (rhs
, 0);
7780 incr
= error_mark_node
;
7783 incr
= error_mark_node
;
7786 incr
= error_mark_node
;
7790 if (incr
== error_mark_node
)
7792 error_at (elocus
, "invalid increment expression");
7796 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
7797 bool taskloop_iv_seen
= false;
7798 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
7799 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
7800 && OMP_CLAUSE_DECL (c
) == iter
)
7802 if (code
== OMP_TASKLOOP
)
7804 taskloop_iv_seen
= true;
7805 OMP_CLAUSE_LASTPRIVATE_TASKLOOP_IV (c
) = 1;
7809 else if (code
== OMP_TASKLOOP
7810 && OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
7811 && OMP_CLAUSE_DECL (c
) == iter
)
7813 taskloop_iv_seen
= true;
7814 OMP_CLAUSE_PRIVATE_TASKLOOP_IV (c
) = 1;
7817 decl
= create_temporary_var (TREE_TYPE (diff
));
7819 add_decl_expr (decl
);
7820 last
= create_temporary_var (TREE_TYPE (diff
));
7822 add_decl_expr (last
);
7823 if (c
&& iter_incr
== NULL
&& TREE_CODE (incr
) != INTEGER_CST
7824 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7826 incr_var
= create_temporary_var (TREE_TYPE (diff
));
7827 pushdecl (incr_var
);
7828 add_decl_expr (incr_var
);
7830 gcc_assert (stmts_are_full_exprs_p ());
7831 tree diffvar
= NULL_TREE
;
7832 if (code
== OMP_TASKLOOP
)
7834 if (!taskloop_iv_seen
)
7836 tree ivc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7837 OMP_CLAUSE_DECL (ivc
) = iter
;
7838 cxx_omp_finish_clause (ivc
, NULL
);
7839 OMP_CLAUSE_CHAIN (ivc
) = clauses
;
7842 tree lvc
= build_omp_clause (locus
, OMP_CLAUSE_FIRSTPRIVATE
);
7843 OMP_CLAUSE_DECL (lvc
) = last
;
7844 OMP_CLAUSE_CHAIN (lvc
) = clauses
;
7846 diffvar
= create_temporary_var (TREE_TYPE (diff
));
7848 add_decl_expr (diffvar
);
7851 orig_pre_body
= *pre_body
;
7852 *pre_body
= push_stmt_list ();
7854 add_stmt (orig_pre_body
);
7856 finish_expr_stmt (build_x_modify_expr (elocus
,
7857 iter
, NOP_EXPR
, init
,
7858 tf_warning_or_error
));
7859 init
= build_int_cst (TREE_TYPE (diff
), 0);
7860 if (c
&& iter_incr
== NULL
7861 && (!ordered
|| (i
< collapse
&& collapse
> 1)))
7865 finish_expr_stmt (build_x_modify_expr (elocus
,
7867 incr
, tf_warning_or_error
));
7870 iter_incr
= build_x_modify_expr (elocus
,
7871 iter
, PLUS_EXPR
, incr
,
7872 tf_warning_or_error
);
7874 if (c
&& ordered
&& i
< collapse
&& collapse
> 1)
7876 finish_expr_stmt (build_x_modify_expr (elocus
,
7877 last
, NOP_EXPR
, init
,
7878 tf_warning_or_error
));
7881 finish_expr_stmt (build_x_modify_expr (elocus
,
7883 diff
, tf_warning_or_error
));
7886 *pre_body
= pop_stmt_list (*pre_body
);
7888 cond
= cp_build_binary_op (elocus
,
7889 TREE_CODE (cond
), decl
, diff
,
7890 tf_warning_or_error
);
7891 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
7892 elocus
, incr
, NULL_TREE
);
7895 *body
= push_stmt_list ();
7896 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
7897 iter_init
= build_x_modify_expr (elocus
,
7898 iter
, PLUS_EXPR
, iter_init
,
7899 tf_warning_or_error
);
7900 if (iter_init
!= error_mark_node
)
7901 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7902 finish_expr_stmt (iter_init
);
7903 finish_expr_stmt (build_x_modify_expr (elocus
,
7904 last
, NOP_EXPR
, decl
,
7905 tf_warning_or_error
));
7906 add_stmt (orig_body
);
7907 *body
= pop_stmt_list (*body
);
7911 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
7913 finish_expr_stmt (iter_incr
);
7917 if (i
< collapse
&& collapse
> 1 && !error_operand_p (iter_incr
))
7918 iter_init
= build2 (PLUS_EXPR
, TREE_TYPE (diff
),
7919 iter_init
, iter_incr
);
7920 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), iter_init
, last
);
7921 iter_init
= build_x_modify_expr (elocus
,
7922 iter
, PLUS_EXPR
, iter_init
,
7923 tf_warning_or_error
);
7924 if (iter_init
!= error_mark_node
)
7925 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
7926 finish_expr_stmt (iter_init
);
7928 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
7929 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
7932 TREE_VEC_ELT (declv
, i
) = decl
;
7933 TREE_VEC_ELT (initv
, i
) = init
;
7934 TREE_VEC_ELT (condv
, i
) = cond
;
7935 TREE_VEC_ELT (incrv
, i
) = incr
;
7941 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
7942 are directly for their associated operands in the statement. DECL
7943 and INIT are a combo; if DECL is NULL then INIT ought to be a
7944 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
7945 optional statements that need to go before the loop into its
7949 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
,
7950 tree orig_declv
, tree initv
, tree condv
, tree incrv
,
7951 tree body
, tree pre_body
, vec
<tree
> *orig_inits
, tree clauses
)
7953 tree omp_for
= NULL
, orig_incr
= NULL
;
7954 tree decl
= NULL
, init
, cond
, incr
, orig_decl
= NULL_TREE
, block
= NULL_TREE
;
7955 tree last
= NULL_TREE
;
7961 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
7962 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
7963 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
7964 if (TREE_VEC_LENGTH (declv
) > 1)
7966 tree c
= find_omp_clause (clauses
, OMP_CLAUSE_COLLAPSE
);
7968 collapse
= tree_to_shwi (OMP_CLAUSE_COLLAPSE_EXPR (c
));
7969 if (collapse
!= TREE_VEC_LENGTH (declv
))
7970 ordered
= TREE_VEC_LENGTH (declv
);
7972 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
7974 decl
= TREE_VEC_ELT (declv
, i
);
7975 init
= TREE_VEC_ELT (initv
, i
);
7976 cond
= TREE_VEC_ELT (condv
, i
);
7977 incr
= TREE_VEC_ELT (incrv
, i
);
7983 switch (TREE_CODE (init
))
7986 decl
= TREE_OPERAND (init
, 0);
7987 init
= TREE_OPERAND (init
, 1);
7990 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
7992 decl
= TREE_OPERAND (init
, 0);
7993 init
= TREE_OPERAND (init
, 2);
8003 "expected iteration declaration or initialization");
8008 if (init
&& EXPR_HAS_LOCATION (init
))
8009 elocus
= EXPR_LOCATION (init
);
8013 error_at (elocus
, "missing controlling predicate");
8019 error_at (elocus
, "missing increment expression");
8023 TREE_VEC_ELT (declv
, i
) = decl
;
8024 TREE_VEC_ELT (initv
, i
) = init
;
8031 FOR_EACH_VEC_ELT (*orig_inits
, i
, orig_init
)
8033 && !c_omp_check_loop_iv_exprs (locus
, declv
,
8034 TREE_VEC_ELT (declv
, i
), orig_init
,
8035 NULL_TREE
, cp_walk_subtrees
))
8041 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
8045 stmt
= make_node (code
);
8047 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
8049 /* This is really just a place-holder. We'll be decomposing this
8050 again and going through the cp_build_modify_expr path below when
8051 we instantiate the thing. */
8052 TREE_VEC_ELT (initv
, i
)
8053 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
8054 TREE_VEC_ELT (initv
, i
));
8057 TREE_TYPE (stmt
) = void_type_node
;
8058 OMP_FOR_INIT (stmt
) = initv
;
8059 OMP_FOR_COND (stmt
) = condv
;
8060 OMP_FOR_INCR (stmt
) = incrv
;
8061 OMP_FOR_BODY (stmt
) = body
;
8062 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
8063 OMP_FOR_CLAUSES (stmt
) = clauses
;
8065 SET_EXPR_LOCATION (stmt
, locus
);
8066 return add_stmt (stmt
);
8070 orig_declv
= copy_node (declv
);
8072 if (processing_template_decl
)
8073 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
8075 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
8077 decl
= TREE_VEC_ELT (declv
, i
);
8078 init
= TREE_VEC_ELT (initv
, i
);
8079 cond
= TREE_VEC_ELT (condv
, i
);
8080 incr
= TREE_VEC_ELT (incrv
, i
);
8082 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8085 if (init
&& EXPR_HAS_LOCATION (init
))
8086 elocus
= EXPR_LOCATION (init
);
8090 error_at (elocus
, "expected iteration declaration or initialization");
8094 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
8097 TREE_VEC_ELT (orig_incr
, i
) = incr
;
8098 incr
= cp_build_modify_expr (elocus
, TREE_OPERAND (incr
, 0),
8099 TREE_CODE (TREE_OPERAND (incr
, 1)),
8100 TREE_OPERAND (incr
, 2),
8101 tf_warning_or_error
);
8104 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
8106 if (code
== OMP_SIMD
)
8108 error_at (elocus
, "%<#pragma omp simd%> used with class "
8109 "iteration variable %qE", decl
);
8112 if (code
== CILK_FOR
&& i
== 0)
8114 if (handle_omp_for_class_iterator (i
, locus
, code
, declv
, orig_declv
,
8115 initv
, condv
, incrv
, &body
,
8116 &pre_body
, clauses
, &last
,
8122 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
8123 && !TYPE_PTR_P (TREE_TYPE (decl
)))
8125 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
8129 if (!processing_template_decl
)
8131 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
8132 init
= cp_build_modify_expr (elocus
, decl
, NOP_EXPR
, init
,
8133 tf_warning_or_error
);
8136 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
8138 && TREE_SIDE_EFFECTS (cond
)
8139 && COMPARISON_CLASS_P (cond
)
8140 && !processing_template_decl
)
8142 tree t
= TREE_OPERAND (cond
, 0);
8143 if (TREE_SIDE_EFFECTS (t
)
8145 && (TREE_CODE (t
) != NOP_EXPR
8146 || TREE_OPERAND (t
, 0) != decl
))
8147 TREE_OPERAND (cond
, 0)
8148 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8150 t
= TREE_OPERAND (cond
, 1);
8151 if (TREE_SIDE_EFFECTS (t
)
8153 && (TREE_CODE (t
) != NOP_EXPR
8154 || TREE_OPERAND (t
, 0) != decl
))
8155 TREE_OPERAND (cond
, 1)
8156 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8158 if (decl
== error_mark_node
|| init
== error_mark_node
)
8161 TREE_VEC_ELT (declv
, i
) = decl
;
8162 TREE_VEC_ELT (initv
, i
) = init
;
8163 TREE_VEC_ELT (condv
, i
) = cond
;
8164 TREE_VEC_ELT (incrv
, i
) = incr
;
8168 if (IS_EMPTY_STMT (pre_body
))
8171 if (code
== CILK_FOR
&& !processing_template_decl
)
8172 block
= push_stmt_list ();
8174 omp_for
= c_finish_omp_for (locus
, code
, declv
, orig_declv
, initv
, condv
,
8175 incrv
, body
, pre_body
);
8177 /* Check for iterators appearing in lb, b or incr expressions. */
8178 if (omp_for
&& !c_omp_check_loop_iv (omp_for
, orig_declv
, cp_walk_subtrees
))
8179 omp_for
= NULL_TREE
;
8181 if (omp_for
== NULL
)
8184 pop_stmt_list (block
);
8190 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
8192 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
8193 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
8195 if (TREE_CODE (incr
) != MODIFY_EXPR
)
8198 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
8199 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
8200 && !processing_template_decl
)
8202 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
8203 if (TREE_SIDE_EFFECTS (t
)
8205 && (TREE_CODE (t
) != NOP_EXPR
8206 || TREE_OPERAND (t
, 0) != decl
))
8207 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
8208 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8210 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8211 if (TREE_SIDE_EFFECTS (t
)
8213 && (TREE_CODE (t
) != NOP_EXPR
8214 || TREE_OPERAND (t
, 0) != decl
))
8215 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8216 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
8220 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
8222 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8224 /* For simd loops with non-static data member iterators, we could have added
8225 OMP_CLAUSE_LINEAR clauses without OMP_CLAUSE_LINEAR_STEP. As we know the
8226 step at this point, fill it in. */
8227 if (code
== OMP_SIMD
&& !processing_template_decl
8228 && TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)) == 1)
8229 for (tree c
= find_omp_clause (clauses
, OMP_CLAUSE_LINEAR
); c
;
8230 c
= find_omp_clause (OMP_CLAUSE_CHAIN (c
), OMP_CLAUSE_LINEAR
))
8231 if (OMP_CLAUSE_LINEAR_STEP (c
) == NULL_TREE
)
8233 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0), 0);
8234 gcc_assert (decl
== OMP_CLAUSE_DECL (c
));
8235 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8237 switch (TREE_CODE (incr
))
8239 case PREINCREMENT_EXPR
:
8240 case POSTINCREMENT_EXPR
:
8241 /* c_omp_for_incr_canonicalize_ptr() should have been
8242 called to massage things appropriately. */
8243 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8244 OMP_CLAUSE_LINEAR_STEP (c
) = build_int_cst (TREE_TYPE (decl
), 1);
8246 case PREDECREMENT_EXPR
:
8247 case POSTDECREMENT_EXPR
:
8248 /* c_omp_for_incr_canonicalize_ptr() should have been
8249 called to massage things appropriately. */
8250 gcc_assert (!POINTER_TYPE_P (TREE_TYPE (decl
)));
8251 OMP_CLAUSE_LINEAR_STEP (c
)
8252 = build_int_cst (TREE_TYPE (decl
), -1);
8255 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8256 incr
= TREE_OPERAND (incr
, 1);
8257 switch (TREE_CODE (incr
))
8260 if (TREE_OPERAND (incr
, 1) == decl
)
8261 step
= TREE_OPERAND (incr
, 0);
8263 step
= TREE_OPERAND (incr
, 1);
8266 case POINTER_PLUS_EXPR
:
8267 gcc_assert (TREE_OPERAND (incr
, 0) == decl
);
8268 step
= TREE_OPERAND (incr
, 1);
8273 stept
= TREE_TYPE (decl
);
8274 if (POINTER_TYPE_P (stept
))
8276 step
= fold_convert (stept
, step
);
8277 if (TREE_CODE (incr
) == MINUS_EXPR
)
8278 step
= fold_build1 (NEGATE_EXPR
, stept
, step
);
8279 OMP_CLAUSE_LINEAR_STEP (c
) = step
;
8288 tree omp_par
= make_node (OMP_PARALLEL
);
8289 TREE_TYPE (omp_par
) = void_type_node
;
8290 OMP_PARALLEL_CLAUSES (omp_par
) = NULL_TREE
;
8291 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
8292 TREE_SIDE_EFFECTS (bind
) = 1;
8293 BIND_EXPR_BODY (bind
) = pop_stmt_list (block
);
8294 OMP_PARALLEL_BODY (omp_par
) = bind
;
8295 if (OMP_FOR_PRE_BODY (omp_for
))
8297 add_stmt (OMP_FOR_PRE_BODY (omp_for
));
8298 OMP_FOR_PRE_BODY (omp_for
) = NULL_TREE
;
8300 init
= TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0);
8301 decl
= TREE_OPERAND (init
, 0);
8302 cond
= TREE_VEC_ELT (OMP_FOR_COND (omp_for
), 0);
8303 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
8304 tree t
= TREE_OPERAND (cond
, 1), c
, clauses
, *pc
;
8305 clauses
= OMP_FOR_CLAUSES (omp_for
);
8306 OMP_FOR_CLAUSES (omp_for
) = NULL_TREE
;
8307 for (pc
= &clauses
; *pc
; )
8308 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_SCHEDULE
)
8310 gcc_assert (OMP_FOR_CLAUSES (omp_for
) == NULL_TREE
);
8311 OMP_FOR_CLAUSES (omp_for
) = *pc
;
8312 *pc
= OMP_CLAUSE_CHAIN (*pc
);
8313 OMP_CLAUSE_CHAIN (OMP_FOR_CLAUSES (omp_for
)) = NULL_TREE
;
8317 gcc_assert (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
);
8318 pc
= &OMP_CLAUSE_CHAIN (*pc
);
8320 if (TREE_CODE (t
) != INTEGER_CST
)
8322 TREE_OPERAND (cond
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8323 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8324 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (cond
, 1);
8325 OMP_CLAUSE_CHAIN (c
) = clauses
;
8328 if (TREE_CODE (incr
) == MODIFY_EXPR
)
8330 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8331 if (TREE_CODE (t
) != INTEGER_CST
)
8333 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
8334 = get_temp_regvar (TREE_TYPE (t
), t
);
8335 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8336 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
8337 OMP_CLAUSE_CHAIN (c
) = clauses
;
8341 t
= TREE_OPERAND (init
, 1);
8342 if (TREE_CODE (t
) != INTEGER_CST
)
8344 TREE_OPERAND (init
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
8345 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8346 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (init
, 1);
8347 OMP_CLAUSE_CHAIN (c
) = clauses
;
8350 if (orig_decl
&& orig_decl
!= decl
)
8352 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8353 OMP_CLAUSE_DECL (c
) = orig_decl
;
8354 OMP_CLAUSE_CHAIN (c
) = clauses
;
8359 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8360 OMP_CLAUSE_DECL (c
) = last
;
8361 OMP_CLAUSE_CHAIN (c
) = clauses
;
8364 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
8365 OMP_CLAUSE_DECL (c
) = decl
;
8366 OMP_CLAUSE_CHAIN (c
) = clauses
;
8368 c
= build_omp_clause (input_location
, OMP_CLAUSE__CILK_FOR_COUNT_
);
8369 OMP_CLAUSE_OPERAND (c
, 0)
8370 = cilk_for_number_of_iterations (omp_for
);
8371 OMP_CLAUSE_CHAIN (c
) = clauses
;
8372 OMP_PARALLEL_CLAUSES (omp_par
) = finish_omp_clauses (c
, C_ORT_CILK
);
8376 else if (code
== CILK_FOR
&& processing_template_decl
)
8378 tree c
, clauses
= OMP_FOR_CLAUSES (omp_for
);
8379 if (orig_decl
&& orig_decl
!= decl
)
8381 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8382 OMP_CLAUSE_DECL (c
) = orig_decl
;
8383 OMP_CLAUSE_CHAIN (c
) = clauses
;
8388 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
8389 OMP_CLAUSE_DECL (c
) = last
;
8390 OMP_CLAUSE_CHAIN (c
) = clauses
;
8393 OMP_FOR_CLAUSES (omp_for
) = clauses
;
8399 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
8400 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
8415 dependent_p
= false;
8418 /* Even in a template, we can detect invalid uses of the atomic
8419 pragma if neither LHS nor RHS is type-dependent. */
8420 if (processing_template_decl
)
8422 dependent_p
= (type_dependent_expression_p (lhs
)
8423 || (rhs
&& type_dependent_expression_p (rhs
))
8424 || (v
&& type_dependent_expression_p (v
))
8425 || (lhs1
&& type_dependent_expression_p (lhs1
))
8426 || (rhs1
&& type_dependent_expression_p (rhs1
)));
8429 lhs
= build_non_dependent_expr (lhs
);
8431 rhs
= build_non_dependent_expr (rhs
);
8433 v
= build_non_dependent_expr (v
);
8435 lhs1
= build_non_dependent_expr (lhs1
);
8437 rhs1
= build_non_dependent_expr (rhs1
);
8442 bool swapped
= false;
8443 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
8445 std::swap (rhs
, rhs1
);
8446 swapped
= !commutative_tree_code (opcode
);
8448 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
8450 if (code
== OMP_ATOMIC
)
8451 error ("%<#pragma omp atomic update%> uses two different "
8452 "expressions for memory");
8454 error ("%<#pragma omp atomic capture%> uses two different "
8455 "expressions for memory");
8458 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
8460 if (code
== OMP_ATOMIC
)
8461 error ("%<#pragma omp atomic update%> uses two different "
8462 "expressions for memory");
8464 error ("%<#pragma omp atomic capture%> uses two different "
8465 "expressions for memory");
8468 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
8469 v
, lhs1
, rhs1
, swapped
, seq_cst
,
8470 processing_template_decl
!= 0);
8471 if (stmt
== error_mark_node
)
8474 if (processing_template_decl
)
8476 if (code
== OMP_ATOMIC_READ
)
8478 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
8479 OMP_ATOMIC_READ
, orig_lhs
);
8480 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8481 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8485 if (opcode
== NOP_EXPR
)
8486 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
8488 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
8490 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
8491 COMPOUND_EXPR
, orig_rhs1
, stmt
);
8492 if (code
!= OMP_ATOMIC
)
8494 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
8495 code
, orig_lhs1
, stmt
);
8496 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8497 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
8500 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
8501 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
8503 finish_expr_stmt (stmt
);
8507 finish_omp_barrier (void)
8509 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
8510 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8511 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8512 release_tree_vector (vec
);
8513 finish_expr_stmt (stmt
);
8517 finish_omp_flush (void)
8519 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
8520 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8521 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8522 release_tree_vector (vec
);
8523 finish_expr_stmt (stmt
);
8527 finish_omp_taskwait (void)
8529 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
8530 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8531 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8532 release_tree_vector (vec
);
8533 finish_expr_stmt (stmt
);
8537 finish_omp_taskyield (void)
8539 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
8540 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8541 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8542 release_tree_vector (vec
);
8543 finish_expr_stmt (stmt
);
8547 finish_omp_cancel (tree clauses
)
8549 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
8551 if (find_omp_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8553 else if (find_omp_clause (clauses
, OMP_CLAUSE_FOR
))
8555 else if (find_omp_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8557 else if (find_omp_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8561 error ("%<#pragma omp cancel must specify one of "
8562 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8565 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
8566 tree ifc
= find_omp_clause (clauses
, OMP_CLAUSE_IF
);
8567 if (ifc
!= NULL_TREE
)
8569 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
8570 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
8571 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
8572 build_zero_cst (type
));
8575 ifc
= boolean_true_node
;
8576 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
8577 vec
->quick_push (ifc
);
8578 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8579 release_tree_vector (vec
);
8580 finish_expr_stmt (stmt
);
8584 finish_omp_cancellation_point (tree clauses
)
8586 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
8588 if (find_omp_clause (clauses
, OMP_CLAUSE_PARALLEL
))
8590 else if (find_omp_clause (clauses
, OMP_CLAUSE_FOR
))
8592 else if (find_omp_clause (clauses
, OMP_CLAUSE_SECTIONS
))
8594 else if (find_omp_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
8598 error ("%<#pragma omp cancellation point must specify one of "
8599 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
8602 vec
<tree
, va_gc
> *vec
8603 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
8604 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
8605 release_tree_vector (vec
);
8606 finish_expr_stmt (stmt
);
8609 /* Begin a __transaction_atomic or __transaction_relaxed statement.
8610 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
8611 should create an extra compound stmt. */
8614 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
8619 *pcompound
= begin_compound_stmt (0);
8621 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
8623 /* Only add the statement to the function if support enabled. */
8627 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
8628 ? G_("%<__transaction_relaxed%> without "
8629 "transactional memory support enabled")
8630 : G_("%<__transaction_atomic%> without "
8631 "transactional memory support enabled")));
8633 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
8634 TREE_SIDE_EFFECTS (r
) = 1;
8638 /* End a __transaction_atomic or __transaction_relaxed statement.
8639 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
8640 and we should end the compound. If NOEX is non-NULL, we wrap the body in
8641 a MUST_NOT_THROW_EXPR with NOEX as condition. */
8644 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
8646 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
8647 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
8648 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
8649 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
8651 /* noexcept specifications are not allowed for function transactions. */
8652 gcc_assert (!(noex
&& compound_stmt
));
8655 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
8657 protected_set_expr_location
8658 (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
8659 TREE_SIDE_EFFECTS (body
) = 1;
8660 TRANSACTION_EXPR_BODY (stmt
) = body
;
8664 finish_compound_stmt (compound_stmt
);
8667 /* Build a __transaction_atomic or __transaction_relaxed expression. If
8668 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
8672 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
8677 expr
= build_must_not_throw_expr (expr
, noex
);
8678 protected_set_expr_location (expr
, loc
);
8679 TREE_SIDE_EFFECTS (expr
) = 1;
8681 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
8682 if (flags
& TM_STMT_ATTR_RELAXED
)
8683 TRANSACTION_EXPR_RELAXED (ret
) = 1;
8684 TREE_SIDE_EFFECTS (ret
) = 1;
8685 SET_EXPR_LOCATION (ret
, loc
);
8690 init_cp_semantics (void)
8694 /* Build a STATIC_ASSERT for a static assertion with the condition
8695 CONDITION and the message text MESSAGE. LOCATION is the location
8696 of the static assertion in the source code. When MEMBER_P, this
8697 static assertion is a member of a class. */
8699 finish_static_assert (tree condition
, tree message
, location_t location
,
8702 if (message
== NULL_TREE
8703 || message
== error_mark_node
8704 || condition
== NULL_TREE
8705 || condition
== error_mark_node
)
8708 if (check_for_bare_parameter_packs (condition
))
8709 condition
= error_mark_node
;
8711 if (type_dependent_expression_p (condition
)
8712 || value_dependent_expression_p (condition
))
8714 /* We're in a template; build a STATIC_ASSERT and put it in
8718 assertion
= make_node (STATIC_ASSERT
);
8719 STATIC_ASSERT_CONDITION (assertion
) = condition
;
8720 STATIC_ASSERT_MESSAGE (assertion
) = message
;
8721 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
8724 maybe_add_class_template_decl_list (current_class_type
,
8728 add_stmt (assertion
);
8733 /* Fold the expression and convert it to a boolean value. */
8734 condition
= instantiate_non_dependent_expr (condition
);
8735 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
8736 condition
= maybe_constant_value (condition
);
8738 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
8739 /* Do nothing; the condition is satisfied. */
8743 location_t saved_loc
= input_location
;
8745 input_location
= location
;
8746 if (TREE_CODE (condition
) == INTEGER_CST
8747 && integer_zerop (condition
))
8749 int sz
= TREE_INT_CST_LOW (TYPE_SIZE_UNIT
8750 (TREE_TYPE (TREE_TYPE (message
))));
8751 int len
= TREE_STRING_LENGTH (message
) / sz
- 1;
8752 /* Report the error. */
8754 error ("static assertion failed");
8756 error ("static assertion failed: %s",
8757 TREE_STRING_POINTER (message
));
8759 else if (condition
&& condition
!= error_mark_node
)
8761 error ("non-constant condition for static assertion");
8762 if (require_potential_rvalue_constant_expression (condition
))
8763 cxx_constant_value (condition
);
8765 input_location
= saved_loc
;
8769 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
8770 suitable for use as a type-specifier.
8772 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
8773 id-expression or a class member access, FALSE when it was parsed as
8774 a full expression. */
8777 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
8778 tsubst_flags_t complain
)
8780 tree type
= NULL_TREE
;
8782 if (!expr
|| error_operand_p (expr
))
8783 return error_mark_node
;
8786 || TREE_CODE (expr
) == TYPE_DECL
8787 || (TREE_CODE (expr
) == BIT_NOT_EXPR
8788 && TYPE_P (TREE_OPERAND (expr
, 0))))
8790 if (complain
& tf_error
)
8791 error ("argument to decltype must be an expression");
8792 return error_mark_node
;
8795 /* Depending on the resolution of DR 1172, we may later need to distinguish
8796 instantiation-dependent but not type-dependent expressions so that, say,
8797 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
8798 if (instantiation_dependent_uneval_expression_p (expr
))
8800 type
= cxx_make_type (DECLTYPE_TYPE
);
8801 DECLTYPE_TYPE_EXPR (type
) = expr
;
8802 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
8803 = id_expression_or_member_access_p
;
8804 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8809 /* The type denoted by decltype(e) is defined as follows: */
8811 expr
= resolve_nondeduced_context (expr
, complain
);
8813 if (invalid_nonstatic_memfn_p (input_location
, expr
, complain
))
8814 return error_mark_node
;
8816 if (type_unknown_p (expr
))
8818 if (complain
& tf_error
)
8819 error ("decltype cannot resolve address of overloaded function");
8820 return error_mark_node
;
8823 /* To get the size of a static data member declared as an array of
8824 unknown bound, we need to instantiate it. */
8826 && VAR_HAD_UNKNOWN_BOUND (expr
)
8827 && DECL_TEMPLATE_INSTANTIATION (expr
))
8828 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
8830 if (id_expression_or_member_access_p
)
8832 /* If e is an id-expression or a class member access (5.2.5
8833 [expr.ref]), decltype(e) is defined as the type of the entity
8834 named by e. If there is no such entity, or e names a set of
8835 overloaded functions, the program is ill-formed. */
8836 if (identifier_p (expr
))
8837 expr
= lookup_name (expr
);
8839 if (INDIRECT_REF_P (expr
))
8840 /* This can happen when the expression is, e.g., "a.b". Just
8841 look at the underlying operand. */
8842 expr
= TREE_OPERAND (expr
, 0);
8844 if (TREE_CODE (expr
) == OFFSET_REF
8845 || TREE_CODE (expr
) == MEMBER_REF
8846 || TREE_CODE (expr
) == SCOPE_REF
)
8847 /* We're only interested in the field itself. If it is a
8848 BASELINK, we will need to see through it in the next
8850 expr
= TREE_OPERAND (expr
, 1);
8852 if (BASELINK_P (expr
))
8853 /* See through BASELINK nodes to the underlying function. */
8854 expr
= BASELINK_FUNCTIONS (expr
);
8856 switch (TREE_CODE (expr
))
8859 if (DECL_BIT_FIELD_TYPE (expr
))
8861 type
= DECL_BIT_FIELD_TYPE (expr
);
8864 /* Fall through for fields that aren't bitfields. */
8871 case TEMPLATE_PARM_INDEX
:
8872 expr
= mark_type_use (expr
);
8873 type
= TREE_TYPE (expr
);
8877 type
= error_mark_node
;
8882 mark_type_use (expr
);
8883 type
= is_bitfield_expr_with_lowered_type (expr
);
8885 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
8893 /* We can get here when the id-expression refers to an
8894 enumerator or non-type template parameter. */
8895 type
= TREE_TYPE (expr
);
8899 /* Handle instantiated template non-type arguments. */
8900 type
= TREE_TYPE (expr
);
8906 /* Within a lambda-expression:
8908 Every occurrence of decltype((x)) where x is a possibly
8909 parenthesized id-expression that names an entity of
8910 automatic storage duration is treated as if x were
8911 transformed into an access to a corresponding data member
8912 of the closure type that would have been declared if x
8913 were a use of the denoted entity. */
8914 if (outer_automatic_var_p (expr
)
8915 && current_function_decl
8916 && LAMBDA_FUNCTION_P (current_function_decl
))
8917 type
= capture_decltype (expr
);
8918 else if (error_operand_p (expr
))
8919 type
= error_mark_node
;
8920 else if (expr
== current_class_ptr
)
8921 /* If the expression is just "this", we want the
8922 cv-unqualified pointer for the "this" type. */
8923 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
8926 /* Otherwise, where T is the type of e, if e is an lvalue,
8927 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
8928 cp_lvalue_kind clk
= lvalue_kind (expr
);
8929 type
= unlowered_expr_type (expr
);
8930 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
8932 /* For vector types, pick a non-opaque variant. */
8933 if (VECTOR_TYPE_P (type
))
8934 type
= strip_typedefs (type
);
8936 if (clk
!= clk_none
&& !(clk
& clk_class
))
8937 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
8944 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
8945 __has_nothrow_copy, depending on assign_p. */
8948 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
8955 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
8958 fns
= (*CLASSTYPE_METHOD_VEC (type
))[ix
];
8960 else if (TYPE_HAS_COPY_CTOR (type
))
8962 /* If construction of the copy constructor was postponed, create
8964 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
8965 lazily_declare_fn (sfk_copy_constructor
, type
);
8966 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
8967 lazily_declare_fn (sfk_move_constructor
, type
);
8968 fns
= CLASSTYPE_CONSTRUCTORS (type
);
8973 for (; fns
; fns
= OVL_NEXT (fns
))
8975 tree fn
= OVL_CURRENT (fns
);
8979 if (copy_fn_p (fn
) == 0)
8982 else if (copy_fn_p (fn
) <= 0)
8985 maybe_instantiate_noexcept (fn
);
8986 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
8993 /* Actually evaluates the trait. */
8996 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
8998 enum tree_code type_code1
;
9001 type_code1
= TREE_CODE (type1
);
9005 case CPTK_HAS_NOTHROW_ASSIGN
:
9006 type1
= strip_array_types (type1
);
9007 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9008 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
9009 || (CLASS_TYPE_P (type1
)
9010 && classtype_has_nothrow_assign_or_copy_p (type1
,
9013 case CPTK_HAS_TRIVIAL_ASSIGN
:
9014 /* ??? The standard seems to be missing the "or array of such a class
9015 type" wording for this trait. */
9016 type1
= strip_array_types (type1
);
9017 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
9018 && (trivial_type_p (type1
)
9019 || (CLASS_TYPE_P (type1
)
9020 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
9022 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9023 type1
= strip_array_types (type1
);
9024 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
9025 || (CLASS_TYPE_P (type1
)
9026 && (t
= locate_ctor (type1
))
9027 && (maybe_instantiate_noexcept (t
),
9028 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
9030 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9031 type1
= strip_array_types (type1
);
9032 return (trivial_type_p (type1
)
9033 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
9035 case CPTK_HAS_NOTHROW_COPY
:
9036 type1
= strip_array_types (type1
);
9037 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
9038 || (CLASS_TYPE_P (type1
)
9039 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
9041 case CPTK_HAS_TRIVIAL_COPY
:
9042 /* ??? The standard seems to be missing the "or array of such a class
9043 type" wording for this trait. */
9044 type1
= strip_array_types (type1
);
9045 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9046 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
9048 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9049 type1
= strip_array_types (type1
);
9050 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
9051 || (CLASS_TYPE_P (type1
)
9052 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
9054 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9055 return type_has_virtual_destructor (type1
);
9057 case CPTK_IS_ABSTRACT
:
9058 return (ABSTRACT_CLASS_TYPE_P (type1
));
9060 case CPTK_IS_BASE_OF
:
9061 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9062 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9063 || DERIVED_FROM_P (type1
, type2
)));
9066 return (NON_UNION_CLASS_TYPE_P (type1
));
9069 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
9072 return (type_code1
== ENUMERAL_TYPE
);
9075 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
9077 case CPTK_IS_LITERAL_TYPE
:
9078 return (literal_type_p (type1
));
9081 return (pod_type_p (type1
));
9083 case CPTK_IS_POLYMORPHIC
:
9084 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
9086 case CPTK_IS_SAME_AS
:
9087 return same_type_p (type1
, type2
);
9089 case CPTK_IS_STD_LAYOUT
:
9090 return (std_layout_type_p (type1
));
9092 case CPTK_IS_TRIVIAL
:
9093 return (trivial_type_p (type1
));
9095 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9096 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
9098 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9099 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
9101 case CPTK_IS_TRIVIALLY_COPYABLE
:
9102 return (trivially_copyable_p (type1
));
9105 return (type_code1
== UNION_TYPE
);
9113 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
9114 void, or a complete type, returns true, otherwise false. */
9117 check_trait_type (tree type
)
9119 if (type
== NULL_TREE
)
9122 if (TREE_CODE (type
) == TREE_LIST
)
9123 return (check_trait_type (TREE_VALUE (type
))
9124 && check_trait_type (TREE_CHAIN (type
)));
9126 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
9127 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
9130 if (VOID_TYPE_P (type
))
9133 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
9136 /* Process a trait expression. */
9139 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
9141 if (type1
== error_mark_node
9142 || type2
== error_mark_node
)
9143 return error_mark_node
;
9145 if (processing_template_decl
)
9147 tree trait_expr
= make_node (TRAIT_EXPR
);
9148 TREE_TYPE (trait_expr
) = boolean_type_node
;
9149 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
9150 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
9151 TRAIT_EXPR_KIND (trait_expr
) = kind
;
9157 case CPTK_HAS_NOTHROW_ASSIGN
:
9158 case CPTK_HAS_TRIVIAL_ASSIGN
:
9159 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
9160 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
9161 case CPTK_HAS_NOTHROW_COPY
:
9162 case CPTK_HAS_TRIVIAL_COPY
:
9163 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
9164 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
9165 case CPTK_IS_ABSTRACT
:
9168 case CPTK_IS_LITERAL_TYPE
:
9170 case CPTK_IS_POLYMORPHIC
:
9171 case CPTK_IS_STD_LAYOUT
:
9172 case CPTK_IS_TRIVIAL
:
9173 case CPTK_IS_TRIVIALLY_COPYABLE
:
9174 if (!check_trait_type (type1
))
9175 return error_mark_node
;
9178 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
9179 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
9180 if (!check_trait_type (type1
)
9181 || !check_trait_type (type2
))
9182 return error_mark_node
;
9185 case CPTK_IS_BASE_OF
:
9186 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
9187 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
9188 && !complete_type_or_else (type2
, NULL_TREE
))
9189 /* We already issued an error. */
9190 return error_mark_node
;
9196 case CPTK_IS_SAME_AS
:
9203 return (trait_expr_value (kind
, type1
, type2
)
9204 ? boolean_true_node
: boolean_false_node
);
9207 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
9208 which is ignored for C++. */
9211 set_float_const_decimal64 (void)
9216 clear_float_const_decimal64 (void)
9221 float_const_decimal64_p (void)
9227 /* Return true if T designates the implied `this' parameter. */
9230 is_this_parameter (tree t
)
9232 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
9234 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
));
9238 /* Insert the deduced return type for an auto function. */
9241 apply_deduced_return_type (tree fco
, tree return_type
)
9245 if (return_type
== error_mark_node
)
9248 if (LAMBDA_FUNCTION_P (fco
))
9250 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
9251 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
9254 if (DECL_CONV_FN_P (fco
))
9255 DECL_NAME (fco
) = mangle_conv_op_name_for_type (return_type
);
9257 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9259 result
= DECL_RESULT (fco
);
9260 if (result
== NULL_TREE
)
9262 if (TREE_TYPE (result
) == return_type
)
9265 /* We already have a DECL_RESULT from start_preparsed_function.
9266 Now we need to redo the work it and allocate_struct_function
9267 did to reflect the new type. */
9268 gcc_assert (current_function_decl
== fco
);
9269 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9270 TYPE_MAIN_VARIANT (return_type
));
9271 DECL_ARTIFICIAL (result
) = 1;
9272 DECL_IGNORED_P (result
) = 1;
9273 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9276 DECL_RESULT (fco
) = result
;
9278 if (!processing_template_decl
)
9280 if (!VOID_TYPE_P (TREE_TYPE (result
)))
9281 complete_type_or_else (TREE_TYPE (result
), NULL_TREE
);
9282 bool aggr
= aggregate_value_p (result
, fco
);
9283 #ifdef PCC_STATIC_STRUCT_RETURN
9284 cfun
->returns_pcc_struct
= aggr
;
9286 cfun
->returns_struct
= aggr
;
9291 /* DECL is a local variable or parameter from the surrounding scope of a
9292 lambda-expression. Returns the decltype for a use of the capture field
9293 for DECL even if it hasn't been captured yet. */
9296 capture_decltype (tree decl
)
9298 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9299 /* FIXME do lookup instead of list walk? */
9300 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9304 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9306 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9309 error ("%qD is not captured", decl
);
9310 return error_mark_node
;
9313 type
= TREE_TYPE (decl
);
9314 if (TREE_CODE (type
) == REFERENCE_TYPE
9315 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9316 type
= TREE_TYPE (type
);
9319 case CPLD_REFERENCE
:
9320 type
= TREE_TYPE (decl
);
9321 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9322 type
= build_reference_type (TREE_TYPE (decl
));
9329 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9331 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9332 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9334 type
= build_reference_type (type
);
9339 /* Build a unary fold expression of EXPR over OP. If IS_RIGHT is true,
9340 this is a right unary fold. Otherwise it is a left unary fold. */
9343 finish_unary_fold_expr (tree expr
, int op
, tree_code dir
)
9345 // Build a pack expansion (assuming expr has pack type).
9346 if (!uses_parameter_packs (expr
))
9348 error_at (location_of (expr
), "operand of fold expression has no "
9349 "unexpanded parameter packs");
9350 return error_mark_node
;
9352 tree pack
= make_pack_expansion (expr
);
9354 // Build the fold expression.
9355 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9356 tree fold
= build_min (dir
, unknown_type_node
, code
, pack
);
9357 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9362 finish_left_unary_fold_expr (tree expr
, int op
)
9364 return finish_unary_fold_expr (expr
, op
, UNARY_LEFT_FOLD_EXPR
);
9368 finish_right_unary_fold_expr (tree expr
, int op
)
9370 return finish_unary_fold_expr (expr
, op
, UNARY_RIGHT_FOLD_EXPR
);
9373 /* Build a binary fold expression over EXPR1 and EXPR2. The
9374 associativity of the fold is determined by EXPR1 and EXPR2 (whichever
9375 has an unexpanded parameter pack). */
9378 finish_binary_fold_expr (tree pack
, tree init
, int op
, tree_code dir
)
9380 pack
= make_pack_expansion (pack
);
9381 tree code
= build_int_cstu (integer_type_node
, abs (op
));
9382 tree fold
= build_min (dir
, unknown_type_node
, code
, pack
, init
);
9383 FOLD_EXPR_MODIFY_P (fold
) = (op
< 0);
9388 finish_binary_fold_expr (tree expr1
, tree expr2
, int op
)
9390 // Determine which expr has an unexpanded parameter pack and
9391 // set the pack and initial term.
9392 bool pack1
= uses_parameter_packs (expr1
);
9393 bool pack2
= uses_parameter_packs (expr2
);
9394 if (pack1
&& !pack2
)
9395 return finish_binary_fold_expr (expr1
, expr2
, op
, BINARY_RIGHT_FOLD_EXPR
);
9396 else if (pack2
&& !pack1
)
9397 return finish_binary_fold_expr (expr2
, expr1
, op
, BINARY_LEFT_FOLD_EXPR
);
9401 error ("both arguments in binary fold have unexpanded parameter packs");
9403 error ("no unexpanded parameter packs in binary fold");
9405 return error_mark_node
;
9408 #include "gt-cp-semantics.h"