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-2013 Free Software Foundation, Inc.
7 Written by Mark Mitchell (mmitchell@usa.net) based on code found
8 formerly in parse.y and pt.c.
10 This file is part of GCC.
12 GCC is free software; you can redistribute it and/or modify it
13 under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 3, or (at your option)
17 GCC is distributed in the hope that it will be useful, but
18 WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 General Public License for more details.
22 You should have received a copy of the GNU General Public License
23 along with GCC; see the file COPYING3. If not see
24 <http://www.gnu.org/licenses/>. */
28 #include "coretypes.h"
32 #include "c-family/c-common.h"
33 #include "c-family/c-objc.h"
34 #include "tree-inline.h"
39 #include "diagnostic.h"
41 #include "tree-iterator.h"
46 #include "hash-table.h"
48 static bool verify_constant (tree
, bool, bool *, bool *);
49 #define VERIFY_CONSTANT(X) \
51 if (verify_constant ((X), allow_non_constant, non_constant_p, overflow_p)) \
55 /* There routines provide a modular interface to perform many parsing
56 operations. They may therefore be used during actual parsing, or
57 during template instantiation, which may be regarded as a
58 degenerate form of parsing. */
60 static tree
maybe_convert_cond (tree
);
61 static tree
finalize_nrv_r (tree
*, int *, void *);
62 static tree
capture_decltype (tree
);
65 /* Deferred Access Checking Overview
66 ---------------------------------
68 Most C++ expressions and declarations require access checking
69 to be performed during parsing. However, in several cases,
70 this has to be treated differently.
72 For member declarations, access checking has to be deferred
73 until more information about the declaration is known. For
85 When we are parsing the function return type `A::X', we don't
86 really know if this is allowed until we parse the function name.
88 Furthermore, some contexts require that access checking is
89 never performed at all. These include class heads, and template
92 Typical use of access checking functions is described here:
94 1. When we enter a context that requires certain access checking
95 mode, the function `push_deferring_access_checks' is called with
96 DEFERRING argument specifying the desired mode. Access checking
97 may be performed immediately (dk_no_deferred), deferred
98 (dk_deferred), or not performed (dk_no_check).
100 2. When a declaration such as a type, or a variable, is encountered,
101 the function `perform_or_defer_access_check' is called. It
102 maintains a vector of all deferred checks.
104 3. The global `current_class_type' or `current_function_decl' is then
105 setup by the parser. `enforce_access' relies on these information
108 4. Upon exiting the context mentioned in step 1,
109 `perform_deferred_access_checks' is called to check all declaration
110 stored in the vector. `pop_deferring_access_checks' is then
111 called to restore the previous access checking mode.
113 In case of parsing error, we simply call `pop_deferring_access_checks'
114 without `perform_deferred_access_checks'. */
116 typedef struct GTY(()) deferred_access
{
117 /* A vector representing name-lookups for which we have deferred
118 checking access controls. We cannot check the accessibility of
119 names used in a decl-specifier-seq until we know what is being
120 declared because code like:
127 A::B* A::f() { return 0; }
129 is valid, even though `A::B' is not generally accessible. */
130 vec
<deferred_access_check
, va_gc
> * GTY(()) deferred_access_checks
;
132 /* The current mode of access checks. */
133 enum deferring_kind deferring_access_checks_kind
;
137 /* Data for deferred access checking. */
138 static GTY(()) vec
<deferred_access
, va_gc
> *deferred_access_stack
;
139 static GTY(()) unsigned deferred_access_no_check
;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring
)
147 /* For context like template instantiation, access checking
148 disabling applies to all nested context. */
149 if (deferred_access_no_check
|| deferring
== dk_no_check
)
150 deferred_access_no_check
++;
153 deferred_access e
= {NULL
, deferring
};
154 vec_safe_push (deferred_access_stack
, e
);
158 /* Save the current deferred access states and start deferred access
159 checking, continuing the set of deferred checks in CHECKS. */
162 reopen_deferring_access_checks (vec
<deferred_access_check
, va_gc
> * checks
)
164 push_deferring_access_checks (dk_deferred
);
165 if (!deferred_access_no_check
)
166 deferred_access_stack
->last().deferred_access_checks
= checks
;
169 /* Resume deferring access checks again after we stopped doing
173 resume_deferring_access_checks (void)
175 if (!deferred_access_no_check
)
176 deferred_access_stack
->last().deferring_access_checks_kind
= dk_deferred
;
179 /* Stop deferring access checks. */
182 stop_deferring_access_checks (void)
184 if (!deferred_access_no_check
)
185 deferred_access_stack
->last().deferring_access_checks_kind
= dk_no_deferred
;
188 /* Discard the current deferred access checks and restore the
192 pop_deferring_access_checks (void)
194 if (deferred_access_no_check
)
195 deferred_access_no_check
--;
197 deferred_access_stack
->pop ();
200 /* Returns a TREE_LIST representing the deferred checks.
201 The TREE_PURPOSE of each node is the type through which the
202 access occurred; the TREE_VALUE is the declaration named.
205 vec
<deferred_access_check
, va_gc
> *
206 get_deferred_access_checks (void)
208 if (deferred_access_no_check
)
211 return (deferred_access_stack
->last().deferred_access_checks
);
214 /* Take current deferred checks and combine with the
215 previous states if we also defer checks previously.
216 Otherwise perform checks now. */
219 pop_to_parent_deferring_access_checks (void)
221 if (deferred_access_no_check
)
222 deferred_access_no_check
--;
225 vec
<deferred_access_check
, va_gc
> *checks
;
226 deferred_access
*ptr
;
228 checks
= (deferred_access_stack
->last ().deferred_access_checks
);
230 deferred_access_stack
->pop ();
231 ptr
= &deferred_access_stack
->last ();
232 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
235 perform_access_checks (checks
, tf_warning_or_error
);
239 /* Merge with parent. */
241 deferred_access_check
*chk
, *probe
;
243 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
245 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, j
, probe
)
247 if (probe
->binfo
== chk
->binfo
&&
248 probe
->decl
== chk
->decl
&&
249 probe
->diag_decl
== chk
->diag_decl
)
252 /* Insert into parent's checks. */
253 vec_safe_push (ptr
->deferred_access_checks
, *chk
);
260 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
261 is the BINFO indicating the qualifying scope used to access the
262 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
263 or we aren't in SFINAE context or all the checks succeed return TRUE,
267 perform_access_checks (vec
<deferred_access_check
, va_gc
> *checks
,
268 tsubst_flags_t complain
)
271 deferred_access_check
*chk
;
272 location_t loc
= input_location
;
278 FOR_EACH_VEC_SAFE_ELT (checks
, i
, chk
)
280 input_location
= chk
->loc
;
281 ok
&= enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
, complain
);
284 input_location
= loc
;
285 return (complain
& tf_error
) ? true : ok
;
288 /* Perform the deferred access checks.
290 After performing the checks, we still have to keep the list
291 `deferred_access_stack->deferred_access_checks' since we may want
292 to check access for them again later in a different context.
299 A::X A::a, x; // No error for `A::a', error for `x'
301 We have to perform deferred access of `A::X', first with `A::a',
302 next with `x'. Return value like perform_access_checks above. */
305 perform_deferred_access_checks (tsubst_flags_t complain
)
307 return perform_access_checks (get_deferred_access_checks (), complain
);
310 /* Defer checking the accessibility of DECL, when looked up in
311 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
312 Return value like perform_access_checks above. */
315 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
,
316 tsubst_flags_t complain
)
319 deferred_access
*ptr
;
320 deferred_access_check
*chk
;
323 /* Exit if we are in a context that no access checking is performed.
325 if (deferred_access_no_check
)
328 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
330 ptr
= &deferred_access_stack
->last ();
332 /* If we are not supposed to defer access checks, just check now. */
333 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
335 bool ok
= enforce_access (binfo
, decl
, diag_decl
, complain
);
336 return (complain
& tf_error
) ? true : ok
;
339 /* See if we are already going to perform this check. */
340 FOR_EACH_VEC_SAFE_ELT (ptr
->deferred_access_checks
, i
, chk
)
342 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
343 chk
->diag_decl
== diag_decl
)
348 /* If not, record the check. */
349 deferred_access_check new_access
= {binfo
, decl
, diag_decl
, input_location
};
350 vec_safe_push (ptr
->deferred_access_checks
, new_access
);
355 /* Returns nonzero if the current statement is a full expression,
356 i.e. temporaries created during that statement should be destroyed
357 at the end of the statement. */
360 stmts_are_full_exprs_p (void)
362 return current_stmt_tree ()->stmts_are_full_exprs_p
;
365 /* T is a statement. Add it to the statement-tree. This is the C++
366 version. The C/ObjC frontends have a slightly different version of
372 enum tree_code code
= TREE_CODE (t
);
374 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
376 if (!EXPR_HAS_LOCATION (t
))
377 SET_EXPR_LOCATION (t
, input_location
);
379 /* When we expand a statement-tree, we must know whether or not the
380 statements are full-expressions. We record that fact here. */
381 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
384 /* Add T to the statement-tree. Non-side-effect statements need to be
385 recorded during statement expressions. */
386 gcc_checking_assert (!stmt_list_stack
->is_empty ());
387 append_to_statement_list_force (t
, &cur_stmt_list
);
392 /* Returns the stmt_tree to which statements are currently being added. */
395 current_stmt_tree (void)
398 ? &cfun
->language
->base
.x_stmt_tree
399 : &scope_chain
->x_stmt_tree
);
402 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
405 maybe_cleanup_point_expr (tree expr
)
407 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
408 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
412 /* Like maybe_cleanup_point_expr except have the type of the new expression be
413 void so we don't need to create a temporary variable to hold the inner
414 expression. The reason why we do this is because the original type might be
415 an aggregate and we cannot create a temporary variable for that type. */
418 maybe_cleanup_point_expr_void (tree expr
)
420 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
421 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
427 /* Create a declaration statement for the declaration given by the DECL. */
430 add_decl_expr (tree decl
)
432 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
433 if (DECL_INITIAL (decl
)
434 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
435 r
= maybe_cleanup_point_expr_void (r
);
439 /* Finish a scope. */
442 do_poplevel (tree stmt_list
)
446 if (stmts_are_full_exprs_p ())
447 block
= poplevel (kept_level_p (), 1, 0);
449 stmt_list
= pop_stmt_list (stmt_list
);
451 if (!processing_template_decl
)
453 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
454 /* ??? See c_end_compound_stmt re statement expressions. */
460 /* Begin a new scope. */
463 do_pushlevel (scope_kind sk
)
465 tree ret
= push_stmt_list ();
466 if (stmts_are_full_exprs_p ())
467 begin_scope (sk
, NULL
);
471 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
472 when the current scope is exited. EH_ONLY is true when this is not
473 meant to apply to normal control flow transfer. */
476 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
478 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
479 CLEANUP_EH_ONLY (stmt
) = eh_only
;
481 CLEANUP_BODY (stmt
) = push_stmt_list ();
484 /* Begin a conditional that might contain a declaration. When generating
485 normal code, we want the declaration to appear before the statement
486 containing the conditional. When generating template code, we want the
487 conditional to be rendered as the raw DECL_EXPR. */
490 begin_cond (tree
*cond_p
)
492 if (processing_template_decl
)
493 *cond_p
= push_stmt_list ();
496 /* Finish such a conditional. */
499 finish_cond (tree
*cond_p
, tree expr
)
501 if (processing_template_decl
)
503 tree cond
= pop_stmt_list (*cond_p
);
505 if (expr
== NULL_TREE
)
506 /* Empty condition in 'for'. */
507 gcc_assert (empty_expr_stmt_p (cond
));
508 else if (check_for_bare_parameter_packs (expr
))
509 expr
= error_mark_node
;
510 else if (!empty_expr_stmt_p (cond
))
511 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), cond
, expr
);
516 /* If *COND_P specifies a conditional with a declaration, transform the
519 for (; A x = 42;) { }
521 while (true) { A x = 42; if (!x) break; }
522 for (;;) { A x = 42; if (!x) break; }
523 The statement list for BODY will be empty if the conditional did
524 not declare anything. */
527 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
531 if (!TREE_SIDE_EFFECTS (body
))
535 *cond_p
= boolean_true_node
;
537 if_stmt
= begin_if_stmt ();
538 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
539 finish_if_stmt_cond (cond
, if_stmt
);
540 finish_break_stmt ();
541 finish_then_clause (if_stmt
);
542 finish_if_stmt (if_stmt
);
545 /* Finish a goto-statement. */
548 finish_goto_stmt (tree destination
)
550 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
551 destination
= lookup_label (destination
);
553 /* We warn about unused labels with -Wunused. That means we have to
554 mark the used labels as used. */
555 if (TREE_CODE (destination
) == LABEL_DECL
)
556 TREE_USED (destination
) = 1;
559 destination
= mark_rvalue_use (destination
);
560 if (!processing_template_decl
)
562 destination
= cp_convert (ptr_type_node
, destination
,
563 tf_warning_or_error
);
564 if (error_operand_p (destination
))
567 = fold_build_cleanup_point_expr (TREE_TYPE (destination
),
572 check_goto (destination
);
574 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
577 /* COND is the condition-expression for an if, while, etc.,
578 statement. Convert it to a boolean value, if appropriate.
579 In addition, verify sequence points if -Wsequence-point is enabled. */
582 maybe_convert_cond (tree cond
)
584 /* Empty conditions remain empty. */
588 /* Wait until we instantiate templates before doing conversion. */
589 if (processing_template_decl
)
592 if (warn_sequence_point
)
593 verify_sequence_points (cond
);
595 /* Do the conversion. */
596 cond
= convert_from_reference (cond
);
598 if (TREE_CODE (cond
) == MODIFY_EXPR
599 && !TREE_NO_WARNING (cond
)
602 warning (OPT_Wparentheses
,
603 "suggest parentheses around assignment used as truth value");
604 TREE_NO_WARNING (cond
) = 1;
607 return condition_conversion (cond
);
610 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
613 finish_expr_stmt (tree expr
)
617 if (expr
!= NULL_TREE
)
619 if (!processing_template_decl
)
621 if (warn_sequence_point
)
622 verify_sequence_points (expr
);
623 expr
= convert_to_void (expr
, ICV_STATEMENT
, tf_warning_or_error
);
625 else if (!type_dependent_expression_p (expr
))
626 convert_to_void (build_non_dependent_expr (expr
), ICV_STATEMENT
,
627 tf_warning_or_error
);
629 if (check_for_bare_parameter_packs (expr
))
630 expr
= error_mark_node
;
632 /* Simplification of inner statement expressions, compound exprs,
633 etc can result in us already having an EXPR_STMT. */
634 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
636 if (TREE_CODE (expr
) != EXPR_STMT
)
637 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
638 expr
= maybe_cleanup_point_expr_void (expr
);
650 /* Begin an if-statement. Returns a newly created IF_STMT if
657 scope
= do_pushlevel (sk_cond
);
658 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
,
659 NULL_TREE
, NULL_TREE
, scope
);
660 begin_cond (&IF_COND (r
));
664 /* Process the COND of an if-statement, which may be given by
668 finish_if_stmt_cond (tree cond
, tree if_stmt
)
670 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
672 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
675 /* Finish the then-clause of an if-statement, which may be given by
679 finish_then_clause (tree if_stmt
)
681 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
685 /* Begin the else-clause of an if-statement. */
688 begin_else_clause (tree if_stmt
)
690 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
693 /* Finish the else-clause of an if-statement, which may be given by
697 finish_else_clause (tree if_stmt
)
699 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
702 /* Finish an if-statement. */
705 finish_if_stmt (tree if_stmt
)
707 tree scope
= IF_SCOPE (if_stmt
);
708 IF_SCOPE (if_stmt
) = NULL
;
709 add_stmt (do_poplevel (scope
));
713 /* Begin a while-statement. Returns a newly created WHILE_STMT if
717 begin_while_stmt (void)
720 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
722 WHILE_BODY (r
) = do_pushlevel (sk_block
);
723 begin_cond (&WHILE_COND (r
));
727 /* Process the COND of a while-statement, which may be given by
731 finish_while_stmt_cond (tree cond
, tree while_stmt
)
733 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
734 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
737 /* Finish a while-statement, which may be given by WHILE_STMT. */
740 finish_while_stmt (tree while_stmt
)
742 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
746 /* Begin a do-statement. Returns a newly created DO_STMT if
752 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
754 DO_BODY (r
) = push_stmt_list ();
758 /* Finish the body of a do-statement, which may be given by DO_STMT. */
761 finish_do_body (tree do_stmt
)
763 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
765 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
766 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
768 if (IS_EMPTY_STMT (body
))
769 warning (OPT_Wempty_body
,
770 "suggest explicit braces around empty body in %<do%> statement");
773 /* Finish a do-statement, which may be given by DO_STMT, and whose
774 COND is as indicated. */
777 finish_do_stmt (tree cond
, tree do_stmt
)
779 cond
= maybe_convert_cond (cond
);
780 DO_COND (do_stmt
) = cond
;
784 /* Finish a return-statement. The EXPRESSION returned, if any, is as
788 finish_return_stmt (tree expr
)
793 expr
= check_return_expr (expr
, &no_warning
);
795 if (flag_openmp
&& !check_omp_return ())
796 return error_mark_node
;
797 if (!processing_template_decl
)
799 if (warn_sequence_point
)
800 verify_sequence_points (expr
);
802 if (DECL_DESTRUCTOR_P (current_function_decl
)
803 || (DECL_CONSTRUCTOR_P (current_function_decl
)
804 && targetm
.cxx
.cdtor_returns_this ()))
806 /* Similarly, all destructors must run destructors for
807 base-classes before returning. So, all returns in a
808 destructor get sent to the DTOR_LABEL; finish_function emits
809 code to return a value there. */
810 return finish_goto_stmt (cdtor_label
);
814 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
815 TREE_NO_WARNING (r
) |= no_warning
;
816 r
= maybe_cleanup_point_expr_void (r
);
823 /* Begin the scope of a for-statement or a range-for-statement.
824 Both the returned trees are to be used in a call to
825 begin_for_stmt or begin_range_for_stmt. */
828 begin_for_scope (tree
*init
)
830 tree scope
= NULL_TREE
;
831 if (flag_new_for_scope
> 0)
832 scope
= do_pushlevel (sk_for
);
834 if (processing_template_decl
)
835 *init
= push_stmt_list ();
842 /* Begin a for-statement. Returns a new FOR_STMT.
843 SCOPE and INIT should be the return of begin_for_scope,
847 begin_for_stmt (tree scope
, tree init
)
851 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
852 NULL_TREE
, NULL_TREE
, NULL_TREE
);
854 if (scope
== NULL_TREE
)
856 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
858 scope
= begin_for_scope (&init
);
860 FOR_INIT_STMT (r
) = init
;
861 FOR_SCOPE (r
) = scope
;
866 /* Finish the for-init-statement of a for-statement, which may be
867 given by FOR_STMT. */
870 finish_for_init_stmt (tree for_stmt
)
872 if (processing_template_decl
)
873 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
875 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
876 begin_cond (&FOR_COND (for_stmt
));
879 /* Finish the COND of a for-statement, which may be given by
883 finish_for_cond (tree cond
, tree for_stmt
)
885 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
886 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
889 /* Finish the increment-EXPRESSION in a for-statement, which may be
890 given by FOR_STMT. */
893 finish_for_expr (tree expr
, tree for_stmt
)
897 /* If EXPR is an overloaded function, issue an error; there is no
898 context available to use to perform overload resolution. */
899 if (type_unknown_p (expr
))
901 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
902 expr
= error_mark_node
;
904 if (!processing_template_decl
)
906 if (warn_sequence_point
)
907 verify_sequence_points (expr
);
908 expr
= convert_to_void (expr
, ICV_THIRD_IN_FOR
,
909 tf_warning_or_error
);
911 else if (!type_dependent_expression_p (expr
))
912 convert_to_void (build_non_dependent_expr (expr
), ICV_THIRD_IN_FOR
,
913 tf_warning_or_error
);
914 expr
= maybe_cleanup_point_expr_void (expr
);
915 if (check_for_bare_parameter_packs (expr
))
916 expr
= error_mark_node
;
917 FOR_EXPR (for_stmt
) = expr
;
920 /* Finish the body of a for-statement, which may be given by
921 FOR_STMT. The increment-EXPR for the loop must be
923 It can also finish RANGE_FOR_STMT. */
926 finish_for_stmt (tree for_stmt
)
928 if (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
)
929 RANGE_FOR_BODY (for_stmt
) = do_poplevel (RANGE_FOR_BODY (for_stmt
));
931 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
933 /* Pop the scope for the body of the loop. */
934 if (flag_new_for_scope
> 0)
937 tree
*scope_ptr
= (TREE_CODE (for_stmt
) == RANGE_FOR_STMT
938 ? &RANGE_FOR_SCOPE (for_stmt
)
939 : &FOR_SCOPE (for_stmt
));
942 add_stmt (do_poplevel (scope
));
948 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
949 SCOPE and INIT should be the return of begin_for_scope,
951 To finish it call finish_for_stmt(). */
954 begin_range_for_stmt (tree scope
, tree init
)
958 r
= build_stmt (input_location
, RANGE_FOR_STMT
,
959 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
961 if (scope
== NULL_TREE
)
963 gcc_assert (!init
|| !(flag_new_for_scope
> 0));
965 scope
= begin_for_scope (&init
);
968 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
971 pop_stmt_list (init
);
972 RANGE_FOR_SCOPE (r
) = scope
;
977 /* Finish the head of a range-based for statement, which may
978 be given by RANGE_FOR_STMT. DECL must be the declaration
979 and EXPR must be the loop expression. */
982 finish_range_for_decl (tree range_for_stmt
, tree decl
, tree expr
)
984 RANGE_FOR_DECL (range_for_stmt
) = decl
;
985 RANGE_FOR_EXPR (range_for_stmt
) = expr
;
986 add_stmt (range_for_stmt
);
987 RANGE_FOR_BODY (range_for_stmt
) = do_pushlevel (sk_block
);
990 /* Finish a break-statement. */
993 finish_break_stmt (void)
995 /* In switch statements break is sometimes stylistically used after
996 a return statement. This can lead to spurious warnings about
997 control reaching the end of a non-void function when it is
998 inlined. Note that we are calling block_may_fallthru with
999 language specific tree nodes; this works because
1000 block_may_fallthru returns true when given something it does not
1002 if (!block_may_fallthru (cur_stmt_list
))
1003 return void_zero_node
;
1004 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
1007 /* Finish a continue-statement. */
1010 finish_continue_stmt (void)
1012 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
1015 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1019 begin_switch_stmt (void)
1023 scope
= do_pushlevel (sk_cond
);
1024 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
, scope
);
1026 begin_cond (&SWITCH_STMT_COND (r
));
1031 /* Finish the cond of a switch-statement. */
1034 finish_switch_cond (tree cond
, tree switch_stmt
)
1036 tree orig_type
= NULL
;
1037 if (!processing_template_decl
)
1039 /* Convert the condition to an integer or enumeration type. */
1040 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
1041 if (cond
== NULL_TREE
)
1043 error ("switch quantity not an integer");
1044 cond
= error_mark_node
;
1046 orig_type
= TREE_TYPE (cond
);
1047 if (cond
!= error_mark_node
)
1051 Integral promotions are performed. */
1052 cond
= perform_integral_promotions (cond
);
1053 cond
= maybe_cleanup_point_expr (cond
);
1056 if (check_for_bare_parameter_packs (cond
))
1057 cond
= error_mark_node
;
1058 else if (!processing_template_decl
&& warn_sequence_point
)
1059 verify_sequence_points (cond
);
1061 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
1062 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
1063 add_stmt (switch_stmt
);
1064 push_switch (switch_stmt
);
1065 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
1068 /* Finish the body of a switch-statement, which may be given by
1069 SWITCH_STMT. The COND to switch on is indicated. */
1072 finish_switch_stmt (tree switch_stmt
)
1076 SWITCH_STMT_BODY (switch_stmt
) =
1077 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
1081 scope
= SWITCH_STMT_SCOPE (switch_stmt
);
1082 SWITCH_STMT_SCOPE (switch_stmt
) = NULL
;
1083 add_stmt (do_poplevel (scope
));
1086 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1090 begin_try_block (void)
1092 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1094 TRY_STMTS (r
) = push_stmt_list ();
1098 /* Likewise, for a function-try-block. The block returned in
1099 *COMPOUND_STMT is an artificial outer scope, containing the
1100 function-try-block. */
1103 begin_function_try_block (tree
*compound_stmt
)
1106 /* This outer scope does not exist in the C++ standard, but we need
1107 a place to put __FUNCTION__ and similar variables. */
1108 *compound_stmt
= begin_compound_stmt (0);
1109 r
= begin_try_block ();
1110 FN_TRY_BLOCK_P (r
) = 1;
1114 /* Finish a try-block, which may be given by TRY_BLOCK. */
1117 finish_try_block (tree try_block
)
1119 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1120 TRY_HANDLERS (try_block
) = push_stmt_list ();
1123 /* Finish the body of a cleanup try-block, which may be given by
1127 finish_cleanup_try_block (tree try_block
)
1129 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1132 /* Finish an implicitly generated try-block, with a cleanup is given
1136 finish_cleanup (tree cleanup
, tree try_block
)
1138 TRY_HANDLERS (try_block
) = cleanup
;
1139 CLEANUP_P (try_block
) = 1;
1142 /* Likewise, for a function-try-block. */
1145 finish_function_try_block (tree try_block
)
1147 finish_try_block (try_block
);
1148 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1149 the try block, but moving it inside. */
1150 in_function_try_handler
= 1;
1153 /* Finish a handler-sequence for a try-block, which may be given by
1157 finish_handler_sequence (tree try_block
)
1159 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1160 check_handlers (TRY_HANDLERS (try_block
));
1163 /* Finish the handler-seq for a function-try-block, given by
1164 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1165 begin_function_try_block. */
1168 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1170 in_function_try_handler
= 0;
1171 finish_handler_sequence (try_block
);
1172 finish_compound_stmt (compound_stmt
);
1175 /* Begin a handler. Returns a HANDLER if appropriate. */
1178 begin_handler (void)
1182 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1185 /* Create a binding level for the eh_info and the exception object
1187 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1192 /* Finish the handler-parameters for a handler, which may be given by
1193 HANDLER. DECL is the declaration for the catch parameter, or NULL
1194 if this is a `catch (...)' clause. */
1197 finish_handler_parms (tree decl
, tree handler
)
1199 tree type
= NULL_TREE
;
1200 if (processing_template_decl
)
1204 decl
= pushdecl (decl
);
1205 decl
= push_template_decl (decl
);
1206 HANDLER_PARMS (handler
) = decl
;
1207 type
= TREE_TYPE (decl
);
1211 type
= expand_start_catch_block (decl
);
1212 HANDLER_TYPE (handler
) = type
;
1213 if (!processing_template_decl
&& type
)
1214 mark_used (eh_type_info (type
));
1217 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1218 the return value from the matching call to finish_handler_parms. */
1221 finish_handler (tree handler
)
1223 if (!processing_template_decl
)
1224 expand_end_catch_block ();
1225 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1228 /* Begin a compound statement. FLAGS contains some bits that control the
1229 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1230 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1231 block of a function. If BCS_TRY_BLOCK is set, this is the block
1232 created on behalf of a TRY statement. Returns a token to be passed to
1233 finish_compound_stmt. */
1236 begin_compound_stmt (unsigned int flags
)
1240 if (flags
& BCS_NO_SCOPE
)
1242 r
= push_stmt_list ();
1243 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1245 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1246 But, if it's a statement-expression with a scopeless block, there's
1247 nothing to keep, and we don't want to accidentally keep a block
1248 *inside* the scopeless block. */
1249 keep_next_level (false);
1252 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1254 /* When processing a template, we need to remember where the braces were,
1255 so that we can set up identical scopes when instantiating the template
1256 later. BIND_EXPR is a handy candidate for this.
1257 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1258 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1259 processing templates. */
1260 if (processing_template_decl
)
1262 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1263 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1264 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1265 TREE_SIDE_EFFECTS (r
) = 1;
1271 /* Finish a compound-statement, which is given by STMT. */
1274 finish_compound_stmt (tree stmt
)
1276 if (TREE_CODE (stmt
) == BIND_EXPR
)
1278 tree body
= do_poplevel (BIND_EXPR_BODY (stmt
));
1279 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1280 discard the BIND_EXPR so it can be merged with the containing
1282 if (TREE_CODE (body
) == STATEMENT_LIST
1283 && STATEMENT_LIST_HEAD (body
) == NULL
1284 && !BIND_EXPR_BODY_BLOCK (stmt
)
1285 && !BIND_EXPR_TRY_BLOCK (stmt
))
1288 BIND_EXPR_BODY (stmt
) = body
;
1290 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1291 stmt
= pop_stmt_list (stmt
);
1294 /* Destroy any ObjC "super" receivers that may have been
1296 objc_clear_super_receiver ();
1298 stmt
= do_poplevel (stmt
);
1301 /* ??? See c_end_compound_stmt wrt statement expressions. */
1306 /* Finish an asm-statement, whose components are a STRING, some
1307 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1308 LABELS. Also note whether the asm-statement should be
1309 considered volatile. */
1312 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1313 tree input_operands
, tree clobbers
, tree labels
)
1317 int ninputs
= list_length (input_operands
);
1318 int noutputs
= list_length (output_operands
);
1320 if (!processing_template_decl
)
1322 const char *constraint
;
1323 const char **oconstraints
;
1324 bool allows_mem
, allows_reg
, is_inout
;
1328 oconstraints
= XALLOCAVEC (const char *, noutputs
);
1330 string
= resolve_asm_operand_names (string
, output_operands
,
1331 input_operands
, labels
);
1333 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1335 operand
= TREE_VALUE (t
);
1337 /* ??? Really, this should not be here. Users should be using a
1338 proper lvalue, dammit. But there's a long history of using
1339 casts in the output operands. In cases like longlong.h, this
1340 becomes a primitive form of typechecking -- if the cast can be
1341 removed, then the output operand had a type of the proper width;
1342 otherwise we'll get an error. Gross, but ... */
1343 STRIP_NOPS (operand
);
1345 operand
= mark_lvalue_use (operand
);
1347 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1348 operand
= error_mark_node
;
1350 if (operand
!= error_mark_node
1351 && (TREE_READONLY (operand
)
1352 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1353 /* Functions are not modifiable, even though they are
1355 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1356 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1357 /* If it's an aggregate and any field is const, then it is
1358 effectively const. */
1359 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1360 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1361 cxx_readonly_error (operand
, lv_asm
);
1363 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1364 oconstraints
[i
] = constraint
;
1366 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1367 &allows_mem
, &allows_reg
, &is_inout
))
1369 /* If the operand is going to end up in memory,
1370 mark it addressable. */
1371 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1372 operand
= error_mark_node
;
1375 operand
= error_mark_node
;
1377 TREE_VALUE (t
) = operand
;
1380 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1382 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1383 bool constraint_parsed
1384 = parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1385 oconstraints
, &allows_mem
, &allows_reg
);
1386 /* If the operand is going to end up in memory, don't call
1387 decay_conversion. */
1388 if (constraint_parsed
&& !allows_reg
&& allows_mem
)
1389 operand
= mark_lvalue_use (TREE_VALUE (t
));
1391 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1393 /* If the type of the operand hasn't been determined (e.g.,
1394 because it involves an overloaded function), then issue
1395 an error message. There's no context available to
1396 resolve the overloading. */
1397 if (TREE_TYPE (operand
) == unknown_type_node
)
1399 error ("type of asm operand %qE could not be determined",
1401 operand
= error_mark_node
;
1404 if (constraint_parsed
)
1406 /* If the operand is going to end up in memory,
1407 mark it addressable. */
1408 if (!allows_reg
&& allows_mem
)
1410 /* Strip the nops as we allow this case. FIXME, this really
1411 should be rejected or made deprecated. */
1412 STRIP_NOPS (operand
);
1413 if (!cxx_mark_addressable (operand
))
1414 operand
= error_mark_node
;
1416 else if (!allows_reg
&& !allows_mem
)
1418 /* If constraint allows neither register nor memory,
1419 try harder to get a constant. */
1420 tree constop
= maybe_constant_value (operand
);
1421 if (TREE_CONSTANT (constop
))
1426 operand
= error_mark_node
;
1428 TREE_VALUE (t
) = operand
;
1432 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1433 output_operands
, input_operands
,
1435 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1436 r
= maybe_cleanup_point_expr_void (r
);
1437 return add_stmt (r
);
1440 /* Finish a label with the indicated NAME. Returns the new label. */
1443 finish_label_stmt (tree name
)
1445 tree decl
= define_label (input_location
, name
);
1447 if (decl
== error_mark_node
)
1448 return error_mark_node
;
1450 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1455 /* Finish a series of declarations for local labels. G++ allows users
1456 to declare "local" labels, i.e., labels with scope. This extension
1457 is useful when writing code involving statement-expressions. */
1460 finish_label_decl (tree name
)
1462 if (!at_function_scope_p ())
1464 error ("__label__ declarations are only allowed in function scopes");
1468 add_decl_expr (declare_local_label (name
));
1471 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1474 finish_decl_cleanup (tree decl
, tree cleanup
)
1476 push_cleanup (decl
, cleanup
, false);
1479 /* If the current scope exits with an exception, run CLEANUP. */
1482 finish_eh_cleanup (tree cleanup
)
1484 push_cleanup (NULL
, cleanup
, true);
1487 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1488 order they were written by the user. Each node is as for
1489 emit_mem_initializers. */
1492 finish_mem_initializers (tree mem_inits
)
1494 /* Reorder the MEM_INITS so that they are in the order they appeared
1495 in the source program. */
1496 mem_inits
= nreverse (mem_inits
);
1498 if (processing_template_decl
)
1502 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1504 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1505 check for bare parameter packs in the TREE_VALUE, because
1506 any parameter packs in the TREE_VALUE have already been
1507 bound as part of the TREE_PURPOSE. See
1508 make_pack_expansion for more information. */
1509 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1510 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1511 TREE_VALUE (mem
) = error_mark_node
;
1514 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1515 CTOR_INITIALIZER
, mem_inits
));
1518 emit_mem_initializers (mem_inits
);
1521 /* Finish a parenthesized expression EXPR. */
1524 finish_parenthesized_expr (tree expr
)
1527 /* This inhibits warnings in c_common_truthvalue_conversion. */
1528 TREE_NO_WARNING (expr
) = 1;
1530 if (TREE_CODE (expr
) == OFFSET_REF
1531 || TREE_CODE (expr
) == SCOPE_REF
)
1532 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1533 enclosed in parentheses. */
1534 PTRMEM_OK_P (expr
) = 0;
1536 if (TREE_CODE (expr
) == STRING_CST
)
1537 PAREN_STRING_LITERAL_P (expr
) = 1;
1542 /* Finish a reference to a non-static data member (DECL) that is not
1543 preceded by `.' or `->'. */
1546 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1548 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1552 tree scope
= qualifying_scope
;
1553 if (scope
== NULL_TREE
)
1554 scope
= context_for_name_lookup (decl
);
1555 object
= maybe_dummy_object (scope
, NULL
);
1558 object
= maybe_resolve_dummy (object
);
1559 if (object
== error_mark_node
)
1560 return error_mark_node
;
1562 /* DR 613: Can use non-static data members without an associated
1563 object in sizeof/decltype/alignof. */
1564 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1565 && (!processing_template_decl
|| !current_class_ref
))
1567 if (current_function_decl
1568 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1569 error ("invalid use of member %q+D in static member function", decl
);
1571 error ("invalid use of non-static data member %q+D", decl
);
1572 error ("from this location");
1574 return error_mark_node
;
1577 if (current_class_ptr
)
1578 TREE_USED (current_class_ptr
) = 1;
1579 if (processing_template_decl
&& !qualifying_scope
)
1581 tree type
= TREE_TYPE (decl
);
1583 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1584 /* Quals on the object don't matter. */;
1587 /* Set the cv qualifiers. */
1588 int quals
= cp_type_quals (TREE_TYPE (object
));
1590 if (DECL_MUTABLE_P (decl
))
1591 quals
&= ~TYPE_QUAL_CONST
;
1593 quals
|= cp_type_quals (TREE_TYPE (decl
));
1594 type
= cp_build_qualified_type (type
, quals
);
1597 return (convert_from_reference
1598 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1600 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1601 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1603 else if (processing_template_decl
)
1604 return build_qualified_name (TREE_TYPE (decl
),
1607 /*template_p=*/false);
1610 tree access_type
= TREE_TYPE (object
);
1612 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1613 decl
, tf_warning_or_error
);
1615 /* If the data member was named `C::M', convert `*this' to `C'
1617 if (qualifying_scope
)
1619 tree binfo
= NULL_TREE
;
1620 object
= build_scoped_ref (object
, qualifying_scope
,
1624 return build_class_member_access_expr (object
, decl
,
1625 /*access_path=*/NULL_TREE
,
1626 /*preserve_reference=*/false,
1627 tf_warning_or_error
);
1631 /* If we are currently parsing a template and we encountered a typedef
1632 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1633 adds the typedef to a list tied to the current template.
1634 At template instantiation time, that list is walked and access check
1635 performed for each typedef.
1636 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1639 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1641 location_t location
)
1643 tree template_info
= NULL
;
1644 tree cs
= current_scope ();
1646 if (!is_typedef_decl (typedef_decl
)
1648 || !CLASS_TYPE_P (context
)
1652 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1653 template_info
= get_template_info (cs
);
1656 && TI_TEMPLATE (template_info
)
1657 && !currently_open_class (context
))
1658 append_type_to_template_for_access_check (cs
, typedef_decl
,
1662 /* DECL was the declaration to which a qualified-id resolved. Issue
1663 an error message if it is not accessible. If OBJECT_TYPE is
1664 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1665 type of `*x', or `x', respectively. If the DECL was named as
1666 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1669 check_accessibility_of_qualified_id (tree decl
,
1671 tree nested_name_specifier
)
1674 tree qualifying_type
= NULL_TREE
;
1676 /* If we are parsing a template declaration and if decl is a typedef,
1677 add it to a list tied to the template.
1678 At template instantiation time, that list will be walked and
1679 access check performed. */
1680 add_typedef_to_current_template_for_access_check (decl
,
1681 nested_name_specifier
1682 ? nested_name_specifier
1683 : DECL_CONTEXT (decl
),
1686 /* If we're not checking, return immediately. */
1687 if (deferred_access_no_check
)
1690 /* Determine the SCOPE of DECL. */
1691 scope
= context_for_name_lookup (decl
);
1692 /* If the SCOPE is not a type, then DECL is not a member. */
1693 if (!TYPE_P (scope
))
1695 /* Compute the scope through which DECL is being accessed. */
1697 /* OBJECT_TYPE might not be a class type; consider:
1699 class A { typedef int I; };
1703 In this case, we will have "A::I" as the DECL, but "I" as the
1705 && CLASS_TYPE_P (object_type
)
1706 && DERIVED_FROM_P (scope
, object_type
))
1707 /* If we are processing a `->' or `.' expression, use the type of the
1709 qualifying_type
= object_type
;
1710 else if (nested_name_specifier
)
1712 /* If the reference is to a non-static member of the
1713 current class, treat it as if it were referenced through
1715 if (DECL_NONSTATIC_MEMBER_P (decl
)
1716 && current_class_ptr
1717 && DERIVED_FROM_P (scope
, current_class_type
))
1718 qualifying_type
= current_class_type
;
1719 /* Otherwise, use the type indicated by the
1720 nested-name-specifier. */
1722 qualifying_type
= nested_name_specifier
;
1725 /* Otherwise, the name must be from the current class or one of
1727 qualifying_type
= currently_open_derived_class (scope
);
1730 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1731 or similar in a default argument value. */
1732 && CLASS_TYPE_P (qualifying_type
)
1733 && !dependent_type_p (qualifying_type
))
1734 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1735 decl
, tf_warning_or_error
);
1738 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1739 class named to the left of the "::" operator. DONE is true if this
1740 expression is a complete postfix-expression; it is false if this
1741 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1742 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1743 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1744 is true iff this qualified name appears as a template argument. */
1747 finish_qualified_id_expr (tree qualifying_class
,
1752 bool template_arg_p
,
1753 tsubst_flags_t complain
)
1755 gcc_assert (TYPE_P (qualifying_class
));
1757 if (error_operand_p (expr
))
1758 return error_mark_node
;
1760 if (DECL_P (expr
) || BASELINK_P (expr
))
1764 check_template_keyword (expr
);
1766 /* If EXPR occurs as the operand of '&', use special handling that
1767 permits a pointer-to-member. */
1768 if (address_p
&& done
)
1770 if (TREE_CODE (expr
) == SCOPE_REF
)
1771 expr
= TREE_OPERAND (expr
, 1);
1772 expr
= build_offset_ref (qualifying_class
, expr
,
1773 /*address_p=*/true, complain
);
1777 /* No need to check access within an enum. */
1778 if (TREE_CODE (qualifying_class
) == ENUMERAL_TYPE
)
1781 /* Within the scope of a class, turn references to non-static
1782 members into expression of the form "this->...". */
1784 /* But, within a template argument, we do not want make the
1785 transformation, as there is no "this" pointer. */
1787 else if (TREE_CODE (expr
) == FIELD_DECL
)
1789 push_deferring_access_checks (dk_no_check
);
1790 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1792 pop_deferring_access_checks ();
1794 else if (BASELINK_P (expr
) && !processing_template_decl
)
1796 /* See if any of the functions are non-static members. */
1797 /* If so, the expression may be relative to 'this'. */
1798 if (!shared_member_p (expr
)
1799 && current_class_ptr
1800 && DERIVED_FROM_P (qualifying_class
,
1801 current_nonlambda_class_type ()))
1802 expr
= (build_class_member_access_expr
1803 (maybe_dummy_object (qualifying_class
, NULL
),
1805 BASELINK_ACCESS_BINFO (expr
),
1806 /*preserve_reference=*/false,
1809 /* The expression is a qualified name whose address is not
1811 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false,
1814 else if (BASELINK_P (expr
))
1818 /* In a template, return a SCOPE_REF for most qualified-ids
1819 so that we can check access at instantiation time. But if
1820 we're looking at a member of the current instantiation, we
1821 know we have access and building up the SCOPE_REF confuses
1822 non-type template argument handling. */
1823 if (processing_template_decl
1824 && !currently_open_class (qualifying_class
))
1825 expr
= build_qualified_name (TREE_TYPE (expr
),
1826 qualifying_class
, expr
,
1829 expr
= convert_from_reference (expr
);
1835 /* Begin a statement-expression. The value returned must be passed to
1836 finish_stmt_expr. */
1839 begin_stmt_expr (void)
1841 return push_stmt_list ();
1844 /* Process the final expression of a statement expression. EXPR can be
1845 NULL, if the final expression is empty. Return a STATEMENT_LIST
1846 containing all the statements in the statement-expression, or
1847 ERROR_MARK_NODE if there was an error. */
1850 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1852 if (error_operand_p (expr
))
1854 /* The type of the statement-expression is the type of the last
1856 TREE_TYPE (stmt_expr
) = error_mark_node
;
1857 return error_mark_node
;
1860 /* If the last statement does not have "void" type, then the value
1861 of the last statement is the value of the entire expression. */
1864 tree type
= TREE_TYPE (expr
);
1866 if (processing_template_decl
)
1868 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1869 expr
= add_stmt (expr
);
1870 /* Mark the last statement so that we can recognize it as such at
1871 template-instantiation time. */
1872 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1874 else if (VOID_TYPE_P (type
))
1876 /* Just treat this like an ordinary statement. */
1877 expr
= finish_expr_stmt (expr
);
1881 /* It actually has a value we need to deal with. First, force it
1882 to be an rvalue so that we won't need to build up a copy
1883 constructor call later when we try to assign it to something. */
1884 expr
= force_rvalue (expr
, tf_warning_or_error
);
1885 if (error_operand_p (expr
))
1886 return error_mark_node
;
1888 /* Update for array-to-pointer decay. */
1889 type
= TREE_TYPE (expr
);
1891 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1892 normal statement, but don't convert to void or actually add
1894 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1895 expr
= maybe_cleanup_point_expr (expr
);
1899 /* The type of the statement-expression is the type of the last
1901 TREE_TYPE (stmt_expr
) = type
;
1907 /* Finish a statement-expression. EXPR should be the value returned
1908 by the previous begin_stmt_expr. Returns an expression
1909 representing the statement-expression. */
1912 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1917 if (error_operand_p (stmt_expr
))
1919 pop_stmt_list (stmt_expr
);
1920 return error_mark_node
;
1923 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1925 type
= TREE_TYPE (stmt_expr
);
1926 result
= pop_stmt_list (stmt_expr
);
1927 TREE_TYPE (result
) = type
;
1929 if (processing_template_decl
)
1931 result
= build_min (STMT_EXPR
, type
, result
);
1932 TREE_SIDE_EFFECTS (result
) = 1;
1933 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1935 else if (CLASS_TYPE_P (type
))
1937 /* Wrap the statement-expression in a TARGET_EXPR so that the
1938 temporary object created by the final expression is destroyed at
1939 the end of the full-expression containing the
1940 statement-expression. */
1941 result
= force_target_expr (type
, result
, tf_warning_or_error
);
1947 /* Returns the expression which provides the value of STMT_EXPR. */
1950 stmt_expr_value_expr (tree stmt_expr
)
1952 tree t
= STMT_EXPR_STMT (stmt_expr
);
1954 if (TREE_CODE (t
) == BIND_EXPR
)
1955 t
= BIND_EXPR_BODY (t
);
1957 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1958 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1960 if (TREE_CODE (t
) == EXPR_STMT
)
1961 t
= EXPR_STMT_EXPR (t
);
1966 /* Return TRUE iff EXPR_STMT is an empty list of
1967 expression statements. */
1970 empty_expr_stmt_p (tree expr_stmt
)
1972 tree body
= NULL_TREE
;
1974 if (expr_stmt
== void_zero_node
)
1979 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1980 body
= EXPR_STMT_EXPR (expr_stmt
);
1981 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1987 if (TREE_CODE (body
) == STATEMENT_LIST
)
1988 return tsi_end_p (tsi_start (body
));
1990 return empty_expr_stmt_p (body
);
1995 /* Perform Koenig lookup. FN is the postfix-expression representing
1996 the function (or functions) to call; ARGS are the arguments to the
1997 call; if INCLUDE_STD then the `std' namespace is automatically
1998 considered an associated namespace (used in range-based for loops).
1999 Returns the functions to be considered by overload resolution. */
2002 perform_koenig_lookup (tree fn
, vec
<tree
, va_gc
> *args
, bool include_std
,
2003 tsubst_flags_t complain
)
2005 tree identifier
= NULL_TREE
;
2006 tree functions
= NULL_TREE
;
2007 tree tmpl_args
= NULL_TREE
;
2008 bool template_id
= false;
2010 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2012 /* Use a separate flag to handle null args. */
2014 tmpl_args
= TREE_OPERAND (fn
, 1);
2015 fn
= TREE_OPERAND (fn
, 0);
2018 /* Find the name of the overloaded function. */
2019 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
2021 else if (is_overloaded_fn (fn
))
2024 identifier
= DECL_NAME (get_first_fn (functions
));
2026 else if (DECL_P (fn
))
2029 identifier
= DECL_NAME (fn
);
2032 /* A call to a namespace-scope function using an unqualified name.
2034 Do Koenig lookup -- unless any of the arguments are
2036 if (!any_type_dependent_arguments_p (args
)
2037 && !any_dependent_template_arguments_p (tmpl_args
))
2039 fn
= lookup_arg_dependent (identifier
, functions
, args
, include_std
);
2042 /* The unqualified name could not be resolved. */
2044 fn
= unqualified_fn_lookup_error (identifier
);
2050 if (fn
&& template_id
)
2051 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2056 /* Generate an expression for `FN (ARGS)'. This may change the
2059 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2060 as a virtual call, even if FN is virtual. (This flag is set when
2061 encountering an expression where the function name is explicitly
2062 qualified. For example a call to `X::f' never generates a virtual
2065 Returns code for the call. */
2068 finish_call_expr (tree fn
, vec
<tree
, va_gc
> **args
, bool disallow_virtual
,
2069 bool koenig_p
, tsubst_flags_t complain
)
2073 vec
<tree
, va_gc
> *orig_args
= NULL
;
2075 if (fn
== error_mark_node
)
2076 return error_mark_node
;
2078 gcc_assert (!TYPE_P (fn
));
2082 if (processing_template_decl
)
2084 /* If the call expression is dependent, build a CALL_EXPR node
2085 with no type; type_dependent_expression_p recognizes
2086 expressions with no type as being dependent. */
2087 if (type_dependent_expression_p (fn
)
2088 || any_type_dependent_arguments_p (*args
)
2089 /* For a non-static member function that doesn't have an
2090 explicit object argument, we need to specifically
2091 test the type dependency of the "this" pointer because it
2092 is not included in *ARGS even though it is considered to
2093 be part of the list of arguments. Note that this is
2094 related to CWG issues 515 and 1005. */
2095 || (TREE_CODE (fn
) != COMPONENT_REF
2096 && non_static_member_function_p (fn
)
2097 && current_class_ref
2098 && type_dependent_expression_p (current_class_ref
)))
2100 result
= build_nt_call_vec (fn
, *args
);
2101 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_HERE (fn
));
2102 KOENIG_LOOKUP_P (result
) = koenig_p
;
2107 tree fndecl
= OVL_CURRENT (fn
);
2108 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2109 || !TREE_THIS_VOLATILE (fndecl
))
2115 current_function_returns_abnormally
= 1;
2119 orig_args
= make_tree_vector_copy (*args
);
2120 if (!BASELINK_P (fn
)
2121 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2122 && TREE_TYPE (fn
) != unknown_type_node
)
2123 fn
= build_non_dependent_expr (fn
);
2124 make_args_non_dependent (*args
);
2127 if (TREE_CODE (fn
) == COMPONENT_REF
)
2129 tree member
= TREE_OPERAND (fn
, 1);
2130 if (BASELINK_P (member
))
2132 tree object
= TREE_OPERAND (fn
, 0);
2133 return build_new_method_call (object
, member
,
2136 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2143 if (is_overloaded_fn (fn
))
2144 fn
= baselink_for_fns (fn
);
2147 if (BASELINK_P (fn
))
2151 /* A call to a member function. From [over.call.func]:
2153 If the keyword this is in scope and refers to the class of
2154 that member function, or a derived class thereof, then the
2155 function call is transformed into a qualified function call
2156 using (*this) as the postfix-expression to the left of the
2157 . operator.... [Otherwise] a contrived object of type T
2158 becomes the implied object argument.
2162 struct A { void f(); };
2163 struct B : public A {};
2164 struct C : public A { void g() { B::f(); }};
2166 "the class of that member function" refers to `A'. But 11.2
2167 [class.access.base] says that we need to convert 'this' to B* as
2168 part of the access, so we pass 'B' to maybe_dummy_object. */
2170 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2173 if (processing_template_decl
)
2175 if (type_dependent_expression_p (object
))
2177 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2178 release_tree_vector (orig_args
);
2181 object
= build_non_dependent_expr (object
);
2184 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2186 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2191 else if (is_overloaded_fn (fn
))
2193 /* If the function is an overloaded builtin, resolve it. */
2194 if (TREE_CODE (fn
) == FUNCTION_DECL
2195 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2196 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2197 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2201 if (warn_sizeof_pointer_memaccess
2202 && !vec_safe_is_empty (*args
)
2203 && !processing_template_decl
)
2205 location_t sizeof_arg_loc
[3];
2208 for (i
= 0; i
< 3; i
++)
2212 sizeof_arg_loc
[i
] = UNKNOWN_LOCATION
;
2213 sizeof_arg
[i
] = NULL_TREE
;
2214 if (i
>= (*args
)->length ())
2217 if (TREE_CODE (t
) != SIZEOF_EXPR
)
2219 if (SIZEOF_EXPR_TYPE_P (t
))
2220 sizeof_arg
[i
] = TREE_TYPE (TREE_OPERAND (t
, 0));
2222 sizeof_arg
[i
] = TREE_OPERAND (t
, 0);
2223 sizeof_arg_loc
[i
] = EXPR_LOCATION (t
);
2225 sizeof_pointer_memaccess_warning
2226 (sizeof_arg_loc
, fn
, *args
,
2227 sizeof_arg
, same_type_ignoring_top_level_qualifiers_p
);
2230 /* A call to a namespace-scope function. */
2231 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2234 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2236 if (!vec_safe_is_empty (*args
))
2237 error ("arguments to destructor are not allowed");
2238 /* Mark the pseudo-destructor call as having side-effects so
2239 that we do not issue warnings about its use. */
2240 result
= build1 (NOP_EXPR
,
2242 TREE_OPERAND (fn
, 0));
2243 TREE_SIDE_EFFECTS (result
) = 1;
2245 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2246 /* If the "function" is really an object of class type, it might
2247 have an overloaded `operator ()'. */
2248 result
= build_op_call (fn
, args
, complain
);
2251 /* A call where the function is unknown. */
2252 result
= cp_build_function_call_vec (fn
, args
, complain
);
2254 if (processing_template_decl
&& result
!= error_mark_node
)
2256 if (TREE_CODE (result
) == INDIRECT_REF
)
2257 result
= TREE_OPERAND (result
, 0);
2258 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2259 SET_EXPR_LOCATION (result
, input_location
);
2260 KOENIG_LOOKUP_P (result
) = koenig_p
;
2261 release_tree_vector (orig_args
);
2262 result
= convert_from_reference (result
);
2267 /* Free garbage OVERLOADs from arg-dependent lookup. */
2268 tree next
= NULL_TREE
;
2270 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2273 if (processing_template_decl
)
2274 /* In a template, we'll re-use them at instantiation time. */
2275 OVL_ARG_DEPENDENT (fn
) = false;
2278 next
= OVL_CHAIN (fn
);
2287 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2288 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2289 POSTDECREMENT_EXPR.) */
2292 finish_increment_expr (tree expr
, enum tree_code code
)
2294 return build_x_unary_op (input_location
, code
, expr
, tf_warning_or_error
);
2297 /* Finish a use of `this'. Returns an expression for `this'. */
2300 finish_this_expr (void)
2304 if (current_class_ptr
)
2306 tree type
= TREE_TYPE (current_class_ref
);
2308 /* In a lambda expression, 'this' refers to the captured 'this'. */
2309 if (LAMBDA_TYPE_P (type
))
2310 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2312 result
= current_class_ptr
;
2315 else if (current_function_decl
2316 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2318 error ("%<this%> is unavailable for static member functions");
2319 result
= error_mark_node
;
2323 if (current_function_decl
)
2324 error ("invalid use of %<this%> in non-member function");
2326 error ("invalid use of %<this%> at top level");
2327 result
= error_mark_node
;
2333 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2334 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2335 the TYPE for the type given. If SCOPE is non-NULL, the expression
2336 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2339 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2341 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2342 return error_mark_node
;
2344 gcc_assert (TYPE_P (destructor
));
2346 if (!processing_template_decl
)
2348 if (scope
== error_mark_node
)
2350 error ("invalid qualifying scope in pseudo-destructor name");
2351 return error_mark_node
;
2353 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2355 error ("qualified type %qT does not match destructor name ~%qT",
2357 return error_mark_node
;
2361 /* [expr.pseudo] says both:
2363 The type designated by the pseudo-destructor-name shall be
2364 the same as the object type.
2368 The cv-unqualified versions of the object type and of the
2369 type designated by the pseudo-destructor-name shall be the
2372 We implement the more generous second sentence, since that is
2373 what most other compilers do. */
2374 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2377 error ("%qE is not of type %qT", object
, destructor
);
2378 return error_mark_node
;
2382 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2385 /* Finish an expression of the form CODE EXPR. */
2388 finish_unary_op_expr (location_t loc
, enum tree_code code
, tree expr
,
2389 tsubst_flags_t complain
)
2391 tree result
= build_x_unary_op (loc
, code
, expr
, complain
);
2392 if ((complain
& tf_warning
)
2393 && TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2394 overflow_warning (input_location
, result
);
2399 /* Finish a compound-literal expression. TYPE is the type to which
2400 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2403 finish_compound_literal (tree type
, tree compound_literal
,
2404 tsubst_flags_t complain
)
2406 if (type
== error_mark_node
)
2407 return error_mark_node
;
2409 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2412 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2414 return cp_build_c_cast (type
, compound_literal
, complain
);
2417 if (!TYPE_OBJ_P (type
))
2419 if (complain
& tf_error
)
2420 error ("compound literal of non-object type %qT", type
);
2421 return error_mark_node
;
2424 if (processing_template_decl
)
2426 TREE_TYPE (compound_literal
) = type
;
2427 /* Mark the expression as a compound literal. */
2428 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2429 return compound_literal
;
2432 type
= complete_type (type
);
2434 if (TYPE_NON_AGGREGATE_CLASS (type
))
2436 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2437 everywhere that deals with function arguments would be a pain, so
2438 just wrap it in a TREE_LIST. The parser set a flag so we know
2439 that it came from T{} rather than T({}). */
2440 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2441 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2442 return build_functional_cast (type
, compound_literal
, complain
);
2445 if (TREE_CODE (type
) == ARRAY_TYPE
2446 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2447 return error_mark_node
;
2448 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2449 if (SCALAR_TYPE_P (type
)
2450 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2451 && (complain
& tf_warning_or_error
))
2452 check_narrowing (type
, compound_literal
);
2453 if (TREE_CODE (type
) == ARRAY_TYPE
2454 && TYPE_DOMAIN (type
) == NULL_TREE
)
2456 cp_complete_array_type_or_error (&type
, compound_literal
,
2458 if (type
== error_mark_node
)
2459 return error_mark_node
;
2461 compound_literal
= digest_init (type
, compound_literal
, complain
);
2462 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2463 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2464 /* Put static/constant array temporaries in static variables, but always
2465 represent class temporaries with TARGET_EXPR so we elide copies. */
2466 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2467 && TREE_CODE (type
) == ARRAY_TYPE
2468 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2469 && initializer_constant_valid_p (compound_literal
, type
))
2471 tree decl
= create_temporary_var (type
);
2472 DECL_INITIAL (decl
) = compound_literal
;
2473 TREE_STATIC (decl
) = 1;
2474 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2476 /* 5.19 says that a constant expression can include an
2477 lvalue-rvalue conversion applied to "a glvalue of literal type
2478 that refers to a non-volatile temporary object initialized
2479 with a constant expression". Rather than try to communicate
2480 that this VAR_DECL is a temporary, just mark it constexpr. */
2481 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2482 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2483 TREE_CONSTANT (decl
) = true;
2485 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2486 decl
= pushdecl_top_level (decl
);
2487 DECL_NAME (decl
) = make_anon_name ();
2488 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2492 return get_target_expr_sfinae (compound_literal
, complain
);
2495 /* Return the declaration for the function-name variable indicated by
2499 finish_fname (tree id
)
2503 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2504 if (processing_template_decl
&& current_function_decl
2505 && decl
!= error_mark_node
)
2506 decl
= DECL_NAME (decl
);
2510 /* Finish a translation unit. */
2513 finish_translation_unit (void)
2515 /* In case there were missing closebraces,
2516 get us back to the global binding level. */
2518 while (current_namespace
!= global_namespace
)
2521 /* Do file scope __FUNCTION__ et al. */
2522 finish_fname_decls ();
2525 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2526 Returns the parameter. */
2529 finish_template_type_parm (tree aggr
, tree identifier
)
2531 if (aggr
!= class_type_node
)
2533 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2534 aggr
= class_type_node
;
2537 return build_tree_list (aggr
, identifier
);
2540 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2541 Returns the parameter. */
2544 finish_template_template_parm (tree aggr
, tree identifier
)
2546 tree decl
= build_decl (input_location
,
2547 TYPE_DECL
, identifier
, NULL_TREE
);
2548 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2549 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2550 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2551 DECL_ARTIFICIAL (decl
) = 1;
2552 end_template_decl ();
2554 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2556 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2557 /*is_primary=*/true, /*is_partial=*/false,
2560 return finish_template_type_parm (aggr
, tmpl
);
2563 /* ARGUMENT is the default-argument value for a template template
2564 parameter. If ARGUMENT is invalid, issue error messages and return
2565 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2568 check_template_template_default_arg (tree argument
)
2570 if (TREE_CODE (argument
) != TEMPLATE_DECL
2571 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2572 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2574 if (TREE_CODE (argument
) == TYPE_DECL
)
2575 error ("invalid use of type %qT as a default value for a template "
2576 "template-parameter", TREE_TYPE (argument
));
2578 error ("invalid default argument for a template template parameter");
2579 return error_mark_node
;
2585 /* Begin a class definition, as indicated by T. */
2588 begin_class_definition (tree t
)
2590 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2591 return error_mark_node
;
2593 if (processing_template_parmlist
)
2595 error ("definition of %q#T inside template parameter list", t
);
2596 return error_mark_node
;
2599 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2600 are passed the same as decimal scalar types. */
2601 if (TREE_CODE (t
) == RECORD_TYPE
2602 && !processing_template_decl
)
2604 tree ns
= TYPE_CONTEXT (t
);
2605 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2606 && DECL_CONTEXT (ns
) == std_node
2608 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2610 const char *n
= TYPE_NAME_STRING (t
);
2611 if ((strcmp (n
, "decimal32") == 0)
2612 || (strcmp (n
, "decimal64") == 0)
2613 || (strcmp (n
, "decimal128") == 0))
2614 TYPE_TRANSPARENT_AGGR (t
) = 1;
2618 /* A non-implicit typename comes from code like:
2620 template <typename T> struct A {
2621 template <typename U> struct A<T>::B ...
2623 This is erroneous. */
2624 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2626 error ("invalid definition of qualified type %qT", t
);
2627 t
= error_mark_node
;
2630 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2632 t
= make_class_type (RECORD_TYPE
);
2633 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2636 if (TYPE_BEING_DEFINED (t
))
2638 t
= make_class_type (TREE_CODE (t
));
2639 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2641 maybe_process_partial_specialization (t
);
2643 TYPE_BEING_DEFINED (t
) = 1;
2645 if (flag_pack_struct
)
2648 TYPE_PACKED (t
) = 1;
2649 /* Even though the type is being defined for the first time
2650 here, there might have been a forward declaration, so there
2651 might be cv-qualified variants of T. */
2652 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2653 TYPE_PACKED (v
) = 1;
2655 /* Reset the interface data, at the earliest possible
2656 moment, as it might have been set via a class foo;
2658 if (! TYPE_ANONYMOUS_P (t
))
2660 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2661 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2662 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2663 (t
, finfo
->interface_unknown
);
2665 reset_specialization();
2667 /* Make a declaration for this class in its own scope. */
2668 build_self_reference ();
2673 /* Finish the member declaration given by DECL. */
2676 finish_member_declaration (tree decl
)
2678 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2681 if (decl
== void_type_node
)
2682 /* The COMPONENT was a friend, not a member, and so there's
2683 nothing for us to do. */
2686 /* We should see only one DECL at a time. */
2687 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2689 /* Set up access control for DECL. */
2691 = (current_access_specifier
== access_private_node
);
2692 TREE_PROTECTED (decl
)
2693 = (current_access_specifier
== access_protected_node
);
2694 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2696 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2697 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2700 /* Mark the DECL as a member of the current class, unless it's
2701 a member of an enumeration. */
2702 if (TREE_CODE (decl
) != CONST_DECL
)
2703 DECL_CONTEXT (decl
) = current_class_type
;
2705 /* Check for bare parameter packs in the member variable declaration. */
2706 if (TREE_CODE (decl
) == FIELD_DECL
)
2708 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2709 TREE_TYPE (decl
) = error_mark_node
;
2710 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2711 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2716 A C language linkage is ignored for the names of class members
2717 and the member function type of class member functions. */
2718 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2719 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2721 /* Put functions on the TYPE_METHODS list and everything else on the
2722 TYPE_FIELDS list. Note that these are built up in reverse order.
2723 We reverse them (to obtain declaration order) in finish_struct. */
2724 if (TREE_CODE (decl
) == FUNCTION_DECL
2725 || DECL_FUNCTION_TEMPLATE_P (decl
))
2727 /* We also need to add this function to the
2728 CLASSTYPE_METHOD_VEC. */
2729 if (add_method (current_class_type
, decl
, NULL_TREE
))
2731 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2732 TYPE_METHODS (current_class_type
) = decl
;
2734 maybe_add_class_template_decl_list (current_class_type
, decl
,
2738 /* Enter the DECL into the scope of the class, if the class
2739 isn't a closure (whose fields are supposed to be unnamed). */
2740 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type
)
2741 || pushdecl_class_level (decl
))
2743 if (TREE_CODE (decl
) == USING_DECL
)
2745 /* For now, ignore class-scope USING_DECLS, so that
2746 debugging backends do not see them. */
2747 DECL_IGNORED_P (decl
) = 1;
2750 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2751 go at the beginning. The reason is that lookup_field_1
2752 searches the list in order, and we want a field name to
2753 override a type name so that the "struct stat hack" will
2754 work. In particular:
2756 struct S { enum E { }; int E } s;
2759 is valid. In addition, the FIELD_DECLs must be maintained in
2760 declaration order so that class layout works as expected.
2761 However, we don't need that order until class layout, so we
2762 save a little time by putting FIELD_DECLs on in reverse order
2763 here, and then reversing them in finish_struct_1. (We could
2764 also keep a pointer to the correct insertion points in the
2767 if (TREE_CODE (decl
) == TYPE_DECL
)
2768 TYPE_FIELDS (current_class_type
)
2769 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2772 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2773 TYPE_FIELDS (current_class_type
) = decl
;
2776 maybe_add_class_template_decl_list (current_class_type
, decl
,
2781 note_decl_for_pch (decl
);
2784 /* DECL has been declared while we are building a PCH file. Perform
2785 actions that we might normally undertake lazily, but which can be
2786 performed now so that they do not have to be performed in
2787 translation units which include the PCH file. */
2790 note_decl_for_pch (tree decl
)
2792 gcc_assert (pch_file
);
2794 /* There's a good chance that we'll have to mangle names at some
2795 point, even if only for emission in debugging information. */
2796 if ((TREE_CODE (decl
) == VAR_DECL
2797 || TREE_CODE (decl
) == FUNCTION_DECL
)
2798 && !processing_template_decl
)
2802 /* Finish processing a complete template declaration. The PARMS are
2803 the template parameters. */
2806 finish_template_decl (tree parms
)
2809 end_template_decl ();
2811 end_specialization ();
2814 /* Finish processing a template-id (which names a type) of the form
2815 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2816 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2817 the scope of template-id indicated. */
2820 finish_template_type (tree name
, tree args
, int entering_scope
)
2824 type
= lookup_template_class (name
, args
,
2825 NULL_TREE
, NULL_TREE
, entering_scope
,
2826 tf_warning_or_error
| tf_user
);
2827 if (type
== error_mark_node
)
2829 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
2830 return TYPE_STUB_DECL (type
);
2832 return TYPE_NAME (type
);
2835 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2836 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2837 BASE_CLASS, or NULL_TREE if an error occurred. The
2838 ACCESS_SPECIFIER is one of
2839 access_{default,public,protected_private}_node. For a virtual base
2840 we set TREE_TYPE. */
2843 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2847 if (base
== error_mark_node
)
2849 error ("invalid base-class specification");
2852 else if (! MAYBE_CLASS_TYPE_P (base
))
2854 error ("%qT is not a class type", base
);
2859 if (cp_type_quals (base
) != 0)
2861 /* DR 484: Can a base-specifier name a cv-qualified
2863 base
= TYPE_MAIN_VARIANT (base
);
2865 result
= build_tree_list (access
, base
);
2867 TREE_TYPE (result
) = integer_type_node
;
2873 /* If FNS is a member function, a set of member functions, or a
2874 template-id referring to one or more member functions, return a
2875 BASELINK for FNS, incorporating the current access context.
2876 Otherwise, return FNS unchanged. */
2879 baselink_for_fns (tree fns
)
2884 if (BASELINK_P (fns
)
2885 || error_operand_p (fns
))
2888 scope
= ovl_scope (fns
);
2889 if (!CLASS_TYPE_P (scope
))
2892 cl
= currently_open_derived_class (scope
);
2895 cl
= TYPE_BINFO (cl
);
2896 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2899 /* Returns true iff DECL is a variable from a function outside
2903 outer_var_p (tree decl
)
2905 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2906 && DECL_FUNCTION_SCOPE_P (decl
)
2907 && DECL_CONTEXT (decl
) != current_function_decl
);
2910 /* As above, but also checks that DECL is automatic. */
2913 outer_automatic_var_p (tree decl
)
2915 return (outer_var_p (decl
)
2916 && !TREE_STATIC (decl
));
2919 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2920 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2921 if non-NULL, is the type or namespace used to explicitly qualify
2922 ID_EXPRESSION. DECL is the entity to which that name has been
2925 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2926 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2927 be set to true if this expression isn't permitted in a
2928 constant-expression, but it is otherwise not set by this function.
2929 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2930 constant-expression, but a non-constant expression is also
2933 DONE is true if this expression is a complete postfix-expression;
2934 it is false if this expression is followed by '->', '[', '(', etc.
2935 ADDRESS_P is true iff this expression is the operand of '&'.
2936 TEMPLATE_P is true iff the qualified-id was of the form
2937 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2938 appears as a template argument.
2940 If an error occurs, and it is the kind of error that might cause
2941 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2942 is the caller's responsibility to issue the message. *ERROR_MSG
2943 will be a string with static storage duration, so the caller need
2946 Return an expression for the entity, after issuing appropriate
2947 diagnostics. This function is also responsible for transforming a
2948 reference to a non-static member into a COMPONENT_REF that makes
2949 the use of "this" explicit.
2951 Upon return, *IDK will be filled in appropriately. */
2953 finish_id_expression (tree id_expression
,
2957 bool integral_constant_expression_p
,
2958 bool allow_non_integral_constant_expression_p
,
2959 bool *non_integral_constant_expression_p
,
2963 bool template_arg_p
,
2964 const char **error_msg
,
2965 location_t location
)
2967 decl
= strip_using_decl (decl
);
2969 /* Initialize the output parameters. */
2970 *idk
= CP_ID_KIND_NONE
;
2973 if (id_expression
== error_mark_node
)
2974 return error_mark_node
;
2975 /* If we have a template-id, then no further lookup is
2976 required. If the template-id was for a template-class, we
2977 will sometimes have a TYPE_DECL at this point. */
2978 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2979 || TREE_CODE (decl
) == TYPE_DECL
)
2981 /* Look up the name. */
2984 if (decl
== error_mark_node
)
2986 /* Name lookup failed. */
2989 || (!dependent_type_p (scope
)
2990 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2991 && IDENTIFIER_TYPENAME_P (id_expression
)
2992 && dependent_type_p (TREE_TYPE (id_expression
))))))
2994 /* If the qualifying type is non-dependent (and the name
2995 does not name a conversion operator to a dependent
2996 type), issue an error. */
2997 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2998 return error_mark_node
;
3002 /* It may be resolved via Koenig lookup. */
3003 *idk
= CP_ID_KIND_UNQUALIFIED
;
3004 return id_expression
;
3007 decl
= id_expression
;
3009 /* If DECL is a variable that would be out of scope under
3010 ANSI/ISO rules, but in scope in the ARM, name lookup
3011 will succeed. Issue a diagnostic here. */
3013 decl
= check_for_out_of_scope_variable (decl
);
3015 /* Remember that the name was used in the definition of
3016 the current class so that we can check later to see if
3017 the meaning would have been different after the class
3018 was entirely defined. */
3019 if (!scope
&& decl
!= error_mark_node
3020 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
3021 maybe_note_name_used_in_class (id_expression
, decl
);
3023 /* Disallow uses of local variables from containing functions, except
3024 within lambda-expressions. */
3025 if (!outer_var_p (decl
)
3026 /* It's not a use (3.2) if we're in an unevaluated context. */
3027 || cp_unevaluated_operand
)
3029 else if (TREE_STATIC (decl
))
3031 if (processing_template_decl
)
3032 /* For a use of an outer static var, return the identifier so
3033 that we'll look it up again in the instantiation. */
3034 return id_expression
;
3038 tree context
= DECL_CONTEXT (decl
);
3039 tree containing_function
= current_function_decl
;
3040 tree lambda_stack
= NULL_TREE
;
3041 tree lambda_expr
= NULL_TREE
;
3042 tree initializer
= convert_from_reference (decl
);
3044 /* Mark it as used now even if the use is ill-formed. */
3047 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3048 support for an approach in which a reference to a local
3049 [constant] automatic variable in a nested class or lambda body
3050 would enter the expression as an rvalue, which would reduce
3051 the complexity of the problem"
3053 FIXME update for final resolution of core issue 696. */
3054 if (decl_constant_var_p (decl
))
3056 if (processing_template_decl
)
3057 /* In a template, the constant value may not be in a usable
3058 form, so look it up again at instantiation time. */
3059 return id_expression
;
3061 return integral_constant_value (decl
);
3064 /* If we are in a lambda function, we can move out until we hit
3066 2. a non-lambda function, or
3067 3. a non-default capturing lambda function. */
3068 while (context
!= containing_function
3069 && LAMBDA_FUNCTION_P (containing_function
))
3071 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
3072 (DECL_CONTEXT (containing_function
));
3074 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3078 lambda_stack
= tree_cons (NULL_TREE
,
3083 = decl_function_context (containing_function
);
3086 if (context
== containing_function
)
3088 decl
= add_default_capture (lambda_stack
,
3089 /*id=*/DECL_NAME (decl
),
3092 else if (lambda_expr
)
3094 error ("%qD is not captured", decl
);
3095 return error_mark_node
;
3099 error (TREE_CODE (decl
) == VAR_DECL
3100 ? G_("use of local variable with automatic storage from containing function")
3101 : G_("use of parameter from containing function"));
3102 error (" %q+#D declared here", decl
);
3103 return error_mark_node
;
3107 /* Also disallow uses of function parameters outside the function
3108 body, except inside an unevaluated context (i.e. decltype). */
3109 if (TREE_CODE (decl
) == PARM_DECL
3110 && DECL_CONTEXT (decl
) == NULL_TREE
3111 && !cp_unevaluated_operand
)
3113 *error_msg
= "use of parameter outside function body";
3114 return error_mark_node
;
3118 /* If we didn't find anything, or what we found was a type,
3119 then this wasn't really an id-expression. */
3120 if (TREE_CODE (decl
) == TEMPLATE_DECL
3121 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3123 *error_msg
= "missing template arguments";
3124 return error_mark_node
;
3126 else if (TREE_CODE (decl
) == TYPE_DECL
3127 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3129 *error_msg
= "expected primary-expression";
3130 return error_mark_node
;
3133 /* If the name resolved to a template parameter, there is no
3134 need to look it up again later. */
3135 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3136 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3140 *idk
= CP_ID_KIND_NONE
;
3141 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3142 decl
= TEMPLATE_PARM_DECL (decl
);
3143 r
= convert_from_reference (DECL_INITIAL (decl
));
3145 if (integral_constant_expression_p
3146 && !dependent_type_p (TREE_TYPE (decl
))
3147 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3149 if (!allow_non_integral_constant_expression_p
)
3150 error ("template parameter %qD of type %qT is not allowed in "
3151 "an integral constant expression because it is not of "
3152 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3153 *non_integral_constant_expression_p
= true;
3161 /* If the declaration was explicitly qualified indicate
3162 that. The semantics of `A::f(3)' are different than
3163 `f(3)' if `f' is virtual. */
3165 ? CP_ID_KIND_QUALIFIED
3166 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3167 ? CP_ID_KIND_TEMPLATE_ID
3168 : CP_ID_KIND_UNQUALIFIED
));
3173 An id-expression is type-dependent if it contains an
3174 identifier that was declared with a dependent type.
3176 The standard is not very specific about an id-expression that
3177 names a set of overloaded functions. What if some of them
3178 have dependent types and some of them do not? Presumably,
3179 such a name should be treated as a dependent name. */
3180 /* Assume the name is not dependent. */
3181 dependent_p
= false;
3182 if (!processing_template_decl
)
3183 /* No names are dependent outside a template. */
3185 else if (TREE_CODE (decl
) == CONST_DECL
)
3186 /* We don't want to treat enumerators as dependent. */
3188 /* A template-id where the name of the template was not resolved
3189 is definitely dependent. */
3190 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3191 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3192 == IDENTIFIER_NODE
))
3194 /* For anything except an overloaded function, just check its
3196 else if (!is_overloaded_fn (decl
))
3198 = dependent_type_p (TREE_TYPE (decl
));
3199 /* For a set of overloaded functions, check each of the
3205 if (BASELINK_P (fns
))
3206 fns
= BASELINK_FUNCTIONS (fns
);
3208 /* For a template-id, check to see if the template
3209 arguments are dependent. */
3210 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3212 tree args
= TREE_OPERAND (fns
, 1);
3213 dependent_p
= any_dependent_template_arguments_p (args
);
3214 /* The functions are those referred to by the
3216 fns
= TREE_OPERAND (fns
, 0);
3219 /* If there are no dependent template arguments, go through
3220 the overloaded functions. */
3221 while (fns
&& !dependent_p
)
3223 tree fn
= OVL_CURRENT (fns
);
3225 /* Member functions of dependent classes are
3227 if (TREE_CODE (fn
) == FUNCTION_DECL
3228 && type_dependent_expression_p (fn
))
3230 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3231 && dependent_template_p (fn
))
3234 fns
= OVL_NEXT (fns
);
3238 /* If the name was dependent on a template parameter, we will
3239 resolve the name at instantiation time. */
3242 /* Create a SCOPE_REF for qualified names, if the scope is
3248 if (address_p
&& done
)
3249 decl
= finish_qualified_id_expr (scope
, decl
,
3253 tf_warning_or_error
);
3256 tree type
= NULL_TREE
;
3257 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3258 type
= TREE_TYPE (decl
);
3259 decl
= build_qualified_name (type
,
3265 if (TREE_TYPE (decl
))
3266 decl
= convert_from_reference (decl
);
3269 /* A TEMPLATE_ID already contains all the information we
3271 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3272 return id_expression
;
3273 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3274 /* If we found a variable, then name lookup during the
3275 instantiation will always resolve to the same VAR_DECL
3276 (or an instantiation thereof). */
3277 if (TREE_CODE (decl
) == VAR_DECL
3278 || TREE_CODE (decl
) == PARM_DECL
)
3281 return convert_from_reference (decl
);
3283 /* The same is true for FIELD_DECL, but we also need to
3284 make sure that the syntax is correct. */
3285 else if (TREE_CODE (decl
) == FIELD_DECL
)
3287 /* Since SCOPE is NULL here, this is an unqualified name.
3288 Access checking has been performed during name lookup
3289 already. Turn off checking to avoid duplicate errors. */
3290 push_deferring_access_checks (dk_no_check
);
3291 decl
= finish_non_static_data_member
3293 /*qualifying_scope=*/NULL_TREE
);
3294 pop_deferring_access_checks ();
3297 return id_expression
;
3300 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3302 error ("use of namespace %qD as expression", decl
);
3303 return error_mark_node
;
3305 else if (DECL_CLASS_TEMPLATE_P (decl
))
3307 error ("use of class template %qT as expression", decl
);
3308 return error_mark_node
;
3310 else if (TREE_CODE (decl
) == TREE_LIST
)
3312 /* Ambiguous reference to base members. */
3313 error ("request for member %qD is ambiguous in "
3314 "multiple inheritance lattice", id_expression
);
3315 print_candidates (decl
);
3316 return error_mark_node
;
3319 /* Mark variable-like entities as used. Functions are similarly
3320 marked either below or after overload resolution. */
3321 if ((TREE_CODE (decl
) == VAR_DECL
3322 || TREE_CODE (decl
) == PARM_DECL
3323 || TREE_CODE (decl
) == CONST_DECL
3324 || TREE_CODE (decl
) == RESULT_DECL
)
3325 && !mark_used (decl
))
3326 return error_mark_node
;
3328 /* Only certain kinds of names are allowed in constant
3329 expression. Template parameters have already
3330 been handled above. */
3331 if (! error_operand_p (decl
)
3332 && integral_constant_expression_p
3333 && ! decl_constant_var_p (decl
)
3334 && TREE_CODE (decl
) != CONST_DECL
3335 && ! builtin_valid_in_constant_expr_p (decl
))
3337 if (!allow_non_integral_constant_expression_p
)
3339 error ("%qD cannot appear in a constant-expression", decl
);
3340 return error_mark_node
;
3342 *non_integral_constant_expression_p
= true;
3346 if (TREE_CODE (decl
) == VAR_DECL
3347 && !cp_unevaluated_operand
3348 && !processing_template_decl
3349 && DECL_THREAD_LOCAL_P (decl
)
3350 && (wrap
= get_tls_wrapper_fn (decl
)))
3352 /* Replace an evaluated use of the thread_local variable with
3353 a call to its wrapper. */
3354 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3358 decl
= (adjust_result_of_qualified_name_lookup
3359 (decl
, scope
, current_nonlambda_class_type()));
3361 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3365 decl
= finish_qualified_id_expr (scope
,
3371 tf_warning_or_error
);
3373 decl
= convert_from_reference (decl
);
3375 else if (TREE_CODE (decl
) == FIELD_DECL
)
3377 /* Since SCOPE is NULL here, this is an unqualified name.
3378 Access checking has been performed during name lookup
3379 already. Turn off checking to avoid duplicate errors. */
3380 push_deferring_access_checks (dk_no_check
);
3381 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3382 /*qualifying_scope=*/NULL_TREE
);
3383 pop_deferring_access_checks ();
3385 else if (is_overloaded_fn (decl
))
3389 first_fn
= get_first_fn (decl
);
3390 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3391 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3393 if (!really_overloaded_fn (decl
)
3394 && !mark_used (first_fn
))
3395 return error_mark_node
;
3398 && TREE_CODE (first_fn
) == FUNCTION_DECL
3399 && DECL_FUNCTION_MEMBER_P (first_fn
)
3400 && !shared_member_p (decl
))
3402 /* A set of member functions. */
3403 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3404 return finish_class_member_access_expr (decl
, id_expression
,
3405 /*template_p=*/false,
3406 tf_warning_or_error
);
3409 decl
= baselink_for_fns (decl
);
3413 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3414 && DECL_CLASS_SCOPE_P (decl
))
3416 tree context
= context_for_name_lookup (decl
);
3417 if (context
!= current_class_type
)
3419 tree path
= currently_open_derived_class (context
);
3420 perform_or_defer_access_check (TYPE_BINFO (path
),
3422 tf_warning_or_error
);
3426 decl
= convert_from_reference (decl
);
3430 if (TREE_DEPRECATED (decl
))
3431 warn_deprecated_use (decl
, NULL_TREE
);
3436 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3437 use as a type-specifier. */
3440 finish_typeof (tree expr
)
3444 if (type_dependent_expression_p (expr
))
3446 type
= cxx_make_type (TYPEOF_TYPE
);
3447 TYPEOF_TYPE_EXPR (type
) = expr
;
3448 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3453 expr
= mark_type_use (expr
);
3455 type
= unlowered_expr_type (expr
);
3457 if (!type
|| type
== unknown_type_node
)
3459 error ("type of %qE is unknown", expr
);
3460 return error_mark_node
;
3466 /* Implement the __underlying_type keyword: Return the underlying
3467 type of TYPE, suitable for use as a type-specifier. */
3470 finish_underlying_type (tree type
)
3472 tree underlying_type
;
3474 if (processing_template_decl
)
3476 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3477 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3478 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3480 return underlying_type
;
3483 complete_type (type
);
3485 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3487 error ("%qT is not an enumeration type", type
);
3488 return error_mark_node
;
3491 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3493 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3494 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3495 See finish_enum_value_list for details. */
3496 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3498 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3499 TYPE_UNSIGNED (underlying_type
));
3501 return underlying_type
;
3504 /* Implement the __direct_bases keyword: Return the direct base classes
3508 calculate_direct_bases (tree type
)
3510 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3511 tree bases_vec
= NULL_TREE
;
3512 vec
<tree
, va_gc
> *base_binfos
;
3516 complete_type (type
);
3518 if (!NON_UNION_CLASS_TYPE_P (type
))
3519 return make_tree_vec (0);
3521 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3523 /* Virtual bases are initialized first */
3524 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3526 if (BINFO_VIRTUAL_P (binfo
))
3528 vec_safe_push (vector
, binfo
);
3532 /* Now non-virtuals */
3533 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3535 if (!BINFO_VIRTUAL_P (binfo
))
3537 vec_safe_push (vector
, binfo
);
3542 bases_vec
= make_tree_vec (vector
->length ());
3544 for (i
= 0; i
< vector
->length (); ++i
)
3546 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3551 /* Implement the __bases keyword: Return the base classes
3554 /* Find morally non-virtual base classes by walking binfo hierarchy */
3555 /* Virtual base classes are handled separately in finish_bases */
3558 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3560 /* Don't walk bases of virtual bases */
3561 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3565 dfs_calculate_bases_post (tree binfo
, void *data_
)
3567 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3568 if (!BINFO_VIRTUAL_P (binfo
))
3570 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3575 /* Calculates the morally non-virtual base classes of a class */
3576 static vec
<tree
, va_gc
> *
3577 calculate_bases_helper (tree type
)
3579 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3581 /* Now add non-virtual base classes in order of construction */
3582 dfs_walk_all (TYPE_BINFO (type
),
3583 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3588 calculate_bases (tree type
)
3590 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3591 tree bases_vec
= NULL_TREE
;
3593 vec
<tree
, va_gc
> *vbases
;
3594 vec
<tree
, va_gc
> *nonvbases
;
3597 complete_type (type
);
3599 if (!NON_UNION_CLASS_TYPE_P (type
))
3600 return make_tree_vec (0);
3602 /* First go through virtual base classes */
3603 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3604 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3606 vec
<tree
, va_gc
> *vbase_bases
;
3607 vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3608 vec_safe_splice (vector
, vbase_bases
);
3609 release_tree_vector (vbase_bases
);
3612 /* Now for the non-virtual bases */
3613 nonvbases
= calculate_bases_helper (type
);
3614 vec_safe_splice (vector
, nonvbases
);
3615 release_tree_vector (nonvbases
);
3617 /* Last element is entire class, so don't copy */
3618 bases_vec
= make_tree_vec (vector
->length () - 1);
3620 for (i
= 0; i
< vector
->length () - 1; ++i
)
3622 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3624 release_tree_vector (vector
);
3629 finish_bases (tree type
, bool direct
)
3631 tree bases
= NULL_TREE
;
3633 if (!processing_template_decl
)
3635 /* Parameter packs can only be used in templates */
3636 error ("Parameter pack __bases only valid in template declaration");
3637 return error_mark_node
;
3640 bases
= cxx_make_type (BASES
);
3641 BASES_TYPE (bases
) = type
;
3642 BASES_DIRECT (bases
) = direct
;
3643 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3648 /* Perform C++-specific checks for __builtin_offsetof before calling
3652 finish_offsetof (tree expr
)
3654 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3656 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3657 TREE_OPERAND (expr
, 2));
3658 return error_mark_node
;
3660 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3661 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3662 || TREE_TYPE (expr
) == unknown_type_node
)
3664 if (TREE_CODE (expr
) == COMPONENT_REF
3665 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3666 expr
= TREE_OPERAND (expr
, 1);
3667 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3668 return error_mark_node
;
3670 if (REFERENCE_REF_P (expr
))
3671 expr
= TREE_OPERAND (expr
, 0);
3672 if (TREE_CODE (expr
) == COMPONENT_REF
)
3674 tree object
= TREE_OPERAND (expr
, 0);
3675 if (!complete_type_or_else (TREE_TYPE (object
), object
))
3676 return error_mark_node
;
3678 return fold_offsetof (expr
);
3681 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3682 function is broken out from the above for the benefit of the tree-ssa
3686 simplify_aggr_init_expr (tree
*tp
)
3688 tree aggr_init_expr
= *tp
;
3690 /* Form an appropriate CALL_EXPR. */
3691 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3692 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3693 tree type
= TREE_TYPE (slot
);
3696 enum style_t
{ ctor
, arg
, pcc
} style
;
3698 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3700 #ifdef PCC_STATIC_STRUCT_RETURN
3706 gcc_assert (TREE_ADDRESSABLE (type
));
3710 call_expr
= build_call_array_loc (input_location
,
3711 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3713 aggr_init_expr_nargs (aggr_init_expr
),
3714 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3715 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3719 /* Replace the first argument to the ctor with the address of the
3721 cxx_mark_addressable (slot
);
3722 CALL_EXPR_ARG (call_expr
, 0) =
3723 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3725 else if (style
== arg
)
3727 /* Just mark it addressable here, and leave the rest to
3728 expand_call{,_inline}. */
3729 cxx_mark_addressable (slot
);
3730 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3731 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3733 else if (style
== pcc
)
3735 /* If we're using the non-reentrant PCC calling convention, then we
3736 need to copy the returned value out of the static buffer into the
3738 push_deferring_access_checks (dk_no_check
);
3739 call_expr
= build_aggr_init (slot
, call_expr
,
3740 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3741 tf_warning_or_error
);
3742 pop_deferring_access_checks ();
3743 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3746 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3748 tree init
= build_zero_init (type
, NULL_TREE
,
3749 /*static_storage_p=*/false);
3750 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3751 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3758 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3761 emit_associated_thunks (tree fn
)
3763 /* When we use vcall offsets, we emit thunks with the virtual
3764 functions to which they thunk. The whole point of vcall offsets
3765 is so that you can know statically the entire set of thunks that
3766 will ever be needed for a given virtual function, thereby
3767 enabling you to output all the thunks with the function itself. */
3768 if (DECL_VIRTUAL_P (fn
)
3769 /* Do not emit thunks for extern template instantiations. */
3770 && ! DECL_REALLY_EXTERN (fn
))
3774 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3776 if (!THUNK_ALIAS (thunk
))
3778 use_thunk (thunk
, /*emit_p=*/1);
3779 if (DECL_RESULT_THUNK_P (thunk
))
3783 for (probe
= DECL_THUNKS (thunk
);
3784 probe
; probe
= DECL_CHAIN (probe
))
3785 use_thunk (probe
, /*emit_p=*/1);
3789 gcc_assert (!DECL_THUNKS (thunk
));
3794 /* Returns true iff FUN is an instantiation of a constexpr function
3798 is_instantiation_of_constexpr (tree fun
)
3800 return (DECL_TEMPLOID_INSTANTIATION (fun
)
3801 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3802 (DECL_TI_TEMPLATE (fun
))));
3805 /* Generate RTL for FN. */
3808 expand_or_defer_fn_1 (tree fn
)
3810 /* When the parser calls us after finishing the body of a template
3811 function, we don't really want to expand the body. */
3812 if (processing_template_decl
)
3814 /* Normally, collection only occurs in rest_of_compilation. So,
3815 if we don't collect here, we never collect junk generated
3816 during the processing of templates until we hit a
3817 non-template function. It's not safe to do this inside a
3818 nested class, though, as the parser may have local state that
3819 is not a GC root. */
3820 if (!function_depth
)
3825 gcc_assert (DECL_SAVED_TREE (fn
));
3827 /* If this is a constructor or destructor body, we have to clone
3829 if (maybe_clone_body (fn
))
3831 /* We don't want to process FN again, so pretend we've written
3832 it out, even though we haven't. */
3833 TREE_ASM_WRITTEN (fn
) = 1;
3834 /* If this is an instantiation of a constexpr function, keep
3835 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3836 if (!is_instantiation_of_constexpr (fn
))
3837 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3841 /* We make a decision about linkage for these functions at the end
3842 of the compilation. Until that point, we do not want the back
3843 end to output them -- but we do want it to see the bodies of
3844 these functions so that it can inline them as appropriate. */
3845 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3847 if (DECL_INTERFACE_KNOWN (fn
))
3848 /* We've already made a decision as to how this function will
3852 DECL_EXTERNAL (fn
) = 1;
3853 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3854 note_vague_linkage_fn (fn
);
3855 /* A non-template inline function with external linkage will
3856 always be COMDAT. As we must eventually determine the
3857 linkage of all functions, and as that causes writes to
3858 the data mapped in from the PCH file, it's advantageous
3859 to mark the functions at this point. */
3860 if (!DECL_IMPLICIT_INSTANTIATION (fn
) || DECL_DEFAULTED_FN (fn
))
3862 /* This function must have external linkage, as
3863 otherwise DECL_INTERFACE_KNOWN would have been
3865 gcc_assert (TREE_PUBLIC (fn
));
3866 comdat_linkage (fn
);
3867 DECL_INTERFACE_KNOWN (fn
) = 1;
3871 import_export_decl (fn
);
3873 /* If the user wants us to keep all inline functions, then mark
3874 this function as needed so that finish_file will make sure to
3875 output it later. Similarly, all dllexport'd functions must
3876 be emitted; there may be callers in other DLLs. */
3877 if ((flag_keep_inline_functions
3878 && DECL_DECLARED_INLINE_P (fn
)
3879 && !DECL_REALLY_EXTERN (fn
))
3880 || (flag_keep_inline_dllexport
3881 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3884 DECL_EXTERNAL (fn
) = 0;
3888 /* There's no reason to do any of the work here if we're only doing
3889 semantic analysis; this code just generates RTL. */
3890 if (flag_syntax_only
)
3897 expand_or_defer_fn (tree fn
)
3899 if (expand_or_defer_fn_1 (fn
))
3903 /* Expand or defer, at the whim of the compilation unit manager. */
3904 cgraph_finalize_function (fn
, function_depth
> 1);
3905 emit_associated_thunks (fn
);
3915 hash_table
<pointer_hash
<tree_node
> > visited
;
3918 /* Helper function for walk_tree, used by finalize_nrv below. */
3921 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3923 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3926 /* No need to walk into types. There wouldn't be any need to walk into
3927 non-statements, except that we have to consider STMT_EXPRs. */
3930 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3931 but differs from using NULL_TREE in that it indicates that we care
3932 about the value of the RESULT_DECL. */
3933 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3934 TREE_OPERAND (*tp
, 0) = dp
->result
;
3935 /* Change all cleanups for the NRV to only run when an exception is
3937 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3938 && CLEANUP_DECL (*tp
) == dp
->var
)
3939 CLEANUP_EH_ONLY (*tp
) = 1;
3940 /* Replace the DECL_EXPR for the NRV with an initialization of the
3941 RESULT_DECL, if needed. */
3942 else if (TREE_CODE (*tp
) == DECL_EXPR
3943 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3946 if (DECL_INITIAL (dp
->var
)
3947 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3948 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3949 DECL_INITIAL (dp
->var
));
3951 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3952 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3953 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3956 /* And replace all uses of the NRV with the RESULT_DECL. */
3957 else if (*tp
== dp
->var
)
3960 /* Avoid walking into the same tree more than once. Unfortunately, we
3961 can't just use walk_tree_without duplicates because it would only call
3962 us for the first occurrence of dp->var in the function body. */
3963 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
3969 /* Keep iterating. */
3973 /* Called from finish_function to implement the named return value
3974 optimization by overriding all the RETURN_EXPRs and pertinent
3975 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3976 RESULT_DECL for the function. */
3979 finalize_nrv (tree
*tp
, tree var
, tree result
)
3981 struct nrv_data data
;
3983 /* Copy name from VAR to RESULT. */
3984 DECL_NAME (result
) = DECL_NAME (var
);
3985 /* Don't forget that we take its address. */
3986 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3987 /* Finally set DECL_VALUE_EXPR to avoid assigning
3988 a stack slot at -O0 for the original var and debug info
3989 uses RESULT location for VAR. */
3990 SET_DECL_VALUE_EXPR (var
, result
);
3991 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3994 data
.result
= result
;
3995 data
.visited
.create (37);
3996 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3997 data
.visited
.dispose ();
4000 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4003 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4004 bool need_copy_ctor
, bool need_copy_assignment
)
4006 int save_errorcount
= errorcount
;
4009 /* Always allocate 3 elements for simplicity. These are the
4010 function decls for the ctor, dtor, and assignment op.
4011 This layout is known to the three lang hooks,
4012 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4013 and cxx_omp_clause_assign_op. */
4014 info
= make_tree_vec (3);
4015 CP_OMP_CLAUSE_INFO (c
) = info
;
4017 if (need_default_ctor
|| need_copy_ctor
)
4019 if (need_default_ctor
)
4020 t
= get_default_ctor (type
);
4022 t
= get_copy_ctor (type
, tf_warning_or_error
);
4024 if (t
&& !trivial_fn_p (t
))
4025 TREE_VEC_ELT (info
, 0) = t
;
4028 if ((need_default_ctor
|| need_copy_ctor
)
4029 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4030 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4032 if (need_copy_assignment
)
4034 t
= get_copy_assign (type
);
4036 if (t
&& !trivial_fn_p (t
))
4037 TREE_VEC_ELT (info
, 2) = t
;
4040 return errorcount
!= save_errorcount
;
4043 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
4044 Remove any elements from the list that are invalid. */
4047 finish_omp_clauses (tree clauses
)
4049 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
4050 tree c
, t
, *pc
= &clauses
;
4053 bitmap_obstack_initialize (NULL
);
4054 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
4055 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
4056 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
4058 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
4060 bool remove
= false;
4062 switch (OMP_CLAUSE_CODE (c
))
4064 case OMP_CLAUSE_SHARED
:
4066 goto check_dup_generic
;
4067 case OMP_CLAUSE_PRIVATE
:
4069 goto check_dup_generic
;
4070 case OMP_CLAUSE_REDUCTION
:
4072 goto check_dup_generic
;
4073 case OMP_CLAUSE_COPYPRIVATE
:
4074 name
= "copyprivate";
4075 goto check_dup_generic
;
4076 case OMP_CLAUSE_COPYIN
:
4078 goto check_dup_generic
;
4080 t
= OMP_CLAUSE_DECL (c
);
4081 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4083 if (processing_template_decl
)
4086 error ("%qD is not a variable in clause %qs", t
, name
);
4088 error ("%qE is not a variable in clause %qs", t
, name
);
4091 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4092 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
4093 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4095 error ("%qD appears more than once in data clauses", t
);
4099 bitmap_set_bit (&generic_head
, DECL_UID (t
));
4102 case OMP_CLAUSE_FIRSTPRIVATE
:
4103 t
= OMP_CLAUSE_DECL (c
);
4104 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4106 if (processing_template_decl
)
4109 error ("%qD is not a variable in clause %<firstprivate%>", t
);
4111 error ("%qE is not a variable in clause %<firstprivate%>", t
);
4114 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4115 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4117 error ("%qD appears more than once in data clauses", t
);
4121 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
4124 case OMP_CLAUSE_LASTPRIVATE
:
4125 t
= OMP_CLAUSE_DECL (c
);
4126 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4128 if (processing_template_decl
)
4131 error ("%qD is not a variable in clause %<lastprivate%>", t
);
4133 error ("%qE is not a variable in clause %<lastprivate%>", t
);
4136 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4137 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4139 error ("%qD appears more than once in data clauses", t
);
4143 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
4147 t
= OMP_CLAUSE_IF_EXPR (c
);
4148 t
= maybe_convert_cond (t
);
4149 if (t
== error_mark_node
)
4151 else if (!processing_template_decl
)
4152 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4153 OMP_CLAUSE_IF_EXPR (c
) = t
;
4156 case OMP_CLAUSE_FINAL
:
4157 t
= OMP_CLAUSE_FINAL_EXPR (c
);
4158 t
= maybe_convert_cond (t
);
4159 if (t
== error_mark_node
)
4161 else if (!processing_template_decl
)
4162 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4163 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
4166 case OMP_CLAUSE_NUM_THREADS
:
4167 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
4168 if (t
== error_mark_node
)
4170 else if (!type_dependent_expression_p (t
)
4171 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4173 error ("num_threads expression must be integral");
4178 t
= mark_rvalue_use (t
);
4179 if (!processing_template_decl
)
4180 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4181 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
4185 case OMP_CLAUSE_SCHEDULE
:
4186 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
4189 else if (t
== error_mark_node
)
4191 else if (!type_dependent_expression_p (t
)
4192 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4194 error ("schedule chunk size expression must be integral");
4199 t
= mark_rvalue_use (t
);
4200 if (!processing_template_decl
)
4201 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4202 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
4206 case OMP_CLAUSE_NOWAIT
:
4207 case OMP_CLAUSE_ORDERED
:
4208 case OMP_CLAUSE_DEFAULT
:
4209 case OMP_CLAUSE_UNTIED
:
4210 case OMP_CLAUSE_COLLAPSE
:
4211 case OMP_CLAUSE_MERGEABLE
:
4219 *pc
= OMP_CLAUSE_CHAIN (c
);
4221 pc
= &OMP_CLAUSE_CHAIN (c
);
4224 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
4226 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
4227 bool remove
= false;
4228 bool need_complete_non_reference
= false;
4229 bool need_default_ctor
= false;
4230 bool need_copy_ctor
= false;
4231 bool need_copy_assignment
= false;
4232 bool need_implicitly_determined
= false;
4233 tree type
, inner_type
;
4237 case OMP_CLAUSE_SHARED
:
4239 need_implicitly_determined
= true;
4241 case OMP_CLAUSE_PRIVATE
:
4243 need_complete_non_reference
= true;
4244 need_default_ctor
= true;
4245 need_implicitly_determined
= true;
4247 case OMP_CLAUSE_FIRSTPRIVATE
:
4248 name
= "firstprivate";
4249 need_complete_non_reference
= true;
4250 need_copy_ctor
= true;
4251 need_implicitly_determined
= true;
4253 case OMP_CLAUSE_LASTPRIVATE
:
4254 name
= "lastprivate";
4255 need_complete_non_reference
= true;
4256 need_copy_assignment
= true;
4257 need_implicitly_determined
= true;
4259 case OMP_CLAUSE_REDUCTION
:
4261 need_implicitly_determined
= true;
4263 case OMP_CLAUSE_COPYPRIVATE
:
4264 name
= "copyprivate";
4265 need_copy_assignment
= true;
4267 case OMP_CLAUSE_COPYIN
:
4269 need_copy_assignment
= true;
4272 pc
= &OMP_CLAUSE_CHAIN (c
);
4276 t
= OMP_CLAUSE_DECL (c
);
4277 if (processing_template_decl
4278 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4280 pc
= &OMP_CLAUSE_CHAIN (c
);
4286 case OMP_CLAUSE_LASTPRIVATE
:
4287 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4288 need_default_ctor
= true;
4291 case OMP_CLAUSE_REDUCTION
:
4292 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4293 || POINTER_TYPE_P (TREE_TYPE (t
)))
4295 error ("%qE has invalid type for %<reduction%>", t
);
4298 else if (FLOAT_TYPE_P (TREE_TYPE (t
))
4299 || TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
4301 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
4310 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
4311 r_code
= ERROR_MARK
;
4317 r_code
= ERROR_MARK
;
4319 case TRUTH_ANDIF_EXPR
:
4320 case TRUTH_ORIF_EXPR
:
4321 if (FLOAT_TYPE_P (TREE_TYPE (t
)))
4322 r_code
= ERROR_MARK
;
4325 if (r_code
== ERROR_MARK
)
4327 error ("%qE has invalid type for %<reduction(%s)%>",
4328 t
, operator_name_info
[r_code
].name
);
4334 case OMP_CLAUSE_COPYIN
:
4335 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
4337 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
4346 if (need_complete_non_reference
|| need_copy_assignment
)
4348 t
= require_complete_type (t
);
4349 if (t
== error_mark_node
)
4351 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4352 && need_complete_non_reference
)
4354 error ("%qE has reference type for %qs", t
, name
);
4358 if (need_implicitly_determined
)
4360 const char *share_name
= NULL
;
4362 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4363 share_name
= "threadprivate";
4364 else switch (cxx_omp_predetermined_sharing (t
))
4366 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
4368 case OMP_CLAUSE_DEFAULT_SHARED
:
4369 /* const vars may be specified in firstprivate clause. */
4370 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
4371 && cxx_omp_const_qual_no_mutable (t
))
4373 share_name
= "shared";
4375 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4376 share_name
= "private";
4383 error ("%qE is predetermined %qs for %qs",
4384 t
, share_name
, name
);
4389 /* We're interested in the base element, not arrays. */
4390 inner_type
= type
= TREE_TYPE (t
);
4391 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
4392 inner_type
= TREE_TYPE (inner_type
);
4394 /* Check for special function availability by building a call to one.
4395 Save the results, because later we won't be in the right context
4396 for making these queries. */
4397 if (CLASS_TYPE_P (inner_type
)
4398 && COMPLETE_TYPE_P (inner_type
)
4399 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
4400 && !type_dependent_expression_p (t
)
4401 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
4402 need_copy_ctor
, need_copy_assignment
))
4406 *pc
= OMP_CLAUSE_CHAIN (c
);
4408 pc
= &OMP_CLAUSE_CHAIN (c
);
4411 bitmap_obstack_release (NULL
);
4415 /* For all variables in the tree_list VARS, mark them as thread local. */
4418 finish_omp_threadprivate (tree vars
)
4422 /* Mark every variable in VARS to be assigned thread local storage. */
4423 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4425 tree v
= TREE_PURPOSE (t
);
4427 if (error_operand_p (v
))
4429 else if (TREE_CODE (v
) != VAR_DECL
)
4430 error ("%<threadprivate%> %qD is not file, namespace "
4431 "or block scope variable", v
);
4432 /* If V had already been marked threadprivate, it doesn't matter
4433 whether it had been used prior to this point. */
4434 else if (TREE_USED (v
)
4435 && (DECL_LANG_SPECIFIC (v
) == NULL
4436 || !CP_DECL_THREADPRIVATE_P (v
)))
4437 error ("%qE declared %<threadprivate%> after first use", v
);
4438 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4439 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4440 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
4441 error ("%<threadprivate%> %qE has incomplete type", v
);
4442 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4443 && CP_DECL_CONTEXT (v
) != current_class_type
)
4444 error ("%<threadprivate%> %qE directive not "
4445 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4448 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4449 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4451 retrofit_lang_decl (v
);
4453 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4454 after the allocation of the lang_decl structure. */
4455 if (DECL_DISCRIMINATOR_P (v
))
4456 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4459 if (! DECL_THREAD_LOCAL_P (v
))
4461 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4462 /* If rtl has been already set for this var, call
4463 make_decl_rtl once again, so that encode_section_info
4464 has a chance to look at the new decl flags. */
4465 if (DECL_RTL_SET_P (v
))
4468 CP_DECL_THREADPRIVATE_P (v
) = 1;
4473 /* Build an OpenMP structured block. */
4476 begin_omp_structured_block (void)
4478 return do_pushlevel (sk_omp
);
4482 finish_omp_structured_block (tree block
)
4484 return do_poplevel (block
);
4487 /* Similarly, except force the retention of the BLOCK. */
4490 begin_omp_parallel (void)
4492 keep_next_level (true);
4493 return begin_omp_structured_block ();
4497 finish_omp_parallel (tree clauses
, tree body
)
4501 body
= finish_omp_structured_block (body
);
4503 stmt
= make_node (OMP_PARALLEL
);
4504 TREE_TYPE (stmt
) = void_type_node
;
4505 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4506 OMP_PARALLEL_BODY (stmt
) = body
;
4508 return add_stmt (stmt
);
4512 begin_omp_task (void)
4514 keep_next_level (true);
4515 return begin_omp_structured_block ();
4519 finish_omp_task (tree clauses
, tree body
)
4523 body
= finish_omp_structured_block (body
);
4525 stmt
= make_node (OMP_TASK
);
4526 TREE_TYPE (stmt
) = void_type_node
;
4527 OMP_TASK_CLAUSES (stmt
) = clauses
;
4528 OMP_TASK_BODY (stmt
) = body
;
4530 return add_stmt (stmt
);
4533 /* Helper function for finish_omp_for. Convert Ith random access iterator
4534 into integral iterator. Return FALSE if successful. */
4537 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4538 tree condv
, tree incrv
, tree
*body
,
4539 tree
*pre_body
, tree clauses
)
4541 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4542 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4543 tree decl
= TREE_VEC_ELT (declv
, i
);
4544 tree init
= TREE_VEC_ELT (initv
, i
);
4545 tree cond
= TREE_VEC_ELT (condv
, i
);
4546 tree incr
= TREE_VEC_ELT (incrv
, i
);
4548 location_t elocus
= locus
;
4550 if (init
&& EXPR_HAS_LOCATION (init
))
4551 elocus
= EXPR_LOCATION (init
);
4553 switch (TREE_CODE (cond
))
4559 if (TREE_OPERAND (cond
, 1) == iter
)
4560 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4561 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4562 if (TREE_OPERAND (cond
, 0) != iter
)
4563 cond
= error_mark_node
;
4566 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
4569 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4570 NULL
, tf_warning_or_error
);
4571 if (error_operand_p (tem
))
4576 cond
= error_mark_node
;
4579 if (cond
== error_mark_node
)
4581 error_at (elocus
, "invalid controlling predicate");
4584 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4585 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4586 tf_warning_or_error
);
4587 if (error_operand_p (diff
))
4589 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4591 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4592 TREE_OPERAND (cond
, 1), iter
);
4596 switch (TREE_CODE (incr
))
4598 case PREINCREMENT_EXPR
:
4599 case PREDECREMENT_EXPR
:
4600 case POSTINCREMENT_EXPR
:
4601 case POSTDECREMENT_EXPR
:
4602 if (TREE_OPERAND (incr
, 0) != iter
)
4604 incr
= error_mark_node
;
4607 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
4608 TREE_CODE (incr
), iter
,
4609 tf_warning_or_error
);
4610 if (error_operand_p (iter_incr
))
4612 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4613 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4614 incr
= integer_one_node
;
4616 incr
= integer_minus_one_node
;
4619 if (TREE_OPERAND (incr
, 0) != iter
)
4620 incr
= error_mark_node
;
4621 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4622 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4624 tree rhs
= TREE_OPERAND (incr
, 1);
4625 if (TREE_OPERAND (rhs
, 0) == iter
)
4627 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4629 incr
= error_mark_node
;
4632 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
4633 iter
, TREE_CODE (rhs
),
4634 TREE_OPERAND (rhs
, 1),
4635 tf_warning_or_error
);
4636 if (error_operand_p (iter_incr
))
4638 incr
= TREE_OPERAND (rhs
, 1);
4639 incr
= cp_convert (TREE_TYPE (diff
), incr
,
4640 tf_warning_or_error
);
4641 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4643 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4644 incr
= fold_if_not_in_template (incr
);
4646 if (TREE_CODE (incr
) != INTEGER_CST
4647 && (TREE_CODE (incr
) != NOP_EXPR
4648 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4653 else if (TREE_OPERAND (rhs
, 1) == iter
)
4655 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4656 || TREE_CODE (rhs
) != PLUS_EXPR
)
4657 incr
= error_mark_node
;
4660 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
4662 TREE_OPERAND (rhs
, 0),
4665 tf_warning_or_error
);
4666 if (error_operand_p (iter_incr
))
4668 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
4671 tf_warning_or_error
);
4672 if (error_operand_p (iter_incr
))
4674 incr
= TREE_OPERAND (rhs
, 0);
4679 incr
= error_mark_node
;
4682 incr
= error_mark_node
;
4685 incr
= error_mark_node
;
4689 if (incr
== error_mark_node
)
4691 error_at (elocus
, "invalid increment expression");
4695 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
4696 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4697 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4698 && OMP_CLAUSE_DECL (c
) == iter
)
4701 decl
= create_temporary_var (TREE_TYPE (diff
));
4703 add_decl_expr (decl
);
4704 last
= create_temporary_var (TREE_TYPE (diff
));
4706 add_decl_expr (last
);
4707 if (c
&& iter_incr
== NULL
)
4709 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4710 pushdecl (incr_var
);
4711 add_decl_expr (incr_var
);
4713 gcc_assert (stmts_are_full_exprs_p ());
4715 orig_pre_body
= *pre_body
;
4716 *pre_body
= push_stmt_list ();
4718 add_stmt (orig_pre_body
);
4720 finish_expr_stmt (build_x_modify_expr (elocus
,
4721 iter
, NOP_EXPR
, init
,
4722 tf_warning_or_error
));
4723 init
= build_int_cst (TREE_TYPE (diff
), 0);
4724 if (c
&& iter_incr
== NULL
)
4726 finish_expr_stmt (build_x_modify_expr (elocus
,
4728 incr
, tf_warning_or_error
));
4730 iter_incr
= build_x_modify_expr (elocus
,
4731 iter
, PLUS_EXPR
, incr
,
4732 tf_warning_or_error
);
4734 finish_expr_stmt (build_x_modify_expr (elocus
,
4735 last
, NOP_EXPR
, init
,
4736 tf_warning_or_error
));
4737 *pre_body
= pop_stmt_list (*pre_body
);
4739 cond
= cp_build_binary_op (elocus
,
4740 TREE_CODE (cond
), decl
, diff
,
4741 tf_warning_or_error
);
4742 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4743 elocus
, incr
, NULL_TREE
);
4746 *body
= push_stmt_list ();
4747 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4748 iter_init
= build_x_modify_expr (elocus
,
4749 iter
, PLUS_EXPR
, iter_init
,
4750 tf_warning_or_error
);
4751 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4752 finish_expr_stmt (iter_init
);
4753 finish_expr_stmt (build_x_modify_expr (elocus
,
4754 last
, NOP_EXPR
, decl
,
4755 tf_warning_or_error
));
4756 add_stmt (orig_body
);
4757 *body
= pop_stmt_list (*body
);
4761 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4762 finish_expr_stmt (iter_incr
);
4763 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4764 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4767 TREE_VEC_ELT (declv
, i
) = decl
;
4768 TREE_VEC_ELT (initv
, i
) = init
;
4769 TREE_VEC_ELT (condv
, i
) = cond
;
4770 TREE_VEC_ELT (incrv
, i
) = incr
;
4775 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4776 are directly for their associated operands in the statement. DECL
4777 and INIT are a combo; if DECL is NULL then INIT ought to be a
4778 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4779 optional statements that need to go before the loop into its
4783 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4784 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4786 tree omp_for
= NULL
, orig_incr
= NULL
;
4787 tree decl
, init
, cond
, incr
;
4791 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4792 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4793 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4794 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4796 decl
= TREE_VEC_ELT (declv
, i
);
4797 init
= TREE_VEC_ELT (initv
, i
);
4798 cond
= TREE_VEC_ELT (condv
, i
);
4799 incr
= TREE_VEC_ELT (incrv
, i
);
4805 switch (TREE_CODE (init
))
4808 decl
= TREE_OPERAND (init
, 0);
4809 init
= TREE_OPERAND (init
, 1);
4812 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4814 decl
= TREE_OPERAND (init
, 0);
4815 init
= TREE_OPERAND (init
, 2);
4825 "expected iteration declaration or initialization");
4830 if (init
&& EXPR_HAS_LOCATION (init
))
4831 elocus
= EXPR_LOCATION (init
);
4835 error_at (elocus
, "missing controlling predicate");
4841 error_at (elocus
, "missing increment expression");
4845 TREE_VEC_ELT (declv
, i
) = decl
;
4846 TREE_VEC_ELT (initv
, i
) = init
;
4849 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4853 stmt
= make_node (OMP_FOR
);
4855 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4857 /* This is really just a place-holder. We'll be decomposing this
4858 again and going through the cp_build_modify_expr path below when
4859 we instantiate the thing. */
4860 TREE_VEC_ELT (initv
, i
)
4861 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4862 TREE_VEC_ELT (initv
, i
));
4865 TREE_TYPE (stmt
) = void_type_node
;
4866 OMP_FOR_INIT (stmt
) = initv
;
4867 OMP_FOR_COND (stmt
) = condv
;
4868 OMP_FOR_INCR (stmt
) = incrv
;
4869 OMP_FOR_BODY (stmt
) = body
;
4870 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4871 OMP_FOR_CLAUSES (stmt
) = clauses
;
4873 SET_EXPR_LOCATION (stmt
, locus
);
4874 return add_stmt (stmt
);
4877 if (processing_template_decl
)
4878 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4880 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4882 decl
= TREE_VEC_ELT (declv
, i
);
4883 init
= TREE_VEC_ELT (initv
, i
);
4884 cond
= TREE_VEC_ELT (condv
, i
);
4885 incr
= TREE_VEC_ELT (incrv
, i
);
4887 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4890 if (init
&& EXPR_HAS_LOCATION (init
))
4891 elocus
= EXPR_LOCATION (init
);
4895 error_at (elocus
, "expected iteration declaration or initialization");
4899 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4902 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4903 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4904 TREE_CODE (TREE_OPERAND (incr
, 1)),
4905 TREE_OPERAND (incr
, 2),
4906 tf_warning_or_error
);
4909 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4911 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4912 incrv
, &body
, &pre_body
, clauses
))
4917 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4918 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4920 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4924 if (!processing_template_decl
)
4926 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4927 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4930 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4932 && TREE_SIDE_EFFECTS (cond
)
4933 && COMPARISON_CLASS_P (cond
)
4934 && !processing_template_decl
)
4936 tree t
= TREE_OPERAND (cond
, 0);
4937 if (TREE_SIDE_EFFECTS (t
)
4939 && (TREE_CODE (t
) != NOP_EXPR
4940 || TREE_OPERAND (t
, 0) != decl
))
4941 TREE_OPERAND (cond
, 0)
4942 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4944 t
= TREE_OPERAND (cond
, 1);
4945 if (TREE_SIDE_EFFECTS (t
)
4947 && (TREE_CODE (t
) != NOP_EXPR
4948 || TREE_OPERAND (t
, 0) != decl
))
4949 TREE_OPERAND (cond
, 1)
4950 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4952 if (decl
== error_mark_node
|| init
== error_mark_node
)
4955 TREE_VEC_ELT (declv
, i
) = decl
;
4956 TREE_VEC_ELT (initv
, i
) = init
;
4957 TREE_VEC_ELT (condv
, i
) = cond
;
4958 TREE_VEC_ELT (incrv
, i
) = incr
;
4962 if (IS_EMPTY_STMT (pre_body
))
4965 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4968 if (omp_for
== NULL
)
4971 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4973 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4974 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4976 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4979 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4980 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4981 && !processing_template_decl
)
4983 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4984 if (TREE_SIDE_EFFECTS (t
)
4986 && (TREE_CODE (t
) != NOP_EXPR
4987 || TREE_OPERAND (t
, 0) != decl
))
4988 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4989 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4991 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4992 if (TREE_SIDE_EFFECTS (t
)
4994 && (TREE_CODE (t
) != NOP_EXPR
4995 || TREE_OPERAND (t
, 0) != decl
))
4996 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4997 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
5001 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
5003 if (omp_for
!= NULL
)
5004 OMP_FOR_CLAUSES (omp_for
) = clauses
;
5009 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
5010 tree rhs
, tree v
, tree lhs1
, tree rhs1
)
5025 dependent_p
= false;
5028 /* Even in a template, we can detect invalid uses of the atomic
5029 pragma if neither LHS nor RHS is type-dependent. */
5030 if (processing_template_decl
)
5032 dependent_p
= (type_dependent_expression_p (lhs
)
5033 || (rhs
&& type_dependent_expression_p (rhs
))
5034 || (v
&& type_dependent_expression_p (v
))
5035 || (lhs1
&& type_dependent_expression_p (lhs1
))
5036 || (rhs1
&& type_dependent_expression_p (rhs1
)));
5039 lhs
= build_non_dependent_expr (lhs
);
5041 rhs
= build_non_dependent_expr (rhs
);
5043 v
= build_non_dependent_expr (v
);
5045 lhs1
= build_non_dependent_expr (lhs1
);
5047 rhs1
= build_non_dependent_expr (rhs1
);
5052 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
5054 if (stmt
== error_mark_node
)
5057 if (processing_template_decl
)
5059 if (code
== OMP_ATOMIC_READ
)
5061 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
5062 OMP_ATOMIC_READ
, orig_lhs
);
5063 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
5067 if (opcode
== NOP_EXPR
)
5068 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
5070 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
5072 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
5073 COMPOUND_EXPR
, orig_rhs1
, stmt
);
5074 if (code
!= OMP_ATOMIC
)
5076 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
5077 code
, orig_lhs1
, stmt
);
5078 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
5081 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
5083 finish_expr_stmt (stmt
);
5087 finish_omp_barrier (void)
5089 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
5090 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5091 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5092 release_tree_vector (vec
);
5093 finish_expr_stmt (stmt
);
5097 finish_omp_flush (void)
5099 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
5100 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5101 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5102 release_tree_vector (vec
);
5103 finish_expr_stmt (stmt
);
5107 finish_omp_taskwait (void)
5109 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
5110 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5111 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5112 release_tree_vector (vec
);
5113 finish_expr_stmt (stmt
);
5117 finish_omp_taskyield (void)
5119 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
5120 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5121 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5122 release_tree_vector (vec
);
5123 finish_expr_stmt (stmt
);
5126 /* Begin a __transaction_atomic or __transaction_relaxed statement.
5127 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
5128 should create an extra compound stmt. */
5131 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
5136 *pcompound
= begin_compound_stmt (0);
5138 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
5140 /* Only add the statement to the function if support enabled. */
5144 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
5145 ? G_("%<__transaction_relaxed%> without "
5146 "transactional memory support enabled")
5147 : G_("%<__transaction_atomic%> without "
5148 "transactional memory support enabled")));
5150 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
5151 TREE_SIDE_EFFECTS (r
) = 1;
5155 /* End a __transaction_atomic or __transaction_relaxed statement.
5156 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
5157 and we should end the compound. If NOEX is non-NULL, we wrap the body in
5158 a MUST_NOT_THROW_EXPR with NOEX as condition. */
5161 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
5163 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
5164 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
5165 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
5166 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
5168 /* noexcept specifications are not allowed for function transactions. */
5169 gcc_assert (!(noex
&& compound_stmt
));
5172 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
5174 SET_EXPR_LOCATION (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
5175 TREE_SIDE_EFFECTS (body
) = 1;
5176 TRANSACTION_EXPR_BODY (stmt
) = body
;
5180 finish_compound_stmt (compound_stmt
);
5184 /* Build a __transaction_atomic or __transaction_relaxed expression. If
5185 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
5189 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
5194 expr
= build_must_not_throw_expr (expr
, noex
);
5195 SET_EXPR_LOCATION (expr
, loc
);
5196 TREE_SIDE_EFFECTS (expr
) = 1;
5198 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
5199 if (flags
& TM_STMT_ATTR_RELAXED
)
5200 TRANSACTION_EXPR_RELAXED (ret
) = 1;
5201 TREE_SIDE_EFFECTS (ret
) = 1;
5202 SET_EXPR_LOCATION (ret
, loc
);
5207 init_cp_semantics (void)
5211 /* Build a STATIC_ASSERT for a static assertion with the condition
5212 CONDITION and the message text MESSAGE. LOCATION is the location
5213 of the static assertion in the source code. When MEMBER_P, this
5214 static assertion is a member of a class. */
5216 finish_static_assert (tree condition
, tree message
, location_t location
,
5219 if (message
== NULL_TREE
5220 || message
== error_mark_node
5221 || condition
== NULL_TREE
5222 || condition
== error_mark_node
)
5225 if (check_for_bare_parameter_packs (condition
))
5226 condition
= error_mark_node
;
5228 if (type_dependent_expression_p (condition
)
5229 || value_dependent_expression_p (condition
))
5231 /* We're in a template; build a STATIC_ASSERT and put it in
5235 assertion
= make_node (STATIC_ASSERT
);
5236 STATIC_ASSERT_CONDITION (assertion
) = condition
;
5237 STATIC_ASSERT_MESSAGE (assertion
) = message
;
5238 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
5241 maybe_add_class_template_decl_list (current_class_type
,
5245 add_stmt (assertion
);
5250 /* Fold the expression and convert it to a boolean value. */
5251 condition
= fold_non_dependent_expr (condition
);
5252 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
5253 condition
= maybe_constant_value (condition
);
5255 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
5256 /* Do nothing; the condition is satisfied. */
5260 location_t saved_loc
= input_location
;
5262 input_location
= location
;
5263 if (TREE_CODE (condition
) == INTEGER_CST
5264 && integer_zerop (condition
))
5265 /* Report the error. */
5266 error ("static assertion failed: %s", TREE_STRING_POINTER (message
));
5267 else if (condition
&& condition
!= error_mark_node
)
5269 error ("non-constant condition for static assertion");
5270 cxx_constant_value (condition
);
5272 input_location
= saved_loc
;
5276 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5277 suitable for use as a type-specifier.
5279 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5280 id-expression or a class member access, FALSE when it was parsed as
5281 a full expression. */
5284 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
5285 tsubst_flags_t complain
)
5287 tree type
= NULL_TREE
;
5289 if (!expr
|| error_operand_p (expr
))
5290 return error_mark_node
;
5293 || TREE_CODE (expr
) == TYPE_DECL
5294 || (TREE_CODE (expr
) == BIT_NOT_EXPR
5295 && TYPE_P (TREE_OPERAND (expr
, 0))))
5297 if (complain
& tf_error
)
5298 error ("argument to decltype must be an expression");
5299 return error_mark_node
;
5302 /* Depending on the resolution of DR 1172, we may later need to distinguish
5303 instantiation-dependent but not type-dependent expressions so that, say,
5304 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
5305 if (instantiation_dependent_expression_p (expr
))
5307 type
= cxx_make_type (DECLTYPE_TYPE
);
5308 DECLTYPE_TYPE_EXPR (type
) = expr
;
5309 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
5310 = id_expression_or_member_access_p
;
5311 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5316 /* The type denoted by decltype(e) is defined as follows: */
5318 expr
= resolve_nondeduced_context (expr
);
5320 if (type_unknown_p (expr
))
5322 if (complain
& tf_error
)
5323 error ("decltype cannot resolve address of overloaded function");
5324 return error_mark_node
;
5327 if (invalid_nonstatic_memfn_p (expr
, complain
))
5328 return error_mark_node
;
5330 /* To get the size of a static data member declared as an array of
5331 unknown bound, we need to instantiate it. */
5332 if (TREE_CODE (expr
) == VAR_DECL
5333 && VAR_HAD_UNKNOWN_BOUND (expr
)
5334 && DECL_TEMPLATE_INSTANTIATION (expr
))
5335 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
5337 if (id_expression_or_member_access_p
)
5339 /* If e is an id-expression or a class member access (5.2.5
5340 [expr.ref]), decltype(e) is defined as the type of the entity
5341 named by e. If there is no such entity, or e names a set of
5342 overloaded functions, the program is ill-formed. */
5343 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
5344 expr
= lookup_name (expr
);
5346 if (TREE_CODE (expr
) == INDIRECT_REF
)
5347 /* This can happen when the expression is, e.g., "a.b". Just
5348 look at the underlying operand. */
5349 expr
= TREE_OPERAND (expr
, 0);
5351 if (TREE_CODE (expr
) == OFFSET_REF
5352 || TREE_CODE (expr
) == MEMBER_REF
5353 || TREE_CODE (expr
) == SCOPE_REF
)
5354 /* We're only interested in the field itself. If it is a
5355 BASELINK, we will need to see through it in the next
5357 expr
= TREE_OPERAND (expr
, 1);
5359 if (BASELINK_P (expr
))
5360 /* See through BASELINK nodes to the underlying function. */
5361 expr
= BASELINK_FUNCTIONS (expr
);
5363 switch (TREE_CODE (expr
))
5366 if (DECL_BIT_FIELD_TYPE (expr
))
5368 type
= DECL_BIT_FIELD_TYPE (expr
);
5371 /* Fall through for fields that aren't bitfields. */
5378 case TEMPLATE_PARM_INDEX
:
5379 expr
= mark_type_use (expr
);
5380 type
= TREE_TYPE (expr
);
5384 type
= error_mark_node
;
5389 mark_type_use (expr
);
5390 type
= is_bitfield_expr_with_lowered_type (expr
);
5392 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
5400 /* We can get here when the id-expression refers to an
5401 enumerator or non-type template parameter. */
5402 type
= TREE_TYPE (expr
);
5406 /* Handle instantiated template non-type arguments. */
5407 type
= TREE_TYPE (expr
);
5413 /* Within a lambda-expression:
5415 Every occurrence of decltype((x)) where x is a possibly
5416 parenthesized id-expression that names an entity of
5417 automatic storage duration is treated as if x were
5418 transformed into an access to a corresponding data member
5419 of the closure type that would have been declared if x
5420 were a use of the denoted entity. */
5421 if (outer_automatic_var_p (expr
)
5422 && current_function_decl
5423 && LAMBDA_FUNCTION_P (current_function_decl
))
5424 type
= capture_decltype (expr
);
5425 else if (error_operand_p (expr
))
5426 type
= error_mark_node
;
5427 else if (expr
== current_class_ptr
)
5428 /* If the expression is just "this", we want the
5429 cv-unqualified pointer for the "this" type. */
5430 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
5433 /* Otherwise, where T is the type of e, if e is an lvalue,
5434 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5435 cp_lvalue_kind clk
= lvalue_kind (expr
);
5436 type
= unlowered_expr_type (expr
);
5437 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
5439 /* For vector types, pick a non-opaque variant. */
5440 if (TREE_CODE (type
) == VECTOR_TYPE
)
5441 type
= strip_typedefs (type
);
5443 if (clk
!= clk_none
&& !(clk
& clk_class
))
5444 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
5451 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5452 __has_nothrow_copy, depending on assign_p. */
5455 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5462 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5465 fns
= (*CLASSTYPE_METHOD_VEC (type
))[ix
];
5467 else if (TYPE_HAS_COPY_CTOR (type
))
5469 /* If construction of the copy constructor was postponed, create
5471 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5472 lazily_declare_fn (sfk_copy_constructor
, type
);
5473 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5474 lazily_declare_fn (sfk_move_constructor
, type
);
5475 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5480 for (; fns
; fns
= OVL_NEXT (fns
))
5482 tree fn
= OVL_CURRENT (fns
);
5486 if (copy_fn_p (fn
) == 0)
5489 else if (copy_fn_p (fn
) <= 0)
5492 maybe_instantiate_noexcept (fn
);
5493 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5500 /* Actually evaluates the trait. */
5503 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5505 enum tree_code type_code1
;
5508 type_code1
= TREE_CODE (type1
);
5512 case CPTK_HAS_NOTHROW_ASSIGN
:
5513 type1
= strip_array_types (type1
);
5514 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5515 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5516 || (CLASS_TYPE_P (type1
)
5517 && classtype_has_nothrow_assign_or_copy_p (type1
,
5520 case CPTK_HAS_TRIVIAL_ASSIGN
:
5521 /* ??? The standard seems to be missing the "or array of such a class
5522 type" wording for this trait. */
5523 type1
= strip_array_types (type1
);
5524 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5525 && (trivial_type_p (type1
)
5526 || (CLASS_TYPE_P (type1
)
5527 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5529 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5530 type1
= strip_array_types (type1
);
5531 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5532 || (CLASS_TYPE_P (type1
)
5533 && (t
= locate_ctor (type1
))
5534 && (maybe_instantiate_noexcept (t
),
5535 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
5537 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5538 type1
= strip_array_types (type1
);
5539 return (trivial_type_p (type1
)
5540 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5542 case CPTK_HAS_NOTHROW_COPY
:
5543 type1
= strip_array_types (type1
);
5544 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5545 || (CLASS_TYPE_P (type1
)
5546 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5548 case CPTK_HAS_TRIVIAL_COPY
:
5549 /* ??? The standard seems to be missing the "or array of such a class
5550 type" wording for this trait. */
5551 type1
= strip_array_types (type1
);
5552 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5553 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5555 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5556 type1
= strip_array_types (type1
);
5557 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5558 || (CLASS_TYPE_P (type1
)
5559 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5561 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5562 return type_has_virtual_destructor (type1
);
5564 case CPTK_IS_ABSTRACT
:
5565 return (ABSTRACT_CLASS_TYPE_P (type1
));
5567 case CPTK_IS_BASE_OF
:
5568 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5569 && DERIVED_FROM_P (type1
, type2
));
5572 return (NON_UNION_CLASS_TYPE_P (type1
));
5574 case CPTK_IS_CONVERTIBLE_TO
:
5579 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5582 return (type_code1
== ENUMERAL_TYPE
);
5585 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
5587 case CPTK_IS_LITERAL_TYPE
:
5588 return (literal_type_p (type1
));
5591 return (pod_type_p (type1
));
5593 case CPTK_IS_POLYMORPHIC
:
5594 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5596 case CPTK_IS_STD_LAYOUT
:
5597 return (std_layout_type_p (type1
));
5599 case CPTK_IS_TRIVIAL
:
5600 return (trivial_type_p (type1
));
5603 return (type_code1
== UNION_TYPE
);
5611 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5612 void, or a complete type, returns it, otherwise NULL_TREE. */
5615 check_trait_type (tree type
)
5617 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5618 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5621 if (VOID_TYPE_P (type
))
5624 return complete_type_or_else (strip_array_types (type
), NULL_TREE
);
5627 /* Process a trait expression. */
5630 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5632 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5633 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5634 || kind
== CPTK_HAS_NOTHROW_COPY
5635 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5636 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5637 || kind
== CPTK_HAS_TRIVIAL_COPY
5638 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5639 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5640 || kind
== CPTK_IS_ABSTRACT
5641 || kind
== CPTK_IS_BASE_OF
5642 || kind
== CPTK_IS_CLASS
5643 || kind
== CPTK_IS_CONVERTIBLE_TO
5644 || kind
== CPTK_IS_EMPTY
5645 || kind
== CPTK_IS_ENUM
5646 || kind
== CPTK_IS_FINAL
5647 || kind
== CPTK_IS_LITERAL_TYPE
5648 || kind
== CPTK_IS_POD
5649 || kind
== CPTK_IS_POLYMORPHIC
5650 || kind
== CPTK_IS_STD_LAYOUT
5651 || kind
== CPTK_IS_TRIVIAL
5652 || kind
== CPTK_IS_UNION
);
5654 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5656 sorry ("__is_convertible_to");
5657 return error_mark_node
;
5660 if (type1
== error_mark_node
5661 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5662 && type2
== error_mark_node
))
5663 return error_mark_node
;
5665 if (processing_template_decl
)
5667 tree trait_expr
= make_node (TRAIT_EXPR
);
5668 TREE_TYPE (trait_expr
) = boolean_type_node
;
5669 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5670 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5671 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5677 case CPTK_HAS_NOTHROW_ASSIGN
:
5678 case CPTK_HAS_TRIVIAL_ASSIGN
:
5679 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5680 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5681 case CPTK_HAS_NOTHROW_COPY
:
5682 case CPTK_HAS_TRIVIAL_COPY
:
5683 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5684 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5685 case CPTK_IS_ABSTRACT
:
5688 case CPTK_IS_LITERAL_TYPE
:
5690 case CPTK_IS_POLYMORPHIC
:
5691 case CPTK_IS_STD_LAYOUT
:
5692 case CPTK_IS_TRIVIAL
:
5693 if (!check_trait_type (type1
))
5694 return error_mark_node
;
5697 case CPTK_IS_BASE_OF
:
5698 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5699 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5700 && !complete_type_or_else (type2
, NULL_TREE
))
5701 /* We already issued an error. */
5702 return error_mark_node
;
5710 case CPTK_IS_CONVERTIBLE_TO
:
5715 return (trait_expr_value (kind
, type1
, type2
)
5716 ? boolean_true_node
: boolean_false_node
);
5719 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5720 which is ignored for C++. */
5723 set_float_const_decimal64 (void)
5728 clear_float_const_decimal64 (void)
5733 float_const_decimal64_p (void)
5739 /* Return true if T is a literal type. */
5742 literal_type_p (tree t
)
5744 if (SCALAR_TYPE_P (t
)
5745 || TREE_CODE (t
) == VECTOR_TYPE
5746 || TREE_CODE (t
) == REFERENCE_TYPE
)
5748 if (CLASS_TYPE_P (t
))
5750 t
= complete_type (t
);
5751 gcc_assert (COMPLETE_TYPE_P (t
) || errorcount
);
5752 return CLASSTYPE_LITERAL_P (t
);
5754 if (TREE_CODE (t
) == ARRAY_TYPE
)
5755 return literal_type_p (strip_array_types (t
));
5759 /* If DECL is a variable declared `constexpr', require its type
5760 be literal. Return the DECL if OK, otherwise NULL. */
5763 ensure_literal_type_for_constexpr_object (tree decl
)
5765 tree type
= TREE_TYPE (decl
);
5766 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5767 && !processing_template_decl
)
5769 if (CLASS_TYPE_P (type
) && !COMPLETE_TYPE_P (complete_type (type
)))
5770 /* Don't complain here, we'll complain about incompleteness
5771 when we try to initialize the variable. */;
5772 else if (!literal_type_p (type
))
5774 error ("the type %qT of constexpr variable %qD is not literal",
5776 explain_non_literal_class (type
);
5783 /* Representation of entries in the constexpr function definition table. */
5785 typedef struct GTY(()) constexpr_fundef
{
5790 /* This table holds all constexpr function definitions seen in
5791 the current translation unit. */
5793 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5795 /* Utility function used for managing the constexpr function table.
5796 Return true if the entries pointed to by P and Q are for the
5797 same constexpr function. */
5800 constexpr_fundef_equal (const void *p
, const void *q
)
5802 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5803 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5804 return lhs
->decl
== rhs
->decl
;
5807 /* Utility function used for managing the constexpr function table.
5808 Return a hash value for the entry pointed to by Q. */
5810 static inline hashval_t
5811 constexpr_fundef_hash (const void *p
)
5813 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5814 return DECL_UID (fundef
->decl
);
5817 /* Return a previously saved definition of function FUN. */
5819 static constexpr_fundef
*
5820 retrieve_constexpr_fundef (tree fun
)
5822 constexpr_fundef fundef
= { NULL
, NULL
};
5823 if (constexpr_fundef_table
== NULL
)
5827 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5830 /* Check whether the parameter and return types of FUN are valid for a
5831 constexpr function, and complain if COMPLAIN. */
5834 is_valid_constexpr_fn (tree fun
, bool complain
)
5836 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5838 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5839 if (!literal_type_p (TREE_TYPE (parm
)))
5844 error ("invalid type for parameter %d of constexpr "
5845 "function %q+#D", DECL_PARM_INDEX (parm
), fun
);
5846 explain_non_literal_class (TREE_TYPE (parm
));
5850 if (!DECL_CONSTRUCTOR_P (fun
))
5852 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5853 if (!literal_type_p (rettype
))
5858 error ("invalid return type %qT of constexpr function %q+D",
5860 explain_non_literal_class (rettype
);
5864 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5865 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun
)))
5870 error ("enclosing class of constexpr non-static member "
5871 "function %q+#D is not a literal type", fun
);
5872 explain_non_literal_class (DECL_CONTEXT (fun
));
5876 else if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fun
)))
5880 error ("%q#T has virtual base classes", DECL_CONTEXT (fun
));
5886 /* Subroutine of build_data_member_initialization. MEMBER is a COMPONENT_REF
5887 for a member of an anonymous aggregate, INIT is the initializer for that
5888 member, and VEC_OUTER is the vector of constructor elements for the class
5889 whose constructor we are processing. Add the initializer to the vector
5890 and return true to indicate success. */
5893 build_anon_member_initialization (tree member
, tree init
,
5894 vec
<constructor_elt
, va_gc
> **vec_outer
)
5896 /* MEMBER presents the relevant fields from the inside out, but we need
5897 to build up the initializer from the outside in so that we can reuse
5898 previously built CONSTRUCTORs if this is, say, the second field in an
5899 anonymous struct. So we use a vec as a stack. */
5904 fields
.safe_push (TREE_OPERAND (member
, 1));
5905 member
= TREE_OPERAND (member
, 0);
5907 while (ANON_AGGR_TYPE_P (TREE_TYPE (member
)));
5909 /* VEC has the constructor elements vector for the context of FIELD.
5910 If FIELD is an anonymous aggregate, we will push inside it. */
5911 vec
<constructor_elt
, va_gc
> **vec
= vec_outer
;
5913 while (field
= fields
.pop(),
5914 ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
5917 /* If there is already an outer constructor entry for the anonymous
5918 aggregate FIELD, use it; otherwise, insert one. */
5919 if (vec_safe_is_empty (*vec
)
5920 || (*vec
)->last().index
!= field
)
5922 ctor
= build_constructor (TREE_TYPE (field
), NULL
);
5923 CONSTRUCTOR_APPEND_ELT (*vec
, field
, ctor
);
5926 ctor
= (*vec
)->last().value
;
5927 vec
= &CONSTRUCTOR_ELTS (ctor
);
5930 /* Now we're at the innermost field, the one that isn't an anonymous
5931 aggregate. Add its initializer to the CONSTRUCTOR and we're done. */
5932 gcc_assert (fields
.is_empty());
5934 CONSTRUCTOR_APPEND_ELT (*vec
, field
, init
);
5939 /* Subroutine of build_constexpr_constructor_member_initializers.
5940 The expression tree T represents a data member initialization
5941 in a (constexpr) constructor definition. Build a pairing of
5942 the data member with its initializer, and prepend that pair
5943 to the existing initialization pair INITS. */
5946 build_data_member_initialization (tree t
, vec
<constructor_elt
, va_gc
> **vec
)
5949 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5950 t
= TREE_OPERAND (t
, 0);
5951 if (TREE_CODE (t
) == EXPR_STMT
)
5952 t
= TREE_OPERAND (t
, 0);
5953 if (t
== error_mark_node
)
5955 if (TREE_CODE (t
) == STATEMENT_LIST
)
5957 tree_stmt_iterator i
;
5958 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5960 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5965 if (TREE_CODE (t
) == CLEANUP_STMT
)
5967 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5968 but we can in a constexpr constructor for a non-literal class. Just
5969 ignore it; either all the initialization will be constant, in which
5970 case the cleanup can't run, or it can't be constexpr.
5971 Still recurse into CLEANUP_BODY. */
5972 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5974 if (TREE_CODE (t
) == CONVERT_EXPR
)
5975 t
= TREE_OPERAND (t
, 0);
5976 if (TREE_CODE (t
) == INIT_EXPR
5977 || TREE_CODE (t
) == MODIFY_EXPR
)
5979 member
= TREE_OPERAND (t
, 0);
5980 init
= break_out_target_exprs (TREE_OPERAND (t
, 1));
5982 else if (TREE_CODE (t
) == CALL_EXPR
)
5984 member
= CALL_EXPR_ARG (t
, 0);
5985 /* We don't use build_cplus_new here because it complains about
5986 abstract bases. Leaving the call unwrapped means that it has the
5987 wrong type, but cxx_eval_constant_expression doesn't care. */
5988 init
= break_out_target_exprs (t
);
5990 else if (TREE_CODE (t
) == DECL_EXPR
)
5991 /* Declaring a temporary, don't add it to the CONSTRUCTOR. */
5995 if (TREE_CODE (member
) == INDIRECT_REF
)
5996 member
= TREE_OPERAND (member
, 0);
5997 if (TREE_CODE (member
) == NOP_EXPR
)
6001 if (TREE_CODE (op
) == ADDR_EXPR
)
6003 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6004 (TREE_TYPE (TREE_TYPE (op
)),
6005 TREE_TYPE (TREE_TYPE (member
))));
6006 /* Initializing a cv-qualified member; we need to look through
6010 else if (op
== current_class_ptr
6011 && (same_type_ignoring_top_level_qualifiers_p
6012 (TREE_TYPE (TREE_TYPE (member
)),
6013 current_class_type
)))
6014 /* Delegating constructor. */
6018 /* This is an initializer for an empty base; keep it for now so
6019 we can check it in cxx_eval_bare_aggregate. */
6020 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
6023 if (TREE_CODE (member
) == ADDR_EXPR
)
6024 member
= TREE_OPERAND (member
, 0);
6025 if (TREE_CODE (member
) == COMPONENT_REF
)
6027 tree aggr
= TREE_OPERAND (member
, 0);
6028 if (TREE_CODE (aggr
) != COMPONENT_REF
)
6029 /* Normal member initialization. */
6030 member
= TREE_OPERAND (member
, 1);
6031 else if (ANON_AGGR_TYPE_P (TREE_TYPE (aggr
)))
6032 /* Initializing a member of an anonymous union. */
6033 return build_anon_member_initialization (member
, init
, vec
);
6035 /* We're initializing a vtable pointer in a base. Leave it as
6036 COMPONENT_REF so we remember the path to get to the vfield. */
6037 gcc_assert (TREE_TYPE (member
) == vtbl_ptr_type_node
);
6040 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
6044 /* Make sure that there are no statements after LAST in the constructor
6045 body represented by LIST. */
6048 check_constexpr_ctor_body (tree last
, tree list
)
6051 if (TREE_CODE (list
) == STATEMENT_LIST
)
6053 tree_stmt_iterator i
= tsi_last (list
);
6054 for (; !tsi_end_p (i
); tsi_prev (&i
))
6056 tree t
= tsi_stmt (i
);
6059 if (TREE_CODE (t
) == BIND_EXPR
)
6061 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
6066 /* We currently allow typedefs and static_assert.
6067 FIXME allow them in the standard, too. */
6068 if (TREE_CODE (t
) != STATIC_ASSERT
)
6075 else if (list
!= last
6076 && TREE_CODE (list
) != STATIC_ASSERT
)
6080 error ("constexpr constructor does not have empty body");
6081 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
6086 /* V is a vector of constructor elements built up for the base and member
6087 initializers of a constructor for TYPE. They need to be in increasing
6088 offset order, which they might not be yet if TYPE has a primary base
6089 which is not first in the base-clause or a vptr and at least one base
6090 all of which are non-primary. */
6092 static vec
<constructor_elt
, va_gc
> *
6093 sort_constexpr_mem_initializers (tree type
, vec
<constructor_elt
, va_gc
> *v
)
6095 tree pri
= CLASSTYPE_PRIMARY_BINFO (type
);
6097 constructor_elt elt
;
6101 field_type
= BINFO_TYPE (pri
);
6102 else if (TYPE_CONTAINS_VPTR_P (type
))
6103 field_type
= vtbl_ptr_type_node
;
6107 /* Find the element for the primary base or vptr and move it to the
6108 beginning of the vec. */
6109 vec
<constructor_elt
, va_gc
> &vref
= *v
;
6111 if (TREE_TYPE (vref
[i
].index
) == field_type
)
6118 vref
[i
] = vref
[i
-1];
6125 /* Build compile-time evalable representations of member-initializer list
6126 for a constexpr constructor. */
6129 build_constexpr_constructor_member_initializers (tree type
, tree body
)
6131 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6133 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
6134 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
6135 body
= TREE_OPERAND (body
, 0);
6136 if (TREE_CODE (body
) == STATEMENT_LIST
)
6137 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
6138 body
= BIND_EXPR_BODY (body
);
6139 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
6141 body
= TREE_OPERAND (body
, 0);
6142 if (TREE_CODE (body
) == EXPR_STMT
)
6143 body
= TREE_OPERAND (body
, 0);
6144 if (TREE_CODE (body
) == INIT_EXPR
6145 && (same_type_ignoring_top_level_qualifiers_p
6146 (TREE_TYPE (TREE_OPERAND (body
, 0)),
6147 current_class_type
)))
6150 return TREE_OPERAND (body
, 1);
6152 ok
= build_data_member_initialization (body
, &vec
);
6154 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6156 tree_stmt_iterator i
;
6157 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
6159 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
6164 else if (TREE_CODE (body
) == TRY_BLOCK
)
6166 error ("body of %<constexpr%> constructor cannot be "
6167 "a function-try-block");
6168 return error_mark_node
;
6170 else if (EXPR_P (body
))
6171 ok
= build_data_member_initialization (body
, &vec
);
6173 gcc_assert (errorcount
> 0);
6176 if (vec_safe_length (vec
) > 0)
6178 /* In a delegating constructor, return the target. */
6179 constructor_elt
*ce
= &(*vec
)[0];
6180 if (ce
->index
== current_class_ptr
)
6187 vec
= sort_constexpr_mem_initializers (type
, vec
);
6188 return build_constructor (type
, vec
);
6191 return error_mark_node
;
6194 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
6195 declared to be constexpr, or a sub-statement thereof. Returns the
6196 return value if suitable, error_mark_node for a statement not allowed in
6197 a constexpr function, or NULL_TREE if no return value was found. */
6200 constexpr_fn_retval (tree body
)
6202 switch (TREE_CODE (body
))
6204 case STATEMENT_LIST
:
6206 tree_stmt_iterator i
;
6207 tree expr
= NULL_TREE
;
6208 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
6210 tree s
= constexpr_fn_retval (tsi_stmt (i
));
6211 if (s
== error_mark_node
)
6212 return error_mark_node
;
6213 else if (s
== NULL_TREE
)
6214 /* Keep iterating. */;
6216 /* Multiple return statements. */
6217 return error_mark_node
;
6225 return break_out_target_exprs (TREE_OPERAND (body
, 0));
6228 if (TREE_CODE (DECL_EXPR_DECL (body
)) == USING_DECL
)
6230 return error_mark_node
;
6232 case CLEANUP_POINT_EXPR
:
6233 return constexpr_fn_retval (TREE_OPERAND (body
, 0));
6239 return error_mark_node
;
6243 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
6244 FUN; do the necessary transformations to turn it into a single expression
6245 that we can store in the hash table. */
6248 massage_constexpr_body (tree fun
, tree body
)
6250 if (DECL_CONSTRUCTOR_P (fun
))
6251 body
= build_constexpr_constructor_member_initializers
6252 (DECL_CONTEXT (fun
), body
);
6255 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
6256 body
= EH_SPEC_STMTS (body
);
6257 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
6258 body
= TREE_OPERAND (body
, 0);
6259 if (TREE_CODE (body
) == BIND_EXPR
)
6260 body
= BIND_EXPR_BODY (body
);
6261 body
= constexpr_fn_retval (body
);
6266 /* FUN is a constexpr constructor with massaged body BODY. Return true
6267 if some bases/fields are uninitialized, and complain if COMPLAIN. */
6270 cx_check_missing_mem_inits (tree fun
, tree body
, bool complain
)
6277 if (TREE_CODE (body
) != CONSTRUCTOR
)
6280 nelts
= CONSTRUCTOR_NELTS (body
);
6281 ctype
= DECL_CONTEXT (fun
);
6282 field
= TYPE_FIELDS (ctype
);
6284 if (TREE_CODE (ctype
) == UNION_TYPE
)
6286 if (nelts
== 0 && next_initializable_field (field
))
6289 error ("%<constexpr%> constructor for union %qT must "
6290 "initialize exactly one non-static data member", ctype
);
6297 for (i
= 0; i
<= nelts
; ++i
)
6304 index
= CONSTRUCTOR_ELT (body
, i
)->index
;
6305 /* Skip base and vtable inits. */
6306 if (TREE_CODE (index
) != FIELD_DECL
6307 || DECL_ARTIFICIAL (index
))
6310 for (; field
!= index
; field
= DECL_CHAIN (field
))
6313 if (TREE_CODE (field
) != FIELD_DECL
6314 || (DECL_C_BIT_FIELD (field
) && !DECL_NAME (field
))
6315 || DECL_ARTIFICIAL (field
))
6317 ftype
= strip_array_types (TREE_TYPE (field
));
6318 if (type_has_constexpr_default_constructor (ftype
))
6320 /* It's OK to skip a member with a trivial constexpr ctor.
6321 A constexpr ctor that isn't trivial should have been
6323 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype
)
6324 || errorcount
!= 0);
6329 error ("uninitialized member %qD in %<constexpr%> constructor",
6333 if (field
== NULL_TREE
)
6335 field
= DECL_CHAIN (field
);
6341 /* We are processing the definition of the constexpr function FUN.
6342 Check that its BODY fulfills the propriate requirements and
6343 enter it in the constexpr function definition table.
6344 For constructor BODY is actually the TREE_LIST of the
6345 member-initializer list. */
6348 register_constexpr_fundef (tree fun
, tree body
)
6350 constexpr_fundef entry
;
6351 constexpr_fundef
**slot
;
6353 if (!is_valid_constexpr_fn (fun
, !DECL_GENERATED_P (fun
)))
6356 body
= massage_constexpr_body (fun
, body
);
6357 if (body
== NULL_TREE
|| body
== error_mark_node
)
6359 if (!DECL_CONSTRUCTOR_P (fun
))
6360 error ("body of constexpr function %qD not a return-statement", fun
);
6364 if (!potential_rvalue_constant_expression (body
))
6366 if (!DECL_GENERATED_P (fun
))
6367 require_potential_rvalue_constant_expression (body
);
6371 if (DECL_CONSTRUCTOR_P (fun
)
6372 && cx_check_missing_mem_inits (fun
, body
, !DECL_GENERATED_P (fun
)))
6375 /* Create the constexpr function table if necessary. */
6376 if (constexpr_fundef_table
== NULL
)
6377 constexpr_fundef_table
= htab_create_ggc (101,
6378 constexpr_fundef_hash
,
6379 constexpr_fundef_equal
,
6383 slot
= (constexpr_fundef
**)
6384 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
6386 gcc_assert (*slot
== NULL
);
6387 *slot
= ggc_alloc_constexpr_fundef ();
6393 /* FUN is a non-constexpr function called in a context that requires a
6394 constant expression. If it comes from a constexpr template, explain why
6395 the instantiation isn't constexpr. */
6398 explain_invalid_constexpr_fn (tree fun
)
6400 static struct pointer_set_t
*diagnosed
;
6402 location_t save_loc
;
6403 /* Only diagnose defaulted functions or instantiations. */
6404 if (!DECL_DEFAULTED_FN (fun
)
6405 && !is_instantiation_of_constexpr (fun
))
6407 if (diagnosed
== NULL
)
6408 diagnosed
= pointer_set_create ();
6409 if (pointer_set_insert (diagnosed
, fun
) != 0)
6410 /* Already explained. */
6413 save_loc
= input_location
;
6414 input_location
= DECL_SOURCE_LOCATION (fun
);
6415 inform (0, "%q+D is not usable as a constexpr function because:", fun
);
6416 /* First check the declaration. */
6417 if (is_valid_constexpr_fn (fun
, true))
6419 /* Then if it's OK, the body. */
6420 if (DECL_DEFAULTED_FN (fun
))
6421 explain_implicit_non_constexpr (fun
);
6424 body
= massage_constexpr_body (fun
, DECL_SAVED_TREE (fun
));
6425 require_potential_rvalue_constant_expression (body
);
6426 if (DECL_CONSTRUCTOR_P (fun
))
6427 cx_check_missing_mem_inits (fun
, body
, true);
6430 input_location
= save_loc
;
6433 /* Objects of this type represent calls to constexpr functions
6434 along with the bindings of parameters to their arguments, for
6435 the purpose of compile time evaluation. */
6437 typedef struct GTY(()) constexpr_call
{
6438 /* Description of the constexpr function definition. */
6439 constexpr_fundef
*fundef
;
6440 /* Parameter bindings environment. A TREE_LIST where each TREE_PURPOSE
6441 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6442 Note: This arrangement is made to accomodate the use of
6443 iterative_hash_template_arg (see pt.c). If you change this
6444 representation, also change the hash calculation in
6445 cxx_eval_call_expression. */
6447 /* Result of the call.
6448 NULL means the call is being evaluated.
6449 error_mark_node means that the evaluation was erroneous;
6450 otherwise, the actuall value of the call. */
6452 /* The hash of this call; we remember it here to avoid having to
6453 recalculate it when expanding the hash table. */
6457 /* A table of all constexpr calls that have been evaluated by the
6458 compiler in this translation unit. */
6460 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
6462 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
6463 bool, bool, bool *, bool *);
6465 /* Compute a hash value for a constexpr call representation. */
6468 constexpr_call_hash (const void *p
)
6470 const constexpr_call
*info
= (const constexpr_call
*) p
;
6474 /* Return 1 if the objects pointed to by P and Q represent calls
6475 to the same constexpr function with the same arguments.
6476 Otherwise, return 0. */
6479 constexpr_call_equal (const void *p
, const void *q
)
6481 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
6482 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
6487 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
6489 lhs_bindings
= lhs
->bindings
;
6490 rhs_bindings
= rhs
->bindings
;
6491 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
6493 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
6494 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
6495 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
6496 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
6498 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
6499 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
6501 return lhs_bindings
== rhs_bindings
;
6504 /* Initialize the constexpr call table, if needed. */
6507 maybe_initialize_constexpr_call_table (void)
6509 if (constexpr_call_table
== NULL
)
6510 constexpr_call_table
= htab_create_ggc (101,
6511 constexpr_call_hash
,
6512 constexpr_call_equal
,
6516 /* Return true if T designates the implied `this' parameter. */
6519 is_this_parameter (tree t
)
6521 return t
== current_class_ptr
;
6524 /* We have an expression tree T that represents a call, either CALL_EXPR
6525 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6526 retrun the _DECL for that function. */
6529 get_function_named_in_call (tree t
)
6532 switch (TREE_CODE (t
))
6535 fun
= CALL_EXPR_FN (t
);
6538 case AGGR_INIT_EXPR
:
6539 fun
= AGGR_INIT_EXPR_FN (t
);
6546 if (TREE_CODE (fun
) == ADDR_EXPR
6547 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
6548 fun
= TREE_OPERAND (fun
, 0);
6552 /* We have an expression tree T that represents a call, either CALL_EXPR
6553 or AGGR_INIT_EXPR. Return the Nth argument. */
6556 get_nth_callarg (tree t
, int n
)
6558 switch (TREE_CODE (t
))
6561 return CALL_EXPR_ARG (t
, n
);
6563 case AGGR_INIT_EXPR
:
6564 return AGGR_INIT_EXPR_ARG (t
, n
);
6572 /* Look up the binding of the function parameter T in a constexpr
6573 function call context CALL. */
6576 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
6578 tree b
= purpose_member (t
, call
->bindings
);
6579 return TREE_VALUE (b
);
6582 /* Attempt to evaluate T which represents a call to a builtin function.
6583 We assume here that all builtin functions evaluate to scalar types
6584 represented by _CST nodes. */
6587 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
6588 bool allow_non_constant
, bool addr
,
6589 bool *non_constant_p
, bool *overflow_p
)
6591 const int nargs
= call_expr_nargs (t
);
6592 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
6595 for (i
= 0; i
< nargs
; ++i
)
6597 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
6598 allow_non_constant
, addr
,
6599 non_constant_p
, overflow_p
);
6600 if (allow_non_constant
&& *non_constant_p
)
6603 if (*non_constant_p
)
6605 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
6606 CALL_EXPR_FN (t
), nargs
, args
);
6607 new_call
= fold (new_call
);
6608 VERIFY_CONSTANT (new_call
);
6612 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6613 the type of the value to match. */
6616 adjust_temp_type (tree type
, tree temp
)
6618 if (TREE_TYPE (temp
) == type
)
6620 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6621 if (TREE_CODE (temp
) == CONSTRUCTOR
)
6622 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
6623 gcc_assert (scalarish_type_p (type
));
6624 return cp_fold_convert (type
, temp
);
6627 /* Subroutine of cxx_eval_call_expression.
6628 We are processing a call expression (either CALL_EXPR or
6629 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6630 all arguments and bind their values to correspondings
6631 parameters, making up the NEW_CALL context. */
6634 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
6635 constexpr_call
*new_call
,
6636 bool allow_non_constant
,
6637 bool *non_constant_p
, bool *overflow_p
)
6639 const int nargs
= call_expr_nargs (t
);
6640 tree fun
= new_call
->fundef
->decl
;
6641 tree parms
= DECL_ARGUMENTS (fun
);
6643 for (i
= 0; i
< nargs
; ++i
)
6646 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
6647 /* For member function, the first argument is a pointer to the implied
6648 object. And for an object contruction, don't bind `this' before
6649 it is fully constructed. */
6650 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
6652 x
= get_nth_callarg (t
, i
);
6653 if (parms
&& DECL_BY_REFERENCE (parms
))
6655 /* cp_genericize made this a reference for argument passing, but
6656 we don't want to treat it like one for constexpr evaluation. */
6657 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
6658 gcc_assert (TREE_CODE (TREE_TYPE (x
)) == REFERENCE_TYPE
);
6659 type
= TREE_TYPE (type
);
6660 x
= convert_from_reference (x
);
6662 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
6663 TREE_CODE (type
) == REFERENCE_TYPE
,
6664 non_constant_p
, overflow_p
);
6665 /* Don't VERIFY_CONSTANT here. */
6666 if (*non_constant_p
&& allow_non_constant
)
6668 /* Just discard ellipsis args after checking their constantitude. */
6671 if (*non_constant_p
)
6672 /* Don't try to adjust the type of non-constant args. */
6675 /* Make sure the binding has the same type as the parm. */
6676 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6677 arg
= adjust_temp_type (type
, arg
);
6678 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
6680 parms
= TREE_CHAIN (parms
);
6684 /* Variables and functions to manage constexpr call expansion context.
6685 These do not need to be marked for PCH or GC. */
6687 /* FIXME remember and print actual constant arguments. */
6688 static vec
<tree
> call_stack
= vNULL
;
6689 static int call_stack_tick
;
6690 static int last_cx_error_tick
;
6693 push_cx_call_context (tree call
)
6696 if (!EXPR_HAS_LOCATION (call
))
6697 SET_EXPR_LOCATION (call
, input_location
);
6698 call_stack
.safe_push (call
);
6699 if (call_stack
.length () > (unsigned) max_constexpr_depth
)
6705 pop_cx_call_context (void)
6712 cx_error_context (void)
6714 vec
<tree
> r
= vNULL
;
6715 if (call_stack_tick
!= last_cx_error_tick
6716 && !call_stack
.is_empty ())
6718 last_cx_error_tick
= call_stack_tick
;
6722 /* Subroutine of cxx_eval_constant_expression.
6723 Evaluate the call expression tree T in the context of OLD_CALL expression
6727 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
6728 bool allow_non_constant
, bool addr
,
6729 bool *non_constant_p
, bool *overflow_p
)
6731 location_t loc
= EXPR_LOC_OR_HERE (t
);
6732 tree fun
= get_function_named_in_call (t
);
6734 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
6735 constexpr_call
**slot
;
6736 constexpr_call
*entry
;
6739 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6741 /* Might be a constexpr function pointer. */
6742 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
6743 /*addr*/false, non_constant_p
, overflow_p
);
6744 if (TREE_CODE (fun
) == ADDR_EXPR
)
6745 fun
= TREE_OPERAND (fun
, 0);
6747 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6749 if (!allow_non_constant
&& !*non_constant_p
)
6750 error_at (loc
, "expression %qE does not designate a constexpr "
6752 *non_constant_p
= true;
6755 if (DECL_CLONED_FUNCTION_P (fun
))
6756 fun
= DECL_CLONED_FUNCTION (fun
);
6757 if (is_builtin_fn (fun
))
6758 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6759 addr
, non_constant_p
, overflow_p
);
6760 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6762 if (!allow_non_constant
)
6764 error_at (loc
, "call to non-constexpr function %qD", fun
);
6765 explain_invalid_constexpr_fn (fun
);
6767 *non_constant_p
= true;
6771 /* Shortcut trivial copy constructor/op=. */
6772 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6774 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6775 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6776 addr
, non_constant_p
, overflow_p
);
6779 /* If in direct recursive call, optimize definition search. */
6780 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6781 new_call
.fundef
= old_call
->fundef
;
6784 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6785 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6787 if (!allow_non_constant
)
6789 if (DECL_INITIAL (fun
))
6791 /* The definition of fun was somehow unsuitable. */
6792 error_at (loc
, "%qD called in a constant expression", fun
);
6793 explain_invalid_constexpr_fn (fun
);
6796 error_at (loc
, "%qD used before its definition", fun
);
6798 *non_constant_p
= true;
6802 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6803 allow_non_constant
, non_constant_p
, overflow_p
);
6804 if (*non_constant_p
)
6807 depth_ok
= push_cx_call_context (t
);
6810 = iterative_hash_template_arg (new_call
.bindings
,
6811 constexpr_fundef_hash (new_call
.fundef
));
6813 /* If we have seen this call before, we are done. */
6814 maybe_initialize_constexpr_call_table ();
6815 slot
= (constexpr_call
**)
6816 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6820 /* We need to keep a pointer to the entry, not just the slot, as the
6821 slot can move in the call to cxx_eval_builtin_function_call. */
6822 *slot
= entry
= ggc_alloc_constexpr_call ();
6825 /* Calls which are in progress have their result set to NULL
6826 so that we can detect circular dependencies. */
6827 else if (entry
->result
== NULL
)
6829 if (!allow_non_constant
)
6830 error ("call has circular dependency");
6831 *non_constant_p
= true;
6832 entry
->result
= result
= error_mark_node
;
6837 if (!allow_non_constant
)
6838 error ("constexpr evaluation depth exceeds maximum of %d (use "
6839 "-fconstexpr-depth= to increase the maximum)",
6840 max_constexpr_depth
);
6841 *non_constant_p
= true;
6842 entry
->result
= result
= error_mark_node
;
6846 result
= entry
->result
;
6847 if (!result
|| result
== error_mark_node
)
6848 result
= (cxx_eval_constant_expression
6849 (&new_call
, new_call
.fundef
->body
,
6850 allow_non_constant
, addr
,
6851 non_constant_p
, overflow_p
));
6852 if (result
== error_mark_node
)
6853 *non_constant_p
= true;
6854 if (*non_constant_p
)
6855 entry
->result
= result
= error_mark_node
;
6858 /* If this was a call to initialize an object, set the type of
6859 the CONSTRUCTOR to the type of that object. */
6860 if (DECL_CONSTRUCTOR_P (fun
))
6862 tree ob_arg
= get_nth_callarg (t
, 0);
6863 STRIP_NOPS (ob_arg
);
6864 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6865 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6866 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6869 entry
->result
= result
;
6873 pop_cx_call_context ();
6874 return unshare_expr (result
);
6877 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6880 reduced_constant_expression_p (tree t
)
6882 /* FIXME are we calling this too much? */
6883 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6886 /* Some expressions may have constant operands but are not constant
6887 themselves, such as 1/0. Call this function (or rather, the macro
6888 following it) to check for that condition.
6890 We only call this in places that require an arithmetic constant, not in
6891 places where we might have a non-constant expression that can be a
6892 component of a constant expression, such as the address of a constexpr
6893 variable that might be dereferenced later. */
6896 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
,
6899 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6901 if (!allow_non_constant
)
6902 error ("%q+E is not a constant expression", t
);
6903 *non_constant_p
= true;
6905 if (TREE_OVERFLOW_P (t
))
6907 if (!allow_non_constant
)
6909 permerror (input_location
, "overflow in constant expression");
6910 /* If we're being permissive (and are in an enforcing
6911 context), ignore the overflow. */
6912 if (flag_permissive
)
6913 return *non_constant_p
;
6917 return *non_constant_p
;
6920 /* Subroutine of cxx_eval_constant_expression.
6921 Attempt to reduce the unary expression tree T to a compile time value.
6922 If successful, return the value. Otherwise issue a diagnostic
6923 and return error_mark_node. */
6926 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6927 bool allow_non_constant
, bool addr
,
6928 bool *non_constant_p
, bool *overflow_p
)
6931 tree orig_arg
= TREE_OPERAND (t
, 0);
6932 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6933 addr
, non_constant_p
, overflow_p
);
6934 VERIFY_CONSTANT (arg
);
6935 if (arg
== orig_arg
)
6937 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6938 VERIFY_CONSTANT (r
);
6942 /* Subroutine of cxx_eval_constant_expression.
6943 Like cxx_eval_unary_expression, except for binary expressions. */
6946 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6947 bool allow_non_constant
, bool addr
,
6948 bool *non_constant_p
, bool *overflow_p
)
6951 tree orig_lhs
= TREE_OPERAND (t
, 0);
6952 tree orig_rhs
= TREE_OPERAND (t
, 1);
6954 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6955 allow_non_constant
, addr
,
6956 non_constant_p
, overflow_p
);
6957 VERIFY_CONSTANT (lhs
);
6958 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6959 allow_non_constant
, addr
,
6960 non_constant_p
, overflow_p
);
6961 VERIFY_CONSTANT (rhs
);
6962 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6964 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6965 VERIFY_CONSTANT (r
);
6969 /* Subroutine of cxx_eval_constant_expression.
6970 Attempt to evaluate condition expressions. Dead branches are not
6974 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6975 bool allow_non_constant
, bool addr
,
6976 bool *non_constant_p
, bool *overflow_p
)
6978 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6979 allow_non_constant
, addr
,
6980 non_constant_p
, overflow_p
);
6981 VERIFY_CONSTANT (val
);
6982 /* Don't VERIFY_CONSTANT the other operands. */
6983 if (integer_zerop (val
))
6984 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6985 allow_non_constant
, addr
,
6986 non_constant_p
, overflow_p
);
6987 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6988 allow_non_constant
, addr
,
6989 non_constant_p
, overflow_p
);
6992 /* Subroutine of cxx_eval_constant_expression.
6993 Attempt to reduce a reference to an array slot. */
6996 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6997 bool allow_non_constant
, bool addr
,
6998 bool *non_constant_p
, bool *overflow_p
)
7000 tree oldary
= TREE_OPERAND (t
, 0);
7001 tree ary
= cxx_eval_constant_expression (call
, oldary
,
7002 allow_non_constant
, addr
,
7003 non_constant_p
, overflow_p
);
7007 unsigned len
, elem_nchars
= 1;
7008 if (*non_constant_p
)
7010 oldidx
= TREE_OPERAND (t
, 1);
7011 index
= cxx_eval_constant_expression (call
, oldidx
,
7012 allow_non_constant
, false,
7013 non_constant_p
, overflow_p
);
7014 VERIFY_CONSTANT (index
);
7015 if (addr
&& ary
== oldary
&& index
== oldidx
)
7018 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
7019 elem_type
= TREE_TYPE (TREE_TYPE (ary
));
7020 if (TREE_CODE (ary
) == CONSTRUCTOR
)
7021 len
= CONSTRUCTOR_NELTS (ary
);
7022 else if (TREE_CODE (ary
) == STRING_CST
)
7024 elem_nchars
= (TYPE_PRECISION (elem_type
)
7025 / TYPE_PRECISION (char_type_node
));
7026 len
= (unsigned) TREE_STRING_LENGTH (ary
) / elem_nchars
;
7030 /* We can't do anything with other tree codes, so use
7031 VERIFY_CONSTANT to complain and fail. */
7032 VERIFY_CONSTANT (ary
);
7035 if (compare_tree_int (index
, len
) >= 0)
7037 if (tree_int_cst_lt (index
, array_type_nelts_top (TREE_TYPE (ary
))))
7039 /* If it's within the array bounds but doesn't have an explicit
7040 initializer, it's value-initialized. */
7041 tree val
= build_value_init (elem_type
, tf_warning_or_error
);
7042 return cxx_eval_constant_expression (call
, val
,
7043 allow_non_constant
, addr
,
7044 non_constant_p
, overflow_p
);
7047 if (!allow_non_constant
)
7048 error ("array subscript out of bound");
7049 *non_constant_p
= true;
7052 else if (tree_int_cst_lt (index
, integer_zero_node
))
7054 if (!allow_non_constant
)
7055 error ("negative array subscript");
7056 *non_constant_p
= true;
7059 i
= tree_low_cst (index
, 0);
7060 if (TREE_CODE (ary
) == CONSTRUCTOR
)
7061 return (*CONSTRUCTOR_ELTS (ary
))[i
].value
;
7062 else if (elem_nchars
== 1)
7063 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
7064 TREE_STRING_POINTER (ary
)[i
]);
7067 tree type
= cv_unqualified (TREE_TYPE (TREE_TYPE (ary
)));
7068 return native_interpret_expr (type
, (const unsigned char *)
7069 TREE_STRING_POINTER (ary
)
7070 + i
* elem_nchars
, elem_nchars
);
7072 /* Don't VERIFY_CONSTANT here. */
7075 /* Subroutine of cxx_eval_constant_expression.
7076 Attempt to reduce a field access of a value of class type. */
7079 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
7080 bool allow_non_constant
, bool addr
,
7081 bool *non_constant_p
, bool *overflow_p
)
7083 unsigned HOST_WIDE_INT i
;
7086 tree part
= TREE_OPERAND (t
, 1);
7087 tree orig_whole
= TREE_OPERAND (t
, 0);
7088 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
7089 allow_non_constant
, addr
,
7090 non_constant_p
, overflow_p
);
7091 if (whole
== orig_whole
)
7094 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
7095 whole
, part
, NULL_TREE
);
7096 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7098 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
7100 if (!allow_non_constant
)
7101 error ("%qE is not a constant expression", orig_whole
);
7102 *non_constant_p
= true;
7104 if (DECL_MUTABLE_P (part
))
7106 if (!allow_non_constant
)
7107 error ("mutable %qD is not usable in a constant expression", part
);
7108 *non_constant_p
= true;
7110 if (*non_constant_p
)
7112 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
7117 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
7118 && CONSTRUCTOR_NELTS (whole
) > 0)
7120 /* DR 1188 says we don't have to deal with this. */
7121 if (!allow_non_constant
)
7122 error ("accessing %qD member instead of initialized %qD member in "
7123 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
7124 *non_constant_p
= true;
7128 /* If there's no explicit init for this field, it's value-initialized. */
7129 value
= build_value_init (TREE_TYPE (t
), tf_warning_or_error
);
7130 return cxx_eval_constant_expression (call
, value
,
7131 allow_non_constant
, addr
,
7132 non_constant_p
, overflow_p
);
7135 /* Subroutine of cxx_eval_constant_expression.
7136 Attempt to reduce a field access of a value of class type that is
7137 expressed as a BIT_FIELD_REF. */
7140 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
7141 bool allow_non_constant
, bool addr
,
7142 bool *non_constant_p
, bool *overflow_p
)
7144 tree orig_whole
= TREE_OPERAND (t
, 0);
7145 tree retval
, fldval
, utype
, mask
;
7146 bool fld_seen
= false;
7147 HOST_WIDE_INT istart
, isize
;
7148 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
7149 allow_non_constant
, addr
,
7150 non_constant_p
, overflow_p
);
7151 tree start
, field
, value
;
7152 unsigned HOST_WIDE_INT i
;
7154 if (whole
== orig_whole
)
7156 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7158 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
7160 if (!allow_non_constant
)
7161 error ("%qE is not a constant expression", orig_whole
);
7162 *non_constant_p
= true;
7164 if (*non_constant_p
)
7167 start
= TREE_OPERAND (t
, 2);
7168 istart
= tree_low_cst (start
, 0);
7169 isize
= tree_low_cst (TREE_OPERAND (t
, 1), 0);
7170 utype
= TREE_TYPE (t
);
7171 if (!TYPE_UNSIGNED (utype
))
7172 utype
= build_nonstandard_integer_type (TYPE_PRECISION (utype
), 1);
7173 retval
= build_int_cst (utype
, 0);
7174 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
7176 tree bitpos
= bit_position (field
);
7177 if (bitpos
== start
&& DECL_SIZE (field
) == TREE_OPERAND (t
, 1))
7179 if (TREE_CODE (TREE_TYPE (field
)) == INTEGER_TYPE
7180 && TREE_CODE (value
) == INTEGER_CST
7181 && host_integerp (bitpos
, 0)
7182 && host_integerp (DECL_SIZE (field
), 0))
7184 HOST_WIDE_INT bit
= tree_low_cst (bitpos
, 0);
7185 HOST_WIDE_INT sz
= tree_low_cst (DECL_SIZE (field
), 0);
7186 HOST_WIDE_INT shift
;
7187 if (bit
>= istart
&& bit
+ sz
<= istart
+ isize
)
7189 fldval
= fold_convert (utype
, value
);
7190 mask
= build_int_cst_type (utype
, -1);
7191 mask
= fold_build2 (LSHIFT_EXPR
, utype
, mask
,
7192 size_int (TYPE_PRECISION (utype
) - sz
));
7193 mask
= fold_build2 (RSHIFT_EXPR
, utype
, mask
,
7194 size_int (TYPE_PRECISION (utype
) - sz
));
7195 fldval
= fold_build2 (BIT_AND_EXPR
, utype
, fldval
, mask
);
7196 shift
= bit
- istart
;
7197 if (BYTES_BIG_ENDIAN
)
7198 shift
= TYPE_PRECISION (utype
) - shift
- sz
;
7199 fldval
= fold_build2 (LSHIFT_EXPR
, utype
, fldval
,
7201 retval
= fold_build2 (BIT_IOR_EXPR
, utype
, retval
, fldval
);
7207 return fold_convert (TREE_TYPE (t
), retval
);
7209 return error_mark_node
;
7212 /* Subroutine of cxx_eval_constant_expression.
7213 Evaluate a short-circuited logical expression T in the context
7214 of a given constexpr CALL. BAILOUT_VALUE is the value for
7215 early return. CONTINUE_VALUE is used here purely for
7216 sanity check purposes. */
7219 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
7220 tree bailout_value
, tree continue_value
,
7221 bool allow_non_constant
, bool addr
,
7222 bool *non_constant_p
, bool *overflow_p
)
7225 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7226 allow_non_constant
, addr
,
7227 non_constant_p
, overflow_p
);
7228 VERIFY_CONSTANT (lhs
);
7229 if (tree_int_cst_equal (lhs
, bailout_value
))
7231 gcc_assert (tree_int_cst_equal (lhs
, continue_value
));
7232 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7233 allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7234 VERIFY_CONSTANT (r
);
7238 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
7239 CONSTRUCTOR elements to initialize (part of) an object containing that
7240 field. Return a pointer to the constructor_elt corresponding to the
7241 initialization of the field. */
7243 static constructor_elt
*
7244 base_field_constructor_elt (vec
<constructor_elt
, va_gc
> *v
, tree ref
)
7246 tree aggr
= TREE_OPERAND (ref
, 0);
7247 tree field
= TREE_OPERAND (ref
, 1);
7249 constructor_elt
*ce
;
7251 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
7253 if (TREE_CODE (aggr
) == COMPONENT_REF
)
7255 constructor_elt
*base_ce
7256 = base_field_constructor_elt (v
, aggr
);
7257 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
7260 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
7261 if (ce
->index
== field
)
7268 /* Subroutine of cxx_eval_constant_expression.
7269 The expression tree T denotes a C-style array or a C-style
7270 aggregate. Reduce it to a constant expression. */
7273 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
7274 bool allow_non_constant
, bool addr
,
7275 bool *non_constant_p
, bool *overflow_p
)
7277 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
7278 vec
<constructor_elt
, va_gc
> *n
;
7279 vec_alloc (n
, vec_safe_length (v
));
7280 constructor_elt
*ce
;
7282 bool changed
= false;
7283 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
7284 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
7286 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
7287 allow_non_constant
, addr
,
7288 non_constant_p
, overflow_p
);
7289 /* Don't VERIFY_CONSTANT here. */
7290 if (allow_non_constant
&& *non_constant_p
)
7292 if (elt
!= ce
->value
)
7294 if (ce
->index
&& TREE_CODE (ce
->index
) == COMPONENT_REF
)
7296 /* This is an initialization of a vfield inside a base
7297 subaggregate that we already initialized; push this
7298 initialization into the previous initialization. */
7299 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
7303 && (TREE_CODE (ce
->index
) == NOP_EXPR
7304 || TREE_CODE (ce
->index
) == POINTER_PLUS_EXPR
))
7306 /* This is an initializer for an empty base; now that we've
7307 checked that it's constant, we can ignore it. */
7308 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (ce
->index
))));
7311 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
7313 if (*non_constant_p
|| !changed
)
7319 t
= build_constructor (TREE_TYPE (t
), n
);
7320 TREE_CONSTANT (t
) = true;
7321 if (TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
7326 /* Subroutine of cxx_eval_constant_expression.
7327 The expression tree T is a VEC_INIT_EXPR which denotes the desired
7328 initialization of a non-static data member of array type. Reduce it to a
7331 Note that apart from value-initialization (when VALUE_INIT is true),
7332 this is only intended to support value-initialization and the
7333 initializations done by defaulted constructors for classes with
7334 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
7335 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
7336 for the copy/move constructor. */
7339 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
7340 bool value_init
, bool allow_non_constant
, bool addr
,
7341 bool *non_constant_p
, bool *overflow_p
)
7343 tree elttype
= TREE_TYPE (atype
);
7344 int max
= tree_low_cst (array_type_nelts (atype
), 0);
7345 vec
<constructor_elt
, va_gc
> *n
;
7346 vec_alloc (n
, max
+ 1);
7347 bool pre_init
= false;
7350 /* For the default constructor, build up a call to the default
7351 constructor of the element type. We only need to handle class types
7352 here, as for a constructor to be constexpr, all members must be
7353 initialized, which for a defaulted default constructor means they must
7354 be of a class type with a constexpr default constructor. */
7355 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7356 /* We only do this at the lowest level. */;
7357 else if (value_init
)
7359 init
= build_value_init (elttype
, tf_warning_or_error
);
7360 init
= cxx_eval_constant_expression
7361 (call
, init
, allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7366 vec
<tree
, va_gc
> *argvec
= make_tree_vector ();
7367 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7368 &argvec
, elttype
, LOOKUP_NORMAL
,
7369 tf_warning_or_error
);
7370 release_tree_vector (argvec
);
7371 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
7372 addr
, non_constant_p
, overflow_p
);
7376 if (*non_constant_p
&& !allow_non_constant
)
7379 for (i
= 0; i
<= max
; ++i
)
7381 tree idx
= build_int_cst (size_type_node
, i
);
7383 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7385 /* A multidimensional array; recurse. */
7386 if (value_init
|| init
== NULL_TREE
)
7387 eltinit
= NULL_TREE
;
7389 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7390 tf_warning_or_error
);
7391 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
7392 allow_non_constant
, addr
,
7393 non_constant_p
, overflow_p
);
7397 /* Initializing an element using value or default initialization
7398 we just pre-built above. */
7402 eltinit
= unshare_expr (init
);
7406 /* Copying an element. */
7407 vec
<tree
, va_gc
> *argvec
;
7408 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7409 (atype
, TREE_TYPE (init
)));
7410 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7411 tf_warning_or_error
);
7412 if (!real_lvalue_p (init
))
7413 eltinit
= move (eltinit
);
7414 argvec
= make_tree_vector ();
7415 argvec
->quick_push (eltinit
);
7416 eltinit
= (build_special_member_call
7417 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
7418 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
7419 release_tree_vector (argvec
);
7420 eltinit
= cxx_eval_constant_expression
7421 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7423 if (*non_constant_p
&& !allow_non_constant
)
7425 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
7428 if (!*non_constant_p
)
7430 init
= build_constructor (atype
, n
);
7431 TREE_CONSTANT (init
) = true;
7441 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
7442 bool allow_non_constant
, bool addr
,
7443 bool *non_constant_p
, bool *overflow_p
)
7445 tree atype
= TREE_TYPE (t
);
7446 tree init
= VEC_INIT_EXPR_INIT (t
);
7447 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
7448 VEC_INIT_EXPR_VALUE_INIT (t
),
7449 allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7450 if (*non_constant_p
)
7456 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7457 match. We want to be less strict for simple *& folding; if we have a
7458 non-const temporary that we access through a const pointer, that should
7459 work. We handle this here rather than change fold_indirect_ref_1
7460 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7461 don't really make sense outside of constant expression evaluation. Also
7462 we want to allow folding to COMPONENT_REF, which could cause trouble
7463 with TBAA in fold_indirect_ref_1.
7465 Try to keep this function synced with fold_indirect_ref_1. */
7468 cxx_fold_indirect_ref (location_t loc
, tree type
, tree op0
, bool *empty_base
)
7474 subtype
= TREE_TYPE (sub
);
7475 if (!POINTER_TYPE_P (subtype
))
7478 if (TREE_CODE (sub
) == ADDR_EXPR
)
7480 tree op
= TREE_OPERAND (sub
, 0);
7481 tree optype
= TREE_TYPE (op
);
7483 /* *&CONST_DECL -> to the value of the const decl. */
7484 if (TREE_CODE (op
) == CONST_DECL
)
7485 return DECL_INITIAL (op
);
7486 /* *&p => p; make sure to handle *&"str"[cst] here. */
7487 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
7489 tree fop
= fold_read_from_constant_string (op
);
7495 /* *(foo *)&fooarray => fooarray[0] */
7496 else if (TREE_CODE (optype
) == ARRAY_TYPE
7497 && (same_type_ignoring_top_level_qualifiers_p
7498 (type
, TREE_TYPE (optype
))))
7500 tree type_domain
= TYPE_DOMAIN (optype
);
7501 tree min_val
= size_zero_node
;
7502 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7503 min_val
= TYPE_MIN_VALUE (type_domain
);
7504 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
7505 NULL_TREE
, NULL_TREE
);
7507 /* *(foo *)&complexfoo => __real__ complexfoo */
7508 else if (TREE_CODE (optype
) == COMPLEX_TYPE
7509 && (same_type_ignoring_top_level_qualifiers_p
7510 (type
, TREE_TYPE (optype
))))
7511 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
7512 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7513 else if (TREE_CODE (optype
) == VECTOR_TYPE
7514 && (same_type_ignoring_top_level_qualifiers_p
7515 (type
, TREE_TYPE (optype
))))
7517 tree part_width
= TYPE_SIZE (type
);
7518 tree index
= bitsize_int (0);
7519 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
7521 /* Also handle conversion to an empty base class, which
7522 is represented with a NOP_EXPR. */
7523 else if (is_empty_class (type
)
7524 && CLASS_TYPE_P (optype
)
7525 && DERIVED_FROM_P (type
, optype
))
7530 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7531 else if (RECORD_OR_UNION_TYPE_P (optype
))
7533 tree field
= TYPE_FIELDS (optype
);
7534 for (; field
; field
= DECL_CHAIN (field
))
7535 if (TREE_CODE (field
) == FIELD_DECL
7536 && integer_zerop (byte_position (field
))
7537 && (same_type_ignoring_top_level_qualifiers_p
7538 (TREE_TYPE (field
), type
)))
7540 return fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
7545 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
7546 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
7548 tree op00
= TREE_OPERAND (sub
, 0);
7549 tree op01
= TREE_OPERAND (sub
, 1);
7552 if (TREE_CODE (op00
) == ADDR_EXPR
)
7555 op00
= TREE_OPERAND (op00
, 0);
7556 op00type
= TREE_TYPE (op00
);
7558 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7559 if (TREE_CODE (op00type
) == VECTOR_TYPE
7560 && (same_type_ignoring_top_level_qualifiers_p
7561 (type
, TREE_TYPE (op00type
))))
7563 HOST_WIDE_INT offset
= tree_low_cst (op01
, 0);
7564 tree part_width
= TYPE_SIZE (type
);
7565 unsigned HOST_WIDE_INT part_widthi
= tree_low_cst (part_width
, 0)/BITS_PER_UNIT
;
7566 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
7567 tree index
= bitsize_int (indexi
);
7569 if (offset
/ part_widthi
< TYPE_VECTOR_SUBPARTS (op00type
))
7570 return fold_build3_loc (loc
,
7571 BIT_FIELD_REF
, type
, op00
,
7575 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7576 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
7577 && (same_type_ignoring_top_level_qualifiers_p
7578 (type
, TREE_TYPE (op00type
))))
7580 tree size
= TYPE_SIZE_UNIT (type
);
7581 if (tree_int_cst_equal (size
, op01
))
7582 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
7584 /* ((foo *)&fooarray)[1] => fooarray[1] */
7585 else if (TREE_CODE (op00type
) == ARRAY_TYPE
7586 && (same_type_ignoring_top_level_qualifiers_p
7587 (type
, TREE_TYPE (op00type
))))
7589 tree type_domain
= TYPE_DOMAIN (op00type
);
7590 tree min_val
= size_zero_node
;
7591 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7592 min_val
= TYPE_MIN_VALUE (type_domain
);
7593 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
7594 TYPE_SIZE_UNIT (type
));
7595 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
7596 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
7597 NULL_TREE
, NULL_TREE
);
7599 /* Also handle conversion to an empty base class, which
7600 is represented with a NOP_EXPR. */
7601 else if (is_empty_class (type
)
7602 && CLASS_TYPE_P (op00type
)
7603 && DERIVED_FROM_P (type
, op00type
))
7608 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7609 else if (RECORD_OR_UNION_TYPE_P (op00type
))
7611 tree field
= TYPE_FIELDS (op00type
);
7612 for (; field
; field
= DECL_CHAIN (field
))
7613 if (TREE_CODE (field
) == FIELD_DECL
7614 && tree_int_cst_equal (byte_position (field
), op01
)
7615 && (same_type_ignoring_top_level_qualifiers_p
7616 (TREE_TYPE (field
), type
)))
7618 return fold_build3 (COMPONENT_REF
, type
, op00
,
7625 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
7626 else if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
7627 && (same_type_ignoring_top_level_qualifiers_p
7628 (type
, TREE_TYPE (TREE_TYPE (subtype
)))))
7631 tree min_val
= size_zero_node
;
7632 tree newsub
= cxx_fold_indirect_ref (loc
, TREE_TYPE (subtype
), sub
, NULL
);
7636 sub
= build1_loc (loc
, INDIRECT_REF
, TREE_TYPE (subtype
), sub
);
7637 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
7638 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7639 min_val
= TYPE_MIN_VALUE (type_domain
);
7640 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
7648 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
7649 bool allow_non_constant
, bool addr
,
7650 bool *non_constant_p
, bool *overflow_p
)
7652 tree orig_op0
= TREE_OPERAND (t
, 0);
7653 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
7654 /*addr*/false, non_constant_p
, overflow_p
);
7655 bool empty_base
= false;
7658 /* Don't VERIFY_CONSTANT here. */
7659 if (*non_constant_p
)
7662 r
= cxx_fold_indirect_ref (EXPR_LOCATION (t
), TREE_TYPE (t
), op0
,
7666 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
7667 addr
, non_constant_p
, overflow_p
);
7672 if (TREE_CODE (sub
) == ADDR_EXPR
)
7674 /* We couldn't fold to a constant value. Make sure it's not
7675 something we should have been able to fold. */
7676 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7677 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
7678 /* DR 1188 says we don't have to deal with this. */
7679 if (!allow_non_constant
)
7680 error ("accessing value of %qE through a %qT glvalue in a "
7681 "constant expression", build_fold_indirect_ref (sub
),
7683 *non_constant_p
= true;
7688 /* If we're pulling out the value of an empty base, make sure
7689 that the whole object is constant and then return an empty
7693 VERIFY_CONSTANT (r
);
7694 r
= build_constructor (TREE_TYPE (t
), NULL
);
7695 TREE_CONSTANT (r
) = true;
7700 if (addr
&& op0
!= orig_op0
)
7701 return build1 (INDIRECT_REF
, TREE_TYPE (t
), op0
);
7703 VERIFY_CONSTANT (t
);
7709 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7710 Shared between potential_constant_expression and
7711 cxx_eval_constant_expression. */
7714 non_const_var_error (tree r
)
7716 tree type
= TREE_TYPE (r
);
7717 error ("the value of %qD is not usable in a constant "
7719 /* Avoid error cascade. */
7720 if (DECL_INITIAL (r
) == error_mark_node
)
7722 if (DECL_DECLARED_CONSTEXPR_P (r
))
7723 inform (DECL_SOURCE_LOCATION (r
),
7724 "%qD used in its own initializer", r
);
7725 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7727 if (!CP_TYPE_CONST_P (type
))
7728 inform (DECL_SOURCE_LOCATION (r
),
7729 "%q#D is not const", r
);
7730 else if (CP_TYPE_VOLATILE_P (type
))
7731 inform (DECL_SOURCE_LOCATION (r
),
7732 "%q#D is volatile", r
);
7733 else if (!DECL_INITIAL (r
)
7734 || !TREE_CONSTANT (DECL_INITIAL (r
)))
7735 inform (DECL_SOURCE_LOCATION (r
),
7736 "%qD was not initialized with a constant "
7743 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
7744 inform (DECL_SOURCE_LOCATION (r
),
7745 "%qD was not declared %<constexpr%>", r
);
7747 inform (DECL_SOURCE_LOCATION (r
),
7748 "%qD does not have integral or enumeration type",
7753 /* Evaluate VEC_PERM_EXPR (v1, v2, mask). */
7755 cxx_eval_vec_perm_expr (const constexpr_call
*call
, tree t
,
7756 bool allow_non_constant
, bool addr
,
7757 bool *non_constant_p
, bool *overflow_p
)
7762 tree elttype
= TREE_TYPE (t
);
7764 for (i
= 0; i
< 3; i
++)
7766 args
[i
] = cxx_eval_constant_expression (call
, TREE_OPERAND (t
, i
),
7767 allow_non_constant
, addr
,
7768 non_constant_p
, overflow_p
);
7769 if (*non_constant_p
)
7773 gcc_assert (TREE_CODE (TREE_TYPE (args
[0])) == VECTOR_TYPE
);
7774 gcc_assert (TREE_CODE (TREE_TYPE (args
[1])) == VECTOR_TYPE
);
7775 gcc_assert (TREE_CODE (TREE_TYPE (args
[2])) == VECTOR_TYPE
);
7777 val
= fold_ternary_loc (EXPR_LOCATION (t
), VEC_PERM_EXPR
, elttype
,
7778 args
[0], args
[1], args
[2]);
7779 if (val
!= NULL_TREE
)
7786 /* Attempt to reduce the expression T to a constant value.
7787 On failure, issue diagnostic and return error_mark_node. */
7788 /* FIXME unify with c_fully_fold */
7791 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
7792 bool allow_non_constant
, bool addr
,
7793 bool *non_constant_p
, bool *overflow_p
)
7797 if (t
== error_mark_node
)
7799 *non_constant_p
= true;
7802 if (CONSTANT_CLASS_P (t
))
7804 if (TREE_CODE (t
) == PTRMEM_CST
)
7805 t
= cplus_expand_constant (t
);
7806 else if (TREE_OVERFLOW (t
) && (!flag_permissive
|| allow_non_constant
))
7810 if (TREE_CODE (t
) != NOP_EXPR
7811 && reduced_constant_expression_p (t
))
7814 switch (TREE_CODE (t
))
7819 /* else fall through. */
7821 r
= integral_constant_value (t
);
7822 if (TREE_CODE (r
) == TARGET_EXPR
7823 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
7824 r
= TARGET_EXPR_INITIAL (r
);
7827 if (!allow_non_constant
)
7828 non_const_var_error (r
);
7829 *non_constant_p
= true;
7839 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
7841 if (DECL_ARTIFICIAL (t
) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t
)))
7843 if (!allow_non_constant
)
7844 sorry ("use of the value of the object being constructed "
7845 "in a constant expression");
7846 *non_constant_p
= true;
7849 r
= lookup_parameter_binding (call
, t
);
7852 /* Defer in case this is only used for its type. */;
7855 if (!allow_non_constant
)
7856 error ("%qE is not a constant expression", t
);
7857 *non_constant_p
= true;
7862 case AGGR_INIT_EXPR
:
7863 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
7864 non_constant_p
, overflow_p
);
7868 if (!literal_type_p (TREE_TYPE (t
)))
7870 if (!allow_non_constant
)
7872 error ("temporary of non-literal type %qT in a "
7873 "constant expression", TREE_TYPE (t
));
7874 explain_non_literal_class (TREE_TYPE (t
));
7876 *non_constant_p
= true;
7879 /* else fall through. */
7881 /* Pass false for 'addr' because these codes indicate
7882 initialization of a temporary. */
7883 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7884 allow_non_constant
, false,
7885 non_constant_p
, overflow_p
);
7886 if (!*non_constant_p
)
7887 /* Adjust the type of the result to the type of the temporary. */
7888 r
= adjust_temp_type (TREE_TYPE (t
), r
);
7892 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7893 allow_non_constant
, addr
,
7894 non_constant_p
, overflow_p
);
7898 case NON_LVALUE_EXPR
:
7899 case TRY_CATCH_EXPR
:
7900 case CLEANUP_POINT_EXPR
:
7901 case MUST_NOT_THROW_EXPR
:
7903 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7904 allow_non_constant
, addr
,
7905 non_constant_p
, overflow_p
);
7908 /* These differ from cxx_eval_unary_expression in that this doesn't
7909 check for a constant operand or result; an address can be
7910 constant without its operand being, and vice versa. */
7912 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
7913 non_constant_p
, overflow_p
);
7918 tree oldop
= TREE_OPERAND (t
, 0);
7919 tree op
= cxx_eval_constant_expression (call
, oldop
,
7922 non_constant_p
, overflow_p
);
7923 /* Don't VERIFY_CONSTANT here. */
7924 if (*non_constant_p
)
7926 /* This function does more aggressive folding than fold itself. */
7927 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
7928 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
7936 case FIX_TRUNC_EXPR
:
7941 case TRUTH_NOT_EXPR
:
7942 case FIXED_CONVERT_EXPR
:
7943 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
7944 non_constant_p
, overflow_p
);
7948 if (SIZEOF_EXPR_TYPE_P (t
))
7949 r
= cxx_sizeof_or_alignof_type (TREE_TYPE (TREE_OPERAND (t
, 0)),
7950 SIZEOF_EXPR
, false);
7951 else if (TYPE_P (TREE_OPERAND (t
, 0)))
7952 r
= cxx_sizeof_or_alignof_type (TREE_OPERAND (t
, 0), SIZEOF_EXPR
,
7955 r
= cxx_sizeof_or_alignof_expr (TREE_OPERAND (t
, 0), SIZEOF_EXPR
,
7957 if (r
== error_mark_node
)
7959 VERIFY_CONSTANT (r
);
7964 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7965 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7966 introduced by build_call_a. */
7967 tree op0
= TREE_OPERAND (t
, 0);
7968 tree op1
= TREE_OPERAND (t
, 1);
7970 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7971 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7972 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7973 addr
, non_constant_p
, overflow_p
);
7976 /* Check that the LHS is constant and then discard it. */
7977 cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7978 false, non_constant_p
, overflow_p
);
7979 op1
= TREE_OPERAND (t
, 1);
7980 r
= cxx_eval_constant_expression (call
, op1
, allow_non_constant
,
7981 addr
, non_constant_p
, overflow_p
);
7986 case POINTER_PLUS_EXPR
:
7990 case TRUNC_DIV_EXPR
:
7992 case FLOOR_DIV_EXPR
:
7993 case ROUND_DIV_EXPR
:
7994 case TRUNC_MOD_EXPR
:
7996 case ROUND_MOD_EXPR
:
7998 case EXACT_DIV_EXPR
:
8008 case TRUTH_XOR_EXPR
:
8015 case UNORDERED_EXPR
:
8025 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
8026 non_constant_p
, overflow_p
);
8029 /* fold can introduce non-IF versions of these; still treat them as
8030 short-circuiting. */
8031 case TRUTH_AND_EXPR
:
8032 case TRUTH_ANDIF_EXPR
:
8033 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
8035 allow_non_constant
, addr
,
8036 non_constant_p
, overflow_p
);
8040 case TRUTH_ORIF_EXPR
:
8041 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
8043 allow_non_constant
, addr
,
8044 non_constant_p
, overflow_p
);
8048 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
8049 non_constant_p
, overflow_p
);
8053 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
8054 non_constant_p
, overflow_p
);
8058 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
8059 non_constant_p
, overflow_p
);
8064 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
8065 non_constant_p
, overflow_p
);
8069 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
8070 non_constant_p
, overflow_p
);
8074 /* We can get this in a defaulted constructor for a class with a
8075 non-static data member of array type. Either the initializer will
8076 be NULL, meaning default-initialization, or it will be an lvalue
8077 or xvalue of the same type, meaning direct-initialization from the
8078 corresponding member. */
8079 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
8080 non_constant_p
, overflow_p
);
8084 r
= cxx_eval_vec_perm_expr (call
, t
, allow_non_constant
, addr
,
8085 non_constant_p
, overflow_p
);
8089 case VIEW_CONVERT_EXPR
:
8092 tree oldop
= TREE_OPERAND (t
, 0);
8093 tree op
= cxx_eval_constant_expression (call
, oldop
,
8094 allow_non_constant
, addr
,
8095 non_constant_p
, overflow_p
);
8096 if (*non_constant_p
)
8099 /* We didn't fold at the top so we could check for ptr-int
8102 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), op
);
8103 /* Conversion of an out-of-range value has implementation-defined
8104 behavior; the language considers it different from arithmetic
8105 overflow, which is undefined. */
8106 if (TREE_OVERFLOW_P (r
) && !TREE_OVERFLOW_P (op
))
8107 TREE_OVERFLOW (r
) = false;
8111 case EMPTY_CLASS_EXPR
:
8112 /* This is good enough for a function argument that might not get
8113 used, and they can't do anything with it, so just return it. */
8117 case PREINCREMENT_EXPR
:
8118 case POSTINCREMENT_EXPR
:
8119 case PREDECREMENT_EXPR
:
8120 case POSTDECREMENT_EXPR
:
8124 case VEC_DELETE_EXPR
:
8128 /* GCC internal stuff. */
8131 case WITH_CLEANUP_EXPR
:
8132 case STATEMENT_LIST
:
8134 case NON_DEPENDENT_EXPR
:
8138 if (!allow_non_constant
)
8139 error_at (EXPR_LOC_OR_HERE (t
),
8140 "expression %qE is not a constant-expression", t
);
8141 *non_constant_p
= true;
8145 internal_error ("unexpected expression %qE of kind %s", t
,
8146 tree_code_name
[TREE_CODE (t
)]);
8147 *non_constant_p
= true;
8151 if (r
== error_mark_node
)
8152 *non_constant_p
= true;
8154 if (*non_constant_p
)
8161 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
8163 bool non_constant_p
= false;
8164 bool overflow_p
= false;
8165 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
8166 false, &non_constant_p
, &overflow_p
);
8168 verify_constant (r
, allow_non_constant
, &non_constant_p
, &overflow_p
);
8170 if (TREE_CODE (t
) != CONSTRUCTOR
8171 && cp_has_mutable_p (TREE_TYPE (t
)))
8173 /* We allow a mutable type if the original expression was a
8174 CONSTRUCTOR so that we can do aggregate initialization of
8175 constexpr variables. */
8176 if (!allow_non_constant
)
8177 error ("%qT cannot be the type of a complete constant expression "
8178 "because it has mutable sub-objects", TREE_TYPE (t
));
8179 non_constant_p
= true;
8182 /* Technically we should check this for all subexpressions, but that
8183 runs into problems with our internal representation of pointer
8184 subtraction and the 5.19 rules are still in flux. */
8185 if (CONVERT_EXPR_CODE_P (TREE_CODE (r
))
8186 && ARITHMETIC_TYPE_P (TREE_TYPE (r
))
8187 && TREE_CODE (TREE_OPERAND (r
, 0)) == ADDR_EXPR
)
8189 if (!allow_non_constant
)
8190 error ("conversion from pointer type %qT "
8191 "to arithmetic type %qT in a constant-expression",
8192 TREE_TYPE (TREE_OPERAND (r
, 0)), TREE_TYPE (r
));
8193 non_constant_p
= true;
8196 if (!non_constant_p
&& overflow_p
)
8197 non_constant_p
= true;
8199 if (non_constant_p
&& !allow_non_constant
)
8200 return error_mark_node
;
8201 else if (non_constant_p
&& TREE_CONSTANT (r
))
8203 /* This isn't actually constant, so unset TREE_CONSTANT. */
8206 else if (TREE_CODE (r
) == CONSTRUCTOR
)
8207 r
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (r
), r
);
8209 r
= build_nop (TREE_TYPE (r
), r
);
8210 TREE_CONSTANT (r
) = false;
8212 else if (non_constant_p
|| r
== t
)
8215 if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
8217 if (TREE_CODE (t
) == TARGET_EXPR
8218 && TARGET_EXPR_INITIAL (t
) == r
)
8222 r
= get_target_expr (r
);
8223 TREE_CONSTANT (r
) = true;
8231 /* Returns true if T is a valid subexpression of a constant expression,
8232 even if it isn't itself a constant expression. */
8235 is_sub_constant_expr (tree t
)
8237 bool non_constant_p
= false;
8238 bool overflow_p
= false;
8239 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
,
8241 return !non_constant_p
&& !overflow_p
;
8244 /* If T represents a constant expression returns its reduced value.
8245 Otherwise return error_mark_node. If T is dependent, then
8249 cxx_constant_value (tree t
)
8251 return cxx_eval_outermost_constant_expr (t
, false);
8254 /* If T is a constant expression, returns its reduced value.
8255 Otherwise, if T does not have TREE_CONSTANT set, returns T.
8256 Otherwise, returns a version of T without TREE_CONSTANT. */
8259 maybe_constant_value (tree t
)
8263 if (type_dependent_expression_p (t
)
8264 || type_unknown_p (t
)
8265 || BRACE_ENCLOSED_INITIALIZER_P (t
)
8266 || !potential_constant_expression (t
)
8267 || value_dependent_expression_p (t
))
8269 if (TREE_OVERFLOW_P (t
))
8271 t
= build_nop (TREE_TYPE (t
), t
);
8272 TREE_CONSTANT (t
) = false;
8277 r
= cxx_eval_outermost_constant_expr (t
, true);
8278 #ifdef ENABLE_CHECKING
8279 /* cp_tree_equal looks through NOPs, so allow them. */
8281 || CONVERT_EXPR_P (t
)
8282 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
8283 || !cp_tree_equal (r
, t
));
8288 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
8289 than wrapped in a TARGET_EXPR. */
8292 maybe_constant_init (tree t
)
8294 t
= maybe_constant_value (t
);
8295 if (TREE_CODE (t
) == TARGET_EXPR
)
8297 tree init
= TARGET_EXPR_INITIAL (t
);
8298 if (TREE_CODE (init
) == CONSTRUCTOR
)
8305 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
8306 /* Return true if the object referred to by REF has automatic or thread
8309 enum { ck_ok
, ck_bad
, ck_unknown
};
8311 check_automatic_or_tls (tree ref
)
8313 enum machine_mode mode
;
8314 HOST_WIDE_INT bitsize
, bitpos
;
8316 int volatilep
= 0, unsignedp
= 0;
8317 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
8318 &mode
, &unsignedp
, &volatilep
, false);
8321 /* If there isn't a decl in the middle, we don't know the linkage here,
8322 and this isn't a constant expression anyway. */
8325 dk
= decl_storage_duration (decl
);
8326 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
8330 /* Return true if T denotes a potentially constant expression. Issue
8331 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
8332 an lvalue-rvalue conversion is implied.
8334 C++0x [expr.const] used to say
8336 6 An expression is a potential constant expression if it is
8337 a constant expression where all occurences of function
8338 parameters are replaced by arbitrary constant expressions
8339 of the appropriate type.
8341 2 A conditional expression is a constant expression unless it
8342 involves one of the following as a potentially evaluated
8343 subexpression (3.2), but subexpressions of logical AND (5.14),
8344 logical OR (5.15), and conditional (5.16) operations that are
8345 not evaluated are not considered. */
8348 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
8350 enum { any
= false, rval
= true };
8354 if (t
== error_mark_node
)
8358 if (TREE_THIS_VOLATILE (t
))
8360 if (flags
& tf_error
)
8361 error ("expression %qE has side-effects", t
);
8364 if (CONSTANT_CLASS_P (t
))
8367 switch (TREE_CODE (t
))
8373 case TEMPLATE_ID_EXPR
:
8380 case TEMPLATE_PARM_INDEX
:
8382 case IDENTIFIER_NODE
:
8383 case USERDEF_LITERAL
:
8384 /* We can see a FIELD_DECL in a pointer-to-member expression. */
8390 case AGGR_INIT_EXPR
:
8392 /* -- an invocation of a function other than a constexpr function
8393 or a constexpr constructor. */
8395 tree fun
= get_function_named_in_call (t
);
8396 const int nargs
= call_expr_nargs (t
);
8399 if (is_overloaded_fn (fun
))
8401 if (TREE_CODE (fun
) == FUNCTION_DECL
)
8403 if (builtin_valid_in_constant_expr_p (fun
))
8405 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
8406 /* Allow any built-in function; if the expansion
8407 isn't constant, we'll deal with that then. */
8408 && !is_builtin_fn (fun
))
8410 if (flags
& tf_error
)
8412 error_at (EXPR_LOC_OR_HERE (t
),
8413 "call to non-constexpr function %qD", fun
);
8414 explain_invalid_constexpr_fn (fun
);
8418 /* A call to a non-static member function takes the address
8419 of the object as the first argument. But in a constant
8420 expression the address will be folded away, so look
8422 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
8423 && !DECL_CONSTRUCTOR_P (fun
))
8425 tree x
= get_nth_callarg (t
, 0);
8426 if (is_this_parameter (x
))
8428 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8430 if (flags
& tf_error
)
8431 sorry ("calling a member function of the "
8432 "object being constructed in a constant "
8436 /* Otherwise OK. */;
8438 else if (!potential_constant_expression_1 (x
, rval
, flags
))
8445 if (!potential_constant_expression_1 (fun
, true, flags
))
8447 fun
= get_first_fn (fun
);
8449 /* Skip initial arguments to base constructors. */
8450 if (DECL_BASE_CONSTRUCTOR_P (fun
))
8451 i
= num_artificial_parms_for (fun
);
8452 fun
= DECL_ORIGIN (fun
);
8456 if (potential_constant_expression_1 (fun
, rval
, flags
))
8457 /* Might end up being a constant function pointer. */;
8461 for (; i
< nargs
; ++i
)
8463 tree x
= get_nth_callarg (t
, i
);
8464 if (!potential_constant_expression_1 (x
, rval
, flags
))
8470 case NON_LVALUE_EXPR
:
8471 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
8472 -- an lvalue of integral type that refers to a non-volatile
8473 const variable or static data member initialized with
8474 constant expressions, or
8476 -- an lvalue of literal type that refers to non-volatile
8477 object defined with constexpr, or that refers to a
8478 sub-object of such an object; */
8479 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
8482 if (want_rval
&& !decl_constant_var_p (t
)
8483 && !dependent_type_p (TREE_TYPE (t
)))
8485 if (flags
& tf_error
)
8486 non_const_var_error (t
);
8493 case VIEW_CONVERT_EXPR
:
8494 /* -- a reinterpret_cast. FIXME not implemented, and this rule
8495 may change to something more specific to type-punning (DR 1312). */
8497 tree from
= TREE_OPERAND (t
, 0);
8498 return (potential_constant_expression_1
8499 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
8503 /* -- a unary operator & that is applied to an lvalue that
8504 designates an object with thread or automatic storage
8506 t
= TREE_OPERAND (t
, 0);
8508 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8509 any checking here, as we might dereference the pointer later. If
8510 we remove this code, also remove check_automatic_or_tls. */
8511 i
= check_automatic_or_tls (t
);
8516 if (flags
& tf_error
)
8517 error ("address-of an object %qE with thread local or "
8518 "automatic storage is not a constant expression", t
);
8522 return potential_constant_expression_1 (t
, any
, flags
);
8528 /* -- a class member access unless its postfix-expression is
8529 of literal type or of pointer to literal type. */
8530 /* This test would be redundant, as it follows from the
8531 postfix-expression being a potential constant expression. */
8532 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8535 case EXPR_PACK_EXPANSION
:
8536 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
8541 tree x
= TREE_OPERAND (t
, 0);
8543 if (is_this_parameter (x
))
8545 if (want_rval
&& DECL_CONTEXT (x
)
8546 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8548 if (flags
& tf_error
)
8549 sorry ("use of the value of the object being constructed "
8550 "in a constant expression");
8555 return potential_constant_expression_1 (x
, rval
, flags
);
8559 case DYNAMIC_CAST_EXPR
:
8560 case PSEUDO_DTOR_EXPR
:
8561 case PREINCREMENT_EXPR
:
8562 case POSTINCREMENT_EXPR
:
8563 case PREDECREMENT_EXPR
:
8564 case POSTDECREMENT_EXPR
:
8568 case VEC_DELETE_EXPR
:
8572 /* GCC internal stuff. */
8575 case WITH_CLEANUP_EXPR
:
8576 case CLEANUP_POINT_EXPR
:
8577 case MUST_NOT_THROW_EXPR
:
8578 case TRY_CATCH_EXPR
:
8579 case STATEMENT_LIST
:
8580 /* Don't bother trying to define a subset of statement-expressions to
8581 be constant-expressions, at least for now. */
8585 case TRANSACTION_EXPR
:
8590 if (flags
& tf_error
)
8591 error ("expression %qE is not a constant-expression", t
);
8595 /* -- a typeid expression whose operand is of polymorphic
8598 tree e
= TREE_OPERAND (t
, 0);
8599 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
8600 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
8602 if (flags
& tf_error
)
8603 error ("typeid-expression is not a constant expression "
8604 "because %qE is of polymorphic type", e
);
8611 /* -- a subtraction where both operands are pointers. */
8612 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8613 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8615 if (flags
& tf_error
)
8616 error ("difference of two pointer expressions is not "
8617 "a constant expression");
8629 /* -- a relational or equality operator where at least
8630 one of the operands is a pointer. */
8631 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8632 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8634 if (flags
& tf_error
)
8635 error ("pointer comparison expression is not a "
8636 "constant expression");
8644 if (TYPE_P (TREE_OPERAND (t
, 0)))
8646 /* else fall through. */
8652 case FIX_TRUNC_EXPR
:
8656 case TRUTH_NOT_EXPR
:
8657 case FIXED_CONVERT_EXPR
:
8658 case UNARY_PLUS_EXPR
:
8659 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
8663 case CONST_CAST_EXPR
:
8664 case STATIC_CAST_EXPR
:
8665 case REINTERPRET_CAST_EXPR
:
8666 case IMPLICIT_CONV_EXPR
:
8667 if (cxx_dialect
< cxx0x
8668 && !dependent_type_p (TREE_TYPE (t
))
8669 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
)))
8670 /* In C++98, a conversion to non-integral type can't be part of a
8671 constant expression. */
8673 if (flags
& tf_error
)
8674 error ("cast to non-integral type %qT in a constant expression",
8679 return (potential_constant_expression_1
8680 (TREE_OPERAND (t
, 0),
8681 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
8684 case NON_DEPENDENT_EXPR
:
8685 /* For convenience. */
8687 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8691 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8695 if (!literal_type_p (TREE_TYPE (t
)))
8697 if (flags
& tf_error
)
8699 error ("temporary of non-literal type %qT in a "
8700 "constant expression", TREE_TYPE (t
));
8701 explain_non_literal_class (TREE_TYPE (t
));
8706 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8711 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
8712 constructor_elt
*ce
;
8713 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
8714 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
8721 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8722 || DECL_P (TREE_PURPOSE (t
)));
8723 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
8726 if (TREE_CHAIN (t
) == NULL_TREE
)
8728 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
8732 case TRUNC_DIV_EXPR
:
8734 case FLOOR_DIV_EXPR
:
8735 case ROUND_DIV_EXPR
:
8736 case TRUNC_MOD_EXPR
:
8738 case ROUND_MOD_EXPR
:
8740 tree denom
= TREE_OPERAND (t
, 1);
8741 if (!potential_constant_expression_1 (denom
, rval
, flags
))
8743 /* We can't call cxx_eval_outermost_constant_expr on an expression
8744 that hasn't been through fold_non_dependent_expr yet. */
8745 if (!processing_template_decl
)
8746 denom
= cxx_eval_outermost_constant_expr (denom
, true);
8747 if (integer_zerop (denom
))
8749 if (flags
& tf_error
)
8750 error ("division by zero is not a constant-expression");
8756 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8763 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8764 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8765 introduced by build_call_a. */
8766 tree op0
= TREE_OPERAND (t
, 0);
8767 tree op1
= TREE_OPERAND (t
, 1);
8769 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
8770 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
8771 return potential_constant_expression_1 (op0
, want_rval
, flags
);
8776 /* If the first operand is the non-short-circuit constant, look at
8777 the second operand; otherwise we only care about the first one for
8779 case TRUTH_AND_EXPR
:
8780 case TRUTH_ANDIF_EXPR
:
8781 tmp
= boolean_true_node
;
8784 case TRUTH_ORIF_EXPR
:
8785 tmp
= boolean_false_node
;
8788 tree op
= TREE_OPERAND (t
, 0);
8789 if (!potential_constant_expression_1 (op
, rval
, flags
))
8791 if (!processing_template_decl
)
8792 op
= cxx_eval_outermost_constant_expr (op
, true);
8793 if (tree_int_cst_equal (op
, tmp
))
8794 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
8801 case POINTER_PLUS_EXPR
:
8803 case EXACT_DIV_EXPR
:
8813 case TRUTH_XOR_EXPR
:
8814 case UNORDERED_EXPR
:
8827 case ARRAY_RANGE_REF
:
8831 for (i
= 0; i
< 2; ++i
)
8832 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8839 for (i
= 0; i
< 3; ++i
)
8840 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8847 /* If the condition is a known constant, we know which of the legs we
8848 care about; otherwise we only require that the condition and
8849 either of the legs be potentially constant. */
8850 tmp
= TREE_OPERAND (t
, 0);
8851 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
8853 if (!processing_template_decl
)
8854 tmp
= cxx_eval_outermost_constant_expr (tmp
, true);
8855 if (integer_zerop (tmp
))
8856 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
8858 else if (TREE_CODE (tmp
) == INTEGER_CST
)
8859 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8861 for (i
= 1; i
< 3; ++i
)
8862 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8863 want_rval
, tf_none
))
8865 if (flags
& tf_error
)
8866 error ("expression %qE is not a constant-expression", t
);
8870 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
8872 if (flags
& tf_error
)
8874 error ("non-constant array initialization");
8875 diagnose_non_constexpr_vec_init (t
);
8880 case OMP_ATOMIC_READ
:
8881 case OMP_ATOMIC_CAPTURE_OLD
:
8882 case OMP_ATOMIC_CAPTURE_NEW
:
8886 if (objc_is_property_ref (t
))
8889 sorry ("unexpected AST of kind %s", tree_code_name
[TREE_CODE (t
)]);
8895 /* The main entry point to the above. */
8898 potential_constant_expression (tree t
)
8900 return potential_constant_expression_1 (t
, false, tf_none
);
8903 /* As above, but require a constant rvalue. */
8906 potential_rvalue_constant_expression (tree t
)
8908 return potential_constant_expression_1 (t
, true, tf_none
);
8911 /* Like above, but complain about non-constant expressions. */
8914 require_potential_constant_expression (tree t
)
8916 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
8919 /* Cross product of the above. */
8922 require_potential_rvalue_constant_expression (tree t
)
8924 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
8927 /* Constructor for a lambda expression. */
8930 build_lambda_expr (void)
8932 tree lambda
= make_node (LAMBDA_EXPR
);
8933 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
8934 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
8935 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
8936 LAMBDA_EXPR_PENDING_PROXIES (lambda
) = NULL
;
8937 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
8938 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
8942 /* Create the closure object for a LAMBDA_EXPR. */
8945 build_lambda_object (tree lambda_expr
)
8947 /* Build aggregate constructor call.
8948 - cp_parser_braced_list
8949 - cp_parser_functional_cast */
8950 vec
<constructor_elt
, va_gc
> *elts
= NULL
;
8951 tree node
, expr
, type
;
8952 location_t saved_loc
;
8954 if (processing_template_decl
)
8957 /* Make sure any error messages refer to the lambda-introducer. */
8958 saved_loc
= input_location
;
8959 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
8961 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
8963 node
= TREE_CHAIN (node
))
8965 tree field
= TREE_PURPOSE (node
);
8966 tree val
= TREE_VALUE (node
);
8968 if (field
== error_mark_node
)
8970 expr
= error_mark_node
;
8977 /* Mere mortals can't copy arrays with aggregate initialization, so
8978 do some magic to make it work here. */
8979 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
8980 val
= build_array_copy (val
);
8981 else if (DECL_NORMAL_CAPTURE_P (field
)
8982 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
8984 /* "the entities that are captured by copy are used to
8985 direct-initialize each corresponding non-static data
8986 member of the resulting closure object."
8988 There's normally no way to express direct-initialization
8989 from an element of a CONSTRUCTOR, so we build up a special
8990 TARGET_EXPR to bypass the usual copy-initialization. */
8991 val
= force_rvalue (val
, tf_warning_or_error
);
8992 if (TREE_CODE (val
) == TARGET_EXPR
)
8993 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
8996 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
8999 expr
= build_constructor (init_list_type_node
, elts
);
9000 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
9002 /* N2927: "[The closure] class type is not an aggregate."
9003 But we briefly treat it as an aggregate to make this simpler. */
9004 type
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
9005 CLASSTYPE_NON_AGGREGATE (type
) = 0;
9006 expr
= finish_compound_literal (type
, expr
, tf_warning_or_error
);
9007 CLASSTYPE_NON_AGGREGATE (type
) = 1;
9010 input_location
= saved_loc
;
9014 /* Return an initialized RECORD_TYPE for LAMBDA.
9015 LAMBDA must have its explicit captures already. */
9018 begin_lambda_type (tree lambda
)
9023 /* Unique name. This is just like an unnamed class, but we cannot use
9024 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
9026 name
= make_lambda_name ();
9028 /* Create the new RECORD_TYPE for this lambda. */
9029 type
= xref_tag (/*tag_code=*/record_type
,
9031 /*scope=*/ts_lambda
,
9032 /*template_header_p=*/false);
9033 if (type
== error_mark_node
)
9034 return error_mark_node
;
9037 /* Designate it as a struct so that we can use aggregate initialization. */
9038 CLASSTYPE_DECLARED_CLASS (type
) = false;
9040 /* Cross-reference the expression and the type. */
9041 LAMBDA_EXPR_CLOSURE (lambda
) = type
;
9042 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
9044 /* Clear base types. */
9045 xref_basetypes (type
, /*bases=*/NULL_TREE
);
9047 /* Start the class. */
9048 type
= begin_class_definition (type
);
9053 /* Returns the type to use for the return type of the operator() of a
9057 lambda_return_type (tree expr
)
9059 if (expr
== NULL_TREE
)
9060 return void_type_node
;
9061 if (type_unknown_p (expr
)
9062 || BRACE_ENCLOSED_INITIALIZER_P (expr
))
9064 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
9065 return void_type_node
;
9067 gcc_checking_assert (!type_dependent_expression_p (expr
));
9068 return cv_unqualified (type_decays_to (unlowered_expr_type (expr
)));
9071 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
9075 lambda_function (tree lambda
)
9078 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
9079 type
= LAMBDA_EXPR_CLOSURE (lambda
);
9082 gcc_assert (LAMBDA_TYPE_P (type
));
9083 /* Don't let debug_tree cause instantiation. */
9084 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
9085 && !COMPLETE_OR_OPEN_TYPE_P (type
))
9087 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
9088 /*protect=*/0, /*want_type=*/false,
9089 tf_warning_or_error
);
9091 lambda
= BASELINK_FUNCTIONS (lambda
);
9095 /* Returns the type to use for the FIELD_DECL corresponding to the
9097 The caller should add REFERENCE_TYPE for capture by reference. */
9100 lambda_capture_field_type (tree expr
)
9103 if (type_dependent_expression_p (expr
)
9104 && !(TREE_TYPE (expr
) && TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
9105 && !type_uses_auto (TREE_TYPE (expr
))))
9107 type
= cxx_make_type (DECLTYPE_TYPE
);
9108 DECLTYPE_TYPE_EXPR (type
) = expr
;
9109 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
9110 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9113 type
= non_reference (unlowered_expr_type (expr
));
9117 /* Insert the deduced return type for an auto function. */
9120 apply_deduced_return_type (tree fco
, tree return_type
)
9124 if (return_type
== error_mark_node
)
9127 if (LAMBDA_FUNCTION_P (fco
))
9129 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
9130 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
9133 if (DECL_CONV_FN_P (fco
))
9134 DECL_NAME (fco
) = mangle_conv_op_name_for_type (return_type
);
9136 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9138 result
= DECL_RESULT (fco
);
9139 if (result
== NULL_TREE
)
9141 if (TREE_TYPE (result
) == return_type
)
9144 /* We already have a DECL_RESULT from start_preparsed_function.
9145 Now we need to redo the work it and allocate_struct_function
9146 did to reflect the new type. */
9147 gcc_assert (current_function_decl
== fco
);
9148 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9149 TYPE_MAIN_VARIANT (return_type
));
9150 DECL_ARTIFICIAL (result
) = 1;
9151 DECL_IGNORED_P (result
) = 1;
9152 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9155 DECL_RESULT (fco
) = result
;
9157 if (!processing_template_decl
)
9159 bool aggr
= aggregate_value_p (result
, fco
);
9160 #ifdef PCC_STATIC_STRUCT_RETURN
9161 cfun
->returns_pcc_struct
= aggr
;
9163 cfun
->returns_struct
= aggr
;
9168 /* DECL is a local variable or parameter from the surrounding scope of a
9169 lambda-expression. Returns the decltype for a use of the capture field
9170 for DECL even if it hasn't been captured yet. */
9173 capture_decltype (tree decl
)
9175 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9176 /* FIXME do lookup instead of list walk? */
9177 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9181 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9183 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9186 error ("%qD is not captured", decl
);
9187 return error_mark_node
;
9190 type
= TREE_TYPE (decl
);
9191 if (TREE_CODE (type
) == REFERENCE_TYPE
9192 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9193 type
= TREE_TYPE (type
);
9196 case CPLD_REFERENCE
:
9197 type
= TREE_TYPE (decl
);
9198 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9199 type
= build_reference_type (TREE_TYPE (decl
));
9206 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9208 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9209 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9211 type
= build_reference_type (type
);
9216 /* Returns true iff DECL is a lambda capture proxy variable created by
9217 build_capture_proxy. */
9220 is_capture_proxy (tree decl
)
9222 return (TREE_CODE (decl
) == VAR_DECL
9223 && DECL_HAS_VALUE_EXPR_P (decl
)
9224 && !DECL_ANON_UNION_VAR_P (decl
)
9225 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl
)));
9228 /* Returns true iff DECL is a capture proxy for a normal capture
9229 (i.e. without explicit initializer). */
9232 is_normal_capture_proxy (tree decl
)
9234 if (!is_capture_proxy (decl
))
9235 /* It's not a capture proxy. */
9238 /* It is a capture proxy, is it a normal capture? */
9239 tree val
= DECL_VALUE_EXPR (decl
);
9240 if (val
== error_mark_node
)
9243 gcc_assert (TREE_CODE (val
) == COMPONENT_REF
);
9244 val
= TREE_OPERAND (val
, 1);
9245 return DECL_NORMAL_CAPTURE_P (val
);
9248 /* VAR is a capture proxy created by build_capture_proxy; add it to the
9249 current function, which is the operator() for the appropriate lambda. */
9252 insert_capture_proxy (tree var
)
9254 cp_binding_level
*b
;
9257 /* Put the capture proxy in the extra body block so that it won't clash
9258 with a later local variable. */
9259 b
= current_binding_level
;
9262 cp_binding_level
*n
= b
->level_chain
;
9263 if (n
->kind
== sk_function_parms
)
9267 pushdecl_with_scope (var
, b
, false);
9269 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
9270 var
= build_stmt (DECL_SOURCE_LOCATION (var
), DECL_EXPR
, var
);
9271 stmt_list
= (*stmt_list_stack
)[1];
9272 gcc_assert (stmt_list
);
9273 append_to_statement_list_force (var
, &stmt_list
);
9276 /* We've just finished processing a lambda; if the containing scope is also
9277 a lambda, insert any capture proxies that were created while processing
9278 the nested lambda. */
9281 insert_pending_capture_proxies (void)
9284 vec
<tree
, va_gc
> *proxies
;
9287 if (!current_function_decl
|| !LAMBDA_FUNCTION_P (current_function_decl
))
9290 lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9291 proxies
= LAMBDA_EXPR_PENDING_PROXIES (lam
);
9292 for (i
= 0; i
< vec_safe_length (proxies
); ++i
)
9294 tree var
= (*proxies
)[i
];
9295 insert_capture_proxy (var
);
9297 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam
));
9298 LAMBDA_EXPR_PENDING_PROXIES (lam
) = NULL
;
9301 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
9302 return the type we want the proxy to have: the type of the field itself,
9303 with added const-qualification if the lambda isn't mutable and the
9304 capture is by value. */
9307 lambda_proxy_type (tree ref
)
9310 if (REFERENCE_REF_P (ref
))
9311 ref
= TREE_OPERAND (ref
, 0);
9312 type
= TREE_TYPE (ref
);
9313 if (!dependent_type_p (type
)
9314 || (type
&& TREE_CODE (type
) == POINTER_TYPE
))
9316 type
= cxx_make_type (DECLTYPE_TYPE
);
9317 DECLTYPE_TYPE_EXPR (type
) = ref
;
9318 DECLTYPE_FOR_LAMBDA_PROXY (type
) = true;
9319 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9323 /* MEMBER is a capture field in a lambda closure class. Now that we're
9324 inside the operator(), build a placeholder var for future lookups and
9328 build_capture_proxy (tree member
)
9330 tree var
, object
, fn
, closure
, name
, lam
, type
;
9332 closure
= DECL_CONTEXT (member
);
9333 fn
= lambda_function (closure
);
9334 lam
= CLASSTYPE_LAMBDA_EXPR (closure
);
9336 /* The proxy variable forwards to the capture field. */
9337 object
= build_fold_indirect_ref (DECL_ARGUMENTS (fn
));
9338 object
= finish_non_static_data_member (member
, object
, NULL_TREE
);
9339 if (REFERENCE_REF_P (object
))
9340 object
= TREE_OPERAND (object
, 0);
9342 /* Remove the __ inserted by add_capture. */
9343 name
= get_identifier (IDENTIFIER_POINTER (DECL_NAME (member
)) + 2);
9345 type
= lambda_proxy_type (object
);
9346 var
= build_decl (input_location
, VAR_DECL
, name
, type
);
9347 SET_DECL_VALUE_EXPR (var
, object
);
9348 DECL_HAS_VALUE_EXPR_P (var
) = 1;
9349 DECL_ARTIFICIAL (var
) = 1;
9350 TREE_USED (var
) = 1;
9351 DECL_CONTEXT (var
) = fn
;
9353 if (name
== this_identifier
)
9355 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam
) == member
);
9356 LAMBDA_EXPR_THIS_CAPTURE (lam
) = var
;
9359 if (fn
== current_function_decl
)
9360 insert_capture_proxy (var
);
9362 vec_safe_push (LAMBDA_EXPR_PENDING_PROXIES (lam
), var
);
9367 /* From an ID and INITIALIZER, create a capture (by reference if
9368 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
9372 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
9373 bool explicit_init_p
)
9376 tree type
, member
, name
;
9378 type
= lambda_capture_field_type (initializer
);
9381 type
= build_reference_type (type
);
9382 if (!real_lvalue_p (initializer
))
9383 error ("cannot capture %qE by reference", initializer
);
9386 /* Capture by copy requires a complete type. */
9387 type
= complete_type (type
);
9389 /* Add __ to the beginning of the field name so that user code
9390 won't find the field with name lookup. We can't just leave the name
9391 unset because template instantiation uses the name to find
9392 instantiated fields. */
9393 buf
= (char *) alloca (IDENTIFIER_LENGTH (id
) + 3);
9394 buf
[1] = buf
[0] = '_';
9395 memcpy (buf
+ 2, IDENTIFIER_POINTER (id
),
9396 IDENTIFIER_LENGTH (id
) + 1);
9397 name
= get_identifier (buf
);
9399 /* If TREE_TYPE isn't set, we're still in the introducer, so check
9401 if (!LAMBDA_EXPR_CLOSURE (lambda
))
9403 if (IDENTIFIER_MARKED (name
))
9405 pedwarn (input_location
, 0,
9406 "already captured %qD in lambda expression", id
);
9409 IDENTIFIER_MARKED (name
) = true;
9412 /* Make member variable. */
9413 member
= build_lang_decl (FIELD_DECL
, name
, type
);
9415 if (!explicit_init_p
)
9416 /* Normal captures are invisible to name lookup but uses are replaced
9417 with references to the capture field; we implement this by only
9418 really making them invisible in unevaluated context; see
9419 qualify_lookup. For now, let's make explicitly initialized captures
9421 DECL_NORMAL_CAPTURE_P (member
) = true;
9423 if (id
== this_identifier
)
9424 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
9426 /* Add it to the appropriate closure class if we've started it. */
9427 if (current_class_type
9428 && current_class_type
== LAMBDA_EXPR_CLOSURE (lambda
))
9429 finish_member_declaration (member
);
9431 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
9432 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
9434 if (LAMBDA_EXPR_CLOSURE (lambda
))
9435 return build_capture_proxy (member
);
9436 /* For explicit captures we haven't started the function yet, so we wait
9437 and build the proxy from cp_parser_lambda_body. */
9441 /* Register all the capture members on the list CAPTURES, which is the
9442 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
9445 register_capture_members (tree captures
)
9447 if (captures
== NULL_TREE
)
9450 register_capture_members (TREE_CHAIN (captures
));
9451 /* We set this in add_capture to avoid duplicates. */
9452 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures
))) = false;
9453 finish_member_declaration (TREE_PURPOSE (captures
));
9456 /* Similar to add_capture, except this works on a stack of nested lambdas.
9457 BY_REFERENCE_P in this case is derived from the default capture mode.
9458 Returns the capture for the lambda at the bottom of the stack. */
9461 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
9463 bool this_capture_p
= (id
== this_identifier
);
9465 tree var
= NULL_TREE
;
9467 tree saved_class_type
= current_class_type
;
9471 for (node
= lambda_stack
;
9473 node
= TREE_CHAIN (node
))
9475 tree lambda
= TREE_VALUE (node
);
9477 current_class_type
= LAMBDA_EXPR_CLOSURE (lambda
);
9478 var
= add_capture (lambda
,
9483 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
9484 == CPLD_REFERENCE
)),
9485 /*explicit_init_p=*/false);
9486 initializer
= convert_from_reference (var
);
9489 current_class_type
= saved_class_type
;
9494 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
9495 INDIRECT_REF, possibly adding it through default capturing. */
9498 lambda_expr_this_capture (tree lambda
)
9502 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
9504 /* In unevaluated context this isn't an odr-use, so just return the
9506 if (cp_unevaluated_operand
)
9508 /* In an NSDMI the fake 'this' pointer that we're using for
9509 parsing is in scope_chain. */
9510 if (LAMBDA_EXPR_EXTRA_SCOPE (lambda
)
9511 && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (lambda
)) == FIELD_DECL
)
9512 return scope_chain
->x_current_class_ptr
;
9513 return lookup_name (this_identifier
);
9516 /* Try to default capture 'this' if we can. */
9518 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
9520 tree lambda_stack
= NULL_TREE
;
9521 tree init
= NULL_TREE
;
9523 /* If we are in a lambda function, we can move out until we hit:
9524 1. a non-lambda function or NSDMI,
9525 2. a lambda function capturing 'this', or
9526 3. a non-default capturing lambda function. */
9527 for (tree tlambda
= lambda
; ;)
9529 lambda_stack
= tree_cons (NULL_TREE
,
9533 if (LAMBDA_EXPR_EXTRA_SCOPE (tlambda
)
9534 && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (tlambda
)) == FIELD_DECL
)
9536 /* In an NSDMI, we don't have a function to look up the decl in,
9537 but the fake 'this' pointer that we're using for parsing is
9539 init
= scope_chain
->x_current_class_ptr
;
9541 (init
&& (TREE_TYPE (TREE_TYPE (init
))
9542 == current_nonlambda_class_type ()));
9546 tree closure_decl
= TYPE_NAME (LAMBDA_EXPR_CLOSURE (tlambda
));
9547 tree containing_function
= decl_function_context (closure_decl
);
9549 if (containing_function
== NULL_TREE
)
9550 /* We ran out of scopes; there's no 'this' to capture. */
9553 if (!LAMBDA_FUNCTION_P (containing_function
))
9555 /* We found a non-lambda function. */
9556 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
))
9557 /* First parameter is 'this'. */
9558 init
= DECL_ARGUMENTS (containing_function
);
9563 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
9565 if (LAMBDA_EXPR_THIS_CAPTURE (tlambda
))
9567 /* An outer lambda has already captured 'this'. */
9568 init
= LAMBDA_EXPR_THIS_CAPTURE (tlambda
);
9572 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (tlambda
) == CPLD_NONE
)
9573 /* An outer lambda won't let us capture 'this'. */
9578 this_capture
= add_default_capture (lambda_stack
,
9579 /*id=*/this_identifier
,
9585 error ("%<this%> was not captured for this lambda function");
9586 result
= error_mark_node
;
9590 /* To make sure that current_class_ref is for the lambda. */
9591 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
))
9592 == LAMBDA_EXPR_CLOSURE (lambda
));
9594 result
= this_capture
;
9596 /* If 'this' is captured, each use of 'this' is transformed into an
9597 access to the corresponding unnamed data member of the closure
9598 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9599 ensures that the transformed expression is an rvalue. ] */
9600 result
= rvalue (result
);
9606 /* We don't want to capture 'this' until we know we need it, i.e. after
9607 overload resolution has chosen a non-static member function. At that
9608 point we call this function to turn a dummy object into a use of the
9612 maybe_resolve_dummy (tree object
)
9614 if (!is_dummy_object (object
))
9617 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (object
));
9618 gcc_assert (TREE_CODE (type
) != POINTER_TYPE
);
9620 if (type
!= current_class_type
9621 && current_class_type
9622 && LAMBDA_TYPE_P (current_class_type
)
9623 && DERIVED_FROM_P (type
, current_nonlambda_class_type ()))
9625 /* In a lambda, need to go through 'this' capture. */
9626 tree lam
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
9627 tree cap
= lambda_expr_this_capture (lam
);
9628 object
= build_x_indirect_ref (EXPR_LOCATION (object
), cap
,
9629 RO_NULL
, tf_warning_or_error
);
9635 /* Returns the method basetype of the innermost non-lambda function, or
9636 NULL_TREE if none. */
9639 nonlambda_method_basetype (void)
9642 if (!current_class_ref
)
9645 type
= current_class_type
;
9646 if (!LAMBDA_TYPE_P (type
))
9649 /* Find the nearest enclosing non-lambda function. */
9650 fn
= TYPE_NAME (type
);
9652 fn
= decl_function_context (fn
);
9653 while (fn
&& LAMBDA_FUNCTION_P (fn
));
9655 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
9658 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
9661 /* If the closure TYPE has a static op(), also add a conversion to function
9665 maybe_add_lambda_conv_op (tree type
)
9667 bool nested
= (current_function_decl
!= NULL_TREE
);
9668 tree callop
= lambda_function (type
);
9669 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
9670 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
9671 vec
<tree
, va_gc
> *argvec
;
9673 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
9676 if (processing_template_decl
)
9679 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
9680 FUNCTION_ARG_CHAIN (callop
));
9682 /* First build up the conversion op. */
9684 rettype
= build_pointer_type (stattype
);
9685 name
= mangle_conv_op_name_for_type (rettype
);
9686 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
9687 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
9688 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
9689 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9691 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9692 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9693 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9695 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
9696 grokclassfn (type
, fn
, NO_SPECIAL
);
9697 set_linkage_according_to_type (type
, fn
);
9698 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9699 DECL_IN_AGGR_P (fn
) = 1;
9700 DECL_ARTIFICIAL (fn
) = 1;
9701 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9702 DECL_DECLARED_INLINE_P (fn
) = 1;
9703 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
9705 DECL_INTERFACE_KNOWN (fn
) = 1;
9707 add_method (type
, fn
, NULL_TREE
);
9709 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9710 the conversion op is used. */
9711 if (varargs_function_p (callop
))
9713 DECL_DELETED_FN (fn
) = 1;
9717 /* Now build up the thunk to be returned. */
9719 name
= get_identifier ("_FUN");
9720 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
9721 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9722 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9723 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9724 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9725 grokclassfn (type
, fn
, NO_SPECIAL
);
9726 set_linkage_according_to_type (type
, fn
);
9727 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9728 DECL_IN_AGGR_P (fn
) = 1;
9729 DECL_ARTIFICIAL (fn
) = 1;
9730 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9731 DECL_DECLARED_INLINE_P (fn
) = 1;
9732 DECL_STATIC_FUNCTION_P (fn
) = 1;
9733 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
9734 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
9735 DECL_CONTEXT (arg
) = fn
;
9737 DECL_INTERFACE_KNOWN (fn
) = 1;
9739 add_method (type
, fn
, NULL_TREE
);
9742 push_function_context ();
9744 /* Still increment function_depth so that we don't GC in the
9745 middle of an expression. */
9748 /* Generate the body of the thunk. */
9750 start_preparsed_function (statfn
, NULL_TREE
,
9751 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9752 if (DECL_ONE_ONLY (statfn
))
9754 /* Put the thunk in the same comdat group as the call op. */
9755 symtab_add_to_same_comdat_group
9756 ((symtab_node
) cgraph_get_create_node (statfn
),
9757 (symtab_node
) cgraph_get_create_node (callop
));
9759 body
= begin_function_body ();
9760 compound_stmt
= begin_compound_stmt (0);
9762 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
9764 argvec
= make_tree_vector ();
9765 argvec
->quick_push (arg
);
9766 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
9768 mark_exp_read (arg
);
9769 vec_safe_push (argvec
, arg
);
9771 call
= build_call_a (callop
, argvec
->length (), argvec
->address ());
9772 CALL_FROM_THUNK_P (call
) = 1;
9773 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
9774 call
= build_cplus_new (TREE_TYPE (call
), call
, tf_warning_or_error
);
9775 call
= convert_from_reference (call
);
9776 finish_return_stmt (call
);
9778 finish_compound_stmt (compound_stmt
);
9779 finish_function_body (body
);
9781 expand_or_defer_fn (finish_function (2));
9783 /* Generate the body of the conversion op. */
9785 start_preparsed_function (convfn
, NULL_TREE
,
9786 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9787 body
= begin_function_body ();
9788 compound_stmt
= begin_compound_stmt (0);
9790 /* decl_needed_p needs to see that it's used. */
9791 TREE_USED (statfn
) = 1;
9792 finish_return_stmt (decay_conversion (statfn
, tf_warning_or_error
));
9794 finish_compound_stmt (compound_stmt
);
9795 finish_function_body (body
);
9797 expand_or_defer_fn (finish_function (2));
9800 pop_function_context ();
9805 /* Returns true iff VAL is a lambda-related declaration which should
9806 be ignored by unqualified lookup. */
9809 is_lambda_ignored_entity (tree val
)
9811 /* In unevaluated context, look past normal capture proxies. */
9812 if (cp_unevaluated_operand
&& is_normal_capture_proxy (val
))
9815 /* Always ignore lambda fields, their names are only for debugging. */
9816 if (TREE_CODE (val
) == FIELD_DECL
9817 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val
)))
9820 /* None of the lookups that use qualify_lookup want the op() from the
9821 lambda; they want the one from the enclosing class. */
9822 if (TREE_CODE (val
) == FUNCTION_DECL
&& LAMBDA_FUNCTION_P (val
))
9828 #include "gt-cp-semantics.h"