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-2015 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"
33 #include "double-int.h"
42 #include "stor-layout.h"
43 #include "stringpool.h"
45 #include "c-family/c-common.h"
46 #include "c-family/c-objc.h"
47 #include "tree-inline.h"
52 #include "diagnostic.h"
55 #include "plugin-api.h"
56 #include "hard-reg-set.h"
61 #include "tree-iterator.h"
63 #include "hash-table.h"
69 #include "gomp-constants.h"
71 /* There routines provide a modular interface to perform many parsing
72 operations. They may therefore be used during actual parsing, or
73 during template instantiation, which may be regarded as a
74 degenerate form of parsing. */
76 static tree
maybe_convert_cond (tree
);
77 static tree
finalize_nrv_r (tree
*, int *, void *);
78 static tree
capture_decltype (tree
);
81 /* Deferred Access Checking Overview
82 ---------------------------------
84 Most C++ expressions and declarations require access checking
85 to be performed during parsing. However, in several cases,
86 this has to be treated differently.
88 For member declarations, access checking has to be deferred
89 until more information about the declaration is known. For
101 When we are parsing the function return type `A::X', we don't
102 really know if this is allowed until we parse the function name.
104 Furthermore, some contexts require that access checking is
105 never performed at all. These include class heads, and template
108 Typical use of access checking functions is described here:
110 1. When we enter a context that requires certain access checking
111 mode, the function `push_deferring_access_checks' is called with
112 DEFERRING argument specifying the desired mode. Access checking
113 may be performed immediately (dk_no_deferred), deferred
114 (dk_deferred), or not performed (dk_no_check).
116 2. When a declaration such as a type, or a variable, is encountered,
117 the function `perform_or_defer_access_check' is called. It
118 maintains a vector of all deferred checks.
120 3. The global `current_class_type' or `current_function_decl' is then
121 setup by the parser. `enforce_access' relies on these information
124 4. Upon exiting the context mentioned in step 1,
125 `perform_deferred_access_checks' is called to check all declaration
126 stored in the vector. `pop_deferring_access_checks' is then
127 called to restore the previous access checking mode.
129 In case of parsing error, we simply call `pop_deferring_access_checks'
130 without `perform_deferred_access_checks'. */
132 typedef struct GTY(()) deferred_access
{
133 /* A vector representing name-lookups for which we have deferred
134 checking access controls. We cannot check the accessibility of
135 names used in a decl-specifier-seq until we know what is being
136 declared because code like:
143 A::B* A::f() { return 0; }
145 is valid, even though `A::B' is not generally accessible. */
146 vec
<deferred_access_check
, va_gc
> * GTY(()) deferred_access_checks
;
148 /* The current mode of access checks. */
149 enum deferring_kind deferring_access_checks_kind
;
153 /* Data for deferred access checking. */
154 static GTY(()) vec
<deferred_access
, va_gc
> *deferred_access_stack
;
155 static GTY(()) unsigned deferred_access_no_check
;
157 /* Save the current deferred access states and start deferred
158 access checking iff DEFER_P is true. */
161 push_deferring_access_checks (deferring_kind deferring
)
163 /* For context like template instantiation, access checking
164 disabling applies to all nested context. */
165 if (deferred_access_no_check
|| deferring
== dk_no_check
)
166 deferred_access_no_check
++;
169 deferred_access e
= {NULL
, deferring
};
170 vec_safe_push (deferred_access_stack
, e
);
174 /* Save the current deferred access states and start deferred access
175 checking, continuing the set of deferred checks in CHECKS. */
178 reopen_deferring_access_checks (vec
<deferred_access_check
, va_gc
> * checks
)
180 push_deferring_access_checks (dk_deferred
);
181 if (!deferred_access_no_check
)
182 deferred_access_stack
->last().deferred_access_checks
= checks
;
185 /* Resume deferring access checks again after we stopped doing
189 resume_deferring_access_checks (void)
191 if (!deferred_access_no_check
)
192 deferred_access_stack
->last().deferring_access_checks_kind
= dk_deferred
;
195 /* Stop deferring access checks. */
198 stop_deferring_access_checks (void)
200 if (!deferred_access_no_check
)
201 deferred_access_stack
->last().deferring_access_checks_kind
= dk_no_deferred
;
204 /* Discard the current deferred access checks and restore the
208 pop_deferring_access_checks (void)
210 if (deferred_access_no_check
)
211 deferred_access_no_check
--;
213 deferred_access_stack
->pop ();
216 /* Returns a TREE_LIST representing the deferred checks.
217 The TREE_PURPOSE of each node is the type through which the
218 access occurred; the TREE_VALUE is the declaration named.
221 vec
<deferred_access_check
, va_gc
> *
222 get_deferred_access_checks (void)
224 if (deferred_access_no_check
)
227 return (deferred_access_stack
->last().deferred_access_checks
);
230 /* Take current deferred checks and combine with the
231 previous states if we also defer checks previously.
232 Otherwise perform checks now. */
235 pop_to_parent_deferring_access_checks (void)
237 if (deferred_access_no_check
)
238 deferred_access_no_check
--;
241 vec
<deferred_access_check
, va_gc
> *checks
;
242 deferred_access
*ptr
;
244 checks
= (deferred_access_stack
->last ().deferred_access_checks
);
246 deferred_access_stack
->pop ();
247 ptr
= &deferred_access_stack
->last ();
248 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
251 perform_access_checks (checks
, tf_warning_or_error
);
255 /* Merge with parent. */
257 deferred_access_check
*chk
, *probe
;
259 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
261 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, j
, probe
)
263 if (probe
->binfo
== chk
->binfo
&&
264 probe
->decl
== chk
->decl
&&
265 probe
->diag_decl
== chk
->diag_decl
)
268 /* Insert into parent's checks. */
269 vec_safe_push (ptr
->deferred_access_checks
, *chk
);
276 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
277 is the BINFO indicating the qualifying scope used to access the
278 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
279 or we aren't in SFINAE context or all the checks succeed return TRUE,
283 perform_access_checks (vec
<deferred_access_check
, va_gc
> *checks
,
284 tsubst_flags_t complain
)
287 deferred_access_check
*chk
;
288 location_t loc
= input_location
;
294 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
296 input_location
= chk
->loc
;
297 ok
&= enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
, complain
);
300 input_location
= loc
;
301 return (complain
& tf_error
) ? true : ok
;
304 /* Perform the deferred access checks.
306 After performing the checks, we still have to keep the list
307 `deferred_access_stack->deferred_access_checks' since we may want
308 to check access for them again later in a different context.
315 A::X A::a, x; // No error for `A::a', error for `x'
317 We have to perform deferred access of `A::X', first with `A::a',
318 next with `x'. Return value like perform_access_checks above. */
321 perform_deferred_access_checks (tsubst_flags_t complain
)
323 return perform_access_checks (get_deferred_access_checks (), complain
);
326 /* Defer checking the accessibility of DECL, when looked up in
327 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
328 Return value like perform_access_checks above. */
331 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
,
332 tsubst_flags_t complain
)
335 deferred_access
*ptr
;
336 deferred_access_check
*chk
;
339 /* Exit if we are in a context that no access checking is performed.
341 if (deferred_access_no_check
)
344 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
346 ptr
= &deferred_access_stack
->last ();
348 /* If we are not supposed to defer access checks, just check now. */
349 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
351 bool ok
= enforce_access (binfo
, decl
, diag_decl
, complain
);
352 return (complain
& tf_error
) ? true : ok
;
355 /* See if we are already going to perform this check. */
356 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, i
, chk
)
358 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
359 chk
->diag_decl
== diag_decl
)
364 /* If not, record the check. */
365 deferred_access_check new_access
= {binfo
, decl
, diag_decl
, input_location
};
366 vec_safe_push (ptr
->deferred_access_checks
, new_access
);
371 /* Returns nonzero if the current statement is a full expression,
372 i.e. temporaries created during that statement should be destroyed
373 at the end of the statement. */
376 stmts_are_full_exprs_p (void)
378 return current_stmt_tree ()->stmts_are_full_exprs_p
;
381 /* T is a statement. Add it to the statement-tree. This is the C++
382 version. The C/ObjC frontends have a slightly different version of
388 enum tree_code code
= TREE_CODE (t
);
390 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
392 if (!EXPR_HAS_LOCATION (t
))
393 SET_EXPR_LOCATION (t
, input_location
);
395 /* When we expand a statement-tree, we must know whether or not the
396 statements are full-expressions. We record that fact here. */
397 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
400 if (code
== LABEL_EXPR
|| code
== CASE_LABEL_EXPR
)
401 STATEMENT_LIST_HAS_LABEL (cur_stmt_list
) = 1;
403 /* Add T to the statement-tree. Non-side-effect statements need to be
404 recorded during statement expressions. */
405 gcc_checking_assert (!stmt_list_stack
->is_empty ());
406 append_to_statement_list_force (t
, &cur_stmt_list
);
411 /* Returns the stmt_tree to which statements are currently being added. */
414 current_stmt_tree (void)
417 ? &cfun
->language
->base
.x_stmt_tree
418 : &scope_chain
->x_stmt_tree
);
421 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
424 maybe_cleanup_point_expr (tree expr
)
426 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
427 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
431 /* Like maybe_cleanup_point_expr except have the type of the new expression be
432 void so we don't need to create a temporary variable to hold the inner
433 expression. The reason why we do this is because the original type might be
434 an aggregate and we cannot create a temporary variable for that type. */
437 maybe_cleanup_point_expr_void (tree expr
)
439 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
440 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
446 /* Create a declaration statement for the declaration given by the DECL. */
449 add_decl_expr (tree decl
)
451 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
452 if (DECL_INITIAL (decl
)
453 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
454 r
= maybe_cleanup_point_expr_void (r
);
458 /* Finish a scope. */
461 do_poplevel (tree stmt_list
)
465 if (stmts_are_full_exprs_p ())
466 block
= poplevel (kept_level_p (), 1, 0);
468 stmt_list
= pop_stmt_list (stmt_list
);
470 if (!processing_template_decl
)
472 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
473 /* ??? See c_end_compound_stmt re statement expressions. */
479 /* Begin a new scope. */
482 do_pushlevel (scope_kind sk
)
484 tree ret
= push_stmt_list ();
485 if (stmts_are_full_exprs_p ())
486 begin_scope (sk
, NULL
);
490 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
491 when the current scope is exited. EH_ONLY is true when this is not
492 meant to apply to normal control flow transfer. */
495 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
497 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
498 CLEANUP_EH_ONLY (stmt
) = eh_only
;
500 CLEANUP_BODY (stmt
) = push_stmt_list ();
503 /* Simple infinite loop tracking for -Wreturn-type. We keep a stack of all
504 the current loops, represented by 'NULL_TREE' if we've seen a possible
505 exit, and 'error_mark_node' if not. This is currently used only to
506 suppress the warning about a function with no return statements, and
507 therefore we don't bother noting returns as possible exits. We also
508 don't bother with gotos. */
511 begin_maybe_infinite_loop (tree cond
)
513 /* Only track this while parsing a function, not during instantiation. */
514 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
515 && !processing_template_decl
))
517 bool maybe_infinite
= true;
520 cond
= fold_non_dependent_expr (cond
);
521 maybe_infinite
= integer_nonzerop (cond
);
523 vec_safe_push (cp_function_chain
->infinite_loops
,
524 maybe_infinite
? error_mark_node
: NULL_TREE
);
528 /* A break is a possible exit for the current loop. */
531 break_maybe_infinite_loop (void)
535 cp_function_chain
->infinite_loops
->last() = NULL_TREE
;
538 /* If we reach the end of the loop without seeing a possible exit, we have
542 end_maybe_infinite_loop (tree cond
)
544 if (!cfun
|| (DECL_TEMPLATE_INSTANTIATION (current_function_decl
)
545 && !processing_template_decl
))
547 tree current
= cp_function_chain
->infinite_loops
->pop();
548 if (current
!= NULL_TREE
)
550 cond
= fold_non_dependent_expr (cond
);
551 if (integer_nonzerop (cond
))
552 current_function_infinite_loop
= 1;
557 /* Begin a conditional that might contain a declaration. When generating
558 normal code, we want the declaration to appear before the statement
559 containing the conditional. When generating template code, we want the
560 conditional to be rendered as the raw DECL_EXPR. */
563 begin_cond (tree
*cond_p
)
565 if (processing_template_decl
)
566 *cond_p
= push_stmt_list ();
569 /* Finish such a conditional. */
572 finish_cond (tree
*cond_p
, tree expr
)
574 if (processing_template_decl
)
576 tree cond
= pop_stmt_list (*cond_p
);
578 if (expr
== NULL_TREE
)
579 /* Empty condition in 'for'. */
580 gcc_assert (empty_expr_stmt_p (cond
));
581 else if (check_for_bare_parameter_packs (expr
))
582 expr
= error_mark_node
;
583 else if (!empty_expr_stmt_p (cond
))
584 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), cond
, expr
);
589 /* If *COND_P specifies a conditional with a declaration, transform the
592 for (; A x = 42;) { }
594 while (true) { A x = 42; if (!x) break; }
595 for (;;) { A x = 42; if (!x) break; }
596 The statement list for BODY will be empty if the conditional did
597 not declare anything. */
600 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
604 if (!TREE_SIDE_EFFECTS (body
))
608 *cond_p
= boolean_true_node
;
610 if_stmt
= begin_if_stmt ();
611 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
612 finish_if_stmt_cond (cond
, if_stmt
);
613 finish_break_stmt ();
614 finish_then_clause (if_stmt
);
615 finish_if_stmt (if_stmt
);
618 /* Finish a goto-statement. */
621 finish_goto_stmt (tree destination
)
623 if (identifier_p (destination
))
624 destination
= lookup_label (destination
);
626 /* We warn about unused labels with -Wunused. That means we have to
627 mark the used labels as used. */
628 if (TREE_CODE (destination
) == LABEL_DECL
)
629 TREE_USED (destination
) = 1;
632 if (check_no_cilk (destination
,
633 "Cilk array notation cannot be used as a computed goto expression",
634 "%<_Cilk_spawn%> statement cannot be used as a computed goto expression"))
635 destination
= error_mark_node
;
636 destination
= mark_rvalue_use (destination
);
637 if (!processing_template_decl
)
639 destination
= cp_convert (ptr_type_node
, destination
,
640 tf_warning_or_error
);
641 if (error_operand_p (destination
))
644 = fold_build_cleanup_point_expr (TREE_TYPE (destination
),
649 check_goto (destination
);
651 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
654 /* COND is the condition-expression for an if, while, etc.,
655 statement. Convert it to a boolean value, if appropriate.
656 In addition, verify sequence points if -Wsequence-point is enabled. */
659 maybe_convert_cond (tree cond
)
661 /* Empty conditions remain empty. */
665 /* Wait until we instantiate templates before doing conversion. */
666 if (processing_template_decl
)
669 if (warn_sequence_point
)
670 verify_sequence_points (cond
);
672 /* Do the conversion. */
673 cond
= convert_from_reference (cond
);
675 if (TREE_CODE (cond
) == MODIFY_EXPR
676 && !TREE_NO_WARNING (cond
)
679 warning (OPT_Wparentheses
,
680 "suggest parentheses around assignment used as truth value");
681 TREE_NO_WARNING (cond
) = 1;
684 return condition_conversion (cond
);
687 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
690 finish_expr_stmt (tree expr
)
694 if (expr
!= NULL_TREE
)
696 if (!processing_template_decl
)
698 if (warn_sequence_point
)
699 verify_sequence_points (expr
);
700 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
702 else if (!type_dependent_expression_p (expr
))
703 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
704 tf_warning_or_error
);
706 if (check_for_bare_parameter_packs (expr
))
707 expr
= error_mark_node
;
709 /* Simplification of inner statement expressions, compound exprs,
710 etc can result in us already having an EXPR_STMT. */
711 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
713 if (TREE_CODE (expr
) != EXPR_STMT
)
714 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
715 expr
= maybe_cleanup_point_expr_void (expr
);
725 /* Begin an if-statement. Returns a newly created IF_STMT if
732 scope
= do_pushlevel (sk_cond
);
733 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
734 NULL_TREE
, NULL_TREE
, scope
);
735 begin_cond (&IF_COND (r
));
739 /* Process the COND of an if-statement, which may be given by
743 finish_if_stmt_cond (tree cond
, tree if_stmt
)
745 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
747 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
750 /* Finish the then-clause of an if-statement, which may be given by
754 finish_then_clause (tree if_stmt
)
756 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
760 /* Begin the else-clause of an if-statement. */
763 begin_else_clause (tree if_stmt
)
765 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
768 /* Finish the else-clause of an if-statement, which may be given by
772 finish_else_clause (tree if_stmt
)
774 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
777 /* Finish an if-statement. */
780 finish_if_stmt (tree if_stmt
)
782 tree scope
= IF_SCOPE (if_stmt
);
783 IF_SCOPE (if_stmt
) = NULL
;
784 add_stmt (do_poplevel (scope
));
787 /* Begin a while-statement. Returns a newly created WHILE_STMT if
791 begin_while_stmt (void)
794 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
796 WHILE_BODY (r
) = do_pushlevel (sk_block
);
797 begin_cond (&WHILE_COND (r
));
801 /* Process the COND of a while-statement, which may be given by
805 finish_while_stmt_cond (tree cond
, tree while_stmt
, bool ivdep
)
807 if (check_no_cilk (cond
,
808 "Cilk array notation cannot be used as a condition for while statement",
809 "%<_Cilk_spawn%> statement cannot be used as a condition for while statement"))
810 cond
= error_mark_node
;
811 cond
= maybe_convert_cond (cond
);
812 finish_cond (&WHILE_COND (while_stmt
), cond
);
813 begin_maybe_infinite_loop (cond
);
814 if (ivdep
&& cond
!= error_mark_node
)
815 WHILE_COND (while_stmt
) = build2 (ANNOTATE_EXPR
,
816 TREE_TYPE (WHILE_COND (while_stmt
)),
817 WHILE_COND (while_stmt
),
818 build_int_cst (integer_type_node
,
819 annot_expr_ivdep_kind
));
820 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
823 /* Finish a while-statement, which may be given by WHILE_STMT. */
826 finish_while_stmt (tree while_stmt
)
828 end_maybe_infinite_loop (boolean_true_node
);
829 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
832 /* Begin a do-statement. Returns a newly created DO_STMT if
838 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
839 begin_maybe_infinite_loop (boolean_true_node
);
841 DO_BODY (r
) = push_stmt_list ();
845 /* Finish the body of a do-statement, which may be given by DO_STMT. */
848 finish_do_body (tree do_stmt
)
850 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
852 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
853 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
855 if (IS_EMPTY_STMT (body
))
856 warning (OPT_Wempty_body
,
857 "suggest explicit braces around empty body in %<do%> statement");
860 /* Finish a do-statement, which may be given by DO_STMT, and whose
861 COND is as indicated. */
864 finish_do_stmt (tree cond
, tree do_stmt
, bool ivdep
)
866 if (check_no_cilk (cond
,
867 "Cilk array notation cannot be used as a condition for a do-while statement",
868 "%<_Cilk_spawn%> statement cannot be used as a condition for a do-while statement"))
869 cond
= error_mark_node
;
870 cond
= maybe_convert_cond (cond
);
871 end_maybe_infinite_loop (cond
);
872 if (ivdep
&& cond
!= error_mark_node
)
873 cond
= build2 (ANNOTATE_EXPR
, TREE_TYPE (cond
), cond
,
874 build_int_cst (integer_type_node
, annot_expr_ivdep_kind
));
875 DO_COND (do_stmt
) = cond
;
878 /* Finish a return-statement. The EXPRESSION returned, if any, is as
882 finish_return_stmt (tree expr
)
887 expr
= check_return_expr (expr
, &no_warning
);
889 if (error_operand_p (expr
)
890 || (flag_openmp
&& !check_omp_return ()))
892 /* Suppress -Wreturn-type for this function. */
893 if (warn_return_type
)
894 TREE_NO_WARNING (current_function_decl
) = true;
895 return error_mark_node
;
898 if (!processing_template_decl
)
900 if (warn_sequence_point
)
901 verify_sequence_points (expr
);
903 if (DECL_DESTRUCTOR_P (current_function_decl
)
904 || (DECL_CONSTRUCTOR_P (current_function_decl
)
905 && targetm
.cxx
.cdtor_returns_this ()))
907 /* Similarly, all destructors must run destructors for
908 base-classes before returning. So, all returns in a
909 destructor get sent to the DTOR_LABEL; finish_function emits
910 code to return a value there. */
911 return finish_goto_stmt (cdtor_label
);
915 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
916 TREE_NO_WARNING (r
) |= no_warning
;
917 r
= maybe_cleanup_point_expr_void (r
);
923 /* Begin the scope of a for-statement or a range-for-statement.
924 Both the returned trees are to be used in a call to
925 begin_for_stmt or begin_range_for_stmt. */
928 begin_for_scope (tree
*init
)
930 tree scope
= NULL_TREE
;
931 if (flag_new_for_scope
> 0)
932 scope
= do_pushlevel (sk_for
);
934 if (processing_template_decl
)
935 *init
= push_stmt_list ();
942 /* Begin a for-statement. Returns a new FOR_STMT.
943 SCOPE and INIT should be the return of begin_for_scope,
947 begin_for_stmt (tree scope
, tree init
)
951 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
952 NULL_TREE
, NULL_TREE
, NULL_TREE
);
954 if (scope
== NULL_TREE
)
956 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
958 scope
= begin_for_scope (&init
);
960 FOR_INIT_STMT (r
) = init
;
961 FOR_SCOPE (r
) = scope
;
966 /* Finish the for-init-statement of a for-statement, which may be
967 given by FOR_STMT. */
970 finish_for_init_stmt (tree for_stmt
)
972 if (processing_template_decl
)
973 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
975 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
976 begin_cond (&FOR_COND (for_stmt
));
979 /* Finish the COND of a for-statement, which may be given by
983 finish_for_cond (tree cond
, tree for_stmt
, bool ivdep
)
985 if (check_no_cilk (cond
,
986 "Cilk array notation cannot be used in a condition for a for-loop",
987 "%<_Cilk_spawn%> statement cannot be used in a condition for a for-loop"))
988 cond
= error_mark_node
;
989 cond
= maybe_convert_cond (cond
);
990 finish_cond (&FOR_COND (for_stmt
), cond
);
991 begin_maybe_infinite_loop (cond
);
992 if (ivdep
&& cond
!= error_mark_node
)
993 FOR_COND (for_stmt
) = build2 (ANNOTATE_EXPR
,
994 TREE_TYPE (FOR_COND (for_stmt
)),
996 build_int_cst (integer_type_node
,
997 annot_expr_ivdep_kind
));
998 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
1001 /* Finish the increment-EXPRESSION in a for-statement, which may be
1002 given by FOR_STMT. */
1005 finish_for_expr (tree expr
, tree for_stmt
)
1009 /* If EXPR is an overloaded function, issue an error; there is no
1010 context available to use to perform overload resolution. */
1011 if (type_unknown_p (expr
))
1013 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
1014 expr
= error_mark_node
;
1016 if (!processing_template_decl
)
1018 if (warn_sequence_point
)
1019 verify_sequence_points (expr
);
1020 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
1021 tf_warning_or_error
);
1023 else if (!type_dependent_expression_p (expr
))
1024 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
1025 tf_warning_or_error
);
1026 expr
= maybe_cleanup_point_expr_void (expr
);
1027 if (check_for_bare_parameter_packs (expr
))
1028 expr
= error_mark_node
;
1029 FOR_EXPR (for_stmt
) = expr
;
1032 /* Finish the body of a for-statement, which may be given by
1033 FOR_STMT. The increment-EXPR for the loop must be
1035 It can also finish RANGE_FOR_STMT. */
1038 finish_for_stmt (tree for_stmt
)
1040 end_maybe_infinite_loop (boolean_true_node
);
1042 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
1043 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
1045 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
1047 /* Pop the scope for the body of the loop. */
1048 if (flag_new_for_scope
> 0)
1051 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
1052 ? &RANGE_FOR_SCOPE (for_stmt
)
1053 : &FOR_SCOPE (for_stmt
));
1056 add_stmt (do_poplevel (scope
));
1060 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
1061 SCOPE and INIT should be the return of begin_for_scope,
1063 To finish it call finish_for_stmt(). */
1066 begin_range_for_stmt (tree scope
, tree init
)
1070 begin_maybe_infinite_loop (boolean_false_node
);
1072 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
1073 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1075 if (scope
== NULL_TREE
)
1077 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
1079 scope
= begin_for_scope (&init
);
1082 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
1085 pop_stmt_list (init
);
1086 RANGE_FOR_SCOPE (r
) = scope
;
1091 /* Finish the head of a range-based for statement, which may
1092 be given by RANGE_FOR_STMT. DECL must be the declaration
1093 and EXPR must be the loop expression. */
1096 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
1098 RANGE_FOR_DECL (range_for_stmt
) = decl
;
1099 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
1100 add_stmt (range_for_stmt
);
1101 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
1104 /* Finish a break-statement. */
1107 finish_break_stmt (void)
1109 /* In switch statements break is sometimes stylistically used after
1110 a return statement. This can lead to spurious warnings about
1111 control reaching the end of a non-void function when it is
1112 inlined. Note that we are calling block_may_fallthru with
1113 language specific tree nodes; this works because
1114 block_may_fallthru returns true when given something it does not
1116 if (!block_may_fallthru (cur_stmt_list
))
1118 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1121 /* Finish a continue-statement. */
1124 finish_continue_stmt (void)
1126 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1129 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1133 begin_switch_stmt (void)
1137 scope
= do_pushlevel (sk_cond
);
1138 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1140 begin_cond (&SWITCH_STMT_COND (r
));
1145 /* Finish the cond of a switch-statement. */
1148 finish_switch_cond (tree cond
, tree switch_stmt
)
1150 tree orig_type
= NULL
;
1152 if (check_no_cilk (cond
,
1153 "Cilk array notation cannot be used as a condition for switch statement",
1154 "%<_Cilk_spawn%> statement cannot be used as a condition for switch statement"))
1155 cond
= error_mark_node
;
1157 if (!processing_template_decl
)
1159 /* Convert the condition to an integer or enumeration type. */
1160 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1161 if (cond
== NULL_TREE
)
1163 error ("switch quantity not an integer");
1164 cond
= error_mark_node
;
1166 /* We want unlowered type here to handle enum bit-fields. */
1167 orig_type
= unlowered_expr_type (cond
);
1168 if (TREE_CODE (orig_type
) != ENUMERAL_TYPE
)
1169 orig_type
= TREE_TYPE (cond
);
1170 if (cond
!= error_mark_node
)
1172 /* Warn if the condition has boolean value. */
1173 if (TREE_CODE (orig_type
) == BOOLEAN_TYPE
)
1174 warning_at (input_location
, OPT_Wswitch_bool
,
1175 "switch condition has type bool");
1179 Integral promotions are performed. */
1180 cond
= perform_integral_promotions (cond
);
1181 cond
= maybe_cleanup_point_expr (cond
);
1184 if (check_for_bare_parameter_packs (cond
))
1185 cond
= error_mark_node
;
1186 else if (!processing_template_decl
&& warn_sequence_point
)
1187 verify_sequence_points (cond
);
1189 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1190 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1191 add_stmt (switch_stmt
);
1192 push_switch (switch_stmt
);
1193 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1196 /* Finish the body of a switch-statement, which may be given by
1197 SWITCH_STMT. The COND to switch on is indicated. */
1200 finish_switch_stmt (tree switch_stmt
)
1204 SWITCH_STMT_BODY (switch_stmt
) =
1205 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1208 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1209 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1210 add_stmt (do_poplevel (scope
));
1213 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1217 begin_try_block (void)
1219 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1221 TRY_STMTS (r
) = push_stmt_list ();
1225 /* Likewise, for a function-try-block. The block returned in
1226 *COMPOUND_STMT is an artificial outer scope, containing the
1227 function-try-block. */
1230 begin_function_try_block (tree
*compound_stmt
)
1233 /* This outer scope does not exist in the C++ standard, but we need
1234 a place to put __FUNCTION__ and similar variables. */
1235 *compound_stmt
= begin_compound_stmt (0);
1236 r
= begin_try_block ();
1237 FN_TRY_BLOCK_P (r
) = 1;
1241 /* Finish a try-block, which may be given by TRY_BLOCK. */
1244 finish_try_block (tree try_block
)
1246 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1247 TRY_HANDLERS (try_block
) = push_stmt_list ();
1250 /* Finish the body of a cleanup try-block, which may be given by
1254 finish_cleanup_try_block (tree try_block
)
1256 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1259 /* Finish an implicitly generated try-block, with a cleanup is given
1263 finish_cleanup (tree cleanup
, tree try_block
)
1265 TRY_HANDLERS (try_block
) = cleanup
;
1266 CLEANUP_P (try_block
) = 1;
1269 /* Likewise, for a function-try-block. */
1272 finish_function_try_block (tree try_block
)
1274 finish_try_block (try_block
);
1275 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1276 the try block, but moving it inside. */
1277 in_function_try_handler
= 1;
1280 /* Finish a handler-sequence for a try-block, which may be given by
1284 finish_handler_sequence (tree try_block
)
1286 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1287 check_handlers (TRY_HANDLERS (try_block
));
1290 /* Finish the handler-seq for a function-try-block, given by
1291 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1292 begin_function_try_block. */
1295 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1297 in_function_try_handler
= 0;
1298 finish_handler_sequence (try_block
);
1299 finish_compound_stmt (compound_stmt
);
1302 /* Begin a handler. Returns a HANDLER if appropriate. */
1305 begin_handler (void)
1309 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1312 /* Create a binding level for the eh_info and the exception object
1314 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1319 /* Finish the handler-parameters for a handler, which may be given by
1320 HANDLER. DECL is the declaration for the catch parameter, or NULL
1321 if this is a `catch (...)' clause. */
1324 finish_handler_parms (tree decl
, tree handler
)
1326 tree type
= NULL_TREE
;
1327 if (processing_template_decl
)
1331 decl
= pushdecl (decl
);
1332 decl
= push_template_decl (decl
);
1333 HANDLER_PARMS (handler
) = decl
;
1334 type
= TREE_TYPE (decl
);
1338 type
= expand_start_catch_block (decl
);
1339 HANDLER_TYPE (handler
) = type
;
1342 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1343 the return value from the matching call to finish_handler_parms. */
1346 finish_handler (tree handler
)
1348 if (!processing_template_decl
)
1349 expand_end_catch_block ();
1350 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1353 /* Begin a compound statement. FLAGS contains some bits that control the
1354 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1355 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1356 block of a function. If BCS_TRY_BLOCK is set, this is the block
1357 created on behalf of a TRY statement. Returns a token to be passed to
1358 finish_compound_stmt. */
1361 begin_compound_stmt (unsigned int flags
)
1365 if (flags
& BCS_NO_SCOPE
)
1367 r
= push_stmt_list ();
1368 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1370 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1371 But, if it's a statement-expression with a scopeless block, there's
1372 nothing to keep, and we don't want to accidentally keep a block
1373 *inside* the scopeless block. */
1374 keep_next_level (false);
1377 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1379 /* When processing a template, we need to remember where the braces were,
1380 so that we can set up identical scopes when instantiating the template
1381 later. BIND_EXPR is a handy candidate for this.
1382 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1383 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1384 processing templates. */
1385 if (processing_template_decl
)
1387 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1388 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1389 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1390 TREE_SIDE_EFFECTS (r
) = 1;
1396 /* Finish a compound-statement, which is given by STMT. */
1399 finish_compound_stmt (tree stmt
)
1401 if (TREE_CODE (stmt
) == BIND_EXPR
)
1403 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1404 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1405 discard the BIND_EXPR so it can be merged with the containing
1407 if (TREE_CODE (body
) == STATEMENT_LIST
1408 && STATEMENT_LIST_HEAD (body
) == NULL
1409 && !BIND_EXPR_BODY_BLOCK (stmt
)
1410 && !BIND_EXPR_TRY_BLOCK (stmt
))
1413 BIND_EXPR_BODY (stmt
) = body
;
1415 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1416 stmt
= pop_stmt_list (stmt
);
1419 /* Destroy any ObjC "super" receivers that may have been
1421 objc_clear_super_receiver ();
1423 stmt
= do_poplevel (stmt
);
1426 /* ??? See c_end_compound_stmt wrt statement expressions. */
1430 /* Finish an asm-statement, whose components are a STRING, some
1431 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1432 LABELS. Also note whether the asm-statement should be
1433 considered volatile. */
1436 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1437 tree input_operands
, tree clobbers
, tree labels
)
1441 int ninputs
= list_length (input_operands
);
1442 int noutputs
= list_length (output_operands
);
1444 if (!processing_template_decl
)
1446 const char *constraint
;
1447 const char **oconstraints
;
1448 bool allows_mem
, allows_reg
, is_inout
;
1452 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1454 string
= resolve_asm_operand_names (string
, output_operands
,
1455 input_operands
, labels
);
1457 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1459 operand
= TREE_VALUE (t
);
1461 /* ??? Really, this should not be here. Users should be using a
1462 proper lvalue, dammit. But there's a long history of using
1463 casts in the output operands. In cases like longlong.h, this
1464 becomes a primitive form of typechecking -- if the cast can be
1465 removed, then the output operand had a type of the proper width;
1466 otherwise we'll get an error. Gross, but ... */
1467 STRIP_NOPS (operand
);
1469 operand
= mark_lvalue_use (operand
);
1471 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1472 operand
= error_mark_node
;
1474 if (operand
!= error_mark_node
1475 && (TREE_READONLY (operand
)
1476 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1477 /* Functions are not modifiable, even though they are
1479 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1480 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1481 /* If it's an aggregate and any field is const, then it is
1482 effectively const. */
1483 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1484 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1485 cxx_readonly_error (operand
, lv_asm
);
1487 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1488 oconstraints
[i
] = constraint
;
1490 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1491 &allows_mem
, &allows_reg
, &is_inout
))
1493 /* If the operand is going to end up in memory,
1494 mark it addressable. */
1495 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1496 operand
= error_mark_node
;
1499 operand
= error_mark_node
;
1501 TREE_VALUE (t
) = operand
;
1504 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1506 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1507 bool constraint_parsed
1508 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1509 oconstraints
, &allows_mem
, &allows_reg
);
1510 /* If the operand is going to end up in memory, don't call
1511 decay_conversion. */
1512 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1513 operand
= mark_lvalue_use (TREE_VALUE (t
));
1515 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1517 /* If the type of the operand hasn't been determined (e.g.,
1518 because it involves an overloaded function), then issue
1519 an error message. There's no context available to
1520 resolve the overloading. */
1521 if (TREE_TYPE (operand
) == unknown_type_node
)
1523 error ("type of asm operand %qE could not be determined",
1525 operand
= error_mark_node
;
1528 if (constraint_parsed
)
1530 /* If the operand is going to end up in memory,
1531 mark it addressable. */
1532 if (!allows_reg
&& allows_mem
)
1534 /* Strip the nops as we allow this case. FIXME, this really
1535 should be rejected or made deprecated. */
1536 STRIP_NOPS (operand
);
1537 if (!cxx_mark_addressable (operand
))
1538 operand
= error_mark_node
;
1540 else if (!allows_reg
&& !allows_mem
)
1542 /* If constraint allows neither register nor memory,
1543 try harder to get a constant. */
1544 tree constop
= maybe_constant_value (operand
);
1545 if (TREE_CONSTANT (constop
))
1550 operand
= error_mark_node
;
1552 TREE_VALUE (t
) = operand
;
1556 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1557 output_operands
, input_operands
,
1559 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1560 r
= maybe_cleanup_point_expr_void (r
);
1561 return add_stmt (r
);
1564 /* Finish a label with the indicated NAME. Returns the new label. */
1567 finish_label_stmt (tree name
)
1569 tree decl
= define_label (input_location
, name
);
1571 if (decl
== error_mark_node
)
1572 return error_mark_node
;
1574 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1579 /* Finish a series of declarations for local labels. G++ allows users
1580 to declare "local" labels, i.e., labels with scope. This extension
1581 is useful when writing code involving statement-expressions. */
1584 finish_label_decl (tree name
)
1586 if (!at_function_scope_p ())
1588 error ("__label__ declarations are only allowed in function scopes");
1592 add_decl_expr (declare_local_label (name
));
1595 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1598 finish_decl_cleanup (tree decl
, tree cleanup
)
1600 push_cleanup (decl
, cleanup
, false);
1603 /* If the current scope exits with an exception, run CLEANUP. */
1606 finish_eh_cleanup (tree cleanup
)
1608 push_cleanup (NULL
, cleanup
, true);
1611 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1612 order they were written by the user. Each node is as for
1613 emit_mem_initializers. */
1616 finish_mem_initializers (tree mem_inits
)
1618 /* Reorder the MEM_INITS so that they are in the order they appeared
1619 in the source program. */
1620 mem_inits
= nreverse (mem_inits
);
1622 if (processing_template_decl
)
1626 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1628 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1629 check for bare parameter packs in the TREE_VALUE, because
1630 any parameter packs in the TREE_VALUE have already been
1631 bound as part of the TREE_PURPOSE. See
1632 make_pack_expansion for more information. */
1633 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1634 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1635 TREE_VALUE (mem
) = error_mark_node
;
1638 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1639 CTOR_INITIALIZER
, mem_inits
));
1642 emit_mem_initializers (mem_inits
);
1645 /* Obfuscate EXPR if it looks like an id-expression or member access so
1646 that the call to finish_decltype in do_auto_deduction will give the
1650 force_paren_expr (tree expr
)
1652 /* This is only needed for decltype(auto) in C++14. */
1653 if (cxx_dialect
< cxx14
)
1656 /* If we're in unevaluated context, we can't be deducing a
1657 return/initializer type, so we don't need to mess with this. */
1658 if (cp_unevaluated_operand
)
1661 if (!DECL_P (expr
) && TREE_CODE (expr
) != COMPONENT_REF
1662 && TREE_CODE (expr
) != SCOPE_REF
)
1665 if (TREE_CODE (expr
) == COMPONENT_REF
)
1666 REF_PARENTHESIZED_P (expr
) = true;
1667 else if (type_dependent_expression_p (expr
))
1668 expr
= build1 (PAREN_EXPR
, TREE_TYPE (expr
), expr
);
1671 cp_lvalue_kind kind
= lvalue_kind (expr
);
1672 if ((kind
& ~clk_class
) != clk_none
)
1674 tree type
= unlowered_expr_type (expr
);
1675 bool rval
= !!(kind
& clk_rvalueref
);
1676 type
= cp_build_reference_type (type
, rval
);
1677 /* This inhibits warnings in, eg, cxx_mark_addressable
1679 warning_sentinel
s (extra_warnings
);
1680 expr
= build_static_cast (type
, expr
, tf_error
);
1681 if (expr
!= error_mark_node
)
1682 REF_PARENTHESIZED_P (expr
) = true;
1689 /* Finish a parenthesized expression EXPR. */
1692 finish_parenthesized_expr (tree expr
)
1695 /* This inhibits warnings in c_common_truthvalue_conversion. */
1696 TREE_NO_WARNING (expr
) = 1;
1698 if (TREE_CODE (expr
) == OFFSET_REF
1699 || TREE_CODE (expr
) == SCOPE_REF
)
1700 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1701 enclosed in parentheses. */
1702 PTRMEM_OK_P (expr
) = 0;
1704 if (TREE_CODE (expr
) == STRING_CST
)
1705 PAREN_STRING_LITERAL_P (expr
) = 1;
1707 expr
= force_paren_expr (expr
);
1712 /* Finish a reference to a non-static data member (DECL) that is not
1713 preceded by `.' or `->'. */
1716 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1718 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1722 tree scope
= qualifying_scope
;
1723 if (scope
== NULL_TREE
)
1724 scope
= context_for_name_lookup (decl
);
1725 object
= maybe_dummy_object (scope
, NULL
);
1728 object
= maybe_resolve_dummy (object
, true);
1729 if (object
== error_mark_node
)
1730 return error_mark_node
;
1732 /* DR 613/850: Can use non-static data members without an associated
1733 object in sizeof/decltype/alignof. */
1734 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1735 && (!processing_template_decl
|| !current_class_ref
))
1737 if (current_function_decl
1738 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1739 error ("invalid use of member %qD in static member function", decl
);
1741 error ("invalid use of non-static data member %qD", decl
);
1742 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
1744 return error_mark_node
;
1747 if (current_class_ptr
)
1748 TREE_USED (current_class_ptr
) = 1;
1749 if (processing_template_decl
&& !qualifying_scope
)
1751 tree type
= TREE_TYPE (decl
);
1753 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1754 /* Quals on the object don't matter. */;
1755 else if (PACK_EXPANSION_P (type
))
1756 /* Don't bother trying to represent this. */
1760 /* Set the cv qualifiers. */
1761 int quals
= cp_type_quals (TREE_TYPE (object
));
1763 if (DECL_MUTABLE_P (decl
))
1764 quals
&= ~TYPE_QUAL_CONST
;
1766 quals
|= cp_type_quals (TREE_TYPE (decl
));
1767 type
= cp_build_qualified_type (type
, quals
);
1770 return (convert_from_reference
1771 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1773 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1774 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1776 else if (processing_template_decl
)
1777 return build_qualified_name (TREE_TYPE (decl
),
1780 /*template_p=*/false);
1783 tree access_type
= TREE_TYPE (object
);
1785 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1786 decl
, tf_warning_or_error
);
1788 /* If the data member was named `C::M', convert `*this' to `C'
1790 if (qualifying_scope
)
1792 tree binfo
= NULL_TREE
;
1793 object
= build_scoped_ref (object
, qualifying_scope
,
1797 return build_class_member_access_expr (object
, decl
,
1798 /*access_path=*/NULL_TREE
,
1799 /*preserve_reference=*/false,
1800 tf_warning_or_error
);
1804 /* If we are currently parsing a template and we encountered a typedef
1805 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1806 adds the typedef to a list tied to the current template.
1807 At template instantiation time, that list is walked and access check
1808 performed for each typedef.
1809 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1812 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1814 location_t location
)
1816 tree template_info
= NULL
;
1817 tree cs
= current_scope ();
1819 if (!is_typedef_decl (typedef_decl
)
1821 || !CLASS_TYPE_P (context
)
1825 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1826 template_info
= get_template_info (cs
);
1829 && TI_TEMPLATE (template_info
)
1830 && !currently_open_class (context
))
1831 append_type_to_template_for_access_check (cs
, typedef_decl
,
1835 /* DECL was the declaration to which a qualified-id resolved. Issue
1836 an error message if it is not accessible. If OBJECT_TYPE is
1837 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1838 type of `*x', or `x', respectively. If the DECL was named as
1839 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1842 check_accessibility_of_qualified_id (tree decl
,
1844 tree nested_name_specifier
)
1847 tree qualifying_type
= NULL_TREE
;
1849 /* If we are parsing a template declaration and if decl is a typedef,
1850 add it to a list tied to the template.
1851 At template instantiation time, that list will be walked and
1852 access check performed. */
1853 add_typedef_to_current_template_for_access_check (decl
,
1854 nested_name_specifier
1855 ? nested_name_specifier
1856 : DECL_CONTEXT (decl
),
1859 /* If we're not checking, return immediately. */
1860 if (deferred_access_no_check
)
1863 /* Determine the SCOPE of DECL. */
1864 scope
= context_for_name_lookup (decl
);
1865 /* If the SCOPE is not a type, then DECL is not a member. */
1866 if (!TYPE_P (scope
))
1868 /* Compute the scope through which DECL is being accessed. */
1870 /* OBJECT_TYPE might not be a class type; consider:
1872 class A { typedef int I; };
1876 In this case, we will have "A::I" as the DECL, but "I" as the
1878 && CLASS_TYPE_P (object_type
)
1879 && DERIVED_FROM_P (scope
, object_type
))
1880 /* If we are processing a `->' or `.' expression, use the type of the
1882 qualifying_type
= object_type
;
1883 else if (nested_name_specifier
)
1885 /* If the reference is to a non-static member of the
1886 current class, treat it as if it were referenced through
1889 if (DECL_NONSTATIC_MEMBER_P (decl
)
1890 && current_class_ptr
1891 && DERIVED_FROM_P (scope
, ct
= current_nonlambda_class_type ()))
1892 qualifying_type
= ct
;
1893 /* Otherwise, use the type indicated by the
1894 nested-name-specifier. */
1896 qualifying_type
= nested_name_specifier
;
1899 /* Otherwise, the name must be from the current class or one of
1901 qualifying_type
= currently_open_derived_class (scope
);
1904 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1905 or similar in a default argument value. */
1906 && CLASS_TYPE_P (qualifying_type
)
1907 && !dependent_type_p (qualifying_type
))
1908 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1909 decl
, tf_warning_or_error
);
1912 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1913 class named to the left of the "::" operator. DONE is true if this
1914 expression is a complete postfix-expression; it is false if this
1915 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1916 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1917 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1918 is true iff this qualified name appears as a template argument. */
1921 finish_qualified_id_expr (tree qualifying_class
,
1926 bool template_arg_p
,
1927 tsubst_flags_t complain
)
1929 gcc_assert (TYPE_P (qualifying_class
));
1931 if (error_operand_p (expr
))
1932 return error_mark_node
;
1934 if ((DECL_P (expr
) || BASELINK_P (expr
))
1935 && !mark_used (expr
, complain
))
1936 return error_mark_node
;
1939 check_template_keyword (expr
);
1941 /* If EXPR occurs as the operand of '&', use special handling that
1942 permits a pointer-to-member. */
1943 if (address_p
&& done
)
1945 if (TREE_CODE (expr
) == SCOPE_REF
)
1946 expr
= TREE_OPERAND (expr
, 1);
1947 expr
= build_offset_ref (qualifying_class
, expr
,
1948 /*address_p=*/true, complain
);
1952 /* No need to check access within an enum. */
1953 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
)
1956 /* Within the scope of a class, turn references to non-static
1957 members into expression of the form "this->...". */
1959 /* But, within a template argument, we do not want make the
1960 transformation, as there is no "this" pointer. */
1962 else if (TREE_CODE (expr
) == FIELD_DECL
)
1964 push_deferring_access_checks (dk_no_check
);
1965 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1967 pop_deferring_access_checks ();
1969 else if (BASELINK_P (expr
) && !processing_template_decl
)
1971 /* See if any of the functions are non-static members. */
1972 /* If so, the expression may be relative to 'this'. */
1973 if (!shared_member_p (expr
)
1974 && current_class_ptr
1975 && DERIVED_FROM_P (qualifying_class
,
1976 current_nonlambda_class_type ()))
1977 expr
= (build_class_member_access_expr
1978 (maybe_dummy_object (qualifying_class
, NULL
),
1980 BASELINK_ACCESS_BINFO (expr
),
1981 /*preserve_reference=*/false,
1984 /* The expression is a qualified name whose address is not
1986 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
1989 else if (BASELINK_P (expr
))
1993 /* In a template, return a SCOPE_REF for most qualified-ids
1994 so that we can check access at instantiation time. But if
1995 we're looking at a member of the current instantiation, we
1996 know we have access and building up the SCOPE_REF confuses
1997 non-type template argument handling. */
1998 if (processing_template_decl
1999 && !currently_open_class (qualifying_class
))
2000 expr
= build_qualified_name (TREE_TYPE (expr
),
2001 qualifying_class
, expr
,
2004 expr
= convert_from_reference (expr
);
2010 /* Begin a statement-expression. The value returned must be passed to
2011 finish_stmt_expr. */
2014 begin_stmt_expr (void)
2016 return push_stmt_list ();
2019 /* Process the final expression of a statement expression. EXPR can be
2020 NULL, if the final expression is empty. Return a STATEMENT_LIST
2021 containing all the statements in the statement-expression, or
2022 ERROR_MARK_NODE if there was an error. */
2025 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
2027 if (error_operand_p (expr
))
2029 /* The type of the statement-expression is the type of the last
2031 TREE_TYPE (stmt_expr
) = error_mark_node
;
2032 return error_mark_node
;
2035 /* If the last statement does not have "void" type, then the value
2036 of the last statement is the value of the entire expression. */
2039 tree type
= TREE_TYPE (expr
);
2041 if (processing_template_decl
)
2043 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
2044 expr
= add_stmt (expr
);
2045 /* Mark the last statement so that we can recognize it as such at
2046 template-instantiation time. */
2047 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
2049 else if (VOID_TYPE_P (type
))
2051 /* Just treat this like an ordinary statement. */
2052 expr
= finish_expr_stmt (expr
);
2056 /* It actually has a value we need to deal with. First, force it
2057 to be an rvalue so that we won't need to build up a copy
2058 constructor call later when we try to assign it to something. */
2059 expr
= force_rvalue (expr
, tf_warning_or_error
);
2060 if (error_operand_p (expr
))
2061 return error_mark_node
;
2063 /* Update for array-to-pointer decay. */
2064 type
= TREE_TYPE (expr
);
2066 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
2067 normal statement, but don't convert to void or actually add
2069 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
2070 expr
= maybe_cleanup_point_expr (expr
);
2074 /* The type of the statement-expression is the type of the last
2076 TREE_TYPE (stmt_expr
) = type
;
2082 /* Finish a statement-expression. EXPR should be the value returned
2083 by the previous begin_stmt_expr. Returns an expression
2084 representing the statement-expression. */
2087 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
2092 if (error_operand_p (stmt_expr
))
2094 pop_stmt_list (stmt_expr
);
2095 return error_mark_node
;
2098 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
2100 type
= TREE_TYPE (stmt_expr
);
2101 result
= pop_stmt_list (stmt_expr
);
2102 TREE_TYPE (result
) = type
;
2104 if (processing_template_decl
)
2106 result
= build_min (STMT_EXPR
, type
, result
);
2107 TREE_SIDE_EFFECTS (result
) = 1;
2108 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
2110 else if (CLASS_TYPE_P (type
))
2112 /* Wrap the statement-expression in a TARGET_EXPR so that the
2113 temporary object created by the final expression is destroyed at
2114 the end of the full-expression containing the
2115 statement-expression. */
2116 result
= force_target_expr (type
, result
, tf_warning_or_error
);
2122 /* Returns the expression which provides the value of STMT_EXPR. */
2125 stmt_expr_value_expr (tree stmt_expr
)
2127 tree t
= STMT_EXPR_STMT (stmt_expr
);
2129 if (TREE_CODE (t
) == BIND_EXPR
)
2130 t
= BIND_EXPR_BODY (t
);
2132 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
2133 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
2135 if (TREE_CODE (t
) == EXPR_STMT
)
2136 t
= EXPR_STMT_EXPR (t
);
2141 /* Return TRUE iff EXPR_STMT is an empty list of
2142 expression statements. */
2145 empty_expr_stmt_p (tree expr_stmt
)
2147 tree body
= NULL_TREE
;
2149 if (expr_stmt
== void_node
)
2154 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
2155 body
= EXPR_STMT_EXPR (expr_stmt
);
2156 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
2162 if (TREE_CODE (body
) == STATEMENT_LIST
)
2163 return tsi_end_p (tsi_start (body
));
2165 return empty_expr_stmt_p (body
);
2170 /* Perform Koenig lookup. FN is the postfix-expression representing
2171 the function (or functions) to call; ARGS are the arguments to the
2172 call. Returns the functions to be considered by overload resolution. */
2175 perform_koenig_lookup (tree fn
, vec
<tree
, va_gc
> *args
,
2176 tsubst_flags_t complain
)
2178 tree identifier
= NULL_TREE
;
2179 tree functions
= NULL_TREE
;
2180 tree tmpl_args
= NULL_TREE
;
2181 bool template_id
= false;
2183 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2185 /* Use a separate flag to handle null args. */
2187 tmpl_args
= TREE_OPERAND (fn
, 1);
2188 fn
= TREE_OPERAND (fn
, 0);
2191 /* Find the name of the overloaded function. */
2192 if (identifier_p (fn
))
2194 else if (is_overloaded_fn (fn
))
2197 identifier
= DECL_NAME (get_first_fn (functions
));
2199 else if (DECL_P (fn
))
2202 identifier
= DECL_NAME (fn
);
2205 /* A call to a namespace-scope function using an unqualified name.
2207 Do Koenig lookup -- unless any of the arguments are
2209 if (!any_type_dependent_arguments_p (args
)
2210 && !any_dependent_template_arguments_p (tmpl_args
))
2212 fn
= lookup_arg_dependent (identifier
, functions
, args
);
2215 /* The unqualified name could not be resolved. */
2217 fn
= unqualified_fn_lookup_error (identifier
);
2223 if (fn
&& template_id
)
2224 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2229 /* Generate an expression for `FN (ARGS)'. This may change the
2232 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2233 as a virtual call, even if FN is virtual. (This flag is set when
2234 encountering an expression where the function name is explicitly
2235 qualified. For example a call to `X::f' never generates a virtual
2238 Returns code for the call. */
2241 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2242 bool koenig_p
, tsubst_flags_t complain
)
2246 vec
<tree
, va_gc
> *orig_args
= NULL
;
2248 if (fn
== error_mark_node
)
2249 return error_mark_node
;
2251 gcc_assert (!TYPE_P (fn
));
2255 if (processing_template_decl
)
2257 /* If the call expression is dependent, build a CALL_EXPR node
2258 with no type; type_dependent_expression_p recognizes
2259 expressions with no type as being dependent. */
2260 if (type_dependent_expression_p (fn
)
2261 || any_type_dependent_arguments_p (*args
)
2262 /* For a non-static member function that doesn't have an
2263 explicit object argument, we need to specifically
2264 test the type dependency of the "this" pointer because it
2265 is not included in *ARGS even though it is considered to
2266 be part of the list of arguments. Note that this is
2267 related to CWG issues 515 and 1005. */
2268 || (TREE_CODE (fn
) != COMPONENT_REF
2269 && non_static_member_function_p (fn
)
2270 && current_class_ref
2271 && type_dependent_expression_p (current_class_ref
)))
2273 result
= build_nt_call_vec (fn
, *args
);
2274 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_LOC (fn
, input_location
));
2275 KOENIG_LOOKUP_P (result
) = koenig_p
;
2280 tree fndecl
= OVL_CURRENT (fn
);
2281 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2282 || !TREE_THIS_VOLATILE (fndecl
))
2288 current_function_returns_abnormally
= 1;
2292 orig_args
= make_tree_vector_copy (*args
);
2293 if (!BASELINK_P (fn
)
2294 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2295 && TREE_TYPE (fn
) != unknown_type_node
)
2296 fn
= build_non_dependent_expr (fn
);
2297 make_args_non_dependent (*args
);
2300 if (TREE_CODE (fn
) == COMPONENT_REF
)
2302 tree member
= TREE_OPERAND (fn
, 1);
2303 if (BASELINK_P (member
))
2305 tree object
= TREE_OPERAND (fn
, 0);
2306 return build_new_method_call (object
, member
,
2309 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2316 /* Per 13.3.1.1, '(&f)(...)' is the same as '(f)(...)'. */
2317 if (TREE_CODE (fn
) == ADDR_EXPR
2318 && TREE_CODE (TREE_OPERAND (fn
, 0)) == OVERLOAD
)
2319 fn
= TREE_OPERAND (fn
, 0);
2321 if (is_overloaded_fn (fn
))
2322 fn
= baselink_for_fns (fn
);
2325 if (BASELINK_P (fn
))
2329 /* A call to a member function. From [over.call.func]:
2331 If the keyword this is in scope and refers to the class of
2332 that member function, or a derived class thereof, then the
2333 function call is transformed into a qualified function call
2334 using (*this) as the postfix-expression to the left of the
2335 . operator.... [Otherwise] a contrived object of type T
2336 becomes the implied object argument.
2340 struct A { void f(); };
2341 struct B : public A {};
2342 struct C : public A { void g() { B::f(); }};
2344 "the class of that member function" refers to `A'. But 11.2
2345 [class.access.base] says that we need to convert 'this' to B* as
2346 part of the access, so we pass 'B' to maybe_dummy_object. */
2348 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2351 if (processing_template_decl
)
2353 if (type_dependent_expression_p (object
))
2355 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2356 release_tree_vector (orig_args
);
2359 object
= build_non_dependent_expr (object
);
2362 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2364 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2369 else if (is_overloaded_fn (fn
))
2371 /* If the function is an overloaded builtin, resolve it. */
2372 if (TREE_CODE (fn
) == FUNCTION_DECL
2373 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2374 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2375 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2379 if (warn_sizeof_pointer_memaccess
2380 && !vec_safe_is_empty (*args
)
2381 && !processing_template_decl
)
2383 location_t sizeof_arg_loc
[3];
2386 for (i
= 0; i
< 3; i
++)
2390 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2391 sizeof_arg
[i
] = NULL_TREE
;
2392 if (i
>= (*args
)->length ())
2395 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2397 if (SIZEOF_EXPR_TYPE_P (t
))
2398 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2400 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2401 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2403 sizeof_pointer_memaccess_warning
2404 (sizeof_arg_loc
, fn
, *args
,
2405 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2408 /* A call to a namespace-scope function. */
2409 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2412 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2414 if (!vec_safe_is_empty (*args
))
2415 error ("arguments to destructor are not allowed");
2416 /* Mark the pseudo-destructor call as having side-effects so
2417 that we do not issue warnings about its use. */
2418 result
= build1 (NOP_EXPR
,
2420 TREE_OPERAND (fn
, 0));
2421 TREE_SIDE_EFFECTS (result
) = 1;
2423 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2424 /* If the "function" is really an object of class type, it might
2425 have an overloaded `operator ()'. */
2426 result
= build_op_call (fn
, args
, complain
);
2429 /* A call where the function is unknown. */
2430 result
= cp_build_function_call_vec (fn
, args
, complain
);
2432 if (processing_template_decl
&& result
!= error_mark_node
)
2434 if (INDIRECT_REF_P (result
))
2435 result
= TREE_OPERAND (result
, 0);
2436 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2437 SET_EXPR_LOCATION (result
, input_location
);
2438 KOENIG_LOOKUP_P (result
) = koenig_p
;
2439 release_tree_vector (orig_args
);
2440 result
= convert_from_reference (result
);
2445 /* Free garbage OVERLOADs from arg-dependent lookup. */
2446 tree next
= NULL_TREE
;
2448 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2451 if (processing_template_decl
)
2452 /* In a template, we'll re-use them at instantiation time. */
2453 OVL_ARG_DEPENDENT (fn
) = false;
2456 next
= OVL_CHAIN (fn
);
2465 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2466 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2467 POSTDECREMENT_EXPR.) */
2470 finish_increment_expr (tree expr
, enum tree_code code
)
2472 return build_x_unary_op (input_location
, code
, expr
, tf_warning_or_error
);
2475 /* Finish a use of `this'. Returns an expression for `this'. */
2478 finish_this_expr (void)
2480 tree result
= NULL_TREE
;
2482 if (current_class_ptr
)
2484 tree type
= TREE_TYPE (current_class_ref
);
2486 /* In a lambda expression, 'this' refers to the captured 'this'. */
2487 if (LAMBDA_TYPE_P (type
))
2488 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
), true);
2490 result
= current_class_ptr
;
2494 /* The keyword 'this' is a prvalue expression. */
2495 return rvalue (result
);
2497 tree fn
= current_nonlambda_function ();
2498 if (fn
&& DECL_STATIC_FUNCTION_P (fn
))
2499 error ("%<this%> is unavailable for static member functions");
2501 error ("invalid use of %<this%> in non-member function");
2503 error ("invalid use of %<this%> at top level");
2504 return error_mark_node
;
2507 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2508 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2509 the TYPE for the type given. If SCOPE is non-NULL, the expression
2510 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2513 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
,
2516 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2517 return error_mark_node
;
2519 gcc_assert (TYPE_P (destructor
));
2521 if (!processing_template_decl
)
2523 if (scope
== error_mark_node
)
2525 error_at (loc
, "invalid qualifying scope in pseudo-destructor name");
2526 return error_mark_node
;
2528 if (is_auto (destructor
))
2529 destructor
= TREE_TYPE (object
);
2530 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2533 "qualified type %qT does not match destructor name ~%qT",
2535 return error_mark_node
;
2539 /* [expr.pseudo] says both:
2541 The type designated by the pseudo-destructor-name shall be
2542 the same as the object type.
2546 The cv-unqualified versions of the object type and of the
2547 type designated by the pseudo-destructor-name shall be the
2550 We implement the more generous second sentence, since that is
2551 what most other compilers do. */
2552 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2555 error_at (loc
, "%qE is not of type %qT", object
, destructor
);
2556 return error_mark_node
;
2560 return build3_loc (loc
, PSEUDO_DTOR_EXPR
, void_type_node
, object
,
2564 /* Finish an expression of the form CODE EXPR. */
2567 finish_unary_op_expr (location_t loc
, enum tree_code code
, tree expr
,
2568 tsubst_flags_t complain
)
2570 tree result
= build_x_unary_op (loc
, code
, expr
, complain
);
2571 if ((complain
& tf_warning
)
2572 && TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2573 overflow_warning (input_location
, result
);
2578 /* Finish a compound-literal expression. TYPE is the type to which
2579 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2582 finish_compound_literal (tree type
, tree compound_literal
,
2583 tsubst_flags_t complain
)
2585 if (type
== error_mark_node
)
2586 return error_mark_node
;
2588 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2591 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2593 return cp_build_c_cast (type
, compound_literal
, complain
);
2596 if (!TYPE_OBJ_P (type
))
2598 if (complain
& tf_error
)
2599 error ("compound literal of non-object type %qT", type
);
2600 return error_mark_node
;
2603 if (processing_template_decl
)
2605 TREE_TYPE (compound_literal
) = type
;
2606 /* Mark the expression as a compound literal. */
2607 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2608 return compound_literal
;
2611 type
= complete_type (type
);
2613 if (TYPE_NON_AGGREGATE_CLASS (type
))
2615 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2616 everywhere that deals with function arguments would be a pain, so
2617 just wrap it in a TREE_LIST. The parser set a flag so we know
2618 that it came from T{} rather than T({}). */
2619 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2620 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2621 return build_functional_cast (type
, compound_literal
, complain
);
2624 if (TREE_CODE (type
) == ARRAY_TYPE
2625 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2626 return error_mark_node
;
2627 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2628 if (SCALAR_TYPE_P (type
)
2629 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2630 && !check_narrowing (type
, compound_literal
, complain
))
2631 return error_mark_node
;
2632 if (TREE_CODE (type
) == ARRAY_TYPE
2633 && TYPE_DOMAIN (type
) == NULL_TREE
)
2635 cp_complete_array_type_or_error (&type
, compound_literal
,
2637 if (type
== error_mark_node
)
2638 return error_mark_node
;
2640 compound_literal
= digest_init (type
, compound_literal
, complain
);
2641 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2642 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2643 /* Put static/constant array temporaries in static variables, but always
2644 represent class temporaries with TARGET_EXPR so we elide copies. */
2645 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2646 && TREE_CODE (type
) == ARRAY_TYPE
2647 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2648 && initializer_constant_valid_p (compound_literal
, type
))
2650 tree decl
= create_temporary_var (type
);
2651 DECL_INITIAL (decl
) = compound_literal
;
2652 TREE_STATIC (decl
) = 1;
2653 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2655 /* 5.19 says that a constant expression can include an
2656 lvalue-rvalue conversion applied to "a glvalue of literal type
2657 that refers to a non-volatile temporary object initialized
2658 with a constant expression". Rather than try to communicate
2659 that this VAR_DECL is a temporary, just mark it constexpr. */
2660 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2661 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2662 TREE_CONSTANT (decl
) = true;
2664 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2665 decl
= pushdecl_top_level (decl
);
2666 DECL_NAME (decl
) = make_anon_name ();
2667 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2668 /* Make sure the destructor is callable. */
2669 tree clean
= cxx_maybe_build_cleanup (decl
, complain
);
2670 if (clean
== error_mark_node
)
2671 return error_mark_node
;
2675 return get_target_expr_sfinae (compound_literal
, complain
);
2678 /* Return the declaration for the function-name variable indicated by
2682 finish_fname (tree id
)
2686 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2687 if (processing_template_decl
&& current_function_decl
2688 && decl
!= error_mark_node
)
2689 decl
= DECL_NAME (decl
);
2693 /* Finish a translation unit. */
2696 finish_translation_unit (void)
2698 /* In case there were missing closebraces,
2699 get us back to the global binding level. */
2701 while (current_namespace
!= global_namespace
)
2704 /* Do file scope __FUNCTION__ et al. */
2705 finish_fname_decls ();
2708 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2709 Returns the parameter. */
2712 finish_template_type_parm (tree aggr
, tree identifier
)
2714 if (aggr
!= class_type_node
)
2716 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2717 aggr
= class_type_node
;
2720 return build_tree_list (aggr
, identifier
);
2723 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2724 Returns the parameter. */
2727 finish_template_template_parm (tree aggr
, tree identifier
)
2729 tree decl
= build_decl (input_location
,
2730 TYPE_DECL
, identifier
, NULL_TREE
);
2731 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2732 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2733 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2734 DECL_ARTIFICIAL (decl
) = 1;
2735 end_template_decl ();
2737 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2739 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2740 /*is_primary=*/true, /*is_partial=*/false,
2743 return finish_template_type_parm (aggr
, tmpl
);
2746 /* ARGUMENT is the default-argument value for a template template
2747 parameter. If ARGUMENT is invalid, issue error messages and return
2748 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2751 check_template_template_default_arg (tree argument
)
2753 if (TREE_CODE (argument
) != TEMPLATE_DECL
2754 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2755 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2757 if (TREE_CODE (argument
) == TYPE_DECL
)
2758 error ("invalid use of type %qT as a default value for a template "
2759 "template-parameter", TREE_TYPE (argument
));
2761 error ("invalid default argument for a template template parameter");
2762 return error_mark_node
;
2768 /* Begin a class definition, as indicated by T. */
2771 begin_class_definition (tree t
)
2773 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2774 return error_mark_node
;
2776 if (processing_template_parmlist
)
2778 error ("definition of %q#T inside template parameter list", t
);
2779 return error_mark_node
;
2782 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2783 are passed the same as decimal scalar types. */
2784 if (TREE_CODE (t
) == RECORD_TYPE
2785 && !processing_template_decl
)
2787 tree ns
= TYPE_CONTEXT (t
);
2788 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2789 && DECL_CONTEXT (ns
) == std_node
2791 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2793 const char *n
= TYPE_NAME_STRING (t
);
2794 if ((strcmp (n
, "decimal32") == 0)
2795 || (strcmp (n
, "decimal64") == 0)
2796 || (strcmp (n
, "decimal128") == 0))
2797 TYPE_TRANSPARENT_AGGR (t
) = 1;
2801 /* A non-implicit typename comes from code like:
2803 template <typename T> struct A {
2804 template <typename U> struct A<T>::B ...
2806 This is erroneous. */
2807 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2809 error ("invalid definition of qualified type %qT", t
);
2810 t
= error_mark_node
;
2813 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2815 t
= make_class_type (RECORD_TYPE
);
2816 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2819 if (TYPE_BEING_DEFINED (t
))
2821 t
= make_class_type (TREE_CODE (t
));
2822 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2824 maybe_process_partial_specialization (t
);
2826 TYPE_BEING_DEFINED (t
) = 1;
2827 class_binding_level
->defining_class_p
= 1;
2829 if (flag_pack_struct
)
2832 TYPE_PACKED (t
) = 1;
2833 /* Even though the type is being defined for the first time
2834 here, there might have been a forward declaration, so there
2835 might be cv-qualified variants of T. */
2836 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2837 TYPE_PACKED (v
) = 1;
2839 /* Reset the interface data, at the earliest possible
2840 moment, as it might have been set via a class foo;
2842 if (! TYPE_ANONYMOUS_P (t
))
2844 struct c_fileinfo
*finfo
= \
2845 get_fileinfo (LOCATION_FILE (input_location
));
2846 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2847 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2848 (t
, finfo
->interface_unknown
);
2850 reset_specialization();
2852 /* Make a declaration for this class in its own scope. */
2853 build_self_reference ();
2858 /* Finish the member declaration given by DECL. */
2861 finish_member_declaration (tree decl
)
2863 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2866 if (decl
== void_type_node
)
2867 /* The COMPONENT was a friend, not a member, and so there's
2868 nothing for us to do. */
2871 /* We should see only one DECL at a time. */
2872 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2874 /* Set up access control for DECL. */
2876 = (current_access_specifier
== access_private_node
);
2877 TREE_PROTECTED (decl
)
2878 = (current_access_specifier
== access_protected_node
);
2879 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2881 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2882 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2885 /* Mark the DECL as a member of the current class, unless it's
2886 a member of an enumeration. */
2887 if (TREE_CODE (decl
) != CONST_DECL
)
2888 DECL_CONTEXT (decl
) = current_class_type
;
2890 /* Check for bare parameter packs in the member variable declaration. */
2891 if (TREE_CODE (decl
) == FIELD_DECL
)
2893 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2894 TREE_TYPE (decl
) = error_mark_node
;
2895 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2896 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2901 A C language linkage is ignored for the names of class members
2902 and the member function type of class member functions. */
2903 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2904 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2906 /* Put functions on the TYPE_METHODS list and everything else on the
2907 TYPE_FIELDS list. Note that these are built up in reverse order.
2908 We reverse them (to obtain declaration order) in finish_struct. */
2909 if (DECL_DECLARES_FUNCTION_P (decl
))
2911 /* We also need to add this function to the
2912 CLASSTYPE_METHOD_VEC. */
2913 if (add_method (current_class_type
, decl
, NULL_TREE
))
2915 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2916 TYPE_METHODS (current_class_type
) = decl
;
2918 maybe_add_class_template_decl_list (current_class_type
, decl
,
2922 /* Enter the DECL into the scope of the class, if the class
2923 isn't a closure (whose fields are supposed to be unnamed). */
2924 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
2925 || pushdecl_class_level (decl
))
2927 if (TREE_CODE (decl
) == USING_DECL
)
2929 /* For now, ignore class-scope USING_DECLS, so that
2930 debugging backends do not see them. */
2931 DECL_IGNORED_P (decl
) = 1;
2934 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2935 go at the beginning. The reason is that lookup_field_1
2936 searches the list in order, and we want a field name to
2937 override a type name so that the "struct stat hack" will
2938 work. In particular:
2940 struct S { enum E { }; int E } s;
2943 is valid. In addition, the FIELD_DECLs must be maintained in
2944 declaration order so that class layout works as expected.
2945 However, we don't need that order until class layout, so we
2946 save a little time by putting FIELD_DECLs on in reverse order
2947 here, and then reversing them in finish_struct_1. (We could
2948 also keep a pointer to the correct insertion points in the
2951 if (TREE_CODE (decl
) == TYPE_DECL
)
2952 TYPE_FIELDS (current_class_type
)
2953 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2956 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2957 TYPE_FIELDS (current_class_type
) = decl
;
2960 maybe_add_class_template_decl_list (current_class_type
, decl
,
2965 note_decl_for_pch (decl
);
2968 /* DECL has been declared while we are building a PCH file. Perform
2969 actions that we might normally undertake lazily, but which can be
2970 performed now so that they do not have to be performed in
2971 translation units which include the PCH file. */
2974 note_decl_for_pch (tree decl
)
2976 gcc_assert (pch_file
);
2978 /* There's a good chance that we'll have to mangle names at some
2979 point, even if only for emission in debugging information. */
2980 if (VAR_OR_FUNCTION_DECL_P (decl
)
2981 && !processing_template_decl
)
2985 /* Finish processing a complete template declaration. The PARMS are
2986 the template parameters. */
2989 finish_template_decl (tree parms
)
2992 end_template_decl ();
2994 end_specialization ();
2997 /* Finish processing a template-id (which names a type) of the form
2998 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2999 template-id. If ENTERING_SCOPE is nonzero we are about to enter
3000 the scope of template-id indicated. */
3003 finish_template_type (tree name
, tree args
, int entering_scope
)
3007 type
= lookup_template_class (name
, args
,
3008 NULL_TREE
, NULL_TREE
, entering_scope
,
3009 tf_warning_or_error
| tf_user
);
3010 if (type
== error_mark_node
)
3012 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
3013 return TYPE_STUB_DECL (type
);
3015 return TYPE_NAME (type
);
3018 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
3019 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
3020 BASE_CLASS, or NULL_TREE if an error occurred. The
3021 ACCESS_SPECIFIER is one of
3022 access_{default,public,protected_private}_node. For a virtual base
3023 we set TREE_TYPE. */
3026 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
3030 if (base
== error_mark_node
)
3032 error ("invalid base-class specification");
3035 else if (! MAYBE_CLASS_TYPE_P (base
))
3037 error ("%qT is not a class type", base
);
3042 if (cp_type_quals (base
) != 0)
3044 /* DR 484: Can a base-specifier name a cv-qualified
3046 base
= TYPE_MAIN_VARIANT (base
);
3048 result
= build_tree_list (access
, base
);
3050 TREE_TYPE (result
) = integer_type_node
;
3056 /* If FNS is a member function, a set of member functions, or a
3057 template-id referring to one or more member functions, return a
3058 BASELINK for FNS, incorporating the current access context.
3059 Otherwise, return FNS unchanged. */
3062 baselink_for_fns (tree fns
)
3067 if (BASELINK_P (fns
)
3068 || error_operand_p (fns
))
3071 scope
= ovl_scope (fns
);
3072 if (!CLASS_TYPE_P (scope
))
3075 cl
= currently_open_derived_class (scope
);
3078 cl
= TYPE_BINFO (cl
);
3079 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
3082 /* Returns true iff DECL is a variable from a function outside
3086 outer_var_p (tree decl
)
3088 return ((VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
3089 && DECL_FUNCTION_SCOPE_P (decl
)
3090 && (DECL_CONTEXT (decl
) != current_function_decl
3091 || parsing_nsdmi ()));
3094 /* As above, but also checks that DECL is automatic. */
3097 outer_automatic_var_p (tree decl
)
3099 return (outer_var_p (decl
)
3100 && !TREE_STATIC (decl
));
3103 /* DECL satisfies outer_automatic_var_p. Possibly complain about it or
3104 rewrite it for lambda capture. */
3107 process_outer_var_ref (tree decl
, tsubst_flags_t complain
)
3109 if (cp_unevaluated_operand
)
3110 /* It's not a use (3.2) if we're in an unevaluated context. */
3113 tree context
= DECL_CONTEXT (decl
);
3114 tree containing_function
= current_function_decl
;
3115 tree lambda_stack
= NULL_TREE
;
3116 tree lambda_expr
= NULL_TREE
;
3117 tree initializer
= convert_from_reference (decl
);
3119 /* Mark it as used now even if the use is ill-formed. */
3120 if (!mark_used (decl
, complain
) && !(complain
& tf_error
))
3121 return error_mark_node
;
3123 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3124 support for an approach in which a reference to a local
3125 [constant] automatic variable in a nested class or lambda body
3126 would enter the expression as an rvalue, which would reduce
3127 the complexity of the problem"
3129 FIXME update for final resolution of core issue 696. */
3130 if (decl_maybe_constant_var_p (decl
))
3132 if (processing_template_decl
)
3133 /* In a template, the constant value may not be in a usable
3134 form, so wait until instantiation time. */
3136 else if (decl_constant_var_p (decl
))
3137 return scalar_constant_value (decl
);
3140 if (parsing_nsdmi ())
3141 containing_function
= NULL_TREE
;
3143 /* If we are in a lambda function, we can move out until we hit
3145 2. a non-lambda function, or
3146 3. a non-default capturing lambda function. */
3147 while (context
!= containing_function
3148 && LAMBDA_FUNCTION_P (containing_function
))
3150 tree closure
= DECL_CONTEXT (containing_function
);
3151 lambda_expr
= CLASSTYPE_LAMBDA_EXPR (closure
);
3153 if (TYPE_CLASS_SCOPE_P (closure
))
3154 /* A lambda in an NSDMI (c++/64496). */
3157 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3161 lambda_stack
= tree_cons (NULL_TREE
,
3166 = decl_function_context (containing_function
);
3169 if (lambda_expr
&& TREE_CODE (decl
) == VAR_DECL
3170 && DECL_ANON_UNION_VAR_P (decl
))
3172 if (complain
& tf_error
)
3173 error ("cannot capture member %qD of anonymous union", decl
);
3174 return error_mark_node
;
3176 if (context
== containing_function
)
3178 decl
= add_default_capture (lambda_stack
,
3179 /*id=*/DECL_NAME (decl
),
3182 else if (lambda_expr
)
3184 if (complain
& tf_error
)
3186 error ("%qD is not captured", decl
);
3187 tree closure
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
3188 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3190 inform (location_of (closure
),
3191 "the lambda has no capture-default");
3192 else if (TYPE_CLASS_SCOPE_P (closure
))
3193 inform (0, "lambda in local class %q+T cannot "
3194 "capture variables from the enclosing context",
3195 TYPE_CONTEXT (closure
));
3196 inform (input_location
, "%q+#D declared here", decl
);
3198 return error_mark_node
;
3202 if (complain
& tf_error
)
3204 ? G_("use of local variable with automatic storage from containing function")
3205 : G_("use of parameter from containing function"));
3206 inform (input_location
, "%q+#D declared here", decl
);
3207 return error_mark_node
;
3212 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
3213 id-expression. (See cp_parser_id_expression for details.) SCOPE,
3214 if non-NULL, is the type or namespace used to explicitly qualify
3215 ID_EXPRESSION. DECL is the entity to which that name has been
3218 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
3219 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
3220 be set to true if this expression isn't permitted in a
3221 constant-expression, but it is otherwise not set by this function.
3222 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
3223 constant-expression, but a non-constant expression is also
3226 DONE is true if this expression is a complete postfix-expression;
3227 it is false if this expression is followed by '->', '[', '(', etc.
3228 ADDRESS_P is true iff this expression is the operand of '&'.
3229 TEMPLATE_P is true iff the qualified-id was of the form
3230 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
3231 appears as a template argument.
3233 If an error occurs, and it is the kind of error that might cause
3234 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
3235 is the caller's responsibility to issue the message. *ERROR_MSG
3236 will be a string with static storage duration, so the caller need
3239 Return an expression for the entity, after issuing appropriate
3240 diagnostics. This function is also responsible for transforming a
3241 reference to a non-static member into a COMPONENT_REF that makes
3242 the use of "this" explicit.
3244 Upon return, *IDK will be filled in appropriately. */
3246 finish_id_expression (tree id_expression
,
3250 bool integral_constant_expression_p
,
3251 bool allow_non_integral_constant_expression_p
,
3252 bool *non_integral_constant_expression_p
,
3256 bool template_arg_p
,
3257 const char **error_msg
,
3258 location_t location
)
3260 decl
= strip_using_decl (decl
);
3262 /* Initialize the output parameters. */
3263 *idk
= CP_ID_KIND_NONE
;
3266 if (id_expression
== error_mark_node
)
3267 return error_mark_node
;
3268 /* If we have a template-id, then no further lookup is
3269 required. If the template-id was for a template-class, we
3270 will sometimes have a TYPE_DECL at this point. */
3271 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3272 || TREE_CODE (decl
) == TYPE_DECL
)
3274 /* Look up the name. */
3277 if (decl
== error_mark_node
)
3279 /* Name lookup failed. */
3282 || (!dependent_type_p (scope
)
3283 && !(identifier_p (id_expression
)
3284 && IDENTIFIER_TYPENAME_P (id_expression
)
3285 && dependent_type_p (TREE_TYPE (id_expression
))))))
3287 /* If the qualifying type is non-dependent (and the name
3288 does not name a conversion operator to a dependent
3289 type), issue an error. */
3290 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
3291 return error_mark_node
;
3295 /* It may be resolved via Koenig lookup. */
3296 *idk
= CP_ID_KIND_UNQUALIFIED
;
3297 return id_expression
;
3300 decl
= id_expression
;
3302 /* If DECL is a variable that would be out of scope under
3303 ANSI/ISO rules, but in scope in the ARM, name lookup
3304 will succeed. Issue a diagnostic here. */
3306 decl
= check_for_out_of_scope_variable (decl
);
3308 /* Remember that the name was used in the definition of
3309 the current class so that we can check later to see if
3310 the meaning would have been different after the class
3311 was entirely defined. */
3312 if (!scope
&& decl
!= error_mark_node
&& identifier_p (id_expression
))
3313 maybe_note_name_used_in_class (id_expression
, decl
);
3315 /* Disallow uses of local variables from containing functions, except
3316 within lambda-expressions. */
3317 if (outer_automatic_var_p (decl
))
3319 decl
= process_outer_var_ref (decl
, tf_warning_or_error
);
3320 if (decl
== error_mark_node
)
3321 return error_mark_node
;
3324 /* Also disallow uses of function parameters outside the function
3325 body, except inside an unevaluated context (i.e. decltype). */
3326 if (TREE_CODE (decl
) == PARM_DECL
3327 && DECL_CONTEXT (decl
) == NULL_TREE
3328 && !cp_unevaluated_operand
)
3330 *error_msg
= "use of parameter outside function body";
3331 return error_mark_node
;
3335 /* If we didn't find anything, or what we found was a type,
3336 then this wasn't really an id-expression. */
3337 if (TREE_CODE (decl
) == TEMPLATE_DECL
3338 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3340 *error_msg
= "missing template arguments";
3341 return error_mark_node
;
3343 else if (TREE_CODE (decl
) == TYPE_DECL
3344 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3346 *error_msg
= "expected primary-expression";
3347 return error_mark_node
;
3350 /* If the name resolved to a template parameter, there is no
3351 need to look it up again later. */
3352 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3353 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3357 *idk
= CP_ID_KIND_NONE
;
3358 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3359 decl
= TEMPLATE_PARM_DECL (decl
);
3360 r
= convert_from_reference (DECL_INITIAL (decl
));
3362 if (integral_constant_expression_p
3363 && !dependent_type_p (TREE_TYPE (decl
))
3364 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3366 if (!allow_non_integral_constant_expression_p
)
3367 error ("template parameter %qD of type %qT is not allowed in "
3368 "an integral constant expression because it is not of "
3369 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3370 *non_integral_constant_expression_p
= true;
3378 /* If the declaration was explicitly qualified indicate
3379 that. The semantics of `A::f(3)' are different than
3380 `f(3)' if `f' is virtual. */
3382 ? CP_ID_KIND_QUALIFIED
3383 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3384 ? CP_ID_KIND_TEMPLATE_ID
3385 : CP_ID_KIND_UNQUALIFIED
));
3390 An id-expression is type-dependent if it contains an
3391 identifier that was declared with a dependent type.
3393 The standard is not very specific about an id-expression that
3394 names a set of overloaded functions. What if some of them
3395 have dependent types and some of them do not? Presumably,
3396 such a name should be treated as a dependent name. */
3397 /* Assume the name is not dependent. */
3398 dependent_p
= false;
3399 if (!processing_template_decl
)
3400 /* No names are dependent outside a template. */
3402 else if (TREE_CODE (decl
) == CONST_DECL
)
3403 /* We don't want to treat enumerators as dependent. */
3405 /* A template-id where the name of the template was not resolved
3406 is definitely dependent. */
3407 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3408 && (identifier_p (TREE_OPERAND (decl
, 0))))
3410 /* For anything except an overloaded function, just check its
3412 else if (!is_overloaded_fn (decl
))
3414 = dependent_type_p (TREE_TYPE (decl
));
3415 /* For a set of overloaded functions, check each of the
3421 if (BASELINK_P (fns
))
3422 fns
= BASELINK_FUNCTIONS (fns
);
3424 /* For a template-id, check to see if the template
3425 arguments are dependent. */
3426 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3428 tree args
= TREE_OPERAND (fns
, 1);
3429 dependent_p
= any_dependent_template_arguments_p (args
);
3430 /* The functions are those referred to by the
3432 fns
= TREE_OPERAND (fns
, 0);
3435 /* If there are no dependent template arguments, go through
3436 the overloaded functions. */
3437 while (fns
&& !dependent_p
)
3439 tree fn
= OVL_CURRENT (fns
);
3441 /* Member functions of dependent classes are
3443 if (TREE_CODE (fn
) == FUNCTION_DECL
3444 && type_dependent_expression_p (fn
))
3446 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3447 && dependent_template_p (fn
))
3450 fns
= OVL_NEXT (fns
);
3454 /* If the name was dependent on a template parameter, we will
3455 resolve the name at instantiation time. */
3458 /* Create a SCOPE_REF for qualified names, if the scope is
3464 if (address_p
&& done
)
3465 decl
= finish_qualified_id_expr (scope
, decl
,
3469 tf_warning_or_error
);
3472 tree type
= NULL_TREE
;
3473 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3474 type
= TREE_TYPE (decl
);
3475 decl
= build_qualified_name (type
,
3481 if (TREE_TYPE (decl
))
3482 decl
= convert_from_reference (decl
);
3485 /* A TEMPLATE_ID already contains all the information we
3487 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3488 return id_expression
;
3489 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3490 /* If we found a variable, then name lookup during the
3491 instantiation will always resolve to the same VAR_DECL
3492 (or an instantiation thereof). */
3494 || TREE_CODE (decl
) == PARM_DECL
)
3497 return convert_from_reference (decl
);
3499 /* The same is true for FIELD_DECL, but we also need to
3500 make sure that the syntax is correct. */
3501 else if (TREE_CODE (decl
) == FIELD_DECL
)
3503 /* Since SCOPE is NULL here, this is an unqualified name.
3504 Access checking has been performed during name lookup
3505 already. Turn off checking to avoid duplicate errors. */
3506 push_deferring_access_checks (dk_no_check
);
3507 decl
= finish_non_static_data_member
3509 /*qualifying_scope=*/NULL_TREE
);
3510 pop_deferring_access_checks ();
3513 return id_expression
;
3516 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3518 error ("use of namespace %qD as expression", decl
);
3519 return error_mark_node
;
3521 else if (DECL_CLASS_TEMPLATE_P (decl
))
3523 error ("use of class template %qT as expression", decl
);
3524 return error_mark_node
;
3526 else if (TREE_CODE (decl
) == TREE_LIST
)
3528 /* Ambiguous reference to base members. */
3529 error ("request for member %qD is ambiguous in "
3530 "multiple inheritance lattice", id_expression
);
3531 print_candidates (decl
);
3532 return error_mark_node
;
3535 /* Mark variable-like entities as used. Functions are similarly
3536 marked either below or after overload resolution. */
3538 || TREE_CODE (decl
) == PARM_DECL
3539 || TREE_CODE (decl
) == CONST_DECL
3540 || TREE_CODE (decl
) == RESULT_DECL
)
3541 && !mark_used (decl
))
3542 return error_mark_node
;
3544 /* Only certain kinds of names are allowed in constant
3545 expression. Template parameters have already
3546 been handled above. */
3547 if (! error_operand_p (decl
)
3548 && integral_constant_expression_p
3549 && ! decl_constant_var_p (decl
)
3550 && TREE_CODE (decl
) != CONST_DECL
3551 && ! builtin_valid_in_constant_expr_p (decl
))
3553 if (!allow_non_integral_constant_expression_p
)
3555 error ("%qD cannot appear in a constant-expression", decl
);
3556 return error_mark_node
;
3558 *non_integral_constant_expression_p
= true;
3563 && !cp_unevaluated_operand
3564 && !processing_template_decl
3565 && (TREE_STATIC (decl
) || DECL_EXTERNAL (decl
))
3566 && DECL_THREAD_LOCAL_P (decl
)
3567 && (wrap
= get_tls_wrapper_fn (decl
)))
3569 /* Replace an evaluated use of the thread_local variable with
3570 a call to its wrapper. */
3571 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3573 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3574 && variable_template_p (TREE_OPERAND (decl
, 0)))
3576 decl
= finish_template_variable (decl
);
3581 decl
= (adjust_result_of_qualified_name_lookup
3582 (decl
, scope
, current_nonlambda_class_type()));
3584 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3588 decl
= finish_qualified_id_expr (scope
,
3594 tf_warning_or_error
);
3596 decl
= convert_from_reference (decl
);
3598 else if (TREE_CODE (decl
) == FIELD_DECL
)
3600 /* Since SCOPE is NULL here, this is an unqualified name.
3601 Access checking has been performed during name lookup
3602 already. Turn off checking to avoid duplicate errors. */
3603 push_deferring_access_checks (dk_no_check
);
3604 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3605 /*qualifying_scope=*/NULL_TREE
);
3606 pop_deferring_access_checks ();
3608 else if (is_overloaded_fn (decl
))
3612 first_fn
= get_first_fn (decl
);
3613 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3614 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3616 if (!really_overloaded_fn (decl
)
3617 && !mark_used (first_fn
))
3618 return error_mark_node
;
3621 && TREE_CODE (first_fn
) == FUNCTION_DECL
3622 && DECL_FUNCTION_MEMBER_P (first_fn
)
3623 && !shared_member_p (decl
))
3625 /* A set of member functions. */
3626 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3627 return finish_class_member_access_expr (decl
, id_expression
,
3628 /*template_p=*/false,
3629 tf_warning_or_error
);
3632 decl
= baselink_for_fns (decl
);
3636 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3637 && DECL_CLASS_SCOPE_P (decl
))
3639 tree context
= context_for_name_lookup (decl
);
3640 if (context
!= current_class_type
)
3642 tree path
= currently_open_derived_class (context
);
3643 perform_or_defer_access_check (TYPE_BINFO (path
),
3645 tf_warning_or_error
);
3649 decl
= convert_from_reference (decl
);
3653 /* Handle references (c++/56130). */
3654 tree t
= REFERENCE_REF_P (decl
) ? TREE_OPERAND (decl
, 0) : decl
;
3655 if (TREE_DEPRECATED (t
))
3656 warn_deprecated_use (t
, NULL_TREE
);
3661 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3662 use as a type-specifier. */
3665 finish_typeof (tree expr
)
3669 if (type_dependent_expression_p (expr
))
3671 type
= cxx_make_type (TYPEOF_TYPE
);
3672 TYPEOF_TYPE_EXPR (type
) = expr
;
3673 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3678 expr
= mark_type_use (expr
);
3680 type
= unlowered_expr_type (expr
);
3682 if (!type
|| type
== unknown_type_node
)
3684 error ("type of %qE is unknown", expr
);
3685 return error_mark_node
;
3691 /* Implement the __underlying_type keyword: Return the underlying
3692 type of TYPE, suitable for use as a type-specifier. */
3695 finish_underlying_type (tree type
)
3697 tree underlying_type
;
3699 if (processing_template_decl
)
3701 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3702 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3703 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3705 return underlying_type
;
3708 complete_type (type
);
3710 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3712 error ("%qT is not an enumeration type", type
);
3713 return error_mark_node
;
3716 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3718 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3719 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3720 See finish_enum_value_list for details. */
3721 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3723 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3724 TYPE_UNSIGNED (underlying_type
));
3726 return underlying_type
;
3729 /* Implement the __direct_bases keyword: Return the direct base classes
3733 calculate_direct_bases (tree type
)
3735 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3736 tree bases_vec
= NULL_TREE
;
3737 vec
<tree
, va_gc
> *base_binfos
;
3741 complete_type (type
);
3743 if (!NON_UNION_CLASS_TYPE_P (type
))
3744 return make_tree_vec (0);
3746 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3748 /* Virtual bases are initialized first */
3749 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3751 if (BINFO_VIRTUAL_P (binfo
))
3753 vec_safe_push (vector
, binfo
);
3757 /* Now non-virtuals */
3758 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3760 if (!BINFO_VIRTUAL_P (binfo
))
3762 vec_safe_push (vector
, binfo
);
3767 bases_vec
= make_tree_vec (vector
->length ());
3769 for (i
= 0; i
< vector
->length (); ++i
)
3771 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3776 /* Implement the __bases keyword: Return the base classes
3779 /* Find morally non-virtual base classes by walking binfo hierarchy */
3780 /* Virtual base classes are handled separately in finish_bases */
3783 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3785 /* Don't walk bases of virtual bases */
3786 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3790 dfs_calculate_bases_post (tree binfo
, void *data_
)
3792 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3793 if (!BINFO_VIRTUAL_P (binfo
))
3795 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3800 /* Calculates the morally non-virtual base classes of a class */
3801 static vec
<tree
, va_gc
> *
3802 calculate_bases_helper (tree type
)
3804 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3806 /* Now add non-virtual base classes in order of construction */
3807 dfs_walk_all (TYPE_BINFO (type
),
3808 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3813 calculate_bases (tree type
)
3815 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3816 tree bases_vec
= NULL_TREE
;
3818 vec
<tree
, va_gc
> *vbases
;
3819 vec
<tree
, va_gc
> *nonvbases
;
3822 complete_type (type
);
3824 if (!NON_UNION_CLASS_TYPE_P (type
))
3825 return make_tree_vec (0);
3827 /* First go through virtual base classes */
3828 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3829 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3831 vec
<tree
, va_gc
> *vbase_bases
;
3832 vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3833 vec_safe_splice (vector
, vbase_bases
);
3834 release_tree_vector (vbase_bases
);
3837 /* Now for the non-virtual bases */
3838 nonvbases
= calculate_bases_helper (type
);
3839 vec_safe_splice (vector
, nonvbases
);
3840 release_tree_vector (nonvbases
);
3842 /* Last element is entire class, so don't copy */
3843 bases_vec
= make_tree_vec (vector
->length () - 1);
3845 for (i
= 0; i
< vector
->length () - 1; ++i
)
3847 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3849 release_tree_vector (vector
);
3854 finish_bases (tree type
, bool direct
)
3856 tree bases
= NULL_TREE
;
3858 if (!processing_template_decl
)
3860 /* Parameter packs can only be used in templates */
3861 error ("Parameter pack __bases only valid in template declaration");
3862 return error_mark_node
;
3865 bases
= cxx_make_type (BASES
);
3866 BASES_TYPE (bases
) = type
;
3867 BASES_DIRECT (bases
) = direct
;
3868 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3873 /* Perform C++-specific checks for __builtin_offsetof before calling
3877 finish_offsetof (tree expr
, location_t loc
)
3879 /* If we're processing a template, we can't finish the semantics yet.
3880 Otherwise we can fold the entire expression now. */
3881 if (processing_template_decl
)
3883 expr
= build1 (OFFSETOF_EXPR
, size_type_node
, expr
);
3884 SET_EXPR_LOCATION (expr
, loc
);
3888 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3890 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3891 TREE_OPERAND (expr
, 2));
3892 return error_mark_node
;
3894 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3895 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3896 || TREE_TYPE (expr
) == unknown_type_node
)
3898 if (INDIRECT_REF_P (expr
))
3899 error ("second operand of %<offsetof%> is neither a single "
3900 "identifier nor a sequence of member accesses and "
3901 "array references");
3904 if (TREE_CODE (expr
) == COMPONENT_REF
3905 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3906 expr
= TREE_OPERAND (expr
, 1);
3907 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3909 return error_mark_node
;
3911 if (REFERENCE_REF_P (expr
))
3912 expr
= TREE_OPERAND (expr
, 0);
3913 if (TREE_CODE (expr
) == COMPONENT_REF
)
3915 tree object
= TREE_OPERAND (expr
, 0);
3916 if (!complete_type_or_else (TREE_TYPE (object
), object
))
3917 return error_mark_node
;
3918 if (warn_invalid_offsetof
3919 && CLASS_TYPE_P (TREE_TYPE (object
))
3920 && CLASSTYPE_NON_STD_LAYOUT (TREE_TYPE (object
))
3921 && cp_unevaluated_operand
== 0)
3922 pedwarn (loc
, OPT_Winvalid_offsetof
,
3923 "offsetof within non-standard-layout type %qT is undefined",
3924 TREE_TYPE (object
));
3926 return fold_offsetof (expr
);
3929 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3930 function is broken out from the above for the benefit of the tree-ssa
3934 simplify_aggr_init_expr (tree
*tp
)
3936 tree aggr_init_expr
= *tp
;
3938 /* Form an appropriate CALL_EXPR. */
3939 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3940 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3941 tree type
= TREE_TYPE (slot
);
3944 enum style_t
{ ctor
, arg
, pcc
} style
;
3946 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3948 #ifdef PCC_STATIC_STRUCT_RETURN
3954 gcc_assert (TREE_ADDRESSABLE (type
));
3958 call_expr
= build_call_array_loc (input_location
,
3959 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3961 aggr_init_expr_nargs (aggr_init_expr
),
3962 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3963 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3964 CALL_EXPR_LIST_INIT_P (call_expr
) = CALL_EXPR_LIST_INIT_P (aggr_init_expr
);
3968 /* Replace the first argument to the ctor with the address of the
3970 cxx_mark_addressable (slot
);
3971 CALL_EXPR_ARG (call_expr
, 0) =
3972 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3974 else if (style
== arg
)
3976 /* Just mark it addressable here, and leave the rest to
3977 expand_call{,_inline}. */
3978 cxx_mark_addressable (slot
);
3979 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3980 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3982 else if (style
== pcc
)
3984 /* If we're using the non-reentrant PCC calling convention, then we
3985 need to copy the returned value out of the static buffer into the
3987 push_deferring_access_checks (dk_no_check
);
3988 call_expr
= build_aggr_init (slot
, call_expr
,
3989 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3990 tf_warning_or_error
);
3991 pop_deferring_access_checks ();
3992 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3995 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3997 tree init
= build_zero_init (type
, NULL_TREE
,
3998 /*static_storage_p=*/false);
3999 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
4000 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
4007 /* Emit all thunks to FN that should be emitted when FN is emitted. */
4010 emit_associated_thunks (tree fn
)
4012 /* When we use vcall offsets, we emit thunks with the virtual
4013 functions to which they thunk. The whole point of vcall offsets
4014 is so that you can know statically the entire set of thunks that
4015 will ever be needed for a given virtual function, thereby
4016 enabling you to output all the thunks with the function itself. */
4017 if (DECL_VIRTUAL_P (fn
)
4018 /* Do not emit thunks for extern template instantiations. */
4019 && ! DECL_REALLY_EXTERN (fn
))
4023 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
4025 if (!THUNK_ALIAS (thunk
))
4027 use_thunk (thunk
, /*emit_p=*/1);
4028 if (DECL_RESULT_THUNK_P (thunk
))
4032 for (probe
= DECL_THUNKS (thunk
);
4033 probe
; probe
= DECL_CHAIN (probe
))
4034 use_thunk (probe
, /*emit_p=*/1);
4038 gcc_assert (!DECL_THUNKS (thunk
));
4043 /* Generate RTL for FN. */
4046 expand_or_defer_fn_1 (tree fn
)
4048 /* When the parser calls us after finishing the body of a template
4049 function, we don't really want to expand the body. */
4050 if (processing_template_decl
)
4052 /* Normally, collection only occurs in rest_of_compilation. So,
4053 if we don't collect here, we never collect junk generated
4054 during the processing of templates until we hit a
4055 non-template function. It's not safe to do this inside a
4056 nested class, though, as the parser may have local state that
4057 is not a GC root. */
4058 if (!function_depth
)
4063 gcc_assert (DECL_SAVED_TREE (fn
));
4065 /* We make a decision about linkage for these functions at the end
4066 of the compilation. Until that point, we do not want the back
4067 end to output them -- but we do want it to see the bodies of
4068 these functions so that it can inline them as appropriate. */
4069 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
4071 if (DECL_INTERFACE_KNOWN (fn
))
4072 /* We've already made a decision as to how this function will
4075 tentative_decl_linkage (fn
);
4077 import_export_decl (fn
);
4079 /* If the user wants us to keep all inline functions, then mark
4080 this function as needed so that finish_file will make sure to
4081 output it later. Similarly, all dllexport'd functions must
4082 be emitted; there may be callers in other DLLs. */
4083 if (DECL_DECLARED_INLINE_P (fn
)
4084 && !DECL_REALLY_EXTERN (fn
)
4085 && (flag_keep_inline_functions
4086 || (flag_keep_inline_dllexport
4087 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))))
4090 DECL_EXTERNAL (fn
) = 0;
4094 /* If this is a constructor or destructor body, we have to clone
4096 if (maybe_clone_body (fn
))
4098 /* We don't want to process FN again, so pretend we've written
4099 it out, even though we haven't. */
4100 TREE_ASM_WRITTEN (fn
) = 1;
4101 /* If this is an instantiation of a constexpr function, keep
4102 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
4103 if (!is_instantiation_of_constexpr (fn
))
4104 DECL_SAVED_TREE (fn
) = NULL_TREE
;
4108 /* There's no reason to do any of the work here if we're only doing
4109 semantic analysis; this code just generates RTL. */
4110 if (flag_syntax_only
)
4117 expand_or_defer_fn (tree fn
)
4119 if (expand_or_defer_fn_1 (fn
))
4123 /* Expand or defer, at the whim of the compilation unit manager. */
4124 cgraph_node::finalize_function (fn
, function_depth
> 1);
4125 emit_associated_thunks (fn
);
4133 nrv_data () : visited (37) {}
4137 hash_table
<pointer_hash
<tree_node
> > visited
;
4140 /* Helper function for walk_tree, used by finalize_nrv below. */
4143 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
4145 struct nrv_data
*dp
= (struct nrv_data
*)data
;
4148 /* No need to walk into types. There wouldn't be any need to walk into
4149 non-statements, except that we have to consider STMT_EXPRs. */
4152 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
4153 but differs from using NULL_TREE in that it indicates that we care
4154 about the value of the RESULT_DECL. */
4155 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
4156 TREE_OPERAND (*tp
, 0) = dp
->result
;
4157 /* Change all cleanups for the NRV to only run when an exception is
4159 else if (TREE_CODE (*tp
) == CLEANUP_STMT
4160 && CLEANUP_DECL (*tp
) == dp
->var
)
4161 CLEANUP_EH_ONLY (*tp
) = 1;
4162 /* Replace the DECL_EXPR for the NRV with an initialization of the
4163 RESULT_DECL, if needed. */
4164 else if (TREE_CODE (*tp
) == DECL_EXPR
4165 && DECL_EXPR_DECL (*tp
) == dp
->var
)
4168 if (DECL_INITIAL (dp
->var
)
4169 && DECL_INITIAL (dp
->var
) != error_mark_node
)
4170 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
4171 DECL_INITIAL (dp
->var
));
4173 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
4174 DECL_INITIAL (dp
->var
) = NULL_TREE
;
4175 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
4178 /* And replace all uses of the NRV with the RESULT_DECL. */
4179 else if (*tp
== dp
->var
)
4182 /* Avoid walking into the same tree more than once. Unfortunately, we
4183 can't just use walk_tree_without duplicates because it would only call
4184 us for the first occurrence of dp->var in the function body. */
4185 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
4191 /* Keep iterating. */
4195 /* Called from finish_function to implement the named return value
4196 optimization by overriding all the RETURN_EXPRs and pertinent
4197 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4198 RESULT_DECL for the function. */
4201 finalize_nrv (tree
*tp
, tree var
, tree result
)
4203 struct nrv_data data
;
4205 /* Copy name from VAR to RESULT. */
4206 DECL_NAME (result
) = DECL_NAME (var
);
4207 /* Don't forget that we take its address. */
4208 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
4209 /* Finally set DECL_VALUE_EXPR to avoid assigning
4210 a stack slot at -O0 for the original var and debug info
4211 uses RESULT location for VAR. */
4212 SET_DECL_VALUE_EXPR (var
, result
);
4213 DECL_HAS_VALUE_EXPR_P (var
) = 1;
4216 data
.result
= result
;
4217 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
4220 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4223 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4224 bool need_copy_ctor
, bool need_copy_assignment
,
4227 int save_errorcount
= errorcount
;
4230 /* Always allocate 3 elements for simplicity. These are the
4231 function decls for the ctor, dtor, and assignment op.
4232 This layout is known to the three lang hooks,
4233 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4234 and cxx_omp_clause_assign_op. */
4235 info
= make_tree_vec (3);
4236 CP_OMP_CLAUSE_INFO (c
) = info
;
4238 if (need_default_ctor
|| need_copy_ctor
)
4240 if (need_default_ctor
)
4241 t
= get_default_ctor (type
);
4243 t
= get_copy_ctor (type
, tf_warning_or_error
);
4245 if (t
&& !trivial_fn_p (t
))
4246 TREE_VEC_ELT (info
, 0) = t
;
4249 if (need_dtor
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4250 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4252 if (need_copy_assignment
)
4254 t
= get_copy_assign (type
);
4256 if (t
&& !trivial_fn_p (t
))
4257 TREE_VEC_ELT (info
, 2) = t
;
4260 return errorcount
!= save_errorcount
;
4263 /* Helper function for handle_omp_array_sections. Called recursively
4264 to handle multiple array-section-subscripts. C is the clause,
4265 T current expression (initially OMP_CLAUSE_DECL), which is either
4266 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4267 expression if specified, TREE_VALUE length expression if specified,
4268 TREE_CHAIN is what it has been specified after, or some decl.
4269 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4270 set to true if any of the array-section-subscript could have length
4271 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4272 first array-section-subscript which is known not to have length
4274 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4275 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4276 all are or may have length of 1, array-section-subscript [:2] is the
4277 first one knonwn not to have length 1. For array-section-subscript
4278 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4279 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4280 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4281 case though, as some lengths could be zero. */
4284 handle_omp_array_sections_1 (tree c
, tree t
, vec
<tree
> &types
,
4285 bool &maybe_zero_len
, unsigned int &first_non_one
)
4287 tree ret
, low_bound
, length
, type
;
4288 if (TREE_CODE (t
) != TREE_LIST
)
4290 if (error_operand_p (t
))
4291 return error_mark_node
;
4292 if (type_dependent_expression_p (t
))
4294 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4296 if (processing_template_decl
)
4299 error_at (OMP_CLAUSE_LOCATION (c
),
4300 "%qD is not a variable in %qs clause", t
,
4301 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4303 error_at (OMP_CLAUSE_LOCATION (c
),
4304 "%qE is not a variable in %qs clause", t
,
4305 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4306 return error_mark_node
;
4308 else if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4309 && TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4311 error_at (OMP_CLAUSE_LOCATION (c
),
4312 "%qD is threadprivate variable in %qs clause", t
,
4313 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4314 return error_mark_node
;
4316 t
= convert_from_reference (t
);
4320 ret
= handle_omp_array_sections_1 (c
, TREE_CHAIN (t
), types
,
4321 maybe_zero_len
, first_non_one
);
4322 if (ret
== error_mark_node
|| ret
== NULL_TREE
)
4325 type
= TREE_TYPE (ret
);
4326 low_bound
= TREE_PURPOSE (t
);
4327 length
= TREE_VALUE (t
);
4328 if ((low_bound
&& type_dependent_expression_p (low_bound
))
4329 || (length
&& type_dependent_expression_p (length
)))
4332 if (low_bound
== error_mark_node
|| length
== error_mark_node
)
4333 return error_mark_node
;
4335 if (low_bound
&& !INTEGRAL_TYPE_P (TREE_TYPE (low_bound
)))
4337 error_at (OMP_CLAUSE_LOCATION (c
),
4338 "low bound %qE of array section does not have integral type",
4340 return error_mark_node
;
4342 if (length
&& !INTEGRAL_TYPE_P (TREE_TYPE (length
)))
4344 error_at (OMP_CLAUSE_LOCATION (c
),
4345 "length %qE of array section does not have integral type",
4347 return error_mark_node
;
4350 low_bound
= mark_rvalue_use (low_bound
);
4352 length
= mark_rvalue_use (length
);
4354 && TREE_CODE (low_bound
) == INTEGER_CST
4355 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4356 > TYPE_PRECISION (sizetype
))
4357 low_bound
= fold_convert (sizetype
, low_bound
);
4359 && TREE_CODE (length
) == INTEGER_CST
4360 && TYPE_PRECISION (TREE_TYPE (length
))
4361 > TYPE_PRECISION (sizetype
))
4362 length
= fold_convert (sizetype
, length
);
4363 if (low_bound
== NULL_TREE
)
4364 low_bound
= integer_zero_node
;
4366 if (length
!= NULL_TREE
)
4368 if (!integer_nonzerop (length
))
4369 maybe_zero_len
= true;
4370 if (first_non_one
== types
.length ()
4371 && (TREE_CODE (length
) != INTEGER_CST
|| integer_onep (length
)))
4374 if (TREE_CODE (type
) == ARRAY_TYPE
)
4376 if (length
== NULL_TREE
4377 && (TYPE_DOMAIN (type
) == NULL_TREE
4378 || TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL_TREE
))
4380 error_at (OMP_CLAUSE_LOCATION (c
),
4381 "for unknown bound array type length expression must "
4383 return error_mark_node
;
4385 if (TREE_CODE (low_bound
) == INTEGER_CST
4386 && tree_int_cst_sgn (low_bound
) == -1)
4388 error_at (OMP_CLAUSE_LOCATION (c
),
4389 "negative low bound in array section in %qs clause",
4390 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4391 return error_mark_node
;
4393 if (length
!= NULL_TREE
4394 && TREE_CODE (length
) == INTEGER_CST
4395 && tree_int_cst_sgn (length
) == -1)
4397 error_at (OMP_CLAUSE_LOCATION (c
),
4398 "negative length in array section in %qs clause",
4399 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4400 return error_mark_node
;
4402 if (TYPE_DOMAIN (type
)
4403 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
))
4404 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
4407 tree size
= size_binop (PLUS_EXPR
,
4408 TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4410 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4412 if (tree_int_cst_lt (size
, low_bound
))
4414 error_at (OMP_CLAUSE_LOCATION (c
),
4415 "low bound %qE above array section size "
4416 "in %qs clause", low_bound
,
4417 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4418 return error_mark_node
;
4420 if (tree_int_cst_equal (size
, low_bound
))
4421 maybe_zero_len
= true;
4422 else if (length
== NULL_TREE
4423 && first_non_one
== types
.length ()
4424 && tree_int_cst_equal
4425 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
4429 else if (length
== NULL_TREE
)
4431 maybe_zero_len
= true;
4432 if (first_non_one
== types
.length ())
4435 if (length
&& TREE_CODE (length
) == INTEGER_CST
)
4437 if (tree_int_cst_lt (size
, length
))
4439 error_at (OMP_CLAUSE_LOCATION (c
),
4440 "length %qE above array section size "
4441 "in %qs clause", length
,
4442 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4443 return error_mark_node
;
4445 if (TREE_CODE (low_bound
) == INTEGER_CST
)
4448 = size_binop (PLUS_EXPR
,
4449 fold_convert (sizetype
, low_bound
),
4450 fold_convert (sizetype
, length
));
4451 if (TREE_CODE (lbpluslen
) == INTEGER_CST
4452 && tree_int_cst_lt (size
, lbpluslen
))
4454 error_at (OMP_CLAUSE_LOCATION (c
),
4455 "high bound %qE above array section size "
4456 "in %qs clause", lbpluslen
,
4457 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4458 return error_mark_node
;
4463 else if (length
== NULL_TREE
)
4465 maybe_zero_len
= true;
4466 if (first_non_one
== types
.length ())
4470 /* For [lb:] we will need to evaluate lb more than once. */
4471 if (length
== NULL_TREE
&& OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4473 tree lb
= cp_save_expr (low_bound
);
4474 if (lb
!= low_bound
)
4476 TREE_PURPOSE (t
) = lb
;
4481 else if (TREE_CODE (type
) == POINTER_TYPE
)
4483 if (length
== NULL_TREE
)
4485 error_at (OMP_CLAUSE_LOCATION (c
),
4486 "for pointer type length expression must be specified");
4487 return error_mark_node
;
4489 /* If there is a pointer type anywhere but in the very first
4490 array-section-subscript, the array section can't be contiguous. */
4491 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
4492 && TREE_CODE (TREE_CHAIN (t
)) == TREE_LIST
)
4494 error_at (OMP_CLAUSE_LOCATION (c
),
4495 "array section is not contiguous in %qs clause",
4496 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4497 return error_mark_node
;
4502 error_at (OMP_CLAUSE_LOCATION (c
),
4503 "%qE does not have pointer or array type", ret
);
4504 return error_mark_node
;
4506 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_DEPEND
)
4507 types
.safe_push (TREE_TYPE (ret
));
4508 /* We will need to evaluate lb more than once. */
4509 tree lb
= cp_save_expr (low_bound
);
4510 if (lb
!= low_bound
)
4512 TREE_PURPOSE (t
) = lb
;
4515 ret
= grok_array_decl (OMP_CLAUSE_LOCATION (c
), ret
, low_bound
, false);
4519 /* Handle array sections for clause C. */
4522 handle_omp_array_sections (tree c
)
4524 bool maybe_zero_len
= false;
4525 unsigned int first_non_one
= 0;
4526 auto_vec
<tree
> types
;
4527 tree first
= handle_omp_array_sections_1 (c
, OMP_CLAUSE_DECL (c
), types
,
4528 maybe_zero_len
, first_non_one
);
4529 if (first
== error_mark_node
)
4531 if (first
== NULL_TREE
)
4533 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_DEPEND
)
4535 tree t
= OMP_CLAUSE_DECL (c
);
4536 tree tem
= NULL_TREE
;
4537 if (processing_template_decl
)
4539 /* Need to evaluate side effects in the length expressions
4541 while (TREE_CODE (t
) == TREE_LIST
)
4543 if (TREE_VALUE (t
) && TREE_SIDE_EFFECTS (TREE_VALUE (t
)))
4545 if (tem
== NULL_TREE
)
4546 tem
= TREE_VALUE (t
);
4548 tem
= build2 (COMPOUND_EXPR
, TREE_TYPE (tem
),
4549 TREE_VALUE (t
), tem
);
4554 first
= build2 (COMPOUND_EXPR
, TREE_TYPE (first
), tem
, first
);
4555 OMP_CLAUSE_DECL (c
) = first
;
4559 unsigned int num
= types
.length (), i
;
4560 tree t
, side_effects
= NULL_TREE
, size
= NULL_TREE
;
4561 tree condition
= NULL_TREE
;
4563 if (int_size_in_bytes (TREE_TYPE (first
)) <= 0)
4564 maybe_zero_len
= true;
4565 if (processing_template_decl
&& maybe_zero_len
)
4568 for (i
= num
, t
= OMP_CLAUSE_DECL (c
); i
> 0;
4571 tree low_bound
= TREE_PURPOSE (t
);
4572 tree length
= TREE_VALUE (t
);
4576 && TREE_CODE (low_bound
) == INTEGER_CST
4577 && TYPE_PRECISION (TREE_TYPE (low_bound
))
4578 > TYPE_PRECISION (sizetype
))
4579 low_bound
= fold_convert (sizetype
, low_bound
);
4581 && TREE_CODE (length
) == INTEGER_CST
4582 && TYPE_PRECISION (TREE_TYPE (length
))
4583 > TYPE_PRECISION (sizetype
))
4584 length
= fold_convert (sizetype
, length
);
4585 if (low_bound
== NULL_TREE
)
4586 low_bound
= integer_zero_node
;
4587 if (!maybe_zero_len
&& i
> first_non_one
)
4589 if (integer_nonzerop (low_bound
))
4590 goto do_warn_noncontiguous
;
4591 if (length
!= NULL_TREE
4592 && TREE_CODE (length
) == INTEGER_CST
4593 && TYPE_DOMAIN (types
[i
])
4594 && TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
]))
4595 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])))
4599 size
= size_binop (PLUS_EXPR
,
4600 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4602 if (!tree_int_cst_equal (length
, size
))
4604 do_warn_noncontiguous
:
4605 error_at (OMP_CLAUSE_LOCATION (c
),
4606 "array section is not contiguous in %qs "
4608 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
4612 if (!processing_template_decl
4613 && length
!= NULL_TREE
4614 && TREE_SIDE_EFFECTS (length
))
4616 if (side_effects
== NULL_TREE
)
4617 side_effects
= length
;
4619 side_effects
= build2 (COMPOUND_EXPR
,
4620 TREE_TYPE (side_effects
),
4621 length
, side_effects
);
4624 else if (processing_template_decl
)
4630 if (i
> first_non_one
&& length
&& integer_nonzerop (length
))
4633 l
= fold_convert (sizetype
, length
);
4636 l
= size_binop (PLUS_EXPR
,
4637 TYPE_MAX_VALUE (TYPE_DOMAIN (types
[i
])),
4639 l
= size_binop (MINUS_EXPR
, l
,
4640 fold_convert (sizetype
, low_bound
));
4642 if (i
> first_non_one
)
4644 l
= fold_build2 (NE_EXPR
, boolean_type_node
, l
,
4646 if (condition
== NULL_TREE
)
4649 condition
= fold_build2 (BIT_AND_EXPR
, boolean_type_node
,
4652 else if (size
== NULL_TREE
)
4654 size
= size_in_bytes (TREE_TYPE (types
[i
]));
4655 size
= size_binop (MULT_EXPR
, size
, l
);
4657 size
= fold_build3 (COND_EXPR
, sizetype
, condition
,
4658 size
, size_zero_node
);
4661 size
= size_binop (MULT_EXPR
, size
, l
);
4664 if (!processing_template_decl
)
4667 size
= build2 (COMPOUND_EXPR
, sizetype
, side_effects
, size
);
4668 OMP_CLAUSE_DECL (c
) = first
;
4669 OMP_CLAUSE_SIZE (c
) = size
;
4670 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
4672 tree c2
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
4674 OMP_CLAUSE_SET_MAP_KIND (c2
, GOMP_MAP_POINTER
);
4675 if (!cxx_mark_addressable (t
))
4677 OMP_CLAUSE_DECL (c2
) = t
;
4678 t
= build_fold_addr_expr (first
);
4679 t
= fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4680 ptrdiff_type_node
, t
);
4681 tree ptr
= OMP_CLAUSE_DECL (c2
);
4682 ptr
= convert_from_reference (ptr
);
4683 if (!POINTER_TYPE_P (TREE_TYPE (ptr
)))
4684 ptr
= build_fold_addr_expr (ptr
);
4685 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
), MINUS_EXPR
,
4686 ptrdiff_type_node
, t
,
4687 fold_convert_loc (OMP_CLAUSE_LOCATION (c
),
4688 ptrdiff_type_node
, ptr
));
4689 OMP_CLAUSE_SIZE (c2
) = t
;
4690 OMP_CLAUSE_CHAIN (c2
) = OMP_CLAUSE_CHAIN (c
);
4691 OMP_CLAUSE_CHAIN (c
) = c2
;
4692 ptr
= OMP_CLAUSE_DECL (c2
);
4693 if (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
4694 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr
))))
4696 tree c3
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
4698 OMP_CLAUSE_SET_MAP_KIND (c3
, GOMP_MAP_POINTER
);
4699 OMP_CLAUSE_DECL (c3
) = ptr
;
4700 OMP_CLAUSE_DECL (c2
) = convert_from_reference (ptr
);
4701 OMP_CLAUSE_SIZE (c3
) = size_zero_node
;
4702 OMP_CLAUSE_CHAIN (c3
) = OMP_CLAUSE_CHAIN (c2
);
4703 OMP_CLAUSE_CHAIN (c2
) = c3
;
4710 /* Return identifier to look up for omp declare reduction. */
4713 omp_reduction_id (enum tree_code reduction_code
, tree reduction_id
, tree type
)
4715 const char *p
= NULL
;
4716 const char *m
= NULL
;
4717 switch (reduction_code
)
4725 case TRUTH_ANDIF_EXPR
:
4726 case TRUTH_ORIF_EXPR
:
4727 reduction_id
= ansi_opname (reduction_code
);
4741 if (TREE_CODE (reduction_id
) != IDENTIFIER_NODE
)
4742 return error_mark_node
;
4743 p
= IDENTIFIER_POINTER (reduction_id
);
4746 if (type
!= NULL_TREE
)
4747 m
= mangle_type_string (TYPE_MAIN_VARIANT (type
));
4749 const char prefix
[] = "omp declare reduction ";
4750 size_t lenp
= sizeof (prefix
);
4751 if (strncmp (p
, prefix
, lenp
- 1) == 0)
4753 size_t len
= strlen (p
);
4754 size_t lenm
= m
? strlen (m
) + 1 : 0;
4755 char *name
= XALLOCAVEC (char, lenp
+ len
+ lenm
);
4757 memcpy (name
, prefix
, lenp
- 1);
4758 memcpy (name
+ lenp
- 1, p
, len
+ 1);
4761 name
[lenp
+ len
- 1] = '~';
4762 memcpy (name
+ lenp
+ len
, m
, lenm
);
4764 return get_identifier (name
);
4767 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
4768 FUNCTION_DECL or NULL_TREE if not found. */
4771 omp_reduction_lookup (location_t loc
, tree id
, tree type
, tree
*baselinkp
,
4772 vec
<tree
> *ambiguousp
)
4775 tree baselink
= NULL_TREE
;
4776 if (identifier_p (id
))
4779 bool nonint_cst_expression_p
;
4780 const char *error_msg
;
4781 id
= omp_reduction_id (ERROR_MARK
, id
, type
);
4782 tree decl
= lookup_name (id
);
4783 if (decl
== NULL_TREE
)
4784 decl
= error_mark_node
;
4785 id
= finish_id_expression (id
, decl
, NULL_TREE
, &idk
, false, true,
4786 &nonint_cst_expression_p
, false, true, false,
4787 false, &error_msg
, loc
);
4788 if (idk
== CP_ID_KIND_UNQUALIFIED
4789 && identifier_p (id
))
4791 vec
<tree
, va_gc
> *args
= NULL
;
4792 vec_safe_push (args
, build_reference_type (type
));
4793 id
= perform_koenig_lookup (id
, args
, tf_none
);
4796 else if (TREE_CODE (id
) == SCOPE_REF
)
4797 id
= lookup_qualified_name (TREE_OPERAND (id
, 0),
4798 omp_reduction_id (ERROR_MARK
,
4799 TREE_OPERAND (id
, 1),
4803 if (id
&& is_overloaded_fn (id
))
4805 for (; id
; id
= OVL_NEXT (id
))
4807 tree fndecl
= OVL_CURRENT (id
);
4808 if (TREE_CODE (fndecl
) == FUNCTION_DECL
)
4810 tree argtype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
4811 if (same_type_p (TREE_TYPE (argtype
), type
))
4815 if (id
&& BASELINK_P (fns
))
4822 if (id
== NULL_TREE
&& CLASS_TYPE_P (type
) && TYPE_BINFO (type
))
4824 vec
<tree
> ambiguous
= vNULL
;
4825 tree binfo
= TYPE_BINFO (type
), base_binfo
, ret
= NULL_TREE
;
4827 if (ambiguousp
== NULL
)
4828 ambiguousp
= &ambiguous
;
4829 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
4831 id
= omp_reduction_lookup (loc
, orig_id
, BINFO_TYPE (base_binfo
),
4832 baselinkp
? baselinkp
: &baselink
,
4834 if (id
== NULL_TREE
)
4836 if (!ambiguousp
->is_empty ())
4837 ambiguousp
->safe_push (id
);
4838 else if (ret
!= NULL_TREE
)
4840 ambiguousp
->safe_push (ret
);
4841 ambiguousp
->safe_push (id
);
4847 if (ambiguousp
!= &ambiguous
)
4849 if (!ambiguous
.is_empty ())
4851 const char *str
= _("candidates are:");
4854 error_at (loc
, "user defined reduction lookup is ambiguous");
4855 FOR_EACH_VEC_ELT (ambiguous
, idx
, udr
)
4857 inform (DECL_SOURCE_LOCATION (udr
), "%s %#D", str
, udr
);
4859 str
= get_spaces (str
);
4861 ambiguous
.release ();
4862 ret
= error_mark_node
;
4863 baselink
= NULL_TREE
;
4868 perform_or_defer_access_check (BASELINK_BINFO (baselink
),
4869 id
, id
, tf_warning_or_error
);
4873 /* Helper function for cp_parser_omp_declare_reduction_exprs
4875 Remove CLEANUP_STMT for data (omp_priv variable).
4876 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
4880 cp_remove_omp_priv_cleanup_stmt (tree
*tp
, int *walk_subtrees
, void *data
)
4884 else if (TREE_CODE (*tp
) == CLEANUP_STMT
&& CLEANUP_DECL (*tp
) == (tree
) data
)
4885 *tp
= CLEANUP_BODY (*tp
);
4886 else if (TREE_CODE (*tp
) == DECL_EXPR
)
4888 tree decl
= DECL_EXPR_DECL (*tp
);
4889 if (!processing_template_decl
4890 && decl
== (tree
) data
4891 && DECL_INITIAL (decl
)
4892 && DECL_INITIAL (decl
) != error_mark_node
)
4894 tree list
= NULL_TREE
;
4895 append_to_statement_list_force (*tp
, &list
);
4896 tree init_expr
= build2 (INIT_EXPR
, void_type_node
,
4897 decl
, DECL_INITIAL (decl
));
4898 DECL_INITIAL (decl
) = NULL_TREE
;
4899 append_to_statement_list_force (init_expr
, &list
);
4906 /* Data passed from cp_check_omp_declare_reduction to
4907 cp_check_omp_declare_reduction_r. */
4909 struct cp_check_omp_declare_reduction_data
4916 /* Helper function for cp_check_omp_declare_reduction, called via
4920 cp_check_omp_declare_reduction_r (tree
*tp
, int *, void *data
)
4922 struct cp_check_omp_declare_reduction_data
*udr_data
4923 = (struct cp_check_omp_declare_reduction_data
*) data
;
4925 && !DECL_ARTIFICIAL (*tp
)
4926 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 0 : 3])
4927 && *tp
!= DECL_EXPR_DECL (udr_data
->stmts
[udr_data
->combiner_p
? 1 : 4]))
4929 location_t loc
= udr_data
->loc
;
4930 if (udr_data
->combiner_p
)
4931 error_at (loc
, "%<#pragma omp declare reduction%> combiner refers to "
4932 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
4935 error_at (loc
, "%<#pragma omp declare reduction%> initializer refers "
4936 "to variable %qD which is not %<omp_priv%> nor "
4944 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
4947 cp_check_omp_declare_reduction (tree udr
)
4949 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr
)));
4950 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
4951 type
= TREE_TYPE (type
);
4953 location_t loc
= DECL_SOURCE_LOCATION (udr
);
4955 if (type
== error_mark_node
)
4957 if (ARITHMETIC_TYPE_P (type
))
4959 static enum tree_code predef_codes
[]
4960 = { PLUS_EXPR
, MULT_EXPR
, MINUS_EXPR
, BIT_AND_EXPR
, BIT_XOR_EXPR
,
4961 BIT_IOR_EXPR
, TRUTH_ANDIF_EXPR
, TRUTH_ORIF_EXPR
};
4962 for (i
= 0; i
< 8; i
++)
4964 tree id
= omp_reduction_id (predef_codes
[i
], NULL_TREE
, NULL_TREE
);
4965 const char *n1
= IDENTIFIER_POINTER (DECL_NAME (udr
));
4966 const char *n2
= IDENTIFIER_POINTER (id
);
4967 if (strncmp (n1
, n2
, IDENTIFIER_LENGTH (id
)) == 0
4968 && (n1
[IDENTIFIER_LENGTH (id
)] == '~'
4969 || n1
[IDENTIFIER_LENGTH (id
)] == '\0'))
4974 && TREE_CODE (type
) != COMPLEX_EXPR
)
4976 const char prefix_minmax
[] = "omp declare reduction m";
4977 size_t prefix_size
= sizeof (prefix_minmax
) - 1;
4978 const char *n
= IDENTIFIER_POINTER (DECL_NAME (udr
));
4979 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr
)),
4980 prefix_minmax
, prefix_size
) == 0
4981 && ((n
[prefix_size
] == 'i' && n
[prefix_size
+ 1] == 'n')
4982 || (n
[prefix_size
] == 'a' && n
[prefix_size
+ 1] == 'x'))
4983 && (n
[prefix_size
+ 2] == '~' || n
[prefix_size
+ 2] == '\0'))
4988 error_at (loc
, "predeclared arithmetic type %qT in "
4989 "%<#pragma omp declare reduction%>", type
);
4993 else if (TREE_CODE (type
) == FUNCTION_TYPE
4994 || TREE_CODE (type
) == METHOD_TYPE
4995 || TREE_CODE (type
) == ARRAY_TYPE
)
4997 error_at (loc
, "function or array type %qT in "
4998 "%<#pragma omp declare reduction%>", type
);
5001 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5003 error_at (loc
, "reference type %qT in %<#pragma omp declare reduction%>",
5007 else if (TYPE_QUALS_NO_ADDR_SPACE (type
))
5009 error_at (loc
, "const, volatile or __restrict qualified type %qT in "
5010 "%<#pragma omp declare reduction%>", type
);
5014 tree body
= DECL_SAVED_TREE (udr
);
5015 if (body
== NULL_TREE
|| TREE_CODE (body
) != STATEMENT_LIST
)
5018 tree_stmt_iterator tsi
;
5019 struct cp_check_omp_declare_reduction_data data
;
5020 memset (data
.stmts
, 0, sizeof data
.stmts
);
5021 for (i
= 0, tsi
= tsi_start (body
);
5022 i
< 7 && !tsi_end_p (tsi
);
5023 i
++, tsi_next (&tsi
))
5024 data
.stmts
[i
] = tsi_stmt (tsi
);
5026 gcc_assert (tsi_end_p (tsi
));
5029 gcc_assert (TREE_CODE (data
.stmts
[0]) == DECL_EXPR
5030 && TREE_CODE (data
.stmts
[1]) == DECL_EXPR
);
5031 if (TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])))
5033 data
.combiner_p
= true;
5034 if (cp_walk_tree (&data
.stmts
[2], cp_check_omp_declare_reduction_r
,
5036 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5040 gcc_assert (TREE_CODE (data
.stmts
[3]) == DECL_EXPR
5041 && TREE_CODE (data
.stmts
[4]) == DECL_EXPR
);
5042 data
.combiner_p
= false;
5043 if (cp_walk_tree (&data
.stmts
[5], cp_check_omp_declare_reduction_r
,
5045 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data
.stmts
[3])),
5046 cp_check_omp_declare_reduction_r
, &data
, NULL
))
5047 TREE_NO_WARNING (DECL_EXPR_DECL (data
.stmts
[0])) = 1;
5049 gcc_assert (TREE_CODE (data
.stmts
[6]) == DECL_EXPR
);
5053 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
5054 an inline call. But, remap
5055 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
5056 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
5059 clone_omp_udr (tree stmt
, tree omp_decl1
, tree omp_decl2
,
5060 tree decl
, tree placeholder
)
5063 hash_map
<tree
, tree
> decl_map
;
5065 decl_map
.put (omp_decl1
, placeholder
);
5066 decl_map
.put (omp_decl2
, decl
);
5067 memset (&id
, 0, sizeof (id
));
5068 id
.src_fn
= DECL_CONTEXT (omp_decl1
);
5069 id
.dst_fn
= current_function_decl
;
5070 id
.src_cfun
= DECL_STRUCT_FUNCTION (id
.src_fn
);
5071 id
.decl_map
= &decl_map
;
5073 id
.copy_decl
= copy_decl_no_change
;
5074 id
.transform_call_graph_edges
= CB_CGE_DUPLICATE
;
5075 id
.transform_new_cfg
= true;
5076 id
.transform_return_to_modify
= false;
5077 id
.transform_lang_insert_block
= NULL
;
5079 walk_tree (&stmt
, copy_tree_body_r
, &id
, NULL
);
5083 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
5084 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
5087 find_omp_placeholder_r (tree
*tp
, int *, void *data
)
5089 if (*tp
== (tree
) data
)
5094 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
5095 Return true if there is some error and the clause should be removed. */
5098 finish_omp_reduction_clause (tree c
, bool *need_default_ctor
, bool *need_dtor
)
5100 tree t
= OMP_CLAUSE_DECL (c
);
5101 bool predefined
= false;
5102 tree type
= TREE_TYPE (t
);
5103 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5104 type
= TREE_TYPE (type
);
5105 if (type
== error_mark_node
)
5107 else if (ARITHMETIC_TYPE_P (type
))
5108 switch (OMP_CLAUSE_REDUCTION_CODE (c
))
5117 if (TREE_CODE (type
) == COMPLEX_TYPE
)
5124 if (FLOAT_TYPE_P (type
) || TREE_CODE (type
) == COMPLEX_TYPE
)
5128 case TRUTH_ANDIF_EXPR
:
5129 case TRUTH_ORIF_EXPR
:
5130 if (FLOAT_TYPE_P (type
))
5137 else if (TREE_CODE (type
) == ARRAY_TYPE
|| TYPE_READONLY (type
))
5139 error ("%qE has invalid type for %<reduction%>", t
);
5142 else if (!processing_template_decl
)
5144 t
= require_complete_type (t
);
5145 if (t
== error_mark_node
)
5147 OMP_CLAUSE_DECL (c
) = t
;
5152 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5155 else if (processing_template_decl
)
5158 tree id
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
);
5160 type
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
5161 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5162 type
= TREE_TYPE (type
);
5163 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = NULL_TREE
;
5164 if (id
== NULL_TREE
)
5165 id
= omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c
),
5166 NULL_TREE
, NULL_TREE
);
5167 id
= omp_reduction_lookup (OMP_CLAUSE_LOCATION (c
), id
, type
, NULL
, NULL
);
5170 if (id
== error_mark_node
)
5172 id
= OVL_CURRENT (id
);
5174 tree body
= DECL_SAVED_TREE (id
);
5177 if (TREE_CODE (body
) == STATEMENT_LIST
)
5179 tree_stmt_iterator tsi
;
5180 tree placeholder
= NULL_TREE
;
5183 tree atype
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id
)));
5184 atype
= TREE_TYPE (atype
);
5185 bool need_static_cast
= !same_type_p (type
, atype
);
5186 memset (stmts
, 0, sizeof stmts
);
5187 for (i
= 0, tsi
= tsi_start (body
);
5188 i
< 7 && !tsi_end_p (tsi
);
5189 i
++, tsi_next (&tsi
))
5190 stmts
[i
] = tsi_stmt (tsi
);
5191 gcc_assert (tsi_end_p (tsi
));
5195 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
5196 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
5197 placeholder
= build_lang_decl (VAR_DECL
, NULL_TREE
, type
);
5198 DECL_ARTIFICIAL (placeholder
) = 1;
5199 DECL_IGNORED_P (placeholder
) = 1;
5200 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
) = placeholder
;
5201 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[0])))
5202 cxx_mark_addressable (placeholder
);
5203 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[1]))
5204 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
)))
5206 cxx_mark_addressable (OMP_CLAUSE_DECL (c
));
5207 tree omp_out
= placeholder
;
5208 tree omp_in
= convert_from_reference (OMP_CLAUSE_DECL (c
));
5209 if (need_static_cast
)
5211 tree rtype
= build_reference_type (atype
);
5212 omp_out
= build_static_cast (rtype
, omp_out
,
5213 tf_warning_or_error
);
5214 omp_in
= build_static_cast (rtype
, omp_in
,
5215 tf_warning_or_error
);
5216 if (omp_out
== error_mark_node
|| omp_in
== error_mark_node
)
5218 omp_out
= convert_from_reference (omp_out
);
5219 omp_in
= convert_from_reference (omp_in
);
5221 OMP_CLAUSE_REDUCTION_MERGE (c
)
5222 = clone_omp_udr (stmts
[2], DECL_EXPR_DECL (stmts
[0]),
5223 DECL_EXPR_DECL (stmts
[1]), omp_in
, omp_out
);
5227 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
5228 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
5229 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[3])))
5230 cxx_mark_addressable (OMP_CLAUSE_DECL (c
));
5231 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts
[4])))
5232 cxx_mark_addressable (placeholder
);
5233 tree omp_priv
= convert_from_reference (OMP_CLAUSE_DECL (c
));
5234 tree omp_orig
= placeholder
;
5235 if (need_static_cast
)
5239 error_at (OMP_CLAUSE_LOCATION (c
),
5240 "user defined reduction with constructor "
5241 "initializer for base class %qT", atype
);
5244 tree rtype
= build_reference_type (atype
);
5245 omp_priv
= build_static_cast (rtype
, omp_priv
,
5246 tf_warning_or_error
);
5247 omp_orig
= build_static_cast (rtype
, omp_orig
,
5248 tf_warning_or_error
);
5249 if (omp_priv
== error_mark_node
5250 || omp_orig
== error_mark_node
)
5252 omp_priv
= convert_from_reference (omp_priv
);
5253 omp_orig
= convert_from_reference (omp_orig
);
5256 *need_default_ctor
= true;
5257 OMP_CLAUSE_REDUCTION_INIT (c
)
5258 = clone_omp_udr (stmts
[5], DECL_EXPR_DECL (stmts
[4]),
5259 DECL_EXPR_DECL (stmts
[3]),
5260 omp_priv
, omp_orig
);
5261 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c
),
5262 find_omp_placeholder_r
, placeholder
, NULL
))
5263 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c
) = 1;
5267 if (CLASS_TYPE_P (type
) && !pod_type_p (type
))
5268 *need_default_ctor
= true;
5272 tree v
= convert_from_reference (t
);
5273 if (AGGREGATE_TYPE_P (TREE_TYPE (v
)))
5274 init
= build_constructor (TREE_TYPE (v
), NULL
);
5276 init
= fold_convert (TREE_TYPE (v
), integer_zero_node
);
5277 OMP_CLAUSE_REDUCTION_INIT (c
)
5278 = build2 (INIT_EXPR
, TREE_TYPE (v
), v
, init
);
5283 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5287 error ("user defined reduction not found for %qD", t
);
5293 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5294 Remove any elements from the list that are invalid. */
5297 finish_omp_clauses (tree clauses
)
5299 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
5300 bitmap_head aligned_head
;
5302 bool branch_seen
= false;
5303 bool copyprivate_seen
= false;
5305 bitmap_obstack_initialize (NULL
);
5306 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
5307 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
5308 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
5309 bitmap_initialize (&aligned_head
, &bitmap_default_obstack
);
5311 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5313 bool remove
= false;
5315 switch (OMP_CLAUSE_CODE (c
))
5317 case OMP_CLAUSE_SHARED
:
5318 goto check_dup_generic
;
5319 case OMP_CLAUSE_PRIVATE
:
5320 goto check_dup_generic
;
5321 case OMP_CLAUSE_REDUCTION
:
5322 goto check_dup_generic
;
5323 case OMP_CLAUSE_COPYPRIVATE
:
5324 copyprivate_seen
= true;
5325 goto check_dup_generic
;
5326 case OMP_CLAUSE_COPYIN
:
5327 goto check_dup_generic
;
5328 case OMP_CLAUSE_LINEAR
:
5329 t
= OMP_CLAUSE_DECL (c
);
5330 if (!type_dependent_expression_p (t
)
5331 && !INTEGRAL_TYPE_P (TREE_TYPE (t
))
5332 && TREE_CODE (TREE_TYPE (t
)) != POINTER_TYPE
)
5334 error ("linear clause applied to non-integral non-pointer "
5335 "variable with %qT type", TREE_TYPE (t
));
5339 t
= OMP_CLAUSE_LINEAR_STEP (c
);
5341 t
= integer_one_node
;
5342 if (t
== error_mark_node
)
5347 else if (!type_dependent_expression_p (t
)
5348 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5350 error ("linear step expression must be integral");
5356 t
= mark_rvalue_use (t
);
5357 if (!processing_template_decl
)
5359 if (TREE_CODE (OMP_CLAUSE_DECL (c
)) == PARM_DECL
)
5360 t
= maybe_constant_value (t
);
5361 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5362 if (TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c
)))
5365 t
= pointer_int_sum (OMP_CLAUSE_LOCATION (c
), PLUS_EXPR
,
5366 OMP_CLAUSE_DECL (c
), t
);
5367 t
= fold_build2_loc (OMP_CLAUSE_LOCATION (c
),
5368 MINUS_EXPR
, sizetype
, t
,
5369 OMP_CLAUSE_DECL (c
));
5370 if (t
== error_mark_node
)
5377 t
= fold_convert (TREE_TYPE (OMP_CLAUSE_DECL (c
)), t
);
5379 OMP_CLAUSE_LINEAR_STEP (c
) = t
;
5381 goto check_dup_generic
;
5383 t
= OMP_CLAUSE_DECL (c
);
5384 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
5386 if (processing_template_decl
)
5389 error ("%qD is not a variable in clause %qs", t
,
5390 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5392 error ("%qE is not a variable in clause %qs", t
,
5393 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5396 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
5397 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
5398 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
5400 error ("%qD appears more than once in data clauses", t
);
5404 bitmap_set_bit (&generic_head
, DECL_UID (t
));
5407 case OMP_CLAUSE_FIRSTPRIVATE
:
5408 t
= OMP_CLAUSE_DECL (c
);
5409 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
5411 if (processing_template_decl
)
5414 error ("%qD is not a variable in clause %<firstprivate%>", t
);
5416 error ("%qE is not a variable in clause %<firstprivate%>", t
);
5419 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
5420 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
5422 error ("%qD appears more than once in data clauses", t
);
5426 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
5429 case OMP_CLAUSE_LASTPRIVATE
:
5430 t
= OMP_CLAUSE_DECL (c
);
5431 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
5433 if (processing_template_decl
)
5436 error ("%qD is not a variable in clause %<lastprivate%>", t
);
5438 error ("%qE is not a variable in clause %<lastprivate%>", t
);
5441 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
5442 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
5444 error ("%qD appears more than once in data clauses", t
);
5448 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
5452 t
= OMP_CLAUSE_IF_EXPR (c
);
5453 t
= maybe_convert_cond (t
);
5454 if (t
== error_mark_node
)
5456 else if (!processing_template_decl
)
5457 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5458 OMP_CLAUSE_IF_EXPR (c
) = t
;
5461 case OMP_CLAUSE_FINAL
:
5462 t
= OMP_CLAUSE_FINAL_EXPR (c
);
5463 t
= maybe_convert_cond (t
);
5464 if (t
== error_mark_node
)
5466 else if (!processing_template_decl
)
5467 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5468 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
5471 case OMP_CLAUSE_NUM_THREADS
:
5472 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
5473 if (t
== error_mark_node
)
5475 else if (!type_dependent_expression_p (t
)
5476 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5478 error ("num_threads expression must be integral");
5483 t
= mark_rvalue_use (t
);
5484 if (!processing_template_decl
)
5485 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5486 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
5490 case OMP_CLAUSE_SCHEDULE
:
5491 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
5494 else if (t
== error_mark_node
)
5496 else if (!type_dependent_expression_p (t
)
5497 && (OMP_CLAUSE_SCHEDULE_KIND (c
)
5498 != OMP_CLAUSE_SCHEDULE_CILKFOR
)
5499 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5501 error ("schedule chunk size expression must be integral");
5506 t
= mark_rvalue_use (t
);
5507 if (!processing_template_decl
)
5509 if (OMP_CLAUSE_SCHEDULE_KIND (c
)
5510 == OMP_CLAUSE_SCHEDULE_CILKFOR
)
5512 t
= convert_to_integer (long_integer_type_node
, t
);
5513 if (t
== error_mark_node
)
5519 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5521 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
5525 case OMP_CLAUSE_SIMDLEN
:
5526 case OMP_CLAUSE_SAFELEN
:
5527 t
= OMP_CLAUSE_OPERAND (c
, 0);
5528 if (t
== error_mark_node
)
5530 else if (!type_dependent_expression_p (t
)
5531 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5533 error ("%qs length expression must be integral",
5534 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5539 t
= mark_rvalue_use (t
);
5540 t
= maybe_constant_value (t
);
5541 if (!processing_template_decl
)
5543 if (TREE_CODE (t
) != INTEGER_CST
5544 || tree_int_cst_sgn (t
) != 1)
5546 error ("%qs length expression must be positive constant"
5547 " integer expression",
5548 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5552 OMP_CLAUSE_OPERAND (c
, 0) = t
;
5556 case OMP_CLAUSE_NUM_TEAMS
:
5557 t
= OMP_CLAUSE_NUM_TEAMS_EXPR (c
);
5558 if (t
== error_mark_node
)
5560 else if (!type_dependent_expression_p (t
)
5561 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5563 error ("%<num_teams%> expression must be integral");
5568 t
= mark_rvalue_use (t
);
5569 if (!processing_template_decl
)
5570 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5571 OMP_CLAUSE_NUM_TEAMS_EXPR (c
) = t
;
5575 case OMP_CLAUSE_ASYNC
:
5576 t
= OMP_CLAUSE_ASYNC_EXPR (c
);
5577 if (t
== error_mark_node
)
5579 else if (!type_dependent_expression_p (t
)
5580 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5582 error ("%<async%> expression must be integral");
5587 t
= mark_rvalue_use (t
);
5588 if (!processing_template_decl
)
5589 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5590 OMP_CLAUSE_ASYNC_EXPR (c
) = t
;
5594 case OMP_CLAUSE_VECTOR_LENGTH
:
5595 t
= OMP_CLAUSE_VECTOR_LENGTH_EXPR (c
);
5596 t
= maybe_convert_cond (t
);
5597 if (t
== error_mark_node
)
5599 else if (!processing_template_decl
)
5600 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5601 OMP_CLAUSE_VECTOR_LENGTH_EXPR (c
) = t
;
5604 case OMP_CLAUSE_WAIT
:
5605 t
= OMP_CLAUSE_WAIT_EXPR (c
);
5606 if (t
== error_mark_node
)
5608 else if (!processing_template_decl
)
5609 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5610 OMP_CLAUSE_WAIT_EXPR (c
) = t
;
5613 case OMP_CLAUSE_THREAD_LIMIT
:
5614 t
= OMP_CLAUSE_THREAD_LIMIT_EXPR (c
);
5615 if (t
== error_mark_node
)
5617 else if (!type_dependent_expression_p (t
)
5618 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5620 error ("%<thread_limit%> expression must be integral");
5625 t
= mark_rvalue_use (t
);
5626 if (!processing_template_decl
)
5627 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5628 OMP_CLAUSE_THREAD_LIMIT_EXPR (c
) = t
;
5632 case OMP_CLAUSE_DEVICE
:
5633 t
= OMP_CLAUSE_DEVICE_ID (c
);
5634 if (t
== error_mark_node
)
5636 else if (!type_dependent_expression_p (t
)
5637 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5639 error ("%<device%> id must be integral");
5644 t
= mark_rvalue_use (t
);
5645 if (!processing_template_decl
)
5646 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5647 OMP_CLAUSE_DEVICE_ID (c
) = t
;
5651 case OMP_CLAUSE_DIST_SCHEDULE
:
5652 t
= OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
);
5655 else if (t
== error_mark_node
)
5657 else if (!type_dependent_expression_p (t
)
5658 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5660 error ("%<dist_schedule%> chunk size expression must be "
5666 t
= mark_rvalue_use (t
);
5667 if (!processing_template_decl
)
5668 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5669 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c
) = t
;
5673 case OMP_CLAUSE_ALIGNED
:
5674 t
= OMP_CLAUSE_DECL (c
);
5675 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
5677 if (processing_template_decl
)
5680 error ("%qD is not a variable in %<aligned%> clause", t
);
5682 error ("%qE is not a variable in %<aligned%> clause", t
);
5685 else if (!type_dependent_expression_p (t
)
5686 && TREE_CODE (TREE_TYPE (t
)) != POINTER_TYPE
5687 && TREE_CODE (TREE_TYPE (t
)) != ARRAY_TYPE
5688 && (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
5689 || (!POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (t
)))
5690 && (TREE_CODE (TREE_TYPE (TREE_TYPE (t
)))
5693 error_at (OMP_CLAUSE_LOCATION (c
),
5694 "%qE in %<aligned%> clause is neither a pointer nor "
5695 "an array nor a reference to pointer or array", t
);
5698 else if (bitmap_bit_p (&aligned_head
, DECL_UID (t
)))
5700 error ("%qD appears more than once in %<aligned%> clauses", t
);
5704 bitmap_set_bit (&aligned_head
, DECL_UID (t
));
5705 t
= OMP_CLAUSE_ALIGNED_ALIGNMENT (c
);
5706 if (t
== error_mark_node
)
5708 else if (t
== NULL_TREE
)
5710 else if (!type_dependent_expression_p (t
)
5711 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
5713 error ("%<aligned%> clause alignment expression must "
5719 t
= mark_rvalue_use (t
);
5720 t
= maybe_constant_value (t
);
5721 if (!processing_template_decl
)
5723 if (TREE_CODE (t
) != INTEGER_CST
5724 || tree_int_cst_sgn (t
) != 1)
5726 error ("%<aligned%> clause alignment expression must be "
5727 "positive constant integer expression");
5731 OMP_CLAUSE_ALIGNED_ALIGNMENT (c
) = t
;
5735 case OMP_CLAUSE_DEPEND
:
5736 t
= OMP_CLAUSE_DECL (c
);
5737 if (TREE_CODE (t
) == TREE_LIST
)
5739 if (handle_omp_array_sections (c
))
5743 if (t
== error_mark_node
)
5745 else if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
5747 if (processing_template_decl
)
5750 error ("%qD is not a variable in %<depend%> clause", t
);
5752 error ("%qE is not a variable in %<depend%> clause", t
);
5755 else if (!processing_template_decl
5756 && !cxx_mark_addressable (t
))
5760 case OMP_CLAUSE_MAP
:
5762 case OMP_CLAUSE_FROM
:
5763 case OMP_CLAUSE__CACHE_
:
5764 t
= OMP_CLAUSE_DECL (c
);
5765 if (TREE_CODE (t
) == TREE_LIST
)
5767 if (handle_omp_array_sections (c
))
5771 t
= OMP_CLAUSE_DECL (c
);
5772 if (TREE_CODE (t
) != TREE_LIST
5773 && !type_dependent_expression_p (t
)
5774 && !cp_omp_mappable_type (TREE_TYPE (t
)))
5776 error_at (OMP_CLAUSE_LOCATION (c
),
5777 "array section does not have mappable type "
5779 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5785 if (t
== error_mark_node
)
5787 else if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
5789 if (processing_template_decl
)
5791 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
5792 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
)
5795 error ("%qD is not a variable in %qs clause", t
,
5796 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5798 error ("%qE is not a variable in %qs clause", t
,
5799 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5802 else if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
5804 error ("%qD is threadprivate variable in %qs clause", t
,
5805 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5808 else if (!processing_template_decl
5809 && TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
5810 && !cxx_mark_addressable (t
))
5812 else if (!(OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_MAP
5813 && OMP_CLAUSE_MAP_KIND (c
) == GOMP_MAP_POINTER
)
5814 && !type_dependent_expression_p (t
)
5815 && !cp_omp_mappable_type ((TREE_CODE (TREE_TYPE (t
))
5817 ? TREE_TYPE (TREE_TYPE (t
))
5820 error_at (OMP_CLAUSE_LOCATION (c
),
5821 "%qD does not have a mappable type in %qs clause", t
,
5822 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5825 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
)))
5827 if (OMP_CLAUSE_CODE (c
) != OMP_CLAUSE_MAP
)
5828 error ("%qD appears more than once in motion clauses", t
);
5830 error ("%qD appears more than once in map clauses", t
);
5834 bitmap_set_bit (&generic_head
, DECL_UID (t
));
5837 case OMP_CLAUSE_UNIFORM
:
5838 t
= OMP_CLAUSE_DECL (c
);
5839 if (TREE_CODE (t
) != PARM_DECL
)
5841 if (processing_template_decl
)
5844 error ("%qD is not an argument in %<uniform%> clause", t
);
5846 error ("%qE is not an argument in %<uniform%> clause", t
);
5850 goto check_dup_generic
;
5852 case OMP_CLAUSE_NOWAIT
:
5853 case OMP_CLAUSE_ORDERED
:
5854 case OMP_CLAUSE_DEFAULT
:
5855 case OMP_CLAUSE_UNTIED
:
5856 case OMP_CLAUSE_COLLAPSE
:
5857 case OMP_CLAUSE_MERGEABLE
:
5858 case OMP_CLAUSE_PARALLEL
:
5859 case OMP_CLAUSE_FOR
:
5860 case OMP_CLAUSE_SECTIONS
:
5861 case OMP_CLAUSE_TASKGROUP
:
5862 case OMP_CLAUSE_PROC_BIND
:
5863 case OMP_CLAUSE__CILK_FOR_COUNT_
:
5866 case OMP_CLAUSE_INBRANCH
:
5867 case OMP_CLAUSE_NOTINBRANCH
:
5870 error ("%<inbranch%> clause is incompatible with "
5882 *pc
= OMP_CLAUSE_CHAIN (c
);
5884 pc
= &OMP_CLAUSE_CHAIN (c
);
5887 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
5889 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
5890 bool remove
= false;
5891 bool need_complete_non_reference
= false;
5892 bool need_default_ctor
= false;
5893 bool need_copy_ctor
= false;
5894 bool need_copy_assignment
= false;
5895 bool need_implicitly_determined
= false;
5896 bool need_dtor
= false;
5897 tree type
, inner_type
;
5901 case OMP_CLAUSE_SHARED
:
5902 need_implicitly_determined
= true;
5904 case OMP_CLAUSE_PRIVATE
:
5905 need_complete_non_reference
= true;
5906 need_default_ctor
= true;
5908 need_implicitly_determined
= true;
5910 case OMP_CLAUSE_FIRSTPRIVATE
:
5911 need_complete_non_reference
= true;
5912 need_copy_ctor
= true;
5914 need_implicitly_determined
= true;
5916 case OMP_CLAUSE_LASTPRIVATE
:
5917 need_complete_non_reference
= true;
5918 need_copy_assignment
= true;
5919 need_implicitly_determined
= true;
5921 case OMP_CLAUSE_REDUCTION
:
5922 need_implicitly_determined
= true;
5924 case OMP_CLAUSE_COPYPRIVATE
:
5925 need_copy_assignment
= true;
5927 case OMP_CLAUSE_COPYIN
:
5928 need_copy_assignment
= true;
5930 case OMP_CLAUSE_NOWAIT
:
5931 if (copyprivate_seen
)
5933 error_at (OMP_CLAUSE_LOCATION (c
),
5934 "%<nowait%> clause must not be used together "
5935 "with %<copyprivate%>");
5936 *pc
= OMP_CLAUSE_CHAIN (c
);
5941 pc
= &OMP_CLAUSE_CHAIN (c
);
5945 t
= OMP_CLAUSE_DECL (c
);
5946 if (processing_template_decl
5947 && !VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
5949 pc
= &OMP_CLAUSE_CHAIN (c
);
5955 case OMP_CLAUSE_LASTPRIVATE
:
5956 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
5958 need_default_ctor
= true;
5963 case OMP_CLAUSE_REDUCTION
:
5964 if (finish_omp_reduction_clause (c
, &need_default_ctor
,
5968 t
= OMP_CLAUSE_DECL (c
);
5971 case OMP_CLAUSE_COPYIN
:
5972 if (!VAR_P (t
) || !DECL_THREAD_LOCAL_P (t
))
5974 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
5983 if (need_complete_non_reference
|| need_copy_assignment
)
5985 t
= require_complete_type (t
);
5986 if (t
== error_mark_node
)
5988 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
5989 && need_complete_non_reference
)
5991 error ("%qE has reference type for %qs", t
,
5992 omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
5996 if (need_implicitly_determined
)
5998 const char *share_name
= NULL
;
6000 if (VAR_P (t
) && DECL_THREAD_LOCAL_P (t
))
6001 share_name
= "threadprivate";
6002 else switch (cxx_omp_predetermined_sharing (t
))
6004 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
6006 case OMP_CLAUSE_DEFAULT_SHARED
:
6007 /* const vars may be specified in firstprivate clause. */
6008 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
6009 && cxx_omp_const_qual_no_mutable (t
))
6011 share_name
= "shared";
6013 case OMP_CLAUSE_DEFAULT_PRIVATE
:
6014 share_name
= "private";
6021 error ("%qE is predetermined %qs for %qs",
6022 t
, share_name
, omp_clause_code_name
[OMP_CLAUSE_CODE (c
)]);
6027 /* We're interested in the base element, not arrays. */
6028 inner_type
= type
= TREE_TYPE (t
);
6029 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
6030 inner_type
= TREE_TYPE (inner_type
);
6032 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
6033 && TREE_CODE (inner_type
) == REFERENCE_TYPE
)
6034 inner_type
= TREE_TYPE (inner_type
);
6036 /* Check for special function availability by building a call to one.
6037 Save the results, because later we won't be in the right context
6038 for making these queries. */
6039 if (CLASS_TYPE_P (inner_type
)
6040 && COMPLETE_TYPE_P (inner_type
)
6041 && (need_default_ctor
|| need_copy_ctor
6042 || need_copy_assignment
|| need_dtor
)
6043 && !type_dependent_expression_p (t
)
6044 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
6045 need_copy_ctor
, need_copy_assignment
,
6050 *pc
= OMP_CLAUSE_CHAIN (c
);
6052 pc
= &OMP_CLAUSE_CHAIN (c
);
6055 bitmap_obstack_release (NULL
);
6059 /* For all variables in the tree_list VARS, mark them as thread local. */
6062 finish_omp_threadprivate (tree vars
)
6066 /* Mark every variable in VARS to be assigned thread local storage. */
6067 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
6069 tree v
= TREE_PURPOSE (t
);
6071 if (error_operand_p (v
))
6073 else if (!VAR_P (v
))
6074 error ("%<threadprivate%> %qD is not file, namespace "
6075 "or block scope variable", v
);
6076 /* If V had already been marked threadprivate, it doesn't matter
6077 whether it had been used prior to this point. */
6078 else if (TREE_USED (v
)
6079 && (DECL_LANG_SPECIFIC (v
) == NULL
6080 || !CP_DECL_THREADPRIVATE_P (v
)))
6081 error ("%qE declared %<threadprivate%> after first use", v
);
6082 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
6083 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
6084 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
6085 error ("%<threadprivate%> %qE has incomplete type", v
);
6086 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
6087 && CP_DECL_CONTEXT (v
) != current_class_type
)
6088 error ("%<threadprivate%> %qE directive not "
6089 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
6092 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
6093 if (DECL_LANG_SPECIFIC (v
) == NULL
)
6095 retrofit_lang_decl (v
);
6097 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
6098 after the allocation of the lang_decl structure. */
6099 if (DECL_DISCRIMINATOR_P (v
))
6100 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
6103 if (! DECL_THREAD_LOCAL_P (v
))
6105 set_decl_tls_model (v
, decl_default_tls_model (v
));
6106 /* If rtl has been already set for this var, call
6107 make_decl_rtl once again, so that encode_section_info
6108 has a chance to look at the new decl flags. */
6109 if (DECL_RTL_SET_P (v
))
6112 CP_DECL_THREADPRIVATE_P (v
) = 1;
6117 /* Build an OpenMP structured block. */
6120 begin_omp_structured_block (void)
6122 return do_pushlevel (sk_omp
);
6126 finish_omp_structured_block (tree block
)
6128 return do_poplevel (block
);
6131 /* Generate OACC_DATA, with CLAUSES and BLOCK as its compound
6132 statement. LOC is the location of the OACC_DATA. */
6135 finish_oacc_data (tree clauses
, tree block
)
6139 block
= finish_omp_structured_block (block
);
6141 stmt
= make_node (OACC_DATA
);
6142 TREE_TYPE (stmt
) = void_type_node
;
6143 OACC_DATA_CLAUSES (stmt
) = clauses
;
6144 OACC_DATA_BODY (stmt
) = block
;
6146 return add_stmt (stmt
);
6149 /* Generate OACC_KERNELS, with CLAUSES and BLOCK as its compound
6150 statement. LOC is the location of the OACC_KERNELS. */
6153 finish_oacc_kernels (tree clauses
, tree block
)
6157 block
= finish_omp_structured_block (block
);
6159 stmt
= make_node (OACC_KERNELS
);
6160 TREE_TYPE (stmt
) = void_type_node
;
6161 OACC_KERNELS_CLAUSES (stmt
) = clauses
;
6162 OACC_KERNELS_BODY (stmt
) = block
;
6164 return add_stmt (stmt
);
6167 /* Generate OACC_PARALLEL, with CLAUSES and BLOCK as its compound
6168 statement. LOC is the location of the OACC_PARALLEL. */
6171 finish_oacc_parallel (tree clauses
, tree block
)
6175 block
= finish_omp_structured_block (block
);
6177 stmt
= make_node (OACC_PARALLEL
);
6178 TREE_TYPE (stmt
) = void_type_node
;
6179 OACC_PARALLEL_CLAUSES (stmt
) = clauses
;
6180 OACC_PARALLEL_BODY (stmt
) = block
;
6182 return add_stmt (stmt
);
6185 /* Similarly, except force the retention of the BLOCK. */
6188 begin_omp_parallel (void)
6190 keep_next_level (true);
6191 return begin_omp_structured_block ();
6195 finish_omp_parallel (tree clauses
, tree body
)
6199 body
= finish_omp_structured_block (body
);
6201 stmt
= make_node (OMP_PARALLEL
);
6202 TREE_TYPE (stmt
) = void_type_node
;
6203 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
6204 OMP_PARALLEL_BODY (stmt
) = body
;
6206 return add_stmt (stmt
);
6210 begin_omp_task (void)
6212 keep_next_level (true);
6213 return begin_omp_structured_block ();
6217 finish_omp_task (tree clauses
, tree body
)
6221 body
= finish_omp_structured_block (body
);
6223 stmt
= make_node (OMP_TASK
);
6224 TREE_TYPE (stmt
) = void_type_node
;
6225 OMP_TASK_CLAUSES (stmt
) = clauses
;
6226 OMP_TASK_BODY (stmt
) = body
;
6228 return add_stmt (stmt
);
6231 /* Helper function for finish_omp_for. Convert Ith random access iterator
6232 into integral iterator. Return FALSE if successful. */
6235 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
6236 tree condv
, tree incrv
, tree
*body
,
6237 tree
*pre_body
, tree clauses
, tree
*lastp
)
6239 tree diff
, iter_init
, iter_incr
= NULL
, last
;
6240 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
6241 tree decl
= TREE_VEC_ELT (declv
, i
);
6242 tree init
= TREE_VEC_ELT (initv
, i
);
6243 tree cond
= TREE_VEC_ELT (condv
, i
);
6244 tree incr
= TREE_VEC_ELT (incrv
, i
);
6246 location_t elocus
= locus
;
6248 if (init
&& EXPR_HAS_LOCATION (init
))
6249 elocus
= EXPR_LOCATION (init
);
6251 switch (TREE_CODE (cond
))
6258 if (TREE_OPERAND (cond
, 1) == iter
)
6259 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
6260 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
6261 if (TREE_OPERAND (cond
, 0) != iter
)
6262 cond
= error_mark_node
;
6265 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
6268 TREE_OPERAND (cond
, 1), ERROR_MARK
,
6269 NULL
, tf_warning_or_error
);
6270 if (error_operand_p (tem
))
6275 cond
= error_mark_node
;
6278 if (cond
== error_mark_node
)
6280 error_at (elocus
, "invalid controlling predicate");
6283 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
6284 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
6285 tf_warning_or_error
);
6286 if (error_operand_p (diff
))
6288 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
6290 error_at (elocus
, "difference between %qE and %qD does not have integer type",
6291 TREE_OPERAND (cond
, 1), iter
);
6295 switch (TREE_CODE (incr
))
6297 case PREINCREMENT_EXPR
:
6298 case PREDECREMENT_EXPR
:
6299 case POSTINCREMENT_EXPR
:
6300 case POSTDECREMENT_EXPR
:
6301 if (TREE_OPERAND (incr
, 0) != iter
)
6303 incr
= error_mark_node
;
6306 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
6307 TREE_CODE (incr
), iter
,
6308 tf_warning_or_error
);
6309 if (error_operand_p (iter_incr
))
6311 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
6312 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
6313 incr
= integer_one_node
;
6315 incr
= integer_minus_one_node
;
6318 if (TREE_OPERAND (incr
, 0) != iter
)
6319 incr
= error_mark_node
;
6320 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
6321 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
6323 tree rhs
= TREE_OPERAND (incr
, 1);
6324 if (TREE_OPERAND (rhs
, 0) == iter
)
6326 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
6328 incr
= error_mark_node
;
6331 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
6332 iter
, TREE_CODE (rhs
),
6333 TREE_OPERAND (rhs
, 1),
6334 tf_warning_or_error
);
6335 if (error_operand_p (iter_incr
))
6337 incr
= TREE_OPERAND (rhs
, 1);
6338 incr
= cp_convert (TREE_TYPE (diff
), incr
,
6339 tf_warning_or_error
);
6340 if (TREE_CODE (rhs
) == MINUS_EXPR
)
6342 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
6343 incr
= fold_if_not_in_template (incr
);
6345 if (TREE_CODE (incr
) != INTEGER_CST
6346 && (TREE_CODE (incr
) != NOP_EXPR
6347 || (TREE_CODE (TREE_OPERAND (incr
, 0))
6352 else if (TREE_OPERAND (rhs
, 1) == iter
)
6354 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
6355 || TREE_CODE (rhs
) != PLUS_EXPR
)
6356 incr
= error_mark_node
;
6359 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
6361 TREE_OPERAND (rhs
, 0),
6364 tf_warning_or_error
);
6365 if (error_operand_p (iter_incr
))
6367 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
6370 tf_warning_or_error
);
6371 if (error_operand_p (iter_incr
))
6373 incr
= TREE_OPERAND (rhs
, 0);
6378 incr
= error_mark_node
;
6381 incr
= error_mark_node
;
6384 incr
= error_mark_node
;
6388 if (incr
== error_mark_node
)
6390 error_at (elocus
, "invalid increment expression");
6394 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
6395 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
6396 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6397 && OMP_CLAUSE_DECL (c
) == iter
)
6400 decl
= create_temporary_var (TREE_TYPE (diff
));
6402 add_decl_expr (decl
);
6403 last
= create_temporary_var (TREE_TYPE (diff
));
6405 add_decl_expr (last
);
6406 if (c
&& iter_incr
== NULL
)
6408 incr_var
= create_temporary_var (TREE_TYPE (diff
));
6409 pushdecl (incr_var
);
6410 add_decl_expr (incr_var
);
6412 gcc_assert (stmts_are_full_exprs_p ());
6414 orig_pre_body
= *pre_body
;
6415 *pre_body
= push_stmt_list ();
6417 add_stmt (orig_pre_body
);
6419 finish_expr_stmt (build_x_modify_expr (elocus
,
6420 iter
, NOP_EXPR
, init
,
6421 tf_warning_or_error
));
6422 init
= build_int_cst (TREE_TYPE (diff
), 0);
6423 if (c
&& iter_incr
== NULL
)
6425 finish_expr_stmt (build_x_modify_expr (elocus
,
6427 incr
, tf_warning_or_error
));
6429 iter_incr
= build_x_modify_expr (elocus
,
6430 iter
, PLUS_EXPR
, incr
,
6431 tf_warning_or_error
);
6433 finish_expr_stmt (build_x_modify_expr (elocus
,
6434 last
, NOP_EXPR
, init
,
6435 tf_warning_or_error
));
6436 *pre_body
= pop_stmt_list (*pre_body
);
6438 cond
= cp_build_binary_op (elocus
,
6439 TREE_CODE (cond
), decl
, diff
,
6440 tf_warning_or_error
);
6441 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
6442 elocus
, incr
, NULL_TREE
);
6445 *body
= push_stmt_list ();
6446 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
6447 iter_init
= build_x_modify_expr (elocus
,
6448 iter
, PLUS_EXPR
, iter_init
,
6449 tf_warning_or_error
);
6450 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
6451 finish_expr_stmt (iter_init
);
6452 finish_expr_stmt (build_x_modify_expr (elocus
,
6453 last
, NOP_EXPR
, decl
,
6454 tf_warning_or_error
));
6455 add_stmt (orig_body
);
6456 *body
= pop_stmt_list (*body
);
6460 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
6461 finish_expr_stmt (iter_incr
);
6462 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
6463 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
6466 TREE_VEC_ELT (declv
, i
) = decl
;
6467 TREE_VEC_ELT (initv
, i
) = init
;
6468 TREE_VEC_ELT (condv
, i
) = cond
;
6469 TREE_VEC_ELT (incrv
, i
) = incr
;
6475 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
6476 are directly for their associated operands in the statement. DECL
6477 and INIT are a combo; if DECL is NULL then INIT ought to be a
6478 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
6479 optional statements that need to go before the loop into its
6483 finish_omp_for (location_t locus
, enum tree_code code
, tree declv
, tree initv
,
6484 tree condv
, tree incrv
, tree body
, tree pre_body
, tree clauses
)
6486 tree omp_for
= NULL
, orig_incr
= NULL
;
6487 tree decl
= NULL
, init
, cond
, incr
, orig_decl
= NULL_TREE
, block
= NULL_TREE
;
6488 tree last
= NULL_TREE
;
6492 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
6493 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
6494 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
6495 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
6497 decl
= TREE_VEC_ELT (declv
, i
);
6498 init
= TREE_VEC_ELT (initv
, i
);
6499 cond
= TREE_VEC_ELT (condv
, i
);
6500 incr
= TREE_VEC_ELT (incrv
, i
);
6506 switch (TREE_CODE (init
))
6509 decl
= TREE_OPERAND (init
, 0);
6510 init
= TREE_OPERAND (init
, 1);
6513 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
6515 decl
= TREE_OPERAND (init
, 0);
6516 init
= TREE_OPERAND (init
, 2);
6526 "expected iteration declaration or initialization");
6531 if (init
&& EXPR_HAS_LOCATION (init
))
6532 elocus
= EXPR_LOCATION (init
);
6536 error_at (elocus
, "missing controlling predicate");
6542 error_at (elocus
, "missing increment expression");
6546 TREE_VEC_ELT (declv
, i
) = decl
;
6547 TREE_VEC_ELT (initv
, i
) = init
;
6550 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
6554 stmt
= make_node (code
);
6556 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
6558 /* This is really just a place-holder. We'll be decomposing this
6559 again and going through the cp_build_modify_expr path below when
6560 we instantiate the thing. */
6561 TREE_VEC_ELT (initv
, i
)
6562 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
6563 TREE_VEC_ELT (initv
, i
));
6566 TREE_TYPE (stmt
) = void_type_node
;
6567 OMP_FOR_INIT (stmt
) = initv
;
6568 OMP_FOR_COND (stmt
) = condv
;
6569 OMP_FOR_INCR (stmt
) = incrv
;
6570 OMP_FOR_BODY (stmt
) = body
;
6571 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
6572 OMP_FOR_CLAUSES (stmt
) = clauses
;
6574 SET_EXPR_LOCATION (stmt
, locus
);
6575 return add_stmt (stmt
);
6578 if (processing_template_decl
)
6579 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
6581 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
6583 decl
= TREE_VEC_ELT (declv
, i
);
6584 init
= TREE_VEC_ELT (initv
, i
);
6585 cond
= TREE_VEC_ELT (condv
, i
);
6586 incr
= TREE_VEC_ELT (incrv
, i
);
6588 TREE_VEC_ELT (orig_incr
, i
) = incr
;
6591 if (init
&& EXPR_HAS_LOCATION (init
))
6592 elocus
= EXPR_LOCATION (init
);
6596 error_at (elocus
, "expected iteration declaration or initialization");
6600 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
6603 TREE_VEC_ELT (orig_incr
, i
) = incr
;
6604 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
6605 TREE_CODE (TREE_OPERAND (incr
, 1)),
6606 TREE_OPERAND (incr
, 2),
6607 tf_warning_or_error
);
6610 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
6612 if (code
== OMP_SIMD
)
6614 error_at (elocus
, "%<#pragma omp simd%> used with class "
6615 "iteration variable %qE", decl
);
6618 if (code
== CILK_FOR
&& i
== 0)
6620 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
6621 incrv
, &body
, &pre_body
,
6627 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
6628 && !TYPE_PTR_P (TREE_TYPE (decl
)))
6630 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
6634 if (!processing_template_decl
)
6636 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
6637 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
6640 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
6642 && TREE_SIDE_EFFECTS (cond
)
6643 && COMPARISON_CLASS_P (cond
)
6644 && !processing_template_decl
)
6646 tree t
= TREE_OPERAND (cond
, 0);
6647 if (TREE_SIDE_EFFECTS (t
)
6649 && (TREE_CODE (t
) != NOP_EXPR
6650 || TREE_OPERAND (t
, 0) != decl
))
6651 TREE_OPERAND (cond
, 0)
6652 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6654 t
= TREE_OPERAND (cond
, 1);
6655 if (TREE_SIDE_EFFECTS (t
)
6657 && (TREE_CODE (t
) != NOP_EXPR
6658 || TREE_OPERAND (t
, 0) != decl
))
6659 TREE_OPERAND (cond
, 1)
6660 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6662 if (decl
== error_mark_node
|| init
== error_mark_node
)
6665 TREE_VEC_ELT (declv
, i
) = decl
;
6666 TREE_VEC_ELT (initv
, i
) = init
;
6667 TREE_VEC_ELT (condv
, i
) = cond
;
6668 TREE_VEC_ELT (incrv
, i
) = incr
;
6672 if (IS_EMPTY_STMT (pre_body
))
6675 if (code
== CILK_FOR
&& !processing_template_decl
)
6676 block
= push_stmt_list ();
6678 omp_for
= c_finish_omp_for (locus
, code
, declv
, initv
, condv
, incrv
,
6681 if (omp_for
== NULL
)
6684 pop_stmt_list (block
);
6688 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
6690 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
6691 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
6693 if (TREE_CODE (incr
) != MODIFY_EXPR
)
6696 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
6697 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
6698 && !processing_template_decl
)
6700 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
6701 if (TREE_SIDE_EFFECTS (t
)
6703 && (TREE_CODE (t
) != NOP_EXPR
6704 || TREE_OPERAND (t
, 0) != decl
))
6705 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
6706 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6708 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
6709 if (TREE_SIDE_EFFECTS (t
)
6711 && (TREE_CODE (t
) != NOP_EXPR
6712 || TREE_OPERAND (t
, 0) != decl
))
6713 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
6714 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
6718 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
6720 OMP_FOR_CLAUSES (omp_for
) = clauses
;
6724 tree omp_par
= make_node (OMP_PARALLEL
);
6725 TREE_TYPE (omp_par
) = void_type_node
;
6726 OMP_PARALLEL_CLAUSES (omp_par
) = NULL_TREE
;
6727 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
6728 TREE_SIDE_EFFECTS (bind
) = 1;
6729 BIND_EXPR_BODY (bind
) = pop_stmt_list (block
);
6730 OMP_PARALLEL_BODY (omp_par
) = bind
;
6731 if (OMP_FOR_PRE_BODY (omp_for
))
6733 add_stmt (OMP_FOR_PRE_BODY (omp_for
));
6734 OMP_FOR_PRE_BODY (omp_for
) = NULL_TREE
;
6736 init
= TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), 0);
6737 decl
= TREE_OPERAND (init
, 0);
6738 cond
= TREE_VEC_ELT (OMP_FOR_COND (omp_for
), 0);
6739 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), 0);
6740 tree t
= TREE_OPERAND (cond
, 1), c
, clauses
, *pc
;
6741 clauses
= OMP_FOR_CLAUSES (omp_for
);
6742 OMP_FOR_CLAUSES (omp_for
) = NULL_TREE
;
6743 for (pc
= &clauses
; *pc
; )
6744 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_SCHEDULE
)
6746 gcc_assert (OMP_FOR_CLAUSES (omp_for
) == NULL_TREE
);
6747 OMP_FOR_CLAUSES (omp_for
) = *pc
;
6748 *pc
= OMP_CLAUSE_CHAIN (*pc
);
6749 OMP_CLAUSE_CHAIN (OMP_FOR_CLAUSES (omp_for
)) = NULL_TREE
;
6753 gcc_assert (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
);
6754 pc
= &OMP_CLAUSE_CHAIN (*pc
);
6756 if (TREE_CODE (t
) != INTEGER_CST
)
6758 TREE_OPERAND (cond
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
6759 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
6760 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (cond
, 1);
6761 OMP_CLAUSE_CHAIN (c
) = clauses
;
6764 if (TREE_CODE (incr
) == MODIFY_EXPR
)
6766 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
6767 if (TREE_CODE (t
) != INTEGER_CST
)
6769 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
6770 = get_temp_regvar (TREE_TYPE (t
), t
);
6771 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
6772 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
6773 OMP_CLAUSE_CHAIN (c
) = clauses
;
6777 t
= TREE_OPERAND (init
, 1);
6778 if (TREE_CODE (t
) != INTEGER_CST
)
6780 TREE_OPERAND (init
, 1) = get_temp_regvar (TREE_TYPE (t
), t
);
6781 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
6782 OMP_CLAUSE_DECL (c
) = TREE_OPERAND (init
, 1);
6783 OMP_CLAUSE_CHAIN (c
) = clauses
;
6786 if (orig_decl
&& orig_decl
!= decl
)
6788 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
6789 OMP_CLAUSE_DECL (c
) = orig_decl
;
6790 OMP_CLAUSE_CHAIN (c
) = clauses
;
6795 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
6796 OMP_CLAUSE_DECL (c
) = last
;
6797 OMP_CLAUSE_CHAIN (c
) = clauses
;
6800 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
6801 OMP_CLAUSE_DECL (c
) = decl
;
6802 OMP_CLAUSE_CHAIN (c
) = clauses
;
6804 c
= build_omp_clause (input_location
, OMP_CLAUSE__CILK_FOR_COUNT_
);
6805 OMP_CLAUSE_OPERAND (c
, 0)
6806 = cilk_for_number_of_iterations (omp_for
);
6807 OMP_CLAUSE_CHAIN (c
) = clauses
;
6808 OMP_PARALLEL_CLAUSES (omp_par
) = finish_omp_clauses (c
);
6812 else if (code
== CILK_FOR
&& processing_template_decl
)
6814 tree c
, clauses
= OMP_FOR_CLAUSES (omp_for
);
6815 if (orig_decl
&& orig_decl
!= decl
)
6817 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
6818 OMP_CLAUSE_DECL (c
) = orig_decl
;
6819 OMP_CLAUSE_CHAIN (c
) = clauses
;
6824 c
= build_omp_clause (input_location
, OMP_CLAUSE_FIRSTPRIVATE
);
6825 OMP_CLAUSE_DECL (c
) = last
;
6826 OMP_CLAUSE_CHAIN (c
) = clauses
;
6829 OMP_FOR_CLAUSES (omp_for
) = clauses
;
6835 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
6836 tree rhs
, tree v
, tree lhs1
, tree rhs1
, bool seq_cst
)
6851 dependent_p
= false;
6854 /* Even in a template, we can detect invalid uses of the atomic
6855 pragma if neither LHS nor RHS is type-dependent. */
6856 if (processing_template_decl
)
6858 dependent_p
= (type_dependent_expression_p (lhs
)
6859 || (rhs
&& type_dependent_expression_p (rhs
))
6860 || (v
&& type_dependent_expression_p (v
))
6861 || (lhs1
&& type_dependent_expression_p (lhs1
))
6862 || (rhs1
&& type_dependent_expression_p (rhs1
)));
6865 lhs
= build_non_dependent_expr (lhs
);
6867 rhs
= build_non_dependent_expr (rhs
);
6869 v
= build_non_dependent_expr (v
);
6871 lhs1
= build_non_dependent_expr (lhs1
);
6873 rhs1
= build_non_dependent_expr (rhs1
);
6878 bool swapped
= false;
6879 if (rhs1
&& cp_tree_equal (lhs
, rhs
))
6884 swapped
= !commutative_tree_code (opcode
);
6886 if (rhs1
&& !cp_tree_equal (lhs
, rhs1
))
6888 if (code
== OMP_ATOMIC
)
6889 error ("%<#pragma omp atomic update%> uses two different "
6890 "expressions for memory");
6892 error ("%<#pragma omp atomic capture%> uses two different "
6893 "expressions for memory");
6896 if (lhs1
&& !cp_tree_equal (lhs
, lhs1
))
6898 if (code
== OMP_ATOMIC
)
6899 error ("%<#pragma omp atomic update%> uses two different "
6900 "expressions for memory");
6902 error ("%<#pragma omp atomic capture%> uses two different "
6903 "expressions for memory");
6906 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
6907 v
, lhs1
, rhs1
, swapped
, seq_cst
);
6908 if (stmt
== error_mark_node
)
6911 if (processing_template_decl
)
6913 if (code
== OMP_ATOMIC_READ
)
6915 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
6916 OMP_ATOMIC_READ
, orig_lhs
);
6917 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
6918 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
6922 if (opcode
== NOP_EXPR
)
6923 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
6925 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
6927 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
6928 COMPOUND_EXPR
, orig_rhs1
, stmt
);
6929 if (code
!= OMP_ATOMIC
)
6931 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
6932 code
, orig_lhs1
, stmt
);
6933 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
6934 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
6937 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
6938 OMP_ATOMIC_SEQ_CST (stmt
) = seq_cst
;
6940 finish_expr_stmt (stmt
);
6944 finish_omp_barrier (void)
6946 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
6947 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
6948 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
6949 release_tree_vector (vec
);
6950 finish_expr_stmt (stmt
);
6954 finish_omp_flush (void)
6956 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
6957 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
6958 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
6959 release_tree_vector (vec
);
6960 finish_expr_stmt (stmt
);
6964 finish_omp_taskwait (void)
6966 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
6967 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
6968 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
6969 release_tree_vector (vec
);
6970 finish_expr_stmt (stmt
);
6974 finish_omp_taskyield (void)
6976 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
6977 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
6978 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
6979 release_tree_vector (vec
);
6980 finish_expr_stmt (stmt
);
6984 finish_omp_cancel (tree clauses
)
6986 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCEL
);
6988 if (find_omp_clause (clauses
, OMP_CLAUSE_PARALLEL
))
6990 else if (find_omp_clause (clauses
, OMP_CLAUSE_FOR
))
6992 else if (find_omp_clause (clauses
, OMP_CLAUSE_SECTIONS
))
6994 else if (find_omp_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
6998 error ("%<#pragma omp cancel must specify one of "
6999 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
7002 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
7003 tree ifc
= find_omp_clause (clauses
, OMP_CLAUSE_IF
);
7004 if (ifc
!= NULL_TREE
)
7006 tree type
= TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc
));
7007 ifc
= fold_build2_loc (OMP_CLAUSE_LOCATION (ifc
), NE_EXPR
,
7008 boolean_type_node
, OMP_CLAUSE_IF_EXPR (ifc
),
7009 build_zero_cst (type
));
7012 ifc
= boolean_true_node
;
7013 vec
->quick_push (build_int_cst (integer_type_node
, mask
));
7014 vec
->quick_push (ifc
);
7015 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
7016 release_tree_vector (vec
);
7017 finish_expr_stmt (stmt
);
7021 finish_omp_cancellation_point (tree clauses
)
7023 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT
);
7025 if (find_omp_clause (clauses
, OMP_CLAUSE_PARALLEL
))
7027 else if (find_omp_clause (clauses
, OMP_CLAUSE_FOR
))
7029 else if (find_omp_clause (clauses
, OMP_CLAUSE_SECTIONS
))
7031 else if (find_omp_clause (clauses
, OMP_CLAUSE_TASKGROUP
))
7035 error ("%<#pragma omp cancellation point must specify one of "
7036 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
7039 vec
<tree
, va_gc
> *vec
7040 = make_tree_vector_single (build_int_cst (integer_type_node
, mask
));
7041 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
7042 release_tree_vector (vec
);
7043 finish_expr_stmt (stmt
);
7046 /* Begin a __transaction_atomic or __transaction_relaxed statement.
7047 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
7048 should create an extra compound stmt. */
7051 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
7056 *pcompound
= begin_compound_stmt (0);
7058 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
7060 /* Only add the statement to the function if support enabled. */
7064 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
7065 ? G_("%<__transaction_relaxed%> without "
7066 "transactional memory support enabled")
7067 : G_("%<__transaction_atomic%> without "
7068 "transactional memory support enabled")));
7070 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
7071 TREE_SIDE_EFFECTS (r
) = 1;
7075 /* End a __transaction_atomic or __transaction_relaxed statement.
7076 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
7077 and we should end the compound. If NOEX is non-NULL, we wrap the body in
7078 a MUST_NOT_THROW_EXPR with NOEX as condition. */
7081 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
7083 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
7084 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
7085 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
7086 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
7088 /* noexcept specifications are not allowed for function transactions. */
7089 gcc_assert (!(noex
&& compound_stmt
));
7092 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
7094 /* This may not be true when the STATEMENT_LIST is empty. */
7096 SET_EXPR_LOCATION (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
7097 TREE_SIDE_EFFECTS (body
) = 1;
7098 TRANSACTION_EXPR_BODY (stmt
) = body
;
7102 finish_compound_stmt (compound_stmt
);
7105 /* Build a __transaction_atomic or __transaction_relaxed expression. If
7106 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
7110 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
7115 expr
= build_must_not_throw_expr (expr
, noex
);
7117 SET_EXPR_LOCATION (expr
, loc
);
7118 TREE_SIDE_EFFECTS (expr
) = 1;
7120 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
7121 if (flags
& TM_STMT_ATTR_RELAXED
)
7122 TRANSACTION_EXPR_RELAXED (ret
) = 1;
7123 TREE_SIDE_EFFECTS (ret
) = 1;
7124 SET_EXPR_LOCATION (ret
, loc
);
7129 init_cp_semantics (void)
7133 /* Build a STATIC_ASSERT for a static assertion with the condition
7134 CONDITION and the message text MESSAGE. LOCATION is the location
7135 of the static assertion in the source code. When MEMBER_P, this
7136 static assertion is a member of a class. */
7138 finish_static_assert (tree condition
, tree message
, location_t location
,
7141 if (message
== NULL_TREE
7142 || message
== error_mark_node
7143 || condition
== NULL_TREE
7144 || condition
== error_mark_node
)
7147 if (check_for_bare_parameter_packs (condition
))
7148 condition
= error_mark_node
;
7150 if (type_dependent_expression_p (condition
)
7151 || value_dependent_expression_p (condition
))
7153 /* We're in a template; build a STATIC_ASSERT and put it in
7157 assertion
= make_node (STATIC_ASSERT
);
7158 STATIC_ASSERT_CONDITION (assertion
) = condition
;
7159 STATIC_ASSERT_MESSAGE (assertion
) = message
;
7160 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
7163 maybe_add_class_template_decl_list (current_class_type
,
7167 add_stmt (assertion
);
7172 /* Fold the expression and convert it to a boolean value. */
7173 condition
= instantiate_non_dependent_expr (condition
);
7174 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
7175 condition
= maybe_constant_value (condition
);
7177 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
7178 /* Do nothing; the condition is satisfied. */
7182 location_t saved_loc
= input_location
;
7184 input_location
= location
;
7185 if (TREE_CODE (condition
) == INTEGER_CST
7186 && integer_zerop (condition
))
7187 /* Report the error. */
7188 error ("static assertion failed: %s", TREE_STRING_POINTER (message
));
7189 else if (condition
&& condition
!= error_mark_node
)
7191 error ("non-constant condition for static assertion");
7192 if (require_potential_rvalue_constant_expression (condition
))
7193 cxx_constant_value (condition
);
7195 input_location
= saved_loc
;
7199 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
7200 suitable for use as a type-specifier.
7202 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
7203 id-expression or a class member access, FALSE when it was parsed as
7204 a full expression. */
7207 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
7208 tsubst_flags_t complain
)
7210 tree type
= NULL_TREE
;
7212 if (!expr
|| error_operand_p (expr
))
7213 return error_mark_node
;
7216 || TREE_CODE (expr
) == TYPE_DECL
7217 || (TREE_CODE (expr
) == BIT_NOT_EXPR
7218 && TYPE_P (TREE_OPERAND (expr
, 0))))
7220 if (complain
& tf_error
)
7221 error ("argument to decltype must be an expression");
7222 return error_mark_node
;
7225 /* Depending on the resolution of DR 1172, we may later need to distinguish
7226 instantiation-dependent but not type-dependent expressions so that, say,
7227 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
7228 if (instantiation_dependent_expression_p (expr
))
7230 type
= cxx_make_type (DECLTYPE_TYPE
);
7231 DECLTYPE_TYPE_EXPR (type
) = expr
;
7232 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
7233 = id_expression_or_member_access_p
;
7234 SET_TYPE_STRUCTURAL_EQUALITY (type
);
7239 /* The type denoted by decltype(e) is defined as follows: */
7241 expr
= resolve_nondeduced_context (expr
);
7243 if (invalid_nonstatic_memfn_p (expr
, complain
))
7244 return error_mark_node
;
7246 if (type_unknown_p (expr
))
7248 if (complain
& tf_error
)
7249 error ("decltype cannot resolve address of overloaded function");
7250 return error_mark_node
;
7253 /* To get the size of a static data member declared as an array of
7254 unknown bound, we need to instantiate it. */
7256 && VAR_HAD_UNKNOWN_BOUND (expr
)
7257 && DECL_TEMPLATE_INSTANTIATION (expr
))
7258 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
7260 if (id_expression_or_member_access_p
)
7262 /* If e is an id-expression or a class member access (5.2.5
7263 [expr.ref]), decltype(e) is defined as the type of the entity
7264 named by e. If there is no such entity, or e names a set of
7265 overloaded functions, the program is ill-formed. */
7266 if (identifier_p (expr
))
7267 expr
= lookup_name (expr
);
7269 if (INDIRECT_REF_P (expr
))
7270 /* This can happen when the expression is, e.g., "a.b". Just
7271 look at the underlying operand. */
7272 expr
= TREE_OPERAND (expr
, 0);
7274 if (TREE_CODE (expr
) == OFFSET_REF
7275 || TREE_CODE (expr
) == MEMBER_REF
7276 || TREE_CODE (expr
) == SCOPE_REF
)
7277 /* We're only interested in the field itself. If it is a
7278 BASELINK, we will need to see through it in the next
7280 expr
= TREE_OPERAND (expr
, 1);
7282 if (BASELINK_P (expr
))
7283 /* See through BASELINK nodes to the underlying function. */
7284 expr
= BASELINK_FUNCTIONS (expr
);
7286 switch (TREE_CODE (expr
))
7289 if (DECL_BIT_FIELD_TYPE (expr
))
7291 type
= DECL_BIT_FIELD_TYPE (expr
);
7294 /* Fall through for fields that aren't bitfields. */
7301 case TEMPLATE_PARM_INDEX
:
7302 expr
= mark_type_use (expr
);
7303 type
= TREE_TYPE (expr
);
7307 type
= error_mark_node
;
7312 mark_type_use (expr
);
7313 type
= is_bitfield_expr_with_lowered_type (expr
);
7315 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
7323 /* We can get here when the id-expression refers to an
7324 enumerator or non-type template parameter. */
7325 type
= TREE_TYPE (expr
);
7329 /* Handle instantiated template non-type arguments. */
7330 type
= TREE_TYPE (expr
);
7336 /* Within a lambda-expression:
7338 Every occurrence of decltype((x)) where x is a possibly
7339 parenthesized id-expression that names an entity of
7340 automatic storage duration is treated as if x were
7341 transformed into an access to a corresponding data member
7342 of the closure type that would have been declared if x
7343 were a use of the denoted entity. */
7344 if (outer_automatic_var_p (expr
)
7345 && current_function_decl
7346 && LAMBDA_FUNCTION_P (current_function_decl
))
7347 type
= capture_decltype (expr
);
7348 else if (error_operand_p (expr
))
7349 type
= error_mark_node
;
7350 else if (expr
== current_class_ptr
)
7351 /* If the expression is just "this", we want the
7352 cv-unqualified pointer for the "this" type. */
7353 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
7356 /* Otherwise, where T is the type of e, if e is an lvalue,
7357 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
7358 cp_lvalue_kind clk
= lvalue_kind (expr
);
7359 type
= unlowered_expr_type (expr
);
7360 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
7362 /* For vector types, pick a non-opaque variant. */
7363 if (TREE_CODE (type
) == VECTOR_TYPE
)
7364 type
= strip_typedefs (type
);
7366 if (clk
!= clk_none
&& !(clk
& clk_class
))
7367 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
7374 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
7375 __has_nothrow_copy, depending on assign_p. */
7378 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
7385 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
7388 fns
= (*CLASSTYPE_METHOD_VEC (type
))[ix
];
7390 else if (TYPE_HAS_COPY_CTOR (type
))
7392 /* If construction of the copy constructor was postponed, create
7394 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
7395 lazily_declare_fn (sfk_copy_constructor
, type
);
7396 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
7397 lazily_declare_fn (sfk_move_constructor
, type
);
7398 fns
= CLASSTYPE_CONSTRUCTORS (type
);
7403 for (; fns
; fns
= OVL_NEXT (fns
))
7405 tree fn
= OVL_CURRENT (fns
);
7409 if (copy_fn_p (fn
) == 0)
7412 else if (copy_fn_p (fn
) <= 0)
7415 maybe_instantiate_noexcept (fn
);
7416 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
7423 /* Actually evaluates the trait. */
7426 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
7428 enum tree_code type_code1
;
7431 type_code1
= TREE_CODE (type1
);
7435 case CPTK_HAS_NOTHROW_ASSIGN
:
7436 type1
= strip_array_types (type1
);
7437 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
7438 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
7439 || (CLASS_TYPE_P (type1
)
7440 && classtype_has_nothrow_assign_or_copy_p (type1
,
7443 case CPTK_HAS_TRIVIAL_ASSIGN
:
7444 /* ??? The standard seems to be missing the "or array of such a class
7445 type" wording for this trait. */
7446 type1
= strip_array_types (type1
);
7447 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
7448 && (trivial_type_p (type1
)
7449 || (CLASS_TYPE_P (type1
)
7450 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
7452 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
7453 type1
= strip_array_types (type1
);
7454 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
7455 || (CLASS_TYPE_P (type1
)
7456 && (t
= locate_ctor (type1
))
7457 && (maybe_instantiate_noexcept (t
),
7458 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
7460 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
7461 type1
= strip_array_types (type1
);
7462 return (trivial_type_p (type1
)
7463 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
7465 case CPTK_HAS_NOTHROW_COPY
:
7466 type1
= strip_array_types (type1
);
7467 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
7468 || (CLASS_TYPE_P (type1
)
7469 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
7471 case CPTK_HAS_TRIVIAL_COPY
:
7472 /* ??? The standard seems to be missing the "or array of such a class
7473 type" wording for this trait. */
7474 type1
= strip_array_types (type1
);
7475 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
7476 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
7478 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
7479 type1
= strip_array_types (type1
);
7480 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
7481 || (CLASS_TYPE_P (type1
)
7482 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
7484 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
7485 return type_has_virtual_destructor (type1
);
7487 case CPTK_IS_ABSTRACT
:
7488 return (ABSTRACT_CLASS_TYPE_P (type1
));
7490 case CPTK_IS_BASE_OF
:
7491 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
7492 && (same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
7493 || DERIVED_FROM_P (type1
, type2
)));
7496 return (NON_UNION_CLASS_TYPE_P (type1
));
7499 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
7502 return (type_code1
== ENUMERAL_TYPE
);
7505 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
7507 case CPTK_IS_LITERAL_TYPE
:
7508 return (literal_type_p (type1
));
7511 return (pod_type_p (type1
));
7513 case CPTK_IS_POLYMORPHIC
:
7514 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
7516 case CPTK_IS_STD_LAYOUT
:
7517 return (std_layout_type_p (type1
));
7519 case CPTK_IS_TRIVIAL
:
7520 return (trivial_type_p (type1
));
7522 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
7523 return is_trivially_xible (MODIFY_EXPR
, type1
, type2
);
7525 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
7526 return is_trivially_xible (INIT_EXPR
, type1
, type2
);
7528 case CPTK_IS_TRIVIALLY_COPYABLE
:
7529 return (trivially_copyable_p (type1
));
7532 return (type_code1
== UNION_TYPE
);
7540 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
7541 void, or a complete type, returns true, otherwise false. */
7544 check_trait_type (tree type
)
7546 if (type
== NULL_TREE
)
7549 if (TREE_CODE (type
) == TREE_LIST
)
7550 return (check_trait_type (TREE_VALUE (type
))
7551 && check_trait_type (TREE_CHAIN (type
)));
7553 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
7554 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
7557 if (VOID_TYPE_P (type
))
7560 return !!complete_type_or_else (strip_array_types (type
), NULL_TREE
);
7563 /* Process a trait expression. */
7566 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
7568 if (type1
== error_mark_node
7569 || type2
== error_mark_node
)
7570 return error_mark_node
;
7572 if (processing_template_decl
)
7574 tree trait_expr
= make_node (TRAIT_EXPR
);
7575 TREE_TYPE (trait_expr
) = boolean_type_node
;
7576 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
7577 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
7578 TRAIT_EXPR_KIND (trait_expr
) = kind
;
7584 case CPTK_HAS_NOTHROW_ASSIGN
:
7585 case CPTK_HAS_TRIVIAL_ASSIGN
:
7586 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
7587 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
7588 case CPTK_HAS_NOTHROW_COPY
:
7589 case CPTK_HAS_TRIVIAL_COPY
:
7590 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
7591 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
7592 case CPTK_IS_ABSTRACT
:
7595 case CPTK_IS_LITERAL_TYPE
:
7597 case CPTK_IS_POLYMORPHIC
:
7598 case CPTK_IS_STD_LAYOUT
:
7599 case CPTK_IS_TRIVIAL
:
7600 case CPTK_IS_TRIVIALLY_COPYABLE
:
7601 if (!check_trait_type (type1
))
7602 return error_mark_node
;
7605 case CPTK_IS_TRIVIALLY_ASSIGNABLE
:
7606 case CPTK_IS_TRIVIALLY_CONSTRUCTIBLE
:
7607 if (!check_trait_type (type1
)
7608 || !check_trait_type (type2
))
7609 return error_mark_node
;
7612 case CPTK_IS_BASE_OF
:
7613 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
7614 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
7615 && !complete_type_or_else (type2
, NULL_TREE
))
7616 /* We already issued an error. */
7617 return error_mark_node
;
7629 return (trait_expr_value (kind
, type1
, type2
)
7630 ? boolean_true_node
: boolean_false_node
);
7633 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
7634 which is ignored for C++. */
7637 set_float_const_decimal64 (void)
7642 clear_float_const_decimal64 (void)
7647 float_const_decimal64_p (void)
7653 /* Return true if T designates the implied `this' parameter. */
7656 is_this_parameter (tree t
)
7658 if (!DECL_P (t
) || DECL_NAME (t
) != this_identifier
)
7660 gcc_assert (TREE_CODE (t
) == PARM_DECL
|| is_capture_proxy (t
));
7664 /* Insert the deduced return type for an auto function. */
7667 apply_deduced_return_type (tree fco
, tree return_type
)
7671 if (return_type
== error_mark_node
)
7674 if (LAMBDA_FUNCTION_P (fco
))
7676 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7677 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
7680 if (DECL_CONV_FN_P (fco
))
7681 DECL_NAME (fco
) = mangle_conv_op_name_for_type (return_type
);
7683 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
7685 result
= DECL_RESULT (fco
);
7686 if (result
== NULL_TREE
)
7688 if (TREE_TYPE (result
) == return_type
)
7691 /* We already have a DECL_RESULT from start_preparsed_function.
7692 Now we need to redo the work it and allocate_struct_function
7693 did to reflect the new type. */
7694 gcc_assert (current_function_decl
== fco
);
7695 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
7696 TYPE_MAIN_VARIANT (return_type
));
7697 DECL_ARTIFICIAL (result
) = 1;
7698 DECL_IGNORED_P (result
) = 1;
7699 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
7702 DECL_RESULT (fco
) = result
;
7704 if (!processing_template_decl
)
7706 if (!VOID_TYPE_P (TREE_TYPE (result
)))
7707 complete_type_or_else (TREE_TYPE (result
), NULL_TREE
);
7708 bool aggr
= aggregate_value_p (result
, fco
);
7709 #ifdef PCC_STATIC_STRUCT_RETURN
7710 cfun
->returns_pcc_struct
= aggr
;
7712 cfun
->returns_struct
= aggr
;
7717 /* DECL is a local variable or parameter from the surrounding scope of a
7718 lambda-expression. Returns the decltype for a use of the capture field
7719 for DECL even if it hasn't been captured yet. */
7722 capture_decltype (tree decl
)
7724 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
7725 /* FIXME do lookup instead of list walk? */
7726 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
7730 type
= TREE_TYPE (TREE_PURPOSE (cap
));
7732 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
7735 error ("%qD is not captured", decl
);
7736 return error_mark_node
;
7739 type
= TREE_TYPE (decl
);
7740 if (TREE_CODE (type
) == REFERENCE_TYPE
7741 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
7742 type
= TREE_TYPE (type
);
7745 case CPLD_REFERENCE
:
7746 type
= TREE_TYPE (decl
);
7747 if (TREE_CODE (type
) != REFERENCE_TYPE
)
7748 type
= build_reference_type (TREE_TYPE (decl
));
7755 if (TREE_CODE (type
) != REFERENCE_TYPE
)
7757 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
7758 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
7760 type
= build_reference_type (type
);
7765 #include "gt-cp-semantics.h"