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, 2012 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"
42 #include "diagnostic.h"
44 #include "tree-iterator.h"
50 /* There routines provide a modular interface to perform many parsing
51 operations. They may therefore be used during actual parsing, or
52 during template instantiation, which may be regarded as a
53 degenerate form of parsing. */
55 static tree
maybe_convert_cond (tree
);
56 static tree
finalize_nrv_r (tree
*, int *, void *);
57 static tree
capture_decltype (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 gcc_checking_assert (!VEC_empty (tree
, stmt_list_stack
));
397 append_to_statement_list_force (t
, &cur_stmt_list
);
402 /* Returns the stmt_tree to which statements are currently being added. */
405 current_stmt_tree (void)
408 ? &cfun
->language
->base
.x_stmt_tree
409 : &scope_chain
->x_stmt_tree
);
412 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
415 maybe_cleanup_point_expr (tree expr
)
417 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
418 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
422 /* Like maybe_cleanup_point_expr except have the type of the new expression be
423 void so we don't need to create a temporary variable to hold the inner
424 expression. The reason why we do this is because the original type might be
425 an aggregate and we cannot create a temporary variable for that type. */
428 maybe_cleanup_point_expr_void (tree expr
)
430 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
431 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
437 /* Create a declaration statement for the declaration given by the DECL. */
440 add_decl_expr (tree decl
)
442 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
443 if (DECL_INITIAL (decl
)
444 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
445 r
= maybe_cleanup_point_expr_void (r
);
449 /* Finish a scope. */
452 do_poplevel (tree stmt_list
)
456 if (stmts_are_full_exprs_p ())
457 block
= poplevel (kept_level_p (), 1, 0);
459 stmt_list
= pop_stmt_list (stmt_list
);
461 if (!processing_template_decl
)
463 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
464 /* ??? See c_end_compound_stmt re statement expressions. */
470 /* Begin a new scope. */
473 do_pushlevel (scope_kind sk
)
475 tree ret
= push_stmt_list ();
476 if (stmts_are_full_exprs_p ())
477 begin_scope (sk
, NULL
);
481 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
482 when the current scope is exited. EH_ONLY is true when this is not
483 meant to apply to normal control flow transfer. */
486 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
488 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
489 CLEANUP_EH_ONLY (stmt
) = eh_only
;
491 CLEANUP_BODY (stmt
) = push_stmt_list ();
494 /* Begin a conditional that might contain a declaration. When generating
495 normal code, we want the declaration to appear before the statement
496 containing the conditional. When generating template code, we want the
497 conditional to be rendered as the raw DECL_EXPR. */
500 begin_cond (tree
*cond_p
)
502 if (processing_template_decl
)
503 *cond_p
= push_stmt_list ();
506 /* Finish such a conditional. */
509 finish_cond (tree
*cond_p
, tree expr
)
511 if (processing_template_decl
)
513 tree cond
= pop_stmt_list (*cond_p
);
514 if (TREE_CODE (cond
) == DECL_EXPR
)
517 if (check_for_bare_parameter_packs (expr
))
518 *cond_p
= error_mark_node
;
523 /* If *COND_P specifies a conditional with a declaration, transform the
526 for (; A x = 42;) { }
528 while (true) { A x = 42; if (!x) break; }
529 for (;;) { A x = 42; if (!x) break; }
530 The statement list for BODY will be empty if the conditional did
531 not declare anything. */
534 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
538 if (!TREE_SIDE_EFFECTS (body
))
542 *cond_p
= boolean_true_node
;
544 if_stmt
= begin_if_stmt ();
545 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
546 finish_if_stmt_cond (cond
, if_stmt
);
547 finish_break_stmt ();
548 finish_then_clause (if_stmt
);
549 finish_if_stmt (if_stmt
);
552 /* Finish a goto-statement. */
555 finish_goto_stmt (tree destination
)
557 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
558 destination
= lookup_label (destination
);
560 /* We warn about unused labels with -Wunused. That means we have to
561 mark the used labels as used. */
562 if (TREE_CODE (destination
) == LABEL_DECL
)
563 TREE_USED (destination
) = 1;
566 destination
= mark_rvalue_use (destination
);
567 if (!processing_template_decl
)
569 destination
= cp_convert (ptr_type_node
, destination
);
570 if (error_operand_p (destination
))
575 check_goto (destination
);
577 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
580 /* COND is the condition-expression for an if, while, etc.,
581 statement. Convert it to a boolean value, if appropriate.
582 In addition, verify sequence points if -Wsequence-point is enabled. */
585 maybe_convert_cond (tree cond
)
587 /* Empty conditions remain empty. */
591 /* Wait until we instantiate templates before doing conversion. */
592 if (processing_template_decl
)
595 if (warn_sequence_point
)
596 verify_sequence_points (cond
);
598 /* Do the conversion. */
599 cond
= convert_from_reference (cond
);
601 if (TREE_CODE (cond
) == MODIFY_EXPR
602 && !TREE_NO_WARNING (cond
)
605 warning (OPT_Wparentheses
,
606 "suggest parentheses around assignment used as truth value");
607 TREE_NO_WARNING (cond
) = 1;
610 return condition_conversion (cond
);
613 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
616 finish_expr_stmt (tree expr
)
620 if (expr
!= NULL_TREE
)
622 if (!processing_template_decl
)
624 if (warn_sequence_point
)
625 verify_sequence_points (expr
);
626 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
628 else if (!type_dependent_expression_p (expr
))
629 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
630 tf_warning_or_error
);
632 if (check_for_bare_parameter_packs (expr
))
633 expr
= error_mark_node
;
635 /* Simplification of inner statement expressions, compound exprs,
636 etc can result in us already having an EXPR_STMT. */
637 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
639 if (TREE_CODE (expr
) != EXPR_STMT
)
640 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
641 expr
= maybe_cleanup_point_expr_void (expr
);
653 /* Begin an if-statement. Returns a newly created IF_STMT if
660 scope
= do_pushlevel (sk_cond
);
661 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
662 NULL_TREE
, NULL_TREE
, scope
);
663 begin_cond (&IF_COND (r
));
667 /* Process the COND of an if-statement, which may be given by
671 finish_if_stmt_cond (tree cond
, tree if_stmt
)
673 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
675 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
678 /* Finish the then-clause of an if-statement, which may be given by
682 finish_then_clause (tree if_stmt
)
684 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
688 /* Begin the else-clause of an if-statement. */
691 begin_else_clause (tree if_stmt
)
693 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
696 /* Finish the else-clause of an if-statement, which may be given by
700 finish_else_clause (tree if_stmt
)
702 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
705 /* Finish an if-statement. */
708 finish_if_stmt (tree if_stmt
)
710 tree scope
= IF_SCOPE (if_stmt
);
711 IF_SCOPE (if_stmt
) = NULL
;
712 add_stmt (do_poplevel (scope
));
716 /* Begin a while-statement. Returns a newly created WHILE_STMT if
720 begin_while_stmt (void)
723 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
725 WHILE_BODY (r
) = do_pushlevel (sk_block
);
726 begin_cond (&WHILE_COND (r
));
730 /* Process the COND of a while-statement, which may be given by
734 finish_while_stmt_cond (tree cond
, tree while_stmt
)
736 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
737 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
740 /* Finish a while-statement, which may be given by WHILE_STMT. */
743 finish_while_stmt (tree while_stmt
)
745 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
749 /* Begin a do-statement. Returns a newly created DO_STMT if
755 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
757 DO_BODY (r
) = push_stmt_list ();
761 /* Finish the body of a do-statement, which may be given by DO_STMT. */
764 finish_do_body (tree do_stmt
)
766 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
768 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
769 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
771 if (IS_EMPTY_STMT (body
))
772 warning (OPT_Wempty_body
,
773 "suggest explicit braces around empty body in %<do%> statement");
776 /* Finish a do-statement, which may be given by DO_STMT, and whose
777 COND is as indicated. */
780 finish_do_stmt (tree cond
, tree do_stmt
)
782 cond
= maybe_convert_cond (cond
);
783 DO_COND (do_stmt
) = cond
;
787 /* Finish a return-statement. The EXPRESSION returned, if any, is as
791 finish_return_stmt (tree expr
)
796 expr
= check_return_expr (expr
, &no_warning
);
798 if (flag_openmp
&& !check_omp_return ())
799 return error_mark_node
;
800 if (!processing_template_decl
)
802 if (warn_sequence_point
)
803 verify_sequence_points (expr
);
805 if (DECL_DESTRUCTOR_P (current_function_decl
)
806 || (DECL_CONSTRUCTOR_P (current_function_decl
)
807 && targetm
.cxx
.cdtor_returns_this ()))
809 /* Similarly, all destructors must run destructors for
810 base-classes before returning. So, all returns in a
811 destructor get sent to the DTOR_LABEL; finish_function emits
812 code to return a value there. */
813 return finish_goto_stmt (cdtor_label
);
817 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
818 TREE_NO_WARNING (r
) |= no_warning
;
819 r
= maybe_cleanup_point_expr_void (r
);
826 /* Begin the scope of a for-statement or a range-for-statement.
827 Both the returned trees are to be used in a call to
828 begin_for_stmt or begin_range_for_stmt. */
831 begin_for_scope (tree
*init
)
833 tree scope
= NULL_TREE
;
834 if (flag_new_for_scope
> 0)
835 scope
= do_pushlevel (sk_for
);
837 if (processing_template_decl
)
838 *init
= push_stmt_list ();
845 /* Begin a for-statement. Returns a new FOR_STMT.
846 SCOPE and INIT should be the return of begin_for_scope,
850 begin_for_stmt (tree scope
, tree init
)
854 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
855 NULL_TREE
, NULL_TREE
, NULL_TREE
);
857 if (scope
== NULL_TREE
)
859 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
861 scope
= begin_for_scope (&init
);
863 FOR_INIT_STMT (r
) = init
;
864 FOR_SCOPE (r
) = scope
;
869 /* Finish the for-init-statement of a for-statement, which may be
870 given by FOR_STMT. */
873 finish_for_init_stmt (tree for_stmt
)
875 if (processing_template_decl
)
876 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
878 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
879 begin_cond (&FOR_COND (for_stmt
));
882 /* Finish the COND of a for-statement, which may be given by
886 finish_for_cond (tree cond
, tree for_stmt
)
888 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
889 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
892 /* Finish the increment-EXPRESSION in a for-statement, which may be
893 given by FOR_STMT. */
896 finish_for_expr (tree expr
, tree for_stmt
)
900 /* If EXPR is an overloaded function, issue an error; there is no
901 context available to use to perform overload resolution. */
902 if (type_unknown_p (expr
))
904 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
905 expr
= error_mark_node
;
907 if (!processing_template_decl
)
909 if (warn_sequence_point
)
910 verify_sequence_points (expr
);
911 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
912 tf_warning_or_error
);
914 else if (!type_dependent_expression_p (expr
))
915 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
916 tf_warning_or_error
);
917 expr
= maybe_cleanup_point_expr_void (expr
);
918 if (check_for_bare_parameter_packs (expr
))
919 expr
= error_mark_node
;
920 FOR_EXPR (for_stmt
) = expr
;
923 /* Finish the body of a for-statement, which may be given by
924 FOR_STMT. The increment-EXPR for the loop must be
926 It can also finish RANGE_FOR_STMT. */
929 finish_for_stmt (tree for_stmt
)
931 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
932 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
934 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
936 /* Pop the scope for the body of the loop. */
937 if (flag_new_for_scope
> 0)
940 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
941 ? &RANGE_FOR_SCOPE (for_stmt
)
942 : &FOR_SCOPE (for_stmt
));
945 add_stmt (do_poplevel (scope
));
951 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
952 SCOPE and INIT should be the return of begin_for_scope,
954 To finish it call finish_for_stmt(). */
957 begin_range_for_stmt (tree scope
, tree init
)
961 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
962 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
964 if (scope
== NULL_TREE
)
966 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
968 scope
= begin_for_scope (&init
);
971 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
974 pop_stmt_list (init
);
975 RANGE_FOR_SCOPE (r
) = scope
;
980 /* Finish the head of a range-based for statement, which may
981 be given by RANGE_FOR_STMT. DECL must be the declaration
982 and EXPR must be the loop expression. */
985 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
987 RANGE_FOR_DECL (range_for_stmt
) = decl
;
988 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
989 add_stmt (range_for_stmt
);
990 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
993 /* Finish a break-statement. */
996 finish_break_stmt (void)
998 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1001 /* Finish a continue-statement. */
1004 finish_continue_stmt (void)
1006 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1009 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1013 begin_switch_stmt (void)
1017 scope
= do_pushlevel (sk_cond
);
1018 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1020 begin_cond (&SWITCH_STMT_COND (r
));
1025 /* Finish the cond of a switch-statement. */
1028 finish_switch_cond (tree cond
, tree switch_stmt
)
1030 tree orig_type
= NULL
;
1031 if (!processing_template_decl
)
1033 /* Convert the condition to an integer or enumeration type. */
1034 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1035 if (cond
== NULL_TREE
)
1037 error ("switch quantity not an integer");
1038 cond
= error_mark_node
;
1040 orig_type
= TREE_TYPE (cond
);
1041 if (cond
!= error_mark_node
)
1045 Integral promotions are performed. */
1046 cond
= perform_integral_promotions (cond
);
1047 cond
= maybe_cleanup_point_expr (cond
);
1050 if (check_for_bare_parameter_packs (cond
))
1051 cond
= error_mark_node
;
1052 else if (!processing_template_decl
&& warn_sequence_point
)
1053 verify_sequence_points (cond
);
1055 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1056 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1057 add_stmt (switch_stmt
);
1058 push_switch (switch_stmt
);
1059 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1062 /* Finish the body of a switch-statement, which may be given by
1063 SWITCH_STMT. The COND to switch on is indicated. */
1066 finish_switch_stmt (tree switch_stmt
)
1070 SWITCH_STMT_BODY (switch_stmt
) =
1071 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1075 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1076 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1077 add_stmt (do_poplevel (scope
));
1080 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1084 begin_try_block (void)
1086 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1088 TRY_STMTS (r
) = push_stmt_list ();
1092 /* Likewise, for a function-try-block. The block returned in
1093 *COMPOUND_STMT is an artificial outer scope, containing the
1094 function-try-block. */
1097 begin_function_try_block (tree
*compound_stmt
)
1100 /* This outer scope does not exist in the C++ standard, but we need
1101 a place to put __FUNCTION__ and similar variables. */
1102 *compound_stmt
= begin_compound_stmt (0);
1103 r
= begin_try_block ();
1104 FN_TRY_BLOCK_P (r
) = 1;
1108 /* Finish a try-block, which may be given by TRY_BLOCK. */
1111 finish_try_block (tree try_block
)
1113 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1114 TRY_HANDLERS (try_block
) = push_stmt_list ();
1117 /* Finish the body of a cleanup try-block, which may be given by
1121 finish_cleanup_try_block (tree try_block
)
1123 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1126 /* Finish an implicitly generated try-block, with a cleanup is given
1130 finish_cleanup (tree cleanup
, tree try_block
)
1132 TRY_HANDLERS (try_block
) = cleanup
;
1133 CLEANUP_P (try_block
) = 1;
1136 /* Likewise, for a function-try-block. */
1139 finish_function_try_block (tree try_block
)
1141 finish_try_block (try_block
);
1142 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1143 the try block, but moving it inside. */
1144 in_function_try_handler
= 1;
1147 /* Finish a handler-sequence for a try-block, which may be given by
1151 finish_handler_sequence (tree try_block
)
1153 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1154 check_handlers (TRY_HANDLERS (try_block
));
1157 /* Finish the handler-seq for a function-try-block, given by
1158 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1159 begin_function_try_block. */
1162 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1164 in_function_try_handler
= 0;
1165 finish_handler_sequence (try_block
);
1166 finish_compound_stmt (compound_stmt
);
1169 /* Begin a handler. Returns a HANDLER if appropriate. */
1172 begin_handler (void)
1176 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1179 /* Create a binding level for the eh_info and the exception object
1181 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1186 /* Finish the handler-parameters for a handler, which may be given by
1187 HANDLER. DECL is the declaration for the catch parameter, or NULL
1188 if this is a `catch (...)' clause. */
1191 finish_handler_parms (tree decl
, tree handler
)
1193 tree type
= NULL_TREE
;
1194 if (processing_template_decl
)
1198 decl
= pushdecl (decl
);
1199 decl
= push_template_decl (decl
);
1200 HANDLER_PARMS (handler
) = decl
;
1201 type
= TREE_TYPE (decl
);
1205 type
= expand_start_catch_block (decl
);
1206 HANDLER_TYPE (handler
) = type
;
1207 if (!processing_template_decl
&& type
)
1208 mark_used (eh_type_info (type
));
1211 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1212 the return value from the matching call to finish_handler_parms. */
1215 finish_handler (tree handler
)
1217 if (!processing_template_decl
)
1218 expand_end_catch_block ();
1219 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1222 /* Begin a compound statement. FLAGS contains some bits that control the
1223 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1224 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1225 block of a function. If BCS_TRY_BLOCK is set, this is the block
1226 created on behalf of a TRY statement. Returns a token to be passed to
1227 finish_compound_stmt. */
1230 begin_compound_stmt (unsigned int flags
)
1234 if (flags
& BCS_NO_SCOPE
)
1236 r
= push_stmt_list ();
1237 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1239 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1240 But, if it's a statement-expression with a scopeless block, there's
1241 nothing to keep, and we don't want to accidentally keep a block
1242 *inside* the scopeless block. */
1243 keep_next_level (false);
1246 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1248 /* When processing a template, we need to remember where the braces were,
1249 so that we can set up identical scopes when instantiating the template
1250 later. BIND_EXPR is a handy candidate for this.
1251 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1252 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1253 processing templates. */
1254 if (processing_template_decl
)
1256 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1257 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1258 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1259 TREE_SIDE_EFFECTS (r
) = 1;
1265 /* Finish a compound-statement, which is given by STMT. */
1268 finish_compound_stmt (tree stmt
)
1270 if (TREE_CODE (stmt
) == BIND_EXPR
)
1272 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1273 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1274 discard the BIND_EXPR so it can be merged with the containing
1276 if (TREE_CODE (body
) == STATEMENT_LIST
1277 && STATEMENT_LIST_HEAD (body
) == NULL
1278 && !BIND_EXPR_BODY_BLOCK (stmt
)
1279 && !BIND_EXPR_TRY_BLOCK (stmt
))
1282 BIND_EXPR_BODY (stmt
) = body
;
1284 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1285 stmt
= pop_stmt_list (stmt
);
1288 /* Destroy any ObjC "super" receivers that may have been
1290 objc_clear_super_receiver ();
1292 stmt
= do_poplevel (stmt
);
1295 /* ??? See c_end_compound_stmt wrt statement expressions. */
1300 /* Finish an asm-statement, whose components are a STRING, some
1301 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1302 LABELS. Also note whether the asm-statement should be
1303 considered volatile. */
1306 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1307 tree input_operands
, tree clobbers
, tree labels
)
1311 int ninputs
= list_length (input_operands
);
1312 int noutputs
= list_length (output_operands
);
1314 if (!processing_template_decl
)
1316 const char *constraint
;
1317 const char **oconstraints
;
1318 bool allows_mem
, allows_reg
, is_inout
;
1322 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1324 string
= resolve_asm_operand_names (string
, output_operands
,
1325 input_operands
, labels
);
1327 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1329 operand
= TREE_VALUE (t
);
1331 /* ??? Really, this should not be here. Users should be using a
1332 proper lvalue, dammit. But there's a long history of using
1333 casts in the output operands. In cases like longlong.h, this
1334 becomes a primitive form of typechecking -- if the cast can be
1335 removed, then the output operand had a type of the proper width;
1336 otherwise we'll get an error. Gross, but ... */
1337 STRIP_NOPS (operand
);
1339 operand
= mark_lvalue_use (operand
);
1341 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1342 operand
= error_mark_node
;
1344 if (operand
!= error_mark_node
1345 && (TREE_READONLY (operand
)
1346 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1347 /* Functions are not modifiable, even though they are
1349 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1350 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1351 /* If it's an aggregate and any field is const, then it is
1352 effectively const. */
1353 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1354 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1355 cxx_readonly_error (operand
, lv_asm
);
1357 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1358 oconstraints
[i
] = constraint
;
1360 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1361 &allows_mem
, &allows_reg
, &is_inout
))
1363 /* If the operand is going to end up in memory,
1364 mark it addressable. */
1365 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1366 operand
= error_mark_node
;
1369 operand
= error_mark_node
;
1371 TREE_VALUE (t
) = operand
;
1374 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1376 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1377 operand
= decay_conversion (TREE_VALUE (t
));
1379 /* If the type of the operand hasn't been determined (e.g.,
1380 because it involves an overloaded function), then issue
1381 an error message. There's no context available to
1382 resolve the overloading. */
1383 if (TREE_TYPE (operand
) == unknown_type_node
)
1385 error ("type of asm operand %qE could not be determined",
1387 operand
= error_mark_node
;
1390 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1391 oconstraints
, &allows_mem
, &allows_reg
))
1393 /* If the operand is going to end up in memory,
1394 mark it addressable. */
1395 if (!allows_reg
&& allows_mem
)
1397 /* Strip the nops as we allow this case. FIXME, this really
1398 should be rejected or made deprecated. */
1399 STRIP_NOPS (operand
);
1400 if (!cxx_mark_addressable (operand
))
1401 operand
= error_mark_node
;
1405 operand
= error_mark_node
;
1407 TREE_VALUE (t
) = operand
;
1411 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1412 output_operands
, input_operands
,
1414 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1415 r
= maybe_cleanup_point_expr_void (r
);
1416 return add_stmt (r
);
1419 /* Finish a label with the indicated NAME. Returns the new label. */
1422 finish_label_stmt (tree name
)
1424 tree decl
= define_label (input_location
, name
);
1426 if (decl
== error_mark_node
)
1427 return error_mark_node
;
1429 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1434 /* Finish a series of declarations for local labels. G++ allows users
1435 to declare "local" labels, i.e., labels with scope. This extension
1436 is useful when writing code involving statement-expressions. */
1439 finish_label_decl (tree name
)
1441 if (!at_function_scope_p ())
1443 error ("__label__ declarations are only allowed in function scopes");
1447 add_decl_expr (declare_local_label (name
));
1450 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1453 finish_decl_cleanup (tree decl
, tree cleanup
)
1455 push_cleanup (decl
, cleanup
, false);
1458 /* If the current scope exits with an exception, run CLEANUP. */
1461 finish_eh_cleanup (tree cleanup
)
1463 push_cleanup (NULL
, cleanup
, true);
1466 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1467 order they were written by the user. Each node is as for
1468 emit_mem_initializers. */
1471 finish_mem_initializers (tree mem_inits
)
1473 /* Reorder the MEM_INITS so that they are in the order they appeared
1474 in the source program. */
1475 mem_inits
= nreverse (mem_inits
);
1477 if (processing_template_decl
)
1481 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1483 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1484 check for bare parameter packs in the TREE_VALUE, because
1485 any parameter packs in the TREE_VALUE have already been
1486 bound as part of the TREE_PURPOSE. See
1487 make_pack_expansion for more information. */
1488 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1489 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1490 TREE_VALUE (mem
) = error_mark_node
;
1493 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1496 emit_mem_initializers (mem_inits
);
1499 /* Finish a parenthesized expression EXPR. */
1502 finish_parenthesized_expr (tree expr
)
1505 /* This inhibits warnings in c_common_truthvalue_conversion. */
1506 TREE_NO_WARNING (expr
) = 1;
1508 if (TREE_CODE (expr
) == OFFSET_REF
1509 || TREE_CODE (expr
) == SCOPE_REF
)
1510 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1511 enclosed in parentheses. */
1512 PTRMEM_OK_P (expr
) = 0;
1514 if (TREE_CODE (expr
) == STRING_CST
)
1515 PAREN_STRING_LITERAL_P (expr
) = 1;
1520 /* Finish a reference to a non-static data member (DECL) that is not
1521 preceded by `.' or `->'. */
1524 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1526 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1530 tree scope
= qualifying_scope
;
1531 if (scope
== NULL_TREE
)
1532 scope
= context_for_name_lookup (decl
);
1533 object
= maybe_dummy_object (scope
, NULL
);
1536 if (object
== error_mark_node
)
1537 return error_mark_node
;
1539 /* DR 613: Can use non-static data members without an associated
1540 object in sizeof/decltype/alignof. */
1541 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1542 && (!processing_template_decl
|| !current_class_ref
))
1544 if (current_function_decl
1545 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1546 error ("invalid use of member %q+D in static member function", decl
);
1548 error ("invalid use of non-static data member %q+D", decl
);
1549 error ("from this location");
1551 return error_mark_node
;
1554 if (current_class_ptr
)
1555 TREE_USED (current_class_ptr
) = 1;
1556 if (processing_template_decl
&& !qualifying_scope
)
1558 tree type
= TREE_TYPE (decl
);
1560 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1561 /* Quals on the object don't matter. */;
1564 /* Set the cv qualifiers. */
1565 int quals
= (current_class_ref
1566 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1567 : TYPE_UNQUALIFIED
);
1569 if (DECL_MUTABLE_P (decl
))
1570 quals
&= ~TYPE_QUAL_CONST
;
1572 quals
|= cp_type_quals (TREE_TYPE (decl
));
1573 type
= cp_build_qualified_type (type
, quals
);
1576 return (convert_from_reference
1577 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1579 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1580 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1582 else if (processing_template_decl
)
1583 return build_qualified_name (TREE_TYPE (decl
),
1586 /*template_p=*/false);
1589 tree access_type
= TREE_TYPE (object
);
1591 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1594 /* If the data member was named `C::M', convert `*this' to `C'
1596 if (qualifying_scope
)
1598 tree binfo
= NULL_TREE
;
1599 object
= build_scoped_ref (object
, qualifying_scope
,
1603 return build_class_member_access_expr (object
, decl
,
1604 /*access_path=*/NULL_TREE
,
1605 /*preserve_reference=*/false,
1606 tf_warning_or_error
);
1610 /* If we are currently parsing a template and we encountered a typedef
1611 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1612 adds the typedef to a list tied to the current template.
1613 At tempate instantiatin time, that list is walked and access check
1614 performed for each typedef.
1615 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1618 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1620 location_t location
)
1622 tree template_info
= NULL
;
1623 tree cs
= current_scope ();
1625 if (!is_typedef_decl (typedef_decl
)
1627 || !CLASS_TYPE_P (context
)
1631 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1632 template_info
= get_template_info (cs
);
1635 && TI_TEMPLATE (template_info
)
1636 && !currently_open_class (context
))
1637 append_type_to_template_for_access_check (cs
, typedef_decl
,
1641 /* DECL was the declaration to which a qualified-id resolved. Issue
1642 an error message if it is not accessible. If OBJECT_TYPE is
1643 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1644 type of `*x', or `x', respectively. If the DECL was named as
1645 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1648 check_accessibility_of_qualified_id (tree decl
,
1650 tree nested_name_specifier
)
1653 tree qualifying_type
= NULL_TREE
;
1655 /* If we are parsing a template declaration and if decl is a typedef,
1656 add it to a list tied to the template.
1657 At template instantiation time, that list will be walked and
1658 access check performed. */
1659 add_typedef_to_current_template_for_access_check (decl
,
1660 nested_name_specifier
1661 ? nested_name_specifier
1662 : DECL_CONTEXT (decl
),
1665 /* If we're not checking, return immediately. */
1666 if (deferred_access_no_check
)
1669 /* Determine the SCOPE of DECL. */
1670 scope
= context_for_name_lookup (decl
);
1671 /* If the SCOPE is not a type, then DECL is not a member. */
1672 if (!TYPE_P (scope
))
1674 /* Compute the scope through which DECL is being accessed. */
1676 /* OBJECT_TYPE might not be a class type; consider:
1678 class A { typedef int I; };
1682 In this case, we will have "A::I" as the DECL, but "I" as the
1684 && CLASS_TYPE_P (object_type
)
1685 && DERIVED_FROM_P (scope
, object_type
))
1686 /* If we are processing a `->' or `.' expression, use the type of the
1688 qualifying_type
= object_type
;
1689 else if (nested_name_specifier
)
1691 /* If the reference is to a non-static member of the
1692 current class, treat it as if it were referenced through
1694 if (DECL_NONSTATIC_MEMBER_P (decl
)
1695 && current_class_ptr
1696 && DERIVED_FROM_P (scope
, current_class_type
))
1697 qualifying_type
= current_class_type
;
1698 /* Otherwise, use the type indicated by the
1699 nested-name-specifier. */
1701 qualifying_type
= nested_name_specifier
;
1704 /* Otherwise, the name must be from the current class or one of
1706 qualifying_type
= currently_open_derived_class (scope
);
1709 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1710 or similar in a default argument value. */
1711 && CLASS_TYPE_P (qualifying_type
)
1712 && !dependent_type_p (qualifying_type
))
1713 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1717 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1718 class named to the left of the "::" operator. DONE is true if this
1719 expression is a complete postfix-expression; it is false if this
1720 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1721 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1722 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1723 is true iff this qualified name appears as a template argument. */
1726 finish_qualified_id_expr (tree qualifying_class
,
1731 bool template_arg_p
)
1733 gcc_assert (TYPE_P (qualifying_class
));
1735 if (error_operand_p (expr
))
1736 return error_mark_node
;
1738 if (DECL_P (expr
) || BASELINK_P (expr
))
1742 check_template_keyword (expr
);
1744 /* If EXPR occurs as the operand of '&', use special handling that
1745 permits a pointer-to-member. */
1746 if (address_p
&& done
)
1748 if (TREE_CODE (expr
) == SCOPE_REF
)
1749 expr
= TREE_OPERAND (expr
, 1);
1750 expr
= build_offset_ref (qualifying_class
, expr
,
1751 /*address_p=*/true);
1755 /* Within the scope of a class, turn references to non-static
1756 members into expression of the form "this->...". */
1758 /* But, within a template argument, we do not want make the
1759 transformation, as there is no "this" pointer. */
1761 else if (TREE_CODE (expr
) == FIELD_DECL
)
1763 push_deferring_access_checks (dk_no_check
);
1764 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1766 pop_deferring_access_checks ();
1768 else if (BASELINK_P (expr
) && !processing_template_decl
)
1772 /* See if any of the functions are non-static members. */
1773 /* If so, the expression may be relative to 'this'. */
1774 if (!shared_member_p (expr
)
1775 && (ob
= maybe_dummy_object (qualifying_class
, NULL
),
1776 !is_dummy_object (ob
)))
1777 expr
= (build_class_member_access_expr
1780 BASELINK_ACCESS_BINFO (expr
),
1781 /*preserve_reference=*/false,
1782 tf_warning_or_error
));
1784 /* The expression is a qualified name whose address is not
1786 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1792 /* Begin a statement-expression. The value returned must be passed to
1793 finish_stmt_expr. */
1796 begin_stmt_expr (void)
1798 return push_stmt_list ();
1801 /* Process the final expression of a statement expression. EXPR can be
1802 NULL, if the final expression is empty. Return a STATEMENT_LIST
1803 containing all the statements in the statement-expression, or
1804 ERROR_MARK_NODE if there was an error. */
1807 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1809 if (error_operand_p (expr
))
1811 /* The type of the statement-expression is the type of the last
1813 TREE_TYPE (stmt_expr
) = error_mark_node
;
1814 return error_mark_node
;
1817 /* If the last statement does not have "void" type, then the value
1818 of the last statement is the value of the entire expression. */
1821 tree type
= TREE_TYPE (expr
);
1823 if (processing_template_decl
)
1825 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1826 expr
= add_stmt (expr
);
1827 /* Mark the last statement so that we can recognize it as such at
1828 template-instantiation time. */
1829 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1831 else if (VOID_TYPE_P (type
))
1833 /* Just treat this like an ordinary statement. */
1834 expr
= finish_expr_stmt (expr
);
1838 /* It actually has a value we need to deal with. First, force it
1839 to be an rvalue so that we won't need to build up a copy
1840 constructor call later when we try to assign it to something. */
1841 expr
= force_rvalue (expr
, tf_warning_or_error
);
1842 if (error_operand_p (expr
))
1843 return error_mark_node
;
1845 /* Update for array-to-pointer decay. */
1846 type
= TREE_TYPE (expr
);
1848 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1849 normal statement, but don't convert to void or actually add
1851 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1852 expr
= maybe_cleanup_point_expr (expr
);
1856 /* The type of the statement-expression is the type of the last
1858 TREE_TYPE (stmt_expr
) = type
;
1864 /* Finish a statement-expression. EXPR should be the value returned
1865 by the previous begin_stmt_expr. Returns an expression
1866 representing the statement-expression. */
1869 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1874 if (error_operand_p (stmt_expr
))
1876 pop_stmt_list (stmt_expr
);
1877 return error_mark_node
;
1880 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1882 type
= TREE_TYPE (stmt_expr
);
1883 result
= pop_stmt_list (stmt_expr
);
1884 TREE_TYPE (result
) = type
;
1886 if (processing_template_decl
)
1888 result
= build_min (STMT_EXPR
, type
, result
);
1889 TREE_SIDE_EFFECTS (result
) = 1;
1890 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1892 else if (CLASS_TYPE_P (type
))
1894 /* Wrap the statement-expression in a TARGET_EXPR so that the
1895 temporary object created by the final expression is destroyed at
1896 the end of the full-expression containing the
1897 statement-expression. */
1898 result
= force_target_expr (type
, result
, tf_warning_or_error
);
1904 /* Returns the expression which provides the value of STMT_EXPR. */
1907 stmt_expr_value_expr (tree stmt_expr
)
1909 tree t
= STMT_EXPR_STMT (stmt_expr
);
1911 if (TREE_CODE (t
) == BIND_EXPR
)
1912 t
= BIND_EXPR_BODY (t
);
1914 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1915 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1917 if (TREE_CODE (t
) == EXPR_STMT
)
1918 t
= EXPR_STMT_EXPR (t
);
1923 /* Return TRUE iff EXPR_STMT is an empty list of
1924 expression statements. */
1927 empty_expr_stmt_p (tree expr_stmt
)
1929 tree body
= NULL_TREE
;
1931 if (expr_stmt
== void_zero_node
)
1936 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1937 body
= EXPR_STMT_EXPR (expr_stmt
);
1938 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1944 if (TREE_CODE (body
) == STATEMENT_LIST
)
1945 return tsi_end_p (tsi_start (body
));
1947 return empty_expr_stmt_p (body
);
1952 /* Perform Koenig lookup. FN is the postfix-expression representing
1953 the function (or functions) to call; ARGS are the arguments to the
1954 call; if INCLUDE_STD then the `std' namespace is automatically
1955 considered an associated namespace (used in range-based for loops).
1956 Returns the functions to be considered by overload resolution. */
1959 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
, bool include_std
,
1960 tsubst_flags_t complain
)
1962 tree identifier
= NULL_TREE
;
1963 tree functions
= NULL_TREE
;
1964 tree tmpl_args
= NULL_TREE
;
1965 bool template_id
= false;
1967 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1969 /* Use a separate flag to handle null args. */
1971 tmpl_args
= TREE_OPERAND (fn
, 1);
1972 fn
= TREE_OPERAND (fn
, 0);
1975 /* Find the name of the overloaded function. */
1976 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1978 else if (is_overloaded_fn (fn
))
1981 identifier
= DECL_NAME (get_first_fn (functions
));
1983 else if (DECL_P (fn
))
1986 identifier
= DECL_NAME (fn
);
1989 /* A call to a namespace-scope function using an unqualified name.
1991 Do Koenig lookup -- unless any of the arguments are
1993 if (!any_type_dependent_arguments_p (args
)
1994 && !any_dependent_template_arguments_p (tmpl_args
))
1996 fn
= lookup_arg_dependent (identifier
, functions
, args
, include_std
);
1999 /* The unqualified name could not be resolved. */
2001 fn
= unqualified_fn_lookup_error (identifier
);
2007 if (fn
&& template_id
)
2008 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2013 /* Generate an expression for `FN (ARGS)'. This may change the
2016 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2017 as a virtual call, even if FN is virtual. (This flag is set when
2018 encountering an expression where the function name is explicitly
2019 qualified. For example a call to `X::f' never generates a virtual
2022 Returns code for the call. */
2025 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
2026 bool koenig_p
, tsubst_flags_t complain
)
2030 VEC(tree
,gc
) *orig_args
= NULL
;
2032 if (fn
== error_mark_node
)
2033 return error_mark_node
;
2035 gcc_assert (!TYPE_P (fn
));
2039 if (processing_template_decl
)
2041 /* If the call expression is dependent, build a CALL_EXPR node
2042 with no type; type_dependent_expression_p recognizes
2043 expressions with no type as being dependent. */
2044 if (type_dependent_expression_p (fn
)
2045 || any_type_dependent_arguments_p (*args
)
2046 /* For a non-static member function that doesn't have an
2047 explicit object argument, we need to specifically
2048 test the type dependency of the "this" pointer because it
2049 is not included in *ARGS even though it is considered to
2050 be part of the list of arguments. Note that this is
2051 related to CWG issues 515 and 1005. */
2052 || (TREE_CODE (fn
) != COMPONENT_REF
2053 && non_static_member_function_p (fn
)
2054 && current_class_ref
2055 && type_dependent_expression_p (current_class_ref
)))
2057 result
= build_nt_call_vec (fn
, *args
);
2058 KOENIG_LOOKUP_P (result
) = koenig_p
;
2063 tree fndecl
= OVL_CURRENT (fn
);
2064 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2065 || !TREE_THIS_VOLATILE (fndecl
))
2071 current_function_returns_abnormally
= 1;
2075 orig_args
= make_tree_vector_copy (*args
);
2076 if (!BASELINK_P (fn
)
2077 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2078 && TREE_TYPE (fn
) != unknown_type_node
)
2079 fn
= build_non_dependent_expr (fn
);
2080 make_args_non_dependent (*args
);
2083 if (TREE_CODE (fn
) == COMPONENT_REF
)
2085 tree member
= TREE_OPERAND (fn
, 1);
2086 if (BASELINK_P (member
))
2088 tree object
= TREE_OPERAND (fn
, 0);
2089 return build_new_method_call (object
, member
,
2092 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2099 if (is_overloaded_fn (fn
))
2100 fn
= baselink_for_fns (fn
);
2103 if (BASELINK_P (fn
))
2107 /* A call to a member function. From [over.call.func]:
2109 If the keyword this is in scope and refers to the class of
2110 that member function, or a derived class thereof, then the
2111 function call is transformed into a qualified function call
2112 using (*this) as the postfix-expression to the left of the
2113 . operator.... [Otherwise] a contrived object of type T
2114 becomes the implied object argument.
2118 struct A { void f(); };
2119 struct B : public A {};
2120 struct C : public A { void g() { B::f(); }};
2122 "the class of that member function" refers to `A'. But 11.2
2123 [class.access.base] says that we need to convert 'this' to B* as
2124 part of the access, so we pass 'B' to maybe_dummy_object. */
2126 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2129 if (processing_template_decl
)
2131 if (type_dependent_expression_p (object
))
2133 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2134 release_tree_vector (orig_args
);
2137 object
= build_non_dependent_expr (object
);
2140 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2142 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2147 else if (is_overloaded_fn (fn
))
2149 /* If the function is an overloaded builtin, resolve it. */
2150 if (TREE_CODE (fn
) == FUNCTION_DECL
2151 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2152 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2153 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2156 /* A call to a namespace-scope function. */
2157 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2159 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2161 if (!VEC_empty (tree
, *args
))
2162 error ("arguments to destructor are not allowed");
2163 /* Mark the pseudo-destructor call as having side-effects so
2164 that we do not issue warnings about its use. */
2165 result
= build1 (NOP_EXPR
,
2167 TREE_OPERAND (fn
, 0));
2168 TREE_SIDE_EFFECTS (result
) = 1;
2170 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2171 /* If the "function" is really an object of class type, it might
2172 have an overloaded `operator ()'. */
2173 result
= build_op_call (fn
, args
, complain
);
2176 /* A call where the function is unknown. */
2177 result
= cp_build_function_call_vec (fn
, args
, complain
);
2179 if (processing_template_decl
&& result
!= error_mark_node
)
2181 if (TREE_CODE (result
) == INDIRECT_REF
)
2182 result
= TREE_OPERAND (result
, 0);
2183 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2184 SET_EXPR_LOCATION (result
, input_location
);
2185 KOENIG_LOOKUP_P (result
) = koenig_p
;
2186 release_tree_vector (orig_args
);
2187 result
= convert_from_reference (result
);
2192 /* Free garbage OVERLOADs from arg-dependent lookup. */
2193 tree next
= NULL_TREE
;
2195 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2198 if (processing_template_decl
)
2199 /* In a template, we'll re-use them at instantiation time. */
2200 OVL_ARG_DEPENDENT (fn
) = false;
2203 next
= OVL_CHAIN (fn
);
2212 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2213 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2214 POSTDECREMENT_EXPR.) */
2217 finish_increment_expr (tree expr
, enum tree_code code
)
2219 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2222 /* Finish a use of `this'. Returns an expression for `this'. */
2225 finish_this_expr (void)
2229 if (current_class_ptr
)
2231 tree type
= TREE_TYPE (current_class_ref
);
2233 /* In a lambda expression, 'this' refers to the captured 'this'. */
2234 if (LAMBDA_TYPE_P (type
))
2235 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2237 result
= current_class_ptr
;
2240 else if (current_function_decl
2241 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2243 error ("%<this%> is unavailable for static member functions");
2244 result
= error_mark_node
;
2248 if (current_function_decl
)
2249 error ("invalid use of %<this%> in non-member function");
2251 error ("invalid use of %<this%> at top level");
2252 result
= error_mark_node
;
2258 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2259 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2260 the TYPE for the type given. If SCOPE is non-NULL, the expression
2261 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2264 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2266 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2267 return error_mark_node
;
2269 gcc_assert (TYPE_P (destructor
));
2271 if (!processing_template_decl
)
2273 if (scope
== error_mark_node
)
2275 error ("invalid qualifying scope in pseudo-destructor name");
2276 return error_mark_node
;
2278 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2280 error ("qualified type %qT does not match destructor name ~%qT",
2282 return error_mark_node
;
2286 /* [expr.pseudo] says both:
2288 The type designated by the pseudo-destructor-name shall be
2289 the same as the object type.
2293 The cv-unqualified versions of the object type and of the
2294 type designated by the pseudo-destructor-name shall be the
2297 We implement the more generous second sentence, since that is
2298 what most other compilers do. */
2299 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2302 error ("%qE is not of type %qT", object
, destructor
);
2303 return error_mark_node
;
2307 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2310 /* Finish an expression of the form CODE EXPR. */
2313 finish_unary_op_expr (enum tree_code code
, tree expr
)
2315 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2316 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2317 overflow_warning (input_location
, result
);
2322 /* Finish a compound-literal expression. TYPE is the type to which
2323 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2326 finish_compound_literal (tree type
, tree compound_literal
,
2327 tsubst_flags_t complain
)
2329 if (type
== error_mark_node
)
2330 return error_mark_node
;
2332 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2335 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2337 return cp_build_c_cast (type
, compound_literal
, complain
);
2340 if (!TYPE_OBJ_P (type
))
2342 if (complain
& tf_error
)
2343 error ("compound literal of non-object type %qT", type
);
2344 return error_mark_node
;
2347 if (processing_template_decl
)
2349 TREE_TYPE (compound_literal
) = type
;
2350 /* Mark the expression as a compound literal. */
2351 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2352 return compound_literal
;
2355 type
= complete_type (type
);
2357 if (TYPE_NON_AGGREGATE_CLASS (type
))
2359 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2360 everywhere that deals with function arguments would be a pain, so
2361 just wrap it in a TREE_LIST. The parser set a flag so we know
2362 that it came from T{} rather than T({}). */
2363 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2364 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2365 return build_functional_cast (type
, compound_literal
, complain
);
2368 if (TREE_CODE (type
) == ARRAY_TYPE
2369 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2370 return error_mark_node
;
2371 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2372 if (SCALAR_TYPE_P (type
)
2373 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2374 && (complain
& tf_warning_or_error
))
2375 check_narrowing (type
, compound_literal
);
2376 if (TREE_CODE (type
) == ARRAY_TYPE
2377 && TYPE_DOMAIN (type
) == NULL_TREE
)
2379 cp_complete_array_type_or_error (&type
, compound_literal
,
2381 if (type
== error_mark_node
)
2382 return error_mark_node
;
2384 compound_literal
= digest_init (type
, compound_literal
, complain
);
2385 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2386 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2387 /* Put static/constant array temporaries in static variables, but always
2388 represent class temporaries with TARGET_EXPR so we elide copies. */
2389 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2390 && TREE_CODE (type
) == ARRAY_TYPE
2391 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2392 && initializer_constant_valid_p (compound_literal
, type
))
2394 tree decl
= create_temporary_var (type
);
2395 DECL_INITIAL (decl
) = compound_literal
;
2396 TREE_STATIC (decl
) = 1;
2397 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2399 /* 5.19 says that a constant expression can include an
2400 lvalue-rvalue conversion applied to "a glvalue of literal type
2401 that refers to a non-volatile temporary object initialized
2402 with a constant expression". Rather than try to communicate
2403 that this VAR_DECL is a temporary, just mark it constexpr. */
2404 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2405 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2406 TREE_CONSTANT (decl
) = true;
2408 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2409 decl
= pushdecl_top_level (decl
);
2410 DECL_NAME (decl
) = make_anon_name ();
2411 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2415 return get_target_expr_sfinae (compound_literal
, complain
);
2418 /* Return the declaration for the function-name variable indicated by
2422 finish_fname (tree id
)
2426 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2427 if (processing_template_decl
&& current_function_decl
)
2428 decl
= DECL_NAME (decl
);
2432 /* Finish a translation unit. */
2435 finish_translation_unit (void)
2437 /* In case there were missing closebraces,
2438 get us back to the global binding level. */
2440 while (current_namespace
!= global_namespace
)
2443 /* Do file scope __FUNCTION__ et al. */
2444 finish_fname_decls ();
2447 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2448 Returns the parameter. */
2451 finish_template_type_parm (tree aggr
, tree identifier
)
2453 if (aggr
!= class_type_node
)
2455 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2456 aggr
= class_type_node
;
2459 return build_tree_list (aggr
, identifier
);
2462 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2463 Returns the parameter. */
2466 finish_template_template_parm (tree aggr
, tree identifier
)
2468 tree decl
= build_decl (input_location
,
2469 TYPE_DECL
, identifier
, NULL_TREE
);
2470 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2471 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2472 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2473 DECL_ARTIFICIAL (decl
) = 1;
2474 end_template_decl ();
2476 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2478 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2479 /*is_primary=*/true, /*is_partial=*/false,
2482 return finish_template_type_parm (aggr
, tmpl
);
2485 /* ARGUMENT is the default-argument value for a template template
2486 parameter. If ARGUMENT is invalid, issue error messages and return
2487 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2490 check_template_template_default_arg (tree argument
)
2492 if (TREE_CODE (argument
) != TEMPLATE_DECL
2493 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2494 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2496 if (TREE_CODE (argument
) == TYPE_DECL
)
2497 error ("invalid use of type %qT as a default value for a template "
2498 "template-parameter", TREE_TYPE (argument
));
2500 error ("invalid default argument for a template template parameter");
2501 return error_mark_node
;
2507 /* Begin a class definition, as indicated by T. */
2510 begin_class_definition (tree t
, tree attributes
)
2512 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2513 return error_mark_node
;
2515 if (processing_template_parmlist
)
2517 error ("definition of %q#T inside template parameter list", t
);
2518 return error_mark_node
;
2521 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2522 are passed the same as decimal scalar types. */
2523 if (TREE_CODE (t
) == RECORD_TYPE
2524 && !processing_template_decl
)
2526 tree ns
= TYPE_CONTEXT (t
);
2527 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2528 && DECL_CONTEXT (ns
) == std_node
2530 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2532 const char *n
= TYPE_NAME_STRING (t
);
2533 if ((strcmp (n
, "decimal32") == 0)
2534 || (strcmp (n
, "decimal64") == 0)
2535 || (strcmp (n
, "decimal128") == 0))
2536 TYPE_TRANSPARENT_AGGR (t
) = 1;
2540 /* A non-implicit typename comes from code like:
2542 template <typename T> struct A {
2543 template <typename U> struct A<T>::B ...
2545 This is erroneous. */
2546 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2548 error ("invalid definition of qualified type %qT", t
);
2549 t
= error_mark_node
;
2552 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2554 t
= make_class_type (RECORD_TYPE
);
2555 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2558 if (TYPE_BEING_DEFINED (t
))
2560 t
= make_class_type (TREE_CODE (t
));
2561 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2563 maybe_process_partial_specialization (t
);
2565 TYPE_BEING_DEFINED (t
) = 1;
2567 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2568 fixup_attribute_variants (t
);
2570 if (flag_pack_struct
)
2573 TYPE_PACKED (t
) = 1;
2574 /* Even though the type is being defined for the first time
2575 here, there might have been a forward declaration, so there
2576 might be cv-qualified variants of T. */
2577 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2578 TYPE_PACKED (v
) = 1;
2580 /* Reset the interface data, at the earliest possible
2581 moment, as it might have been set via a class foo;
2583 if (! TYPE_ANONYMOUS_P (t
))
2585 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2586 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2587 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2588 (t
, finfo
->interface_unknown
);
2590 reset_specialization();
2592 /* Make a declaration for this class in its own scope. */
2593 build_self_reference ();
2598 /* Finish the member declaration given by DECL. */
2601 finish_member_declaration (tree decl
)
2603 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2606 if (decl
== void_type_node
)
2607 /* The COMPONENT was a friend, not a member, and so there's
2608 nothing for us to do. */
2611 /* We should see only one DECL at a time. */
2612 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2614 /* Set up access control for DECL. */
2616 = (current_access_specifier
== access_private_node
);
2617 TREE_PROTECTED (decl
)
2618 = (current_access_specifier
== access_protected_node
);
2619 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2621 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2622 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2625 /* Mark the DECL as a member of the current class. */
2626 DECL_CONTEXT (decl
) = current_class_type
;
2628 /* Check for bare parameter packs in the member variable declaration. */
2629 if (TREE_CODE (decl
) == FIELD_DECL
)
2631 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2632 TREE_TYPE (decl
) = error_mark_node
;
2633 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2634 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2639 A C language linkage is ignored for the names of class members
2640 and the member function type of class member functions. */
2641 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2642 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2644 /* Put functions on the TYPE_METHODS list and everything else on the
2645 TYPE_FIELDS list. Note that these are built up in reverse order.
2646 We reverse them (to obtain declaration order) in finish_struct. */
2647 if (TREE_CODE (decl
) == FUNCTION_DECL
2648 || DECL_FUNCTION_TEMPLATE_P (decl
))
2650 /* We also need to add this function to the
2651 CLASSTYPE_METHOD_VEC. */
2652 if (add_method (current_class_type
, decl
, NULL_TREE
))
2654 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2655 TYPE_METHODS (current_class_type
) = decl
;
2657 maybe_add_class_template_decl_list (current_class_type
, decl
,
2661 /* Enter the DECL into the scope of the class. */
2662 else if (pushdecl_class_level (decl
))
2664 if (TREE_CODE (decl
) == USING_DECL
)
2666 /* We need to add the target functions to the
2667 CLASSTYPE_METHOD_VEC if an enclosing scope is a template
2668 class, so that this function be found by lookup_fnfields_1
2669 when the using declaration is not instantiated yet. */
2671 tree target_decl
= strip_using_decl (decl
);
2672 if (dependent_type_p (current_class_type
)
2673 && is_overloaded_fn (target_decl
))
2675 tree t
= target_decl
;
2676 for (; t
; t
= OVL_NEXT (t
))
2677 add_method (current_class_type
, OVL_CURRENT (t
), decl
);
2680 /* For now, ignore class-scope USING_DECLS, so that
2681 debugging backends do not see them. */
2682 DECL_IGNORED_P (decl
) = 1;
2685 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2686 go at the beginning. The reason is that lookup_field_1
2687 searches the list in order, and we want a field name to
2688 override a type name so that the "struct stat hack" will
2689 work. In particular:
2691 struct S { enum E { }; int E } s;
2694 is valid. In addition, the FIELD_DECLs must be maintained in
2695 declaration order so that class layout works as expected.
2696 However, we don't need that order until class layout, so we
2697 save a little time by putting FIELD_DECLs on in reverse order
2698 here, and then reversing them in finish_struct_1. (We could
2699 also keep a pointer to the correct insertion points in the
2702 if (TREE_CODE (decl
) == TYPE_DECL
)
2703 TYPE_FIELDS (current_class_type
)
2704 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2707 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2708 TYPE_FIELDS (current_class_type
) = decl
;
2711 maybe_add_class_template_decl_list (current_class_type
, decl
,
2716 note_decl_for_pch (decl
);
2719 /* DECL has been declared while we are building a PCH file. Perform
2720 actions that we might normally undertake lazily, but which can be
2721 performed now so that they do not have to be performed in
2722 translation units which include the PCH file. */
2725 note_decl_for_pch (tree decl
)
2727 gcc_assert (pch_file
);
2729 /* There's a good chance that we'll have to mangle names at some
2730 point, even if only for emission in debugging information. */
2731 if ((TREE_CODE (decl
) == VAR_DECL
2732 || TREE_CODE (decl
) == FUNCTION_DECL
)
2733 && !processing_template_decl
)
2737 /* Finish processing a complete template declaration. The PARMS are
2738 the template parameters. */
2741 finish_template_decl (tree parms
)
2744 end_template_decl ();
2746 end_specialization ();
2749 /* Finish processing a template-id (which names a type) of the form
2750 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2751 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2752 the scope of template-id indicated. */
2755 finish_template_type (tree name
, tree args
, int entering_scope
)
2759 type
= lookup_template_class (name
, args
,
2760 NULL_TREE
, NULL_TREE
, entering_scope
,
2761 tf_warning_or_error
| tf_user
);
2762 if (type
== error_mark_node
)
2764 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
2765 return TYPE_STUB_DECL (type
);
2767 return TYPE_NAME (type
);
2770 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2771 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2772 BASE_CLASS, or NULL_TREE if an error occurred. The
2773 ACCESS_SPECIFIER is one of
2774 access_{default,public,protected_private}_node. For a virtual base
2775 we set TREE_TYPE. */
2778 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2782 if (base
== error_mark_node
)
2784 error ("invalid base-class specification");
2787 else if (! MAYBE_CLASS_TYPE_P (base
))
2789 error ("%qT is not a class type", base
);
2794 if (cp_type_quals (base
) != 0)
2796 /* DR 484: Can a base-specifier name a cv-qualified
2798 base
= TYPE_MAIN_VARIANT (base
);
2800 result
= build_tree_list (access
, base
);
2802 TREE_TYPE (result
) = integer_type_node
;
2808 /* If FNS is a member function, a set of member functions, or a
2809 template-id referring to one or more member functions, return a
2810 BASELINK for FNS, incorporating the current access context.
2811 Otherwise, return FNS unchanged. */
2814 baselink_for_fns (tree fns
)
2819 if (BASELINK_P (fns
)
2820 || error_operand_p (fns
))
2824 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2825 fn
= TREE_OPERAND (fn
, 0);
2826 fn
= get_first_fn (fn
);
2827 if (!DECL_FUNCTION_MEMBER_P (fn
))
2830 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2832 cl
= DECL_CONTEXT (fn
);
2833 cl
= TYPE_BINFO (cl
);
2834 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2837 /* Returns true iff DECL is an automatic variable from a function outside
2841 outer_automatic_var_p (tree decl
)
2843 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2844 && DECL_FUNCTION_SCOPE_P (decl
)
2845 && !TREE_STATIC (decl
)
2846 && DECL_CONTEXT (decl
) != current_function_decl
);
2849 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2850 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2851 if non-NULL, is the type or namespace used to explicitly qualify
2852 ID_EXPRESSION. DECL is the entity to which that name has been
2855 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2856 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2857 be set to true if this expression isn't permitted in a
2858 constant-expression, but it is otherwise not set by this function.
2859 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2860 constant-expression, but a non-constant expression is also
2863 DONE is true if this expression is a complete postfix-expression;
2864 it is false if this expression is followed by '->', '[', '(', etc.
2865 ADDRESS_P is true iff this expression is the operand of '&'.
2866 TEMPLATE_P is true iff the qualified-id was of the form
2867 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2868 appears as a template argument.
2870 If an error occurs, and it is the kind of error that might cause
2871 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2872 is the caller's responsibility to issue the message. *ERROR_MSG
2873 will be a string with static storage duration, so the caller need
2876 Return an expression for the entity, after issuing appropriate
2877 diagnostics. This function is also responsible for transforming a
2878 reference to a non-static member into a COMPONENT_REF that makes
2879 the use of "this" explicit.
2881 Upon return, *IDK will be filled in appropriately. */
2883 finish_id_expression (tree id_expression
,
2887 bool integral_constant_expression_p
,
2888 bool allow_non_integral_constant_expression_p
,
2889 bool *non_integral_constant_expression_p
,
2893 bool template_arg_p
,
2894 const char **error_msg
,
2895 location_t location
)
2897 decl
= strip_using_decl (decl
);
2899 /* Initialize the output parameters. */
2900 *idk
= CP_ID_KIND_NONE
;
2903 if (id_expression
== error_mark_node
)
2904 return error_mark_node
;
2905 /* If we have a template-id, then no further lookup is
2906 required. If the template-id was for a template-class, we
2907 will sometimes have a TYPE_DECL at this point. */
2908 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2909 || TREE_CODE (decl
) == TYPE_DECL
)
2911 /* Look up the name. */
2914 if (decl
== error_mark_node
)
2916 /* Name lookup failed. */
2919 || (!dependent_type_p (scope
)
2920 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2921 && IDENTIFIER_TYPENAME_P (id_expression
)
2922 && dependent_type_p (TREE_TYPE (id_expression
))))))
2924 /* If the qualifying type is non-dependent (and the name
2925 does not name a conversion operator to a dependent
2926 type), issue an error. */
2927 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2928 return error_mark_node
;
2932 /* It may be resolved via Koenig lookup. */
2933 *idk
= CP_ID_KIND_UNQUALIFIED
;
2934 return id_expression
;
2937 decl
= id_expression
;
2939 /* If DECL is a variable that would be out of scope under
2940 ANSI/ISO rules, but in scope in the ARM, name lookup
2941 will succeed. Issue a diagnostic here. */
2943 decl
= check_for_out_of_scope_variable (decl
);
2945 /* Remember that the name was used in the definition of
2946 the current class so that we can check later to see if
2947 the meaning would have been different after the class
2948 was entirely defined. */
2949 if (!scope
&& decl
!= error_mark_node
2950 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
2951 maybe_note_name_used_in_class (id_expression
, decl
);
2953 /* Disallow uses of local variables from containing functions, except
2954 within lambda-expressions. */
2955 if (outer_automatic_var_p (decl
)
2956 /* It's not a use (3.2) if we're in an unevaluated context. */
2957 && !cp_unevaluated_operand
)
2959 tree context
= DECL_CONTEXT (decl
);
2960 tree containing_function
= current_function_decl
;
2961 tree lambda_stack
= NULL_TREE
;
2962 tree lambda_expr
= NULL_TREE
;
2963 tree initializer
= convert_from_reference (decl
);
2965 /* Mark it as used now even if the use is ill-formed. */
2968 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2969 support for an approach in which a reference to a local
2970 [constant] automatic variable in a nested class or lambda body
2971 would enter the expression as an rvalue, which would reduce
2972 the complexity of the problem"
2974 FIXME update for final resolution of core issue 696. */
2975 if (decl_constant_var_p (decl
))
2976 return integral_constant_value (decl
);
2978 /* If we are in a lambda function, we can move out until we hit
2980 2. a non-lambda function, or
2981 3. a non-default capturing lambda function. */
2982 while (context
!= containing_function
2983 && LAMBDA_FUNCTION_P (containing_function
))
2985 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2986 (DECL_CONTEXT (containing_function
));
2988 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2992 lambda_stack
= tree_cons (NULL_TREE
,
2997 = decl_function_context (containing_function
);
3000 if (context
== containing_function
)
3002 decl
= add_default_capture (lambda_stack
,
3003 /*id=*/DECL_NAME (decl
),
3006 else if (lambda_expr
)
3008 error ("%qD is not captured", decl
);
3009 return error_mark_node
;
3013 error (TREE_CODE (decl
) == VAR_DECL
3014 ? G_("use of %<auto%> variable from containing function")
3015 : G_("use of parameter from containing function"));
3016 error (" %q+#D declared here", decl
);
3017 return error_mark_node
;
3021 /* Also disallow uses of function parameters outside the function
3022 body, except inside an unevaluated context (i.e. decltype). */
3023 if (TREE_CODE (decl
) == PARM_DECL
3024 && DECL_CONTEXT (decl
) == NULL_TREE
3025 && !cp_unevaluated_operand
)
3027 error ("use of parameter %qD outside function body", decl
);
3028 return error_mark_node
;
3032 /* If we didn't find anything, or what we found was a type,
3033 then this wasn't really an id-expression. */
3034 if (TREE_CODE (decl
) == TEMPLATE_DECL
3035 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3037 *error_msg
= "missing template arguments";
3038 return error_mark_node
;
3040 else if (TREE_CODE (decl
) == TYPE_DECL
3041 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3043 *error_msg
= "expected primary-expression";
3044 return error_mark_node
;
3047 /* If the name resolved to a template parameter, there is no
3048 need to look it up again later. */
3049 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3050 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3054 *idk
= CP_ID_KIND_NONE
;
3055 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3056 decl
= TEMPLATE_PARM_DECL (decl
);
3057 r
= convert_from_reference (DECL_INITIAL (decl
));
3059 if (integral_constant_expression_p
3060 && !dependent_type_p (TREE_TYPE (decl
))
3061 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3063 if (!allow_non_integral_constant_expression_p
)
3064 error ("template parameter %qD of type %qT is not allowed in "
3065 "an integral constant expression because it is not of "
3066 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3067 *non_integral_constant_expression_p
= true;
3071 /* Similarly, we resolve enumeration constants to their
3072 underlying values. */
3073 else if (TREE_CODE (decl
) == CONST_DECL
)
3075 *idk
= CP_ID_KIND_NONE
;
3076 if (!processing_template_decl
)
3078 used_types_insert (TREE_TYPE (decl
));
3079 return DECL_INITIAL (decl
);
3087 /* If the declaration was explicitly qualified indicate
3088 that. The semantics of `A::f(3)' are different than
3089 `f(3)' if `f' is virtual. */
3091 ? CP_ID_KIND_QUALIFIED
3092 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3093 ? CP_ID_KIND_TEMPLATE_ID
3094 : CP_ID_KIND_UNQUALIFIED
));
3099 An id-expression is type-dependent if it contains an
3100 identifier that was declared with a dependent type.
3102 The standard is not very specific about an id-expression that
3103 names a set of overloaded functions. What if some of them
3104 have dependent types and some of them do not? Presumably,
3105 such a name should be treated as a dependent name. */
3106 /* Assume the name is not dependent. */
3107 dependent_p
= false;
3108 if (!processing_template_decl
)
3109 /* No names are dependent outside a template. */
3111 /* A template-id where the name of the template was not resolved
3112 is definitely dependent. */
3113 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3114 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3115 == IDENTIFIER_NODE
))
3117 /* For anything except an overloaded function, just check its
3119 else if (!is_overloaded_fn (decl
))
3121 = dependent_type_p (TREE_TYPE (decl
));
3122 /* For a set of overloaded functions, check each of the
3128 if (BASELINK_P (fns
))
3129 fns
= BASELINK_FUNCTIONS (fns
);
3131 /* For a template-id, check to see if the template
3132 arguments are dependent. */
3133 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3135 tree args
= TREE_OPERAND (fns
, 1);
3136 dependent_p
= any_dependent_template_arguments_p (args
);
3137 /* The functions are those referred to by the
3139 fns
= TREE_OPERAND (fns
, 0);
3142 /* If there are no dependent template arguments, go through
3143 the overloaded functions. */
3144 while (fns
&& !dependent_p
)
3146 tree fn
= OVL_CURRENT (fns
);
3148 /* Member functions of dependent classes are
3150 if (TREE_CODE (fn
) == FUNCTION_DECL
3151 && type_dependent_expression_p (fn
))
3153 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3154 && dependent_template_p (fn
))
3157 fns
= OVL_NEXT (fns
);
3161 /* If the name was dependent on a template parameter, we will
3162 resolve the name at instantiation time. */
3165 /* Create a SCOPE_REF for qualified names, if the scope is
3171 if (address_p
&& done
)
3172 decl
= finish_qualified_id_expr (scope
, decl
,
3178 tree type
= NULL_TREE
;
3179 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3180 type
= TREE_TYPE (decl
);
3181 decl
= build_qualified_name (type
,
3187 if (TREE_TYPE (decl
))
3188 decl
= convert_from_reference (decl
);
3191 /* A TEMPLATE_ID already contains all the information we
3193 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3194 return id_expression
;
3195 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3196 /* If we found a variable, then name lookup during the
3197 instantiation will always resolve to the same VAR_DECL
3198 (or an instantiation thereof). */
3199 if (TREE_CODE (decl
) == VAR_DECL
3200 || TREE_CODE (decl
) == PARM_DECL
)
3203 return convert_from_reference (decl
);
3205 /* The same is true for FIELD_DECL, but we also need to
3206 make sure that the syntax is correct. */
3207 else if (TREE_CODE (decl
) == FIELD_DECL
)
3209 /* Since SCOPE is NULL here, this is an unqualified name.
3210 Access checking has been performed during name lookup
3211 already. Turn off checking to avoid duplicate errors. */
3212 push_deferring_access_checks (dk_no_check
);
3213 decl
= finish_non_static_data_member
3215 /*qualifying_scope=*/NULL_TREE
);
3216 pop_deferring_access_checks ();
3219 return id_expression
;
3222 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3224 error ("use of namespace %qD as expression", decl
);
3225 return error_mark_node
;
3227 else if (DECL_CLASS_TEMPLATE_P (decl
))
3229 error ("use of class template %qT as expression", decl
);
3230 return error_mark_node
;
3232 else if (TREE_CODE (decl
) == TREE_LIST
)
3234 /* Ambiguous reference to base members. */
3235 error ("request for member %qD is ambiguous in "
3236 "multiple inheritance lattice", id_expression
);
3237 print_candidates (decl
);
3238 return error_mark_node
;
3241 /* Mark variable-like entities as used. Functions are similarly
3242 marked either below or after overload resolution. */
3243 if (TREE_CODE (decl
) == VAR_DECL
3244 || TREE_CODE (decl
) == PARM_DECL
3245 || TREE_CODE (decl
) == RESULT_DECL
)
3248 /* Only certain kinds of names are allowed in constant
3249 expression. Enumerators and template parameters have already
3250 been handled above. */
3251 if (! error_operand_p (decl
)
3252 && integral_constant_expression_p
3253 && ! decl_constant_var_p (decl
)
3254 && ! builtin_valid_in_constant_expr_p (decl
))
3256 if (!allow_non_integral_constant_expression_p
)
3258 error ("%qD cannot appear in a constant-expression", decl
);
3259 return error_mark_node
;
3261 *non_integral_constant_expression_p
= true;
3266 decl
= (adjust_result_of_qualified_name_lookup
3267 (decl
, scope
, current_nonlambda_class_type()));
3269 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3272 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3273 decl
= finish_qualified_id_expr (scope
,
3281 tree r
= convert_from_reference (decl
);
3283 /* In a template, return a SCOPE_REF for most qualified-ids
3284 so that we can check access at instantiation time. But if
3285 we're looking at a member of the current instantiation, we
3286 know we have access and building up the SCOPE_REF confuses
3287 non-type template argument handling. */
3288 if (processing_template_decl
&& TYPE_P (scope
)
3289 && !currently_open_class (scope
))
3290 r
= build_qualified_name (TREE_TYPE (r
),
3296 else if (TREE_CODE (decl
) == FIELD_DECL
)
3298 /* Since SCOPE is NULL here, this is an unqualified name.
3299 Access checking has been performed during name lookup
3300 already. Turn off checking to avoid duplicate errors. */
3301 push_deferring_access_checks (dk_no_check
);
3302 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3303 /*qualifying_scope=*/NULL_TREE
);
3304 pop_deferring_access_checks ();
3306 else if (is_overloaded_fn (decl
))
3310 first_fn
= get_first_fn (decl
);
3311 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3312 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3314 if (!really_overloaded_fn (decl
)
3315 && !mark_used (first_fn
))
3316 return error_mark_node
;
3319 && TREE_CODE (first_fn
) == FUNCTION_DECL
3320 && DECL_FUNCTION_MEMBER_P (first_fn
)
3321 && !shared_member_p (decl
))
3323 /* A set of member functions. */
3324 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3325 return finish_class_member_access_expr (decl
, id_expression
,
3326 /*template_p=*/false,
3327 tf_warning_or_error
);
3330 decl
= baselink_for_fns (decl
);
3334 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3335 && DECL_CLASS_SCOPE_P (decl
))
3337 tree context
= context_for_name_lookup (decl
);
3338 if (context
!= current_class_type
)
3340 tree path
= currently_open_derived_class (context
);
3341 perform_or_defer_access_check (TYPE_BINFO (path
),
3346 decl
= convert_from_reference (decl
);
3350 if (TREE_DEPRECATED (decl
))
3351 warn_deprecated_use (decl
, NULL_TREE
);
3356 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3357 use as a type-specifier. */
3360 finish_typeof (tree expr
)
3364 if (type_dependent_expression_p (expr
))
3366 type
= cxx_make_type (TYPEOF_TYPE
);
3367 TYPEOF_TYPE_EXPR (type
) = expr
;
3368 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3373 expr
= mark_type_use (expr
);
3375 type
= unlowered_expr_type (expr
);
3377 if (!type
|| type
== unknown_type_node
)
3379 error ("type of %qE is unknown", expr
);
3380 return error_mark_node
;
3386 /* Implement the __underlying_type keyword: Return the underlying
3387 type of TYPE, suitable for use as a type-specifier. */
3390 finish_underlying_type (tree type
)
3392 tree underlying_type
;
3394 if (processing_template_decl
)
3396 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3397 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3398 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3400 return underlying_type
;
3403 complete_type (type
);
3405 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3407 error ("%qT is not an enumeration type", type
);
3408 return error_mark_node
;
3411 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3413 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3414 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3415 See finish_enum_value_list for details. */
3416 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3418 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3419 TYPE_UNSIGNED (underlying_type
));
3421 return underlying_type
;
3424 /* Implement the __direct_bases keyword: Return the direct base classes
3428 calculate_direct_bases (tree type
)
3430 VEC(tree
, gc
) *vector
= make_tree_vector();
3431 tree bases_vec
= NULL_TREE
;
3432 VEC(tree
, none
) *base_binfos
;
3436 complete_type (type
);
3438 if (!NON_UNION_CLASS_TYPE_P (type
))
3439 return make_tree_vec (0);
3441 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3443 /* Virtual bases are initialized first */
3444 for (i
= 0; VEC_iterate (tree
, base_binfos
, i
, binfo
); i
++)
3446 if (BINFO_VIRTUAL_P (binfo
))
3448 VEC_safe_push (tree
, gc
, vector
, binfo
);
3452 /* Now non-virtuals */
3453 for (i
= 0; VEC_iterate (tree
, base_binfos
, i
, binfo
); i
++)
3455 if (!BINFO_VIRTUAL_P (binfo
))
3457 VEC_safe_push (tree
, gc
, vector
, binfo
);
3462 bases_vec
= make_tree_vec (VEC_length (tree
, vector
));
3464 for (i
= 0; i
< VEC_length (tree
, vector
); ++i
)
3466 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE (VEC_index (tree
, vector
, i
));
3471 /* Implement the __bases keyword: Return the base classes
3474 /* Find morally non-virtual base classes by walking binfo hierarchy */
3475 /* Virtual base classes are handled separately in finish_bases */
3478 dfs_calculate_bases_pre (tree binfo
, ATTRIBUTE_UNUSED
void *data_
)
3480 /* Don't walk bases of virtual bases */
3481 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3485 dfs_calculate_bases_post (tree binfo
, void *data_
)
3487 VEC(tree
, gc
) **data
= (VEC(tree
, gc
) **) data_
;
3488 if (!BINFO_VIRTUAL_P (binfo
))
3490 VEC_safe_push (tree
, gc
, *data
, BINFO_TYPE (binfo
));
3495 /* Calculates the morally non-virtual base classes of a class */
3496 static VEC(tree
, gc
) *
3497 calculate_bases_helper (tree type
)
3499 VEC(tree
, gc
) *vector
= make_tree_vector();
3501 /* Now add non-virtual base classes in order of construction */
3502 dfs_walk_all (TYPE_BINFO (type
),
3503 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3508 calculate_bases (tree type
)
3510 VEC(tree
, gc
) *vector
= make_tree_vector();
3511 tree bases_vec
= NULL_TREE
;
3513 VEC(tree
, gc
) *vbases
;
3514 VEC(tree
, gc
) *nonvbases
;
3517 complete_type (type
);
3519 if (!NON_UNION_CLASS_TYPE_P (type
))
3520 return make_tree_vec (0);
3522 /* First go through virtual base classes */
3523 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3524 VEC_iterate (tree
, vbases
, i
, binfo
); i
++)
3526 VEC(tree
, gc
) *vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3527 VEC_safe_splice (tree
, gc
, vector
, vbase_bases
);
3528 release_tree_vector (vbase_bases
);
3531 /* Now for the non-virtual bases */
3532 nonvbases
= calculate_bases_helper (type
);
3533 VEC_safe_splice (tree
, gc
, vector
, nonvbases
);
3534 release_tree_vector (nonvbases
);
3536 /* Last element is entire class, so don't copy */
3537 bases_vec
= make_tree_vec (VEC_length (tree
, vector
) - 1);
3539 for (i
= 0; i
< VEC_length (tree
, vector
) - 1; ++i
)
3541 TREE_VEC_ELT (bases_vec
, i
) = VEC_index (tree
, vector
, i
);
3543 release_tree_vector (vector
);
3548 finish_bases (tree type
, bool direct
)
3550 tree bases
= NULL_TREE
;
3552 if (!processing_template_decl
)
3554 /* Parameter packs can only be used in templates */
3555 error ("Parameter pack __bases only valid in template declaration");
3556 return error_mark_node
;
3559 bases
= cxx_make_type (BASES
);
3560 BASES_TYPE (bases
) = type
;
3561 BASES_DIRECT (bases
) = direct
;
3562 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3567 /* Perform C++-specific checks for __builtin_offsetof before calling
3571 finish_offsetof (tree expr
)
3573 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3575 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3576 TREE_OPERAND (expr
, 2));
3577 return error_mark_node
;
3579 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3580 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3581 || TREE_TYPE (expr
) == unknown_type_node
)
3583 if (TREE_CODE (expr
) == COMPONENT_REF
3584 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3585 expr
= TREE_OPERAND (expr
, 1);
3586 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3587 return error_mark_node
;
3589 if (REFERENCE_REF_P (expr
))
3590 expr
= TREE_OPERAND (expr
, 0);
3591 if (TREE_CODE (expr
) == COMPONENT_REF
)
3593 tree object
= TREE_OPERAND (expr
, 0);
3594 if (!complete_type_or_else (TREE_TYPE (object
), object
))
3595 return error_mark_node
;
3597 return fold_offsetof (expr
);
3600 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3601 function is broken out from the above for the benefit of the tree-ssa
3605 simplify_aggr_init_expr (tree
*tp
)
3607 tree aggr_init_expr
= *tp
;
3609 /* Form an appropriate CALL_EXPR. */
3610 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3611 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3612 tree type
= TREE_TYPE (slot
);
3615 enum style_t
{ ctor
, arg
, pcc
} style
;
3617 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3619 #ifdef PCC_STATIC_STRUCT_RETURN
3625 gcc_assert (TREE_ADDRESSABLE (type
));
3629 call_expr
= build_call_array_loc (input_location
,
3630 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3632 aggr_init_expr_nargs (aggr_init_expr
),
3633 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3634 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3638 /* Replace the first argument to the ctor with the address of the
3640 cxx_mark_addressable (slot
);
3641 CALL_EXPR_ARG (call_expr
, 0) =
3642 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3644 else if (style
== arg
)
3646 /* Just mark it addressable here, and leave the rest to
3647 expand_call{,_inline}. */
3648 cxx_mark_addressable (slot
);
3649 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3650 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3652 else if (style
== pcc
)
3654 /* If we're using the non-reentrant PCC calling convention, then we
3655 need to copy the returned value out of the static buffer into the
3657 push_deferring_access_checks (dk_no_check
);
3658 call_expr
= build_aggr_init (slot
, call_expr
,
3659 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3660 tf_warning_or_error
);
3661 pop_deferring_access_checks ();
3662 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3665 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3667 tree init
= build_zero_init (type
, NULL_TREE
,
3668 /*static_storage_p=*/false);
3669 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3670 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3677 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3680 emit_associated_thunks (tree fn
)
3682 /* When we use vcall offsets, we emit thunks with the virtual
3683 functions to which they thunk. The whole point of vcall offsets
3684 is so that you can know statically the entire set of thunks that
3685 will ever be needed for a given virtual function, thereby
3686 enabling you to output all the thunks with the function itself. */
3687 if (DECL_VIRTUAL_P (fn
)
3688 /* Do not emit thunks for extern template instantiations. */
3689 && ! DECL_REALLY_EXTERN (fn
))
3693 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3695 if (!THUNK_ALIAS (thunk
))
3697 use_thunk (thunk
, /*emit_p=*/1);
3698 if (DECL_RESULT_THUNK_P (thunk
))
3702 for (probe
= DECL_THUNKS (thunk
);
3703 probe
; probe
= DECL_CHAIN (probe
))
3704 use_thunk (probe
, /*emit_p=*/1);
3708 gcc_assert (!DECL_THUNKS (thunk
));
3713 /* Returns true iff FUN is an instantiation of a constexpr function
3717 is_instantiation_of_constexpr (tree fun
)
3719 return (DECL_TEMPLOID_INSTANTIATION (fun
)
3720 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3721 (DECL_TI_TEMPLATE (fun
))));
3724 /* Generate RTL for FN. */
3727 expand_or_defer_fn_1 (tree fn
)
3729 /* When the parser calls us after finishing the body of a template
3730 function, we don't really want to expand the body. */
3731 if (processing_template_decl
)
3733 /* Normally, collection only occurs in rest_of_compilation. So,
3734 if we don't collect here, we never collect junk generated
3735 during the processing of templates until we hit a
3736 non-template function. It's not safe to do this inside a
3737 nested class, though, as the parser may have local state that
3738 is not a GC root. */
3739 if (!function_depth
)
3744 gcc_assert (DECL_SAVED_TREE (fn
));
3746 /* If this is a constructor or destructor body, we have to clone
3748 if (maybe_clone_body (fn
))
3750 /* We don't want to process FN again, so pretend we've written
3751 it out, even though we haven't. */
3752 TREE_ASM_WRITTEN (fn
) = 1;
3753 /* If this is an instantiation of a constexpr function, keep
3754 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3755 if (!is_instantiation_of_constexpr (fn
))
3756 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3760 /* We make a decision about linkage for these functions at the end
3761 of the compilation. Until that point, we do not want the back
3762 end to output them -- but we do want it to see the bodies of
3763 these functions so that it can inline them as appropriate. */
3764 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3766 if (DECL_INTERFACE_KNOWN (fn
))
3767 /* We've already made a decision as to how this function will
3771 DECL_EXTERNAL (fn
) = 1;
3772 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3773 note_vague_linkage_fn (fn
);
3774 /* A non-template inline function with external linkage will
3775 always be COMDAT. As we must eventually determine the
3776 linkage of all functions, and as that causes writes to
3777 the data mapped in from the PCH file, it's advantageous
3778 to mark the functions at this point. */
3779 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3781 /* This function must have external linkage, as
3782 otherwise DECL_INTERFACE_KNOWN would have been
3784 gcc_assert (TREE_PUBLIC (fn
));
3785 comdat_linkage (fn
);
3786 DECL_INTERFACE_KNOWN (fn
) = 1;
3790 import_export_decl (fn
);
3792 /* If the user wants us to keep all inline functions, then mark
3793 this function as needed so that finish_file will make sure to
3794 output it later. Similarly, all dllexport'd functions must
3795 be emitted; there may be callers in other DLLs. */
3796 if ((flag_keep_inline_functions
3797 && DECL_DECLARED_INLINE_P (fn
)
3798 && !DECL_REALLY_EXTERN (fn
))
3799 || (flag_keep_inline_dllexport
3800 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3803 DECL_EXTERNAL (fn
) = 0;
3807 /* There's no reason to do any of the work here if we're only doing
3808 semantic analysis; this code just generates RTL. */
3809 if (flag_syntax_only
)
3816 expand_or_defer_fn (tree fn
)
3818 if (expand_or_defer_fn_1 (fn
))
3822 /* Expand or defer, at the whim of the compilation unit manager. */
3823 cgraph_finalize_function (fn
, function_depth
> 1);
3824 emit_associated_thunks (fn
);
3837 /* Helper function for walk_tree, used by finalize_nrv below. */
3840 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3842 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3845 /* No need to walk into types. There wouldn't be any need to walk into
3846 non-statements, except that we have to consider STMT_EXPRs. */
3849 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3850 but differs from using NULL_TREE in that it indicates that we care
3851 about the value of the RESULT_DECL. */
3852 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3853 TREE_OPERAND (*tp
, 0) = dp
->result
;
3854 /* Change all cleanups for the NRV to only run when an exception is
3856 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3857 && CLEANUP_DECL (*tp
) == dp
->var
)
3858 CLEANUP_EH_ONLY (*tp
) = 1;
3859 /* Replace the DECL_EXPR for the NRV with an initialization of the
3860 RESULT_DECL, if needed. */
3861 else if (TREE_CODE (*tp
) == DECL_EXPR
3862 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3865 if (DECL_INITIAL (dp
->var
)
3866 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3867 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3868 DECL_INITIAL (dp
->var
));
3870 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3871 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3872 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3875 /* And replace all uses of the NRV with the RESULT_DECL. */
3876 else if (*tp
== dp
->var
)
3879 /* Avoid walking into the same tree more than once. Unfortunately, we
3880 can't just use walk_tree_without duplicates because it would only call
3881 us for the first occurrence of dp->var in the function body. */
3882 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3888 /* Keep iterating. */
3892 /* Called from finish_function to implement the named return value
3893 optimization by overriding all the RETURN_EXPRs and pertinent
3894 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3895 RESULT_DECL for the function. */
3898 finalize_nrv (tree
*tp
, tree var
, tree result
)
3900 struct nrv_data data
;
3902 /* Copy name from VAR to RESULT. */
3903 DECL_NAME (result
) = DECL_NAME (var
);
3904 /* Don't forget that we take its address. */
3905 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3906 /* Finally set DECL_VALUE_EXPR to avoid assigning
3907 a stack slot at -O0 for the original var and debug info
3908 uses RESULT location for VAR. */
3909 SET_DECL_VALUE_EXPR (var
, result
);
3910 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3913 data
.result
= result
;
3914 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3915 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3916 htab_delete (data
.visited
);
3919 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3922 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3923 bool need_copy_ctor
, bool need_copy_assignment
)
3925 int save_errorcount
= errorcount
;
3928 /* Always allocate 3 elements for simplicity. These are the
3929 function decls for the ctor, dtor, and assignment op.
3930 This layout is known to the three lang hooks,
3931 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3932 and cxx_omp_clause_assign_op. */
3933 info
= make_tree_vec (3);
3934 CP_OMP_CLAUSE_INFO (c
) = info
;
3936 if (need_default_ctor
|| need_copy_ctor
)
3938 if (need_default_ctor
)
3939 t
= get_default_ctor (type
);
3941 t
= get_copy_ctor (type
, tf_warning_or_error
);
3943 if (t
&& !trivial_fn_p (t
))
3944 TREE_VEC_ELT (info
, 0) = t
;
3947 if ((need_default_ctor
|| need_copy_ctor
)
3948 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3949 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
3951 if (need_copy_assignment
)
3953 t
= get_copy_assign (type
);
3955 if (t
&& !trivial_fn_p (t
))
3956 TREE_VEC_ELT (info
, 2) = t
;
3959 return errorcount
!= save_errorcount
;
3962 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3963 Remove any elements from the list that are invalid. */
3966 finish_omp_clauses (tree clauses
)
3968 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3969 tree c
, t
, *pc
= &clauses
;
3972 bitmap_obstack_initialize (NULL
);
3973 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3974 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3975 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3977 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3979 bool remove
= false;
3981 switch (OMP_CLAUSE_CODE (c
))
3983 case OMP_CLAUSE_SHARED
:
3985 goto check_dup_generic
;
3986 case OMP_CLAUSE_PRIVATE
:
3988 goto check_dup_generic
;
3989 case OMP_CLAUSE_REDUCTION
:
3991 goto check_dup_generic
;
3992 case OMP_CLAUSE_COPYPRIVATE
:
3993 name
= "copyprivate";
3994 goto check_dup_generic
;
3995 case OMP_CLAUSE_COPYIN
:
3997 goto check_dup_generic
;
3999 t
= OMP_CLAUSE_DECL (c
);
4000 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4002 if (processing_template_decl
)
4005 error ("%qD is not a variable in clause %qs", t
, name
);
4007 error ("%qE is not a variable in clause %qs", t
, name
);
4010 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4011 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
4012 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4014 error ("%qD appears more than once in data clauses", t
);
4018 bitmap_set_bit (&generic_head
, DECL_UID (t
));
4021 case OMP_CLAUSE_FIRSTPRIVATE
:
4022 t
= OMP_CLAUSE_DECL (c
);
4023 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4025 if (processing_template_decl
)
4028 error ("%qD is not a variable in clause %<firstprivate%>", t
);
4030 error ("%qE is not a variable in clause %<firstprivate%>", t
);
4033 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4034 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4036 error ("%qD appears more than once in data clauses", t
);
4040 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
4043 case OMP_CLAUSE_LASTPRIVATE
:
4044 t
= OMP_CLAUSE_DECL (c
);
4045 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4047 if (processing_template_decl
)
4050 error ("%qD is not a variable in clause %<lastprivate%>", t
);
4052 error ("%qE is not a variable in clause %<lastprivate%>", t
);
4055 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4056 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4058 error ("%qD appears more than once in data clauses", t
);
4062 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
4066 t
= OMP_CLAUSE_IF_EXPR (c
);
4067 t
= maybe_convert_cond (t
);
4068 if (t
== error_mark_node
)
4070 else if (!processing_template_decl
)
4071 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4072 OMP_CLAUSE_IF_EXPR (c
) = t
;
4075 case OMP_CLAUSE_FINAL
:
4076 t
= OMP_CLAUSE_FINAL_EXPR (c
);
4077 t
= maybe_convert_cond (t
);
4078 if (t
== error_mark_node
)
4080 else if (!processing_template_decl
)
4081 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4082 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
4085 case OMP_CLAUSE_NUM_THREADS
:
4086 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
4087 if (t
== error_mark_node
)
4089 else if (!type_dependent_expression_p (t
)
4090 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4092 error ("num_threads expression must be integral");
4097 t
= mark_rvalue_use (t
);
4098 if (!processing_template_decl
)
4099 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4100 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
4104 case OMP_CLAUSE_SCHEDULE
:
4105 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
4108 else if (t
== error_mark_node
)
4110 else if (!type_dependent_expression_p (t
)
4111 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4113 error ("schedule chunk size expression must be integral");
4118 t
= mark_rvalue_use (t
);
4119 if (!processing_template_decl
)
4120 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4121 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
4125 case OMP_CLAUSE_NOWAIT
:
4126 case OMP_CLAUSE_ORDERED
:
4127 case OMP_CLAUSE_DEFAULT
:
4128 case OMP_CLAUSE_UNTIED
:
4129 case OMP_CLAUSE_COLLAPSE
:
4130 case OMP_CLAUSE_MERGEABLE
:
4138 *pc
= OMP_CLAUSE_CHAIN (c
);
4140 pc
= &OMP_CLAUSE_CHAIN (c
);
4143 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
4145 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
4146 bool remove
= false;
4147 bool need_complete_non_reference
= false;
4148 bool need_default_ctor
= false;
4149 bool need_copy_ctor
= false;
4150 bool need_copy_assignment
= false;
4151 bool need_implicitly_determined
= false;
4152 tree type
, inner_type
;
4156 case OMP_CLAUSE_SHARED
:
4158 need_implicitly_determined
= true;
4160 case OMP_CLAUSE_PRIVATE
:
4162 need_complete_non_reference
= true;
4163 need_default_ctor
= true;
4164 need_implicitly_determined
= true;
4166 case OMP_CLAUSE_FIRSTPRIVATE
:
4167 name
= "firstprivate";
4168 need_complete_non_reference
= true;
4169 need_copy_ctor
= true;
4170 need_implicitly_determined
= true;
4172 case OMP_CLAUSE_LASTPRIVATE
:
4173 name
= "lastprivate";
4174 need_complete_non_reference
= true;
4175 need_copy_assignment
= true;
4176 need_implicitly_determined
= true;
4178 case OMP_CLAUSE_REDUCTION
:
4180 need_implicitly_determined
= true;
4182 case OMP_CLAUSE_COPYPRIVATE
:
4183 name
= "copyprivate";
4184 need_copy_assignment
= true;
4186 case OMP_CLAUSE_COPYIN
:
4188 need_copy_assignment
= true;
4191 pc
= &OMP_CLAUSE_CHAIN (c
);
4195 t
= OMP_CLAUSE_DECL (c
);
4196 if (processing_template_decl
4197 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4199 pc
= &OMP_CLAUSE_CHAIN (c
);
4205 case OMP_CLAUSE_LASTPRIVATE
:
4206 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4207 need_default_ctor
= true;
4210 case OMP_CLAUSE_REDUCTION
:
4211 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4212 || POINTER_TYPE_P (TREE_TYPE (t
)))
4214 error ("%qE has invalid type for %<reduction%>", t
);
4217 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
4219 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
4229 error ("%qE has invalid type for %<reduction(%s)%>",
4230 t
, operator_name_info
[r_code
].name
);
4236 case OMP_CLAUSE_COPYIN
:
4237 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
4239 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
4248 if (need_complete_non_reference
|| need_copy_assignment
)
4250 t
= require_complete_type (t
);
4251 if (t
== error_mark_node
)
4253 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4254 && need_complete_non_reference
)
4256 error ("%qE has reference type for %qs", t
, name
);
4260 if (need_implicitly_determined
)
4262 const char *share_name
= NULL
;
4264 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4265 share_name
= "threadprivate";
4266 else switch (cxx_omp_predetermined_sharing (t
))
4268 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
4270 case OMP_CLAUSE_DEFAULT_SHARED
:
4271 /* const vars may be specified in firstprivate clause. */
4272 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
4273 && cxx_omp_const_qual_no_mutable (t
))
4275 share_name
= "shared";
4277 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4278 share_name
= "private";
4285 error ("%qE is predetermined %qs for %qs",
4286 t
, share_name
, name
);
4291 /* We're interested in the base element, not arrays. */
4292 inner_type
= type
= TREE_TYPE (t
);
4293 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
4294 inner_type
= TREE_TYPE (inner_type
);
4296 /* Check for special function availability by building a call to one.
4297 Save the results, because later we won't be in the right context
4298 for making these queries. */
4299 if (CLASS_TYPE_P (inner_type
)
4300 && COMPLETE_TYPE_P (inner_type
)
4301 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
4302 && !type_dependent_expression_p (t
)
4303 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
4304 need_copy_ctor
, need_copy_assignment
))
4308 *pc
= OMP_CLAUSE_CHAIN (c
);
4310 pc
= &OMP_CLAUSE_CHAIN (c
);
4313 bitmap_obstack_release (NULL
);
4317 /* For all variables in the tree_list VARS, mark them as thread local. */
4320 finish_omp_threadprivate (tree vars
)
4324 /* Mark every variable in VARS to be assigned thread local storage. */
4325 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4327 tree v
= TREE_PURPOSE (t
);
4329 if (error_operand_p (v
))
4331 else if (TREE_CODE (v
) != VAR_DECL
)
4332 error ("%<threadprivate%> %qD is not file, namespace "
4333 "or block scope variable", v
);
4334 /* If V had already been marked threadprivate, it doesn't matter
4335 whether it had been used prior to this point. */
4336 else if (TREE_USED (v
)
4337 && (DECL_LANG_SPECIFIC (v
) == NULL
4338 || !CP_DECL_THREADPRIVATE_P (v
)))
4339 error ("%qE declared %<threadprivate%> after first use", v
);
4340 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4341 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4342 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4343 error ("%<threadprivate%> %qE has incomplete type", v
);
4344 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4345 && CP_DECL_CONTEXT (v
) != current_class_type
)
4346 error ("%<threadprivate%> %qE directive not "
4347 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4350 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4351 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4353 retrofit_lang_decl (v
);
4355 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4356 after the allocation of the lang_decl structure. */
4357 if (DECL_DISCRIMINATOR_P (v
))
4358 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4361 if (! DECL_THREAD_LOCAL_P (v
))
4363 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4364 /* If rtl has been already set for this var, call
4365 make_decl_rtl once again, so that encode_section_info
4366 has a chance to look at the new decl flags. */
4367 if (DECL_RTL_SET_P (v
))
4370 CP_DECL_THREADPRIVATE_P (v
) = 1;
4375 /* Build an OpenMP structured block. */
4378 begin_omp_structured_block (void)
4380 return do_pushlevel (sk_omp
);
4384 finish_omp_structured_block (tree block
)
4386 return do_poplevel (block
);
4389 /* Similarly, except force the retention of the BLOCK. */
4392 begin_omp_parallel (void)
4394 keep_next_level (true);
4395 return begin_omp_structured_block ();
4399 finish_omp_parallel (tree clauses
, tree body
)
4403 body
= finish_omp_structured_block (body
);
4405 stmt
= make_node (OMP_PARALLEL
);
4406 TREE_TYPE (stmt
) = void_type_node
;
4407 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4408 OMP_PARALLEL_BODY (stmt
) = body
;
4410 return add_stmt (stmt
);
4414 begin_omp_task (void)
4416 keep_next_level (true);
4417 return begin_omp_structured_block ();
4421 finish_omp_task (tree clauses
, tree body
)
4425 body
= finish_omp_structured_block (body
);
4427 stmt
= make_node (OMP_TASK
);
4428 TREE_TYPE (stmt
) = void_type_node
;
4429 OMP_TASK_CLAUSES (stmt
) = clauses
;
4430 OMP_TASK_BODY (stmt
) = body
;
4432 return add_stmt (stmt
);
4435 /* Helper function for finish_omp_for. Convert Ith random access iterator
4436 into integral iterator. Return FALSE if successful. */
4439 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4440 tree condv
, tree incrv
, tree
*body
,
4441 tree
*pre_body
, tree clauses
)
4443 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4444 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4445 tree decl
= TREE_VEC_ELT (declv
, i
);
4446 tree init
= TREE_VEC_ELT (initv
, i
);
4447 tree cond
= TREE_VEC_ELT (condv
, i
);
4448 tree incr
= TREE_VEC_ELT (incrv
, i
);
4450 location_t elocus
= locus
;
4452 if (init
&& EXPR_HAS_LOCATION (init
))
4453 elocus
= EXPR_LOCATION (init
);
4455 switch (TREE_CODE (cond
))
4461 if (TREE_OPERAND (cond
, 1) == iter
)
4462 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4463 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4464 if (TREE_OPERAND (cond
, 0) != iter
)
4465 cond
= error_mark_node
;
4468 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4469 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4470 NULL
, tf_warning_or_error
);
4471 if (error_operand_p (tem
))
4476 cond
= error_mark_node
;
4479 if (cond
== error_mark_node
)
4481 error_at (elocus
, "invalid controlling predicate");
4484 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4485 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4486 tf_warning_or_error
);
4487 if (error_operand_p (diff
))
4489 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4491 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4492 TREE_OPERAND (cond
, 1), iter
);
4496 switch (TREE_CODE (incr
))
4498 case PREINCREMENT_EXPR
:
4499 case PREDECREMENT_EXPR
:
4500 case POSTINCREMENT_EXPR
:
4501 case POSTDECREMENT_EXPR
:
4502 if (TREE_OPERAND (incr
, 0) != iter
)
4504 incr
= error_mark_node
;
4507 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4508 tf_warning_or_error
);
4509 if (error_operand_p (iter_incr
))
4511 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4512 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4513 incr
= integer_one_node
;
4515 incr
= integer_minus_one_node
;
4518 if (TREE_OPERAND (incr
, 0) != iter
)
4519 incr
= error_mark_node
;
4520 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4521 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4523 tree rhs
= TREE_OPERAND (incr
, 1);
4524 if (TREE_OPERAND (rhs
, 0) == iter
)
4526 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4528 incr
= error_mark_node
;
4531 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4532 TREE_OPERAND (rhs
, 1),
4533 tf_warning_or_error
);
4534 if (error_operand_p (iter_incr
))
4536 incr
= TREE_OPERAND (rhs
, 1);
4537 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4538 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4540 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4541 incr
= fold_if_not_in_template (incr
);
4543 if (TREE_CODE (incr
) != INTEGER_CST
4544 && (TREE_CODE (incr
) != NOP_EXPR
4545 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4550 else if (TREE_OPERAND (rhs
, 1) == iter
)
4552 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4553 || TREE_CODE (rhs
) != PLUS_EXPR
)
4554 incr
= error_mark_node
;
4557 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4558 TREE_OPERAND (rhs
, 0),
4561 tf_warning_or_error
);
4562 if (error_operand_p (iter_incr
))
4564 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4566 tf_warning_or_error
);
4567 if (error_operand_p (iter_incr
))
4569 incr
= TREE_OPERAND (rhs
, 0);
4574 incr
= error_mark_node
;
4577 incr
= error_mark_node
;
4580 incr
= error_mark_node
;
4584 if (incr
== error_mark_node
)
4586 error_at (elocus
, "invalid increment expression");
4590 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4591 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4592 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4593 && OMP_CLAUSE_DECL (c
) == iter
)
4596 decl
= create_temporary_var (TREE_TYPE (diff
));
4598 add_decl_expr (decl
);
4599 last
= create_temporary_var (TREE_TYPE (diff
));
4601 add_decl_expr (last
);
4602 if (c
&& iter_incr
== NULL
)
4604 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4605 pushdecl (incr_var
);
4606 add_decl_expr (incr_var
);
4608 gcc_assert (stmts_are_full_exprs_p ());
4610 orig_pre_body
= *pre_body
;
4611 *pre_body
= push_stmt_list ();
4613 add_stmt (orig_pre_body
);
4615 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4616 tf_warning_or_error
));
4617 init
= build_int_cst (TREE_TYPE (diff
), 0);
4618 if (c
&& iter_incr
== NULL
)
4620 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4621 incr
, tf_warning_or_error
));
4623 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4624 tf_warning_or_error
);
4626 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4627 tf_warning_or_error
));
4628 *pre_body
= pop_stmt_list (*pre_body
);
4630 cond
= cp_build_binary_op (elocus
,
4631 TREE_CODE (cond
), decl
, diff
,
4632 tf_warning_or_error
);
4633 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4634 elocus
, incr
, NULL_TREE
);
4637 *body
= push_stmt_list ();
4638 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4639 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4640 tf_warning_or_error
);
4641 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4642 finish_expr_stmt (iter_init
);
4643 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4644 tf_warning_or_error
));
4645 add_stmt (orig_body
);
4646 *body
= pop_stmt_list (*body
);
4650 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4651 finish_expr_stmt (iter_incr
);
4652 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4653 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4656 TREE_VEC_ELT (declv
, i
) = decl
;
4657 TREE_VEC_ELT (initv
, i
) = init
;
4658 TREE_VEC_ELT (condv
, i
) = cond
;
4659 TREE_VEC_ELT (incrv
, i
) = incr
;
4664 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4665 are directly for their associated operands in the statement. DECL
4666 and INIT are a combo; if DECL is NULL then INIT ought to be a
4667 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4668 optional statements that need to go before the loop into its
4672 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4673 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4675 tree omp_for
= NULL
, orig_incr
= NULL
;
4676 tree decl
, init
, cond
, incr
;
4680 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4681 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4682 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4683 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4685 decl
= TREE_VEC_ELT (declv
, i
);
4686 init
= TREE_VEC_ELT (initv
, i
);
4687 cond
= TREE_VEC_ELT (condv
, i
);
4688 incr
= TREE_VEC_ELT (incrv
, i
);
4694 switch (TREE_CODE (init
))
4697 decl
= TREE_OPERAND (init
, 0);
4698 init
= TREE_OPERAND (init
, 1);
4701 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4703 decl
= TREE_OPERAND (init
, 0);
4704 init
= TREE_OPERAND (init
, 2);
4714 "expected iteration declaration or initialization");
4719 if (init
&& EXPR_HAS_LOCATION (init
))
4720 elocus
= EXPR_LOCATION (init
);
4724 error_at (elocus
, "missing controlling predicate");
4730 error_at (elocus
, "missing increment expression");
4734 TREE_VEC_ELT (declv
, i
) = decl
;
4735 TREE_VEC_ELT (initv
, i
) = init
;
4738 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4742 stmt
= make_node (OMP_FOR
);
4744 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4746 /* This is really just a place-holder. We'll be decomposing this
4747 again and going through the cp_build_modify_expr path below when
4748 we instantiate the thing. */
4749 TREE_VEC_ELT (initv
, i
)
4750 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4751 TREE_VEC_ELT (initv
, i
));
4754 TREE_TYPE (stmt
) = void_type_node
;
4755 OMP_FOR_INIT (stmt
) = initv
;
4756 OMP_FOR_COND (stmt
) = condv
;
4757 OMP_FOR_INCR (stmt
) = incrv
;
4758 OMP_FOR_BODY (stmt
) = body
;
4759 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4760 OMP_FOR_CLAUSES (stmt
) = clauses
;
4762 SET_EXPR_LOCATION (stmt
, locus
);
4763 return add_stmt (stmt
);
4766 if (processing_template_decl
)
4767 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4769 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4771 decl
= TREE_VEC_ELT (declv
, i
);
4772 init
= TREE_VEC_ELT (initv
, i
);
4773 cond
= TREE_VEC_ELT (condv
, i
);
4774 incr
= TREE_VEC_ELT (incrv
, i
);
4776 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4779 if (init
&& EXPR_HAS_LOCATION (init
))
4780 elocus
= EXPR_LOCATION (init
);
4784 error_at (elocus
, "expected iteration declaration or initialization");
4788 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4791 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4792 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4793 TREE_CODE (TREE_OPERAND (incr
, 1)),
4794 TREE_OPERAND (incr
, 2),
4795 tf_warning_or_error
);
4798 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4800 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4801 incrv
, &body
, &pre_body
, clauses
))
4806 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4807 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4809 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4813 if (!processing_template_decl
)
4815 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4816 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4819 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4821 && TREE_SIDE_EFFECTS (cond
)
4822 && COMPARISON_CLASS_P (cond
)
4823 && !processing_template_decl
)
4825 tree t
= TREE_OPERAND (cond
, 0);
4826 if (TREE_SIDE_EFFECTS (t
)
4828 && (TREE_CODE (t
) != NOP_EXPR
4829 || TREE_OPERAND (t
, 0) != decl
))
4830 TREE_OPERAND (cond
, 0)
4831 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4833 t
= TREE_OPERAND (cond
, 1);
4834 if (TREE_SIDE_EFFECTS (t
)
4836 && (TREE_CODE (t
) != NOP_EXPR
4837 || TREE_OPERAND (t
, 0) != decl
))
4838 TREE_OPERAND (cond
, 1)
4839 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4841 if (decl
== error_mark_node
|| init
== error_mark_node
)
4844 TREE_VEC_ELT (declv
, i
) = decl
;
4845 TREE_VEC_ELT (initv
, i
) = init
;
4846 TREE_VEC_ELT (condv
, i
) = cond
;
4847 TREE_VEC_ELT (incrv
, i
) = incr
;
4851 if (IS_EMPTY_STMT (pre_body
))
4854 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4857 if (omp_for
== NULL
)
4860 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4862 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4863 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4865 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4868 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4869 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4870 && !processing_template_decl
)
4872 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4873 if (TREE_SIDE_EFFECTS (t
)
4875 && (TREE_CODE (t
) != NOP_EXPR
4876 || TREE_OPERAND (t
, 0) != decl
))
4877 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4878 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4880 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4881 if (TREE_SIDE_EFFECTS (t
)
4883 && (TREE_CODE (t
) != NOP_EXPR
4884 || TREE_OPERAND (t
, 0) != decl
))
4885 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4886 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4890 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4892 if (omp_for
!= NULL
)
4893 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4898 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
4899 tree rhs
, tree v
, tree lhs1
, tree rhs1
)
4914 dependent_p
= false;
4917 /* Even in a template, we can detect invalid uses of the atomic
4918 pragma if neither LHS nor RHS is type-dependent. */
4919 if (processing_template_decl
)
4921 dependent_p
= (type_dependent_expression_p (lhs
)
4922 || (rhs
&& type_dependent_expression_p (rhs
))
4923 || (v
&& type_dependent_expression_p (v
))
4924 || (lhs1
&& type_dependent_expression_p (lhs1
))
4925 || (rhs1
&& type_dependent_expression_p (rhs1
)));
4928 lhs
= build_non_dependent_expr (lhs
);
4930 rhs
= build_non_dependent_expr (rhs
);
4932 v
= build_non_dependent_expr (v
);
4934 lhs1
= build_non_dependent_expr (lhs1
);
4936 rhs1
= build_non_dependent_expr (rhs1
);
4941 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
4943 if (stmt
== error_mark_node
)
4946 if (processing_template_decl
)
4948 if (code
== OMP_ATOMIC_READ
)
4950 stmt
= build_min_nt (OMP_ATOMIC_READ
, orig_lhs
);
4951 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
4955 if (opcode
== NOP_EXPR
)
4956 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
4958 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
4960 stmt
= build_min_nt (COMPOUND_EXPR
, orig_rhs1
, stmt
);
4961 if (code
!= OMP_ATOMIC
)
4963 stmt
= build_min_nt (code
, orig_lhs1
, stmt
);
4964 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
4967 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
4973 finish_omp_barrier (void)
4975 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
4976 VEC(tree
,gc
) *vec
= make_tree_vector ();
4977 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4978 release_tree_vector (vec
);
4979 finish_expr_stmt (stmt
);
4983 finish_omp_flush (void)
4985 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
4986 VEC(tree
,gc
) *vec
= make_tree_vector ();
4987 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4988 release_tree_vector (vec
);
4989 finish_expr_stmt (stmt
);
4993 finish_omp_taskwait (void)
4995 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
4996 VEC(tree
,gc
) *vec
= make_tree_vector ();
4997 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4998 release_tree_vector (vec
);
4999 finish_expr_stmt (stmt
);
5003 finish_omp_taskyield (void)
5005 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
5006 VEC(tree
,gc
) *vec
= make_tree_vector ();
5007 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5008 release_tree_vector (vec
);
5009 finish_expr_stmt (stmt
);
5012 /* Begin a __transaction_atomic or __transaction_relaxed statement.
5013 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
5014 should create an extra compound stmt. */
5017 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
5022 *pcompound
= begin_compound_stmt (0);
5024 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
5026 /* Only add the statement to the function if support enabled. */
5030 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
5031 ? G_("%<__transaction_relaxed%> without "
5032 "transactional memory support enabled")
5033 : G_("%<__transaction_atomic%> without "
5034 "transactional memory support enabled")));
5036 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
5040 /* End a __transaction_atomic or __transaction_relaxed statement.
5041 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
5042 and we should end the compound. If NOEX is non-NULL, we wrap the body in
5043 a MUST_NOT_THROW_EXPR with NOEX as condition. */
5046 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
5048 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
5049 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
5050 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
5051 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
5053 /* noexcept specifications are not allowed for function transactions. */
5054 gcc_assert (!(noex
&& compound_stmt
));
5057 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
5059 SET_EXPR_LOCATION (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
5060 TREE_SIDE_EFFECTS (body
) = 1;
5061 TRANSACTION_EXPR_BODY (stmt
) = body
;
5065 finish_compound_stmt (compound_stmt
);
5069 /* Build a __transaction_atomic or __transaction_relaxed expression. If
5070 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
5074 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
5079 expr
= build_must_not_throw_expr (expr
, noex
);
5080 SET_EXPR_LOCATION (expr
, loc
);
5081 TREE_SIDE_EFFECTS (expr
) = 1;
5083 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
5084 if (flags
& TM_STMT_ATTR_RELAXED
)
5085 TRANSACTION_EXPR_RELAXED (ret
) = 1;
5086 SET_EXPR_LOCATION (ret
, loc
);
5091 init_cp_semantics (void)
5095 /* Build a STATIC_ASSERT for a static assertion with the condition
5096 CONDITION and the message text MESSAGE. LOCATION is the location
5097 of the static assertion in the source code. When MEMBER_P, this
5098 static assertion is a member of a class. */
5100 finish_static_assert (tree condition
, tree message
, location_t location
,
5103 if (check_for_bare_parameter_packs (condition
))
5104 condition
= error_mark_node
;
5106 if (type_dependent_expression_p (condition
)
5107 || value_dependent_expression_p (condition
))
5109 /* We're in a template; build a STATIC_ASSERT and put it in
5113 assertion
= make_node (STATIC_ASSERT
);
5114 STATIC_ASSERT_CONDITION (assertion
) = condition
;
5115 STATIC_ASSERT_MESSAGE (assertion
) = message
;
5116 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
5119 maybe_add_class_template_decl_list (current_class_type
,
5123 add_stmt (assertion
);
5128 /* Fold the expression and convert it to a boolean value. */
5129 condition
= fold_non_dependent_expr (condition
);
5130 condition
= cp_convert (boolean_type_node
, condition
);
5131 condition
= maybe_constant_value (condition
);
5133 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
5134 /* Do nothing; the condition is satisfied. */
5138 location_t saved_loc
= input_location
;
5140 input_location
= location
;
5141 if (TREE_CODE (condition
) == INTEGER_CST
5142 && integer_zerop (condition
))
5143 /* Report the error. */
5144 error ("static assertion failed: %s", TREE_STRING_POINTER (message
));
5145 else if (condition
&& condition
!= error_mark_node
)
5147 error ("non-constant condition for static assertion");
5148 cxx_constant_value (condition
);
5150 input_location
= saved_loc
;
5154 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5155 suitable for use as a type-specifier.
5157 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5158 id-expression or a class member access, FALSE when it was parsed as
5159 a full expression. */
5162 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
5163 tsubst_flags_t complain
)
5165 tree type
= NULL_TREE
;
5167 if (!expr
|| error_operand_p (expr
))
5168 return error_mark_node
;
5171 || TREE_CODE (expr
) == TYPE_DECL
5172 || (TREE_CODE (expr
) == BIT_NOT_EXPR
5173 && TYPE_P (TREE_OPERAND (expr
, 0))))
5175 if (complain
& tf_error
)
5176 error ("argument to decltype must be an expression");
5177 return error_mark_node
;
5180 /* FIXME instantiation-dependent */
5181 if (type_dependent_expression_p (expr
)
5182 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
5183 if it isn't dependent, so that we can check access control at
5184 instantiation time, so defer the decltype as well (PR 42277). */
5185 || (id_expression_or_member_access_p
5186 && processing_template_decl
5187 && TREE_CODE (expr
) == COMPONENT_REF
))
5189 type
= cxx_make_type (DECLTYPE_TYPE
);
5190 DECLTYPE_TYPE_EXPR (type
) = expr
;
5191 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
5192 = id_expression_or_member_access_p
;
5193 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5198 /* The type denoted by decltype(e) is defined as follows: */
5200 expr
= resolve_nondeduced_context (expr
);
5202 if (type_unknown_p (expr
))
5204 if (complain
& tf_error
)
5205 error ("decltype cannot resolve address of overloaded function");
5206 return error_mark_node
;
5209 if (invalid_nonstatic_memfn_p (expr
, complain
))
5210 return error_mark_node
;
5212 /* To get the size of a static data member declared as an array of
5213 unknown bound, we need to instantiate it. */
5214 if (TREE_CODE (expr
) == VAR_DECL
5215 && VAR_HAD_UNKNOWN_BOUND (expr
)
5216 && DECL_TEMPLATE_INSTANTIATION (expr
))
5217 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
5219 if (id_expression_or_member_access_p
)
5221 /* If e is an id-expression or a class member access (5.2.5
5222 [expr.ref]), decltype(e) is defined as the type of the entity
5223 named by e. If there is no such entity, or e names a set of
5224 overloaded functions, the program is ill-formed. */
5225 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
5226 expr
= lookup_name (expr
);
5228 if (TREE_CODE (expr
) == INDIRECT_REF
)
5229 /* This can happen when the expression is, e.g., "a.b". Just
5230 look at the underlying operand. */
5231 expr
= TREE_OPERAND (expr
, 0);
5233 if (TREE_CODE (expr
) == OFFSET_REF
5234 || TREE_CODE (expr
) == MEMBER_REF
)
5235 /* We're only interested in the field itself. If it is a
5236 BASELINK, we will need to see through it in the next
5238 expr
= TREE_OPERAND (expr
, 1);
5240 if (BASELINK_P (expr
))
5241 /* See through BASELINK nodes to the underlying function. */
5242 expr
= BASELINK_FUNCTIONS (expr
);
5244 switch (TREE_CODE (expr
))
5247 if (DECL_BIT_FIELD_TYPE (expr
))
5249 type
= DECL_BIT_FIELD_TYPE (expr
);
5252 /* Fall through for fields that aren't bitfields. */
5259 case TEMPLATE_PARM_INDEX
:
5260 expr
= mark_type_use (expr
);
5261 type
= TREE_TYPE (expr
);
5265 type
= error_mark_node
;
5269 mark_type_use (expr
);
5270 type
= is_bitfield_expr_with_lowered_type (expr
);
5272 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
5280 /* We can get here when the id-expression refers to an
5281 enumerator or non-type template parameter. */
5282 type
= TREE_TYPE (expr
);
5287 return error_mark_node
;
5292 /* Within a lambda-expression:
5294 Every occurrence of decltype((x)) where x is a possibly
5295 parenthesized id-expression that names an entity of
5296 automatic storage duration is treated as if x were
5297 transformed into an access to a corresponding data member
5298 of the closure type that would have been declared if x
5299 were a use of the denoted entity. */
5300 if (outer_automatic_var_p (expr
)
5301 && current_function_decl
5302 && LAMBDA_FUNCTION_P (current_function_decl
))
5303 type
= capture_decltype (expr
);
5304 else if (error_operand_p (expr
))
5305 type
= error_mark_node
;
5306 else if (expr
== current_class_ptr
)
5307 /* If the expression is just "this", we want the
5308 cv-unqualified pointer for the "this" type. */
5309 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
5312 /* Otherwise, where T is the type of e, if e is an lvalue,
5313 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5314 cp_lvalue_kind clk
= lvalue_kind (expr
);
5315 type
= unlowered_expr_type (expr
);
5316 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
5317 if (clk
!= clk_none
&& !(clk
& clk_class
))
5318 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
5325 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5326 __has_nothrow_copy, depending on assign_p. */
5329 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5336 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5339 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5341 else if (TYPE_HAS_COPY_CTOR (type
))
5343 /* If construction of the copy constructor was postponed, create
5345 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5346 lazily_declare_fn (sfk_copy_constructor
, type
);
5347 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5348 lazily_declare_fn (sfk_move_constructor
, type
);
5349 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5354 for (; fns
; fns
= OVL_NEXT (fns
))
5356 tree fn
= OVL_CURRENT (fns
);
5360 if (copy_fn_p (fn
) == 0)
5363 else if (copy_fn_p (fn
) <= 0)
5366 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5373 /* Actually evaluates the trait. */
5376 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5378 enum tree_code type_code1
;
5381 type_code1
= TREE_CODE (type1
);
5385 case CPTK_HAS_NOTHROW_ASSIGN
:
5386 type1
= strip_array_types (type1
);
5387 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5388 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5389 || (CLASS_TYPE_P (type1
)
5390 && classtype_has_nothrow_assign_or_copy_p (type1
,
5393 case CPTK_HAS_TRIVIAL_ASSIGN
:
5394 /* ??? The standard seems to be missing the "or array of such a class
5395 type" wording for this trait. */
5396 type1
= strip_array_types (type1
);
5397 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5398 && (trivial_type_p (type1
)
5399 || (CLASS_TYPE_P (type1
)
5400 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5402 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5403 type1
= strip_array_types (type1
);
5404 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5405 || (CLASS_TYPE_P (type1
)
5406 && (t
= locate_ctor (type1
))
5407 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5409 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5410 type1
= strip_array_types (type1
);
5411 return (trivial_type_p (type1
)
5412 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5414 case CPTK_HAS_NOTHROW_COPY
:
5415 type1
= strip_array_types (type1
);
5416 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5417 || (CLASS_TYPE_P (type1
)
5418 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5420 case CPTK_HAS_TRIVIAL_COPY
:
5421 /* ??? The standard seems to be missing the "or array of such a class
5422 type" wording for this trait. */
5423 type1
= strip_array_types (type1
);
5424 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5425 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5427 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5428 type1
= strip_array_types (type1
);
5429 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5430 || (CLASS_TYPE_P (type1
)
5431 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5433 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5434 return type_has_virtual_destructor (type1
);
5436 case CPTK_IS_ABSTRACT
:
5437 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5439 case CPTK_IS_BASE_OF
:
5440 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5441 && DERIVED_FROM_P (type1
, type2
));
5444 return (NON_UNION_CLASS_TYPE_P (type1
));
5446 case CPTK_IS_CONVERTIBLE_TO
:
5451 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5454 return (type_code1
== ENUMERAL_TYPE
);
5457 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
5459 case CPTK_IS_LITERAL_TYPE
:
5460 return (literal_type_p (type1
));
5463 return (pod_type_p (type1
));
5465 case CPTK_IS_POLYMORPHIC
:
5466 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5468 case CPTK_IS_STD_LAYOUT
:
5469 return (std_layout_type_p (type1
));
5471 case CPTK_IS_TRIVIAL
:
5472 return (trivial_type_p (type1
));
5475 return (type_code1
== UNION_TYPE
);
5483 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5484 void, or a complete type, returns it, otherwise NULL_TREE. */
5487 check_trait_type (tree type
)
5489 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5490 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5493 if (VOID_TYPE_P (type
))
5496 return complete_type_or_else (strip_array_types (type
), NULL_TREE
);
5499 /* Process a trait expression. */
5502 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5504 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5505 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5506 || kind
== CPTK_HAS_NOTHROW_COPY
5507 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5508 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5509 || kind
== CPTK_HAS_TRIVIAL_COPY
5510 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5511 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5512 || kind
== CPTK_IS_ABSTRACT
5513 || kind
== CPTK_IS_BASE_OF
5514 || kind
== CPTK_IS_CLASS
5515 || kind
== CPTK_IS_CONVERTIBLE_TO
5516 || kind
== CPTK_IS_EMPTY
5517 || kind
== CPTK_IS_ENUM
5518 || kind
== CPTK_IS_FINAL
5519 || kind
== CPTK_IS_LITERAL_TYPE
5520 || kind
== CPTK_IS_POD
5521 || kind
== CPTK_IS_POLYMORPHIC
5522 || kind
== CPTK_IS_STD_LAYOUT
5523 || kind
== CPTK_IS_TRIVIAL
5524 || kind
== CPTK_IS_UNION
);
5526 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5528 sorry ("__is_convertible_to");
5529 return error_mark_node
;
5532 if (type1
== error_mark_node
5533 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5534 && type2
== error_mark_node
))
5535 return error_mark_node
;
5537 if (processing_template_decl
)
5539 tree trait_expr
= make_node (TRAIT_EXPR
);
5540 TREE_TYPE (trait_expr
) = boolean_type_node
;
5541 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5542 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5543 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5549 case CPTK_HAS_NOTHROW_ASSIGN
:
5550 case CPTK_HAS_TRIVIAL_ASSIGN
:
5551 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5552 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5553 case CPTK_HAS_NOTHROW_COPY
:
5554 case CPTK_HAS_TRIVIAL_COPY
:
5555 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5556 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5557 case CPTK_IS_ABSTRACT
:
5560 case CPTK_IS_LITERAL_TYPE
:
5562 case CPTK_IS_POLYMORPHIC
:
5563 case CPTK_IS_STD_LAYOUT
:
5564 case CPTK_IS_TRIVIAL
:
5565 if (!check_trait_type (type1
))
5566 return error_mark_node
;
5569 case CPTK_IS_BASE_OF
:
5570 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5571 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5572 && !complete_type_or_else (type2
, NULL_TREE
))
5573 /* We already issued an error. */
5574 return error_mark_node
;
5582 case CPTK_IS_CONVERTIBLE_TO
:
5587 return (trait_expr_value (kind
, type1
, type2
)
5588 ? boolean_true_node
: boolean_false_node
);
5591 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5592 which is ignored for C++. */
5595 set_float_const_decimal64 (void)
5600 clear_float_const_decimal64 (void)
5605 float_const_decimal64_p (void)
5611 /* Return true if T is a literal type. */
5614 literal_type_p (tree t
)
5616 if (SCALAR_TYPE_P (t
)
5617 || TREE_CODE (t
) == REFERENCE_TYPE
)
5619 if (CLASS_TYPE_P (t
))
5621 t
= complete_type (t
);
5622 gcc_assert (COMPLETE_TYPE_P (t
) || errorcount
);
5623 return CLASSTYPE_LITERAL_P (t
);
5625 if (TREE_CODE (t
) == ARRAY_TYPE
)
5626 return literal_type_p (strip_array_types (t
));
5630 /* If DECL is a variable declared `constexpr', require its type
5631 be literal. Return the DECL if OK, otherwise NULL. */
5634 ensure_literal_type_for_constexpr_object (tree decl
)
5636 tree type
= TREE_TYPE (decl
);
5637 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5638 && !processing_template_decl
)
5640 if (CLASS_TYPE_P (type
) && !COMPLETE_TYPE_P (complete_type (type
)))
5641 /* Don't complain here, we'll complain about incompleteness
5642 when we try to initialize the variable. */;
5643 else if (!literal_type_p (type
))
5645 error ("the type %qT of constexpr variable %qD is not literal",
5647 explain_non_literal_class (type
);
5654 /* Representation of entries in the constexpr function definition table. */
5656 typedef struct GTY(()) constexpr_fundef
{
5661 /* This table holds all constexpr function definitions seen in
5662 the current translation unit. */
5664 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5666 /* Utility function used for managing the constexpr function table.
5667 Return true if the entries pointed to by P and Q are for the
5668 same constexpr function. */
5671 constexpr_fundef_equal (const void *p
, const void *q
)
5673 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5674 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5675 return lhs
->decl
== rhs
->decl
;
5678 /* Utility function used for managing the constexpr function table.
5679 Return a hash value for the entry pointed to by Q. */
5681 static inline hashval_t
5682 constexpr_fundef_hash (const void *p
)
5684 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5685 return DECL_UID (fundef
->decl
);
5688 /* Return a previously saved definition of function FUN. */
5690 static constexpr_fundef
*
5691 retrieve_constexpr_fundef (tree fun
)
5693 constexpr_fundef fundef
= { NULL
, NULL
};
5694 if (constexpr_fundef_table
== NULL
)
5698 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5701 /* Check whether the parameter and return types of FUN are valid for a
5702 constexpr function, and complain if COMPLAIN. */
5705 is_valid_constexpr_fn (tree fun
, bool complain
)
5707 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5709 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5710 if (!literal_type_p (TREE_TYPE (parm
)))
5715 error ("invalid type for parameter %d of constexpr "
5716 "function %q+#D", DECL_PARM_INDEX (parm
), fun
);
5717 explain_non_literal_class (TREE_TYPE (parm
));
5721 if (!DECL_CONSTRUCTOR_P (fun
))
5723 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5724 if (!literal_type_p (rettype
))
5729 error ("invalid return type %qT of constexpr function %q+D",
5731 explain_non_literal_class (rettype
);
5735 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5736 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun
)))
5741 error ("enclosing class of constexpr non-static member "
5742 "function %q+#D is not a literal type", fun
);
5743 explain_non_literal_class (DECL_CONTEXT (fun
));
5747 else if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fun
)))
5751 error ("%q#T has virtual base classes", DECL_CONTEXT (fun
));
5757 /* Subroutine of build_constexpr_constructor_member_initializers.
5758 The expression tree T represents a data member initialization
5759 in a (constexpr) constructor definition. Build a pairing of
5760 the data member with its initializer, and prepend that pair
5761 to the existing initialization pair INITS. */
5764 build_data_member_initialization (tree t
, VEC(constructor_elt
,gc
) **vec
)
5767 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5768 t
= TREE_OPERAND (t
, 0);
5769 if (TREE_CODE (t
) == EXPR_STMT
)
5770 t
= TREE_OPERAND (t
, 0);
5771 if (t
== error_mark_node
)
5773 if (TREE_CODE (t
) == STATEMENT_LIST
)
5775 tree_stmt_iterator i
;
5776 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5778 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5783 if (TREE_CODE (t
) == CLEANUP_STMT
)
5785 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5786 but we can in a constexpr constructor for a non-literal class. Just
5787 ignore it; either all the initialization will be constant, in which
5788 case the cleanup can't run, or it can't be constexpr.
5789 Still recurse into CLEANUP_BODY. */
5790 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5792 if (TREE_CODE (t
) == CONVERT_EXPR
)
5793 t
= TREE_OPERAND (t
, 0);
5794 if (TREE_CODE (t
) == INIT_EXPR
5795 || TREE_CODE (t
) == MODIFY_EXPR
)
5797 member
= TREE_OPERAND (t
, 0);
5798 init
= unshare_expr (TREE_OPERAND (t
, 1));
5802 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
5803 member
= CALL_EXPR_ARG (t
, 0);
5804 /* We don't use build_cplus_new here because it complains about
5805 abstract bases. Leaving the call unwrapped means that it has the
5806 wrong type, but cxx_eval_constant_expression doesn't care. */
5807 init
= unshare_expr (t
);
5809 if (TREE_CODE (member
) == INDIRECT_REF
)
5810 member
= TREE_OPERAND (member
, 0);
5811 if (TREE_CODE (member
) == NOP_EXPR
)
5815 if (TREE_CODE (op
) == ADDR_EXPR
)
5817 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5818 (TREE_TYPE (TREE_TYPE (op
)),
5819 TREE_TYPE (TREE_TYPE (member
))));
5820 /* Initializing a cv-qualified member; we need to look through
5824 else if (op
== current_class_ptr
5825 && (same_type_ignoring_top_level_qualifiers_p
5826 (TREE_TYPE (TREE_TYPE (member
)),
5827 current_class_type
)))
5828 /* Delegating constructor. */
5832 /* We don't put out anything for an empty base. */
5833 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
5834 /* But if the initializer isn't constexpr, leave it in so we
5836 if (potential_constant_expression (init
))
5840 if (TREE_CODE (member
) == ADDR_EXPR
)
5841 member
= TREE_OPERAND (member
, 0);
5842 if (TREE_CODE (member
) == COMPONENT_REF
5843 /* If we're initializing a member of a subaggregate, it's a vtable
5844 pointer. Leave it as COMPONENT_REF so we remember the path to get
5846 && TREE_CODE (TREE_OPERAND (member
, 0)) != COMPONENT_REF
)
5847 member
= TREE_OPERAND (member
, 1);
5848 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
5852 /* Make sure that there are no statements after LAST in the constructor
5853 body represented by LIST. */
5856 check_constexpr_ctor_body (tree last
, tree list
)
5859 if (TREE_CODE (list
) == STATEMENT_LIST
)
5861 tree_stmt_iterator i
= tsi_last (list
);
5862 for (; !tsi_end_p (i
); tsi_prev (&i
))
5864 tree t
= tsi_stmt (i
);
5867 if (TREE_CODE (t
) == BIND_EXPR
)
5869 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
5874 /* We currently allow typedefs and static_assert.
5875 FIXME allow them in the standard, too. */
5876 if (TREE_CODE (t
) != STATIC_ASSERT
)
5883 else if (list
!= last
5884 && TREE_CODE (list
) != STATIC_ASSERT
)
5888 error ("constexpr constructor does not have empty body");
5889 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
5894 /* Build compile-time evalable representations of member-initializer list
5895 for a constexpr constructor. */
5898 build_constexpr_constructor_member_initializers (tree type
, tree body
)
5900 VEC(constructor_elt
,gc
) *vec
= NULL
;
5902 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
5903 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
5904 body
= TREE_OPERAND (body
, 0);
5905 if (TREE_CODE (body
) == STATEMENT_LIST
)
5906 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
5907 body
= BIND_EXPR_BODY (body
);
5908 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5910 body
= TREE_OPERAND (body
, 0);
5911 if (TREE_CODE (body
) == EXPR_STMT
)
5912 body
= TREE_OPERAND (body
, 0);
5913 if (TREE_CODE (body
) == INIT_EXPR
5914 && (same_type_ignoring_top_level_qualifiers_p
5915 (TREE_TYPE (TREE_OPERAND (body
, 0)),
5916 current_class_type
)))
5919 return TREE_OPERAND (body
, 1);
5921 ok
= build_data_member_initialization (body
, &vec
);
5923 else if (TREE_CODE (body
) == STATEMENT_LIST
)
5925 tree_stmt_iterator i
;
5926 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5928 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
5934 gcc_assert (errorcount
> 0);
5937 if (VEC_length (constructor_elt
, vec
) > 0)
5939 /* In a delegating constructor, return the target. */
5940 constructor_elt
*ce
= VEC_index (constructor_elt
, vec
, 0);
5941 if (ce
->index
== current_class_ptr
)
5944 VEC_free (constructor_elt
, gc
, vec
);
5948 return build_constructor (type
, vec
);
5951 return error_mark_node
;
5954 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5955 declared to be constexpr, or a sub-statement thereof. Returns the
5956 return value if suitable, error_mark_node for a statement not allowed in
5957 a constexpr function, or NULL_TREE if no return value was found. */
5960 constexpr_fn_retval (tree body
)
5962 switch (TREE_CODE (body
))
5964 case STATEMENT_LIST
:
5966 tree_stmt_iterator i
;
5967 tree expr
= NULL_TREE
;
5968 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5970 tree s
= constexpr_fn_retval (tsi_stmt (i
));
5971 if (s
== error_mark_node
)
5972 return error_mark_node
;
5973 else if (s
== NULL_TREE
)
5974 /* Keep iterating. */;
5976 /* Multiple return statements. */
5977 return error_mark_node
;
5985 return unshare_expr (TREE_OPERAND (body
, 0));
5988 if (TREE_CODE (DECL_EXPR_DECL (body
)) == USING_DECL
)
5990 return error_mark_node
;
5992 case CLEANUP_POINT_EXPR
:
5993 return constexpr_fn_retval (TREE_OPERAND (body
, 0));
5999 return error_mark_node
;
6003 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
6004 FUN; do the necessary transformations to turn it into a single expression
6005 that we can store in the hash table. */
6008 massage_constexpr_body (tree fun
, tree body
)
6010 if (DECL_CONSTRUCTOR_P (fun
))
6011 body
= build_constexpr_constructor_member_initializers
6012 (DECL_CONTEXT (fun
), body
);
6015 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
6016 body
= EH_SPEC_STMTS (body
);
6017 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
6018 body
= TREE_OPERAND (body
, 0);
6019 if (TREE_CODE (body
) == BIND_EXPR
)
6020 body
= BIND_EXPR_BODY (body
);
6021 body
= constexpr_fn_retval (body
);
6026 /* FUN is a constexpr constructor with massaged body BODY. Return true
6027 if some bases/fields are uninitialized, and complain if COMPLAIN. */
6030 cx_check_missing_mem_inits (tree fun
, tree body
, bool complain
)
6036 if (TREE_CODE (body
) != CONSTRUCTOR
)
6040 nelts
= CONSTRUCTOR_NELTS (body
);
6041 field
= TYPE_FIELDS (DECL_CONTEXT (fun
));
6042 for (i
= 0; i
<= nelts
; ++i
)
6049 index
= CONSTRUCTOR_ELT (body
, i
)->index
;
6050 /* Skip base and vtable inits. */
6051 if (TREE_CODE (index
) != FIELD_DECL
)
6054 for (; field
!= index
; field
= DECL_CHAIN (field
))
6057 if (TREE_CODE (field
) != FIELD_DECL
6058 || (DECL_C_BIT_FIELD (field
) && !DECL_NAME (field
)))
6062 ftype
= strip_array_types (TREE_TYPE (field
));
6063 if (type_has_constexpr_default_constructor (ftype
))
6065 /* It's OK to skip a member with a trivial constexpr ctor.
6066 A constexpr ctor that isn't trivial should have been
6068 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype
)
6069 || errorcount
!= 0);
6072 error ("uninitialized member %qD in %<constexpr%> constructor",
6076 if (field
== NULL_TREE
)
6078 field
= DECL_CHAIN (field
);
6084 /* We are processing the definition of the constexpr function FUN.
6085 Check that its BODY fulfills the propriate requirements and
6086 enter it in the constexpr function definition table.
6087 For constructor BODY is actually the TREE_LIST of the
6088 member-initializer list. */
6091 register_constexpr_fundef (tree fun
, tree body
)
6093 constexpr_fundef entry
;
6094 constexpr_fundef
**slot
;
6096 if (!is_valid_constexpr_fn (fun
, !DECL_GENERATED_P (fun
)))
6099 body
= massage_constexpr_body (fun
, body
);
6100 if (body
== NULL_TREE
|| body
== error_mark_node
)
6102 if (!DECL_CONSTRUCTOR_P (fun
))
6103 error ("body of constexpr function %qD not a return-statement", fun
);
6107 if (!potential_rvalue_constant_expression (body
))
6109 if (!DECL_GENERATED_P (fun
))
6110 require_potential_rvalue_constant_expression (body
);
6114 if (DECL_CONSTRUCTOR_P (fun
)
6115 && cx_check_missing_mem_inits (fun
, body
, !DECL_GENERATED_P (fun
)))
6118 /* Create the constexpr function table if necessary. */
6119 if (constexpr_fundef_table
== NULL
)
6120 constexpr_fundef_table
= htab_create_ggc (101,
6121 constexpr_fundef_hash
,
6122 constexpr_fundef_equal
,
6126 slot
= (constexpr_fundef
**)
6127 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
6129 gcc_assert (*slot
== NULL
);
6130 *slot
= ggc_alloc_constexpr_fundef ();
6136 /* FUN is a non-constexpr function called in a context that requires a
6137 constant expression. If it comes from a constexpr template, explain why
6138 the instantiation isn't constexpr. */
6141 explain_invalid_constexpr_fn (tree fun
)
6143 static struct pointer_set_t
*diagnosed
;
6145 location_t save_loc
;
6146 /* Only diagnose defaulted functions or instantiations. */
6147 if (!DECL_DEFAULTED_FN (fun
)
6148 && !is_instantiation_of_constexpr (fun
))
6150 if (diagnosed
== NULL
)
6151 diagnosed
= pointer_set_create ();
6152 if (pointer_set_insert (diagnosed
, fun
) != 0)
6153 /* Already explained. */
6156 save_loc
= input_location
;
6157 input_location
= DECL_SOURCE_LOCATION (fun
);
6158 inform (0, "%q+D is not usable as a constexpr function because:", fun
);
6159 /* First check the declaration. */
6160 if (is_valid_constexpr_fn (fun
, true))
6162 /* Then if it's OK, the body. */
6163 if (DECL_DEFAULTED_FN (fun
))
6164 explain_implicit_non_constexpr (fun
);
6167 body
= massage_constexpr_body (fun
, DECL_SAVED_TREE (fun
));
6168 require_potential_rvalue_constant_expression (body
);
6169 if (DECL_CONSTRUCTOR_P (fun
))
6170 cx_check_missing_mem_inits (fun
, body
, true);
6173 input_location
= save_loc
;
6176 /* Objects of this type represent calls to constexpr functions
6177 along with the bindings of parameters to their arguments, for
6178 the purpose of compile time evaluation. */
6180 typedef struct GTY(()) constexpr_call
{
6181 /* Description of the constexpr function definition. */
6182 constexpr_fundef
*fundef
;
6183 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
6184 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6185 Note: This arrangement is made to accomodate the use of
6186 iterative_hash_template_arg (see pt.c). If you change this
6187 representation, also change the hash calculation in
6188 cxx_eval_call_expression. */
6190 /* Result of the call.
6191 NULL means the call is being evaluated.
6192 error_mark_node means that the evaluation was erroneous;
6193 otherwise, the actuall value of the call. */
6195 /* The hash of this call; we remember it here to avoid having to
6196 recalculate it when expanding the hash table. */
6200 /* A table of all constexpr calls that have been evaluated by the
6201 compiler in this translation unit. */
6203 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
6205 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
6206 bool, bool, bool *);
6208 /* Compute a hash value for a constexpr call representation. */
6211 constexpr_call_hash (const void *p
)
6213 const constexpr_call
*info
= (const constexpr_call
*) p
;
6217 /* Return 1 if the objects pointed to by P and Q represent calls
6218 to the same constexpr function with the same arguments.
6219 Otherwise, return 0. */
6222 constexpr_call_equal (const void *p
, const void *q
)
6224 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
6225 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
6230 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
6232 lhs_bindings
= lhs
->bindings
;
6233 rhs_bindings
= rhs
->bindings
;
6234 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
6236 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
6237 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
6238 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
6239 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
6241 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
6242 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
6244 return lhs_bindings
== rhs_bindings
;
6247 /* Initialize the constexpr call table, if needed. */
6250 maybe_initialize_constexpr_call_table (void)
6252 if (constexpr_call_table
== NULL
)
6253 constexpr_call_table
= htab_create_ggc (101,
6254 constexpr_call_hash
,
6255 constexpr_call_equal
,
6259 /* Return true if T designates the implied `this' parameter. */
6262 is_this_parameter (tree t
)
6264 return t
== current_class_ptr
;
6267 /* We have an expression tree T that represents a call, either CALL_EXPR
6268 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6269 retrun the _DECL for that function. */
6272 get_function_named_in_call (tree t
)
6275 switch (TREE_CODE (t
))
6278 fun
= CALL_EXPR_FN (t
);
6281 case AGGR_INIT_EXPR
:
6282 fun
= AGGR_INIT_EXPR_FN (t
);
6289 if (TREE_CODE (fun
) == ADDR_EXPR
6290 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
6291 fun
= TREE_OPERAND (fun
, 0);
6295 /* We have an expression tree T that represents a call, either CALL_EXPR
6296 or AGGR_INIT_EXPR. Return the Nth argument. */
6299 get_nth_callarg (tree t
, int n
)
6301 switch (TREE_CODE (t
))
6304 return CALL_EXPR_ARG (t
, n
);
6306 case AGGR_INIT_EXPR
:
6307 return AGGR_INIT_EXPR_ARG (t
, n
);
6315 /* Look up the binding of the function parameter T in a constexpr
6316 function call context CALL. */
6319 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
6321 tree b
= purpose_member (t
, call
->bindings
);
6322 return TREE_VALUE (b
);
6325 /* Attempt to evaluate T which represents a call to a builtin function.
6326 We assume here that all builtin functions evaluate to scalar types
6327 represented by _CST nodes. */
6330 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
6331 bool allow_non_constant
, bool addr
,
6332 bool *non_constant_p
)
6334 const int nargs
= call_expr_nargs (t
);
6335 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
6338 for (i
= 0; i
< nargs
; ++i
)
6340 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
6341 allow_non_constant
, addr
,
6343 if (allow_non_constant
&& *non_constant_p
)
6346 if (*non_constant_p
)
6348 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
6349 CALL_EXPR_FN (t
), nargs
, args
);
6350 return fold (new_call
);
6353 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6354 the type of the value to match. */
6357 adjust_temp_type (tree type
, tree temp
)
6359 if (TREE_TYPE (temp
) == type
)
6361 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6362 if (TREE_CODE (temp
) == CONSTRUCTOR
)
6363 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
6364 gcc_assert (SCALAR_TYPE_P (type
));
6365 return cp_fold_convert (type
, temp
);
6368 /* Subroutine of cxx_eval_call_expression.
6369 We are processing a call expression (either CALL_EXPR or
6370 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6371 all arguments and bind their values to correspondings
6372 parameters, making up the NEW_CALL context. */
6375 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
6376 constexpr_call
*new_call
,
6377 bool allow_non_constant
,
6378 bool *non_constant_p
)
6380 const int nargs
= call_expr_nargs (t
);
6381 tree fun
= new_call
->fundef
->decl
;
6382 tree parms
= DECL_ARGUMENTS (fun
);
6384 for (i
= 0; i
< nargs
; ++i
)
6387 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
6388 /* For member function, the first argument is a pointer to the implied
6389 object. And for an object contruction, don't bind `this' before
6390 it is fully constructed. */
6391 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
6393 x
= get_nth_callarg (t
, i
);
6394 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
6395 TREE_CODE (type
) == REFERENCE_TYPE
,
6397 /* Don't VERIFY_CONSTANT here. */
6398 if (*non_constant_p
&& allow_non_constant
)
6400 /* Just discard ellipsis args after checking their constantitude. */
6403 if (*non_constant_p
)
6404 /* Don't try to adjust the type of non-constant args. */
6407 /* Make sure the binding has the same type as the parm. */
6408 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6409 arg
= adjust_temp_type (type
, arg
);
6410 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
6412 parms
= TREE_CHAIN (parms
);
6416 /* Variables and functions to manage constexpr call expansion context.
6417 These do not need to be marked for PCH or GC. */
6419 /* FIXME remember and print actual constant arguments. */
6420 static VEC(tree
,heap
) *call_stack
= NULL
;
6421 static int call_stack_tick
;
6422 static int last_cx_error_tick
;
6425 push_cx_call_context (tree call
)
6428 if (!EXPR_HAS_LOCATION (call
))
6429 SET_EXPR_LOCATION (call
, input_location
);
6430 VEC_safe_push (tree
, heap
, call_stack
, call
);
6431 if (VEC_length (tree
, call_stack
) > (unsigned) max_constexpr_depth
)
6437 pop_cx_call_context (void)
6440 VEC_pop (tree
, call_stack
);
6444 cx_error_context (void)
6446 VEC(tree
,heap
) *r
= NULL
;
6447 if (call_stack_tick
!= last_cx_error_tick
6448 && !VEC_empty (tree
, call_stack
))
6450 last_cx_error_tick
= call_stack_tick
;
6454 /* Subroutine of cxx_eval_constant_expression.
6455 Evaluate the call expression tree T in the context of OLD_CALL expression
6459 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
6460 bool allow_non_constant
, bool addr
,
6461 bool *non_constant_p
)
6463 location_t loc
= EXPR_LOC_OR_HERE (t
);
6464 tree fun
= get_function_named_in_call (t
);
6466 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
6467 constexpr_call
**slot
;
6468 constexpr_call
*entry
;
6471 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6473 /* Might be a constexpr function pointer. */
6474 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
6475 /*addr*/false, non_constant_p
);
6476 if (TREE_CODE (fun
) == ADDR_EXPR
)
6477 fun
= TREE_OPERAND (fun
, 0);
6479 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6481 if (!allow_non_constant
&& !*non_constant_p
)
6482 error_at (loc
, "expression %qE does not designate a constexpr "
6484 *non_constant_p
= true;
6487 if (DECL_CLONED_FUNCTION_P (fun
))
6488 fun
= DECL_CLONED_FUNCTION (fun
);
6489 if (is_builtin_fn (fun
))
6490 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6491 addr
, non_constant_p
);
6492 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6494 if (!allow_non_constant
)
6496 error_at (loc
, "call to non-constexpr function %qD", fun
);
6497 explain_invalid_constexpr_fn (fun
);
6499 *non_constant_p
= true;
6503 /* Shortcut trivial copy constructor/op=. */
6504 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6506 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6507 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6508 addr
, non_constant_p
);
6511 /* If in direct recursive call, optimize definition search. */
6512 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6513 new_call
.fundef
= old_call
->fundef
;
6516 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6517 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6519 if (!allow_non_constant
)
6521 if (DECL_INITIAL (fun
))
6523 /* The definition of fun was somehow unsuitable. */
6524 error_at (loc
, "%qD called in a constant expression", fun
);
6525 explain_invalid_constexpr_fn (fun
);
6528 error_at (loc
, "%qD used before its definition", fun
);
6530 *non_constant_p
= true;
6534 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6535 allow_non_constant
, non_constant_p
);
6536 if (*non_constant_p
)
6539 depth_ok
= push_cx_call_context (t
);
6542 = iterative_hash_template_arg (new_call
.bindings
,
6543 constexpr_fundef_hash (new_call
.fundef
));
6545 /* If we have seen this call before, we are done. */
6546 maybe_initialize_constexpr_call_table ();
6547 slot
= (constexpr_call
**)
6548 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6552 /* We need to keep a pointer to the entry, not just the slot, as the
6553 slot can move in the call to cxx_eval_builtin_function_call. */
6554 *slot
= entry
= ggc_alloc_constexpr_call ();
6557 /* Calls which are in progress have their result set to NULL
6558 so that we can detect circular dependencies. */
6559 else if (entry
->result
== NULL
)
6561 if (!allow_non_constant
)
6562 error ("call has circular dependency");
6563 *non_constant_p
= true;
6564 entry
->result
= result
= error_mark_node
;
6569 if (!allow_non_constant
)
6570 error ("constexpr evaluation depth exceeds maximum of %d (use "
6571 "-fconstexpr-depth= to increase the maximum)",
6572 max_constexpr_depth
);
6573 *non_constant_p
= true;
6574 entry
->result
= result
= error_mark_node
;
6578 result
= entry
->result
;
6579 if (!result
|| result
== error_mark_node
)
6580 result
= (cxx_eval_constant_expression
6581 (&new_call
, new_call
.fundef
->body
,
6582 allow_non_constant
, addr
,
6584 if (result
== error_mark_node
)
6585 *non_constant_p
= true;
6586 if (*non_constant_p
)
6587 entry
->result
= result
= error_mark_node
;
6590 /* If this was a call to initialize an object, set the type of
6591 the CONSTRUCTOR to the type of that object. */
6592 if (DECL_CONSTRUCTOR_P (fun
))
6594 tree ob_arg
= get_nth_callarg (t
, 0);
6595 STRIP_NOPS (ob_arg
);
6596 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6597 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6598 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6601 entry
->result
= result
;
6605 pop_cx_call_context ();
6606 return unshare_expr (result
);
6609 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6612 reduced_constant_expression_p (tree t
)
6614 if (TREE_OVERFLOW_P (t
))
6615 /* Integer overflow makes this not a constant expression. */
6617 /* FIXME are we calling this too much? */
6618 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6621 /* Some expressions may have constant operands but are not constant
6622 themselves, such as 1/0. Call this function (or rather, the macro
6623 following it) to check for that condition.
6625 We only call this in places that require an arithmetic constant, not in
6626 places where we might have a non-constant expression that can be a
6627 component of a constant expression, such as the address of a constexpr
6628 variable that might be dereferenced later. */
6631 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
)
6633 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6635 if (!allow_non_constant
)
6637 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6638 printing the folded constant isn't helpful. */
6639 if (TREE_OVERFLOW_P (t
))
6641 permerror (input_location
, "overflow in constant expression");
6642 /* If we're being permissive (and are in an enforcing
6643 context), consider this constant. */
6644 if (flag_permissive
)
6648 error ("%q+E is not a constant expression", t
);
6650 *non_constant_p
= true;
6652 return *non_constant_p
;
6654 #define VERIFY_CONSTANT(X) \
6656 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6660 /* Subroutine of cxx_eval_constant_expression.
6661 Attempt to reduce the unary expression tree T to a compile time value.
6662 If successful, return the value. Otherwise issue a diagnostic
6663 and return error_mark_node. */
6666 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6667 bool allow_non_constant
, bool addr
,
6668 bool *non_constant_p
)
6671 tree orig_arg
= TREE_OPERAND (t
, 0);
6672 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6673 addr
, non_constant_p
);
6674 VERIFY_CONSTANT (arg
);
6675 if (arg
== orig_arg
)
6677 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6678 VERIFY_CONSTANT (r
);
6682 /* Subroutine of cxx_eval_constant_expression.
6683 Like cxx_eval_unary_expression, except for binary expressions. */
6686 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6687 bool allow_non_constant
, bool addr
,
6688 bool *non_constant_p
)
6691 tree orig_lhs
= TREE_OPERAND (t
, 0);
6692 tree orig_rhs
= TREE_OPERAND (t
, 1);
6694 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6695 allow_non_constant
, addr
,
6697 VERIFY_CONSTANT (lhs
);
6698 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6699 allow_non_constant
, addr
,
6701 VERIFY_CONSTANT (rhs
);
6702 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6704 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6705 VERIFY_CONSTANT (r
);
6709 /* Subroutine of cxx_eval_constant_expression.
6710 Attempt to evaluate condition expressions. Dead branches are not
6714 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6715 bool allow_non_constant
, bool addr
,
6716 bool *non_constant_p
)
6718 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6719 allow_non_constant
, addr
,
6721 VERIFY_CONSTANT (val
);
6722 /* Don't VERIFY_CONSTANT the other operands. */
6723 if (integer_zerop (val
))
6724 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6725 allow_non_constant
, addr
,
6727 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6728 allow_non_constant
, addr
,
6732 /* Subroutine of cxx_eval_constant_expression.
6733 Attempt to reduce a reference to an array slot. */
6736 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6737 bool allow_non_constant
, bool addr
,
6738 bool *non_constant_p
)
6740 tree oldary
= TREE_OPERAND (t
, 0);
6741 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6742 allow_non_constant
, addr
,
6747 unsigned len
, elem_nchars
= 1;
6748 if (*non_constant_p
)
6750 oldidx
= TREE_OPERAND (t
, 1);
6751 index
= cxx_eval_constant_expression (call
, oldidx
,
6752 allow_non_constant
, false,
6754 VERIFY_CONSTANT (index
);
6755 if (addr
&& ary
== oldary
&& index
== oldidx
)
6758 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
6759 elem_type
= TREE_TYPE (TREE_TYPE (ary
));
6760 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6761 len
= CONSTRUCTOR_NELTS (ary
);
6762 else if (TREE_CODE (ary
) == STRING_CST
)
6764 elem_nchars
= (TYPE_PRECISION (elem_type
)
6765 / TYPE_PRECISION (char_type_node
));
6766 len
= (unsigned) TREE_STRING_LENGTH (ary
) / elem_nchars
;
6770 /* We can't do anything with other tree codes, so use
6771 VERIFY_CONSTANT to complain and fail. */
6772 VERIFY_CONSTANT (ary
);
6775 if (compare_tree_int (index
, len
) >= 0)
6777 if (tree_int_cst_lt (index
, array_type_nelts_top (TREE_TYPE (ary
))))
6779 /* If it's within the array bounds but doesn't have an explicit
6780 initializer, it's value-initialized. */
6781 tree val
= build_value_init (elem_type
, tf_warning_or_error
);
6782 return cxx_eval_constant_expression (call
, val
,
6783 allow_non_constant
, addr
,
6787 if (!allow_non_constant
)
6788 error ("array subscript out of bound");
6789 *non_constant_p
= true;
6792 i
= tree_low_cst (index
, 0);
6793 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6794 return VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ary
), i
)->value
;
6795 else if (elem_nchars
== 1)
6796 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
6797 TREE_STRING_POINTER (ary
)[i
]);
6800 tree type
= cv_unqualified (TREE_TYPE (TREE_TYPE (ary
)));
6801 return native_interpret_expr (type
, (const unsigned char *)
6802 TREE_STRING_POINTER (ary
)
6803 + i
* elem_nchars
, elem_nchars
);
6805 /* Don't VERIFY_CONSTANT here. */
6808 /* Subroutine of cxx_eval_constant_expression.
6809 Attempt to reduce a field access of a value of class type. */
6812 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
6813 bool allow_non_constant
, bool addr
,
6814 bool *non_constant_p
)
6816 unsigned HOST_WIDE_INT i
;
6819 tree part
= TREE_OPERAND (t
, 1);
6820 tree orig_whole
= TREE_OPERAND (t
, 0);
6821 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6822 allow_non_constant
, addr
,
6824 if (whole
== orig_whole
)
6827 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
6828 whole
, part
, NULL_TREE
);
6829 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6831 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6833 if (!allow_non_constant
)
6834 error ("%qE is not a constant expression", orig_whole
);
6835 *non_constant_p
= true;
6837 if (DECL_MUTABLE_P (part
))
6839 if (!allow_non_constant
)
6840 error ("mutable %qD is not usable in a constant expression", part
);
6841 *non_constant_p
= true;
6843 if (*non_constant_p
)
6845 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6850 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
6851 && CONSTRUCTOR_NELTS (whole
) > 0)
6853 /* DR 1188 says we don't have to deal with this. */
6854 if (!allow_non_constant
)
6855 error ("accessing %qD member instead of initialized %qD member in "
6856 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
6857 *non_constant_p
= true;
6861 /* If there's no explicit init for this field, it's value-initialized. */
6862 value
= build_value_init (TREE_TYPE (t
), tf_warning_or_error
);
6863 return cxx_eval_constant_expression (call
, value
,
6864 allow_non_constant
, addr
,
6868 /* Subroutine of cxx_eval_constant_expression.
6869 Attempt to reduce a field access of a value of class type that is
6870 expressed as a BIT_FIELD_REF. */
6873 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
6874 bool allow_non_constant
, bool addr
,
6875 bool *non_constant_p
)
6877 tree orig_whole
= TREE_OPERAND (t
, 0);
6878 tree retval
, fldval
, utype
, mask
;
6879 bool fld_seen
= false;
6880 HOST_WIDE_INT istart
, isize
;
6881 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6882 allow_non_constant
, addr
,
6884 tree start
, field
, value
;
6885 unsigned HOST_WIDE_INT i
;
6887 if (whole
== orig_whole
)
6889 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6891 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6893 if (!allow_non_constant
)
6894 error ("%qE is not a constant expression", orig_whole
);
6895 *non_constant_p
= true;
6897 if (*non_constant_p
)
6900 start
= TREE_OPERAND (t
, 2);
6901 istart
= tree_low_cst (start
, 0);
6902 isize
= tree_low_cst (TREE_OPERAND (t
, 1), 0);
6903 utype
= TREE_TYPE (t
);
6904 if (!TYPE_UNSIGNED (utype
))
6905 utype
= build_nonstandard_integer_type (TYPE_PRECISION (utype
), 1);
6906 retval
= build_int_cst (utype
, 0);
6907 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6909 tree bitpos
= bit_position (field
);
6910 if (bitpos
== start
&& DECL_SIZE (field
) == TREE_OPERAND (t
, 1))
6912 if (TREE_CODE (TREE_TYPE (field
)) == INTEGER_TYPE
6913 && TREE_CODE (value
) == INTEGER_CST
6914 && host_integerp (bitpos
, 0)
6915 && host_integerp (DECL_SIZE (field
), 0))
6917 HOST_WIDE_INT bit
= tree_low_cst (bitpos
, 0);
6918 HOST_WIDE_INT sz
= tree_low_cst (DECL_SIZE (field
), 0);
6919 HOST_WIDE_INT shift
;
6920 if (bit
>= istart
&& bit
+ sz
<= istart
+ isize
)
6922 fldval
= fold_convert (utype
, value
);
6923 mask
= build_int_cst_type (utype
, -1);
6924 mask
= fold_build2 (LSHIFT_EXPR
, utype
, mask
,
6925 size_int (TYPE_PRECISION (utype
) - sz
));
6926 mask
= fold_build2 (RSHIFT_EXPR
, utype
, mask
,
6927 size_int (TYPE_PRECISION (utype
) - sz
));
6928 fldval
= fold_build2 (BIT_AND_EXPR
, utype
, fldval
, mask
);
6929 shift
= bit
- istart
;
6930 if (BYTES_BIG_ENDIAN
)
6931 shift
= TYPE_PRECISION (utype
) - shift
- sz
;
6932 fldval
= fold_build2 (LSHIFT_EXPR
, utype
, fldval
,
6934 retval
= fold_build2 (BIT_IOR_EXPR
, utype
, retval
, fldval
);
6940 return fold_convert (TREE_TYPE (t
), retval
);
6942 return error_mark_node
;
6945 /* Subroutine of cxx_eval_constant_expression.
6946 Evaluate a short-circuited logical expression T in the context
6947 of a given constexpr CALL. BAILOUT_VALUE is the value for
6948 early return. CONTINUE_VALUE is used here purely for
6949 sanity check purposes. */
6952 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
6953 tree bailout_value
, tree continue_value
,
6954 bool allow_non_constant
, bool addr
,
6955 bool *non_constant_p
)
6958 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6959 allow_non_constant
, addr
,
6961 VERIFY_CONSTANT (lhs
);
6962 if (tree_int_cst_equal (lhs
, bailout_value
))
6964 gcc_assert (tree_int_cst_equal (lhs
, continue_value
));
6965 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6966 allow_non_constant
, addr
, non_constant_p
);
6967 VERIFY_CONSTANT (r
);
6971 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6972 CONSTRUCTOR elements to initialize (part of) an object containing that
6973 field. Return a pointer to the constructor_elt corresponding to the
6974 initialization of the field. */
6976 static constructor_elt
*
6977 base_field_constructor_elt (VEC(constructor_elt
,gc
) *v
, tree ref
)
6979 tree aggr
= TREE_OPERAND (ref
, 0);
6980 tree field
= TREE_OPERAND (ref
, 1);
6982 constructor_elt
*ce
;
6984 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
6986 if (TREE_CODE (aggr
) == COMPONENT_REF
)
6988 constructor_elt
*base_ce
6989 = base_field_constructor_elt (v
, aggr
);
6990 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
6993 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6994 if (ce
->index
== field
)
7001 /* Subroutine of cxx_eval_constant_expression.
7002 The expression tree T denotes a C-style array or a C-style
7003 aggregate. Reduce it to a constant expression. */
7006 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
7007 bool allow_non_constant
, bool addr
,
7008 bool *non_constant_p
)
7010 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
7011 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
,
7012 VEC_length (constructor_elt
, v
));
7013 constructor_elt
*ce
;
7015 bool changed
= false;
7016 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
7017 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
7019 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
7020 allow_non_constant
, addr
,
7022 /* Don't VERIFY_CONSTANT here. */
7023 if (allow_non_constant
&& *non_constant_p
)
7025 if (elt
!= ce
->value
)
7027 if (TREE_CODE (ce
->index
) == COMPONENT_REF
)
7029 /* This is an initialization of a vfield inside a base
7030 subaggregate that we already initialized; push this
7031 initialization into the previous initialization. */
7032 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
7036 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
7038 if (*non_constant_p
|| !changed
)
7041 VEC_free (constructor_elt
, gc
, n
);
7044 t
= build_constructor (TREE_TYPE (t
), n
);
7045 TREE_CONSTANT (t
) = true;
7049 /* Subroutine of cxx_eval_constant_expression.
7050 The expression tree T is a VEC_INIT_EXPR which denotes the desired
7051 initialization of a non-static data member of array type. Reduce it to a
7054 Note that apart from value-initialization (when VALUE_INIT is true),
7055 this is only intended to support value-initialization and the
7056 initializations done by defaulted constructors for classes with
7057 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
7058 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
7059 for the copy/move constructor. */
7062 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
7063 bool value_init
, bool allow_non_constant
, bool addr
,
7064 bool *non_constant_p
)
7066 tree elttype
= TREE_TYPE (atype
);
7067 int max
= tree_low_cst (array_type_nelts (atype
), 0);
7068 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
, max
+ 1);
7069 bool pre_init
= false;
7072 /* For the default constructor, build up a call to the default
7073 constructor of the element type. We only need to handle class types
7074 here, as for a constructor to be constexpr, all members must be
7075 initialized, which for a defaulted default constructor means they must
7076 be of a class type with a constexpr default constructor. */
7077 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7078 /* We only do this at the lowest level. */;
7079 else if (value_init
)
7081 init
= build_value_init (elttype
, tf_warning_or_error
);
7082 init
= cxx_eval_constant_expression
7083 (call
, init
, allow_non_constant
, addr
, non_constant_p
);
7088 VEC(tree
,gc
) *argvec
= make_tree_vector ();
7089 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7090 &argvec
, elttype
, LOOKUP_NORMAL
,
7091 tf_warning_or_error
);
7092 release_tree_vector (argvec
);
7093 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
7094 addr
, non_constant_p
);
7098 if (*non_constant_p
&& !allow_non_constant
)
7101 for (i
= 0; i
<= max
; ++i
)
7103 tree idx
= build_int_cst (size_type_node
, i
);
7105 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7107 /* A multidimensional array; recurse. */
7108 if (value_init
|| init
== NULL_TREE
)
7109 eltinit
= NULL_TREE
;
7111 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7112 tf_warning_or_error
);
7113 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
7114 allow_non_constant
, addr
,
7119 /* Initializing an element using value or default initialization
7120 we just pre-built above. */
7124 eltinit
= unshare_expr (init
);
7128 /* Copying an element. */
7129 VEC(tree
,gc
) *argvec
;
7130 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7131 (atype
, TREE_TYPE (init
)));
7132 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7133 tf_warning_or_error
);
7134 if (!real_lvalue_p (init
))
7135 eltinit
= move (eltinit
);
7136 argvec
= make_tree_vector ();
7137 VEC_quick_push (tree
, argvec
, eltinit
);
7138 eltinit
= (build_special_member_call
7139 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
7140 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
7141 release_tree_vector (argvec
);
7142 eltinit
= cxx_eval_constant_expression
7143 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
7145 if (*non_constant_p
&& !allow_non_constant
)
7147 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
7150 if (!*non_constant_p
)
7152 init
= build_constructor (atype
, n
);
7153 TREE_CONSTANT (init
) = true;
7158 VEC_free (constructor_elt
, gc
, n
);
7163 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
7164 bool allow_non_constant
, bool addr
,
7165 bool *non_constant_p
)
7167 tree atype
= TREE_TYPE (t
);
7168 tree init
= VEC_INIT_EXPR_INIT (t
);
7169 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
7170 VEC_INIT_EXPR_VALUE_INIT (t
),
7171 allow_non_constant
, addr
, non_constant_p
);
7172 if (*non_constant_p
)
7178 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7179 match. We want to be less strict for simple *& folding; if we have a
7180 non-const temporary that we access through a const pointer, that should
7181 work. We handle this here rather than change fold_indirect_ref_1
7182 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7183 don't really make sense outside of constant expression evaluation. Also
7184 we want to allow folding to COMPONENT_REF, which could cause trouble
7185 with TBAA in fold_indirect_ref_1.
7187 Try to keep this function synced with fold_indirect_ref_1. */
7190 cxx_fold_indirect_ref (location_t loc
, tree type
, tree op0
, bool *empty_base
)
7196 subtype
= TREE_TYPE (sub
);
7197 gcc_assert (POINTER_TYPE_P (subtype
));
7199 if (TREE_CODE (sub
) == ADDR_EXPR
)
7201 tree op
= TREE_OPERAND (sub
, 0);
7202 tree optype
= TREE_TYPE (op
);
7204 /* *&CONST_DECL -> to the value of the const decl. */
7205 if (TREE_CODE (op
) == CONST_DECL
)
7206 return DECL_INITIAL (op
);
7207 /* *&p => p; make sure to handle *&"str"[cst] here. */
7208 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
7210 tree fop
= fold_read_from_constant_string (op
);
7216 /* *(foo *)&fooarray => fooarray[0] */
7217 else if (TREE_CODE (optype
) == ARRAY_TYPE
7218 && (same_type_ignoring_top_level_qualifiers_p
7219 (type
, TREE_TYPE (optype
))))
7221 tree type_domain
= TYPE_DOMAIN (optype
);
7222 tree min_val
= size_zero_node
;
7223 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7224 min_val
= TYPE_MIN_VALUE (type_domain
);
7225 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
7226 NULL_TREE
, NULL_TREE
);
7228 /* *(foo *)&complexfoo => __real__ complexfoo */
7229 else if (TREE_CODE (optype
) == COMPLEX_TYPE
7230 && (same_type_ignoring_top_level_qualifiers_p
7231 (type
, TREE_TYPE (optype
))))
7232 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
7233 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7234 else if (TREE_CODE (optype
) == VECTOR_TYPE
7235 && (same_type_ignoring_top_level_qualifiers_p
7236 (type
, TREE_TYPE (optype
))))
7238 tree part_width
= TYPE_SIZE (type
);
7239 tree index
= bitsize_int (0);
7240 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
7242 /* Also handle conversion to an empty base class, which
7243 is represented with a NOP_EXPR. */
7244 else if (is_empty_class (type
)
7245 && CLASS_TYPE_P (optype
)
7246 && DERIVED_FROM_P (type
, optype
))
7251 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7252 else if (RECORD_OR_UNION_TYPE_P (optype
))
7254 tree field
= TYPE_FIELDS (optype
);
7255 for (; field
; field
= DECL_CHAIN (field
))
7256 if (TREE_CODE (field
) == FIELD_DECL
7257 && integer_zerop (byte_position (field
))
7258 && (same_type_ignoring_top_level_qualifiers_p
7259 (TREE_TYPE (field
), type
)))
7261 return fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
7266 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
7267 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
7269 tree op00
= TREE_OPERAND (sub
, 0);
7270 tree op01
= TREE_OPERAND (sub
, 1);
7273 if (TREE_CODE (op00
) == ADDR_EXPR
)
7276 op00
= TREE_OPERAND (op00
, 0);
7277 op00type
= TREE_TYPE (op00
);
7279 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7280 if (TREE_CODE (op00type
) == VECTOR_TYPE
7281 && (same_type_ignoring_top_level_qualifiers_p
7282 (type
, TREE_TYPE (op00type
))))
7284 HOST_WIDE_INT offset
= tree_low_cst (op01
, 0);
7285 tree part_width
= TYPE_SIZE (type
);
7286 unsigned HOST_WIDE_INT part_widthi
= tree_low_cst (part_width
, 0)/BITS_PER_UNIT
;
7287 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
7288 tree index
= bitsize_int (indexi
);
7290 if (offset
/part_widthi
<= TYPE_VECTOR_SUBPARTS (op00type
))
7291 return fold_build3_loc (loc
,
7292 BIT_FIELD_REF
, type
, op00
,
7296 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7297 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
7298 && (same_type_ignoring_top_level_qualifiers_p
7299 (type
, TREE_TYPE (op00type
))))
7301 tree size
= TYPE_SIZE_UNIT (type
);
7302 if (tree_int_cst_equal (size
, op01
))
7303 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
7305 /* ((foo *)&fooarray)[1] => fooarray[1] */
7306 else if (TREE_CODE (op00type
) == ARRAY_TYPE
7307 && (same_type_ignoring_top_level_qualifiers_p
7308 (type
, TREE_TYPE (op00type
))))
7310 tree type_domain
= TYPE_DOMAIN (op00type
);
7311 tree min_val
= size_zero_node
;
7312 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7313 min_val
= TYPE_MIN_VALUE (type_domain
);
7314 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
7315 TYPE_SIZE_UNIT (type
));
7316 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
7317 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
7318 NULL_TREE
, NULL_TREE
);
7320 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7321 else if (RECORD_OR_UNION_TYPE_P (op00type
))
7323 tree field
= TYPE_FIELDS (op00type
);
7324 for (; field
; field
= DECL_CHAIN (field
))
7325 if (TREE_CODE (field
) == FIELD_DECL
7326 && tree_int_cst_equal (byte_position (field
), op01
)
7327 && (same_type_ignoring_top_level_qualifiers_p
7328 (TREE_TYPE (field
), type
)))
7330 return fold_build3 (COMPONENT_REF
, type
, op00
,
7337 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7338 else if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
7339 && (same_type_ignoring_top_level_qualifiers_p
7340 (type
, TREE_TYPE (TREE_TYPE (subtype
)))))
7343 tree min_val
= size_zero_node
;
7344 sub
= cxx_fold_indirect_ref (loc
, TREE_TYPE (subtype
), sub
, NULL
);
7346 sub
= build1_loc (loc
, INDIRECT_REF
, TREE_TYPE (subtype
), sub
);
7347 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
7348 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7349 min_val
= TYPE_MIN_VALUE (type_domain
);
7350 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
7358 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
7359 bool allow_non_constant
, bool addr
,
7360 bool *non_constant_p
)
7362 tree orig_op0
= TREE_OPERAND (t
, 0);
7363 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
7364 /*addr*/false, non_constant_p
);
7365 bool empty_base
= false;
7368 /* Don't VERIFY_CONSTANT here. */
7369 if (*non_constant_p
)
7372 r
= cxx_fold_indirect_ref (EXPR_LOCATION (t
), TREE_TYPE (t
), op0
,
7376 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
7377 addr
, non_constant_p
);
7382 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
)
7384 sub
= TREE_OPERAND (sub
, 0);
7387 if (TREE_CODE (sub
) == ADDR_EXPR
)
7389 /* We couldn't fold to a constant value. Make sure it's not
7390 something we should have been able to fold. */
7391 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7392 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
7393 /* DR 1188 says we don't have to deal with this. */
7394 if (!allow_non_constant
)
7395 error ("accessing value of %qE through a %qT glvalue in a "
7396 "constant expression", build_fold_indirect_ref (sub
),
7398 *non_constant_p
= true;
7403 /* If we're pulling out the value of an empty base, make sure
7404 that the whole object is constant and then return an empty
7408 VERIFY_CONSTANT (r
);
7409 r
= build_constructor (TREE_TYPE (t
), NULL
);
7410 TREE_CONSTANT (r
) = true;
7418 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7419 Shared between potential_constant_expression and
7420 cxx_eval_constant_expression. */
7423 non_const_var_error (tree r
)
7425 tree type
= TREE_TYPE (r
);
7426 error ("the value of %qD is not usable in a constant "
7428 /* Avoid error cascade. */
7429 if (DECL_INITIAL (r
) == error_mark_node
)
7431 if (DECL_DECLARED_CONSTEXPR_P (r
))
7432 inform (DECL_SOURCE_LOCATION (r
),
7433 "%qD used in its own initializer", r
);
7434 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7436 if (!CP_TYPE_CONST_P (type
))
7437 inform (DECL_SOURCE_LOCATION (r
),
7438 "%q#D is not const", r
);
7439 else if (CP_TYPE_VOLATILE_P (type
))
7440 inform (DECL_SOURCE_LOCATION (r
),
7441 "%q#D is volatile", r
);
7442 else if (!DECL_INITIAL (r
)
7443 || !TREE_CONSTANT (DECL_INITIAL (r
)))
7444 inform (DECL_SOURCE_LOCATION (r
),
7445 "%qD was not initialized with a constant "
7452 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
7453 inform (DECL_SOURCE_LOCATION (r
),
7454 "%qD was not declared %<constexpr%>", r
);
7456 inform (DECL_SOURCE_LOCATION (r
),
7457 "%qD does not have integral or enumeration type",
7462 /* Attempt to reduce the expression T to a constant value.
7463 On failure, issue diagnostic and return error_mark_node. */
7464 /* FIXME unify with c_fully_fold */
7467 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
7468 bool allow_non_constant
, bool addr
,
7469 bool *non_constant_p
)
7473 if (t
== error_mark_node
)
7475 *non_constant_p
= true;
7478 if (CONSTANT_CLASS_P (t
))
7480 if (TREE_CODE (t
) == PTRMEM_CST
)
7481 t
= cplus_expand_constant (t
);
7484 if (TREE_CODE (t
) != NOP_EXPR
7485 && reduced_constant_expression_p (t
))
7488 switch (TREE_CODE (t
))
7493 /* else fall through. */
7495 r
= integral_constant_value (t
);
7496 if (TREE_CODE (r
) == TARGET_EXPR
7497 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
7498 r
= TARGET_EXPR_INITIAL (r
);
7501 if (!allow_non_constant
)
7502 non_const_var_error (r
);
7503 *non_constant_p
= true;
7513 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
7515 if (DECL_ARTIFICIAL (t
) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t
)))
7517 if (!allow_non_constant
)
7518 sorry ("use of the value of the object being constructed "
7519 "in a constant expression");
7520 *non_constant_p
= true;
7523 r
= lookup_parameter_binding (call
, t
);
7526 /* Defer in case this is only used for its type. */;
7529 if (!allow_non_constant
)
7530 error ("%qE is not a constant expression", t
);
7531 *non_constant_p
= true;
7536 case AGGR_INIT_EXPR
:
7537 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
7542 if (!literal_type_p (TREE_TYPE (t
)))
7544 if (!allow_non_constant
)
7546 error ("temporary of non-literal type %qT in a "
7547 "constant expression", TREE_TYPE (t
));
7548 explain_non_literal_class (TREE_TYPE (t
));
7550 *non_constant_p
= true;
7553 /* else fall through. */
7555 /* Pass false for 'addr' because these codes indicate
7556 initialization of a temporary. */
7557 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7558 allow_non_constant
, false,
7560 if (!*non_constant_p
)
7561 /* Adjust the type of the result to the type of the temporary. */
7562 r
= adjust_temp_type (TREE_TYPE (t
), r
);
7566 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7567 allow_non_constant
, addr
,
7572 case NON_LVALUE_EXPR
:
7573 case TRY_CATCH_EXPR
:
7574 case CLEANUP_POINT_EXPR
:
7575 case MUST_NOT_THROW_EXPR
:
7577 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7578 allow_non_constant
, addr
,
7582 /* These differ from cxx_eval_unary_expression in that this doesn't
7583 check for a constant operand or result; an address can be
7584 constant without its operand being, and vice versa. */
7586 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
7592 tree oldop
= TREE_OPERAND (t
, 0);
7593 tree op
= cxx_eval_constant_expression (call
, oldop
,
7597 /* Don't VERIFY_CONSTANT here. */
7598 if (*non_constant_p
)
7600 /* This function does more aggressive folding than fold itself. */
7601 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
7602 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
7610 case FIX_TRUNC_EXPR
:
7615 case TRUTH_NOT_EXPR
:
7616 case FIXED_CONVERT_EXPR
:
7617 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
7623 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7624 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7625 introduced by build_call_a. */
7626 tree op0
= TREE_OPERAND (t
, 0);
7627 tree op1
= TREE_OPERAND (t
, 1);
7629 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7630 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7631 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7632 addr
, non_constant_p
);
7635 /* Check that the LHS is constant and then discard it. */
7636 cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7637 false, non_constant_p
);
7638 r
= cxx_eval_constant_expression (call
, op1
, allow_non_constant
,
7639 addr
, non_constant_p
);
7644 case POINTER_PLUS_EXPR
:
7648 case TRUNC_DIV_EXPR
:
7650 case FLOOR_DIV_EXPR
:
7651 case ROUND_DIV_EXPR
:
7652 case TRUNC_MOD_EXPR
:
7654 case ROUND_MOD_EXPR
:
7656 case EXACT_DIV_EXPR
:
7666 case TRUTH_XOR_EXPR
:
7673 case UNORDERED_EXPR
:
7682 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
7686 /* fold can introduce non-IF versions of these; still treat them as
7687 short-circuiting. */
7688 case TRUTH_AND_EXPR
:
7689 case TRUTH_ANDIF_EXPR
:
7690 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
7692 allow_non_constant
, addr
,
7697 case TRUTH_ORIF_EXPR
:
7698 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
7700 allow_non_constant
, addr
,
7705 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
7710 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
7715 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
7721 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
7726 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
7731 /* We can get this in a defaulted constructor for a class with a
7732 non-static data member of array type. Either the initializer will
7733 be NULL, meaning default-initialization, or it will be an lvalue
7734 or xvalue of the same type, meaning direct-initialization from the
7735 corresponding member. */
7736 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
7741 case VIEW_CONVERT_EXPR
:
7744 tree oldop
= TREE_OPERAND (t
, 0);
7746 tree to
= TREE_TYPE (t
);
7747 op
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7748 allow_non_constant
, addr
,
7750 if (*non_constant_p
)
7753 /* We didn't fold at the top so we could check for ptr-int
7756 r
= fold_build1 (TREE_CODE (t
), to
, op
);
7757 /* Conversion of an out-of-range value has implementation-defined
7758 behavior; the language considers it different from arithmetic
7759 overflow, which is undefined. */
7760 if (TREE_OVERFLOW_P (r
) && !TREE_OVERFLOW_P (op
))
7761 TREE_OVERFLOW (r
) = false;
7765 case EMPTY_CLASS_EXPR
:
7766 /* This is good enough for a function argument that might not get
7767 used, and they can't do anything with it, so just return it. */
7771 case PREINCREMENT_EXPR
:
7772 case POSTINCREMENT_EXPR
:
7773 case PREDECREMENT_EXPR
:
7774 case POSTDECREMENT_EXPR
:
7778 case VEC_DELETE_EXPR
:
7782 /* GCC internal stuff. */
7785 case WITH_CLEANUP_EXPR
:
7786 case STATEMENT_LIST
:
7788 case NON_DEPENDENT_EXPR
:
7792 if (!allow_non_constant
)
7793 error_at (EXPR_LOC_OR_HERE (t
),
7794 "expression %qE is not a constant-expression", t
);
7795 *non_constant_p
= true;
7799 internal_error ("unexpected expression %qE of kind %s", t
,
7800 tree_code_name
[TREE_CODE (t
)]);
7801 *non_constant_p
= true;
7805 if (r
== error_mark_node
)
7806 *non_constant_p
= true;
7808 if (*non_constant_p
)
7815 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
7817 bool non_constant_p
= false;
7818 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
7819 false, &non_constant_p
);
7821 verify_constant (r
, allow_non_constant
, &non_constant_p
);
7823 if (TREE_CODE (t
) != CONSTRUCTOR
7824 && cp_has_mutable_p (TREE_TYPE (t
)))
7826 /* We allow a mutable type if the original expression was a
7827 CONSTRUCTOR so that we can do aggregate initialization of
7828 constexpr variables. */
7829 if (!allow_non_constant
)
7830 error ("%qT cannot be the type of a complete constant expression "
7831 "because it has mutable sub-objects", TREE_TYPE (t
));
7832 non_constant_p
= true;
7835 /* Technically we should check this for all subexpressions, but that
7836 runs into problems with our internal representation of pointer
7837 subtraction and the 5.19 rules are still in flux. */
7838 if (CONVERT_EXPR_CODE_P (TREE_CODE (r
))
7839 && ARITHMETIC_TYPE_P (TREE_TYPE (r
))
7840 && TREE_CODE (TREE_OPERAND (r
, 0)) == ADDR_EXPR
)
7842 if (!allow_non_constant
)
7843 error ("conversion from pointer type %qT "
7844 "to arithmetic type %qT in a constant-expression",
7845 TREE_TYPE (TREE_OPERAND (r
, 0)), TREE_TYPE (r
));
7846 non_constant_p
= true;
7849 if (non_constant_p
&& !allow_non_constant
)
7850 return error_mark_node
;
7851 else if (non_constant_p
&& TREE_CONSTANT (t
))
7853 /* This isn't actually constant, so unset TREE_CONSTANT. */
7854 if (EXPR_P (t
) || TREE_CODE (t
) == CONSTRUCTOR
)
7857 r
= build_nop (TREE_TYPE (t
), t
);
7858 TREE_CONSTANT (r
) = false;
7861 else if (non_constant_p
|| r
== t
)
7863 else if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
7865 if (TREE_CODE (t
) == TARGET_EXPR
7866 && TARGET_EXPR_INITIAL (t
) == r
)
7870 r
= get_target_expr (r
);
7871 TREE_CONSTANT (r
) = true;
7879 /* Returns true if T is a valid subexpression of a constant expression,
7880 even if it isn't itself a constant expression. */
7883 is_sub_constant_expr (tree t
)
7885 bool non_constant_p
= false;
7886 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
);
7887 return !non_constant_p
;
7890 /* If T represents a constant expression returns its reduced value.
7891 Otherwise return error_mark_node. If T is dependent, then
7895 cxx_constant_value (tree t
)
7897 return cxx_eval_outermost_constant_expr (t
, false);
7900 /* If T is a constant expression, returns its reduced value.
7901 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7902 Otherwise, returns a version of T without TREE_CONSTANT. */
7905 maybe_constant_value (tree t
)
7909 if (type_dependent_expression_p (t
)
7910 || type_unknown_p (t
)
7911 || BRACE_ENCLOSED_INITIALIZER_P (t
)
7912 || !potential_constant_expression (t
)
7913 || value_dependent_expression_p (t
))
7915 if (TREE_OVERFLOW_P (t
))
7917 t
= build_nop (TREE_TYPE (t
), t
);
7918 TREE_CONSTANT (t
) = false;
7923 r
= cxx_eval_outermost_constant_expr (t
, true);
7924 #ifdef ENABLE_CHECKING
7925 /* cp_tree_equal looks through NOPs, so allow them. */
7927 || CONVERT_EXPR_P (t
)
7928 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
7929 || !cp_tree_equal (r
, t
));
7934 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7935 than wrapped in a TARGET_EXPR. */
7938 maybe_constant_init (tree t
)
7940 t
= maybe_constant_value (t
);
7941 if (TREE_CODE (t
) == TARGET_EXPR
)
7943 tree init
= TARGET_EXPR_INITIAL (t
);
7944 if (TREE_CODE (init
) == CONSTRUCTOR
7945 && TREE_CONSTANT (init
))
7952 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7953 /* Return true if the object referred to by REF has automatic or thread
7956 enum { ck_ok
, ck_bad
, ck_unknown
};
7958 check_automatic_or_tls (tree ref
)
7960 enum machine_mode mode
;
7961 HOST_WIDE_INT bitsize
, bitpos
;
7963 int volatilep
= 0, unsignedp
= 0;
7964 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
7965 &mode
, &unsignedp
, &volatilep
, false);
7968 /* If there isn't a decl in the middle, we don't know the linkage here,
7969 and this isn't a constant expression anyway. */
7972 dk
= decl_storage_duration (decl
);
7973 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
7977 /* Return true if T denotes a potentially constant expression. Issue
7978 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7979 an lvalue-rvalue conversion is implied.
7981 C++0x [expr.const] used to say
7983 6 An expression is a potential constant expression if it is
7984 a constant expression where all occurences of function
7985 parameters are replaced by arbitrary constant expressions
7986 of the appropriate type.
7988 2 A conditional expression is a constant expression unless it
7989 involves one of the following as a potentially evaluated
7990 subexpression (3.2), but subexpressions of logical AND (5.14),
7991 logical OR (5.15), and conditional (5.16) operations that are
7992 not evaluated are not considered. */
7995 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
7997 enum { any
= false, rval
= true };
8001 /* C++98 has different rules for the form of a constant expression that
8002 are enforced in the parser, so we can assume that anything that gets
8003 this far is suitable. */
8004 if (cxx_dialect
< cxx0x
)
8007 if (t
== error_mark_node
)
8011 if (TREE_THIS_VOLATILE (t
))
8013 if (flags
& tf_error
)
8014 error ("expression %qE has side-effects", t
);
8017 if (CONSTANT_CLASS_P (t
))
8019 if (TREE_OVERFLOW (t
))
8021 if (flags
& tf_error
)
8023 permerror (EXPR_LOC_OR_HERE (t
),
8024 "overflow in constant expression");
8025 if (flag_permissive
)
8033 switch (TREE_CODE (t
))
8039 case TEMPLATE_ID_EXPR
:
8046 case TEMPLATE_PARM_INDEX
:
8048 case IDENTIFIER_NODE
:
8049 case USERDEF_LITERAL
:
8050 /* We can see a FIELD_DECL in a pointer-to-member expression. */
8056 case AGGR_INIT_EXPR
:
8058 /* -- an invocation of a function other than a constexpr function
8059 or a constexpr constructor. */
8061 tree fun
= get_function_named_in_call (t
);
8062 const int nargs
= call_expr_nargs (t
);
8065 if (is_overloaded_fn (fun
))
8067 if (TREE_CODE (fun
) == FUNCTION_DECL
)
8069 if (builtin_valid_in_constant_expr_p (fun
))
8071 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
8072 /* Allow any built-in function; if the expansion
8073 isn't constant, we'll deal with that then. */
8074 && !is_builtin_fn (fun
))
8076 if (flags
& tf_error
)
8078 error_at (EXPR_LOC_OR_HERE (t
),
8079 "call to non-constexpr function %qD", fun
);
8080 explain_invalid_constexpr_fn (fun
);
8084 /* A call to a non-static member function takes the address
8085 of the object as the first argument. But in a constant
8086 expression the address will be folded away, so look
8088 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
8089 && !DECL_CONSTRUCTOR_P (fun
))
8091 tree x
= get_nth_callarg (t
, 0);
8092 if (is_this_parameter (x
))
8094 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8096 if (flags
& tf_error
)
8097 sorry ("calling a member function of the "
8098 "object being constructed in a constant "
8102 /* Otherwise OK. */;
8104 else if (!potential_constant_expression_1 (x
, rval
, flags
))
8110 fun
= get_first_fn (fun
);
8111 /* Skip initial arguments to base constructors. */
8112 if (DECL_BASE_CONSTRUCTOR_P (fun
))
8113 i
= num_artificial_parms_for (fun
);
8114 fun
= DECL_ORIGIN (fun
);
8118 if (potential_constant_expression_1 (fun
, rval
, flags
))
8119 /* Might end up being a constant function pointer. */;
8123 for (; i
< nargs
; ++i
)
8125 tree x
= get_nth_callarg (t
, i
);
8126 if (!potential_constant_expression_1 (x
, rval
, flags
))
8132 case NON_LVALUE_EXPR
:
8133 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
8134 -- an lvalue of integral type that refers to a non-volatile
8135 const variable or static data member initialized with
8136 constant expressions, or
8138 -- an lvalue of literal type that refers to non-volatile
8139 object defined with constexpr, or that refers to a
8140 sub-object of such an object; */
8141 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
8144 if (want_rval
&& !decl_constant_var_p (t
)
8145 && !dependent_type_p (TREE_TYPE (t
)))
8147 if (flags
& tf_error
)
8148 non_const_var_error (t
);
8155 case VIEW_CONVERT_EXPR
:
8156 /* -- a reinterpret_cast. FIXME not implemented, and this rule
8157 may change to something more specific to type-punning (DR 1312). */
8159 tree from
= TREE_OPERAND (t
, 0);
8160 return (potential_constant_expression_1
8161 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
8165 /* -- a unary operator & that is applied to an lvalue that
8166 designates an object with thread or automatic storage
8168 t
= TREE_OPERAND (t
, 0);
8170 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8171 any checking here, as we might dereference the pointer later. If
8172 we remove this code, also remove check_automatic_or_tls. */
8173 i
= check_automatic_or_tls (t
);
8178 if (flags
& tf_error
)
8179 error ("address-of an object %qE with thread local or "
8180 "automatic storage is not a constant expression", t
);
8184 return potential_constant_expression_1 (t
, any
, flags
);
8190 /* -- a class member access unless its postfix-expression is
8191 of literal type or of pointer to literal type. */
8192 /* This test would be redundant, as it follows from the
8193 postfix-expression being a potential constant expression. */
8194 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8197 case EXPR_PACK_EXPANSION
:
8198 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
8203 tree x
= TREE_OPERAND (t
, 0);
8205 if (is_this_parameter (x
))
8207 if (want_rval
&& DECL_CONTEXT (x
)
8208 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8210 if (flags
& tf_error
)
8211 sorry ("use of the value of the object being constructed "
8212 "in a constant expression");
8217 return potential_constant_expression_1 (x
, rval
, flags
);
8221 case DYNAMIC_CAST_EXPR
:
8222 case PSEUDO_DTOR_EXPR
:
8223 case PREINCREMENT_EXPR
:
8224 case POSTINCREMENT_EXPR
:
8225 case PREDECREMENT_EXPR
:
8226 case POSTDECREMENT_EXPR
:
8230 case VEC_DELETE_EXPR
:
8234 /* GCC internal stuff. */
8237 case WITH_CLEANUP_EXPR
:
8238 case CLEANUP_POINT_EXPR
:
8239 case MUST_NOT_THROW_EXPR
:
8240 case TRY_CATCH_EXPR
:
8241 case STATEMENT_LIST
:
8242 /* Don't bother trying to define a subset of statement-expressions to
8243 be constant-expressions, at least for now. */
8247 case TRANSACTION_EXPR
:
8252 if (flags
& tf_error
)
8253 error ("expression %qE is not a constant-expression", t
);
8257 /* -- a typeid expression whose operand is of polymorphic
8260 tree e
= TREE_OPERAND (t
, 0);
8261 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
8262 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
8264 if (flags
& tf_error
)
8265 error ("typeid-expression is not a constant expression "
8266 "because %qE is of polymorphic type", e
);
8273 /* -- a subtraction where both operands are pointers. */
8274 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8275 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8277 if (flags
& tf_error
)
8278 error ("difference of two pointer expressions is not "
8279 "a constant expression");
8291 /* -- a relational or equality operator where at least
8292 one of the operands is a pointer. */
8293 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8294 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8296 if (flags
& tf_error
)
8297 error ("pointer comparison expression is not a "
8298 "constant expression");
8306 if (TYPE_P (TREE_OPERAND (t
, 0)))
8308 /* else fall through. */
8314 case FIX_TRUNC_EXPR
:
8318 case TRUTH_NOT_EXPR
:
8319 case FIXED_CONVERT_EXPR
:
8320 case UNARY_PLUS_EXPR
:
8321 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
8325 case CONST_CAST_EXPR
:
8326 case STATIC_CAST_EXPR
:
8327 case REINTERPRET_CAST_EXPR
:
8328 case IMPLICIT_CONV_EXPR
:
8329 return (potential_constant_expression_1
8330 (TREE_OPERAND (t
, 0),
8331 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
8334 case NON_DEPENDENT_EXPR
:
8335 /* For convenience. */
8337 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8341 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8345 if (!literal_type_p (TREE_TYPE (t
)))
8347 if (flags
& tf_error
)
8349 error ("temporary of non-literal type %qT in a "
8350 "constant expression", TREE_TYPE (t
));
8351 explain_non_literal_class (TREE_TYPE (t
));
8356 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8361 VEC(constructor_elt
, gc
) *v
= CONSTRUCTOR_ELTS (t
);
8362 constructor_elt
*ce
;
8363 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
8364 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
8371 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8372 || DECL_P (TREE_PURPOSE (t
)));
8373 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
8376 if (TREE_CHAIN (t
) == NULL_TREE
)
8378 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
8382 case TRUNC_DIV_EXPR
:
8384 case FLOOR_DIV_EXPR
:
8385 case ROUND_DIV_EXPR
:
8386 case TRUNC_MOD_EXPR
:
8388 case ROUND_MOD_EXPR
:
8390 tree denom
= TREE_OPERAND (t
, 1);
8391 /* We can't call maybe_constant_value on an expression
8392 that hasn't been through fold_non_dependent_expr yet. */
8393 if (!processing_template_decl
)
8394 denom
= maybe_constant_value (denom
);
8395 if (integer_zerop (denom
))
8397 if (flags
& tf_error
)
8398 error ("division by zero is not a constant-expression");
8410 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8411 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8412 introduced by build_call_a. */
8413 tree op0
= TREE_OPERAND (t
, 0);
8414 tree op1
= TREE_OPERAND (t
, 1);
8416 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
8417 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
8418 return potential_constant_expression_1 (op0
, want_rval
, flags
);
8423 /* If the first operand is the non-short-circuit constant, look at
8424 the second operand; otherwise we only care about the first one for
8426 case TRUTH_AND_EXPR
:
8427 case TRUTH_ANDIF_EXPR
:
8428 tmp
= boolean_true_node
;
8431 case TRUTH_ORIF_EXPR
:
8432 tmp
= boolean_false_node
;
8434 if (TREE_OPERAND (t
, 0) == tmp
)
8435 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
8437 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
8441 case POINTER_PLUS_EXPR
:
8443 case EXACT_DIV_EXPR
:
8453 case TRUTH_XOR_EXPR
:
8454 case UNORDERED_EXPR
:
8466 case ARRAY_RANGE_REF
:
8470 for (i
= 0; i
< 2; ++i
)
8471 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8477 for (i
= 0; i
< 3; ++i
)
8478 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8485 /* If the condition is a known constant, we know which of the legs we
8486 care about; otherwise we only require that the condition and
8487 either of the legs be potentially constant. */
8488 tmp
= TREE_OPERAND (t
, 0);
8489 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
8491 else if (integer_zerop (tmp
))
8492 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
8494 else if (TREE_CODE (tmp
) == INTEGER_CST
)
8495 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8497 for (i
= 1; i
< 3; ++i
)
8498 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8499 want_rval
, tf_none
))
8501 if (flags
& tf_error
)
8502 error ("expression %qE is not a constant-expression", t
);
8506 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
8508 if (flags
& tf_error
)
8510 error ("non-constant array initialization");
8511 diagnose_non_constexpr_vec_init (t
);
8516 sorry ("unexpected AST of kind %s", tree_code_name
[TREE_CODE (t
)]);
8522 /* The main entry point to the above. */
8525 potential_constant_expression (tree t
)
8527 return potential_constant_expression_1 (t
, false, tf_none
);
8530 /* As above, but require a constant rvalue. */
8533 potential_rvalue_constant_expression (tree t
)
8535 return potential_constant_expression_1 (t
, true, tf_none
);
8538 /* Like above, but complain about non-constant expressions. */
8541 require_potential_constant_expression (tree t
)
8543 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
8546 /* Cross product of the above. */
8549 require_potential_rvalue_constant_expression (tree t
)
8551 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
8554 /* Constructor for a lambda expression. */
8557 build_lambda_expr (void)
8559 tree lambda
= make_node (LAMBDA_EXPR
);
8560 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
8561 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
8562 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
8563 LAMBDA_EXPR_PENDING_PROXIES (lambda
) = NULL
;
8564 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
8565 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
8569 /* Create the closure object for a LAMBDA_EXPR. */
8572 build_lambda_object (tree lambda_expr
)
8574 /* Build aggregate constructor call.
8575 - cp_parser_braced_list
8576 - cp_parser_functional_cast */
8577 VEC(constructor_elt
,gc
) *elts
= NULL
;
8578 tree node
, expr
, type
;
8579 location_t saved_loc
;
8581 if (processing_template_decl
)
8584 /* Make sure any error messages refer to the lambda-introducer. */
8585 saved_loc
= input_location
;
8586 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
8588 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
8590 node
= TREE_CHAIN (node
))
8592 tree field
= TREE_PURPOSE (node
);
8593 tree val
= TREE_VALUE (node
);
8595 if (field
== error_mark_node
)
8597 expr
= error_mark_node
;
8604 /* Mere mortals can't copy arrays with aggregate initialization, so
8605 do some magic to make it work here. */
8606 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
8607 val
= build_array_copy (val
);
8608 else if (DECL_NORMAL_CAPTURE_P (field
)
8609 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
8611 /* "the entities that are captured by copy are used to
8612 direct-initialize each corresponding non-static data
8613 member of the resulting closure object."
8615 There's normally no way to express direct-initialization
8616 from an element of a CONSTRUCTOR, so we build up a special
8617 TARGET_EXPR to bypass the usual copy-initialization. */
8618 val
= force_rvalue (val
, tf_warning_or_error
);
8619 if (TREE_CODE (val
) == TARGET_EXPR
)
8620 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
8623 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
8626 expr
= build_constructor (init_list_type_node
, elts
);
8627 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
8629 /* N2927: "[The closure] class type is not an aggregate."
8630 But we briefly treat it as an aggregate to make this simpler. */
8631 type
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
8632 CLASSTYPE_NON_AGGREGATE (type
) = 0;
8633 expr
= finish_compound_literal (type
, expr
, tf_warning_or_error
);
8634 CLASSTYPE_NON_AGGREGATE (type
) = 1;
8637 input_location
= saved_loc
;
8641 /* Return an initialized RECORD_TYPE for LAMBDA.
8642 LAMBDA must have its explicit captures already. */
8645 begin_lambda_type (tree lambda
)
8650 /* Unique name. This is just like an unnamed class, but we cannot use
8651 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8653 name
= make_lambda_name ();
8655 /* Create the new RECORD_TYPE for this lambda. */
8656 type
= xref_tag (/*tag_code=*/record_type
,
8658 /*scope=*/ts_within_enclosing_non_class
,
8659 /*template_header_p=*/false);
8662 /* Designate it as a struct so that we can use aggregate initialization. */
8663 CLASSTYPE_DECLARED_CLASS (type
) = false;
8665 /* Clear base types. */
8666 xref_basetypes (type
, /*bases=*/NULL_TREE
);
8668 /* Start the class. */
8669 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
8670 if (type
== error_mark_node
)
8671 return error_mark_node
;
8673 /* Cross-reference the expression and the type. */
8674 LAMBDA_EXPR_CLOSURE (lambda
) = type
;
8675 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
8680 /* Returns the type to use for the return type of the operator() of a
8684 lambda_return_type (tree expr
)
8687 if (type_unknown_p (expr
)
8688 || BRACE_ENCLOSED_INITIALIZER_P (expr
))
8690 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
8691 return void_type_node
;
8693 if (type_dependent_expression_p (expr
))
8694 type
= dependent_lambda_return_type_node
;
8696 type
= cv_unqualified (type_decays_to (unlowered_expr_type (expr
)));
8700 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8704 lambda_function (tree lambda
)
8707 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
8708 type
= LAMBDA_EXPR_CLOSURE (lambda
);
8711 gcc_assert (LAMBDA_TYPE_P (type
));
8712 /* Don't let debug_tree cause instantiation. */
8713 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
8714 && !COMPLETE_OR_OPEN_TYPE_P (type
))
8716 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
8717 /*protect=*/0, /*want_type=*/false,
8718 tf_warning_or_error
);
8720 lambda
= BASELINK_FUNCTIONS (lambda
);
8724 /* Returns the type to use for the FIELD_DECL corresponding to the
8726 The caller should add REFERENCE_TYPE for capture by reference. */
8729 lambda_capture_field_type (tree expr
)
8732 if (type_dependent_expression_p (expr
))
8734 type
= cxx_make_type (DECLTYPE_TYPE
);
8735 DECLTYPE_TYPE_EXPR (type
) = expr
;
8736 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
8737 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8740 type
= non_reference (unlowered_expr_type (expr
));
8744 /* Recompute the return type for LAMBDA with body of the form:
8745 { return EXPR ; } */
8748 apply_lambda_return_type (tree lambda
, tree return_type
)
8750 tree fco
= lambda_function (lambda
);
8753 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
8755 if (return_type
== error_mark_node
)
8757 if (TREE_TYPE (TREE_TYPE (fco
)) == return_type
)
8760 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8761 TREE_TYPE (METHOD_TYPE) == return-type */
8762 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
8764 result
= DECL_RESULT (fco
);
8765 if (result
== NULL_TREE
)
8768 /* We already have a DECL_RESULT from start_preparsed_function.
8769 Now we need to redo the work it and allocate_struct_function
8770 did to reflect the new type. */
8771 gcc_assert (current_function_decl
== fco
);
8772 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
8773 TYPE_MAIN_VARIANT (return_type
));
8774 DECL_ARTIFICIAL (result
) = 1;
8775 DECL_IGNORED_P (result
) = 1;
8776 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
8779 DECL_RESULT (fco
) = result
;
8781 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
8783 #ifdef PCC_STATIC_STRUCT_RETURN
8784 cfun
->returns_pcc_struct
= 1;
8786 cfun
->returns_struct
= 1;
8791 /* DECL is a local variable or parameter from the surrounding scope of a
8792 lambda-expression. Returns the decltype for a use of the capture field
8793 for DECL even if it hasn't been captured yet. */
8796 capture_decltype (tree decl
)
8798 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8799 /* FIXME do lookup instead of list walk? */
8800 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
8804 type
= TREE_TYPE (TREE_PURPOSE (cap
));
8806 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
8809 error ("%qD is not captured", decl
);
8810 return error_mark_node
;
8813 type
= TREE_TYPE (decl
);
8814 if (TREE_CODE (type
) == REFERENCE_TYPE
8815 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
8816 type
= TREE_TYPE (type
);
8819 case CPLD_REFERENCE
:
8820 type
= TREE_TYPE (decl
);
8821 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8822 type
= build_reference_type (TREE_TYPE (decl
));
8829 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8831 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
8832 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
8834 type
= build_reference_type (type
);
8839 /* Returns true iff DECL is a lambda capture proxy variable created by
8840 build_capture_proxy. */
8843 is_capture_proxy (tree decl
)
8845 return (TREE_CODE (decl
) == VAR_DECL
8846 && DECL_HAS_VALUE_EXPR_P (decl
)
8847 && !DECL_ANON_UNION_VAR_P (decl
)
8848 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl
)));
8851 /* Returns true iff DECL is a capture proxy for a normal capture
8852 (i.e. without explicit initializer). */
8855 is_normal_capture_proxy (tree decl
)
8859 if (!is_capture_proxy (decl
))
8860 /* It's not a capture proxy. */
8863 /* It is a capture proxy, is it a normal capture? */
8864 val
= DECL_VALUE_EXPR (decl
);
8865 gcc_assert (TREE_CODE (val
) == COMPONENT_REF
);
8866 val
= TREE_OPERAND (val
, 1);
8867 return DECL_NORMAL_CAPTURE_P (val
);
8870 /* VAR is a capture proxy created by build_capture_proxy; add it to the
8871 current function, which is the operator() for the appropriate lambda. */
8874 insert_capture_proxy (tree var
)
8876 cp_binding_level
*b
;
8880 /* Put the capture proxy in the extra body block so that it won't clash
8881 with a later local variable. */
8882 b
= current_binding_level
;
8883 for (skip
= 0; ; ++skip
)
8885 cp_binding_level
*n
= b
->level_chain
;
8886 if (n
->kind
== sk_function_parms
)
8890 pushdecl_with_scope (var
, b
, false);
8892 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
8893 var
= build_stmt (DECL_SOURCE_LOCATION (var
), DECL_EXPR
, var
);
8894 stmt_list
= VEC_index (tree
, stmt_list_stack
,
8895 VEC_length (tree
, stmt_list_stack
) - 1 - skip
);
8896 gcc_assert (stmt_list
);
8897 append_to_statement_list_force (var
, &stmt_list
);
8900 /* We've just finished processing a lambda; if the containing scope is also
8901 a lambda, insert any capture proxies that were created while processing
8902 the nested lambda. */
8905 insert_pending_capture_proxies (void)
8908 VEC(tree
,gc
) *proxies
;
8911 if (!current_function_decl
|| !LAMBDA_FUNCTION_P (current_function_decl
))
8914 lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8915 proxies
= LAMBDA_EXPR_PENDING_PROXIES (lam
);
8916 for (i
= 0; i
< VEC_length (tree
, proxies
); ++i
)
8918 tree var
= VEC_index (tree
, proxies
, i
);
8919 insert_capture_proxy (var
);
8921 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam
));
8922 LAMBDA_EXPR_PENDING_PROXIES (lam
) = NULL
;
8925 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
8926 return the type we want the proxy to have: the type of the field itself,
8927 with added const-qualification if the lambda isn't mutable and the
8928 capture is by value. */
8931 lambda_proxy_type (tree ref
)
8934 if (REFERENCE_REF_P (ref
))
8935 ref
= TREE_OPERAND (ref
, 0);
8936 type
= TREE_TYPE (ref
);
8937 if (!dependent_type_p (type
))
8939 type
= cxx_make_type (DECLTYPE_TYPE
);
8940 DECLTYPE_TYPE_EXPR (type
) = ref
;
8941 DECLTYPE_FOR_LAMBDA_PROXY (type
) = true;
8942 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8946 /* MEMBER is a capture field in a lambda closure class. Now that we're
8947 inside the operator(), build a placeholder var for future lookups and
8951 build_capture_proxy (tree member
)
8953 tree var
, object
, fn
, closure
, name
, lam
, type
;
8955 closure
= DECL_CONTEXT (member
);
8956 fn
= lambda_function (closure
);
8957 lam
= CLASSTYPE_LAMBDA_EXPR (closure
);
8959 /* The proxy variable forwards to the capture field. */
8960 object
= build_fold_indirect_ref (DECL_ARGUMENTS (fn
));
8961 object
= finish_non_static_data_member (member
, object
, NULL_TREE
);
8962 if (REFERENCE_REF_P (object
))
8963 object
= TREE_OPERAND (object
, 0);
8965 /* Remove the __ inserted by add_capture. */
8966 name
= get_identifier (IDENTIFIER_POINTER (DECL_NAME (member
)) + 2);
8968 type
= lambda_proxy_type (object
);
8969 var
= build_decl (input_location
, VAR_DECL
, name
, type
);
8970 SET_DECL_VALUE_EXPR (var
, object
);
8971 DECL_HAS_VALUE_EXPR_P (var
) = 1;
8972 DECL_ARTIFICIAL (var
) = 1;
8973 TREE_USED (var
) = 1;
8974 DECL_CONTEXT (var
) = fn
;
8976 if (name
== this_identifier
)
8978 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam
) == member
);
8979 LAMBDA_EXPR_THIS_CAPTURE (lam
) = var
;
8982 if (fn
== current_function_decl
)
8983 insert_capture_proxy (var
);
8985 VEC_safe_push (tree
, gc
, LAMBDA_EXPR_PENDING_PROXIES (lam
), var
);
8990 /* From an ID and INITIALIZER, create a capture (by reference if
8991 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8995 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
8996 bool explicit_init_p
)
8999 tree type
, member
, name
;
9001 type
= lambda_capture_field_type (initializer
);
9004 type
= build_reference_type (type
);
9005 if (!real_lvalue_p (initializer
))
9006 error ("cannot capture %qE by reference", initializer
);
9009 /* Capture by copy requires a complete type. */
9010 type
= complete_type (type
);
9012 /* Add __ to the beginning of the field name so that user code
9013 won't find the field with name lookup. We can't just leave the name
9014 unset because template instantiation uses the name to find
9015 instantiated fields. */
9016 buf
= (char *) alloca (IDENTIFIER_LENGTH (id
) + 3);
9017 buf
[1] = buf
[0] = '_';
9018 memcpy (buf
+ 2, IDENTIFIER_POINTER (id
),
9019 IDENTIFIER_LENGTH (id
) + 1);
9020 name
= get_identifier (buf
);
9022 /* If TREE_TYPE isn't set, we're still in the introducer, so check
9024 if (!LAMBDA_EXPR_CLOSURE (lambda
))
9026 if (IDENTIFIER_MARKED (name
))
9028 pedwarn (input_location
, 0,
9029 "already captured %qD in lambda expression", id
);
9032 IDENTIFIER_MARKED (name
) = true;
9035 /* Make member variable. */
9036 member
= build_lang_decl (FIELD_DECL
, name
, type
);
9038 if (!explicit_init_p
)
9039 /* Normal captures are invisible to name lookup but uses are replaced
9040 with references to the capture field; we implement this by only
9041 really making them invisible in unevaluated context; see
9042 qualify_lookup. For now, let's make explicitly initialized captures
9044 DECL_NORMAL_CAPTURE_P (member
) = true;
9046 if (id
== this_identifier
)
9047 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
9049 /* Add it to the appropriate closure class if we've started it. */
9050 if (current_class_type
9051 && current_class_type
== LAMBDA_EXPR_CLOSURE (lambda
))
9052 finish_member_declaration (member
);
9054 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
9055 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
9057 if (LAMBDA_EXPR_CLOSURE (lambda
))
9058 return build_capture_proxy (member
);
9059 /* For explicit captures we haven't started the function yet, so we wait
9060 and build the proxy from cp_parser_lambda_body. */
9064 /* Register all the capture members on the list CAPTURES, which is the
9065 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
9068 register_capture_members (tree captures
)
9070 if (captures
== NULL_TREE
)
9073 register_capture_members (TREE_CHAIN (captures
));
9074 /* We set this in add_capture to avoid duplicates. */
9075 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures
))) = false;
9076 finish_member_declaration (TREE_PURPOSE (captures
));
9079 /* Similar to add_capture, except this works on a stack of nested lambdas.
9080 BY_REFERENCE_P in this case is derived from the default capture mode.
9081 Returns the capture for the lambda at the bottom of the stack. */
9084 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
9086 bool this_capture_p
= (id
== this_identifier
);
9088 tree var
= NULL_TREE
;
9090 tree saved_class_type
= current_class_type
;
9094 for (node
= lambda_stack
;
9096 node
= TREE_CHAIN (node
))
9098 tree lambda
= TREE_VALUE (node
);
9100 current_class_type
= LAMBDA_EXPR_CLOSURE (lambda
);
9101 var
= add_capture (lambda
,
9106 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
9107 == CPLD_REFERENCE
)),
9108 /*explicit_init_p=*/false);
9109 initializer
= convert_from_reference (var
);
9112 current_class_type
= saved_class_type
;
9117 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
9118 INDIRECT_REF, possibly adding it through default capturing. */
9121 lambda_expr_this_capture (tree lambda
)
9125 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
9127 /* Try to default capture 'this' if we can. */
9129 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
9131 tree containing_function
= TYPE_CONTEXT (LAMBDA_EXPR_CLOSURE (lambda
));
9132 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
9133 tree init
= NULL_TREE
;
9135 /* If we are in a lambda function, we can move out until we hit:
9136 1. a non-lambda function,
9137 2. a lambda function capturing 'this', or
9138 3. a non-default capturing lambda function. */
9139 while (LAMBDA_FUNCTION_P (containing_function
))
9142 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
9144 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
9146 /* An outer lambda has already captured 'this'. */
9147 init
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
9151 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
9152 /* An outer lambda won't let us capture 'this'. */
9155 lambda_stack
= tree_cons (NULL_TREE
,
9159 containing_function
= decl_function_context (containing_function
);
9162 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
9163 && !LAMBDA_FUNCTION_P (containing_function
))
9164 /* First parameter is 'this'. */
9165 init
= DECL_ARGUMENTS (containing_function
);
9168 this_capture
= add_default_capture (lambda_stack
,
9169 /*id=*/this_identifier
,
9175 error ("%<this%> was not captured for this lambda function");
9176 result
= error_mark_node
;
9180 /* To make sure that current_class_ref is for the lambda. */
9181 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
))
9182 == LAMBDA_EXPR_CLOSURE (lambda
));
9184 result
= this_capture
;
9186 /* If 'this' is captured, each use of 'this' is transformed into an
9187 access to the corresponding unnamed data member of the closure
9188 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9189 ensures that the transformed expression is an rvalue. ] */
9190 result
= rvalue (result
);
9196 /* Returns the method basetype of the innermost non-lambda function, or
9197 NULL_TREE if none. */
9200 nonlambda_method_basetype (void)
9203 if (!current_class_ref
)
9206 type
= current_class_type
;
9207 if (!LAMBDA_TYPE_P (type
))
9210 /* Find the nearest enclosing non-lambda function. */
9211 fn
= TYPE_NAME (type
);
9213 fn
= decl_function_context (fn
);
9214 while (fn
&& LAMBDA_FUNCTION_P (fn
));
9216 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
9219 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
9222 /* If the closure TYPE has a static op(), also add a conversion to function
9226 maybe_add_lambda_conv_op (tree type
)
9228 bool nested
= (current_function_decl
!= NULL_TREE
);
9229 tree callop
= lambda_function (type
);
9230 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
9231 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
9232 VEC (tree
, gc
) *argvec
;
9234 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
9237 if (processing_template_decl
)
9240 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
9241 FUNCTION_ARG_CHAIN (callop
));
9243 /* First build up the conversion op. */
9245 rettype
= build_pointer_type (stattype
);
9246 name
= mangle_conv_op_name_for_type (rettype
);
9247 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
9248 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
9249 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
9250 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9252 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9253 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9254 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9256 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
9257 grokclassfn (type
, fn
, NO_SPECIAL
);
9258 set_linkage_according_to_type (type
, fn
);
9259 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9260 DECL_IN_AGGR_P (fn
) = 1;
9261 DECL_ARTIFICIAL (fn
) = 1;
9262 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9263 DECL_DECLARED_INLINE_P (fn
) = 1;
9264 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
9266 DECL_INTERFACE_KNOWN (fn
) = 1;
9268 add_method (type
, fn
, NULL_TREE
);
9270 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9271 the conversion op is used. */
9272 if (varargs_function_p (callop
))
9274 DECL_DELETED_FN (fn
) = 1;
9278 /* Now build up the thunk to be returned. */
9280 name
= get_identifier ("_FUN");
9281 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
9282 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9283 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9284 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9285 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9286 grokclassfn (type
, fn
, NO_SPECIAL
);
9287 set_linkage_according_to_type (type
, fn
);
9288 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9289 DECL_IN_AGGR_P (fn
) = 1;
9290 DECL_ARTIFICIAL (fn
) = 1;
9291 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9292 DECL_DECLARED_INLINE_P (fn
) = 1;
9293 DECL_STATIC_FUNCTION_P (fn
) = 1;
9294 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
9295 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
9296 DECL_CONTEXT (arg
) = fn
;
9298 DECL_INTERFACE_KNOWN (fn
) = 1;
9300 add_method (type
, fn
, NULL_TREE
);
9303 push_function_context ();
9305 /* Still increment function_depth so that we don't GC in the
9306 middle of an expression. */
9309 /* Generate the body of the thunk. */
9311 start_preparsed_function (statfn
, NULL_TREE
,
9312 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9313 if (DECL_ONE_ONLY (statfn
))
9315 /* Put the thunk in the same comdat group as the call op. */
9316 cgraph_add_to_same_comdat_group (cgraph_get_create_node (statfn
),
9317 cgraph_get_create_node (callop
));
9319 body
= begin_function_body ();
9320 compound_stmt
= begin_compound_stmt (0);
9322 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
9324 argvec
= make_tree_vector ();
9325 VEC_quick_push (tree
, argvec
, arg
);
9326 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
9328 mark_exp_read (arg
);
9329 VEC_safe_push (tree
, gc
, argvec
, arg
);
9331 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
9332 VEC_address (tree
, argvec
));
9333 CALL_FROM_THUNK_P (call
) = 1;
9334 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
9335 call
= build_cplus_new (TREE_TYPE (call
), call
, tf_warning_or_error
);
9336 call
= convert_from_reference (call
);
9337 finish_return_stmt (call
);
9339 finish_compound_stmt (compound_stmt
);
9340 finish_function_body (body
);
9342 expand_or_defer_fn (finish_function (2));
9344 /* Generate the body of the conversion op. */
9346 start_preparsed_function (convfn
, NULL_TREE
,
9347 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9348 body
= begin_function_body ();
9349 compound_stmt
= begin_compound_stmt (0);
9351 finish_return_stmt (decay_conversion (statfn
));
9353 finish_compound_stmt (compound_stmt
);
9354 finish_function_body (body
);
9356 expand_or_defer_fn (finish_function (2));
9359 pop_function_context ();
9364 /* Returns true iff VAL is a lambda-related declaration which should
9365 be ignored by unqualified lookup. */
9368 is_lambda_ignored_entity (tree val
)
9370 /* In unevaluated context, look past normal capture proxies. */
9371 if (cp_unevaluated_operand
&& is_normal_capture_proxy (val
))
9374 /* Always ignore lambda fields, their names are only for debugging. */
9375 if (TREE_CODE (val
) == FIELD_DECL
9376 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val
)))
9379 /* None of the lookups that use qualify_lookup want the op() from the
9380 lambda; they want the one from the enclosing class. */
9381 if (TREE_CODE (val
) == FUNCTION_DECL
&& LAMBDA_FUNCTION_P (val
))
9387 #include "gt-cp-semantics.h"