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, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
34 #include "c-family/c-objc.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
41 #include "diagnostic.h"
43 #include "tree-iterator.h"
49 /* There routines provide a modular interface to perform many parsing
50 operations. They may therefore be used during actual parsing, or
51 during template instantiation, which may be regarded as a
52 degenerate form of parsing. */
54 static tree
maybe_convert_cond (tree
);
55 static tree
finalize_nrv_r (tree
*, int *, void *);
56 static tree
capture_decltype (tree
);
57 static tree
thisify_lambda_field (tree
);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct GTY(()) deferred_access
{
112 /* A VEC representing name-lookups for which we have deferred
113 checking access controls. We cannot check the accessibility of
114 names used in a decl-specifier-seq until we know what is being
115 declared because code like:
122 A::B* A::f() { return 0; }
124 is valid, even though `A::B' is not generally accessible. */
125 VEC (deferred_access_check
,gc
)* GTY(()) deferred_access_checks
;
127 /* The current mode of access checks. */
128 enum deferring_kind deferring_access_checks_kind
;
131 DEF_VEC_O (deferred_access
);
132 DEF_VEC_ALLOC_O (deferred_access
,gc
);
134 /* Data for deferred access checking. */
135 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
136 static GTY(()) unsigned deferred_access_no_check
;
138 /* Save the current deferred access states and start deferred
139 access checking iff DEFER_P is true. */
142 push_deferring_access_checks (deferring_kind deferring
)
144 /* For context like template instantiation, access checking
145 disabling applies to all nested context. */
146 if (deferred_access_no_check
|| deferring
== dk_no_check
)
147 deferred_access_no_check
++;
150 deferred_access
*ptr
;
152 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
153 ptr
->deferred_access_checks
= NULL
;
154 ptr
->deferring_access_checks_kind
= deferring
;
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check
)
165 VEC_last (deferred_access
, deferred_access_stack
)
166 ->deferring_access_checks_kind
= dk_deferred
;
169 /* Stop deferring access checks. */
172 stop_deferring_access_checks (void)
174 if (!deferred_access_no_check
)
175 VEC_last (deferred_access
, deferred_access_stack
)
176 ->deferring_access_checks_kind
= dk_no_deferred
;
179 /* Discard the current deferred access checks and restore the
183 pop_deferring_access_checks (void)
185 if (deferred_access_no_check
)
186 deferred_access_no_check
--;
188 VEC_pop (deferred_access
, deferred_access_stack
);
191 /* Returns a TREE_LIST representing the deferred checks.
192 The TREE_PURPOSE of each node is the type through which the
193 access occurred; the TREE_VALUE is the declaration named.
196 VEC (deferred_access_check
,gc
)*
197 get_deferred_access_checks (void)
199 if (deferred_access_no_check
)
202 return (VEC_last (deferred_access
, deferred_access_stack
)
203 ->deferred_access_checks
);
206 /* Take current deferred checks and combine with the
207 previous states if we also defer checks previously.
208 Otherwise perform checks now. */
211 pop_to_parent_deferring_access_checks (void)
213 if (deferred_access_no_check
)
214 deferred_access_no_check
--;
217 VEC (deferred_access_check
,gc
) *checks
;
218 deferred_access
*ptr
;
220 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
221 ->deferred_access_checks
);
223 VEC_pop (deferred_access
, deferred_access_stack
);
224 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
225 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
228 perform_access_checks (checks
);
232 /* Merge with parent. */
234 deferred_access_check
*chk
, *probe
;
236 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
238 FOR_EACH_VEC_ELT (deferred_access_check
,
239 ptr
->deferred_access_checks
, j
, probe
)
241 if (probe
->binfo
== chk
->binfo
&&
242 probe
->decl
== chk
->decl
&&
243 probe
->diag_decl
== chk
->diag_decl
)
246 /* Insert into parent's checks. */
247 VEC_safe_push (deferred_access_check
, gc
,
248 ptr
->deferred_access_checks
, chk
);
255 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
256 is the BINFO indicating the qualifying scope used to access the
257 DECL node stored in the TREE_VALUE of the node. */
260 perform_access_checks (VEC (deferred_access_check
,gc
)* checks
)
263 deferred_access_check
*chk
;
268 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
269 enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
);
272 /* Perform the deferred access checks.
274 After performing the checks, we still have to keep the list
275 `deferred_access_stack->deferred_access_checks' since we may want
276 to check access for them again later in a different context.
283 A::X A::a, x; // No error for `A::a', error for `x'
285 We have to perform deferred access of `A::X', first with `A::a',
289 perform_deferred_access_checks (void)
291 perform_access_checks (get_deferred_access_checks ());
294 /* Defer checking the accessibility of DECL, when looked up in
295 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
298 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
)
301 deferred_access
*ptr
;
302 deferred_access_check
*chk
;
303 deferred_access_check
*new_access
;
306 /* Exit if we are in a context that no access checking is performed.
308 if (deferred_access_no_check
)
311 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
313 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
315 /* If we are not supposed to defer access checks, just check now. */
316 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
318 enforce_access (binfo
, decl
, diag_decl
);
322 /* See if we are already going to perform this check. */
323 FOR_EACH_VEC_ELT (deferred_access_check
,
324 ptr
->deferred_access_checks
, i
, chk
)
326 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
327 chk
->diag_decl
== diag_decl
)
332 /* If not, record the check. */
334 VEC_safe_push (deferred_access_check
, gc
,
335 ptr
->deferred_access_checks
, 0);
336 new_access
->binfo
= binfo
;
337 new_access
->decl
= decl
;
338 new_access
->diag_decl
= diag_decl
;
341 /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL
342 is accessible in BINFO, and possibly complain if not. If we're not
343 checking access, everything is accessible. */
346 speculative_access_check (tree binfo
, tree decl
, tree diag_decl
,
349 if (deferred_access_no_check
)
352 /* If we're checking for implicit delete, we don't want access
354 if (!accessible_p (binfo
, decl
, true))
356 /* Unless we're under maybe_explain_implicit_delete. */
358 enforce_access (binfo
, decl
, diag_decl
);
365 /* Returns nonzero if the current statement is a full expression,
366 i.e. temporaries created during that statement should be destroyed
367 at the end of the statement. */
370 stmts_are_full_exprs_p (void)
372 return current_stmt_tree ()->stmts_are_full_exprs_p
;
375 /* T is a statement. Add it to the statement-tree. This is the C++
376 version. The C/ObjC frontends have a slightly different version of
382 enum tree_code code
= TREE_CODE (t
);
384 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
386 if (!EXPR_HAS_LOCATION (t
))
387 SET_EXPR_LOCATION (t
, input_location
);
389 /* When we expand a statement-tree, we must know whether or not the
390 statements are full-expressions. We record that fact here. */
391 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
394 /* Add T to the statement-tree. Non-side-effect statements need to be
395 recorded during statement expressions. */
396 append_to_statement_list_force (t
, &cur_stmt_list
);
401 /* Returns the stmt_tree to which statements are currently being added. */
404 current_stmt_tree (void)
407 ? &cfun
->language
->base
.x_stmt_tree
408 : &scope_chain
->x_stmt_tree
);
411 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
414 maybe_cleanup_point_expr (tree expr
)
416 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
417 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
421 /* Like maybe_cleanup_point_expr except have the type of the new expression be
422 void so we don't need to create a temporary variable to hold the inner
423 expression. The reason why we do this is because the original type might be
424 an aggregate and we cannot create a temporary variable for that type. */
427 maybe_cleanup_point_expr_void (tree expr
)
429 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
430 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
436 /* Create a declaration statement for the declaration given by the DECL. */
439 add_decl_expr (tree decl
)
441 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
442 if (DECL_INITIAL (decl
)
443 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
444 r
= maybe_cleanup_point_expr_void (r
);
448 /* Finish a scope. */
451 do_poplevel (tree stmt_list
)
455 if (stmts_are_full_exprs_p ())
456 block
= poplevel (kept_level_p (), 1, 0);
458 stmt_list
= pop_stmt_list (stmt_list
);
460 if (!processing_template_decl
)
462 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
463 /* ??? See c_end_compound_stmt re statement expressions. */
469 /* Begin a new scope. */
472 do_pushlevel (scope_kind sk
)
474 tree ret
= push_stmt_list ();
475 if (stmts_are_full_exprs_p ())
476 begin_scope (sk
, NULL
);
480 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
481 when the current scope is exited. EH_ONLY is true when this is not
482 meant to apply to normal control flow transfer. */
485 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
487 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
488 CLEANUP_EH_ONLY (stmt
) = eh_only
;
490 CLEANUP_BODY (stmt
) = push_stmt_list ();
493 /* Begin a conditional that might contain a declaration. When generating
494 normal code, we want the declaration to appear before the statement
495 containing the conditional. When generating template code, we want the
496 conditional to be rendered as the raw DECL_EXPR. */
499 begin_cond (tree
*cond_p
)
501 if (processing_template_decl
)
502 *cond_p
= push_stmt_list ();
505 /* Finish such a conditional. */
508 finish_cond (tree
*cond_p
, tree expr
)
510 if (processing_template_decl
)
512 tree cond
= pop_stmt_list (*cond_p
);
513 if (TREE_CODE (cond
) == DECL_EXPR
)
516 if (check_for_bare_parameter_packs (expr
))
517 *cond_p
= error_mark_node
;
522 /* If *COND_P specifies a conditional with a declaration, transform the
525 for (; A x = 42;) { }
527 while (true) { A x = 42; if (!x) break; }
528 for (;;) { A x = 42; if (!x) break; }
529 The statement list for BODY will be empty if the conditional did
530 not declare anything. */
533 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
537 if (!TREE_SIDE_EFFECTS (body
))
541 *cond_p
= boolean_true_node
;
543 if_stmt
= begin_if_stmt ();
544 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
545 finish_if_stmt_cond (cond
, if_stmt
);
546 finish_break_stmt ();
547 finish_then_clause (if_stmt
);
548 finish_if_stmt (if_stmt
);
551 /* Finish a goto-statement. */
554 finish_goto_stmt (tree destination
)
556 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
557 destination
= lookup_label (destination
);
559 /* We warn about unused labels with -Wunused. That means we have to
560 mark the used labels as used. */
561 if (TREE_CODE (destination
) == LABEL_DECL
)
562 TREE_USED (destination
) = 1;
565 destination
= mark_rvalue_use (destination
);
566 if (!processing_template_decl
)
568 destination
= cp_convert (ptr_type_node
, destination
);
569 if (error_operand_p (destination
))
574 check_goto (destination
);
576 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
579 /* COND is the condition-expression for an if, while, etc.,
580 statement. Convert it to a boolean value, if appropriate.
581 In addition, verify sequence points if -Wsequence-point is enabled. */
584 maybe_convert_cond (tree cond
)
586 /* Empty conditions remain empty. */
590 /* Wait until we instantiate templates before doing conversion. */
591 if (processing_template_decl
)
594 if (warn_sequence_point
)
595 verify_sequence_points (cond
);
597 /* Do the conversion. */
598 cond
= convert_from_reference (cond
);
600 if (TREE_CODE (cond
) == MODIFY_EXPR
601 && !TREE_NO_WARNING (cond
)
604 warning (OPT_Wparentheses
,
605 "suggest parentheses around assignment used as truth value");
606 TREE_NO_WARNING (cond
) = 1;
609 return condition_conversion (cond
);
612 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
615 finish_expr_stmt (tree expr
)
619 if (expr
!= NULL_TREE
)
621 if (!processing_template_decl
)
623 if (warn_sequence_point
)
624 verify_sequence_points (expr
);
625 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
627 else if (!type_dependent_expression_p (expr
))
628 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
629 tf_warning_or_error
);
631 if (check_for_bare_parameter_packs (expr
))
632 expr
= error_mark_node
;
634 /* Simplification of inner statement expressions, compound exprs,
635 etc can result in us already having an EXPR_STMT. */
636 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
638 if (TREE_CODE (expr
) != EXPR_STMT
)
639 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
640 expr
= maybe_cleanup_point_expr_void (expr
);
652 /* Begin an if-statement. Returns a newly created IF_STMT if
659 scope
= do_pushlevel (sk_block
);
660 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
661 NULL_TREE
, NULL_TREE
, scope
);
662 begin_cond (&IF_COND (r
));
666 /* Process the COND of an if-statement, which may be given by
670 finish_if_stmt_cond (tree cond
, tree if_stmt
)
672 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
674 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
677 /* Finish the then-clause of an if-statement, which may be given by
681 finish_then_clause (tree if_stmt
)
683 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
687 /* Begin the else-clause of an if-statement. */
690 begin_else_clause (tree if_stmt
)
692 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
695 /* Finish the else-clause of an if-statement, which may be given by
699 finish_else_clause (tree if_stmt
)
701 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
704 /* Finish an if-statement. */
707 finish_if_stmt (tree if_stmt
)
709 tree scope
= IF_SCOPE (if_stmt
);
710 IF_SCOPE (if_stmt
) = NULL
;
711 add_stmt (do_poplevel (scope
));
715 /* Begin a while-statement. Returns a newly created WHILE_STMT if
719 begin_while_stmt (void)
722 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
724 WHILE_BODY (r
) = do_pushlevel (sk_block
);
725 begin_cond (&WHILE_COND (r
));
729 /* Process the COND of a while-statement, which may be given by
733 finish_while_stmt_cond (tree cond
, tree while_stmt
)
735 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
736 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
739 /* Finish a while-statement, which may be given by WHILE_STMT. */
742 finish_while_stmt (tree while_stmt
)
744 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
748 /* Begin a do-statement. Returns a newly created DO_STMT if
754 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
756 DO_BODY (r
) = push_stmt_list ();
760 /* Finish the body of a do-statement, which may be given by DO_STMT. */
763 finish_do_body (tree do_stmt
)
765 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
767 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
768 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
770 if (IS_EMPTY_STMT (body
))
771 warning (OPT_Wempty_body
,
772 "suggest explicit braces around empty body in %<do%> statement");
775 /* Finish a do-statement, which may be given by DO_STMT, and whose
776 COND is as indicated. */
779 finish_do_stmt (tree cond
, tree do_stmt
)
781 cond
= maybe_convert_cond (cond
);
782 DO_COND (do_stmt
) = cond
;
786 /* Finish a return-statement. The EXPRESSION returned, if any, is as
790 finish_return_stmt (tree expr
)
795 expr
= check_return_expr (expr
, &no_warning
);
797 if (flag_openmp
&& !check_omp_return ())
798 return error_mark_node
;
799 if (!processing_template_decl
)
801 if (warn_sequence_point
)
802 verify_sequence_points (expr
);
804 if (DECL_DESTRUCTOR_P (current_function_decl
)
805 || (DECL_CONSTRUCTOR_P (current_function_decl
)
806 && targetm
.cxx
.cdtor_returns_this ()))
808 /* Similarly, all destructors must run destructors for
809 base-classes before returning. So, all returns in a
810 destructor get sent to the DTOR_LABEL; finish_function emits
811 code to return a value there. */
812 return finish_goto_stmt (cdtor_label
);
816 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
817 TREE_NO_WARNING (r
) |= no_warning
;
818 r
= maybe_cleanup_point_expr_void (r
);
825 /* Begin the scope of a for-statement or a range-for-statement.
826 Both the returned trees are to be used in a call to
827 begin_for_stmt or begin_range_for_stmt. */
830 begin_for_scope (tree
*init
)
832 tree scope
= NULL_TREE
;
833 if (flag_new_for_scope
> 0)
834 scope
= do_pushlevel (sk_for
);
836 if (processing_template_decl
)
837 *init
= push_stmt_list ();
844 /* Begin a for-statement. Returns a new FOR_STMT.
845 SCOPE and INIT should be the return of begin_for_scope,
849 begin_for_stmt (tree scope
, tree init
)
853 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
854 NULL_TREE
, NULL_TREE
, NULL_TREE
);
856 if (scope
== NULL_TREE
)
858 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
860 scope
= begin_for_scope (&init
);
862 FOR_INIT_STMT (r
) = init
;
863 FOR_SCOPE (r
) = scope
;
868 /* Finish the for-init-statement of a for-statement, which may be
869 given by FOR_STMT. */
872 finish_for_init_stmt (tree for_stmt
)
874 if (processing_template_decl
)
875 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
877 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
878 begin_cond (&FOR_COND (for_stmt
));
881 /* Finish the COND of a for-statement, which may be given by
885 finish_for_cond (tree cond
, tree for_stmt
)
887 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
888 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
891 /* Finish the increment-EXPRESSION in a for-statement, which may be
892 given by FOR_STMT. */
895 finish_for_expr (tree expr
, tree for_stmt
)
899 /* If EXPR is an overloaded function, issue an error; there is no
900 context available to use to perform overload resolution. */
901 if (type_unknown_p (expr
))
903 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
904 expr
= error_mark_node
;
906 if (!processing_template_decl
)
908 if (warn_sequence_point
)
909 verify_sequence_points (expr
);
910 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
911 tf_warning_or_error
);
913 else if (!type_dependent_expression_p (expr
))
914 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
915 tf_warning_or_error
);
916 expr
= maybe_cleanup_point_expr_void (expr
);
917 if (check_for_bare_parameter_packs (expr
))
918 expr
= error_mark_node
;
919 FOR_EXPR (for_stmt
) = expr
;
922 /* Finish the body of a for-statement, which may be given by
923 FOR_STMT. The increment-EXPR for the loop must be
925 It can also finish RANGE_FOR_STMT. */
928 finish_for_stmt (tree for_stmt
)
930 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
931 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
933 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
935 /* Pop the scope for the body of the loop. */
936 if (flag_new_for_scope
> 0)
939 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
940 ? &RANGE_FOR_SCOPE (for_stmt
)
941 : &FOR_SCOPE (for_stmt
));
944 add_stmt (do_poplevel (scope
));
950 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
951 SCOPE and INIT should be the return of begin_for_scope,
953 To finish it call finish_for_stmt(). */
956 begin_range_for_stmt (tree scope
, tree init
)
960 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
961 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
963 if (scope
== NULL_TREE
)
965 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
967 scope
= begin_for_scope (&init
);
970 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
973 pop_stmt_list (init
);
974 RANGE_FOR_SCOPE (r
) = scope
;
979 /* Finish the head of a range-based for statement, which may
980 be given by RANGE_FOR_STMT. DECL must be the declaration
981 and EXPR must be the loop expression. */
984 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
986 RANGE_FOR_DECL (range_for_stmt
) = decl
;
987 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
988 add_stmt (range_for_stmt
);
989 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
992 /* Finish a break-statement. */
995 finish_break_stmt (void)
997 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1000 /* Finish a continue-statement. */
1003 finish_continue_stmt (void)
1005 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1008 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1012 begin_switch_stmt (void)
1016 scope
= do_pushlevel (sk_block
);
1017 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1019 begin_cond (&SWITCH_STMT_COND (r
));
1024 /* Finish the cond of a switch-statement. */
1027 finish_switch_cond (tree cond
, tree switch_stmt
)
1029 tree orig_type
= NULL
;
1030 if (!processing_template_decl
)
1032 /* Convert the condition to an integer or enumeration type. */
1033 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1034 if (cond
== NULL_TREE
)
1036 error ("switch quantity not an integer");
1037 cond
= error_mark_node
;
1039 orig_type
= TREE_TYPE (cond
);
1040 if (cond
!= error_mark_node
)
1044 Integral promotions are performed. */
1045 cond
= perform_integral_promotions (cond
);
1046 cond
= maybe_cleanup_point_expr (cond
);
1049 if (check_for_bare_parameter_packs (cond
))
1050 cond
= error_mark_node
;
1051 else if (!processing_template_decl
&& warn_sequence_point
)
1052 verify_sequence_points (cond
);
1054 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1055 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1056 add_stmt (switch_stmt
);
1057 push_switch (switch_stmt
);
1058 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1061 /* Finish the body of a switch-statement, which may be given by
1062 SWITCH_STMT. The COND to switch on is indicated. */
1065 finish_switch_stmt (tree switch_stmt
)
1069 SWITCH_STMT_BODY (switch_stmt
) =
1070 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1074 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1075 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1076 add_stmt (do_poplevel (scope
));
1079 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1083 begin_try_block (void)
1085 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1087 TRY_STMTS (r
) = push_stmt_list ();
1091 /* Likewise, for a function-try-block. The block returned in
1092 *COMPOUND_STMT is an artificial outer scope, containing the
1093 function-try-block. */
1096 begin_function_try_block (tree
*compound_stmt
)
1099 /* This outer scope does not exist in the C++ standard, but we need
1100 a place to put __FUNCTION__ and similar variables. */
1101 *compound_stmt
= begin_compound_stmt (0);
1102 r
= begin_try_block ();
1103 FN_TRY_BLOCK_P (r
) = 1;
1107 /* Finish a try-block, which may be given by TRY_BLOCK. */
1110 finish_try_block (tree try_block
)
1112 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1113 TRY_HANDLERS (try_block
) = push_stmt_list ();
1116 /* Finish the body of a cleanup try-block, which may be given by
1120 finish_cleanup_try_block (tree try_block
)
1122 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1125 /* Finish an implicitly generated try-block, with a cleanup is given
1129 finish_cleanup (tree cleanup
, tree try_block
)
1131 TRY_HANDLERS (try_block
) = cleanup
;
1132 CLEANUP_P (try_block
) = 1;
1135 /* Likewise, for a function-try-block. */
1138 finish_function_try_block (tree try_block
)
1140 finish_try_block (try_block
);
1141 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1142 the try block, but moving it inside. */
1143 in_function_try_handler
= 1;
1146 /* Finish a handler-sequence for a try-block, which may be given by
1150 finish_handler_sequence (tree try_block
)
1152 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1153 check_handlers (TRY_HANDLERS (try_block
));
1156 /* Finish the handler-seq for a function-try-block, given by
1157 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1158 begin_function_try_block. */
1161 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1163 in_function_try_handler
= 0;
1164 finish_handler_sequence (try_block
);
1165 finish_compound_stmt (compound_stmt
);
1168 /* Begin a handler. Returns a HANDLER if appropriate. */
1171 begin_handler (void)
1175 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1178 /* Create a binding level for the eh_info and the exception object
1180 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1185 /* Finish the handler-parameters for a handler, which may be given by
1186 HANDLER. DECL is the declaration for the catch parameter, or NULL
1187 if this is a `catch (...)' clause. */
1190 finish_handler_parms (tree decl
, tree handler
)
1192 tree type
= NULL_TREE
;
1193 if (processing_template_decl
)
1197 decl
= pushdecl (decl
);
1198 decl
= push_template_decl (decl
);
1199 HANDLER_PARMS (handler
) = decl
;
1200 type
= TREE_TYPE (decl
);
1204 type
= expand_start_catch_block (decl
);
1205 HANDLER_TYPE (handler
) = type
;
1206 if (!processing_template_decl
&& type
)
1207 mark_used (eh_type_info (type
));
1210 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1211 the return value from the matching call to finish_handler_parms. */
1214 finish_handler (tree handler
)
1216 if (!processing_template_decl
)
1217 expand_end_catch_block ();
1218 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1221 /* Begin a compound statement. FLAGS contains some bits that control the
1222 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1223 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1224 block of a function. If BCS_TRY_BLOCK is set, this is the block
1225 created on behalf of a TRY statement. Returns a token to be passed to
1226 finish_compound_stmt. */
1229 begin_compound_stmt (unsigned int flags
)
1233 if (flags
& BCS_NO_SCOPE
)
1235 r
= push_stmt_list ();
1236 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1238 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1239 But, if it's a statement-expression with a scopeless block, there's
1240 nothing to keep, and we don't want to accidentally keep a block
1241 *inside* the scopeless block. */
1242 keep_next_level (false);
1245 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1247 /* When processing a template, we need to remember where the braces were,
1248 so that we can set up identical scopes when instantiating the template
1249 later. BIND_EXPR is a handy candidate for this.
1250 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1251 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1252 processing templates. */
1253 if (processing_template_decl
)
1255 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1256 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1257 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1258 TREE_SIDE_EFFECTS (r
) = 1;
1264 /* Finish a compound-statement, which is given by STMT. */
1267 finish_compound_stmt (tree stmt
)
1269 if (TREE_CODE (stmt
) == BIND_EXPR
)
1271 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1272 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1273 discard the BIND_EXPR so it can be merged with the containing
1275 if (TREE_CODE (body
) == STATEMENT_LIST
1276 && STATEMENT_LIST_HEAD (body
) == NULL
1277 && !BIND_EXPR_BODY_BLOCK (stmt
)
1278 && !BIND_EXPR_TRY_BLOCK (stmt
))
1281 BIND_EXPR_BODY (stmt
) = body
;
1283 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1284 stmt
= pop_stmt_list (stmt
);
1287 /* Destroy any ObjC "super" receivers that may have been
1289 objc_clear_super_receiver ();
1291 stmt
= do_poplevel (stmt
);
1294 /* ??? See c_end_compound_stmt wrt statement expressions. */
1299 /* Finish an asm-statement, whose components are a STRING, some
1300 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1301 LABELS. Also note whether the asm-statement should be
1302 considered volatile. */
1305 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1306 tree input_operands
, tree clobbers
, tree labels
)
1310 int ninputs
= list_length (input_operands
);
1311 int noutputs
= list_length (output_operands
);
1313 if (!processing_template_decl
)
1315 const char *constraint
;
1316 const char **oconstraints
;
1317 bool allows_mem
, allows_reg
, is_inout
;
1321 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1323 string
= resolve_asm_operand_names (string
, output_operands
,
1324 input_operands
, labels
);
1326 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1328 operand
= TREE_VALUE (t
);
1330 /* ??? Really, this should not be here. Users should be using a
1331 proper lvalue, dammit. But there's a long history of using
1332 casts in the output operands. In cases like longlong.h, this
1333 becomes a primitive form of typechecking -- if the cast can be
1334 removed, then the output operand had a type of the proper width;
1335 otherwise we'll get an error. Gross, but ... */
1336 STRIP_NOPS (operand
);
1338 operand
= mark_lvalue_use (operand
);
1340 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1341 operand
= error_mark_node
;
1343 if (operand
!= error_mark_node
1344 && (TREE_READONLY (operand
)
1345 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1346 /* Functions are not modifiable, even though they are
1348 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1349 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1350 /* If it's an aggregate and any field is const, then it is
1351 effectively const. */
1352 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1353 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1354 cxx_readonly_error (operand
, lv_asm
);
1356 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1357 oconstraints
[i
] = constraint
;
1359 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1360 &allows_mem
, &allows_reg
, &is_inout
))
1362 /* If the operand is going to end up in memory,
1363 mark it addressable. */
1364 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1365 operand
= error_mark_node
;
1368 operand
= error_mark_node
;
1370 TREE_VALUE (t
) = operand
;
1373 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1375 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1376 operand
= decay_conversion (TREE_VALUE (t
));
1378 /* If the type of the operand hasn't been determined (e.g.,
1379 because it involves an overloaded function), then issue
1380 an error message. There's no context available to
1381 resolve the overloading. */
1382 if (TREE_TYPE (operand
) == unknown_type_node
)
1384 error ("type of asm operand %qE could not be determined",
1386 operand
= error_mark_node
;
1389 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1390 oconstraints
, &allows_mem
, &allows_reg
))
1392 /* If the operand is going to end up in memory,
1393 mark it addressable. */
1394 if (!allows_reg
&& allows_mem
)
1396 /* Strip the nops as we allow this case. FIXME, this really
1397 should be rejected or made deprecated. */
1398 STRIP_NOPS (operand
);
1399 if (!cxx_mark_addressable (operand
))
1400 operand
= error_mark_node
;
1404 operand
= error_mark_node
;
1406 TREE_VALUE (t
) = operand
;
1410 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1411 output_operands
, input_operands
,
1413 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1414 r
= maybe_cleanup_point_expr_void (r
);
1415 return add_stmt (r
);
1418 /* Finish a label with the indicated NAME. Returns the new label. */
1421 finish_label_stmt (tree name
)
1423 tree decl
= define_label (input_location
, name
);
1425 if (decl
== error_mark_node
)
1426 return error_mark_node
;
1428 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1433 /* Finish a series of declarations for local labels. G++ allows users
1434 to declare "local" labels, i.e., labels with scope. This extension
1435 is useful when writing code involving statement-expressions. */
1438 finish_label_decl (tree name
)
1440 if (!at_function_scope_p ())
1442 error ("__label__ declarations are only allowed in function scopes");
1446 add_decl_expr (declare_local_label (name
));
1449 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1452 finish_decl_cleanup (tree decl
, tree cleanup
)
1454 push_cleanup (decl
, cleanup
, false);
1457 /* If the current scope exits with an exception, run CLEANUP. */
1460 finish_eh_cleanup (tree cleanup
)
1462 push_cleanup (NULL
, cleanup
, true);
1465 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1466 order they were written by the user. Each node is as for
1467 emit_mem_initializers. */
1470 finish_mem_initializers (tree mem_inits
)
1472 /* Reorder the MEM_INITS so that they are in the order they appeared
1473 in the source program. */
1474 mem_inits
= nreverse (mem_inits
);
1476 if (processing_template_decl
)
1480 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1482 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1483 check for bare parameter packs in the TREE_VALUE, because
1484 any parameter packs in the TREE_VALUE have already been
1485 bound as part of the TREE_PURPOSE. See
1486 make_pack_expansion for more information. */
1487 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1488 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1489 TREE_VALUE (mem
) = error_mark_node
;
1492 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1495 emit_mem_initializers (mem_inits
);
1498 /* Finish a parenthesized expression EXPR. */
1501 finish_parenthesized_expr (tree expr
)
1504 /* This inhibits warnings in c_common_truthvalue_conversion. */
1505 TREE_NO_WARNING (expr
) = 1;
1507 if (TREE_CODE (expr
) == OFFSET_REF
)
1508 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1509 enclosed in parentheses. */
1510 PTRMEM_OK_P (expr
) = 0;
1512 if (TREE_CODE (expr
) == STRING_CST
)
1513 PAREN_STRING_LITERAL_P (expr
) = 1;
1518 /* Finish a reference to a non-static data member (DECL) that is not
1519 preceded by `.' or `->'. */
1522 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1524 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1528 tree scope
= qualifying_scope
;
1529 if (scope
== NULL_TREE
)
1530 scope
= context_for_name_lookup (decl
);
1531 object
= maybe_dummy_object (scope
, NULL
);
1534 if (object
== error_mark_node
)
1535 return error_mark_node
;
1537 /* DR 613: Can use non-static data members without an associated
1538 object in sizeof/decltype/alignof. */
1539 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1540 && (!processing_template_decl
|| !current_class_ref
))
1542 if (current_function_decl
1543 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1544 error ("invalid use of member %q+D in static member function", decl
);
1546 error ("invalid use of non-static data member %q+D", decl
);
1547 error ("from this location");
1549 return error_mark_node
;
1552 if (current_class_ptr
)
1553 TREE_USED (current_class_ptr
) = 1;
1554 if (processing_template_decl
&& !qualifying_scope
)
1556 tree type
= TREE_TYPE (decl
);
1558 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1559 type
= TREE_TYPE (type
);
1562 /* Set the cv qualifiers. */
1563 int quals
= (current_class_ref
1564 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1565 : TYPE_UNQUALIFIED
);
1567 if (DECL_MUTABLE_P (decl
))
1568 quals
&= ~TYPE_QUAL_CONST
;
1570 quals
|= cp_type_quals (TREE_TYPE (decl
));
1571 type
= cp_build_qualified_type (type
, quals
);
1574 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1576 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1577 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1579 else if (processing_template_decl
)
1580 return build_qualified_name (TREE_TYPE (decl
),
1583 /*template_p=*/false);
1586 tree access_type
= TREE_TYPE (object
);
1588 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1591 /* If the data member was named `C::M', convert `*this' to `C'
1593 if (qualifying_scope
)
1595 tree binfo
= NULL_TREE
;
1596 object
= build_scoped_ref (object
, qualifying_scope
,
1600 return build_class_member_access_expr (object
, decl
,
1601 /*access_path=*/NULL_TREE
,
1602 /*preserve_reference=*/false,
1603 tf_warning_or_error
);
1607 /* If we are currently parsing a template and we encountered a typedef
1608 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1609 adds the typedef to a list tied to the current template.
1610 At tempate instantiatin time, that list is walked and access check
1611 performed for each typedef.
1612 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1615 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1617 location_t location
)
1619 tree template_info
= NULL
;
1620 tree cs
= current_scope ();
1622 if (!is_typedef_decl (typedef_decl
)
1624 || !CLASS_TYPE_P (context
)
1628 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1629 template_info
= get_template_info (cs
);
1632 && TI_TEMPLATE (template_info
)
1633 && !currently_open_class (context
))
1634 append_type_to_template_for_access_check (cs
, typedef_decl
,
1638 /* DECL was the declaration to which a qualified-id resolved. Issue
1639 an error message if it is not accessible. If OBJECT_TYPE is
1640 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1641 type of `*x', or `x', respectively. If the DECL was named as
1642 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1645 check_accessibility_of_qualified_id (tree decl
,
1647 tree nested_name_specifier
)
1650 tree qualifying_type
= NULL_TREE
;
1652 /* If we are parsing a template declaration and if decl is a typedef,
1653 add it to a list tied to the template.
1654 At template instantiation time, that list will be walked and
1655 access check performed. */
1656 add_typedef_to_current_template_for_access_check (decl
,
1657 nested_name_specifier
1658 ? nested_name_specifier
1659 : DECL_CONTEXT (decl
),
1662 /* If we're not checking, return immediately. */
1663 if (deferred_access_no_check
)
1666 /* Determine the SCOPE of DECL. */
1667 scope
= context_for_name_lookup (decl
);
1668 /* If the SCOPE is not a type, then DECL is not a member. */
1669 if (!TYPE_P (scope
))
1671 /* Compute the scope through which DECL is being accessed. */
1673 /* OBJECT_TYPE might not be a class type; consider:
1675 class A { typedef int I; };
1679 In this case, we will have "A::I" as the DECL, but "I" as the
1681 && CLASS_TYPE_P (object_type
)
1682 && DERIVED_FROM_P (scope
, object_type
))
1683 /* If we are processing a `->' or `.' expression, use the type of the
1685 qualifying_type
= object_type
;
1686 else if (nested_name_specifier
)
1688 /* If the reference is to a non-static member of the
1689 current class, treat it as if it were referenced through
1691 if (DECL_NONSTATIC_MEMBER_P (decl
)
1692 && current_class_ptr
1693 && DERIVED_FROM_P (scope
, current_class_type
))
1694 qualifying_type
= current_class_type
;
1695 /* Otherwise, use the type indicated by the
1696 nested-name-specifier. */
1698 qualifying_type
= nested_name_specifier
;
1701 /* Otherwise, the name must be from the current class or one of
1703 qualifying_type
= currently_open_derived_class (scope
);
1706 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1707 or similar in a default argument value. */
1708 && CLASS_TYPE_P (qualifying_type
)
1709 && !dependent_type_p (qualifying_type
))
1710 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1714 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1715 class named to the left of the "::" operator. DONE is true if this
1716 expression is a complete postfix-expression; it is false if this
1717 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1718 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1719 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1720 is true iff this qualified name appears as a template argument. */
1723 finish_qualified_id_expr (tree qualifying_class
,
1728 bool template_arg_p
)
1730 gcc_assert (TYPE_P (qualifying_class
));
1732 if (error_operand_p (expr
))
1733 return error_mark_node
;
1735 if (DECL_P (expr
) || BASELINK_P (expr
))
1739 check_template_keyword (expr
);
1741 /* If EXPR occurs as the operand of '&', use special handling that
1742 permits a pointer-to-member. */
1743 if (address_p
&& done
)
1745 if (TREE_CODE (expr
) == SCOPE_REF
)
1746 expr
= TREE_OPERAND (expr
, 1);
1747 expr
= build_offset_ref (qualifying_class
, expr
,
1748 /*address_p=*/true);
1752 /* Within the scope of a class, turn references to non-static
1753 members into expression of the form "this->...". */
1755 /* But, within a template argument, we do not want make the
1756 transformation, as there is no "this" pointer. */
1758 else if (TREE_CODE (expr
) == FIELD_DECL
)
1760 push_deferring_access_checks (dk_no_check
);
1761 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1763 pop_deferring_access_checks ();
1765 else if (BASELINK_P (expr
) && !processing_template_decl
)
1769 /* See if any of the functions are non-static members. */
1770 /* If so, the expression may be relative to 'this'. */
1771 if (!shared_member_p (expr
)
1772 && (ob
= maybe_dummy_object (qualifying_class
, NULL
),
1773 !is_dummy_object (ob
)))
1774 expr
= (build_class_member_access_expr
1777 BASELINK_ACCESS_BINFO (expr
),
1778 /*preserve_reference=*/false,
1779 tf_warning_or_error
));
1781 /* The expression is a qualified name whose address is not
1783 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1789 /* Begin a statement-expression. The value returned must be passed to
1790 finish_stmt_expr. */
1793 begin_stmt_expr (void)
1795 return push_stmt_list ();
1798 /* Process the final expression of a statement expression. EXPR can be
1799 NULL, if the final expression is empty. Return a STATEMENT_LIST
1800 containing all the statements in the statement-expression, or
1801 ERROR_MARK_NODE if there was an error. */
1804 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1806 if (error_operand_p (expr
))
1808 /* The type of the statement-expression is the type of the last
1810 TREE_TYPE (stmt_expr
) = error_mark_node
;
1811 return error_mark_node
;
1814 /* If the last statement does not have "void" type, then the value
1815 of the last statement is the value of the entire expression. */
1818 tree type
= TREE_TYPE (expr
);
1820 if (processing_template_decl
)
1822 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1823 expr
= add_stmt (expr
);
1824 /* Mark the last statement so that we can recognize it as such at
1825 template-instantiation time. */
1826 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1828 else if (VOID_TYPE_P (type
))
1830 /* Just treat this like an ordinary statement. */
1831 expr
= finish_expr_stmt (expr
);
1835 /* It actually has a value we need to deal with. First, force it
1836 to be an rvalue so that we won't need to build up a copy
1837 constructor call later when we try to assign it to something. */
1838 expr
= force_rvalue (expr
);
1839 if (error_operand_p (expr
))
1840 return error_mark_node
;
1842 /* Update for array-to-pointer decay. */
1843 type
= TREE_TYPE (expr
);
1845 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1846 normal statement, but don't convert to void or actually add
1848 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1849 expr
= maybe_cleanup_point_expr (expr
);
1853 /* The type of the statement-expression is the type of the last
1855 TREE_TYPE (stmt_expr
) = type
;
1861 /* Finish a statement-expression. EXPR should be the value returned
1862 by the previous begin_stmt_expr. Returns an expression
1863 representing the statement-expression. */
1866 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1871 if (error_operand_p (stmt_expr
))
1873 pop_stmt_list (stmt_expr
);
1874 return error_mark_node
;
1877 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1879 type
= TREE_TYPE (stmt_expr
);
1880 result
= pop_stmt_list (stmt_expr
);
1881 TREE_TYPE (result
) = type
;
1883 if (processing_template_decl
)
1885 result
= build_min (STMT_EXPR
, type
, result
);
1886 TREE_SIDE_EFFECTS (result
) = 1;
1887 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1889 else if (CLASS_TYPE_P (type
))
1891 /* Wrap the statement-expression in a TARGET_EXPR so that the
1892 temporary object created by the final expression is destroyed at
1893 the end of the full-expression containing the
1894 statement-expression. */
1895 result
= force_target_expr (type
, result
);
1901 /* Returns the expression which provides the value of STMT_EXPR. */
1904 stmt_expr_value_expr (tree stmt_expr
)
1906 tree t
= STMT_EXPR_STMT (stmt_expr
);
1908 if (TREE_CODE (t
) == BIND_EXPR
)
1909 t
= BIND_EXPR_BODY (t
);
1911 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1912 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1914 if (TREE_CODE (t
) == EXPR_STMT
)
1915 t
= EXPR_STMT_EXPR (t
);
1920 /* Return TRUE iff EXPR_STMT is an empty list of
1921 expression statements. */
1924 empty_expr_stmt_p (tree expr_stmt
)
1926 tree body
= NULL_TREE
;
1928 if (expr_stmt
== void_zero_node
)
1933 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1934 body
= EXPR_STMT_EXPR (expr_stmt
);
1935 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1941 if (TREE_CODE (body
) == STATEMENT_LIST
)
1942 return tsi_end_p (tsi_start (body
));
1944 return empty_expr_stmt_p (body
);
1949 /* Perform Koenig lookup. FN is the postfix-expression representing
1950 the function (or functions) to call; ARGS are the arguments to the
1951 call; if INCLUDE_STD then the `std' namespace is automatically
1952 considered an associated namespace (used in range-based for loops).
1953 Returns the functions to be considered by overload resolution. */
1956 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
, bool include_std
)
1958 tree identifier
= NULL_TREE
;
1959 tree functions
= NULL_TREE
;
1960 tree tmpl_args
= NULL_TREE
;
1961 bool template_id
= false;
1963 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1965 /* Use a separate flag to handle null args. */
1967 tmpl_args
= TREE_OPERAND (fn
, 1);
1968 fn
= TREE_OPERAND (fn
, 0);
1971 /* Find the name of the overloaded function. */
1972 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1974 else if (is_overloaded_fn (fn
))
1977 identifier
= DECL_NAME (get_first_fn (functions
));
1979 else if (DECL_P (fn
))
1982 identifier
= DECL_NAME (fn
);
1985 /* A call to a namespace-scope function using an unqualified name.
1987 Do Koenig lookup -- unless any of the arguments are
1989 if (!any_type_dependent_arguments_p (args
)
1990 && !any_dependent_template_arguments_p (tmpl_args
))
1992 fn
= lookup_arg_dependent (identifier
, functions
, args
, include_std
);
1994 /* The unqualified name could not be resolved. */
1995 fn
= unqualified_fn_lookup_error (identifier
);
1998 if (fn
&& template_id
)
1999 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2004 /* Generate an expression for `FN (ARGS)'. This may change the
2007 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2008 as a virtual call, even if FN is virtual. (This flag is set when
2009 encountering an expression where the function name is explicitly
2010 qualified. For example a call to `X::f' never generates a virtual
2013 Returns code for the call. */
2016 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
2017 bool koenig_p
, tsubst_flags_t complain
)
2021 VEC(tree
,gc
) *orig_args
= NULL
;
2023 if (fn
== error_mark_node
)
2024 return error_mark_node
;
2026 gcc_assert (!TYPE_P (fn
));
2030 if (processing_template_decl
)
2032 /* If the call expression is dependent, build a CALL_EXPR node
2033 with no type; type_dependent_expression_p recognizes
2034 expressions with no type as being dependent. */
2035 if (type_dependent_expression_p (fn
)
2036 || any_type_dependent_arguments_p (*args
)
2037 /* For a non-static member function, we need to specifically
2038 test the type dependency of the "this" pointer because it
2039 is not included in *ARGS even though it is considered to
2040 be part of the list of arguments. Note that this is
2041 related to CWG issues 515 and 1005. */
2042 || ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
2043 && current_class_ref
2044 && type_dependent_expression_p (current_class_ref
)))
2046 result
= build_nt_call_vec (fn
, *args
);
2047 KOENIG_LOOKUP_P (result
) = koenig_p
;
2052 tree fndecl
= OVL_CURRENT (fn
);
2053 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2054 || !TREE_THIS_VOLATILE (fndecl
))
2060 current_function_returns_abnormally
= 1;
2064 orig_args
= make_tree_vector_copy (*args
);
2065 if (!BASELINK_P (fn
)
2066 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2067 && TREE_TYPE (fn
) != unknown_type_node
)
2068 fn
= build_non_dependent_expr (fn
);
2069 make_args_non_dependent (*args
);
2072 if (TREE_CODE (fn
) == COMPONENT_REF
)
2074 tree member
= TREE_OPERAND (fn
, 1);
2075 if (BASELINK_P (member
))
2077 tree object
= TREE_OPERAND (fn
, 0);
2078 return build_new_method_call (object
, member
,
2081 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2088 if (is_overloaded_fn (fn
))
2089 fn
= baselink_for_fns (fn
);
2092 if (BASELINK_P (fn
))
2096 /* A call to a member function. From [over.call.func]:
2098 If the keyword this is in scope and refers to the class of
2099 that member function, or a derived class thereof, then the
2100 function call is transformed into a qualified function call
2101 using (*this) as the postfix-expression to the left of the
2102 . operator.... [Otherwise] a contrived object of type T
2103 becomes the implied object argument.
2107 struct A { void f(); };
2108 struct B : public A {};
2109 struct C : public A { void g() { B::f(); }};
2111 "the class of that member function" refers to `A'. But 11.2
2112 [class.access.base] says that we need to convert 'this' to B* as
2113 part of the access, so we pass 'B' to maybe_dummy_object. */
2115 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2118 if (processing_template_decl
)
2120 if (type_dependent_expression_p (object
))
2122 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2123 release_tree_vector (orig_args
);
2126 object
= build_non_dependent_expr (object
);
2129 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2131 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2136 else if (is_overloaded_fn (fn
))
2138 /* If the function is an overloaded builtin, resolve it. */
2139 if (TREE_CODE (fn
) == FUNCTION_DECL
2140 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2141 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2142 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2145 /* A call to a namespace-scope function. */
2146 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2148 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2150 if (!VEC_empty (tree
, *args
))
2151 error ("arguments to destructor are not allowed");
2152 /* Mark the pseudo-destructor call as having side-effects so
2153 that we do not issue warnings about its use. */
2154 result
= build1 (NOP_EXPR
,
2156 TREE_OPERAND (fn
, 0));
2157 TREE_SIDE_EFFECTS (result
) = 1;
2159 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2160 /* If the "function" is really an object of class type, it might
2161 have an overloaded `operator ()'. */
2162 result
= build_op_call (fn
, args
, complain
);
2165 /* A call where the function is unknown. */
2166 result
= cp_build_function_call_vec (fn
, args
, complain
);
2168 if (processing_template_decl
&& result
!= error_mark_node
)
2170 if (TREE_CODE (result
) == INDIRECT_REF
)
2171 result
= TREE_OPERAND (result
, 0);
2172 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2173 KOENIG_LOOKUP_P (result
) = koenig_p
;
2174 release_tree_vector (orig_args
);
2175 result
= convert_from_reference (result
);
2180 /* Free garbage OVERLOADs from arg-dependent lookup. */
2181 tree next
= NULL_TREE
;
2183 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2186 if (processing_template_decl
)
2187 /* In a template, we'll re-use them at instantiation time. */
2188 OVL_ARG_DEPENDENT (fn
) = false;
2191 next
= OVL_CHAIN (fn
);
2200 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2201 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2202 POSTDECREMENT_EXPR.) */
2205 finish_increment_expr (tree expr
, enum tree_code code
)
2207 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2210 /* Finish a use of `this'. Returns an expression for `this'. */
2213 finish_this_expr (void)
2217 if (current_class_ptr
)
2219 tree type
= TREE_TYPE (current_class_ref
);
2221 /* In a lambda expression, 'this' refers to the captured 'this'. */
2222 if (LAMBDA_TYPE_P (type
))
2223 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2225 result
= current_class_ptr
;
2228 else if (current_function_decl
2229 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2231 error ("%<this%> is unavailable for static member functions");
2232 result
= error_mark_node
;
2236 if (current_function_decl
)
2237 error ("invalid use of %<this%> in non-member function");
2239 error ("invalid use of %<this%> at top level");
2240 result
= error_mark_node
;
2246 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2247 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2248 the TYPE for the type given. If SCOPE is non-NULL, the expression
2249 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2252 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2254 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2255 return error_mark_node
;
2257 gcc_assert (TYPE_P (destructor
));
2259 if (!processing_template_decl
)
2261 if (scope
== error_mark_node
)
2263 error ("invalid qualifying scope in pseudo-destructor name");
2264 return error_mark_node
;
2266 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2268 error ("qualified type %qT does not match destructor name ~%qT",
2270 return error_mark_node
;
2274 /* [expr.pseudo] says both:
2276 The type designated by the pseudo-destructor-name shall be
2277 the same as the object type.
2281 The cv-unqualified versions of the object type and of the
2282 type designated by the pseudo-destructor-name shall be the
2285 We implement the more generous second sentence, since that is
2286 what most other compilers do. */
2287 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2290 error ("%qE is not of type %qT", object
, destructor
);
2291 return error_mark_node
;
2295 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2298 /* Finish an expression of the form CODE EXPR. */
2301 finish_unary_op_expr (enum tree_code code
, tree expr
)
2303 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2304 /* Inside a template, build_x_unary_op does not fold the
2305 expression. So check whether the result is folded before
2306 setting TREE_NEGATED_INT. */
2307 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2308 && TREE_CODE (result
) == INTEGER_CST
2309 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2310 && INT_CST_LT (result
, integer_zero_node
))
2312 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2313 setting TREE_NEGATED_INT. */
2314 result
= copy_node (result
);
2315 TREE_NEGATED_INT (result
) = 1;
2317 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2318 overflow_warning (input_location
, result
);
2323 /* Finish a compound-literal expression. TYPE is the type to which
2324 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2327 finish_compound_literal (tree type
, tree compound_literal
,
2328 tsubst_flags_t complain
)
2330 if (type
== error_mark_node
)
2331 return error_mark_node
;
2333 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2336 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2338 return cp_build_c_cast (type
, compound_literal
, complain
);
2341 if (!TYPE_OBJ_P (type
))
2343 if (complain
& tf_error
)
2344 error ("compound literal of non-object type %qT", type
);
2345 return error_mark_node
;
2348 if (processing_template_decl
)
2350 TREE_TYPE (compound_literal
) = type
;
2351 /* Mark the expression as a compound literal. */
2352 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2353 return compound_literal
;
2356 type
= complete_type (type
);
2358 if (TYPE_NON_AGGREGATE_CLASS (type
))
2360 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2361 everywhere that deals with function arguments would be a pain, so
2362 just wrap it in a TREE_LIST. The parser set a flag so we know
2363 that it came from T{} rather than T({}). */
2364 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2365 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2366 return build_functional_cast (type
, compound_literal
, complain
);
2369 if (TREE_CODE (type
) == ARRAY_TYPE
2370 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2371 return error_mark_node
;
2372 compound_literal
= reshape_init (type
, compound_literal
);
2373 if (TREE_CODE (type
) == ARRAY_TYPE
2374 && TYPE_DOMAIN (type
) == NULL_TREE
)
2376 cp_complete_array_type_or_error (&type
, compound_literal
,
2378 if (type
== error_mark_node
)
2379 return error_mark_node
;
2381 compound_literal
= digest_init (type
, compound_literal
);
2382 /* Put static/constant array temporaries in static variables, but always
2383 represent class temporaries with TARGET_EXPR so we elide copies. */
2384 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2385 && TREE_CODE (type
) == ARRAY_TYPE
2386 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2387 && initializer_constant_valid_p (compound_literal
, type
))
2389 tree decl
= create_temporary_var (type
);
2390 DECL_INITIAL (decl
) = compound_literal
;
2391 TREE_STATIC (decl
) = 1;
2392 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2394 /* 5.19 says that a constant expression can include an
2395 lvalue-rvalue conversion applied to "a glvalue of literal type
2396 that refers to a non-volatile temporary object initialized
2397 with a constant expression". Rather than try to communicate
2398 that this VAR_DECL is a temporary, just mark it constexpr. */
2399 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2400 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2401 TREE_CONSTANT (decl
) = true;
2403 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2404 decl
= pushdecl_top_level (decl
);
2405 DECL_NAME (decl
) = make_anon_name ();
2406 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2410 return get_target_expr (compound_literal
);
2413 /* Return the declaration for the function-name variable indicated by
2417 finish_fname (tree id
)
2421 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2422 if (processing_template_decl
&& current_function_decl
)
2423 decl
= DECL_NAME (decl
);
2427 /* Finish a translation unit. */
2430 finish_translation_unit (void)
2432 /* In case there were missing closebraces,
2433 get us back to the global binding level. */
2435 while (current_namespace
!= global_namespace
)
2438 /* Do file scope __FUNCTION__ et al. */
2439 finish_fname_decls ();
2442 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2443 Returns the parameter. */
2446 finish_template_type_parm (tree aggr
, tree identifier
)
2448 if (aggr
!= class_type_node
)
2450 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2451 aggr
= class_type_node
;
2454 return build_tree_list (aggr
, identifier
);
2457 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2458 Returns the parameter. */
2461 finish_template_template_parm (tree aggr
, tree identifier
)
2463 tree decl
= build_decl (input_location
,
2464 TYPE_DECL
, identifier
, NULL_TREE
);
2465 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2466 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2467 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2468 DECL_ARTIFICIAL (decl
) = 1;
2469 end_template_decl ();
2471 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2473 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2474 /*is_primary=*/true, /*is_partial=*/false,
2477 return finish_template_type_parm (aggr
, tmpl
);
2480 /* ARGUMENT is the default-argument value for a template template
2481 parameter. If ARGUMENT is invalid, issue error messages and return
2482 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2485 check_template_template_default_arg (tree argument
)
2487 if (TREE_CODE (argument
) != TEMPLATE_DECL
2488 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2489 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2491 if (TREE_CODE (argument
) == TYPE_DECL
)
2492 error ("invalid use of type %qT as a default value for a template "
2493 "template-parameter", TREE_TYPE (argument
));
2495 error ("invalid default argument for a template template parameter");
2496 return error_mark_node
;
2502 /* Begin a class definition, as indicated by T. */
2505 begin_class_definition (tree t
, tree attributes
)
2507 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2508 return error_mark_node
;
2510 if (processing_template_parmlist
)
2512 error ("definition of %q#T inside template parameter list", t
);
2513 return error_mark_node
;
2516 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2517 are passed the same as decimal scalar types. */
2518 if (TREE_CODE (t
) == RECORD_TYPE
2519 && !processing_template_decl
)
2521 tree ns
= TYPE_CONTEXT (t
);
2522 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2523 && DECL_CONTEXT (ns
) == std_node
2525 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2527 const char *n
= TYPE_NAME_STRING (t
);
2528 if ((strcmp (n
, "decimal32") == 0)
2529 || (strcmp (n
, "decimal64") == 0)
2530 || (strcmp (n
, "decimal128") == 0))
2531 TYPE_TRANSPARENT_AGGR (t
) = 1;
2535 /* A non-implicit typename comes from code like:
2537 template <typename T> struct A {
2538 template <typename U> struct A<T>::B ...
2540 This is erroneous. */
2541 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2543 error ("invalid definition of qualified type %qT", t
);
2544 t
= error_mark_node
;
2547 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2549 t
= make_class_type (RECORD_TYPE
);
2550 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2553 if (TYPE_BEING_DEFINED (t
))
2555 t
= make_class_type (TREE_CODE (t
));
2556 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2558 maybe_process_partial_specialization (t
);
2560 TYPE_BEING_DEFINED (t
) = 1;
2562 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2563 fixup_attribute_variants (t
);
2565 if (flag_pack_struct
)
2568 TYPE_PACKED (t
) = 1;
2569 /* Even though the type is being defined for the first time
2570 here, there might have been a forward declaration, so there
2571 might be cv-qualified variants of T. */
2572 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2573 TYPE_PACKED (v
) = 1;
2575 /* Reset the interface data, at the earliest possible
2576 moment, as it might have been set via a class foo;
2578 if (! TYPE_ANONYMOUS_P (t
))
2580 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2581 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2582 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2583 (t
, finfo
->interface_unknown
);
2585 reset_specialization();
2587 /* Make a declaration for this class in its own scope. */
2588 build_self_reference ();
2593 /* Finish the member declaration given by DECL. */
2596 finish_member_declaration (tree decl
)
2598 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2601 if (decl
== void_type_node
)
2602 /* The COMPONENT was a friend, not a member, and so there's
2603 nothing for us to do. */
2606 /* We should see only one DECL at a time. */
2607 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2609 /* Set up access control for DECL. */
2611 = (current_access_specifier
== access_private_node
);
2612 TREE_PROTECTED (decl
)
2613 = (current_access_specifier
== access_protected_node
);
2614 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2616 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2617 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2620 /* Mark the DECL as a member of the current class. */
2621 DECL_CONTEXT (decl
) = current_class_type
;
2623 /* Check for bare parameter packs in the member variable declaration. */
2624 if (TREE_CODE (decl
) == FIELD_DECL
)
2626 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2627 TREE_TYPE (decl
) = error_mark_node
;
2628 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2629 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2634 A C language linkage is ignored for the names of class members
2635 and the member function type of class member functions. */
2636 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2637 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2639 /* Put functions on the TYPE_METHODS list and everything else on the
2640 TYPE_FIELDS list. Note that these are built up in reverse order.
2641 We reverse them (to obtain declaration order) in finish_struct. */
2642 if (TREE_CODE (decl
) == FUNCTION_DECL
2643 || DECL_FUNCTION_TEMPLATE_P (decl
))
2645 /* We also need to add this function to the
2646 CLASSTYPE_METHOD_VEC. */
2647 if (add_method (current_class_type
, decl
, NULL_TREE
))
2649 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2650 TYPE_METHODS (current_class_type
) = decl
;
2652 maybe_add_class_template_decl_list (current_class_type
, decl
,
2656 /* Enter the DECL into the scope of the class. */
2657 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2658 || pushdecl_class_level (decl
))
2660 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2661 go at the beginning. The reason is that lookup_field_1
2662 searches the list in order, and we want a field name to
2663 override a type name so that the "struct stat hack" will
2664 work. In particular:
2666 struct S { enum E { }; int E } s;
2669 is valid. In addition, the FIELD_DECLs must be maintained in
2670 declaration order so that class layout works as expected.
2671 However, we don't need that order until class layout, so we
2672 save a little time by putting FIELD_DECLs on in reverse order
2673 here, and then reversing them in finish_struct_1. (We could
2674 also keep a pointer to the correct insertion points in the
2677 if (TREE_CODE (decl
) == TYPE_DECL
)
2678 TYPE_FIELDS (current_class_type
)
2679 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2682 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2683 TYPE_FIELDS (current_class_type
) = decl
;
2686 maybe_add_class_template_decl_list (current_class_type
, decl
,
2691 note_decl_for_pch (decl
);
2694 /* DECL has been declared while we are building a PCH file. Perform
2695 actions that we might normally undertake lazily, but which can be
2696 performed now so that they do not have to be performed in
2697 translation units which include the PCH file. */
2700 note_decl_for_pch (tree decl
)
2702 gcc_assert (pch_file
);
2704 /* There's a good chance that we'll have to mangle names at some
2705 point, even if only for emission in debugging information. */
2706 if ((TREE_CODE (decl
) == VAR_DECL
2707 || TREE_CODE (decl
) == FUNCTION_DECL
)
2708 && !processing_template_decl
)
2712 /* Finish processing a complete template declaration. The PARMS are
2713 the template parameters. */
2716 finish_template_decl (tree parms
)
2719 end_template_decl ();
2721 end_specialization ();
2724 /* Finish processing a template-id (which names a type) of the form
2725 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2726 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2727 the scope of template-id indicated. */
2730 finish_template_type (tree name
, tree args
, int entering_scope
)
2734 decl
= lookup_template_class (name
, args
,
2735 NULL_TREE
, NULL_TREE
, entering_scope
,
2736 tf_warning_or_error
| tf_user
);
2737 if (decl
!= error_mark_node
)
2738 decl
= TYPE_STUB_DECL (decl
);
2743 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2744 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2745 BASE_CLASS, or NULL_TREE if an error occurred. The
2746 ACCESS_SPECIFIER is one of
2747 access_{default,public,protected_private}_node. For a virtual base
2748 we set TREE_TYPE. */
2751 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2755 if (base
== error_mark_node
)
2757 error ("invalid base-class specification");
2760 else if (! MAYBE_CLASS_TYPE_P (base
))
2762 error ("%qT is not a class type", base
);
2767 if (cp_type_quals (base
) != 0)
2769 error ("base class %qT has cv qualifiers", base
);
2770 base
= TYPE_MAIN_VARIANT (base
);
2772 result
= build_tree_list (access
, base
);
2774 TREE_TYPE (result
) = integer_type_node
;
2780 /* If FNS is a member function, a set of member functions, or a
2781 template-id referring to one or more member functions, return a
2782 BASELINK for FNS, incorporating the current access context.
2783 Otherwise, return FNS unchanged. */
2786 baselink_for_fns (tree fns
)
2791 if (BASELINK_P (fns
)
2792 || error_operand_p (fns
))
2796 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2797 fn
= TREE_OPERAND (fn
, 0);
2798 fn
= get_first_fn (fn
);
2799 if (!DECL_FUNCTION_MEMBER_P (fn
))
2802 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2804 cl
= DECL_CONTEXT (fn
);
2805 cl
= TYPE_BINFO (cl
);
2806 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2809 /* Returns true iff DECL is an automatic variable from a function outside
2813 outer_automatic_var_p (tree decl
)
2815 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2816 && DECL_FUNCTION_SCOPE_P (decl
)
2817 && !TREE_STATIC (decl
)
2818 && DECL_CONTEXT (decl
) != current_function_decl
);
2821 /* Returns true iff DECL is a capture field from a lambda that is not our
2822 immediate context. */
2825 outer_lambda_capture_p (tree decl
)
2827 return (TREE_CODE (decl
) == FIELD_DECL
2828 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2829 && (!current_class_type
2830 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2833 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2834 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2835 if non-NULL, is the type or namespace used to explicitly qualify
2836 ID_EXPRESSION. DECL is the entity to which that name has been
2839 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2840 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2841 be set to true if this expression isn't permitted in a
2842 constant-expression, but it is otherwise not set by this function.
2843 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2844 constant-expression, but a non-constant expression is also
2847 DONE is true if this expression is a complete postfix-expression;
2848 it is false if this expression is followed by '->', '[', '(', etc.
2849 ADDRESS_P is true iff this expression is the operand of '&'.
2850 TEMPLATE_P is true iff the qualified-id was of the form
2851 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2852 appears as a template argument.
2854 If an error occurs, and it is the kind of error that might cause
2855 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2856 is the caller's responsibility to issue the message. *ERROR_MSG
2857 will be a string with static storage duration, so the caller need
2860 Return an expression for the entity, after issuing appropriate
2861 diagnostics. This function is also responsible for transforming a
2862 reference to a non-static member into a COMPONENT_REF that makes
2863 the use of "this" explicit.
2865 Upon return, *IDK will be filled in appropriately. */
2867 finish_id_expression (tree id_expression
,
2871 bool integral_constant_expression_p
,
2872 bool allow_non_integral_constant_expression_p
,
2873 bool *non_integral_constant_expression_p
,
2877 bool template_arg_p
,
2878 const char **error_msg
,
2879 location_t location
)
2881 /* Initialize the output parameters. */
2882 *idk
= CP_ID_KIND_NONE
;
2885 if (id_expression
== error_mark_node
)
2886 return error_mark_node
;
2887 /* If we have a template-id, then no further lookup is
2888 required. If the template-id was for a template-class, we
2889 will sometimes have a TYPE_DECL at this point. */
2890 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2891 || TREE_CODE (decl
) == TYPE_DECL
)
2893 /* Look up the name. */
2896 if (decl
== error_mark_node
)
2898 /* Name lookup failed. */
2901 || (!dependent_type_p (scope
)
2902 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2903 && IDENTIFIER_TYPENAME_P (id_expression
)
2904 && dependent_type_p (TREE_TYPE (id_expression
))))))
2906 /* If the qualifying type is non-dependent (and the name
2907 does not name a conversion operator to a dependent
2908 type), issue an error. */
2909 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2910 return error_mark_node
;
2914 /* It may be resolved via Koenig lookup. */
2915 *idk
= CP_ID_KIND_UNQUALIFIED
;
2916 return id_expression
;
2919 decl
= id_expression
;
2921 /* If DECL is a variable that would be out of scope under
2922 ANSI/ISO rules, but in scope in the ARM, name lookup
2923 will succeed. Issue a diagnostic here. */
2925 decl
= check_for_out_of_scope_variable (decl
);
2927 /* Remember that the name was used in the definition of
2928 the current class so that we can check later to see if
2929 the meaning would have been different after the class
2930 was entirely defined. */
2931 if (!scope
&& decl
!= error_mark_node
2932 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
2933 maybe_note_name_used_in_class (id_expression
, decl
);
2935 /* Disallow uses of local variables from containing functions, except
2936 within lambda-expressions. */
2937 if ((outer_automatic_var_p (decl
)
2938 || outer_lambda_capture_p (decl
))
2939 /* It's not a use (3.2) if we're in an unevaluated context. */
2940 && !cp_unevaluated_operand
)
2942 tree context
= DECL_CONTEXT (decl
);
2943 tree containing_function
= current_function_decl
;
2944 tree lambda_stack
= NULL_TREE
;
2945 tree lambda_expr
= NULL_TREE
;
2946 tree initializer
= decl
;
2948 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2949 support for an approach in which a reference to a local
2950 [constant] automatic variable in a nested class or lambda body
2951 would enter the expression as an rvalue, which would reduce
2952 the complexity of the problem"
2954 FIXME update for final resolution of core issue 696. */
2955 if (decl_constant_var_p (decl
))
2956 return integral_constant_value (decl
);
2958 if (TYPE_P (context
))
2960 /* Implicit capture of an explicit capture. */
2961 context
= lambda_function (context
);
2962 initializer
= thisify_lambda_field (decl
);
2965 /* If we are in a lambda function, we can move out until we hit
2967 2. a non-lambda function, or
2968 3. a non-default capturing lambda function. */
2969 while (context
!= containing_function
2970 && LAMBDA_FUNCTION_P (containing_function
))
2972 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2973 (DECL_CONTEXT (containing_function
));
2975 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2979 lambda_stack
= tree_cons (NULL_TREE
,
2984 = decl_function_context (containing_function
);
2987 if (context
== containing_function
)
2989 decl
= add_default_capture (lambda_stack
,
2990 /*id=*/DECL_NAME (decl
),
2993 else if (lambda_expr
)
2995 error ("%qD is not captured", decl
);
2996 return error_mark_node
;
3000 error (TREE_CODE (decl
) == VAR_DECL
3001 ? "use of %<auto%> variable from containing function"
3002 : "use of parameter from containing function");
3003 error (" %q+#D declared here", decl
);
3004 return error_mark_node
;
3008 /* Also disallow uses of function parameters outside the function
3009 body, except inside an unevaluated context (i.e. decltype). */
3010 if (TREE_CODE (decl
) == PARM_DECL
3011 && DECL_CONTEXT (decl
) == NULL_TREE
3012 && !cp_unevaluated_operand
)
3014 error ("use of parameter %qD outside function body", decl
);
3015 return error_mark_node
;
3019 /* If we didn't find anything, or what we found was a type,
3020 then this wasn't really an id-expression. */
3021 if (TREE_CODE (decl
) == TEMPLATE_DECL
3022 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3024 *error_msg
= "missing template arguments";
3025 return error_mark_node
;
3027 else if (TREE_CODE (decl
) == TYPE_DECL
3028 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3030 *error_msg
= "expected primary-expression";
3031 return error_mark_node
;
3034 /* If the name resolved to a template parameter, there is no
3035 need to look it up again later. */
3036 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3037 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3041 *idk
= CP_ID_KIND_NONE
;
3042 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3043 decl
= TEMPLATE_PARM_DECL (decl
);
3044 r
= convert_from_reference (DECL_INITIAL (decl
));
3046 if (integral_constant_expression_p
3047 && !dependent_type_p (TREE_TYPE (decl
))
3048 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3050 if (!allow_non_integral_constant_expression_p
)
3051 error ("template parameter %qD of type %qT is not allowed in "
3052 "an integral constant expression because it is not of "
3053 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3054 *non_integral_constant_expression_p
= true;
3058 /* Similarly, we resolve enumeration constants to their
3059 underlying values. */
3060 else if (TREE_CODE (decl
) == CONST_DECL
)
3062 *idk
= CP_ID_KIND_NONE
;
3063 if (!processing_template_decl
)
3065 used_types_insert (TREE_TYPE (decl
));
3066 return DECL_INITIAL (decl
);
3074 /* If the declaration was explicitly qualified indicate
3075 that. The semantics of `A::f(3)' are different than
3076 `f(3)' if `f' is virtual. */
3078 ? CP_ID_KIND_QUALIFIED
3079 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3080 ? CP_ID_KIND_TEMPLATE_ID
3081 : CP_ID_KIND_UNQUALIFIED
));
3086 An id-expression is type-dependent if it contains an
3087 identifier that was declared with a dependent type.
3089 The standard is not very specific about an id-expression that
3090 names a set of overloaded functions. What if some of them
3091 have dependent types and some of them do not? Presumably,
3092 such a name should be treated as a dependent name. */
3093 /* Assume the name is not dependent. */
3094 dependent_p
= false;
3095 if (!processing_template_decl
)
3096 /* No names are dependent outside a template. */
3098 /* A template-id where the name of the template was not resolved
3099 is definitely dependent. */
3100 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3101 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3102 == IDENTIFIER_NODE
))
3104 /* For anything except an overloaded function, just check its
3106 else if (!is_overloaded_fn (decl
))
3108 = dependent_type_p (TREE_TYPE (decl
));
3109 /* For a set of overloaded functions, check each of the
3115 if (BASELINK_P (fns
))
3116 fns
= BASELINK_FUNCTIONS (fns
);
3118 /* For a template-id, check to see if the template
3119 arguments are dependent. */
3120 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3122 tree args
= TREE_OPERAND (fns
, 1);
3123 dependent_p
= any_dependent_template_arguments_p (args
);
3124 /* The functions are those referred to by the
3126 fns
= TREE_OPERAND (fns
, 0);
3129 /* If there are no dependent template arguments, go through
3130 the overloaded functions. */
3131 while (fns
&& !dependent_p
)
3133 tree fn
= OVL_CURRENT (fns
);
3135 /* Member functions of dependent classes are
3137 if (TREE_CODE (fn
) == FUNCTION_DECL
3138 && type_dependent_expression_p (fn
))
3140 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3141 && dependent_template_p (fn
))
3144 fns
= OVL_NEXT (fns
);
3148 /* If the name was dependent on a template parameter, we will
3149 resolve the name at instantiation time. */
3152 /* Create a SCOPE_REF for qualified names, if the scope is
3158 if (address_p
&& done
)
3159 decl
= finish_qualified_id_expr (scope
, decl
,
3165 tree type
= NULL_TREE
;
3166 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3167 type
= TREE_TYPE (decl
);
3168 decl
= build_qualified_name (type
,
3174 if (TREE_TYPE (decl
))
3175 decl
= convert_from_reference (decl
);
3178 /* A TEMPLATE_ID already contains all the information we
3180 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3181 return id_expression
;
3182 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3183 /* If we found a variable, then name lookup during the
3184 instantiation will always resolve to the same VAR_DECL
3185 (or an instantiation thereof). */
3186 if (TREE_CODE (decl
) == VAR_DECL
3187 || TREE_CODE (decl
) == PARM_DECL
)
3188 return convert_from_reference (decl
);
3189 /* The same is true for FIELD_DECL, but we also need to
3190 make sure that the syntax is correct. */
3191 else if (TREE_CODE (decl
) == FIELD_DECL
)
3193 /* Since SCOPE is NULL here, this is an unqualified name.
3194 Access checking has been performed during name lookup
3195 already. Turn off checking to avoid duplicate errors. */
3196 push_deferring_access_checks (dk_no_check
);
3197 decl
= finish_non_static_data_member
3199 /*qualifying_scope=*/NULL_TREE
);
3200 pop_deferring_access_checks ();
3203 return id_expression
;
3206 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3208 error ("use of namespace %qD as expression", decl
);
3209 return error_mark_node
;
3211 else if (DECL_CLASS_TEMPLATE_P (decl
))
3213 error ("use of class template %qT as expression", decl
);
3214 return error_mark_node
;
3216 else if (TREE_CODE (decl
) == TREE_LIST
)
3218 /* Ambiguous reference to base members. */
3219 error ("request for member %qD is ambiguous in "
3220 "multiple inheritance lattice", id_expression
);
3221 print_candidates (decl
);
3222 return error_mark_node
;
3225 /* Mark variable-like entities as used. Functions are similarly
3226 marked either below or after overload resolution. */
3227 if (TREE_CODE (decl
) == VAR_DECL
3228 || TREE_CODE (decl
) == PARM_DECL
3229 || TREE_CODE (decl
) == RESULT_DECL
)
3232 /* Only certain kinds of names are allowed in constant
3233 expression. Enumerators and template parameters have already
3234 been handled above. */
3235 if (! error_operand_p (decl
)
3236 && integral_constant_expression_p
3237 && ! decl_constant_var_p (decl
)
3238 && ! builtin_valid_in_constant_expr_p (decl
))
3240 if (!allow_non_integral_constant_expression_p
)
3242 error ("%qD cannot appear in a constant-expression", decl
);
3243 return error_mark_node
;
3245 *non_integral_constant_expression_p
= true;
3250 decl
= (adjust_result_of_qualified_name_lookup
3251 (decl
, scope
, current_class_type
));
3253 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3256 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3257 decl
= finish_qualified_id_expr (scope
,
3265 tree r
= convert_from_reference (decl
);
3267 /* In a template, return a SCOPE_REF for most qualified-ids
3268 so that we can check access at instantiation time. But if
3269 we're looking at a member of the current instantiation, we
3270 know we have access and building up the SCOPE_REF confuses
3271 non-type template argument handling. */
3272 if (processing_template_decl
&& TYPE_P (scope
)
3273 && !currently_open_class (scope
))
3274 r
= build_qualified_name (TREE_TYPE (r
),
3280 else if (TREE_CODE (decl
) == FIELD_DECL
)
3282 /* Since SCOPE is NULL here, this is an unqualified name.
3283 Access checking has been performed during name lookup
3284 already. Turn off checking to avoid duplicate errors. */
3285 push_deferring_access_checks (dk_no_check
);
3286 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3287 /*qualifying_scope=*/NULL_TREE
);
3288 pop_deferring_access_checks ();
3290 else if (is_overloaded_fn (decl
))
3294 first_fn
= get_first_fn (decl
);
3295 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3296 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3298 if (!really_overloaded_fn (decl
))
3299 mark_used (first_fn
);
3302 && TREE_CODE (first_fn
) == FUNCTION_DECL
3303 && DECL_FUNCTION_MEMBER_P (first_fn
)
3304 && !shared_member_p (decl
))
3306 /* A set of member functions. */
3307 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3308 return finish_class_member_access_expr (decl
, id_expression
,
3309 /*template_p=*/false,
3310 tf_warning_or_error
);
3313 decl
= baselink_for_fns (decl
);
3317 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3318 && DECL_CLASS_SCOPE_P (decl
))
3320 tree context
= context_for_name_lookup (decl
);
3321 if (context
!= current_class_type
)
3323 tree path
= currently_open_derived_class (context
);
3324 perform_or_defer_access_check (TYPE_BINFO (path
),
3329 decl
= convert_from_reference (decl
);
3333 if (TREE_DEPRECATED (decl
))
3334 warn_deprecated_use (decl
, NULL_TREE
);
3339 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3340 use as a type-specifier. */
3343 finish_typeof (tree expr
)
3347 if (type_dependent_expression_p (expr
))
3349 type
= cxx_make_type (TYPEOF_TYPE
);
3350 TYPEOF_TYPE_EXPR (type
) = expr
;
3351 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3356 expr
= mark_type_use (expr
);
3358 type
= unlowered_expr_type (expr
);
3360 if (!type
|| type
== unknown_type_node
)
3362 error ("type of %qE is unknown", expr
);
3363 return error_mark_node
;
3369 /* Perform C++-specific checks for __builtin_offsetof before calling
3373 finish_offsetof (tree expr
)
3375 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3377 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3378 TREE_OPERAND (expr
, 2));
3379 return error_mark_node
;
3381 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3382 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3383 || TREE_TYPE (expr
) == unknown_type_node
)
3385 if (TREE_CODE (expr
) == COMPONENT_REF
3386 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3387 expr
= TREE_OPERAND (expr
, 1);
3388 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3389 return error_mark_node
;
3391 if (TREE_CODE (expr
) == INDIRECT_REF
&& REFERENCE_REF_P (expr
))
3392 expr
= TREE_OPERAND (expr
, 0);
3393 return fold_offsetof (expr
, NULL_TREE
);
3396 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3397 function is broken out from the above for the benefit of the tree-ssa
3401 simplify_aggr_init_expr (tree
*tp
)
3403 tree aggr_init_expr
= *tp
;
3405 /* Form an appropriate CALL_EXPR. */
3406 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3407 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3408 tree type
= TREE_TYPE (slot
);
3411 enum style_t
{ ctor
, arg
, pcc
} style
;
3413 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3415 #ifdef PCC_STATIC_STRUCT_RETURN
3421 gcc_assert (TREE_ADDRESSABLE (type
));
3425 call_expr
= build_call_array_loc (input_location
,
3426 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3428 aggr_init_expr_nargs (aggr_init_expr
),
3429 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3430 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3434 /* Replace the first argument to the ctor with the address of the
3436 cxx_mark_addressable (slot
);
3437 CALL_EXPR_ARG (call_expr
, 0) =
3438 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3440 else if (style
== arg
)
3442 /* Just mark it addressable here, and leave the rest to
3443 expand_call{,_inline}. */
3444 cxx_mark_addressable (slot
);
3445 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3446 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3448 else if (style
== pcc
)
3450 /* If we're using the non-reentrant PCC calling convention, then we
3451 need to copy the returned value out of the static buffer into the
3453 push_deferring_access_checks (dk_no_check
);
3454 call_expr
= build_aggr_init (slot
, call_expr
,
3455 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3456 tf_warning_or_error
);
3457 pop_deferring_access_checks ();
3458 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3461 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3463 tree init
= build_zero_init (type
, NULL_TREE
,
3464 /*static_storage_p=*/false);
3465 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3466 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3473 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3476 emit_associated_thunks (tree fn
)
3478 /* When we use vcall offsets, we emit thunks with the virtual
3479 functions to which they thunk. The whole point of vcall offsets
3480 is so that you can know statically the entire set of thunks that
3481 will ever be needed for a given virtual function, thereby
3482 enabling you to output all the thunks with the function itself. */
3483 if (DECL_VIRTUAL_P (fn
)
3484 /* Do not emit thunks for extern template instantiations. */
3485 && ! DECL_REALLY_EXTERN (fn
))
3489 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3491 if (!THUNK_ALIAS (thunk
))
3493 use_thunk (thunk
, /*emit_p=*/1);
3494 if (DECL_RESULT_THUNK_P (thunk
))
3498 for (probe
= DECL_THUNKS (thunk
);
3499 probe
; probe
= DECL_CHAIN (probe
))
3500 use_thunk (probe
, /*emit_p=*/1);
3504 gcc_assert (!DECL_THUNKS (thunk
));
3509 /* Generate RTL for FN. */
3512 expand_or_defer_fn_1 (tree fn
)
3514 /* When the parser calls us after finishing the body of a template
3515 function, we don't really want to expand the body. */
3516 if (processing_template_decl
)
3518 /* Normally, collection only occurs in rest_of_compilation. So,
3519 if we don't collect here, we never collect junk generated
3520 during the processing of templates until we hit a
3521 non-template function. It's not safe to do this inside a
3522 nested class, though, as the parser may have local state that
3523 is not a GC root. */
3524 if (!function_depth
)
3529 gcc_assert (DECL_SAVED_TREE (fn
));
3531 /* If this is a constructor or destructor body, we have to clone
3533 if (maybe_clone_body (fn
))
3535 /* We don't want to process FN again, so pretend we've written
3536 it out, even though we haven't. */
3537 TREE_ASM_WRITTEN (fn
) = 1;
3538 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3542 /* We make a decision about linkage for these functions at the end
3543 of the compilation. Until that point, we do not want the back
3544 end to output them -- but we do want it to see the bodies of
3545 these functions so that it can inline them as appropriate. */
3546 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3548 if (DECL_INTERFACE_KNOWN (fn
))
3549 /* We've already made a decision as to how this function will
3553 DECL_EXTERNAL (fn
) = 1;
3554 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3555 note_vague_linkage_fn (fn
);
3556 /* A non-template inline function with external linkage will
3557 always be COMDAT. As we must eventually determine the
3558 linkage of all functions, and as that causes writes to
3559 the data mapped in from the PCH file, it's advantageous
3560 to mark the functions at this point. */
3561 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3563 /* This function must have external linkage, as
3564 otherwise DECL_INTERFACE_KNOWN would have been
3566 gcc_assert (TREE_PUBLIC (fn
));
3567 comdat_linkage (fn
);
3568 DECL_INTERFACE_KNOWN (fn
) = 1;
3572 import_export_decl (fn
);
3574 /* If the user wants us to keep all inline functions, then mark
3575 this function as needed so that finish_file will make sure to
3576 output it later. Similarly, all dllexport'd functions must
3577 be emitted; there may be callers in other DLLs. */
3578 if ((flag_keep_inline_functions
3579 && DECL_DECLARED_INLINE_P (fn
)
3580 && !DECL_REALLY_EXTERN (fn
))
3581 || (flag_keep_inline_dllexport
3582 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3586 /* There's no reason to do any of the work here if we're only doing
3587 semantic analysis; this code just generates RTL. */
3588 if (flag_syntax_only
)
3595 expand_or_defer_fn (tree fn
)
3597 if (expand_or_defer_fn_1 (fn
))
3601 /* Expand or defer, at the whim of the compilation unit manager. */
3602 cgraph_finalize_function (fn
, function_depth
> 1);
3603 emit_associated_thunks (fn
);
3616 /* Helper function for walk_tree, used by finalize_nrv below. */
3619 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3621 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3624 /* No need to walk into types. There wouldn't be any need to walk into
3625 non-statements, except that we have to consider STMT_EXPRs. */
3628 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3629 but differs from using NULL_TREE in that it indicates that we care
3630 about the value of the RESULT_DECL. */
3631 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3632 TREE_OPERAND (*tp
, 0) = dp
->result
;
3633 /* Change all cleanups for the NRV to only run when an exception is
3635 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3636 && CLEANUP_DECL (*tp
) == dp
->var
)
3637 CLEANUP_EH_ONLY (*tp
) = 1;
3638 /* Replace the DECL_EXPR for the NRV with an initialization of the
3639 RESULT_DECL, if needed. */
3640 else if (TREE_CODE (*tp
) == DECL_EXPR
3641 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3644 if (DECL_INITIAL (dp
->var
)
3645 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3646 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3647 DECL_INITIAL (dp
->var
));
3649 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3650 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3651 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3654 /* And replace all uses of the NRV with the RESULT_DECL. */
3655 else if (*tp
== dp
->var
)
3658 /* Avoid walking into the same tree more than once. Unfortunately, we
3659 can't just use walk_tree_without duplicates because it would only call
3660 us for the first occurrence of dp->var in the function body. */
3661 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3667 /* Keep iterating. */
3671 /* Called from finish_function to implement the named return value
3672 optimization by overriding all the RETURN_EXPRs and pertinent
3673 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3674 RESULT_DECL for the function. */
3677 finalize_nrv (tree
*tp
, tree var
, tree result
)
3679 struct nrv_data data
;
3681 /* Copy name from VAR to RESULT. */
3682 DECL_NAME (result
) = DECL_NAME (var
);
3683 /* Don't forget that we take its address. */
3684 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3685 /* Finally set DECL_VALUE_EXPR to avoid assigning
3686 a stack slot at -O0 for the original var and debug info
3687 uses RESULT location for VAR. */
3688 SET_DECL_VALUE_EXPR (var
, result
);
3689 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3692 data
.result
= result
;
3693 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3694 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3695 htab_delete (data
.visited
);
3698 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3701 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3702 bool need_copy_ctor
, bool need_copy_assignment
)
3704 int save_errorcount
= errorcount
;
3707 /* Always allocate 3 elements for simplicity. These are the
3708 function decls for the ctor, dtor, and assignment op.
3709 This layout is known to the three lang hooks,
3710 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3711 and cxx_omp_clause_assign_op. */
3712 info
= make_tree_vec (3);
3713 CP_OMP_CLAUSE_INFO (c
) = info
;
3715 if (need_default_ctor
|| need_copy_ctor
)
3717 if (need_default_ctor
)
3718 t
= get_default_ctor (type
);
3720 t
= get_copy_ctor (type
);
3722 if (t
&& !trivial_fn_p (t
))
3723 TREE_VEC_ELT (info
, 0) = t
;
3726 if ((need_default_ctor
|| need_copy_ctor
)
3727 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3728 TREE_VEC_ELT (info
, 1) = get_dtor (type
);
3730 if (need_copy_assignment
)
3732 t
= get_copy_assign (type
);
3734 if (t
&& !trivial_fn_p (t
))
3735 TREE_VEC_ELT (info
, 2) = t
;
3738 return errorcount
!= save_errorcount
;
3741 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3742 Remove any elements from the list that are invalid. */
3745 finish_omp_clauses (tree clauses
)
3747 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3748 tree c
, t
, *pc
= &clauses
;
3751 bitmap_obstack_initialize (NULL
);
3752 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3753 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3754 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3756 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3758 bool remove
= false;
3760 switch (OMP_CLAUSE_CODE (c
))
3762 case OMP_CLAUSE_SHARED
:
3764 goto check_dup_generic
;
3765 case OMP_CLAUSE_PRIVATE
:
3767 goto check_dup_generic
;
3768 case OMP_CLAUSE_REDUCTION
:
3770 goto check_dup_generic
;
3771 case OMP_CLAUSE_COPYPRIVATE
:
3772 name
= "copyprivate";
3773 goto check_dup_generic
;
3774 case OMP_CLAUSE_COPYIN
:
3776 goto check_dup_generic
;
3778 t
= OMP_CLAUSE_DECL (c
);
3779 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3781 if (processing_template_decl
)
3784 error ("%qD is not a variable in clause %qs", t
, name
);
3786 error ("%qE is not a variable in clause %qs", t
, name
);
3789 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3790 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3791 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3793 error ("%qD appears more than once in data clauses", t
);
3797 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3800 case OMP_CLAUSE_FIRSTPRIVATE
:
3801 t
= OMP_CLAUSE_DECL (c
);
3802 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3804 if (processing_template_decl
)
3807 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3809 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3812 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3813 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3815 error ("%qD appears more than once in data clauses", t
);
3819 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3822 case OMP_CLAUSE_LASTPRIVATE
:
3823 t
= OMP_CLAUSE_DECL (c
);
3824 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3826 if (processing_template_decl
)
3829 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3831 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3834 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3835 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3837 error ("%qD appears more than once in data clauses", t
);
3841 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3845 t
= OMP_CLAUSE_IF_EXPR (c
);
3846 t
= maybe_convert_cond (t
);
3847 if (t
== error_mark_node
)
3849 OMP_CLAUSE_IF_EXPR (c
) = t
;
3852 case OMP_CLAUSE_NUM_THREADS
:
3853 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3854 if (t
== error_mark_node
)
3856 else if (!type_dependent_expression_p (t
)
3857 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3859 error ("num_threads expression must be integral");
3864 case OMP_CLAUSE_SCHEDULE
:
3865 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3868 else if (t
== error_mark_node
)
3870 else if (!type_dependent_expression_p (t
)
3871 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3873 error ("schedule chunk size expression must be integral");
3878 case OMP_CLAUSE_NOWAIT
:
3879 case OMP_CLAUSE_ORDERED
:
3880 case OMP_CLAUSE_DEFAULT
:
3881 case OMP_CLAUSE_UNTIED
:
3882 case OMP_CLAUSE_COLLAPSE
:
3890 *pc
= OMP_CLAUSE_CHAIN (c
);
3892 pc
= &OMP_CLAUSE_CHAIN (c
);
3895 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3897 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3898 bool remove
= false;
3899 bool need_complete_non_reference
= false;
3900 bool need_default_ctor
= false;
3901 bool need_copy_ctor
= false;
3902 bool need_copy_assignment
= false;
3903 bool need_implicitly_determined
= false;
3904 tree type
, inner_type
;
3908 case OMP_CLAUSE_SHARED
:
3910 need_implicitly_determined
= true;
3912 case OMP_CLAUSE_PRIVATE
:
3914 need_complete_non_reference
= true;
3915 need_default_ctor
= true;
3916 need_implicitly_determined
= true;
3918 case OMP_CLAUSE_FIRSTPRIVATE
:
3919 name
= "firstprivate";
3920 need_complete_non_reference
= true;
3921 need_copy_ctor
= true;
3922 need_implicitly_determined
= true;
3924 case OMP_CLAUSE_LASTPRIVATE
:
3925 name
= "lastprivate";
3926 need_complete_non_reference
= true;
3927 need_copy_assignment
= true;
3928 need_implicitly_determined
= true;
3930 case OMP_CLAUSE_REDUCTION
:
3932 need_implicitly_determined
= true;
3934 case OMP_CLAUSE_COPYPRIVATE
:
3935 name
= "copyprivate";
3936 need_copy_assignment
= true;
3938 case OMP_CLAUSE_COPYIN
:
3940 need_copy_assignment
= true;
3943 pc
= &OMP_CLAUSE_CHAIN (c
);
3947 t
= OMP_CLAUSE_DECL (c
);
3948 if (processing_template_decl
3949 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3951 pc
= &OMP_CLAUSE_CHAIN (c
);
3957 case OMP_CLAUSE_LASTPRIVATE
:
3958 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3959 need_default_ctor
= true;
3962 case OMP_CLAUSE_REDUCTION
:
3963 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3964 || POINTER_TYPE_P (TREE_TYPE (t
)))
3966 error ("%qE has invalid type for %<reduction%>", t
);
3969 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3971 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3979 error ("%qE has invalid type for %<reduction(%s)%>",
3980 t
, operator_name_info
[r_code
].name
);
3986 case OMP_CLAUSE_COPYIN
:
3987 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3989 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3998 if (need_complete_non_reference
)
4000 t
= require_complete_type (t
);
4001 if (t
== error_mark_node
)
4003 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4005 error ("%qE has reference type for %qs", t
, name
);
4009 if (need_implicitly_determined
)
4011 const char *share_name
= NULL
;
4013 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4014 share_name
= "threadprivate";
4015 else switch (cxx_omp_predetermined_sharing (t
))
4017 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
4019 case OMP_CLAUSE_DEFAULT_SHARED
:
4020 share_name
= "shared";
4022 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4023 share_name
= "private";
4030 error ("%qE is predetermined %qs for %qs",
4031 t
, share_name
, name
);
4036 /* We're interested in the base element, not arrays. */
4037 inner_type
= type
= TREE_TYPE (t
);
4038 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
4039 inner_type
= TREE_TYPE (inner_type
);
4041 /* Check for special function availability by building a call to one.
4042 Save the results, because later we won't be in the right context
4043 for making these queries. */
4044 if (CLASS_TYPE_P (inner_type
)
4045 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
4046 && !type_dependent_expression_p (t
)
4047 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
4048 need_copy_ctor
, need_copy_assignment
))
4052 *pc
= OMP_CLAUSE_CHAIN (c
);
4054 pc
= &OMP_CLAUSE_CHAIN (c
);
4057 bitmap_obstack_release (NULL
);
4061 /* For all variables in the tree_list VARS, mark them as thread local. */
4064 finish_omp_threadprivate (tree vars
)
4068 /* Mark every variable in VARS to be assigned thread local storage. */
4069 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4071 tree v
= TREE_PURPOSE (t
);
4073 if (error_operand_p (v
))
4075 else if (TREE_CODE (v
) != VAR_DECL
)
4076 error ("%<threadprivate%> %qD is not file, namespace "
4077 "or block scope variable", v
);
4078 /* If V had already been marked threadprivate, it doesn't matter
4079 whether it had been used prior to this point. */
4080 else if (TREE_USED (v
)
4081 && (DECL_LANG_SPECIFIC (v
) == NULL
4082 || !CP_DECL_THREADPRIVATE_P (v
)))
4083 error ("%qE declared %<threadprivate%> after first use", v
);
4084 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4085 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4086 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4087 error ("%<threadprivate%> %qE has incomplete type", v
);
4088 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4089 && CP_DECL_CONTEXT (v
) != current_class_type
)
4090 error ("%<threadprivate%> %qE directive not "
4091 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4094 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4095 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4097 retrofit_lang_decl (v
);
4099 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4100 after the allocation of the lang_decl structure. */
4101 if (DECL_DISCRIMINATOR_P (v
))
4102 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4105 if (! DECL_THREAD_LOCAL_P (v
))
4107 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4108 /* If rtl has been already set for this var, call
4109 make_decl_rtl once again, so that encode_section_info
4110 has a chance to look at the new decl flags. */
4111 if (DECL_RTL_SET_P (v
))
4114 CP_DECL_THREADPRIVATE_P (v
) = 1;
4119 /* Build an OpenMP structured block. */
4122 begin_omp_structured_block (void)
4124 return do_pushlevel (sk_omp
);
4128 finish_omp_structured_block (tree block
)
4130 return do_poplevel (block
);
4133 /* Similarly, except force the retention of the BLOCK. */
4136 begin_omp_parallel (void)
4138 keep_next_level (true);
4139 return begin_omp_structured_block ();
4143 finish_omp_parallel (tree clauses
, tree body
)
4147 body
= finish_omp_structured_block (body
);
4149 stmt
= make_node (OMP_PARALLEL
);
4150 TREE_TYPE (stmt
) = void_type_node
;
4151 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4152 OMP_PARALLEL_BODY (stmt
) = body
;
4154 return add_stmt (stmt
);
4158 begin_omp_task (void)
4160 keep_next_level (true);
4161 return begin_omp_structured_block ();
4165 finish_omp_task (tree clauses
, tree body
)
4169 body
= finish_omp_structured_block (body
);
4171 stmt
= make_node (OMP_TASK
);
4172 TREE_TYPE (stmt
) = void_type_node
;
4173 OMP_TASK_CLAUSES (stmt
) = clauses
;
4174 OMP_TASK_BODY (stmt
) = body
;
4176 return add_stmt (stmt
);
4179 /* Helper function for finish_omp_for. Convert Ith random access iterator
4180 into integral iterator. Return FALSE if successful. */
4183 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4184 tree condv
, tree incrv
, tree
*body
,
4185 tree
*pre_body
, tree clauses
)
4187 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4188 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4189 tree decl
= TREE_VEC_ELT (declv
, i
);
4190 tree init
= TREE_VEC_ELT (initv
, i
);
4191 tree cond
= TREE_VEC_ELT (condv
, i
);
4192 tree incr
= TREE_VEC_ELT (incrv
, i
);
4194 location_t elocus
= locus
;
4196 if (init
&& EXPR_HAS_LOCATION (init
))
4197 elocus
= EXPR_LOCATION (init
);
4199 switch (TREE_CODE (cond
))
4205 if (TREE_OPERAND (cond
, 1) == iter
)
4206 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4207 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4208 if (TREE_OPERAND (cond
, 0) != iter
)
4209 cond
= error_mark_node
;
4212 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4213 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4214 NULL
, tf_warning_or_error
);
4215 if (error_operand_p (tem
))
4220 cond
= error_mark_node
;
4223 if (cond
== error_mark_node
)
4225 error_at (elocus
, "invalid controlling predicate");
4228 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4229 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4230 tf_warning_or_error
);
4231 if (error_operand_p (diff
))
4233 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4235 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4236 TREE_OPERAND (cond
, 1), iter
);
4240 switch (TREE_CODE (incr
))
4242 case PREINCREMENT_EXPR
:
4243 case PREDECREMENT_EXPR
:
4244 case POSTINCREMENT_EXPR
:
4245 case POSTDECREMENT_EXPR
:
4246 if (TREE_OPERAND (incr
, 0) != iter
)
4248 incr
= error_mark_node
;
4251 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4252 tf_warning_or_error
);
4253 if (error_operand_p (iter_incr
))
4255 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4256 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4257 incr
= integer_one_node
;
4259 incr
= integer_minus_one_node
;
4262 if (TREE_OPERAND (incr
, 0) != iter
)
4263 incr
= error_mark_node
;
4264 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4265 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4267 tree rhs
= TREE_OPERAND (incr
, 1);
4268 if (TREE_OPERAND (rhs
, 0) == iter
)
4270 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4272 incr
= error_mark_node
;
4275 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4276 TREE_OPERAND (rhs
, 1),
4277 tf_warning_or_error
);
4278 if (error_operand_p (iter_incr
))
4280 incr
= TREE_OPERAND (rhs
, 1);
4281 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4282 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4284 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4285 incr
= fold_if_not_in_template (incr
);
4287 if (TREE_CODE (incr
) != INTEGER_CST
4288 && (TREE_CODE (incr
) != NOP_EXPR
4289 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4294 else if (TREE_OPERAND (rhs
, 1) == iter
)
4296 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4297 || TREE_CODE (rhs
) != PLUS_EXPR
)
4298 incr
= error_mark_node
;
4301 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4302 TREE_OPERAND (rhs
, 0),
4305 tf_warning_or_error
);
4306 if (error_operand_p (iter_incr
))
4308 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4310 tf_warning_or_error
);
4311 if (error_operand_p (iter_incr
))
4313 incr
= TREE_OPERAND (rhs
, 0);
4318 incr
= error_mark_node
;
4321 incr
= error_mark_node
;
4324 incr
= error_mark_node
;
4328 if (incr
== error_mark_node
)
4330 error_at (elocus
, "invalid increment expression");
4334 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4335 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4336 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4337 && OMP_CLAUSE_DECL (c
) == iter
)
4340 decl
= create_temporary_var (TREE_TYPE (diff
));
4342 add_decl_expr (decl
);
4343 last
= create_temporary_var (TREE_TYPE (diff
));
4345 add_decl_expr (last
);
4346 if (c
&& iter_incr
== NULL
)
4348 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4349 pushdecl (incr_var
);
4350 add_decl_expr (incr_var
);
4352 gcc_assert (stmts_are_full_exprs_p ());
4354 orig_pre_body
= *pre_body
;
4355 *pre_body
= push_stmt_list ();
4357 add_stmt (orig_pre_body
);
4359 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4360 tf_warning_or_error
));
4361 init
= build_int_cst (TREE_TYPE (diff
), 0);
4362 if (c
&& iter_incr
== NULL
)
4364 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4365 incr
, tf_warning_or_error
));
4367 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4368 tf_warning_or_error
);
4370 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4371 tf_warning_or_error
));
4372 *pre_body
= pop_stmt_list (*pre_body
);
4374 cond
= cp_build_binary_op (elocus
,
4375 TREE_CODE (cond
), decl
, diff
,
4376 tf_warning_or_error
);
4377 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4378 elocus
, incr
, NULL_TREE
);
4381 *body
= push_stmt_list ();
4382 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4383 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4384 tf_warning_or_error
);
4385 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4386 finish_expr_stmt (iter_init
);
4387 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4388 tf_warning_or_error
));
4389 add_stmt (orig_body
);
4390 *body
= pop_stmt_list (*body
);
4394 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4395 finish_expr_stmt (iter_incr
);
4396 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4397 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4400 TREE_VEC_ELT (declv
, i
) = decl
;
4401 TREE_VEC_ELT (initv
, i
) = init
;
4402 TREE_VEC_ELT (condv
, i
) = cond
;
4403 TREE_VEC_ELT (incrv
, i
) = incr
;
4408 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4409 are directly for their associated operands in the statement. DECL
4410 and INIT are a combo; if DECL is NULL then INIT ought to be a
4411 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4412 optional statements that need to go before the loop into its
4416 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4417 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4419 tree omp_for
= NULL
, orig_incr
= NULL
;
4420 tree decl
, init
, cond
, incr
;
4424 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4425 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4426 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4427 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4429 decl
= TREE_VEC_ELT (declv
, i
);
4430 init
= TREE_VEC_ELT (initv
, i
);
4431 cond
= TREE_VEC_ELT (condv
, i
);
4432 incr
= TREE_VEC_ELT (incrv
, i
);
4438 switch (TREE_CODE (init
))
4441 decl
= TREE_OPERAND (init
, 0);
4442 init
= TREE_OPERAND (init
, 1);
4445 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4447 decl
= TREE_OPERAND (init
, 0);
4448 init
= TREE_OPERAND (init
, 2);
4458 "expected iteration declaration or initialization");
4463 if (init
&& EXPR_HAS_LOCATION (init
))
4464 elocus
= EXPR_LOCATION (init
);
4468 error_at (elocus
, "missing controlling predicate");
4474 error_at (elocus
, "missing increment expression");
4478 TREE_VEC_ELT (declv
, i
) = decl
;
4479 TREE_VEC_ELT (initv
, i
) = init
;
4482 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4486 stmt
= make_node (OMP_FOR
);
4488 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4490 /* This is really just a place-holder. We'll be decomposing this
4491 again and going through the cp_build_modify_expr path below when
4492 we instantiate the thing. */
4493 TREE_VEC_ELT (initv
, i
)
4494 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4495 TREE_VEC_ELT (initv
, i
));
4498 TREE_TYPE (stmt
) = void_type_node
;
4499 OMP_FOR_INIT (stmt
) = initv
;
4500 OMP_FOR_COND (stmt
) = condv
;
4501 OMP_FOR_INCR (stmt
) = incrv
;
4502 OMP_FOR_BODY (stmt
) = body
;
4503 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4504 OMP_FOR_CLAUSES (stmt
) = clauses
;
4506 SET_EXPR_LOCATION (stmt
, locus
);
4507 return add_stmt (stmt
);
4510 if (processing_template_decl
)
4511 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4513 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4515 decl
= TREE_VEC_ELT (declv
, i
);
4516 init
= TREE_VEC_ELT (initv
, i
);
4517 cond
= TREE_VEC_ELT (condv
, i
);
4518 incr
= TREE_VEC_ELT (incrv
, i
);
4520 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4523 if (init
&& EXPR_HAS_LOCATION (init
))
4524 elocus
= EXPR_LOCATION (init
);
4528 error_at (elocus
, "expected iteration declaration or initialization");
4532 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4535 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4536 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4537 TREE_CODE (TREE_OPERAND (incr
, 1)),
4538 TREE_OPERAND (incr
, 2),
4539 tf_warning_or_error
);
4542 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4544 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4545 incrv
, &body
, &pre_body
, clauses
))
4550 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4551 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4553 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4557 if (!processing_template_decl
)
4559 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4560 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4563 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4565 && TREE_SIDE_EFFECTS (cond
)
4566 && COMPARISON_CLASS_P (cond
)
4567 && !processing_template_decl
)
4569 tree t
= TREE_OPERAND (cond
, 0);
4570 if (TREE_SIDE_EFFECTS (t
)
4572 && (TREE_CODE (t
) != NOP_EXPR
4573 || TREE_OPERAND (t
, 0) != decl
))
4574 TREE_OPERAND (cond
, 0)
4575 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4577 t
= TREE_OPERAND (cond
, 1);
4578 if (TREE_SIDE_EFFECTS (t
)
4580 && (TREE_CODE (t
) != NOP_EXPR
4581 || TREE_OPERAND (t
, 0) != decl
))
4582 TREE_OPERAND (cond
, 1)
4583 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4585 if (decl
== error_mark_node
|| init
== error_mark_node
)
4588 TREE_VEC_ELT (declv
, i
) = decl
;
4589 TREE_VEC_ELT (initv
, i
) = init
;
4590 TREE_VEC_ELT (condv
, i
) = cond
;
4591 TREE_VEC_ELT (incrv
, i
) = incr
;
4595 if (IS_EMPTY_STMT (pre_body
))
4598 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4601 if (omp_for
== NULL
)
4604 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4606 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4607 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4609 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4612 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4613 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4614 && !processing_template_decl
)
4616 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4617 if (TREE_SIDE_EFFECTS (t
)
4619 && (TREE_CODE (t
) != NOP_EXPR
4620 || TREE_OPERAND (t
, 0) != decl
))
4621 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4622 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4624 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4625 if (TREE_SIDE_EFFECTS (t
)
4627 && (TREE_CODE (t
) != NOP_EXPR
4628 || TREE_OPERAND (t
, 0) != decl
))
4629 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4630 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4634 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4636 if (omp_for
!= NULL
)
4637 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4642 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4651 dependent_p
= false;
4654 /* Even in a template, we can detect invalid uses of the atomic
4655 pragma if neither LHS nor RHS is type-dependent. */
4656 if (processing_template_decl
)
4658 dependent_p
= (type_dependent_expression_p (lhs
)
4659 || type_dependent_expression_p (rhs
));
4662 lhs
= build_non_dependent_expr (lhs
);
4663 rhs
= build_non_dependent_expr (rhs
);
4668 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4669 if (stmt
== error_mark_node
)
4672 if (processing_template_decl
)
4673 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4674 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4679 finish_omp_barrier (void)
4681 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4682 VEC(tree
,gc
) *vec
= make_tree_vector ();
4683 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4684 release_tree_vector (vec
);
4685 finish_expr_stmt (stmt
);
4689 finish_omp_flush (void)
4691 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4692 VEC(tree
,gc
) *vec
= make_tree_vector ();
4693 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4694 release_tree_vector (vec
);
4695 finish_expr_stmt (stmt
);
4699 finish_omp_taskwait (void)
4701 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4702 VEC(tree
,gc
) *vec
= make_tree_vector ();
4703 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4704 release_tree_vector (vec
);
4705 finish_expr_stmt (stmt
);
4709 init_cp_semantics (void)
4713 /* Build a STATIC_ASSERT for a static assertion with the condition
4714 CONDITION and the message text MESSAGE. LOCATION is the location
4715 of the static assertion in the source code. When MEMBER_P, this
4716 static assertion is a member of a class. */
4718 finish_static_assert (tree condition
, tree message
, location_t location
,
4721 if (check_for_bare_parameter_packs (condition
))
4722 condition
= error_mark_node
;
4724 if (type_dependent_expression_p (condition
)
4725 || value_dependent_expression_p (condition
))
4727 /* We're in a template; build a STATIC_ASSERT and put it in
4731 assertion
= make_node (STATIC_ASSERT
);
4732 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4733 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4734 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4737 maybe_add_class_template_decl_list (current_class_type
,
4741 add_stmt (assertion
);
4746 /* Fold the expression and convert it to a boolean value. */
4747 condition
= fold_non_dependent_expr (condition
);
4748 condition
= cp_convert (boolean_type_node
, condition
);
4749 condition
= maybe_constant_value (condition
);
4751 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4752 /* Do nothing; the condition is satisfied. */
4756 location_t saved_loc
= input_location
;
4758 input_location
= location
;
4759 if (TREE_CODE (condition
) == INTEGER_CST
4760 && integer_zerop (condition
))
4761 /* Report the error. */
4762 error ("static assertion failed: %E", message
);
4763 else if (condition
&& condition
!= error_mark_node
)
4765 error ("non-constant condition for static assertion");
4766 cxx_constant_value (condition
);
4768 input_location
= saved_loc
;
4772 /* Returns the type of EXPR for cases where we can determine it even though
4773 EXPR is a type-dependent expression. */
4776 describable_type (tree expr
)
4778 tree type
= NULL_TREE
;
4780 if (! type_dependent_expression_p (expr
)
4781 && ! type_unknown_p (expr
))
4783 type
= unlowered_expr_type (expr
);
4784 if (real_lvalue_p (expr
))
4785 type
= build_reference_type (type
);
4791 switch (TREE_CODE (expr
))
4797 return TREE_TYPE (expr
);
4802 case TEMPLATE_PARM_INDEX
:
4804 case STATIC_CAST_EXPR
:
4805 case REINTERPRET_CAST_EXPR
:
4806 case CONST_CAST_EXPR
:
4807 case DYNAMIC_CAST_EXPR
:
4808 type
= TREE_TYPE (expr
);
4813 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4814 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4815 type
= build_reference_type (TREE_TYPE (ptrtype
));
4820 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4821 type
= TREE_TYPE (expr
);
4825 if (type
&& type_uses_auto (type
))
4831 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4832 suitable for use as a type-specifier.
4834 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4835 id-expression or a class member access, FALSE when it was parsed as
4836 a full expression. */
4839 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
4840 tsubst_flags_t complain
)
4842 tree type
= NULL_TREE
;
4844 if (!expr
|| error_operand_p (expr
))
4845 return error_mark_node
;
4848 || TREE_CODE (expr
) == TYPE_DECL
4849 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4850 && TYPE_P (TREE_OPERAND (expr
, 0))))
4852 if (complain
& tf_error
)
4853 error ("argument to decltype must be an expression");
4854 return error_mark_node
;
4857 /* FIXME instantiation-dependent */
4858 if (type_dependent_expression_p (expr
)
4859 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4860 if it isn't dependent, so that we can check access control at
4861 instantiation time, so defer the decltype as well (PR 42277). */
4862 || (id_expression_or_member_access_p
4863 && processing_template_decl
4864 && TREE_CODE (expr
) == COMPONENT_REF
))
4866 type
= cxx_make_type (DECLTYPE_TYPE
);
4867 DECLTYPE_TYPE_EXPR (type
) = expr
;
4868 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4869 = id_expression_or_member_access_p
;
4870 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4875 /* The type denoted by decltype(e) is defined as follows: */
4877 expr
= resolve_nondeduced_context (expr
);
4879 if (type_unknown_p (expr
))
4881 if (complain
& tf_error
)
4882 error ("decltype cannot resolve address of overloaded function");
4883 return error_mark_node
;
4886 /* To get the size of a static data member declared as an array of
4887 unknown bound, we need to instantiate it. */
4888 if (TREE_CODE (expr
) == VAR_DECL
4889 && VAR_HAD_UNKNOWN_BOUND (expr
)
4890 && DECL_TEMPLATE_INSTANTIATION (expr
))
4891 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4893 if (id_expression_or_member_access_p
)
4895 /* If e is an id-expression or a class member access (5.2.5
4896 [expr.ref]), decltype(e) is defined as the type of the entity
4897 named by e. If there is no such entity, or e names a set of
4898 overloaded functions, the program is ill-formed. */
4899 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4900 expr
= lookup_name (expr
);
4902 if (TREE_CODE (expr
) == INDIRECT_REF
)
4903 /* This can happen when the expression is, e.g., "a.b". Just
4904 look at the underlying operand. */
4905 expr
= TREE_OPERAND (expr
, 0);
4907 if (TREE_CODE (expr
) == OFFSET_REF
4908 || TREE_CODE (expr
) == MEMBER_REF
)
4909 /* We're only interested in the field itself. If it is a
4910 BASELINK, we will need to see through it in the next
4912 expr
= TREE_OPERAND (expr
, 1);
4914 if (TREE_CODE (expr
) == BASELINK
)
4915 /* See through BASELINK nodes to the underlying function. */
4916 expr
= BASELINK_FUNCTIONS (expr
);
4918 switch (TREE_CODE (expr
))
4921 if (DECL_BIT_FIELD_TYPE (expr
))
4923 type
= DECL_BIT_FIELD_TYPE (expr
);
4926 /* Fall through for fields that aren't bitfields. */
4933 case TEMPLATE_PARM_INDEX
:
4934 expr
= mark_type_use (expr
);
4935 type
= TREE_TYPE (expr
);
4939 type
= error_mark_node
;
4943 mark_type_use (expr
);
4944 type
= is_bitfield_expr_with_lowered_type (expr
);
4946 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4953 /* We can get here when the id-expression refers to an
4955 type
= TREE_TYPE (expr
);
4960 return error_mark_node
;
4965 /* Within a lambda-expression:
4967 Every occurrence of decltype((x)) where x is a possibly
4968 parenthesized id-expression that names an entity of
4969 automatic storage duration is treated as if x were
4970 transformed into an access to a corresponding data member
4971 of the closure type that would have been declared if x
4972 were a use of the denoted entity. */
4973 if (outer_automatic_var_p (expr
)
4974 && current_function_decl
4975 && LAMBDA_FUNCTION_P (current_function_decl
))
4976 type
= capture_decltype (expr
);
4977 else if (error_operand_p (expr
))
4978 type
= error_mark_node
;
4979 else if (expr
== current_class_ptr
)
4980 /* If the expression is just "this", we want the
4981 cv-unqualified pointer for the "this" type. */
4982 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
4985 /* Otherwise, where T is the type of e, if e is an lvalue,
4986 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
4987 cp_lvalue_kind clk
= lvalue_kind (expr
);
4988 type
= unlowered_expr_type (expr
);
4989 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
4990 if (clk
!= clk_none
&& !(clk
& clk_class
))
4991 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
4998 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4999 __has_nothrow_copy, depending on assign_p. */
5002 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5009 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5012 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5014 else if (TYPE_HAS_COPY_CTOR (type
))
5016 /* If construction of the copy constructor was postponed, create
5018 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5019 lazily_declare_fn (sfk_copy_constructor
, type
);
5020 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5021 lazily_declare_fn (sfk_move_constructor
, type
);
5022 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5027 for (; fns
; fns
= OVL_NEXT (fns
))
5029 tree fn
= OVL_CURRENT (fns
);
5033 if (copy_fn_p (fn
) == 0)
5036 else if (copy_fn_p (fn
) <= 0)
5039 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5046 /* Actually evaluates the trait. */
5049 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5051 enum tree_code type_code1
;
5054 type_code1
= TREE_CODE (type1
);
5058 case CPTK_HAS_NOTHROW_ASSIGN
:
5059 type1
= strip_array_types (type1
);
5060 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5061 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5062 || (CLASS_TYPE_P (type1
)
5063 && classtype_has_nothrow_assign_or_copy_p (type1
,
5066 case CPTK_HAS_TRIVIAL_ASSIGN
:
5067 /* ??? The standard seems to be missing the "or array of such a class
5068 type" wording for this trait. */
5069 type1
= strip_array_types (type1
);
5070 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5071 && (trivial_type_p (type1
)
5072 || (CLASS_TYPE_P (type1
)
5073 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5075 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5076 type1
= strip_array_types (type1
);
5077 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5078 || (CLASS_TYPE_P (type1
)
5079 && (t
= locate_ctor (type1
))
5080 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5082 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5083 type1
= strip_array_types (type1
);
5084 return (trivial_type_p (type1
)
5085 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5087 case CPTK_HAS_NOTHROW_COPY
:
5088 type1
= strip_array_types (type1
);
5089 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5090 || (CLASS_TYPE_P (type1
)
5091 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5093 case CPTK_HAS_TRIVIAL_COPY
:
5094 /* ??? The standard seems to be missing the "or array of such a class
5095 type" wording for this trait. */
5096 type1
= strip_array_types (type1
);
5097 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5098 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5100 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5101 type1
= strip_array_types (type1
);
5102 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5103 || (CLASS_TYPE_P (type1
)
5104 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5106 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5107 return type_has_virtual_destructor (type1
);
5109 case CPTK_IS_ABSTRACT
:
5110 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5112 case CPTK_IS_BASE_OF
:
5113 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5114 && DERIVED_FROM_P (type1
, type2
));
5117 return (NON_UNION_CLASS_TYPE_P (type1
));
5119 case CPTK_IS_CONVERTIBLE_TO
:
5124 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5127 return (type_code1
== ENUMERAL_TYPE
);
5130 return (pod_type_p (type1
));
5132 case CPTK_IS_POLYMORPHIC
:
5133 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5135 case CPTK_IS_STD_LAYOUT
:
5136 return (std_layout_type_p (type1
));
5138 case CPTK_IS_TRIVIAL
:
5139 return (trivial_type_p (type1
));
5142 return (type_code1
== UNION_TYPE
);
5144 case CPTK_IS_LITERAL_TYPE
:
5145 return (literal_type_p (type1
));
5153 /* Returns true if TYPE is a complete type, an array of unknown bound,
5154 or (possibly cv-qualified) void, returns false otherwise. */
5157 check_trait_type (tree type
)
5159 if (COMPLETE_TYPE_P (type
))
5162 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5163 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5166 if (VOID_TYPE_P (type
))
5172 /* Process a trait expression. */
5175 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5177 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5178 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5179 || kind
== CPTK_HAS_NOTHROW_COPY
5180 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5181 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5182 || kind
== CPTK_HAS_TRIVIAL_COPY
5183 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5184 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5185 || kind
== CPTK_IS_ABSTRACT
5186 || kind
== CPTK_IS_BASE_OF
5187 || kind
== CPTK_IS_CLASS
5188 || kind
== CPTK_IS_CONVERTIBLE_TO
5189 || kind
== CPTK_IS_EMPTY
5190 || kind
== CPTK_IS_ENUM
5191 || kind
== CPTK_IS_POD
5192 || kind
== CPTK_IS_POLYMORPHIC
5193 || kind
== CPTK_IS_STD_LAYOUT
5194 || kind
== CPTK_IS_TRIVIAL
5195 || kind
== CPTK_IS_LITERAL_TYPE
5196 || kind
== CPTK_IS_UNION
);
5198 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5200 sorry ("__is_convertible_to");
5201 return error_mark_node
;
5204 if (type1
== error_mark_node
5205 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5206 && type2
== error_mark_node
))
5207 return error_mark_node
;
5209 if (processing_template_decl
)
5211 tree trait_expr
= make_node (TRAIT_EXPR
);
5212 TREE_TYPE (trait_expr
) = boolean_type_node
;
5213 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5214 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5215 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5219 complete_type (type1
);
5221 complete_type (type2
);
5225 case CPTK_HAS_NOTHROW_ASSIGN
:
5226 case CPTK_HAS_TRIVIAL_ASSIGN
:
5227 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5228 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5229 case CPTK_HAS_NOTHROW_COPY
:
5230 case CPTK_HAS_TRIVIAL_COPY
:
5231 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5232 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5233 case CPTK_IS_ABSTRACT
:
5236 case CPTK_IS_POLYMORPHIC
:
5237 case CPTK_IS_STD_LAYOUT
:
5238 case CPTK_IS_TRIVIAL
:
5239 case CPTK_IS_LITERAL_TYPE
:
5240 if (!check_trait_type (type1
))
5242 error ("incomplete type %qT not allowed", type1
);
5243 return error_mark_node
;
5247 case CPTK_IS_BASE_OF
:
5248 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5249 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5250 && !COMPLETE_TYPE_P (type2
))
5252 error ("incomplete type %qT not allowed", type2
);
5253 return error_mark_node
;
5262 case CPTK_IS_CONVERTIBLE_TO
:
5267 return (trait_expr_value (kind
, type1
, type2
)
5268 ? boolean_true_node
: boolean_false_node
);
5271 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5272 which is ignored for C++. */
5275 set_float_const_decimal64 (void)
5280 clear_float_const_decimal64 (void)
5285 float_const_decimal64_p (void)
5291 /* Return true if T is a literal type. */
5294 literal_type_p (tree t
)
5296 if (SCALAR_TYPE_P (t
))
5298 if (CLASS_TYPE_P (t
))
5299 return CLASSTYPE_LITERAL_P (t
);
5300 if (TREE_CODE (t
) == ARRAY_TYPE
)
5301 return literal_type_p (strip_array_types (t
));
5305 /* If DECL is a variable declared `constexpr', require its type
5306 be literal. Return the DECL if OK, otherwise NULL. */
5309 ensure_literal_type_for_constexpr_object (tree decl
)
5311 tree type
= TREE_TYPE (decl
);
5312 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5313 && !processing_template_decl
5314 /* The call to complete_type is just for initializer_list. */
5315 && !literal_type_p (complete_type (type
)))
5317 error ("the type %qT of constexpr variable %qD is not literal",
5324 /* Representation of entries in the constexpr function definition table. */
5326 typedef struct GTY(()) constexpr_fundef
{
5331 /* This table holds all constexpr function definitions seen in
5332 the current translation unit. */
5334 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5336 /* Utility function used for managing the constexpr function table.
5337 Return true if the entries pointed to by P and Q are for the
5338 same constexpr function. */
5341 constexpr_fundef_equal (const void *p
, const void *q
)
5343 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5344 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5345 return lhs
->decl
== rhs
->decl
;
5348 /* Utility function used for managing the constexpr function table.
5349 Return a hash value for the entry pointed to by Q. */
5351 static inline hashval_t
5352 constexpr_fundef_hash (const void *p
)
5354 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5355 return DECL_UID (fundef
->decl
);
5358 /* Return a previously saved definition of function FUN. */
5360 static constexpr_fundef
*
5361 retrieve_constexpr_fundef (tree fun
)
5363 constexpr_fundef fundef
= { NULL
, NULL
};
5364 if (constexpr_fundef_table
== NULL
)
5368 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5371 /* Return true if type expression T is a valid parameter type, or
5372 a valid return type, of a constexpr function. */
5375 valid_type_in_constexpr_fundecl_p (tree t
)
5377 return (literal_type_p (t
)
5378 /* FIXME we allow ref to non-literal; should change standard to
5379 match, or change back if not. */
5380 || TREE_CODE (t
) == REFERENCE_TYPE
);
5383 /* Check whether the parameter and return types of FUN are valid for a
5384 constexpr function, and complain if COMPLAIN. */
5387 is_valid_constexpr_fn (tree fun
, bool complain
)
5389 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5391 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5392 if (!valid_type_in_constexpr_fundecl_p (TREE_TYPE (parm
)))
5396 error ("invalid type for parameter %d of constexpr "
5397 "function %q+#D", DECL_PARM_INDEX (parm
), fun
);
5400 if (!DECL_CONSTRUCTOR_P (fun
))
5402 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5403 if (!valid_type_in_constexpr_fundecl_p (rettype
))
5407 error ("invalid return type %qT of constexpr function %q+D",
5411 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5412 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun
)))
5416 error ("enclosing class of %q+#D is not a literal type", fun
);
5423 /* Return non-null if FUN certainly designates a valid constexpr function
5424 declaration. Otherwise return NULL. Issue appropriate diagnostics
5425 if necessary. Note that we only check the declaration, not the body
5429 validate_constexpr_fundecl (tree fun
)
5431 constexpr_fundef entry
;
5432 constexpr_fundef
**slot
;
5434 if (processing_template_decl
|| !DECL_DECLARED_CONSTEXPR_P (fun
))
5436 else if (DECL_CLONED_FUNCTION_P (fun
))
5437 /* We already checked the original function. */
5440 if (!is_valid_constexpr_fn (fun
, !DECL_TEMPLATE_INSTANTIATION (fun
)))
5442 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5446 /* Create the constexpr function table if necessary. */
5447 if (constexpr_fundef_table
== NULL
)
5448 constexpr_fundef_table
= htab_create_ggc (101,
5449 constexpr_fundef_hash
,
5450 constexpr_fundef_equal
,
5454 slot
= (constexpr_fundef
**)
5455 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
5458 *slot
= ggc_alloc_constexpr_fundef ();
5464 /* Subroutine of build_constexpr_constructor_member_initializers.
5465 The expression tree T represents a data member initialization
5466 in a (constexpr) constructor definition. Build a pairing of
5467 the data member with its initializer, and prepend that pair
5468 to the existing initialization pair INITS. */
5471 build_data_member_initialization (tree t
, VEC(constructor_elt
,gc
) **vec
)
5474 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5475 t
= TREE_OPERAND (t
, 0);
5476 if (TREE_CODE (t
) == EXPR_STMT
)
5477 t
= TREE_OPERAND (t
, 0);
5478 if (t
== error_mark_node
)
5480 if (TREE_CODE (t
) == STATEMENT_LIST
)
5482 tree_stmt_iterator i
;
5483 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5485 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5490 if (TREE_CODE (t
) == CLEANUP_STMT
)
5492 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5493 but we can in a constexpr constructor for a non-literal class. Just
5494 ignore it; either all the initialization will be constant, in which
5495 case the cleanup can't run, or it can't be constexpr.
5496 Still recurse into CLEANUP_BODY. */
5497 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5499 if (TREE_CODE (t
) == CONVERT_EXPR
)
5500 t
= TREE_OPERAND (t
, 0);
5501 if (TREE_CODE (t
) == INIT_EXPR
5502 || TREE_CODE (t
) == MODIFY_EXPR
)
5504 member
= TREE_OPERAND (t
, 0);
5505 init
= unshare_expr (TREE_OPERAND (t
, 1));
5509 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
5510 member
= CALL_EXPR_ARG (t
, 0);
5511 /* We don't use build_cplus_new here because it complains about
5512 abstract bases. Leaving the call unwrapped means that it has the
5513 wrong type, but cxx_eval_constant_expression doesn't care. */
5514 init
= unshare_expr (t
);
5516 if (TREE_CODE (member
) == INDIRECT_REF
)
5517 member
= TREE_OPERAND (member
, 0);
5518 if (TREE_CODE (member
) == NOP_EXPR
)
5522 if (TREE_CODE (op
) == ADDR_EXPR
)
5524 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5525 (TREE_TYPE (TREE_TYPE (op
)),
5526 TREE_TYPE (TREE_TYPE (member
))));
5527 /* Initializing a cv-qualified member; we need to look through
5533 /* We don't put out anything for an empty base. */
5534 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
5535 /* But if the initializer isn't constexpr, leave it in so we
5537 if (potential_constant_expression (init
))
5541 if (TREE_CODE (member
) == ADDR_EXPR
)
5542 member
= TREE_OPERAND (member
, 0);
5543 if (TREE_CODE (member
) == COMPONENT_REF
5544 /* If we're initializing a member of a subaggregate, it's a vtable
5545 pointer. Leave it as COMPONENT_REF so we remember the path to get
5547 && TREE_CODE (TREE_OPERAND (member
, 0)) != COMPONENT_REF
)
5548 member
= TREE_OPERAND (member
, 1);
5549 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
5553 /* Make sure that there are no statements after LAST in the constructor
5554 body represented by LIST. */
5557 check_constexpr_ctor_body (tree last
, tree list
)
5560 if (TREE_CODE (list
) == STATEMENT_LIST
)
5562 tree_stmt_iterator i
= tsi_last (list
);
5563 for (; !tsi_end_p (i
); tsi_prev (&i
))
5565 tree t
= tsi_stmt (i
);
5568 if (TREE_CODE (t
) == BIND_EXPR
)
5570 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
5575 /* We currently allow typedefs and static_assert.
5576 FIXME allow them in the standard, too. */
5577 if (TREE_CODE (t
) != STATIC_ASSERT
)
5584 else if (list
!= last
5585 && TREE_CODE (list
) != STATIC_ASSERT
)
5589 error ("constexpr constructor does not have empty body");
5590 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
5595 /* Build compile-time evalable representations of member-initializer list
5596 for a constexpr constructor. */
5599 build_constexpr_constructor_member_initializers (tree type
, tree body
)
5601 VEC(constructor_elt
,gc
) *vec
= NULL
;
5603 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
5604 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
5605 body
= TREE_OPERAND (body
, 0);
5606 if (TREE_CODE (body
) == STATEMENT_LIST
)
5607 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
5608 body
= BIND_EXPR_BODY (body
);
5609 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5611 body
= TREE_OPERAND (body
, 0);
5612 if (TREE_CODE (body
) == EXPR_STMT
)
5613 body
= TREE_OPERAND (body
, 0);
5614 if (TREE_CODE (body
) == INIT_EXPR
5615 && (same_type_ignoring_top_level_qualifiers_p
5616 (TREE_TYPE (TREE_OPERAND (body
, 0)),
5617 current_class_type
)))
5620 return TREE_OPERAND (body
, 1);
5622 ok
= build_data_member_initialization (body
, &vec
);
5624 else if (TREE_CODE (body
) == STATEMENT_LIST
)
5626 tree_stmt_iterator i
;
5627 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5629 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
5635 gcc_assert (errorcount
> 0);
5637 return build_constructor (type
, vec
);
5639 return error_mark_node
;
5642 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5643 declared to be constexpr, or a sub-statement thereof. Returns the
5644 return value if suitable, error_mark_node for a statement not allowed in
5645 a constexpr function, or NULL_TREE if no return value was found. */
5648 constexpr_fn_retval (tree body
)
5650 switch (TREE_CODE (body
))
5652 case STATEMENT_LIST
:
5654 tree_stmt_iterator i
;
5655 tree expr
= NULL_TREE
;
5656 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5658 tree s
= constexpr_fn_retval (tsi_stmt (i
));
5659 if (s
== error_mark_node
)
5660 return error_mark_node
;
5661 else if (s
== NULL_TREE
)
5662 /* Keep iterating. */;
5664 /* Multiple return statements. */
5665 return error_mark_node
;
5673 return unshare_expr (TREE_OPERAND (body
, 0));
5676 if (TREE_CODE (DECL_EXPR_DECL (body
)) == USING_DECL
)
5678 return error_mark_node
;
5684 return error_mark_node
;
5688 /* We are processing the definition of the constexpr function FUN.
5689 Check that its BODY fulfills the propriate requirements and
5690 enter it in the constexpr function definition table.
5691 For constructor BODY is actually the TREE_LIST of the
5692 member-initializer list. */
5695 register_constexpr_fundef (tree fun
, tree body
)
5697 constexpr_fundef
*fundef
= retrieve_constexpr_fundef (fun
);
5698 gcc_assert (fundef
!= NULL
&& fundef
->body
== NULL
);
5700 if (DECL_CONSTRUCTOR_P (fun
))
5701 body
= build_constexpr_constructor_member_initializers
5702 (DECL_CONTEXT (fun
), body
);
5705 if (TREE_CODE (body
) == BIND_EXPR
)
5706 body
= BIND_EXPR_BODY (body
);
5707 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
5708 body
= EH_SPEC_STMTS (body
);
5709 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
5710 body
= TREE_OPERAND (body
, 0);
5711 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5712 body
= TREE_OPERAND (body
, 0);
5713 body
= constexpr_fn_retval (body
);
5714 if (body
== NULL_TREE
|| body
== error_mark_node
)
5716 error ("body of constexpr function %qD not a return-statement", fun
);
5717 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5722 if (!potential_rvalue_constant_expression (body
))
5724 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5725 if (!DECL_TEMPLATE_INSTANTIATION (fun
))
5726 require_potential_rvalue_constant_expression (body
);
5729 fundef
->body
= body
;
5733 /* Objects of this type represent calls to constexpr functions
5734 along with the bindings of parameters to their arguments, for
5735 the purpose of compile time evaluation. */
5737 typedef struct GTY(()) constexpr_call
{
5738 /* Description of the constexpr function definition. */
5739 constexpr_fundef
*fundef
;
5740 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5741 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5742 Note: This arrangement is made to accomodate the use of
5743 iterative_hash_template_arg (see pt.c). If you change this
5744 representation, also change the hash calculation in
5745 cxx_eval_call_expression. */
5747 /* Result of the call.
5748 NULL means the call is being evaluated.
5749 error_mark_node means that the evaluation was erroneous;
5750 otherwise, the actuall value of the call. */
5752 /* The hash of this call; we remember it here to avoid having to
5753 recalculate it when expanding the hash table. */
5757 /* A table of all constexpr calls that have been evaluated by the
5758 compiler in this translation unit. */
5760 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
5762 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
5763 bool, bool, bool *);
5765 /* Compute a hash value for a constexpr call representation. */
5768 constexpr_call_hash (const void *p
)
5770 const constexpr_call
*info
= (const constexpr_call
*) p
;
5774 /* Return 1 if the objects pointed to by P and Q represent calls
5775 to the same constexpr function with the same arguments.
5776 Otherwise, return 0. */
5779 constexpr_call_equal (const void *p
, const void *q
)
5781 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
5782 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
5787 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
5789 lhs_bindings
= lhs
->bindings
;
5790 rhs_bindings
= rhs
->bindings
;
5791 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
5793 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
5794 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
5795 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
5796 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
5798 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
5799 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
5801 return lhs_bindings
== rhs_bindings
;
5804 /* Initialize the constexpr call table, if needed. */
5807 maybe_initialize_constexpr_call_table (void)
5809 if (constexpr_call_table
== NULL
)
5810 constexpr_call_table
= htab_create_ggc (101,
5811 constexpr_call_hash
,
5812 constexpr_call_equal
,
5816 /* Return true if T designates the implied `this' parameter. */
5819 is_this_parameter (tree t
)
5821 return t
== current_class_ptr
;
5824 /* We have an expression tree T that represents a call, either CALL_EXPR
5825 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5826 retrun the _DECL for that function. */
5829 get_function_named_in_call (tree t
)
5832 switch (TREE_CODE (t
))
5835 fun
= CALL_EXPR_FN (t
);
5838 case AGGR_INIT_EXPR
:
5839 fun
= AGGR_INIT_EXPR_FN (t
);
5846 if (TREE_CODE (fun
) == ADDR_EXPR
5847 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
5848 fun
= TREE_OPERAND (fun
, 0);
5852 /* We have an expression tree T that represents a call, either CALL_EXPR
5853 or AGGR_INIT_EXPR. Return the Nth argument. */
5856 get_nth_callarg (tree t
, int n
)
5858 switch (TREE_CODE (t
))
5861 return CALL_EXPR_ARG (t
, n
);
5863 case AGGR_INIT_EXPR
:
5864 return AGGR_INIT_EXPR_ARG (t
, n
);
5872 /* Look up the binding of the function parameter T in a constexpr
5873 function call context CALL. */
5876 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
5878 tree b
= purpose_member (t
, call
->bindings
);
5879 return TREE_VALUE (b
);
5882 /* Attempt to evaluate T which represents a call to a builtin function.
5883 We assume here that all builtin functions evaluate to scalar types
5884 represented by _CST nodes. */
5887 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
5888 bool allow_non_constant
, bool addr
,
5889 bool *non_constant_p
)
5891 const int nargs
= call_expr_nargs (t
);
5892 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
5895 for (i
= 0; i
< nargs
; ++i
)
5897 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
5898 allow_non_constant
, addr
,
5900 if (allow_non_constant
&& *non_constant_p
)
5903 if (*non_constant_p
)
5905 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
5906 CALL_EXPR_FN (t
), nargs
, args
);
5907 return fold (new_call
);
5910 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5911 the type of the value to match. */
5914 adjust_temp_type (tree type
, tree temp
)
5916 if (TREE_TYPE (temp
) == type
)
5918 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5919 if (TREE_CODE (temp
) == CONSTRUCTOR
)
5920 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
5921 gcc_assert (SCALAR_TYPE_P (type
));
5922 return cp_fold_convert (type
, temp
);
5925 /* Subroutine of cxx_eval_call_expression.
5926 We are processing a call expression (either CALL_EXPR or
5927 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5928 all arguments and bind their values to correspondings
5929 parameters, making up the NEW_CALL context. */
5932 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
5933 constexpr_call
*new_call
,
5934 bool allow_non_constant
,
5935 bool *non_constant_p
)
5937 const int nargs
= call_expr_nargs (t
);
5938 tree fun
= new_call
->fundef
->decl
;
5939 tree parms
= DECL_ARGUMENTS (fun
);
5941 for (i
= 0; i
< nargs
; ++i
)
5944 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
5945 /* For member function, the first argument is a pointer to the implied
5946 object. And for an object contruction, don't bind `this' before
5947 it is fully constructed. */
5948 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
5950 x
= get_nth_callarg (t
, i
);
5951 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
5952 TREE_CODE (type
) == REFERENCE_TYPE
,
5954 /* Don't VERIFY_CONSTANT here. */
5955 if (*non_constant_p
&& allow_non_constant
)
5957 /* Just discard ellipsis args after checking their constantitude. */
5960 if (*non_constant_p
)
5961 /* Don't try to adjust the type of non-constant args. */
5964 /* Make sure the binding has the same type as the parm. */
5965 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5966 arg
= adjust_temp_type (type
, arg
);
5967 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
5969 parms
= TREE_CHAIN (parms
);
5973 /* Variables and functions to manage constexpr call expansion context.
5974 These do not need to be marked for PCH or GC. */
5976 /* FIXME remember and print actual constant arguments. */
5977 static VEC(tree
,heap
) *call_stack
= NULL
;
5978 static int call_stack_tick
;
5979 static int last_cx_error_tick
;
5982 push_cx_call_context (tree call
)
5985 if (!EXPR_HAS_LOCATION (call
))
5986 SET_EXPR_LOCATION (call
, input_location
);
5987 VEC_safe_push (tree
, heap
, call_stack
, call
);
5988 if (VEC_length (tree
, call_stack
) > (unsigned) max_constexpr_depth
)
5994 pop_cx_call_context (void)
5997 VEC_pop (tree
, call_stack
);
6001 cx_error_context (void)
6003 VEC(tree
,heap
) *r
= NULL
;
6004 if (call_stack_tick
!= last_cx_error_tick
6005 && !VEC_empty (tree
, call_stack
))
6007 last_cx_error_tick
= call_stack_tick
;
6011 /* Subroutine of cxx_eval_constant_expression.
6012 Evaluate the call expression tree T in the context of OLD_CALL expression
6016 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
6017 bool allow_non_constant
, bool addr
,
6018 bool *non_constant_p
)
6020 location_t loc
= EXPR_LOC_OR_HERE (t
);
6021 tree fun
= get_function_named_in_call (t
);
6023 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
6024 constexpr_call
**slot
;
6025 constexpr_call
*entry
;
6028 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6030 /* Might be a constexpr function pointer. */
6031 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
6032 /*addr*/false, non_constant_p
);
6033 if (TREE_CODE (fun
) == ADDR_EXPR
)
6034 fun
= TREE_OPERAND (fun
, 0);
6036 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6038 if (!allow_non_constant
)
6039 error_at (loc
, "expression %qE does not designate a constexpr "
6041 *non_constant_p
= true;
6044 if (DECL_CLONED_FUNCTION_P (fun
))
6045 fun
= DECL_CLONED_FUNCTION (fun
);
6046 if (is_builtin_fn (fun
))
6047 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6048 addr
, non_constant_p
);
6049 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6051 if (!allow_non_constant
)
6053 error_at (loc
, "%qD is not a constexpr function", fun
);
6054 if (DECL_TEMPLATE_INSTANTIATION (fun
)
6055 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
6056 (DECL_TI_TEMPLATE (fun
))))
6057 is_valid_constexpr_fn (fun
, true);
6059 *non_constant_p
= true;
6063 /* Shortcut trivial copy constructor/op=. */
6064 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6066 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6067 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6068 addr
, non_constant_p
);
6071 /* If in direct recursive call, optimize definition search. */
6072 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6073 new_call
.fundef
= old_call
->fundef
;
6076 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6077 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6079 if (!allow_non_constant
)
6080 error_at (loc
, "%qD used before its definition", fun
);
6081 *non_constant_p
= true;
6085 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6086 allow_non_constant
, non_constant_p
);
6087 if (*non_constant_p
)
6090 depth_ok
= push_cx_call_context (t
);
6093 = iterative_hash_template_arg (new_call
.bindings
,
6094 constexpr_fundef_hash (new_call
.fundef
));
6096 /* If we have seen this call before, we are done. */
6097 maybe_initialize_constexpr_call_table ();
6098 slot
= (constexpr_call
**)
6099 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6103 /* We need to keep a pointer to the entry, not just the slot, as the
6104 slot can move in the call to cxx_eval_builtin_function_call. */
6105 *slot
= entry
= ggc_alloc_constexpr_call ();
6108 /* Calls which are in progress have their result set to NULL
6109 so that we can detect circular dependencies. */
6110 else if (entry
->result
== NULL
)
6112 if (!allow_non_constant
)
6113 error ("call has circular dependency");
6114 *non_constant_p
= true;
6115 entry
->result
= result
= error_mark_node
;
6120 if (!allow_non_constant
)
6121 error ("constexpr evaluation depth exceeds maximum of %d (use "
6122 "-fconstexpr-depth= to increase the maximum)",
6123 max_constexpr_depth
);
6124 *non_constant_p
= true;
6125 entry
->result
= result
= error_mark_node
;
6129 result
= entry
->result
;
6130 if (!result
|| (result
== error_mark_node
&& !allow_non_constant
))
6131 result
= (cxx_eval_constant_expression
6132 (&new_call
, new_call
.fundef
->body
,
6133 allow_non_constant
, addr
,
6135 if (result
== error_mark_node
)
6136 *non_constant_p
= true;
6137 if (*non_constant_p
)
6138 entry
->result
= result
= error_mark_node
;
6141 /* If this was a call to initialize an object, set the type of
6142 the CONSTRUCTOR to the type of that object. */
6143 if (DECL_CONSTRUCTOR_P (fun
))
6145 tree ob_arg
= get_nth_callarg (t
, 0);
6146 STRIP_NOPS (ob_arg
);
6147 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6148 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6149 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6152 entry
->result
= result
;
6156 pop_cx_call_context ();
6157 return unshare_expr (result
);
6160 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6163 reduced_constant_expression_p (tree t
)
6165 if (TREE_OVERFLOW_P (t
))
6166 /* Integer overflow makes this not a constant expression. */
6168 /* FIXME are we calling this too much? */
6169 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6172 /* Some expressions may have constant operands but are not constant
6173 themselves, such as 1/0. Call this function (or rather, the macro
6174 following it) to check for that condition.
6176 We only call this in places that require an arithmetic constant, not in
6177 places where we might have a non-constant expression that can be a
6178 component of a constant expression, such as the address of a constexpr
6179 variable that might be dereferenced later. */
6182 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
)
6184 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6186 if (!allow_non_constant
)
6188 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6189 printing the folded constant isn't helpful. */
6190 if (TREE_OVERFLOW_P (t
))
6192 permerror (input_location
, "overflow in constant expression");
6193 /* If we're being permissive (and are in an enforcing
6194 context), consider this constant. */
6195 if (flag_permissive
)
6199 error ("%q+E is not a constant expression", t
);
6201 *non_constant_p
= true;
6203 return *non_constant_p
;
6205 #define VERIFY_CONSTANT(X) \
6207 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6211 /* Subroutine of cxx_eval_constant_expression.
6212 Attempt to reduce the unary expression tree T to a compile time value.
6213 If successful, return the value. Otherwise issue a diagnostic
6214 and return error_mark_node. */
6217 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6218 bool allow_non_constant
, bool addr
,
6219 bool *non_constant_p
)
6222 tree orig_arg
= TREE_OPERAND (t
, 0);
6223 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6224 addr
, non_constant_p
);
6225 VERIFY_CONSTANT (arg
);
6226 if (arg
== orig_arg
)
6228 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6229 VERIFY_CONSTANT (r
);
6233 /* Subroutine of cxx_eval_constant_expression.
6234 Like cxx_eval_unary_expression, except for binary expressions. */
6237 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6238 bool allow_non_constant
, bool addr
,
6239 bool *non_constant_p
)
6242 tree orig_lhs
= TREE_OPERAND (t
, 0);
6243 tree orig_rhs
= TREE_OPERAND (t
, 1);
6245 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6246 allow_non_constant
, addr
,
6248 VERIFY_CONSTANT (lhs
);
6249 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6250 allow_non_constant
, addr
,
6252 VERIFY_CONSTANT (rhs
);
6253 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6255 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6256 VERIFY_CONSTANT (r
);
6260 /* Subroutine of cxx_eval_constant_expression.
6261 Attempt to evaluate condition expressions. Dead branches are not
6265 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6266 bool allow_non_constant
, bool addr
,
6267 bool *non_constant_p
)
6269 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6270 allow_non_constant
, addr
,
6272 VERIFY_CONSTANT (val
);
6273 if (val
== boolean_true_node
)
6274 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6275 allow_non_constant
, addr
,
6277 gcc_assert (val
== boolean_false_node
);
6278 /* Don't VERIFY_CONSTANT here. */
6279 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6280 allow_non_constant
, addr
,
6284 /* Subroutine of cxx_eval_constant_expression.
6285 Attempt to reduce a reference to an array slot. */
6288 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6289 bool allow_non_constant
, bool addr
,
6290 bool *non_constant_p
)
6292 tree oldary
= TREE_OPERAND (t
, 0);
6293 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6294 allow_non_constant
, addr
,
6298 unsigned len
, elem_nchars
= 1;
6299 if (*non_constant_p
)
6301 oldidx
= TREE_OPERAND (t
, 1);
6302 index
= cxx_eval_constant_expression (call
, oldidx
,
6303 allow_non_constant
, false,
6305 VERIFY_CONSTANT (index
);
6306 if (addr
&& ary
== oldary
&& index
== oldidx
)
6309 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
6310 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6311 len
= CONSTRUCTOR_NELTS (ary
);
6314 elem_nchars
= (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (ary
)))
6315 / TYPE_PRECISION (char_type_node
));
6316 len
= (unsigned) TREE_STRING_LENGTH (ary
) / elem_nchars
;
6318 if (compare_tree_int (index
, len
) >= 0)
6320 if (!allow_non_constant
)
6321 error ("array subscript out of bound");
6322 *non_constant_p
= true;
6325 i
= tree_low_cst (index
, 0);
6326 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6327 return VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ary
), i
)->value
;
6328 else if (elem_nchars
== 1)
6329 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
6330 TREE_STRING_POINTER (ary
)[i
]);
6333 tree type
= cv_unqualified (TREE_TYPE (TREE_TYPE (ary
)));
6334 return native_interpret_expr (type
, (const unsigned char *)
6335 TREE_STRING_POINTER (ary
)
6336 + i
* elem_nchars
, elem_nchars
);
6338 /* Don't VERIFY_CONSTANT here. */
6341 /* Subroutine of cxx_eval_constant_expression.
6342 Attempt to reduce a field access of a value of class type. */
6345 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
6346 bool allow_non_constant
, bool addr
,
6347 bool *non_constant_p
)
6349 unsigned HOST_WIDE_INT i
;
6352 tree part
= TREE_OPERAND (t
, 1);
6353 tree orig_whole
= TREE_OPERAND (t
, 0);
6354 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6355 allow_non_constant
, addr
,
6357 if (whole
== orig_whole
)
6360 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
6361 whole
, part
, NULL_TREE
);
6362 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6364 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6366 if (!allow_non_constant
)
6367 error ("%qE is not a constant expression", orig_whole
);
6368 *non_constant_p
= true;
6370 if (*non_constant_p
)
6372 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6377 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
)
6379 /* FIXME Mike Miller wants this to be OK. */
6380 if (!allow_non_constant
)
6381 error ("accessing %qD member instead of initialized %qD member in "
6382 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
6383 *non_constant_p
= true;
6387 return error_mark_node
;
6390 /* Subroutine of cxx_eval_constant_expression.
6391 Attempt to reduce a field access of a value of class type that is
6392 expressed as a BIT_FIELD_REF. */
6395 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
6396 bool allow_non_constant
, bool addr
,
6397 bool *non_constant_p
)
6399 tree orig_whole
= TREE_OPERAND (t
, 0);
6400 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6401 allow_non_constant
, addr
,
6403 tree start
, field
, value
;
6404 unsigned HOST_WIDE_INT i
;
6406 if (whole
== orig_whole
)
6408 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6410 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6412 if (!allow_non_constant
)
6413 error ("%qE is not a constant expression", orig_whole
);
6414 *non_constant_p
= true;
6416 if (*non_constant_p
)
6419 start
= TREE_OPERAND (t
, 2);
6420 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6422 if (bit_position (field
) == start
)
6426 return error_mark_node
;
6429 /* Subroutine of cxx_eval_constant_expression.
6430 Evaluate a short-circuited logical expression T in the context
6431 of a given constexpr CALL. BAILOUT_VALUE is the value for
6432 early return. CONTINUE_VALUE is used here purely for
6433 sanity check purposes. */
6436 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
6437 tree bailout_value
, tree continue_value
,
6438 bool allow_non_constant
, bool addr
,
6439 bool *non_constant_p
)
6442 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6443 allow_non_constant
, addr
,
6445 VERIFY_CONSTANT (lhs
);
6446 if (lhs
== bailout_value
)
6448 gcc_assert (lhs
== continue_value
);
6449 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6450 allow_non_constant
, addr
, non_constant_p
);
6451 VERIFY_CONSTANT (r
);
6455 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6456 CONSTRUCTOR elements to initialize (part of) an object containing that
6457 field. Return a pointer to the constructor_elt corresponding to the
6458 initialization of the field. */
6460 static constructor_elt
*
6461 base_field_constructor_elt (VEC(constructor_elt
,gc
) *v
, tree ref
)
6463 tree aggr
= TREE_OPERAND (ref
, 0);
6464 tree field
= TREE_OPERAND (ref
, 1);
6466 constructor_elt
*ce
;
6468 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
6470 if (TREE_CODE (aggr
) == COMPONENT_REF
)
6472 constructor_elt
*base_ce
6473 = base_field_constructor_elt (v
, aggr
);
6474 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
6477 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6478 if (ce
->index
== field
)
6485 /* Subroutine of cxx_eval_constant_expression.
6486 The expression tree T denotes a C-style array or a C-style
6487 aggregate. Reduce it to a constant expression. */
6490 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
6491 bool allow_non_constant
, bool addr
,
6492 bool *non_constant_p
)
6494 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
6495 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
,
6496 VEC_length (constructor_elt
, v
));
6497 constructor_elt
*ce
;
6499 bool changed
= false;
6500 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
6501 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6503 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
6504 allow_non_constant
, addr
,
6506 /* Don't VERIFY_CONSTANT here. */
6507 if (allow_non_constant
&& *non_constant_p
)
6509 if (elt
!= ce
->value
)
6511 if (TREE_CODE (ce
->index
) == COMPONENT_REF
)
6513 /* This is an initialization of a vfield inside a base
6514 subaggregate that we already initialized; push this
6515 initialization into the previous initialization. */
6516 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
6520 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
6522 if (*non_constant_p
|| !changed
)
6525 VEC_free (constructor_elt
, gc
, n
);
6528 t
= build_constructor (TREE_TYPE (t
), n
);
6529 TREE_CONSTANT (t
) = true;
6533 /* Subroutine of cxx_eval_constant_expression.
6534 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6535 initialization of a non-static data member of array type. Reduce it to a
6538 Note that apart from value-initialization (when VALUE_INIT is true),
6539 this is only intended to support value-initialization and the
6540 initializations done by defaulted constructors for classes with
6541 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6542 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6543 for the copy/move constructor. */
6546 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
6547 bool value_init
, bool allow_non_constant
, bool addr
,
6548 bool *non_constant_p
)
6550 tree elttype
= TREE_TYPE (atype
);
6551 int max
= tree_low_cst (array_type_nelts (atype
), 0);
6552 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
, max
+ 1);
6555 /* For the default constructor, build up a call to the default
6556 constructor of the element type. We only need to handle class types
6557 here, as for a constructor to be constexpr, all members must be
6558 initialized, which for a defaulted default constructor means they must
6559 be of a class type with a constexpr default constructor. */
6564 VEC(tree
,gc
) *argvec
= make_tree_vector ();
6565 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6566 &argvec
, elttype
, LOOKUP_NORMAL
,
6567 tf_warning_or_error
);
6568 release_tree_vector (argvec
);
6569 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
6570 addr
, non_constant_p
);
6573 if (*non_constant_p
&& !allow_non_constant
)
6576 for (i
= 0; i
<= max
; ++i
)
6578 tree idx
= build_int_cst (size_type_node
, i
);
6580 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
6582 /* A multidimensional array; recurse. */
6584 eltinit
= NULL_TREE
;
6586 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6587 tf_warning_or_error
);
6588 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
6589 allow_non_constant
, addr
,
6592 else if (value_init
)
6594 eltinit
= build_value_init (elttype
, tf_warning_or_error
);
6595 eltinit
= cxx_eval_constant_expression
6596 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6598 else if (TREE_CODE (init
) == CONSTRUCTOR
)
6600 /* Initializing an element using the call to the default
6601 constructor we just built above. */
6602 eltinit
= unshare_expr (init
);
6606 /* Copying an element. */
6607 VEC(tree
,gc
) *argvec
;
6608 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6609 (atype
, TREE_TYPE (init
)));
6610 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6611 tf_warning_or_error
);
6612 if (!real_lvalue_p (init
))
6613 eltinit
= move (eltinit
);
6614 argvec
= make_tree_vector ();
6615 VEC_quick_push (tree
, argvec
, eltinit
);
6616 eltinit
= (build_special_member_call
6617 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
6618 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
6619 release_tree_vector (argvec
);
6620 eltinit
= cxx_eval_constant_expression
6621 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6623 if (*non_constant_p
&& !allow_non_constant
)
6625 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
6628 if (!*non_constant_p
)
6630 init
= build_constructor (TREE_TYPE (atype
), n
);
6631 TREE_CONSTANT (init
) = true;
6636 VEC_free (constructor_elt
, gc
, n
);
6641 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
6642 bool allow_non_constant
, bool addr
,
6643 bool *non_constant_p
)
6645 tree atype
= TREE_TYPE (t
);
6646 tree init
= VEC_INIT_EXPR_INIT (t
);
6647 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
6648 VEC_INIT_EXPR_VALUE_INIT (t
),
6649 allow_non_constant
, addr
, non_constant_p
);
6650 if (*non_constant_p
)
6656 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6657 match. We want to be less strict for simple *& folding; if we have a
6658 non-const temporary that we access through a const pointer, that should
6659 work. We handle this here rather than change fold_indirect_ref_1
6660 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6661 don't really make sense outside of constant expression evaluation. Also
6662 we want to allow folding to COMPONENT_REF, which could cause trouble
6663 with TBAA in fold_indirect_ref_1. */
6666 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
6667 bool allow_non_constant
, bool addr
,
6668 bool *non_constant_p
)
6670 tree orig_op0
= TREE_OPERAND (t
, 0);
6671 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
6672 /*addr*/false, non_constant_p
);
6673 tree type
, sub
, subtype
, r
;
6676 /* Don't VERIFY_CONSTANT here. */
6677 if (*non_constant_p
)
6680 type
= TREE_TYPE (t
);
6686 subtype
= TREE_TYPE (sub
);
6687 gcc_assert (POINTER_TYPE_P (subtype
));
6689 if (TREE_CODE (sub
) == ADDR_EXPR
)
6691 tree op
= TREE_OPERAND (sub
, 0);
6692 tree optype
= TREE_TYPE (op
);
6694 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
6696 /* Also handle conversion to an empty base class, which
6697 is represented with a NOP_EXPR. */
6698 else if (!addr
&& is_empty_class (type
)
6699 && CLASS_TYPE_P (optype
)
6700 && DERIVED_FROM_P (type
, optype
))
6705 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6706 else if (RECORD_OR_UNION_TYPE_P (optype
))
6708 tree field
= TYPE_FIELDS (optype
);
6709 for (; field
; field
= DECL_CHAIN (field
))
6710 if (TREE_CODE (field
) == FIELD_DECL
6711 && integer_zerop (byte_position (field
))
6712 && (same_type_ignoring_top_level_qualifiers_p
6713 (TREE_TYPE (field
), type
)))
6715 r
= fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
6720 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
6721 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
6723 tree op00
= TREE_OPERAND (sub
, 0);
6724 tree op01
= TREE_OPERAND (sub
, 1);
6727 if (TREE_CODE (op00
) == ADDR_EXPR
)
6730 op00
= TREE_OPERAND (op00
, 0);
6731 op00type
= TREE_TYPE (op00
);
6733 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6734 if (RECORD_OR_UNION_TYPE_P (op00type
))
6736 tree field
= TYPE_FIELDS (op00type
);
6737 for (; field
; field
= DECL_CHAIN (field
))
6738 if (TREE_CODE (field
) == FIELD_DECL
6739 && tree_int_cst_equal (byte_position (field
), op01
)
6740 && (same_type_ignoring_top_level_qualifiers_p
6741 (TREE_TYPE (field
), type
)))
6743 r
= fold_build3 (COMPONENT_REF
, type
, op00
,
6751 /* Let build_fold_indirect_ref handle the cases it does fine with. */
6753 r
= build_fold_indirect_ref (op0
);
6754 if (TREE_CODE (r
) != INDIRECT_REF
)
6755 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
6756 addr
, non_constant_p
);
6757 else if (TREE_CODE (sub
) == ADDR_EXPR
6758 || TREE_CODE (sub
) == POINTER_PLUS_EXPR
)
6760 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6761 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
6762 /* FIXME Mike Miller wants this to be OK. */
6763 if (!allow_non_constant
)
6764 error ("accessing value of %qE through a %qT glvalue in a "
6765 "constant expression", build_fold_indirect_ref (sub
),
6767 *non_constant_p
= true;
6771 /* If we're pulling out the value of an empty base, make sure
6772 that the whole object is constant and then return an empty
6776 VERIFY_CONSTANT (r
);
6777 r
= build_constructor (TREE_TYPE (t
), NULL
);
6778 TREE_CONSTANT (r
) = true;
6781 if (TREE_CODE (r
) == INDIRECT_REF
&& TREE_OPERAND (r
, 0) == orig_op0
)
6786 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
6787 Shared between potential_constant_expression and
6788 cxx_eval_constant_expression. */
6791 non_const_var_error (tree r
)
6793 tree type
= TREE_TYPE (r
);
6794 error ("the value of %qD is not usable in a constant "
6796 /* Avoid error cascade. */
6797 if (DECL_INITIAL (r
) == error_mark_node
)
6799 if (DECL_DECLARED_CONSTEXPR_P (r
))
6800 inform (DECL_SOURCE_LOCATION (r
),
6801 "%qD used in its own initializer", r
);
6802 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6804 if (!CP_TYPE_CONST_P (type
))
6805 inform (DECL_SOURCE_LOCATION (r
),
6806 "%q#D is not const", r
);
6807 else if (CP_TYPE_VOLATILE_P (type
))
6808 inform (DECL_SOURCE_LOCATION (r
),
6809 "%q#D is volatile", r
);
6810 else if (!DECL_INITIAL (r
))
6811 inform (DECL_SOURCE_LOCATION (r
),
6812 "%qD was not initialized with a constant "
6819 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
6820 inform (DECL_SOURCE_LOCATION (r
),
6821 "%qD was not declared %<constexpr%>", r
);
6823 inform (DECL_SOURCE_LOCATION (r
),
6824 "%qD does not have integral or enumeration type",
6829 /* Attempt to reduce the expression T to a constant value.
6830 On failure, issue diagnostic and return error_mark_node. */
6831 /* FIXME unify with c_fully_fold */
6834 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
6835 bool allow_non_constant
, bool addr
,
6836 bool *non_constant_p
)
6840 if (t
== error_mark_node
)
6842 *non_constant_p
= true;
6845 if (CONSTANT_CLASS_P (t
))
6847 if (TREE_CODE (t
) == PTRMEM_CST
)
6848 t
= cplus_expand_constant (t
);
6851 if (TREE_CODE (t
) != NOP_EXPR
6852 && reduced_constant_expression_p (t
))
6855 switch (TREE_CODE (t
))
6860 /* else fall through. */
6862 r
= integral_constant_value (t
);
6863 if (TREE_CODE (r
) == TARGET_EXPR
6864 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
6865 r
= TARGET_EXPR_INITIAL (r
);
6868 if (!allow_non_constant
)
6869 non_const_var_error (r
);
6870 *non_constant_p
= true;
6879 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
6880 r
= lookup_parameter_binding (call
, t
);
6882 /* Defer in case this is only used for its type. */;
6885 if (!allow_non_constant
)
6886 error ("%qE is not a constant expression", t
);
6887 *non_constant_p
= true;
6892 case AGGR_INIT_EXPR
:
6893 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
6899 /* Pass false for 'addr' because these codes indicate
6900 initialization of a temporary. */
6901 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6902 allow_non_constant
, false,
6904 if (!*non_constant_p
)
6905 /* Adjust the type of the result to the type of the temporary. */
6906 r
= adjust_temp_type (TREE_TYPE (t
), r
);
6910 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6911 allow_non_constant
, addr
,
6916 case NON_LVALUE_EXPR
:
6917 case TRY_CATCH_EXPR
:
6918 case CLEANUP_POINT_EXPR
:
6919 case MUST_NOT_THROW_EXPR
:
6921 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6922 allow_non_constant
, addr
,
6926 /* These differ from cxx_eval_unary_expression in that this doesn't
6927 check for a constant operand or result; an address can be
6928 constant without its operand being, and vice versa. */
6930 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
6936 tree oldop
= TREE_OPERAND (t
, 0);
6937 tree op
= cxx_eval_constant_expression (call
, oldop
,
6941 /* Don't VERIFY_CONSTANT here. */
6942 if (*non_constant_p
)
6944 /* This function does more aggressive folding than fold itself. */
6945 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
6946 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
6954 case FIX_TRUNC_EXPR
:
6959 case TRUTH_NOT_EXPR
:
6960 case FIXED_CONVERT_EXPR
:
6961 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
6967 /* check_return_expr sometimes wraps a TARGET_EXPR in a
6968 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
6969 introduced by build_call_a. */
6970 tree op0
= TREE_OPERAND (t
, 0);
6971 tree op1
= TREE_OPERAND (t
, 1);
6973 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
6974 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
6975 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
6976 addr
, non_constant_p
);
6979 /* Check that the LHS is constant and then discard it. */
6980 cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
6981 false, non_constant_p
);
6982 r
= cxx_eval_constant_expression (call
, op1
, allow_non_constant
,
6983 addr
, non_constant_p
);
6988 case POINTER_PLUS_EXPR
:
6992 case TRUNC_DIV_EXPR
:
6994 case FLOOR_DIV_EXPR
:
6995 case ROUND_DIV_EXPR
:
6996 case TRUNC_MOD_EXPR
:
6998 case ROUND_MOD_EXPR
:
7000 case EXACT_DIV_EXPR
:
7010 case TRUTH_XOR_EXPR
:
7017 case UNORDERED_EXPR
:
7026 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
7030 /* fold can introduce non-IF versions of these; still treat them as
7031 short-circuiting. */
7032 case TRUTH_AND_EXPR
:
7033 case TRUTH_ANDIF_EXPR
:
7034 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
7036 allow_non_constant
, addr
,
7041 case TRUTH_ORIF_EXPR
:
7042 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
7044 allow_non_constant
, addr
,
7049 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
7054 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
7059 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
7065 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
7070 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
7075 /* We can get this in a defaulted constructor for a class with a
7076 non-static data member of array type. Either the initializer will
7077 be NULL, meaning default-initialization, or it will be an lvalue
7078 or xvalue of the same type, meaning direct-initialization from the
7079 corresponding member. */
7080 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
7085 case VIEW_CONVERT_EXPR
:
7088 tree oldop
= TREE_OPERAND (t
, 0);
7090 tree to
= TREE_TYPE (t
);
7091 tree source
= TREE_TYPE (op
);
7092 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (to
)
7093 && !(TREE_CODE (op
) == COMPONENT_REF
7094 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op
, 0)))))
7096 if (!allow_non_constant
)
7097 error ("conversion of expression %qE of pointer type "
7098 "cannot yield a constant expression", op
);
7099 *non_constant_p
= true;
7102 op
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7103 allow_non_constant
, addr
,
7105 if (*non_constant_p
)
7108 /* We didn't fold at the top so we could check for ptr-int
7111 r
= fold_build1 (TREE_CODE (t
), to
, op
);
7112 /* Conversion of an out-of-range value has implementation-defined
7113 behavior; the language considers it different from arithmetic
7114 overflow, which is undefined. */
7115 if (TREE_OVERFLOW_P (r
) && !TREE_OVERFLOW_P (op
))
7116 TREE_OVERFLOW (r
) = false;
7120 case EMPTY_CLASS_EXPR
:
7121 /* This is good enough for a function argument that might not get
7122 used, and they can't do anything with it, so just return it. */
7126 case DYNAMIC_CAST_EXPR
:
7127 case PSEUDO_DTOR_EXPR
:
7128 case PREINCREMENT_EXPR
:
7129 case POSTINCREMENT_EXPR
:
7130 case PREDECREMENT_EXPR
:
7131 case POSTDECREMENT_EXPR
:
7135 case VEC_DELETE_EXPR
:
7139 /* GCC internal stuff. */
7142 case WITH_CLEANUP_EXPR
:
7143 case STATEMENT_LIST
:
7145 case NON_DEPENDENT_EXPR
:
7149 if (!allow_non_constant
)
7150 error_at (EXPR_LOC_OR_HERE (t
),
7151 "expression %qE is not a constant-expression", t
);
7152 *non_constant_p
= true;
7156 internal_error ("unexpected expression %qE of kind %s", t
,
7157 tree_code_name
[TREE_CODE (t
)]);
7158 *non_constant_p
= true;
7162 if (r
== error_mark_node
)
7163 *non_constant_p
= true;
7165 if (*non_constant_p
)
7172 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
7174 bool non_constant_p
= false;
7175 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
7176 false, &non_constant_p
);
7178 verify_constant (r
, allow_non_constant
, &non_constant_p
);
7180 if (non_constant_p
&& !allow_non_constant
)
7181 return error_mark_node
;
7182 else if (non_constant_p
&& TREE_CONSTANT (t
))
7184 /* This isn't actually constant, so unset TREE_CONSTANT. */
7185 if (EXPR_P (t
) || TREE_CODE (t
) == CONSTRUCTOR
)
7188 r
= build_nop (TREE_TYPE (t
), t
);
7189 TREE_CONSTANT (r
) = false;
7192 else if (non_constant_p
|| r
== t
)
7194 else if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
7196 if (TREE_CODE (t
) == TARGET_EXPR
7197 && TARGET_EXPR_INITIAL (t
) == r
)
7201 r
= get_target_expr (r
);
7202 TREE_CONSTANT (r
) = true;
7210 /* Returns true if T is a valid subexpression of a constant expression,
7211 even if it isn't itself a constant expression. */
7214 is_sub_constant_expr (tree t
)
7216 bool non_constant_p
= false;
7217 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
);
7218 return !non_constant_p
;
7221 /* If T represents a constant expression returns its reduced value.
7222 Otherwise return error_mark_node. If T is dependent, then
7226 cxx_constant_value (tree t
)
7228 return cxx_eval_outermost_constant_expr (t
, false);
7231 /* If T is a constant expression, returns its reduced value.
7232 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7233 Otherwise, returns a version of T without TREE_CONSTANT. */
7236 maybe_constant_value (tree t
)
7240 if (type_dependent_expression_p (t
)
7241 || type_unknown_p (t
)
7242 || !potential_constant_expression (t
)
7243 || value_dependent_expression_p (t
))
7246 r
= cxx_eval_outermost_constant_expr (t
, true);
7247 #ifdef ENABLE_CHECKING
7248 /* cp_tree_equal looks through NOPs, so allow them. */
7250 || CONVERT_EXPR_P (t
)
7251 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
7252 || !cp_tree_equal (r
, t
));
7257 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7258 than wrapped in a TARGET_EXPR. */
7261 maybe_constant_init (tree t
)
7263 t
= maybe_constant_value (t
);
7264 if (TREE_CODE (t
) == TARGET_EXPR
)
7266 tree init
= TARGET_EXPR_INITIAL (t
);
7267 if (TREE_CODE (init
) == CONSTRUCTOR
7268 && TREE_CONSTANT (init
))
7275 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7276 /* Return true if the object referred to by REF has automatic or thread
7279 enum { ck_ok
, ck_bad
, ck_unknown
};
7281 check_automatic_or_tls (tree ref
)
7283 enum machine_mode mode
;
7284 HOST_WIDE_INT bitsize
, bitpos
;
7286 int volatilep
= 0, unsignedp
= 0;
7287 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
7288 &mode
, &unsignedp
, &volatilep
, false);
7291 /* If there isn't a decl in the middle, we don't know the linkage here,
7292 and this isn't a constant expression anyway. */
7295 dk
= decl_storage_duration (decl
);
7296 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
7300 /* Return true if the DECL designates a builtin function that is
7301 morally constexpr, in the sense that its parameter types and
7302 return type are literal types and the compiler is allowed to
7303 fold its invocations. */
7306 morally_constexpr_builtin_function_p (tree decl
)
7308 tree funtype
= TREE_TYPE (decl
);
7311 if (!is_builtin_fn (decl
))
7313 if (!literal_type_p (TREE_TYPE (funtype
)))
7315 for (t
= TYPE_ARG_TYPES (funtype
); t
!= NULL
; t
= TREE_CHAIN (t
))
7317 if (t
== void_list_node
)
7319 if (!literal_type_p (TREE_VALUE (t
)))
7322 /* We assume no varargs builtins are suitable. */
7326 /* Return true if T denotes a potentially constant expression. Issue
7327 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7328 an lvalue-rvalue conversion is implied.
7330 C++0x [expr.const] used to say
7332 6 An expression is a potential constant expression if it is
7333 a constant expression where all occurences of function
7334 parameters are replaced by arbitrary constant expressions
7335 of the appropriate type.
7337 2 A conditional expression is a constant expression unless it
7338 involves one of the following as a potentially evaluated
7339 subexpression (3.2), but subexpressions of logical AND (5.14),
7340 logical OR (5.15), and conditional (5.16) operations that are
7341 not evaluated are not considered. */
7344 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
7346 enum { any
= false, rval
= true };
7350 /* C++98 has different rules for the form of a constant expression that
7351 are enforced in the parser, so we can assume that anything that gets
7352 this far is suitable. */
7353 if (cxx_dialect
< cxx0x
)
7356 if (t
== error_mark_node
)
7360 if (TREE_THIS_VOLATILE (t
))
7362 if (flags
& tf_error
)
7363 error ("expression %qE has side-effects", t
);
7366 if (CONSTANT_CLASS_P (t
))
7368 if (TREE_OVERFLOW (t
))
7370 if (flags
& tf_error
)
7372 permerror (EXPR_LOC_OR_HERE (t
),
7373 "overflow in constant expression");
7374 if (flag_permissive
)
7382 switch (TREE_CODE (t
))
7388 case TEMPLATE_ID_EXPR
:
7395 case TEMPLATE_PARM_INDEX
:
7397 case IDENTIFIER_NODE
:
7401 /* -- this (5.1) unless it appears as the postfix-expression in a
7402 class member access expression, including the result of the
7403 implicit transformation in the body of the non-static
7404 member function (9.3.1); */
7405 /* FIXME this restriction seems pointless since the standard dropped
7406 "potential constant expression". */
7407 if (is_this_parameter (t
))
7409 if (flags
& tf_error
)
7410 error ("%qE is not a potential constant expression", t
);
7415 case AGGR_INIT_EXPR
:
7417 /* -- an invocation of a function other than a constexpr function
7418 or a constexpr constructor. */
7420 tree fun
= get_function_named_in_call (t
);
7421 const int nargs
= call_expr_nargs (t
);
7424 if (is_overloaded_fn (fun
))
7426 if (TREE_CODE (fun
) == FUNCTION_DECL
)
7428 if (builtin_valid_in_constant_expr_p (fun
))
7430 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
7431 && !morally_constexpr_builtin_function_p (fun
))
7433 if (flags
& tf_error
)
7434 error ("%qD is not %<constexpr%>", fun
);
7437 /* A call to a non-static member function takes the address
7438 of the object as the first argument. But in a constant
7439 expression the address will be folded away, so look
7441 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
7442 && !DECL_CONSTRUCTOR_P (fun
))
7444 tree x
= get_nth_callarg (t
, 0);
7445 if (is_this_parameter (x
))
7447 else if (!potential_constant_expression_1 (x
, rval
, flags
))
7449 if (flags
& tf_error
)
7450 error ("object argument is not a potential "
7451 "constant expression");
7458 fun
= get_first_fn (fun
);
7459 /* Skip initial arguments to base constructors. */
7460 if (DECL_BASE_CONSTRUCTOR_P (fun
))
7461 i
= num_artificial_parms_for (fun
);
7462 fun
= DECL_ORIGIN (fun
);
7466 if (potential_constant_expression_1 (fun
, rval
, flags
))
7467 /* Might end up being a constant function pointer. */;
7470 if (flags
& tf_error
)
7471 error ("%qE is not a function name", fun
);
7475 for (; i
< nargs
; ++i
)
7477 tree x
= get_nth_callarg (t
, i
);
7478 if (!potential_constant_expression_1 (x
, rval
, flags
))
7480 if (flags
& tf_error
)
7481 error ("argument in position %qP is not a "
7482 "potential constant expression", i
);
7489 case NON_LVALUE_EXPR
:
7490 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7491 -- an lvalue of integral type that refers to a non-volatile
7492 const variable or static data member initialized with
7493 constant expressions, or
7495 -- an lvalue of literal type that refers to non-volatile
7496 object defined with constexpr, or that refers to a
7497 sub-object of such an object; */
7498 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7501 if (want_rval
&& !decl_constant_var_p (t
)
7502 && !dependent_type_p (TREE_TYPE (t
)))
7504 if (flags
& tf_error
)
7505 non_const_var_error (t
);
7512 case VIEW_CONVERT_EXPR
:
7513 /* -- an array-to-pointer conversion that is applied to an lvalue
7514 that designates an object with thread or automatic storage
7515 duration; FIXME not implemented as it breaks constexpr arrays;
7516 need to fix the standard
7517 -- a type conversion from a pointer or pointer-to-member type
7518 to a literal type. */
7520 tree from
= TREE_OPERAND (t
, 0);
7521 tree source
= TREE_TYPE (from
);
7522 tree target
= TREE_TYPE (t
);
7523 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (target
)
7524 && !(TREE_CODE (from
) == COMPONENT_REF
7525 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from
, 0)))))
7527 if (flags
& tf_error
)
7528 error ("conversion of expression %qE of pointer type "
7529 "cannot yield a constant expression", from
);
7532 return (potential_constant_expression_1
7533 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
7537 /* -- a unary operator & that is applied to an lvalue that
7538 designates an object with thread or automatic storage
7540 t
= TREE_OPERAND (t
, 0);
7542 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7543 any checking here, as we might dereference the pointer later. If
7544 we remove this code, also remove check_automatic_or_tls. */
7545 i
= check_automatic_or_tls (t
);
7550 if (flags
& tf_error
)
7551 error ("address-of an object %qE with thread local or "
7552 "automatic storage is not a constant expression", t
);
7556 return potential_constant_expression_1 (t
, any
, flags
);
7562 /* -- a class member access unless its postfix-expression is
7563 of literal type or of pointer to literal type. */
7564 /* This test would be redundant, as it follows from the
7565 postfix-expression being a potential constant expression. */
7566 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7569 case EXPR_PACK_EXPANSION
:
7570 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
7575 tree x
= TREE_OPERAND (t
, 0);
7577 if (is_this_parameter (x
))
7579 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)) && want_rval
)
7581 if (flags
& tf_error
)
7582 sorry ("use of the value of the object being constructed "
7583 "in a constant expression");
7588 return potential_constant_expression_1 (x
, rval
, flags
);
7592 case DYNAMIC_CAST_EXPR
:
7593 case PSEUDO_DTOR_EXPR
:
7594 case PREINCREMENT_EXPR
:
7595 case POSTINCREMENT_EXPR
:
7596 case PREDECREMENT_EXPR
:
7597 case POSTDECREMENT_EXPR
:
7601 case VEC_DELETE_EXPR
:
7605 /* GCC internal stuff. */
7608 case WITH_CLEANUP_EXPR
:
7609 case CLEANUP_POINT_EXPR
:
7610 case MUST_NOT_THROW_EXPR
:
7611 case TRY_CATCH_EXPR
:
7612 case STATEMENT_LIST
:
7613 /* Don't bother trying to define a subset of statement-expressions to
7614 be constant-expressions, at least for now. */
7618 if (flags
& tf_error
)
7619 error ("expression %qE is not a constant-expression", t
);
7623 /* -- a typeid expression whose operand is of polymorphic
7626 tree e
= TREE_OPERAND (t
, 0);
7627 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
7628 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
7630 if (flags
& tf_error
)
7631 error ("typeid-expression is not a constant expression "
7632 "because %qE is of polymorphic type", e
);
7639 /* -- a subtraction where both operands are pointers. */
7640 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7641 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7643 if (flags
& tf_error
)
7644 error ("difference of two pointer expressions is not "
7645 "a constant expression");
7657 /* -- a relational or equality operator where at least
7658 one of the operands is a pointer. */
7659 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7660 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7662 if (flags
& tf_error
)
7663 error ("pointer comparison expression is not a "
7664 "constant expression");
7674 case FIX_TRUNC_EXPR
:
7679 case TRUTH_NOT_EXPR
:
7680 case FIXED_CONVERT_EXPR
:
7681 case UNARY_PLUS_EXPR
:
7682 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
7686 case CONST_CAST_EXPR
:
7687 case STATIC_CAST_EXPR
:
7688 case REINTERPRET_CAST_EXPR
:
7689 return (potential_constant_expression_1
7690 (TREE_OPERAND (t
, 0),
7691 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
7694 case NON_DEPENDENT_EXPR
:
7695 /* For convenience. */
7697 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7701 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7706 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7711 VEC(constructor_elt
, gc
) *v
= CONSTRUCTOR_ELTS (t
);
7712 constructor_elt
*ce
;
7713 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
7714 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
7721 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
7722 || DECL_P (TREE_PURPOSE (t
)));
7723 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
7726 if (TREE_CHAIN (t
) == NULL_TREE
)
7728 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
7732 case TRUNC_DIV_EXPR
:
7734 case FLOOR_DIV_EXPR
:
7735 case ROUND_DIV_EXPR
:
7736 case TRUNC_MOD_EXPR
:
7738 case ROUND_MOD_EXPR
:
7740 tree denom
= TREE_OPERAND (t
, 1);
7741 /* We can't call maybe_constant_value on an expression
7742 that hasn't been through fold_non_dependent_expr yet. */
7743 if (!processing_template_decl
)
7744 denom
= maybe_constant_value (denom
);
7745 if (integer_zerop (denom
))
7747 if (flags
& tf_error
)
7748 error ("division by zero is not a constant-expression");
7760 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7761 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7762 introduced by build_call_a. */
7763 tree op0
= TREE_OPERAND (t
, 0);
7764 tree op1
= TREE_OPERAND (t
, 1);
7766 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7767 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7768 return potential_constant_expression_1 (op0
, want_rval
, flags
);
7773 /* If the first operand is the non-short-circuit constant, look at
7774 the second operand; otherwise we only care about the first one for
7776 case TRUTH_AND_EXPR
:
7777 case TRUTH_ANDIF_EXPR
:
7778 tmp
= boolean_true_node
;
7781 case TRUTH_ORIF_EXPR
:
7782 tmp
= boolean_false_node
;
7784 if (TREE_OPERAND (t
, 0) == tmp
)
7785 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
7787 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7791 case POINTER_PLUS_EXPR
:
7793 case EXACT_DIV_EXPR
:
7803 case TRUTH_XOR_EXPR
:
7804 case UNORDERED_EXPR
:
7816 case ARRAY_RANGE_REF
:
7820 for (i
= 0; i
< 2; ++i
)
7821 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7828 /* If the condition is a known constant, we know which of the legs we
7829 care about; otherwise we only require that the condition and
7830 either of the legs be potentially constant. */
7831 tmp
= TREE_OPERAND (t
, 0);
7832 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
7834 else if (tmp
== boolean_true_node
)
7835 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7837 else if (tmp
== boolean_false_node
)
7838 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
7840 for (i
= 1; i
< 3; ++i
)
7841 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7842 want_rval
, tf_none
))
7844 if (flags
& tf_error
)
7845 error ("expression %qE is not a constant-expression", t
);
7849 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
7851 if (flags
& tf_error
)
7853 error ("non-constant array initialization");
7854 diagnose_non_constexpr_vec_init (t
);
7859 sorry ("unexpected ast of kind %s", tree_code_name
[TREE_CODE (t
)]);
7865 /* The main entry point to the above. */
7868 potential_constant_expression (tree t
)
7870 return potential_constant_expression_1 (t
, false, tf_none
);
7873 /* As above, but require a constant rvalue. */
7876 potential_rvalue_constant_expression (tree t
)
7878 return potential_constant_expression_1 (t
, true, tf_none
);
7881 /* Like above, but complain about non-constant expressions. */
7884 require_potential_constant_expression (tree t
)
7886 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
7889 /* Cross product of the above. */
7892 require_potential_rvalue_constant_expression (tree t
)
7894 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
7897 /* Constructor for a lambda expression. */
7900 build_lambda_expr (void)
7902 tree lambda
= make_node (LAMBDA_EXPR
);
7903 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
7904 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
7905 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
7906 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
7907 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
7911 /* Create the closure object for a LAMBDA_EXPR. */
7914 build_lambda_object (tree lambda_expr
)
7916 /* Build aggregate constructor call.
7917 - cp_parser_braced_list
7918 - cp_parser_functional_cast */
7919 VEC(constructor_elt
,gc
) *elts
= NULL
;
7920 tree node
, expr
, type
;
7921 location_t saved_loc
;
7923 if (processing_template_decl
)
7926 /* Make sure any error messages refer to the lambda-introducer. */
7927 saved_loc
= input_location
;
7928 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
7930 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
7932 node
= TREE_CHAIN (node
))
7934 tree field
= TREE_PURPOSE (node
);
7935 tree val
= TREE_VALUE (node
);
7937 if (field
== error_mark_node
)
7939 expr
= error_mark_node
;
7946 /* Mere mortals can't copy arrays with aggregate initialization, so
7947 do some magic to make it work here. */
7948 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
7949 val
= build_array_copy (val
);
7950 else if (DECL_NORMAL_CAPTURE_P (field
)
7951 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
7953 /* "the entities that are captured by copy are used to
7954 direct-initialize each corresponding non-static data
7955 member of the resulting closure object."
7957 There's normally no way to express direct-initialization
7958 from an element of a CONSTRUCTOR, so we build up a special
7959 TARGET_EXPR to bypass the usual copy-initialization. */
7960 val
= force_rvalue (val
);
7961 if (TREE_CODE (val
) == TARGET_EXPR
)
7962 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
7965 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
7968 expr
= build_constructor (init_list_type_node
, elts
);
7969 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
7971 /* N2927: "[The closure] class type is not an aggregate."
7972 But we briefly treat it as an aggregate to make this simpler. */
7973 type
= TREE_TYPE (lambda_expr
);
7974 CLASSTYPE_NON_AGGREGATE (type
) = 0;
7975 expr
= finish_compound_literal (type
, expr
, tf_warning_or_error
);
7976 CLASSTYPE_NON_AGGREGATE (type
) = 1;
7979 input_location
= saved_loc
;
7983 /* Return an initialized RECORD_TYPE for LAMBDA.
7984 LAMBDA must have its explicit captures already. */
7987 begin_lambda_type (tree lambda
)
7992 /* Unique name. This is just like an unnamed class, but we cannot use
7993 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
7995 name
= make_lambda_name ();
7997 /* Create the new RECORD_TYPE for this lambda. */
7998 type
= xref_tag (/*tag_code=*/record_type
,
8000 /*scope=*/ts_within_enclosing_non_class
,
8001 /*template_header_p=*/false);
8004 /* Designate it as a struct so that we can use aggregate initialization. */
8005 CLASSTYPE_DECLARED_CLASS (type
) = false;
8007 /* Clear base types. */
8008 xref_basetypes (type
, /*bases=*/NULL_TREE
);
8010 /* Start the class. */
8011 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
8013 /* Cross-reference the expression and the type. */
8014 TREE_TYPE (lambda
) = type
;
8015 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
8020 /* Returns the type to use for the return type of the operator() of a
8024 lambda_return_type (tree expr
)
8027 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
8029 warning (0, "cannot deduce lambda return type from a braced-init-list");
8030 return void_type_node
;
8032 if (type_dependent_expression_p (expr
))
8034 type
= cxx_make_type (DECLTYPE_TYPE
);
8035 DECLTYPE_TYPE_EXPR (type
) = expr
;
8036 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
8037 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8040 type
= type_decays_to (unlowered_expr_type (expr
));
8044 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8048 lambda_function (tree lambda
)
8051 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
8052 type
= TREE_TYPE (lambda
);
8055 gcc_assert (LAMBDA_TYPE_P (type
));
8056 /* Don't let debug_tree cause instantiation. */
8057 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
8059 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
8060 /*protect=*/0, /*want_type=*/false);
8062 lambda
= BASELINK_FUNCTIONS (lambda
);
8066 /* Returns the type to use for the FIELD_DECL corresponding to the
8068 The caller should add REFERENCE_TYPE for capture by reference. */
8071 lambda_capture_field_type (tree expr
)
8074 if (type_dependent_expression_p (expr
))
8076 type
= cxx_make_type (DECLTYPE_TYPE
);
8077 DECLTYPE_TYPE_EXPR (type
) = expr
;
8078 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
8079 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8082 type
= non_reference (unlowered_expr_type (expr
));
8086 /* Recompute the return type for LAMBDA with body of the form:
8087 { return EXPR ; } */
8090 apply_lambda_return_type (tree lambda
, tree return_type
)
8092 tree fco
= lambda_function (lambda
);
8095 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
8097 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
8098 it would interfere with instantiating the closure type. */
8099 if (dependent_type_p (return_type
))
8101 if (return_type
== error_mark_node
)
8104 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8105 TREE_TYPE (METHOD_TYPE) == return-type */
8106 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
8108 result
= DECL_RESULT (fco
);
8109 if (result
== NULL_TREE
)
8112 /* We already have a DECL_RESULT from start_preparsed_function.
8113 Now we need to redo the work it and allocate_struct_function
8114 did to reflect the new type. */
8115 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
8116 TYPE_MAIN_VARIANT (return_type
));
8117 DECL_ARTIFICIAL (result
) = 1;
8118 DECL_IGNORED_P (result
) = 1;
8119 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
8122 DECL_RESULT (fco
) = result
;
8124 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
8126 #ifdef PCC_STATIC_STRUCT_RETURN
8127 cfun
->returns_pcc_struct
= 1;
8129 cfun
->returns_struct
= 1;
8134 /* DECL is a local variable or parameter from the surrounding scope of a
8135 lambda-expression. Returns the decltype for a use of the capture field
8136 for DECL even if it hasn't been captured yet. */
8139 capture_decltype (tree decl
)
8141 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8142 /* FIXME do lookup instead of list walk? */
8143 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
8147 type
= TREE_TYPE (TREE_PURPOSE (cap
));
8149 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
8152 error ("%qD is not captured", decl
);
8153 return error_mark_node
;
8156 type
= TREE_TYPE (decl
);
8157 if (TREE_CODE (type
) == REFERENCE_TYPE
8158 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
8159 type
= TREE_TYPE (type
);
8162 case CPLD_REFERENCE
:
8163 type
= TREE_TYPE (decl
);
8164 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8165 type
= build_reference_type (TREE_TYPE (decl
));
8172 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8174 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
8175 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
8177 type
= build_reference_type (type
);
8182 /* From an ID and INITIALIZER, create a capture (by reference if
8183 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8187 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
8188 bool explicit_init_p
)
8193 type
= lambda_capture_field_type (initializer
);
8196 type
= build_reference_type (type
);
8197 if (!real_lvalue_p (initializer
))
8198 error ("cannot capture %qE by reference", initializer
);
8201 /* Make member variable. */
8202 member
= build_lang_decl (FIELD_DECL
, id
, type
);
8203 if (!explicit_init_p
)
8204 /* Normal captures are invisible to name lookup but uses are replaced
8205 with references to the capture field; we implement this by only
8206 really making them invisible in unevaluated context; see
8207 qualify_lookup. For now, let's make explicitly initialized captures
8209 DECL_NORMAL_CAPTURE_P (member
) = true;
8211 /* Add it to the appropriate closure class if we've started it. */
8212 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
8213 finish_member_declaration (member
);
8215 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
8216 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
8218 if (id
== get_identifier ("__this"))
8220 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
8221 error ("already captured %<this%> in lambda expression");
8222 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
8228 /* Register all the capture members on the list CAPTURES, which is the
8229 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8231 void register_capture_members (tree captures
)
8235 register_capture_members (TREE_CHAIN (captures
));
8236 finish_member_declaration (TREE_PURPOSE (captures
));
8240 /* Given a FIELD_DECL decl belonging to a closure type, return a
8241 COMPONENT_REF of it relative to the 'this' parameter of the op() for
8245 thisify_lambda_field (tree decl
)
8247 tree context
= lambda_function (DECL_CONTEXT (decl
));
8248 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
8250 tf_warning_or_error
);
8251 return finish_non_static_data_member (decl
, object
,
8252 /*qualifying_scope*/NULL_TREE
);
8255 /* Similar to add_capture, except this works on a stack of nested lambdas.
8256 BY_REFERENCE_P in this case is derived from the default capture mode.
8257 Returns the capture for the lambda at the bottom of the stack. */
8260 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
8262 bool this_capture_p
= (id
== get_identifier ("__this"));
8264 tree member
= NULL_TREE
;
8266 tree saved_class_type
= current_class_type
;
8270 for (node
= lambda_stack
;
8272 node
= TREE_CHAIN (node
))
8274 tree lambda
= TREE_VALUE (node
);
8276 current_class_type
= TREE_TYPE (lambda
);
8277 member
= add_capture (lambda
,
8282 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
8283 == CPLD_REFERENCE
)),
8284 /*explicit_init_p=*/false);
8285 initializer
= thisify_lambda_field (member
);
8288 current_class_type
= saved_class_type
;
8293 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8294 INDIRECT_REF, possibly adding it through default capturing. */
8297 lambda_expr_this_capture (tree lambda
)
8301 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8303 /* Try to default capture 'this' if we can. */
8305 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
8307 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
8308 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
8309 tree init
= NULL_TREE
;
8311 /* If we are in a lambda function, we can move out until we hit:
8312 1. a non-lambda function,
8313 2. a lambda function capturing 'this', or
8314 3. a non-default capturing lambda function. */
8315 while (LAMBDA_FUNCTION_P (containing_function
))
8318 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
8320 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
8322 /* An outer lambda has already captured 'this'. */
8323 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8324 init
= thisify_lambda_field (cap
);
8328 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
8329 /* An outer lambda won't let us capture 'this'. */
8332 lambda_stack
= tree_cons (NULL_TREE
,
8336 containing_function
= decl_function_context (containing_function
);
8339 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
8340 && !LAMBDA_FUNCTION_P (containing_function
))
8341 /* First parameter is 'this'. */
8342 init
= DECL_ARGUMENTS (containing_function
);
8345 this_capture
= add_default_capture (lambda_stack
,
8346 /*id=*/get_identifier ("__this"),
8352 error ("%<this%> was not captured for this lambda function");
8353 result
= error_mark_node
;
8357 /* To make sure that current_class_ref is for the lambda. */
8358 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
8360 result
= finish_non_static_data_member (this_capture
,
8362 /*qualifying_scope=*/NULL_TREE
);
8364 /* If 'this' is captured, each use of 'this' is transformed into an
8365 access to the corresponding unnamed data member of the closure
8366 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8367 ensures that the transformed expression is an rvalue. ] */
8368 result
= rvalue (result
);
8374 /* Returns the method basetype of the innermost non-lambda function, or
8375 NULL_TREE if none. */
8378 nonlambda_method_basetype (void)
8381 if (!current_class_ref
)
8384 type
= current_class_type
;
8385 if (!LAMBDA_TYPE_P (type
))
8388 /* Find the nearest enclosing non-lambda function. */
8389 fn
= TYPE_NAME (type
);
8391 fn
= decl_function_context (fn
);
8392 while (fn
&& LAMBDA_FUNCTION_P (fn
));
8394 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
8397 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
8400 /* If the closure TYPE has a static op(), also add a conversion to function
8404 maybe_add_lambda_conv_op (tree type
)
8406 bool nested
= (current_function_decl
!= NULL_TREE
);
8407 tree callop
= lambda_function (type
);
8408 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
8409 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
8410 VEC (tree
, gc
) *argvec
;
8412 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
8415 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
8416 FUNCTION_ARG_CHAIN (callop
));
8418 /* First build up the conversion op. */
8420 rettype
= build_pointer_type (stattype
);
8421 name
= mangle_conv_op_name_for_type (rettype
);
8422 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
8423 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
8424 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
8425 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8427 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8428 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8429 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8431 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
8432 grokclassfn (type
, fn
, NO_SPECIAL
);
8433 set_linkage_according_to_type (type
, fn
);
8434 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8435 DECL_IN_AGGR_P (fn
) = 1;
8436 DECL_ARTIFICIAL (fn
) = 1;
8437 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8438 DECL_DECLARED_INLINE_P (fn
) = 1;
8439 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
8441 DECL_INTERFACE_KNOWN (fn
) = 1;
8443 add_method (type
, fn
, NULL_TREE
);
8445 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8446 the conversion op is used. */
8447 if (varargs_function_p (callop
))
8449 DECL_DELETED_FN (fn
) = 1;
8453 /* Now build up the thunk to be returned. */
8455 name
= get_identifier ("_FUN");
8456 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
8457 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8458 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8459 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8460 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8461 grokclassfn (type
, fn
, NO_SPECIAL
);
8462 set_linkage_according_to_type (type
, fn
);
8463 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8464 DECL_IN_AGGR_P (fn
) = 1;
8465 DECL_ARTIFICIAL (fn
) = 1;
8466 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8467 DECL_DECLARED_INLINE_P (fn
) = 1;
8468 DECL_STATIC_FUNCTION_P (fn
) = 1;
8469 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
8470 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
8471 DECL_CONTEXT (arg
) = fn
;
8473 DECL_INTERFACE_KNOWN (fn
) = 1;
8475 add_method (type
, fn
, NULL_TREE
);
8478 push_function_context ();
8480 /* Generate the body of the thunk. */
8482 start_preparsed_function (statfn
, NULL_TREE
,
8483 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8484 if (DECL_ONE_ONLY (statfn
))
8486 /* Put the thunk in the same comdat group as the call op. */
8487 struct cgraph_node
*callop_node
, *thunk_node
;
8488 DECL_COMDAT_GROUP (statfn
) = DECL_COMDAT_GROUP (callop
);
8489 callop_node
= cgraph_get_create_node (callop
);
8490 thunk_node
= cgraph_get_create_node (statfn
);
8491 gcc_assert (callop_node
->same_comdat_group
== NULL
);
8492 gcc_assert (thunk_node
->same_comdat_group
== NULL
);
8493 callop_node
->same_comdat_group
= thunk_node
;
8494 thunk_node
->same_comdat_group
= callop_node
;
8496 body
= begin_function_body ();
8497 compound_stmt
= begin_compound_stmt (0);
8499 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
8501 argvec
= make_tree_vector ();
8502 VEC_quick_push (tree
, argvec
, arg
);
8503 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
8504 VEC_safe_push (tree
, gc
, argvec
, arg
);
8505 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
8506 VEC_address (tree
, argvec
));
8507 CALL_FROM_THUNK_P (call
) = 1;
8508 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
8509 call
= build_cplus_new (TREE_TYPE (call
), call
, tf_warning_or_error
);
8510 call
= convert_from_reference (call
);
8511 finish_return_stmt (call
);
8513 finish_compound_stmt (compound_stmt
);
8514 finish_function_body (body
);
8516 expand_or_defer_fn (finish_function (2));
8518 /* Generate the body of the conversion op. */
8520 start_preparsed_function (convfn
, NULL_TREE
,
8521 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8522 body
= begin_function_body ();
8523 compound_stmt
= begin_compound_stmt (0);
8525 finish_return_stmt (decay_conversion (statfn
));
8527 finish_compound_stmt (compound_stmt
);
8528 finish_function_body (body
);
8530 expand_or_defer_fn (finish_function (2));
8533 pop_function_context ();
8535 #include "gt-cp-semantics.h"