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
);
59 /* Deferred Access Checking Overview
60 ---------------------------------
62 Most C++ expressions and declarations require access checking
63 to be performed during parsing. However, in several cases,
64 this has to be treated differently.
66 For member declarations, access checking has to be deferred
67 until more information about the declaration is known. For
79 When we are parsing the function return type `A::X', we don't
80 really know if this is allowed until we parse the function name.
82 Furthermore, some contexts require that access checking is
83 never performed at all. These include class heads, and template
86 Typical use of access checking functions is described here:
88 1. When we enter a context that requires certain access checking
89 mode, the function `push_deferring_access_checks' is called with
90 DEFERRING argument specifying the desired mode. Access checking
91 may be performed immediately (dk_no_deferred), deferred
92 (dk_deferred), or not performed (dk_no_check).
94 2. When a declaration such as a type, or a variable, is encountered,
95 the function `perform_or_defer_access_check' is called. It
96 maintains a VEC of all deferred checks.
98 3. The global `current_class_type' or `current_function_decl' is then
99 setup by the parser. `enforce_access' relies on these information
102 4. Upon exiting the context mentioned in step 1,
103 `perform_deferred_access_checks' is called to check all declaration
104 stored in the VEC. `pop_deferring_access_checks' is then
105 called to restore the previous access checking mode.
107 In case of parsing error, we simply call `pop_deferring_access_checks'
108 without `perform_deferred_access_checks'. */
110 typedef struct GTY(()) deferred_access
{
111 /* A VEC representing name-lookups for which we have deferred
112 checking access controls. We cannot check the accessibility of
113 names used in a decl-specifier-seq until we know what is being
114 declared because code like:
121 A::B* A::f() { return 0; }
123 is valid, even though `A::B' is not generally accessible. */
124 VEC (deferred_access_check
,gc
)* GTY(()) deferred_access_checks
;
126 /* The current mode of access checks. */
127 enum deferring_kind deferring_access_checks_kind
;
130 DEF_VEC_O (deferred_access
);
131 DEF_VEC_ALLOC_O (deferred_access
,gc
);
133 /* Data for deferred access checking. */
134 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
135 static GTY(()) unsigned deferred_access_no_check
;
137 /* Save the current deferred access states and start deferred
138 access checking iff DEFER_P is true. */
141 push_deferring_access_checks (deferring_kind deferring
)
143 /* For context like template instantiation, access checking
144 disabling applies to all nested context. */
145 if (deferred_access_no_check
|| deferring
== dk_no_check
)
146 deferred_access_no_check
++;
149 deferred_access
*ptr
;
151 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
152 ptr
->deferred_access_checks
= NULL
;
153 ptr
->deferring_access_checks_kind
= deferring
;
157 /* Resume deferring access checks again after we stopped doing
161 resume_deferring_access_checks (void)
163 if (!deferred_access_no_check
)
164 VEC_last (deferred_access
, deferred_access_stack
)
165 ->deferring_access_checks_kind
= dk_deferred
;
168 /* Stop deferring access checks. */
171 stop_deferring_access_checks (void)
173 if (!deferred_access_no_check
)
174 VEC_last (deferred_access
, deferred_access_stack
)
175 ->deferring_access_checks_kind
= dk_no_deferred
;
178 /* Discard the current deferred access checks and restore the
182 pop_deferring_access_checks (void)
184 if (deferred_access_no_check
)
185 deferred_access_no_check
--;
187 VEC_pop (deferred_access
, deferred_access_stack
);
190 /* Returns a TREE_LIST representing the deferred checks.
191 The TREE_PURPOSE of each node is the type through which the
192 access occurred; the TREE_VALUE is the declaration named.
195 VEC (deferred_access_check
,gc
)*
196 get_deferred_access_checks (void)
198 if (deferred_access_no_check
)
201 return (VEC_last (deferred_access
, deferred_access_stack
)
202 ->deferred_access_checks
);
205 /* Take current deferred checks and combine with the
206 previous states if we also defer checks previously.
207 Otherwise perform checks now. */
210 pop_to_parent_deferring_access_checks (void)
212 if (deferred_access_no_check
)
213 deferred_access_no_check
--;
216 VEC (deferred_access_check
,gc
) *checks
;
217 deferred_access
*ptr
;
219 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
220 ->deferred_access_checks
);
222 VEC_pop (deferred_access
, deferred_access_stack
);
223 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
224 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
227 perform_access_checks (checks
);
231 /* Merge with parent. */
233 deferred_access_check
*chk
, *probe
;
235 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
237 FOR_EACH_VEC_ELT (deferred_access_check
,
238 ptr
->deferred_access_checks
, j
, probe
)
240 if (probe
->binfo
== chk
->binfo
&&
241 probe
->decl
== chk
->decl
&&
242 probe
->diag_decl
== chk
->diag_decl
)
245 /* Insert into parent's checks. */
246 VEC_safe_push (deferred_access_check
, gc
,
247 ptr
->deferred_access_checks
, chk
);
254 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
255 is the BINFO indicating the qualifying scope used to access the
256 DECL node stored in the TREE_VALUE of the node. */
259 perform_access_checks (VEC (deferred_access_check
,gc
)* checks
)
262 deferred_access_check
*chk
;
267 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
268 enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
);
271 /* Perform the deferred access checks.
273 After performing the checks, we still have to keep the list
274 `deferred_access_stack->deferred_access_checks' since we may want
275 to check access for them again later in a different context.
282 A::X A::a, x; // No error for `A::a', error for `x'
284 We have to perform deferred access of `A::X', first with `A::a',
288 perform_deferred_access_checks (void)
290 perform_access_checks (get_deferred_access_checks ());
293 /* Defer checking the accessibility of DECL, when looked up in
294 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
297 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
)
300 deferred_access
*ptr
;
301 deferred_access_check
*chk
;
302 deferred_access_check
*new_access
;
305 /* Exit if we are in a context that no access checking is performed.
307 if (deferred_access_no_check
)
310 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
312 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
314 /* If we are not supposed to defer access checks, just check now. */
315 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
317 enforce_access (binfo
, decl
, diag_decl
);
321 /* See if we are already going to perform this check. */
322 FOR_EACH_VEC_ELT (deferred_access_check
,
323 ptr
->deferred_access_checks
, i
, chk
)
325 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
326 chk
->diag_decl
== diag_decl
)
331 /* If not, record the check. */
333 VEC_safe_push (deferred_access_check
, gc
,
334 ptr
->deferred_access_checks
, 0);
335 new_access
->binfo
= binfo
;
336 new_access
->decl
= decl
;
337 new_access
->diag_decl
= diag_decl
;
340 /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL
341 is accessible in BINFO, and possibly complain if not. If we're not
342 checking access, everything is accessible. */
345 speculative_access_check (tree binfo
, tree decl
, tree diag_decl
,
348 if (deferred_access_no_check
)
351 /* If we're checking for implicit delete, we don't want access
353 if (!accessible_p (binfo
, decl
, true))
355 /* Unless we're under maybe_explain_implicit_delete. */
357 enforce_access (binfo
, decl
, diag_decl
);
364 /* Returns nonzero if the current statement is a full expression,
365 i.e. temporaries created during that statement should be destroyed
366 at the end of the statement. */
369 stmts_are_full_exprs_p (void)
371 return current_stmt_tree ()->stmts_are_full_exprs_p
;
374 /* T is a statement. Add it to the statement-tree. This is the C++
375 version. The C/ObjC frontends have a slightly different version of
381 enum tree_code code
= TREE_CODE (t
);
383 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
385 if (!EXPR_HAS_LOCATION (t
))
386 SET_EXPR_LOCATION (t
, input_location
);
388 /* When we expand a statement-tree, we must know whether or not the
389 statements are full-expressions. We record that fact here. */
390 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
393 /* Add T to the statement-tree. Non-side-effect statements need to be
394 recorded during statement expressions. */
395 gcc_checking_assert (!VEC_empty (tree
, stmt_list_stack
));
396 append_to_statement_list_force (t
, &cur_stmt_list
);
401 /* Returns the stmt_tree to which statements are currently being added. */
404 current_stmt_tree (void)
407 ? &cfun
->language
->base
.x_stmt_tree
408 : &scope_chain
->x_stmt_tree
);
411 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
414 maybe_cleanup_point_expr (tree expr
)
416 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
417 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
421 /* Like maybe_cleanup_point_expr except have the type of the new expression be
422 void so we don't need to create a temporary variable to hold the inner
423 expression. The reason why we do this is because the original type might be
424 an aggregate and we cannot create a temporary variable for that type. */
427 maybe_cleanup_point_expr_void (tree expr
)
429 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
430 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
436 /* Create a declaration statement for the declaration given by the DECL. */
439 add_decl_expr (tree decl
)
441 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
442 if (DECL_INITIAL (decl
)
443 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
444 r
= maybe_cleanup_point_expr_void (r
);
448 /* Finish a scope. */
451 do_poplevel (tree stmt_list
)
455 if (stmts_are_full_exprs_p ())
456 block
= poplevel (kept_level_p (), 1, 0);
458 stmt_list
= pop_stmt_list (stmt_list
);
460 if (!processing_template_decl
)
462 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
463 /* ??? See c_end_compound_stmt re statement expressions. */
469 /* Begin a new scope. */
472 do_pushlevel (scope_kind sk
)
474 tree ret
= push_stmt_list ();
475 if (stmts_are_full_exprs_p ())
476 begin_scope (sk
, NULL
);
480 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
481 when the current scope is exited. EH_ONLY is true when this is not
482 meant to apply to normal control flow transfer. */
485 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
487 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
488 CLEANUP_EH_ONLY (stmt
) = eh_only
;
490 CLEANUP_BODY (stmt
) = push_stmt_list ();
493 /* Begin a conditional that might contain a declaration. When generating
494 normal code, we want the declaration to appear before the statement
495 containing the conditional. When generating template code, we want the
496 conditional to be rendered as the raw DECL_EXPR. */
499 begin_cond (tree
*cond_p
)
501 if (processing_template_decl
)
502 *cond_p
= push_stmt_list ();
505 /* Finish such a conditional. */
508 finish_cond (tree
*cond_p
, tree expr
)
510 if (processing_template_decl
)
512 tree cond
= pop_stmt_list (*cond_p
);
513 if (TREE_CODE (cond
) == DECL_EXPR
)
516 if (check_for_bare_parameter_packs (expr
))
517 *cond_p
= error_mark_node
;
522 /* If *COND_P specifies a conditional with a declaration, transform the
525 for (; A x = 42;) { }
527 while (true) { A x = 42; if (!x) break; }
528 for (;;) { A x = 42; if (!x) break; }
529 The statement list for BODY will be empty if the conditional did
530 not declare anything. */
533 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
537 if (!TREE_SIDE_EFFECTS (body
))
541 *cond_p
= boolean_true_node
;
543 if_stmt
= begin_if_stmt ();
544 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
545 finish_if_stmt_cond (cond
, if_stmt
);
546 finish_break_stmt ();
547 finish_then_clause (if_stmt
);
548 finish_if_stmt (if_stmt
);
551 /* Finish a goto-statement. */
554 finish_goto_stmt (tree destination
)
556 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
557 destination
= lookup_label (destination
);
559 /* We warn about unused labels with -Wunused. That means we have to
560 mark the used labels as used. */
561 if (TREE_CODE (destination
) == LABEL_DECL
)
562 TREE_USED (destination
) = 1;
565 destination
= mark_rvalue_use (destination
);
566 if (!processing_template_decl
)
568 destination
= cp_convert (ptr_type_node
, destination
);
569 if (error_operand_p (destination
))
574 check_goto (destination
);
576 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
579 /* COND is the condition-expression for an if, while, etc.,
580 statement. Convert it to a boolean value, if appropriate.
581 In addition, verify sequence points if -Wsequence-point is enabled. */
584 maybe_convert_cond (tree cond
)
586 /* Empty conditions remain empty. */
590 /* Wait until we instantiate templates before doing conversion. */
591 if (processing_template_decl
)
594 if (warn_sequence_point
)
595 verify_sequence_points (cond
);
597 /* Do the conversion. */
598 cond
= convert_from_reference (cond
);
600 if (TREE_CODE (cond
) == MODIFY_EXPR
601 && !TREE_NO_WARNING (cond
)
604 warning (OPT_Wparentheses
,
605 "suggest parentheses around assignment used as truth value");
606 TREE_NO_WARNING (cond
) = 1;
609 return condition_conversion (cond
);
612 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
615 finish_expr_stmt (tree expr
)
619 if (expr
!= NULL_TREE
)
621 if (!processing_template_decl
)
623 if (warn_sequence_point
)
624 verify_sequence_points (expr
);
625 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
627 else if (!type_dependent_expression_p (expr
))
628 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
629 tf_warning_or_error
);
631 if (check_for_bare_parameter_packs (expr
))
632 expr
= error_mark_node
;
634 /* Simplification of inner statement expressions, compound exprs,
635 etc can result in us already having an EXPR_STMT. */
636 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
638 if (TREE_CODE (expr
) != EXPR_STMT
)
639 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
640 expr
= maybe_cleanup_point_expr_void (expr
);
652 /* Begin an if-statement. Returns a newly created IF_STMT if
659 scope
= do_pushlevel (sk_cond
);
660 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
661 NULL_TREE
, NULL_TREE
, scope
);
662 begin_cond (&IF_COND (r
));
666 /* Process the COND of an if-statement, which may be given by
670 finish_if_stmt_cond (tree cond
, tree if_stmt
)
672 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
674 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
677 /* Finish the then-clause of an if-statement, which may be given by
681 finish_then_clause (tree if_stmt
)
683 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
687 /* Begin the else-clause of an if-statement. */
690 begin_else_clause (tree if_stmt
)
692 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
695 /* Finish the else-clause of an if-statement, which may be given by
699 finish_else_clause (tree if_stmt
)
701 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
704 /* Finish an if-statement. */
707 finish_if_stmt (tree if_stmt
)
709 tree scope
= IF_SCOPE (if_stmt
);
710 IF_SCOPE (if_stmt
) = NULL
;
711 add_stmt (do_poplevel (scope
));
715 /* Begin a while-statement. Returns a newly created WHILE_STMT if
719 begin_while_stmt (void)
722 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
724 WHILE_BODY (r
) = do_pushlevel (sk_block
);
725 begin_cond (&WHILE_COND (r
));
729 /* Process the COND of a while-statement, which may be given by
733 finish_while_stmt_cond (tree cond
, tree while_stmt
)
735 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
736 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
739 /* Finish a while-statement, which may be given by WHILE_STMT. */
742 finish_while_stmt (tree while_stmt
)
744 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
748 /* Begin a do-statement. Returns a newly created DO_STMT if
754 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
756 DO_BODY (r
) = push_stmt_list ();
760 /* Finish the body of a do-statement, which may be given by DO_STMT. */
763 finish_do_body (tree do_stmt
)
765 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
767 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
768 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
770 if (IS_EMPTY_STMT (body
))
771 warning (OPT_Wempty_body
,
772 "suggest explicit braces around empty body in %<do%> statement");
775 /* Finish a do-statement, which may be given by DO_STMT, and whose
776 COND is as indicated. */
779 finish_do_stmt (tree cond
, tree do_stmt
)
781 cond
= maybe_convert_cond (cond
);
782 DO_COND (do_stmt
) = cond
;
786 /* Finish a return-statement. The EXPRESSION returned, if any, is as
790 finish_return_stmt (tree expr
)
795 expr
= check_return_expr (expr
, &no_warning
);
797 if (flag_openmp
&& !check_omp_return ())
798 return error_mark_node
;
799 if (!processing_template_decl
)
801 if (warn_sequence_point
)
802 verify_sequence_points (expr
);
804 if (DECL_DESTRUCTOR_P (current_function_decl
)
805 || (DECL_CONSTRUCTOR_P (current_function_decl
)
806 && targetm
.cxx
.cdtor_returns_this ()))
808 /* Similarly, all destructors must run destructors for
809 base-classes before returning. So, all returns in a
810 destructor get sent to the DTOR_LABEL; finish_function emits
811 code to return a value there. */
812 return finish_goto_stmt (cdtor_label
);
816 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
817 TREE_NO_WARNING (r
) |= no_warning
;
818 r
= maybe_cleanup_point_expr_void (r
);
825 /* Begin the scope of a for-statement or a range-for-statement.
826 Both the returned trees are to be used in a call to
827 begin_for_stmt or begin_range_for_stmt. */
830 begin_for_scope (tree
*init
)
832 tree scope
= NULL_TREE
;
833 if (flag_new_for_scope
> 0)
834 scope
= do_pushlevel (sk_for
);
836 if (processing_template_decl
)
837 *init
= push_stmt_list ();
844 /* Begin a for-statement. Returns a new FOR_STMT.
845 SCOPE and INIT should be the return of begin_for_scope,
849 begin_for_stmt (tree scope
, tree init
)
853 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
854 NULL_TREE
, NULL_TREE
, NULL_TREE
);
856 if (scope
== NULL_TREE
)
858 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
860 scope
= begin_for_scope (&init
);
862 FOR_INIT_STMT (r
) = init
;
863 FOR_SCOPE (r
) = scope
;
868 /* Finish the for-init-statement of a for-statement, which may be
869 given by FOR_STMT. */
872 finish_for_init_stmt (tree for_stmt
)
874 if (processing_template_decl
)
875 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
877 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
878 begin_cond (&FOR_COND (for_stmt
));
881 /* Finish the COND of a for-statement, which may be given by
885 finish_for_cond (tree cond
, tree for_stmt
)
887 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
888 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
891 /* Finish the increment-EXPRESSION in a for-statement, which may be
892 given by FOR_STMT. */
895 finish_for_expr (tree expr
, tree for_stmt
)
899 /* If EXPR is an overloaded function, issue an error; there is no
900 context available to use to perform overload resolution. */
901 if (type_unknown_p (expr
))
903 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
904 expr
= error_mark_node
;
906 if (!processing_template_decl
)
908 if (warn_sequence_point
)
909 verify_sequence_points (expr
);
910 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
911 tf_warning_or_error
);
913 else if (!type_dependent_expression_p (expr
))
914 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
915 tf_warning_or_error
);
916 expr
= maybe_cleanup_point_expr_void (expr
);
917 if (check_for_bare_parameter_packs (expr
))
918 expr
= error_mark_node
;
919 FOR_EXPR (for_stmt
) = expr
;
922 /* Finish the body of a for-statement, which may be given by
923 FOR_STMT. The increment-EXPR for the loop must be
925 It can also finish RANGE_FOR_STMT. */
928 finish_for_stmt (tree for_stmt
)
930 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
931 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
933 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
935 /* Pop the scope for the body of the loop. */
936 if (flag_new_for_scope
> 0)
939 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
940 ? &RANGE_FOR_SCOPE (for_stmt
)
941 : &FOR_SCOPE (for_stmt
));
944 add_stmt (do_poplevel (scope
));
950 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
951 SCOPE and INIT should be the return of begin_for_scope,
953 To finish it call finish_for_stmt(). */
956 begin_range_for_stmt (tree scope
, tree init
)
960 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
961 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
963 if (scope
== NULL_TREE
)
965 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
967 scope
= begin_for_scope (&init
);
970 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
973 pop_stmt_list (init
);
974 RANGE_FOR_SCOPE (r
) = scope
;
979 /* Finish the head of a range-based for statement, which may
980 be given by RANGE_FOR_STMT. DECL must be the declaration
981 and EXPR must be the loop expression. */
984 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
986 RANGE_FOR_DECL (range_for_stmt
) = decl
;
987 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
988 add_stmt (range_for_stmt
);
989 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
992 /* Finish a break-statement. */
995 finish_break_stmt (void)
997 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1000 /* Finish a continue-statement. */
1003 finish_continue_stmt (void)
1005 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1008 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1012 begin_switch_stmt (void)
1016 scope
= do_pushlevel (sk_cond
);
1017 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1019 begin_cond (&SWITCH_STMT_COND (r
));
1024 /* Finish the cond of a switch-statement. */
1027 finish_switch_cond (tree cond
, tree switch_stmt
)
1029 tree orig_type
= NULL
;
1030 if (!processing_template_decl
)
1032 /* Convert the condition to an integer or enumeration type. */
1033 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1034 if (cond
== NULL_TREE
)
1036 error ("switch quantity not an integer");
1037 cond
= error_mark_node
;
1039 orig_type
= TREE_TYPE (cond
);
1040 if (cond
!= error_mark_node
)
1044 Integral promotions are performed. */
1045 cond
= perform_integral_promotions (cond
);
1046 cond
= maybe_cleanup_point_expr (cond
);
1049 if (check_for_bare_parameter_packs (cond
))
1050 cond
= error_mark_node
;
1051 else if (!processing_template_decl
&& warn_sequence_point
)
1052 verify_sequence_points (cond
);
1054 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1055 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1056 add_stmt (switch_stmt
);
1057 push_switch (switch_stmt
);
1058 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1061 /* Finish the body of a switch-statement, which may be given by
1062 SWITCH_STMT. The COND to switch on is indicated. */
1065 finish_switch_stmt (tree switch_stmt
)
1069 SWITCH_STMT_BODY (switch_stmt
) =
1070 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1074 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1075 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1076 add_stmt (do_poplevel (scope
));
1079 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1083 begin_try_block (void)
1085 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1087 TRY_STMTS (r
) = push_stmt_list ();
1091 /* Likewise, for a function-try-block. The block returned in
1092 *COMPOUND_STMT is an artificial outer scope, containing the
1093 function-try-block. */
1096 begin_function_try_block (tree
*compound_stmt
)
1099 /* This outer scope does not exist in the C++ standard, but we need
1100 a place to put __FUNCTION__ and similar variables. */
1101 *compound_stmt
= begin_compound_stmt (0);
1102 r
= begin_try_block ();
1103 FN_TRY_BLOCK_P (r
) = 1;
1107 /* Finish a try-block, which may be given by TRY_BLOCK. */
1110 finish_try_block (tree try_block
)
1112 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1113 TRY_HANDLERS (try_block
) = push_stmt_list ();
1116 /* Finish the body of a cleanup try-block, which may be given by
1120 finish_cleanup_try_block (tree try_block
)
1122 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1125 /* Finish an implicitly generated try-block, with a cleanup is given
1129 finish_cleanup (tree cleanup
, tree try_block
)
1131 TRY_HANDLERS (try_block
) = cleanup
;
1132 CLEANUP_P (try_block
) = 1;
1135 /* Likewise, for a function-try-block. */
1138 finish_function_try_block (tree try_block
)
1140 finish_try_block (try_block
);
1141 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1142 the try block, but moving it inside. */
1143 in_function_try_handler
= 1;
1146 /* Finish a handler-sequence for a try-block, which may be given by
1150 finish_handler_sequence (tree try_block
)
1152 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1153 check_handlers (TRY_HANDLERS (try_block
));
1156 /* Finish the handler-seq for a function-try-block, given by
1157 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1158 begin_function_try_block. */
1161 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1163 in_function_try_handler
= 0;
1164 finish_handler_sequence (try_block
);
1165 finish_compound_stmt (compound_stmt
);
1168 /* Begin a handler. Returns a HANDLER if appropriate. */
1171 begin_handler (void)
1175 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1178 /* Create a binding level for the eh_info and the exception object
1180 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1185 /* Finish the handler-parameters for a handler, which may be given by
1186 HANDLER. DECL is the declaration for the catch parameter, or NULL
1187 if this is a `catch (...)' clause. */
1190 finish_handler_parms (tree decl
, tree handler
)
1192 tree type
= NULL_TREE
;
1193 if (processing_template_decl
)
1197 decl
= pushdecl (decl
);
1198 decl
= push_template_decl (decl
);
1199 HANDLER_PARMS (handler
) = decl
;
1200 type
= TREE_TYPE (decl
);
1204 type
= expand_start_catch_block (decl
);
1205 HANDLER_TYPE (handler
) = type
;
1206 if (!processing_template_decl
&& type
)
1207 mark_used (eh_type_info (type
));
1210 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1211 the return value from the matching call to finish_handler_parms. */
1214 finish_handler (tree handler
)
1216 if (!processing_template_decl
)
1217 expand_end_catch_block ();
1218 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1221 /* Begin a compound statement. FLAGS contains some bits that control the
1222 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1223 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1224 block of a function. If BCS_TRY_BLOCK is set, this is the block
1225 created on behalf of a TRY statement. Returns a token to be passed to
1226 finish_compound_stmt. */
1229 begin_compound_stmt (unsigned int flags
)
1233 if (flags
& BCS_NO_SCOPE
)
1235 r
= push_stmt_list ();
1236 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1238 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1239 But, if it's a statement-expression with a scopeless block, there's
1240 nothing to keep, and we don't want to accidentally keep a block
1241 *inside* the scopeless block. */
1242 keep_next_level (false);
1245 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1247 /* When processing a template, we need to remember where the braces were,
1248 so that we can set up identical scopes when instantiating the template
1249 later. BIND_EXPR is a handy candidate for this.
1250 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1251 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1252 processing templates. */
1253 if (processing_template_decl
)
1255 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1256 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1257 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1258 TREE_SIDE_EFFECTS (r
) = 1;
1264 /* Finish a compound-statement, which is given by STMT. */
1267 finish_compound_stmt (tree stmt
)
1269 if (TREE_CODE (stmt
) == BIND_EXPR
)
1271 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1272 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1273 discard the BIND_EXPR so it can be merged with the containing
1275 if (TREE_CODE (body
) == STATEMENT_LIST
1276 && STATEMENT_LIST_HEAD (body
) == NULL
1277 && !BIND_EXPR_BODY_BLOCK (stmt
)
1278 && !BIND_EXPR_TRY_BLOCK (stmt
))
1281 BIND_EXPR_BODY (stmt
) = body
;
1283 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1284 stmt
= pop_stmt_list (stmt
);
1287 /* Destroy any ObjC "super" receivers that may have been
1289 objc_clear_super_receiver ();
1291 stmt
= do_poplevel (stmt
);
1294 /* ??? See c_end_compound_stmt wrt statement expressions. */
1299 /* Finish an asm-statement, whose components are a STRING, some
1300 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1301 LABELS. Also note whether the asm-statement should be
1302 considered volatile. */
1305 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1306 tree input_operands
, tree clobbers
, tree labels
)
1310 int ninputs
= list_length (input_operands
);
1311 int noutputs
= list_length (output_operands
);
1313 if (!processing_template_decl
)
1315 const char *constraint
;
1316 const char **oconstraints
;
1317 bool allows_mem
, allows_reg
, is_inout
;
1321 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1323 string
= resolve_asm_operand_names (string
, output_operands
,
1324 input_operands
, labels
);
1326 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1328 operand
= TREE_VALUE (t
);
1330 /* ??? Really, this should not be here. Users should be using a
1331 proper lvalue, dammit. But there's a long history of using
1332 casts in the output operands. In cases like longlong.h, this
1333 becomes a primitive form of typechecking -- if the cast can be
1334 removed, then the output operand had a type of the proper width;
1335 otherwise we'll get an error. Gross, but ... */
1336 STRIP_NOPS (operand
);
1338 operand
= mark_lvalue_use (operand
);
1340 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1341 operand
= error_mark_node
;
1343 if (operand
!= error_mark_node
1344 && (TREE_READONLY (operand
)
1345 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1346 /* Functions are not modifiable, even though they are
1348 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1349 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1350 /* If it's an aggregate and any field is const, then it is
1351 effectively const. */
1352 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1353 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1354 cxx_readonly_error (operand
, lv_asm
);
1356 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1357 oconstraints
[i
] = constraint
;
1359 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1360 &allows_mem
, &allows_reg
, &is_inout
))
1362 /* If the operand is going to end up in memory,
1363 mark it addressable. */
1364 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1365 operand
= error_mark_node
;
1368 operand
= error_mark_node
;
1370 TREE_VALUE (t
) = operand
;
1373 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1375 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1376 operand
= decay_conversion (TREE_VALUE (t
));
1378 /* If the type of the operand hasn't been determined (e.g.,
1379 because it involves an overloaded function), then issue
1380 an error message. There's no context available to
1381 resolve the overloading. */
1382 if (TREE_TYPE (operand
) == unknown_type_node
)
1384 error ("type of asm operand %qE could not be determined",
1386 operand
= error_mark_node
;
1389 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1390 oconstraints
, &allows_mem
, &allows_reg
))
1392 /* If the operand is going to end up in memory,
1393 mark it addressable. */
1394 if (!allows_reg
&& allows_mem
)
1396 /* Strip the nops as we allow this case. FIXME, this really
1397 should be rejected or made deprecated. */
1398 STRIP_NOPS (operand
);
1399 if (!cxx_mark_addressable (operand
))
1400 operand
= error_mark_node
;
1404 operand
= error_mark_node
;
1406 TREE_VALUE (t
) = operand
;
1410 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1411 output_operands
, input_operands
,
1413 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1414 r
= maybe_cleanup_point_expr_void (r
);
1415 return add_stmt (r
);
1418 /* Finish a label with the indicated NAME. Returns the new label. */
1421 finish_label_stmt (tree name
)
1423 tree decl
= define_label (input_location
, name
);
1425 if (decl
== error_mark_node
)
1426 return error_mark_node
;
1428 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1433 /* Finish a series of declarations for local labels. G++ allows users
1434 to declare "local" labels, i.e., labels with scope. This extension
1435 is useful when writing code involving statement-expressions. */
1438 finish_label_decl (tree name
)
1440 if (!at_function_scope_p ())
1442 error ("__label__ declarations are only allowed in function scopes");
1446 add_decl_expr (declare_local_label (name
));
1449 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1452 finish_decl_cleanup (tree decl
, tree cleanup
)
1454 push_cleanup (decl
, cleanup
, false);
1457 /* If the current scope exits with an exception, run CLEANUP. */
1460 finish_eh_cleanup (tree cleanup
)
1462 push_cleanup (NULL
, cleanup
, true);
1465 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1466 order they were written by the user. Each node is as for
1467 emit_mem_initializers. */
1470 finish_mem_initializers (tree mem_inits
)
1472 /* Reorder the MEM_INITS so that they are in the order they appeared
1473 in the source program. */
1474 mem_inits
= nreverse (mem_inits
);
1476 if (processing_template_decl
)
1480 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1482 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1483 check for bare parameter packs in the TREE_VALUE, because
1484 any parameter packs in the TREE_VALUE have already been
1485 bound as part of the TREE_PURPOSE. See
1486 make_pack_expansion for more information. */
1487 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1488 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1489 TREE_VALUE (mem
) = error_mark_node
;
1492 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1495 emit_mem_initializers (mem_inits
);
1498 /* Finish a parenthesized expression EXPR. */
1501 finish_parenthesized_expr (tree expr
)
1504 /* This inhibits warnings in c_common_truthvalue_conversion. */
1505 TREE_NO_WARNING (expr
) = 1;
1507 if (TREE_CODE (expr
) == OFFSET_REF
1508 || TREE_CODE (expr
) == SCOPE_REF
)
1509 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1510 enclosed in parentheses. */
1511 PTRMEM_OK_P (expr
) = 0;
1513 if (TREE_CODE (expr
) == STRING_CST
)
1514 PAREN_STRING_LITERAL_P (expr
) = 1;
1519 /* Finish a reference to a non-static data member (DECL) that is not
1520 preceded by `.' or `->'. */
1523 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1525 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1529 tree scope
= qualifying_scope
;
1530 if (scope
== NULL_TREE
)
1531 scope
= context_for_name_lookup (decl
);
1532 object
= maybe_dummy_object (scope
, NULL
);
1535 if (object
== error_mark_node
)
1536 return error_mark_node
;
1538 /* DR 613: Can use non-static data members without an associated
1539 object in sizeof/decltype/alignof. */
1540 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1541 && (!processing_template_decl
|| !current_class_ref
))
1543 if (current_function_decl
1544 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1545 error ("invalid use of member %q+D in static member function", decl
);
1547 error ("invalid use of non-static data member %q+D", decl
);
1548 error ("from this location");
1550 return error_mark_node
;
1553 if (current_class_ptr
)
1554 TREE_USED (current_class_ptr
) = 1;
1555 if (processing_template_decl
&& !qualifying_scope
)
1557 tree type
= TREE_TYPE (decl
);
1559 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1560 /* Quals on the object don't matter. */;
1563 /* Set the cv qualifiers. */
1564 int quals
= (current_class_ref
1565 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1566 : TYPE_UNQUALIFIED
);
1568 if (DECL_MUTABLE_P (decl
))
1569 quals
&= ~TYPE_QUAL_CONST
;
1571 quals
|= cp_type_quals (TREE_TYPE (decl
));
1572 type
= cp_build_qualified_type (type
, quals
);
1575 return (convert_from_reference
1576 (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
, tf_warning_or_error
);
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
, tf_warning_or_error
);
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
,
1959 tsubst_flags_t complain
)
1961 tree identifier
= NULL_TREE
;
1962 tree functions
= NULL_TREE
;
1963 tree tmpl_args
= NULL_TREE
;
1964 bool template_id
= false;
1966 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1968 /* Use a separate flag to handle null args. */
1970 tmpl_args
= TREE_OPERAND (fn
, 1);
1971 fn
= TREE_OPERAND (fn
, 0);
1974 /* Find the name of the overloaded function. */
1975 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1977 else if (is_overloaded_fn (fn
))
1980 identifier
= DECL_NAME (get_first_fn (functions
));
1982 else if (DECL_P (fn
))
1985 identifier
= DECL_NAME (fn
);
1988 /* A call to a namespace-scope function using an unqualified name.
1990 Do Koenig lookup -- unless any of the arguments are
1992 if (!any_type_dependent_arguments_p (args
)
1993 && !any_dependent_template_arguments_p (tmpl_args
))
1995 fn
= lookup_arg_dependent (identifier
, functions
, args
, include_std
);
1998 /* The unqualified name could not be resolved. */
2000 fn
= unqualified_fn_lookup_error (identifier
);
2006 if (fn
&& template_id
)
2007 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2012 /* Generate an expression for `FN (ARGS)'. This may change the
2015 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2016 as a virtual call, even if FN is virtual. (This flag is set when
2017 encountering an expression where the function name is explicitly
2018 qualified. For example a call to `X::f' never generates a virtual
2021 Returns code for the call. */
2024 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
2025 bool koenig_p
, tsubst_flags_t complain
)
2029 VEC(tree
,gc
) *orig_args
= NULL
;
2031 if (fn
== error_mark_node
)
2032 return error_mark_node
;
2034 gcc_assert (!TYPE_P (fn
));
2038 if (processing_template_decl
)
2040 /* If the call expression is dependent, build a CALL_EXPR node
2041 with no type; type_dependent_expression_p recognizes
2042 expressions with no type as being dependent. */
2043 if (type_dependent_expression_p (fn
)
2044 || any_type_dependent_arguments_p (*args
)
2045 /* For a non-static member function that doesn't have an
2046 explicit object argument, we need to specifically
2047 test the type dependency of the "this" pointer because it
2048 is not included in *ARGS even though it is considered to
2049 be part of the list of arguments. Note that this is
2050 related to CWG issues 515 and 1005. */
2051 || (TREE_CODE (fn
) != COMPONENT_REF
2052 && non_static_member_function_p (fn
)
2053 && current_class_ref
2054 && type_dependent_expression_p (current_class_ref
)))
2056 result
= build_nt_call_vec (fn
, *args
);
2057 KOENIG_LOOKUP_P (result
) = koenig_p
;
2062 tree fndecl
= OVL_CURRENT (fn
);
2063 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2064 || !TREE_THIS_VOLATILE (fndecl
))
2070 current_function_returns_abnormally
= 1;
2074 orig_args
= make_tree_vector_copy (*args
);
2075 if (!BASELINK_P (fn
)
2076 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2077 && TREE_TYPE (fn
) != unknown_type_node
)
2078 fn
= build_non_dependent_expr (fn
);
2079 make_args_non_dependent (*args
);
2082 if (TREE_CODE (fn
) == COMPONENT_REF
)
2084 tree member
= TREE_OPERAND (fn
, 1);
2085 if (BASELINK_P (member
))
2087 tree object
= TREE_OPERAND (fn
, 0);
2088 return build_new_method_call (object
, member
,
2091 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2098 if (is_overloaded_fn (fn
))
2099 fn
= baselink_for_fns (fn
);
2102 if (BASELINK_P (fn
))
2106 /* A call to a member function. From [over.call.func]:
2108 If the keyword this is in scope and refers to the class of
2109 that member function, or a derived class thereof, then the
2110 function call is transformed into a qualified function call
2111 using (*this) as the postfix-expression to the left of the
2112 . operator.... [Otherwise] a contrived object of type T
2113 becomes the implied object argument.
2117 struct A { void f(); };
2118 struct B : public A {};
2119 struct C : public A { void g() { B::f(); }};
2121 "the class of that member function" refers to `A'. But 11.2
2122 [class.access.base] says that we need to convert 'this' to B* as
2123 part of the access, so we pass 'B' to maybe_dummy_object. */
2125 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2128 if (processing_template_decl
)
2130 if (type_dependent_expression_p (object
))
2132 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2133 release_tree_vector (orig_args
);
2136 object
= build_non_dependent_expr (object
);
2139 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2141 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2146 else if (is_overloaded_fn (fn
))
2148 /* If the function is an overloaded builtin, resolve it. */
2149 if (TREE_CODE (fn
) == FUNCTION_DECL
2150 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2151 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2152 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2155 /* A call to a namespace-scope function. */
2156 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2158 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2160 if (!VEC_empty (tree
, *args
))
2161 error ("arguments to destructor are not allowed");
2162 /* Mark the pseudo-destructor call as having side-effects so
2163 that we do not issue warnings about its use. */
2164 result
= build1 (NOP_EXPR
,
2166 TREE_OPERAND (fn
, 0));
2167 TREE_SIDE_EFFECTS (result
) = 1;
2169 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2170 /* If the "function" is really an object of class type, it might
2171 have an overloaded `operator ()'. */
2172 result
= build_op_call (fn
, args
, complain
);
2175 /* A call where the function is unknown. */
2176 result
= cp_build_function_call_vec (fn
, args
, complain
);
2178 if (processing_template_decl
&& result
!= error_mark_node
)
2180 if (TREE_CODE (result
) == INDIRECT_REF
)
2181 result
= TREE_OPERAND (result
, 0);
2182 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2183 SET_EXPR_LOCATION (result
, input_location
);
2184 KOENIG_LOOKUP_P (result
) = koenig_p
;
2185 release_tree_vector (orig_args
);
2186 result
= convert_from_reference (result
);
2191 /* Free garbage OVERLOADs from arg-dependent lookup. */
2192 tree next
= NULL_TREE
;
2194 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2197 if (processing_template_decl
)
2198 /* In a template, we'll re-use them at instantiation time. */
2199 OVL_ARG_DEPENDENT (fn
) = false;
2202 next
= OVL_CHAIN (fn
);
2211 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2212 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2213 POSTDECREMENT_EXPR.) */
2216 finish_increment_expr (tree expr
, enum tree_code code
)
2218 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2221 /* Finish a use of `this'. Returns an expression for `this'. */
2224 finish_this_expr (void)
2228 if (current_class_ptr
)
2230 tree type
= TREE_TYPE (current_class_ref
);
2232 /* In a lambda expression, 'this' refers to the captured 'this'. */
2233 if (LAMBDA_TYPE_P (type
))
2234 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2236 result
= current_class_ptr
;
2239 else if (current_function_decl
2240 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2242 error ("%<this%> is unavailable for static member functions");
2243 result
= error_mark_node
;
2247 if (current_function_decl
)
2248 error ("invalid use of %<this%> in non-member function");
2250 error ("invalid use of %<this%> at top level");
2251 result
= error_mark_node
;
2257 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2258 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2259 the TYPE for the type given. If SCOPE is non-NULL, the expression
2260 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2263 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2265 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2266 return error_mark_node
;
2268 gcc_assert (TYPE_P (destructor
));
2270 if (!processing_template_decl
)
2272 if (scope
== error_mark_node
)
2274 error ("invalid qualifying scope in pseudo-destructor name");
2275 return error_mark_node
;
2277 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2279 error ("qualified type %qT does not match destructor name ~%qT",
2281 return error_mark_node
;
2285 /* [expr.pseudo] says both:
2287 The type designated by the pseudo-destructor-name shall be
2288 the same as the object type.
2292 The cv-unqualified versions of the object type and of the
2293 type designated by the pseudo-destructor-name shall be the
2296 We implement the more generous second sentence, since that is
2297 what most other compilers do. */
2298 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2301 error ("%qE is not of type %qT", object
, destructor
);
2302 return error_mark_node
;
2306 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2309 /* Finish an expression of the form CODE EXPR. */
2312 finish_unary_op_expr (enum tree_code code
, tree expr
)
2314 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2315 /* Inside a template, build_x_unary_op does not fold the
2316 expression. So check whether the result is folded before
2317 setting TREE_NEGATED_INT. */
2318 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2319 && TREE_CODE (result
) == INTEGER_CST
2320 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2321 && INT_CST_LT (result
, integer_zero_node
))
2323 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2324 setting TREE_NEGATED_INT. */
2325 result
= copy_node (result
);
2326 TREE_NEGATED_INT (result
) = 1;
2328 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2329 overflow_warning (input_location
, result
);
2334 /* Finish a compound-literal expression. TYPE is the type to which
2335 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2338 finish_compound_literal (tree type
, tree compound_literal
,
2339 tsubst_flags_t complain
)
2341 if (type
== error_mark_node
)
2342 return error_mark_node
;
2344 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2347 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2349 return cp_build_c_cast (type
, compound_literal
, complain
);
2352 if (!TYPE_OBJ_P (type
))
2354 if (complain
& tf_error
)
2355 error ("compound literal of non-object type %qT", type
);
2356 return error_mark_node
;
2359 if (processing_template_decl
)
2361 TREE_TYPE (compound_literal
) = type
;
2362 /* Mark the expression as a compound literal. */
2363 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2364 return compound_literal
;
2367 type
= complete_type (type
);
2369 if (TYPE_NON_AGGREGATE_CLASS (type
))
2371 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2372 everywhere that deals with function arguments would be a pain, so
2373 just wrap it in a TREE_LIST. The parser set a flag so we know
2374 that it came from T{} rather than T({}). */
2375 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2376 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2377 return build_functional_cast (type
, compound_literal
, complain
);
2380 if (TREE_CODE (type
) == ARRAY_TYPE
2381 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2382 return error_mark_node
;
2383 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2384 if (cxx_dialect
>= cxx0x
&& SCALAR_TYPE_P (type
)
2385 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
))
2386 check_narrowing (type
, compound_literal
);
2387 if (TREE_CODE (type
) == ARRAY_TYPE
2388 && TYPE_DOMAIN (type
) == NULL_TREE
)
2390 cp_complete_array_type_or_error (&type
, compound_literal
,
2392 if (type
== error_mark_node
)
2393 return error_mark_node
;
2395 compound_literal
= digest_init (type
, compound_literal
, complain
);
2396 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2397 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2398 /* Put static/constant array temporaries in static variables, but always
2399 represent class temporaries with TARGET_EXPR so we elide copies. */
2400 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2401 && TREE_CODE (type
) == ARRAY_TYPE
2402 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2403 && initializer_constant_valid_p (compound_literal
, type
))
2405 tree decl
= create_temporary_var (type
);
2406 DECL_INITIAL (decl
) = compound_literal
;
2407 TREE_STATIC (decl
) = 1;
2408 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2410 /* 5.19 says that a constant expression can include an
2411 lvalue-rvalue conversion applied to "a glvalue of literal type
2412 that refers to a non-volatile temporary object initialized
2413 with a constant expression". Rather than try to communicate
2414 that this VAR_DECL is a temporary, just mark it constexpr. */
2415 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2416 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2417 TREE_CONSTANT (decl
) = true;
2419 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2420 decl
= pushdecl_top_level (decl
);
2421 DECL_NAME (decl
) = make_anon_name ();
2422 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2426 return get_target_expr_sfinae (compound_literal
, complain
);
2429 /* Return the declaration for the function-name variable indicated by
2433 finish_fname (tree id
)
2437 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2438 if (processing_template_decl
&& current_function_decl
)
2439 decl
= DECL_NAME (decl
);
2443 /* Finish a translation unit. */
2446 finish_translation_unit (void)
2448 /* In case there were missing closebraces,
2449 get us back to the global binding level. */
2451 while (current_namespace
!= global_namespace
)
2454 /* Do file scope __FUNCTION__ et al. */
2455 finish_fname_decls ();
2458 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2459 Returns the parameter. */
2462 finish_template_type_parm (tree aggr
, tree identifier
)
2464 if (aggr
!= class_type_node
)
2466 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2467 aggr
= class_type_node
;
2470 return build_tree_list (aggr
, identifier
);
2473 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2474 Returns the parameter. */
2477 finish_template_template_parm (tree aggr
, tree identifier
)
2479 tree decl
= build_decl (input_location
,
2480 TYPE_DECL
, identifier
, NULL_TREE
);
2481 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2482 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2483 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2484 DECL_ARTIFICIAL (decl
) = 1;
2485 end_template_decl ();
2487 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2489 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2490 /*is_primary=*/true, /*is_partial=*/false,
2493 return finish_template_type_parm (aggr
, tmpl
);
2496 /* ARGUMENT is the default-argument value for a template template
2497 parameter. If ARGUMENT is invalid, issue error messages and return
2498 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2501 check_template_template_default_arg (tree argument
)
2503 if (TREE_CODE (argument
) != TEMPLATE_DECL
2504 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2505 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2507 if (TREE_CODE (argument
) == TYPE_DECL
)
2508 error ("invalid use of type %qT as a default value for a template "
2509 "template-parameter", TREE_TYPE (argument
));
2511 error ("invalid default argument for a template template parameter");
2512 return error_mark_node
;
2518 /* Begin a class definition, as indicated by T. */
2521 begin_class_definition (tree t
, tree attributes
)
2523 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2524 return error_mark_node
;
2526 if (processing_template_parmlist
)
2528 error ("definition of %q#T inside template parameter list", t
);
2529 return error_mark_node
;
2532 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2533 are passed the same as decimal scalar types. */
2534 if (TREE_CODE (t
) == RECORD_TYPE
2535 && !processing_template_decl
)
2537 tree ns
= TYPE_CONTEXT (t
);
2538 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2539 && DECL_CONTEXT (ns
) == std_node
2541 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2543 const char *n
= TYPE_NAME_STRING (t
);
2544 if ((strcmp (n
, "decimal32") == 0)
2545 || (strcmp (n
, "decimal64") == 0)
2546 || (strcmp (n
, "decimal128") == 0))
2547 TYPE_TRANSPARENT_AGGR (t
) = 1;
2551 /* A non-implicit typename comes from code like:
2553 template <typename T> struct A {
2554 template <typename U> struct A<T>::B ...
2556 This is erroneous. */
2557 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2559 error ("invalid definition of qualified type %qT", t
);
2560 t
= error_mark_node
;
2563 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2565 t
= make_class_type (RECORD_TYPE
);
2566 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2569 if (TYPE_BEING_DEFINED (t
))
2571 t
= make_class_type (TREE_CODE (t
));
2572 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2574 maybe_process_partial_specialization (t
);
2576 TYPE_BEING_DEFINED (t
) = 1;
2578 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2579 fixup_attribute_variants (t
);
2581 if (flag_pack_struct
)
2584 TYPE_PACKED (t
) = 1;
2585 /* Even though the type is being defined for the first time
2586 here, there might have been a forward declaration, so there
2587 might be cv-qualified variants of T. */
2588 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2589 TYPE_PACKED (v
) = 1;
2591 /* Reset the interface data, at the earliest possible
2592 moment, as it might have been set via a class foo;
2594 if (! TYPE_ANONYMOUS_P (t
))
2596 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2597 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2598 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2599 (t
, finfo
->interface_unknown
);
2601 reset_specialization();
2603 /* Make a declaration for this class in its own scope. */
2604 build_self_reference ();
2609 /* Finish the member declaration given by DECL. */
2612 finish_member_declaration (tree decl
)
2614 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2617 if (decl
== void_type_node
)
2618 /* The COMPONENT was a friend, not a member, and so there's
2619 nothing for us to do. */
2622 /* We should see only one DECL at a time. */
2623 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2625 /* Set up access control for DECL. */
2627 = (current_access_specifier
== access_private_node
);
2628 TREE_PROTECTED (decl
)
2629 = (current_access_specifier
== access_protected_node
);
2630 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2632 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2633 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2636 /* Mark the DECL as a member of the current class. */
2637 DECL_CONTEXT (decl
) = current_class_type
;
2639 /* Check for bare parameter packs in the member variable declaration. */
2640 if (TREE_CODE (decl
) == FIELD_DECL
)
2642 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2643 TREE_TYPE (decl
) = error_mark_node
;
2644 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2645 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2650 A C language linkage is ignored for the names of class members
2651 and the member function type of class member functions. */
2652 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2653 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2655 /* Put functions on the TYPE_METHODS list and everything else on the
2656 TYPE_FIELDS list. Note that these are built up in reverse order.
2657 We reverse them (to obtain declaration order) in finish_struct. */
2658 if (TREE_CODE (decl
) == FUNCTION_DECL
2659 || DECL_FUNCTION_TEMPLATE_P (decl
))
2661 /* We also need to add this function to the
2662 CLASSTYPE_METHOD_VEC. */
2663 if (add_method (current_class_type
, decl
, NULL_TREE
))
2665 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2666 TYPE_METHODS (current_class_type
) = decl
;
2668 maybe_add_class_template_decl_list (current_class_type
, decl
,
2672 /* Enter the DECL into the scope of the class. */
2673 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2674 || pushdecl_class_level (decl
))
2676 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2677 go at the beginning. The reason is that lookup_field_1
2678 searches the list in order, and we want a field name to
2679 override a type name so that the "struct stat hack" will
2680 work. In particular:
2682 struct S { enum E { }; int E } s;
2685 is valid. In addition, the FIELD_DECLs must be maintained in
2686 declaration order so that class layout works as expected.
2687 However, we don't need that order until class layout, so we
2688 save a little time by putting FIELD_DECLs on in reverse order
2689 here, and then reversing them in finish_struct_1. (We could
2690 also keep a pointer to the correct insertion points in the
2693 if (TREE_CODE (decl
) == TYPE_DECL
)
2694 TYPE_FIELDS (current_class_type
)
2695 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2698 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2699 TYPE_FIELDS (current_class_type
) = decl
;
2702 maybe_add_class_template_decl_list (current_class_type
, decl
,
2707 note_decl_for_pch (decl
);
2710 /* DECL has been declared while we are building a PCH file. Perform
2711 actions that we might normally undertake lazily, but which can be
2712 performed now so that they do not have to be performed in
2713 translation units which include the PCH file. */
2716 note_decl_for_pch (tree decl
)
2718 gcc_assert (pch_file
);
2720 /* There's a good chance that we'll have to mangle names at some
2721 point, even if only for emission in debugging information. */
2722 if ((TREE_CODE (decl
) == VAR_DECL
2723 || TREE_CODE (decl
) == FUNCTION_DECL
)
2724 && !processing_template_decl
)
2728 /* Finish processing a complete template declaration. The PARMS are
2729 the template parameters. */
2732 finish_template_decl (tree parms
)
2735 end_template_decl ();
2737 end_specialization ();
2740 /* Finish processing a template-id (which names a type) of the form
2741 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2742 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2743 the scope of template-id indicated. */
2746 finish_template_type (tree name
, tree args
, int entering_scope
)
2750 decl
= lookup_template_class (name
, args
,
2751 NULL_TREE
, NULL_TREE
, entering_scope
,
2752 tf_warning_or_error
| tf_user
);
2753 if (decl
!= error_mark_node
)
2754 decl
= TYPE_STUB_DECL (decl
);
2759 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2760 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2761 BASE_CLASS, or NULL_TREE if an error occurred. The
2762 ACCESS_SPECIFIER is one of
2763 access_{default,public,protected_private}_node. For a virtual base
2764 we set TREE_TYPE. */
2767 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2771 if (base
== error_mark_node
)
2773 error ("invalid base-class specification");
2776 else if (! MAYBE_CLASS_TYPE_P (base
))
2778 error ("%qT is not a class type", base
);
2783 if (cp_type_quals (base
) != 0)
2785 /* DR 484: Can a base-specifier name a cv-qualified
2787 base
= TYPE_MAIN_VARIANT (base
);
2789 result
= build_tree_list (access
, base
);
2791 TREE_TYPE (result
) = integer_type_node
;
2797 /* If FNS is a member function, a set of member functions, or a
2798 template-id referring to one or more member functions, return a
2799 BASELINK for FNS, incorporating the current access context.
2800 Otherwise, return FNS unchanged. */
2803 baselink_for_fns (tree fns
)
2808 if (BASELINK_P (fns
)
2809 || error_operand_p (fns
))
2813 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2814 fn
= TREE_OPERAND (fn
, 0);
2815 fn
= get_first_fn (fn
);
2816 if (!DECL_FUNCTION_MEMBER_P (fn
))
2819 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2821 cl
= DECL_CONTEXT (fn
);
2822 cl
= TYPE_BINFO (cl
);
2823 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2826 /* Returns true iff DECL is an automatic variable from a function outside
2830 outer_automatic_var_p (tree decl
)
2832 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2833 && DECL_FUNCTION_SCOPE_P (decl
)
2834 && !TREE_STATIC (decl
)
2835 && DECL_CONTEXT (decl
) != current_function_decl
);
2838 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2839 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2840 if non-NULL, is the type or namespace used to explicitly qualify
2841 ID_EXPRESSION. DECL is the entity to which that name has been
2844 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2845 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2846 be set to true if this expression isn't permitted in a
2847 constant-expression, but it is otherwise not set by this function.
2848 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2849 constant-expression, but a non-constant expression is also
2852 DONE is true if this expression is a complete postfix-expression;
2853 it is false if this expression is followed by '->', '[', '(', etc.
2854 ADDRESS_P is true iff this expression is the operand of '&'.
2855 TEMPLATE_P is true iff the qualified-id was of the form
2856 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2857 appears as a template argument.
2859 If an error occurs, and it is the kind of error that might cause
2860 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2861 is the caller's responsibility to issue the message. *ERROR_MSG
2862 will be a string with static storage duration, so the caller need
2865 Return an expression for the entity, after issuing appropriate
2866 diagnostics. This function is also responsible for transforming a
2867 reference to a non-static member into a COMPONENT_REF that makes
2868 the use of "this" explicit.
2870 Upon return, *IDK will be filled in appropriately. */
2872 finish_id_expression (tree id_expression
,
2876 bool integral_constant_expression_p
,
2877 bool allow_non_integral_constant_expression_p
,
2878 bool *non_integral_constant_expression_p
,
2882 bool template_arg_p
,
2883 const char **error_msg
,
2884 location_t location
)
2886 /* Initialize the output parameters. */
2887 *idk
= CP_ID_KIND_NONE
;
2890 if (id_expression
== error_mark_node
)
2891 return error_mark_node
;
2892 /* If we have a template-id, then no further lookup is
2893 required. If the template-id was for a template-class, we
2894 will sometimes have a TYPE_DECL at this point. */
2895 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2896 || TREE_CODE (decl
) == TYPE_DECL
)
2898 /* Look up the name. */
2901 if (decl
== error_mark_node
)
2903 /* Name lookup failed. */
2906 || (!dependent_type_p (scope
)
2907 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2908 && IDENTIFIER_TYPENAME_P (id_expression
)
2909 && dependent_type_p (TREE_TYPE (id_expression
))))))
2911 /* If the qualifying type is non-dependent (and the name
2912 does not name a conversion operator to a dependent
2913 type), issue an error. */
2914 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2915 return error_mark_node
;
2919 /* It may be resolved via Koenig lookup. */
2920 *idk
= CP_ID_KIND_UNQUALIFIED
;
2921 return id_expression
;
2924 decl
= id_expression
;
2926 /* If DECL is a variable that would be out of scope under
2927 ANSI/ISO rules, but in scope in the ARM, name lookup
2928 will succeed. Issue a diagnostic here. */
2930 decl
= check_for_out_of_scope_variable (decl
);
2932 /* Remember that the name was used in the definition of
2933 the current class so that we can check later to see if
2934 the meaning would have been different after the class
2935 was entirely defined. */
2936 if (!scope
&& decl
!= error_mark_node
2937 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
2938 maybe_note_name_used_in_class (id_expression
, decl
);
2940 /* Disallow uses of local variables from containing functions, except
2941 within lambda-expressions. */
2942 if (outer_automatic_var_p (decl
)
2943 /* It's not a use (3.2) if we're in an unevaluated context. */
2944 && !cp_unevaluated_operand
)
2946 tree context
= DECL_CONTEXT (decl
);
2947 tree containing_function
= current_function_decl
;
2948 tree lambda_stack
= NULL_TREE
;
2949 tree lambda_expr
= NULL_TREE
;
2950 tree initializer
= convert_from_reference (decl
);
2952 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2953 support for an approach in which a reference to a local
2954 [constant] automatic variable in a nested class or lambda body
2955 would enter the expression as an rvalue, which would reduce
2956 the complexity of the problem"
2958 FIXME update for final resolution of core issue 696. */
2959 if (decl_constant_var_p (decl
))
2960 return integral_constant_value (decl
);
2962 /* If we are in a lambda function, we can move out until we hit
2964 2. a non-lambda function, or
2965 3. a non-default capturing lambda function. */
2966 while (context
!= containing_function
2967 && LAMBDA_FUNCTION_P (containing_function
))
2969 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2970 (DECL_CONTEXT (containing_function
));
2972 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2976 lambda_stack
= tree_cons (NULL_TREE
,
2981 = decl_function_context (containing_function
);
2984 if (context
== containing_function
)
2986 decl
= add_default_capture (lambda_stack
,
2987 /*id=*/DECL_NAME (decl
),
2990 else if (lambda_expr
)
2992 error ("%qD is not captured", decl
);
2993 return error_mark_node
;
2997 error (TREE_CODE (decl
) == VAR_DECL
2998 ? "use of %<auto%> variable from containing function"
2999 : "use of parameter from containing function");
3000 error (" %q+#D declared here", decl
);
3001 return error_mark_node
;
3005 /* Also disallow uses of function parameters outside the function
3006 body, except inside an unevaluated context (i.e. decltype). */
3007 if (TREE_CODE (decl
) == PARM_DECL
3008 && DECL_CONTEXT (decl
) == NULL_TREE
3009 && !cp_unevaluated_operand
)
3011 error ("use of parameter %qD outside function body", decl
);
3012 return error_mark_node
;
3016 /* If we didn't find anything, or what we found was a type,
3017 then this wasn't really an id-expression. */
3018 if (TREE_CODE (decl
) == TEMPLATE_DECL
3019 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3021 *error_msg
= "missing template arguments";
3022 return error_mark_node
;
3024 else if (TREE_CODE (decl
) == TYPE_DECL
3025 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3027 *error_msg
= "expected primary-expression";
3028 return error_mark_node
;
3031 /* If the name resolved to a template parameter, there is no
3032 need to look it up again later. */
3033 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3034 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3038 *idk
= CP_ID_KIND_NONE
;
3039 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3040 decl
= TEMPLATE_PARM_DECL (decl
);
3041 r
= convert_from_reference (DECL_INITIAL (decl
));
3043 if (integral_constant_expression_p
3044 && !dependent_type_p (TREE_TYPE (decl
))
3045 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3047 if (!allow_non_integral_constant_expression_p
)
3048 error ("template parameter %qD of type %qT is not allowed in "
3049 "an integral constant expression because it is not of "
3050 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3051 *non_integral_constant_expression_p
= true;
3055 /* Similarly, we resolve enumeration constants to their
3056 underlying values. */
3057 else if (TREE_CODE (decl
) == CONST_DECL
)
3059 *idk
= CP_ID_KIND_NONE
;
3060 if (!processing_template_decl
)
3062 used_types_insert (TREE_TYPE (decl
));
3063 return DECL_INITIAL (decl
);
3071 /* If the declaration was explicitly qualified indicate
3072 that. The semantics of `A::f(3)' are different than
3073 `f(3)' if `f' is virtual. */
3075 ? CP_ID_KIND_QUALIFIED
3076 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3077 ? CP_ID_KIND_TEMPLATE_ID
3078 : CP_ID_KIND_UNQUALIFIED
));
3083 An id-expression is type-dependent if it contains an
3084 identifier that was declared with a dependent type.
3086 The standard is not very specific about an id-expression that
3087 names a set of overloaded functions. What if some of them
3088 have dependent types and some of them do not? Presumably,
3089 such a name should be treated as a dependent name. */
3090 /* Assume the name is not dependent. */
3091 dependent_p
= false;
3092 if (!processing_template_decl
)
3093 /* No names are dependent outside a template. */
3095 /* A template-id where the name of the template was not resolved
3096 is definitely dependent. */
3097 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3098 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3099 == IDENTIFIER_NODE
))
3101 /* For anything except an overloaded function, just check its
3103 else if (!is_overloaded_fn (decl
))
3105 = dependent_type_p (TREE_TYPE (decl
));
3106 /* For a set of overloaded functions, check each of the
3112 if (BASELINK_P (fns
))
3113 fns
= BASELINK_FUNCTIONS (fns
);
3115 /* For a template-id, check to see if the template
3116 arguments are dependent. */
3117 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3119 tree args
= TREE_OPERAND (fns
, 1);
3120 dependent_p
= any_dependent_template_arguments_p (args
);
3121 /* The functions are those referred to by the
3123 fns
= TREE_OPERAND (fns
, 0);
3126 /* If there are no dependent template arguments, go through
3127 the overloaded functions. */
3128 while (fns
&& !dependent_p
)
3130 tree fn
= OVL_CURRENT (fns
);
3132 /* Member functions of dependent classes are
3134 if (TREE_CODE (fn
) == FUNCTION_DECL
3135 && type_dependent_expression_p (fn
))
3137 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3138 && dependent_template_p (fn
))
3141 fns
= OVL_NEXT (fns
);
3145 /* If the name was dependent on a template parameter, we will
3146 resolve the name at instantiation time. */
3149 /* Create a SCOPE_REF for qualified names, if the scope is
3155 if (address_p
&& done
)
3156 decl
= finish_qualified_id_expr (scope
, decl
,
3162 tree type
= NULL_TREE
;
3163 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3164 type
= TREE_TYPE (decl
);
3165 decl
= build_qualified_name (type
,
3171 if (TREE_TYPE (decl
))
3172 decl
= convert_from_reference (decl
);
3175 /* A TEMPLATE_ID already contains all the information we
3177 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3178 return id_expression
;
3179 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3180 /* If we found a variable, then name lookup during the
3181 instantiation will always resolve to the same VAR_DECL
3182 (or an instantiation thereof). */
3183 if (TREE_CODE (decl
) == VAR_DECL
3184 || TREE_CODE (decl
) == PARM_DECL
)
3187 return convert_from_reference (decl
);
3189 /* The same is true for FIELD_DECL, but we also need to
3190 make sure that the syntax is correct. */
3191 else if (TREE_CODE (decl
) == FIELD_DECL
)
3193 /* Since SCOPE is NULL here, this is an unqualified name.
3194 Access checking has been performed during name lookup
3195 already. Turn off checking to avoid duplicate errors. */
3196 push_deferring_access_checks (dk_no_check
);
3197 decl
= finish_non_static_data_member
3199 /*qualifying_scope=*/NULL_TREE
);
3200 pop_deferring_access_checks ();
3203 return id_expression
;
3206 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3208 error ("use of namespace %qD as expression", decl
);
3209 return error_mark_node
;
3211 else if (DECL_CLASS_TEMPLATE_P (decl
))
3213 error ("use of class template %qT as expression", decl
);
3214 return error_mark_node
;
3216 else if (TREE_CODE (decl
) == TREE_LIST
)
3218 /* Ambiguous reference to base members. */
3219 error ("request for member %qD is ambiguous in "
3220 "multiple inheritance lattice", id_expression
);
3221 print_candidates (decl
);
3222 return error_mark_node
;
3225 /* Mark variable-like entities as used. Functions are similarly
3226 marked either below or after overload resolution. */
3227 if (TREE_CODE (decl
) == VAR_DECL
3228 || TREE_CODE (decl
) == PARM_DECL
3229 || TREE_CODE (decl
) == RESULT_DECL
)
3232 /* Only certain kinds of names are allowed in constant
3233 expression. Enumerators and template parameters have already
3234 been handled above. */
3235 if (! error_operand_p (decl
)
3236 && integral_constant_expression_p
3237 && ! decl_constant_var_p (decl
)
3238 && ! builtin_valid_in_constant_expr_p (decl
))
3240 if (!allow_non_integral_constant_expression_p
)
3242 error ("%qD cannot appear in a constant-expression", decl
);
3243 return error_mark_node
;
3245 *non_integral_constant_expression_p
= true;
3250 decl
= (adjust_result_of_qualified_name_lookup
3251 (decl
, scope
, current_class_type
));
3253 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3256 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3257 decl
= finish_qualified_id_expr (scope
,
3265 tree r
= convert_from_reference (decl
);
3267 /* In a template, return a SCOPE_REF for most qualified-ids
3268 so that we can check access at instantiation time. But if
3269 we're looking at a member of the current instantiation, we
3270 know we have access and building up the SCOPE_REF confuses
3271 non-type template argument handling. */
3272 if (processing_template_decl
&& TYPE_P (scope
)
3273 && !currently_open_class (scope
))
3274 r
= build_qualified_name (TREE_TYPE (r
),
3280 else if (TREE_CODE (decl
) == FIELD_DECL
)
3282 /* Since SCOPE is NULL here, this is an unqualified name.
3283 Access checking has been performed during name lookup
3284 already. Turn off checking to avoid duplicate errors. */
3285 push_deferring_access_checks (dk_no_check
);
3286 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3287 /*qualifying_scope=*/NULL_TREE
);
3288 pop_deferring_access_checks ();
3290 else if (is_overloaded_fn (decl
))
3294 first_fn
= get_first_fn (decl
);
3295 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3296 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3298 if (!really_overloaded_fn (decl
))
3299 mark_used (first_fn
);
3302 && TREE_CODE (first_fn
) == FUNCTION_DECL
3303 && DECL_FUNCTION_MEMBER_P (first_fn
)
3304 && !shared_member_p (decl
))
3306 /* A set of member functions. */
3307 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3308 return finish_class_member_access_expr (decl
, id_expression
,
3309 /*template_p=*/false,
3310 tf_warning_or_error
);
3313 decl
= baselink_for_fns (decl
);
3317 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3318 && DECL_CLASS_SCOPE_P (decl
))
3320 tree context
= context_for_name_lookup (decl
);
3321 if (context
!= current_class_type
)
3323 tree path
= currently_open_derived_class (context
);
3324 perform_or_defer_access_check (TYPE_BINFO (path
),
3329 decl
= convert_from_reference (decl
);
3333 if (TREE_DEPRECATED (decl
))
3334 warn_deprecated_use (decl
, NULL_TREE
);
3339 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3340 use as a type-specifier. */
3343 finish_typeof (tree expr
)
3347 if (type_dependent_expression_p (expr
))
3349 type
= cxx_make_type (TYPEOF_TYPE
);
3350 TYPEOF_TYPE_EXPR (type
) = expr
;
3351 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3356 expr
= mark_type_use (expr
);
3358 type
= unlowered_expr_type (expr
);
3360 if (!type
|| type
== unknown_type_node
)
3362 error ("type of %qE is unknown", expr
);
3363 return error_mark_node
;
3369 /* Implement the __underlying_type keyword: Return the underlying
3370 type of TYPE, suitable for use as a type-specifier. */
3373 finish_underlying_type (tree type
)
3375 tree underlying_type
;
3377 if (processing_template_decl
)
3379 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3380 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3381 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3383 return underlying_type
;
3386 complete_type (type
);
3388 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3390 error ("%qE is not an enumeration type", type
);
3391 return error_mark_node
;
3394 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3396 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3397 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3398 See finish_enum_value_list for details. */
3399 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3401 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3402 TYPE_UNSIGNED (underlying_type
));
3404 return underlying_type
;
3407 /* Perform C++-specific checks for __builtin_offsetof before calling
3411 finish_offsetof (tree expr
)
3413 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3415 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3416 TREE_OPERAND (expr
, 2));
3417 return error_mark_node
;
3419 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3420 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3421 || TREE_TYPE (expr
) == unknown_type_node
)
3423 if (TREE_CODE (expr
) == COMPONENT_REF
3424 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3425 expr
= TREE_OPERAND (expr
, 1);
3426 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3427 return error_mark_node
;
3429 if (REFERENCE_REF_P (expr
))
3430 expr
= TREE_OPERAND (expr
, 0);
3431 if (TREE_CODE (expr
) == COMPONENT_REF
)
3433 tree object
= TREE_OPERAND (expr
, 0);
3434 if (!complete_type_or_else (TREE_TYPE (object
), object
))
3435 return error_mark_node
;
3437 return fold_offsetof (expr
, NULL_TREE
);
3440 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3441 function is broken out from the above for the benefit of the tree-ssa
3445 simplify_aggr_init_expr (tree
*tp
)
3447 tree aggr_init_expr
= *tp
;
3449 /* Form an appropriate CALL_EXPR. */
3450 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3451 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3452 tree type
= TREE_TYPE (slot
);
3455 enum style_t
{ ctor
, arg
, pcc
} style
;
3457 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3459 #ifdef PCC_STATIC_STRUCT_RETURN
3465 gcc_assert (TREE_ADDRESSABLE (type
));
3469 call_expr
= build_call_array_loc (input_location
,
3470 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3472 aggr_init_expr_nargs (aggr_init_expr
),
3473 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3474 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3478 /* Replace the first argument to the ctor with the address of the
3480 cxx_mark_addressable (slot
);
3481 CALL_EXPR_ARG (call_expr
, 0) =
3482 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3484 else if (style
== arg
)
3486 /* Just mark it addressable here, and leave the rest to
3487 expand_call{,_inline}. */
3488 cxx_mark_addressable (slot
);
3489 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3490 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3492 else if (style
== pcc
)
3494 /* If we're using the non-reentrant PCC calling convention, then we
3495 need to copy the returned value out of the static buffer into the
3497 push_deferring_access_checks (dk_no_check
);
3498 call_expr
= build_aggr_init (slot
, call_expr
,
3499 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3500 tf_warning_or_error
);
3501 pop_deferring_access_checks ();
3502 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3505 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3507 tree init
= build_zero_init (type
, NULL_TREE
,
3508 /*static_storage_p=*/false);
3509 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3510 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3517 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3520 emit_associated_thunks (tree fn
)
3522 /* When we use vcall offsets, we emit thunks with the virtual
3523 functions to which they thunk. The whole point of vcall offsets
3524 is so that you can know statically the entire set of thunks that
3525 will ever be needed for a given virtual function, thereby
3526 enabling you to output all the thunks with the function itself. */
3527 if (DECL_VIRTUAL_P (fn
)
3528 /* Do not emit thunks for extern template instantiations. */
3529 && ! DECL_REALLY_EXTERN (fn
))
3533 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3535 if (!THUNK_ALIAS (thunk
))
3537 use_thunk (thunk
, /*emit_p=*/1);
3538 if (DECL_RESULT_THUNK_P (thunk
))
3542 for (probe
= DECL_THUNKS (thunk
);
3543 probe
; probe
= DECL_CHAIN (probe
))
3544 use_thunk (probe
, /*emit_p=*/1);
3548 gcc_assert (!DECL_THUNKS (thunk
));
3553 /* Returns true iff FUN is an instantiation of a constexpr function
3557 is_instantiation_of_constexpr (tree fun
)
3559 return (DECL_TEMPLATE_INFO (fun
)
3560 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3561 (DECL_TI_TEMPLATE (fun
))));
3564 /* Generate RTL for FN. */
3567 expand_or_defer_fn_1 (tree fn
)
3569 /* When the parser calls us after finishing the body of a template
3570 function, we don't really want to expand the body. */
3571 if (processing_template_decl
)
3573 /* Normally, collection only occurs in rest_of_compilation. So,
3574 if we don't collect here, we never collect junk generated
3575 during the processing of templates until we hit a
3576 non-template function. It's not safe to do this inside a
3577 nested class, though, as the parser may have local state that
3578 is not a GC root. */
3579 if (!function_depth
)
3584 gcc_assert (DECL_SAVED_TREE (fn
));
3586 /* If this is a constructor or destructor body, we have to clone
3588 if (maybe_clone_body (fn
))
3590 /* We don't want to process FN again, so pretend we've written
3591 it out, even though we haven't. */
3592 TREE_ASM_WRITTEN (fn
) = 1;
3593 /* If this is an instantiation of a constexpr function, keep
3594 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3595 if (!is_instantiation_of_constexpr (fn
))
3596 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3600 /* We make a decision about linkage for these functions at the end
3601 of the compilation. Until that point, we do not want the back
3602 end to output them -- but we do want it to see the bodies of
3603 these functions so that it can inline them as appropriate. */
3604 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3606 if (DECL_INTERFACE_KNOWN (fn
))
3607 /* We've already made a decision as to how this function will
3611 DECL_EXTERNAL (fn
) = 1;
3612 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3613 note_vague_linkage_fn (fn
);
3614 /* A non-template inline function with external linkage will
3615 always be COMDAT. As we must eventually determine the
3616 linkage of all functions, and as that causes writes to
3617 the data mapped in from the PCH file, it's advantageous
3618 to mark the functions at this point. */
3619 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3621 /* This function must have external linkage, as
3622 otherwise DECL_INTERFACE_KNOWN would have been
3624 gcc_assert (TREE_PUBLIC (fn
));
3625 comdat_linkage (fn
);
3626 DECL_INTERFACE_KNOWN (fn
) = 1;
3630 import_export_decl (fn
);
3632 /* If the user wants us to keep all inline functions, then mark
3633 this function as needed so that finish_file will make sure to
3634 output it later. Similarly, all dllexport'd functions must
3635 be emitted; there may be callers in other DLLs. */
3636 if ((flag_keep_inline_functions
3637 && DECL_DECLARED_INLINE_P (fn
)
3638 && !DECL_REALLY_EXTERN (fn
))
3639 || (flag_keep_inline_dllexport
3640 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3643 DECL_EXTERNAL (fn
) = 0;
3647 /* There's no reason to do any of the work here if we're only doing
3648 semantic analysis; this code just generates RTL. */
3649 if (flag_syntax_only
)
3656 expand_or_defer_fn (tree fn
)
3658 if (expand_or_defer_fn_1 (fn
))
3662 /* Expand or defer, at the whim of the compilation unit manager. */
3663 cgraph_finalize_function (fn
, function_depth
> 1);
3664 emit_associated_thunks (fn
);
3677 /* Helper function for walk_tree, used by finalize_nrv below. */
3680 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3682 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3685 /* No need to walk into types. There wouldn't be any need to walk into
3686 non-statements, except that we have to consider STMT_EXPRs. */
3689 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3690 but differs from using NULL_TREE in that it indicates that we care
3691 about the value of the RESULT_DECL. */
3692 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3693 TREE_OPERAND (*tp
, 0) = dp
->result
;
3694 /* Change all cleanups for the NRV to only run when an exception is
3696 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3697 && CLEANUP_DECL (*tp
) == dp
->var
)
3698 CLEANUP_EH_ONLY (*tp
) = 1;
3699 /* Replace the DECL_EXPR for the NRV with an initialization of the
3700 RESULT_DECL, if needed. */
3701 else if (TREE_CODE (*tp
) == DECL_EXPR
3702 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3705 if (DECL_INITIAL (dp
->var
)
3706 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3707 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3708 DECL_INITIAL (dp
->var
));
3710 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3711 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3712 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3715 /* And replace all uses of the NRV with the RESULT_DECL. */
3716 else if (*tp
== dp
->var
)
3719 /* Avoid walking into the same tree more than once. Unfortunately, we
3720 can't just use walk_tree_without duplicates because it would only call
3721 us for the first occurrence of dp->var in the function body. */
3722 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3728 /* Keep iterating. */
3732 /* Called from finish_function to implement the named return value
3733 optimization by overriding all the RETURN_EXPRs and pertinent
3734 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3735 RESULT_DECL for the function. */
3738 finalize_nrv (tree
*tp
, tree var
, tree result
)
3740 struct nrv_data data
;
3742 /* Copy name from VAR to RESULT. */
3743 DECL_NAME (result
) = DECL_NAME (var
);
3744 /* Don't forget that we take its address. */
3745 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3746 /* Finally set DECL_VALUE_EXPR to avoid assigning
3747 a stack slot at -O0 for the original var and debug info
3748 uses RESULT location for VAR. */
3749 SET_DECL_VALUE_EXPR (var
, result
);
3750 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3753 data
.result
= result
;
3754 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3755 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3756 htab_delete (data
.visited
);
3759 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3762 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3763 bool need_copy_ctor
, bool need_copy_assignment
)
3765 int save_errorcount
= errorcount
;
3768 /* Always allocate 3 elements for simplicity. These are the
3769 function decls for the ctor, dtor, and assignment op.
3770 This layout is known to the three lang hooks,
3771 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3772 and cxx_omp_clause_assign_op. */
3773 info
= make_tree_vec (3);
3774 CP_OMP_CLAUSE_INFO (c
) = info
;
3776 if (need_default_ctor
|| need_copy_ctor
)
3778 if (need_default_ctor
)
3779 t
= get_default_ctor (type
);
3781 t
= get_copy_ctor (type
, tf_warning_or_error
);
3783 if (t
&& !trivial_fn_p (t
))
3784 TREE_VEC_ELT (info
, 0) = t
;
3787 if ((need_default_ctor
|| need_copy_ctor
)
3788 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3789 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
3791 if (need_copy_assignment
)
3793 t
= get_copy_assign (type
);
3795 if (t
&& !trivial_fn_p (t
))
3796 TREE_VEC_ELT (info
, 2) = t
;
3799 return errorcount
!= save_errorcount
;
3802 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3803 Remove any elements from the list that are invalid. */
3806 finish_omp_clauses (tree clauses
)
3808 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3809 tree c
, t
, *pc
= &clauses
;
3812 bitmap_obstack_initialize (NULL
);
3813 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3814 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3815 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3817 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3819 bool remove
= false;
3821 switch (OMP_CLAUSE_CODE (c
))
3823 case OMP_CLAUSE_SHARED
:
3825 goto check_dup_generic
;
3826 case OMP_CLAUSE_PRIVATE
:
3828 goto check_dup_generic
;
3829 case OMP_CLAUSE_REDUCTION
:
3831 goto check_dup_generic
;
3832 case OMP_CLAUSE_COPYPRIVATE
:
3833 name
= "copyprivate";
3834 goto check_dup_generic
;
3835 case OMP_CLAUSE_COPYIN
:
3837 goto check_dup_generic
;
3839 t
= OMP_CLAUSE_DECL (c
);
3840 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3842 if (processing_template_decl
)
3845 error ("%qD is not a variable in clause %qs", t
, name
);
3847 error ("%qE is not a variable in clause %qs", t
, name
);
3850 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3851 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3852 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3854 error ("%qD appears more than once in data clauses", t
);
3858 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3861 case OMP_CLAUSE_FIRSTPRIVATE
:
3862 t
= OMP_CLAUSE_DECL (c
);
3863 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3865 if (processing_template_decl
)
3868 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3870 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3873 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3874 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3876 error ("%qD appears more than once in data clauses", t
);
3880 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3883 case OMP_CLAUSE_LASTPRIVATE
:
3884 t
= OMP_CLAUSE_DECL (c
);
3885 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3887 if (processing_template_decl
)
3890 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3892 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3895 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3896 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3898 error ("%qD appears more than once in data clauses", t
);
3902 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3906 t
= OMP_CLAUSE_IF_EXPR (c
);
3907 t
= maybe_convert_cond (t
);
3908 if (t
== error_mark_node
)
3910 OMP_CLAUSE_IF_EXPR (c
) = t
;
3913 case OMP_CLAUSE_FINAL
:
3914 t
= OMP_CLAUSE_FINAL_EXPR (c
);
3915 t
= maybe_convert_cond (t
);
3916 if (t
== error_mark_node
)
3918 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
3921 case OMP_CLAUSE_NUM_THREADS
:
3922 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3923 if (t
== error_mark_node
)
3925 else if (!type_dependent_expression_p (t
)
3926 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3928 error ("num_threads expression must be integral");
3933 case OMP_CLAUSE_SCHEDULE
:
3934 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3937 else if (t
== error_mark_node
)
3939 else if (!type_dependent_expression_p (t
)
3940 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3942 error ("schedule chunk size expression must be integral");
3947 case OMP_CLAUSE_NOWAIT
:
3948 case OMP_CLAUSE_ORDERED
:
3949 case OMP_CLAUSE_DEFAULT
:
3950 case OMP_CLAUSE_UNTIED
:
3951 case OMP_CLAUSE_COLLAPSE
:
3952 case OMP_CLAUSE_MERGEABLE
:
3960 *pc
= OMP_CLAUSE_CHAIN (c
);
3962 pc
= &OMP_CLAUSE_CHAIN (c
);
3965 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3967 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3968 bool remove
= false;
3969 bool need_complete_non_reference
= false;
3970 bool need_default_ctor
= false;
3971 bool need_copy_ctor
= false;
3972 bool need_copy_assignment
= false;
3973 bool need_implicitly_determined
= false;
3974 tree type
, inner_type
;
3978 case OMP_CLAUSE_SHARED
:
3980 need_implicitly_determined
= true;
3982 case OMP_CLAUSE_PRIVATE
:
3984 need_complete_non_reference
= true;
3985 need_default_ctor
= true;
3986 need_implicitly_determined
= true;
3988 case OMP_CLAUSE_FIRSTPRIVATE
:
3989 name
= "firstprivate";
3990 need_complete_non_reference
= true;
3991 need_copy_ctor
= true;
3992 need_implicitly_determined
= true;
3994 case OMP_CLAUSE_LASTPRIVATE
:
3995 name
= "lastprivate";
3996 need_complete_non_reference
= true;
3997 need_copy_assignment
= true;
3998 need_implicitly_determined
= true;
4000 case OMP_CLAUSE_REDUCTION
:
4002 need_implicitly_determined
= true;
4004 case OMP_CLAUSE_COPYPRIVATE
:
4005 name
= "copyprivate";
4006 need_copy_assignment
= true;
4008 case OMP_CLAUSE_COPYIN
:
4010 need_copy_assignment
= true;
4013 pc
= &OMP_CLAUSE_CHAIN (c
);
4017 t
= OMP_CLAUSE_DECL (c
);
4018 if (processing_template_decl
4019 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4021 pc
= &OMP_CLAUSE_CHAIN (c
);
4027 case OMP_CLAUSE_LASTPRIVATE
:
4028 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4029 need_default_ctor
= true;
4032 case OMP_CLAUSE_REDUCTION
:
4033 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4034 || POINTER_TYPE_P (TREE_TYPE (t
)))
4036 error ("%qE has invalid type for %<reduction%>", t
);
4039 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
4041 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
4051 error ("%qE has invalid type for %<reduction(%s)%>",
4052 t
, operator_name_info
[r_code
].name
);
4058 case OMP_CLAUSE_COPYIN
:
4059 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
4061 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
4070 if (need_complete_non_reference
|| need_copy_assignment
)
4072 t
= require_complete_type (t
);
4073 if (t
== error_mark_node
)
4075 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4076 && need_complete_non_reference
)
4078 error ("%qE has reference type for %qs", t
, name
);
4082 if (need_implicitly_determined
)
4084 const char *share_name
= NULL
;
4086 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4087 share_name
= "threadprivate";
4088 else switch (cxx_omp_predetermined_sharing (t
))
4090 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
4092 case OMP_CLAUSE_DEFAULT_SHARED
:
4093 /* const vars may be specified in firstprivate clause. */
4094 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
4095 && cxx_omp_const_qual_no_mutable (t
))
4097 share_name
= "shared";
4099 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4100 share_name
= "private";
4107 error ("%qE is predetermined %qs for %qs",
4108 t
, share_name
, name
);
4113 /* We're interested in the base element, not arrays. */
4114 inner_type
= type
= TREE_TYPE (t
);
4115 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
4116 inner_type
= TREE_TYPE (inner_type
);
4118 /* Check for special function availability by building a call to one.
4119 Save the results, because later we won't be in the right context
4120 for making these queries. */
4121 if (CLASS_TYPE_P (inner_type
)
4122 && COMPLETE_TYPE_P (inner_type
)
4123 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
4124 && !type_dependent_expression_p (t
)
4125 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
4126 need_copy_ctor
, need_copy_assignment
))
4130 *pc
= OMP_CLAUSE_CHAIN (c
);
4132 pc
= &OMP_CLAUSE_CHAIN (c
);
4135 bitmap_obstack_release (NULL
);
4139 /* For all variables in the tree_list VARS, mark them as thread local. */
4142 finish_omp_threadprivate (tree vars
)
4146 /* Mark every variable in VARS to be assigned thread local storage. */
4147 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4149 tree v
= TREE_PURPOSE (t
);
4151 if (error_operand_p (v
))
4153 else if (TREE_CODE (v
) != VAR_DECL
)
4154 error ("%<threadprivate%> %qD is not file, namespace "
4155 "or block scope variable", v
);
4156 /* If V had already been marked threadprivate, it doesn't matter
4157 whether it had been used prior to this point. */
4158 else if (TREE_USED (v
)
4159 && (DECL_LANG_SPECIFIC (v
) == NULL
4160 || !CP_DECL_THREADPRIVATE_P (v
)))
4161 error ("%qE declared %<threadprivate%> after first use", v
);
4162 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4163 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4164 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4165 error ("%<threadprivate%> %qE has incomplete type", v
);
4166 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4167 && CP_DECL_CONTEXT (v
) != current_class_type
)
4168 error ("%<threadprivate%> %qE directive not "
4169 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4172 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4173 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4175 retrofit_lang_decl (v
);
4177 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4178 after the allocation of the lang_decl structure. */
4179 if (DECL_DISCRIMINATOR_P (v
))
4180 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4183 if (! DECL_THREAD_LOCAL_P (v
))
4185 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4186 /* If rtl has been already set for this var, call
4187 make_decl_rtl once again, so that encode_section_info
4188 has a chance to look at the new decl flags. */
4189 if (DECL_RTL_SET_P (v
))
4192 CP_DECL_THREADPRIVATE_P (v
) = 1;
4197 /* Build an OpenMP structured block. */
4200 begin_omp_structured_block (void)
4202 return do_pushlevel (sk_omp
);
4206 finish_omp_structured_block (tree block
)
4208 return do_poplevel (block
);
4211 /* Similarly, except force the retention of the BLOCK. */
4214 begin_omp_parallel (void)
4216 keep_next_level (true);
4217 return begin_omp_structured_block ();
4221 finish_omp_parallel (tree clauses
, tree body
)
4225 body
= finish_omp_structured_block (body
);
4227 stmt
= make_node (OMP_PARALLEL
);
4228 TREE_TYPE (stmt
) = void_type_node
;
4229 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4230 OMP_PARALLEL_BODY (stmt
) = body
;
4232 return add_stmt (stmt
);
4236 begin_omp_task (void)
4238 keep_next_level (true);
4239 return begin_omp_structured_block ();
4243 finish_omp_task (tree clauses
, tree body
)
4247 body
= finish_omp_structured_block (body
);
4249 stmt
= make_node (OMP_TASK
);
4250 TREE_TYPE (stmt
) = void_type_node
;
4251 OMP_TASK_CLAUSES (stmt
) = clauses
;
4252 OMP_TASK_BODY (stmt
) = body
;
4254 return add_stmt (stmt
);
4257 /* Helper function for finish_omp_for. Convert Ith random access iterator
4258 into integral iterator. Return FALSE if successful. */
4261 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4262 tree condv
, tree incrv
, tree
*body
,
4263 tree
*pre_body
, tree clauses
)
4265 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4266 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4267 tree decl
= TREE_VEC_ELT (declv
, i
);
4268 tree init
= TREE_VEC_ELT (initv
, i
);
4269 tree cond
= TREE_VEC_ELT (condv
, i
);
4270 tree incr
= TREE_VEC_ELT (incrv
, i
);
4272 location_t elocus
= locus
;
4274 if (init
&& EXPR_HAS_LOCATION (init
))
4275 elocus
= EXPR_LOCATION (init
);
4277 switch (TREE_CODE (cond
))
4283 if (TREE_OPERAND (cond
, 1) == iter
)
4284 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4285 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4286 if (TREE_OPERAND (cond
, 0) != iter
)
4287 cond
= error_mark_node
;
4290 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4291 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4292 NULL
, tf_warning_or_error
);
4293 if (error_operand_p (tem
))
4298 cond
= error_mark_node
;
4301 if (cond
== error_mark_node
)
4303 error_at (elocus
, "invalid controlling predicate");
4306 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4307 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4308 tf_warning_or_error
);
4309 if (error_operand_p (diff
))
4311 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4313 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4314 TREE_OPERAND (cond
, 1), iter
);
4318 switch (TREE_CODE (incr
))
4320 case PREINCREMENT_EXPR
:
4321 case PREDECREMENT_EXPR
:
4322 case POSTINCREMENT_EXPR
:
4323 case POSTDECREMENT_EXPR
:
4324 if (TREE_OPERAND (incr
, 0) != iter
)
4326 incr
= error_mark_node
;
4329 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4330 tf_warning_or_error
);
4331 if (error_operand_p (iter_incr
))
4333 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4334 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4335 incr
= integer_one_node
;
4337 incr
= integer_minus_one_node
;
4340 if (TREE_OPERAND (incr
, 0) != iter
)
4341 incr
= error_mark_node
;
4342 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4343 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4345 tree rhs
= TREE_OPERAND (incr
, 1);
4346 if (TREE_OPERAND (rhs
, 0) == iter
)
4348 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4350 incr
= error_mark_node
;
4353 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4354 TREE_OPERAND (rhs
, 1),
4355 tf_warning_or_error
);
4356 if (error_operand_p (iter_incr
))
4358 incr
= TREE_OPERAND (rhs
, 1);
4359 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4360 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4362 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4363 incr
= fold_if_not_in_template (incr
);
4365 if (TREE_CODE (incr
) != INTEGER_CST
4366 && (TREE_CODE (incr
) != NOP_EXPR
4367 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4372 else if (TREE_OPERAND (rhs
, 1) == iter
)
4374 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4375 || TREE_CODE (rhs
) != PLUS_EXPR
)
4376 incr
= error_mark_node
;
4379 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4380 TREE_OPERAND (rhs
, 0),
4383 tf_warning_or_error
);
4384 if (error_operand_p (iter_incr
))
4386 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4388 tf_warning_or_error
);
4389 if (error_operand_p (iter_incr
))
4391 incr
= TREE_OPERAND (rhs
, 0);
4396 incr
= error_mark_node
;
4399 incr
= error_mark_node
;
4402 incr
= error_mark_node
;
4406 if (incr
== error_mark_node
)
4408 error_at (elocus
, "invalid increment expression");
4412 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4413 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4414 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4415 && OMP_CLAUSE_DECL (c
) == iter
)
4418 decl
= create_temporary_var (TREE_TYPE (diff
));
4420 add_decl_expr (decl
);
4421 last
= create_temporary_var (TREE_TYPE (diff
));
4423 add_decl_expr (last
);
4424 if (c
&& iter_incr
== NULL
)
4426 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4427 pushdecl (incr_var
);
4428 add_decl_expr (incr_var
);
4430 gcc_assert (stmts_are_full_exprs_p ());
4432 orig_pre_body
= *pre_body
;
4433 *pre_body
= push_stmt_list ();
4435 add_stmt (orig_pre_body
);
4437 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4438 tf_warning_or_error
));
4439 init
= build_int_cst (TREE_TYPE (diff
), 0);
4440 if (c
&& iter_incr
== NULL
)
4442 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4443 incr
, tf_warning_or_error
));
4445 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4446 tf_warning_or_error
);
4448 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4449 tf_warning_or_error
));
4450 *pre_body
= pop_stmt_list (*pre_body
);
4452 cond
= cp_build_binary_op (elocus
,
4453 TREE_CODE (cond
), decl
, diff
,
4454 tf_warning_or_error
);
4455 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4456 elocus
, incr
, NULL_TREE
);
4459 *body
= push_stmt_list ();
4460 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4461 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4462 tf_warning_or_error
);
4463 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4464 finish_expr_stmt (iter_init
);
4465 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4466 tf_warning_or_error
));
4467 add_stmt (orig_body
);
4468 *body
= pop_stmt_list (*body
);
4472 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4473 finish_expr_stmt (iter_incr
);
4474 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4475 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4478 TREE_VEC_ELT (declv
, i
) = decl
;
4479 TREE_VEC_ELT (initv
, i
) = init
;
4480 TREE_VEC_ELT (condv
, i
) = cond
;
4481 TREE_VEC_ELT (incrv
, i
) = incr
;
4486 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4487 are directly for their associated operands in the statement. DECL
4488 and INIT are a combo; if DECL is NULL then INIT ought to be a
4489 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4490 optional statements that need to go before the loop into its
4494 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4495 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4497 tree omp_for
= NULL
, orig_incr
= NULL
;
4498 tree decl
, init
, cond
, incr
;
4502 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4503 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4504 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4505 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4507 decl
= TREE_VEC_ELT (declv
, i
);
4508 init
= TREE_VEC_ELT (initv
, i
);
4509 cond
= TREE_VEC_ELT (condv
, i
);
4510 incr
= TREE_VEC_ELT (incrv
, i
);
4516 switch (TREE_CODE (init
))
4519 decl
= TREE_OPERAND (init
, 0);
4520 init
= TREE_OPERAND (init
, 1);
4523 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4525 decl
= TREE_OPERAND (init
, 0);
4526 init
= TREE_OPERAND (init
, 2);
4536 "expected iteration declaration or initialization");
4541 if (init
&& EXPR_HAS_LOCATION (init
))
4542 elocus
= EXPR_LOCATION (init
);
4546 error_at (elocus
, "missing controlling predicate");
4552 error_at (elocus
, "missing increment expression");
4556 TREE_VEC_ELT (declv
, i
) = decl
;
4557 TREE_VEC_ELT (initv
, i
) = init
;
4560 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4564 stmt
= make_node (OMP_FOR
);
4566 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4568 /* This is really just a place-holder. We'll be decomposing this
4569 again and going through the cp_build_modify_expr path below when
4570 we instantiate the thing. */
4571 TREE_VEC_ELT (initv
, i
)
4572 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4573 TREE_VEC_ELT (initv
, i
));
4576 TREE_TYPE (stmt
) = void_type_node
;
4577 OMP_FOR_INIT (stmt
) = initv
;
4578 OMP_FOR_COND (stmt
) = condv
;
4579 OMP_FOR_INCR (stmt
) = incrv
;
4580 OMP_FOR_BODY (stmt
) = body
;
4581 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4582 OMP_FOR_CLAUSES (stmt
) = clauses
;
4584 SET_EXPR_LOCATION (stmt
, locus
);
4585 return add_stmt (stmt
);
4588 if (processing_template_decl
)
4589 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4591 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4593 decl
= TREE_VEC_ELT (declv
, i
);
4594 init
= TREE_VEC_ELT (initv
, i
);
4595 cond
= TREE_VEC_ELT (condv
, i
);
4596 incr
= TREE_VEC_ELT (incrv
, i
);
4598 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4601 if (init
&& EXPR_HAS_LOCATION (init
))
4602 elocus
= EXPR_LOCATION (init
);
4606 error_at (elocus
, "expected iteration declaration or initialization");
4610 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4613 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4614 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4615 TREE_CODE (TREE_OPERAND (incr
, 1)),
4616 TREE_OPERAND (incr
, 2),
4617 tf_warning_or_error
);
4620 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4622 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4623 incrv
, &body
, &pre_body
, clauses
))
4628 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4629 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4631 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4635 if (!processing_template_decl
)
4637 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4638 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4641 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4643 && TREE_SIDE_EFFECTS (cond
)
4644 && COMPARISON_CLASS_P (cond
)
4645 && !processing_template_decl
)
4647 tree t
= TREE_OPERAND (cond
, 0);
4648 if (TREE_SIDE_EFFECTS (t
)
4650 && (TREE_CODE (t
) != NOP_EXPR
4651 || TREE_OPERAND (t
, 0) != decl
))
4652 TREE_OPERAND (cond
, 0)
4653 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4655 t
= TREE_OPERAND (cond
, 1);
4656 if (TREE_SIDE_EFFECTS (t
)
4658 && (TREE_CODE (t
) != NOP_EXPR
4659 || TREE_OPERAND (t
, 0) != decl
))
4660 TREE_OPERAND (cond
, 1)
4661 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4663 if (decl
== error_mark_node
|| init
== error_mark_node
)
4666 TREE_VEC_ELT (declv
, i
) = decl
;
4667 TREE_VEC_ELT (initv
, i
) = init
;
4668 TREE_VEC_ELT (condv
, i
) = cond
;
4669 TREE_VEC_ELT (incrv
, i
) = incr
;
4673 if (IS_EMPTY_STMT (pre_body
))
4676 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4679 if (omp_for
== NULL
)
4682 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4684 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4685 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4687 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4690 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4691 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4692 && !processing_template_decl
)
4694 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4695 if (TREE_SIDE_EFFECTS (t
)
4697 && (TREE_CODE (t
) != NOP_EXPR
4698 || TREE_OPERAND (t
, 0) != decl
))
4699 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4700 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4702 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4703 if (TREE_SIDE_EFFECTS (t
)
4705 && (TREE_CODE (t
) != NOP_EXPR
4706 || TREE_OPERAND (t
, 0) != decl
))
4707 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4708 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4712 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4714 if (omp_for
!= NULL
)
4715 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4720 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
4721 tree rhs
, tree v
, tree lhs1
, tree rhs1
)
4736 dependent_p
= false;
4739 /* Even in a template, we can detect invalid uses of the atomic
4740 pragma if neither LHS nor RHS is type-dependent. */
4741 if (processing_template_decl
)
4743 dependent_p
= (type_dependent_expression_p (lhs
)
4744 || (rhs
&& type_dependent_expression_p (rhs
))
4745 || (v
&& type_dependent_expression_p (v
))
4746 || (lhs1
&& type_dependent_expression_p (lhs1
))
4747 || (rhs1
&& type_dependent_expression_p (rhs1
)));
4750 lhs
= build_non_dependent_expr (lhs
);
4752 rhs
= build_non_dependent_expr (rhs
);
4754 v
= build_non_dependent_expr (v
);
4756 lhs1
= build_non_dependent_expr (lhs1
);
4758 rhs1
= build_non_dependent_expr (rhs1
);
4763 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
4765 if (stmt
== error_mark_node
)
4768 if (processing_template_decl
)
4770 if (code
== OMP_ATOMIC_READ
)
4772 stmt
= build_min_nt (OMP_ATOMIC_READ
, orig_lhs
);
4773 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
4777 if (opcode
== NOP_EXPR
)
4778 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
4780 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
4782 stmt
= build_min_nt (COMPOUND_EXPR
, orig_rhs1
, stmt
);
4783 if (code
!= OMP_ATOMIC
)
4785 stmt
= build_min_nt (code
, orig_lhs1
, stmt
);
4786 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
4789 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
4795 finish_omp_barrier (void)
4797 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4798 VEC(tree
,gc
) *vec
= make_tree_vector ();
4799 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4800 release_tree_vector (vec
);
4801 finish_expr_stmt (stmt
);
4805 finish_omp_flush (void)
4807 tree fn
= built_in_decls
[BUILT_IN_SYNC_SYNCHRONIZE
];
4808 VEC(tree
,gc
) *vec
= make_tree_vector ();
4809 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4810 release_tree_vector (vec
);
4811 finish_expr_stmt (stmt
);
4815 finish_omp_taskwait (void)
4817 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4818 VEC(tree
,gc
) *vec
= make_tree_vector ();
4819 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4820 release_tree_vector (vec
);
4821 finish_expr_stmt (stmt
);
4825 finish_omp_taskyield (void)
4827 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKYIELD
];
4828 VEC(tree
,gc
) *vec
= make_tree_vector ();
4829 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4830 release_tree_vector (vec
);
4831 finish_expr_stmt (stmt
);
4835 init_cp_semantics (void)
4839 /* Build a STATIC_ASSERT for a static assertion with the condition
4840 CONDITION and the message text MESSAGE. LOCATION is the location
4841 of the static assertion in the source code. When MEMBER_P, this
4842 static assertion is a member of a class. */
4844 finish_static_assert (tree condition
, tree message
, location_t location
,
4847 if (check_for_bare_parameter_packs (condition
))
4848 condition
= error_mark_node
;
4850 if (type_dependent_expression_p (condition
)
4851 || value_dependent_expression_p (condition
))
4853 /* We're in a template; build a STATIC_ASSERT and put it in
4857 assertion
= make_node (STATIC_ASSERT
);
4858 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4859 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4860 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4863 maybe_add_class_template_decl_list (current_class_type
,
4867 add_stmt (assertion
);
4872 /* Fold the expression and convert it to a boolean value. */
4873 condition
= fold_non_dependent_expr (condition
);
4874 condition
= cp_convert (boolean_type_node
, condition
);
4875 condition
= maybe_constant_value (condition
);
4877 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4878 /* Do nothing; the condition is satisfied. */
4882 location_t saved_loc
= input_location
;
4884 input_location
= location
;
4885 if (TREE_CODE (condition
) == INTEGER_CST
4886 && integer_zerop (condition
))
4887 /* Report the error. */
4888 error ("static assertion failed: %E", message
);
4889 else if (condition
&& condition
!= error_mark_node
)
4891 error ("non-constant condition for static assertion");
4892 cxx_constant_value (condition
);
4894 input_location
= saved_loc
;
4898 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4899 suitable for use as a type-specifier.
4901 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4902 id-expression or a class member access, FALSE when it was parsed as
4903 a full expression. */
4906 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
4907 tsubst_flags_t complain
)
4909 tree type
= NULL_TREE
;
4911 if (!expr
|| error_operand_p (expr
))
4912 return error_mark_node
;
4915 || TREE_CODE (expr
) == TYPE_DECL
4916 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4917 && TYPE_P (TREE_OPERAND (expr
, 0))))
4919 if (complain
& tf_error
)
4920 error ("argument to decltype must be an expression");
4921 return error_mark_node
;
4924 /* FIXME instantiation-dependent */
4925 if (type_dependent_expression_p (expr
)
4926 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4927 if it isn't dependent, so that we can check access control at
4928 instantiation time, so defer the decltype as well (PR 42277). */
4929 || (id_expression_or_member_access_p
4930 && processing_template_decl
4931 && TREE_CODE (expr
) == COMPONENT_REF
))
4933 type
= cxx_make_type (DECLTYPE_TYPE
);
4934 DECLTYPE_TYPE_EXPR (type
) = expr
;
4935 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4936 = id_expression_or_member_access_p
;
4937 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4942 /* The type denoted by decltype(e) is defined as follows: */
4944 expr
= resolve_nondeduced_context (expr
);
4946 if (type_unknown_p (expr
))
4948 if (complain
& tf_error
)
4949 error ("decltype cannot resolve address of overloaded function");
4950 return error_mark_node
;
4953 if (invalid_nonstatic_memfn_p (expr
, complain
))
4954 return error_mark_node
;
4956 /* To get the size of a static data member declared as an array of
4957 unknown bound, we need to instantiate it. */
4958 if (TREE_CODE (expr
) == VAR_DECL
4959 && VAR_HAD_UNKNOWN_BOUND (expr
)
4960 && DECL_TEMPLATE_INSTANTIATION (expr
))
4961 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4963 if (id_expression_or_member_access_p
)
4965 /* If e is an id-expression or a class member access (5.2.5
4966 [expr.ref]), decltype(e) is defined as the type of the entity
4967 named by e. If there is no such entity, or e names a set of
4968 overloaded functions, the program is ill-formed. */
4969 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4970 expr
= lookup_name (expr
);
4972 if (TREE_CODE (expr
) == INDIRECT_REF
)
4973 /* This can happen when the expression is, e.g., "a.b". Just
4974 look at the underlying operand. */
4975 expr
= TREE_OPERAND (expr
, 0);
4977 if (TREE_CODE (expr
) == OFFSET_REF
4978 || TREE_CODE (expr
) == MEMBER_REF
)
4979 /* We're only interested in the field itself. If it is a
4980 BASELINK, we will need to see through it in the next
4982 expr
= TREE_OPERAND (expr
, 1);
4984 if (TREE_CODE (expr
) == BASELINK
)
4985 /* See through BASELINK nodes to the underlying function. */
4986 expr
= BASELINK_FUNCTIONS (expr
);
4988 switch (TREE_CODE (expr
))
4991 if (DECL_BIT_FIELD_TYPE (expr
))
4993 type
= DECL_BIT_FIELD_TYPE (expr
);
4996 /* Fall through for fields that aren't bitfields. */
5003 case TEMPLATE_PARM_INDEX
:
5004 expr
= mark_type_use (expr
);
5005 type
= TREE_TYPE (expr
);
5009 type
= error_mark_node
;
5013 mark_type_use (expr
);
5014 type
= is_bitfield_expr_with_lowered_type (expr
);
5016 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
5023 /* We can get here when the id-expression refers to an
5025 type
= TREE_TYPE (expr
);
5030 return error_mark_node
;
5035 /* Within a lambda-expression:
5037 Every occurrence of decltype((x)) where x is a possibly
5038 parenthesized id-expression that names an entity of
5039 automatic storage duration is treated as if x were
5040 transformed into an access to a corresponding data member
5041 of the closure type that would have been declared if x
5042 were a use of the denoted entity. */
5043 if (outer_automatic_var_p (expr
)
5044 && current_function_decl
5045 && LAMBDA_FUNCTION_P (current_function_decl
))
5046 type
= capture_decltype (expr
);
5047 else if (error_operand_p (expr
))
5048 type
= error_mark_node
;
5049 else if (expr
== current_class_ptr
)
5050 /* If the expression is just "this", we want the
5051 cv-unqualified pointer for the "this" type. */
5052 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
5055 /* Otherwise, where T is the type of e, if e is an lvalue,
5056 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5057 cp_lvalue_kind clk
= lvalue_kind (expr
);
5058 type
= unlowered_expr_type (expr
);
5059 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
5060 if (clk
!= clk_none
&& !(clk
& clk_class
))
5061 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
5068 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5069 __has_nothrow_copy, depending on assign_p. */
5072 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5079 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5082 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5084 else if (TYPE_HAS_COPY_CTOR (type
))
5086 /* If construction of the copy constructor was postponed, create
5088 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5089 lazily_declare_fn (sfk_copy_constructor
, type
);
5090 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5091 lazily_declare_fn (sfk_move_constructor
, type
);
5092 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5097 for (; fns
; fns
= OVL_NEXT (fns
))
5099 tree fn
= OVL_CURRENT (fns
);
5103 if (copy_fn_p (fn
) == 0)
5106 else if (copy_fn_p (fn
) <= 0)
5109 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5116 /* Actually evaluates the trait. */
5119 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5121 enum tree_code type_code1
;
5124 type_code1
= TREE_CODE (type1
);
5128 case CPTK_HAS_NOTHROW_ASSIGN
:
5129 type1
= strip_array_types (type1
);
5130 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5131 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5132 || (CLASS_TYPE_P (type1
)
5133 && classtype_has_nothrow_assign_or_copy_p (type1
,
5136 case CPTK_HAS_TRIVIAL_ASSIGN
:
5137 /* ??? The standard seems to be missing the "or array of such a class
5138 type" wording for this trait. */
5139 type1
= strip_array_types (type1
);
5140 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5141 && (trivial_type_p (type1
)
5142 || (CLASS_TYPE_P (type1
)
5143 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5145 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5146 type1
= strip_array_types (type1
);
5147 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5148 || (CLASS_TYPE_P (type1
)
5149 && (t
= locate_ctor (type1
))
5150 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5152 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5153 type1
= strip_array_types (type1
);
5154 return (trivial_type_p (type1
)
5155 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5157 case CPTK_HAS_NOTHROW_COPY
:
5158 type1
= strip_array_types (type1
);
5159 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5160 || (CLASS_TYPE_P (type1
)
5161 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5163 case CPTK_HAS_TRIVIAL_COPY
:
5164 /* ??? The standard seems to be missing the "or array of such a class
5165 type" wording for this trait. */
5166 type1
= strip_array_types (type1
);
5167 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5168 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5170 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5171 type1
= strip_array_types (type1
);
5172 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5173 || (CLASS_TYPE_P (type1
)
5174 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5176 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5177 return type_has_virtual_destructor (type1
);
5179 case CPTK_IS_ABSTRACT
:
5180 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5182 case CPTK_IS_BASE_OF
:
5183 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5184 && DERIVED_FROM_P (type1
, type2
));
5187 return (NON_UNION_CLASS_TYPE_P (type1
));
5189 case CPTK_IS_CONVERTIBLE_TO
:
5194 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5197 return (type_code1
== ENUMERAL_TYPE
);
5199 case CPTK_IS_LITERAL_TYPE
:
5200 return (literal_type_p (type1
));
5203 return (pod_type_p (type1
));
5205 case CPTK_IS_POLYMORPHIC
:
5206 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5208 case CPTK_IS_STD_LAYOUT
:
5209 return (std_layout_type_p (type1
));
5211 case CPTK_IS_TRIVIAL
:
5212 return (trivial_type_p (type1
));
5215 return (type_code1
== UNION_TYPE
);
5223 /* Returns true if TYPE is a complete type, an array of unknown bound,
5224 or (possibly cv-qualified) void, returns false otherwise. */
5227 check_trait_type (tree type
)
5229 if (COMPLETE_TYPE_P (type
))
5232 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5233 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5236 if (VOID_TYPE_P (type
))
5242 /* Process a trait expression. */
5245 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5247 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5248 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5249 || kind
== CPTK_HAS_NOTHROW_COPY
5250 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5251 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5252 || kind
== CPTK_HAS_TRIVIAL_COPY
5253 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5254 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5255 || kind
== CPTK_IS_ABSTRACT
5256 || kind
== CPTK_IS_BASE_OF
5257 || kind
== CPTK_IS_CLASS
5258 || kind
== CPTK_IS_CONVERTIBLE_TO
5259 || kind
== CPTK_IS_EMPTY
5260 || kind
== CPTK_IS_ENUM
5261 || kind
== CPTK_IS_LITERAL_TYPE
5262 || kind
== CPTK_IS_POD
5263 || kind
== CPTK_IS_POLYMORPHIC
5264 || kind
== CPTK_IS_STD_LAYOUT
5265 || kind
== CPTK_IS_TRIVIAL
5266 || kind
== CPTK_IS_UNION
);
5268 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5270 sorry ("__is_convertible_to");
5271 return error_mark_node
;
5274 if (type1
== error_mark_node
5275 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5276 && type2
== error_mark_node
))
5277 return error_mark_node
;
5279 if (processing_template_decl
)
5281 tree trait_expr
= make_node (TRAIT_EXPR
);
5282 TREE_TYPE (trait_expr
) = boolean_type_node
;
5283 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5284 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5285 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5289 complete_type (type1
);
5291 complete_type (type2
);
5295 case CPTK_HAS_NOTHROW_ASSIGN
:
5296 case CPTK_HAS_TRIVIAL_ASSIGN
:
5297 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5298 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5299 case CPTK_HAS_NOTHROW_COPY
:
5300 case CPTK_HAS_TRIVIAL_COPY
:
5301 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5302 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5303 case CPTK_IS_ABSTRACT
:
5305 case CPTK_IS_LITERAL_TYPE
:
5307 case CPTK_IS_POLYMORPHIC
:
5308 case CPTK_IS_STD_LAYOUT
:
5309 case CPTK_IS_TRIVIAL
:
5310 if (!check_trait_type (type1
))
5312 error ("incomplete type %qT not allowed", type1
);
5313 return error_mark_node
;
5317 case CPTK_IS_BASE_OF
:
5318 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5319 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5320 && !COMPLETE_TYPE_P (type2
))
5322 error ("incomplete type %qT not allowed", type2
);
5323 return error_mark_node
;
5332 case CPTK_IS_CONVERTIBLE_TO
:
5337 return (trait_expr_value (kind
, type1
, type2
)
5338 ? boolean_true_node
: boolean_false_node
);
5341 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5342 which is ignored for C++. */
5345 set_float_const_decimal64 (void)
5350 clear_float_const_decimal64 (void)
5355 float_const_decimal64_p (void)
5361 /* Return true if T is a literal type. */
5364 literal_type_p (tree t
)
5366 if (SCALAR_TYPE_P (t
)
5367 || TREE_CODE (t
) == REFERENCE_TYPE
)
5369 if (CLASS_TYPE_P (t
))
5371 t
= complete_type (t
);
5372 gcc_assert (COMPLETE_TYPE_P (t
) || errorcount
);
5373 return CLASSTYPE_LITERAL_P (t
);
5375 if (TREE_CODE (t
) == ARRAY_TYPE
)
5376 return literal_type_p (strip_array_types (t
));
5380 /* If DECL is a variable declared `constexpr', require its type
5381 be literal. Return the DECL if OK, otherwise NULL. */
5384 ensure_literal_type_for_constexpr_object (tree decl
)
5386 tree type
= TREE_TYPE (decl
);
5387 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5388 && !processing_template_decl
)
5390 if (CLASS_TYPE_P (type
) && !COMPLETE_TYPE_P (complete_type (type
)))
5391 /* Don't complain here, we'll complain about incompleteness
5392 when we try to initialize the variable. */;
5393 else if (!literal_type_p (type
))
5395 error ("the type %qT of constexpr variable %qD is not literal",
5397 explain_non_literal_class (type
);
5404 /* Representation of entries in the constexpr function definition table. */
5406 typedef struct GTY(()) constexpr_fundef
{
5411 /* This table holds all constexpr function definitions seen in
5412 the current translation unit. */
5414 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5416 /* Utility function used for managing the constexpr function table.
5417 Return true if the entries pointed to by P and Q are for the
5418 same constexpr function. */
5421 constexpr_fundef_equal (const void *p
, const void *q
)
5423 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5424 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5425 return lhs
->decl
== rhs
->decl
;
5428 /* Utility function used for managing the constexpr function table.
5429 Return a hash value for the entry pointed to by Q. */
5431 static inline hashval_t
5432 constexpr_fundef_hash (const void *p
)
5434 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5435 return DECL_UID (fundef
->decl
);
5438 /* Return a previously saved definition of function FUN. */
5440 static constexpr_fundef
*
5441 retrieve_constexpr_fundef (tree fun
)
5443 constexpr_fundef fundef
= { NULL
, NULL
};
5444 if (constexpr_fundef_table
== NULL
)
5448 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5451 /* Check whether the parameter and return types of FUN are valid for a
5452 constexpr function, and complain if COMPLAIN. */
5455 is_valid_constexpr_fn (tree fun
, bool complain
)
5457 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5459 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5460 if (!literal_type_p (TREE_TYPE (parm
)))
5465 error ("invalid type for parameter %d of constexpr "
5466 "function %q+#D", DECL_PARM_INDEX (parm
), fun
);
5467 explain_non_literal_class (TREE_TYPE (parm
));
5471 if (!DECL_CONSTRUCTOR_P (fun
))
5473 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5474 if (!literal_type_p (rettype
))
5479 error ("invalid return type %qT of constexpr function %q+D",
5481 explain_non_literal_class (rettype
);
5485 /* Check this again here for cxx_eval_call_expression. */
5486 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5487 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun
)))
5492 error ("enclosing class of constexpr non-static member "
5493 "function %q+#D is not a literal type", fun
);
5494 explain_non_literal_class (DECL_CONTEXT (fun
));
5502 /* Return non-null if FUN certainly designates a valid constexpr function
5503 declaration. Otherwise return NULL. Issue appropriate diagnostics
5504 if necessary. Note that we only check the declaration, not the body
5508 validate_constexpr_fundecl (tree fun
)
5510 if (processing_template_decl
|| !DECL_DECLARED_CONSTEXPR_P (fun
))
5512 else if (DECL_CLONED_FUNCTION_P (fun
))
5513 /* We already checked the original function. */
5516 if (!is_valid_constexpr_fn (fun
, !DECL_TEMPLATE_INFO (fun
)))
5518 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5525 /* Subroutine of build_constexpr_constructor_member_initializers.
5526 The expression tree T represents a data member initialization
5527 in a (constexpr) constructor definition. Build a pairing of
5528 the data member with its initializer, and prepend that pair
5529 to the existing initialization pair INITS. */
5532 build_data_member_initialization (tree t
, VEC(constructor_elt
,gc
) **vec
)
5535 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5536 t
= TREE_OPERAND (t
, 0);
5537 if (TREE_CODE (t
) == EXPR_STMT
)
5538 t
= TREE_OPERAND (t
, 0);
5539 if (t
== error_mark_node
)
5541 if (TREE_CODE (t
) == STATEMENT_LIST
)
5543 tree_stmt_iterator i
;
5544 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5546 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5551 if (TREE_CODE (t
) == CLEANUP_STMT
)
5553 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5554 but we can in a constexpr constructor for a non-literal class. Just
5555 ignore it; either all the initialization will be constant, in which
5556 case the cleanup can't run, or it can't be constexpr.
5557 Still recurse into CLEANUP_BODY. */
5558 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5560 if (TREE_CODE (t
) == CONVERT_EXPR
)
5561 t
= TREE_OPERAND (t
, 0);
5562 if (TREE_CODE (t
) == INIT_EXPR
5563 || TREE_CODE (t
) == MODIFY_EXPR
)
5565 member
= TREE_OPERAND (t
, 0);
5566 init
= unshare_expr (TREE_OPERAND (t
, 1));
5570 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
5571 member
= CALL_EXPR_ARG (t
, 0);
5572 /* We don't use build_cplus_new here because it complains about
5573 abstract bases. Leaving the call unwrapped means that it has the
5574 wrong type, but cxx_eval_constant_expression doesn't care. */
5575 init
= unshare_expr (t
);
5577 if (TREE_CODE (member
) == INDIRECT_REF
)
5578 member
= TREE_OPERAND (member
, 0);
5579 if (TREE_CODE (member
) == NOP_EXPR
)
5583 if (TREE_CODE (op
) == ADDR_EXPR
)
5585 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5586 (TREE_TYPE (TREE_TYPE (op
)),
5587 TREE_TYPE (TREE_TYPE (member
))));
5588 /* Initializing a cv-qualified member; we need to look through
5594 /* We don't put out anything for an empty base. */
5595 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
5596 /* But if the initializer isn't constexpr, leave it in so we
5598 if (potential_constant_expression (init
))
5602 if (TREE_CODE (member
) == ADDR_EXPR
)
5603 member
= TREE_OPERAND (member
, 0);
5604 if (TREE_CODE (member
) == COMPONENT_REF
5605 /* If we're initializing a member of a subaggregate, it's a vtable
5606 pointer. Leave it as COMPONENT_REF so we remember the path to get
5608 && TREE_CODE (TREE_OPERAND (member
, 0)) != COMPONENT_REF
)
5609 member
= TREE_OPERAND (member
, 1);
5610 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
5614 /* Make sure that there are no statements after LAST in the constructor
5615 body represented by LIST. */
5618 check_constexpr_ctor_body (tree last
, tree list
)
5621 if (TREE_CODE (list
) == STATEMENT_LIST
)
5623 tree_stmt_iterator i
= tsi_last (list
);
5624 for (; !tsi_end_p (i
); tsi_prev (&i
))
5626 tree t
= tsi_stmt (i
);
5629 if (TREE_CODE (t
) == BIND_EXPR
)
5631 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
5636 /* We currently allow typedefs and static_assert.
5637 FIXME allow them in the standard, too. */
5638 if (TREE_CODE (t
) != STATIC_ASSERT
)
5645 else if (list
!= last
5646 && TREE_CODE (list
) != STATIC_ASSERT
)
5650 error ("constexpr constructor does not have empty body");
5651 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
5656 /* Build compile-time evalable representations of member-initializer list
5657 for a constexpr constructor. */
5660 build_constexpr_constructor_member_initializers (tree type
, tree body
)
5662 VEC(constructor_elt
,gc
) *vec
= NULL
;
5664 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
5665 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
5666 body
= TREE_OPERAND (body
, 0);
5667 if (TREE_CODE (body
) == STATEMENT_LIST
)
5668 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
5669 body
= BIND_EXPR_BODY (body
);
5670 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5672 body
= TREE_OPERAND (body
, 0);
5673 if (TREE_CODE (body
) == EXPR_STMT
)
5674 body
= TREE_OPERAND (body
, 0);
5675 if (TREE_CODE (body
) == INIT_EXPR
5676 && (same_type_ignoring_top_level_qualifiers_p
5677 (TREE_TYPE (TREE_OPERAND (body
, 0)),
5678 current_class_type
)))
5681 return TREE_OPERAND (body
, 1);
5683 ok
= build_data_member_initialization (body
, &vec
);
5685 else if (TREE_CODE (body
) == STATEMENT_LIST
)
5687 tree_stmt_iterator i
;
5688 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5690 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
5696 gcc_assert (errorcount
> 0);
5698 return build_constructor (type
, vec
);
5700 return error_mark_node
;
5703 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5704 declared to be constexpr, or a sub-statement thereof. Returns the
5705 return value if suitable, error_mark_node for a statement not allowed in
5706 a constexpr function, or NULL_TREE if no return value was found. */
5709 constexpr_fn_retval (tree body
)
5711 switch (TREE_CODE (body
))
5713 case STATEMENT_LIST
:
5715 tree_stmt_iterator i
;
5716 tree expr
= NULL_TREE
;
5717 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5719 tree s
= constexpr_fn_retval (tsi_stmt (i
));
5720 if (s
== error_mark_node
)
5721 return error_mark_node
;
5722 else if (s
== NULL_TREE
)
5723 /* Keep iterating. */;
5725 /* Multiple return statements. */
5726 return error_mark_node
;
5734 return unshare_expr (TREE_OPERAND (body
, 0));
5737 if (TREE_CODE (DECL_EXPR_DECL (body
)) == USING_DECL
)
5739 return error_mark_node
;
5741 case CLEANUP_POINT_EXPR
:
5742 return constexpr_fn_retval (TREE_OPERAND (body
, 0));
5748 return error_mark_node
;
5752 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
5753 FUN; do the necessary transformations to turn it into a single expression
5754 that we can store in the hash table. */
5757 massage_constexpr_body (tree fun
, tree body
)
5759 if (DECL_CONSTRUCTOR_P (fun
))
5760 body
= build_constexpr_constructor_member_initializers
5761 (DECL_CONTEXT (fun
), body
);
5764 if (TREE_CODE (body
) == BIND_EXPR
)
5765 body
= BIND_EXPR_BODY (body
);
5766 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
5767 body
= EH_SPEC_STMTS (body
);
5768 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
5769 body
= TREE_OPERAND (body
, 0);
5770 body
= constexpr_fn_retval (body
);
5775 /* We are processing the definition of the constexpr function FUN.
5776 Check that its BODY fulfills the propriate requirements and
5777 enter it in the constexpr function definition table.
5778 For constructor BODY is actually the TREE_LIST of the
5779 member-initializer list. */
5782 register_constexpr_fundef (tree fun
, tree body
)
5784 constexpr_fundef entry
;
5785 constexpr_fundef
**slot
;
5787 body
= massage_constexpr_body (fun
, body
);
5788 if (body
== NULL_TREE
|| body
== error_mark_node
)
5790 error ("body of constexpr function %qD not a return-statement", fun
);
5791 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5795 if (!potential_rvalue_constant_expression (body
))
5797 DECL_DECLARED_CONSTEXPR_P (fun
) = false;
5798 if (!DECL_TEMPLATE_INFO (fun
))
5799 require_potential_rvalue_constant_expression (body
);
5803 /* Create the constexpr function table if necessary. */
5804 if (constexpr_fundef_table
== NULL
)
5805 constexpr_fundef_table
= htab_create_ggc (101,
5806 constexpr_fundef_hash
,
5807 constexpr_fundef_equal
,
5811 slot
= (constexpr_fundef
**)
5812 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
5814 gcc_assert (*slot
== NULL
);
5815 *slot
= ggc_alloc_constexpr_fundef ();
5821 /* FUN is a non-constexpr function called in a context that requires a
5822 constant expression. If it comes from a constexpr template, explain why
5823 the instantiation isn't constexpr. */
5826 explain_invalid_constexpr_fn (tree fun
)
5828 static struct pointer_set_t
*diagnosed
;
5830 location_t save_loc
;
5831 /* Only diagnose instantiations of constexpr templates. */
5832 if (!is_instantiation_of_constexpr (fun
))
5834 if (diagnosed
== NULL
)
5835 diagnosed
= pointer_set_create ();
5836 if (pointer_set_insert (diagnosed
, fun
) != 0)
5837 /* Already explained. */
5840 save_loc
= input_location
;
5841 input_location
= DECL_SOURCE_LOCATION (fun
);
5842 inform (0, "%q+D is not constexpr because it does not satisfy the "
5843 "requirements:", fun
);
5844 /* First check the declaration. */
5845 if (is_valid_constexpr_fn (fun
, true))
5847 /* Then if it's OK, the body. */
5848 if (DECL_DEFAULTED_FN (fun
))
5849 explain_implicit_non_constexpr (fun
);
5852 body
= massage_constexpr_body (fun
, DECL_SAVED_TREE (fun
));
5853 require_potential_rvalue_constant_expression (body
);
5856 input_location
= save_loc
;
5859 /* Objects of this type represent calls to constexpr functions
5860 along with the bindings of parameters to their arguments, for
5861 the purpose of compile time evaluation. */
5863 typedef struct GTY(()) constexpr_call
{
5864 /* Description of the constexpr function definition. */
5865 constexpr_fundef
*fundef
;
5866 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5867 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5868 Note: This arrangement is made to accomodate the use of
5869 iterative_hash_template_arg (see pt.c). If you change this
5870 representation, also change the hash calculation in
5871 cxx_eval_call_expression. */
5873 /* Result of the call.
5874 NULL means the call is being evaluated.
5875 error_mark_node means that the evaluation was erroneous;
5876 otherwise, the actuall value of the call. */
5878 /* The hash of this call; we remember it here to avoid having to
5879 recalculate it when expanding the hash table. */
5883 /* A table of all constexpr calls that have been evaluated by the
5884 compiler in this translation unit. */
5886 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
5888 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
5889 bool, bool, bool *);
5891 /* Compute a hash value for a constexpr call representation. */
5894 constexpr_call_hash (const void *p
)
5896 const constexpr_call
*info
= (const constexpr_call
*) p
;
5900 /* Return 1 if the objects pointed to by P and Q represent calls
5901 to the same constexpr function with the same arguments.
5902 Otherwise, return 0. */
5905 constexpr_call_equal (const void *p
, const void *q
)
5907 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
5908 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
5913 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
5915 lhs_bindings
= lhs
->bindings
;
5916 rhs_bindings
= rhs
->bindings
;
5917 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
5919 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
5920 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
5921 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
5922 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
5924 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
5925 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
5927 return lhs_bindings
== rhs_bindings
;
5930 /* Initialize the constexpr call table, if needed. */
5933 maybe_initialize_constexpr_call_table (void)
5935 if (constexpr_call_table
== NULL
)
5936 constexpr_call_table
= htab_create_ggc (101,
5937 constexpr_call_hash
,
5938 constexpr_call_equal
,
5942 /* Return true if T designates the implied `this' parameter. */
5945 is_this_parameter (tree t
)
5947 return t
== current_class_ptr
;
5950 /* We have an expression tree T that represents a call, either CALL_EXPR
5951 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5952 retrun the _DECL for that function. */
5955 get_function_named_in_call (tree t
)
5958 switch (TREE_CODE (t
))
5961 fun
= CALL_EXPR_FN (t
);
5964 case AGGR_INIT_EXPR
:
5965 fun
= AGGR_INIT_EXPR_FN (t
);
5972 if (TREE_CODE (fun
) == ADDR_EXPR
5973 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
5974 fun
= TREE_OPERAND (fun
, 0);
5978 /* We have an expression tree T that represents a call, either CALL_EXPR
5979 or AGGR_INIT_EXPR. Return the Nth argument. */
5982 get_nth_callarg (tree t
, int n
)
5984 switch (TREE_CODE (t
))
5987 return CALL_EXPR_ARG (t
, n
);
5989 case AGGR_INIT_EXPR
:
5990 return AGGR_INIT_EXPR_ARG (t
, n
);
5998 /* Look up the binding of the function parameter T in a constexpr
5999 function call context CALL. */
6002 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
6004 tree b
= purpose_member (t
, call
->bindings
);
6005 return TREE_VALUE (b
);
6008 /* Attempt to evaluate T which represents a call to a builtin function.
6009 We assume here that all builtin functions evaluate to scalar types
6010 represented by _CST nodes. */
6013 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
6014 bool allow_non_constant
, bool addr
,
6015 bool *non_constant_p
)
6017 const int nargs
= call_expr_nargs (t
);
6018 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
6021 for (i
= 0; i
< nargs
; ++i
)
6023 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
6024 allow_non_constant
, addr
,
6026 if (allow_non_constant
&& *non_constant_p
)
6029 if (*non_constant_p
)
6031 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
6032 CALL_EXPR_FN (t
), nargs
, args
);
6033 return fold (new_call
);
6036 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6037 the type of the value to match. */
6040 adjust_temp_type (tree type
, tree temp
)
6042 if (TREE_TYPE (temp
) == type
)
6044 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6045 if (TREE_CODE (temp
) == CONSTRUCTOR
)
6046 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
6047 gcc_assert (SCALAR_TYPE_P (type
));
6048 return cp_fold_convert (type
, temp
);
6051 /* Subroutine of cxx_eval_call_expression.
6052 We are processing a call expression (either CALL_EXPR or
6053 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6054 all arguments and bind their values to correspondings
6055 parameters, making up the NEW_CALL context. */
6058 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
6059 constexpr_call
*new_call
,
6060 bool allow_non_constant
,
6061 bool *non_constant_p
)
6063 const int nargs
= call_expr_nargs (t
);
6064 tree fun
= new_call
->fundef
->decl
;
6065 tree parms
= DECL_ARGUMENTS (fun
);
6067 for (i
= 0; i
< nargs
; ++i
)
6070 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
6071 /* For member function, the first argument is a pointer to the implied
6072 object. And for an object contruction, don't bind `this' before
6073 it is fully constructed. */
6074 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
6076 x
= get_nth_callarg (t
, i
);
6077 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
6078 TREE_CODE (type
) == REFERENCE_TYPE
,
6080 /* Don't VERIFY_CONSTANT here. */
6081 if (*non_constant_p
&& allow_non_constant
)
6083 /* Just discard ellipsis args after checking their constantitude. */
6086 if (*non_constant_p
)
6087 /* Don't try to adjust the type of non-constant args. */
6090 /* Make sure the binding has the same type as the parm. */
6091 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6092 arg
= adjust_temp_type (type
, arg
);
6093 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
6095 parms
= TREE_CHAIN (parms
);
6099 /* Variables and functions to manage constexpr call expansion context.
6100 These do not need to be marked for PCH or GC. */
6102 /* FIXME remember and print actual constant arguments. */
6103 static VEC(tree
,heap
) *call_stack
= NULL
;
6104 static int call_stack_tick
;
6105 static int last_cx_error_tick
;
6108 push_cx_call_context (tree call
)
6111 if (!EXPR_HAS_LOCATION (call
))
6112 SET_EXPR_LOCATION (call
, input_location
);
6113 VEC_safe_push (tree
, heap
, call_stack
, call
);
6114 if (VEC_length (tree
, call_stack
) > (unsigned) max_constexpr_depth
)
6120 pop_cx_call_context (void)
6123 VEC_pop (tree
, call_stack
);
6127 cx_error_context (void)
6129 VEC(tree
,heap
) *r
= NULL
;
6130 if (call_stack_tick
!= last_cx_error_tick
6131 && !VEC_empty (tree
, call_stack
))
6133 last_cx_error_tick
= call_stack_tick
;
6137 /* Subroutine of cxx_eval_constant_expression.
6138 Evaluate the call expression tree T in the context of OLD_CALL expression
6142 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
6143 bool allow_non_constant
, bool addr
,
6144 bool *non_constant_p
)
6146 location_t loc
= EXPR_LOC_OR_HERE (t
);
6147 tree fun
= get_function_named_in_call (t
);
6149 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
6150 constexpr_call
**slot
;
6151 constexpr_call
*entry
;
6154 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6156 /* Might be a constexpr function pointer. */
6157 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
6158 /*addr*/false, non_constant_p
);
6159 if (TREE_CODE (fun
) == ADDR_EXPR
)
6160 fun
= TREE_OPERAND (fun
, 0);
6162 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6164 if (!allow_non_constant
&& !*non_constant_p
)
6165 error_at (loc
, "expression %qE does not designate a constexpr "
6167 *non_constant_p
= true;
6170 if (DECL_CLONED_FUNCTION_P (fun
))
6171 fun
= DECL_CLONED_FUNCTION (fun
);
6172 if (is_builtin_fn (fun
))
6173 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6174 addr
, non_constant_p
);
6175 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6177 if (!allow_non_constant
)
6179 error_at (loc
, "call to non-constexpr function %qD", fun
);
6180 explain_invalid_constexpr_fn (fun
);
6182 *non_constant_p
= true;
6186 /* Shortcut trivial copy constructor/op=. */
6187 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6189 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6190 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6191 addr
, non_constant_p
);
6194 /* If in direct recursive call, optimize definition search. */
6195 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6196 new_call
.fundef
= old_call
->fundef
;
6199 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6200 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6202 if (!allow_non_constant
)
6203 error_at (loc
, "%qD used before its definition", fun
);
6204 *non_constant_p
= true;
6208 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6209 allow_non_constant
, non_constant_p
);
6210 if (*non_constant_p
)
6213 depth_ok
= push_cx_call_context (t
);
6216 = iterative_hash_template_arg (new_call
.bindings
,
6217 constexpr_fundef_hash (new_call
.fundef
));
6219 /* If we have seen this call before, we are done. */
6220 maybe_initialize_constexpr_call_table ();
6221 slot
= (constexpr_call
**)
6222 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6226 /* We need to keep a pointer to the entry, not just the slot, as the
6227 slot can move in the call to cxx_eval_builtin_function_call. */
6228 *slot
= entry
= ggc_alloc_constexpr_call ();
6231 /* Calls which are in progress have their result set to NULL
6232 so that we can detect circular dependencies. */
6233 else if (entry
->result
== NULL
)
6235 if (!allow_non_constant
)
6236 error ("call has circular dependency");
6237 *non_constant_p
= true;
6238 entry
->result
= result
= error_mark_node
;
6243 if (!allow_non_constant
)
6244 error ("constexpr evaluation depth exceeds maximum of %d (use "
6245 "-fconstexpr-depth= to increase the maximum)",
6246 max_constexpr_depth
);
6247 *non_constant_p
= true;
6248 entry
->result
= result
= error_mark_node
;
6252 result
= entry
->result
;
6253 if (!result
|| (result
== error_mark_node
&& !allow_non_constant
))
6254 result
= (cxx_eval_constant_expression
6255 (&new_call
, new_call
.fundef
->body
,
6256 allow_non_constant
, addr
,
6258 if (result
== error_mark_node
)
6259 *non_constant_p
= true;
6260 if (*non_constant_p
)
6261 entry
->result
= result
= error_mark_node
;
6264 /* If this was a call to initialize an object, set the type of
6265 the CONSTRUCTOR to the type of that object. */
6266 if (DECL_CONSTRUCTOR_P (fun
))
6268 tree ob_arg
= get_nth_callarg (t
, 0);
6269 STRIP_NOPS (ob_arg
);
6270 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6271 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6272 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6275 entry
->result
= result
;
6279 pop_cx_call_context ();
6280 return unshare_expr (result
);
6283 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6286 reduced_constant_expression_p (tree t
)
6288 if (TREE_OVERFLOW_P (t
))
6289 /* Integer overflow makes this not a constant expression. */
6291 /* FIXME are we calling this too much? */
6292 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6295 /* Some expressions may have constant operands but are not constant
6296 themselves, such as 1/0. Call this function (or rather, the macro
6297 following it) to check for that condition.
6299 We only call this in places that require an arithmetic constant, not in
6300 places where we might have a non-constant expression that can be a
6301 component of a constant expression, such as the address of a constexpr
6302 variable that might be dereferenced later. */
6305 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
)
6307 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6309 if (!allow_non_constant
)
6311 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6312 printing the folded constant isn't helpful. */
6313 if (TREE_OVERFLOW_P (t
))
6315 permerror (input_location
, "overflow in constant expression");
6316 /* If we're being permissive (and are in an enforcing
6317 context), consider this constant. */
6318 if (flag_permissive
)
6322 error ("%q+E is not a constant expression", t
);
6324 *non_constant_p
= true;
6326 return *non_constant_p
;
6328 #define VERIFY_CONSTANT(X) \
6330 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6334 /* Subroutine of cxx_eval_constant_expression.
6335 Attempt to reduce the unary expression tree T to a compile time value.
6336 If successful, return the value. Otherwise issue a diagnostic
6337 and return error_mark_node. */
6340 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6341 bool allow_non_constant
, bool addr
,
6342 bool *non_constant_p
)
6345 tree orig_arg
= TREE_OPERAND (t
, 0);
6346 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6347 addr
, non_constant_p
);
6348 VERIFY_CONSTANT (arg
);
6349 if (arg
== orig_arg
)
6351 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6352 VERIFY_CONSTANT (r
);
6356 /* Subroutine of cxx_eval_constant_expression.
6357 Like cxx_eval_unary_expression, except for binary expressions. */
6360 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6361 bool allow_non_constant
, bool addr
,
6362 bool *non_constant_p
)
6365 tree orig_lhs
= TREE_OPERAND (t
, 0);
6366 tree orig_rhs
= TREE_OPERAND (t
, 1);
6368 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6369 allow_non_constant
, addr
,
6371 VERIFY_CONSTANT (lhs
);
6372 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6373 allow_non_constant
, addr
,
6375 VERIFY_CONSTANT (rhs
);
6376 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6378 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6379 VERIFY_CONSTANT (r
);
6383 /* Subroutine of cxx_eval_constant_expression.
6384 Attempt to evaluate condition expressions. Dead branches are not
6388 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6389 bool allow_non_constant
, bool addr
,
6390 bool *non_constant_p
)
6392 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6393 allow_non_constant
, addr
,
6395 VERIFY_CONSTANT (val
);
6396 /* Don't VERIFY_CONSTANT the other operands. */
6397 if (integer_zerop (val
))
6398 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6399 allow_non_constant
, addr
,
6401 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6402 allow_non_constant
, addr
,
6406 /* Subroutine of cxx_eval_constant_expression.
6407 Attempt to reduce a reference to an array slot. */
6410 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6411 bool allow_non_constant
, bool addr
,
6412 bool *non_constant_p
)
6414 tree oldary
= TREE_OPERAND (t
, 0);
6415 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6416 allow_non_constant
, addr
,
6421 unsigned len
, elem_nchars
= 1;
6422 if (*non_constant_p
)
6424 oldidx
= TREE_OPERAND (t
, 1);
6425 index
= cxx_eval_constant_expression (call
, oldidx
,
6426 allow_non_constant
, false,
6428 VERIFY_CONSTANT (index
);
6429 if (addr
&& ary
== oldary
&& index
== oldidx
)
6432 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
6433 elem_type
= TREE_TYPE (TREE_TYPE (ary
));
6434 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6435 len
= CONSTRUCTOR_NELTS (ary
);
6436 else if (TREE_CODE (ary
) == STRING_CST
)
6438 elem_nchars
= (TYPE_PRECISION (elem_type
)
6439 / TYPE_PRECISION (char_type_node
));
6440 len
= (unsigned) TREE_STRING_LENGTH (ary
) / elem_nchars
;
6444 /* We can't do anything with other tree codes, so use
6445 VERIFY_CONSTANT to complain and fail. */
6446 VERIFY_CONSTANT (ary
);
6449 if (compare_tree_int (index
, len
) >= 0)
6451 if (tree_int_cst_lt (index
, array_type_nelts_top (TREE_TYPE (ary
))))
6453 /* If it's within the array bounds but doesn't have an explicit
6454 initializer, it's value-initialized. */
6455 tree val
= build_value_init (elem_type
, tf_warning_or_error
);
6456 return cxx_eval_constant_expression (call
, val
,
6457 allow_non_constant
, addr
,
6461 if (!allow_non_constant
)
6462 error ("array subscript out of bound");
6463 *non_constant_p
= true;
6466 i
= tree_low_cst (index
, 0);
6467 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6468 return VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ary
), i
)->value
;
6469 else if (elem_nchars
== 1)
6470 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
6471 TREE_STRING_POINTER (ary
)[i
]);
6474 tree type
= cv_unqualified (TREE_TYPE (TREE_TYPE (ary
)));
6475 return native_interpret_expr (type
, (const unsigned char *)
6476 TREE_STRING_POINTER (ary
)
6477 + i
* elem_nchars
, elem_nchars
);
6479 /* Don't VERIFY_CONSTANT here. */
6482 /* Subroutine of cxx_eval_constant_expression.
6483 Attempt to reduce a field access of a value of class type. */
6486 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
6487 bool allow_non_constant
, bool addr
,
6488 bool *non_constant_p
)
6490 unsigned HOST_WIDE_INT i
;
6493 tree part
= TREE_OPERAND (t
, 1);
6494 tree orig_whole
= TREE_OPERAND (t
, 0);
6495 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6496 allow_non_constant
, addr
,
6498 if (whole
== orig_whole
)
6501 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
6502 whole
, part
, NULL_TREE
);
6503 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6505 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6507 if (!allow_non_constant
)
6508 error ("%qE is not a constant expression", orig_whole
);
6509 *non_constant_p
= true;
6511 if (*non_constant_p
)
6513 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6518 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
)
6520 /* DR 1188 says we don't have to deal with this. */
6521 if (!allow_non_constant
)
6522 error ("accessing %qD member instead of initialized %qD member in "
6523 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
6524 *non_constant_p
= true;
6528 return error_mark_node
;
6531 /* Subroutine of cxx_eval_constant_expression.
6532 Attempt to reduce a field access of a value of class type that is
6533 expressed as a BIT_FIELD_REF. */
6536 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
6537 bool allow_non_constant
, bool addr
,
6538 bool *non_constant_p
)
6540 tree orig_whole
= TREE_OPERAND (t
, 0);
6541 tree retval
, fldval
, utype
, mask
;
6542 bool fld_seen
= false;
6543 HOST_WIDE_INT istart
, isize
;
6544 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6545 allow_non_constant
, addr
,
6547 tree start
, field
, value
;
6548 unsigned HOST_WIDE_INT i
;
6550 if (whole
== orig_whole
)
6552 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6554 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6556 if (!allow_non_constant
)
6557 error ("%qE is not a constant expression", orig_whole
);
6558 *non_constant_p
= true;
6560 if (*non_constant_p
)
6563 start
= TREE_OPERAND (t
, 2);
6564 istart
= tree_low_cst (start
, 0);
6565 isize
= tree_low_cst (TREE_OPERAND (t
, 1), 0);
6566 utype
= TREE_TYPE (t
);
6567 if (!TYPE_UNSIGNED (utype
))
6568 utype
= build_nonstandard_integer_type (TYPE_PRECISION (utype
), 1);
6569 retval
= build_int_cst (utype
, 0);
6570 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6572 tree bitpos
= bit_position (field
);
6573 if (bitpos
== start
&& DECL_SIZE (field
) == TREE_OPERAND (t
, 1))
6575 if (TREE_CODE (TREE_TYPE (field
)) == INTEGER_TYPE
6576 && TREE_CODE (value
) == INTEGER_CST
6577 && host_integerp (bitpos
, 0)
6578 && host_integerp (DECL_SIZE (field
), 0))
6580 HOST_WIDE_INT bit
= tree_low_cst (bitpos
, 0);
6581 HOST_WIDE_INT sz
= tree_low_cst (DECL_SIZE (field
), 0);
6582 HOST_WIDE_INT shift
;
6583 if (bit
>= istart
&& bit
+ sz
<= istart
+ isize
)
6585 fldval
= fold_convert (utype
, value
);
6586 mask
= build_int_cst_type (utype
, -1);
6587 mask
= fold_build2 (LSHIFT_EXPR
, utype
, mask
,
6588 size_int (TYPE_PRECISION (utype
) - sz
));
6589 mask
= fold_build2 (RSHIFT_EXPR
, utype
, mask
,
6590 size_int (TYPE_PRECISION (utype
) - sz
));
6591 fldval
= fold_build2 (BIT_AND_EXPR
, utype
, fldval
, mask
);
6592 shift
= bit
- istart
;
6593 if (BYTES_BIG_ENDIAN
)
6594 shift
= TYPE_PRECISION (utype
) - shift
- sz
;
6595 fldval
= fold_build2 (LSHIFT_EXPR
, utype
, fldval
,
6597 retval
= fold_build2 (BIT_IOR_EXPR
, utype
, retval
, fldval
);
6603 return fold_convert (TREE_TYPE (t
), retval
);
6605 return error_mark_node
;
6608 /* Subroutine of cxx_eval_constant_expression.
6609 Evaluate a short-circuited logical expression T in the context
6610 of a given constexpr CALL. BAILOUT_VALUE is the value for
6611 early return. CONTINUE_VALUE is used here purely for
6612 sanity check purposes. */
6615 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
6616 tree bailout_value
, tree continue_value
,
6617 bool allow_non_constant
, bool addr
,
6618 bool *non_constant_p
)
6621 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6622 allow_non_constant
, addr
,
6624 VERIFY_CONSTANT (lhs
);
6625 if (lhs
== bailout_value
)
6627 gcc_assert (lhs
== continue_value
);
6628 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6629 allow_non_constant
, addr
, non_constant_p
);
6630 VERIFY_CONSTANT (r
);
6634 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6635 CONSTRUCTOR elements to initialize (part of) an object containing that
6636 field. Return a pointer to the constructor_elt corresponding to the
6637 initialization of the field. */
6639 static constructor_elt
*
6640 base_field_constructor_elt (VEC(constructor_elt
,gc
) *v
, tree ref
)
6642 tree aggr
= TREE_OPERAND (ref
, 0);
6643 tree field
= TREE_OPERAND (ref
, 1);
6645 constructor_elt
*ce
;
6647 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
6649 if (TREE_CODE (aggr
) == COMPONENT_REF
)
6651 constructor_elt
*base_ce
6652 = base_field_constructor_elt (v
, aggr
);
6653 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
6656 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6657 if (ce
->index
== field
)
6664 /* Subroutine of cxx_eval_constant_expression.
6665 The expression tree T denotes a C-style array or a C-style
6666 aggregate. Reduce it to a constant expression. */
6669 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
6670 bool allow_non_constant
, bool addr
,
6671 bool *non_constant_p
)
6673 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
6674 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
,
6675 VEC_length (constructor_elt
, v
));
6676 constructor_elt
*ce
;
6678 bool changed
= false;
6679 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
6680 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
6682 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
6683 allow_non_constant
, addr
,
6685 /* Don't VERIFY_CONSTANT here. */
6686 if (allow_non_constant
&& *non_constant_p
)
6688 if (elt
!= ce
->value
)
6690 if (TREE_CODE (ce
->index
) == COMPONENT_REF
)
6692 /* This is an initialization of a vfield inside a base
6693 subaggregate that we already initialized; push this
6694 initialization into the previous initialization. */
6695 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
6699 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
6701 if (*non_constant_p
|| !changed
)
6704 VEC_free (constructor_elt
, gc
, n
);
6707 t
= build_constructor (TREE_TYPE (t
), n
);
6708 TREE_CONSTANT (t
) = true;
6712 /* Subroutine of cxx_eval_constant_expression.
6713 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6714 initialization of a non-static data member of array type. Reduce it to a
6717 Note that apart from value-initialization (when VALUE_INIT is true),
6718 this is only intended to support value-initialization and the
6719 initializations done by defaulted constructors for classes with
6720 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6721 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6722 for the copy/move constructor. */
6725 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
6726 bool value_init
, bool allow_non_constant
, bool addr
,
6727 bool *non_constant_p
)
6729 tree elttype
= TREE_TYPE (atype
);
6730 int max
= tree_low_cst (array_type_nelts (atype
), 0);
6731 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
, max
+ 1);
6732 bool pre_init
= false;
6735 /* For the default constructor, build up a call to the default
6736 constructor of the element type. We only need to handle class types
6737 here, as for a constructor to be constexpr, all members must be
6738 initialized, which for a defaulted default constructor means they must
6739 be of a class type with a constexpr default constructor. */
6740 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
6741 /* We only do this at the lowest level. */;
6742 else if (value_init
)
6744 init
= build_value_init (elttype
, tf_warning_or_error
);
6745 init
= cxx_eval_constant_expression
6746 (call
, init
, allow_non_constant
, addr
, non_constant_p
);
6751 VEC(tree
,gc
) *argvec
= make_tree_vector ();
6752 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6753 &argvec
, elttype
, LOOKUP_NORMAL
,
6754 tf_warning_or_error
);
6755 release_tree_vector (argvec
);
6756 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
6757 addr
, non_constant_p
);
6761 if (*non_constant_p
&& !allow_non_constant
)
6764 for (i
= 0; i
<= max
; ++i
)
6766 tree idx
= build_int_cst (size_type_node
, i
);
6768 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
6770 /* A multidimensional array; recurse. */
6772 eltinit
= NULL_TREE
;
6774 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6775 tf_warning_or_error
);
6776 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
6777 allow_non_constant
, addr
,
6782 /* Initializing an element using value or default initialization
6783 we just pre-built above. */
6787 eltinit
= unshare_expr (init
);
6791 /* Copying an element. */
6792 VEC(tree
,gc
) *argvec
;
6793 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6794 (atype
, TREE_TYPE (init
)));
6795 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
6796 tf_warning_or_error
);
6797 if (!real_lvalue_p (init
))
6798 eltinit
= move (eltinit
);
6799 argvec
= make_tree_vector ();
6800 VEC_quick_push (tree
, argvec
, eltinit
);
6801 eltinit
= (build_special_member_call
6802 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
6803 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
6804 release_tree_vector (argvec
);
6805 eltinit
= cxx_eval_constant_expression
6806 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
6808 if (*non_constant_p
&& !allow_non_constant
)
6810 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
6813 if (!*non_constant_p
)
6815 init
= build_constructor (atype
, n
);
6816 TREE_CONSTANT (init
) = true;
6821 VEC_free (constructor_elt
, gc
, n
);
6826 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
6827 bool allow_non_constant
, bool addr
,
6828 bool *non_constant_p
)
6830 tree atype
= TREE_TYPE (t
);
6831 tree init
= VEC_INIT_EXPR_INIT (t
);
6832 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
6833 VEC_INIT_EXPR_VALUE_INIT (t
),
6834 allow_non_constant
, addr
, non_constant_p
);
6835 if (*non_constant_p
)
6841 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6842 match. We want to be less strict for simple *& folding; if we have a
6843 non-const temporary that we access through a const pointer, that should
6844 work. We handle this here rather than change fold_indirect_ref_1
6845 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6846 don't really make sense outside of constant expression evaluation. Also
6847 we want to allow folding to COMPONENT_REF, which could cause trouble
6848 with TBAA in fold_indirect_ref_1.
6850 Try to keep this function synced with fold_indirect_ref_1. */
6853 cxx_fold_indirect_ref (location_t loc
, tree type
, tree op0
, bool *empty_base
)
6859 subtype
= TREE_TYPE (sub
);
6860 gcc_assert (POINTER_TYPE_P (subtype
));
6862 if (TREE_CODE (sub
) == ADDR_EXPR
)
6864 tree op
= TREE_OPERAND (sub
, 0);
6865 tree optype
= TREE_TYPE (op
);
6867 /* *&CONST_DECL -> to the value of the const decl. */
6868 if (TREE_CODE (op
) == CONST_DECL
)
6869 return DECL_INITIAL (op
);
6870 /* *&p => p; make sure to handle *&"str"[cst] here. */
6871 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
6873 tree fop
= fold_read_from_constant_string (op
);
6879 /* *(foo *)&fooarray => fooarray[0] */
6880 else if (TREE_CODE (optype
) == ARRAY_TYPE
6881 && (same_type_ignoring_top_level_qualifiers_p
6882 (type
, TREE_TYPE (optype
))))
6884 tree type_domain
= TYPE_DOMAIN (optype
);
6885 tree min_val
= size_zero_node
;
6886 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
6887 min_val
= TYPE_MIN_VALUE (type_domain
);
6888 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
6889 NULL_TREE
, NULL_TREE
);
6891 /* *(foo *)&complexfoo => __real__ complexfoo */
6892 else if (TREE_CODE (optype
) == COMPLEX_TYPE
6893 && (same_type_ignoring_top_level_qualifiers_p
6894 (type
, TREE_TYPE (optype
))))
6895 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
6896 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
6897 else if (TREE_CODE (optype
) == VECTOR_TYPE
6898 && (same_type_ignoring_top_level_qualifiers_p
6899 (type
, TREE_TYPE (optype
))))
6901 tree part_width
= TYPE_SIZE (type
);
6902 tree index
= bitsize_int (0);
6903 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
6905 /* Also handle conversion to an empty base class, which
6906 is represented with a NOP_EXPR. */
6907 else if (is_empty_class (type
)
6908 && CLASS_TYPE_P (optype
)
6909 && DERIVED_FROM_P (type
, optype
))
6914 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6915 else if (RECORD_OR_UNION_TYPE_P (optype
))
6917 tree field
= TYPE_FIELDS (optype
);
6918 for (; field
; field
= DECL_CHAIN (field
))
6919 if (TREE_CODE (field
) == FIELD_DECL
6920 && integer_zerop (byte_position (field
))
6921 && (same_type_ignoring_top_level_qualifiers_p
6922 (TREE_TYPE (field
), type
)))
6924 return fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
6929 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
6930 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
6932 tree op00
= TREE_OPERAND (sub
, 0);
6933 tree op01
= TREE_OPERAND (sub
, 1);
6936 if (TREE_CODE (op00
) == ADDR_EXPR
)
6939 op00
= TREE_OPERAND (op00
, 0);
6940 op00type
= TREE_TYPE (op00
);
6942 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
6943 if (TREE_CODE (op00type
) == VECTOR_TYPE
6944 && (same_type_ignoring_top_level_qualifiers_p
6945 (type
, TREE_TYPE (op00type
))))
6947 HOST_WIDE_INT offset
= tree_low_cst (op01
, 0);
6948 tree part_width
= TYPE_SIZE (type
);
6949 unsigned HOST_WIDE_INT part_widthi
= tree_low_cst (part_width
, 0)/BITS_PER_UNIT
;
6950 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
6951 tree index
= bitsize_int (indexi
);
6953 if (offset
/part_widthi
<= TYPE_VECTOR_SUBPARTS (op00type
))
6954 return fold_build3_loc (loc
,
6955 BIT_FIELD_REF
, type
, op00
,
6959 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
6960 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
6961 && (same_type_ignoring_top_level_qualifiers_p
6962 (type
, TREE_TYPE (op00type
))))
6964 tree size
= TYPE_SIZE_UNIT (type
);
6965 if (tree_int_cst_equal (size
, op01
))
6966 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
6968 /* ((foo *)&fooarray)[1] => fooarray[1] */
6969 else if (TREE_CODE (op00type
) == ARRAY_TYPE
6970 && (same_type_ignoring_top_level_qualifiers_p
6971 (type
, TREE_TYPE (op00type
))))
6973 tree type_domain
= TYPE_DOMAIN (op00type
);
6974 tree min_val
= size_zero_node
;
6975 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
6976 min_val
= TYPE_MIN_VALUE (type_domain
);
6977 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
6978 TYPE_SIZE_UNIT (type
));
6979 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
6980 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
6981 NULL_TREE
, NULL_TREE
);
6983 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6984 else if (RECORD_OR_UNION_TYPE_P (op00type
))
6986 tree field
= TYPE_FIELDS (op00type
);
6987 for (; field
; field
= DECL_CHAIN (field
))
6988 if (TREE_CODE (field
) == FIELD_DECL
6989 && tree_int_cst_equal (byte_position (field
), op01
)
6990 && (same_type_ignoring_top_level_qualifiers_p
6991 (TREE_TYPE (field
), type
)))
6993 return fold_build3 (COMPONENT_REF
, type
, op00
,
7000 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7001 else if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
7002 && (same_type_ignoring_top_level_qualifiers_p
7003 (type
, TREE_TYPE (TREE_TYPE (subtype
)))))
7006 tree min_val
= size_zero_node
;
7007 sub
= cxx_fold_indirect_ref (loc
, TREE_TYPE (subtype
), sub
, NULL
);
7009 sub
= build1_loc (loc
, INDIRECT_REF
, TREE_TYPE (subtype
), sub
);
7010 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
7011 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7012 min_val
= TYPE_MIN_VALUE (type_domain
);
7013 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
7021 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
7022 bool allow_non_constant
, bool addr
,
7023 bool *non_constant_p
)
7025 tree orig_op0
= TREE_OPERAND (t
, 0);
7026 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
7027 /*addr*/false, non_constant_p
);
7028 bool empty_base
= false;
7031 /* Don't VERIFY_CONSTANT here. */
7032 if (*non_constant_p
)
7035 r
= cxx_fold_indirect_ref (EXPR_LOCATION (t
), TREE_TYPE (t
), op0
,
7039 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
7040 addr
, non_constant_p
);
7045 if (TREE_CODE (sub
) == ADDR_EXPR
7046 || TREE_CODE (sub
) == POINTER_PLUS_EXPR
)
7048 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7049 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
7050 /* DR 1188 says we don't have to deal with this. */
7051 if (!allow_non_constant
)
7052 error ("accessing value of %qE through a %qT glvalue in a "
7053 "constant expression", build_fold_indirect_ref (sub
),
7055 *non_constant_p
= true;
7060 /* If we're pulling out the value of an empty base, make sure
7061 that the whole object is constant and then return an empty
7065 VERIFY_CONSTANT (r
);
7066 r
= build_constructor (TREE_TYPE (t
), NULL
);
7067 TREE_CONSTANT (r
) = true;
7075 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7076 Shared between potential_constant_expression and
7077 cxx_eval_constant_expression. */
7080 non_const_var_error (tree r
)
7082 tree type
= TREE_TYPE (r
);
7083 error ("the value of %qD is not usable in a constant "
7085 /* Avoid error cascade. */
7086 if (DECL_INITIAL (r
) == error_mark_node
)
7088 if (DECL_DECLARED_CONSTEXPR_P (r
))
7089 inform (DECL_SOURCE_LOCATION (r
),
7090 "%qD used in its own initializer", r
);
7091 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7093 if (!CP_TYPE_CONST_P (type
))
7094 inform (DECL_SOURCE_LOCATION (r
),
7095 "%q#D is not const", r
);
7096 else if (CP_TYPE_VOLATILE_P (type
))
7097 inform (DECL_SOURCE_LOCATION (r
),
7098 "%q#D is volatile", r
);
7099 else if (!DECL_INITIAL (r
)
7100 || !TREE_CONSTANT (DECL_INITIAL (r
)))
7101 inform (DECL_SOURCE_LOCATION (r
),
7102 "%qD was not initialized with a constant "
7109 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
7110 inform (DECL_SOURCE_LOCATION (r
),
7111 "%qD was not declared %<constexpr%>", r
);
7113 inform (DECL_SOURCE_LOCATION (r
),
7114 "%qD does not have integral or enumeration type",
7119 /* Attempt to reduce the expression T to a constant value.
7120 On failure, issue diagnostic and return error_mark_node. */
7121 /* FIXME unify with c_fully_fold */
7124 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
7125 bool allow_non_constant
, bool addr
,
7126 bool *non_constant_p
)
7130 if (t
== error_mark_node
)
7132 *non_constant_p
= true;
7135 if (CONSTANT_CLASS_P (t
))
7137 if (TREE_CODE (t
) == PTRMEM_CST
)
7138 t
= cplus_expand_constant (t
);
7141 if (TREE_CODE (t
) != NOP_EXPR
7142 && reduced_constant_expression_p (t
))
7145 switch (TREE_CODE (t
))
7150 /* else fall through. */
7152 r
= integral_constant_value (t
);
7153 if (TREE_CODE (r
) == TARGET_EXPR
7154 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
7155 r
= TARGET_EXPR_INITIAL (r
);
7158 if (!allow_non_constant
)
7159 non_const_var_error (r
);
7160 *non_constant_p
= true;
7170 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
7171 r
= lookup_parameter_binding (call
, t
);
7173 /* Defer in case this is only used for its type. */;
7176 if (!allow_non_constant
)
7177 error ("%qE is not a constant expression", t
);
7178 *non_constant_p
= true;
7183 case AGGR_INIT_EXPR
:
7184 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
7189 if (!literal_type_p (TREE_TYPE (t
)))
7191 if (!allow_non_constant
)
7193 error ("temporary of non-literal type %qT in a "
7194 "constant expression", TREE_TYPE (t
));
7195 explain_non_literal_class (TREE_TYPE (t
));
7197 *non_constant_p
= true;
7200 /* else fall through. */
7202 /* Pass false for 'addr' because these codes indicate
7203 initialization of a temporary. */
7204 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7205 allow_non_constant
, false,
7207 if (!*non_constant_p
)
7208 /* Adjust the type of the result to the type of the temporary. */
7209 r
= adjust_temp_type (TREE_TYPE (t
), r
);
7213 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7214 allow_non_constant
, addr
,
7219 case NON_LVALUE_EXPR
:
7220 case TRY_CATCH_EXPR
:
7221 case CLEANUP_POINT_EXPR
:
7222 case MUST_NOT_THROW_EXPR
:
7224 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7225 allow_non_constant
, addr
,
7229 /* These differ from cxx_eval_unary_expression in that this doesn't
7230 check for a constant operand or result; an address can be
7231 constant without its operand being, and vice versa. */
7233 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
7239 tree oldop
= TREE_OPERAND (t
, 0);
7240 tree op
= cxx_eval_constant_expression (call
, oldop
,
7244 /* Don't VERIFY_CONSTANT here. */
7245 if (*non_constant_p
)
7247 /* This function does more aggressive folding than fold itself. */
7248 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
7249 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
7257 case FIX_TRUNC_EXPR
:
7262 case TRUTH_NOT_EXPR
:
7263 case FIXED_CONVERT_EXPR
:
7264 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
7270 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7271 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7272 introduced by build_call_a. */
7273 tree op0
= TREE_OPERAND (t
, 0);
7274 tree op1
= TREE_OPERAND (t
, 1);
7276 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7277 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7278 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7279 addr
, non_constant_p
);
7282 /* Check that the LHS is constant and then discard it. */
7283 cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7284 false, non_constant_p
);
7285 r
= cxx_eval_constant_expression (call
, op1
, allow_non_constant
,
7286 addr
, non_constant_p
);
7291 case POINTER_PLUS_EXPR
:
7295 case TRUNC_DIV_EXPR
:
7297 case FLOOR_DIV_EXPR
:
7298 case ROUND_DIV_EXPR
:
7299 case TRUNC_MOD_EXPR
:
7301 case ROUND_MOD_EXPR
:
7303 case EXACT_DIV_EXPR
:
7313 case TRUTH_XOR_EXPR
:
7320 case UNORDERED_EXPR
:
7329 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
7333 /* fold can introduce non-IF versions of these; still treat them as
7334 short-circuiting. */
7335 case TRUTH_AND_EXPR
:
7336 case TRUTH_ANDIF_EXPR
:
7337 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
7339 allow_non_constant
, addr
,
7344 case TRUTH_ORIF_EXPR
:
7345 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
7347 allow_non_constant
, addr
,
7352 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
7357 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
7362 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
7368 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
7373 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
7378 /* We can get this in a defaulted constructor for a class with a
7379 non-static data member of array type. Either the initializer will
7380 be NULL, meaning default-initialization, or it will be an lvalue
7381 or xvalue of the same type, meaning direct-initialization from the
7382 corresponding member. */
7383 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
7388 case VIEW_CONVERT_EXPR
:
7391 tree oldop
= TREE_OPERAND (t
, 0);
7393 tree to
= TREE_TYPE (t
);
7394 tree source
= TREE_TYPE (op
);
7395 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (to
)
7396 && !(TREE_CODE (op
) == COMPONENT_REF
7397 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op
, 0)))))
7399 if (!allow_non_constant
)
7400 error ("conversion of expression %qE of pointer type "
7401 "cannot yield a constant expression", op
);
7402 *non_constant_p
= true;
7405 op
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7406 allow_non_constant
, addr
,
7408 if (*non_constant_p
)
7411 /* We didn't fold at the top so we could check for ptr-int
7414 r
= fold_build1 (TREE_CODE (t
), to
, op
);
7415 /* Conversion of an out-of-range value has implementation-defined
7416 behavior; the language considers it different from arithmetic
7417 overflow, which is undefined. */
7418 if (TREE_OVERFLOW_P (r
) && !TREE_OVERFLOW_P (op
))
7419 TREE_OVERFLOW (r
) = false;
7423 case EMPTY_CLASS_EXPR
:
7424 /* This is good enough for a function argument that might not get
7425 used, and they can't do anything with it, so just return it. */
7429 case DYNAMIC_CAST_EXPR
:
7430 case PSEUDO_DTOR_EXPR
:
7431 case PREINCREMENT_EXPR
:
7432 case POSTINCREMENT_EXPR
:
7433 case PREDECREMENT_EXPR
:
7434 case POSTDECREMENT_EXPR
:
7438 case VEC_DELETE_EXPR
:
7442 /* GCC internal stuff. */
7445 case WITH_CLEANUP_EXPR
:
7446 case STATEMENT_LIST
:
7448 case NON_DEPENDENT_EXPR
:
7452 if (!allow_non_constant
)
7453 error_at (EXPR_LOC_OR_HERE (t
),
7454 "expression %qE is not a constant-expression", t
);
7455 *non_constant_p
= true;
7459 internal_error ("unexpected expression %qE of kind %s", t
,
7460 tree_code_name
[TREE_CODE (t
)]);
7461 *non_constant_p
= true;
7465 if (r
== error_mark_node
)
7466 *non_constant_p
= true;
7468 if (*non_constant_p
)
7475 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
7477 bool non_constant_p
= false;
7478 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
7479 false, &non_constant_p
);
7481 verify_constant (r
, allow_non_constant
, &non_constant_p
);
7483 if (non_constant_p
&& !allow_non_constant
)
7484 return error_mark_node
;
7485 else if (non_constant_p
&& TREE_CONSTANT (t
))
7487 /* This isn't actually constant, so unset TREE_CONSTANT. */
7488 if (EXPR_P (t
) || TREE_CODE (t
) == CONSTRUCTOR
)
7491 r
= build_nop (TREE_TYPE (t
), t
);
7492 TREE_CONSTANT (r
) = false;
7495 else if (non_constant_p
|| r
== t
)
7497 else if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
7499 if (TREE_CODE (t
) == TARGET_EXPR
7500 && TARGET_EXPR_INITIAL (t
) == r
)
7504 r
= get_target_expr (r
);
7505 TREE_CONSTANT (r
) = true;
7513 /* Returns true if T is a valid subexpression of a constant expression,
7514 even if it isn't itself a constant expression. */
7517 is_sub_constant_expr (tree t
)
7519 bool non_constant_p
= false;
7520 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
);
7521 return !non_constant_p
;
7524 /* If T represents a constant expression returns its reduced value.
7525 Otherwise return error_mark_node. If T is dependent, then
7529 cxx_constant_value (tree t
)
7531 return cxx_eval_outermost_constant_expr (t
, false);
7534 /* If T is a constant expression, returns its reduced value.
7535 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7536 Otherwise, returns a version of T without TREE_CONSTANT. */
7539 maybe_constant_value (tree t
)
7543 if (type_dependent_expression_p (t
)
7544 || type_unknown_p (t
)
7545 || !potential_constant_expression (t
)
7546 || value_dependent_expression_p (t
))
7548 if (TREE_OVERFLOW_P (t
))
7550 t
= build_nop (TREE_TYPE (t
), t
);
7551 TREE_CONSTANT (t
) = false;
7556 r
= cxx_eval_outermost_constant_expr (t
, true);
7557 #ifdef ENABLE_CHECKING
7558 /* cp_tree_equal looks through NOPs, so allow them. */
7560 || CONVERT_EXPR_P (t
)
7561 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
7562 || !cp_tree_equal (r
, t
));
7567 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7568 than wrapped in a TARGET_EXPR. */
7571 maybe_constant_init (tree t
)
7573 t
= maybe_constant_value (t
);
7574 if (TREE_CODE (t
) == TARGET_EXPR
)
7576 tree init
= TARGET_EXPR_INITIAL (t
);
7577 if (TREE_CODE (init
) == CONSTRUCTOR
7578 && TREE_CONSTANT (init
))
7585 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7586 /* Return true if the object referred to by REF has automatic or thread
7589 enum { ck_ok
, ck_bad
, ck_unknown
};
7591 check_automatic_or_tls (tree ref
)
7593 enum machine_mode mode
;
7594 HOST_WIDE_INT bitsize
, bitpos
;
7596 int volatilep
= 0, unsignedp
= 0;
7597 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
7598 &mode
, &unsignedp
, &volatilep
, false);
7601 /* If there isn't a decl in the middle, we don't know the linkage here,
7602 and this isn't a constant expression anyway. */
7605 dk
= decl_storage_duration (decl
);
7606 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
7610 /* Return true if T denotes a potentially constant expression. Issue
7611 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7612 an lvalue-rvalue conversion is implied.
7614 C++0x [expr.const] used to say
7616 6 An expression is a potential constant expression if it is
7617 a constant expression where all occurences of function
7618 parameters are replaced by arbitrary constant expressions
7619 of the appropriate type.
7621 2 A conditional expression is a constant expression unless it
7622 involves one of the following as a potentially evaluated
7623 subexpression (3.2), but subexpressions of logical AND (5.14),
7624 logical OR (5.15), and conditional (5.16) operations that are
7625 not evaluated are not considered. */
7628 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
7630 enum { any
= false, rval
= true };
7634 /* C++98 has different rules for the form of a constant expression that
7635 are enforced in the parser, so we can assume that anything that gets
7636 this far is suitable. */
7637 if (cxx_dialect
< cxx0x
)
7640 if (t
== error_mark_node
)
7644 if (TREE_THIS_VOLATILE (t
))
7646 if (flags
& tf_error
)
7647 error ("expression %qE has side-effects", t
);
7650 if (CONSTANT_CLASS_P (t
))
7652 if (TREE_OVERFLOW (t
))
7654 if (flags
& tf_error
)
7656 permerror (EXPR_LOC_OR_HERE (t
),
7657 "overflow in constant expression");
7658 if (flag_permissive
)
7666 switch (TREE_CODE (t
))
7672 case TEMPLATE_ID_EXPR
:
7679 case TEMPLATE_PARM_INDEX
:
7681 case IDENTIFIER_NODE
:
7682 /* We can see a FIELD_DECL in a pointer-to-member expression. */
7687 /* -- this (5.1) unless it appears as the postfix-expression in a
7688 class member access expression, including the result of the
7689 implicit transformation in the body of the non-static
7690 member function (9.3.1); */
7691 /* FIXME this restriction seems pointless since the standard dropped
7692 "potential constant expression". */
7693 if (is_this_parameter (t
))
7695 if (flags
& tf_error
)
7696 error ("%qE is not a potential constant expression", t
);
7701 case AGGR_INIT_EXPR
:
7703 /* -- an invocation of a function other than a constexpr function
7704 or a constexpr constructor. */
7706 tree fun
= get_function_named_in_call (t
);
7707 const int nargs
= call_expr_nargs (t
);
7710 if (is_overloaded_fn (fun
))
7712 if (TREE_CODE (fun
) == FUNCTION_DECL
)
7714 if (builtin_valid_in_constant_expr_p (fun
))
7716 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
7717 /* Allow any built-in function; if the expansion
7718 isn't constant, we'll deal with that then. */
7719 && !is_builtin_fn (fun
))
7721 if (flags
& tf_error
)
7723 error_at (EXPR_LOC_OR_HERE (t
),
7724 "call to non-constexpr function %qD", fun
);
7725 explain_invalid_constexpr_fn (fun
);
7729 /* A call to a non-static member function takes the address
7730 of the object as the first argument. But in a constant
7731 expression the address will be folded away, so look
7733 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
7734 && !DECL_CONSTRUCTOR_P (fun
))
7736 tree x
= get_nth_callarg (t
, 0);
7737 if (is_this_parameter (x
))
7739 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
7741 if (flags
& tf_error
)
7742 sorry ("calling a member function of the "
7743 "object being constructed in a constant "
7747 /* Otherwise OK. */;
7749 else if (!potential_constant_expression_1 (x
, rval
, flags
))
7755 fun
= get_first_fn (fun
);
7756 /* Skip initial arguments to base constructors. */
7757 if (DECL_BASE_CONSTRUCTOR_P (fun
))
7758 i
= num_artificial_parms_for (fun
);
7759 fun
= DECL_ORIGIN (fun
);
7763 if (potential_constant_expression_1 (fun
, rval
, flags
))
7764 /* Might end up being a constant function pointer. */;
7768 for (; i
< nargs
; ++i
)
7770 tree x
= get_nth_callarg (t
, i
);
7771 if (!potential_constant_expression_1 (x
, rval
, flags
))
7777 case NON_LVALUE_EXPR
:
7778 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7779 -- an lvalue of integral type that refers to a non-volatile
7780 const variable or static data member initialized with
7781 constant expressions, or
7783 -- an lvalue of literal type that refers to non-volatile
7784 object defined with constexpr, or that refers to a
7785 sub-object of such an object; */
7786 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
7789 if (want_rval
&& !decl_constant_var_p (t
)
7790 && !dependent_type_p (TREE_TYPE (t
)))
7792 if (flags
& tf_error
)
7793 non_const_var_error (t
);
7800 case VIEW_CONVERT_EXPR
:
7801 /* -- an array-to-pointer conversion that is applied to an lvalue
7802 that designates an object with thread or automatic storage
7803 duration; FIXME not implemented as it breaks constexpr arrays;
7804 need to fix the standard
7805 -- a type conversion from a pointer or pointer-to-member type
7806 to a literal type. */
7808 tree from
= TREE_OPERAND (t
, 0);
7809 tree source
= TREE_TYPE (from
);
7810 tree target
= TREE_TYPE (t
);
7811 if (TYPE_PTR_P (source
) && ARITHMETIC_TYPE_P (target
)
7812 && !(TREE_CODE (from
) == COMPONENT_REF
7813 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from
, 0)))))
7815 if (flags
& tf_error
)
7816 error ("conversion of expression %qE of pointer type "
7817 "cannot yield a constant expression", from
);
7820 return (potential_constant_expression_1
7821 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
7825 /* -- a unary operator & that is applied to an lvalue that
7826 designates an object with thread or automatic storage
7828 t
= TREE_OPERAND (t
, 0);
7830 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7831 any checking here, as we might dereference the pointer later. If
7832 we remove this code, also remove check_automatic_or_tls. */
7833 i
= check_automatic_or_tls (t
);
7838 if (flags
& tf_error
)
7839 error ("address-of an object %qE with thread local or "
7840 "automatic storage is not a constant expression", t
);
7844 return potential_constant_expression_1 (t
, any
, flags
);
7850 /* -- a class member access unless its postfix-expression is
7851 of literal type or of pointer to literal type. */
7852 /* This test would be redundant, as it follows from the
7853 postfix-expression being a potential constant expression. */
7854 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7857 case EXPR_PACK_EXPANSION
:
7858 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
7863 tree x
= TREE_OPERAND (t
, 0);
7865 if (is_this_parameter (x
))
7867 if (want_rval
&& DECL_CONTEXT (x
)
7868 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
7870 if (flags
& tf_error
)
7871 sorry ("use of the value of the object being constructed "
7872 "in a constant expression");
7877 return potential_constant_expression_1 (x
, rval
, flags
);
7881 case DYNAMIC_CAST_EXPR
:
7882 case PSEUDO_DTOR_EXPR
:
7883 case PREINCREMENT_EXPR
:
7884 case POSTINCREMENT_EXPR
:
7885 case PREDECREMENT_EXPR
:
7886 case POSTDECREMENT_EXPR
:
7890 case VEC_DELETE_EXPR
:
7894 /* GCC internal stuff. */
7897 case WITH_CLEANUP_EXPR
:
7898 case CLEANUP_POINT_EXPR
:
7899 case MUST_NOT_THROW_EXPR
:
7900 case TRY_CATCH_EXPR
:
7901 case STATEMENT_LIST
:
7902 /* Don't bother trying to define a subset of statement-expressions to
7903 be constant-expressions, at least for now. */
7907 if (flags
& tf_error
)
7908 error ("expression %qE is not a constant-expression", t
);
7912 /* -- a typeid expression whose operand is of polymorphic
7915 tree e
= TREE_OPERAND (t
, 0);
7916 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
7917 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
7919 if (flags
& tf_error
)
7920 error ("typeid-expression is not a constant expression "
7921 "because %qE is of polymorphic type", e
);
7928 /* -- a subtraction where both operands are pointers. */
7929 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7930 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7932 if (flags
& tf_error
)
7933 error ("difference of two pointer expressions is not "
7934 "a constant expression");
7946 /* -- a relational or equality operator where at least
7947 one of the operands is a pointer. */
7948 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
7949 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
7951 if (flags
& tf_error
)
7952 error ("pointer comparison expression is not a "
7953 "constant expression");
7961 if (TYPE_P (TREE_OPERAND (t
, 0)))
7963 /* else fall through. */
7969 case FIX_TRUNC_EXPR
:
7973 case TRUTH_NOT_EXPR
:
7974 case FIXED_CONVERT_EXPR
:
7975 case UNARY_PLUS_EXPR
:
7976 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
7980 case CONST_CAST_EXPR
:
7981 case STATIC_CAST_EXPR
:
7982 case REINTERPRET_CAST_EXPR
:
7983 return (potential_constant_expression_1
7984 (TREE_OPERAND (t
, 0),
7985 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
7988 case NON_DEPENDENT_EXPR
:
7989 /* For convenience. */
7991 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
7995 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
7999 if (!literal_type_p (TREE_TYPE (t
)))
8001 if (flags
& tf_error
)
8003 error ("temporary of non-literal type %qT in a "
8004 "constant expression", TREE_TYPE (t
));
8005 explain_non_literal_class (TREE_TYPE (t
));
8010 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8015 VEC(constructor_elt
, gc
) *v
= CONSTRUCTOR_ELTS (t
);
8016 constructor_elt
*ce
;
8017 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
8018 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
8025 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8026 || DECL_P (TREE_PURPOSE (t
)));
8027 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
8030 if (TREE_CHAIN (t
) == NULL_TREE
)
8032 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
8036 case TRUNC_DIV_EXPR
:
8038 case FLOOR_DIV_EXPR
:
8039 case ROUND_DIV_EXPR
:
8040 case TRUNC_MOD_EXPR
:
8042 case ROUND_MOD_EXPR
:
8044 tree denom
= TREE_OPERAND (t
, 1);
8045 /* We can't call maybe_constant_value on an expression
8046 that hasn't been through fold_non_dependent_expr yet. */
8047 if (!processing_template_decl
)
8048 denom
= maybe_constant_value (denom
);
8049 if (integer_zerop (denom
))
8051 if (flags
& tf_error
)
8052 error ("division by zero is not a constant-expression");
8064 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8065 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8066 introduced by build_call_a. */
8067 tree op0
= TREE_OPERAND (t
, 0);
8068 tree op1
= TREE_OPERAND (t
, 1);
8070 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
8071 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
8072 return potential_constant_expression_1 (op0
, want_rval
, flags
);
8077 /* If the first operand is the non-short-circuit constant, look at
8078 the second operand; otherwise we only care about the first one for
8080 case TRUTH_AND_EXPR
:
8081 case TRUTH_ANDIF_EXPR
:
8082 tmp
= boolean_true_node
;
8085 case TRUTH_ORIF_EXPR
:
8086 tmp
= boolean_false_node
;
8088 if (TREE_OPERAND (t
, 0) == tmp
)
8089 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
8091 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
8095 case POINTER_PLUS_EXPR
:
8097 case EXACT_DIV_EXPR
:
8107 case TRUTH_XOR_EXPR
:
8108 case UNORDERED_EXPR
:
8120 case ARRAY_RANGE_REF
:
8124 for (i
= 0; i
< 2; ++i
)
8125 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8131 for (i
= 0; i
< 3; ++i
)
8132 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8139 /* If the condition is a known constant, we know which of the legs we
8140 care about; otherwise we only require that the condition and
8141 either of the legs be potentially constant. */
8142 tmp
= TREE_OPERAND (t
, 0);
8143 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
8145 else if (integer_zerop (tmp
))
8146 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
8148 else if (TREE_CODE (tmp
) == INTEGER_CST
)
8149 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8151 for (i
= 1; i
< 3; ++i
)
8152 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8153 want_rval
, tf_none
))
8155 if (flags
& tf_error
)
8156 error ("expression %qE is not a constant-expression", t
);
8160 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
8162 if (flags
& tf_error
)
8164 error ("non-constant array initialization");
8165 diagnose_non_constexpr_vec_init (t
);
8170 sorry ("unexpected ast of kind %s", tree_code_name
[TREE_CODE (t
)]);
8176 /* The main entry point to the above. */
8179 potential_constant_expression (tree t
)
8181 return potential_constant_expression_1 (t
, false, tf_none
);
8184 /* As above, but require a constant rvalue. */
8187 potential_rvalue_constant_expression (tree t
)
8189 return potential_constant_expression_1 (t
, true, tf_none
);
8192 /* Like above, but complain about non-constant expressions. */
8195 require_potential_constant_expression (tree t
)
8197 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
8200 /* Cross product of the above. */
8203 require_potential_rvalue_constant_expression (tree t
)
8205 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
8208 /* Constructor for a lambda expression. */
8211 build_lambda_expr (void)
8213 tree lambda
= make_node (LAMBDA_EXPR
);
8214 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
8215 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
8216 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
8217 LAMBDA_EXPR_PENDING_PROXIES (lambda
) = NULL
;
8218 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
8219 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
8223 /* Create the closure object for a LAMBDA_EXPR. */
8226 build_lambda_object (tree lambda_expr
)
8228 /* Build aggregate constructor call.
8229 - cp_parser_braced_list
8230 - cp_parser_functional_cast */
8231 VEC(constructor_elt
,gc
) *elts
= NULL
;
8232 tree node
, expr
, type
;
8233 location_t saved_loc
;
8235 if (processing_template_decl
)
8238 /* Make sure any error messages refer to the lambda-introducer. */
8239 saved_loc
= input_location
;
8240 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
8242 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
8244 node
= TREE_CHAIN (node
))
8246 tree field
= TREE_PURPOSE (node
);
8247 tree val
= TREE_VALUE (node
);
8249 if (field
== error_mark_node
)
8251 expr
= error_mark_node
;
8258 /* Mere mortals can't copy arrays with aggregate initialization, so
8259 do some magic to make it work here. */
8260 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
8261 val
= build_array_copy (val
);
8262 else if (DECL_NORMAL_CAPTURE_P (field
)
8263 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
8265 /* "the entities that are captured by copy are used to
8266 direct-initialize each corresponding non-static data
8267 member of the resulting closure object."
8269 There's normally no way to express direct-initialization
8270 from an element of a CONSTRUCTOR, so we build up a special
8271 TARGET_EXPR to bypass the usual copy-initialization. */
8272 val
= force_rvalue (val
, tf_warning_or_error
);
8273 if (TREE_CODE (val
) == TARGET_EXPR
)
8274 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
8277 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
8280 expr
= build_constructor (init_list_type_node
, elts
);
8281 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
8283 /* N2927: "[The closure] class type is not an aggregate."
8284 But we briefly treat it as an aggregate to make this simpler. */
8285 type
= TREE_TYPE (lambda_expr
);
8286 CLASSTYPE_NON_AGGREGATE (type
) = 0;
8287 expr
= finish_compound_literal (type
, expr
, tf_warning_or_error
);
8288 CLASSTYPE_NON_AGGREGATE (type
) = 1;
8291 input_location
= saved_loc
;
8295 /* Return an initialized RECORD_TYPE for LAMBDA.
8296 LAMBDA must have its explicit captures already. */
8299 begin_lambda_type (tree lambda
)
8304 /* Unique name. This is just like an unnamed class, but we cannot use
8305 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8307 name
= make_lambda_name ();
8309 /* Create the new RECORD_TYPE for this lambda. */
8310 type
= xref_tag (/*tag_code=*/record_type
,
8312 /*scope=*/ts_within_enclosing_non_class
,
8313 /*template_header_p=*/false);
8316 /* Designate it as a struct so that we can use aggregate initialization. */
8317 CLASSTYPE_DECLARED_CLASS (type
) = false;
8319 /* Clear base types. */
8320 xref_basetypes (type
, /*bases=*/NULL_TREE
);
8322 /* Start the class. */
8323 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
8325 /* Cross-reference the expression and the type. */
8326 TREE_TYPE (lambda
) = type
;
8327 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
8332 /* Returns the type to use for the return type of the operator() of a
8336 lambda_return_type (tree expr
)
8339 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
8341 warning (0, "cannot deduce lambda return type from a braced-init-list");
8342 return void_type_node
;
8344 if (type_dependent_expression_p (expr
))
8346 type
= cxx_make_type (DECLTYPE_TYPE
);
8347 DECLTYPE_TYPE_EXPR (type
) = expr
;
8348 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
8349 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8352 type
= cv_unqualified (type_decays_to (unlowered_expr_type (expr
)));
8356 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8360 lambda_function (tree lambda
)
8363 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
8364 type
= TREE_TYPE (lambda
);
8367 gcc_assert (LAMBDA_TYPE_P (type
));
8368 /* Don't let debug_tree cause instantiation. */
8369 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
8370 && !COMPLETE_OR_OPEN_TYPE_P (type
))
8372 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
8373 /*protect=*/0, /*want_type=*/false);
8375 lambda
= BASELINK_FUNCTIONS (lambda
);
8379 /* Returns the type to use for the FIELD_DECL corresponding to the
8381 The caller should add REFERENCE_TYPE for capture by reference. */
8384 lambda_capture_field_type (tree expr
)
8387 if (type_dependent_expression_p (expr
))
8389 type
= cxx_make_type (DECLTYPE_TYPE
);
8390 DECLTYPE_TYPE_EXPR (type
) = expr
;
8391 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
8392 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8395 type
= non_reference (unlowered_expr_type (expr
));
8399 /* Recompute the return type for LAMBDA with body of the form:
8400 { return EXPR ; } */
8403 apply_lambda_return_type (tree lambda
, tree return_type
)
8405 tree fco
= lambda_function (lambda
);
8408 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
8410 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
8411 it would interfere with instantiating the closure type. */
8412 if (dependent_type_p (return_type
))
8414 if (return_type
== error_mark_node
)
8417 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8418 TREE_TYPE (METHOD_TYPE) == return-type */
8419 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
8421 result
= DECL_RESULT (fco
);
8422 if (result
== NULL_TREE
)
8425 /* We already have a DECL_RESULT from start_preparsed_function.
8426 Now we need to redo the work it and allocate_struct_function
8427 did to reflect the new type. */
8428 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
8429 TYPE_MAIN_VARIANT (return_type
));
8430 DECL_ARTIFICIAL (result
) = 1;
8431 DECL_IGNORED_P (result
) = 1;
8432 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
8435 DECL_RESULT (fco
) = result
;
8437 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
8439 #ifdef PCC_STATIC_STRUCT_RETURN
8440 cfun
->returns_pcc_struct
= 1;
8442 cfun
->returns_struct
= 1;
8447 /* DECL is a local variable or parameter from the surrounding scope of a
8448 lambda-expression. Returns the decltype for a use of the capture field
8449 for DECL even if it hasn't been captured yet. */
8452 capture_decltype (tree decl
)
8454 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8455 /* FIXME do lookup instead of list walk? */
8456 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
8460 type
= TREE_TYPE (TREE_PURPOSE (cap
));
8462 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
8465 error ("%qD is not captured", decl
);
8466 return error_mark_node
;
8469 type
= TREE_TYPE (decl
);
8470 if (TREE_CODE (type
) == REFERENCE_TYPE
8471 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
8472 type
= TREE_TYPE (type
);
8475 case CPLD_REFERENCE
:
8476 type
= TREE_TYPE (decl
);
8477 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8478 type
= build_reference_type (TREE_TYPE (decl
));
8485 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8487 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
8488 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
8490 type
= build_reference_type (type
);
8495 /* Returns true iff DECL is a lambda capture proxy variable created by
8496 build_capture_proxy. */
8499 is_capture_proxy (tree decl
)
8501 return (TREE_CODE (decl
) == VAR_DECL
8502 && DECL_HAS_VALUE_EXPR_P (decl
)
8503 && !DECL_ANON_UNION_VAR_P (decl
)
8504 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl
)));
8507 /* Returns true iff DECL is a capture proxy for a normal capture
8508 (i.e. without explicit initializer). */
8511 is_normal_capture_proxy (tree decl
)
8515 if (!is_capture_proxy (decl
))
8516 /* It's not a capture proxy. */
8519 /* It is a capture proxy, is it a normal capture? */
8520 val
= DECL_VALUE_EXPR (decl
);
8521 gcc_assert (TREE_CODE (val
) == COMPONENT_REF
);
8522 val
= TREE_OPERAND (val
, 1);
8523 return DECL_NORMAL_CAPTURE_P (val
);
8526 /* VAR is a capture proxy created by build_capture_proxy; add it to the
8527 current function, which is the operator() for the appropriate lambda. */
8530 insert_capture_proxy (tree var
)
8532 cp_binding_level
*b
;
8536 /* Put the capture proxy in the extra body block so that it won't clash
8537 with a later local variable. */
8538 b
= current_binding_level
;
8539 for (skip
= 0; ; ++skip
)
8541 cp_binding_level
*n
= b
->level_chain
;
8542 if (n
->kind
== sk_function_parms
)
8546 pushdecl_with_scope (var
, b
, false);
8548 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
8549 var
= build_stmt (DECL_SOURCE_LOCATION (var
), DECL_EXPR
, var
);
8550 stmt_list
= VEC_index (tree
, stmt_list_stack
,
8551 VEC_length (tree
, stmt_list_stack
) - 1 - skip
);
8552 gcc_assert (stmt_list
);
8553 append_to_statement_list_force (var
, &stmt_list
);
8556 /* We've just finished processing a lambda; if the containing scope is also
8557 a lambda, insert any capture proxies that were created while processing
8558 the nested lambda. */
8561 insert_pending_capture_proxies (void)
8564 VEC(tree
,gc
) *proxies
;
8567 if (!current_function_decl
|| !LAMBDA_FUNCTION_P (current_function_decl
))
8570 lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8571 proxies
= LAMBDA_EXPR_PENDING_PROXIES (lam
);
8572 for (i
= 0; i
< VEC_length (tree
, proxies
); ++i
)
8574 tree var
= VEC_index (tree
, proxies
, i
);
8575 insert_capture_proxy (var
);
8577 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam
));
8578 LAMBDA_EXPR_PENDING_PROXIES (lam
) = NULL
;
8581 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
8582 return the type we want the proxy to have: the type of the field itself,
8583 with added const-qualification if the lambda isn't mutable and the
8584 capture is by value. */
8587 lambda_proxy_type (tree ref
)
8590 if (REFERENCE_REF_P (ref
))
8591 ref
= TREE_OPERAND (ref
, 0);
8592 type
= TREE_TYPE (ref
);
8593 if (!dependent_type_p (type
))
8595 type
= cxx_make_type (DECLTYPE_TYPE
);
8596 DECLTYPE_TYPE_EXPR (type
) = ref
;
8597 DECLTYPE_FOR_LAMBDA_PROXY (type
) = true;
8598 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8602 /* MEMBER is a capture field in a lambda closure class. Now that we're
8603 inside the operator(), build a placeholder var for future lookups and
8607 build_capture_proxy (tree member
)
8609 tree var
, object
, fn
, closure
, name
, lam
, type
;
8611 closure
= DECL_CONTEXT (member
);
8612 fn
= lambda_function (closure
);
8613 lam
= CLASSTYPE_LAMBDA_EXPR (closure
);
8615 /* The proxy variable forwards to the capture field. */
8616 object
= build_fold_indirect_ref (DECL_ARGUMENTS (fn
));
8617 object
= finish_non_static_data_member (member
, object
, NULL_TREE
);
8618 if (REFERENCE_REF_P (object
))
8619 object
= TREE_OPERAND (object
, 0);
8621 /* Remove the __ inserted by add_capture. */
8622 name
= get_identifier (IDENTIFIER_POINTER (DECL_NAME (member
)) + 2);
8624 type
= lambda_proxy_type (object
);
8625 var
= build_decl (input_location
, VAR_DECL
, name
, type
);
8626 SET_DECL_VALUE_EXPR (var
, object
);
8627 DECL_HAS_VALUE_EXPR_P (var
) = 1;
8628 DECL_ARTIFICIAL (var
) = 1;
8629 TREE_USED (var
) = 1;
8630 DECL_CONTEXT (var
) = fn
;
8632 if (name
== this_identifier
)
8634 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam
) == member
);
8635 LAMBDA_EXPR_THIS_CAPTURE (lam
) = var
;
8638 if (fn
== current_function_decl
)
8639 insert_capture_proxy (var
);
8641 VEC_safe_push (tree
, gc
, LAMBDA_EXPR_PENDING_PROXIES (lam
), var
);
8646 /* From an ID and INITIALIZER, create a capture (by reference if
8647 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8651 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
8652 bool explicit_init_p
)
8655 tree type
, member
, name
;
8657 type
= lambda_capture_field_type (initializer
);
8660 type
= build_reference_type (type
);
8661 if (!real_lvalue_p (initializer
))
8662 error ("cannot capture %qE by reference", initializer
);
8665 /* Add __ to the beginning of the field name so that user code
8666 won't find the field with name lookup. We can't just leave the name
8667 unset because template instantiation uses the name to find
8668 instantiated fields. */
8669 buf
= (char *) alloca (IDENTIFIER_LENGTH (id
) + 3);
8670 buf
[1] = buf
[0] = '_';
8671 memcpy (buf
+ 2, IDENTIFIER_POINTER (id
),
8672 IDENTIFIER_LENGTH (id
) + 1);
8673 name
= get_identifier (buf
);
8675 /* If TREE_TYPE isn't set, we're still in the introducer, so check
8677 if (!TREE_TYPE (lambda
))
8679 if (IDENTIFIER_MARKED (name
))
8681 pedwarn (input_location
, 0,
8682 "already captured %qD in lambda expression", id
);
8685 IDENTIFIER_MARKED (name
) = true;
8688 /* Make member variable. */
8689 member
= build_lang_decl (FIELD_DECL
, name
, type
);
8691 if (!explicit_init_p
)
8692 /* Normal captures are invisible to name lookup but uses are replaced
8693 with references to the capture field; we implement this by only
8694 really making them invisible in unevaluated context; see
8695 qualify_lookup. For now, let's make explicitly initialized captures
8697 DECL_NORMAL_CAPTURE_P (member
) = true;
8699 if (id
== this_identifier
)
8700 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
8702 /* Add it to the appropriate closure class if we've started it. */
8703 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
8704 finish_member_declaration (member
);
8706 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
8707 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
8709 if (TREE_TYPE (lambda
))
8710 return build_capture_proxy (member
);
8711 /* For explicit captures we haven't started the function yet, so we wait
8712 and build the proxy from cp_parser_lambda_body. */
8716 /* Register all the capture members on the list CAPTURES, which is the
8717 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8720 register_capture_members (tree captures
)
8722 if (captures
== NULL_TREE
)
8725 register_capture_members (TREE_CHAIN (captures
));
8726 /* We set this in add_capture to avoid duplicates. */
8727 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures
))) = false;
8728 finish_member_declaration (TREE_PURPOSE (captures
));
8731 /* Similar to add_capture, except this works on a stack of nested lambdas.
8732 BY_REFERENCE_P in this case is derived from the default capture mode.
8733 Returns the capture for the lambda at the bottom of the stack. */
8736 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
8738 bool this_capture_p
= (id
== this_identifier
);
8740 tree var
= NULL_TREE
;
8742 tree saved_class_type
= current_class_type
;
8746 for (node
= lambda_stack
;
8748 node
= TREE_CHAIN (node
))
8750 tree lambda
= TREE_VALUE (node
);
8752 current_class_type
= TREE_TYPE (lambda
);
8753 var
= add_capture (lambda
,
8758 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
8759 == CPLD_REFERENCE
)),
8760 /*explicit_init_p=*/false);
8761 initializer
= convert_from_reference (var
);
8764 current_class_type
= saved_class_type
;
8769 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8770 INDIRECT_REF, possibly adding it through default capturing. */
8773 lambda_expr_this_capture (tree lambda
)
8777 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8779 /* Try to default capture 'this' if we can. */
8781 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
8783 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
8784 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
8785 tree init
= NULL_TREE
;
8787 /* If we are in a lambda function, we can move out until we hit:
8788 1. a non-lambda function,
8789 2. a lambda function capturing 'this', or
8790 3. a non-default capturing lambda function. */
8791 while (LAMBDA_FUNCTION_P (containing_function
))
8794 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
8796 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
8798 /* An outer lambda has already captured 'this'. */
8799 init
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
8803 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
8804 /* An outer lambda won't let us capture 'this'. */
8807 lambda_stack
= tree_cons (NULL_TREE
,
8811 containing_function
= decl_function_context (containing_function
);
8814 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
8815 && !LAMBDA_FUNCTION_P (containing_function
))
8816 /* First parameter is 'this'. */
8817 init
= DECL_ARGUMENTS (containing_function
);
8820 this_capture
= add_default_capture (lambda_stack
,
8821 /*id=*/this_identifier
,
8827 error ("%<this%> was not captured for this lambda function");
8828 result
= error_mark_node
;
8832 /* To make sure that current_class_ref is for the lambda. */
8833 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
8835 result
= this_capture
;
8837 /* If 'this' is captured, each use of 'this' is transformed into an
8838 access to the corresponding unnamed data member of the closure
8839 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8840 ensures that the transformed expression is an rvalue. ] */
8841 result
= rvalue (result
);
8847 /* Returns the method basetype of the innermost non-lambda function, or
8848 NULL_TREE if none. */
8851 nonlambda_method_basetype (void)
8854 if (!current_class_ref
)
8857 type
= current_class_type
;
8858 if (!LAMBDA_TYPE_P (type
))
8861 /* Find the nearest enclosing non-lambda function. */
8862 fn
= TYPE_NAME (type
);
8864 fn
= decl_function_context (fn
);
8865 while (fn
&& LAMBDA_FUNCTION_P (fn
));
8867 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
8870 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
8873 /* If the closure TYPE has a static op(), also add a conversion to function
8877 maybe_add_lambda_conv_op (tree type
)
8879 bool nested
= (current_function_decl
!= NULL_TREE
);
8880 tree callop
= lambda_function (type
);
8881 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
8882 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
8883 VEC (tree
, gc
) *argvec
;
8885 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
8888 if (processing_template_decl
)
8891 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
8892 FUNCTION_ARG_CHAIN (callop
));
8894 /* First build up the conversion op. */
8896 rettype
= build_pointer_type (stattype
);
8897 name
= mangle_conv_op_name_for_type (rettype
);
8898 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
8899 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
8900 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
8901 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8903 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8904 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8905 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8907 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
8908 grokclassfn (type
, fn
, NO_SPECIAL
);
8909 set_linkage_according_to_type (type
, fn
);
8910 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8911 DECL_IN_AGGR_P (fn
) = 1;
8912 DECL_ARTIFICIAL (fn
) = 1;
8913 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8914 DECL_DECLARED_INLINE_P (fn
) = 1;
8915 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
8917 DECL_INTERFACE_KNOWN (fn
) = 1;
8919 add_method (type
, fn
, NULL_TREE
);
8921 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8922 the conversion op is used. */
8923 if (varargs_function_p (callop
))
8925 DECL_DELETED_FN (fn
) = 1;
8929 /* Now build up the thunk to be returned. */
8931 name
= get_identifier ("_FUN");
8932 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
8933 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
8934 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
8935 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
8936 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
8937 grokclassfn (type
, fn
, NO_SPECIAL
);
8938 set_linkage_according_to_type (type
, fn
);
8939 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
8940 DECL_IN_AGGR_P (fn
) = 1;
8941 DECL_ARTIFICIAL (fn
) = 1;
8942 DECL_NOT_REALLY_EXTERN (fn
) = 1;
8943 DECL_DECLARED_INLINE_P (fn
) = 1;
8944 DECL_STATIC_FUNCTION_P (fn
) = 1;
8945 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
8946 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
8947 DECL_CONTEXT (arg
) = fn
;
8949 DECL_INTERFACE_KNOWN (fn
) = 1;
8951 add_method (type
, fn
, NULL_TREE
);
8954 push_function_context ();
8956 /* Still increment function_depth so that we don't GC in the
8957 middle of an expression. */
8960 /* Generate the body of the thunk. */
8962 start_preparsed_function (statfn
, NULL_TREE
,
8963 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8964 if (DECL_ONE_ONLY (statfn
))
8966 /* Put the thunk in the same comdat group as the call op. */
8967 cgraph_add_to_same_comdat_group (cgraph_get_create_node (statfn
),
8968 cgraph_get_create_node (callop
));
8970 body
= begin_function_body ();
8971 compound_stmt
= begin_compound_stmt (0);
8973 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
8975 argvec
= make_tree_vector ();
8976 VEC_quick_push (tree
, argvec
, arg
);
8977 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
8979 mark_exp_read (arg
);
8980 VEC_safe_push (tree
, gc
, argvec
, arg
);
8982 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
8983 VEC_address (tree
, argvec
));
8984 CALL_FROM_THUNK_P (call
) = 1;
8985 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
8986 call
= build_cplus_new (TREE_TYPE (call
), call
, tf_warning_or_error
);
8987 call
= convert_from_reference (call
);
8988 finish_return_stmt (call
);
8990 finish_compound_stmt (compound_stmt
);
8991 finish_function_body (body
);
8993 expand_or_defer_fn (finish_function (2));
8995 /* Generate the body of the conversion op. */
8997 start_preparsed_function (convfn
, NULL_TREE
,
8998 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
8999 body
= begin_function_body ();
9000 compound_stmt
= begin_compound_stmt (0);
9002 finish_return_stmt (decay_conversion (statfn
));
9004 finish_compound_stmt (compound_stmt
);
9005 finish_function_body (body
);
9007 expand_or_defer_fn (finish_function (2));
9010 pop_function_context ();
9015 /* Returns true iff VAL is a lambda-related declaration which should
9016 be ignored by unqualified lookup. */
9019 is_lambda_ignored_entity (tree val
)
9021 /* In unevaluated context, look past normal capture proxies. */
9022 if (cp_unevaluated_operand
&& is_normal_capture_proxy (val
))
9025 /* Always ignore lambda fields, their names are only for debugging. */
9026 if (TREE_CODE (val
) == FIELD_DECL
9027 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val
)))
9030 /* None of the lookups that use qualify_lookup want the op() from the
9031 lambda; they want the one from the enclosing class. */
9032 if (TREE_CODE (val
) == FUNCTION_DECL
&& LAMBDA_FUNCTION_P (val
))
9038 #include "gt-cp-semantics.h"