1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
34 #include "c-family/c-objc.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
41 #include "diagnostic.h"
43 #include "tree-iterator.h"
49 /* There routines provide a modular interface to perform many parsing
50 operations. They may therefore be used during actual parsing, or
51 during template instantiation, which may be regarded as a
52 degenerate form of parsing. */
54 static tree
maybe_convert_cond (tree
);
55 static tree
finalize_nrv_r (tree
*, int *, void *);
56 static tree
capture_decltype (tree
);
57 static tree
thisify_lambda_field (tree
);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct GTY(()) deferred_access
{
112 /* A VEC representing name-lookups for which we have deferred
113 checking access controls. We cannot check the accessibility of
114 names used in a decl-specifier-seq until we know what is being
115 declared because code like:
122 A::B* A::f() { return 0; }
124 is valid, even though `A::B' is not generally accessible. */
125 VEC (deferred_access_check
,gc
)* GTY(()) deferred_access_checks
;
127 /* The current mode of access checks. */
128 enum deferring_kind deferring_access_checks_kind
;
131 DEF_VEC_O (deferred_access
);
132 DEF_VEC_ALLOC_O (deferred_access
,gc
);
134 /* Data for deferred access checking. */
135 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
136 static GTY(()) unsigned deferred_access_no_check
;
138 /* Save the current deferred access states and start deferred
139 access checking iff DEFER_P is true. */
142 push_deferring_access_checks (deferring_kind deferring
)
144 /* For context like template instantiation, access checking
145 disabling applies to all nested context. */
146 if (deferred_access_no_check
|| deferring
== dk_no_check
)
147 deferred_access_no_check
++;
150 deferred_access
*ptr
;
152 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
153 ptr
->deferred_access_checks
= NULL
;
154 ptr
->deferring_access_checks_kind
= deferring
;
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check
)
165 VEC_last (deferred_access
, deferred_access_stack
)
166 ->deferring_access_checks_kind
= dk_deferred
;
169 /* Stop deferring access checks. */
172 stop_deferring_access_checks (void)
174 if (!deferred_access_no_check
)
175 VEC_last (deferred_access
, deferred_access_stack
)
176 ->deferring_access_checks_kind
= dk_no_deferred
;
179 /* Discard the current deferred access checks and restore the
183 pop_deferring_access_checks (void)
185 if (deferred_access_no_check
)
186 deferred_access_no_check
--;
188 VEC_pop (deferred_access
, deferred_access_stack
);
191 /* Returns a TREE_LIST representing the deferred checks.
192 The TREE_PURPOSE of each node is the type through which the
193 access occurred; the TREE_VALUE is the declaration named.
196 VEC (deferred_access_check
,gc
)*
197 get_deferred_access_checks (void)
199 if (deferred_access_no_check
)
202 return (VEC_last (deferred_access
, deferred_access_stack
)
203 ->deferred_access_checks
);
206 /* Take current deferred checks and combine with the
207 previous states if we also defer checks previously.
208 Otherwise perform checks now. */
211 pop_to_parent_deferring_access_checks (void)
213 if (deferred_access_no_check
)
214 deferred_access_no_check
--;
217 VEC (deferred_access_check
,gc
) *checks
;
218 deferred_access
*ptr
;
220 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
221 ->deferred_access_checks
);
223 VEC_pop (deferred_access
, deferred_access_stack
);
224 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
225 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
228 perform_access_checks (checks
);
232 /* Merge with parent. */
234 deferred_access_check
*chk
, *probe
;
236 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
238 FOR_EACH_VEC_ELT (deferred_access_check
,
239 ptr
->deferred_access_checks
, j
, probe
)
241 if (probe
->binfo
== chk
->binfo
&&
242 probe
->decl
== chk
->decl
&&
243 probe
->diag_decl
== chk
->diag_decl
)
246 /* Insert into parent's checks. */
247 VEC_safe_push (deferred_access_check
, gc
,
248 ptr
->deferred_access_checks
, chk
);
255 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
256 is the BINFO indicating the qualifying scope used to access the
257 DECL node stored in the TREE_VALUE of the node. */
260 perform_access_checks (VEC (deferred_access_check
,gc
)* checks
)
263 deferred_access_check
*chk
;
268 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
269 enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
);
272 /* Perform the deferred access checks.
274 After performing the checks, we still have to keep the list
275 `deferred_access_stack->deferred_access_checks' since we may want
276 to check access for them again later in a different context.
283 A::X A::a, x; // No error for `A::a', error for `x'
285 We have to perform deferred access of `A::X', first with `A::a',
289 perform_deferred_access_checks (void)
291 perform_access_checks (get_deferred_access_checks ());
294 /* Defer checking the accessibility of DECL, when looked up in
295 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
298 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
)
301 deferred_access
*ptr
;
302 deferred_access_check
*chk
;
303 deferred_access_check
*new_access
;
306 /* Exit if we are in a context that no access checking is performed.
308 if (deferred_access_no_check
)
311 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
313 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
315 /* If we are not supposed to defer access checks, just check now. */
316 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
318 enforce_access (binfo
, decl
, diag_decl
);
322 /* See if we are already going to perform this check. */
323 FOR_EACH_VEC_ELT (deferred_access_check
,
324 ptr
->deferred_access_checks
, i
, chk
)
326 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
327 chk
->diag_decl
== diag_decl
)
332 /* If not, record the check. */
334 VEC_safe_push (deferred_access_check
, gc
,
335 ptr
->deferred_access_checks
, 0);
336 new_access
->binfo
= binfo
;
337 new_access
->decl
= decl
;
338 new_access
->diag_decl
= diag_decl
;
341 /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL
342 is accessible in BINFO, and possibly complain if not. If we're not
343 checking access, everything is accessible. */
346 speculative_access_check (tree binfo
, tree decl
, tree diag_decl
,
349 if (deferred_access_no_check
)
352 /* If we're checking for implicit delete, we don't want access
354 if (!accessible_p (binfo
, decl
, true))
356 /* Unless we're under maybe_explain_implicit_delete. */
358 enforce_access (binfo
, decl
, diag_decl
);
365 /* Returns nonzero if the current statement is a full expression,
366 i.e. temporaries created during that statement should be destroyed
367 at the end of the statement. */
370 stmts_are_full_exprs_p (void)
372 return current_stmt_tree ()->stmts_are_full_exprs_p
;
375 /* T is a statement. Add it to the statement-tree. This is the C++
376 version. The C/ObjC frontends have a slightly different version of
382 enum tree_code code
= TREE_CODE (t
);
384 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
386 if (!EXPR_HAS_LOCATION (t
))
387 SET_EXPR_LOCATION (t
, input_location
);
389 /* When we expand a statement-tree, we must know whether or not the
390 statements are full-expressions. We record that fact here. */
391 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
394 /* Add T to the statement-tree. Non-side-effect statements need to be
395 recorded during statement expressions. */
396 append_to_statement_list_force (t
, &cur_stmt_list
);
401 /* Returns the stmt_tree to which statements are currently being added. */
404 current_stmt_tree (void)
407 ? &cfun
->language
->base
.x_stmt_tree
408 : &scope_chain
->x_stmt_tree
);
411 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
414 maybe_cleanup_point_expr (tree expr
)
416 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
417 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
421 /* Like maybe_cleanup_point_expr except have the type of the new expression be
422 void so we don't need to create a temporary variable to hold the inner
423 expression. The reason why we do this is because the original type might be
424 an aggregate and we cannot create a temporary variable for that type. */
427 maybe_cleanup_point_expr_void (tree expr
)
429 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
430 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
436 /* Create a declaration statement for the declaration given by the DECL. */
439 add_decl_expr (tree decl
)
441 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
442 if (DECL_INITIAL (decl
)
443 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
444 r
= maybe_cleanup_point_expr_void (r
);
448 /* Finish a scope. */
451 do_poplevel (tree stmt_list
)
455 if (stmts_are_full_exprs_p ())
456 block
= poplevel (kept_level_p (), 1, 0);
458 stmt_list
= pop_stmt_list (stmt_list
);
460 if (!processing_template_decl
)
462 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
463 /* ??? See c_end_compound_stmt re statement expressions. */
469 /* Begin a new scope. */
472 do_pushlevel (scope_kind sk
)
474 tree ret
= push_stmt_list ();
475 if (stmts_are_full_exprs_p ())
476 begin_scope (sk
, NULL
);
480 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
481 when the current scope is exited. EH_ONLY is true when this is not
482 meant to apply to normal control flow transfer. */
485 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
487 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
488 CLEANUP_EH_ONLY (stmt
) = eh_only
;
490 CLEANUP_BODY (stmt
) = push_stmt_list ();
493 /* Begin a conditional that might contain a declaration. When generating
494 normal code, we want the declaration to appear before the statement
495 containing the conditional. When generating template code, we want the
496 conditional to be rendered as the raw DECL_EXPR. */
499 begin_cond (tree
*cond_p
)
501 if (processing_template_decl
)
502 *cond_p
= push_stmt_list ();
505 /* Finish such a conditional. */
508 finish_cond (tree
*cond_p
, tree expr
)
510 if (processing_template_decl
)
512 tree cond
= pop_stmt_list (*cond_p
);
513 if (TREE_CODE (cond
) == DECL_EXPR
)
516 if (check_for_bare_parameter_packs (expr
))
517 *cond_p
= error_mark_node
;
522 /* If *COND_P specifies a conditional with a declaration, transform the
525 for (; A x = 42;) { }
527 while (true) { A x = 42; if (!x) break; }
528 for (;;) { A x = 42; if (!x) break; }
529 The statement list for BODY will be empty if the conditional did
530 not declare anything. */
533 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
537 if (!TREE_SIDE_EFFECTS (body
))
541 *cond_p
= boolean_true_node
;
543 if_stmt
= begin_if_stmt ();
544 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
545 finish_if_stmt_cond (cond
, if_stmt
);
546 finish_break_stmt ();
547 finish_then_clause (if_stmt
);
548 finish_if_stmt (if_stmt
);
551 /* Finish a goto-statement. */
554 finish_goto_stmt (tree destination
)
556 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
557 destination
= lookup_label (destination
);
559 /* We warn about unused labels with -Wunused. That means we have to
560 mark the used labels as used. */
561 if (TREE_CODE (destination
) == LABEL_DECL
)
562 TREE_USED (destination
) = 1;
565 destination
= mark_rvalue_use (destination
);
566 if (!processing_template_decl
)
568 destination
= cp_convert (ptr_type_node
, destination
);
569 if (error_operand_p (destination
))
572 /* We don't inline calls to functions with computed gotos.
573 Those functions are typically up to some funny business,
574 and may be depending on the labels being at particular
575 addresses, or some such. */
576 DECL_UNINLINABLE (current_function_decl
) = 1;
579 check_goto (destination
);
581 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
584 /* COND is the condition-expression for an if, while, etc.,
585 statement. Convert it to a boolean value, if appropriate.
586 In addition, verify sequence points if -Wsequence-point is enabled. */
589 maybe_convert_cond (tree cond
)
591 /* Empty conditions remain empty. */
595 /* Wait until we instantiate templates before doing conversion. */
596 if (processing_template_decl
)
599 if (warn_sequence_point
)
600 verify_sequence_points (cond
);
602 /* Do the conversion. */
603 cond
= convert_from_reference (cond
);
605 if (TREE_CODE (cond
) == MODIFY_EXPR
606 && !TREE_NO_WARNING (cond
)
609 warning (OPT_Wparentheses
,
610 "suggest parentheses around assignment used as truth value");
611 TREE_NO_WARNING (cond
) = 1;
614 return condition_conversion (cond
);
617 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
620 finish_expr_stmt (tree expr
)
624 if (expr
!= NULL_TREE
)
626 if (!processing_template_decl
)
628 if (warn_sequence_point
)
629 verify_sequence_points (expr
);
630 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
632 else if (!type_dependent_expression_p (expr
))
633 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
634 tf_warning_or_error
);
636 if (check_for_bare_parameter_packs (expr
))
637 expr
= error_mark_node
;
639 /* Simplification of inner statement expressions, compound exprs,
640 etc can result in us already having an EXPR_STMT. */
641 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
643 if (TREE_CODE (expr
) != EXPR_STMT
)
644 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
645 expr
= maybe_cleanup_point_expr_void (expr
);
657 /* Begin an if-statement. Returns a newly created IF_STMT if
664 scope
= do_pushlevel (sk_block
);
665 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
666 TREE_CHAIN (r
) = scope
;
667 begin_cond (&IF_COND (r
));
671 /* Process the COND of an if-statement, which may be given by
675 finish_if_stmt_cond (tree cond
, tree if_stmt
)
677 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
679 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
682 /* Finish the then-clause of an if-statement, which may be given by
686 finish_then_clause (tree if_stmt
)
688 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
692 /* Begin the else-clause of an if-statement. */
695 begin_else_clause (tree if_stmt
)
697 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
700 /* Finish the else-clause of an if-statement, which may be given by
704 finish_else_clause (tree if_stmt
)
706 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
709 /* Finish an if-statement. */
712 finish_if_stmt (tree if_stmt
)
714 tree scope
= TREE_CHAIN (if_stmt
);
715 TREE_CHAIN (if_stmt
) = NULL
;
716 add_stmt (do_poplevel (scope
));
720 /* Begin a while-statement. Returns a newly created WHILE_STMT if
724 begin_while_stmt (void)
727 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
729 WHILE_BODY (r
) = do_pushlevel (sk_block
);
730 begin_cond (&WHILE_COND (r
));
734 /* Process the COND of a while-statement, which may be given by
738 finish_while_stmt_cond (tree cond
, tree while_stmt
)
740 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
741 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
744 /* Finish a while-statement, which may be given by WHILE_STMT. */
747 finish_while_stmt (tree while_stmt
)
749 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
753 /* Begin a do-statement. Returns a newly created DO_STMT if
759 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
761 DO_BODY (r
) = push_stmt_list ();
765 /* Finish the body of a do-statement, which may be given by DO_STMT. */
768 finish_do_body (tree do_stmt
)
770 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
772 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
773 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
775 if (IS_EMPTY_STMT (body
))
776 warning (OPT_Wempty_body
,
777 "suggest explicit braces around empty body in %<do%> statement");
780 /* Finish a do-statement, which may be given by DO_STMT, and whose
781 COND is as indicated. */
784 finish_do_stmt (tree cond
, tree do_stmt
)
786 cond
= maybe_convert_cond (cond
);
787 DO_COND (do_stmt
) = cond
;
791 /* Finish a return-statement. The EXPRESSION returned, if any, is as
795 finish_return_stmt (tree expr
)
800 expr
= check_return_expr (expr
, &no_warning
);
802 if (flag_openmp
&& !check_omp_return ())
803 return error_mark_node
;
804 if (!processing_template_decl
)
806 if (warn_sequence_point
)
807 verify_sequence_points (expr
);
809 if (DECL_DESTRUCTOR_P (current_function_decl
)
810 || (DECL_CONSTRUCTOR_P (current_function_decl
)
811 && targetm
.cxx
.cdtor_returns_this ()))
813 /* Similarly, all destructors must run destructors for
814 base-classes before returning. So, all returns in a
815 destructor get sent to the DTOR_LABEL; finish_function emits
816 code to return a value there. */
817 return finish_goto_stmt (cdtor_label
);
821 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
822 TREE_NO_WARNING (r
) |= no_warning
;
823 r
= maybe_cleanup_point_expr_void (r
);
830 /* Begin the scope of a for-statement or a range-for-statement.
831 Both the returned trees are to be used in a call to
832 begin_for_stmt or begin_range_for_stmt. */
835 begin_for_scope (tree
*init
)
837 tree scope
= NULL_TREE
;
838 if (flag_new_for_scope
> 0)
839 scope
= do_pushlevel (sk_for
);
841 if (processing_template_decl
)
842 *init
= push_stmt_list ();
849 /* Begin a for-statement. Returns a new FOR_STMT.
850 SCOPE and INIT should be the return of begin_for_scope,
854 begin_for_stmt (tree scope
, tree init
)
858 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
859 NULL_TREE
, NULL_TREE
);
861 if (scope
== NULL_TREE
)
863 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
865 scope
= begin_for_scope (&init
);
867 FOR_INIT_STMT (r
) = init
;
868 TREE_CHAIN (r
) = scope
;
873 /* Finish the for-init-statement of a for-statement, which may be
874 given by FOR_STMT. */
877 finish_for_init_stmt (tree for_stmt
)
879 if (processing_template_decl
)
880 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
882 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
883 begin_cond (&FOR_COND (for_stmt
));
886 /* Finish the COND of a for-statement, which may be given by
890 finish_for_cond (tree cond
, tree for_stmt
)
892 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
893 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
896 /* Finish the increment-EXPRESSION in a for-statement, which may be
897 given by FOR_STMT. */
900 finish_for_expr (tree expr
, tree for_stmt
)
904 /* If EXPR is an overloaded function, issue an error; there is no
905 context available to use to perform overload resolution. */
906 if (type_unknown_p (expr
))
908 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
909 expr
= error_mark_node
;
911 if (!processing_template_decl
)
913 if (warn_sequence_point
)
914 verify_sequence_points (expr
);
915 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
916 tf_warning_or_error
);
918 else if (!type_dependent_expression_p (expr
))
919 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
920 tf_warning_or_error
);
921 expr
= maybe_cleanup_point_expr_void (expr
);
922 if (check_for_bare_parameter_packs (expr
))
923 expr
= error_mark_node
;
924 FOR_EXPR (for_stmt
) = expr
;
927 /* Finish the body of a for-statement, which may be given by
928 FOR_STMT. The increment-EXPR for the loop must be
930 It can also finish RANGE_FOR_STMT. */
933 finish_for_stmt (tree for_stmt
)
935 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
936 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
938 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
940 /* Pop the scope for the body of the loop. */
941 if (flag_new_for_scope
> 0)
943 tree scope
= TREE_CHAIN (for_stmt
);
944 TREE_CHAIN (for_stmt
) = NULL
;
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
);
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 TREE_CHAIN (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 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
1019 scope
= do_pushlevel (sk_block
);
1020 TREE_CHAIN (r
) = scope
;
1021 begin_cond (&SWITCH_STMT_COND (r
));
1026 /* Finish the cond of a switch-statement. */
1029 finish_switch_cond (tree cond
, tree switch_stmt
)
1031 tree orig_type
= NULL
;
1032 if (!processing_template_decl
)
1034 /* Convert the condition to an integer or enumeration type. */
1035 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1036 if (cond
== NULL_TREE
)
1038 error ("switch quantity not an integer");
1039 cond
= error_mark_node
;
1041 orig_type
= TREE_TYPE (cond
);
1042 if (cond
!= error_mark_node
)
1046 Integral promotions are performed. */
1047 cond
= perform_integral_promotions (cond
);
1048 cond
= maybe_cleanup_point_expr (cond
);
1051 if (check_for_bare_parameter_packs (cond
))
1052 cond
= error_mark_node
;
1053 else if (!processing_template_decl
&& warn_sequence_point
)
1054 verify_sequence_points (cond
);
1056 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1057 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1058 add_stmt (switch_stmt
);
1059 push_switch (switch_stmt
);
1060 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1063 /* Finish the body of a switch-statement, which may be given by
1064 SWITCH_STMT. The COND to switch on is indicated. */
1067 finish_switch_stmt (tree switch_stmt
)
1071 SWITCH_STMT_BODY (switch_stmt
) =
1072 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1076 scope
= TREE_CHAIN (switch_stmt
);
1077 TREE_CHAIN (switch_stmt
) = NULL
;
1078 add_stmt (do_poplevel (scope
));
1081 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1085 begin_try_block (void)
1087 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1089 TRY_STMTS (r
) = push_stmt_list ();
1093 /* Likewise, for a function-try-block. The block returned in
1094 *COMPOUND_STMT is an artificial outer scope, containing the
1095 function-try-block. */
1098 begin_function_try_block (tree
*compound_stmt
)
1101 /* This outer scope does not exist in the C++ standard, but we need
1102 a place to put __FUNCTION__ and similar variables. */
1103 *compound_stmt
= begin_compound_stmt (0);
1104 r
= begin_try_block ();
1105 FN_TRY_BLOCK_P (r
) = 1;
1109 /* Finish a try-block, which may be given by TRY_BLOCK. */
1112 finish_try_block (tree try_block
)
1114 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1115 TRY_HANDLERS (try_block
) = push_stmt_list ();
1118 /* Finish the body of a cleanup try-block, which may be given by
1122 finish_cleanup_try_block (tree try_block
)
1124 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1127 /* Finish an implicitly generated try-block, with a cleanup is given
1131 finish_cleanup (tree cleanup
, tree try_block
)
1133 TRY_HANDLERS (try_block
) = cleanup
;
1134 CLEANUP_P (try_block
) = 1;
1137 /* Likewise, for a function-try-block. */
1140 finish_function_try_block (tree try_block
)
1142 finish_try_block (try_block
);
1143 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1144 the try block, but moving it inside. */
1145 in_function_try_handler
= 1;
1148 /* Finish a handler-sequence for a try-block, which may be given by
1152 finish_handler_sequence (tree try_block
)
1154 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1155 check_handlers (TRY_HANDLERS (try_block
));
1158 /* Finish the handler-seq for a function-try-block, given by
1159 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1160 begin_function_try_block. */
1163 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1165 in_function_try_handler
= 0;
1166 finish_handler_sequence (try_block
);
1167 finish_compound_stmt (compound_stmt
);
1170 /* Begin a handler. Returns a HANDLER if appropriate. */
1173 begin_handler (void)
1177 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1180 /* Create a binding level for the eh_info and the exception object
1182 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1187 /* Finish the handler-parameters for a handler, which may be given by
1188 HANDLER. DECL is the declaration for the catch parameter, or NULL
1189 if this is a `catch (...)' clause. */
1192 finish_handler_parms (tree decl
, tree handler
)
1194 tree type
= NULL_TREE
;
1195 if (processing_template_decl
)
1199 decl
= pushdecl (decl
);
1200 decl
= push_template_decl (decl
);
1201 HANDLER_PARMS (handler
) = decl
;
1202 type
= TREE_TYPE (decl
);
1206 type
= expand_start_catch_block (decl
);
1207 HANDLER_TYPE (handler
) = type
;
1208 if (!processing_template_decl
&& type
)
1209 mark_used (eh_type_info (type
));
1212 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1213 the return value from the matching call to finish_handler_parms. */
1216 finish_handler (tree handler
)
1218 if (!processing_template_decl
)
1219 expand_end_catch_block ();
1220 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1223 /* Begin a compound statement. FLAGS contains some bits that control the
1224 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1225 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1226 block of a function. If BCS_TRY_BLOCK is set, this is the block
1227 created on behalf of a TRY statement. Returns a token to be passed to
1228 finish_compound_stmt. */
1231 begin_compound_stmt (unsigned int flags
)
1235 if (flags
& BCS_NO_SCOPE
)
1237 r
= push_stmt_list ();
1238 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1240 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1241 But, if it's a statement-expression with a scopeless block, there's
1242 nothing to keep, and we don't want to accidentally keep a block
1243 *inside* the scopeless block. */
1244 keep_next_level (false);
1247 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1249 /* When processing a template, we need to remember where the braces were,
1250 so that we can set up identical scopes when instantiating the template
1251 later. BIND_EXPR is a handy candidate for this.
1252 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1253 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1254 processing templates. */
1255 if (processing_template_decl
)
1257 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1258 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1259 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1260 TREE_SIDE_EFFECTS (r
) = 1;
1266 /* Finish a compound-statement, which is given by STMT. */
1269 finish_compound_stmt (tree stmt
)
1271 if (TREE_CODE (stmt
) == BIND_EXPR
)
1273 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1274 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1275 discard the BIND_EXPR so it can be merged with the containing
1277 if (TREE_CODE (body
) == STATEMENT_LIST
1278 && STATEMENT_LIST_HEAD (body
) == NULL
1279 && !BIND_EXPR_BODY_BLOCK (stmt
)
1280 && !BIND_EXPR_TRY_BLOCK (stmt
))
1283 BIND_EXPR_BODY (stmt
) = body
;
1285 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1286 stmt
= pop_stmt_list (stmt
);
1289 /* Destroy any ObjC "super" receivers that may have been
1291 objc_clear_super_receiver ();
1293 stmt
= do_poplevel (stmt
);
1296 /* ??? See c_end_compound_stmt wrt statement expressions. */
1301 /* Finish an asm-statement, whose components are a STRING, some
1302 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1303 LABELS. Also note whether the asm-statement should be
1304 considered volatile. */
1307 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1308 tree input_operands
, tree clobbers
, tree labels
)
1312 int ninputs
= list_length (input_operands
);
1313 int noutputs
= list_length (output_operands
);
1315 if (!processing_template_decl
)
1317 const char *constraint
;
1318 const char **oconstraints
;
1319 bool allows_mem
, allows_reg
, is_inout
;
1323 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1325 string
= resolve_asm_operand_names (string
, output_operands
,
1326 input_operands
, labels
);
1328 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1330 operand
= TREE_VALUE (t
);
1332 /* ??? Really, this should not be here. Users should be using a
1333 proper lvalue, dammit. But there's a long history of using
1334 casts in the output operands. In cases like longlong.h, this
1335 becomes a primitive form of typechecking -- if the cast can be
1336 removed, then the output operand had a type of the proper width;
1337 otherwise we'll get an error. Gross, but ... */
1338 STRIP_NOPS (operand
);
1340 operand
= mark_lvalue_use (operand
);
1342 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1343 operand
= error_mark_node
;
1345 if (operand
!= error_mark_node
1346 && (TREE_READONLY (operand
)
1347 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1348 /* Functions are not modifiable, even though they are
1350 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1351 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1352 /* If it's an aggregate and any field is const, then it is
1353 effectively const. */
1354 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1355 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1356 cxx_readonly_error (operand
, lv_asm
);
1358 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1359 oconstraints
[i
] = constraint
;
1361 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1362 &allows_mem
, &allows_reg
, &is_inout
))
1364 /* If the operand is going to end up in memory,
1365 mark it addressable. */
1366 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1367 operand
= error_mark_node
;
1370 operand
= error_mark_node
;
1372 TREE_VALUE (t
) = operand
;
1375 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1377 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1378 operand
= decay_conversion (TREE_VALUE (t
));
1380 /* If the type of the operand hasn't been determined (e.g.,
1381 because it involves an overloaded function), then issue
1382 an error message. There's no context available to
1383 resolve the overloading. */
1384 if (TREE_TYPE (operand
) == unknown_type_node
)
1386 error ("type of asm operand %qE could not be determined",
1388 operand
= error_mark_node
;
1391 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1392 oconstraints
, &allows_mem
, &allows_reg
))
1394 /* If the operand is going to end up in memory,
1395 mark it addressable. */
1396 if (!allows_reg
&& allows_mem
)
1398 /* Strip the nops as we allow this case. FIXME, this really
1399 should be rejected or made deprecated. */
1400 STRIP_NOPS (operand
);
1401 if (!cxx_mark_addressable (operand
))
1402 operand
= error_mark_node
;
1406 operand
= error_mark_node
;
1408 TREE_VALUE (t
) = operand
;
1412 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1413 output_operands
, input_operands
,
1415 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1416 r
= maybe_cleanup_point_expr_void (r
);
1417 return add_stmt (r
);
1420 /* Finish a label with the indicated NAME. Returns the new label. */
1423 finish_label_stmt (tree name
)
1425 tree decl
= define_label (input_location
, name
);
1427 if (decl
== error_mark_node
)
1428 return error_mark_node
;
1430 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1435 /* Finish a series of declarations for local labels. G++ allows users
1436 to declare "local" labels, i.e., labels with scope. This extension
1437 is useful when writing code involving statement-expressions. */
1440 finish_label_decl (tree name
)
1442 if (!at_function_scope_p ())
1444 error ("__label__ declarations are only allowed in function scopes");
1448 add_decl_expr (declare_local_label (name
));
1451 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1454 finish_decl_cleanup (tree decl
, tree cleanup
)
1456 push_cleanup (decl
, cleanup
, false);
1459 /* If the current scope exits with an exception, run CLEANUP. */
1462 finish_eh_cleanup (tree cleanup
)
1464 push_cleanup (NULL
, cleanup
, true);
1467 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1468 order they were written by the user. Each node is as for
1469 emit_mem_initializers. */
1472 finish_mem_initializers (tree mem_inits
)
1474 /* Reorder the MEM_INITS so that they are in the order they appeared
1475 in the source program. */
1476 mem_inits
= nreverse (mem_inits
);
1478 if (processing_template_decl
)
1482 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1484 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1485 check for bare parameter packs in the TREE_VALUE, because
1486 any parameter packs in the TREE_VALUE have already been
1487 bound as part of the TREE_PURPOSE. See
1488 make_pack_expansion for more information. */
1489 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1490 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1491 TREE_VALUE (mem
) = error_mark_node
;
1494 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1497 emit_mem_initializers (mem_inits
);
1500 /* Finish a parenthesized expression EXPR. */
1503 finish_parenthesized_expr (tree expr
)
1506 /* This inhibits warnings in c_common_truthvalue_conversion. */
1507 TREE_NO_WARNING (expr
) = 1;
1509 if (TREE_CODE (expr
) == OFFSET_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 /* DR 613: Can use non-static data members without an associated
1537 object in sizeof/decltype/alignof. */
1538 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1539 && (!processing_template_decl
|| !current_class_ref
))
1541 if (current_function_decl
1542 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1543 error ("invalid use of member %q+D in static member function", decl
);
1545 error ("invalid use of non-static data member %q+D", decl
);
1546 error ("from this location");
1548 return error_mark_node
;
1551 if (current_class_ptr
)
1552 TREE_USED (current_class_ptr
) = 1;
1553 if (processing_template_decl
&& !qualifying_scope
)
1555 tree type
= TREE_TYPE (decl
);
1557 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1558 type
= TREE_TYPE (type
);
1561 /* Set the cv qualifiers. */
1562 int quals
= (current_class_ref
1563 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1564 : TYPE_UNQUALIFIED
);
1566 if (DECL_MUTABLE_P (decl
))
1567 quals
&= ~TYPE_QUAL_CONST
;
1569 quals
|= cp_type_quals (TREE_TYPE (decl
));
1570 type
= cp_build_qualified_type (type
, quals
);
1573 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1575 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1576 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1578 else if (processing_template_decl
)
1579 return build_qualified_name (TREE_TYPE (decl
),
1582 /*template_p=*/false);
1585 tree access_type
= TREE_TYPE (object
);
1587 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1590 /* If the data member was named `C::M', convert `*this' to `C'
1592 if (qualifying_scope
)
1594 tree binfo
= NULL_TREE
;
1595 object
= build_scoped_ref (object
, qualifying_scope
,
1599 return build_class_member_access_expr (object
, decl
,
1600 /*access_path=*/NULL_TREE
,
1601 /*preserve_reference=*/false,
1602 tf_warning_or_error
);
1606 /* If we are currently parsing a template and we encountered a typedef
1607 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1608 adds the typedef to a list tied to the current template.
1609 At tempate instantiatin time, that list is walked and access check
1610 performed for each typedef.
1611 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1614 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1616 location_t location
)
1618 tree template_info
= NULL
;
1619 tree cs
= current_scope ();
1621 if (!is_typedef_decl (typedef_decl
)
1623 || !CLASS_TYPE_P (context
)
1627 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1628 template_info
= get_template_info (cs
);
1631 && TI_TEMPLATE (template_info
)
1632 && !currently_open_class (context
))
1633 append_type_to_template_for_access_check (cs
, typedef_decl
,
1637 /* DECL was the declaration to which a qualified-id resolved. Issue
1638 an error message if it is not accessible. If OBJECT_TYPE is
1639 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1640 type of `*x', or `x', respectively. If the DECL was named as
1641 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1644 check_accessibility_of_qualified_id (tree decl
,
1646 tree nested_name_specifier
)
1649 tree qualifying_type
= NULL_TREE
;
1651 /* If we are parsing a template declaration and if decl is a typedef,
1652 add it to a list tied to the template.
1653 At template instantiation time, that list will be walked and
1654 access check performed. */
1655 add_typedef_to_current_template_for_access_check (decl
,
1656 nested_name_specifier
1657 ? nested_name_specifier
1658 : DECL_CONTEXT (decl
),
1661 /* If we're not checking, return immediately. */
1662 if (deferred_access_no_check
)
1665 /* Determine the SCOPE of DECL. */
1666 scope
= context_for_name_lookup (decl
);
1667 /* If the SCOPE is not a type, then DECL is not a member. */
1668 if (!TYPE_P (scope
))
1670 /* Compute the scope through which DECL is being accessed. */
1672 /* OBJECT_TYPE might not be a class type; consider:
1674 class A { typedef int I; };
1678 In this case, we will have "A::I" as the DECL, but "I" as the
1680 && CLASS_TYPE_P (object_type
)
1681 && DERIVED_FROM_P (scope
, object_type
))
1682 /* If we are processing a `->' or `.' expression, use the type of the
1684 qualifying_type
= object_type
;
1685 else if (nested_name_specifier
)
1687 /* If the reference is to a non-static member of the
1688 current class, treat it as if it were referenced through
1690 if (DECL_NONSTATIC_MEMBER_P (decl
)
1691 && current_class_ptr
1692 && DERIVED_FROM_P (scope
, current_class_type
))
1693 qualifying_type
= current_class_type
;
1694 /* Otherwise, use the type indicated by the
1695 nested-name-specifier. */
1697 qualifying_type
= nested_name_specifier
;
1700 /* Otherwise, the name must be from the current class or one of
1702 qualifying_type
= currently_open_derived_class (scope
);
1705 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1706 or similar in a default argument value. */
1707 && CLASS_TYPE_P (qualifying_type
)
1708 && !dependent_type_p (qualifying_type
))
1709 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1713 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1714 class named to the left of the "::" operator. DONE is true if this
1715 expression is a complete postfix-expression; it is false if this
1716 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1717 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1718 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1719 is true iff this qualified name appears as a template argument. */
1722 finish_qualified_id_expr (tree qualifying_class
,
1727 bool template_arg_p
)
1729 gcc_assert (TYPE_P (qualifying_class
));
1731 if (error_operand_p (expr
))
1732 return error_mark_node
;
1734 if (DECL_P (expr
) || BASELINK_P (expr
))
1738 check_template_keyword (expr
);
1740 /* If EXPR occurs as the operand of '&', use special handling that
1741 permits a pointer-to-member. */
1742 if (address_p
&& done
)
1744 if (TREE_CODE (expr
) == SCOPE_REF
)
1745 expr
= TREE_OPERAND (expr
, 1);
1746 expr
= build_offset_ref (qualifying_class
, expr
,
1747 /*address_p=*/true);
1751 /* Within the scope of a class, turn references to non-static
1752 members into expression of the form "this->...". */
1754 /* But, within a template argument, we do not want make the
1755 transformation, as there is no "this" pointer. */
1757 else if (TREE_CODE (expr
) == FIELD_DECL
)
1759 push_deferring_access_checks (dk_no_check
);
1760 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1762 pop_deferring_access_checks ();
1764 else if (BASELINK_P (expr
) && !processing_template_decl
)
1768 /* See if any of the functions are non-static members. */
1769 /* If so, the expression may be relative to 'this'. */
1770 if (!shared_member_p (expr
)
1771 && (ob
= maybe_dummy_object (qualifying_class
, NULL
),
1772 !is_dummy_object (ob
)))
1773 expr
= (build_class_member_access_expr
1776 BASELINK_ACCESS_BINFO (expr
),
1777 /*preserve_reference=*/false,
1778 tf_warning_or_error
));
1780 /* The expression is a qualified name whose address is not
1782 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1788 /* Begin a statement-expression. The value returned must be passed to
1789 finish_stmt_expr. */
1792 begin_stmt_expr (void)
1794 return push_stmt_list ();
1797 /* Process the final expression of a statement expression. EXPR can be
1798 NULL, if the final expression is empty. Return a STATEMENT_LIST
1799 containing all the statements in the statement-expression, or
1800 ERROR_MARK_NODE if there was an error. */
1803 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1805 if (error_operand_p (expr
))
1807 /* The type of the statement-expression is the type of the last
1809 TREE_TYPE (stmt_expr
) = error_mark_node
;
1810 return error_mark_node
;
1813 /* If the last statement does not have "void" type, then the value
1814 of the last statement is the value of the entire expression. */
1817 tree type
= TREE_TYPE (expr
);
1819 if (processing_template_decl
)
1821 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1822 expr
= add_stmt (expr
);
1823 /* Mark the last statement so that we can recognize it as such at
1824 template-instantiation time. */
1825 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1827 else if (VOID_TYPE_P (type
))
1829 /* Just treat this like an ordinary statement. */
1830 expr
= finish_expr_stmt (expr
);
1834 /* It actually has a value we need to deal with. First, force it
1835 to be an rvalue so that we won't need to build up a copy
1836 constructor call later when we try to assign it to something. */
1837 expr
= force_rvalue (expr
);
1838 if (error_operand_p (expr
))
1839 return error_mark_node
;
1841 /* Update for array-to-pointer decay. */
1842 type
= TREE_TYPE (expr
);
1844 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1845 normal statement, but don't convert to void or actually add
1847 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1848 expr
= maybe_cleanup_point_expr (expr
);
1852 /* The type of the statement-expression is the type of the last
1854 TREE_TYPE (stmt_expr
) = type
;
1860 /* Finish a statement-expression. EXPR should be the value returned
1861 by the previous begin_stmt_expr. Returns an expression
1862 representing the statement-expression. */
1865 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1870 if (error_operand_p (stmt_expr
))
1872 pop_stmt_list (stmt_expr
);
1873 return error_mark_node
;
1876 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1878 type
= TREE_TYPE (stmt_expr
);
1879 result
= pop_stmt_list (stmt_expr
);
1880 TREE_TYPE (result
) = type
;
1882 if (processing_template_decl
)
1884 result
= build_min (STMT_EXPR
, type
, result
);
1885 TREE_SIDE_EFFECTS (result
) = 1;
1886 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1888 else if (CLASS_TYPE_P (type
))
1890 /* Wrap the statement-expression in a TARGET_EXPR so that the
1891 temporary object created by the final expression is destroyed at
1892 the end of the full-expression containing the
1893 statement-expression. */
1894 result
= force_target_expr (type
, result
);
1900 /* Returns the expression which provides the value of STMT_EXPR. */
1903 stmt_expr_value_expr (tree stmt_expr
)
1905 tree t
= STMT_EXPR_STMT (stmt_expr
);
1907 if (TREE_CODE (t
) == BIND_EXPR
)
1908 t
= BIND_EXPR_BODY (t
);
1910 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1911 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1913 if (TREE_CODE (t
) == EXPR_STMT
)
1914 t
= EXPR_STMT_EXPR (t
);
1919 /* Return TRUE iff EXPR_STMT is an empty list of
1920 expression statements. */
1923 empty_expr_stmt_p (tree expr_stmt
)
1925 tree body
= NULL_TREE
;
1927 if (expr_stmt
== void_zero_node
)
1932 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1933 body
= EXPR_STMT_EXPR (expr_stmt
);
1934 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1940 if (TREE_CODE (body
) == STATEMENT_LIST
)
1941 return tsi_end_p (tsi_start (body
));
1943 return empty_expr_stmt_p (body
);
1948 /* Perform Koenig lookup. FN is the postfix-expression representing
1949 the function (or functions) to call; ARGS are the arguments to the
1950 call; if INCLUDE_STD then the `std' namespace is automatically
1951 considered an associated namespace (used in range-based for loops).
1952 Returns the functions to be considered by overload resolution. */
1955 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
, bool include_std
)
1957 tree identifier
= NULL_TREE
;
1958 tree functions
= NULL_TREE
;
1959 tree tmpl_args
= NULL_TREE
;
1960 bool template_id
= false;
1962 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1964 /* Use a separate flag to handle null args. */
1966 tmpl_args
= TREE_OPERAND (fn
, 1);
1967 fn
= TREE_OPERAND (fn
, 0);
1970 /* Find the name of the overloaded function. */
1971 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1973 else if (is_overloaded_fn (fn
))
1976 identifier
= DECL_NAME (get_first_fn (functions
));
1978 else if (DECL_P (fn
))
1981 identifier
= DECL_NAME (fn
);
1984 /* A call to a namespace-scope function using an unqualified name.
1986 Do Koenig lookup -- unless any of the arguments are
1988 if (!any_type_dependent_arguments_p (args
)
1989 && !any_dependent_template_arguments_p (tmpl_args
))
1991 fn
= lookup_arg_dependent (identifier
, functions
, args
, include_std
);
1993 /* The unqualified name could not be resolved. */
1994 fn
= unqualified_fn_lookup_error (identifier
);
1997 if (fn
&& template_id
)
1998 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2003 /* Generate an expression for `FN (ARGS)'. This may change the
2006 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2007 as a virtual call, even if FN is virtual. (This flag is set when
2008 encountering an expression where the function name is explicitly
2009 qualified. For example a call to `X::f' never generates a virtual
2012 Returns code for the call. */
2015 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
2016 bool koenig_p
, tsubst_flags_t complain
)
2020 VEC(tree
,gc
) *orig_args
= NULL
;
2022 if (fn
== error_mark_node
)
2023 return error_mark_node
;
2025 gcc_assert (!TYPE_P (fn
));
2029 if (processing_template_decl
)
2031 if (type_dependent_expression_p (fn
)
2032 || any_type_dependent_arguments_p (*args
))
2034 result
= build_nt_call_vec (fn
, *args
);
2035 KOENIG_LOOKUP_P (result
) = koenig_p
;
2040 tree fndecl
= OVL_CURRENT (fn
);
2041 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2042 || !TREE_THIS_VOLATILE (fndecl
))
2048 current_function_returns_abnormally
= 1;
2052 orig_args
= make_tree_vector_copy (*args
);
2053 if (!BASELINK_P (fn
)
2054 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2055 && TREE_TYPE (fn
) != unknown_type_node
)
2056 fn
= build_non_dependent_expr (fn
);
2057 make_args_non_dependent (*args
);
2060 if (is_overloaded_fn (fn
))
2061 fn
= baselink_for_fns (fn
);
2064 if (BASELINK_P (fn
))
2068 /* A call to a member function. From [over.call.func]:
2070 If the keyword this is in scope and refers to the class of
2071 that member function, or a derived class thereof, then the
2072 function call is transformed into a qualified function call
2073 using (*this) as the postfix-expression to the left of the
2074 . operator.... [Otherwise] a contrived object of type T
2075 becomes the implied object argument.
2079 struct A { void f(); };
2080 struct B : public A {};
2081 struct C : public A { void g() { B::f(); }};
2083 "the class of that member function" refers to `A'. But 11.2
2084 [class.access.base] says that we need to convert 'this' to B* as
2085 part of the access, so we pass 'B' to maybe_dummy_object. */
2087 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2090 if (processing_template_decl
)
2092 if (type_dependent_expression_p (object
))
2094 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2095 release_tree_vector (orig_args
);
2098 object
= build_non_dependent_expr (object
);
2101 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2103 ? LOOKUP_NONVIRTUAL
: 0),
2107 else if (is_overloaded_fn (fn
))
2109 /* If the function is an overloaded builtin, resolve it. */
2110 if (TREE_CODE (fn
) == FUNCTION_DECL
2111 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2112 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2113 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2116 /* A call to a namespace-scope function. */
2117 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2119 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2121 if (!VEC_empty (tree
, *args
))
2122 error ("arguments to destructor are not allowed");
2123 /* Mark the pseudo-destructor call as having side-effects so
2124 that we do not issue warnings about its use. */
2125 result
= build1 (NOP_EXPR
,
2127 TREE_OPERAND (fn
, 0));
2128 TREE_SIDE_EFFECTS (result
) = 1;
2130 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2131 /* If the "function" is really an object of class type, it might
2132 have an overloaded `operator ()'. */
2133 result
= build_op_call (fn
, args
, complain
);
2136 /* A call where the function is unknown. */
2137 result
= cp_build_function_call_vec (fn
, args
, complain
);
2139 if (processing_template_decl
)
2141 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2142 KOENIG_LOOKUP_P (result
) = koenig_p
;
2143 release_tree_vector (orig_args
);
2149 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2150 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2151 POSTDECREMENT_EXPR.) */
2154 finish_increment_expr (tree expr
, enum tree_code code
)
2156 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2159 /* Finish a use of `this'. Returns an expression for `this'. */
2162 finish_this_expr (void)
2166 if (current_class_ptr
)
2168 tree type
= TREE_TYPE (current_class_ref
);
2170 /* In a lambda expression, 'this' refers to the captured 'this'. */
2171 if (LAMBDA_TYPE_P (type
))
2172 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2174 result
= current_class_ptr
;
2177 else if (current_function_decl
2178 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2180 error ("%<this%> is unavailable for static member functions");
2181 result
= error_mark_node
;
2185 if (current_function_decl
)
2186 error ("invalid use of %<this%> in non-member function");
2188 error ("invalid use of %<this%> at top level");
2189 result
= error_mark_node
;
2195 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2196 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2197 the TYPE for the type given. If SCOPE is non-NULL, the expression
2198 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2201 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2203 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2204 return error_mark_node
;
2206 gcc_assert (TYPE_P (destructor
));
2208 if (!processing_template_decl
)
2210 if (scope
== error_mark_node
)
2212 error ("invalid qualifying scope in pseudo-destructor name");
2213 return error_mark_node
;
2215 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2217 error ("qualified type %qT does not match destructor name ~%qT",
2219 return error_mark_node
;
2223 /* [expr.pseudo] says both:
2225 The type designated by the pseudo-destructor-name shall be
2226 the same as the object type.
2230 The cv-unqualified versions of the object type and of the
2231 type designated by the pseudo-destructor-name shall be the
2234 We implement the more generous second sentence, since that is
2235 what most other compilers do. */
2236 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2239 error ("%qE is not of type %qT", object
, destructor
);
2240 return error_mark_node
;
2244 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2247 /* Finish an expression of the form CODE EXPR. */
2250 finish_unary_op_expr (enum tree_code code
, tree expr
)
2252 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2253 /* Inside a template, build_x_unary_op does not fold the
2254 expression. So check whether the result is folded before
2255 setting TREE_NEGATED_INT. */
2256 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2257 && TREE_CODE (result
) == INTEGER_CST
2258 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2259 && INT_CST_LT (result
, integer_zero_node
))
2261 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2262 setting TREE_NEGATED_INT. */
2263 result
= copy_node (result
);
2264 TREE_NEGATED_INT (result
) = 1;
2266 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2267 overflow_warning (input_location
, result
);
2272 /* Finish a compound-literal expression. TYPE is the type to which
2273 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2276 finish_compound_literal (tree type
, tree compound_literal
)
2278 if (type
== error_mark_node
)
2279 return error_mark_node
;
2281 if (!TYPE_OBJ_P (type
))
2283 error ("compound literal of non-object type %qT", type
);
2284 return error_mark_node
;
2287 if (processing_template_decl
)
2289 TREE_TYPE (compound_literal
) = type
;
2290 /* Mark the expression as a compound literal. */
2291 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2292 return compound_literal
;
2295 type
= complete_type (type
);
2297 if (TYPE_NON_AGGREGATE_CLASS (type
))
2299 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2300 everywhere that deals with function arguments would be a pain, so
2301 just wrap it in a TREE_LIST. The parser set a flag so we know
2302 that it came from T{} rather than T({}). */
2303 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2304 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2305 return build_functional_cast (type
, compound_literal
, tf_error
);
2308 if (TREE_CODE (type
) == ARRAY_TYPE
2309 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2310 return error_mark_node
;
2311 compound_literal
= reshape_init (type
, compound_literal
);
2312 if (TREE_CODE (type
) == ARRAY_TYPE
)
2313 cp_complete_array_type (&type
, compound_literal
, false);
2314 compound_literal
= digest_init (type
, compound_literal
);
2315 return get_target_expr (compound_literal
);
2318 /* Return the declaration for the function-name variable indicated by
2322 finish_fname (tree id
)
2326 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2327 if (processing_template_decl
)
2328 decl
= DECL_NAME (decl
);
2332 /* Finish a translation unit. */
2335 finish_translation_unit (void)
2337 /* In case there were missing closebraces,
2338 get us back to the global binding level. */
2340 while (current_namespace
!= global_namespace
)
2343 /* Do file scope __FUNCTION__ et al. */
2344 finish_fname_decls ();
2347 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2348 Returns the parameter. */
2351 finish_template_type_parm (tree aggr
, tree identifier
)
2353 if (aggr
!= class_type_node
)
2355 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2356 aggr
= class_type_node
;
2359 return build_tree_list (aggr
, identifier
);
2362 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2363 Returns the parameter. */
2366 finish_template_template_parm (tree aggr
, tree identifier
)
2368 tree decl
= build_decl (input_location
,
2369 TYPE_DECL
, identifier
, NULL_TREE
);
2370 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2371 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2372 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2373 DECL_ARTIFICIAL (decl
) = 1;
2374 end_template_decl ();
2376 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2378 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2379 /*is_primary=*/true, /*is_partial=*/false,
2382 return finish_template_type_parm (aggr
, tmpl
);
2385 /* ARGUMENT is the default-argument value for a template template
2386 parameter. If ARGUMENT is invalid, issue error messages and return
2387 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2390 check_template_template_default_arg (tree argument
)
2392 if (TREE_CODE (argument
) != TEMPLATE_DECL
2393 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2394 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2396 if (TREE_CODE (argument
) == TYPE_DECL
)
2397 error ("invalid use of type %qT as a default value for a template "
2398 "template-parameter", TREE_TYPE (argument
));
2400 error ("invalid default argument for a template template parameter");
2401 return error_mark_node
;
2407 /* Begin a class definition, as indicated by T. */
2410 begin_class_definition (tree t
, tree attributes
)
2412 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2413 return error_mark_node
;
2415 if (processing_template_parmlist
)
2417 error ("definition of %q#T inside template parameter list", t
);
2418 return error_mark_node
;
2421 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2422 are passed the same as decimal scalar types. */
2423 if (TREE_CODE (t
) == RECORD_TYPE
2424 && !processing_template_decl
)
2426 tree ns
= TYPE_CONTEXT (t
);
2427 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2428 && DECL_CONTEXT (ns
) == std_node
2430 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2432 const char *n
= TYPE_NAME_STRING (t
);
2433 if ((strcmp (n
, "decimal32") == 0)
2434 || (strcmp (n
, "decimal64") == 0)
2435 || (strcmp (n
, "decimal128") == 0))
2436 TYPE_TRANSPARENT_AGGR (t
) = 1;
2440 /* A non-implicit typename comes from code like:
2442 template <typename T> struct A {
2443 template <typename U> struct A<T>::B ...
2445 This is erroneous. */
2446 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2448 error ("invalid definition of qualified type %qT", t
);
2449 t
= error_mark_node
;
2452 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2454 t
= make_class_type (RECORD_TYPE
);
2455 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2458 if (TYPE_BEING_DEFINED (t
))
2460 t
= make_class_type (TREE_CODE (t
));
2461 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2463 maybe_process_partial_specialization (t
);
2465 TYPE_BEING_DEFINED (t
) = 1;
2467 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2468 fixup_attribute_variants (t
);
2470 if (flag_pack_struct
)
2473 TYPE_PACKED (t
) = 1;
2474 /* Even though the type is being defined for the first time
2475 here, there might have been a forward declaration, so there
2476 might be cv-qualified variants of T. */
2477 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2478 TYPE_PACKED (v
) = 1;
2480 /* Reset the interface data, at the earliest possible
2481 moment, as it might have been set via a class foo;
2483 if (! TYPE_ANONYMOUS_P (t
))
2485 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2486 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2487 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2488 (t
, finfo
->interface_unknown
);
2490 reset_specialization();
2492 /* Make a declaration for this class in its own scope. */
2493 build_self_reference ();
2498 /* Finish the member declaration given by DECL. */
2501 finish_member_declaration (tree decl
)
2503 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2506 if (decl
== void_type_node
)
2507 /* The COMPONENT was a friend, not a member, and so there's
2508 nothing for us to do. */
2511 /* We should see only one DECL at a time. */
2512 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2514 /* Set up access control for DECL. */
2516 = (current_access_specifier
== access_private_node
);
2517 TREE_PROTECTED (decl
)
2518 = (current_access_specifier
== access_protected_node
);
2519 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2521 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2522 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2525 /* Mark the DECL as a member of the current class. */
2526 DECL_CONTEXT (decl
) = current_class_type
;
2528 /* Check for bare parameter packs in the member variable declaration. */
2529 if (TREE_CODE (decl
) == FIELD_DECL
)
2531 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2532 TREE_TYPE (decl
) = error_mark_node
;
2533 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2534 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2539 A C language linkage is ignored for the names of class members
2540 and the member function type of class member functions. */
2541 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2542 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2544 /* Put functions on the TYPE_METHODS list and everything else on the
2545 TYPE_FIELDS list. Note that these are built up in reverse order.
2546 We reverse them (to obtain declaration order) in finish_struct. */
2547 if (TREE_CODE (decl
) == FUNCTION_DECL
2548 || DECL_FUNCTION_TEMPLATE_P (decl
))
2550 /* We also need to add this function to the
2551 CLASSTYPE_METHOD_VEC. */
2552 if (add_method (current_class_type
, decl
, NULL_TREE
))
2554 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2555 TYPE_METHODS (current_class_type
) = decl
;
2557 maybe_add_class_template_decl_list (current_class_type
, decl
,
2561 /* Enter the DECL into the scope of the class. */
2562 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2563 || pushdecl_class_level (decl
))
2565 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2566 go at the beginning. The reason is that lookup_field_1
2567 searches the list in order, and we want a field name to
2568 override a type name so that the "struct stat hack" will
2569 work. In particular:
2571 struct S { enum E { }; int E } s;
2574 is valid. In addition, the FIELD_DECLs must be maintained in
2575 declaration order so that class layout works as expected.
2576 However, we don't need that order until class layout, so we
2577 save a little time by putting FIELD_DECLs on in reverse order
2578 here, and then reversing them in finish_struct_1. (We could
2579 also keep a pointer to the correct insertion points in the
2582 if (TREE_CODE (decl
) == TYPE_DECL
)
2583 TYPE_FIELDS (current_class_type
)
2584 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2587 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2588 TYPE_FIELDS (current_class_type
) = decl
;
2591 maybe_add_class_template_decl_list (current_class_type
, decl
,
2596 note_decl_for_pch (decl
);
2599 /* DECL has been declared while we are building a PCH file. Perform
2600 actions that we might normally undertake lazily, but which can be
2601 performed now so that they do not have to be performed in
2602 translation units which include the PCH file. */
2605 note_decl_for_pch (tree decl
)
2607 gcc_assert (pch_file
);
2609 /* There's a good chance that we'll have to mangle names at some
2610 point, even if only for emission in debugging information. */
2611 if ((TREE_CODE (decl
) == VAR_DECL
2612 || TREE_CODE (decl
) == FUNCTION_DECL
)
2613 && !processing_template_decl
)
2617 /* Finish processing a complete template declaration. The PARMS are
2618 the template parameters. */
2621 finish_template_decl (tree parms
)
2624 end_template_decl ();
2626 end_specialization ();
2629 /* Finish processing a template-id (which names a type) of the form
2630 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2631 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2632 the scope of template-id indicated. */
2635 finish_template_type (tree name
, tree args
, int entering_scope
)
2639 decl
= lookup_template_class (name
, args
,
2640 NULL_TREE
, NULL_TREE
, entering_scope
,
2641 tf_warning_or_error
| tf_user
);
2642 if (decl
!= error_mark_node
)
2643 decl
= TYPE_STUB_DECL (decl
);
2648 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2649 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2650 BASE_CLASS, or NULL_TREE if an error occurred. The
2651 ACCESS_SPECIFIER is one of
2652 access_{default,public,protected_private}_node. For a virtual base
2653 we set TREE_TYPE. */
2656 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2660 if (base
== error_mark_node
)
2662 error ("invalid base-class specification");
2665 else if (! MAYBE_CLASS_TYPE_P (base
))
2667 error ("%qT is not a class type", base
);
2672 if (cp_type_quals (base
) != 0)
2674 error ("base class %qT has cv qualifiers", base
);
2675 base
= TYPE_MAIN_VARIANT (base
);
2677 result
= build_tree_list (access
, base
);
2679 TREE_TYPE (result
) = integer_type_node
;
2685 /* If FNS is a member function, a set of member functions, or a
2686 template-id referring to one or more member functions, return a
2687 BASELINK for FNS, incorporating the current access context.
2688 Otherwise, return FNS unchanged. */
2691 baselink_for_fns (tree fns
)
2696 if (BASELINK_P (fns
)
2697 || error_operand_p (fns
))
2701 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2702 fn
= TREE_OPERAND (fn
, 0);
2703 fn
= get_first_fn (fn
);
2704 if (!DECL_FUNCTION_MEMBER_P (fn
))
2707 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2709 cl
= DECL_CONTEXT (fn
);
2710 cl
= TYPE_BINFO (cl
);
2711 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2714 /* Returns true iff DECL is an automatic variable from a function outside
2718 outer_automatic_var_p (tree decl
)
2720 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2721 && DECL_FUNCTION_SCOPE_P (decl
)
2722 && !TREE_STATIC (decl
)
2723 && DECL_CONTEXT (decl
) != current_function_decl
);
2726 /* Returns true iff DECL is a capture field from a lambda that is not our
2727 immediate context. */
2730 outer_lambda_capture_p (tree decl
)
2732 return (TREE_CODE (decl
) == FIELD_DECL
2733 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2734 && (!current_class_type
2735 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2738 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2739 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2740 if non-NULL, is the type or namespace used to explicitly qualify
2741 ID_EXPRESSION. DECL is the entity to which that name has been
2744 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2745 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2746 be set to true if this expression isn't permitted in a
2747 constant-expression, but it is otherwise not set by this function.
2748 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2749 constant-expression, but a non-constant expression is also
2752 DONE is true if this expression is a complete postfix-expression;
2753 it is false if this expression is followed by '->', '[', '(', etc.
2754 ADDRESS_P is true iff this expression is the operand of '&'.
2755 TEMPLATE_P is true iff the qualified-id was of the form
2756 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2757 appears as a template argument.
2759 If an error occurs, and it is the kind of error that might cause
2760 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2761 is the caller's responsibility to issue the message. *ERROR_MSG
2762 will be a string with static storage duration, so the caller need
2765 Return an expression for the entity, after issuing appropriate
2766 diagnostics. This function is also responsible for transforming a
2767 reference to a non-static member into a COMPONENT_REF that makes
2768 the use of "this" explicit.
2770 Upon return, *IDK will be filled in appropriately. */
2772 finish_id_expression (tree id_expression
,
2776 bool integral_constant_expression_p
,
2777 bool allow_non_integral_constant_expression_p
,
2778 bool *non_integral_constant_expression_p
,
2782 bool template_arg_p
,
2783 const char **error_msg
,
2784 location_t location
)
2786 /* Initialize the output parameters. */
2787 *idk
= CP_ID_KIND_NONE
;
2790 if (id_expression
== error_mark_node
)
2791 return error_mark_node
;
2792 /* If we have a template-id, then no further lookup is
2793 required. If the template-id was for a template-class, we
2794 will sometimes have a TYPE_DECL at this point. */
2795 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2796 || TREE_CODE (decl
) == TYPE_DECL
)
2798 /* Look up the name. */
2801 if (decl
== error_mark_node
)
2803 /* Name lookup failed. */
2806 || (!dependent_type_p (scope
)
2807 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2808 && IDENTIFIER_TYPENAME_P (id_expression
)
2809 && dependent_type_p (TREE_TYPE (id_expression
))))))
2811 /* If the qualifying type is non-dependent (and the name
2812 does not name a conversion operator to a dependent
2813 type), issue an error. */
2814 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2815 return error_mark_node
;
2819 /* It may be resolved via Koenig lookup. */
2820 *idk
= CP_ID_KIND_UNQUALIFIED
;
2821 return id_expression
;
2824 decl
= id_expression
;
2826 /* If DECL is a variable that would be out of scope under
2827 ANSI/ISO rules, but in scope in the ARM, name lookup
2828 will succeed. Issue a diagnostic here. */
2830 decl
= check_for_out_of_scope_variable (decl
);
2832 /* Remember that the name was used in the definition of
2833 the current class so that we can check later to see if
2834 the meaning would have been different after the class
2835 was entirely defined. */
2836 if (!scope
&& decl
!= error_mark_node
2837 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
2838 maybe_note_name_used_in_class (id_expression
, decl
);
2840 /* Disallow uses of local variables from containing functions, except
2841 within lambda-expressions. */
2842 if ((outer_automatic_var_p (decl
)
2843 || outer_lambda_capture_p (decl
))
2844 /* It's not a use (3.2) if we're in an unevaluated context. */
2845 && !cp_unevaluated_operand
)
2847 tree context
= DECL_CONTEXT (decl
);
2848 tree containing_function
= current_function_decl
;
2849 tree lambda_stack
= NULL_TREE
;
2850 tree lambda_expr
= NULL_TREE
;
2851 tree initializer
= decl
;
2853 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2854 support for an approach in which a reference to a local
2855 [constant] automatic variable in a nested class or lambda body
2856 would enter the expression as an rvalue, which would reduce
2857 the complexity of the problem"
2859 FIXME update for final resolution of core issue 696. */
2860 if (decl_constant_var_p (decl
))
2861 return integral_constant_value (decl
);
2863 if (TYPE_P (context
))
2865 /* Implicit capture of an explicit capture. */
2866 context
= lambda_function (context
);
2867 initializer
= thisify_lambda_field (decl
);
2870 /* If we are in a lambda function, we can move out until we hit
2872 2. a non-lambda function, or
2873 3. a non-default capturing lambda function. */
2874 while (context
!= containing_function
2875 && LAMBDA_FUNCTION_P (containing_function
))
2877 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2878 (DECL_CONTEXT (containing_function
));
2880 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2884 lambda_stack
= tree_cons (NULL_TREE
,
2889 = decl_function_context (containing_function
);
2892 if (context
== containing_function
)
2894 decl
= add_default_capture (lambda_stack
,
2895 /*id=*/DECL_NAME (decl
),
2898 else if (lambda_expr
)
2900 error ("%qD is not captured", decl
);
2901 return error_mark_node
;
2905 error (TREE_CODE (decl
) == VAR_DECL
2906 ? "use of %<auto%> variable from containing function"
2907 : "use of parameter from containing function");
2908 error (" %q+#D declared here", decl
);
2909 return error_mark_node
;
2913 /* Also disallow uses of function parameters outside the function
2914 body, except inside an unevaluated context (i.e. decltype). */
2915 if (TREE_CODE (decl
) == PARM_DECL
2916 && DECL_CONTEXT (decl
) == NULL_TREE
2917 && !cp_unevaluated_operand
)
2919 error ("use of parameter %qD outside function body", decl
);
2920 return error_mark_node
;
2924 /* If we didn't find anything, or what we found was a type,
2925 then this wasn't really an id-expression. */
2926 if (TREE_CODE (decl
) == TEMPLATE_DECL
2927 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2929 *error_msg
= "missing template arguments";
2930 return error_mark_node
;
2932 else if (TREE_CODE (decl
) == TYPE_DECL
2933 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2935 *error_msg
= "expected primary-expression";
2936 return error_mark_node
;
2939 /* If the name resolved to a template parameter, there is no
2940 need to look it up again later. */
2941 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2942 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2946 *idk
= CP_ID_KIND_NONE
;
2947 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2948 decl
= TEMPLATE_PARM_DECL (decl
);
2949 r
= convert_from_reference (DECL_INITIAL (decl
));
2951 if (integral_constant_expression_p
2952 && !dependent_type_p (TREE_TYPE (decl
))
2953 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2955 if (!allow_non_integral_constant_expression_p
)
2956 error ("template parameter %qD of type %qT is not allowed in "
2957 "an integral constant expression because it is not of "
2958 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2959 *non_integral_constant_expression_p
= true;
2963 /* Similarly, we resolve enumeration constants to their
2964 underlying values. */
2965 else if (TREE_CODE (decl
) == CONST_DECL
)
2967 *idk
= CP_ID_KIND_NONE
;
2968 if (!processing_template_decl
)
2970 used_types_insert (TREE_TYPE (decl
));
2971 return DECL_INITIAL (decl
);
2979 /* If the declaration was explicitly qualified indicate
2980 that. The semantics of `A::f(3)' are different than
2981 `f(3)' if `f' is virtual. */
2983 ? CP_ID_KIND_QUALIFIED
2984 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2985 ? CP_ID_KIND_TEMPLATE_ID
2986 : CP_ID_KIND_UNQUALIFIED
));
2991 An id-expression is type-dependent if it contains an
2992 identifier that was declared with a dependent type.
2994 The standard is not very specific about an id-expression that
2995 names a set of overloaded functions. What if some of them
2996 have dependent types and some of them do not? Presumably,
2997 such a name should be treated as a dependent name. */
2998 /* Assume the name is not dependent. */
2999 dependent_p
= false;
3000 if (!processing_template_decl
)
3001 /* No names are dependent outside a template. */
3003 /* A template-id where the name of the template was not resolved
3004 is definitely dependent. */
3005 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3006 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3007 == IDENTIFIER_NODE
))
3009 /* For anything except an overloaded function, just check its
3011 else if (!is_overloaded_fn (decl
))
3013 = dependent_type_p (TREE_TYPE (decl
));
3014 /* For a set of overloaded functions, check each of the
3020 if (BASELINK_P (fns
))
3021 fns
= BASELINK_FUNCTIONS (fns
);
3023 /* For a template-id, check to see if the template
3024 arguments are dependent. */
3025 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3027 tree args
= TREE_OPERAND (fns
, 1);
3028 dependent_p
= any_dependent_template_arguments_p (args
);
3029 /* The functions are those referred to by the
3031 fns
= TREE_OPERAND (fns
, 0);
3034 /* If there are no dependent template arguments, go through
3035 the overloaded functions. */
3036 while (fns
&& !dependent_p
)
3038 tree fn
= OVL_CURRENT (fns
);
3040 /* Member functions of dependent classes are
3042 if (TREE_CODE (fn
) == FUNCTION_DECL
3043 && type_dependent_expression_p (fn
))
3045 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3046 && dependent_template_p (fn
))
3049 fns
= OVL_NEXT (fns
);
3053 /* If the name was dependent on a template parameter, we will
3054 resolve the name at instantiation time. */
3057 /* Create a SCOPE_REF for qualified names, if the scope is
3063 if (address_p
&& done
)
3064 decl
= finish_qualified_id_expr (scope
, decl
,
3070 tree type
= NULL_TREE
;
3071 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3072 type
= TREE_TYPE (decl
);
3073 decl
= build_qualified_name (type
,
3079 if (TREE_TYPE (decl
))
3080 decl
= convert_from_reference (decl
);
3083 /* A TEMPLATE_ID already contains all the information we
3085 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3086 return id_expression
;
3087 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3088 /* If we found a variable, then name lookup during the
3089 instantiation will always resolve to the same VAR_DECL
3090 (or an instantiation thereof). */
3091 if (TREE_CODE (decl
) == VAR_DECL
3092 || TREE_CODE (decl
) == PARM_DECL
)
3093 return convert_from_reference (decl
);
3094 /* The same is true for FIELD_DECL, but we also need to
3095 make sure that the syntax is correct. */
3096 else if (TREE_CODE (decl
) == FIELD_DECL
)
3098 /* Since SCOPE is NULL here, this is an unqualified name.
3099 Access checking has been performed during name lookup
3100 already. Turn off checking to avoid duplicate errors. */
3101 push_deferring_access_checks (dk_no_check
);
3102 decl
= finish_non_static_data_member
3104 /*qualifying_scope=*/NULL_TREE
);
3105 pop_deferring_access_checks ();
3108 return id_expression
;
3111 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3113 error ("use of namespace %qD as expression", decl
);
3114 return error_mark_node
;
3116 else if (DECL_CLASS_TEMPLATE_P (decl
))
3118 error ("use of class template %qT as expression", decl
);
3119 return error_mark_node
;
3121 else if (TREE_CODE (decl
) == TREE_LIST
)
3123 /* Ambiguous reference to base members. */
3124 error ("request for member %qD is ambiguous in "
3125 "multiple inheritance lattice", id_expression
);
3126 print_candidates (decl
);
3127 return error_mark_node
;
3130 /* Mark variable-like entities as used. Functions are similarly
3131 marked either below or after overload resolution. */
3132 if (TREE_CODE (decl
) == VAR_DECL
3133 || TREE_CODE (decl
) == PARM_DECL
3134 || TREE_CODE (decl
) == RESULT_DECL
)
3137 /* Only certain kinds of names are allowed in constant
3138 expression. Enumerators and template parameters have already
3139 been handled above. */
3140 if (integral_constant_expression_p
3141 && ! decl_constant_var_p (decl
)
3142 && ! builtin_valid_in_constant_expr_p (decl
))
3144 if (!allow_non_integral_constant_expression_p
)
3146 error ("%qD cannot appear in a constant-expression", decl
);
3147 return error_mark_node
;
3149 *non_integral_constant_expression_p
= true;
3154 decl
= (adjust_result_of_qualified_name_lookup
3155 (decl
, scope
, current_class_type
));
3157 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3160 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3161 decl
= finish_qualified_id_expr (scope
,
3169 tree r
= convert_from_reference (decl
);
3171 /* In a template, return a SCOPE_REF for most qualified-ids
3172 so that we can check access at instantiation time. But if
3173 we're looking at a member of the current instantiation, we
3174 know we have access and building up the SCOPE_REF confuses
3175 non-type template argument handling. */
3176 if (processing_template_decl
&& TYPE_P (scope
)
3177 && !currently_open_class (scope
))
3178 r
= build_qualified_name (TREE_TYPE (r
),
3184 else if (TREE_CODE (decl
) == FIELD_DECL
)
3186 /* Since SCOPE is NULL here, this is an unqualified name.
3187 Access checking has been performed during name lookup
3188 already. Turn off checking to avoid duplicate errors. */
3189 push_deferring_access_checks (dk_no_check
);
3190 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3191 /*qualifying_scope=*/NULL_TREE
);
3192 pop_deferring_access_checks ();
3194 else if (is_overloaded_fn (decl
))
3198 first_fn
= get_first_fn (decl
);
3199 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3200 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3202 if (!really_overloaded_fn (decl
))
3203 mark_used (first_fn
);
3206 && TREE_CODE (first_fn
) == FUNCTION_DECL
3207 && DECL_FUNCTION_MEMBER_P (first_fn
)
3208 && !shared_member_p (decl
))
3210 /* A set of member functions. */
3211 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3212 return finish_class_member_access_expr (decl
, id_expression
,
3213 /*template_p=*/false,
3214 tf_warning_or_error
);
3217 decl
= baselink_for_fns (decl
);
3221 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3222 && DECL_CLASS_SCOPE_P (decl
))
3224 tree context
= context_for_name_lookup (decl
);
3225 if (context
!= current_class_type
)
3227 tree path
= currently_open_derived_class (context
);
3228 perform_or_defer_access_check (TYPE_BINFO (path
),
3233 decl
= convert_from_reference (decl
);
3237 if (TREE_DEPRECATED (decl
))
3238 warn_deprecated_use (decl
, NULL_TREE
);
3243 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3244 use as a type-specifier. */
3247 finish_typeof (tree expr
)
3251 if (type_dependent_expression_p (expr
))
3253 type
= cxx_make_type (TYPEOF_TYPE
);
3254 TYPEOF_TYPE_EXPR (type
) = expr
;
3255 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3260 expr
= mark_type_use (expr
);
3262 type
= unlowered_expr_type (expr
);
3264 if (!type
|| type
== unknown_type_node
)
3266 error ("type of %qE is unknown", expr
);
3267 return error_mark_node
;
3273 /* Perform C++-specific checks for __builtin_offsetof before calling
3277 finish_offsetof (tree expr
)
3279 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3281 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3282 TREE_OPERAND (expr
, 2));
3283 return error_mark_node
;
3285 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3286 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3287 || TREE_TYPE (expr
) == unknown_type_node
)
3289 if (TREE_CODE (expr
) == COMPONENT_REF
3290 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3291 expr
= TREE_OPERAND (expr
, 1);
3292 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3293 return error_mark_node
;
3295 if (TREE_CODE (expr
) == INDIRECT_REF
&& REFERENCE_REF_P (expr
))
3296 expr
= TREE_OPERAND (expr
, 0);
3297 return fold_offsetof (expr
, NULL_TREE
);
3300 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3301 function is broken out from the above for the benefit of the tree-ssa
3305 simplify_aggr_init_expr (tree
*tp
)
3307 tree aggr_init_expr
= *tp
;
3309 /* Form an appropriate CALL_EXPR. */
3310 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3311 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3312 tree type
= TREE_TYPE (slot
);
3315 enum style_t
{ ctor
, arg
, pcc
} style
;
3317 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3319 #ifdef PCC_STATIC_STRUCT_RETURN
3325 gcc_assert (TREE_ADDRESSABLE (type
));
3329 call_expr
= build_call_array_loc (input_location
,
3330 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3332 aggr_init_expr_nargs (aggr_init_expr
),
3333 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3334 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3338 /* Replace the first argument to the ctor with the address of the
3340 cxx_mark_addressable (slot
);
3341 CALL_EXPR_ARG (call_expr
, 0) =
3342 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3344 else if (style
== arg
)
3346 /* Just mark it addressable here, and leave the rest to
3347 expand_call{,_inline}. */
3348 cxx_mark_addressable (slot
);
3349 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3350 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3352 else if (style
== pcc
)
3354 /* If we're using the non-reentrant PCC calling convention, then we
3355 need to copy the returned value out of the static buffer into the
3357 push_deferring_access_checks (dk_no_check
);
3358 call_expr
= build_aggr_init (slot
, call_expr
,
3359 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3360 tf_warning_or_error
);
3361 pop_deferring_access_checks ();
3362 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3365 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3367 tree init
= build_zero_init (type
, NULL_TREE
,
3368 /*static_storage_p=*/false);
3369 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3370 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3377 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3380 emit_associated_thunks (tree fn
)
3382 /* When we use vcall offsets, we emit thunks with the virtual
3383 functions to which they thunk. The whole point of vcall offsets
3384 is so that you can know statically the entire set of thunks that
3385 will ever be needed for a given virtual function, thereby
3386 enabling you to output all the thunks with the function itself. */
3387 if (DECL_VIRTUAL_P (fn
)
3388 /* Do not emit thunks for extern template instantiations. */
3389 && ! DECL_REALLY_EXTERN (fn
))
3393 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3395 if (!THUNK_ALIAS (thunk
))
3397 use_thunk (thunk
, /*emit_p=*/1);
3398 if (DECL_RESULT_THUNK_P (thunk
))
3402 for (probe
= DECL_THUNKS (thunk
);
3403 probe
; probe
= DECL_CHAIN (probe
))
3404 use_thunk (probe
, /*emit_p=*/1);
3408 gcc_assert (!DECL_THUNKS (thunk
));
3413 /* Generate RTL for FN. */
3416 expand_or_defer_fn_1 (tree fn
)
3418 /* When the parser calls us after finishing the body of a template
3419 function, we don't really want to expand the body. */
3420 if (processing_template_decl
)
3422 /* Normally, collection only occurs in rest_of_compilation. So,
3423 if we don't collect here, we never collect junk generated
3424 during the processing of templates until we hit a
3425 non-template function. It's not safe to do this inside a
3426 nested class, though, as the parser may have local state that
3427 is not a GC root. */
3428 if (!function_depth
)
3433 gcc_assert (DECL_SAVED_TREE (fn
));
3435 /* If this is a constructor or destructor body, we have to clone
3437 if (maybe_clone_body (fn
))
3439 /* We don't want to process FN again, so pretend we've written
3440 it out, even though we haven't. */
3441 TREE_ASM_WRITTEN (fn
) = 1;
3442 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3446 /* We make a decision about linkage for these functions at the end
3447 of the compilation. Until that point, we do not want the back
3448 end to output them -- but we do want it to see the bodies of
3449 these functions so that it can inline them as appropriate. */
3450 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3452 if (DECL_INTERFACE_KNOWN (fn
))
3453 /* We've already made a decision as to how this function will
3457 DECL_EXTERNAL (fn
) = 1;
3458 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3459 note_vague_linkage_fn (fn
);
3460 /* A non-template inline function with external linkage will
3461 always be COMDAT. As we must eventually determine the
3462 linkage of all functions, and as that causes writes to
3463 the data mapped in from the PCH file, it's advantageous
3464 to mark the functions at this point. */
3465 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3467 /* This function must have external linkage, as
3468 otherwise DECL_INTERFACE_KNOWN would have been
3470 gcc_assert (TREE_PUBLIC (fn
));
3471 comdat_linkage (fn
);
3472 DECL_INTERFACE_KNOWN (fn
) = 1;
3476 import_export_decl (fn
);
3478 /* If the user wants us to keep all inline functions, then mark
3479 this function as needed so that finish_file will make sure to
3480 output it later. Similarly, all dllexport'd functions must
3481 be emitted; there may be callers in other DLLs. */
3482 if ((flag_keep_inline_functions
3483 && DECL_DECLARED_INLINE_P (fn
)
3484 && !DECL_REALLY_EXTERN (fn
))
3485 || (flag_keep_inline_dllexport
3486 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3490 /* There's no reason to do any of the work here if we're only doing
3491 semantic analysis; this code just generates RTL. */
3492 if (flag_syntax_only
)
3499 expand_or_defer_fn (tree fn
)
3501 if (expand_or_defer_fn_1 (fn
))
3505 /* Expand or defer, at the whim of the compilation unit manager. */
3506 cgraph_finalize_function (fn
, function_depth
> 1);
3507 emit_associated_thunks (fn
);
3520 /* Helper function for walk_tree, used by finalize_nrv below. */
3523 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3525 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3528 /* No need to walk into types. There wouldn't be any need to walk into
3529 non-statements, except that we have to consider STMT_EXPRs. */
3532 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3533 but differs from using NULL_TREE in that it indicates that we care
3534 about the value of the RESULT_DECL. */
3535 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3536 TREE_OPERAND (*tp
, 0) = dp
->result
;
3537 /* Change all cleanups for the NRV to only run when an exception is
3539 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3540 && CLEANUP_DECL (*tp
) == dp
->var
)
3541 CLEANUP_EH_ONLY (*tp
) = 1;
3542 /* Replace the DECL_EXPR for the NRV with an initialization of the
3543 RESULT_DECL, if needed. */
3544 else if (TREE_CODE (*tp
) == DECL_EXPR
3545 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3548 if (DECL_INITIAL (dp
->var
)
3549 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3550 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3551 DECL_INITIAL (dp
->var
));
3553 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3554 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3555 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3558 /* And replace all uses of the NRV with the RESULT_DECL. */
3559 else if (*tp
== dp
->var
)
3562 /* Avoid walking into the same tree more than once. Unfortunately, we
3563 can't just use walk_tree_without duplicates because it would only call
3564 us for the first occurrence of dp->var in the function body. */
3565 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3571 /* Keep iterating. */
3575 /* Called from finish_function to implement the named return value
3576 optimization by overriding all the RETURN_EXPRs and pertinent
3577 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3578 RESULT_DECL for the function. */
3581 finalize_nrv (tree
*tp
, tree var
, tree result
)
3583 struct nrv_data data
;
3585 /* Copy name from VAR to RESULT. */
3586 DECL_NAME (result
) = DECL_NAME (var
);
3587 /* Don't forget that we take its address. */
3588 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3589 /* Finally set DECL_VALUE_EXPR to avoid assigning
3590 a stack slot at -O0 for the original var and debug info
3591 uses RESULT location for VAR. */
3592 SET_DECL_VALUE_EXPR (var
, result
);
3593 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3596 data
.result
= result
;
3597 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3598 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3599 htab_delete (data
.visited
);
3602 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3605 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3606 bool need_copy_ctor
, bool need_copy_assignment
)
3608 int save_errorcount
= errorcount
;
3611 /* Always allocate 3 elements for simplicity. These are the
3612 function decls for the ctor, dtor, and assignment op.
3613 This layout is known to the three lang hooks,
3614 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3615 and cxx_omp_clause_assign_op. */
3616 info
= make_tree_vec (3);
3617 CP_OMP_CLAUSE_INFO (c
) = info
;
3619 if (need_default_ctor
|| need_copy_ctor
)
3621 if (need_default_ctor
)
3622 t
= get_default_ctor (type
);
3624 t
= get_copy_ctor (type
);
3626 if (t
&& !trivial_fn_p (t
))
3627 TREE_VEC_ELT (info
, 0) = t
;
3630 if ((need_default_ctor
|| need_copy_ctor
)
3631 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3632 TREE_VEC_ELT (info
, 1) = get_dtor (type
);
3634 if (need_copy_assignment
)
3636 t
= get_copy_assign (type
);
3638 if (t
&& !trivial_fn_p (t
))
3639 TREE_VEC_ELT (info
, 2) = t
;
3642 return errorcount
!= save_errorcount
;
3645 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3646 Remove any elements from the list that are invalid. */
3649 finish_omp_clauses (tree clauses
)
3651 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3652 tree c
, t
, *pc
= &clauses
;
3655 bitmap_obstack_initialize (NULL
);
3656 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3657 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3658 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3660 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3662 bool remove
= false;
3664 switch (OMP_CLAUSE_CODE (c
))
3666 case OMP_CLAUSE_SHARED
:
3668 goto check_dup_generic
;
3669 case OMP_CLAUSE_PRIVATE
:
3671 goto check_dup_generic
;
3672 case OMP_CLAUSE_REDUCTION
:
3674 goto check_dup_generic
;
3675 case OMP_CLAUSE_COPYPRIVATE
:
3676 name
= "copyprivate";
3677 goto check_dup_generic
;
3678 case OMP_CLAUSE_COPYIN
:
3680 goto check_dup_generic
;
3682 t
= OMP_CLAUSE_DECL (c
);
3683 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3685 if (processing_template_decl
)
3688 error ("%qD is not a variable in clause %qs", t
, name
);
3690 error ("%qE is not a variable in clause %qs", t
, name
);
3693 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3694 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3695 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3697 error ("%qD appears more than once in data clauses", t
);
3701 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3704 case OMP_CLAUSE_FIRSTPRIVATE
:
3705 t
= OMP_CLAUSE_DECL (c
);
3706 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3708 if (processing_template_decl
)
3711 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3713 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3716 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3717 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3719 error ("%qD appears more than once in data clauses", t
);
3723 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3726 case OMP_CLAUSE_LASTPRIVATE
:
3727 t
= OMP_CLAUSE_DECL (c
);
3728 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3730 if (processing_template_decl
)
3733 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3735 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3738 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3739 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3741 error ("%qD appears more than once in data clauses", t
);
3745 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3749 t
= OMP_CLAUSE_IF_EXPR (c
);
3750 t
= maybe_convert_cond (t
);
3751 if (t
== error_mark_node
)
3753 OMP_CLAUSE_IF_EXPR (c
) = t
;
3756 case OMP_CLAUSE_NUM_THREADS
:
3757 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3758 if (t
== error_mark_node
)
3760 else if (!type_dependent_expression_p (t
)
3761 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3763 error ("num_threads expression must be integral");
3768 case OMP_CLAUSE_SCHEDULE
:
3769 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3772 else if (t
== error_mark_node
)
3774 else if (!type_dependent_expression_p (t
)
3775 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3777 error ("schedule chunk size expression must be integral");
3782 case OMP_CLAUSE_NOWAIT
:
3783 case OMP_CLAUSE_ORDERED
:
3784 case OMP_CLAUSE_DEFAULT
:
3785 case OMP_CLAUSE_UNTIED
:
3786 case OMP_CLAUSE_COLLAPSE
:
3794 *pc
= OMP_CLAUSE_CHAIN (c
);
3796 pc
= &OMP_CLAUSE_CHAIN (c
);
3799 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3801 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3802 bool remove
= false;
3803 bool need_complete_non_reference
= false;
3804 bool need_default_ctor
= false;
3805 bool need_copy_ctor
= false;
3806 bool need_copy_assignment
= false;
3807 bool need_implicitly_determined
= false;
3808 tree type
, inner_type
;
3812 case OMP_CLAUSE_SHARED
:
3814 need_implicitly_determined
= true;
3816 case OMP_CLAUSE_PRIVATE
:
3818 need_complete_non_reference
= true;
3819 need_default_ctor
= true;
3820 need_implicitly_determined
= true;
3822 case OMP_CLAUSE_FIRSTPRIVATE
:
3823 name
= "firstprivate";
3824 need_complete_non_reference
= true;
3825 need_copy_ctor
= true;
3826 need_implicitly_determined
= true;
3828 case OMP_CLAUSE_LASTPRIVATE
:
3829 name
= "lastprivate";
3830 need_complete_non_reference
= true;
3831 need_copy_assignment
= true;
3832 need_implicitly_determined
= true;
3834 case OMP_CLAUSE_REDUCTION
:
3836 need_implicitly_determined
= true;
3838 case OMP_CLAUSE_COPYPRIVATE
:
3839 name
= "copyprivate";
3840 need_copy_assignment
= true;
3842 case OMP_CLAUSE_COPYIN
:
3844 need_copy_assignment
= true;
3847 pc
= &OMP_CLAUSE_CHAIN (c
);
3851 t
= OMP_CLAUSE_DECL (c
);
3852 if (processing_template_decl
3853 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3855 pc
= &OMP_CLAUSE_CHAIN (c
);
3861 case OMP_CLAUSE_LASTPRIVATE
:
3862 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3863 need_default_ctor
= true;
3866 case OMP_CLAUSE_REDUCTION
:
3867 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3868 || POINTER_TYPE_P (TREE_TYPE (t
)))
3870 error ("%qE has invalid type for %<reduction%>", t
);
3873 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3875 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3883 error ("%qE has invalid type for %<reduction(%s)%>",
3884 t
, operator_name_info
[r_code
].name
);
3890 case OMP_CLAUSE_COPYIN
:
3891 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3893 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3902 if (need_complete_non_reference
)
3904 t
= require_complete_type (t
);
3905 if (t
== error_mark_node
)
3907 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3909 error ("%qE has reference type for %qs", t
, name
);
3913 if (need_implicitly_determined
)
3915 const char *share_name
= NULL
;
3917 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3918 share_name
= "threadprivate";
3919 else switch (cxx_omp_predetermined_sharing (t
))
3921 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3923 case OMP_CLAUSE_DEFAULT_SHARED
:
3924 share_name
= "shared";
3926 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3927 share_name
= "private";
3934 error ("%qE is predetermined %qs for %qs",
3935 t
, share_name
, name
);
3940 /* We're interested in the base element, not arrays. */
3941 inner_type
= type
= TREE_TYPE (t
);
3942 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3943 inner_type
= TREE_TYPE (inner_type
);
3945 /* Check for special function availability by building a call to one.
3946 Save the results, because later we won't be in the right context
3947 for making these queries. */
3948 if (CLASS_TYPE_P (inner_type
)
3949 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
3950 && !type_dependent_expression_p (t
)
3951 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
3952 need_copy_ctor
, need_copy_assignment
))
3956 *pc
= OMP_CLAUSE_CHAIN (c
);
3958 pc
= &OMP_CLAUSE_CHAIN (c
);
3961 bitmap_obstack_release (NULL
);
3965 /* For all variables in the tree_list VARS, mark them as thread local. */
3968 finish_omp_threadprivate (tree vars
)
3972 /* Mark every variable in VARS to be assigned thread local storage. */
3973 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
3975 tree v
= TREE_PURPOSE (t
);
3977 if (error_operand_p (v
))
3979 else if (TREE_CODE (v
) != VAR_DECL
)
3980 error ("%<threadprivate%> %qD is not file, namespace "
3981 "or block scope variable", v
);
3982 /* If V had already been marked threadprivate, it doesn't matter
3983 whether it had been used prior to this point. */
3984 else if (TREE_USED (v
)
3985 && (DECL_LANG_SPECIFIC (v
) == NULL
3986 || !CP_DECL_THREADPRIVATE_P (v
)))
3987 error ("%qE declared %<threadprivate%> after first use", v
);
3988 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
3989 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
3990 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
3991 error ("%<threadprivate%> %qE has incomplete type", v
);
3992 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
3993 && CP_DECL_CONTEXT (v
) != current_class_type
)
3994 error ("%<threadprivate%> %qE directive not "
3995 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
3998 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3999 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4001 retrofit_lang_decl (v
);
4003 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4004 after the allocation of the lang_decl structure. */
4005 if (DECL_DISCRIMINATOR_P (v
))
4006 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4009 if (! DECL_THREAD_LOCAL_P (v
))
4011 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4012 /* If rtl has been already set for this var, call
4013 make_decl_rtl once again, so that encode_section_info
4014 has a chance to look at the new decl flags. */
4015 if (DECL_RTL_SET_P (v
))
4018 CP_DECL_THREADPRIVATE_P (v
) = 1;
4023 /* Build an OpenMP structured block. */
4026 begin_omp_structured_block (void)
4028 return do_pushlevel (sk_omp
);
4032 finish_omp_structured_block (tree block
)
4034 return do_poplevel (block
);
4037 /* Similarly, except force the retention of the BLOCK. */
4040 begin_omp_parallel (void)
4042 keep_next_level (true);
4043 return begin_omp_structured_block ();
4047 finish_omp_parallel (tree clauses
, tree body
)
4051 body
= finish_omp_structured_block (body
);
4053 stmt
= make_node (OMP_PARALLEL
);
4054 TREE_TYPE (stmt
) = void_type_node
;
4055 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4056 OMP_PARALLEL_BODY (stmt
) = body
;
4058 return add_stmt (stmt
);
4062 begin_omp_task (void)
4064 keep_next_level (true);
4065 return begin_omp_structured_block ();
4069 finish_omp_task (tree clauses
, tree body
)
4073 body
= finish_omp_structured_block (body
);
4075 stmt
= make_node (OMP_TASK
);
4076 TREE_TYPE (stmt
) = void_type_node
;
4077 OMP_TASK_CLAUSES (stmt
) = clauses
;
4078 OMP_TASK_BODY (stmt
) = body
;
4080 return add_stmt (stmt
);
4083 /* Helper function for finish_omp_for. Convert Ith random access iterator
4084 into integral iterator. Return FALSE if successful. */
4087 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4088 tree condv
, tree incrv
, tree
*body
,
4089 tree
*pre_body
, tree clauses
)
4091 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4092 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4093 tree decl
= TREE_VEC_ELT (declv
, i
);
4094 tree init
= TREE_VEC_ELT (initv
, i
);
4095 tree cond
= TREE_VEC_ELT (condv
, i
);
4096 tree incr
= TREE_VEC_ELT (incrv
, i
);
4098 location_t elocus
= locus
;
4100 if (init
&& EXPR_HAS_LOCATION (init
))
4101 elocus
= EXPR_LOCATION (init
);
4103 switch (TREE_CODE (cond
))
4109 if (TREE_OPERAND (cond
, 1) == iter
)
4110 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4111 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4112 if (TREE_OPERAND (cond
, 0) != iter
)
4113 cond
= error_mark_node
;
4116 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4117 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4118 NULL
, tf_warning_or_error
);
4119 if (error_operand_p (tem
))
4124 cond
= error_mark_node
;
4127 if (cond
== error_mark_node
)
4129 error_at (elocus
, "invalid controlling predicate");
4132 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4133 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4134 tf_warning_or_error
);
4135 if (error_operand_p (diff
))
4137 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4139 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4140 TREE_OPERAND (cond
, 1), iter
);
4144 switch (TREE_CODE (incr
))
4146 case PREINCREMENT_EXPR
:
4147 case PREDECREMENT_EXPR
:
4148 case POSTINCREMENT_EXPR
:
4149 case POSTDECREMENT_EXPR
:
4150 if (TREE_OPERAND (incr
, 0) != iter
)
4152 incr
= error_mark_node
;
4155 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4156 tf_warning_or_error
);
4157 if (error_operand_p (iter_incr
))
4159 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4160 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4161 incr
= integer_one_node
;
4163 incr
= integer_minus_one_node
;
4166 if (TREE_OPERAND (incr
, 0) != iter
)
4167 incr
= error_mark_node
;
4168 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4169 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4171 tree rhs
= TREE_OPERAND (incr
, 1);
4172 if (TREE_OPERAND (rhs
, 0) == iter
)
4174 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4176 incr
= error_mark_node
;
4179 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4180 TREE_OPERAND (rhs
, 1),
4181 tf_warning_or_error
);
4182 if (error_operand_p (iter_incr
))
4184 incr
= TREE_OPERAND (rhs
, 1);
4185 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4186 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4188 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4189 incr
= fold_if_not_in_template (incr
);
4191 if (TREE_CODE (incr
) != INTEGER_CST
4192 && (TREE_CODE (incr
) != NOP_EXPR
4193 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4198 else if (TREE_OPERAND (rhs
, 1) == iter
)
4200 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4201 || TREE_CODE (rhs
) != PLUS_EXPR
)
4202 incr
= error_mark_node
;
4205 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4206 TREE_OPERAND (rhs
, 0),
4209 tf_warning_or_error
);
4210 if (error_operand_p (iter_incr
))
4212 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4214 tf_warning_or_error
);
4215 if (error_operand_p (iter_incr
))
4217 incr
= TREE_OPERAND (rhs
, 0);
4222 incr
= error_mark_node
;
4225 incr
= error_mark_node
;
4228 incr
= error_mark_node
;
4232 if (incr
== error_mark_node
)
4234 error_at (elocus
, "invalid increment expression");
4238 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4239 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4240 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4241 && OMP_CLAUSE_DECL (c
) == iter
)
4244 decl
= create_temporary_var (TREE_TYPE (diff
));
4246 add_decl_expr (decl
);
4247 last
= create_temporary_var (TREE_TYPE (diff
));
4249 add_decl_expr (last
);
4250 if (c
&& iter_incr
== NULL
)
4252 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4253 pushdecl (incr_var
);
4254 add_decl_expr (incr_var
);
4256 gcc_assert (stmts_are_full_exprs_p ());
4258 orig_pre_body
= *pre_body
;
4259 *pre_body
= push_stmt_list ();
4261 add_stmt (orig_pre_body
);
4263 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4264 tf_warning_or_error
));
4265 init
= build_int_cst (TREE_TYPE (diff
), 0);
4266 if (c
&& iter_incr
== NULL
)
4268 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4269 incr
, tf_warning_or_error
));
4271 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4272 tf_warning_or_error
);
4274 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4275 tf_warning_or_error
));
4276 *pre_body
= pop_stmt_list (*pre_body
);
4278 cond
= cp_build_binary_op (elocus
,
4279 TREE_CODE (cond
), decl
, diff
,
4280 tf_warning_or_error
);
4281 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4282 elocus
, incr
, NULL_TREE
);
4285 *body
= push_stmt_list ();
4286 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4287 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4288 tf_warning_or_error
);
4289 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4290 finish_expr_stmt (iter_init
);
4291 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4292 tf_warning_or_error
));
4293 add_stmt (orig_body
);
4294 *body
= pop_stmt_list (*body
);
4298 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4299 finish_expr_stmt (iter_incr
);
4300 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4301 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4304 TREE_VEC_ELT (declv
, i
) = decl
;
4305 TREE_VEC_ELT (initv
, i
) = init
;
4306 TREE_VEC_ELT (condv
, i
) = cond
;
4307 TREE_VEC_ELT (incrv
, i
) = incr
;
4312 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4313 are directly for their associated operands in the statement. DECL
4314 and INIT are a combo; if DECL is NULL then INIT ought to be a
4315 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4316 optional statements that need to go before the loop into its
4320 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4321 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4323 tree omp_for
= NULL
, orig_incr
= NULL
;
4324 tree decl
, init
, cond
, incr
;
4328 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4329 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4330 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4331 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4333 decl
= TREE_VEC_ELT (declv
, i
);
4334 init
= TREE_VEC_ELT (initv
, i
);
4335 cond
= TREE_VEC_ELT (condv
, i
);
4336 incr
= TREE_VEC_ELT (incrv
, i
);
4342 switch (TREE_CODE (init
))
4345 decl
= TREE_OPERAND (init
, 0);
4346 init
= TREE_OPERAND (init
, 1);
4349 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4351 decl
= TREE_OPERAND (init
, 0);
4352 init
= TREE_OPERAND (init
, 2);
4362 "expected iteration declaration or initialization");
4367 if (init
&& EXPR_HAS_LOCATION (init
))
4368 elocus
= EXPR_LOCATION (init
);
4372 error_at (elocus
, "missing controlling predicate");
4378 error_at (elocus
, "missing increment expression");
4382 TREE_VEC_ELT (declv
, i
) = decl
;
4383 TREE_VEC_ELT (initv
, i
) = init
;
4386 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4390 stmt
= make_node (OMP_FOR
);
4392 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4394 /* This is really just a place-holder. We'll be decomposing this
4395 again and going through the cp_build_modify_expr path below when
4396 we instantiate the thing. */
4397 TREE_VEC_ELT (initv
, i
)
4398 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4399 TREE_VEC_ELT (initv
, i
));
4402 TREE_TYPE (stmt
) = void_type_node
;
4403 OMP_FOR_INIT (stmt
) = initv
;
4404 OMP_FOR_COND (stmt
) = condv
;
4405 OMP_FOR_INCR (stmt
) = incrv
;
4406 OMP_FOR_BODY (stmt
) = body
;
4407 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4408 OMP_FOR_CLAUSES (stmt
) = clauses
;
4410 SET_EXPR_LOCATION (stmt
, locus
);
4411 return add_stmt (stmt
);
4414 if (processing_template_decl
)
4415 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4417 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4419 decl
= TREE_VEC_ELT (declv
, i
);
4420 init
= TREE_VEC_ELT (initv
, i
);
4421 cond
= TREE_VEC_ELT (condv
, i
);
4422 incr
= TREE_VEC_ELT (incrv
, i
);
4424 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4427 if (init
&& EXPR_HAS_LOCATION (init
))
4428 elocus
= EXPR_LOCATION (init
);
4432 error_at (elocus
, "expected iteration declaration or initialization");
4436 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4439 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4440 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4441 TREE_CODE (TREE_OPERAND (incr
, 1)),
4442 TREE_OPERAND (incr
, 2),
4443 tf_warning_or_error
);
4446 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4448 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4449 incrv
, &body
, &pre_body
, clauses
))
4454 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4455 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4457 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4461 if (!processing_template_decl
)
4463 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4464 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4467 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4469 && TREE_SIDE_EFFECTS (cond
)
4470 && COMPARISON_CLASS_P (cond
)
4471 && !processing_template_decl
)
4473 tree t
= TREE_OPERAND (cond
, 0);
4474 if (TREE_SIDE_EFFECTS (t
)
4476 && (TREE_CODE (t
) != NOP_EXPR
4477 || TREE_OPERAND (t
, 0) != decl
))
4478 TREE_OPERAND (cond
, 0)
4479 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4481 t
= TREE_OPERAND (cond
, 1);
4482 if (TREE_SIDE_EFFECTS (t
)
4484 && (TREE_CODE (t
) != NOP_EXPR
4485 || TREE_OPERAND (t
, 0) != decl
))
4486 TREE_OPERAND (cond
, 1)
4487 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4489 if (decl
== error_mark_node
|| init
== error_mark_node
)
4492 TREE_VEC_ELT (declv
, i
) = decl
;
4493 TREE_VEC_ELT (initv
, i
) = init
;
4494 TREE_VEC_ELT (condv
, i
) = cond
;
4495 TREE_VEC_ELT (incrv
, i
) = incr
;
4499 if (IS_EMPTY_STMT (pre_body
))
4502 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4505 if (omp_for
== NULL
)
4508 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4510 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4511 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4513 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4516 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4517 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4518 && !processing_template_decl
)
4520 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4521 if (TREE_SIDE_EFFECTS (t
)
4523 && (TREE_CODE (t
) != NOP_EXPR
4524 || TREE_OPERAND (t
, 0) != decl
))
4525 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4526 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4528 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4529 if (TREE_SIDE_EFFECTS (t
)
4531 && (TREE_CODE (t
) != NOP_EXPR
4532 || TREE_OPERAND (t
, 0) != decl
))
4533 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4534 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4538 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4540 if (omp_for
!= NULL
)
4541 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4546 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4555 dependent_p
= false;
4558 /* Even in a template, we can detect invalid uses of the atomic
4559 pragma if neither LHS nor RHS is type-dependent. */
4560 if (processing_template_decl
)
4562 dependent_p
= (type_dependent_expression_p (lhs
)
4563 || type_dependent_expression_p (rhs
));
4566 lhs
= build_non_dependent_expr (lhs
);
4567 rhs
= build_non_dependent_expr (rhs
);
4572 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4573 if (stmt
== error_mark_node
)
4576 if (processing_template_decl
)
4577 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4578 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4583 finish_omp_barrier (void)
4585 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4586 VEC(tree
,gc
) *vec
= make_tree_vector ();
4587 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4588 release_tree_vector (vec
);
4589 finish_expr_stmt (stmt
);
4593 finish_omp_flush (void)
4595 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4596 VEC(tree
,gc
) *vec
= make_tree_vector ();
4597 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4598 release_tree_vector (vec
);
4599 finish_expr_stmt (stmt
);
4603 finish_omp_taskwait (void)
4605 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4606 VEC(tree
,gc
) *vec
= make_tree_vector ();
4607 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4608 release_tree_vector (vec
);
4609 finish_expr_stmt (stmt
);
4613 init_cp_semantics (void)
4617 /* Build a STATIC_ASSERT for a static assertion with the condition
4618 CONDITION and the message text MESSAGE. LOCATION is the location
4619 of the static assertion in the source code. When MEMBER_P, this
4620 static assertion is a member of a class. */
4622 finish_static_assert (tree condition
, tree message
, location_t location
,
4625 if (check_for_bare_parameter_packs (condition
))
4626 condition
= error_mark_node
;
4628 if (type_dependent_expression_p (condition
)
4629 || value_dependent_expression_p (condition
))
4631 /* We're in a template; build a STATIC_ASSERT and put it in
4635 assertion
= make_node (STATIC_ASSERT
);
4636 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4637 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4638 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4641 maybe_add_class_template_decl_list (current_class_type
,
4645 add_stmt (assertion
);
4650 /* Fold the expression and convert it to a boolean value. */
4651 condition
= fold_non_dependent_expr (condition
);
4652 condition
= cp_convert (boolean_type_node
, condition
);
4653 condition
= maybe_constant_value (condition
);
4655 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4656 /* Do nothing; the condition is satisfied. */
4660 location_t saved_loc
= input_location
;
4662 input_location
= location
;
4663 if (TREE_CODE (condition
) == INTEGER_CST
4664 && integer_zerop (condition
))
4665 /* Report the error. */
4666 error ("static assertion failed: %E", message
);
4667 else if (condition
&& condition
!= error_mark_node
)
4669 error ("non-constant condition for static assertion");
4670 cxx_constant_value (condition
);
4672 input_location
= saved_loc
;
4676 /* Returns the type of EXPR for cases where we can determine it even though
4677 EXPR is a type-dependent expression. */
4680 describable_type (tree expr
)
4682 tree type
= NULL_TREE
;
4684 if (! type_dependent_expression_p (expr
)
4685 && ! type_unknown_p (expr
))
4687 type
= unlowered_expr_type (expr
);
4688 if (real_lvalue_p (expr
))
4689 type
= build_reference_type (type
);
4695 switch (TREE_CODE (expr
))
4701 return TREE_TYPE (expr
);
4706 case TEMPLATE_PARM_INDEX
:
4708 case STATIC_CAST_EXPR
:
4709 case REINTERPRET_CAST_EXPR
:
4710 case CONST_CAST_EXPR
:
4711 case DYNAMIC_CAST_EXPR
:
4712 type
= TREE_TYPE (expr
);
4717 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4718 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4719 type
= build_reference_type (TREE_TYPE (ptrtype
));
4724 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4725 type
= TREE_TYPE (expr
);
4729 if (type
&& type_uses_auto (type
))
4735 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4736 suitable for use as a type-specifier.
4738 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4739 id-expression or a class member access, FALSE when it was parsed as
4740 a full expression. */
4743 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
)
4745 tree orig_expr
= expr
;
4746 tree type
= NULL_TREE
;
4748 if (!expr
|| error_operand_p (expr
))
4749 return error_mark_node
;
4752 || TREE_CODE (expr
) == TYPE_DECL
4753 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4754 && TYPE_P (TREE_OPERAND (expr
, 0))))
4756 error ("argument to decltype must be an expression");
4757 return error_mark_node
;
4760 if (type_dependent_expression_p (expr
)
4761 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4762 if it isn't dependent, so that we can check access control at
4763 instantiation time, so defer the decltype as well (PR 42277). */
4764 || (id_expression_or_member_access_p
4765 && processing_template_decl
4766 && TREE_CODE (expr
) == COMPONENT_REF
))
4768 if (id_expression_or_member_access_p
)
4770 switch (TREE_CODE (expr
))
4777 case TEMPLATE_PARM_INDEX
:
4778 type
= TREE_TYPE (expr
);
4786 if (type
&& !type_uses_auto (type
))
4790 type
= cxx_make_type (DECLTYPE_TYPE
);
4791 DECLTYPE_TYPE_EXPR (type
) = expr
;
4792 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4793 = id_expression_or_member_access_p
;
4794 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4799 /* The type denoted by decltype(e) is defined as follows: */
4801 expr
= resolve_nondeduced_context (expr
);
4803 /* To get the size of a static data member declared as an array of
4804 unknown bound, we need to instantiate it. */
4805 if (TREE_CODE (expr
) == VAR_DECL
4806 && VAR_HAD_UNKNOWN_BOUND (expr
)
4807 && DECL_TEMPLATE_INSTANTIATION (expr
))
4808 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4810 if (id_expression_or_member_access_p
)
4812 /* If e is an id-expression or a class member access (5.2.5
4813 [expr.ref]), decltype(e) is defined as the type of the entity
4814 named by e. If there is no such entity, or e names a set of
4815 overloaded functions, the program is ill-formed. */
4816 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4817 expr
= lookup_name (expr
);
4819 if (TREE_CODE (expr
) == INDIRECT_REF
)
4820 /* This can happen when the expression is, e.g., "a.b". Just
4821 look at the underlying operand. */
4822 expr
= TREE_OPERAND (expr
, 0);
4824 if (TREE_CODE (expr
) == OFFSET_REF
4825 || TREE_CODE (expr
) == MEMBER_REF
)
4826 /* We're only interested in the field itself. If it is a
4827 BASELINK, we will need to see through it in the next
4829 expr
= TREE_OPERAND (expr
, 1);
4831 if (TREE_CODE (expr
) == BASELINK
)
4832 /* See through BASELINK nodes to the underlying functions. */
4833 expr
= BASELINK_FUNCTIONS (expr
);
4835 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
4836 expr
= TREE_OPERAND (expr
, 0);
4838 if (TREE_CODE (expr
) == OVERLOAD
)
4840 if (OVL_CHAIN (expr
)
4841 || TREE_CODE (OVL_FUNCTION (expr
)) == TEMPLATE_DECL
)
4843 error ("%qE refers to a set of overloaded functions", orig_expr
);
4844 return error_mark_node
;
4847 /* An overload set containing only one function: just look
4848 at that function. */
4849 expr
= OVL_FUNCTION (expr
);
4852 switch (TREE_CODE (expr
))
4855 if (DECL_BIT_FIELD_TYPE (expr
))
4857 type
= DECL_BIT_FIELD_TYPE (expr
);
4860 /* Fall through for fields that aren't bitfields. */
4867 case TEMPLATE_PARM_INDEX
:
4868 expr
= mark_type_use (expr
);
4869 type
= TREE_TYPE (expr
);
4873 type
= error_mark_node
;
4877 mark_type_use (expr
);
4878 type
= is_bitfield_expr_with_lowered_type (expr
);
4880 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4887 /* We can get here when the id-expression refers to an
4889 type
= TREE_TYPE (expr
);
4893 gcc_assert (TYPE_P (expr
) || DECL_P (expr
)
4894 || TREE_CODE (expr
) == SCOPE_REF
);
4895 error ("argument to decltype must be an expression");
4896 return error_mark_node
;
4901 /* Expressions of reference type are sometimes wrapped in
4902 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4903 representation, not part of the language, so we have to look
4905 if (TREE_CODE (expr
) == INDIRECT_REF
4906 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))
4908 expr
= TREE_OPERAND (expr
, 0);
4910 if (TREE_CODE (expr
) == CALL_EXPR
)
4912 /* If e is a function call (5.2.2 [expr.call]) or an
4913 invocation of an overloaded operator (parentheses around e
4914 are ignored), decltype(e) is defined as the return type of
4916 tree fndecl
= get_callee_fndecl (expr
);
4917 if (fndecl
&& fndecl
!= error_mark_node
)
4918 type
= TREE_TYPE (TREE_TYPE (fndecl
));
4921 tree target_type
= TREE_TYPE (CALL_EXPR_FN (expr
));
4922 if ((TREE_CODE (target_type
) == REFERENCE_TYPE
4923 || TREE_CODE (target_type
) == POINTER_TYPE
)
4924 && (TREE_CODE (TREE_TYPE (target_type
)) == FUNCTION_TYPE
4925 || TREE_CODE (TREE_TYPE (target_type
)) == METHOD_TYPE
))
4926 type
= TREE_TYPE (TREE_TYPE (target_type
));
4927 else if (processing_template_decl
)
4928 /* Within a template finish_call_expr doesn't resolve
4929 CALL_EXPR_FN, so even though this decltype isn't really
4930 dependent let's defer resolving it. */
4931 goto treat_as_dependent
;
4933 sorry ("unable to determine the declared type of expression %<%E%>",
4939 type
= is_bitfield_expr_with_lowered_type (expr
);
4942 /* Bitfields are special, because their type encodes the
4943 number of bits they store. If the expression referenced a
4944 bitfield, TYPE now has the declared type of that
4946 type
= cp_build_qualified_type (type
,
4947 cp_type_quals (TREE_TYPE (expr
)));
4949 if (real_lvalue_p (expr
))
4950 type
= build_reference_type (type
);
4952 /* Within a lambda-expression:
4954 Every occurrence of decltype((x)) where x is a possibly
4955 parenthesized id-expression that names an entity of
4956 automatic storage duration is treated as if x were
4957 transformed into an access to a corresponding data member
4958 of the closure type that would have been declared if x
4959 were a use of the denoted entity. */
4960 else if (outer_automatic_var_p (expr
)
4961 && current_function_decl
4962 && LAMBDA_FUNCTION_P (current_function_decl
))
4963 type
= capture_decltype (expr
);
4966 /* Otherwise, where T is the type of e, if e is an lvalue,
4967 decltype(e) is defined as T&, otherwise decltype(e) is
4969 type
= TREE_TYPE (expr
);
4970 if (type
== error_mark_node
)
4971 return error_mark_node
;
4972 else if (expr
== current_class_ptr
)
4973 /* If the expression is just "this", we want the
4974 cv-unqualified pointer for the "this" type. */
4975 type
= TYPE_MAIN_VARIANT (type
);
4976 else if (real_lvalue_p (expr
))
4978 if (TREE_CODE (type
) != REFERENCE_TYPE
4979 || TYPE_REF_IS_RVALUE (type
))
4980 type
= build_reference_type (non_reference (type
));
4983 type
= non_reference (type
);
4988 if (!type
|| type
== unknown_type_node
)
4990 error ("type of %qE is unknown", expr
);
4991 return error_mark_node
;
4997 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4998 __has_nothrow_copy, depending on assign_p. */
5001 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5008 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5011 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5013 else if (TYPE_HAS_COPY_CTOR (type
))
5015 /* If construction of the copy constructor was postponed, create
5017 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5018 lazily_declare_fn (sfk_copy_constructor
, type
);
5019 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5020 lazily_declare_fn (sfk_move_constructor
, type
);
5021 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5026 for (; fns
; fns
= OVL_NEXT (fns
))
5028 tree fn
= OVL_CURRENT (fns
);
5032 if (copy_fn_p (fn
) == 0)
5035 else if (copy_fn_p (fn
) <= 0)
5038 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5045 /* Actually evaluates the trait. */
5048 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5050 enum tree_code type_code1
;
5053 type_code1
= TREE_CODE (type1
);
5057 case CPTK_HAS_NOTHROW_ASSIGN
:
5058 type1
= strip_array_types (type1
);
5059 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5060 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5061 || (CLASS_TYPE_P (type1
)
5062 && classtype_has_nothrow_assign_or_copy_p (type1
,
5065 case CPTK_HAS_TRIVIAL_ASSIGN
:
5066 /* ??? The standard seems to be missing the "or array of such a class
5067 type" wording for this trait. */
5068 type1
= strip_array_types (type1
);
5069 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5070 && (trivial_type_p (type1
)
5071 || (CLASS_TYPE_P (type1
)
5072 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5074 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5075 type1
= strip_array_types (type1
);
5076 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5077 || (CLASS_TYPE_P (type1
)
5078 && (t
= locate_ctor (type1
))
5079 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5081 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5082 type1
= strip_array_types (type1
);
5083 return (trivial_type_p (type1
)
5084 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5086 case CPTK_HAS_NOTHROW_COPY
:
5087 type1
= strip_array_types (type1
);
5088 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5089 || (CLASS_TYPE_P (type1
)
5090 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5092 case CPTK_HAS_TRIVIAL_COPY
:
5093 /* ??? The standard seems to be missing the "or array of such a class
5094 type" wording for this trait. */
5095 type1
= strip_array_types (type1
);
5096 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5097 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5099 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5100 type1
= strip_array_types (type1
);
5101 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5102 || (CLASS_TYPE_P (type1
)
5103 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5105 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5106 return type_has_virtual_destructor (type1
);
5108 case CPTK_IS_ABSTRACT
:
5109 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5111 case CPTK_IS_BASE_OF
:
5112 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5113 && DERIVED_FROM_P (type1
, type2
));
5116 return (NON_UNION_CLASS_TYPE_P (type1
));
5118 case CPTK_IS_CONVERTIBLE_TO
:
5123 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5126 return (type_code1
== ENUMERAL_TYPE
);
5129 return (pod_type_p (type1
));
5131 case CPTK_IS_POLYMORPHIC
:
5132 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5134 case CPTK_IS_STD_LAYOUT
:
5135 return (std_layout_type_p (type1
));
5137 case CPTK_IS_TRIVIAL
:
5138 return (trivial_type_p (type1
));
5141 return (type_code1
== UNION_TYPE
);
5143 case CPTK_IS_LITERAL_TYPE
:
5144 return (literal_type_p (type1
));
5152 /* Returns true if TYPE is a complete type, an array of unknown bound,
5153 or (possibly cv-qualified) void, returns false otherwise. */
5156 check_trait_type (tree type
)
5158 if (COMPLETE_TYPE_P (type
))
5161 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5162 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5165 if (VOID_TYPE_P (type
))
5171 /* Process a trait expression. */
5174 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5176 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5177 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5178 || kind
== CPTK_HAS_NOTHROW_COPY
5179 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5180 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5181 || kind
== CPTK_HAS_TRIVIAL_COPY
5182 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5183 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5184 || kind
== CPTK_IS_ABSTRACT
5185 || kind
== CPTK_IS_BASE_OF
5186 || kind
== CPTK_IS_CLASS
5187 || kind
== CPTK_IS_CONVERTIBLE_TO
5188 || kind
== CPTK_IS_EMPTY
5189 || kind
== CPTK_IS_ENUM
5190 || kind
== CPTK_IS_POD
5191 || kind
== CPTK_IS_POLYMORPHIC
5192 || kind
== CPTK_IS_STD_LAYOUT
5193 || kind
== CPTK_IS_TRIVIAL
5194 || kind
== CPTK_IS_LITERAL_TYPE
5195 || kind
== CPTK_IS_UNION
);
5197 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5199 sorry ("__is_convertible_to");
5200 return error_mark_node
;
5203 if (type1
== error_mark_node
5204 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5205 && type2
== error_mark_node
))
5206 return error_mark_node
;
5208 if (processing_template_decl
)
5210 tree trait_expr
= make_node (TRAIT_EXPR
);
5211 TREE_TYPE (trait_expr
) = boolean_type_node
;
5212 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5213 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5214 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5218 complete_type (type1
);
5220 complete_type (type2
);
5224 case CPTK_HAS_NOTHROW_ASSIGN
:
5225 case CPTK_HAS_TRIVIAL_ASSIGN
:
5226 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5227 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5228 case CPTK_HAS_NOTHROW_COPY
:
5229 case CPTK_HAS_TRIVIAL_COPY
:
5230 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5231 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5232 case CPTK_IS_ABSTRACT
:
5235 case CPTK_IS_POLYMORPHIC
:
5236 case CPTK_IS_STD_LAYOUT
:
5237 case CPTK_IS_TRIVIAL
:
5238 case CPTK_IS_LITERAL_TYPE
:
5239 if (!check_trait_type (type1
))
5241 error ("incomplete type %qT not allowed", type1
);
5242 return error_mark_node
;
5246 case CPTK_IS_BASE_OF
:
5247 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5248 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5249 && !COMPLETE_TYPE_P (type2
))
5251 error ("incomplete type %qT not allowed", type2
);
5252 return error_mark_node
;
5261 case CPTK_IS_CONVERTIBLE_TO
:
5266 return (trait_expr_value (kind
, type1
, type2
)
5267 ? boolean_true_node
: boolean_false_node
);
5270 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5271 which is ignored for C++. */
5274 set_float_const_decimal64 (void)
5279 clear_float_const_decimal64 (void)
5284 float_const_decimal64_p (void)
5290 /* Return true if T is a literal type. */
5293 literal_type_p (tree t
)
5295 if (SCALAR_TYPE_P (t
))
5297 if (CLASS_TYPE_P (t
))
5298 return CLASSTYPE_LITERAL_P (t
);
5299 if (TREE_CODE (t
) == ARRAY_TYPE
)
5300 return literal_type_p (strip_array_types (t
));
5304 /* If DECL is a variable declared `constexpr', require its type
5305 be literal. Return the DECL if OK, otherwise NULL. */
5308 ensure_literal_type_for_constexpr_object (tree decl
)
5310 tree type
= TREE_TYPE (decl
);
5311 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5312 && !processing_template_decl
5313 /* The call to complete_type is just for initializer_list. */
5314 && !literal_type_p (complete_type (type
)))
5316 error ("the type %qT of constexpr variable %qD is not literal",
5323 /* Representation of entries in the constexpr function definition table. */
5325 typedef struct GTY(()) constexpr_fundef
{
5330 /* This table holds all constexpr function definitions seen in
5331 the current translation unit. */
5333 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5335 /* Utility function used for managing the constexpr function table.
5336 Return true if the entries pointed to by P and Q are for the
5337 same constexpr function. */
5340 constexpr_fundef_equal (const void *p
, const void *q
)
5342 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5343 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5344 return lhs
->decl
== rhs
->decl
;
5347 /* Utility function used for managing the constexpr function table.
5348 Return a hash value for the entry pointed to by Q. */
5350 static inline hashval_t
5351 constexpr_fundef_hash (const void *p
)
5353 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5354 return DECL_UID (fundef
->decl
);
5357 /* Return a previously saved definition of function FUN. */
5359 static constexpr_fundef
*
5360 retrieve_constexpr_fundef (tree fun
)
5362 constexpr_fundef fundef
= { NULL
, NULL
};
5363 if (constexpr_fundef_table
== NULL
)
5367 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5370 /* Return true if type expression T is a valid parameter type, or
5371 a valid return type, of a constexpr function. */
5374 valid_type_in_constexpr_fundecl_p (tree t
)
5376 return (literal_type_p (t
)
5377 /* FIXME we allow ref to non-literal; should change standard to
5378 match, or change back if not. */
5379 || TREE_CODE (t
) == REFERENCE_TYPE
);
5382 /* Check whether the parameter and return types of FUN are valid for a
5383 constexpr function, and complain if COMPLAIN. */
5386 is_valid_constexpr_fn (tree fun
, bool complain
)
5388 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5390 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5391 if (!valid_type_in_constexpr_fundecl_p (TREE_TYPE (parm
)))
5395 error ("invalid type for parameter %q#D of constexpr function",
5399 if (!DECL_CONSTRUCTOR_P (fun
))
5401 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5402 if (!valid_type_in_constexpr_fundecl_p (rettype
))
5406 error ("invalid return type %qT of constexpr function %qD",
5410 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5411 && COMPLETE_TYPE_P (DECL_CONTEXT (fun
))
5412 && !valid_type_in_constexpr_fundecl_p (DECL_CONTEXT (fun
)))
5416 error ("enclosing class of %q#D is not a literal type", fun
);
5423 /* Return non-null if FUN certainly designates a valid constexpr function
5424 declaration. Otherwise return NULL. Issue appropriate diagnostics
5425 if necessary. Note that we only check the declaration, not the body
5429 validate_constexpr_fundecl (tree fun
)
5431 constexpr_fundef entry
;
5432 constexpr_fundef
**slot
;
5434 if (processing_template_decl
|| !DECL_DECLARED_CONSTEXPR_P (fun
))
5436 else if (DECL_CLONED_FUNCTION_P (fun
))
5437 /* We already checked the original function. */
5440 if (!is_valid_constexpr_fn (fun
, !DECL_TEMPLATE_INSTANTIATION (fun
)))
5442 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5446 /* Create the constexpr function table if necessary. */
5447 if (constexpr_fundef_table
== NULL
)
5448 constexpr_fundef_table
= htab_create_ggc (101,
5449 constexpr_fundef_hash
,
5450 constexpr_fundef_equal
,
5454 slot
= (constexpr_fundef
**)
5455 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
5458 *slot
= ggc_alloc_constexpr_fundef ();
5464 /* Subroutine of build_constexpr_constructor_member_initializers.
5465 The expression tree T represents a data member initialization
5466 in a (constexpr) constructor definition. Build a pairing of
5467 the data member with its initializer, and prepend that pair
5468 to the existing initialization pair INITS. */
5471 build_data_member_initialization (tree t
, VEC(constructor_elt
,gc
) **vec
)
5474 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5475 t
= TREE_OPERAND (t
, 0);
5476 if (TREE_CODE (t
) == EXPR_STMT
)
5477 t
= TREE_OPERAND (t
, 0);
5478 if (t
== error_mark_node
)
5480 if (TREE_CODE (t
) == STATEMENT_LIST
)
5482 tree_stmt_iterator i
;
5483 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5485 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5490 if (TREE_CODE (t
) == CLEANUP_STMT
)
5492 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5493 but we can in a constexpr constructor for a non-literal class. Just
5494 ignore it; either all the initialization will be constant, in which
5495 case the cleanup can't run, or it can't be constexpr.
5496 Still recurse into CLEANUP_BODY. */
5497 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5499 if (TREE_CODE (t
) == CONVERT_EXPR
)
5500 t
= TREE_OPERAND (t
, 0);
5501 if (TREE_CODE (t
) == INIT_EXPR
5502 || TREE_CODE (t
) == MODIFY_EXPR
)
5504 member
= TREE_OPERAND (t
, 0);
5505 init
= unshare_expr (TREE_OPERAND (t
, 1));
5509 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
5510 member
= CALL_EXPR_ARG (t
, 0);
5511 /* We don't use build_cplus_new here because it complains about
5512 abstract bases. Leaving the call unwrapped means that it has the
5513 wrong type, but cxx_eval_constant_expression doesn't care. */
5514 init
= unshare_expr (t
);
5516 if (TREE_CODE (member
) == INDIRECT_REF
)
5517 member
= TREE_OPERAND (member
, 0);
5518 if (TREE_CODE (member
) == NOP_EXPR
)
5522 if (TREE_CODE (op
) == ADDR_EXPR
)
5524 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5525 (TREE_TYPE (TREE_TYPE (op
)),
5526 TREE_TYPE (TREE_TYPE (member
))));
5527 /* Initializing a cv-qualified member; we need to look through
5533 /* We don't put out anything for an empty base. */
5534 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
5535 /* But if the initializer isn't constexpr, leave it in so we
5537 if (potential_constant_expression (init
))
5541 if (TREE_CODE (member
) == ADDR_EXPR
)
5542 member
= TREE_OPERAND (member
, 0);
5543 if (TREE_CODE (member
) == COMPONENT_REF
5544 /* If we're initializing a member of a subaggregate, it's a vtable
5545 pointer. Leave it as COMPONENT_REF so we remember the path to get
5547 && TREE_CODE (TREE_OPERAND (member
, 0)) != COMPONENT_REF
)
5548 member
= TREE_OPERAND (member
, 1);
5549 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
5553 /* Make sure that there are no statements after LAST in the constructor
5554 body represented by LIST. */
5557 check_constexpr_ctor_body (tree last
, tree list
)
5560 if (TREE_CODE (list
) == STATEMENT_LIST
)
5562 tree_stmt_iterator i
= tsi_last (list
);
5563 for (; !tsi_end_p (i
); tsi_prev (&i
))
5565 tree t
= tsi_stmt (i
);
5568 if (TREE_CODE (t
) == BIND_EXPR
)
5570 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
5575 /* We currently allow typedefs and static_assert.
5576 FIXME allow them in the standard, too. */
5577 if (TREE_CODE (t
) != STATIC_ASSERT
)
5584 else if (list
!= last
5585 && TREE_CODE (list
) != STATIC_ASSERT
)
5589 error ("constexpr constructor does not have empty body");
5590 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
5595 /* Build compile-time evalable representations of member-initializer list
5596 for a constexpr constructor. */
5599 build_constexpr_constructor_member_initializers (tree type
, tree body
)
5601 VEC(constructor_elt
,gc
) *vec
= NULL
;
5603 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
5604 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
5605 body
= TREE_OPERAND (body
, 0);
5606 if (TREE_CODE (body
) == STATEMENT_LIST
)
5607 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
5608 body
= BIND_EXPR_BODY (body
);
5609 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5611 body
= TREE_OPERAND (body
, 0);
5612 if (TREE_CODE (body
) == EXPR_STMT
)
5613 body
= TREE_OPERAND (body
, 0);
5614 if (TREE_CODE (body
) == INIT_EXPR
5615 && (same_type_ignoring_top_level_qualifiers_p
5616 (TREE_TYPE (TREE_OPERAND (body
, 0)),
5617 current_class_type
)))
5620 return TREE_OPERAND (body
, 1);
5622 ok
= build_data_member_initialization (body
, &vec
);
5624 else if (TREE_CODE (body
) == STATEMENT_LIST
)
5626 tree_stmt_iterator i
;
5627 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5629 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
5635 gcc_assert (errorcount
> 0);
5637 return build_constructor (type
, vec
);
5639 return error_mark_node
;
5642 /* We are processing the definition of the constexpr function FUN.
5643 Check that its BODY fulfills the propriate requirements and
5644 enter it in the constexpr function definition table.
5645 For constructor BODY is actually the TREE_LIST of the
5646 member-initializer list. */
5649 register_constexpr_fundef (tree fun
, tree body
)
5651 constexpr_fundef
*fundef
= retrieve_constexpr_fundef (fun
);
5652 gcc_assert (fundef
!= NULL
&& fundef
->body
== NULL
);
5654 if (DECL_CONSTRUCTOR_P (fun
))
5655 body
= build_constexpr_constructor_member_initializers
5656 (DECL_CONTEXT (fun
), body
);
5659 if (TREE_CODE (body
) == BIND_EXPR
)
5660 body
= BIND_EXPR_BODY (body
);
5661 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
5662 body
= EH_SPEC_STMTS (body
);
5663 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
5664 body
= TREE_OPERAND (body
, 0);
5665 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5666 body
= TREE_OPERAND (body
, 0);
5667 if (TREE_CODE (body
) != RETURN_EXPR
)
5669 error ("body of constexpr function %qD not a return-statement", fun
);
5670 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5673 body
= unshare_expr (TREE_OPERAND (body
, 0));
5676 if (!potential_constant_expression (body
))
5678 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5679 if (!DECL_TEMPLATE_INSTANTIATION (fun
))
5680 require_potential_constant_expression (body
);
5683 fundef
->body
= body
;
5687 /* Objects of this type represent calls to constexpr functions
5688 along with the bindings of parameters to their arguments, for
5689 the purpose of compile time evaluation. */
5691 typedef struct GTY(()) constexpr_call
{
5692 /* Description of the constexpr function definition. */
5693 constexpr_fundef
*fundef
;
5694 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5695 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5696 Note: This arrangement is made to accomodate the use of
5697 iterative_hash_template_arg (see pt.c). If you change this
5698 representation, also change the hash calculation in
5699 cxx_eval_call_expression. */
5701 /* Result of the call.
5702 NULL means the call is being evaluated.
5703 error_mark_node means that the evaluation was erroneous;
5704 otherwise, the actuall value of the call. */
5706 /* The hash of this call; we remember it here to avoid having to
5707 recalculate it when expanding the hash table. */
5711 /* A table of all constexpr calls that have been evaluated by the
5712 compiler in this translation unit. */
5714 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
5716 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
5717 bool, bool, bool *);
5719 /* Compute a hash value for a constexpr call representation. */
5722 constexpr_call_hash (const void *p
)
5724 const constexpr_call
*info
= (const constexpr_call
*) p
;
5728 /* Return 1 if the objects pointed to by P and Q represent calls
5729 to the same constexpr function with the same arguments.
5730 Otherwise, return 0. */
5733 constexpr_call_equal (const void *p
, const void *q
)
5735 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
5736 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
5741 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
5743 lhs_bindings
= lhs
->bindings
;
5744 rhs_bindings
= rhs
->bindings
;
5745 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
5747 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
5748 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
5749 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
5750 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
5752 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
5753 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
5755 return lhs_bindings
== rhs_bindings
;
5758 /* Initialize the constexpr call table, if needed. */
5761 maybe_initialize_constexpr_call_table (void)
5763 if (constexpr_call_table
== NULL
)
5764 constexpr_call_table
= htab_create_ggc (101,
5765 constexpr_call_hash
,
5766 constexpr_call_equal
,
5770 /* Return true if T designates the implied `this' parameter. */
5773 is_this_parameter (tree t
)
5775 return t
== current_class_ptr
;
5778 /* We have an expression tree T that represents a call, either CALL_EXPR
5779 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5780 retrun the _DECL for that function. */
5783 get_function_named_in_call (tree t
)
5786 switch (TREE_CODE (t
))
5789 fun
= CALL_EXPR_FN (t
);
5792 case AGGR_INIT_EXPR
:
5793 fun
= AGGR_INIT_EXPR_FN (t
);
5800 if (TREE_CODE (fun
) == ADDR_EXPR
5801 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
5802 fun
= TREE_OPERAND (fun
, 0);
5806 /* We have an expression tree T that represents a call, either CALL_EXPR
5807 or AGGR_INIT_EXPR. Return the Nth argument. */
5810 get_nth_callarg (tree t
, int n
)
5812 switch (TREE_CODE (t
))
5815 return CALL_EXPR_ARG (t
, n
);
5817 case AGGR_INIT_EXPR
:
5818 return AGGR_INIT_EXPR_ARG (t
, n
);
5826 /* Look up the binding of the function parameter T in a constexpr
5827 function call context CALL. */
5830 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
5832 tree b
= purpose_member (t
, call
->bindings
);
5833 return TREE_VALUE (b
);
5836 /* Attempt to evaluate T which represents a call to a builtin function.
5837 We assume here that all builtin functions evaluate to scalar types
5838 represented by _CST nodes. */
5841 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
5842 bool allow_non_constant
, bool addr
,
5843 bool *non_constant_p
)
5845 const int nargs
= call_expr_nargs (t
);
5846 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
5849 for (i
= 0; i
< nargs
; ++i
)
5851 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
5852 allow_non_constant
, addr
,
5854 if (allow_non_constant
&& *non_constant_p
)
5857 if (*non_constant_p
)
5859 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
5860 CALL_EXPR_FN (t
), nargs
, args
);
5861 return fold (new_call
);
5864 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5865 the type of the value to match. */
5868 adjust_temp_type (tree type
, tree temp
)
5870 if (TREE_TYPE (temp
) == type
)
5872 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5873 if (TREE_CODE (temp
) == CONSTRUCTOR
)
5874 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
5875 gcc_assert (SCALAR_TYPE_P (type
));
5876 return cp_fold_convert (type
, temp
);
5879 /* Subroutine of cxx_eval_call_expression.
5880 We are processing a call expression (either CALL_EXPR or
5881 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5882 all arguments and bind their values to correspondings
5883 parameters, making up the NEW_CALL context. */
5886 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
5887 constexpr_call
*new_call
,
5888 bool allow_non_constant
,
5889 bool *non_constant_p
)
5891 const int nargs
= call_expr_nargs (t
);
5892 tree fun
= new_call
->fundef
->decl
;
5893 tree parms
= DECL_ARGUMENTS (fun
);
5895 for (i
= 0; i
< nargs
; ++i
)
5898 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
5899 /* For member function, the first argument is a pointer to the implied
5900 object. And for an object contruction, don't bind `this' before
5901 it is fully constructed. */
5902 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
5904 x
= get_nth_callarg (t
, i
);
5905 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
5906 TREE_CODE (type
) == REFERENCE_TYPE
,
5908 /* Don't VERIFY_CONSTANT here. */
5909 if (*non_constant_p
&& allow_non_constant
)
5911 /* Just discard ellipsis args after checking their constantitude. */
5915 /* Make sure the binding has the same type as the parm. */
5916 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5917 arg
= adjust_temp_type (type
, arg
);
5918 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
5920 parms
= TREE_CHAIN (parms
);
5924 /* Variables and functions to manage constexpr call expansion context.
5925 These do not need to be marked for PCH or GC. */
5927 static VEC(tree
,heap
) *call_stack
= NULL
;
5928 static int call_stack_tick
;
5929 static int last_cx_error_tick
;
5932 push_cx_call_context (tree call
)
5935 if (!EXPR_HAS_LOCATION (call
))
5936 SET_EXPR_LOCATION (call
, input_location
);
5937 VEC_safe_push (tree
, heap
, call_stack
, call
);
5941 pop_cx_call_context (void)
5944 VEC_pop (tree
, call_stack
);
5948 cx_error_context (void)
5950 VEC(tree
,heap
) *r
= NULL
;
5951 if (call_stack_tick
!= last_cx_error_tick
5952 && !VEC_empty (tree
, call_stack
))
5954 last_cx_error_tick
= call_stack_tick
;
5958 /* Subroutine of cxx_eval_constant_expression.
5959 Evaluate the call expression tree T in the context of OLD_CALL expression
5963 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
5964 bool allow_non_constant
, bool addr
,
5965 bool *non_constant_p
)
5967 location_t loc
= EXPR_LOC_OR_HERE (t
);
5968 tree fun
= get_function_named_in_call (t
);
5970 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
5971 constexpr_call
**slot
;
5972 if (TREE_CODE (fun
) != FUNCTION_DECL
)
5974 /* Might be a constexpr function pointer. */
5975 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
5976 /*addr*/false, non_constant_p
);
5977 if (TREE_CODE (fun
) == ADDR_EXPR
)
5978 fun
= TREE_OPERAND (fun
, 0);
5980 if (TREE_CODE (fun
) != FUNCTION_DECL
)
5982 if (!allow_non_constant
)
5983 error_at (loc
, "expression %qE does not designate a constexpr "
5985 *non_constant_p
= true;
5988 if (DECL_CLONED_FUNCTION_P (fun
))
5989 fun
= DECL_CLONED_FUNCTION (fun
);
5990 if (is_builtin_fn (fun
))
5991 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
5992 addr
, non_constant_p
);
5993 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
5995 if (!allow_non_constant
)
5997 error_at (loc
, "%qD is not a constexpr function", fun
);
5998 if (DECL_TEMPLATE_INSTANTIATION (fun
)
5999 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
6000 (DECL_TI_TEMPLATE (fun
))))
6001 is_valid_constexpr_fn (fun
, true);
6003 *non_constant_p
= true;
6007 /* If in direct recursive call, optimize definition search. */
6008 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6009 new_call
.fundef
= old_call
->fundef
;
6012 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6013 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6015 if (!allow_non_constant
)
6016 error_at (loc
, "%qD used before its definition", fun
);
6017 *non_constant_p
= true;
6021 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6022 allow_non_constant
, non_constant_p
);
6023 if (*non_constant_p
)
6026 push_cx_call_context (t
);
6029 = iterative_hash_template_arg (new_call
.bindings
,
6030 constexpr_fundef_hash (new_call
.fundef
));
6032 /* If we have seen this call before, we are done. */
6033 maybe_initialize_constexpr_call_table ();
6034 slot
= (constexpr_call
**)
6035 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6038 /* Calls which are in progress have their result set to NULL
6039 so that we can detect circular dependencies. */
6040 if ((*slot
)->result
== NULL
)
6042 if (!allow_non_constant
)
6043 error ("call has circular dependency");
6044 (*slot
)->result
= result
= error_mark_node
;
6048 result
= (*slot
)->result
;
6049 if (result
== error_mark_node
&& !allow_non_constant
)
6050 /* Re-evaluate to get the error. */
6051 cxx_eval_constant_expression (&new_call
, new_call
.fundef
->body
,
6052 allow_non_constant
, addr
,
6058 /* We need to keep a pointer to the entry, not just the slot, as the
6059 slot can move in the call to cxx_eval_builtin_function_call. */
6060 constexpr_call
*entry
= ggc_alloc_constexpr_call ();
6064 = cxx_eval_constant_expression (&new_call
, new_call
.fundef
->body
,
6065 allow_non_constant
, addr
,
6067 if (*non_constant_p
)
6068 entry
->result
= result
= error_mark_node
;
6071 /* If this was a call to initialize an object, set the type of
6072 the CONSTRUCTOR to the type of that object. */
6073 if (DECL_CONSTRUCTOR_P (fun
))
6075 tree ob_arg
= get_nth_callarg (t
, 0);
6076 STRIP_NOPS (ob_arg
);
6077 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6078 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6079 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6082 entry
->result
= result
;
6086 pop_cx_call_context ();
6087 return unshare_expr (result
);
6090 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6093 reduced_constant_expression_p (tree t
)
6095 if (TREE_OVERFLOW_P (t
))
6096 /* Integer overflow makes this not a constant expression. */
6098 /* FIXME are we calling this too much? */
6099 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6102 /* Some expressions may have constant operands but are not constant
6103 themselves, such as 1/0. Call this function (or rather, the macro
6104 following it) to check for that condition.
6106 We only call this in places that require an arithmetic constant, not in
6107 places where we might have a non-constant expression that can be a
6108 component of a constant expression, such as the address of a constexpr
6109 variable that might be dereferenced later. */
6112 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
)
6114 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6116 if (!allow_non_constant
)
6118 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6119 printing the folded constant isn't helpful. */
6120 if (TREE_OVERFLOW_P (t
))
6122 permerror (input_location
, "overflow in constant expression");
6123 /* If we're being permissive (and are in an enforcing
6124 context), consider this constant. */
6125 if (flag_permissive
)
6129 error ("%q+E is not a constant expression", t
);
6131 *non_constant_p
= true;
6133 return *non_constant_p
;
6135 #define VERIFY_CONSTANT(X) \
6137 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6141 /* Subroutine of cxx_eval_constant_expression.
6142 Attempt to reduce the unary expression tree T to a compile time value.
6143 If successful, return the value. Otherwise issue a diagnostic
6144 and return error_mark_node. */
6147 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6148 bool allow_non_constant
, bool addr
,
6149 bool *non_constant_p
)
6152 tree orig_arg
= TREE_OPERAND (t
, 0);
6153 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6154 addr
, non_constant_p
);
6155 VERIFY_CONSTANT (arg
);
6156 if (arg
== orig_arg
)
6158 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6159 VERIFY_CONSTANT (r
);
6163 /* Subroutine of cxx_eval_constant_expression.
6164 Like cxx_eval_unary_expression, except for binary expressions. */
6167 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6168 bool allow_non_constant
, bool addr
,
6169 bool *non_constant_p
)
6172 tree orig_lhs
= TREE_OPERAND (t
, 0);
6173 tree orig_rhs
= TREE_OPERAND (t
, 1);
6175 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6176 allow_non_constant
, addr
,
6178 VERIFY_CONSTANT (lhs
);
6179 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6180 allow_non_constant
, addr
,
6182 VERIFY_CONSTANT (rhs
);
6183 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6185 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6186 VERIFY_CONSTANT (r
);
6190 /* Subroutine of cxx_eval_constant_expression.
6191 Attempt to evaluate condition expressions. Dead branches are not
6195 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6196 bool allow_non_constant
, bool addr
,
6197 bool *non_constant_p
)
6199 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6200 allow_non_constant
, addr
,
6202 VERIFY_CONSTANT (val
);
6203 if (val
== boolean_true_node
)
6204 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6205 allow_non_constant
, addr
,
6207 gcc_assert (val
== boolean_false_node
);
6208 /* Don't VERIFY_CONSTANT here. */
6209 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6210 allow_non_constant
, addr
,
6214 /* Subroutine of cxx_eval_constant_expression.
6215 Attempt to reduce a reference to an array slot. */
6218 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6219 bool allow_non_constant
, bool addr
,
6220 bool *non_constant_p
)
6222 tree oldary
= TREE_OPERAND (t
, 0);
6223 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6224 allow_non_constant
, addr
,
6229 if (*non_constant_p
)
6231 oldidx
= TREE_OPERAND (t
, 1);
6232 index
= cxx_eval_constant_expression (call
, oldidx
,
6233 allow_non_constant
, false,
6235 VERIFY_CONSTANT (index
);
6236 if (addr
&& ary
== oldary
&& index
== oldidx
)
6239 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
6240 len
= (TREE_CODE (ary
) == CONSTRUCTOR
6241 ? CONSTRUCTOR_NELTS (ary
)
6242 : (unsigned)TREE_STRING_LENGTH (ary
));
6243 if (compare_tree_int (index
, len
) >= 0)
6245 if (!allow_non_constant
)
6246 error ("array subscript out of bound");
6247 *non_constant_p
= true;
6250 i
= tree_low_cst (index
, 0);
6251 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6252 return VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ary
), i
)->value
;
6254 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
6255 TREE_STRING_POINTER (ary
)[i
]);
6256 /* Don't VERIFY_CONSTANT here. */
6259 /* Subroutine of cxx_eval_constant_expression.
6260 Attempt to reduce a field access of a value of class type. */
6263 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
6264 bool allow_non_constant
, bool addr
,
6265 bool *non_constant_p
)
6267 unsigned HOST_WIDE_INT i
;
6270 tree part
= TREE_OPERAND (t
, 1);
6271 tree orig_whole
= TREE_OPERAND (t
, 0);
6272 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6273 allow_non_constant
, addr
,
6275 if (whole
== orig_whole
)
6278 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
6279 whole
, part
, NULL_TREE
);
6280 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6282 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6284 if (!allow_non_constant
)
6285 error ("%qE is not a constant expression", orig_whole
);
6286 *non_constant_p
= true;
6288 if (*non_constant_p
)
6290 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6295 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
)
6297 /* FIXME Mike Miller wants this to be OK. */
6298 if (!allow_non_constant
)
6299 error ("accessing %qD member instead of initialized %qD member in "
6300 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
6301 *non_constant_p
= true;
6305 return error_mark_node
;
6308 /* Subroutine of cxx_eval_constant_expression.
6309 Attempt to reduce a field access of a value of class type that is
6310 expressed as a BIT_FIELD_REF. */
6313 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
6314 bool allow_non_constant
, bool addr
,
6315 bool *non_constant_p
)
6317 tree orig_whole
= TREE_OPERAND (t
, 0);
6318 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6319 allow_non_constant
, addr
,
6321 tree start
, field
, value
;
6322 unsigned HOST_WIDE_INT i
;
6324 if (whole
== orig_whole
)
6326 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6328 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6330 if (!allow_non_constant
)
6331 error ("%qE is not a constant expression", orig_whole
);
6332 *non_constant_p
= true;
6334 if (*non_constant_p
)
6337 start
= TREE_OPERAND (t
, 2);
6338 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6340 if (bit_position (field
) == start
)
6344 return error_mark_node
;
6347 /* Subroutine of cxx_eval_constant_expression.
6348 Evaluate a short-circuited logical expression T in the context
6349 of a given constexpr CALL. BAILOUT_VALUE is the value for
6350 early return. CONTINUE_VALUE is used here purely for
6351 sanity check purposes. */
6354 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
6355 tree bailout_value
, tree continue_value
,
6356 bool allow_non_constant
, bool addr
,
6357 bool *non_constant_p
)
6360 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6361 allow_non_constant
, addr
,
6363 VERIFY_CONSTANT (lhs
);
6364 if (lhs
== bailout_value
)
6366 gcc_assert (lhs
== continue_value
);
6367 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6368 allow_non_constant
, addr
, non_constant_p
);
6369 VERIFY_CONSTANT (r
);
6373 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6374 CONSTRUCTOR elements to initialize (part of) an object containing that
6375 field. Return a pointer to the constructor_elt corresponding to the
6376 initialization of the field. */
6378 static constructor_elt
*
6379 base_field_constructor_elt (VEC(constructor_elt
,gc
) *v
, tree ref
)
6381 tree aggr
= TREE_OPERAND (ref
, 0);
6382 tree field
= TREE_OPERAND (ref
, 1);
6384 constructor_elt
*ce
;
6386 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
6388 if (TREE_CODE (aggr
) == COMPONENT_REF
)
6390 constructor_elt
*base_ce
6391 = base_field_constructor_elt (v
, aggr
);
6392 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
6395 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6396 if (ce
->index
== field
)
6403 /* Subroutine of cxx_eval_constant_expression.
6404 The expression tree T denotes a C-style array or a C-style
6405 aggregate. Reduce it to a constant expression. */
6408 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
6409 bool allow_non_constant
, bool addr
,
6410 bool *non_constant_p
)
6412 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
6413 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
,
6414 VEC_length (constructor_elt
, v
));
6415 constructor_elt
*ce
;
6417 bool changed
= false;
6418 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
6419 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6421 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
6422 allow_non_constant
, addr
,
6424 /* Don't VERIFY_CONSTANT here. */
6425 if (allow_non_constant
&& *non_constant_p
)
6427 if (elt
!= ce
->value
)
6429 if (TREE_CODE (ce
->index
) == COMPONENT_REF
)
6431 /* This is an initialization of a vfield inside a base
6432 subaggregate that we already initialized; push this
6433 initialization into the previous initialization. */
6434 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
6438 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
6440 if (*non_constant_p
|| !changed
)
6443 VEC_free (constructor_elt
, gc
, n
);
6446 t
= build_constructor (TREE_TYPE (t
), n
);
6447 TREE_CONSTANT (t
) = true;
6451 /* Subroutine of cxx_eval_constant_expression.
6452 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6453 initialization of a non-static data member of array type. Reduce it to a
6456 Note that apart from value-initialization (when VALUE_INIT is true),
6457 this is only intended to support value-initialization and the
6458 initializations done by defaulted constructors for classes with
6459 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6460 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6461 for the copy/move constructor. */
6464 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
6465 bool value_init
, bool allow_non_constant
, bool addr
,
6466 bool *non_constant_p
)
6468 tree elttype
= TREE_TYPE (atype
);
6469 int max
= tree_low_cst (array_type_nelts (atype
), 0);
6470 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
, max
+ 1);
6473 /* For the default constructor, build up a call to the default
6474 constructor of the element type. We only need to handle class types
6475 here, as for a constructor to be constexpr, all members must be
6476 initialized, which for a defaulted default constructor means they must
6477 be of a class type with a constexpr default constructor. */
6482 VEC(tree
,gc
) *argvec
= make_tree_vector ();
6483 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6484 &argvec
, elttype
, LOOKUP_NORMAL
,
6485 tf_warning_or_error
);
6486 release_tree_vector (argvec
);
6487 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
6488 addr
, non_constant_p
);
6491 if (*non_constant_p
&& !allow_non_constant
)
6494 for (i
= 0; i
<= max
; ++i
)
6496 tree idx
= build_int_cst (size_type_node
, i
);
6498 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
6500 /* A multidimensional array; recurse. */
6502 eltinit
= NULL_TREE
;
6504 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6505 tf_warning_or_error
);
6506 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
6507 allow_non_constant
, addr
,
6510 else if (value_init
)
6512 eltinit
= build_value_init (elttype
, tf_warning_or_error
);
6513 eltinit
= cxx_eval_constant_expression
6514 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6516 else if (TREE_CODE (init
) == CONSTRUCTOR
)
6518 /* Initializing an element using the call to the default
6519 constructor we just built above. */
6520 eltinit
= unshare_expr (init
);
6524 /* Copying an element. */
6525 VEC(tree
,gc
) *argvec
;
6526 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6527 (atype
, TREE_TYPE (init
)));
6528 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6529 tf_warning_or_error
);
6530 if (!real_lvalue_p (init
))
6531 eltinit
= move (eltinit
);
6532 argvec
= make_tree_vector ();
6533 VEC_quick_push (tree
, argvec
, eltinit
);
6534 eltinit
= (build_special_member_call
6535 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
6536 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
6537 release_tree_vector (argvec
);
6538 eltinit
= cxx_eval_constant_expression
6539 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6541 if (*non_constant_p
&& !allow_non_constant
)
6543 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
6546 if (!*non_constant_p
)
6548 init
= build_constructor (TREE_TYPE (atype
), n
);
6549 TREE_CONSTANT (init
) = true;
6554 VEC_free (constructor_elt
, gc
, n
);
6559 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
6560 bool allow_non_constant
, bool addr
,
6561 bool *non_constant_p
)
6563 tree atype
= TREE_TYPE (t
);
6564 tree init
= VEC_INIT_EXPR_INIT (t
);
6565 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
6566 VEC_INIT_EXPR_VALUE_INIT (t
),
6567 allow_non_constant
, addr
, non_constant_p
);
6568 if (*non_constant_p
)
6574 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6575 match. We want to be less strict for simple *& folding; if we have a
6576 non-const temporary that we access through a const pointer, that should
6577 work. We handle this here rather than change fold_indirect_ref_1
6578 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6579 don't really make sense outside of constant expression evaluation. Also
6580 we want to allow folding to COMPONENT_REF, which could cause trouble
6581 with TBAA in fold_indirect_ref_1. */
6584 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
6585 bool allow_non_constant
, bool addr
,
6586 bool *non_constant_p
)
6588 tree orig_op0
= TREE_OPERAND (t
, 0);
6589 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
6590 /*addr*/false, non_constant_p
);
6591 tree type
, sub
, subtype
, r
;
6594 /* Don't VERIFY_CONSTANT here. */
6595 if (*non_constant_p
)
6598 type
= TREE_TYPE (t
);
6604 subtype
= TREE_TYPE (sub
);
6605 gcc_assert (POINTER_TYPE_P (subtype
));
6607 if (TREE_CODE (sub
) == ADDR_EXPR
)
6609 tree op
= TREE_OPERAND (sub
, 0);
6610 tree optype
= TREE_TYPE (op
);
6612 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
6614 /* Also handle conversion to an empty base class, which
6615 is represented with a NOP_EXPR. */
6616 else if (!addr
&& is_empty_class (type
)
6617 && CLASS_TYPE_P (optype
)
6618 && DERIVED_FROM_P (type
, optype
))
6623 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6624 else if (RECORD_OR_UNION_TYPE_P (optype
))
6626 tree field
= TYPE_FIELDS (optype
);
6627 for (; field
; field
= DECL_CHAIN (field
))
6628 if (TREE_CODE (field
) == FIELD_DECL
6629 && integer_zerop (byte_position (field
))
6630 && (same_type_ignoring_top_level_qualifiers_p
6631 (TREE_TYPE (field
), type
)))
6633 r
= fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
6638 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
6639 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
6641 tree op00
= TREE_OPERAND (sub
, 0);
6642 tree op01
= TREE_OPERAND (sub
, 1);
6645 if (TREE_CODE (op00
) == ADDR_EXPR
)
6648 op00
= TREE_OPERAND (op00
, 0);
6649 op00type
= TREE_TYPE (op00
);
6651 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6652 if (RECORD_OR_UNION_TYPE_P (op00type
))
6654 tree field
= TYPE_FIELDS (op00type
);
6655 for (; field
; field
= DECL_CHAIN (field
))
6656 if (TREE_CODE (field
) == FIELD_DECL
6657 && tree_int_cst_equal (byte_position (field
), op01
)
6658 && (same_type_ignoring_top_level_qualifiers_p
6659 (TREE_TYPE (field
), type
)))
6661 r
= fold_build3 (COMPONENT_REF
, type
, op00
,
6669 /* Let build_fold_indirect_ref handle the cases it does fine with. */
6671 r
= build_fold_indirect_ref (op0
);
6672 if (TREE_CODE (r
) != INDIRECT_REF
)
6673 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
6674 addr
, non_constant_p
);
6675 else if (TREE_CODE (sub
) == ADDR_EXPR
6676 || TREE_CODE (sub
) == POINTER_PLUS_EXPR
)
6678 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6679 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
6680 /* FIXME Mike Miller wants this to be OK. */
6681 if (!allow_non_constant
)
6682 error ("accessing value of %qE through a %qT glvalue in a "
6683 "constant expression", build_fold_indirect_ref (sub
),
6685 *non_constant_p
= true;
6689 /* If we're pulling out the value of an empty base, make sure
6690 that the whole object is constant and then return an empty
6694 VERIFY_CONSTANT (r
);
6695 r
= build_constructor (TREE_TYPE (t
), NULL
);
6696 TREE_CONSTANT (r
) = true;
6699 if (TREE_CODE (r
) == INDIRECT_REF
&& TREE_OPERAND (r
, 0) == orig_op0
)
6704 /* Attempt to reduce the expression T to a constant value.
6705 On failure, issue diagnostic and return error_mark_node. */
6706 /* FIXME unify with c_fully_fold */
6709 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
6710 bool allow_non_constant
, bool addr
,
6711 bool *non_constant_p
)
6715 if (t
== error_mark_node
)
6717 *non_constant_p
= true;
6720 if (CONSTANT_CLASS_P (t
))
6722 if (TREE_CODE (t
) == PTRMEM_CST
)
6723 t
= cplus_expand_constant (t
);
6726 if (TREE_CODE (t
) != NOP_EXPR
6727 && reduced_constant_expression_p (t
))
6730 switch (TREE_CODE (t
))
6735 /* else fall through. */
6737 r
= integral_constant_value (t
);
6738 if (TREE_CODE (r
) == TARGET_EXPR
6739 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
6740 r
= TARGET_EXPR_INITIAL (r
);
6743 if (!allow_non_constant
)
6745 tree type
= TREE_TYPE (r
);
6746 error ("the value of %qD is not usable in a constant "
6748 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6750 if (!CP_TYPE_CONST_P (type
))
6751 inform (DECL_SOURCE_LOCATION (r
),
6752 "%q#D is not const", r
);
6753 else if (CP_TYPE_VOLATILE_P (type
))
6754 inform (DECL_SOURCE_LOCATION (r
),
6755 "%q#D is volatile", r
);
6756 else if (!DECL_INITIAL (r
))
6757 inform (DECL_SOURCE_LOCATION (r
),
6758 "%qD was not initialized with a constant "
6765 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
6766 inform (DECL_SOURCE_LOCATION (r
),
6767 "%qD was not declared %<constexpr%>", r
);
6769 inform (DECL_SOURCE_LOCATION (r
),
6770 "%qD does not have integral or enumeration type",
6774 *non_constant_p
= true;
6783 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
6784 r
= lookup_parameter_binding (call
, t
);
6786 /* Defer in case this is only used for its type. */;
6789 if (!allow_non_constant
)
6790 error ("%qE is not a constant expression", t
);
6791 *non_constant_p
= true;
6796 case AGGR_INIT_EXPR
:
6797 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
6803 /* Pass false for 'addr' because these codes indicate
6804 initialization of a temporary. */
6805 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6806 allow_non_constant
, false,
6808 if (!*non_constant_p
)
6809 /* Adjust the type of the result to the type of the temporary. */
6810 r
= adjust_temp_type (TREE_TYPE (t
), r
);
6814 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6815 allow_non_constant
, addr
,
6820 case NON_LVALUE_EXPR
:
6821 case TRY_CATCH_EXPR
:
6822 case CLEANUP_POINT_EXPR
:
6823 case MUST_NOT_THROW_EXPR
:
6825 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6826 allow_non_constant
, addr
,
6830 /* These differ from cxx_eval_unary_expression in that this doesn't
6831 check for a constant operand or result; an address can be
6832 constant without its operand being, and vice versa. */
6834 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
6840 tree oldop
= TREE_OPERAND (t
, 0);
6841 tree op
= cxx_eval_constant_expression (call
, oldop
,
6845 /* Don't VERIFY_CONSTANT here. */
6846 if (*non_constant_p
)
6848 /* This function does more aggressive folding than fold itself. */
6849 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
6850 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
6858 case FIX_TRUNC_EXPR
:
6863 case TRUTH_NOT_EXPR
:
6864 case FIXED_CONVERT_EXPR
:
6865 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
6871 /* check_return_expr sometimes wraps a TARGET_EXPR in a
6872 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
6873 introduced by build_call_a. */
6874 tree op0
= TREE_OPERAND (t
, 0);
6875 tree op1
= TREE_OPERAND (t
, 1);
6877 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
6878 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
6879 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
6880 addr
, non_constant_p
);
6886 case POINTER_PLUS_EXPR
:
6890 case TRUNC_DIV_EXPR
:
6892 case FLOOR_DIV_EXPR
:
6893 case ROUND_DIV_EXPR
:
6894 case TRUNC_MOD_EXPR
:
6896 case ROUND_MOD_EXPR
:
6898 case EXACT_DIV_EXPR
:
6908 case TRUTH_XOR_EXPR
:
6915 case UNORDERED_EXPR
:
6925 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
6929 /* fold can introduce non-IF versions of these; still treat them as
6930 short-circuiting. */
6931 case TRUTH_AND_EXPR
:
6932 case TRUTH_ANDIF_EXPR
:
6933 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
6935 allow_non_constant
, addr
,
6940 case TRUTH_ORIF_EXPR
:
6941 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
6943 allow_non_constant
, addr
,
6948 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
6953 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
6958 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
6964 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
6969 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
6974 /* We can get this in a defaulted constructor for a class with a
6975 non-static data member of array type. Either the initializer will
6976 be NULL, meaning default-initialization, or it will be an lvalue
6977 or xvalue of the same type, meaning direct-initialization from the
6978 corresponding member. */
6979 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
6984 case VIEW_CONVERT_EXPR
:
6987 tree oldop
= TREE_OPERAND (t
, 0);
6989 tree to
= TREE_TYPE (t
);
6990 tree source
= TREE_TYPE (op
);
6991 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (to
)
6992 && !(TREE_CODE (op
) == COMPONENT_REF
6993 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op
, 0)))))
6995 if (!allow_non_constant
)
6996 error ("conversion of expression %qE of pointer type "
6997 "cannot yield a constant expression", op
);
6998 *non_constant_p
= true;
7001 op
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7002 allow_non_constant
, addr
,
7004 if (*non_constant_p
)
7007 /* We didn't fold at the top so we could check for ptr-int
7010 r
= fold_build1 (TREE_CODE (t
), to
, op
);
7014 case EMPTY_CLASS_EXPR
:
7015 /* This is good enough for a function argument that might not get
7016 used, and they can't do anything with it, so just return it. */
7020 case DYNAMIC_CAST_EXPR
:
7021 case PSEUDO_DTOR_EXPR
:
7022 case PREINCREMENT_EXPR
:
7023 case POSTINCREMENT_EXPR
:
7024 case PREDECREMENT_EXPR
:
7025 case POSTDECREMENT_EXPR
:
7029 case VEC_DELETE_EXPR
:
7033 /* GCC internal stuff. */
7036 case WITH_CLEANUP_EXPR
:
7037 case STATEMENT_LIST
:
7039 case NON_DEPENDENT_EXPR
:
7043 if (!allow_non_constant
)
7044 error_at (EXPR_LOC_OR_HERE (t
),
7045 "expression %qE is not a constant-expression", t
);
7046 *non_constant_p
= true;
7050 internal_error ("unexpected expression %qE of kind %s", t
,
7051 tree_code_name
[TREE_CODE (t
)]);
7052 *non_constant_p
= true;
7056 if (r
== error_mark_node
)
7057 *non_constant_p
= true;
7059 if (*non_constant_p
)
7066 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
7068 bool non_constant_p
= false;
7069 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
7070 false, &non_constant_p
);
7072 verify_constant (r
, allow_non_constant
, &non_constant_p
);
7074 if (non_constant_p
&& !allow_non_constant
)
7075 return error_mark_node
;
7076 else if (non_constant_p
&& TREE_CONSTANT (t
))
7078 /* This isn't actually constant, so unset TREE_CONSTANT. */
7079 if (EXPR_P (t
) || TREE_CODE (t
) == CONSTRUCTOR
)
7082 r
= build_nop (TREE_TYPE (t
), t
);
7083 TREE_CONSTANT (r
) = false;
7086 else if (non_constant_p
|| r
== t
)
7088 else if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
7090 if (TREE_CODE (t
) == TARGET_EXPR
7091 && TARGET_EXPR_INITIAL (t
) == r
)
7095 r
= get_target_expr (r
);
7096 TREE_CONSTANT (r
) = true;
7104 /* Returns true if T is a valid subexpression of a constant expression,
7105 even if it isn't itself a constant expression. */
7108 is_sub_constant_expr (tree t
)
7110 bool non_constant_p
= false;
7111 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
);
7112 return !non_constant_p
;
7115 /* If T represents a constant expression returns its reduced value.
7116 Otherwise return error_mark_node. If T is dependent, then
7120 cxx_constant_value (tree t
)
7122 return cxx_eval_outermost_constant_expr (t
, false);
7125 /* If T is a constant expression, returns its reduced value.
7126 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7127 Otherwise, returns a version of T without TREE_CONSTANT. */
7130 maybe_constant_value (tree t
)
7134 if (type_dependent_expression_p (t
)
7135 || !potential_constant_expression (t
)
7136 || value_dependent_expression_p (t
))
7139 r
= cxx_eval_outermost_constant_expr (t
, true);
7140 #ifdef ENABLE_CHECKING
7141 /* cp_tree_equal looks through NOPs, so allow them. */
7143 || CONVERT_EXPR_P (t
)
7144 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
7145 || !cp_tree_equal (r
, t
));
7150 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7151 than wrapped in a TARGET_EXPR. */
7154 maybe_constant_init (tree t
)
7156 t
= maybe_constant_value (t
);
7157 if (TREE_CODE (t
) == TARGET_EXPR
)
7159 tree init
= TARGET_EXPR_INITIAL (t
);
7160 if (TREE_CODE (init
) == CONSTRUCTOR
7161 && TREE_CONSTANT (init
))
7168 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7169 /* Return true if the object referred to by REF has automatic or thread
7172 enum { ck_ok
, ck_bad
, ck_unknown
};
7174 check_automatic_or_tls (tree ref
)
7176 enum machine_mode mode
;
7177 HOST_WIDE_INT bitsize
, bitpos
;
7179 int volatilep
= 0, unsignedp
= 0;
7180 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
7181 &mode
, &unsignedp
, &volatilep
, false);
7184 /* If there isn't a decl in the middle, we don't know the linkage here,
7185 and this isn't a constant expression anyway. */
7188 dk
= decl_storage_duration (decl
);
7189 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
7193 /* Return true if the DECL designates a builtin function that is
7194 morally constexpr, in the sense that its parameter types and
7195 return type are literal types and the compiler is allowed to
7196 fold its invocations. */
7199 morally_constexpr_builtin_function_p (tree decl
)
7201 tree funtype
= TREE_TYPE (decl
);
7204 if (!is_builtin_fn (decl
))
7206 if (!literal_type_p (TREE_TYPE (funtype
)))
7208 for (t
= TYPE_ARG_TYPES (funtype
); t
!= NULL
; t
= TREE_CHAIN (t
))
7210 if (t
== void_list_node
)
7212 if (!literal_type_p (TREE_VALUE (t
)))
7215 /* We assume no varargs builtins are suitable. */
7219 /* Return true if T denotes a potentially constant expression. Issue
7220 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7221 an lvalue-rvalue conversion is implied.
7223 C++0x [expr.const] used to say
7225 6 An expression is a potential constant expression if it is
7226 a constant expression where all occurences of function
7227 parameters are replaced by arbitrary constant expressions
7228 of the appropriate type.
7230 2 A conditional expression is a constant expression unless it
7231 involves one of the following as a potentially evaluated
7232 subexpression (3.2), but subexpressions of logical AND (5.14),
7233 logical OR (5.15), and conditional (5.16) operations that are
7234 not evaluated are not considered. */
7237 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
7239 enum { any
= false, rval
= true };
7243 /* C++98 has different rules for the form of a constant expression that
7244 are enforced in the parser, so we can assume that anything that gets
7245 this far is suitable. */
7246 if (cxx_dialect
< cxx0x
)
7249 if (t
== error_mark_node
)
7253 if (TREE_THIS_VOLATILE (t
))
7255 if (flags
& tf_error
)
7256 error ("expression %qE has side-effects", t
);
7259 if (CONSTANT_CLASS_P (t
))
7262 switch (TREE_CODE (t
))
7267 case TEMPLATE_ID_EXPR
:
7274 case TEMPLATE_PARM_INDEX
:
7276 case IDENTIFIER_NODE
:
7280 /* -- this (5.1) unless it appears as the postfix-expression in a
7281 class member access expression, including the result of the
7282 implicit transformation in the body of the non-static
7283 member function (9.3.1); */
7284 if (is_this_parameter (t
))
7286 if (flags
& tf_error
)
7287 error ("%qE is not a potential constant expression", t
);
7292 case AGGR_INIT_EXPR
:
7294 /* -- an invocation of a function other than a constexpr function
7295 or a constexpr constructor. */
7297 tree fun
= get_function_named_in_call (t
);
7298 const int nargs
= call_expr_nargs (t
);
7299 if (TREE_CODE (fun
) != FUNCTION_DECL
)
7301 if (potential_constant_expression_1 (fun
, rval
, flags
))
7302 /* Might end up being a constant function pointer. */
7304 if (flags
& tf_error
)
7305 error ("%qE is not a function name", fun
);
7308 /* Skip initial arguments to base constructors. */
7309 if (DECL_BASE_CONSTRUCTOR_P (fun
))
7310 i
= num_artificial_parms_for (fun
);
7313 fun
= DECL_ORIGIN (fun
);
7314 if (builtin_valid_in_constant_expr_p (fun
))
7316 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
7317 && !morally_constexpr_builtin_function_p (fun
))
7319 if (flags
& tf_error
)
7320 error ("%qD is not %<constexpr%>", fun
);
7323 for (; i
< nargs
; ++i
)
7325 tree x
= get_nth_callarg (t
, i
);
7326 /* A call to a non-static member function takes the
7327 address of the object as the first argument.
7328 But in a constant expression the address will be folded
7329 away, so look through it now. */
7330 if (i
== 0 && DECL_NONSTATIC_MEMBER_P (fun
)
7331 && !DECL_CONSTRUCTOR_P (fun
))
7333 if (is_this_parameter (x
))
7335 else if (!potential_constant_expression_1 (x
, rval
, flags
))
7337 if (flags
& tf_error
)
7338 error ("object argument is not a potential constant "
7343 else if (!potential_constant_expression_1 (x
, rval
, flags
))
7345 if (flags
& tf_error
)
7346 error ("argument in position %qP is not a "
7347 "potential constant expression", i
);
7354 case NON_LVALUE_EXPR
:
7355 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7356 -- an lvalue of integral type that refers to a non-volatile
7357 const variable or static data member initialized with
7358 constant expressions, or
7360 -- an lvalue of literal type that refers to non-volatile
7361 object defined with constexpr, or that refers to a
7362 sub-object of such an object; */
7363 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7366 if (want_rval
&& !decl_constant_var_p (t
))
7368 if (flags
& tf_error
)
7369 error ("variable %qD is not declared constexpr", t
);
7376 case VIEW_CONVERT_EXPR
:
7377 /* -- an array-to-pointer conversion that is applied to an lvalue
7378 that designates an object with thread or automatic storage
7379 duration; FIXME not implemented as it breaks constexpr arrays;
7380 need to fix the standard
7381 -- a type conversion from a pointer or pointer-to-member type
7382 to a literal type. */
7384 tree from
= TREE_OPERAND (t
, 0);
7385 tree source
= TREE_TYPE (from
);
7386 tree target
= TREE_TYPE (t
);
7387 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (target
)
7388 && !(TREE_CODE (from
) == COMPONENT_REF
7389 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from
, 0)))))
7391 if (flags
& tf_error
)
7392 error ("conversion of expression %qE of pointer type "
7393 "cannot yield a constant expression", from
);
7396 return (potential_constant_expression_1
7397 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
7401 /* -- a unary operator & that is applied to an lvalue that
7402 designates an object with thread or automatic storage
7404 t
= TREE_OPERAND (t
, 0);
7406 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7407 any checking here, as we might dereference the pointer later. If
7408 we remove this code, also remove check_automatic_or_tls. */
7409 i
= check_automatic_or_tls (t
);
7414 if (flags
& tf_error
)
7415 error ("address-of an object %qE with thread local or "
7416 "automatic storage is not a constant expression", t
);
7420 return potential_constant_expression_1 (t
, any
, flags
);
7426 /* -- a class member access unless its postfix-expression is
7427 of literal type or of pointer to literal type. */
7428 /* This test would be redundant, as it follows from the
7429 postfix-expression being a potential constant expression. */
7430 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7433 case EXPR_PACK_EXPANSION
:
7434 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
7439 tree x
= TREE_OPERAND (t
, 0);
7441 if (is_this_parameter (x
))
7443 return potential_constant_expression_1 (x
, rval
, flags
);
7447 case DYNAMIC_CAST_EXPR
:
7448 case PSEUDO_DTOR_EXPR
:
7449 case PREINCREMENT_EXPR
:
7450 case POSTINCREMENT_EXPR
:
7451 case PREDECREMENT_EXPR
:
7452 case POSTDECREMENT_EXPR
:
7456 case VEC_DELETE_EXPR
:
7460 /* GCC internal stuff. */
7463 case WITH_CLEANUP_EXPR
:
7464 case CLEANUP_POINT_EXPR
:
7465 case MUST_NOT_THROW_EXPR
:
7466 case TRY_CATCH_EXPR
:
7467 case STATEMENT_LIST
:
7468 /* Don't bother trying to define a subset of statement-expressions to
7469 be constant-expressions, at least for now. */
7473 if (flags
& tf_error
)
7474 error ("expression %qE is not a constant-expression", t
);
7478 /* -- a typeid expression whose operand is of polymorphic
7481 tree e
= TREE_OPERAND (t
, 0);
7482 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
7483 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
7485 if (flags
& tf_error
)
7486 error ("typeid-expression is not a constant expression "
7487 "because %qE is of polymorphic type", e
);
7494 /* -- a subtraction where both operands are pointers. */
7495 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7496 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7498 if (flags
& tf_error
)
7499 error ("difference of two pointer expressions is not "
7500 "a constant expression");
7512 /* -- a relational or equality operator where at least
7513 one of the operands is a pointer. */
7514 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7515 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7517 if (flags
& tf_error
)
7518 error ("pointer comparison expression is not a "
7519 "constant expression");
7529 case FIX_TRUNC_EXPR
:
7534 case TRUTH_NOT_EXPR
:
7535 case FIXED_CONVERT_EXPR
:
7536 case UNARY_PLUS_EXPR
:
7537 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
7541 case CONST_CAST_EXPR
:
7542 case STATIC_CAST_EXPR
:
7543 case REINTERPRET_CAST_EXPR
:
7544 return (potential_constant_expression_1
7545 (TREE_OPERAND (t
, 0),
7546 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
7549 case NON_DEPENDENT_EXPR
:
7550 /* For convenience. */
7552 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7556 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7561 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7566 VEC(constructor_elt
, gc
) *v
= CONSTRUCTOR_ELTS (t
);
7567 constructor_elt
*ce
;
7568 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
7569 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
7576 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
7577 || DECL_P (TREE_PURPOSE (t
)));
7578 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
7581 if (TREE_CHAIN (t
) == NULL_TREE
)
7583 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
7587 case TRUNC_DIV_EXPR
:
7589 case FLOOR_DIV_EXPR
:
7590 case ROUND_DIV_EXPR
:
7591 case TRUNC_MOD_EXPR
:
7593 case ROUND_MOD_EXPR
:
7595 tree denom
= TREE_OPERAND (t
, 1);
7596 /* We can't call maybe_constant_value on an expression
7597 that hasn't been through fold_non_dependent_expr yet. */
7598 if (!processing_template_decl
)
7599 denom
= maybe_constant_value (denom
);
7600 if (integer_zerop (denom
))
7602 if (flags
& tf_error
)
7603 error ("division by zero is not a constant-expression");
7615 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7616 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7617 introduced by build_call_a. */
7618 tree op0
= TREE_OPERAND (t
, 0);
7619 tree op1
= TREE_OPERAND (t
, 1);
7621 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7622 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7623 return potential_constant_expression_1 (op0
, want_rval
, flags
);
7628 /* If the first operand is the non-short-circuit constant, look at
7629 the second operand; otherwise we only care about the first one for
7631 case TRUTH_AND_EXPR
:
7632 case TRUTH_ANDIF_EXPR
:
7633 tmp
= boolean_true_node
;
7636 case TRUTH_ORIF_EXPR
:
7637 tmp
= boolean_false_node
;
7639 if (TREE_OPERAND (t
, 0) == tmp
)
7640 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
7642 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7646 case POINTER_PLUS_EXPR
:
7648 case EXACT_DIV_EXPR
:
7658 case TRUTH_XOR_EXPR
:
7669 case ARRAY_RANGE_REF
:
7673 for (i
= 0; i
< 2; ++i
)
7674 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7681 /* If the condition is a known constant, we know which of the legs we
7682 care about; otherwise we only require that the condition and
7683 either of the legs be potentially constant. */
7684 tmp
= TREE_OPERAND (t
, 0);
7685 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
7687 else if (tmp
== boolean_true_node
)
7688 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7690 else if (tmp
== boolean_false_node
)
7691 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
7693 for (i
= 1; i
< 3; ++i
)
7694 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7695 want_rval
, tf_none
))
7697 if (flags
& tf_error
)
7698 error ("expression %qE is not a constant-expression", t
);
7702 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
7704 if (flags
& tf_error
)
7705 error ("non-constant array initialization");
7709 sorry ("unexpected ast of kind %s", tree_code_name
[TREE_CODE (t
)]);
7715 /* The main entry point to the above. */
7718 potential_constant_expression (tree t
)
7720 return potential_constant_expression_1 (t
, false, tf_none
);
7723 /* Like above, but complain about non-constant expressions. */
7726 require_potential_constant_expression (tree t
)
7728 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
7731 /* Constructor for a lambda expression. */
7734 build_lambda_expr (void)
7736 tree lambda
= make_node (LAMBDA_EXPR
);
7737 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
7738 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
7739 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
7740 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
7741 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
7745 /* Create the closure object for a LAMBDA_EXPR. */
7748 build_lambda_object (tree lambda_expr
)
7750 /* Build aggregate constructor call.
7751 - cp_parser_braced_list
7752 - cp_parser_functional_cast */
7753 VEC(constructor_elt
,gc
) *elts
= NULL
;
7754 tree node
, expr
, type
;
7755 location_t saved_loc
;
7757 if (processing_template_decl
)
7760 /* Make sure any error messages refer to the lambda-introducer. */
7761 saved_loc
= input_location
;
7762 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
7764 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
7766 node
= TREE_CHAIN (node
))
7768 tree field
= TREE_PURPOSE (node
);
7769 tree val
= TREE_VALUE (node
);
7774 /* Mere mortals can't copy arrays with aggregate initialization, so
7775 do some magic to make it work here. */
7776 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
7777 val
= build_array_copy (val
);
7778 else if (DECL_NORMAL_CAPTURE_P (field
)
7779 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
7781 /* "the entities that are captured by copy are used to
7782 direct-initialize each corresponding non-static data
7783 member of the resulting closure object."
7785 There's normally no way to express direct-initialization
7786 from an element of a CONSTRUCTOR, so we build up a special
7787 TARGET_EXPR to bypass the usual copy-initialization. */
7788 val
= force_rvalue (val
);
7789 if (TREE_CODE (val
) == TARGET_EXPR
)
7790 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
7793 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
7796 expr
= build_constructor (init_list_type_node
, elts
);
7797 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
7799 /* N2927: "[The closure] class type is not an aggregate."
7800 But we briefly treat it as an aggregate to make this simpler. */
7801 type
= TREE_TYPE (lambda_expr
);
7802 CLASSTYPE_NON_AGGREGATE (type
) = 0;
7803 expr
= finish_compound_literal (type
, expr
);
7804 CLASSTYPE_NON_AGGREGATE (type
) = 1;
7806 input_location
= saved_loc
;
7810 /* Return an initialized RECORD_TYPE for LAMBDA.
7811 LAMBDA must have its explicit captures already. */
7814 begin_lambda_type (tree lambda
)
7819 /* Unique name. This is just like an unnamed class, but we cannot use
7820 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
7822 name
= make_lambda_name ();
7824 /* Create the new RECORD_TYPE for this lambda. */
7825 type
= xref_tag (/*tag_code=*/record_type
,
7827 /*scope=*/ts_within_enclosing_non_class
,
7828 /*template_header_p=*/false);
7831 /* Designate it as a struct so that we can use aggregate initialization. */
7832 CLASSTYPE_DECLARED_CLASS (type
) = false;
7834 /* Clear base types. */
7835 xref_basetypes (type
, /*bases=*/NULL_TREE
);
7837 /* Start the class. */
7838 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
7840 /* Cross-reference the expression and the type. */
7841 TREE_TYPE (lambda
) = type
;
7842 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
7847 /* Returns the type to use for the return type of the operator() of a
7851 lambda_return_type (tree expr
)
7854 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7856 warning (0, "cannot deduce lambda return type from a braced-init-list");
7857 return void_type_node
;
7859 if (type_dependent_expression_p (expr
))
7861 type
= cxx_make_type (DECLTYPE_TYPE
);
7862 DECLTYPE_TYPE_EXPR (type
) = expr
;
7863 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
7864 SET_TYPE_STRUCTURAL_EQUALITY (type
);
7867 type
= type_decays_to (unlowered_expr_type (expr
));
7871 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
7875 lambda_function (tree lambda
)
7878 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
7879 type
= TREE_TYPE (lambda
);
7882 gcc_assert (LAMBDA_TYPE_P (type
));
7883 /* Don't let debug_tree cause instantiation. */
7884 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
7886 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
7887 /*protect=*/0, /*want_type=*/false);
7889 lambda
= BASELINK_FUNCTIONS (lambda
);
7893 /* Returns the type to use for the FIELD_DECL corresponding to the
7895 The caller should add REFERENCE_TYPE for capture by reference. */
7898 lambda_capture_field_type (tree expr
)
7901 if (type_dependent_expression_p (expr
))
7903 type
= cxx_make_type (DECLTYPE_TYPE
);
7904 DECLTYPE_TYPE_EXPR (type
) = expr
;
7905 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
7906 SET_TYPE_STRUCTURAL_EQUALITY (type
);
7909 type
= non_reference (unlowered_expr_type (expr
));
7913 /* Recompute the return type for LAMBDA with body of the form:
7914 { return EXPR ; } */
7917 apply_lambda_return_type (tree lambda
, tree return_type
)
7919 tree fco
= lambda_function (lambda
);
7922 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
7924 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
7925 it would interfere with instantiating the closure type. */
7926 if (dependent_type_p (return_type
))
7928 if (return_type
== error_mark_node
)
7931 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
7932 TREE_TYPE (METHOD_TYPE) == return-type */
7933 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
7935 result
= DECL_RESULT (fco
);
7936 if (result
== NULL_TREE
)
7939 /* We already have a DECL_RESULT from start_preparsed_function.
7940 Now we need to redo the work it and allocate_struct_function
7941 did to reflect the new type. */
7942 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
7943 TYPE_MAIN_VARIANT (return_type
));
7944 DECL_ARTIFICIAL (result
) = 1;
7945 DECL_IGNORED_P (result
) = 1;
7946 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
7949 DECL_RESULT (fco
) = result
;
7951 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
7953 #ifdef PCC_STATIC_STRUCT_RETURN
7954 cfun
->returns_pcc_struct
= 1;
7956 cfun
->returns_struct
= 1;
7961 /* DECL is a local variable or parameter from the surrounding scope of a
7962 lambda-expression. Returns the decltype for a use of the capture field
7963 for DECL even if it hasn't been captured yet. */
7966 capture_decltype (tree decl
)
7968 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
7969 /* FIXME do lookup instead of list walk? */
7970 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
7974 type
= TREE_TYPE (TREE_PURPOSE (cap
));
7976 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
7979 error ("%qD is not captured", decl
);
7980 return error_mark_node
;
7983 type
= TREE_TYPE (decl
);
7984 if (TREE_CODE (type
) == REFERENCE_TYPE
7985 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
7986 type
= TREE_TYPE (type
);
7989 case CPLD_REFERENCE
:
7990 type
= TREE_TYPE (decl
);
7991 if (TREE_CODE (type
) != REFERENCE_TYPE
)
7992 type
= build_reference_type (TREE_TYPE (decl
));
7999 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8001 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
8002 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
8004 type
= build_reference_type (type
);
8009 /* From an ID and INITIALIZER, create a capture (by reference if
8010 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8014 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
8015 bool explicit_init_p
)
8020 type
= lambda_capture_field_type (initializer
);
8023 type
= build_reference_type (type
);
8024 if (!real_lvalue_p (initializer
))
8025 error ("cannot capture %qE by reference", initializer
);
8028 /* Make member variable. */
8029 member
= build_lang_decl (FIELD_DECL
, id
, type
);
8030 if (!explicit_init_p
)
8031 /* Normal captures are invisible to name lookup but uses are replaced
8032 with references to the capture field; we implement this by only
8033 really making them invisible in unevaluated context; see
8034 qualify_lookup. For now, let's make explicitly initialized captures
8036 DECL_NORMAL_CAPTURE_P (member
) = true;
8038 /* Add it to the appropriate closure class if we've started it. */
8039 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
8040 finish_member_declaration (member
);
8042 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
8043 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
8045 if (id
== get_identifier ("__this"))
8047 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
8048 error ("already captured %<this%> in lambda expression");
8049 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
8055 /* Register all the capture members on the list CAPTURES, which is the
8056 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8058 void register_capture_members (tree captures
)
8062 register_capture_members (TREE_CHAIN (captures
));
8063 finish_member_declaration (TREE_PURPOSE (captures
));
8067 /* Given a FIELD_DECL decl belonging to a closure type, return a
8068 COMPONENT_REF of it relative to the 'this' parameter of the op() for
8072 thisify_lambda_field (tree decl
)
8074 tree context
= lambda_function (DECL_CONTEXT (decl
));
8075 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
8077 tf_warning_or_error
);
8078 return finish_non_static_data_member (decl
, object
,
8079 /*qualifying_scope*/NULL_TREE
);
8082 /* Similar to add_capture, except this works on a stack of nested lambdas.
8083 BY_REFERENCE_P in this case is derived from the default capture mode.
8084 Returns the capture for the lambda at the bottom of the stack. */
8087 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
8089 bool this_capture_p
= (id
== get_identifier ("__this"));
8091 tree member
= NULL_TREE
;
8093 tree saved_class_type
= current_class_type
;
8097 for (node
= lambda_stack
;
8099 node
= TREE_CHAIN (node
))
8101 tree lambda
= TREE_VALUE (node
);
8103 current_class_type
= TREE_TYPE (lambda
);
8104 member
= add_capture (lambda
,
8109 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
8110 == CPLD_REFERENCE
)),
8111 /*explicit_init_p=*/false);
8112 initializer
= thisify_lambda_field (member
);
8115 current_class_type
= saved_class_type
;
8120 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8121 INDIRECT_REF, possibly adding it through default capturing. */
8124 lambda_expr_this_capture (tree lambda
)
8128 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8130 /* Try to default capture 'this' if we can. */
8132 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
8134 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
8135 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
8136 tree init
= NULL_TREE
;
8138 /* If we are in a lambda function, we can move out until we hit:
8139 1. a non-lambda function,
8140 2. a lambda function capturing 'this', or
8141 3. a non-default capturing lambda function. */
8142 while (LAMBDA_FUNCTION_P (containing_function
))
8145 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
8147 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
8149 /* An outer lambda has already captured 'this'. */
8150 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8151 init
= thisify_lambda_field (cap
);
8155 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
8156 /* An outer lambda won't let us capture 'this'. */
8159 lambda_stack
= tree_cons (NULL_TREE
,
8163 containing_function
= decl_function_context (containing_function
);
8166 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
8167 && !LAMBDA_FUNCTION_P (containing_function
))
8168 /* First parameter is 'this'. */
8169 init
= DECL_ARGUMENTS (containing_function
);
8172 this_capture
= add_default_capture (lambda_stack
,
8173 /*id=*/get_identifier ("__this"),
8179 error ("%<this%> was not captured for this lambda function");
8180 result
= error_mark_node
;
8184 /* To make sure that current_class_ref is for the lambda. */
8185 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
8187 result
= finish_non_static_data_member (this_capture
,
8189 /*qualifying_scope=*/NULL_TREE
);
8191 /* If 'this' is captured, each use of 'this' is transformed into an
8192 access to the corresponding unnamed data member of the closure
8193 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8194 ensures that the transformed expression is an rvalue. ] */
8195 result
= rvalue (result
);
8201 /* Returns the method basetype of the innermost non-lambda function, or
8202 NULL_TREE if none. */
8205 nonlambda_method_basetype (void)
8208 if (!current_class_ref
)
8211 type
= current_class_type
;
8212 if (!LAMBDA_TYPE_P (type
))
8215 /* Find the nearest enclosing non-lambda function. */
8216 fn
= TYPE_NAME (type
);
8218 fn
= decl_function_context (fn
);
8219 while (fn
&& LAMBDA_FUNCTION_P (fn
));
8221 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
8224 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
8227 /* If the closure TYPE has a static op(), also add a conversion to function
8231 maybe_add_lambda_conv_op (tree type
)
8233 bool nested
= (current_function_decl
!= NULL_TREE
);
8234 tree callop
= lambda_function (type
);
8235 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
8236 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
8237 VEC (tree
, gc
) *argvec
;
8239 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
8242 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
8243 FUNCTION_ARG_CHAIN (callop
));
8245 /* First build up the conversion op. */
8247 rettype
= build_pointer_type (stattype
);
8248 name
= mangle_conv_op_name_for_type (rettype
);
8249 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
8250 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
8251 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
8252 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8254 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8255 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8256 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8258 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
8259 grokclassfn (type
, fn
, NO_SPECIAL
);
8260 set_linkage_according_to_type (type
, fn
);
8261 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8262 DECL_IN_AGGR_P (fn
) = 1;
8263 DECL_ARTIFICIAL (fn
) = 1;
8264 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8265 DECL_DECLARED_INLINE_P (fn
) = 1;
8266 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
8268 DECL_INTERFACE_KNOWN (fn
) = 1;
8270 add_method (type
, fn
, NULL_TREE
);
8272 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8273 the conversion op is used. */
8274 if (varargs_function_p (callop
))
8276 DECL_DELETED_FN (fn
) = 1;
8280 /* Now build up the thunk to be returned. */
8282 name
= get_identifier ("_FUN");
8283 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
8284 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8285 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8286 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8287 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8288 grokclassfn (type
, fn
, NO_SPECIAL
);
8289 set_linkage_according_to_type (type
, fn
);
8290 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8291 DECL_IN_AGGR_P (fn
) = 1;
8292 DECL_ARTIFICIAL (fn
) = 1;
8293 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8294 DECL_DECLARED_INLINE_P (fn
) = 1;
8295 DECL_STATIC_FUNCTION_P (fn
) = 1;
8296 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
8297 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
8298 DECL_CONTEXT (arg
) = fn
;
8300 DECL_INTERFACE_KNOWN (fn
) = 1;
8302 add_method (type
, fn
, NULL_TREE
);
8305 push_function_context ();
8307 /* Generate the body of the thunk. */
8309 start_preparsed_function (statfn
, NULL_TREE
,
8310 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8311 if (DECL_ONE_ONLY (statfn
))
8313 /* Put the thunk in the same comdat group as the call op. */
8314 struct cgraph_node
*callop_node
, *thunk_node
;
8315 DECL_COMDAT_GROUP (statfn
) = DECL_COMDAT_GROUP (callop
);
8316 callop_node
= cgraph_node (callop
);
8317 thunk_node
= cgraph_node (statfn
);
8318 gcc_assert (callop_node
->same_comdat_group
== NULL
);
8319 gcc_assert (thunk_node
->same_comdat_group
== NULL
);
8320 callop_node
->same_comdat_group
= thunk_node
;
8321 thunk_node
->same_comdat_group
= callop_node
;
8323 body
= begin_function_body ();
8324 compound_stmt
= begin_compound_stmt (0);
8326 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
8328 argvec
= make_tree_vector ();
8329 VEC_quick_push (tree
, argvec
, arg
);
8330 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
8331 VEC_safe_push (tree
, gc
, argvec
, arg
);
8332 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
8333 VEC_address (tree
, argvec
));
8334 CALL_FROM_THUNK_P (call
) = 1;
8335 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
8336 call
= build_cplus_new (TREE_TYPE (call
), call
);
8337 call
= convert_from_reference (call
);
8338 finish_return_stmt (call
);
8340 finish_compound_stmt (compound_stmt
);
8341 finish_function_body (body
);
8343 expand_or_defer_fn (finish_function (2));
8345 /* Generate the body of the conversion op. */
8347 start_preparsed_function (convfn
, NULL_TREE
,
8348 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8349 body
= begin_function_body ();
8350 compound_stmt
= begin_compound_stmt (0);
8352 finish_return_stmt (decay_conversion (statfn
));
8354 finish_compound_stmt (compound_stmt
);
8355 finish_function_body (body
);
8357 expand_or_defer_fn (finish_function (2));
8360 pop_function_context ();
8362 #include "gt-cp-semantics.h"