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
, tf_warning_or_error
);
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
, tf_warning_or_error
);
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 || (non_static_member_function_p (fn
)
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 SET_EXPR_LOCATION (result
, input_location
);
2174 KOENIG_LOOKUP_P (result
) = koenig_p
;
2175 release_tree_vector (orig_args
);
2176 result
= convert_from_reference (result
);
2181 /* Free garbage OVERLOADs from arg-dependent lookup. */
2182 tree next
= NULL_TREE
;
2184 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2187 if (processing_template_decl
)
2188 /* In a template, we'll re-use them at instantiation time. */
2189 OVL_ARG_DEPENDENT (fn
) = false;
2192 next
= OVL_CHAIN (fn
);
2201 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2202 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2203 POSTDECREMENT_EXPR.) */
2206 finish_increment_expr (tree expr
, enum tree_code code
)
2208 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2211 /* Finish a use of `this'. Returns an expression for `this'. */
2214 finish_this_expr (void)
2218 if (current_class_ptr
)
2220 tree type
= TREE_TYPE (current_class_ref
);
2222 /* In a lambda expression, 'this' refers to the captured 'this'. */
2223 if (LAMBDA_TYPE_P (type
))
2224 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2226 result
= current_class_ptr
;
2229 else if (current_function_decl
2230 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2232 error ("%<this%> is unavailable for static member functions");
2233 result
= error_mark_node
;
2237 if (current_function_decl
)
2238 error ("invalid use of %<this%> in non-member function");
2240 error ("invalid use of %<this%> at top level");
2241 result
= error_mark_node
;
2247 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2248 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2249 the TYPE for the type given. If SCOPE is non-NULL, the expression
2250 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2253 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2255 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2256 return error_mark_node
;
2258 gcc_assert (TYPE_P (destructor
));
2260 if (!processing_template_decl
)
2262 if (scope
== error_mark_node
)
2264 error ("invalid qualifying scope in pseudo-destructor name");
2265 return error_mark_node
;
2267 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2269 error ("qualified type %qT does not match destructor name ~%qT",
2271 return error_mark_node
;
2275 /* [expr.pseudo] says both:
2277 The type designated by the pseudo-destructor-name shall be
2278 the same as the object type.
2282 The cv-unqualified versions of the object type and of the
2283 type designated by the pseudo-destructor-name shall be the
2286 We implement the more generous second sentence, since that is
2287 what most other compilers do. */
2288 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2291 error ("%qE is not of type %qT", object
, destructor
);
2292 return error_mark_node
;
2296 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2299 /* Finish an expression of the form CODE EXPR. */
2302 finish_unary_op_expr (enum tree_code code
, tree expr
)
2304 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2305 /* Inside a template, build_x_unary_op does not fold the
2306 expression. So check whether the result is folded before
2307 setting TREE_NEGATED_INT. */
2308 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2309 && TREE_CODE (result
) == INTEGER_CST
2310 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2311 && INT_CST_LT (result
, integer_zero_node
))
2313 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2314 setting TREE_NEGATED_INT. */
2315 result
= copy_node (result
);
2316 TREE_NEGATED_INT (result
) = 1;
2318 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2319 overflow_warning (input_location
, result
);
2324 /* Finish a compound-literal expression. TYPE is the type to which
2325 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2328 finish_compound_literal (tree type
, tree compound_literal
,
2329 tsubst_flags_t complain
)
2331 if (type
== error_mark_node
)
2332 return error_mark_node
;
2334 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2337 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2339 return cp_build_c_cast (type
, compound_literal
, complain
);
2342 if (!TYPE_OBJ_P (type
))
2344 if (complain
& tf_error
)
2345 error ("compound literal of non-object type %qT", type
);
2346 return error_mark_node
;
2349 if (processing_template_decl
)
2351 TREE_TYPE (compound_literal
) = type
;
2352 /* Mark the expression as a compound literal. */
2353 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2354 return compound_literal
;
2357 type
= complete_type (type
);
2359 if (TYPE_NON_AGGREGATE_CLASS (type
))
2361 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2362 everywhere that deals with function arguments would be a pain, so
2363 just wrap it in a TREE_LIST. The parser set a flag so we know
2364 that it came from T{} rather than T({}). */
2365 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2366 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2367 return build_functional_cast (type
, compound_literal
, complain
);
2370 if (TREE_CODE (type
) == ARRAY_TYPE
2371 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2372 return error_mark_node
;
2373 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2374 if (TREE_CODE (type
) == ARRAY_TYPE
2375 && TYPE_DOMAIN (type
) == NULL_TREE
)
2377 cp_complete_array_type_or_error (&type
, compound_literal
,
2379 if (type
== error_mark_node
)
2380 return error_mark_node
;
2382 compound_literal
= digest_init (type
, compound_literal
, complain
);
2383 /* Put static/constant array temporaries in static variables, but always
2384 represent class temporaries with TARGET_EXPR so we elide copies. */
2385 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2386 && TREE_CODE (type
) == ARRAY_TYPE
2387 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2388 && initializer_constant_valid_p (compound_literal
, type
))
2390 tree decl
= create_temporary_var (type
);
2391 DECL_INITIAL (decl
) = compound_literal
;
2392 TREE_STATIC (decl
) = 1;
2393 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2395 /* 5.19 says that a constant expression can include an
2396 lvalue-rvalue conversion applied to "a glvalue of literal type
2397 that refers to a non-volatile temporary object initialized
2398 with a constant expression". Rather than try to communicate
2399 that this VAR_DECL is a temporary, just mark it constexpr. */
2400 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2401 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2402 TREE_CONSTANT (decl
) = true;
2404 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2405 decl
= pushdecl_top_level (decl
);
2406 DECL_NAME (decl
) = make_anon_name ();
2407 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2411 return get_target_expr_sfinae (compound_literal
, complain
);
2414 /* Return the declaration for the function-name variable indicated by
2418 finish_fname (tree id
)
2422 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2423 if (processing_template_decl
&& current_function_decl
)
2424 decl
= DECL_NAME (decl
);
2428 /* Finish a translation unit. */
2431 finish_translation_unit (void)
2433 /* In case there were missing closebraces,
2434 get us back to the global binding level. */
2436 while (current_namespace
!= global_namespace
)
2439 /* Do file scope __FUNCTION__ et al. */
2440 finish_fname_decls ();
2443 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2444 Returns the parameter. */
2447 finish_template_type_parm (tree aggr
, tree identifier
)
2449 if (aggr
!= class_type_node
)
2451 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2452 aggr
= class_type_node
;
2455 return build_tree_list (aggr
, identifier
);
2458 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2459 Returns the parameter. */
2462 finish_template_template_parm (tree aggr
, tree identifier
)
2464 tree decl
= build_decl (input_location
,
2465 TYPE_DECL
, identifier
, NULL_TREE
);
2466 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2467 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2468 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2469 DECL_ARTIFICIAL (decl
) = 1;
2470 end_template_decl ();
2472 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2474 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2475 /*is_primary=*/true, /*is_partial=*/false,
2478 return finish_template_type_parm (aggr
, tmpl
);
2481 /* ARGUMENT is the default-argument value for a template template
2482 parameter. If ARGUMENT is invalid, issue error messages and return
2483 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2486 check_template_template_default_arg (tree argument
)
2488 if (TREE_CODE (argument
) != TEMPLATE_DECL
2489 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2490 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2492 if (TREE_CODE (argument
) == TYPE_DECL
)
2493 error ("invalid use of type %qT as a default value for a template "
2494 "template-parameter", TREE_TYPE (argument
));
2496 error ("invalid default argument for a template template parameter");
2497 return error_mark_node
;
2503 /* Begin a class definition, as indicated by T. */
2506 begin_class_definition (tree t
, tree attributes
)
2508 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2509 return error_mark_node
;
2511 if (processing_template_parmlist
)
2513 error ("definition of %q#T inside template parameter list", t
);
2514 return error_mark_node
;
2517 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2518 are passed the same as decimal scalar types. */
2519 if (TREE_CODE (t
) == RECORD_TYPE
2520 && !processing_template_decl
)
2522 tree ns
= TYPE_CONTEXT (t
);
2523 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2524 && DECL_CONTEXT (ns
) == std_node
2526 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2528 const char *n
= TYPE_NAME_STRING (t
);
2529 if ((strcmp (n
, "decimal32") == 0)
2530 || (strcmp (n
, "decimal64") == 0)
2531 || (strcmp (n
, "decimal128") == 0))
2532 TYPE_TRANSPARENT_AGGR (t
) = 1;
2536 /* A non-implicit typename comes from code like:
2538 template <typename T> struct A {
2539 template <typename U> struct A<T>::B ...
2541 This is erroneous. */
2542 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2544 error ("invalid definition of qualified type %qT", t
);
2545 t
= error_mark_node
;
2548 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2550 t
= make_class_type (RECORD_TYPE
);
2551 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2554 if (TYPE_BEING_DEFINED (t
))
2556 t
= make_class_type (TREE_CODE (t
));
2557 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2559 maybe_process_partial_specialization (t
);
2561 TYPE_BEING_DEFINED (t
) = 1;
2563 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2564 fixup_attribute_variants (t
);
2566 if (flag_pack_struct
)
2569 TYPE_PACKED (t
) = 1;
2570 /* Even though the type is being defined for the first time
2571 here, there might have been a forward declaration, so there
2572 might be cv-qualified variants of T. */
2573 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2574 TYPE_PACKED (v
) = 1;
2576 /* Reset the interface data, at the earliest possible
2577 moment, as it might have been set via a class foo;
2579 if (! TYPE_ANONYMOUS_P (t
))
2581 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2582 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2583 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2584 (t
, finfo
->interface_unknown
);
2586 reset_specialization();
2588 /* Make a declaration for this class in its own scope. */
2589 build_self_reference ();
2594 /* Finish the member declaration given by DECL. */
2597 finish_member_declaration (tree decl
)
2599 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2602 if (decl
== void_type_node
)
2603 /* The COMPONENT was a friend, not a member, and so there's
2604 nothing for us to do. */
2607 /* We should see only one DECL at a time. */
2608 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2610 /* Set up access control for DECL. */
2612 = (current_access_specifier
== access_private_node
);
2613 TREE_PROTECTED (decl
)
2614 = (current_access_specifier
== access_protected_node
);
2615 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2617 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2618 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2621 /* Mark the DECL as a member of the current class. */
2622 DECL_CONTEXT (decl
) = current_class_type
;
2624 /* Check for bare parameter packs in the member variable declaration. */
2625 if (TREE_CODE (decl
) == FIELD_DECL
)
2627 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2628 TREE_TYPE (decl
) = error_mark_node
;
2629 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2630 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2635 A C language linkage is ignored for the names of class members
2636 and the member function type of class member functions. */
2637 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2638 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2640 /* Put functions on the TYPE_METHODS list and everything else on the
2641 TYPE_FIELDS list. Note that these are built up in reverse order.
2642 We reverse them (to obtain declaration order) in finish_struct. */
2643 if (TREE_CODE (decl
) == FUNCTION_DECL
2644 || DECL_FUNCTION_TEMPLATE_P (decl
))
2646 /* We also need to add this function to the
2647 CLASSTYPE_METHOD_VEC. */
2648 if (add_method (current_class_type
, decl
, NULL_TREE
))
2650 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2651 TYPE_METHODS (current_class_type
) = decl
;
2653 maybe_add_class_template_decl_list (current_class_type
, decl
,
2657 /* Enter the DECL into the scope of the class. */
2658 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2659 || pushdecl_class_level (decl
))
2661 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2662 go at the beginning. The reason is that lookup_field_1
2663 searches the list in order, and we want a field name to
2664 override a type name so that the "struct stat hack" will
2665 work. In particular:
2667 struct S { enum E { }; int E } s;
2670 is valid. In addition, the FIELD_DECLs must be maintained in
2671 declaration order so that class layout works as expected.
2672 However, we don't need that order until class layout, so we
2673 save a little time by putting FIELD_DECLs on in reverse order
2674 here, and then reversing them in finish_struct_1. (We could
2675 also keep a pointer to the correct insertion points in the
2678 if (TREE_CODE (decl
) == TYPE_DECL
)
2679 TYPE_FIELDS (current_class_type
)
2680 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2683 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2684 TYPE_FIELDS (current_class_type
) = decl
;
2687 maybe_add_class_template_decl_list (current_class_type
, decl
,
2692 note_decl_for_pch (decl
);
2695 /* DECL has been declared while we are building a PCH file. Perform
2696 actions that we might normally undertake lazily, but which can be
2697 performed now so that they do not have to be performed in
2698 translation units which include the PCH file. */
2701 note_decl_for_pch (tree decl
)
2703 gcc_assert (pch_file
);
2705 /* There's a good chance that we'll have to mangle names at some
2706 point, even if only for emission in debugging information. */
2707 if ((TREE_CODE (decl
) == VAR_DECL
2708 || TREE_CODE (decl
) == FUNCTION_DECL
)
2709 && !processing_template_decl
)
2713 /* Finish processing a complete template declaration. The PARMS are
2714 the template parameters. */
2717 finish_template_decl (tree parms
)
2720 end_template_decl ();
2722 end_specialization ();
2725 /* Finish processing a template-id (which names a type) of the form
2726 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2727 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2728 the scope of template-id indicated. */
2731 finish_template_type (tree name
, tree args
, int entering_scope
)
2735 decl
= lookup_template_class (name
, args
,
2736 NULL_TREE
, NULL_TREE
, entering_scope
,
2737 tf_warning_or_error
| tf_user
);
2738 if (decl
!= error_mark_node
)
2739 decl
= TYPE_STUB_DECL (decl
);
2744 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2745 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2746 BASE_CLASS, or NULL_TREE if an error occurred. The
2747 ACCESS_SPECIFIER is one of
2748 access_{default,public,protected_private}_node. For a virtual base
2749 we set TREE_TYPE. */
2752 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2756 if (base
== error_mark_node
)
2758 error ("invalid base-class specification");
2761 else if (! MAYBE_CLASS_TYPE_P (base
))
2763 error ("%qT is not a class type", base
);
2768 if (cp_type_quals (base
) != 0)
2770 /* DR 484: Can a base-specifier name a cv-qualified
2772 base
= TYPE_MAIN_VARIANT (base
);
2774 result
= build_tree_list (access
, base
);
2776 TREE_TYPE (result
) = integer_type_node
;
2782 /* If FNS is a member function, a set of member functions, or a
2783 template-id referring to one or more member functions, return a
2784 BASELINK for FNS, incorporating the current access context.
2785 Otherwise, return FNS unchanged. */
2788 baselink_for_fns (tree fns
)
2793 if (BASELINK_P (fns
)
2794 || error_operand_p (fns
))
2798 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2799 fn
= TREE_OPERAND (fn
, 0);
2800 fn
= get_first_fn (fn
);
2801 if (!DECL_FUNCTION_MEMBER_P (fn
))
2804 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2806 cl
= DECL_CONTEXT (fn
);
2807 cl
= TYPE_BINFO (cl
);
2808 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2811 /* Returns true iff DECL is an automatic variable from a function outside
2815 outer_automatic_var_p (tree decl
)
2817 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2818 && DECL_FUNCTION_SCOPE_P (decl
)
2819 && !TREE_STATIC (decl
)
2820 && DECL_CONTEXT (decl
) != current_function_decl
);
2823 /* Returns true iff DECL is a capture field from a lambda that is not our
2824 immediate context. */
2827 outer_lambda_capture_p (tree decl
)
2829 return (TREE_CODE (decl
) == FIELD_DECL
2830 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2831 && (!current_class_type
2832 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2835 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2836 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2837 if non-NULL, is the type or namespace used to explicitly qualify
2838 ID_EXPRESSION. DECL is the entity to which that name has been
2841 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2842 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2843 be set to true if this expression isn't permitted in a
2844 constant-expression, but it is otherwise not set by this function.
2845 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2846 constant-expression, but a non-constant expression is also
2849 DONE is true if this expression is a complete postfix-expression;
2850 it is false if this expression is followed by '->', '[', '(', etc.
2851 ADDRESS_P is true iff this expression is the operand of '&'.
2852 TEMPLATE_P is true iff the qualified-id was of the form
2853 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2854 appears as a template argument.
2856 If an error occurs, and it is the kind of error that might cause
2857 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2858 is the caller's responsibility to issue the message. *ERROR_MSG
2859 will be a string with static storage duration, so the caller need
2862 Return an expression for the entity, after issuing appropriate
2863 diagnostics. This function is also responsible for transforming a
2864 reference to a non-static member into a COMPONENT_REF that makes
2865 the use of "this" explicit.
2867 Upon return, *IDK will be filled in appropriately. */
2869 finish_id_expression (tree id_expression
,
2873 bool integral_constant_expression_p
,
2874 bool allow_non_integral_constant_expression_p
,
2875 bool *non_integral_constant_expression_p
,
2879 bool template_arg_p
,
2880 const char **error_msg
,
2881 location_t location
)
2883 /* Initialize the output parameters. */
2884 *idk
= CP_ID_KIND_NONE
;
2887 if (id_expression
== error_mark_node
)
2888 return error_mark_node
;
2889 /* If we have a template-id, then no further lookup is
2890 required. If the template-id was for a template-class, we
2891 will sometimes have a TYPE_DECL at this point. */
2892 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2893 || TREE_CODE (decl
) == TYPE_DECL
)
2895 /* Look up the name. */
2898 if (decl
== error_mark_node
)
2900 /* Name lookup failed. */
2903 || (!dependent_type_p (scope
)
2904 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2905 && IDENTIFIER_TYPENAME_P (id_expression
)
2906 && dependent_type_p (TREE_TYPE (id_expression
))))))
2908 /* If the qualifying type is non-dependent (and the name
2909 does not name a conversion operator to a dependent
2910 type), issue an error. */
2911 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2912 return error_mark_node
;
2916 /* It may be resolved via Koenig lookup. */
2917 *idk
= CP_ID_KIND_UNQUALIFIED
;
2918 return id_expression
;
2921 decl
= id_expression
;
2923 /* If DECL is a variable that would be out of scope under
2924 ANSI/ISO rules, but in scope in the ARM, name lookup
2925 will succeed. Issue a diagnostic here. */
2927 decl
= check_for_out_of_scope_variable (decl
);
2929 /* Remember that the name was used in the definition of
2930 the current class so that we can check later to see if
2931 the meaning would have been different after the class
2932 was entirely defined. */
2933 if (!scope
&& decl
!= error_mark_node
2934 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
2935 maybe_note_name_used_in_class (id_expression
, decl
);
2937 /* Disallow uses of local variables from containing functions, except
2938 within lambda-expressions. */
2939 if ((outer_automatic_var_p (decl
)
2940 || outer_lambda_capture_p (decl
))
2941 /* It's not a use (3.2) if we're in an unevaluated context. */
2942 && !cp_unevaluated_operand
)
2944 tree context
= DECL_CONTEXT (decl
);
2945 tree containing_function
= current_function_decl
;
2946 tree lambda_stack
= NULL_TREE
;
2947 tree lambda_expr
= NULL_TREE
;
2948 tree initializer
= decl
;
2950 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2951 support for an approach in which a reference to a local
2952 [constant] automatic variable in a nested class or lambda body
2953 would enter the expression as an rvalue, which would reduce
2954 the complexity of the problem"
2956 FIXME update for final resolution of core issue 696. */
2957 if (decl_constant_var_p (decl
))
2958 return integral_constant_value (decl
);
2960 if (TYPE_P (context
))
2962 /* Implicit capture of an explicit capture. */
2963 context
= lambda_function (context
);
2964 initializer
= thisify_lambda_field (decl
);
2967 /* If we are in a lambda function, we can move out until we hit
2969 2. a non-lambda function, or
2970 3. a non-default capturing lambda function. */
2971 while (context
!= containing_function
2972 && LAMBDA_FUNCTION_P (containing_function
))
2974 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2975 (DECL_CONTEXT (containing_function
));
2977 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2981 lambda_stack
= tree_cons (NULL_TREE
,
2986 = decl_function_context (containing_function
);
2989 if (context
== containing_function
)
2991 decl
= add_default_capture (lambda_stack
,
2992 /*id=*/DECL_NAME (decl
),
2995 else if (lambda_expr
)
2997 error ("%qD is not captured", decl
);
2998 return error_mark_node
;
3002 error (TREE_CODE (decl
) == VAR_DECL
3003 ? "use of %<auto%> variable from containing function"
3004 : "use of parameter from containing function");
3005 error (" %q+#D declared here", decl
);
3006 return error_mark_node
;
3010 /* Also disallow uses of function parameters outside the function
3011 body, except inside an unevaluated context (i.e. decltype). */
3012 if (TREE_CODE (decl
) == PARM_DECL
3013 && DECL_CONTEXT (decl
) == NULL_TREE
3014 && !cp_unevaluated_operand
)
3016 error ("use of parameter %qD outside function body", decl
);
3017 return error_mark_node
;
3021 /* If we didn't find anything, or what we found was a type,
3022 then this wasn't really an id-expression. */
3023 if (TREE_CODE (decl
) == TEMPLATE_DECL
3024 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3026 *error_msg
= "missing template arguments";
3027 return error_mark_node
;
3029 else if (TREE_CODE (decl
) == TYPE_DECL
3030 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3032 *error_msg
= "expected primary-expression";
3033 return error_mark_node
;
3036 /* If the name resolved to a template parameter, there is no
3037 need to look it up again later. */
3038 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3039 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3043 *idk
= CP_ID_KIND_NONE
;
3044 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3045 decl
= TEMPLATE_PARM_DECL (decl
);
3046 r
= convert_from_reference (DECL_INITIAL (decl
));
3048 if (integral_constant_expression_p
3049 && !dependent_type_p (TREE_TYPE (decl
))
3050 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3052 if (!allow_non_integral_constant_expression_p
)
3053 error ("template parameter %qD of type %qT is not allowed in "
3054 "an integral constant expression because it is not of "
3055 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3056 *non_integral_constant_expression_p
= true;
3060 /* Similarly, we resolve enumeration constants to their
3061 underlying values. */
3062 else if (TREE_CODE (decl
) == CONST_DECL
)
3064 *idk
= CP_ID_KIND_NONE
;
3065 if (!processing_template_decl
)
3067 used_types_insert (TREE_TYPE (decl
));
3068 return DECL_INITIAL (decl
);
3076 /* If the declaration was explicitly qualified indicate
3077 that. The semantics of `A::f(3)' are different than
3078 `f(3)' if `f' is virtual. */
3080 ? CP_ID_KIND_QUALIFIED
3081 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3082 ? CP_ID_KIND_TEMPLATE_ID
3083 : CP_ID_KIND_UNQUALIFIED
));
3088 An id-expression is type-dependent if it contains an
3089 identifier that was declared with a dependent type.
3091 The standard is not very specific about an id-expression that
3092 names a set of overloaded functions. What if some of them
3093 have dependent types and some of them do not? Presumably,
3094 such a name should be treated as a dependent name. */
3095 /* Assume the name is not dependent. */
3096 dependent_p
= false;
3097 if (!processing_template_decl
)
3098 /* No names are dependent outside a template. */
3100 /* A template-id where the name of the template was not resolved
3101 is definitely dependent. */
3102 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3103 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3104 == IDENTIFIER_NODE
))
3106 /* For anything except an overloaded function, just check its
3108 else if (!is_overloaded_fn (decl
))
3110 = dependent_type_p (TREE_TYPE (decl
));
3111 /* For a set of overloaded functions, check each of the
3117 if (BASELINK_P (fns
))
3118 fns
= BASELINK_FUNCTIONS (fns
);
3120 /* For a template-id, check to see if the template
3121 arguments are dependent. */
3122 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3124 tree args
= TREE_OPERAND (fns
, 1);
3125 dependent_p
= any_dependent_template_arguments_p (args
);
3126 /* The functions are those referred to by the
3128 fns
= TREE_OPERAND (fns
, 0);
3131 /* If there are no dependent template arguments, go through
3132 the overloaded functions. */
3133 while (fns
&& !dependent_p
)
3135 tree fn
= OVL_CURRENT (fns
);
3137 /* Member functions of dependent classes are
3139 if (TREE_CODE (fn
) == FUNCTION_DECL
3140 && type_dependent_expression_p (fn
))
3142 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3143 && dependent_template_p (fn
))
3146 fns
= OVL_NEXT (fns
);
3150 /* If the name was dependent on a template parameter, we will
3151 resolve the name at instantiation time. */
3154 /* Create a SCOPE_REF for qualified names, if the scope is
3160 if (address_p
&& done
)
3161 decl
= finish_qualified_id_expr (scope
, decl
,
3167 tree type
= NULL_TREE
;
3168 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3169 type
= TREE_TYPE (decl
);
3170 decl
= build_qualified_name (type
,
3176 if (TREE_TYPE (decl
))
3177 decl
= convert_from_reference (decl
);
3180 /* A TEMPLATE_ID already contains all the information we
3182 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3183 return id_expression
;
3184 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3185 /* If we found a variable, then name lookup during the
3186 instantiation will always resolve to the same VAR_DECL
3187 (or an instantiation thereof). */
3188 if (TREE_CODE (decl
) == VAR_DECL
3189 || TREE_CODE (decl
) == PARM_DECL
)
3190 return convert_from_reference (decl
);
3191 /* The same is true for FIELD_DECL, but we also need to
3192 make sure that the syntax is correct. */
3193 else if (TREE_CODE (decl
) == FIELD_DECL
)
3195 /* Since SCOPE is NULL here, this is an unqualified name.
3196 Access checking has been performed during name lookup
3197 already. Turn off checking to avoid duplicate errors. */
3198 push_deferring_access_checks (dk_no_check
);
3199 decl
= finish_non_static_data_member
3201 /*qualifying_scope=*/NULL_TREE
);
3202 pop_deferring_access_checks ();
3205 return id_expression
;
3208 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3210 error ("use of namespace %qD as expression", decl
);
3211 return error_mark_node
;
3213 else if (DECL_CLASS_TEMPLATE_P (decl
))
3215 error ("use of class template %qT as expression", decl
);
3216 return error_mark_node
;
3218 else if (TREE_CODE (decl
) == TREE_LIST
)
3220 /* Ambiguous reference to base members. */
3221 error ("request for member %qD is ambiguous in "
3222 "multiple inheritance lattice", id_expression
);
3223 print_candidates (decl
);
3224 return error_mark_node
;
3227 /* Mark variable-like entities as used. Functions are similarly
3228 marked either below or after overload resolution. */
3229 if (TREE_CODE (decl
) == VAR_DECL
3230 || TREE_CODE (decl
) == PARM_DECL
3231 || TREE_CODE (decl
) == RESULT_DECL
)
3234 /* Only certain kinds of names are allowed in constant
3235 expression. Enumerators and template parameters have already
3236 been handled above. */
3237 if (! error_operand_p (decl
)
3238 && integral_constant_expression_p
3239 && ! decl_constant_var_p (decl
)
3240 && ! builtin_valid_in_constant_expr_p (decl
))
3242 if (!allow_non_integral_constant_expression_p
)
3244 error ("%qD cannot appear in a constant-expression", decl
);
3245 return error_mark_node
;
3247 *non_integral_constant_expression_p
= true;
3252 decl
= (adjust_result_of_qualified_name_lookup
3253 (decl
, scope
, current_class_type
));
3255 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3258 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3259 decl
= finish_qualified_id_expr (scope
,
3267 tree r
= convert_from_reference (decl
);
3269 /* In a template, return a SCOPE_REF for most qualified-ids
3270 so that we can check access at instantiation time. But if
3271 we're looking at a member of the current instantiation, we
3272 know we have access and building up the SCOPE_REF confuses
3273 non-type template argument handling. */
3274 if (processing_template_decl
&& TYPE_P (scope
)
3275 && !currently_open_class (scope
))
3276 r
= build_qualified_name (TREE_TYPE (r
),
3282 else if (TREE_CODE (decl
) == FIELD_DECL
)
3284 /* Since SCOPE is NULL here, this is an unqualified name.
3285 Access checking has been performed during name lookup
3286 already. Turn off checking to avoid duplicate errors. */
3287 push_deferring_access_checks (dk_no_check
);
3288 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3289 /*qualifying_scope=*/NULL_TREE
);
3290 pop_deferring_access_checks ();
3292 else if (is_overloaded_fn (decl
))
3296 first_fn
= get_first_fn (decl
);
3297 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3298 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3300 if (!really_overloaded_fn (decl
))
3301 mark_used (first_fn
);
3304 && TREE_CODE (first_fn
) == FUNCTION_DECL
3305 && DECL_FUNCTION_MEMBER_P (first_fn
)
3306 && !shared_member_p (decl
))
3308 /* A set of member functions. */
3309 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3310 return finish_class_member_access_expr (decl
, id_expression
,
3311 /*template_p=*/false,
3312 tf_warning_or_error
);
3315 decl
= baselink_for_fns (decl
);
3319 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3320 && DECL_CLASS_SCOPE_P (decl
))
3322 tree context
= context_for_name_lookup (decl
);
3323 if (context
!= current_class_type
)
3325 tree path
= currently_open_derived_class (context
);
3326 perform_or_defer_access_check (TYPE_BINFO (path
),
3331 decl
= convert_from_reference (decl
);
3335 if (TREE_DEPRECATED (decl
))
3336 warn_deprecated_use (decl
, NULL_TREE
);
3341 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3342 use as a type-specifier. */
3345 finish_typeof (tree expr
)
3349 if (type_dependent_expression_p (expr
))
3351 type
= cxx_make_type (TYPEOF_TYPE
);
3352 TYPEOF_TYPE_EXPR (type
) = expr
;
3353 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3358 expr
= mark_type_use (expr
);
3360 type
= unlowered_expr_type (expr
);
3362 if (!type
|| type
== unknown_type_node
)
3364 error ("type of %qE is unknown", expr
);
3365 return error_mark_node
;
3371 /* Implement the __underlying_type keyword: Return the underlying
3372 type of TYPE, suitable for use as a type-specifier. */
3375 finish_underlying_type (tree type
)
3377 tree underlying_type
;
3379 if (processing_template_decl
)
3381 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3382 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3383 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3385 return underlying_type
;
3388 complete_type (type
);
3390 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3392 error ("%qE is not an enumeration type", type
);
3393 return error_mark_node
;
3396 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3398 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3399 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3400 See finish_enum_value_list for details. */
3401 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3403 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3404 TYPE_UNSIGNED (underlying_type
));
3406 return underlying_type
;
3409 /* Perform C++-specific checks for __builtin_offsetof before calling
3413 finish_offsetof (tree expr
)
3415 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3417 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3418 TREE_OPERAND (expr
, 2));
3419 return error_mark_node
;
3421 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3422 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3423 || TREE_TYPE (expr
) == unknown_type_node
)
3425 if (TREE_CODE (expr
) == COMPONENT_REF
3426 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3427 expr
= TREE_OPERAND (expr
, 1);
3428 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3429 return error_mark_node
;
3431 if (REFERENCE_REF_P (expr
))
3432 expr
= TREE_OPERAND (expr
, 0);
3433 return fold_offsetof (expr
, NULL_TREE
);
3436 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3437 function is broken out from the above for the benefit of the tree-ssa
3441 simplify_aggr_init_expr (tree
*tp
)
3443 tree aggr_init_expr
= *tp
;
3445 /* Form an appropriate CALL_EXPR. */
3446 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3447 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3448 tree type
= TREE_TYPE (slot
);
3451 enum style_t
{ ctor
, arg
, pcc
} style
;
3453 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3455 #ifdef PCC_STATIC_STRUCT_RETURN
3461 gcc_assert (TREE_ADDRESSABLE (type
));
3465 call_expr
= build_call_array_loc (input_location
,
3466 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3468 aggr_init_expr_nargs (aggr_init_expr
),
3469 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3470 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3474 /* Replace the first argument to the ctor with the address of the
3476 cxx_mark_addressable (slot
);
3477 CALL_EXPR_ARG (call_expr
, 0) =
3478 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3480 else if (style
== arg
)
3482 /* Just mark it addressable here, and leave the rest to
3483 expand_call{,_inline}. */
3484 cxx_mark_addressable (slot
);
3485 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3486 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3488 else if (style
== pcc
)
3490 /* If we're using the non-reentrant PCC calling convention, then we
3491 need to copy the returned value out of the static buffer into the
3493 push_deferring_access_checks (dk_no_check
);
3494 call_expr
= build_aggr_init (slot
, call_expr
,
3495 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3496 tf_warning_or_error
);
3497 pop_deferring_access_checks ();
3498 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3501 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3503 tree init
= build_zero_init (type
, NULL_TREE
,
3504 /*static_storage_p=*/false);
3505 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3506 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3513 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3516 emit_associated_thunks (tree fn
)
3518 /* When we use vcall offsets, we emit thunks with the virtual
3519 functions to which they thunk. The whole point of vcall offsets
3520 is so that you can know statically the entire set of thunks that
3521 will ever be needed for a given virtual function, thereby
3522 enabling you to output all the thunks with the function itself. */
3523 if (DECL_VIRTUAL_P (fn
)
3524 /* Do not emit thunks for extern template instantiations. */
3525 && ! DECL_REALLY_EXTERN (fn
))
3529 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3531 if (!THUNK_ALIAS (thunk
))
3533 use_thunk (thunk
, /*emit_p=*/1);
3534 if (DECL_RESULT_THUNK_P (thunk
))
3538 for (probe
= DECL_THUNKS (thunk
);
3539 probe
; probe
= DECL_CHAIN (probe
))
3540 use_thunk (probe
, /*emit_p=*/1);
3544 gcc_assert (!DECL_THUNKS (thunk
));
3549 /* Generate RTL for FN. */
3552 expand_or_defer_fn_1 (tree fn
)
3554 /* When the parser calls us after finishing the body of a template
3555 function, we don't really want to expand the body. */
3556 if (processing_template_decl
)
3558 /* Normally, collection only occurs in rest_of_compilation. So,
3559 if we don't collect here, we never collect junk generated
3560 during the processing of templates until we hit a
3561 non-template function. It's not safe to do this inside a
3562 nested class, though, as the parser may have local state that
3563 is not a GC root. */
3564 if (!function_depth
)
3569 gcc_assert (DECL_SAVED_TREE (fn
));
3571 /* If this is a constructor or destructor body, we have to clone
3573 if (maybe_clone_body (fn
))
3575 /* We don't want to process FN again, so pretend we've written
3576 it out, even though we haven't. */
3577 TREE_ASM_WRITTEN (fn
) = 1;
3578 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3582 /* We make a decision about linkage for these functions at the end
3583 of the compilation. Until that point, we do not want the back
3584 end to output them -- but we do want it to see the bodies of
3585 these functions so that it can inline them as appropriate. */
3586 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3588 if (DECL_INTERFACE_KNOWN (fn
))
3589 /* We've already made a decision as to how this function will
3593 DECL_EXTERNAL (fn
) = 1;
3594 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3595 note_vague_linkage_fn (fn
);
3596 /* A non-template inline function with external linkage will
3597 always be COMDAT. As we must eventually determine the
3598 linkage of all functions, and as that causes writes to
3599 the data mapped in from the PCH file, it's advantageous
3600 to mark the functions at this point. */
3601 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3603 /* This function must have external linkage, as
3604 otherwise DECL_INTERFACE_KNOWN would have been
3606 gcc_assert (TREE_PUBLIC (fn
));
3607 comdat_linkage (fn
);
3608 DECL_INTERFACE_KNOWN (fn
) = 1;
3612 import_export_decl (fn
);
3614 /* If the user wants us to keep all inline functions, then mark
3615 this function as needed so that finish_file will make sure to
3616 output it later. Similarly, all dllexport'd functions must
3617 be emitted; there may be callers in other DLLs. */
3618 if ((flag_keep_inline_functions
3619 && DECL_DECLARED_INLINE_P (fn
)
3620 && !DECL_REALLY_EXTERN (fn
))
3621 || (flag_keep_inline_dllexport
3622 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3626 /* There's no reason to do any of the work here if we're only doing
3627 semantic analysis; this code just generates RTL. */
3628 if (flag_syntax_only
)
3635 expand_or_defer_fn (tree fn
)
3637 if (expand_or_defer_fn_1 (fn
))
3641 /* Expand or defer, at the whim of the compilation unit manager. */
3642 cgraph_finalize_function (fn
, function_depth
> 1);
3643 emit_associated_thunks (fn
);
3656 /* Helper function for walk_tree, used by finalize_nrv below. */
3659 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3661 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3664 /* No need to walk into types. There wouldn't be any need to walk into
3665 non-statements, except that we have to consider STMT_EXPRs. */
3668 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3669 but differs from using NULL_TREE in that it indicates that we care
3670 about the value of the RESULT_DECL. */
3671 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3672 TREE_OPERAND (*tp
, 0) = dp
->result
;
3673 /* Change all cleanups for the NRV to only run when an exception is
3675 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3676 && CLEANUP_DECL (*tp
) == dp
->var
)
3677 CLEANUP_EH_ONLY (*tp
) = 1;
3678 /* Replace the DECL_EXPR for the NRV with an initialization of the
3679 RESULT_DECL, if needed. */
3680 else if (TREE_CODE (*tp
) == DECL_EXPR
3681 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3684 if (DECL_INITIAL (dp
->var
)
3685 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3686 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3687 DECL_INITIAL (dp
->var
));
3689 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3690 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3691 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3694 /* And replace all uses of the NRV with the RESULT_DECL. */
3695 else if (*tp
== dp
->var
)
3698 /* Avoid walking into the same tree more than once. Unfortunately, we
3699 can't just use walk_tree_without duplicates because it would only call
3700 us for the first occurrence of dp->var in the function body. */
3701 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3707 /* Keep iterating. */
3711 /* Called from finish_function to implement the named return value
3712 optimization by overriding all the RETURN_EXPRs and pertinent
3713 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3714 RESULT_DECL for the function. */
3717 finalize_nrv (tree
*tp
, tree var
, tree result
)
3719 struct nrv_data data
;
3721 /* Copy name from VAR to RESULT. */
3722 DECL_NAME (result
) = DECL_NAME (var
);
3723 /* Don't forget that we take its address. */
3724 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3725 /* Finally set DECL_VALUE_EXPR to avoid assigning
3726 a stack slot at -O0 for the original var and debug info
3727 uses RESULT location for VAR. */
3728 SET_DECL_VALUE_EXPR (var
, result
);
3729 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3732 data
.result
= result
;
3733 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3734 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3735 htab_delete (data
.visited
);
3738 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3741 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3742 bool need_copy_ctor
, bool need_copy_assignment
)
3744 int save_errorcount
= errorcount
;
3747 /* Always allocate 3 elements for simplicity. These are the
3748 function decls for the ctor, dtor, and assignment op.
3749 This layout is known to the three lang hooks,
3750 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3751 and cxx_omp_clause_assign_op. */
3752 info
= make_tree_vec (3);
3753 CP_OMP_CLAUSE_INFO (c
) = info
;
3755 if (need_default_ctor
|| need_copy_ctor
)
3757 if (need_default_ctor
)
3758 t
= get_default_ctor (type
);
3760 t
= get_copy_ctor (type
, tf_warning_or_error
);
3762 if (t
&& !trivial_fn_p (t
))
3763 TREE_VEC_ELT (info
, 0) = t
;
3766 if ((need_default_ctor
|| need_copy_ctor
)
3767 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3768 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
3770 if (need_copy_assignment
)
3772 t
= get_copy_assign (type
);
3774 if (t
&& !trivial_fn_p (t
))
3775 TREE_VEC_ELT (info
, 2) = t
;
3778 return errorcount
!= save_errorcount
;
3781 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3782 Remove any elements from the list that are invalid. */
3785 finish_omp_clauses (tree clauses
)
3787 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3788 tree c
, t
, *pc
= &clauses
;
3791 bitmap_obstack_initialize (NULL
);
3792 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3793 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3794 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3796 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3798 bool remove
= false;
3800 switch (OMP_CLAUSE_CODE (c
))
3802 case OMP_CLAUSE_SHARED
:
3804 goto check_dup_generic
;
3805 case OMP_CLAUSE_PRIVATE
:
3807 goto check_dup_generic
;
3808 case OMP_CLAUSE_REDUCTION
:
3810 goto check_dup_generic
;
3811 case OMP_CLAUSE_COPYPRIVATE
:
3812 name
= "copyprivate";
3813 goto check_dup_generic
;
3814 case OMP_CLAUSE_COPYIN
:
3816 goto check_dup_generic
;
3818 t
= OMP_CLAUSE_DECL (c
);
3819 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3821 if (processing_template_decl
)
3824 error ("%qD is not a variable in clause %qs", t
, name
);
3826 error ("%qE is not a variable in clause %qs", t
, name
);
3829 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3830 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3831 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3833 error ("%qD appears more than once in data clauses", t
);
3837 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3840 case OMP_CLAUSE_FIRSTPRIVATE
:
3841 t
= OMP_CLAUSE_DECL (c
);
3842 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3844 if (processing_template_decl
)
3847 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3849 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3852 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3853 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3855 error ("%qD appears more than once in data clauses", t
);
3859 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3862 case OMP_CLAUSE_LASTPRIVATE
:
3863 t
= OMP_CLAUSE_DECL (c
);
3864 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3866 if (processing_template_decl
)
3869 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3871 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3874 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3875 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3877 error ("%qD appears more than once in data clauses", t
);
3881 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3885 t
= OMP_CLAUSE_IF_EXPR (c
);
3886 t
= maybe_convert_cond (t
);
3887 if (t
== error_mark_node
)
3889 OMP_CLAUSE_IF_EXPR (c
) = t
;
3892 case OMP_CLAUSE_NUM_THREADS
:
3893 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3894 if (t
== error_mark_node
)
3896 else if (!type_dependent_expression_p (t
)
3897 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3899 error ("num_threads expression must be integral");
3904 case OMP_CLAUSE_SCHEDULE
:
3905 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3908 else if (t
== error_mark_node
)
3910 else if (!type_dependent_expression_p (t
)
3911 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3913 error ("schedule chunk size expression must be integral");
3918 case OMP_CLAUSE_NOWAIT
:
3919 case OMP_CLAUSE_ORDERED
:
3920 case OMP_CLAUSE_DEFAULT
:
3921 case OMP_CLAUSE_UNTIED
:
3922 case OMP_CLAUSE_COLLAPSE
:
3930 *pc
= OMP_CLAUSE_CHAIN (c
);
3932 pc
= &OMP_CLAUSE_CHAIN (c
);
3935 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3937 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3938 bool remove
= false;
3939 bool need_complete_non_reference
= false;
3940 bool need_default_ctor
= false;
3941 bool need_copy_ctor
= false;
3942 bool need_copy_assignment
= false;
3943 bool need_implicitly_determined
= false;
3944 tree type
, inner_type
;
3948 case OMP_CLAUSE_SHARED
:
3950 need_implicitly_determined
= true;
3952 case OMP_CLAUSE_PRIVATE
:
3954 need_complete_non_reference
= true;
3955 need_default_ctor
= true;
3956 need_implicitly_determined
= true;
3958 case OMP_CLAUSE_FIRSTPRIVATE
:
3959 name
= "firstprivate";
3960 need_complete_non_reference
= true;
3961 need_copy_ctor
= true;
3962 need_implicitly_determined
= true;
3964 case OMP_CLAUSE_LASTPRIVATE
:
3965 name
= "lastprivate";
3966 need_complete_non_reference
= true;
3967 need_copy_assignment
= true;
3968 need_implicitly_determined
= true;
3970 case OMP_CLAUSE_REDUCTION
:
3972 need_implicitly_determined
= true;
3974 case OMP_CLAUSE_COPYPRIVATE
:
3975 name
= "copyprivate";
3976 need_copy_assignment
= true;
3978 case OMP_CLAUSE_COPYIN
:
3980 need_copy_assignment
= true;
3983 pc
= &OMP_CLAUSE_CHAIN (c
);
3987 t
= OMP_CLAUSE_DECL (c
);
3988 if (processing_template_decl
3989 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3991 pc
= &OMP_CLAUSE_CHAIN (c
);
3997 case OMP_CLAUSE_LASTPRIVATE
:
3998 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3999 need_default_ctor
= true;
4002 case OMP_CLAUSE_REDUCTION
:
4003 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4004 || POINTER_TYPE_P (TREE_TYPE (t
)))
4006 error ("%qE has invalid type for %<reduction%>", t
);
4009 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
4011 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
4019 error ("%qE has invalid type for %<reduction(%s)%>",
4020 t
, operator_name_info
[r_code
].name
);
4026 case OMP_CLAUSE_COPYIN
:
4027 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
4029 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
4038 if (need_complete_non_reference
)
4040 t
= require_complete_type (t
);
4041 if (t
== error_mark_node
)
4043 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4045 error ("%qE has reference type for %qs", t
, name
);
4049 if (need_implicitly_determined
)
4051 const char *share_name
= NULL
;
4053 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4054 share_name
= "threadprivate";
4055 else switch (cxx_omp_predetermined_sharing (t
))
4057 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
4059 case OMP_CLAUSE_DEFAULT_SHARED
:
4060 share_name
= "shared";
4062 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4063 share_name
= "private";
4070 error ("%qE is predetermined %qs for %qs",
4071 t
, share_name
, name
);
4076 /* We're interested in the base element, not arrays. */
4077 inner_type
= type
= TREE_TYPE (t
);
4078 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
4079 inner_type
= TREE_TYPE (inner_type
);
4081 /* Check for special function availability by building a call to one.
4082 Save the results, because later we won't be in the right context
4083 for making these queries. */
4084 if (CLASS_TYPE_P (inner_type
)
4085 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
4086 && !type_dependent_expression_p (t
)
4087 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
4088 need_copy_ctor
, need_copy_assignment
))
4092 *pc
= OMP_CLAUSE_CHAIN (c
);
4094 pc
= &OMP_CLAUSE_CHAIN (c
);
4097 bitmap_obstack_release (NULL
);
4101 /* For all variables in the tree_list VARS, mark them as thread local. */
4104 finish_omp_threadprivate (tree vars
)
4108 /* Mark every variable in VARS to be assigned thread local storage. */
4109 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4111 tree v
= TREE_PURPOSE (t
);
4113 if (error_operand_p (v
))
4115 else if (TREE_CODE (v
) != VAR_DECL
)
4116 error ("%<threadprivate%> %qD is not file, namespace "
4117 "or block scope variable", v
);
4118 /* If V had already been marked threadprivate, it doesn't matter
4119 whether it had been used prior to this point. */
4120 else if (TREE_USED (v
)
4121 && (DECL_LANG_SPECIFIC (v
) == NULL
4122 || !CP_DECL_THREADPRIVATE_P (v
)))
4123 error ("%qE declared %<threadprivate%> after first use", v
);
4124 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4125 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4126 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4127 error ("%<threadprivate%> %qE has incomplete type", v
);
4128 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4129 && CP_DECL_CONTEXT (v
) != current_class_type
)
4130 error ("%<threadprivate%> %qE directive not "
4131 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4134 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4135 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4137 retrofit_lang_decl (v
);
4139 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4140 after the allocation of the lang_decl structure. */
4141 if (DECL_DISCRIMINATOR_P (v
))
4142 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4145 if (! DECL_THREAD_LOCAL_P (v
))
4147 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4148 /* If rtl has been already set for this var, call
4149 make_decl_rtl once again, so that encode_section_info
4150 has a chance to look at the new decl flags. */
4151 if (DECL_RTL_SET_P (v
))
4154 CP_DECL_THREADPRIVATE_P (v
) = 1;
4159 /* Build an OpenMP structured block. */
4162 begin_omp_structured_block (void)
4164 return do_pushlevel (sk_omp
);
4168 finish_omp_structured_block (tree block
)
4170 return do_poplevel (block
);
4173 /* Similarly, except force the retention of the BLOCK. */
4176 begin_omp_parallel (void)
4178 keep_next_level (true);
4179 return begin_omp_structured_block ();
4183 finish_omp_parallel (tree clauses
, tree body
)
4187 body
= finish_omp_structured_block (body
);
4189 stmt
= make_node (OMP_PARALLEL
);
4190 TREE_TYPE (stmt
) = void_type_node
;
4191 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4192 OMP_PARALLEL_BODY (stmt
) = body
;
4194 return add_stmt (stmt
);
4198 begin_omp_task (void)
4200 keep_next_level (true);
4201 return begin_omp_structured_block ();
4205 finish_omp_task (tree clauses
, tree body
)
4209 body
= finish_omp_structured_block (body
);
4211 stmt
= make_node (OMP_TASK
);
4212 TREE_TYPE (stmt
) = void_type_node
;
4213 OMP_TASK_CLAUSES (stmt
) = clauses
;
4214 OMP_TASK_BODY (stmt
) = body
;
4216 return add_stmt (stmt
);
4219 /* Helper function for finish_omp_for. Convert Ith random access iterator
4220 into integral iterator. Return FALSE if successful. */
4223 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4224 tree condv
, tree incrv
, tree
*body
,
4225 tree
*pre_body
, tree clauses
)
4227 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4228 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4229 tree decl
= TREE_VEC_ELT (declv
, i
);
4230 tree init
= TREE_VEC_ELT (initv
, i
);
4231 tree cond
= TREE_VEC_ELT (condv
, i
);
4232 tree incr
= TREE_VEC_ELT (incrv
, i
);
4234 location_t elocus
= locus
;
4236 if (init
&& EXPR_HAS_LOCATION (init
))
4237 elocus
= EXPR_LOCATION (init
);
4239 switch (TREE_CODE (cond
))
4245 if (TREE_OPERAND (cond
, 1) == iter
)
4246 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4247 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4248 if (TREE_OPERAND (cond
, 0) != iter
)
4249 cond
= error_mark_node
;
4252 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4253 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4254 NULL
, tf_warning_or_error
);
4255 if (error_operand_p (tem
))
4260 cond
= error_mark_node
;
4263 if (cond
== error_mark_node
)
4265 error_at (elocus
, "invalid controlling predicate");
4268 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4269 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4270 tf_warning_or_error
);
4271 if (error_operand_p (diff
))
4273 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4275 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4276 TREE_OPERAND (cond
, 1), iter
);
4280 switch (TREE_CODE (incr
))
4282 case PREINCREMENT_EXPR
:
4283 case PREDECREMENT_EXPR
:
4284 case POSTINCREMENT_EXPR
:
4285 case POSTDECREMENT_EXPR
:
4286 if (TREE_OPERAND (incr
, 0) != iter
)
4288 incr
= error_mark_node
;
4291 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4292 tf_warning_or_error
);
4293 if (error_operand_p (iter_incr
))
4295 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4296 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4297 incr
= integer_one_node
;
4299 incr
= integer_minus_one_node
;
4302 if (TREE_OPERAND (incr
, 0) != iter
)
4303 incr
= error_mark_node
;
4304 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4305 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4307 tree rhs
= TREE_OPERAND (incr
, 1);
4308 if (TREE_OPERAND (rhs
, 0) == iter
)
4310 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4312 incr
= error_mark_node
;
4315 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4316 TREE_OPERAND (rhs
, 1),
4317 tf_warning_or_error
);
4318 if (error_operand_p (iter_incr
))
4320 incr
= TREE_OPERAND (rhs
, 1);
4321 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4322 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4324 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4325 incr
= fold_if_not_in_template (incr
);
4327 if (TREE_CODE (incr
) != INTEGER_CST
4328 && (TREE_CODE (incr
) != NOP_EXPR
4329 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4334 else if (TREE_OPERAND (rhs
, 1) == iter
)
4336 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4337 || TREE_CODE (rhs
) != PLUS_EXPR
)
4338 incr
= error_mark_node
;
4341 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4342 TREE_OPERAND (rhs
, 0),
4345 tf_warning_or_error
);
4346 if (error_operand_p (iter_incr
))
4348 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4350 tf_warning_or_error
);
4351 if (error_operand_p (iter_incr
))
4353 incr
= TREE_OPERAND (rhs
, 0);
4358 incr
= error_mark_node
;
4361 incr
= error_mark_node
;
4364 incr
= error_mark_node
;
4368 if (incr
== error_mark_node
)
4370 error_at (elocus
, "invalid increment expression");
4374 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4375 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4376 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4377 && OMP_CLAUSE_DECL (c
) == iter
)
4380 decl
= create_temporary_var (TREE_TYPE (diff
));
4382 add_decl_expr (decl
);
4383 last
= create_temporary_var (TREE_TYPE (diff
));
4385 add_decl_expr (last
);
4386 if (c
&& iter_incr
== NULL
)
4388 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4389 pushdecl (incr_var
);
4390 add_decl_expr (incr_var
);
4392 gcc_assert (stmts_are_full_exprs_p ());
4394 orig_pre_body
= *pre_body
;
4395 *pre_body
= push_stmt_list ();
4397 add_stmt (orig_pre_body
);
4399 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4400 tf_warning_or_error
));
4401 init
= build_int_cst (TREE_TYPE (diff
), 0);
4402 if (c
&& iter_incr
== NULL
)
4404 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4405 incr
, tf_warning_or_error
));
4407 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4408 tf_warning_or_error
);
4410 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4411 tf_warning_or_error
));
4412 *pre_body
= pop_stmt_list (*pre_body
);
4414 cond
= cp_build_binary_op (elocus
,
4415 TREE_CODE (cond
), decl
, diff
,
4416 tf_warning_or_error
);
4417 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4418 elocus
, incr
, NULL_TREE
);
4421 *body
= push_stmt_list ();
4422 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4423 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4424 tf_warning_or_error
);
4425 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4426 finish_expr_stmt (iter_init
);
4427 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4428 tf_warning_or_error
));
4429 add_stmt (orig_body
);
4430 *body
= pop_stmt_list (*body
);
4434 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4435 finish_expr_stmt (iter_incr
);
4436 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4437 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4440 TREE_VEC_ELT (declv
, i
) = decl
;
4441 TREE_VEC_ELT (initv
, i
) = init
;
4442 TREE_VEC_ELT (condv
, i
) = cond
;
4443 TREE_VEC_ELT (incrv
, i
) = incr
;
4448 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4449 are directly for their associated operands in the statement. DECL
4450 and INIT are a combo; if DECL is NULL then INIT ought to be a
4451 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4452 optional statements that need to go before the loop into its
4456 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4457 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4459 tree omp_for
= NULL
, orig_incr
= NULL
;
4460 tree decl
, init
, cond
, incr
;
4464 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4465 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4466 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4467 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4469 decl
= TREE_VEC_ELT (declv
, i
);
4470 init
= TREE_VEC_ELT (initv
, i
);
4471 cond
= TREE_VEC_ELT (condv
, i
);
4472 incr
= TREE_VEC_ELT (incrv
, i
);
4478 switch (TREE_CODE (init
))
4481 decl
= TREE_OPERAND (init
, 0);
4482 init
= TREE_OPERAND (init
, 1);
4485 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4487 decl
= TREE_OPERAND (init
, 0);
4488 init
= TREE_OPERAND (init
, 2);
4498 "expected iteration declaration or initialization");
4503 if (init
&& EXPR_HAS_LOCATION (init
))
4504 elocus
= EXPR_LOCATION (init
);
4508 error_at (elocus
, "missing controlling predicate");
4514 error_at (elocus
, "missing increment expression");
4518 TREE_VEC_ELT (declv
, i
) = decl
;
4519 TREE_VEC_ELT (initv
, i
) = init
;
4522 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4526 stmt
= make_node (OMP_FOR
);
4528 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4530 /* This is really just a place-holder. We'll be decomposing this
4531 again and going through the cp_build_modify_expr path below when
4532 we instantiate the thing. */
4533 TREE_VEC_ELT (initv
, i
)
4534 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4535 TREE_VEC_ELT (initv
, i
));
4538 TREE_TYPE (stmt
) = void_type_node
;
4539 OMP_FOR_INIT (stmt
) = initv
;
4540 OMP_FOR_COND (stmt
) = condv
;
4541 OMP_FOR_INCR (stmt
) = incrv
;
4542 OMP_FOR_BODY (stmt
) = body
;
4543 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4544 OMP_FOR_CLAUSES (stmt
) = clauses
;
4546 SET_EXPR_LOCATION (stmt
, locus
);
4547 return add_stmt (stmt
);
4550 if (processing_template_decl
)
4551 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4553 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4555 decl
= TREE_VEC_ELT (declv
, i
);
4556 init
= TREE_VEC_ELT (initv
, i
);
4557 cond
= TREE_VEC_ELT (condv
, i
);
4558 incr
= TREE_VEC_ELT (incrv
, i
);
4560 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4563 if (init
&& EXPR_HAS_LOCATION (init
))
4564 elocus
= EXPR_LOCATION (init
);
4568 error_at (elocus
, "expected iteration declaration or initialization");
4572 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4575 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4576 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4577 TREE_CODE (TREE_OPERAND (incr
, 1)),
4578 TREE_OPERAND (incr
, 2),
4579 tf_warning_or_error
);
4582 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4584 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4585 incrv
, &body
, &pre_body
, clauses
))
4590 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4591 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4593 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4597 if (!processing_template_decl
)
4599 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4600 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4603 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4605 && TREE_SIDE_EFFECTS (cond
)
4606 && COMPARISON_CLASS_P (cond
)
4607 && !processing_template_decl
)
4609 tree t
= TREE_OPERAND (cond
, 0);
4610 if (TREE_SIDE_EFFECTS (t
)
4612 && (TREE_CODE (t
) != NOP_EXPR
4613 || TREE_OPERAND (t
, 0) != decl
))
4614 TREE_OPERAND (cond
, 0)
4615 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4617 t
= TREE_OPERAND (cond
, 1);
4618 if (TREE_SIDE_EFFECTS (t
)
4620 && (TREE_CODE (t
) != NOP_EXPR
4621 || TREE_OPERAND (t
, 0) != decl
))
4622 TREE_OPERAND (cond
, 1)
4623 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4625 if (decl
== error_mark_node
|| init
== error_mark_node
)
4628 TREE_VEC_ELT (declv
, i
) = decl
;
4629 TREE_VEC_ELT (initv
, i
) = init
;
4630 TREE_VEC_ELT (condv
, i
) = cond
;
4631 TREE_VEC_ELT (incrv
, i
) = incr
;
4635 if (IS_EMPTY_STMT (pre_body
))
4638 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4641 if (omp_for
== NULL
)
4644 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4646 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4647 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4649 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4652 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4653 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4654 && !processing_template_decl
)
4656 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4657 if (TREE_SIDE_EFFECTS (t
)
4659 && (TREE_CODE (t
) != NOP_EXPR
4660 || TREE_OPERAND (t
, 0) != decl
))
4661 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4662 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4664 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4665 if (TREE_SIDE_EFFECTS (t
)
4667 && (TREE_CODE (t
) != NOP_EXPR
4668 || TREE_OPERAND (t
, 0) != decl
))
4669 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4670 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4674 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4676 if (omp_for
!= NULL
)
4677 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4682 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4691 dependent_p
= false;
4694 /* Even in a template, we can detect invalid uses of the atomic
4695 pragma if neither LHS nor RHS is type-dependent. */
4696 if (processing_template_decl
)
4698 dependent_p
= (type_dependent_expression_p (lhs
)
4699 || type_dependent_expression_p (rhs
));
4702 lhs
= build_non_dependent_expr (lhs
);
4703 rhs
= build_non_dependent_expr (rhs
);
4708 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4709 if (stmt
== error_mark_node
)
4712 if (processing_template_decl
)
4713 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4714 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4719 finish_omp_barrier (void)
4721 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4722 VEC(tree
,gc
) *vec
= make_tree_vector ();
4723 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4724 release_tree_vector (vec
);
4725 finish_expr_stmt (stmt
);
4729 finish_omp_flush (void)
4731 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4732 VEC(tree
,gc
) *vec
= make_tree_vector ();
4733 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4734 release_tree_vector (vec
);
4735 finish_expr_stmt (stmt
);
4739 finish_omp_taskwait (void)
4741 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4742 VEC(tree
,gc
) *vec
= make_tree_vector ();
4743 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4744 release_tree_vector (vec
);
4745 finish_expr_stmt (stmt
);
4749 init_cp_semantics (void)
4753 /* Build a STATIC_ASSERT for a static assertion with the condition
4754 CONDITION and the message text MESSAGE. LOCATION is the location
4755 of the static assertion in the source code. When MEMBER_P, this
4756 static assertion is a member of a class. */
4758 finish_static_assert (tree condition
, tree message
, location_t location
,
4761 if (check_for_bare_parameter_packs (condition
))
4762 condition
= error_mark_node
;
4764 if (type_dependent_expression_p (condition
)
4765 || value_dependent_expression_p (condition
))
4767 /* We're in a template; build a STATIC_ASSERT and put it in
4771 assertion
= make_node (STATIC_ASSERT
);
4772 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4773 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4774 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4777 maybe_add_class_template_decl_list (current_class_type
,
4781 add_stmt (assertion
);
4786 /* Fold the expression and convert it to a boolean value. */
4787 condition
= fold_non_dependent_expr (condition
);
4788 condition
= cp_convert (boolean_type_node
, condition
);
4789 condition
= maybe_constant_value (condition
);
4791 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4792 /* Do nothing; the condition is satisfied. */
4796 location_t saved_loc
= input_location
;
4798 input_location
= location
;
4799 if (TREE_CODE (condition
) == INTEGER_CST
4800 && integer_zerop (condition
))
4801 /* Report the error. */
4802 error ("static assertion failed: %E", message
);
4803 else if (condition
&& condition
!= error_mark_node
)
4805 error ("non-constant condition for static assertion");
4806 cxx_constant_value (condition
);
4808 input_location
= saved_loc
;
4812 /* Returns the type of EXPR for cases where we can determine it even though
4813 EXPR is a type-dependent expression. */
4816 describable_type (tree expr
)
4818 tree type
= NULL_TREE
;
4820 if (! type_dependent_expression_p (expr
)
4821 && ! type_unknown_p (expr
))
4823 type
= unlowered_expr_type (expr
);
4824 if (real_lvalue_p (expr
))
4825 type
= build_reference_type (type
);
4831 switch (TREE_CODE (expr
))
4837 return TREE_TYPE (expr
);
4842 case TEMPLATE_PARM_INDEX
:
4844 case STATIC_CAST_EXPR
:
4845 case REINTERPRET_CAST_EXPR
:
4846 case CONST_CAST_EXPR
:
4847 case DYNAMIC_CAST_EXPR
:
4848 type
= TREE_TYPE (expr
);
4853 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4854 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4855 type
= build_reference_type (TREE_TYPE (ptrtype
));
4860 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4861 type
= TREE_TYPE (expr
);
4865 if (type
&& type_uses_auto (type
))
4871 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4872 suitable for use as a type-specifier.
4874 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4875 id-expression or a class member access, FALSE when it was parsed as
4876 a full expression. */
4879 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
4880 tsubst_flags_t complain
)
4882 tree type
= NULL_TREE
;
4884 if (!expr
|| error_operand_p (expr
))
4885 return error_mark_node
;
4888 || TREE_CODE (expr
) == TYPE_DECL
4889 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4890 && TYPE_P (TREE_OPERAND (expr
, 0))))
4892 if (complain
& tf_error
)
4893 error ("argument to decltype must be an expression");
4894 return error_mark_node
;
4897 /* FIXME instantiation-dependent */
4898 if (type_dependent_expression_p (expr
)
4899 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4900 if it isn't dependent, so that we can check access control at
4901 instantiation time, so defer the decltype as well (PR 42277). */
4902 || (id_expression_or_member_access_p
4903 && processing_template_decl
4904 && TREE_CODE (expr
) == COMPONENT_REF
))
4906 type
= cxx_make_type (DECLTYPE_TYPE
);
4907 DECLTYPE_TYPE_EXPR (type
) = expr
;
4908 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4909 = id_expression_or_member_access_p
;
4910 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4915 /* The type denoted by decltype(e) is defined as follows: */
4917 expr
= resolve_nondeduced_context (expr
);
4919 if (type_unknown_p (expr
))
4921 if (complain
& tf_error
)
4922 error ("decltype cannot resolve address of overloaded function");
4923 return error_mark_node
;
4926 /* To get the size of a static data member declared as an array of
4927 unknown bound, we need to instantiate it. */
4928 if (TREE_CODE (expr
) == VAR_DECL
4929 && VAR_HAD_UNKNOWN_BOUND (expr
)
4930 && DECL_TEMPLATE_INSTANTIATION (expr
))
4931 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4933 if (id_expression_or_member_access_p
)
4935 /* If e is an id-expression or a class member access (5.2.5
4936 [expr.ref]), decltype(e) is defined as the type of the entity
4937 named by e. If there is no such entity, or e names a set of
4938 overloaded functions, the program is ill-formed. */
4939 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4940 expr
= lookup_name (expr
);
4942 if (TREE_CODE (expr
) == INDIRECT_REF
)
4943 /* This can happen when the expression is, e.g., "a.b". Just
4944 look at the underlying operand. */
4945 expr
= TREE_OPERAND (expr
, 0);
4947 if (TREE_CODE (expr
) == OFFSET_REF
4948 || TREE_CODE (expr
) == MEMBER_REF
)
4949 /* We're only interested in the field itself. If it is a
4950 BASELINK, we will need to see through it in the next
4952 expr
= TREE_OPERAND (expr
, 1);
4954 if (TREE_CODE (expr
) == BASELINK
)
4955 /* See through BASELINK nodes to the underlying function. */
4956 expr
= BASELINK_FUNCTIONS (expr
);
4958 switch (TREE_CODE (expr
))
4961 if (DECL_BIT_FIELD_TYPE (expr
))
4963 type
= DECL_BIT_FIELD_TYPE (expr
);
4966 /* Fall through for fields that aren't bitfields. */
4973 case TEMPLATE_PARM_INDEX
:
4974 expr
= mark_type_use (expr
);
4975 type
= TREE_TYPE (expr
);
4979 type
= error_mark_node
;
4983 mark_type_use (expr
);
4984 type
= is_bitfield_expr_with_lowered_type (expr
);
4986 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4993 /* We can get here when the id-expression refers to an
4995 type
= TREE_TYPE (expr
);
5000 return error_mark_node
;
5005 /* Within a lambda-expression:
5007 Every occurrence of decltype((x)) where x is a possibly
5008 parenthesized id-expression that names an entity of
5009 automatic storage duration is treated as if x were
5010 transformed into an access to a corresponding data member
5011 of the closure type that would have been declared if x
5012 were a use of the denoted entity. */
5013 if (outer_automatic_var_p (expr
)
5014 && current_function_decl
5015 && LAMBDA_FUNCTION_P (current_function_decl
))
5016 type
= capture_decltype (expr
);
5017 else if (error_operand_p (expr
))
5018 type
= error_mark_node
;
5019 else if (expr
== current_class_ptr
)
5020 /* If the expression is just "this", we want the
5021 cv-unqualified pointer for the "this" type. */
5022 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
5025 /* Otherwise, where T is the type of e, if e is an lvalue,
5026 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5027 cp_lvalue_kind clk
= lvalue_kind (expr
);
5028 type
= unlowered_expr_type (expr
);
5029 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
5030 if (clk
!= clk_none
&& !(clk
& clk_class
))
5031 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
5038 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5039 __has_nothrow_copy, depending on assign_p. */
5042 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5049 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5052 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5054 else if (TYPE_HAS_COPY_CTOR (type
))
5056 /* If construction of the copy constructor was postponed, create
5058 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5059 lazily_declare_fn (sfk_copy_constructor
, type
);
5060 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5061 lazily_declare_fn (sfk_move_constructor
, type
);
5062 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5067 for (; fns
; fns
= OVL_NEXT (fns
))
5069 tree fn
= OVL_CURRENT (fns
);
5073 if (copy_fn_p (fn
) == 0)
5076 else if (copy_fn_p (fn
) <= 0)
5079 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5086 /* Actually evaluates the trait. */
5089 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5091 enum tree_code type_code1
;
5094 type_code1
= TREE_CODE (type1
);
5098 case CPTK_HAS_NOTHROW_ASSIGN
:
5099 type1
= strip_array_types (type1
);
5100 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5101 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5102 || (CLASS_TYPE_P (type1
)
5103 && classtype_has_nothrow_assign_or_copy_p (type1
,
5106 case CPTK_HAS_TRIVIAL_ASSIGN
:
5107 /* ??? The standard seems to be missing the "or array of such a class
5108 type" wording for this trait. */
5109 type1
= strip_array_types (type1
);
5110 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5111 && (trivial_type_p (type1
)
5112 || (CLASS_TYPE_P (type1
)
5113 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5115 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5116 type1
= strip_array_types (type1
);
5117 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5118 || (CLASS_TYPE_P (type1
)
5119 && (t
= locate_ctor (type1
))
5120 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5122 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5123 type1
= strip_array_types (type1
);
5124 return (trivial_type_p (type1
)
5125 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5127 case CPTK_HAS_NOTHROW_COPY
:
5128 type1
= strip_array_types (type1
);
5129 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5130 || (CLASS_TYPE_P (type1
)
5131 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5133 case CPTK_HAS_TRIVIAL_COPY
:
5134 /* ??? The standard seems to be missing the "or array of such a class
5135 type" wording for this trait. */
5136 type1
= strip_array_types (type1
);
5137 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5138 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5140 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5141 type1
= strip_array_types (type1
);
5142 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5143 || (CLASS_TYPE_P (type1
)
5144 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5146 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5147 return type_has_virtual_destructor (type1
);
5149 case CPTK_IS_ABSTRACT
:
5150 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5152 case CPTK_IS_BASE_OF
:
5153 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5154 && DERIVED_FROM_P (type1
, type2
));
5157 return (NON_UNION_CLASS_TYPE_P (type1
));
5159 case CPTK_IS_CONVERTIBLE_TO
:
5164 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5167 return (type_code1
== ENUMERAL_TYPE
);
5169 case CPTK_IS_LITERAL_TYPE
:
5170 return (literal_type_p (type1
));
5173 return (pod_type_p (type1
));
5175 case CPTK_IS_POLYMORPHIC
:
5176 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5178 case CPTK_IS_STD_LAYOUT
:
5179 return (std_layout_type_p (type1
));
5181 case CPTK_IS_TRIVIAL
:
5182 return (trivial_type_p (type1
));
5185 return (type_code1
== UNION_TYPE
);
5193 /* Returns true if TYPE is a complete type, an array of unknown bound,
5194 or (possibly cv-qualified) void, returns false otherwise. */
5197 check_trait_type (tree type
)
5199 if (COMPLETE_TYPE_P (type
))
5202 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5203 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5206 if (VOID_TYPE_P (type
))
5212 /* Process a trait expression. */
5215 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5217 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5218 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5219 || kind
== CPTK_HAS_NOTHROW_COPY
5220 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5221 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5222 || kind
== CPTK_HAS_TRIVIAL_COPY
5223 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5224 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5225 || kind
== CPTK_IS_ABSTRACT
5226 || kind
== CPTK_IS_BASE_OF
5227 || kind
== CPTK_IS_CLASS
5228 || kind
== CPTK_IS_CONVERTIBLE_TO
5229 || kind
== CPTK_IS_EMPTY
5230 || kind
== CPTK_IS_ENUM
5231 || kind
== CPTK_IS_LITERAL_TYPE
5232 || kind
== CPTK_IS_POD
5233 || kind
== CPTK_IS_POLYMORPHIC
5234 || kind
== CPTK_IS_STD_LAYOUT
5235 || kind
== CPTK_IS_TRIVIAL
5236 || kind
== CPTK_IS_UNION
);
5238 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5240 sorry ("__is_convertible_to");
5241 return error_mark_node
;
5244 if (type1
== error_mark_node
5245 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5246 && type2
== error_mark_node
))
5247 return error_mark_node
;
5249 if (processing_template_decl
)
5251 tree trait_expr
= make_node (TRAIT_EXPR
);
5252 TREE_TYPE (trait_expr
) = boolean_type_node
;
5253 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5254 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5255 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5259 complete_type (type1
);
5261 complete_type (type2
);
5265 case CPTK_HAS_NOTHROW_ASSIGN
:
5266 case CPTK_HAS_TRIVIAL_ASSIGN
:
5267 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5268 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5269 case CPTK_HAS_NOTHROW_COPY
:
5270 case CPTK_HAS_TRIVIAL_COPY
:
5271 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5272 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5273 case CPTK_IS_ABSTRACT
:
5275 case CPTK_IS_LITERAL_TYPE
:
5277 case CPTK_IS_POLYMORPHIC
:
5278 case CPTK_IS_STD_LAYOUT
:
5279 case CPTK_IS_TRIVIAL
:
5280 if (!check_trait_type (type1
))
5282 error ("incomplete type %qT not allowed", type1
);
5283 return error_mark_node
;
5287 case CPTK_IS_BASE_OF
:
5288 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5289 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5290 && !COMPLETE_TYPE_P (type2
))
5292 error ("incomplete type %qT not allowed", type2
);
5293 return error_mark_node
;
5302 case CPTK_IS_CONVERTIBLE_TO
:
5307 return (trait_expr_value (kind
, type1
, type2
)
5308 ? boolean_true_node
: boolean_false_node
);
5311 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5312 which is ignored for C++. */
5315 set_float_const_decimal64 (void)
5320 clear_float_const_decimal64 (void)
5325 float_const_decimal64_p (void)
5331 /* Return true if T is a literal type. */
5334 literal_type_p (tree t
)
5336 if (SCALAR_TYPE_P (t
)
5337 || TREE_CODE (t
) == REFERENCE_TYPE
)
5339 if (CLASS_TYPE_P (t
))
5341 t
= complete_type (t
);
5342 gcc_assert (COMPLETE_TYPE_P (t
) || errorcount
);
5343 return CLASSTYPE_LITERAL_P (t
);
5345 if (TREE_CODE (t
) == ARRAY_TYPE
)
5346 return literal_type_p (strip_array_types (t
));
5350 /* If DECL is a variable declared `constexpr', require its type
5351 be literal. Return the DECL if OK, otherwise NULL. */
5354 ensure_literal_type_for_constexpr_object (tree decl
)
5356 tree type
= TREE_TYPE (decl
);
5357 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5358 && !processing_template_decl
)
5360 if (CLASS_TYPE_P (type
) && !COMPLETE_TYPE_P (complete_type (type
)))
5361 /* Don't complain here, we'll complain about incompleteness
5362 when we try to initialize the variable. */;
5363 else if (!literal_type_p (type
))
5365 error ("the type %qT of constexpr variable %qD is not literal",
5373 /* Representation of entries in the constexpr function definition table. */
5375 typedef struct GTY(()) constexpr_fundef
{
5380 /* This table holds all constexpr function definitions seen in
5381 the current translation unit. */
5383 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5385 /* Utility function used for managing the constexpr function table.
5386 Return true if the entries pointed to by P and Q are for the
5387 same constexpr function. */
5390 constexpr_fundef_equal (const void *p
, const void *q
)
5392 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5393 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5394 return lhs
->decl
== rhs
->decl
;
5397 /* Utility function used for managing the constexpr function table.
5398 Return a hash value for the entry pointed to by Q. */
5400 static inline hashval_t
5401 constexpr_fundef_hash (const void *p
)
5403 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5404 return DECL_UID (fundef
->decl
);
5407 /* Return a previously saved definition of function FUN. */
5409 static constexpr_fundef
*
5410 retrieve_constexpr_fundef (tree fun
)
5412 constexpr_fundef fundef
= { NULL
, NULL
};
5413 if (constexpr_fundef_table
== NULL
)
5417 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5420 /* Check whether the parameter and return types of FUN are valid for a
5421 constexpr function, and complain if COMPLAIN. */
5424 is_valid_constexpr_fn (tree fun
, bool complain
)
5426 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5428 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5429 if (!literal_type_p (TREE_TYPE (parm
)))
5433 error ("invalid type for parameter %d of constexpr "
5434 "function %q+#D", DECL_PARM_INDEX (parm
), fun
);
5437 if (!DECL_CONSTRUCTOR_P (fun
))
5439 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5440 if (!literal_type_p (rettype
))
5444 error ("invalid return type %qT of constexpr function %q+D",
5448 /* Check this again here for cxx_eval_call_expression. */
5449 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5450 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun
)))
5454 error ("enclosing class of %q+#D is not a literal type", fun
);
5461 /* Return non-null if FUN certainly designates a valid constexpr function
5462 declaration. Otherwise return NULL. Issue appropriate diagnostics
5463 if necessary. Note that we only check the declaration, not the body
5467 validate_constexpr_fundecl (tree fun
)
5469 if (processing_template_decl
|| !DECL_DECLARED_CONSTEXPR_P (fun
))
5471 else if (DECL_CLONED_FUNCTION_P (fun
))
5472 /* We already checked the original function. */
5475 if (!is_valid_constexpr_fn (fun
, !DECL_TEMPLATE_INFO (fun
)))
5477 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5484 /* Subroutine of build_constexpr_constructor_member_initializers.
5485 The expression tree T represents a data member initialization
5486 in a (constexpr) constructor definition. Build a pairing of
5487 the data member with its initializer, and prepend that pair
5488 to the existing initialization pair INITS. */
5491 build_data_member_initialization (tree t
, VEC(constructor_elt
,gc
) **vec
)
5494 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5495 t
= TREE_OPERAND (t
, 0);
5496 if (TREE_CODE (t
) == EXPR_STMT
)
5497 t
= TREE_OPERAND (t
, 0);
5498 if (t
== error_mark_node
)
5500 if (TREE_CODE (t
) == STATEMENT_LIST
)
5502 tree_stmt_iterator i
;
5503 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5505 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5510 if (TREE_CODE (t
) == CLEANUP_STMT
)
5512 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5513 but we can in a constexpr constructor for a non-literal class. Just
5514 ignore it; either all the initialization will be constant, in which
5515 case the cleanup can't run, or it can't be constexpr.
5516 Still recurse into CLEANUP_BODY. */
5517 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5519 if (TREE_CODE (t
) == CONVERT_EXPR
)
5520 t
= TREE_OPERAND (t
, 0);
5521 if (TREE_CODE (t
) == INIT_EXPR
5522 || TREE_CODE (t
) == MODIFY_EXPR
)
5524 member
= TREE_OPERAND (t
, 0);
5525 init
= unshare_expr (TREE_OPERAND (t
, 1));
5529 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
5530 member
= CALL_EXPR_ARG (t
, 0);
5531 /* We don't use build_cplus_new here because it complains about
5532 abstract bases. Leaving the call unwrapped means that it has the
5533 wrong type, but cxx_eval_constant_expression doesn't care. */
5534 init
= unshare_expr (t
);
5536 if (TREE_CODE (member
) == INDIRECT_REF
)
5537 member
= TREE_OPERAND (member
, 0);
5538 if (TREE_CODE (member
) == NOP_EXPR
)
5542 if (TREE_CODE (op
) == ADDR_EXPR
)
5544 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5545 (TREE_TYPE (TREE_TYPE (op
)),
5546 TREE_TYPE (TREE_TYPE (member
))));
5547 /* Initializing a cv-qualified member; we need to look through
5553 /* We don't put out anything for an empty base. */
5554 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
5555 /* But if the initializer isn't constexpr, leave it in so we
5557 if (potential_constant_expression (init
))
5561 if (TREE_CODE (member
) == ADDR_EXPR
)
5562 member
= TREE_OPERAND (member
, 0);
5563 if (TREE_CODE (member
) == COMPONENT_REF
5564 /* If we're initializing a member of a subaggregate, it's a vtable
5565 pointer. Leave it as COMPONENT_REF so we remember the path to get
5567 && TREE_CODE (TREE_OPERAND (member
, 0)) != COMPONENT_REF
)
5568 member
= TREE_OPERAND (member
, 1);
5569 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
5573 /* Make sure that there are no statements after LAST in the constructor
5574 body represented by LIST. */
5577 check_constexpr_ctor_body (tree last
, tree list
)
5580 if (TREE_CODE (list
) == STATEMENT_LIST
)
5582 tree_stmt_iterator i
= tsi_last (list
);
5583 for (; !tsi_end_p (i
); tsi_prev (&i
))
5585 tree t
= tsi_stmt (i
);
5588 if (TREE_CODE (t
) == BIND_EXPR
)
5590 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
5595 /* We currently allow typedefs and static_assert.
5596 FIXME allow them in the standard, too. */
5597 if (TREE_CODE (t
) != STATIC_ASSERT
)
5604 else if (list
!= last
5605 && TREE_CODE (list
) != STATIC_ASSERT
)
5609 error ("constexpr constructor does not have empty body");
5610 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
5615 /* Build compile-time evalable representations of member-initializer list
5616 for a constexpr constructor. */
5619 build_constexpr_constructor_member_initializers (tree type
, tree body
)
5621 VEC(constructor_elt
,gc
) *vec
= NULL
;
5623 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
5624 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
5625 body
= TREE_OPERAND (body
, 0);
5626 if (TREE_CODE (body
) == STATEMENT_LIST
)
5627 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
5628 body
= BIND_EXPR_BODY (body
);
5629 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5631 body
= TREE_OPERAND (body
, 0);
5632 if (TREE_CODE (body
) == EXPR_STMT
)
5633 body
= TREE_OPERAND (body
, 0);
5634 if (TREE_CODE (body
) == INIT_EXPR
5635 && (same_type_ignoring_top_level_qualifiers_p
5636 (TREE_TYPE (TREE_OPERAND (body
, 0)),
5637 current_class_type
)))
5640 return TREE_OPERAND (body
, 1);
5642 ok
= build_data_member_initialization (body
, &vec
);
5644 else if (TREE_CODE (body
) == STATEMENT_LIST
)
5646 tree_stmt_iterator i
;
5647 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5649 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
5655 gcc_assert (errorcount
> 0);
5657 return build_constructor (type
, vec
);
5659 return error_mark_node
;
5662 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5663 declared to be constexpr, or a sub-statement thereof. Returns the
5664 return value if suitable, error_mark_node for a statement not allowed in
5665 a constexpr function, or NULL_TREE if no return value was found. */
5668 constexpr_fn_retval (tree body
)
5670 switch (TREE_CODE (body
))
5672 case STATEMENT_LIST
:
5674 tree_stmt_iterator i
;
5675 tree expr
= NULL_TREE
;
5676 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5678 tree s
= constexpr_fn_retval (tsi_stmt (i
));
5679 if (s
== error_mark_node
)
5680 return error_mark_node
;
5681 else if (s
== NULL_TREE
)
5682 /* Keep iterating. */;
5684 /* Multiple return statements. */
5685 return error_mark_node
;
5693 return unshare_expr (TREE_OPERAND (body
, 0));
5696 if (TREE_CODE (DECL_EXPR_DECL (body
)) == USING_DECL
)
5698 return error_mark_node
;
5704 return error_mark_node
;
5708 /* We are processing the definition of the constexpr function FUN.
5709 Check that its BODY fulfills the propriate requirements and
5710 enter it in the constexpr function definition table.
5711 For constructor BODY is actually the TREE_LIST of the
5712 member-initializer list. */
5715 register_constexpr_fundef (tree fun
, tree body
)
5717 constexpr_fundef entry
;
5718 constexpr_fundef
**slot
;
5720 if (DECL_CONSTRUCTOR_P (fun
))
5721 body
= build_constexpr_constructor_member_initializers
5722 (DECL_CONTEXT (fun
), body
);
5725 if (TREE_CODE (body
) == BIND_EXPR
)
5726 body
= BIND_EXPR_BODY (body
);
5727 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
5728 body
= EH_SPEC_STMTS (body
);
5729 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
5730 body
= TREE_OPERAND (body
, 0);
5731 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5732 body
= TREE_OPERAND (body
, 0);
5733 body
= constexpr_fn_retval (body
);
5734 if (body
== NULL_TREE
|| body
== error_mark_node
)
5736 error ("body of constexpr function %qD not a return-statement", fun
);
5737 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5742 if (!potential_rvalue_constant_expression (body
))
5744 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5745 if (!DECL_TEMPLATE_INFO (fun
))
5746 require_potential_rvalue_constant_expression (body
);
5750 /* Create the constexpr function table if necessary. */
5751 if (constexpr_fundef_table
== NULL
)
5752 constexpr_fundef_table
= htab_create_ggc (101,
5753 constexpr_fundef_hash
,
5754 constexpr_fundef_equal
,
5758 slot
= (constexpr_fundef
**)
5759 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
5761 gcc_assert (*slot
== NULL
);
5762 *slot
= ggc_alloc_constexpr_fundef ();
5768 /* Objects of this type represent calls to constexpr functions
5769 along with the bindings of parameters to their arguments, for
5770 the purpose of compile time evaluation. */
5772 typedef struct GTY(()) constexpr_call
{
5773 /* Description of the constexpr function definition. */
5774 constexpr_fundef
*fundef
;
5775 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5776 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5777 Note: This arrangement is made to accomodate the use of
5778 iterative_hash_template_arg (see pt.c). If you change this
5779 representation, also change the hash calculation in
5780 cxx_eval_call_expression. */
5782 /* Result of the call.
5783 NULL means the call is being evaluated.
5784 error_mark_node means that the evaluation was erroneous;
5785 otherwise, the actuall value of the call. */
5787 /* The hash of this call; we remember it here to avoid having to
5788 recalculate it when expanding the hash table. */
5792 /* A table of all constexpr calls that have been evaluated by the
5793 compiler in this translation unit. */
5795 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
5797 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
5798 bool, bool, bool *);
5800 /* Compute a hash value for a constexpr call representation. */
5803 constexpr_call_hash (const void *p
)
5805 const constexpr_call
*info
= (const constexpr_call
*) p
;
5809 /* Return 1 if the objects pointed to by P and Q represent calls
5810 to the same constexpr function with the same arguments.
5811 Otherwise, return 0. */
5814 constexpr_call_equal (const void *p
, const void *q
)
5816 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
5817 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
5822 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
5824 lhs_bindings
= lhs
->bindings
;
5825 rhs_bindings
= rhs
->bindings
;
5826 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
5828 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
5829 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
5830 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
5831 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
5833 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
5834 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
5836 return lhs_bindings
== rhs_bindings
;
5839 /* Initialize the constexpr call table, if needed. */
5842 maybe_initialize_constexpr_call_table (void)
5844 if (constexpr_call_table
== NULL
)
5845 constexpr_call_table
= htab_create_ggc (101,
5846 constexpr_call_hash
,
5847 constexpr_call_equal
,
5851 /* Return true if T designates the implied `this' parameter. */
5854 is_this_parameter (tree t
)
5856 return t
== current_class_ptr
;
5859 /* We have an expression tree T that represents a call, either CALL_EXPR
5860 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5861 retrun the _DECL for that function. */
5864 get_function_named_in_call (tree t
)
5867 switch (TREE_CODE (t
))
5870 fun
= CALL_EXPR_FN (t
);
5873 case AGGR_INIT_EXPR
:
5874 fun
= AGGR_INIT_EXPR_FN (t
);
5881 if (TREE_CODE (fun
) == ADDR_EXPR
5882 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
5883 fun
= TREE_OPERAND (fun
, 0);
5887 /* We have an expression tree T that represents a call, either CALL_EXPR
5888 or AGGR_INIT_EXPR. Return the Nth argument. */
5891 get_nth_callarg (tree t
, int n
)
5893 switch (TREE_CODE (t
))
5896 return CALL_EXPR_ARG (t
, n
);
5898 case AGGR_INIT_EXPR
:
5899 return AGGR_INIT_EXPR_ARG (t
, n
);
5907 /* Look up the binding of the function parameter T in a constexpr
5908 function call context CALL. */
5911 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
5913 tree b
= purpose_member (t
, call
->bindings
);
5914 return TREE_VALUE (b
);
5917 /* Attempt to evaluate T which represents a call to a builtin function.
5918 We assume here that all builtin functions evaluate to scalar types
5919 represented by _CST nodes. */
5922 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
5923 bool allow_non_constant
, bool addr
,
5924 bool *non_constant_p
)
5926 const int nargs
= call_expr_nargs (t
);
5927 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
5930 for (i
= 0; i
< nargs
; ++i
)
5932 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
5933 allow_non_constant
, addr
,
5935 if (allow_non_constant
&& *non_constant_p
)
5938 if (*non_constant_p
)
5940 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
5941 CALL_EXPR_FN (t
), nargs
, args
);
5942 return fold (new_call
);
5945 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5946 the type of the value to match. */
5949 adjust_temp_type (tree type
, tree temp
)
5951 if (TREE_TYPE (temp
) == type
)
5953 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5954 if (TREE_CODE (temp
) == CONSTRUCTOR
)
5955 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
5956 gcc_assert (SCALAR_TYPE_P (type
));
5957 return cp_fold_convert (type
, temp
);
5960 /* Subroutine of cxx_eval_call_expression.
5961 We are processing a call expression (either CALL_EXPR or
5962 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5963 all arguments and bind their values to correspondings
5964 parameters, making up the NEW_CALL context. */
5967 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
5968 constexpr_call
*new_call
,
5969 bool allow_non_constant
,
5970 bool *non_constant_p
)
5972 const int nargs
= call_expr_nargs (t
);
5973 tree fun
= new_call
->fundef
->decl
;
5974 tree parms
= DECL_ARGUMENTS (fun
);
5976 for (i
= 0; i
< nargs
; ++i
)
5979 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
5980 /* For member function, the first argument is a pointer to the implied
5981 object. And for an object contruction, don't bind `this' before
5982 it is fully constructed. */
5983 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
5985 x
= get_nth_callarg (t
, i
);
5986 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
5987 TREE_CODE (type
) == REFERENCE_TYPE
,
5989 /* Don't VERIFY_CONSTANT here. */
5990 if (*non_constant_p
&& allow_non_constant
)
5992 /* Just discard ellipsis args after checking their constantitude. */
5995 if (*non_constant_p
)
5996 /* Don't try to adjust the type of non-constant args. */
5999 /* Make sure the binding has the same type as the parm. */
6000 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6001 arg
= adjust_temp_type (type
, arg
);
6002 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
6004 parms
= TREE_CHAIN (parms
);
6008 /* Variables and functions to manage constexpr call expansion context.
6009 These do not need to be marked for PCH or GC. */
6011 /* FIXME remember and print actual constant arguments. */
6012 static VEC(tree
,heap
) *call_stack
= NULL
;
6013 static int call_stack_tick
;
6014 static int last_cx_error_tick
;
6017 push_cx_call_context (tree call
)
6020 if (!EXPR_HAS_LOCATION (call
))
6021 SET_EXPR_LOCATION (call
, input_location
);
6022 VEC_safe_push (tree
, heap
, call_stack
, call
);
6023 if (VEC_length (tree
, call_stack
) > (unsigned) max_constexpr_depth
)
6029 pop_cx_call_context (void)
6032 VEC_pop (tree
, call_stack
);
6036 cx_error_context (void)
6038 VEC(tree
,heap
) *r
= NULL
;
6039 if (call_stack_tick
!= last_cx_error_tick
6040 && !VEC_empty (tree
, call_stack
))
6042 last_cx_error_tick
= call_stack_tick
;
6046 /* Subroutine of cxx_eval_constant_expression.
6047 Evaluate the call expression tree T in the context of OLD_CALL expression
6051 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
6052 bool allow_non_constant
, bool addr
,
6053 bool *non_constant_p
)
6055 location_t loc
= EXPR_LOC_OR_HERE (t
);
6056 tree fun
= get_function_named_in_call (t
);
6058 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
6059 constexpr_call
**slot
;
6060 constexpr_call
*entry
;
6063 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6065 /* Might be a constexpr function pointer. */
6066 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
6067 /*addr*/false, non_constant_p
);
6068 if (TREE_CODE (fun
) == ADDR_EXPR
)
6069 fun
= TREE_OPERAND (fun
, 0);
6071 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6073 if (!allow_non_constant
)
6074 error_at (loc
, "expression %qE does not designate a constexpr "
6076 *non_constant_p
= true;
6079 if (DECL_CLONED_FUNCTION_P (fun
))
6080 fun
= DECL_CLONED_FUNCTION (fun
);
6081 if (is_builtin_fn (fun
))
6082 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6083 addr
, non_constant_p
);
6084 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6086 if (!allow_non_constant
)
6088 error_at (loc
, "%qD is not a constexpr function", fun
);
6089 if (DECL_TEMPLATE_INFO (fun
)
6090 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
6091 (DECL_TI_TEMPLATE (fun
))))
6092 is_valid_constexpr_fn (fun
, true);
6094 *non_constant_p
= true;
6098 /* Shortcut trivial copy constructor/op=. */
6099 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6101 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6102 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6103 addr
, non_constant_p
);
6106 /* If in direct recursive call, optimize definition search. */
6107 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6108 new_call
.fundef
= old_call
->fundef
;
6111 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6112 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6114 if (!allow_non_constant
)
6115 error_at (loc
, "%qD used before its definition", fun
);
6116 *non_constant_p
= true;
6120 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6121 allow_non_constant
, non_constant_p
);
6122 if (*non_constant_p
)
6125 depth_ok
= push_cx_call_context (t
);
6128 = iterative_hash_template_arg (new_call
.bindings
,
6129 constexpr_fundef_hash (new_call
.fundef
));
6131 /* If we have seen this call before, we are done. */
6132 maybe_initialize_constexpr_call_table ();
6133 slot
= (constexpr_call
**)
6134 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6138 /* We need to keep a pointer to the entry, not just the slot, as the
6139 slot can move in the call to cxx_eval_builtin_function_call. */
6140 *slot
= entry
= ggc_alloc_constexpr_call ();
6143 /* Calls which are in progress have their result set to NULL
6144 so that we can detect circular dependencies. */
6145 else if (entry
->result
== NULL
)
6147 if (!allow_non_constant
)
6148 error ("call has circular dependency");
6149 *non_constant_p
= true;
6150 entry
->result
= result
= error_mark_node
;
6155 if (!allow_non_constant
)
6156 error ("constexpr evaluation depth exceeds maximum of %d (use "
6157 "-fconstexpr-depth= to increase the maximum)",
6158 max_constexpr_depth
);
6159 *non_constant_p
= true;
6160 entry
->result
= result
= error_mark_node
;
6164 result
= entry
->result
;
6165 if (!result
|| (result
== error_mark_node
&& !allow_non_constant
))
6166 result
= (cxx_eval_constant_expression
6167 (&new_call
, new_call
.fundef
->body
,
6168 allow_non_constant
, addr
,
6170 if (result
== error_mark_node
)
6171 *non_constant_p
= true;
6172 if (*non_constant_p
)
6173 entry
->result
= result
= error_mark_node
;
6176 /* If this was a call to initialize an object, set the type of
6177 the CONSTRUCTOR to the type of that object. */
6178 if (DECL_CONSTRUCTOR_P (fun
))
6180 tree ob_arg
= get_nth_callarg (t
, 0);
6181 STRIP_NOPS (ob_arg
);
6182 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6183 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6184 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6187 entry
->result
= result
;
6191 pop_cx_call_context ();
6192 return unshare_expr (result
);
6195 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6198 reduced_constant_expression_p (tree t
)
6200 if (TREE_OVERFLOW_P (t
))
6201 /* Integer overflow makes this not a constant expression. */
6203 /* FIXME are we calling this too much? */
6204 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6207 /* Some expressions may have constant operands but are not constant
6208 themselves, such as 1/0. Call this function (or rather, the macro
6209 following it) to check for that condition.
6211 We only call this in places that require an arithmetic constant, not in
6212 places where we might have a non-constant expression that can be a
6213 component of a constant expression, such as the address of a constexpr
6214 variable that might be dereferenced later. */
6217 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
)
6219 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6221 if (!allow_non_constant
)
6223 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6224 printing the folded constant isn't helpful. */
6225 if (TREE_OVERFLOW_P (t
))
6227 permerror (input_location
, "overflow in constant expression");
6228 /* If we're being permissive (and are in an enforcing
6229 context), consider this constant. */
6230 if (flag_permissive
)
6234 error ("%q+E is not a constant expression", t
);
6236 *non_constant_p
= true;
6238 return *non_constant_p
;
6240 #define VERIFY_CONSTANT(X) \
6242 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6246 /* Subroutine of cxx_eval_constant_expression.
6247 Attempt to reduce the unary expression tree T to a compile time value.
6248 If successful, return the value. Otherwise issue a diagnostic
6249 and return error_mark_node. */
6252 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6253 bool allow_non_constant
, bool addr
,
6254 bool *non_constant_p
)
6257 tree orig_arg
= TREE_OPERAND (t
, 0);
6258 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6259 addr
, non_constant_p
);
6260 VERIFY_CONSTANT (arg
);
6261 if (arg
== orig_arg
)
6263 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6264 VERIFY_CONSTANT (r
);
6268 /* Subroutine of cxx_eval_constant_expression.
6269 Like cxx_eval_unary_expression, except for binary expressions. */
6272 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6273 bool allow_non_constant
, bool addr
,
6274 bool *non_constant_p
)
6277 tree orig_lhs
= TREE_OPERAND (t
, 0);
6278 tree orig_rhs
= TREE_OPERAND (t
, 1);
6280 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6281 allow_non_constant
, addr
,
6283 VERIFY_CONSTANT (lhs
);
6284 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6285 allow_non_constant
, addr
,
6287 VERIFY_CONSTANT (rhs
);
6288 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6290 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6291 VERIFY_CONSTANT (r
);
6295 /* Subroutine of cxx_eval_constant_expression.
6296 Attempt to evaluate condition expressions. Dead branches are not
6300 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6301 bool allow_non_constant
, bool addr
,
6302 bool *non_constant_p
)
6304 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6305 allow_non_constant
, addr
,
6307 VERIFY_CONSTANT (val
);
6308 /* Don't VERIFY_CONSTANT the other operands. */
6309 if (integer_zerop (val
))
6310 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6311 allow_non_constant
, addr
,
6313 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6314 allow_non_constant
, addr
,
6318 /* Subroutine of cxx_eval_constant_expression.
6319 Attempt to reduce a reference to an array slot. */
6322 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6323 bool allow_non_constant
, bool addr
,
6324 bool *non_constant_p
)
6326 tree oldary
= TREE_OPERAND (t
, 0);
6327 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6328 allow_non_constant
, addr
,
6333 unsigned len
, elem_nchars
= 1;
6334 if (*non_constant_p
)
6336 oldidx
= TREE_OPERAND (t
, 1);
6337 index
= cxx_eval_constant_expression (call
, oldidx
,
6338 allow_non_constant
, false,
6340 VERIFY_CONSTANT (index
);
6341 if (addr
&& ary
== oldary
&& index
== oldidx
)
6344 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
6345 elem_type
= TREE_TYPE (TREE_TYPE (ary
));
6346 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6347 len
= CONSTRUCTOR_NELTS (ary
);
6350 elem_nchars
= (TYPE_PRECISION (elem_type
)
6351 / TYPE_PRECISION (char_type_node
));
6352 len
= (unsigned) TREE_STRING_LENGTH (ary
) / elem_nchars
;
6354 if (compare_tree_int (index
, len
) >= 0)
6356 if (tree_int_cst_lt (index
, array_type_nelts_top (TREE_TYPE (ary
))))
6358 /* If it's within the array bounds but doesn't have an explicit
6359 initializer, it's value-initialized. */
6360 tree val
= build_value_init (elem_type
, tf_warning_or_error
);
6361 return cxx_eval_constant_expression (call
, val
,
6362 allow_non_constant
, addr
,
6366 if (!allow_non_constant
)
6367 error ("array subscript out of bound");
6368 *non_constant_p
= true;
6371 i
= tree_low_cst (index
, 0);
6372 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6373 return VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ary
), i
)->value
;
6374 else if (elem_nchars
== 1)
6375 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
6376 TREE_STRING_POINTER (ary
)[i
]);
6379 tree type
= cv_unqualified (TREE_TYPE (TREE_TYPE (ary
)));
6380 return native_interpret_expr (type
, (const unsigned char *)
6381 TREE_STRING_POINTER (ary
)
6382 + i
* elem_nchars
, elem_nchars
);
6384 /* Don't VERIFY_CONSTANT here. */
6387 /* Subroutine of cxx_eval_constant_expression.
6388 Attempt to reduce a field access of a value of class type. */
6391 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
6392 bool allow_non_constant
, bool addr
,
6393 bool *non_constant_p
)
6395 unsigned HOST_WIDE_INT i
;
6398 tree part
= TREE_OPERAND (t
, 1);
6399 tree orig_whole
= TREE_OPERAND (t
, 0);
6400 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6401 allow_non_constant
, addr
,
6403 if (whole
== orig_whole
)
6406 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
6407 whole
, part
, NULL_TREE
);
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
)
6418 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6423 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
)
6425 /* FIXME Mike Miller wants this to be OK. */
6426 if (!allow_non_constant
)
6427 error ("accessing %qD member instead of initialized %qD member in "
6428 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
6429 *non_constant_p
= true;
6433 return error_mark_node
;
6436 /* Subroutine of cxx_eval_constant_expression.
6437 Attempt to reduce a field access of a value of class type that is
6438 expressed as a BIT_FIELD_REF. */
6441 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
6442 bool allow_non_constant
, bool addr
,
6443 bool *non_constant_p
)
6445 tree orig_whole
= TREE_OPERAND (t
, 0);
6446 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6447 allow_non_constant
, addr
,
6449 tree start
, field
, value
;
6450 unsigned HOST_WIDE_INT i
;
6452 if (whole
== orig_whole
)
6454 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6456 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6458 if (!allow_non_constant
)
6459 error ("%qE is not a constant expression", orig_whole
);
6460 *non_constant_p
= true;
6462 if (*non_constant_p
)
6465 start
= TREE_OPERAND (t
, 2);
6466 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6468 if (bit_position (field
) == start
)
6472 return error_mark_node
;
6475 /* Subroutine of cxx_eval_constant_expression.
6476 Evaluate a short-circuited logical expression T in the context
6477 of a given constexpr CALL. BAILOUT_VALUE is the value for
6478 early return. CONTINUE_VALUE is used here purely for
6479 sanity check purposes. */
6482 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
6483 tree bailout_value
, tree continue_value
,
6484 bool allow_non_constant
, bool addr
,
6485 bool *non_constant_p
)
6488 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6489 allow_non_constant
, addr
,
6491 VERIFY_CONSTANT (lhs
);
6492 if (lhs
== bailout_value
)
6494 gcc_assert (lhs
== continue_value
);
6495 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6496 allow_non_constant
, addr
, non_constant_p
);
6497 VERIFY_CONSTANT (r
);
6501 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6502 CONSTRUCTOR elements to initialize (part of) an object containing that
6503 field. Return a pointer to the constructor_elt corresponding to the
6504 initialization of the field. */
6506 static constructor_elt
*
6507 base_field_constructor_elt (VEC(constructor_elt
,gc
) *v
, tree ref
)
6509 tree aggr
= TREE_OPERAND (ref
, 0);
6510 tree field
= TREE_OPERAND (ref
, 1);
6512 constructor_elt
*ce
;
6514 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
6516 if (TREE_CODE (aggr
) == COMPONENT_REF
)
6518 constructor_elt
*base_ce
6519 = base_field_constructor_elt (v
, aggr
);
6520 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
6523 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6524 if (ce
->index
== field
)
6531 /* Subroutine of cxx_eval_constant_expression.
6532 The expression tree T denotes a C-style array or a C-style
6533 aggregate. Reduce it to a constant expression. */
6536 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
6537 bool allow_non_constant
, bool addr
,
6538 bool *non_constant_p
)
6540 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
6541 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
,
6542 VEC_length (constructor_elt
, v
));
6543 constructor_elt
*ce
;
6545 bool changed
= false;
6546 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
6547 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6549 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
6550 allow_non_constant
, addr
,
6552 /* Don't VERIFY_CONSTANT here. */
6553 if (allow_non_constant
&& *non_constant_p
)
6555 if (elt
!= ce
->value
)
6557 if (TREE_CODE (ce
->index
) == COMPONENT_REF
)
6559 /* This is an initialization of a vfield inside a base
6560 subaggregate that we already initialized; push this
6561 initialization into the previous initialization. */
6562 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
6566 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
6568 if (*non_constant_p
|| !changed
)
6571 VEC_free (constructor_elt
, gc
, n
);
6574 t
= build_constructor (TREE_TYPE (t
), n
);
6575 TREE_CONSTANT (t
) = true;
6579 /* Subroutine of cxx_eval_constant_expression.
6580 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6581 initialization of a non-static data member of array type. Reduce it to a
6584 Note that apart from value-initialization (when VALUE_INIT is true),
6585 this is only intended to support value-initialization and the
6586 initializations done by defaulted constructors for classes with
6587 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6588 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6589 for the copy/move constructor. */
6592 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
6593 bool value_init
, bool allow_non_constant
, bool addr
,
6594 bool *non_constant_p
)
6596 tree elttype
= TREE_TYPE (atype
);
6597 int max
= tree_low_cst (array_type_nelts (atype
), 0);
6598 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
, max
+ 1);
6601 /* For the default constructor, build up a call to the default
6602 constructor of the element type. We only need to handle class types
6603 here, as for a constructor to be constexpr, all members must be
6604 initialized, which for a defaulted default constructor means they must
6605 be of a class type with a constexpr default constructor. */
6610 VEC(tree
,gc
) *argvec
= make_tree_vector ();
6611 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6612 &argvec
, elttype
, LOOKUP_NORMAL
,
6613 tf_warning_or_error
);
6614 release_tree_vector (argvec
);
6615 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
6616 addr
, non_constant_p
);
6619 if (*non_constant_p
&& !allow_non_constant
)
6622 for (i
= 0; i
<= max
; ++i
)
6624 tree idx
= build_int_cst (size_type_node
, i
);
6626 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
6628 /* A multidimensional array; recurse. */
6630 eltinit
= NULL_TREE
;
6632 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6633 tf_warning_or_error
);
6634 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
6635 allow_non_constant
, addr
,
6638 else if (value_init
)
6640 eltinit
= build_value_init (elttype
, tf_warning_or_error
);
6641 eltinit
= cxx_eval_constant_expression
6642 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6644 else if (TREE_CODE (init
) == CONSTRUCTOR
)
6646 /* Initializing an element using the call to the default
6647 constructor we just built above. */
6648 eltinit
= unshare_expr (init
);
6652 /* Copying an element. */
6653 VEC(tree
,gc
) *argvec
;
6654 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6655 (atype
, TREE_TYPE (init
)));
6656 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6657 tf_warning_or_error
);
6658 if (!real_lvalue_p (init
))
6659 eltinit
= move (eltinit
);
6660 argvec
= make_tree_vector ();
6661 VEC_quick_push (tree
, argvec
, eltinit
);
6662 eltinit
= (build_special_member_call
6663 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
6664 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
6665 release_tree_vector (argvec
);
6666 eltinit
= cxx_eval_constant_expression
6667 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6669 if (*non_constant_p
&& !allow_non_constant
)
6671 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
6674 if (!*non_constant_p
)
6676 init
= build_constructor (TREE_TYPE (atype
), n
);
6677 TREE_CONSTANT (init
) = true;
6682 VEC_free (constructor_elt
, gc
, n
);
6687 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
6688 bool allow_non_constant
, bool addr
,
6689 bool *non_constant_p
)
6691 tree atype
= TREE_TYPE (t
);
6692 tree init
= VEC_INIT_EXPR_INIT (t
);
6693 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
6694 VEC_INIT_EXPR_VALUE_INIT (t
),
6695 allow_non_constant
, addr
, non_constant_p
);
6696 if (*non_constant_p
)
6702 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6703 match. We want to be less strict for simple *& folding; if we have a
6704 non-const temporary that we access through a const pointer, that should
6705 work. We handle this here rather than change fold_indirect_ref_1
6706 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6707 don't really make sense outside of constant expression evaluation. Also
6708 we want to allow folding to COMPONENT_REF, which could cause trouble
6709 with TBAA in fold_indirect_ref_1. */
6712 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
6713 bool allow_non_constant
, bool addr
,
6714 bool *non_constant_p
)
6716 tree orig_op0
= TREE_OPERAND (t
, 0);
6717 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
6718 /*addr*/false, non_constant_p
);
6719 tree type
, sub
, subtype
, r
;
6722 /* Don't VERIFY_CONSTANT here. */
6723 if (*non_constant_p
)
6726 type
= TREE_TYPE (t
);
6732 subtype
= TREE_TYPE (sub
);
6733 gcc_assert (POINTER_TYPE_P (subtype
));
6735 if (TREE_CODE (sub
) == ADDR_EXPR
)
6737 tree op
= TREE_OPERAND (sub
, 0);
6738 tree optype
= TREE_TYPE (op
);
6740 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
6742 /* Also handle conversion to an empty base class, which
6743 is represented with a NOP_EXPR. */
6744 else if (!addr
&& is_empty_class (type
)
6745 && CLASS_TYPE_P (optype
)
6746 && DERIVED_FROM_P (type
, optype
))
6751 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6752 else if (RECORD_OR_UNION_TYPE_P (optype
))
6754 tree field
= TYPE_FIELDS (optype
);
6755 for (; field
; field
= DECL_CHAIN (field
))
6756 if (TREE_CODE (field
) == FIELD_DECL
6757 && integer_zerop (byte_position (field
))
6758 && (same_type_ignoring_top_level_qualifiers_p
6759 (TREE_TYPE (field
), type
)))
6761 r
= fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
6766 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
6767 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
6769 tree op00
= TREE_OPERAND (sub
, 0);
6770 tree op01
= TREE_OPERAND (sub
, 1);
6773 if (TREE_CODE (op00
) == ADDR_EXPR
)
6776 op00
= TREE_OPERAND (op00
, 0);
6777 op00type
= TREE_TYPE (op00
);
6779 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6780 if (RECORD_OR_UNION_TYPE_P (op00type
))
6782 tree field
= TYPE_FIELDS (op00type
);
6783 for (; field
; field
= DECL_CHAIN (field
))
6784 if (TREE_CODE (field
) == FIELD_DECL
6785 && tree_int_cst_equal (byte_position (field
), op01
)
6786 && (same_type_ignoring_top_level_qualifiers_p
6787 (TREE_TYPE (field
), type
)))
6789 r
= fold_build3 (COMPONENT_REF
, type
, op00
,
6797 /* Let build_fold_indirect_ref handle the cases it does fine with. */
6799 r
= build_fold_indirect_ref (op0
);
6800 if (TREE_CODE (r
) != INDIRECT_REF
)
6801 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
6802 addr
, non_constant_p
);
6803 else if (TREE_CODE (sub
) == ADDR_EXPR
6804 || TREE_CODE (sub
) == POINTER_PLUS_EXPR
)
6806 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6807 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
6808 /* FIXME Mike Miller wants this to be OK. */
6809 if (!allow_non_constant
)
6810 error ("accessing value of %qE through a %qT glvalue in a "
6811 "constant expression", build_fold_indirect_ref (sub
),
6813 *non_constant_p
= true;
6817 /* If we're pulling out the value of an empty base, make sure
6818 that the whole object is constant and then return an empty
6822 VERIFY_CONSTANT (r
);
6823 r
= build_constructor (TREE_TYPE (t
), NULL
);
6824 TREE_CONSTANT (r
) = true;
6827 if (TREE_CODE (r
) == INDIRECT_REF
&& TREE_OPERAND (r
, 0) == orig_op0
)
6832 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
6833 Shared between potential_constant_expression and
6834 cxx_eval_constant_expression. */
6837 non_const_var_error (tree r
)
6839 tree type
= TREE_TYPE (r
);
6840 error ("the value of %qD is not usable in a constant "
6842 /* Avoid error cascade. */
6843 if (DECL_INITIAL (r
) == error_mark_node
)
6845 if (DECL_DECLARED_CONSTEXPR_P (r
))
6846 inform (DECL_SOURCE_LOCATION (r
),
6847 "%qD used in its own initializer", r
);
6848 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6850 if (!CP_TYPE_CONST_P (type
))
6851 inform (DECL_SOURCE_LOCATION (r
),
6852 "%q#D is not const", r
);
6853 else if (CP_TYPE_VOLATILE_P (type
))
6854 inform (DECL_SOURCE_LOCATION (r
),
6855 "%q#D is volatile", r
);
6856 else if (!DECL_INITIAL (r
))
6857 inform (DECL_SOURCE_LOCATION (r
),
6858 "%qD was not initialized with a constant "
6865 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
6866 inform (DECL_SOURCE_LOCATION (r
),
6867 "%qD was not declared %<constexpr%>", r
);
6869 inform (DECL_SOURCE_LOCATION (r
),
6870 "%qD does not have integral or enumeration type",
6875 /* Attempt to reduce the expression T to a constant value.
6876 On failure, issue diagnostic and return error_mark_node. */
6877 /* FIXME unify with c_fully_fold */
6880 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
6881 bool allow_non_constant
, bool addr
,
6882 bool *non_constant_p
)
6886 if (t
== error_mark_node
)
6888 *non_constant_p
= true;
6891 if (CONSTANT_CLASS_P (t
))
6893 if (TREE_CODE (t
) == PTRMEM_CST
)
6894 t
= cplus_expand_constant (t
);
6897 if (TREE_CODE (t
) != NOP_EXPR
6898 && reduced_constant_expression_p (t
))
6901 switch (TREE_CODE (t
))
6906 /* else fall through. */
6908 r
= integral_constant_value (t
);
6909 if (TREE_CODE (r
) == TARGET_EXPR
6910 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
6911 r
= TARGET_EXPR_INITIAL (r
);
6914 if (!allow_non_constant
)
6915 non_const_var_error (r
);
6916 *non_constant_p
= true;
6926 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
6927 r
= lookup_parameter_binding (call
, t
);
6929 /* Defer in case this is only used for its type. */;
6932 if (!allow_non_constant
)
6933 error ("%qE is not a constant expression", t
);
6934 *non_constant_p
= true;
6939 case AGGR_INIT_EXPR
:
6940 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
6946 /* Pass false for 'addr' because these codes indicate
6947 initialization of a temporary. */
6948 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6949 allow_non_constant
, false,
6951 if (!*non_constant_p
)
6952 /* Adjust the type of the result to the type of the temporary. */
6953 r
= adjust_temp_type (TREE_TYPE (t
), r
);
6957 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6958 allow_non_constant
, addr
,
6963 case NON_LVALUE_EXPR
:
6964 case TRY_CATCH_EXPR
:
6965 case CLEANUP_POINT_EXPR
:
6966 case MUST_NOT_THROW_EXPR
:
6968 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6969 allow_non_constant
, addr
,
6973 /* These differ from cxx_eval_unary_expression in that this doesn't
6974 check for a constant operand or result; an address can be
6975 constant without its operand being, and vice versa. */
6977 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
6983 tree oldop
= TREE_OPERAND (t
, 0);
6984 tree op
= cxx_eval_constant_expression (call
, oldop
,
6988 /* Don't VERIFY_CONSTANT here. */
6989 if (*non_constant_p
)
6991 /* This function does more aggressive folding than fold itself. */
6992 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
6993 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
7001 case FIX_TRUNC_EXPR
:
7006 case TRUTH_NOT_EXPR
:
7007 case FIXED_CONVERT_EXPR
:
7008 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
7014 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7015 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7016 introduced by build_call_a. */
7017 tree op0
= TREE_OPERAND (t
, 0);
7018 tree op1
= TREE_OPERAND (t
, 1);
7020 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7021 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7022 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7023 addr
, non_constant_p
);
7026 /* Check that the LHS is constant and then discard it. */
7027 cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7028 false, non_constant_p
);
7029 r
= cxx_eval_constant_expression (call
, op1
, allow_non_constant
,
7030 addr
, non_constant_p
);
7035 case POINTER_PLUS_EXPR
:
7039 case TRUNC_DIV_EXPR
:
7041 case FLOOR_DIV_EXPR
:
7042 case ROUND_DIV_EXPR
:
7043 case TRUNC_MOD_EXPR
:
7045 case ROUND_MOD_EXPR
:
7047 case EXACT_DIV_EXPR
:
7057 case TRUTH_XOR_EXPR
:
7064 case UNORDERED_EXPR
:
7073 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
7077 /* fold can introduce non-IF versions of these; still treat them as
7078 short-circuiting. */
7079 case TRUTH_AND_EXPR
:
7080 case TRUTH_ANDIF_EXPR
:
7081 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
7083 allow_non_constant
, addr
,
7088 case TRUTH_ORIF_EXPR
:
7089 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
7091 allow_non_constant
, addr
,
7096 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
7101 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
7106 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
7112 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
7117 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
7122 /* We can get this in a defaulted constructor for a class with a
7123 non-static data member of array type. Either the initializer will
7124 be NULL, meaning default-initialization, or it will be an lvalue
7125 or xvalue of the same type, meaning direct-initialization from the
7126 corresponding member. */
7127 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
7132 case VIEW_CONVERT_EXPR
:
7135 tree oldop
= TREE_OPERAND (t
, 0);
7137 tree to
= TREE_TYPE (t
);
7138 tree source
= TREE_TYPE (op
);
7139 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (to
)
7140 && !(TREE_CODE (op
) == COMPONENT_REF
7141 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op
, 0)))))
7143 if (!allow_non_constant
)
7144 error ("conversion of expression %qE of pointer type "
7145 "cannot yield a constant expression", op
);
7146 *non_constant_p
= true;
7149 op
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7150 allow_non_constant
, addr
,
7152 if (*non_constant_p
)
7155 /* We didn't fold at the top so we could check for ptr-int
7158 r
= fold_build1 (TREE_CODE (t
), to
, op
);
7159 /* Conversion of an out-of-range value has implementation-defined
7160 behavior; the language considers it different from arithmetic
7161 overflow, which is undefined. */
7162 if (TREE_OVERFLOW_P (r
) && !TREE_OVERFLOW_P (op
))
7163 TREE_OVERFLOW (r
) = false;
7167 case EMPTY_CLASS_EXPR
:
7168 /* This is good enough for a function argument that might not get
7169 used, and they can't do anything with it, so just return it. */
7173 case DYNAMIC_CAST_EXPR
:
7174 case PSEUDO_DTOR_EXPR
:
7175 case PREINCREMENT_EXPR
:
7176 case POSTINCREMENT_EXPR
:
7177 case PREDECREMENT_EXPR
:
7178 case POSTDECREMENT_EXPR
:
7182 case VEC_DELETE_EXPR
:
7186 /* GCC internal stuff. */
7189 case WITH_CLEANUP_EXPR
:
7190 case STATEMENT_LIST
:
7192 case NON_DEPENDENT_EXPR
:
7196 if (!allow_non_constant
)
7197 error_at (EXPR_LOC_OR_HERE (t
),
7198 "expression %qE is not a constant-expression", t
);
7199 *non_constant_p
= true;
7203 internal_error ("unexpected expression %qE of kind %s", t
,
7204 tree_code_name
[TREE_CODE (t
)]);
7205 *non_constant_p
= true;
7209 if (r
== error_mark_node
)
7210 *non_constant_p
= true;
7212 if (*non_constant_p
)
7219 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
7221 bool non_constant_p
= false;
7222 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
7223 false, &non_constant_p
);
7225 verify_constant (r
, allow_non_constant
, &non_constant_p
);
7227 if (non_constant_p
&& !allow_non_constant
)
7228 return error_mark_node
;
7229 else if (non_constant_p
&& TREE_CONSTANT (t
))
7231 /* This isn't actually constant, so unset TREE_CONSTANT. */
7232 if (EXPR_P (t
) || TREE_CODE (t
) == CONSTRUCTOR
)
7235 r
= build_nop (TREE_TYPE (t
), t
);
7236 TREE_CONSTANT (r
) = false;
7239 else if (non_constant_p
|| r
== t
)
7241 else if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
7243 if (TREE_CODE (t
) == TARGET_EXPR
7244 && TARGET_EXPR_INITIAL (t
) == r
)
7248 r
= get_target_expr (r
);
7249 TREE_CONSTANT (r
) = true;
7257 /* Returns true if T is a valid subexpression of a constant expression,
7258 even if it isn't itself a constant expression. */
7261 is_sub_constant_expr (tree t
)
7263 bool non_constant_p
= false;
7264 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
);
7265 return !non_constant_p
;
7268 /* If T represents a constant expression returns its reduced value.
7269 Otherwise return error_mark_node. If T is dependent, then
7273 cxx_constant_value (tree t
)
7275 return cxx_eval_outermost_constant_expr (t
, false);
7278 /* If T is a constant expression, returns its reduced value.
7279 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7280 Otherwise, returns a version of T without TREE_CONSTANT. */
7283 maybe_constant_value (tree t
)
7287 if (type_dependent_expression_p (t
)
7288 || type_unknown_p (t
)
7289 || !potential_constant_expression (t
)
7290 || value_dependent_expression_p (t
))
7293 r
= cxx_eval_outermost_constant_expr (t
, true);
7294 #ifdef ENABLE_CHECKING
7295 /* cp_tree_equal looks through NOPs, so allow them. */
7297 || CONVERT_EXPR_P (t
)
7298 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
7299 || !cp_tree_equal (r
, t
));
7304 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7305 than wrapped in a TARGET_EXPR. */
7308 maybe_constant_init (tree t
)
7310 t
= maybe_constant_value (t
);
7311 if (TREE_CODE (t
) == TARGET_EXPR
)
7313 tree init
= TARGET_EXPR_INITIAL (t
);
7314 if (TREE_CODE (init
) == CONSTRUCTOR
7315 && TREE_CONSTANT (init
))
7322 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7323 /* Return true if the object referred to by REF has automatic or thread
7326 enum { ck_ok
, ck_bad
, ck_unknown
};
7328 check_automatic_or_tls (tree ref
)
7330 enum machine_mode mode
;
7331 HOST_WIDE_INT bitsize
, bitpos
;
7333 int volatilep
= 0, unsignedp
= 0;
7334 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
7335 &mode
, &unsignedp
, &volatilep
, false);
7338 /* If there isn't a decl in the middle, we don't know the linkage here,
7339 and this isn't a constant expression anyway. */
7342 dk
= decl_storage_duration (decl
);
7343 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
7347 /* Return true if the DECL designates a builtin function that is
7348 morally constexpr, in the sense that its parameter types and
7349 return type are literal types and the compiler is allowed to
7350 fold its invocations. */
7353 morally_constexpr_builtin_function_p (tree decl
)
7355 tree funtype
= TREE_TYPE (decl
);
7358 if (!is_builtin_fn (decl
))
7360 if (!literal_type_p (TREE_TYPE (funtype
)))
7362 for (t
= TYPE_ARG_TYPES (funtype
); t
!= NULL
; t
= TREE_CHAIN (t
))
7364 if (t
== void_list_node
)
7366 if (!literal_type_p (TREE_VALUE (t
)))
7369 /* We assume no varargs builtins are suitable. */
7373 /* Return true if T denotes a potentially constant expression. Issue
7374 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7375 an lvalue-rvalue conversion is implied.
7377 C++0x [expr.const] used to say
7379 6 An expression is a potential constant expression if it is
7380 a constant expression where all occurences of function
7381 parameters are replaced by arbitrary constant expressions
7382 of the appropriate type.
7384 2 A conditional expression is a constant expression unless it
7385 involves one of the following as a potentially evaluated
7386 subexpression (3.2), but subexpressions of logical AND (5.14),
7387 logical OR (5.15), and conditional (5.16) operations that are
7388 not evaluated are not considered. */
7391 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
7393 enum { any
= false, rval
= true };
7397 /* C++98 has different rules for the form of a constant expression that
7398 are enforced in the parser, so we can assume that anything that gets
7399 this far is suitable. */
7400 if (cxx_dialect
< cxx0x
)
7403 if (t
== error_mark_node
)
7407 if (TREE_THIS_VOLATILE (t
))
7409 if (flags
& tf_error
)
7410 error ("expression %qE has side-effects", t
);
7413 if (CONSTANT_CLASS_P (t
))
7415 if (TREE_OVERFLOW (t
))
7417 if (flags
& tf_error
)
7419 permerror (EXPR_LOC_OR_HERE (t
),
7420 "overflow in constant expression");
7421 if (flag_permissive
)
7429 switch (TREE_CODE (t
))
7435 case TEMPLATE_ID_EXPR
:
7442 case TEMPLATE_PARM_INDEX
:
7444 case IDENTIFIER_NODE
:
7448 /* -- this (5.1) unless it appears as the postfix-expression in a
7449 class member access expression, including the result of the
7450 implicit transformation in the body of the non-static
7451 member function (9.3.1); */
7452 /* FIXME this restriction seems pointless since the standard dropped
7453 "potential constant expression". */
7454 if (is_this_parameter (t
))
7456 if (flags
& tf_error
)
7457 error ("%qE is not a potential constant expression", t
);
7462 case AGGR_INIT_EXPR
:
7464 /* -- an invocation of a function other than a constexpr function
7465 or a constexpr constructor. */
7467 tree fun
= get_function_named_in_call (t
);
7468 const int nargs
= call_expr_nargs (t
);
7471 if (is_overloaded_fn (fun
))
7473 if (TREE_CODE (fun
) == FUNCTION_DECL
)
7475 if (builtin_valid_in_constant_expr_p (fun
))
7477 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
7478 && !morally_constexpr_builtin_function_p (fun
))
7480 if (flags
& tf_error
)
7481 error ("%qD is not %<constexpr%>", fun
);
7484 /* A call to a non-static member function takes the address
7485 of the object as the first argument. But in a constant
7486 expression the address will be folded away, so look
7488 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
7489 && !DECL_CONSTRUCTOR_P (fun
))
7491 tree x
= get_nth_callarg (t
, 0);
7492 if (is_this_parameter (x
))
7494 else if (!potential_constant_expression_1 (x
, rval
, flags
))
7496 if (flags
& tf_error
)
7497 error ("object argument is not a potential "
7498 "constant expression");
7505 fun
= get_first_fn (fun
);
7506 /* Skip initial arguments to base constructors. */
7507 if (DECL_BASE_CONSTRUCTOR_P (fun
))
7508 i
= num_artificial_parms_for (fun
);
7509 fun
= DECL_ORIGIN (fun
);
7513 if (potential_constant_expression_1 (fun
, rval
, flags
))
7514 /* Might end up being a constant function pointer. */;
7517 if (flags
& tf_error
)
7518 error ("%qE is not a function name", fun
);
7522 for (; i
< nargs
; ++i
)
7524 tree x
= get_nth_callarg (t
, i
);
7525 if (!potential_constant_expression_1 (x
, rval
, flags
))
7527 if (flags
& tf_error
)
7528 error ("argument in position %qP is not a "
7529 "potential constant expression", i
);
7536 case NON_LVALUE_EXPR
:
7537 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7538 -- an lvalue of integral type that refers to a non-volatile
7539 const variable or static data member initialized with
7540 constant expressions, or
7542 -- an lvalue of literal type that refers to non-volatile
7543 object defined with constexpr, or that refers to a
7544 sub-object of such an object; */
7545 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7548 if (want_rval
&& !decl_constant_var_p (t
)
7549 && !dependent_type_p (TREE_TYPE (t
)))
7551 if (flags
& tf_error
)
7552 non_const_var_error (t
);
7559 case VIEW_CONVERT_EXPR
:
7560 /* -- an array-to-pointer conversion that is applied to an lvalue
7561 that designates an object with thread or automatic storage
7562 duration; FIXME not implemented as it breaks constexpr arrays;
7563 need to fix the standard
7564 -- a type conversion from a pointer or pointer-to-member type
7565 to a literal type. */
7567 tree from
= TREE_OPERAND (t
, 0);
7568 tree source
= TREE_TYPE (from
);
7569 tree target
= TREE_TYPE (t
);
7570 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (target
)
7571 && !(TREE_CODE (from
) == COMPONENT_REF
7572 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from
, 0)))))
7574 if (flags
& tf_error
)
7575 error ("conversion of expression %qE of pointer type "
7576 "cannot yield a constant expression", from
);
7579 return (potential_constant_expression_1
7580 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
7584 /* -- a unary operator & that is applied to an lvalue that
7585 designates an object with thread or automatic storage
7587 t
= TREE_OPERAND (t
, 0);
7589 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7590 any checking here, as we might dereference the pointer later. If
7591 we remove this code, also remove check_automatic_or_tls. */
7592 i
= check_automatic_or_tls (t
);
7597 if (flags
& tf_error
)
7598 error ("address-of an object %qE with thread local or "
7599 "automatic storage is not a constant expression", t
);
7603 return potential_constant_expression_1 (t
, any
, flags
);
7609 /* -- a class member access unless its postfix-expression is
7610 of literal type or of pointer to literal type. */
7611 /* This test would be redundant, as it follows from the
7612 postfix-expression being a potential constant expression. */
7613 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7616 case EXPR_PACK_EXPANSION
:
7617 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
7622 tree x
= TREE_OPERAND (t
, 0);
7624 if (is_this_parameter (x
))
7626 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)) && want_rval
)
7628 if (flags
& tf_error
)
7629 sorry ("use of the value of the object being constructed "
7630 "in a constant expression");
7635 return potential_constant_expression_1 (x
, rval
, flags
);
7639 case DYNAMIC_CAST_EXPR
:
7640 case PSEUDO_DTOR_EXPR
:
7641 case PREINCREMENT_EXPR
:
7642 case POSTINCREMENT_EXPR
:
7643 case PREDECREMENT_EXPR
:
7644 case POSTDECREMENT_EXPR
:
7648 case VEC_DELETE_EXPR
:
7652 /* GCC internal stuff. */
7655 case WITH_CLEANUP_EXPR
:
7656 case CLEANUP_POINT_EXPR
:
7657 case MUST_NOT_THROW_EXPR
:
7658 case TRY_CATCH_EXPR
:
7659 case STATEMENT_LIST
:
7660 /* Don't bother trying to define a subset of statement-expressions to
7661 be constant-expressions, at least for now. */
7665 if (flags
& tf_error
)
7666 error ("expression %qE is not a constant-expression", t
);
7670 /* -- a typeid expression whose operand is of polymorphic
7673 tree e
= TREE_OPERAND (t
, 0);
7674 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
7675 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
7677 if (flags
& tf_error
)
7678 error ("typeid-expression is not a constant expression "
7679 "because %qE is of polymorphic type", e
);
7686 /* -- a subtraction where both operands are pointers. */
7687 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7688 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7690 if (flags
& tf_error
)
7691 error ("difference of two pointer expressions is not "
7692 "a constant expression");
7704 /* -- a relational or equality operator where at least
7705 one of the operands is a pointer. */
7706 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7707 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7709 if (flags
& tf_error
)
7710 error ("pointer comparison expression is not a "
7711 "constant expression");
7721 case FIX_TRUNC_EXPR
:
7726 case TRUTH_NOT_EXPR
:
7727 case FIXED_CONVERT_EXPR
:
7728 case UNARY_PLUS_EXPR
:
7729 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
7733 case CONST_CAST_EXPR
:
7734 case STATIC_CAST_EXPR
:
7735 case REINTERPRET_CAST_EXPR
:
7736 return (potential_constant_expression_1
7737 (TREE_OPERAND (t
, 0),
7738 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
7741 case NON_DEPENDENT_EXPR
:
7742 /* For convenience. */
7744 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7748 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7753 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7758 VEC(constructor_elt
, gc
) *v
= CONSTRUCTOR_ELTS (t
);
7759 constructor_elt
*ce
;
7760 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
7761 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
7768 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
7769 || DECL_P (TREE_PURPOSE (t
)));
7770 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
7773 if (TREE_CHAIN (t
) == NULL_TREE
)
7775 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
7779 case TRUNC_DIV_EXPR
:
7781 case FLOOR_DIV_EXPR
:
7782 case ROUND_DIV_EXPR
:
7783 case TRUNC_MOD_EXPR
:
7785 case ROUND_MOD_EXPR
:
7787 tree denom
= TREE_OPERAND (t
, 1);
7788 /* We can't call maybe_constant_value on an expression
7789 that hasn't been through fold_non_dependent_expr yet. */
7790 if (!processing_template_decl
)
7791 denom
= maybe_constant_value (denom
);
7792 if (integer_zerop (denom
))
7794 if (flags
& tf_error
)
7795 error ("division by zero is not a constant-expression");
7807 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7808 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7809 introduced by build_call_a. */
7810 tree op0
= TREE_OPERAND (t
, 0);
7811 tree op1
= TREE_OPERAND (t
, 1);
7813 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7814 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7815 return potential_constant_expression_1 (op0
, want_rval
, flags
);
7820 /* If the first operand is the non-short-circuit constant, look at
7821 the second operand; otherwise we only care about the first one for
7823 case TRUTH_AND_EXPR
:
7824 case TRUTH_ANDIF_EXPR
:
7825 tmp
= boolean_true_node
;
7828 case TRUTH_ORIF_EXPR
:
7829 tmp
= boolean_false_node
;
7831 if (TREE_OPERAND (t
, 0) == tmp
)
7832 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
7834 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7838 case POINTER_PLUS_EXPR
:
7840 case EXACT_DIV_EXPR
:
7850 case TRUTH_XOR_EXPR
:
7851 case UNORDERED_EXPR
:
7863 case ARRAY_RANGE_REF
:
7867 for (i
= 0; i
< 2; ++i
)
7868 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7875 /* If the condition is a known constant, we know which of the legs we
7876 care about; otherwise we only require that the condition and
7877 either of the legs be potentially constant. */
7878 tmp
= TREE_OPERAND (t
, 0);
7879 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
7881 else if (integer_zerop (tmp
))
7882 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
7884 else if (TREE_CODE (tmp
) == INTEGER_CST
)
7885 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7887 for (i
= 1; i
< 3; ++i
)
7888 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7889 want_rval
, tf_none
))
7891 if (flags
& tf_error
)
7892 error ("expression %qE is not a constant-expression", t
);
7896 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
7898 if (flags
& tf_error
)
7900 error ("non-constant array initialization");
7901 diagnose_non_constexpr_vec_init (t
);
7906 sorry ("unexpected ast of kind %s", tree_code_name
[TREE_CODE (t
)]);
7912 /* The main entry point to the above. */
7915 potential_constant_expression (tree t
)
7917 return potential_constant_expression_1 (t
, false, tf_none
);
7920 /* As above, but require a constant rvalue. */
7923 potential_rvalue_constant_expression (tree t
)
7925 return potential_constant_expression_1 (t
, true, tf_none
);
7928 /* Like above, but complain about non-constant expressions. */
7931 require_potential_constant_expression (tree t
)
7933 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
7936 /* Cross product of the above. */
7939 require_potential_rvalue_constant_expression (tree t
)
7941 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
7944 /* Constructor for a lambda expression. */
7947 build_lambda_expr (void)
7949 tree lambda
= make_node (LAMBDA_EXPR
);
7950 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
7951 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
7952 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
7953 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
7954 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
7958 /* Create the closure object for a LAMBDA_EXPR. */
7961 build_lambda_object (tree lambda_expr
)
7963 /* Build aggregate constructor call.
7964 - cp_parser_braced_list
7965 - cp_parser_functional_cast */
7966 VEC(constructor_elt
,gc
) *elts
= NULL
;
7967 tree node
, expr
, type
;
7968 location_t saved_loc
;
7970 if (processing_template_decl
)
7973 /* Make sure any error messages refer to the lambda-introducer. */
7974 saved_loc
= input_location
;
7975 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
7977 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
7979 node
= TREE_CHAIN (node
))
7981 tree field
= TREE_PURPOSE (node
);
7982 tree val
= TREE_VALUE (node
);
7984 if (field
== error_mark_node
)
7986 expr
= error_mark_node
;
7993 /* Mere mortals can't copy arrays with aggregate initialization, so
7994 do some magic to make it work here. */
7995 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
7996 val
= build_array_copy (val
);
7997 else if (DECL_NORMAL_CAPTURE_P (field
)
7998 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
8000 /* "the entities that are captured by copy are used to
8001 direct-initialize each corresponding non-static data
8002 member of the resulting closure object."
8004 There's normally no way to express direct-initialization
8005 from an element of a CONSTRUCTOR, so we build up a special
8006 TARGET_EXPR to bypass the usual copy-initialization. */
8007 val
= force_rvalue (val
, tf_warning_or_error
);
8008 if (TREE_CODE (val
) == TARGET_EXPR
)
8009 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
8012 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
8015 expr
= build_constructor (init_list_type_node
, elts
);
8016 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
8018 /* N2927: "[The closure] class type is not an aggregate."
8019 But we briefly treat it as an aggregate to make this simpler. */
8020 type
= TREE_TYPE (lambda_expr
);
8021 CLASSTYPE_NON_AGGREGATE (type
) = 0;
8022 expr
= finish_compound_literal (type
, expr
, tf_warning_or_error
);
8023 CLASSTYPE_NON_AGGREGATE (type
) = 1;
8026 input_location
= saved_loc
;
8030 /* Return an initialized RECORD_TYPE for LAMBDA.
8031 LAMBDA must have its explicit captures already. */
8034 begin_lambda_type (tree lambda
)
8039 /* Unique name. This is just like an unnamed class, but we cannot use
8040 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8042 name
= make_lambda_name ();
8044 /* Create the new RECORD_TYPE for this lambda. */
8045 type
= xref_tag (/*tag_code=*/record_type
,
8047 /*scope=*/ts_within_enclosing_non_class
,
8048 /*template_header_p=*/false);
8051 /* Designate it as a struct so that we can use aggregate initialization. */
8052 CLASSTYPE_DECLARED_CLASS (type
) = false;
8054 /* Clear base types. */
8055 xref_basetypes (type
, /*bases=*/NULL_TREE
);
8057 /* Start the class. */
8058 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
8060 /* Cross-reference the expression and the type. */
8061 TREE_TYPE (lambda
) = type
;
8062 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
8067 /* Returns the type to use for the return type of the operator() of a
8071 lambda_return_type (tree expr
)
8074 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
8076 warning (0, "cannot deduce lambda return type from a braced-init-list");
8077 return void_type_node
;
8079 if (type_dependent_expression_p (expr
))
8081 type
= cxx_make_type (DECLTYPE_TYPE
);
8082 DECLTYPE_TYPE_EXPR (type
) = expr
;
8083 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
8084 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8087 type
= type_decays_to (unlowered_expr_type (expr
));
8091 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8095 lambda_function (tree lambda
)
8098 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
8099 type
= TREE_TYPE (lambda
);
8102 gcc_assert (LAMBDA_TYPE_P (type
));
8103 /* Don't let debug_tree cause instantiation. */
8104 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
8106 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
8107 /*protect=*/0, /*want_type=*/false);
8109 lambda
= BASELINK_FUNCTIONS (lambda
);
8113 /* Returns the type to use for the FIELD_DECL corresponding to the
8115 The caller should add REFERENCE_TYPE for capture by reference. */
8118 lambda_capture_field_type (tree expr
)
8121 if (type_dependent_expression_p (expr
))
8123 type
= cxx_make_type (DECLTYPE_TYPE
);
8124 DECLTYPE_TYPE_EXPR (type
) = expr
;
8125 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
8126 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8129 type
= non_reference (unlowered_expr_type (expr
));
8133 /* Recompute the return type for LAMBDA with body of the form:
8134 { return EXPR ; } */
8137 apply_lambda_return_type (tree lambda
, tree return_type
)
8139 tree fco
= lambda_function (lambda
);
8142 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
8144 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
8145 it would interfere with instantiating the closure type. */
8146 if (dependent_type_p (return_type
))
8148 if (return_type
== error_mark_node
)
8151 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8152 TREE_TYPE (METHOD_TYPE) == return-type */
8153 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
8155 result
= DECL_RESULT (fco
);
8156 if (result
== NULL_TREE
)
8159 /* We already have a DECL_RESULT from start_preparsed_function.
8160 Now we need to redo the work it and allocate_struct_function
8161 did to reflect the new type. */
8162 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
8163 TYPE_MAIN_VARIANT (return_type
));
8164 DECL_ARTIFICIAL (result
) = 1;
8165 DECL_IGNORED_P (result
) = 1;
8166 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
8169 DECL_RESULT (fco
) = result
;
8171 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
8173 #ifdef PCC_STATIC_STRUCT_RETURN
8174 cfun
->returns_pcc_struct
= 1;
8176 cfun
->returns_struct
= 1;
8181 /* DECL is a local variable or parameter from the surrounding scope of a
8182 lambda-expression. Returns the decltype for a use of the capture field
8183 for DECL even if it hasn't been captured yet. */
8186 capture_decltype (tree decl
)
8188 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8189 /* FIXME do lookup instead of list walk? */
8190 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
8194 type
= TREE_TYPE (TREE_PURPOSE (cap
));
8196 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
8199 error ("%qD is not captured", decl
);
8200 return error_mark_node
;
8203 type
= TREE_TYPE (decl
);
8204 if (TREE_CODE (type
) == REFERENCE_TYPE
8205 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
8206 type
= TREE_TYPE (type
);
8209 case CPLD_REFERENCE
:
8210 type
= TREE_TYPE (decl
);
8211 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8212 type
= build_reference_type (TREE_TYPE (decl
));
8219 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8221 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
8222 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
8224 type
= build_reference_type (type
);
8229 /* From an ID and INITIALIZER, create a capture (by reference if
8230 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8234 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
8235 bool explicit_init_p
)
8240 type
= lambda_capture_field_type (initializer
);
8243 type
= build_reference_type (type
);
8244 if (!real_lvalue_p (initializer
))
8245 error ("cannot capture %qE by reference", initializer
);
8248 /* Make member variable. */
8249 member
= build_lang_decl (FIELD_DECL
, id
, type
);
8250 if (!explicit_init_p
)
8251 /* Normal captures are invisible to name lookup but uses are replaced
8252 with references to the capture field; we implement this by only
8253 really making them invisible in unevaluated context; see
8254 qualify_lookup. For now, let's make explicitly initialized captures
8256 DECL_NORMAL_CAPTURE_P (member
) = true;
8258 /* Add it to the appropriate closure class if we've started it. */
8259 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
8260 finish_member_declaration (member
);
8262 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
8263 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
8265 if (id
== get_identifier ("__this"))
8267 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
8268 error ("already captured %<this%> in lambda expression");
8269 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
8275 /* Register all the capture members on the list CAPTURES, which is the
8276 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8278 void register_capture_members (tree captures
)
8282 register_capture_members (TREE_CHAIN (captures
));
8283 finish_member_declaration (TREE_PURPOSE (captures
));
8287 /* Given a FIELD_DECL decl belonging to a closure type, return a
8288 COMPONENT_REF of it relative to the 'this' parameter of the op() for
8292 thisify_lambda_field (tree decl
)
8294 tree context
= lambda_function (DECL_CONTEXT (decl
));
8295 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
8297 tf_warning_or_error
);
8298 return finish_non_static_data_member (decl
, object
,
8299 /*qualifying_scope*/NULL_TREE
);
8302 /* Similar to add_capture, except this works on a stack of nested lambdas.
8303 BY_REFERENCE_P in this case is derived from the default capture mode.
8304 Returns the capture for the lambda at the bottom of the stack. */
8307 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
8309 bool this_capture_p
= (id
== get_identifier ("__this"));
8311 tree member
= NULL_TREE
;
8313 tree saved_class_type
= current_class_type
;
8317 for (node
= lambda_stack
;
8319 node
= TREE_CHAIN (node
))
8321 tree lambda
= TREE_VALUE (node
);
8323 current_class_type
= TREE_TYPE (lambda
);
8324 member
= add_capture (lambda
,
8329 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
8330 == CPLD_REFERENCE
)),
8331 /*explicit_init_p=*/false);
8332 initializer
= thisify_lambda_field (member
);
8335 current_class_type
= saved_class_type
;
8340 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8341 INDIRECT_REF, possibly adding it through default capturing. */
8344 lambda_expr_this_capture (tree lambda
)
8348 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8350 /* Try to default capture 'this' if we can. */
8352 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
8354 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
8355 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
8356 tree init
= NULL_TREE
;
8358 /* If we are in a lambda function, we can move out until we hit:
8359 1. a non-lambda function,
8360 2. a lambda function capturing 'this', or
8361 3. a non-default capturing lambda function. */
8362 while (LAMBDA_FUNCTION_P (containing_function
))
8365 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
8367 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
8369 /* An outer lambda has already captured 'this'. */
8370 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8371 init
= thisify_lambda_field (cap
);
8375 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
8376 /* An outer lambda won't let us capture 'this'. */
8379 lambda_stack
= tree_cons (NULL_TREE
,
8383 containing_function
= decl_function_context (containing_function
);
8386 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
8387 && !LAMBDA_FUNCTION_P (containing_function
))
8388 /* First parameter is 'this'. */
8389 init
= DECL_ARGUMENTS (containing_function
);
8392 this_capture
= add_default_capture (lambda_stack
,
8393 /*id=*/get_identifier ("__this"),
8399 error ("%<this%> was not captured for this lambda function");
8400 result
= error_mark_node
;
8404 /* To make sure that current_class_ref is for the lambda. */
8405 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
8407 result
= finish_non_static_data_member (this_capture
,
8409 /*qualifying_scope=*/NULL_TREE
);
8411 /* If 'this' is captured, each use of 'this' is transformed into an
8412 access to the corresponding unnamed data member of the closure
8413 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8414 ensures that the transformed expression is an rvalue. ] */
8415 result
= rvalue (result
);
8421 /* Returns the method basetype of the innermost non-lambda function, or
8422 NULL_TREE if none. */
8425 nonlambda_method_basetype (void)
8428 if (!current_class_ref
)
8431 type
= current_class_type
;
8432 if (!LAMBDA_TYPE_P (type
))
8435 /* Find the nearest enclosing non-lambda function. */
8436 fn
= TYPE_NAME (type
);
8438 fn
= decl_function_context (fn
);
8439 while (fn
&& LAMBDA_FUNCTION_P (fn
));
8441 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
8444 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
8447 /* If the closure TYPE has a static op(), also add a conversion to function
8451 maybe_add_lambda_conv_op (tree type
)
8453 bool nested
= (current_function_decl
!= NULL_TREE
);
8454 tree callop
= lambda_function (type
);
8455 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
8456 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
8457 VEC (tree
, gc
) *argvec
;
8459 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
8462 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
8463 FUNCTION_ARG_CHAIN (callop
));
8465 /* First build up the conversion op. */
8467 rettype
= build_pointer_type (stattype
);
8468 name
= mangle_conv_op_name_for_type (rettype
);
8469 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
8470 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
8471 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
8472 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8474 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8475 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8476 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8478 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
8479 grokclassfn (type
, fn
, NO_SPECIAL
);
8480 set_linkage_according_to_type (type
, fn
);
8481 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8482 DECL_IN_AGGR_P (fn
) = 1;
8483 DECL_ARTIFICIAL (fn
) = 1;
8484 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8485 DECL_DECLARED_INLINE_P (fn
) = 1;
8486 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
8488 DECL_INTERFACE_KNOWN (fn
) = 1;
8490 add_method (type
, fn
, NULL_TREE
);
8492 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8493 the conversion op is used. */
8494 if (varargs_function_p (callop
))
8496 DECL_DELETED_FN (fn
) = 1;
8500 /* Now build up the thunk to be returned. */
8502 name
= get_identifier ("_FUN");
8503 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
8504 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8505 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8506 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8507 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8508 grokclassfn (type
, fn
, NO_SPECIAL
);
8509 set_linkage_according_to_type (type
, fn
);
8510 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8511 DECL_IN_AGGR_P (fn
) = 1;
8512 DECL_ARTIFICIAL (fn
) = 1;
8513 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8514 DECL_DECLARED_INLINE_P (fn
) = 1;
8515 DECL_STATIC_FUNCTION_P (fn
) = 1;
8516 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
8517 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
8518 DECL_CONTEXT (arg
) = fn
;
8520 DECL_INTERFACE_KNOWN (fn
) = 1;
8522 add_method (type
, fn
, NULL_TREE
);
8525 push_function_context ();
8527 /* Generate the body of the thunk. */
8529 start_preparsed_function (statfn
, NULL_TREE
,
8530 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8531 if (DECL_ONE_ONLY (statfn
))
8533 /* Put the thunk in the same comdat group as the call op. */
8534 struct cgraph_node
*callop_node
, *thunk_node
;
8535 DECL_COMDAT_GROUP (statfn
) = DECL_COMDAT_GROUP (callop
);
8536 callop_node
= cgraph_get_create_node (callop
);
8537 thunk_node
= cgraph_get_create_node (statfn
);
8538 gcc_assert (callop_node
->same_comdat_group
== NULL
);
8539 gcc_assert (thunk_node
->same_comdat_group
== NULL
);
8540 callop_node
->same_comdat_group
= thunk_node
;
8541 thunk_node
->same_comdat_group
= callop_node
;
8543 body
= begin_function_body ();
8544 compound_stmt
= begin_compound_stmt (0);
8546 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
8548 argvec
= make_tree_vector ();
8549 VEC_quick_push (tree
, argvec
, arg
);
8550 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
8551 VEC_safe_push (tree
, gc
, argvec
, arg
);
8552 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
8553 VEC_address (tree
, argvec
));
8554 CALL_FROM_THUNK_P (call
) = 1;
8555 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
8556 call
= build_cplus_new (TREE_TYPE (call
), call
, tf_warning_or_error
);
8557 call
= convert_from_reference (call
);
8558 finish_return_stmt (call
);
8560 finish_compound_stmt (compound_stmt
);
8561 finish_function_body (body
);
8563 expand_or_defer_fn (finish_function (2));
8565 /* Generate the body of the conversion op. */
8567 start_preparsed_function (convfn
, NULL_TREE
,
8568 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8569 body
= begin_function_body ();
8570 compound_stmt
= begin_compound_stmt (0);
8572 finish_return_stmt (decay_conversion (statfn
));
8574 finish_compound_stmt (compound_stmt
);
8575 finish_function_body (body
);
8577 expand_or_defer_fn (finish_function (2));
8580 pop_function_context ();
8582 #include "gt-cp-semantics.h"