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 if (object
== error_mark_node
)
1537 return error_mark_node
;
1539 /* DR 613: Can use non-static data members without an associated
1540 object in sizeof/decltype/alignof. */
1541 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1542 && (!processing_template_decl
|| !current_class_ref
))
1544 if (current_function_decl
1545 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1546 error ("invalid use of member %q+D in static member function", decl
);
1548 error ("invalid use of non-static data member %q+D", decl
);
1549 error ("from this location");
1551 return error_mark_node
;
1554 if (current_class_ptr
)
1555 TREE_USED (current_class_ptr
) = 1;
1556 if (processing_template_decl
&& !qualifying_scope
)
1558 tree type
= TREE_TYPE (decl
);
1560 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1561 type
= TREE_TYPE (type
);
1564 /* Set the cv qualifiers. */
1565 int quals
= (current_class_ref
1566 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1567 : TYPE_UNQUALIFIED
);
1569 if (DECL_MUTABLE_P (decl
))
1570 quals
&= ~TYPE_QUAL_CONST
;
1572 quals
|= cp_type_quals (TREE_TYPE (decl
));
1573 type
= cp_build_qualified_type (type
, quals
);
1576 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1578 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1579 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1581 else if (processing_template_decl
)
1582 return build_qualified_name (TREE_TYPE (decl
),
1585 /*template_p=*/false);
1588 tree access_type
= TREE_TYPE (object
);
1590 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1593 /* If the data member was named `C::M', convert `*this' to `C'
1595 if (qualifying_scope
)
1597 tree binfo
= NULL_TREE
;
1598 object
= build_scoped_ref (object
, qualifying_scope
,
1602 return build_class_member_access_expr (object
, decl
,
1603 /*access_path=*/NULL_TREE
,
1604 /*preserve_reference=*/false,
1605 tf_warning_or_error
);
1609 /* If we are currently parsing a template and we encountered a typedef
1610 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1611 adds the typedef to a list tied to the current template.
1612 At tempate instantiatin time, that list is walked and access check
1613 performed for each typedef.
1614 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1617 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1619 location_t location
)
1621 tree template_info
= NULL
;
1622 tree cs
= current_scope ();
1624 if (!is_typedef_decl (typedef_decl
)
1626 || !CLASS_TYPE_P (context
)
1630 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1631 template_info
= get_template_info (cs
);
1634 && TI_TEMPLATE (template_info
)
1635 && !currently_open_class (context
))
1636 append_type_to_template_for_access_check (cs
, typedef_decl
,
1640 /* DECL was the declaration to which a qualified-id resolved. Issue
1641 an error message if it is not accessible. If OBJECT_TYPE is
1642 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1643 type of `*x', or `x', respectively. If the DECL was named as
1644 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1647 check_accessibility_of_qualified_id (tree decl
,
1649 tree nested_name_specifier
)
1652 tree qualifying_type
= NULL_TREE
;
1654 /* If we are parsing a template declaration and if decl is a typedef,
1655 add it to a list tied to the template.
1656 At template instantiation time, that list will be walked and
1657 access check performed. */
1658 add_typedef_to_current_template_for_access_check (decl
,
1659 nested_name_specifier
1660 ? nested_name_specifier
1661 : DECL_CONTEXT (decl
),
1664 /* If we're not checking, return immediately. */
1665 if (deferred_access_no_check
)
1668 /* Determine the SCOPE of DECL. */
1669 scope
= context_for_name_lookup (decl
);
1670 /* If the SCOPE is not a type, then DECL is not a member. */
1671 if (!TYPE_P (scope
))
1673 /* Compute the scope through which DECL is being accessed. */
1675 /* OBJECT_TYPE might not be a class type; consider:
1677 class A { typedef int I; };
1681 In this case, we will have "A::I" as the DECL, but "I" as the
1683 && CLASS_TYPE_P (object_type
)
1684 && DERIVED_FROM_P (scope
, object_type
))
1685 /* If we are processing a `->' or `.' expression, use the type of the
1687 qualifying_type
= object_type
;
1688 else if (nested_name_specifier
)
1690 /* If the reference is to a non-static member of the
1691 current class, treat it as if it were referenced through
1693 if (DECL_NONSTATIC_MEMBER_P (decl
)
1694 && current_class_ptr
1695 && DERIVED_FROM_P (scope
, current_class_type
))
1696 qualifying_type
= current_class_type
;
1697 /* Otherwise, use the type indicated by the
1698 nested-name-specifier. */
1700 qualifying_type
= nested_name_specifier
;
1703 /* Otherwise, the name must be from the current class or one of
1705 qualifying_type
= currently_open_derived_class (scope
);
1708 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1709 or similar in a default argument value. */
1710 && CLASS_TYPE_P (qualifying_type
)
1711 && !dependent_type_p (qualifying_type
))
1712 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1716 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1717 class named to the left of the "::" operator. DONE is true if this
1718 expression is a complete postfix-expression; it is false if this
1719 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1720 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1721 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1722 is true iff this qualified name appears as a template argument. */
1725 finish_qualified_id_expr (tree qualifying_class
,
1730 bool template_arg_p
)
1732 gcc_assert (TYPE_P (qualifying_class
));
1734 if (error_operand_p (expr
))
1735 return error_mark_node
;
1737 if (DECL_P (expr
) || BASELINK_P (expr
))
1741 check_template_keyword (expr
);
1743 /* If EXPR occurs as the operand of '&', use special handling that
1744 permits a pointer-to-member. */
1745 if (address_p
&& done
)
1747 if (TREE_CODE (expr
) == SCOPE_REF
)
1748 expr
= TREE_OPERAND (expr
, 1);
1749 expr
= build_offset_ref (qualifying_class
, expr
,
1750 /*address_p=*/true);
1754 /* Within the scope of a class, turn references to non-static
1755 members into expression of the form "this->...". */
1757 /* But, within a template argument, we do not want make the
1758 transformation, as there is no "this" pointer. */
1760 else if (TREE_CODE (expr
) == FIELD_DECL
)
1762 push_deferring_access_checks (dk_no_check
);
1763 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1765 pop_deferring_access_checks ();
1767 else if (BASELINK_P (expr
) && !processing_template_decl
)
1771 /* See if any of the functions are non-static members. */
1772 /* If so, the expression may be relative to 'this'. */
1773 if (!shared_member_p (expr
)
1774 && (ob
= maybe_dummy_object (qualifying_class
, NULL
),
1775 !is_dummy_object (ob
)))
1776 expr
= (build_class_member_access_expr
1779 BASELINK_ACCESS_BINFO (expr
),
1780 /*preserve_reference=*/false,
1781 tf_warning_or_error
));
1783 /* The expression is a qualified name whose address is not
1785 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1791 /* Begin a statement-expression. The value returned must be passed to
1792 finish_stmt_expr. */
1795 begin_stmt_expr (void)
1797 return push_stmt_list ();
1800 /* Process the final expression of a statement expression. EXPR can be
1801 NULL, if the final expression is empty. Return a STATEMENT_LIST
1802 containing all the statements in the statement-expression, or
1803 ERROR_MARK_NODE if there was an error. */
1806 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1808 if (error_operand_p (expr
))
1810 /* The type of the statement-expression is the type of the last
1812 TREE_TYPE (stmt_expr
) = error_mark_node
;
1813 return error_mark_node
;
1816 /* If the last statement does not have "void" type, then the value
1817 of the last statement is the value of the entire expression. */
1820 tree type
= TREE_TYPE (expr
);
1822 if (processing_template_decl
)
1824 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1825 expr
= add_stmt (expr
);
1826 /* Mark the last statement so that we can recognize it as such at
1827 template-instantiation time. */
1828 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1830 else if (VOID_TYPE_P (type
))
1832 /* Just treat this like an ordinary statement. */
1833 expr
= finish_expr_stmt (expr
);
1837 /* It actually has a value we need to deal with. First, force it
1838 to be an rvalue so that we won't need to build up a copy
1839 constructor call later when we try to assign it to something. */
1840 expr
= force_rvalue (expr
);
1841 if (error_operand_p (expr
))
1842 return error_mark_node
;
1844 /* Update for array-to-pointer decay. */
1845 type
= TREE_TYPE (expr
);
1847 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1848 normal statement, but don't convert to void or actually add
1850 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1851 expr
= maybe_cleanup_point_expr (expr
);
1855 /* The type of the statement-expression is the type of the last
1857 TREE_TYPE (stmt_expr
) = type
;
1863 /* Finish a statement-expression. EXPR should be the value returned
1864 by the previous begin_stmt_expr. Returns an expression
1865 representing the statement-expression. */
1868 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1873 if (error_operand_p (stmt_expr
))
1875 pop_stmt_list (stmt_expr
);
1876 return error_mark_node
;
1879 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1881 type
= TREE_TYPE (stmt_expr
);
1882 result
= pop_stmt_list (stmt_expr
);
1883 TREE_TYPE (result
) = type
;
1885 if (processing_template_decl
)
1887 result
= build_min (STMT_EXPR
, type
, result
);
1888 TREE_SIDE_EFFECTS (result
) = 1;
1889 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1891 else if (CLASS_TYPE_P (type
))
1893 /* Wrap the statement-expression in a TARGET_EXPR so that the
1894 temporary object created by the final expression is destroyed at
1895 the end of the full-expression containing the
1896 statement-expression. */
1897 result
= force_target_expr (type
, result
);
1903 /* Returns the expression which provides the value of STMT_EXPR. */
1906 stmt_expr_value_expr (tree stmt_expr
)
1908 tree t
= STMT_EXPR_STMT (stmt_expr
);
1910 if (TREE_CODE (t
) == BIND_EXPR
)
1911 t
= BIND_EXPR_BODY (t
);
1913 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1914 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1916 if (TREE_CODE (t
) == EXPR_STMT
)
1917 t
= EXPR_STMT_EXPR (t
);
1922 /* Return TRUE iff EXPR_STMT is an empty list of
1923 expression statements. */
1926 empty_expr_stmt_p (tree expr_stmt
)
1928 tree body
= NULL_TREE
;
1930 if (expr_stmt
== void_zero_node
)
1935 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1936 body
= EXPR_STMT_EXPR (expr_stmt
);
1937 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1943 if (TREE_CODE (body
) == STATEMENT_LIST
)
1944 return tsi_end_p (tsi_start (body
));
1946 return empty_expr_stmt_p (body
);
1951 /* Perform Koenig lookup. FN is the postfix-expression representing
1952 the function (or functions) to call; ARGS are the arguments to the
1953 call; if INCLUDE_STD then the `std' namespace is automatically
1954 considered an associated namespace (used in range-based for loops).
1955 Returns the functions to be considered by overload resolution. */
1958 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
, bool include_std
)
1960 tree identifier
= NULL_TREE
;
1961 tree functions
= NULL_TREE
;
1962 tree tmpl_args
= NULL_TREE
;
1963 bool template_id
= false;
1965 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1967 /* Use a separate flag to handle null args. */
1969 tmpl_args
= TREE_OPERAND (fn
, 1);
1970 fn
= TREE_OPERAND (fn
, 0);
1973 /* Find the name of the overloaded function. */
1974 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1976 else if (is_overloaded_fn (fn
))
1979 identifier
= DECL_NAME (get_first_fn (functions
));
1981 else if (DECL_P (fn
))
1984 identifier
= DECL_NAME (fn
);
1987 /* A call to a namespace-scope function using an unqualified name.
1989 Do Koenig lookup -- unless any of the arguments are
1991 if (!any_type_dependent_arguments_p (args
)
1992 && !any_dependent_template_arguments_p (tmpl_args
))
1994 fn
= lookup_arg_dependent (identifier
, functions
, args
, include_std
);
1996 /* The unqualified name could not be resolved. */
1997 fn
= unqualified_fn_lookup_error (identifier
);
2000 if (fn
&& template_id
)
2001 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2006 /* Generate an expression for `FN (ARGS)'. This may change the
2009 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2010 as a virtual call, even if FN is virtual. (This flag is set when
2011 encountering an expression where the function name is explicitly
2012 qualified. For example a call to `X::f' never generates a virtual
2015 Returns code for the call. */
2018 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
2019 bool koenig_p
, tsubst_flags_t complain
)
2023 VEC(tree
,gc
) *orig_args
= NULL
;
2025 if (fn
== error_mark_node
)
2026 return error_mark_node
;
2028 gcc_assert (!TYPE_P (fn
));
2032 if (processing_template_decl
)
2034 /* If the call expression is dependent, build a CALL_EXPR node
2035 with no type; type_dependent_expression_p recognizes
2036 expressions with no type as being dependent. */
2037 if (type_dependent_expression_p (fn
)
2038 || any_type_dependent_arguments_p (*args
)
2039 /* For a non-static member function, we need to specifically
2040 test the type dependency of the "this" pointer because it
2041 is not included in *ARGS even though it is considered to
2042 be part of the list of arguments. Note that this is
2043 related to CWG issues 515 and 1005. */
2044 || ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
2045 && current_class_ref
2046 && type_dependent_expression_p (current_class_ref
)))
2048 result
= build_nt_call_vec (fn
, *args
);
2049 KOENIG_LOOKUP_P (result
) = koenig_p
;
2054 tree fndecl
= OVL_CURRENT (fn
);
2055 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2056 || !TREE_THIS_VOLATILE (fndecl
))
2062 current_function_returns_abnormally
= 1;
2066 orig_args
= make_tree_vector_copy (*args
);
2067 if (!BASELINK_P (fn
)
2068 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2069 && TREE_TYPE (fn
) != unknown_type_node
)
2070 fn
= build_non_dependent_expr (fn
);
2071 make_args_non_dependent (*args
);
2074 if (is_overloaded_fn (fn
))
2075 fn
= baselink_for_fns (fn
);
2078 if (BASELINK_P (fn
))
2082 /* A call to a member function. From [over.call.func]:
2084 If the keyword this is in scope and refers to the class of
2085 that member function, or a derived class thereof, then the
2086 function call is transformed into a qualified function call
2087 using (*this) as the postfix-expression to the left of the
2088 . operator.... [Otherwise] a contrived object of type T
2089 becomes the implied object argument.
2093 struct A { void f(); };
2094 struct B : public A {};
2095 struct C : public A { void g() { B::f(); }};
2097 "the class of that member function" refers to `A'. But 11.2
2098 [class.access.base] says that we need to convert 'this' to B* as
2099 part of the access, so we pass 'B' to maybe_dummy_object. */
2101 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2104 if (processing_template_decl
)
2106 if (type_dependent_expression_p (object
))
2108 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2109 release_tree_vector (orig_args
);
2112 object
= build_non_dependent_expr (object
);
2115 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2117 ? LOOKUP_NONVIRTUAL
: 0),
2121 else if (is_overloaded_fn (fn
))
2123 /* If the function is an overloaded builtin, resolve it. */
2124 if (TREE_CODE (fn
) == FUNCTION_DECL
2125 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2126 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2127 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2130 /* A call to a namespace-scope function. */
2131 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2133 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2135 if (!VEC_empty (tree
, *args
))
2136 error ("arguments to destructor are not allowed");
2137 /* Mark the pseudo-destructor call as having side-effects so
2138 that we do not issue warnings about its use. */
2139 result
= build1 (NOP_EXPR
,
2141 TREE_OPERAND (fn
, 0));
2142 TREE_SIDE_EFFECTS (result
) = 1;
2144 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2145 /* If the "function" is really an object of class type, it might
2146 have an overloaded `operator ()'. */
2147 result
= build_op_call (fn
, args
, complain
);
2150 /* A call where the function is unknown. */
2151 result
= cp_build_function_call_vec (fn
, args
, complain
);
2153 if (processing_template_decl
&& result
!= error_mark_node
)
2155 if (TREE_CODE (result
) == INDIRECT_REF
)
2156 result
= TREE_OPERAND (result
, 0);
2157 gcc_assert (TREE_CODE (result
) == CALL_EXPR
2158 || TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
2160 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2161 KOENIG_LOOKUP_P (result
) = koenig_p
;
2162 release_tree_vector (orig_args
);
2163 result
= convert_from_reference (result
);
2169 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2170 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2171 POSTDECREMENT_EXPR.) */
2174 finish_increment_expr (tree expr
, enum tree_code code
)
2176 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2179 /* Finish a use of `this'. Returns an expression for `this'. */
2182 finish_this_expr (void)
2186 if (current_class_ptr
)
2188 tree type
= TREE_TYPE (current_class_ref
);
2190 /* In a lambda expression, 'this' refers to the captured 'this'. */
2191 if (LAMBDA_TYPE_P (type
))
2192 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2194 result
= current_class_ptr
;
2197 else if (current_function_decl
2198 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2200 error ("%<this%> is unavailable for static member functions");
2201 result
= error_mark_node
;
2205 if (current_function_decl
)
2206 error ("invalid use of %<this%> in non-member function");
2208 error ("invalid use of %<this%> at top level");
2209 result
= error_mark_node
;
2215 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2216 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2217 the TYPE for the type given. If SCOPE is non-NULL, the expression
2218 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2221 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2223 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2224 return error_mark_node
;
2226 gcc_assert (TYPE_P (destructor
));
2228 if (!processing_template_decl
)
2230 if (scope
== error_mark_node
)
2232 error ("invalid qualifying scope in pseudo-destructor name");
2233 return error_mark_node
;
2235 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2237 error ("qualified type %qT does not match destructor name ~%qT",
2239 return error_mark_node
;
2243 /* [expr.pseudo] says both:
2245 The type designated by the pseudo-destructor-name shall be
2246 the same as the object type.
2250 The cv-unqualified versions of the object type and of the
2251 type designated by the pseudo-destructor-name shall be the
2254 We implement the more generous second sentence, since that is
2255 what most other compilers do. */
2256 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2259 error ("%qE is not of type %qT", object
, destructor
);
2260 return error_mark_node
;
2264 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2267 /* Finish an expression of the form CODE EXPR. */
2270 finish_unary_op_expr (enum tree_code code
, tree expr
)
2272 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2273 /* Inside a template, build_x_unary_op does not fold the
2274 expression. So check whether the result is folded before
2275 setting TREE_NEGATED_INT. */
2276 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2277 && TREE_CODE (result
) == INTEGER_CST
2278 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2279 && INT_CST_LT (result
, integer_zero_node
))
2281 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2282 setting TREE_NEGATED_INT. */
2283 result
= copy_node (result
);
2284 TREE_NEGATED_INT (result
) = 1;
2286 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2287 overflow_warning (input_location
, result
);
2292 /* Finish a compound-literal expression. TYPE is the type to which
2293 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2296 finish_compound_literal (tree type
, tree compound_literal
)
2298 if (type
== error_mark_node
)
2299 return error_mark_node
;
2301 if (!TYPE_OBJ_P (type
))
2303 error ("compound literal of non-object type %qT", type
);
2304 return error_mark_node
;
2307 if (processing_template_decl
)
2309 TREE_TYPE (compound_literal
) = type
;
2310 /* Mark the expression as a compound literal. */
2311 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2312 return compound_literal
;
2315 type
= complete_type (type
);
2317 if (TYPE_NON_AGGREGATE_CLASS (type
))
2319 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2320 everywhere that deals with function arguments would be a pain, so
2321 just wrap it in a TREE_LIST. The parser set a flag so we know
2322 that it came from T{} rather than T({}). */
2323 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2324 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2325 return build_functional_cast (type
, compound_literal
, tf_error
);
2328 if (TREE_CODE (type
) == ARRAY_TYPE
2329 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2330 return error_mark_node
;
2331 compound_literal
= reshape_init (type
, compound_literal
);
2332 if (TREE_CODE (type
) == ARRAY_TYPE
)
2333 cp_complete_array_type (&type
, compound_literal
, false);
2334 compound_literal
= digest_init (type
, compound_literal
);
2335 return get_target_expr (compound_literal
);
2338 /* Return the declaration for the function-name variable indicated by
2342 finish_fname (tree id
)
2346 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2347 if (processing_template_decl
&& current_function_decl
)
2348 decl
= DECL_NAME (decl
);
2352 /* Finish a translation unit. */
2355 finish_translation_unit (void)
2357 /* In case there were missing closebraces,
2358 get us back to the global binding level. */
2360 while (current_namespace
!= global_namespace
)
2363 /* Do file scope __FUNCTION__ et al. */
2364 finish_fname_decls ();
2367 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2368 Returns the parameter. */
2371 finish_template_type_parm (tree aggr
, tree identifier
)
2373 if (aggr
!= class_type_node
)
2375 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2376 aggr
= class_type_node
;
2379 return build_tree_list (aggr
, identifier
);
2382 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2383 Returns the parameter. */
2386 finish_template_template_parm (tree aggr
, tree identifier
)
2388 tree decl
= build_decl (input_location
,
2389 TYPE_DECL
, identifier
, NULL_TREE
);
2390 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2391 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2392 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2393 DECL_ARTIFICIAL (decl
) = 1;
2394 end_template_decl ();
2396 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2398 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2399 /*is_primary=*/true, /*is_partial=*/false,
2402 return finish_template_type_parm (aggr
, tmpl
);
2405 /* ARGUMENT is the default-argument value for a template template
2406 parameter. If ARGUMENT is invalid, issue error messages and return
2407 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2410 check_template_template_default_arg (tree argument
)
2412 if (TREE_CODE (argument
) != TEMPLATE_DECL
2413 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2414 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2416 if (TREE_CODE (argument
) == TYPE_DECL
)
2417 error ("invalid use of type %qT as a default value for a template "
2418 "template-parameter", TREE_TYPE (argument
));
2420 error ("invalid default argument for a template template parameter");
2421 return error_mark_node
;
2427 /* Begin a class definition, as indicated by T. */
2430 begin_class_definition (tree t
, tree attributes
)
2432 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2433 return error_mark_node
;
2435 if (processing_template_parmlist
)
2437 error ("definition of %q#T inside template parameter list", t
);
2438 return error_mark_node
;
2441 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2442 are passed the same as decimal scalar types. */
2443 if (TREE_CODE (t
) == RECORD_TYPE
2444 && !processing_template_decl
)
2446 tree ns
= TYPE_CONTEXT (t
);
2447 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2448 && DECL_CONTEXT (ns
) == std_node
2450 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2452 const char *n
= TYPE_NAME_STRING (t
);
2453 if ((strcmp (n
, "decimal32") == 0)
2454 || (strcmp (n
, "decimal64") == 0)
2455 || (strcmp (n
, "decimal128") == 0))
2456 TYPE_TRANSPARENT_AGGR (t
) = 1;
2460 /* A non-implicit typename comes from code like:
2462 template <typename T> struct A {
2463 template <typename U> struct A<T>::B ...
2465 This is erroneous. */
2466 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2468 error ("invalid definition of qualified type %qT", t
);
2469 t
= error_mark_node
;
2472 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2474 t
= make_class_type (RECORD_TYPE
);
2475 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2478 if (TYPE_BEING_DEFINED (t
))
2480 t
= make_class_type (TREE_CODE (t
));
2481 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2483 maybe_process_partial_specialization (t
);
2485 TYPE_BEING_DEFINED (t
) = 1;
2487 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2488 fixup_attribute_variants (t
);
2490 if (flag_pack_struct
)
2493 TYPE_PACKED (t
) = 1;
2494 /* Even though the type is being defined for the first time
2495 here, there might have been a forward declaration, so there
2496 might be cv-qualified variants of T. */
2497 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2498 TYPE_PACKED (v
) = 1;
2500 /* Reset the interface data, at the earliest possible
2501 moment, as it might have been set via a class foo;
2503 if (! TYPE_ANONYMOUS_P (t
))
2505 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2506 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2507 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2508 (t
, finfo
->interface_unknown
);
2510 reset_specialization();
2512 /* Make a declaration for this class in its own scope. */
2513 build_self_reference ();
2518 /* Finish the member declaration given by DECL. */
2521 finish_member_declaration (tree decl
)
2523 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2526 if (decl
== void_type_node
)
2527 /* The COMPONENT was a friend, not a member, and so there's
2528 nothing for us to do. */
2531 /* We should see only one DECL at a time. */
2532 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2534 /* Set up access control for DECL. */
2536 = (current_access_specifier
== access_private_node
);
2537 TREE_PROTECTED (decl
)
2538 = (current_access_specifier
== access_protected_node
);
2539 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2541 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2542 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2545 /* Mark the DECL as a member of the current class. */
2546 DECL_CONTEXT (decl
) = current_class_type
;
2548 /* Check for bare parameter packs in the member variable declaration. */
2549 if (TREE_CODE (decl
) == FIELD_DECL
)
2551 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2552 TREE_TYPE (decl
) = error_mark_node
;
2553 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2554 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2559 A C language linkage is ignored for the names of class members
2560 and the member function type of class member functions. */
2561 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2562 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2564 /* Put functions on the TYPE_METHODS list and everything else on the
2565 TYPE_FIELDS list. Note that these are built up in reverse order.
2566 We reverse them (to obtain declaration order) in finish_struct. */
2567 if (TREE_CODE (decl
) == FUNCTION_DECL
2568 || DECL_FUNCTION_TEMPLATE_P (decl
))
2570 /* We also need to add this function to the
2571 CLASSTYPE_METHOD_VEC. */
2572 if (add_method (current_class_type
, decl
, NULL_TREE
))
2574 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2575 TYPE_METHODS (current_class_type
) = decl
;
2577 maybe_add_class_template_decl_list (current_class_type
, decl
,
2581 /* Enter the DECL into the scope of the class. */
2582 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2583 || pushdecl_class_level (decl
))
2585 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2586 go at the beginning. The reason is that lookup_field_1
2587 searches the list in order, and we want a field name to
2588 override a type name so that the "struct stat hack" will
2589 work. In particular:
2591 struct S { enum E { }; int E } s;
2594 is valid. In addition, the FIELD_DECLs must be maintained in
2595 declaration order so that class layout works as expected.
2596 However, we don't need that order until class layout, so we
2597 save a little time by putting FIELD_DECLs on in reverse order
2598 here, and then reversing them in finish_struct_1. (We could
2599 also keep a pointer to the correct insertion points in the
2602 if (TREE_CODE (decl
) == TYPE_DECL
)
2603 TYPE_FIELDS (current_class_type
)
2604 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2607 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2608 TYPE_FIELDS (current_class_type
) = decl
;
2611 maybe_add_class_template_decl_list (current_class_type
, decl
,
2616 note_decl_for_pch (decl
);
2619 /* DECL has been declared while we are building a PCH file. Perform
2620 actions that we might normally undertake lazily, but which can be
2621 performed now so that they do not have to be performed in
2622 translation units which include the PCH file. */
2625 note_decl_for_pch (tree decl
)
2627 gcc_assert (pch_file
);
2629 /* There's a good chance that we'll have to mangle names at some
2630 point, even if only for emission in debugging information. */
2631 if ((TREE_CODE (decl
) == VAR_DECL
2632 || TREE_CODE (decl
) == FUNCTION_DECL
)
2633 && !processing_template_decl
)
2637 /* Finish processing a complete template declaration. The PARMS are
2638 the template parameters. */
2641 finish_template_decl (tree parms
)
2644 end_template_decl ();
2646 end_specialization ();
2649 /* Finish processing a template-id (which names a type) of the form
2650 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2651 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2652 the scope of template-id indicated. */
2655 finish_template_type (tree name
, tree args
, int entering_scope
)
2659 decl
= lookup_template_class (name
, args
,
2660 NULL_TREE
, NULL_TREE
, entering_scope
,
2661 tf_warning_or_error
| tf_user
);
2662 if (decl
!= error_mark_node
)
2663 decl
= TYPE_STUB_DECL (decl
);
2668 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2669 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2670 BASE_CLASS, or NULL_TREE if an error occurred. The
2671 ACCESS_SPECIFIER is one of
2672 access_{default,public,protected_private}_node. For a virtual base
2673 we set TREE_TYPE. */
2676 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2680 if (base
== error_mark_node
)
2682 error ("invalid base-class specification");
2685 else if (! MAYBE_CLASS_TYPE_P (base
))
2687 error ("%qT is not a class type", base
);
2692 if (cp_type_quals (base
) != 0)
2694 error ("base class %qT has cv qualifiers", base
);
2695 base
= TYPE_MAIN_VARIANT (base
);
2697 result
= build_tree_list (access
, base
);
2699 TREE_TYPE (result
) = integer_type_node
;
2705 /* If FNS is a member function, a set of member functions, or a
2706 template-id referring to one or more member functions, return a
2707 BASELINK for FNS, incorporating the current access context.
2708 Otherwise, return FNS unchanged. */
2711 baselink_for_fns (tree fns
)
2716 if (BASELINK_P (fns
)
2717 || error_operand_p (fns
))
2721 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2722 fn
= TREE_OPERAND (fn
, 0);
2723 fn
= get_first_fn (fn
);
2724 if (!DECL_FUNCTION_MEMBER_P (fn
))
2727 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2729 cl
= DECL_CONTEXT (fn
);
2730 cl
= TYPE_BINFO (cl
);
2731 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2734 /* Returns true iff DECL is an automatic variable from a function outside
2738 outer_automatic_var_p (tree decl
)
2740 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2741 && DECL_FUNCTION_SCOPE_P (decl
)
2742 && !TREE_STATIC (decl
)
2743 && DECL_CONTEXT (decl
) != current_function_decl
);
2746 /* Returns true iff DECL is a capture field from a lambda that is not our
2747 immediate context. */
2750 outer_lambda_capture_p (tree decl
)
2752 return (TREE_CODE (decl
) == FIELD_DECL
2753 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2754 && (!current_class_type
2755 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2758 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2759 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2760 if non-NULL, is the type or namespace used to explicitly qualify
2761 ID_EXPRESSION. DECL is the entity to which that name has been
2764 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2765 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2766 be set to true if this expression isn't permitted in a
2767 constant-expression, but it is otherwise not set by this function.
2768 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2769 constant-expression, but a non-constant expression is also
2772 DONE is true if this expression is a complete postfix-expression;
2773 it is false if this expression is followed by '->', '[', '(', etc.
2774 ADDRESS_P is true iff this expression is the operand of '&'.
2775 TEMPLATE_P is true iff the qualified-id was of the form
2776 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2777 appears as a template argument.
2779 If an error occurs, and it is the kind of error that might cause
2780 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2781 is the caller's responsibility to issue the message. *ERROR_MSG
2782 will be a string with static storage duration, so the caller need
2785 Return an expression for the entity, after issuing appropriate
2786 diagnostics. This function is also responsible for transforming a
2787 reference to a non-static member into a COMPONENT_REF that makes
2788 the use of "this" explicit.
2790 Upon return, *IDK will be filled in appropriately. */
2792 finish_id_expression (tree id_expression
,
2796 bool integral_constant_expression_p
,
2797 bool allow_non_integral_constant_expression_p
,
2798 bool *non_integral_constant_expression_p
,
2802 bool template_arg_p
,
2803 const char **error_msg
,
2804 location_t location
)
2806 /* Initialize the output parameters. */
2807 *idk
= CP_ID_KIND_NONE
;
2810 if (id_expression
== error_mark_node
)
2811 return error_mark_node
;
2812 /* If we have a template-id, then no further lookup is
2813 required. If the template-id was for a template-class, we
2814 will sometimes have a TYPE_DECL at this point. */
2815 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2816 || TREE_CODE (decl
) == TYPE_DECL
)
2818 /* Look up the name. */
2821 if (decl
== error_mark_node
)
2823 /* Name lookup failed. */
2826 || (!dependent_type_p (scope
)
2827 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2828 && IDENTIFIER_TYPENAME_P (id_expression
)
2829 && dependent_type_p (TREE_TYPE (id_expression
))))))
2831 /* If the qualifying type is non-dependent (and the name
2832 does not name a conversion operator to a dependent
2833 type), issue an error. */
2834 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2835 return error_mark_node
;
2839 /* It may be resolved via Koenig lookup. */
2840 *idk
= CP_ID_KIND_UNQUALIFIED
;
2841 return id_expression
;
2844 decl
= id_expression
;
2846 /* If DECL is a variable that would be out of scope under
2847 ANSI/ISO rules, but in scope in the ARM, name lookup
2848 will succeed. Issue a diagnostic here. */
2850 decl
= check_for_out_of_scope_variable (decl
);
2852 /* Remember that the name was used in the definition of
2853 the current class so that we can check later to see if
2854 the meaning would have been different after the class
2855 was entirely defined. */
2856 if (!scope
&& decl
!= error_mark_node
2857 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
2858 maybe_note_name_used_in_class (id_expression
, decl
);
2860 /* Disallow uses of local variables from containing functions, except
2861 within lambda-expressions. */
2862 if ((outer_automatic_var_p (decl
)
2863 || outer_lambda_capture_p (decl
))
2864 /* It's not a use (3.2) if we're in an unevaluated context. */
2865 && !cp_unevaluated_operand
)
2867 tree context
= DECL_CONTEXT (decl
);
2868 tree containing_function
= current_function_decl
;
2869 tree lambda_stack
= NULL_TREE
;
2870 tree lambda_expr
= NULL_TREE
;
2871 tree initializer
= decl
;
2873 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2874 support for an approach in which a reference to a local
2875 [constant] automatic variable in a nested class or lambda body
2876 would enter the expression as an rvalue, which would reduce
2877 the complexity of the problem"
2879 FIXME update for final resolution of core issue 696. */
2880 if (decl_constant_var_p (decl
))
2881 return integral_constant_value (decl
);
2883 if (TYPE_P (context
))
2885 /* Implicit capture of an explicit capture. */
2886 context
= lambda_function (context
);
2887 initializer
= thisify_lambda_field (decl
);
2890 /* If we are in a lambda function, we can move out until we hit
2892 2. a non-lambda function, or
2893 3. a non-default capturing lambda function. */
2894 while (context
!= containing_function
2895 && LAMBDA_FUNCTION_P (containing_function
))
2897 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2898 (DECL_CONTEXT (containing_function
));
2900 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2904 lambda_stack
= tree_cons (NULL_TREE
,
2909 = decl_function_context (containing_function
);
2912 if (context
== containing_function
)
2914 decl
= add_default_capture (lambda_stack
,
2915 /*id=*/DECL_NAME (decl
),
2918 else if (lambda_expr
)
2920 error ("%qD is not captured", decl
);
2921 return error_mark_node
;
2925 error (TREE_CODE (decl
) == VAR_DECL
2926 ? "use of %<auto%> variable from containing function"
2927 : "use of parameter from containing function");
2928 error (" %q+#D declared here", decl
);
2929 return error_mark_node
;
2933 /* Also disallow uses of function parameters outside the function
2934 body, except inside an unevaluated context (i.e. decltype). */
2935 if (TREE_CODE (decl
) == PARM_DECL
2936 && DECL_CONTEXT (decl
) == NULL_TREE
2937 && !cp_unevaluated_operand
)
2939 error ("use of parameter %qD outside function body", decl
);
2940 return error_mark_node
;
2944 /* If we didn't find anything, or what we found was a type,
2945 then this wasn't really an id-expression. */
2946 if (TREE_CODE (decl
) == TEMPLATE_DECL
2947 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2949 *error_msg
= "missing template arguments";
2950 return error_mark_node
;
2952 else if (TREE_CODE (decl
) == TYPE_DECL
2953 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2955 *error_msg
= "expected primary-expression";
2956 return error_mark_node
;
2959 /* If the name resolved to a template parameter, there is no
2960 need to look it up again later. */
2961 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2962 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2966 *idk
= CP_ID_KIND_NONE
;
2967 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2968 decl
= TEMPLATE_PARM_DECL (decl
);
2969 r
= convert_from_reference (DECL_INITIAL (decl
));
2971 if (integral_constant_expression_p
2972 && !dependent_type_p (TREE_TYPE (decl
))
2973 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2975 if (!allow_non_integral_constant_expression_p
)
2976 error ("template parameter %qD of type %qT is not allowed in "
2977 "an integral constant expression because it is not of "
2978 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2979 *non_integral_constant_expression_p
= true;
2983 /* Similarly, we resolve enumeration constants to their
2984 underlying values. */
2985 else if (TREE_CODE (decl
) == CONST_DECL
)
2987 *idk
= CP_ID_KIND_NONE
;
2988 if (!processing_template_decl
)
2990 used_types_insert (TREE_TYPE (decl
));
2991 return DECL_INITIAL (decl
);
2999 /* If the declaration was explicitly qualified indicate
3000 that. The semantics of `A::f(3)' are different than
3001 `f(3)' if `f' is virtual. */
3003 ? CP_ID_KIND_QUALIFIED
3004 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3005 ? CP_ID_KIND_TEMPLATE_ID
3006 : CP_ID_KIND_UNQUALIFIED
));
3011 An id-expression is type-dependent if it contains an
3012 identifier that was declared with a dependent type.
3014 The standard is not very specific about an id-expression that
3015 names a set of overloaded functions. What if some of them
3016 have dependent types and some of them do not? Presumably,
3017 such a name should be treated as a dependent name. */
3018 /* Assume the name is not dependent. */
3019 dependent_p
= false;
3020 if (!processing_template_decl
)
3021 /* No names are dependent outside a template. */
3023 /* A template-id where the name of the template was not resolved
3024 is definitely dependent. */
3025 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3026 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3027 == IDENTIFIER_NODE
))
3029 /* For anything except an overloaded function, just check its
3031 else if (!is_overloaded_fn (decl
))
3033 = dependent_type_p (TREE_TYPE (decl
));
3034 /* For a set of overloaded functions, check each of the
3040 if (BASELINK_P (fns
))
3041 fns
= BASELINK_FUNCTIONS (fns
);
3043 /* For a template-id, check to see if the template
3044 arguments are dependent. */
3045 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3047 tree args
= TREE_OPERAND (fns
, 1);
3048 dependent_p
= any_dependent_template_arguments_p (args
);
3049 /* The functions are those referred to by the
3051 fns
= TREE_OPERAND (fns
, 0);
3054 /* If there are no dependent template arguments, go through
3055 the overloaded functions. */
3056 while (fns
&& !dependent_p
)
3058 tree fn
= OVL_CURRENT (fns
);
3060 /* Member functions of dependent classes are
3062 if (TREE_CODE (fn
) == FUNCTION_DECL
3063 && type_dependent_expression_p (fn
))
3065 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3066 && dependent_template_p (fn
))
3069 fns
= OVL_NEXT (fns
);
3073 /* If the name was dependent on a template parameter, we will
3074 resolve the name at instantiation time. */
3077 /* Create a SCOPE_REF for qualified names, if the scope is
3083 if (address_p
&& done
)
3084 decl
= finish_qualified_id_expr (scope
, decl
,
3090 tree type
= NULL_TREE
;
3091 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3092 type
= TREE_TYPE (decl
);
3093 decl
= build_qualified_name (type
,
3099 if (TREE_TYPE (decl
))
3100 decl
= convert_from_reference (decl
);
3103 /* A TEMPLATE_ID already contains all the information we
3105 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3106 return id_expression
;
3107 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3108 /* If we found a variable, then name lookup during the
3109 instantiation will always resolve to the same VAR_DECL
3110 (or an instantiation thereof). */
3111 if (TREE_CODE (decl
) == VAR_DECL
3112 || TREE_CODE (decl
) == PARM_DECL
)
3113 return convert_from_reference (decl
);
3114 /* The same is true for FIELD_DECL, but we also need to
3115 make sure that the syntax is correct. */
3116 else if (TREE_CODE (decl
) == FIELD_DECL
)
3118 /* Since SCOPE is NULL here, this is an unqualified name.
3119 Access checking has been performed during name lookup
3120 already. Turn off checking to avoid duplicate errors. */
3121 push_deferring_access_checks (dk_no_check
);
3122 decl
= finish_non_static_data_member
3124 /*qualifying_scope=*/NULL_TREE
);
3125 pop_deferring_access_checks ();
3128 return id_expression
;
3131 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3133 error ("use of namespace %qD as expression", decl
);
3134 return error_mark_node
;
3136 else if (DECL_CLASS_TEMPLATE_P (decl
))
3138 error ("use of class template %qT as expression", decl
);
3139 return error_mark_node
;
3141 else if (TREE_CODE (decl
) == TREE_LIST
)
3143 /* Ambiguous reference to base members. */
3144 error ("request for member %qD is ambiguous in "
3145 "multiple inheritance lattice", id_expression
);
3146 print_candidates (decl
);
3147 return error_mark_node
;
3150 /* Mark variable-like entities as used. Functions are similarly
3151 marked either below or after overload resolution. */
3152 if (TREE_CODE (decl
) == VAR_DECL
3153 || TREE_CODE (decl
) == PARM_DECL
3154 || TREE_CODE (decl
) == RESULT_DECL
)
3157 /* Only certain kinds of names are allowed in constant
3158 expression. Enumerators and template parameters have already
3159 been handled above. */
3160 if (! error_operand_p (decl
)
3161 && integral_constant_expression_p
3162 && ! decl_constant_var_p (decl
)
3163 && ! builtin_valid_in_constant_expr_p (decl
))
3165 if (!allow_non_integral_constant_expression_p
)
3167 error ("%qD cannot appear in a constant-expression", decl
);
3168 return error_mark_node
;
3170 *non_integral_constant_expression_p
= true;
3175 decl
= (adjust_result_of_qualified_name_lookup
3176 (decl
, scope
, current_class_type
));
3178 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3181 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3182 decl
= finish_qualified_id_expr (scope
,
3190 tree r
= convert_from_reference (decl
);
3192 /* In a template, return a SCOPE_REF for most qualified-ids
3193 so that we can check access at instantiation time. But if
3194 we're looking at a member of the current instantiation, we
3195 know we have access and building up the SCOPE_REF confuses
3196 non-type template argument handling. */
3197 if (processing_template_decl
&& TYPE_P (scope
)
3198 && !currently_open_class (scope
))
3199 r
= build_qualified_name (TREE_TYPE (r
),
3205 else if (TREE_CODE (decl
) == FIELD_DECL
)
3207 /* Since SCOPE is NULL here, this is an unqualified name.
3208 Access checking has been performed during name lookup
3209 already. Turn off checking to avoid duplicate errors. */
3210 push_deferring_access_checks (dk_no_check
);
3211 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3212 /*qualifying_scope=*/NULL_TREE
);
3213 pop_deferring_access_checks ();
3215 else if (is_overloaded_fn (decl
))
3219 first_fn
= get_first_fn (decl
);
3220 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3221 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3223 if (!really_overloaded_fn (decl
))
3224 mark_used (first_fn
);
3227 && TREE_CODE (first_fn
) == FUNCTION_DECL
3228 && DECL_FUNCTION_MEMBER_P (first_fn
)
3229 && !shared_member_p (decl
))
3231 /* A set of member functions. */
3232 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3233 return finish_class_member_access_expr (decl
, id_expression
,
3234 /*template_p=*/false,
3235 tf_warning_or_error
);
3238 decl
= baselink_for_fns (decl
);
3242 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3243 && DECL_CLASS_SCOPE_P (decl
))
3245 tree context
= context_for_name_lookup (decl
);
3246 if (context
!= current_class_type
)
3248 tree path
= currently_open_derived_class (context
);
3249 perform_or_defer_access_check (TYPE_BINFO (path
),
3254 decl
= convert_from_reference (decl
);
3258 if (TREE_DEPRECATED (decl
))
3259 warn_deprecated_use (decl
, NULL_TREE
);
3264 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3265 use as a type-specifier. */
3268 finish_typeof (tree expr
)
3272 if (type_dependent_expression_p (expr
))
3274 type
= cxx_make_type (TYPEOF_TYPE
);
3275 TYPEOF_TYPE_EXPR (type
) = expr
;
3276 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3281 expr
= mark_type_use (expr
);
3283 type
= unlowered_expr_type (expr
);
3285 if (!type
|| type
== unknown_type_node
)
3287 error ("type of %qE is unknown", expr
);
3288 return error_mark_node
;
3294 /* Perform C++-specific checks for __builtin_offsetof before calling
3298 finish_offsetof (tree expr
)
3300 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3302 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3303 TREE_OPERAND (expr
, 2));
3304 return error_mark_node
;
3306 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3307 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3308 || TREE_TYPE (expr
) == unknown_type_node
)
3310 if (TREE_CODE (expr
) == COMPONENT_REF
3311 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3312 expr
= TREE_OPERAND (expr
, 1);
3313 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3314 return error_mark_node
;
3316 if (TREE_CODE (expr
) == INDIRECT_REF
&& REFERENCE_REF_P (expr
))
3317 expr
= TREE_OPERAND (expr
, 0);
3318 return fold_offsetof (expr
, NULL_TREE
);
3321 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3322 function is broken out from the above for the benefit of the tree-ssa
3326 simplify_aggr_init_expr (tree
*tp
)
3328 tree aggr_init_expr
= *tp
;
3330 /* Form an appropriate CALL_EXPR. */
3331 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3332 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3333 tree type
= TREE_TYPE (slot
);
3336 enum style_t
{ ctor
, arg
, pcc
} style
;
3338 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3340 #ifdef PCC_STATIC_STRUCT_RETURN
3346 gcc_assert (TREE_ADDRESSABLE (type
));
3350 call_expr
= build_call_array_loc (input_location
,
3351 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3353 aggr_init_expr_nargs (aggr_init_expr
),
3354 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3355 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3359 /* Replace the first argument to the ctor with the address of the
3361 cxx_mark_addressable (slot
);
3362 CALL_EXPR_ARG (call_expr
, 0) =
3363 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3365 else if (style
== arg
)
3367 /* Just mark it addressable here, and leave the rest to
3368 expand_call{,_inline}. */
3369 cxx_mark_addressable (slot
);
3370 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3371 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3373 else if (style
== pcc
)
3375 /* If we're using the non-reentrant PCC calling convention, then we
3376 need to copy the returned value out of the static buffer into the
3378 push_deferring_access_checks (dk_no_check
);
3379 call_expr
= build_aggr_init (slot
, call_expr
,
3380 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3381 tf_warning_or_error
);
3382 pop_deferring_access_checks ();
3383 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3386 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3388 tree init
= build_zero_init (type
, NULL_TREE
,
3389 /*static_storage_p=*/false);
3390 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3391 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3398 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3401 emit_associated_thunks (tree fn
)
3403 /* When we use vcall offsets, we emit thunks with the virtual
3404 functions to which they thunk. The whole point of vcall offsets
3405 is so that you can know statically the entire set of thunks that
3406 will ever be needed for a given virtual function, thereby
3407 enabling you to output all the thunks with the function itself. */
3408 if (DECL_VIRTUAL_P (fn
)
3409 /* Do not emit thunks for extern template instantiations. */
3410 && ! DECL_REALLY_EXTERN (fn
))
3414 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3416 if (!THUNK_ALIAS (thunk
))
3418 use_thunk (thunk
, /*emit_p=*/1);
3419 if (DECL_RESULT_THUNK_P (thunk
))
3423 for (probe
= DECL_THUNKS (thunk
);
3424 probe
; probe
= DECL_CHAIN (probe
))
3425 use_thunk (probe
, /*emit_p=*/1);
3429 gcc_assert (!DECL_THUNKS (thunk
));
3434 /* Generate RTL for FN. */
3437 expand_or_defer_fn_1 (tree fn
)
3439 /* When the parser calls us after finishing the body of a template
3440 function, we don't really want to expand the body. */
3441 if (processing_template_decl
)
3443 /* Normally, collection only occurs in rest_of_compilation. So,
3444 if we don't collect here, we never collect junk generated
3445 during the processing of templates until we hit a
3446 non-template function. It's not safe to do this inside a
3447 nested class, though, as the parser may have local state that
3448 is not a GC root. */
3449 if (!function_depth
)
3454 gcc_assert (DECL_SAVED_TREE (fn
));
3456 /* If this is a constructor or destructor body, we have to clone
3458 if (maybe_clone_body (fn
))
3460 /* We don't want to process FN again, so pretend we've written
3461 it out, even though we haven't. */
3462 TREE_ASM_WRITTEN (fn
) = 1;
3463 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3467 /* We make a decision about linkage for these functions at the end
3468 of the compilation. Until that point, we do not want the back
3469 end to output them -- but we do want it to see the bodies of
3470 these functions so that it can inline them as appropriate. */
3471 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3473 if (DECL_INTERFACE_KNOWN (fn
))
3474 /* We've already made a decision as to how this function will
3478 DECL_EXTERNAL (fn
) = 1;
3479 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3480 note_vague_linkage_fn (fn
);
3481 /* A non-template inline function with external linkage will
3482 always be COMDAT. As we must eventually determine the
3483 linkage of all functions, and as that causes writes to
3484 the data mapped in from the PCH file, it's advantageous
3485 to mark the functions at this point. */
3486 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3488 /* This function must have external linkage, as
3489 otherwise DECL_INTERFACE_KNOWN would have been
3491 gcc_assert (TREE_PUBLIC (fn
));
3492 comdat_linkage (fn
);
3493 DECL_INTERFACE_KNOWN (fn
) = 1;
3497 import_export_decl (fn
);
3499 /* If the user wants us to keep all inline functions, then mark
3500 this function as needed so that finish_file will make sure to
3501 output it later. Similarly, all dllexport'd functions must
3502 be emitted; there may be callers in other DLLs. */
3503 if ((flag_keep_inline_functions
3504 && DECL_DECLARED_INLINE_P (fn
)
3505 && !DECL_REALLY_EXTERN (fn
))
3506 || (flag_keep_inline_dllexport
3507 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3511 /* There's no reason to do any of the work here if we're only doing
3512 semantic analysis; this code just generates RTL. */
3513 if (flag_syntax_only
)
3520 expand_or_defer_fn (tree fn
)
3522 if (expand_or_defer_fn_1 (fn
))
3526 /* Expand or defer, at the whim of the compilation unit manager. */
3527 cgraph_finalize_function (fn
, function_depth
> 1);
3528 emit_associated_thunks (fn
);
3541 /* Helper function for walk_tree, used by finalize_nrv below. */
3544 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3546 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3549 /* No need to walk into types. There wouldn't be any need to walk into
3550 non-statements, except that we have to consider STMT_EXPRs. */
3553 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3554 but differs from using NULL_TREE in that it indicates that we care
3555 about the value of the RESULT_DECL. */
3556 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3557 TREE_OPERAND (*tp
, 0) = dp
->result
;
3558 /* Change all cleanups for the NRV to only run when an exception is
3560 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3561 && CLEANUP_DECL (*tp
) == dp
->var
)
3562 CLEANUP_EH_ONLY (*tp
) = 1;
3563 /* Replace the DECL_EXPR for the NRV with an initialization of the
3564 RESULT_DECL, if needed. */
3565 else if (TREE_CODE (*tp
) == DECL_EXPR
3566 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3569 if (DECL_INITIAL (dp
->var
)
3570 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3571 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3572 DECL_INITIAL (dp
->var
));
3574 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3575 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3576 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3579 /* And replace all uses of the NRV with the RESULT_DECL. */
3580 else if (*tp
== dp
->var
)
3583 /* Avoid walking into the same tree more than once. Unfortunately, we
3584 can't just use walk_tree_without duplicates because it would only call
3585 us for the first occurrence of dp->var in the function body. */
3586 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3592 /* Keep iterating. */
3596 /* Called from finish_function to implement the named return value
3597 optimization by overriding all the RETURN_EXPRs and pertinent
3598 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3599 RESULT_DECL for the function. */
3602 finalize_nrv (tree
*tp
, tree var
, tree result
)
3604 struct nrv_data data
;
3606 /* Copy name from VAR to RESULT. */
3607 DECL_NAME (result
) = DECL_NAME (var
);
3608 /* Don't forget that we take its address. */
3609 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3610 /* Finally set DECL_VALUE_EXPR to avoid assigning
3611 a stack slot at -O0 for the original var and debug info
3612 uses RESULT location for VAR. */
3613 SET_DECL_VALUE_EXPR (var
, result
);
3614 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3617 data
.result
= result
;
3618 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3619 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3620 htab_delete (data
.visited
);
3623 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3626 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3627 bool need_copy_ctor
, bool need_copy_assignment
)
3629 int save_errorcount
= errorcount
;
3632 /* Always allocate 3 elements for simplicity. These are the
3633 function decls for the ctor, dtor, and assignment op.
3634 This layout is known to the three lang hooks,
3635 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3636 and cxx_omp_clause_assign_op. */
3637 info
= make_tree_vec (3);
3638 CP_OMP_CLAUSE_INFO (c
) = info
;
3640 if (need_default_ctor
|| need_copy_ctor
)
3642 if (need_default_ctor
)
3643 t
= get_default_ctor (type
);
3645 t
= get_copy_ctor (type
);
3647 if (t
&& !trivial_fn_p (t
))
3648 TREE_VEC_ELT (info
, 0) = t
;
3651 if ((need_default_ctor
|| need_copy_ctor
)
3652 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3653 TREE_VEC_ELT (info
, 1) = get_dtor (type
);
3655 if (need_copy_assignment
)
3657 t
= get_copy_assign (type
);
3659 if (t
&& !trivial_fn_p (t
))
3660 TREE_VEC_ELT (info
, 2) = t
;
3663 return errorcount
!= save_errorcount
;
3666 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3667 Remove any elements from the list that are invalid. */
3670 finish_omp_clauses (tree clauses
)
3672 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3673 tree c
, t
, *pc
= &clauses
;
3676 bitmap_obstack_initialize (NULL
);
3677 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3678 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3679 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3681 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3683 bool remove
= false;
3685 switch (OMP_CLAUSE_CODE (c
))
3687 case OMP_CLAUSE_SHARED
:
3689 goto check_dup_generic
;
3690 case OMP_CLAUSE_PRIVATE
:
3692 goto check_dup_generic
;
3693 case OMP_CLAUSE_REDUCTION
:
3695 goto check_dup_generic
;
3696 case OMP_CLAUSE_COPYPRIVATE
:
3697 name
= "copyprivate";
3698 goto check_dup_generic
;
3699 case OMP_CLAUSE_COPYIN
:
3701 goto check_dup_generic
;
3703 t
= OMP_CLAUSE_DECL (c
);
3704 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3706 if (processing_template_decl
)
3709 error ("%qD is not a variable in clause %qs", t
, name
);
3711 error ("%qE is not a variable in clause %qs", t
, name
);
3714 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3715 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3716 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3718 error ("%qD appears more than once in data clauses", t
);
3722 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3725 case OMP_CLAUSE_FIRSTPRIVATE
:
3726 t
= OMP_CLAUSE_DECL (c
);
3727 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3729 if (processing_template_decl
)
3732 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3734 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3737 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3738 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3740 error ("%qD appears more than once in data clauses", t
);
3744 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3747 case OMP_CLAUSE_LASTPRIVATE
:
3748 t
= OMP_CLAUSE_DECL (c
);
3749 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3751 if (processing_template_decl
)
3754 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3756 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3759 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3760 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3762 error ("%qD appears more than once in data clauses", t
);
3766 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3770 t
= OMP_CLAUSE_IF_EXPR (c
);
3771 t
= maybe_convert_cond (t
);
3772 if (t
== error_mark_node
)
3774 OMP_CLAUSE_IF_EXPR (c
) = t
;
3777 case OMP_CLAUSE_NUM_THREADS
:
3778 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3779 if (t
== error_mark_node
)
3781 else if (!type_dependent_expression_p (t
)
3782 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3784 error ("num_threads expression must be integral");
3789 case OMP_CLAUSE_SCHEDULE
:
3790 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3793 else if (t
== error_mark_node
)
3795 else if (!type_dependent_expression_p (t
)
3796 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3798 error ("schedule chunk size expression must be integral");
3803 case OMP_CLAUSE_NOWAIT
:
3804 case OMP_CLAUSE_ORDERED
:
3805 case OMP_CLAUSE_DEFAULT
:
3806 case OMP_CLAUSE_UNTIED
:
3807 case OMP_CLAUSE_COLLAPSE
:
3815 *pc
= OMP_CLAUSE_CHAIN (c
);
3817 pc
= &OMP_CLAUSE_CHAIN (c
);
3820 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3822 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3823 bool remove
= false;
3824 bool need_complete_non_reference
= false;
3825 bool need_default_ctor
= false;
3826 bool need_copy_ctor
= false;
3827 bool need_copy_assignment
= false;
3828 bool need_implicitly_determined
= false;
3829 tree type
, inner_type
;
3833 case OMP_CLAUSE_SHARED
:
3835 need_implicitly_determined
= true;
3837 case OMP_CLAUSE_PRIVATE
:
3839 need_complete_non_reference
= true;
3840 need_default_ctor
= true;
3841 need_implicitly_determined
= true;
3843 case OMP_CLAUSE_FIRSTPRIVATE
:
3844 name
= "firstprivate";
3845 need_complete_non_reference
= true;
3846 need_copy_ctor
= true;
3847 need_implicitly_determined
= true;
3849 case OMP_CLAUSE_LASTPRIVATE
:
3850 name
= "lastprivate";
3851 need_complete_non_reference
= true;
3852 need_copy_assignment
= true;
3853 need_implicitly_determined
= true;
3855 case OMP_CLAUSE_REDUCTION
:
3857 need_implicitly_determined
= true;
3859 case OMP_CLAUSE_COPYPRIVATE
:
3860 name
= "copyprivate";
3861 need_copy_assignment
= true;
3863 case OMP_CLAUSE_COPYIN
:
3865 need_copy_assignment
= true;
3868 pc
= &OMP_CLAUSE_CHAIN (c
);
3872 t
= OMP_CLAUSE_DECL (c
);
3873 if (processing_template_decl
3874 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3876 pc
= &OMP_CLAUSE_CHAIN (c
);
3882 case OMP_CLAUSE_LASTPRIVATE
:
3883 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3884 need_default_ctor
= true;
3887 case OMP_CLAUSE_REDUCTION
:
3888 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3889 || POINTER_TYPE_P (TREE_TYPE (t
)))
3891 error ("%qE has invalid type for %<reduction%>", t
);
3894 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3896 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3904 error ("%qE has invalid type for %<reduction(%s)%>",
3905 t
, operator_name_info
[r_code
].name
);
3911 case OMP_CLAUSE_COPYIN
:
3912 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3914 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3923 if (need_complete_non_reference
)
3925 t
= require_complete_type (t
);
3926 if (t
== error_mark_node
)
3928 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3930 error ("%qE has reference type for %qs", t
, name
);
3934 if (need_implicitly_determined
)
3936 const char *share_name
= NULL
;
3938 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3939 share_name
= "threadprivate";
3940 else switch (cxx_omp_predetermined_sharing (t
))
3942 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3944 case OMP_CLAUSE_DEFAULT_SHARED
:
3945 share_name
= "shared";
3947 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3948 share_name
= "private";
3955 error ("%qE is predetermined %qs for %qs",
3956 t
, share_name
, name
);
3961 /* We're interested in the base element, not arrays. */
3962 inner_type
= type
= TREE_TYPE (t
);
3963 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3964 inner_type
= TREE_TYPE (inner_type
);
3966 /* Check for special function availability by building a call to one.
3967 Save the results, because later we won't be in the right context
3968 for making these queries. */
3969 if (CLASS_TYPE_P (inner_type
)
3970 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
3971 && !type_dependent_expression_p (t
)
3972 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
3973 need_copy_ctor
, need_copy_assignment
))
3977 *pc
= OMP_CLAUSE_CHAIN (c
);
3979 pc
= &OMP_CLAUSE_CHAIN (c
);
3982 bitmap_obstack_release (NULL
);
3986 /* For all variables in the tree_list VARS, mark them as thread local. */
3989 finish_omp_threadprivate (tree vars
)
3993 /* Mark every variable in VARS to be assigned thread local storage. */
3994 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
3996 tree v
= TREE_PURPOSE (t
);
3998 if (error_operand_p (v
))
4000 else if (TREE_CODE (v
) != VAR_DECL
)
4001 error ("%<threadprivate%> %qD is not file, namespace "
4002 "or block scope variable", v
);
4003 /* If V had already been marked threadprivate, it doesn't matter
4004 whether it had been used prior to this point. */
4005 else if (TREE_USED (v
)
4006 && (DECL_LANG_SPECIFIC (v
) == NULL
4007 || !CP_DECL_THREADPRIVATE_P (v
)))
4008 error ("%qE declared %<threadprivate%> after first use", v
);
4009 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4010 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4011 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4012 error ("%<threadprivate%> %qE has incomplete type", v
);
4013 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4014 && CP_DECL_CONTEXT (v
) != current_class_type
)
4015 error ("%<threadprivate%> %qE directive not "
4016 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4019 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4020 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4022 retrofit_lang_decl (v
);
4024 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4025 after the allocation of the lang_decl structure. */
4026 if (DECL_DISCRIMINATOR_P (v
))
4027 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4030 if (! DECL_THREAD_LOCAL_P (v
))
4032 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4033 /* If rtl has been already set for this var, call
4034 make_decl_rtl once again, so that encode_section_info
4035 has a chance to look at the new decl flags. */
4036 if (DECL_RTL_SET_P (v
))
4039 CP_DECL_THREADPRIVATE_P (v
) = 1;
4044 /* Build an OpenMP structured block. */
4047 begin_omp_structured_block (void)
4049 return do_pushlevel (sk_omp
);
4053 finish_omp_structured_block (tree block
)
4055 return do_poplevel (block
);
4058 /* Similarly, except force the retention of the BLOCK. */
4061 begin_omp_parallel (void)
4063 keep_next_level (true);
4064 return begin_omp_structured_block ();
4068 finish_omp_parallel (tree clauses
, tree body
)
4072 body
= finish_omp_structured_block (body
);
4074 stmt
= make_node (OMP_PARALLEL
);
4075 TREE_TYPE (stmt
) = void_type_node
;
4076 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4077 OMP_PARALLEL_BODY (stmt
) = body
;
4079 return add_stmt (stmt
);
4083 begin_omp_task (void)
4085 keep_next_level (true);
4086 return begin_omp_structured_block ();
4090 finish_omp_task (tree clauses
, tree body
)
4094 body
= finish_omp_structured_block (body
);
4096 stmt
= make_node (OMP_TASK
);
4097 TREE_TYPE (stmt
) = void_type_node
;
4098 OMP_TASK_CLAUSES (stmt
) = clauses
;
4099 OMP_TASK_BODY (stmt
) = body
;
4101 return add_stmt (stmt
);
4104 /* Helper function for finish_omp_for. Convert Ith random access iterator
4105 into integral iterator. Return FALSE if successful. */
4108 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4109 tree condv
, tree incrv
, tree
*body
,
4110 tree
*pre_body
, tree clauses
)
4112 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4113 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4114 tree decl
= TREE_VEC_ELT (declv
, i
);
4115 tree init
= TREE_VEC_ELT (initv
, i
);
4116 tree cond
= TREE_VEC_ELT (condv
, i
);
4117 tree incr
= TREE_VEC_ELT (incrv
, i
);
4119 location_t elocus
= locus
;
4121 if (init
&& EXPR_HAS_LOCATION (init
))
4122 elocus
= EXPR_LOCATION (init
);
4124 switch (TREE_CODE (cond
))
4130 if (TREE_OPERAND (cond
, 1) == iter
)
4131 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4132 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4133 if (TREE_OPERAND (cond
, 0) != iter
)
4134 cond
= error_mark_node
;
4137 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4138 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4139 NULL
, tf_warning_or_error
);
4140 if (error_operand_p (tem
))
4145 cond
= error_mark_node
;
4148 if (cond
== error_mark_node
)
4150 error_at (elocus
, "invalid controlling predicate");
4153 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4154 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4155 tf_warning_or_error
);
4156 if (error_operand_p (diff
))
4158 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4160 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4161 TREE_OPERAND (cond
, 1), iter
);
4165 switch (TREE_CODE (incr
))
4167 case PREINCREMENT_EXPR
:
4168 case PREDECREMENT_EXPR
:
4169 case POSTINCREMENT_EXPR
:
4170 case POSTDECREMENT_EXPR
:
4171 if (TREE_OPERAND (incr
, 0) != iter
)
4173 incr
= error_mark_node
;
4176 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4177 tf_warning_or_error
);
4178 if (error_operand_p (iter_incr
))
4180 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4181 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4182 incr
= integer_one_node
;
4184 incr
= integer_minus_one_node
;
4187 if (TREE_OPERAND (incr
, 0) != iter
)
4188 incr
= error_mark_node
;
4189 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4190 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4192 tree rhs
= TREE_OPERAND (incr
, 1);
4193 if (TREE_OPERAND (rhs
, 0) == iter
)
4195 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4197 incr
= error_mark_node
;
4200 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4201 TREE_OPERAND (rhs
, 1),
4202 tf_warning_or_error
);
4203 if (error_operand_p (iter_incr
))
4205 incr
= TREE_OPERAND (rhs
, 1);
4206 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4207 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4209 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4210 incr
= fold_if_not_in_template (incr
);
4212 if (TREE_CODE (incr
) != INTEGER_CST
4213 && (TREE_CODE (incr
) != NOP_EXPR
4214 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4219 else if (TREE_OPERAND (rhs
, 1) == iter
)
4221 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4222 || TREE_CODE (rhs
) != PLUS_EXPR
)
4223 incr
= error_mark_node
;
4226 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4227 TREE_OPERAND (rhs
, 0),
4230 tf_warning_or_error
);
4231 if (error_operand_p (iter_incr
))
4233 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4235 tf_warning_or_error
);
4236 if (error_operand_p (iter_incr
))
4238 incr
= TREE_OPERAND (rhs
, 0);
4243 incr
= error_mark_node
;
4246 incr
= error_mark_node
;
4249 incr
= error_mark_node
;
4253 if (incr
== error_mark_node
)
4255 error_at (elocus
, "invalid increment expression");
4259 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4260 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4261 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4262 && OMP_CLAUSE_DECL (c
) == iter
)
4265 decl
= create_temporary_var (TREE_TYPE (diff
));
4267 add_decl_expr (decl
);
4268 last
= create_temporary_var (TREE_TYPE (diff
));
4270 add_decl_expr (last
);
4271 if (c
&& iter_incr
== NULL
)
4273 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4274 pushdecl (incr_var
);
4275 add_decl_expr (incr_var
);
4277 gcc_assert (stmts_are_full_exprs_p ());
4279 orig_pre_body
= *pre_body
;
4280 *pre_body
= push_stmt_list ();
4282 add_stmt (orig_pre_body
);
4284 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4285 tf_warning_or_error
));
4286 init
= build_int_cst (TREE_TYPE (diff
), 0);
4287 if (c
&& iter_incr
== NULL
)
4289 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4290 incr
, tf_warning_or_error
));
4292 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4293 tf_warning_or_error
);
4295 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4296 tf_warning_or_error
));
4297 *pre_body
= pop_stmt_list (*pre_body
);
4299 cond
= cp_build_binary_op (elocus
,
4300 TREE_CODE (cond
), decl
, diff
,
4301 tf_warning_or_error
);
4302 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4303 elocus
, incr
, NULL_TREE
);
4306 *body
= push_stmt_list ();
4307 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4308 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4309 tf_warning_or_error
);
4310 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4311 finish_expr_stmt (iter_init
);
4312 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4313 tf_warning_or_error
));
4314 add_stmt (orig_body
);
4315 *body
= pop_stmt_list (*body
);
4319 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4320 finish_expr_stmt (iter_incr
);
4321 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4322 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4325 TREE_VEC_ELT (declv
, i
) = decl
;
4326 TREE_VEC_ELT (initv
, i
) = init
;
4327 TREE_VEC_ELT (condv
, i
) = cond
;
4328 TREE_VEC_ELT (incrv
, i
) = incr
;
4333 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4334 are directly for their associated operands in the statement. DECL
4335 and INIT are a combo; if DECL is NULL then INIT ought to be a
4336 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4337 optional statements that need to go before the loop into its
4341 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4342 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4344 tree omp_for
= NULL
, orig_incr
= NULL
;
4345 tree decl
, init
, cond
, incr
;
4349 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4350 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4351 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4352 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4354 decl
= TREE_VEC_ELT (declv
, i
);
4355 init
= TREE_VEC_ELT (initv
, i
);
4356 cond
= TREE_VEC_ELT (condv
, i
);
4357 incr
= TREE_VEC_ELT (incrv
, i
);
4363 switch (TREE_CODE (init
))
4366 decl
= TREE_OPERAND (init
, 0);
4367 init
= TREE_OPERAND (init
, 1);
4370 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4372 decl
= TREE_OPERAND (init
, 0);
4373 init
= TREE_OPERAND (init
, 2);
4383 "expected iteration declaration or initialization");
4388 if (init
&& EXPR_HAS_LOCATION (init
))
4389 elocus
= EXPR_LOCATION (init
);
4393 error_at (elocus
, "missing controlling predicate");
4399 error_at (elocus
, "missing increment expression");
4403 TREE_VEC_ELT (declv
, i
) = decl
;
4404 TREE_VEC_ELT (initv
, i
) = init
;
4407 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4411 stmt
= make_node (OMP_FOR
);
4413 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4415 /* This is really just a place-holder. We'll be decomposing this
4416 again and going through the cp_build_modify_expr path below when
4417 we instantiate the thing. */
4418 TREE_VEC_ELT (initv
, i
)
4419 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4420 TREE_VEC_ELT (initv
, i
));
4423 TREE_TYPE (stmt
) = void_type_node
;
4424 OMP_FOR_INIT (stmt
) = initv
;
4425 OMP_FOR_COND (stmt
) = condv
;
4426 OMP_FOR_INCR (stmt
) = incrv
;
4427 OMP_FOR_BODY (stmt
) = body
;
4428 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4429 OMP_FOR_CLAUSES (stmt
) = clauses
;
4431 SET_EXPR_LOCATION (stmt
, locus
);
4432 return add_stmt (stmt
);
4435 if (processing_template_decl
)
4436 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4438 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4440 decl
= TREE_VEC_ELT (declv
, i
);
4441 init
= TREE_VEC_ELT (initv
, i
);
4442 cond
= TREE_VEC_ELT (condv
, i
);
4443 incr
= TREE_VEC_ELT (incrv
, i
);
4445 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4448 if (init
&& EXPR_HAS_LOCATION (init
))
4449 elocus
= EXPR_LOCATION (init
);
4453 error_at (elocus
, "expected iteration declaration or initialization");
4457 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4460 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4461 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4462 TREE_CODE (TREE_OPERAND (incr
, 1)),
4463 TREE_OPERAND (incr
, 2),
4464 tf_warning_or_error
);
4467 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4469 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4470 incrv
, &body
, &pre_body
, clauses
))
4475 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4476 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4478 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4482 if (!processing_template_decl
)
4484 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4485 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4488 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4490 && TREE_SIDE_EFFECTS (cond
)
4491 && COMPARISON_CLASS_P (cond
)
4492 && !processing_template_decl
)
4494 tree t
= TREE_OPERAND (cond
, 0);
4495 if (TREE_SIDE_EFFECTS (t
)
4497 && (TREE_CODE (t
) != NOP_EXPR
4498 || TREE_OPERAND (t
, 0) != decl
))
4499 TREE_OPERAND (cond
, 0)
4500 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4502 t
= TREE_OPERAND (cond
, 1);
4503 if (TREE_SIDE_EFFECTS (t
)
4505 && (TREE_CODE (t
) != NOP_EXPR
4506 || TREE_OPERAND (t
, 0) != decl
))
4507 TREE_OPERAND (cond
, 1)
4508 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4510 if (decl
== error_mark_node
|| init
== error_mark_node
)
4513 TREE_VEC_ELT (declv
, i
) = decl
;
4514 TREE_VEC_ELT (initv
, i
) = init
;
4515 TREE_VEC_ELT (condv
, i
) = cond
;
4516 TREE_VEC_ELT (incrv
, i
) = incr
;
4520 if (IS_EMPTY_STMT (pre_body
))
4523 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4526 if (omp_for
== NULL
)
4529 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4531 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4532 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4534 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4537 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4538 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4539 && !processing_template_decl
)
4541 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4542 if (TREE_SIDE_EFFECTS (t
)
4544 && (TREE_CODE (t
) != NOP_EXPR
4545 || TREE_OPERAND (t
, 0) != decl
))
4546 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4547 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4549 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4550 if (TREE_SIDE_EFFECTS (t
)
4552 && (TREE_CODE (t
) != NOP_EXPR
4553 || TREE_OPERAND (t
, 0) != decl
))
4554 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4555 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4559 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4561 if (omp_for
!= NULL
)
4562 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4567 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4576 dependent_p
= false;
4579 /* Even in a template, we can detect invalid uses of the atomic
4580 pragma if neither LHS nor RHS is type-dependent. */
4581 if (processing_template_decl
)
4583 dependent_p
= (type_dependent_expression_p (lhs
)
4584 || type_dependent_expression_p (rhs
));
4587 lhs
= build_non_dependent_expr (lhs
);
4588 rhs
= build_non_dependent_expr (rhs
);
4593 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4594 if (stmt
== error_mark_node
)
4597 if (processing_template_decl
)
4598 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4599 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4604 finish_omp_barrier (void)
4606 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4607 VEC(tree
,gc
) *vec
= make_tree_vector ();
4608 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4609 release_tree_vector (vec
);
4610 finish_expr_stmt (stmt
);
4614 finish_omp_flush (void)
4616 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4617 VEC(tree
,gc
) *vec
= make_tree_vector ();
4618 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4619 release_tree_vector (vec
);
4620 finish_expr_stmt (stmt
);
4624 finish_omp_taskwait (void)
4626 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4627 VEC(tree
,gc
) *vec
= make_tree_vector ();
4628 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4629 release_tree_vector (vec
);
4630 finish_expr_stmt (stmt
);
4634 init_cp_semantics (void)
4638 /* Build a STATIC_ASSERT for a static assertion with the condition
4639 CONDITION and the message text MESSAGE. LOCATION is the location
4640 of the static assertion in the source code. When MEMBER_P, this
4641 static assertion is a member of a class. */
4643 finish_static_assert (tree condition
, tree message
, location_t location
,
4646 if (check_for_bare_parameter_packs (condition
))
4647 condition
= error_mark_node
;
4649 if (type_dependent_expression_p (condition
)
4650 || value_dependent_expression_p (condition
))
4652 /* We're in a template; build a STATIC_ASSERT and put it in
4656 assertion
= make_node (STATIC_ASSERT
);
4657 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4658 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4659 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4662 maybe_add_class_template_decl_list (current_class_type
,
4666 add_stmt (assertion
);
4671 /* Fold the expression and convert it to a boolean value. */
4672 condition
= fold_non_dependent_expr (condition
);
4673 condition
= cp_convert (boolean_type_node
, condition
);
4674 condition
= maybe_constant_value (condition
);
4676 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4677 /* Do nothing; the condition is satisfied. */
4681 location_t saved_loc
= input_location
;
4683 input_location
= location
;
4684 if (TREE_CODE (condition
) == INTEGER_CST
4685 && integer_zerop (condition
))
4686 /* Report the error. */
4687 error ("static assertion failed: %E", message
);
4688 else if (condition
&& condition
!= error_mark_node
)
4690 error ("non-constant condition for static assertion");
4691 cxx_constant_value (condition
);
4693 input_location
= saved_loc
;
4697 /* Returns the type of EXPR for cases where we can determine it even though
4698 EXPR is a type-dependent expression. */
4701 describable_type (tree expr
)
4703 tree type
= NULL_TREE
;
4705 if (! type_dependent_expression_p (expr
)
4706 && ! type_unknown_p (expr
))
4708 type
= unlowered_expr_type (expr
);
4709 if (real_lvalue_p (expr
))
4710 type
= build_reference_type (type
);
4716 switch (TREE_CODE (expr
))
4722 return TREE_TYPE (expr
);
4727 case TEMPLATE_PARM_INDEX
:
4729 case STATIC_CAST_EXPR
:
4730 case REINTERPRET_CAST_EXPR
:
4731 case CONST_CAST_EXPR
:
4732 case DYNAMIC_CAST_EXPR
:
4733 type
= TREE_TYPE (expr
);
4738 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4739 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4740 type
= build_reference_type (TREE_TYPE (ptrtype
));
4745 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4746 type
= TREE_TYPE (expr
);
4750 if (type
&& type_uses_auto (type
))
4756 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4757 suitable for use as a type-specifier.
4759 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4760 id-expression or a class member access, FALSE when it was parsed as
4761 a full expression. */
4764 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
)
4766 tree orig_expr
= expr
;
4767 tree type
= NULL_TREE
;
4769 if (!expr
|| error_operand_p (expr
))
4770 return error_mark_node
;
4773 || TREE_CODE (expr
) == TYPE_DECL
4774 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4775 && TYPE_P (TREE_OPERAND (expr
, 0))))
4777 error ("argument to decltype must be an expression");
4778 return error_mark_node
;
4781 /* FIXME instantiation-dependent */
4782 if (type_dependent_expression_p (expr
)
4783 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4784 if it isn't dependent, so that we can check access control at
4785 instantiation time, so defer the decltype as well (PR 42277). */
4786 || (id_expression_or_member_access_p
4787 && processing_template_decl
4788 && TREE_CODE (expr
) == COMPONENT_REF
))
4791 type
= cxx_make_type (DECLTYPE_TYPE
);
4792 DECLTYPE_TYPE_EXPR (type
) = expr
;
4793 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4794 = id_expression_or_member_access_p
;
4795 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4800 /* The type denoted by decltype(e) is defined as follows: */
4802 expr
= resolve_nondeduced_context (expr
);
4804 /* To get the size of a static data member declared as an array of
4805 unknown bound, we need to instantiate it. */
4806 if (TREE_CODE (expr
) == VAR_DECL
4807 && VAR_HAD_UNKNOWN_BOUND (expr
)
4808 && DECL_TEMPLATE_INSTANTIATION (expr
))
4809 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4811 if (id_expression_or_member_access_p
)
4813 /* If e is an id-expression or a class member access (5.2.5
4814 [expr.ref]), decltype(e) is defined as the type of the entity
4815 named by e. If there is no such entity, or e names a set of
4816 overloaded functions, the program is ill-formed. */
4817 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4818 expr
= lookup_name (expr
);
4820 if (TREE_CODE (expr
) == INDIRECT_REF
)
4821 /* This can happen when the expression is, e.g., "a.b". Just
4822 look at the underlying operand. */
4823 expr
= TREE_OPERAND (expr
, 0);
4825 if (TREE_CODE (expr
) == OFFSET_REF
4826 || TREE_CODE (expr
) == MEMBER_REF
)
4827 /* We're only interested in the field itself. If it is a
4828 BASELINK, we will need to see through it in the next
4830 expr
= TREE_OPERAND (expr
, 1);
4832 if (TREE_CODE (expr
) == BASELINK
)
4833 /* See through BASELINK nodes to the underlying functions. */
4834 expr
= BASELINK_FUNCTIONS (expr
);
4836 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
4837 expr
= TREE_OPERAND (expr
, 0);
4839 if (TREE_CODE (expr
) == OVERLOAD
)
4841 if (OVL_CHAIN (expr
)
4842 || TREE_CODE (OVL_FUNCTION (expr
)) == TEMPLATE_DECL
)
4844 error ("%qE refers to a set of overloaded functions", orig_expr
);
4845 return error_mark_node
;
4848 /* An overload set containing only one function: just look
4849 at that function. */
4850 expr
= OVL_FUNCTION (expr
);
4853 switch (TREE_CODE (expr
))
4856 if (DECL_BIT_FIELD_TYPE (expr
))
4858 type
= DECL_BIT_FIELD_TYPE (expr
);
4861 /* Fall through for fields that aren't bitfields. */
4868 case TEMPLATE_PARM_INDEX
:
4869 expr
= mark_type_use (expr
);
4870 type
= TREE_TYPE (expr
);
4874 type
= error_mark_node
;
4878 mark_type_use (expr
);
4879 type
= is_bitfield_expr_with_lowered_type (expr
);
4881 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4888 /* We can get here when the id-expression refers to an
4890 type
= TREE_TYPE (expr
);
4894 gcc_assert (TYPE_P (expr
) || DECL_P (expr
)
4895 || TREE_CODE (expr
) == SCOPE_REF
);
4896 error ("argument to decltype must be an expression");
4897 return error_mark_node
;
4902 /* Expressions of reference type are sometimes wrapped in
4903 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4904 representation, not part of the language, so we have to look
4906 if (TREE_CODE (expr
) == INDIRECT_REF
4907 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))
4909 expr
= TREE_OPERAND (expr
, 0);
4911 if (TREE_CODE (expr
) == CALL_EXPR
)
4913 /* If e is a function call (5.2.2 [expr.call]) or an
4914 invocation of an overloaded operator (parentheses around e
4915 are ignored), decltype(e) is defined as the return type of
4917 tree fndecl
= get_callee_fndecl (expr
);
4918 if (fndecl
&& fndecl
!= error_mark_node
)
4919 type
= TREE_TYPE (TREE_TYPE (fndecl
));
4922 tree target_type
= TREE_TYPE (CALL_EXPR_FN (expr
));
4923 if ((TREE_CODE (target_type
) == REFERENCE_TYPE
4924 || TREE_CODE (target_type
) == POINTER_TYPE
)
4925 && (TREE_CODE (TREE_TYPE (target_type
)) == FUNCTION_TYPE
4926 || TREE_CODE (TREE_TYPE (target_type
)) == METHOD_TYPE
))
4927 type
= TREE_TYPE (TREE_TYPE (target_type
));
4928 else if (processing_template_decl
)
4929 /* Within a template finish_call_expr doesn't resolve
4930 CALL_EXPR_FN, so even though this decltype isn't really
4931 dependent let's defer resolving it. */
4932 goto treat_as_dependent
;
4934 sorry ("unable to determine the declared type of expression %<%E%>",
4940 type
= is_bitfield_expr_with_lowered_type (expr
);
4943 /* Bitfields are special, because their type encodes the
4944 number of bits they store. If the expression referenced a
4945 bitfield, TYPE now has the declared type of that
4947 type
= cp_build_qualified_type (type
,
4948 cp_type_quals (TREE_TYPE (expr
)));
4950 if (real_lvalue_p (expr
))
4951 type
= build_reference_type (type
);
4953 /* Within a lambda-expression:
4955 Every occurrence of decltype((x)) where x is a possibly
4956 parenthesized id-expression that names an entity of
4957 automatic storage duration is treated as if x were
4958 transformed into an access to a corresponding data member
4959 of the closure type that would have been declared if x
4960 were a use of the denoted entity. */
4961 else if (outer_automatic_var_p (expr
)
4962 && current_function_decl
4963 && LAMBDA_FUNCTION_P (current_function_decl
))
4964 type
= capture_decltype (expr
);
4967 /* Otherwise, where T is the type of e, if e is an lvalue,
4968 decltype(e) is defined as T&, otherwise decltype(e) is
4970 type
= TREE_TYPE (expr
);
4971 if (type
== error_mark_node
)
4972 return error_mark_node
;
4973 else if (expr
== current_class_ptr
)
4974 /* If the expression is just "this", we want the
4975 cv-unqualified pointer for the "this" type. */
4976 type
= TYPE_MAIN_VARIANT (type
);
4977 else if (real_lvalue_p (expr
))
4979 if (TREE_CODE (type
) != REFERENCE_TYPE
4980 || TYPE_REF_IS_RVALUE (type
))
4981 type
= build_reference_type (non_reference (type
));
4984 type
= non_reference (type
);
4989 if (!type
|| type
== unknown_type_node
)
4991 error ("type of %qE is unknown", expr
);
4992 return error_mark_node
;
4998 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4999 __has_nothrow_copy, depending on assign_p. */
5002 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5009 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5012 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5014 else if (TYPE_HAS_COPY_CTOR (type
))
5016 /* If construction of the copy constructor was postponed, create
5018 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5019 lazily_declare_fn (sfk_copy_constructor
, type
);
5020 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5021 lazily_declare_fn (sfk_move_constructor
, type
);
5022 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5027 for (; fns
; fns
= OVL_NEXT (fns
))
5029 tree fn
= OVL_CURRENT (fns
);
5033 if (copy_fn_p (fn
) == 0)
5036 else if (copy_fn_p (fn
) <= 0)
5039 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5046 /* Actually evaluates the trait. */
5049 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5051 enum tree_code type_code1
;
5054 type_code1
= TREE_CODE (type1
);
5058 case CPTK_HAS_NOTHROW_ASSIGN
:
5059 type1
= strip_array_types (type1
);
5060 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5061 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5062 || (CLASS_TYPE_P (type1
)
5063 && classtype_has_nothrow_assign_or_copy_p (type1
,
5066 case CPTK_HAS_TRIVIAL_ASSIGN
:
5067 /* ??? The standard seems to be missing the "or array of such a class
5068 type" wording for this trait. */
5069 type1
= strip_array_types (type1
);
5070 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5071 && (trivial_type_p (type1
)
5072 || (CLASS_TYPE_P (type1
)
5073 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5075 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5076 type1
= strip_array_types (type1
);
5077 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5078 || (CLASS_TYPE_P (type1
)
5079 && (t
= locate_ctor (type1
))
5080 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5082 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5083 type1
= strip_array_types (type1
);
5084 return (trivial_type_p (type1
)
5085 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5087 case CPTK_HAS_NOTHROW_COPY
:
5088 type1
= strip_array_types (type1
);
5089 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5090 || (CLASS_TYPE_P (type1
)
5091 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5093 case CPTK_HAS_TRIVIAL_COPY
:
5094 /* ??? The standard seems to be missing the "or array of such a class
5095 type" wording for this trait. */
5096 type1
= strip_array_types (type1
);
5097 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5098 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5100 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5101 type1
= strip_array_types (type1
);
5102 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5103 || (CLASS_TYPE_P (type1
)
5104 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5106 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5107 return type_has_virtual_destructor (type1
);
5109 case CPTK_IS_ABSTRACT
:
5110 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5112 case CPTK_IS_BASE_OF
:
5113 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5114 && DERIVED_FROM_P (type1
, type2
));
5117 return (NON_UNION_CLASS_TYPE_P (type1
));
5119 case CPTK_IS_CONVERTIBLE_TO
:
5124 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5127 return (type_code1
== ENUMERAL_TYPE
);
5130 return (pod_type_p (type1
));
5132 case CPTK_IS_POLYMORPHIC
:
5133 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5135 case CPTK_IS_STD_LAYOUT
:
5136 return (std_layout_type_p (type1
));
5138 case CPTK_IS_TRIVIAL
:
5139 return (trivial_type_p (type1
));
5142 return (type_code1
== UNION_TYPE
);
5144 case CPTK_IS_LITERAL_TYPE
:
5145 return (literal_type_p (type1
));
5153 /* Returns true if TYPE is a complete type, an array of unknown bound,
5154 or (possibly cv-qualified) void, returns false otherwise. */
5157 check_trait_type (tree type
)
5159 if (COMPLETE_TYPE_P (type
))
5162 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5163 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5166 if (VOID_TYPE_P (type
))
5172 /* Process a trait expression. */
5175 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5177 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5178 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5179 || kind
== CPTK_HAS_NOTHROW_COPY
5180 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5181 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5182 || kind
== CPTK_HAS_TRIVIAL_COPY
5183 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5184 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5185 || kind
== CPTK_IS_ABSTRACT
5186 || kind
== CPTK_IS_BASE_OF
5187 || kind
== CPTK_IS_CLASS
5188 || kind
== CPTK_IS_CONVERTIBLE_TO
5189 || kind
== CPTK_IS_EMPTY
5190 || kind
== CPTK_IS_ENUM
5191 || kind
== CPTK_IS_POD
5192 || kind
== CPTK_IS_POLYMORPHIC
5193 || kind
== CPTK_IS_STD_LAYOUT
5194 || kind
== CPTK_IS_TRIVIAL
5195 || kind
== CPTK_IS_LITERAL_TYPE
5196 || kind
== CPTK_IS_UNION
);
5198 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5200 sorry ("__is_convertible_to");
5201 return error_mark_node
;
5204 if (type1
== error_mark_node
5205 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5206 && type2
== error_mark_node
))
5207 return error_mark_node
;
5209 if (processing_template_decl
)
5211 tree trait_expr
= make_node (TRAIT_EXPR
);
5212 TREE_TYPE (trait_expr
) = boolean_type_node
;
5213 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5214 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5215 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5219 complete_type (type1
);
5221 complete_type (type2
);
5225 case CPTK_HAS_NOTHROW_ASSIGN
:
5226 case CPTK_HAS_TRIVIAL_ASSIGN
:
5227 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5228 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5229 case CPTK_HAS_NOTHROW_COPY
:
5230 case CPTK_HAS_TRIVIAL_COPY
:
5231 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5232 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5233 case CPTK_IS_ABSTRACT
:
5236 case CPTK_IS_POLYMORPHIC
:
5237 case CPTK_IS_STD_LAYOUT
:
5238 case CPTK_IS_TRIVIAL
:
5239 case CPTK_IS_LITERAL_TYPE
:
5240 if (!check_trait_type (type1
))
5242 error ("incomplete type %qT not allowed", type1
);
5243 return error_mark_node
;
5247 case CPTK_IS_BASE_OF
:
5248 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5249 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5250 && !COMPLETE_TYPE_P (type2
))
5252 error ("incomplete type %qT not allowed", type2
);
5253 return error_mark_node
;
5262 case CPTK_IS_CONVERTIBLE_TO
:
5267 return (trait_expr_value (kind
, type1
, type2
)
5268 ? boolean_true_node
: boolean_false_node
);
5271 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5272 which is ignored for C++. */
5275 set_float_const_decimal64 (void)
5280 clear_float_const_decimal64 (void)
5285 float_const_decimal64_p (void)
5291 /* Return true if T is a literal type. */
5294 literal_type_p (tree t
)
5296 if (SCALAR_TYPE_P (t
))
5298 if (CLASS_TYPE_P (t
))
5299 return CLASSTYPE_LITERAL_P (t
);
5300 if (TREE_CODE (t
) == ARRAY_TYPE
)
5301 return literal_type_p (strip_array_types (t
));
5305 /* If DECL is a variable declared `constexpr', require its type
5306 be literal. Return the DECL if OK, otherwise NULL. */
5309 ensure_literal_type_for_constexpr_object (tree decl
)
5311 tree type
= TREE_TYPE (decl
);
5312 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5313 && !processing_template_decl
5314 /* The call to complete_type is just for initializer_list. */
5315 && !literal_type_p (complete_type (type
)))
5317 error ("the type %qT of constexpr variable %qD is not literal",
5324 /* Representation of entries in the constexpr function definition table. */
5326 typedef struct GTY(()) constexpr_fundef
{
5331 /* This table holds all constexpr function definitions seen in
5332 the current translation unit. */
5334 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5336 /* Utility function used for managing the constexpr function table.
5337 Return true if the entries pointed to by P and Q are for the
5338 same constexpr function. */
5341 constexpr_fundef_equal (const void *p
, const void *q
)
5343 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5344 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5345 return lhs
->decl
== rhs
->decl
;
5348 /* Utility function used for managing the constexpr function table.
5349 Return a hash value for the entry pointed to by Q. */
5351 static inline hashval_t
5352 constexpr_fundef_hash (const void *p
)
5354 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5355 return DECL_UID (fundef
->decl
);
5358 /* Return a previously saved definition of function FUN. */
5360 static constexpr_fundef
*
5361 retrieve_constexpr_fundef (tree fun
)
5363 constexpr_fundef fundef
= { NULL
, NULL
};
5364 if (constexpr_fundef_table
== NULL
)
5368 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5371 /* Return true if type expression T is a valid parameter type, or
5372 a valid return type, of a constexpr function. */
5375 valid_type_in_constexpr_fundecl_p (tree t
)
5377 return (literal_type_p (t
)
5378 /* FIXME we allow ref to non-literal; should change standard to
5379 match, or change back if not. */
5380 || TREE_CODE (t
) == REFERENCE_TYPE
);
5383 /* Check whether the parameter and return types of FUN are valid for a
5384 constexpr function, and complain if COMPLAIN. */
5387 is_valid_constexpr_fn (tree fun
, bool complain
)
5389 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5391 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5392 if (!valid_type_in_constexpr_fundecl_p (TREE_TYPE (parm
)))
5396 error ("invalid type for parameter %q#D of constexpr function",
5400 if (!DECL_CONSTRUCTOR_P (fun
))
5402 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5403 if (!valid_type_in_constexpr_fundecl_p (rettype
))
5407 error ("invalid return type %qT of constexpr function %qD",
5411 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5412 && COMPLETE_TYPE_P (DECL_CONTEXT (fun
))
5413 && !valid_type_in_constexpr_fundecl_p (DECL_CONTEXT (fun
)))
5417 error ("enclosing class of %q#D is not a literal type", fun
);
5424 /* Return non-null if FUN certainly designates a valid constexpr function
5425 declaration. Otherwise return NULL. Issue appropriate diagnostics
5426 if necessary. Note that we only check the declaration, not the body
5430 validate_constexpr_fundecl (tree fun
)
5432 constexpr_fundef entry
;
5433 constexpr_fundef
**slot
;
5435 if (processing_template_decl
|| !DECL_DECLARED_CONSTEXPR_P (fun
))
5437 else if (DECL_CLONED_FUNCTION_P (fun
))
5438 /* We already checked the original function. */
5441 if (!is_valid_constexpr_fn (fun
, !DECL_TEMPLATE_INSTANTIATION (fun
)))
5443 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5447 /* Create the constexpr function table if necessary. */
5448 if (constexpr_fundef_table
== NULL
)
5449 constexpr_fundef_table
= htab_create_ggc (101,
5450 constexpr_fundef_hash
,
5451 constexpr_fundef_equal
,
5455 slot
= (constexpr_fundef
**)
5456 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
5459 *slot
= ggc_alloc_constexpr_fundef ();
5465 /* Subroutine of build_constexpr_constructor_member_initializers.
5466 The expression tree T represents a data member initialization
5467 in a (constexpr) constructor definition. Build a pairing of
5468 the data member with its initializer, and prepend that pair
5469 to the existing initialization pair INITS. */
5472 build_data_member_initialization (tree t
, VEC(constructor_elt
,gc
) **vec
)
5475 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5476 t
= TREE_OPERAND (t
, 0);
5477 if (TREE_CODE (t
) == EXPR_STMT
)
5478 t
= TREE_OPERAND (t
, 0);
5479 if (t
== error_mark_node
)
5481 if (TREE_CODE (t
) == STATEMENT_LIST
)
5483 tree_stmt_iterator i
;
5484 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5486 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5491 if (TREE_CODE (t
) == CLEANUP_STMT
)
5493 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5494 but we can in a constexpr constructor for a non-literal class. Just
5495 ignore it; either all the initialization will be constant, in which
5496 case the cleanup can't run, or it can't be constexpr.
5497 Still recurse into CLEANUP_BODY. */
5498 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5500 if (TREE_CODE (t
) == CONVERT_EXPR
)
5501 t
= TREE_OPERAND (t
, 0);
5502 if (TREE_CODE (t
) == INIT_EXPR
5503 || TREE_CODE (t
) == MODIFY_EXPR
)
5505 member
= TREE_OPERAND (t
, 0);
5506 init
= unshare_expr (TREE_OPERAND (t
, 1));
5510 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
5511 member
= CALL_EXPR_ARG (t
, 0);
5512 /* We don't use build_cplus_new here because it complains about
5513 abstract bases. Leaving the call unwrapped means that it has the
5514 wrong type, but cxx_eval_constant_expression doesn't care. */
5515 init
= unshare_expr (t
);
5517 if (TREE_CODE (member
) == INDIRECT_REF
)
5518 member
= TREE_OPERAND (member
, 0);
5519 if (TREE_CODE (member
) == NOP_EXPR
)
5523 if (TREE_CODE (op
) == ADDR_EXPR
)
5525 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5526 (TREE_TYPE (TREE_TYPE (op
)),
5527 TREE_TYPE (TREE_TYPE (member
))));
5528 /* Initializing a cv-qualified member; we need to look through
5534 /* We don't put out anything for an empty base. */
5535 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
5536 /* But if the initializer isn't constexpr, leave it in so we
5538 if (potential_constant_expression (init
))
5542 if (TREE_CODE (member
) == ADDR_EXPR
)
5543 member
= TREE_OPERAND (member
, 0);
5544 if (TREE_CODE (member
) == COMPONENT_REF
5545 /* If we're initializing a member of a subaggregate, it's a vtable
5546 pointer. Leave it as COMPONENT_REF so we remember the path to get
5548 && TREE_CODE (TREE_OPERAND (member
, 0)) != COMPONENT_REF
)
5549 member
= TREE_OPERAND (member
, 1);
5550 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
5554 /* Make sure that there are no statements after LAST in the constructor
5555 body represented by LIST. */
5558 check_constexpr_ctor_body (tree last
, tree list
)
5561 if (TREE_CODE (list
) == STATEMENT_LIST
)
5563 tree_stmt_iterator i
= tsi_last (list
);
5564 for (; !tsi_end_p (i
); tsi_prev (&i
))
5566 tree t
= tsi_stmt (i
);
5569 if (TREE_CODE (t
) == BIND_EXPR
)
5571 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
5576 /* We currently allow typedefs and static_assert.
5577 FIXME allow them in the standard, too. */
5578 if (TREE_CODE (t
) != STATIC_ASSERT
)
5585 else if (list
!= last
5586 && TREE_CODE (list
) != STATIC_ASSERT
)
5590 error ("constexpr constructor does not have empty body");
5591 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
5596 /* Build compile-time evalable representations of member-initializer list
5597 for a constexpr constructor. */
5600 build_constexpr_constructor_member_initializers (tree type
, tree body
)
5602 VEC(constructor_elt
,gc
) *vec
= NULL
;
5604 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
5605 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
5606 body
= TREE_OPERAND (body
, 0);
5607 if (TREE_CODE (body
) == STATEMENT_LIST
)
5608 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
5609 body
= BIND_EXPR_BODY (body
);
5610 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5612 body
= TREE_OPERAND (body
, 0);
5613 if (TREE_CODE (body
) == EXPR_STMT
)
5614 body
= TREE_OPERAND (body
, 0);
5615 if (TREE_CODE (body
) == INIT_EXPR
5616 && (same_type_ignoring_top_level_qualifiers_p
5617 (TREE_TYPE (TREE_OPERAND (body
, 0)),
5618 current_class_type
)))
5621 return TREE_OPERAND (body
, 1);
5623 ok
= build_data_member_initialization (body
, &vec
);
5625 else if (TREE_CODE (body
) == STATEMENT_LIST
)
5627 tree_stmt_iterator i
;
5628 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5630 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
5636 gcc_assert (errorcount
> 0);
5638 return build_constructor (type
, vec
);
5640 return error_mark_node
;
5643 /* We are processing the definition of the constexpr function FUN.
5644 Check that its BODY fulfills the propriate requirements and
5645 enter it in the constexpr function definition table.
5646 For constructor BODY is actually the TREE_LIST of the
5647 member-initializer list. */
5650 register_constexpr_fundef (tree fun
, tree body
)
5652 constexpr_fundef
*fundef
= retrieve_constexpr_fundef (fun
);
5653 gcc_assert (fundef
!= NULL
&& fundef
->body
== NULL
);
5655 if (DECL_CONSTRUCTOR_P (fun
))
5656 body
= build_constexpr_constructor_member_initializers
5657 (DECL_CONTEXT (fun
), body
);
5660 if (TREE_CODE (body
) == BIND_EXPR
)
5661 body
= BIND_EXPR_BODY (body
);
5662 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
5663 body
= EH_SPEC_STMTS (body
);
5664 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
5665 body
= TREE_OPERAND (body
, 0);
5666 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5667 body
= TREE_OPERAND (body
, 0);
5668 if (TREE_CODE (body
) != RETURN_EXPR
)
5670 error ("body of constexpr function %qD not a return-statement", fun
);
5671 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5674 body
= unshare_expr (TREE_OPERAND (body
, 0));
5677 if (!potential_constant_expression (body
))
5679 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5680 if (!DECL_TEMPLATE_INSTANTIATION (fun
))
5681 require_potential_constant_expression (body
);
5684 fundef
->body
= body
;
5688 /* Objects of this type represent calls to constexpr functions
5689 along with the bindings of parameters to their arguments, for
5690 the purpose of compile time evaluation. */
5692 typedef struct GTY(()) constexpr_call
{
5693 /* Description of the constexpr function definition. */
5694 constexpr_fundef
*fundef
;
5695 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5696 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5697 Note: This arrangement is made to accomodate the use of
5698 iterative_hash_template_arg (see pt.c). If you change this
5699 representation, also change the hash calculation in
5700 cxx_eval_call_expression. */
5702 /* Result of the call.
5703 NULL means the call is being evaluated.
5704 error_mark_node means that the evaluation was erroneous;
5705 otherwise, the actuall value of the call. */
5707 /* The hash of this call; we remember it here to avoid having to
5708 recalculate it when expanding the hash table. */
5712 /* A table of all constexpr calls that have been evaluated by the
5713 compiler in this translation unit. */
5715 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
5717 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
5718 bool, bool, bool *);
5720 /* Compute a hash value for a constexpr call representation. */
5723 constexpr_call_hash (const void *p
)
5725 const constexpr_call
*info
= (const constexpr_call
*) p
;
5729 /* Return 1 if the objects pointed to by P and Q represent calls
5730 to the same constexpr function with the same arguments.
5731 Otherwise, return 0. */
5734 constexpr_call_equal (const void *p
, const void *q
)
5736 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
5737 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
5742 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
5744 lhs_bindings
= lhs
->bindings
;
5745 rhs_bindings
= rhs
->bindings
;
5746 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
5748 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
5749 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
5750 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
5751 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
5753 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
5754 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
5756 return lhs_bindings
== rhs_bindings
;
5759 /* Initialize the constexpr call table, if needed. */
5762 maybe_initialize_constexpr_call_table (void)
5764 if (constexpr_call_table
== NULL
)
5765 constexpr_call_table
= htab_create_ggc (101,
5766 constexpr_call_hash
,
5767 constexpr_call_equal
,
5771 /* Return true if T designates the implied `this' parameter. */
5774 is_this_parameter (tree t
)
5776 return t
== current_class_ptr
;
5779 /* We have an expression tree T that represents a call, either CALL_EXPR
5780 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5781 retrun the _DECL for that function. */
5784 get_function_named_in_call (tree t
)
5787 switch (TREE_CODE (t
))
5790 fun
= CALL_EXPR_FN (t
);
5793 case AGGR_INIT_EXPR
:
5794 fun
= AGGR_INIT_EXPR_FN (t
);
5801 if (TREE_CODE (fun
) == ADDR_EXPR
5802 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
5803 fun
= TREE_OPERAND (fun
, 0);
5807 /* We have an expression tree T that represents a call, either CALL_EXPR
5808 or AGGR_INIT_EXPR. Return the Nth argument. */
5811 get_nth_callarg (tree t
, int n
)
5813 switch (TREE_CODE (t
))
5816 return CALL_EXPR_ARG (t
, n
);
5818 case AGGR_INIT_EXPR
:
5819 return AGGR_INIT_EXPR_ARG (t
, n
);
5827 /* Look up the binding of the function parameter T in a constexpr
5828 function call context CALL. */
5831 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
5833 tree b
= purpose_member (t
, call
->bindings
);
5834 return TREE_VALUE (b
);
5837 /* Attempt to evaluate T which represents a call to a builtin function.
5838 We assume here that all builtin functions evaluate to scalar types
5839 represented by _CST nodes. */
5842 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
5843 bool allow_non_constant
, bool addr
,
5844 bool *non_constant_p
)
5846 const int nargs
= call_expr_nargs (t
);
5847 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
5850 for (i
= 0; i
< nargs
; ++i
)
5852 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
5853 allow_non_constant
, addr
,
5855 if (allow_non_constant
&& *non_constant_p
)
5858 if (*non_constant_p
)
5860 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
5861 CALL_EXPR_FN (t
), nargs
, args
);
5862 return fold (new_call
);
5865 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5866 the type of the value to match. */
5869 adjust_temp_type (tree type
, tree temp
)
5871 if (TREE_TYPE (temp
) == type
)
5873 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5874 if (TREE_CODE (temp
) == CONSTRUCTOR
)
5875 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
5876 gcc_assert (SCALAR_TYPE_P (type
));
5877 return cp_fold_convert (type
, temp
);
5880 /* Subroutine of cxx_eval_call_expression.
5881 We are processing a call expression (either CALL_EXPR or
5882 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5883 all arguments and bind their values to correspondings
5884 parameters, making up the NEW_CALL context. */
5887 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
5888 constexpr_call
*new_call
,
5889 bool allow_non_constant
,
5890 bool *non_constant_p
)
5892 const int nargs
= call_expr_nargs (t
);
5893 tree fun
= new_call
->fundef
->decl
;
5894 tree parms
= DECL_ARGUMENTS (fun
);
5896 for (i
= 0; i
< nargs
; ++i
)
5899 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
5900 /* For member function, the first argument is a pointer to the implied
5901 object. And for an object contruction, don't bind `this' before
5902 it is fully constructed. */
5903 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
5905 x
= get_nth_callarg (t
, i
);
5906 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
5907 TREE_CODE (type
) == REFERENCE_TYPE
,
5909 /* Don't VERIFY_CONSTANT here. */
5910 if (*non_constant_p
&& allow_non_constant
)
5912 /* Just discard ellipsis args after checking their constantitude. */
5915 if (*non_constant_p
)
5916 /* Don't try to adjust the type of non-constant args. */
5919 /* Make sure the binding has the same type as the parm. */
5920 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5921 arg
= adjust_temp_type (type
, arg
);
5922 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
5924 parms
= TREE_CHAIN (parms
);
5928 /* Variables and functions to manage constexpr call expansion context.
5929 These do not need to be marked for PCH or GC. */
5931 /* FIXME remember and print actual constant arguments. */
5932 static VEC(tree
,heap
) *call_stack
= NULL
;
5933 static int call_stack_tick
;
5934 static int last_cx_error_tick
;
5937 push_cx_call_context (tree call
)
5940 if (!EXPR_HAS_LOCATION (call
))
5941 SET_EXPR_LOCATION (call
, input_location
);
5942 VEC_safe_push (tree
, heap
, call_stack
, call
);
5943 if (VEC_length (tree
, call_stack
) > (unsigned) max_constexpr_depth
)
5949 pop_cx_call_context (void)
5952 VEC_pop (tree
, call_stack
);
5956 cx_error_context (void)
5958 VEC(tree
,heap
) *r
= NULL
;
5959 if (call_stack_tick
!= last_cx_error_tick
5960 && !VEC_empty (tree
, call_stack
))
5962 last_cx_error_tick
= call_stack_tick
;
5966 /* Subroutine of cxx_eval_constant_expression.
5967 Evaluate the call expression tree T in the context of OLD_CALL expression
5971 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
5972 bool allow_non_constant
, bool addr
,
5973 bool *non_constant_p
)
5975 location_t loc
= EXPR_LOC_OR_HERE (t
);
5976 tree fun
= get_function_named_in_call (t
);
5978 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
5979 constexpr_call
**slot
;
5980 constexpr_call
*entry
;
5983 if (TREE_CODE (fun
) != FUNCTION_DECL
)
5985 /* Might be a constexpr function pointer. */
5986 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
5987 /*addr*/false, non_constant_p
);
5988 if (TREE_CODE (fun
) == ADDR_EXPR
)
5989 fun
= TREE_OPERAND (fun
, 0);
5991 if (TREE_CODE (fun
) != FUNCTION_DECL
)
5993 if (!allow_non_constant
)
5994 error_at (loc
, "expression %qE does not designate a constexpr "
5996 *non_constant_p
= true;
5999 if (DECL_CLONED_FUNCTION_P (fun
))
6000 fun
= DECL_CLONED_FUNCTION (fun
);
6001 if (is_builtin_fn (fun
))
6002 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6003 addr
, non_constant_p
);
6004 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6006 if (!allow_non_constant
)
6008 error_at (loc
, "%qD is not a constexpr function", fun
);
6009 if (DECL_TEMPLATE_INSTANTIATION (fun
)
6010 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
6011 (DECL_TI_TEMPLATE (fun
))))
6012 is_valid_constexpr_fn (fun
, true);
6014 *non_constant_p
= true;
6018 /* Shortcut trivial copy constructor/op=. */
6019 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6021 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6022 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6023 addr
, non_constant_p
);
6026 /* If in direct recursive call, optimize definition search. */
6027 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6028 new_call
.fundef
= old_call
->fundef
;
6031 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6032 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6034 if (!allow_non_constant
)
6035 error_at (loc
, "%qD used before its definition", fun
);
6036 *non_constant_p
= true;
6040 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6041 allow_non_constant
, non_constant_p
);
6042 if (*non_constant_p
)
6045 depth_ok
= push_cx_call_context (t
);
6048 = iterative_hash_template_arg (new_call
.bindings
,
6049 constexpr_fundef_hash (new_call
.fundef
));
6051 /* If we have seen this call before, we are done. */
6052 maybe_initialize_constexpr_call_table ();
6053 slot
= (constexpr_call
**)
6054 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
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 *slot
= entry
= ggc_alloc_constexpr_call ();
6063 /* Calls which are in progress have their result set to NULL
6064 so that we can detect circular dependencies. */
6065 else if (entry
->result
== NULL
)
6067 if (!allow_non_constant
)
6068 error ("call has circular dependency");
6069 *non_constant_p
= true;
6070 entry
->result
= result
= error_mark_node
;
6075 if (!allow_non_constant
)
6076 error ("constexpr evaluation depth exceeds maximum of %d (use "
6077 "-fconstexpr-depth= to increase the maximum)",
6078 max_constexpr_depth
);
6079 *non_constant_p
= true;
6080 entry
->result
= result
= error_mark_node
;
6084 result
= entry
->result
;
6085 if (!result
|| (result
== error_mark_node
&& !allow_non_constant
))
6086 result
= (cxx_eval_constant_expression
6087 (&new_call
, new_call
.fundef
->body
,
6088 allow_non_constant
, addr
,
6090 if (result
== error_mark_node
)
6091 *non_constant_p
= true;
6092 if (*non_constant_p
)
6093 entry
->result
= result
= error_mark_node
;
6096 /* If this was a call to initialize an object, set the type of
6097 the CONSTRUCTOR to the type of that object. */
6098 if (DECL_CONSTRUCTOR_P (fun
))
6100 tree ob_arg
= get_nth_callarg (t
, 0);
6101 STRIP_NOPS (ob_arg
);
6102 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6103 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6104 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6107 entry
->result
= result
;
6111 pop_cx_call_context ();
6112 return unshare_expr (result
);
6115 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6118 reduced_constant_expression_p (tree t
)
6120 if (TREE_OVERFLOW_P (t
))
6121 /* Integer overflow makes this not a constant expression. */
6123 /* FIXME are we calling this too much? */
6124 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6127 /* Some expressions may have constant operands but are not constant
6128 themselves, such as 1/0. Call this function (or rather, the macro
6129 following it) to check for that condition.
6131 We only call this in places that require an arithmetic constant, not in
6132 places where we might have a non-constant expression that can be a
6133 component of a constant expression, such as the address of a constexpr
6134 variable that might be dereferenced later. */
6137 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
)
6139 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6141 if (!allow_non_constant
)
6143 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6144 printing the folded constant isn't helpful. */
6145 if (TREE_OVERFLOW_P (t
))
6147 permerror (input_location
, "overflow in constant expression");
6148 /* If we're being permissive (and are in an enforcing
6149 context), consider this constant. */
6150 if (flag_permissive
)
6154 error ("%q+E is not a constant expression", t
);
6156 *non_constant_p
= true;
6158 return *non_constant_p
;
6160 #define VERIFY_CONSTANT(X) \
6162 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6166 /* Subroutine of cxx_eval_constant_expression.
6167 Attempt to reduce the unary expression tree T to a compile time value.
6168 If successful, return the value. Otherwise issue a diagnostic
6169 and return error_mark_node. */
6172 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6173 bool allow_non_constant
, bool addr
,
6174 bool *non_constant_p
)
6177 tree orig_arg
= TREE_OPERAND (t
, 0);
6178 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6179 addr
, non_constant_p
);
6180 VERIFY_CONSTANT (arg
);
6181 if (arg
== orig_arg
)
6183 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6184 VERIFY_CONSTANT (r
);
6188 /* Subroutine of cxx_eval_constant_expression.
6189 Like cxx_eval_unary_expression, except for binary expressions. */
6192 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6193 bool allow_non_constant
, bool addr
,
6194 bool *non_constant_p
)
6197 tree orig_lhs
= TREE_OPERAND (t
, 0);
6198 tree orig_rhs
= TREE_OPERAND (t
, 1);
6200 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6201 allow_non_constant
, addr
,
6203 VERIFY_CONSTANT (lhs
);
6204 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6205 allow_non_constant
, addr
,
6207 VERIFY_CONSTANT (rhs
);
6208 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6210 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6211 VERIFY_CONSTANT (r
);
6215 /* Subroutine of cxx_eval_constant_expression.
6216 Attempt to evaluate condition expressions. Dead branches are not
6220 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6221 bool allow_non_constant
, bool addr
,
6222 bool *non_constant_p
)
6224 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6225 allow_non_constant
, addr
,
6227 VERIFY_CONSTANT (val
);
6228 if (val
== boolean_true_node
)
6229 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6230 allow_non_constant
, addr
,
6232 gcc_assert (val
== boolean_false_node
);
6233 /* Don't VERIFY_CONSTANT here. */
6234 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6235 allow_non_constant
, addr
,
6239 /* Subroutine of cxx_eval_constant_expression.
6240 Attempt to reduce a reference to an array slot. */
6243 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6244 bool allow_non_constant
, bool addr
,
6245 bool *non_constant_p
)
6247 tree oldary
= TREE_OPERAND (t
, 0);
6248 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6249 allow_non_constant
, addr
,
6254 if (*non_constant_p
)
6256 oldidx
= TREE_OPERAND (t
, 1);
6257 index
= cxx_eval_constant_expression (call
, oldidx
,
6258 allow_non_constant
, false,
6260 VERIFY_CONSTANT (index
);
6261 if (addr
&& ary
== oldary
&& index
== oldidx
)
6264 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
6265 len
= (TREE_CODE (ary
) == CONSTRUCTOR
6266 ? CONSTRUCTOR_NELTS (ary
)
6267 : (unsigned)TREE_STRING_LENGTH (ary
));
6268 if (compare_tree_int (index
, len
) >= 0)
6270 if (!allow_non_constant
)
6271 error ("array subscript out of bound");
6272 *non_constant_p
= true;
6275 i
= tree_low_cst (index
, 0);
6276 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6277 return VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ary
), i
)->value
;
6279 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
6280 TREE_STRING_POINTER (ary
)[i
]);
6281 /* Don't VERIFY_CONSTANT here. */
6284 /* Subroutine of cxx_eval_constant_expression.
6285 Attempt to reduce a field access of a value of class type. */
6288 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
6289 bool allow_non_constant
, bool addr
,
6290 bool *non_constant_p
)
6292 unsigned HOST_WIDE_INT i
;
6295 tree part
= TREE_OPERAND (t
, 1);
6296 tree orig_whole
= TREE_OPERAND (t
, 0);
6297 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6298 allow_non_constant
, addr
,
6300 if (whole
== orig_whole
)
6303 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
6304 whole
, part
, NULL_TREE
);
6305 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6307 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6309 if (!allow_non_constant
)
6310 error ("%qE is not a constant expression", orig_whole
);
6311 *non_constant_p
= true;
6313 if (*non_constant_p
)
6315 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6320 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
)
6322 /* FIXME Mike Miller wants this to be OK. */
6323 if (!allow_non_constant
)
6324 error ("accessing %qD member instead of initialized %qD member in "
6325 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
6326 *non_constant_p
= true;
6330 return error_mark_node
;
6333 /* Subroutine of cxx_eval_constant_expression.
6334 Attempt to reduce a field access of a value of class type that is
6335 expressed as a BIT_FIELD_REF. */
6338 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
6339 bool allow_non_constant
, bool addr
,
6340 bool *non_constant_p
)
6342 tree orig_whole
= TREE_OPERAND (t
, 0);
6343 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6344 allow_non_constant
, addr
,
6346 tree start
, field
, value
;
6347 unsigned HOST_WIDE_INT i
;
6349 if (whole
== orig_whole
)
6351 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6353 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6355 if (!allow_non_constant
)
6356 error ("%qE is not a constant expression", orig_whole
);
6357 *non_constant_p
= true;
6359 if (*non_constant_p
)
6362 start
= TREE_OPERAND (t
, 2);
6363 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6365 if (bit_position (field
) == start
)
6369 return error_mark_node
;
6372 /* Subroutine of cxx_eval_constant_expression.
6373 Evaluate a short-circuited logical expression T in the context
6374 of a given constexpr CALL. BAILOUT_VALUE is the value for
6375 early return. CONTINUE_VALUE is used here purely for
6376 sanity check purposes. */
6379 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
6380 tree bailout_value
, tree continue_value
,
6381 bool allow_non_constant
, bool addr
,
6382 bool *non_constant_p
)
6385 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6386 allow_non_constant
, addr
,
6388 VERIFY_CONSTANT (lhs
);
6389 if (lhs
== bailout_value
)
6391 gcc_assert (lhs
== continue_value
);
6392 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6393 allow_non_constant
, addr
, non_constant_p
);
6394 VERIFY_CONSTANT (r
);
6398 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6399 CONSTRUCTOR elements to initialize (part of) an object containing that
6400 field. Return a pointer to the constructor_elt corresponding to the
6401 initialization of the field. */
6403 static constructor_elt
*
6404 base_field_constructor_elt (VEC(constructor_elt
,gc
) *v
, tree ref
)
6406 tree aggr
= TREE_OPERAND (ref
, 0);
6407 tree field
= TREE_OPERAND (ref
, 1);
6409 constructor_elt
*ce
;
6411 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
6413 if (TREE_CODE (aggr
) == COMPONENT_REF
)
6415 constructor_elt
*base_ce
6416 = base_field_constructor_elt (v
, aggr
);
6417 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
6420 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6421 if (ce
->index
== field
)
6428 /* Subroutine of cxx_eval_constant_expression.
6429 The expression tree T denotes a C-style array or a C-style
6430 aggregate. Reduce it to a constant expression. */
6433 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
6434 bool allow_non_constant
, bool addr
,
6435 bool *non_constant_p
)
6437 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
6438 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
,
6439 VEC_length (constructor_elt
, v
));
6440 constructor_elt
*ce
;
6442 bool changed
= false;
6443 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
6444 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6446 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
6447 allow_non_constant
, addr
,
6449 /* Don't VERIFY_CONSTANT here. */
6450 if (allow_non_constant
&& *non_constant_p
)
6452 if (elt
!= ce
->value
)
6454 if (TREE_CODE (ce
->index
) == COMPONENT_REF
)
6456 /* This is an initialization of a vfield inside a base
6457 subaggregate that we already initialized; push this
6458 initialization into the previous initialization. */
6459 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
6463 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
6465 if (*non_constant_p
|| !changed
)
6468 VEC_free (constructor_elt
, gc
, n
);
6471 t
= build_constructor (TREE_TYPE (t
), n
);
6472 TREE_CONSTANT (t
) = true;
6476 /* Subroutine of cxx_eval_constant_expression.
6477 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6478 initialization of a non-static data member of array type. Reduce it to a
6481 Note that apart from value-initialization (when VALUE_INIT is true),
6482 this is only intended to support value-initialization and the
6483 initializations done by defaulted constructors for classes with
6484 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6485 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6486 for the copy/move constructor. */
6489 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
6490 bool value_init
, bool allow_non_constant
, bool addr
,
6491 bool *non_constant_p
)
6493 tree elttype
= TREE_TYPE (atype
);
6494 int max
= tree_low_cst (array_type_nelts (atype
), 0);
6495 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
, max
+ 1);
6498 /* For the default constructor, build up a call to the default
6499 constructor of the element type. We only need to handle class types
6500 here, as for a constructor to be constexpr, all members must be
6501 initialized, which for a defaulted default constructor means they must
6502 be of a class type with a constexpr default constructor. */
6507 VEC(tree
,gc
) *argvec
= make_tree_vector ();
6508 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6509 &argvec
, elttype
, LOOKUP_NORMAL
,
6510 tf_warning_or_error
);
6511 release_tree_vector (argvec
);
6512 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
6513 addr
, non_constant_p
);
6516 if (*non_constant_p
&& !allow_non_constant
)
6519 for (i
= 0; i
<= max
; ++i
)
6521 tree idx
= build_int_cst (size_type_node
, i
);
6523 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
6525 /* A multidimensional array; recurse. */
6527 eltinit
= NULL_TREE
;
6529 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6530 tf_warning_or_error
);
6531 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
6532 allow_non_constant
, addr
,
6535 else if (value_init
)
6537 eltinit
= build_value_init (elttype
, tf_warning_or_error
);
6538 eltinit
= cxx_eval_constant_expression
6539 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6541 else if (TREE_CODE (init
) == CONSTRUCTOR
)
6543 /* Initializing an element using the call to the default
6544 constructor we just built above. */
6545 eltinit
= unshare_expr (init
);
6549 /* Copying an element. */
6550 VEC(tree
,gc
) *argvec
;
6551 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6552 (atype
, TREE_TYPE (init
)));
6553 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6554 tf_warning_or_error
);
6555 if (!real_lvalue_p (init
))
6556 eltinit
= move (eltinit
);
6557 argvec
= make_tree_vector ();
6558 VEC_quick_push (tree
, argvec
, eltinit
);
6559 eltinit
= (build_special_member_call
6560 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
6561 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
6562 release_tree_vector (argvec
);
6563 eltinit
= cxx_eval_constant_expression
6564 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6566 if (*non_constant_p
&& !allow_non_constant
)
6568 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
6571 if (!*non_constant_p
)
6573 init
= build_constructor (TREE_TYPE (atype
), n
);
6574 TREE_CONSTANT (init
) = true;
6579 VEC_free (constructor_elt
, gc
, n
);
6584 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
6585 bool allow_non_constant
, bool addr
,
6586 bool *non_constant_p
)
6588 tree atype
= TREE_TYPE (t
);
6589 tree init
= VEC_INIT_EXPR_INIT (t
);
6590 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
6591 VEC_INIT_EXPR_VALUE_INIT (t
),
6592 allow_non_constant
, addr
, non_constant_p
);
6593 if (*non_constant_p
)
6599 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6600 match. We want to be less strict for simple *& folding; if we have a
6601 non-const temporary that we access through a const pointer, that should
6602 work. We handle this here rather than change fold_indirect_ref_1
6603 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6604 don't really make sense outside of constant expression evaluation. Also
6605 we want to allow folding to COMPONENT_REF, which could cause trouble
6606 with TBAA in fold_indirect_ref_1. */
6609 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
6610 bool allow_non_constant
, bool addr
,
6611 bool *non_constant_p
)
6613 tree orig_op0
= TREE_OPERAND (t
, 0);
6614 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
6615 /*addr*/false, non_constant_p
);
6616 tree type
, sub
, subtype
, r
;
6619 /* Don't VERIFY_CONSTANT here. */
6620 if (*non_constant_p
)
6623 type
= TREE_TYPE (t
);
6629 subtype
= TREE_TYPE (sub
);
6630 gcc_assert (POINTER_TYPE_P (subtype
));
6632 if (TREE_CODE (sub
) == ADDR_EXPR
)
6634 tree op
= TREE_OPERAND (sub
, 0);
6635 tree optype
= TREE_TYPE (op
);
6637 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
6639 /* Also handle conversion to an empty base class, which
6640 is represented with a NOP_EXPR. */
6641 else if (!addr
&& is_empty_class (type
)
6642 && CLASS_TYPE_P (optype
)
6643 && DERIVED_FROM_P (type
, optype
))
6648 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6649 else if (RECORD_OR_UNION_TYPE_P (optype
))
6651 tree field
= TYPE_FIELDS (optype
);
6652 for (; field
; field
= DECL_CHAIN (field
))
6653 if (TREE_CODE (field
) == FIELD_DECL
6654 && integer_zerop (byte_position (field
))
6655 && (same_type_ignoring_top_level_qualifiers_p
6656 (TREE_TYPE (field
), type
)))
6658 r
= fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
6663 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
6664 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
6666 tree op00
= TREE_OPERAND (sub
, 0);
6667 tree op01
= TREE_OPERAND (sub
, 1);
6670 if (TREE_CODE (op00
) == ADDR_EXPR
)
6673 op00
= TREE_OPERAND (op00
, 0);
6674 op00type
= TREE_TYPE (op00
);
6676 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6677 if (RECORD_OR_UNION_TYPE_P (op00type
))
6679 tree field
= TYPE_FIELDS (op00type
);
6680 for (; field
; field
= DECL_CHAIN (field
))
6681 if (TREE_CODE (field
) == FIELD_DECL
6682 && tree_int_cst_equal (byte_position (field
), op01
)
6683 && (same_type_ignoring_top_level_qualifiers_p
6684 (TREE_TYPE (field
), type
)))
6686 r
= fold_build3 (COMPONENT_REF
, type
, op00
,
6694 /* Let build_fold_indirect_ref handle the cases it does fine with. */
6696 r
= build_fold_indirect_ref (op0
);
6697 if (TREE_CODE (r
) != INDIRECT_REF
)
6698 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
6699 addr
, non_constant_p
);
6700 else if (TREE_CODE (sub
) == ADDR_EXPR
6701 || TREE_CODE (sub
) == POINTER_PLUS_EXPR
)
6703 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6704 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
6705 /* FIXME Mike Miller wants this to be OK. */
6706 if (!allow_non_constant
)
6707 error ("accessing value of %qE through a %qT glvalue in a "
6708 "constant expression", build_fold_indirect_ref (sub
),
6710 *non_constant_p
= true;
6714 /* If we're pulling out the value of an empty base, make sure
6715 that the whole object is constant and then return an empty
6719 VERIFY_CONSTANT (r
);
6720 r
= build_constructor (TREE_TYPE (t
), NULL
);
6721 TREE_CONSTANT (r
) = true;
6724 if (TREE_CODE (r
) == INDIRECT_REF
&& TREE_OPERAND (r
, 0) == orig_op0
)
6729 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
6730 Shared between potential_constant_expression and
6731 cxx_eval_constant_expression. */
6734 non_const_var_error (tree r
)
6736 tree type
= TREE_TYPE (r
);
6737 error ("the value of %qD is not usable in a constant "
6739 if (DECL_DECLARED_CONSTEXPR_P (r
))
6740 inform (DECL_SOURCE_LOCATION (r
),
6741 "%qD used in its own initializer", r
);
6742 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6744 if (!CP_TYPE_CONST_P (type
))
6745 inform (DECL_SOURCE_LOCATION (r
),
6746 "%q#D is not const", r
);
6747 else if (CP_TYPE_VOLATILE_P (type
))
6748 inform (DECL_SOURCE_LOCATION (r
),
6749 "%q#D is volatile", r
);
6750 else if (!DECL_INITIAL (r
))
6751 inform (DECL_SOURCE_LOCATION (r
),
6752 "%qD was not initialized with a constant "
6759 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
6760 inform (DECL_SOURCE_LOCATION (r
),
6761 "%qD was not declared %<constexpr%>", r
);
6763 inform (DECL_SOURCE_LOCATION (r
),
6764 "%qD does not have integral or enumeration type",
6769 /* Attempt to reduce the expression T to a constant value.
6770 On failure, issue diagnostic and return error_mark_node. */
6771 /* FIXME unify with c_fully_fold */
6774 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
6775 bool allow_non_constant
, bool addr
,
6776 bool *non_constant_p
)
6780 if (t
== error_mark_node
)
6782 *non_constant_p
= true;
6785 if (CONSTANT_CLASS_P (t
))
6787 if (TREE_CODE (t
) == PTRMEM_CST
)
6788 t
= cplus_expand_constant (t
);
6791 if (TREE_CODE (t
) != NOP_EXPR
6792 && reduced_constant_expression_p (t
))
6795 switch (TREE_CODE (t
))
6800 /* else fall through. */
6802 r
= integral_constant_value (t
);
6803 if (TREE_CODE (r
) == TARGET_EXPR
6804 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
6805 r
= TARGET_EXPR_INITIAL (r
);
6808 if (!allow_non_constant
)
6809 non_const_var_error (r
);
6810 *non_constant_p
= true;
6819 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
6820 r
= lookup_parameter_binding (call
, t
);
6822 /* Defer in case this is only used for its type. */;
6825 if (!allow_non_constant
)
6826 error ("%qE is not a constant expression", t
);
6827 *non_constant_p
= true;
6832 case AGGR_INIT_EXPR
:
6833 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
6839 /* Pass false for 'addr' because these codes indicate
6840 initialization of a temporary. */
6841 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6842 allow_non_constant
, false,
6844 if (!*non_constant_p
)
6845 /* Adjust the type of the result to the type of the temporary. */
6846 r
= adjust_temp_type (TREE_TYPE (t
), r
);
6850 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6851 allow_non_constant
, addr
,
6856 case NON_LVALUE_EXPR
:
6857 case TRY_CATCH_EXPR
:
6858 case CLEANUP_POINT_EXPR
:
6859 case MUST_NOT_THROW_EXPR
:
6861 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6862 allow_non_constant
, addr
,
6866 /* These differ from cxx_eval_unary_expression in that this doesn't
6867 check for a constant operand or result; an address can be
6868 constant without its operand being, and vice versa. */
6870 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
6876 tree oldop
= TREE_OPERAND (t
, 0);
6877 tree op
= cxx_eval_constant_expression (call
, oldop
,
6881 /* Don't VERIFY_CONSTANT here. */
6882 if (*non_constant_p
)
6884 /* This function does more aggressive folding than fold itself. */
6885 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
6886 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
6894 case FIX_TRUNC_EXPR
:
6899 case TRUTH_NOT_EXPR
:
6900 case FIXED_CONVERT_EXPR
:
6901 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
6907 /* check_return_expr sometimes wraps a TARGET_EXPR in a
6908 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
6909 introduced by build_call_a. */
6910 tree op0
= TREE_OPERAND (t
, 0);
6911 tree op1
= TREE_OPERAND (t
, 1);
6913 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
6914 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
6915 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
6916 addr
, non_constant_p
);
6922 case POINTER_PLUS_EXPR
:
6926 case TRUNC_DIV_EXPR
:
6928 case FLOOR_DIV_EXPR
:
6929 case ROUND_DIV_EXPR
:
6930 case TRUNC_MOD_EXPR
:
6932 case ROUND_MOD_EXPR
:
6934 case EXACT_DIV_EXPR
:
6944 case TRUTH_XOR_EXPR
:
6951 case UNORDERED_EXPR
:
6961 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
6965 /* fold can introduce non-IF versions of these; still treat them as
6966 short-circuiting. */
6967 case TRUTH_AND_EXPR
:
6968 case TRUTH_ANDIF_EXPR
:
6969 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
6971 allow_non_constant
, addr
,
6976 case TRUTH_ORIF_EXPR
:
6977 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
6979 allow_non_constant
, addr
,
6984 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
6989 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
6994 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
7000 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
7005 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
7010 /* We can get this in a defaulted constructor for a class with a
7011 non-static data member of array type. Either the initializer will
7012 be NULL, meaning default-initialization, or it will be an lvalue
7013 or xvalue of the same type, meaning direct-initialization from the
7014 corresponding member. */
7015 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
7020 case VIEW_CONVERT_EXPR
:
7023 tree oldop
= TREE_OPERAND (t
, 0);
7025 tree to
= TREE_TYPE (t
);
7026 tree source
= TREE_TYPE (op
);
7027 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (to
)
7028 && !(TREE_CODE (op
) == COMPONENT_REF
7029 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op
, 0)))))
7031 if (!allow_non_constant
)
7032 error ("conversion of expression %qE of pointer type "
7033 "cannot yield a constant expression", op
);
7034 *non_constant_p
= true;
7037 op
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7038 allow_non_constant
, addr
,
7040 if (*non_constant_p
)
7043 /* We didn't fold at the top so we could check for ptr-int
7046 r
= fold_build1 (TREE_CODE (t
), to
, op
);
7050 case EMPTY_CLASS_EXPR
:
7051 /* This is good enough for a function argument that might not get
7052 used, and they can't do anything with it, so just return it. */
7056 case DYNAMIC_CAST_EXPR
:
7057 case PSEUDO_DTOR_EXPR
:
7058 case PREINCREMENT_EXPR
:
7059 case POSTINCREMENT_EXPR
:
7060 case PREDECREMENT_EXPR
:
7061 case POSTDECREMENT_EXPR
:
7065 case VEC_DELETE_EXPR
:
7069 /* GCC internal stuff. */
7072 case WITH_CLEANUP_EXPR
:
7073 case STATEMENT_LIST
:
7075 case NON_DEPENDENT_EXPR
:
7079 if (!allow_non_constant
)
7080 error_at (EXPR_LOC_OR_HERE (t
),
7081 "expression %qE is not a constant-expression", t
);
7082 *non_constant_p
= true;
7086 internal_error ("unexpected expression %qE of kind %s", t
,
7087 tree_code_name
[TREE_CODE (t
)]);
7088 *non_constant_p
= true;
7092 if (r
== error_mark_node
)
7093 *non_constant_p
= true;
7095 if (*non_constant_p
)
7102 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
7104 bool non_constant_p
= false;
7105 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
7106 false, &non_constant_p
);
7108 verify_constant (r
, allow_non_constant
, &non_constant_p
);
7110 if (non_constant_p
&& !allow_non_constant
)
7111 return error_mark_node
;
7112 else if (non_constant_p
&& TREE_CONSTANT (t
))
7114 /* This isn't actually constant, so unset TREE_CONSTANT. */
7115 if (EXPR_P (t
) || TREE_CODE (t
) == CONSTRUCTOR
)
7118 r
= build_nop (TREE_TYPE (t
), t
);
7119 TREE_CONSTANT (r
) = false;
7122 else if (non_constant_p
|| r
== t
)
7124 else if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
7126 if (TREE_CODE (t
) == TARGET_EXPR
7127 && TARGET_EXPR_INITIAL (t
) == r
)
7131 r
= get_target_expr (r
);
7132 TREE_CONSTANT (r
) = true;
7140 /* Returns true if T is a valid subexpression of a constant expression,
7141 even if it isn't itself a constant expression. */
7144 is_sub_constant_expr (tree t
)
7146 bool non_constant_p
= false;
7147 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
);
7148 return !non_constant_p
;
7151 /* If T represents a constant expression returns its reduced value.
7152 Otherwise return error_mark_node. If T is dependent, then
7156 cxx_constant_value (tree t
)
7158 return cxx_eval_outermost_constant_expr (t
, false);
7161 /* If T is a constant expression, returns its reduced value.
7162 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7163 Otherwise, returns a version of T without TREE_CONSTANT. */
7166 maybe_constant_value (tree t
)
7170 if (type_dependent_expression_p (t
)
7171 || type_unknown_p (t
)
7172 || !potential_constant_expression (t
)
7173 || value_dependent_expression_p (t
))
7176 r
= cxx_eval_outermost_constant_expr (t
, true);
7177 #ifdef ENABLE_CHECKING
7178 /* cp_tree_equal looks through NOPs, so allow them. */
7180 || CONVERT_EXPR_P (t
)
7181 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
7182 || !cp_tree_equal (r
, t
));
7187 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7188 than wrapped in a TARGET_EXPR. */
7191 maybe_constant_init (tree t
)
7193 t
= maybe_constant_value (t
);
7194 if (TREE_CODE (t
) == TARGET_EXPR
)
7196 tree init
= TARGET_EXPR_INITIAL (t
);
7197 if (TREE_CODE (init
) == CONSTRUCTOR
7198 && TREE_CONSTANT (init
))
7205 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7206 /* Return true if the object referred to by REF has automatic or thread
7209 enum { ck_ok
, ck_bad
, ck_unknown
};
7211 check_automatic_or_tls (tree ref
)
7213 enum machine_mode mode
;
7214 HOST_WIDE_INT bitsize
, bitpos
;
7216 int volatilep
= 0, unsignedp
= 0;
7217 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
7218 &mode
, &unsignedp
, &volatilep
, false);
7221 /* If there isn't a decl in the middle, we don't know the linkage here,
7222 and this isn't a constant expression anyway. */
7225 dk
= decl_storage_duration (decl
);
7226 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
7230 /* Return true if the DECL designates a builtin function that is
7231 morally constexpr, in the sense that its parameter types and
7232 return type are literal types and the compiler is allowed to
7233 fold its invocations. */
7236 morally_constexpr_builtin_function_p (tree decl
)
7238 tree funtype
= TREE_TYPE (decl
);
7241 if (!is_builtin_fn (decl
))
7243 if (!literal_type_p (TREE_TYPE (funtype
)))
7245 for (t
= TYPE_ARG_TYPES (funtype
); t
!= NULL
; t
= TREE_CHAIN (t
))
7247 if (t
== void_list_node
)
7249 if (!literal_type_p (TREE_VALUE (t
)))
7252 /* We assume no varargs builtins are suitable. */
7256 /* Return true if T denotes a potentially constant expression. Issue
7257 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7258 an lvalue-rvalue conversion is implied.
7260 C++0x [expr.const] used to say
7262 6 An expression is a potential constant expression if it is
7263 a constant expression where all occurences of function
7264 parameters are replaced by arbitrary constant expressions
7265 of the appropriate type.
7267 2 A conditional expression is a constant expression unless it
7268 involves one of the following as a potentially evaluated
7269 subexpression (3.2), but subexpressions of logical AND (5.14),
7270 logical OR (5.15), and conditional (5.16) operations that are
7271 not evaluated are not considered. */
7274 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
7276 enum { any
= false, rval
= true };
7280 /* C++98 has different rules for the form of a constant expression that
7281 are enforced in the parser, so we can assume that anything that gets
7282 this far is suitable. */
7283 if (cxx_dialect
< cxx0x
)
7286 if (t
== error_mark_node
)
7290 if (TREE_THIS_VOLATILE (t
))
7292 if (flags
& tf_error
)
7293 error ("expression %qE has side-effects", t
);
7296 if (CONSTANT_CLASS_P (t
))
7298 if (TREE_OVERFLOW (t
))
7300 if (flags
& tf_error
)
7302 permerror (EXPR_LOC_OR_HERE (t
),
7303 "overflow in constant expression");
7304 if (flag_permissive
)
7312 switch (TREE_CODE (t
))
7318 case TEMPLATE_ID_EXPR
:
7325 case TEMPLATE_PARM_INDEX
:
7327 case IDENTIFIER_NODE
:
7331 /* -- this (5.1) unless it appears as the postfix-expression in a
7332 class member access expression, including the result of the
7333 implicit transformation in the body of the non-static
7334 member function (9.3.1); */
7335 if (is_this_parameter (t
))
7337 if (flags
& tf_error
)
7338 error ("%qE is not a potential constant expression", t
);
7343 case AGGR_INIT_EXPR
:
7345 /* -- an invocation of a function other than a constexpr function
7346 or a constexpr constructor. */
7348 tree fun
= get_function_named_in_call (t
);
7349 const int nargs
= call_expr_nargs (t
);
7350 if (TREE_CODE (fun
) != FUNCTION_DECL
)
7352 if (potential_constant_expression_1 (fun
, rval
, flags
))
7353 /* Might end up being a constant function pointer. */
7355 if (flags
& tf_error
)
7356 error ("%qE is not a function name", fun
);
7359 /* Skip initial arguments to base constructors. */
7360 if (DECL_BASE_CONSTRUCTOR_P (fun
))
7361 i
= num_artificial_parms_for (fun
);
7364 fun
= DECL_ORIGIN (fun
);
7365 if (builtin_valid_in_constant_expr_p (fun
))
7367 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
7368 && !morally_constexpr_builtin_function_p (fun
))
7370 if (flags
& tf_error
)
7371 error ("%qD is not %<constexpr%>", fun
);
7374 for (; i
< nargs
; ++i
)
7376 tree x
= get_nth_callarg (t
, i
);
7377 /* A call to a non-static member function takes the
7378 address of the object as the first argument.
7379 But in a constant expression the address will be folded
7380 away, so look through it now. */
7381 if (i
== 0 && DECL_NONSTATIC_MEMBER_P (fun
)
7382 && !DECL_CONSTRUCTOR_P (fun
))
7384 if (is_this_parameter (x
))
7386 else if (!potential_constant_expression_1 (x
, rval
, flags
))
7388 if (flags
& tf_error
)
7389 error ("object argument is not a potential constant "
7394 else if (!potential_constant_expression_1 (x
, rval
, flags
))
7396 if (flags
& tf_error
)
7397 error ("argument in position %qP is not a "
7398 "potential constant expression", i
);
7405 case NON_LVALUE_EXPR
:
7406 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7407 -- an lvalue of integral type that refers to a non-volatile
7408 const variable or static data member initialized with
7409 constant expressions, or
7411 -- an lvalue of literal type that refers to non-volatile
7412 object defined with constexpr, or that refers to a
7413 sub-object of such an object; */
7414 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7417 if (want_rval
&& !decl_constant_var_p (t
)
7418 && !dependent_type_p (TREE_TYPE (t
)))
7420 if (flags
& tf_error
)
7421 non_const_var_error (t
);
7428 case VIEW_CONVERT_EXPR
:
7429 /* -- an array-to-pointer conversion that is applied to an lvalue
7430 that designates an object with thread or automatic storage
7431 duration; FIXME not implemented as it breaks constexpr arrays;
7432 need to fix the standard
7433 -- a type conversion from a pointer or pointer-to-member type
7434 to a literal type. */
7436 tree from
= TREE_OPERAND (t
, 0);
7437 tree source
= TREE_TYPE (from
);
7438 tree target
= TREE_TYPE (t
);
7439 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (target
)
7440 && !(TREE_CODE (from
) == COMPONENT_REF
7441 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from
, 0)))))
7443 if (flags
& tf_error
)
7444 error ("conversion of expression %qE of pointer type "
7445 "cannot yield a constant expression", from
);
7448 return (potential_constant_expression_1
7449 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
7453 /* -- a unary operator & that is applied to an lvalue that
7454 designates an object with thread or automatic storage
7456 t
= TREE_OPERAND (t
, 0);
7458 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7459 any checking here, as we might dereference the pointer later. If
7460 we remove this code, also remove check_automatic_or_tls. */
7461 i
= check_automatic_or_tls (t
);
7466 if (flags
& tf_error
)
7467 error ("address-of an object %qE with thread local or "
7468 "automatic storage is not a constant expression", t
);
7472 return potential_constant_expression_1 (t
, any
, flags
);
7478 /* -- a class member access unless its postfix-expression is
7479 of literal type or of pointer to literal type. */
7480 /* This test would be redundant, as it follows from the
7481 postfix-expression being a potential constant expression. */
7482 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7485 case EXPR_PACK_EXPANSION
:
7486 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
7491 tree x
= TREE_OPERAND (t
, 0);
7493 if (is_this_parameter (x
))
7495 return potential_constant_expression_1 (x
, rval
, flags
);
7499 case DYNAMIC_CAST_EXPR
:
7500 case PSEUDO_DTOR_EXPR
:
7501 case PREINCREMENT_EXPR
:
7502 case POSTINCREMENT_EXPR
:
7503 case PREDECREMENT_EXPR
:
7504 case POSTDECREMENT_EXPR
:
7508 case VEC_DELETE_EXPR
:
7512 /* GCC internal stuff. */
7515 case WITH_CLEANUP_EXPR
:
7516 case CLEANUP_POINT_EXPR
:
7517 case MUST_NOT_THROW_EXPR
:
7518 case TRY_CATCH_EXPR
:
7519 case STATEMENT_LIST
:
7520 /* Don't bother trying to define a subset of statement-expressions to
7521 be constant-expressions, at least for now. */
7525 if (flags
& tf_error
)
7526 error ("expression %qE is not a constant-expression", t
);
7530 /* -- a typeid expression whose operand is of polymorphic
7533 tree e
= TREE_OPERAND (t
, 0);
7534 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
7535 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
7537 if (flags
& tf_error
)
7538 error ("typeid-expression is not a constant expression "
7539 "because %qE is of polymorphic type", e
);
7546 /* -- a subtraction where both operands are pointers. */
7547 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7548 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7550 if (flags
& tf_error
)
7551 error ("difference of two pointer expressions is not "
7552 "a constant expression");
7564 /* -- a relational or equality operator where at least
7565 one of the operands is a pointer. */
7566 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7567 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7569 if (flags
& tf_error
)
7570 error ("pointer comparison expression is not a "
7571 "constant expression");
7581 case FIX_TRUNC_EXPR
:
7586 case TRUTH_NOT_EXPR
:
7587 case FIXED_CONVERT_EXPR
:
7588 case UNARY_PLUS_EXPR
:
7589 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
7593 case CONST_CAST_EXPR
:
7594 case STATIC_CAST_EXPR
:
7595 case REINTERPRET_CAST_EXPR
:
7596 return (potential_constant_expression_1
7597 (TREE_OPERAND (t
, 0),
7598 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
7601 case NON_DEPENDENT_EXPR
:
7602 /* For convenience. */
7604 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7608 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7613 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7618 VEC(constructor_elt
, gc
) *v
= CONSTRUCTOR_ELTS (t
);
7619 constructor_elt
*ce
;
7620 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
7621 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
7628 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
7629 || DECL_P (TREE_PURPOSE (t
)));
7630 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
7633 if (TREE_CHAIN (t
) == NULL_TREE
)
7635 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
7639 case TRUNC_DIV_EXPR
:
7641 case FLOOR_DIV_EXPR
:
7642 case ROUND_DIV_EXPR
:
7643 case TRUNC_MOD_EXPR
:
7645 case ROUND_MOD_EXPR
:
7647 tree denom
= TREE_OPERAND (t
, 1);
7648 /* We can't call maybe_constant_value on an expression
7649 that hasn't been through fold_non_dependent_expr yet. */
7650 if (!processing_template_decl
)
7651 denom
= maybe_constant_value (denom
);
7652 if (integer_zerop (denom
))
7654 if (flags
& tf_error
)
7655 error ("division by zero is not a constant-expression");
7667 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7668 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7669 introduced by build_call_a. */
7670 tree op0
= TREE_OPERAND (t
, 0);
7671 tree op1
= TREE_OPERAND (t
, 1);
7673 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7674 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7675 return potential_constant_expression_1 (op0
, want_rval
, flags
);
7680 /* If the first operand is the non-short-circuit constant, look at
7681 the second operand; otherwise we only care about the first one for
7683 case TRUTH_AND_EXPR
:
7684 case TRUTH_ANDIF_EXPR
:
7685 tmp
= boolean_true_node
;
7688 case TRUTH_ORIF_EXPR
:
7689 tmp
= boolean_false_node
;
7691 if (TREE_OPERAND (t
, 0) == tmp
)
7692 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
7694 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7698 case POINTER_PLUS_EXPR
:
7700 case EXACT_DIV_EXPR
:
7710 case TRUTH_XOR_EXPR
:
7721 case ARRAY_RANGE_REF
:
7725 for (i
= 0; i
< 2; ++i
)
7726 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7733 /* If the condition is a known constant, we know which of the legs we
7734 care about; otherwise we only require that the condition and
7735 either of the legs be potentially constant. */
7736 tmp
= TREE_OPERAND (t
, 0);
7737 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
7739 else if (tmp
== boolean_true_node
)
7740 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7742 else if (tmp
== boolean_false_node
)
7743 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
7745 for (i
= 1; i
< 3; ++i
)
7746 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
7747 want_rval
, tf_none
))
7749 if (flags
& tf_error
)
7750 error ("expression %qE is not a constant-expression", t
);
7754 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
7756 if (flags
& tf_error
)
7758 error ("non-constant array initialization");
7759 diagnose_non_constexpr_vec_init (t
);
7764 sorry ("unexpected ast of kind %s", tree_code_name
[TREE_CODE (t
)]);
7770 /* The main entry point to the above. */
7773 potential_constant_expression (tree t
)
7775 return potential_constant_expression_1 (t
, false, tf_none
);
7778 /* As above, but require a constant rvalue. */
7781 potential_rvalue_constant_expression (tree t
)
7783 return potential_constant_expression_1 (t
, true, tf_none
);
7786 /* Like above, but complain about non-constant expressions. */
7789 require_potential_constant_expression (tree t
)
7791 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
7794 /* Cross product of the above. */
7797 require_potential_rvalue_constant_expression (tree t
)
7799 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
7802 /* Constructor for a lambda expression. */
7805 build_lambda_expr (void)
7807 tree lambda
= make_node (LAMBDA_EXPR
);
7808 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
7809 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
7810 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
7811 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
7812 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
7816 /* Create the closure object for a LAMBDA_EXPR. */
7819 build_lambda_object (tree lambda_expr
)
7821 /* Build aggregate constructor call.
7822 - cp_parser_braced_list
7823 - cp_parser_functional_cast */
7824 VEC(constructor_elt
,gc
) *elts
= NULL
;
7825 tree node
, expr
, type
;
7826 location_t saved_loc
;
7828 if (processing_template_decl
)
7831 /* Make sure any error messages refer to the lambda-introducer. */
7832 saved_loc
= input_location
;
7833 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
7835 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
7837 node
= TREE_CHAIN (node
))
7839 tree field
= TREE_PURPOSE (node
);
7840 tree val
= TREE_VALUE (node
);
7842 if (field
== error_mark_node
)
7844 expr
= error_mark_node
;
7851 /* Mere mortals can't copy arrays with aggregate initialization, so
7852 do some magic to make it work here. */
7853 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
7854 val
= build_array_copy (val
);
7855 else if (DECL_NORMAL_CAPTURE_P (field
)
7856 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
7858 /* "the entities that are captured by copy are used to
7859 direct-initialize each corresponding non-static data
7860 member of the resulting closure object."
7862 There's normally no way to express direct-initialization
7863 from an element of a CONSTRUCTOR, so we build up a special
7864 TARGET_EXPR to bypass the usual copy-initialization. */
7865 val
= force_rvalue (val
);
7866 if (TREE_CODE (val
) == TARGET_EXPR
)
7867 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
7870 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
7873 expr
= build_constructor (init_list_type_node
, elts
);
7874 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
7876 /* N2927: "[The closure] class type is not an aggregate."
7877 But we briefly treat it as an aggregate to make this simpler. */
7878 type
= TREE_TYPE (lambda_expr
);
7879 CLASSTYPE_NON_AGGREGATE (type
) = 0;
7880 expr
= finish_compound_literal (type
, expr
);
7881 CLASSTYPE_NON_AGGREGATE (type
) = 1;
7884 input_location
= saved_loc
;
7888 /* Return an initialized RECORD_TYPE for LAMBDA.
7889 LAMBDA must have its explicit captures already. */
7892 begin_lambda_type (tree lambda
)
7897 /* Unique name. This is just like an unnamed class, but we cannot use
7898 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
7900 name
= make_lambda_name ();
7902 /* Create the new RECORD_TYPE for this lambda. */
7903 type
= xref_tag (/*tag_code=*/record_type
,
7905 /*scope=*/ts_within_enclosing_non_class
,
7906 /*template_header_p=*/false);
7909 /* Designate it as a struct so that we can use aggregate initialization. */
7910 CLASSTYPE_DECLARED_CLASS (type
) = false;
7912 /* Clear base types. */
7913 xref_basetypes (type
, /*bases=*/NULL_TREE
);
7915 /* Start the class. */
7916 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
7918 /* Cross-reference the expression and the type. */
7919 TREE_TYPE (lambda
) = type
;
7920 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
7925 /* Returns the type to use for the return type of the operator() of a
7929 lambda_return_type (tree expr
)
7932 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7934 warning (0, "cannot deduce lambda return type from a braced-init-list");
7935 return void_type_node
;
7937 if (type_dependent_expression_p (expr
))
7939 type
= cxx_make_type (DECLTYPE_TYPE
);
7940 DECLTYPE_TYPE_EXPR (type
) = expr
;
7941 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
7942 SET_TYPE_STRUCTURAL_EQUALITY (type
);
7945 type
= type_decays_to (unlowered_expr_type (expr
));
7949 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
7953 lambda_function (tree lambda
)
7956 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
7957 type
= TREE_TYPE (lambda
);
7960 gcc_assert (LAMBDA_TYPE_P (type
));
7961 /* Don't let debug_tree cause instantiation. */
7962 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
7964 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
7965 /*protect=*/0, /*want_type=*/false);
7967 lambda
= BASELINK_FUNCTIONS (lambda
);
7971 /* Returns the type to use for the FIELD_DECL corresponding to the
7973 The caller should add REFERENCE_TYPE for capture by reference. */
7976 lambda_capture_field_type (tree expr
)
7979 if (type_dependent_expression_p (expr
))
7981 type
= cxx_make_type (DECLTYPE_TYPE
);
7982 DECLTYPE_TYPE_EXPR (type
) = expr
;
7983 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
7984 SET_TYPE_STRUCTURAL_EQUALITY (type
);
7987 type
= non_reference (unlowered_expr_type (expr
));
7991 /* Recompute the return type for LAMBDA with body of the form:
7992 { return EXPR ; } */
7995 apply_lambda_return_type (tree lambda
, tree return_type
)
7997 tree fco
= lambda_function (lambda
);
8000 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
8002 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
8003 it would interfere with instantiating the closure type. */
8004 if (dependent_type_p (return_type
))
8006 if (return_type
== error_mark_node
)
8009 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8010 TREE_TYPE (METHOD_TYPE) == return-type */
8011 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
8013 result
= DECL_RESULT (fco
);
8014 if (result
== NULL_TREE
)
8017 /* We already have a DECL_RESULT from start_preparsed_function.
8018 Now we need to redo the work it and allocate_struct_function
8019 did to reflect the new type. */
8020 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
8021 TYPE_MAIN_VARIANT (return_type
));
8022 DECL_ARTIFICIAL (result
) = 1;
8023 DECL_IGNORED_P (result
) = 1;
8024 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
8027 DECL_RESULT (fco
) = result
;
8029 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
8031 #ifdef PCC_STATIC_STRUCT_RETURN
8032 cfun
->returns_pcc_struct
= 1;
8034 cfun
->returns_struct
= 1;
8039 /* DECL is a local variable or parameter from the surrounding scope of a
8040 lambda-expression. Returns the decltype for a use of the capture field
8041 for DECL even if it hasn't been captured yet. */
8044 capture_decltype (tree decl
)
8046 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8047 /* FIXME do lookup instead of list walk? */
8048 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
8052 type
= TREE_TYPE (TREE_PURPOSE (cap
));
8054 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
8057 error ("%qD is not captured", decl
);
8058 return error_mark_node
;
8061 type
= TREE_TYPE (decl
);
8062 if (TREE_CODE (type
) == REFERENCE_TYPE
8063 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
8064 type
= TREE_TYPE (type
);
8067 case CPLD_REFERENCE
:
8068 type
= TREE_TYPE (decl
);
8069 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8070 type
= build_reference_type (TREE_TYPE (decl
));
8077 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8079 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
8080 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
8082 type
= build_reference_type (type
);
8087 /* From an ID and INITIALIZER, create a capture (by reference if
8088 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8092 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
8093 bool explicit_init_p
)
8098 type
= lambda_capture_field_type (initializer
);
8101 type
= build_reference_type (type
);
8102 if (!real_lvalue_p (initializer
))
8103 error ("cannot capture %qE by reference", initializer
);
8106 /* Make member variable. */
8107 member
= build_lang_decl (FIELD_DECL
, id
, type
);
8108 if (!explicit_init_p
)
8109 /* Normal captures are invisible to name lookup but uses are replaced
8110 with references to the capture field; we implement this by only
8111 really making them invisible in unevaluated context; see
8112 qualify_lookup. For now, let's make explicitly initialized captures
8114 DECL_NORMAL_CAPTURE_P (member
) = true;
8116 /* Add it to the appropriate closure class if we've started it. */
8117 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
8118 finish_member_declaration (member
);
8120 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
8121 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
8123 if (id
== get_identifier ("__this"))
8125 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
8126 error ("already captured %<this%> in lambda expression");
8127 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
8133 /* Register all the capture members on the list CAPTURES, which is the
8134 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8136 void register_capture_members (tree captures
)
8140 register_capture_members (TREE_CHAIN (captures
));
8141 finish_member_declaration (TREE_PURPOSE (captures
));
8145 /* Given a FIELD_DECL decl belonging to a closure type, return a
8146 COMPONENT_REF of it relative to the 'this' parameter of the op() for
8150 thisify_lambda_field (tree decl
)
8152 tree context
= lambda_function (DECL_CONTEXT (decl
));
8153 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
8155 tf_warning_or_error
);
8156 return finish_non_static_data_member (decl
, object
,
8157 /*qualifying_scope*/NULL_TREE
);
8160 /* Similar to add_capture, except this works on a stack of nested lambdas.
8161 BY_REFERENCE_P in this case is derived from the default capture mode.
8162 Returns the capture for the lambda at the bottom of the stack. */
8165 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
8167 bool this_capture_p
= (id
== get_identifier ("__this"));
8169 tree member
= NULL_TREE
;
8171 tree saved_class_type
= current_class_type
;
8175 for (node
= lambda_stack
;
8177 node
= TREE_CHAIN (node
))
8179 tree lambda
= TREE_VALUE (node
);
8181 current_class_type
= TREE_TYPE (lambda
);
8182 member
= add_capture (lambda
,
8187 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
8188 == CPLD_REFERENCE
)),
8189 /*explicit_init_p=*/false);
8190 initializer
= thisify_lambda_field (member
);
8193 current_class_type
= saved_class_type
;
8198 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8199 INDIRECT_REF, possibly adding it through default capturing. */
8202 lambda_expr_this_capture (tree lambda
)
8206 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8208 /* Try to default capture 'this' if we can. */
8210 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
8212 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
8213 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
8214 tree init
= NULL_TREE
;
8216 /* If we are in a lambda function, we can move out until we hit:
8217 1. a non-lambda function,
8218 2. a lambda function capturing 'this', or
8219 3. a non-default capturing lambda function. */
8220 while (LAMBDA_FUNCTION_P (containing_function
))
8223 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
8225 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
8227 /* An outer lambda has already captured 'this'. */
8228 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8229 init
= thisify_lambda_field (cap
);
8233 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
8234 /* An outer lambda won't let us capture 'this'. */
8237 lambda_stack
= tree_cons (NULL_TREE
,
8241 containing_function
= decl_function_context (containing_function
);
8244 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
8245 && !LAMBDA_FUNCTION_P (containing_function
))
8246 /* First parameter is 'this'. */
8247 init
= DECL_ARGUMENTS (containing_function
);
8250 this_capture
= add_default_capture (lambda_stack
,
8251 /*id=*/get_identifier ("__this"),
8257 error ("%<this%> was not captured for this lambda function");
8258 result
= error_mark_node
;
8262 /* To make sure that current_class_ref is for the lambda. */
8263 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
8265 result
= finish_non_static_data_member (this_capture
,
8267 /*qualifying_scope=*/NULL_TREE
);
8269 /* If 'this' is captured, each use of 'this' is transformed into an
8270 access to the corresponding unnamed data member of the closure
8271 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8272 ensures that the transformed expression is an rvalue. ] */
8273 result
= rvalue (result
);
8279 /* Returns the method basetype of the innermost non-lambda function, or
8280 NULL_TREE if none. */
8283 nonlambda_method_basetype (void)
8286 if (!current_class_ref
)
8289 type
= current_class_type
;
8290 if (!LAMBDA_TYPE_P (type
))
8293 /* Find the nearest enclosing non-lambda function. */
8294 fn
= TYPE_NAME (type
);
8296 fn
= decl_function_context (fn
);
8297 while (fn
&& LAMBDA_FUNCTION_P (fn
));
8299 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
8302 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
8305 /* If the closure TYPE has a static op(), also add a conversion to function
8309 maybe_add_lambda_conv_op (tree type
)
8311 bool nested
= (current_function_decl
!= NULL_TREE
);
8312 tree callop
= lambda_function (type
);
8313 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
8314 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
8315 VEC (tree
, gc
) *argvec
;
8317 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
8320 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
8321 FUNCTION_ARG_CHAIN (callop
));
8323 /* First build up the conversion op. */
8325 rettype
= build_pointer_type (stattype
);
8326 name
= mangle_conv_op_name_for_type (rettype
);
8327 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
8328 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
8329 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
8330 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8332 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8333 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8334 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8336 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
8337 grokclassfn (type
, fn
, NO_SPECIAL
);
8338 set_linkage_according_to_type (type
, fn
);
8339 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8340 DECL_IN_AGGR_P (fn
) = 1;
8341 DECL_ARTIFICIAL (fn
) = 1;
8342 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8343 DECL_DECLARED_INLINE_P (fn
) = 1;
8344 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
8346 DECL_INTERFACE_KNOWN (fn
) = 1;
8348 add_method (type
, fn
, NULL_TREE
);
8350 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8351 the conversion op is used. */
8352 if (varargs_function_p (callop
))
8354 DECL_DELETED_FN (fn
) = 1;
8358 /* Now build up the thunk to be returned. */
8360 name
= get_identifier ("_FUN");
8361 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
8362 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8363 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8364 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8365 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8366 grokclassfn (type
, fn
, NO_SPECIAL
);
8367 set_linkage_according_to_type (type
, fn
);
8368 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8369 DECL_IN_AGGR_P (fn
) = 1;
8370 DECL_ARTIFICIAL (fn
) = 1;
8371 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8372 DECL_DECLARED_INLINE_P (fn
) = 1;
8373 DECL_STATIC_FUNCTION_P (fn
) = 1;
8374 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
8375 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
8376 DECL_CONTEXT (arg
) = fn
;
8378 DECL_INTERFACE_KNOWN (fn
) = 1;
8380 add_method (type
, fn
, NULL_TREE
);
8383 push_function_context ();
8385 /* Generate the body of the thunk. */
8387 start_preparsed_function (statfn
, NULL_TREE
,
8388 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8389 if (DECL_ONE_ONLY (statfn
))
8391 /* Put the thunk in the same comdat group as the call op. */
8392 struct cgraph_node
*callop_node
, *thunk_node
;
8393 DECL_COMDAT_GROUP (statfn
) = DECL_COMDAT_GROUP (callop
);
8394 callop_node
= cgraph_node (callop
);
8395 thunk_node
= cgraph_node (statfn
);
8396 gcc_assert (callop_node
->same_comdat_group
== NULL
);
8397 gcc_assert (thunk_node
->same_comdat_group
== NULL
);
8398 callop_node
->same_comdat_group
= thunk_node
;
8399 thunk_node
->same_comdat_group
= callop_node
;
8401 body
= begin_function_body ();
8402 compound_stmt
= begin_compound_stmt (0);
8404 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
8406 argvec
= make_tree_vector ();
8407 VEC_quick_push (tree
, argvec
, arg
);
8408 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
8409 VEC_safe_push (tree
, gc
, argvec
, arg
);
8410 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
8411 VEC_address (tree
, argvec
));
8412 CALL_FROM_THUNK_P (call
) = 1;
8413 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
8414 call
= build_cplus_new (TREE_TYPE (call
), call
);
8415 call
= convert_from_reference (call
);
8416 finish_return_stmt (call
);
8418 finish_compound_stmt (compound_stmt
);
8419 finish_function_body (body
);
8421 expand_or_defer_fn (finish_function (2));
8423 /* Generate the body of the conversion op. */
8425 start_preparsed_function (convfn
, NULL_TREE
,
8426 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8427 body
= begin_function_body ();
8428 compound_stmt
= begin_compound_stmt (0);
8430 finish_return_stmt (decay_conversion (statfn
));
8432 finish_compound_stmt (compound_stmt
);
8433 finish_function_body (body
);
8435 expand_or_defer_fn (finish_function (2));
8438 pop_function_context ();
8440 #include "gt-cp-semantics.h"