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
= DECL_NAME (decl
);
2509 /* Finish a translation unit. */
2512 finish_translation_unit (void)
2514 /* In case there were missing closebraces,
2515 get us back to the global binding level. */
2517 while (current_namespace
!= global_namespace
)
2520 /* Do file scope __FUNCTION__ et al. */
2521 finish_fname_decls ();
2524 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2525 Returns the parameter. */
2528 finish_template_type_parm (tree aggr
, tree identifier
)
2530 if (aggr
!= class_type_node
)
2532 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2533 aggr
= class_type_node
;
2536 return build_tree_list (aggr
, identifier
);
2539 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2540 Returns the parameter. */
2543 finish_template_template_parm (tree aggr
, tree identifier
)
2545 tree decl
= build_decl (input_location
,
2546 TYPE_DECL
, identifier
, NULL_TREE
);
2547 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2548 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2549 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2550 DECL_ARTIFICIAL (decl
) = 1;
2551 end_template_decl ();
2553 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2555 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2556 /*is_primary=*/true, /*is_partial=*/false,
2559 return finish_template_type_parm (aggr
, tmpl
);
2562 /* ARGUMENT is the default-argument value for a template template
2563 parameter. If ARGUMENT is invalid, issue error messages and return
2564 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2567 check_template_template_default_arg (tree argument
)
2569 if (TREE_CODE (argument
) != TEMPLATE_DECL
2570 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2571 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2573 if (TREE_CODE (argument
) == TYPE_DECL
)
2574 error ("invalid use of type %qT as a default value for a template "
2575 "template-parameter", TREE_TYPE (argument
));
2577 error ("invalid default argument for a template template parameter");
2578 return error_mark_node
;
2584 /* Begin a class definition, as indicated by T. */
2587 begin_class_definition (tree t
)
2589 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2590 return error_mark_node
;
2592 if (processing_template_parmlist
)
2594 error ("definition of %q#T inside template parameter list", t
);
2595 return error_mark_node
;
2598 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2599 are passed the same as decimal scalar types. */
2600 if (TREE_CODE (t
) == RECORD_TYPE
2601 && !processing_template_decl
)
2603 tree ns
= TYPE_CONTEXT (t
);
2604 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2605 && DECL_CONTEXT (ns
) == std_node
2607 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2609 const char *n
= TYPE_NAME_STRING (t
);
2610 if ((strcmp (n
, "decimal32") == 0)
2611 || (strcmp (n
, "decimal64") == 0)
2612 || (strcmp (n
, "decimal128") == 0))
2613 TYPE_TRANSPARENT_AGGR (t
) = 1;
2617 /* A non-implicit typename comes from code like:
2619 template <typename T> struct A {
2620 template <typename U> struct A<T>::B ...
2622 This is erroneous. */
2623 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2625 error ("invalid definition of qualified type %qT", t
);
2626 t
= error_mark_node
;
2629 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2631 t
= make_class_type (RECORD_TYPE
);
2632 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2635 if (TYPE_BEING_DEFINED (t
))
2637 t
= make_class_type (TREE_CODE (t
));
2638 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2640 maybe_process_partial_specialization (t
);
2642 TYPE_BEING_DEFINED (t
) = 1;
2644 if (flag_pack_struct
)
2647 TYPE_PACKED (t
) = 1;
2648 /* Even though the type is being defined for the first time
2649 here, there might have been a forward declaration, so there
2650 might be cv-qualified variants of T. */
2651 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2652 TYPE_PACKED (v
) = 1;
2654 /* Reset the interface data, at the earliest possible
2655 moment, as it might have been set via a class foo;
2657 if (! TYPE_ANONYMOUS_P (t
))
2659 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2660 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2661 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2662 (t
, finfo
->interface_unknown
);
2664 reset_specialization();
2666 /* Make a declaration for this class in its own scope. */
2667 build_self_reference ();
2672 /* Finish the member declaration given by DECL. */
2675 finish_member_declaration (tree decl
)
2677 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2680 if (decl
== void_type_node
)
2681 /* The COMPONENT was a friend, not a member, and so there's
2682 nothing for us to do. */
2685 /* We should see only one DECL at a time. */
2686 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2688 /* Set up access control for DECL. */
2690 = (current_access_specifier
== access_private_node
);
2691 TREE_PROTECTED (decl
)
2692 = (current_access_specifier
== access_protected_node
);
2693 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2695 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2696 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2699 /* Mark the DECL as a member of the current class, unless it's
2700 a member of an enumeration. */
2701 if (TREE_CODE (decl
) != CONST_DECL
)
2702 DECL_CONTEXT (decl
) = current_class_type
;
2704 /* Check for bare parameter packs in the member variable declaration. */
2705 if (TREE_CODE (decl
) == FIELD_DECL
)
2707 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2708 TREE_TYPE (decl
) = error_mark_node
;
2709 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2710 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2715 A C language linkage is ignored for the names of class members
2716 and the member function type of class member functions. */
2717 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2718 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2720 /* Put functions on the TYPE_METHODS list and everything else on the
2721 TYPE_FIELDS list. Note that these are built up in reverse order.
2722 We reverse them (to obtain declaration order) in finish_struct. */
2723 if (TREE_CODE (decl
) == FUNCTION_DECL
2724 || DECL_FUNCTION_TEMPLATE_P (decl
))
2726 /* We also need to add this function to the
2727 CLASSTYPE_METHOD_VEC. */
2728 if (add_method (current_class_type
, decl
, NULL_TREE
))
2730 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2731 TYPE_METHODS (current_class_type
) = decl
;
2733 maybe_add_class_template_decl_list (current_class_type
, decl
,
2737 /* Enter the DECL into the scope of the class. */
2738 else if (pushdecl_class_level (decl
))
2740 if (TREE_CODE (decl
) == USING_DECL
)
2742 /* For now, ignore class-scope USING_DECLS, so that
2743 debugging backends do not see them. */
2744 DECL_IGNORED_P (decl
) = 1;
2747 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2748 go at the beginning. The reason is that lookup_field_1
2749 searches the list in order, and we want a field name to
2750 override a type name so that the "struct stat hack" will
2751 work. In particular:
2753 struct S { enum E { }; int E } s;
2756 is valid. In addition, the FIELD_DECLs must be maintained in
2757 declaration order so that class layout works as expected.
2758 However, we don't need that order until class layout, so we
2759 save a little time by putting FIELD_DECLs on in reverse order
2760 here, and then reversing them in finish_struct_1. (We could
2761 also keep a pointer to the correct insertion points in the
2764 if (TREE_CODE (decl
) == TYPE_DECL
)
2765 TYPE_FIELDS (current_class_type
)
2766 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2769 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2770 TYPE_FIELDS (current_class_type
) = decl
;
2773 maybe_add_class_template_decl_list (current_class_type
, decl
,
2778 note_decl_for_pch (decl
);
2781 /* DECL has been declared while we are building a PCH file. Perform
2782 actions that we might normally undertake lazily, but which can be
2783 performed now so that they do not have to be performed in
2784 translation units which include the PCH file. */
2787 note_decl_for_pch (tree decl
)
2789 gcc_assert (pch_file
);
2791 /* There's a good chance that we'll have to mangle names at some
2792 point, even if only for emission in debugging information. */
2793 if ((TREE_CODE (decl
) == VAR_DECL
2794 || TREE_CODE (decl
) == FUNCTION_DECL
)
2795 && !processing_template_decl
)
2799 /* Finish processing a complete template declaration. The PARMS are
2800 the template parameters. */
2803 finish_template_decl (tree parms
)
2806 end_template_decl ();
2808 end_specialization ();
2811 /* Finish processing a template-id (which names a type) of the form
2812 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2813 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2814 the scope of template-id indicated. */
2817 finish_template_type (tree name
, tree args
, int entering_scope
)
2821 type
= lookup_template_class (name
, args
,
2822 NULL_TREE
, NULL_TREE
, entering_scope
,
2823 tf_warning_or_error
| tf_user
);
2824 if (type
== error_mark_node
)
2826 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
2827 return TYPE_STUB_DECL (type
);
2829 return TYPE_NAME (type
);
2832 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2833 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2834 BASE_CLASS, or NULL_TREE if an error occurred. The
2835 ACCESS_SPECIFIER is one of
2836 access_{default,public,protected_private}_node. For a virtual base
2837 we set TREE_TYPE. */
2840 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2844 if (base
== error_mark_node
)
2846 error ("invalid base-class specification");
2849 else if (! MAYBE_CLASS_TYPE_P (base
))
2851 error ("%qT is not a class type", base
);
2856 if (cp_type_quals (base
) != 0)
2858 /* DR 484: Can a base-specifier name a cv-qualified
2860 base
= TYPE_MAIN_VARIANT (base
);
2862 result
= build_tree_list (access
, base
);
2864 TREE_TYPE (result
) = integer_type_node
;
2870 /* If FNS is a member function, a set of member functions, or a
2871 template-id referring to one or more member functions, return a
2872 BASELINK for FNS, incorporating the current access context.
2873 Otherwise, return FNS unchanged. */
2876 baselink_for_fns (tree fns
)
2881 if (BASELINK_P (fns
)
2882 || error_operand_p (fns
))
2885 scope
= ovl_scope (fns
);
2886 if (!CLASS_TYPE_P (scope
))
2889 cl
= currently_open_derived_class (scope
);
2892 cl
= TYPE_BINFO (cl
);
2893 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2896 /* Returns true iff DECL is a variable from a function outside
2900 outer_var_p (tree decl
)
2902 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2903 && DECL_FUNCTION_SCOPE_P (decl
)
2904 && DECL_CONTEXT (decl
) != current_function_decl
);
2907 /* As above, but also checks that DECL is automatic. */
2910 outer_automatic_var_p (tree decl
)
2912 return (outer_var_p (decl
)
2913 && !TREE_STATIC (decl
));
2916 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2917 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2918 if non-NULL, is the type or namespace used to explicitly qualify
2919 ID_EXPRESSION. DECL is the entity to which that name has been
2922 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2923 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2924 be set to true if this expression isn't permitted in a
2925 constant-expression, but it is otherwise not set by this function.
2926 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2927 constant-expression, but a non-constant expression is also
2930 DONE is true if this expression is a complete postfix-expression;
2931 it is false if this expression is followed by '->', '[', '(', etc.
2932 ADDRESS_P is true iff this expression is the operand of '&'.
2933 TEMPLATE_P is true iff the qualified-id was of the form
2934 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2935 appears as a template argument.
2937 If an error occurs, and it is the kind of error that might cause
2938 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2939 is the caller's responsibility to issue the message. *ERROR_MSG
2940 will be a string with static storage duration, so the caller need
2943 Return an expression for the entity, after issuing appropriate
2944 diagnostics. This function is also responsible for transforming a
2945 reference to a non-static member into a COMPONENT_REF that makes
2946 the use of "this" explicit.
2948 Upon return, *IDK will be filled in appropriately. */
2950 finish_id_expression (tree id_expression
,
2954 bool integral_constant_expression_p
,
2955 bool allow_non_integral_constant_expression_p
,
2956 bool *non_integral_constant_expression_p
,
2960 bool template_arg_p
,
2961 const char **error_msg
,
2962 location_t location
)
2964 decl
= strip_using_decl (decl
);
2966 /* Initialize the output parameters. */
2967 *idk
= CP_ID_KIND_NONE
;
2970 if (id_expression
== error_mark_node
)
2971 return error_mark_node
;
2972 /* If we have a template-id, then no further lookup is
2973 required. If the template-id was for a template-class, we
2974 will sometimes have a TYPE_DECL at this point. */
2975 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2976 || TREE_CODE (decl
) == TYPE_DECL
)
2978 /* Look up the name. */
2981 if (decl
== error_mark_node
)
2983 /* Name lookup failed. */
2986 || (!dependent_type_p (scope
)
2987 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2988 && IDENTIFIER_TYPENAME_P (id_expression
)
2989 && dependent_type_p (TREE_TYPE (id_expression
))))))
2991 /* If the qualifying type is non-dependent (and the name
2992 does not name a conversion operator to a dependent
2993 type), issue an error. */
2994 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2995 return error_mark_node
;
2999 /* It may be resolved via Koenig lookup. */
3000 *idk
= CP_ID_KIND_UNQUALIFIED
;
3001 return id_expression
;
3004 decl
= id_expression
;
3006 /* If DECL is a variable that would be out of scope under
3007 ANSI/ISO rules, but in scope in the ARM, name lookup
3008 will succeed. Issue a diagnostic here. */
3010 decl
= check_for_out_of_scope_variable (decl
);
3012 /* Remember that the name was used in the definition of
3013 the current class so that we can check later to see if
3014 the meaning would have been different after the class
3015 was entirely defined. */
3016 if (!scope
&& decl
!= error_mark_node
3017 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
3018 maybe_note_name_used_in_class (id_expression
, decl
);
3020 /* Disallow uses of local variables from containing functions, except
3021 within lambda-expressions. */
3022 if (!outer_var_p (decl
)
3023 /* It's not a use (3.2) if we're in an unevaluated context. */
3024 || cp_unevaluated_operand
)
3026 else if (TREE_STATIC (decl
))
3028 if (processing_template_decl
)
3029 /* For a use of an outer static var, return the identifier so
3030 that we'll look it up again in the instantiation. */
3031 return id_expression
;
3035 tree context
= DECL_CONTEXT (decl
);
3036 tree containing_function
= current_function_decl
;
3037 tree lambda_stack
= NULL_TREE
;
3038 tree lambda_expr
= NULL_TREE
;
3039 tree initializer
= convert_from_reference (decl
);
3041 /* Mark it as used now even if the use is ill-formed. */
3044 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3045 support for an approach in which a reference to a local
3046 [constant] automatic variable in a nested class or lambda body
3047 would enter the expression as an rvalue, which would reduce
3048 the complexity of the problem"
3050 FIXME update for final resolution of core issue 696. */
3051 if (decl_constant_var_p (decl
))
3053 if (processing_template_decl
)
3054 /* In a template, the constant value may not be in a usable
3055 form, so look it up again at instantiation time. */
3056 return id_expression
;
3058 return integral_constant_value (decl
);
3061 /* If we are in a lambda function, we can move out until we hit
3063 2. a non-lambda function, or
3064 3. a non-default capturing lambda function. */
3065 while (context
!= containing_function
3066 && LAMBDA_FUNCTION_P (containing_function
))
3068 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
3069 (DECL_CONTEXT (containing_function
));
3071 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
3075 lambda_stack
= tree_cons (NULL_TREE
,
3080 = decl_function_context (containing_function
);
3083 if (context
== containing_function
)
3085 decl
= add_default_capture (lambda_stack
,
3086 /*id=*/DECL_NAME (decl
),
3089 else if (lambda_expr
)
3091 error ("%qD is not captured", decl
);
3092 return error_mark_node
;
3096 error (TREE_CODE (decl
) == VAR_DECL
3097 ? G_("use of local variable with automatic storage from containing function")
3098 : G_("use of parameter from containing function"));
3099 error (" %q+#D declared here", decl
);
3100 return error_mark_node
;
3104 /* Also disallow uses of function parameters outside the function
3105 body, except inside an unevaluated context (i.e. decltype). */
3106 if (TREE_CODE (decl
) == PARM_DECL
3107 && DECL_CONTEXT (decl
) == NULL_TREE
3108 && !cp_unevaluated_operand
)
3110 error ("use of parameter %qD outside function body", decl
);
3111 return error_mark_node
;
3115 /* If we didn't find anything, or what we found was a type,
3116 then this wasn't really an id-expression. */
3117 if (TREE_CODE (decl
) == TEMPLATE_DECL
3118 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3120 *error_msg
= "missing template arguments";
3121 return error_mark_node
;
3123 else if (TREE_CODE (decl
) == TYPE_DECL
3124 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3126 *error_msg
= "expected primary-expression";
3127 return error_mark_node
;
3130 /* If the name resolved to a template parameter, there is no
3131 need to look it up again later. */
3132 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3133 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3137 *idk
= CP_ID_KIND_NONE
;
3138 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3139 decl
= TEMPLATE_PARM_DECL (decl
);
3140 r
= convert_from_reference (DECL_INITIAL (decl
));
3142 if (integral_constant_expression_p
3143 && !dependent_type_p (TREE_TYPE (decl
))
3144 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3146 if (!allow_non_integral_constant_expression_p
)
3147 error ("template parameter %qD of type %qT is not allowed in "
3148 "an integral constant expression because it is not of "
3149 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3150 *non_integral_constant_expression_p
= true;
3158 /* If the declaration was explicitly qualified indicate
3159 that. The semantics of `A::f(3)' are different than
3160 `f(3)' if `f' is virtual. */
3162 ? CP_ID_KIND_QUALIFIED
3163 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3164 ? CP_ID_KIND_TEMPLATE_ID
3165 : CP_ID_KIND_UNQUALIFIED
));
3170 An id-expression is type-dependent if it contains an
3171 identifier that was declared with a dependent type.
3173 The standard is not very specific about an id-expression that
3174 names a set of overloaded functions. What if some of them
3175 have dependent types and some of them do not? Presumably,
3176 such a name should be treated as a dependent name. */
3177 /* Assume the name is not dependent. */
3178 dependent_p
= false;
3179 if (!processing_template_decl
)
3180 /* No names are dependent outside a template. */
3182 else if (TREE_CODE (decl
) == CONST_DECL
)
3183 /* We don't want to treat enumerators as dependent. */
3185 /* A template-id where the name of the template was not resolved
3186 is definitely dependent. */
3187 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3188 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3189 == IDENTIFIER_NODE
))
3191 /* For anything except an overloaded function, just check its
3193 else if (!is_overloaded_fn (decl
))
3195 = dependent_type_p (TREE_TYPE (decl
));
3196 /* For a set of overloaded functions, check each of the
3202 if (BASELINK_P (fns
))
3203 fns
= BASELINK_FUNCTIONS (fns
);
3205 /* For a template-id, check to see if the template
3206 arguments are dependent. */
3207 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3209 tree args
= TREE_OPERAND (fns
, 1);
3210 dependent_p
= any_dependent_template_arguments_p (args
);
3211 /* The functions are those referred to by the
3213 fns
= TREE_OPERAND (fns
, 0);
3216 /* If there are no dependent template arguments, go through
3217 the overloaded functions. */
3218 while (fns
&& !dependent_p
)
3220 tree fn
= OVL_CURRENT (fns
);
3222 /* Member functions of dependent classes are
3224 if (TREE_CODE (fn
) == FUNCTION_DECL
3225 && type_dependent_expression_p (fn
))
3227 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3228 && dependent_template_p (fn
))
3231 fns
= OVL_NEXT (fns
);
3235 /* If the name was dependent on a template parameter, we will
3236 resolve the name at instantiation time. */
3239 /* Create a SCOPE_REF for qualified names, if the scope is
3245 if (address_p
&& done
)
3246 decl
= finish_qualified_id_expr (scope
, decl
,
3250 tf_warning_or_error
);
3253 tree type
= NULL_TREE
;
3254 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3255 type
= TREE_TYPE (decl
);
3256 decl
= build_qualified_name (type
,
3262 if (TREE_TYPE (decl
))
3263 decl
= convert_from_reference (decl
);
3266 /* A TEMPLATE_ID already contains all the information we
3268 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3269 return id_expression
;
3270 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3271 /* If we found a variable, then name lookup during the
3272 instantiation will always resolve to the same VAR_DECL
3273 (or an instantiation thereof). */
3274 if (TREE_CODE (decl
) == VAR_DECL
3275 || TREE_CODE (decl
) == PARM_DECL
)
3278 return convert_from_reference (decl
);
3280 /* The same is true for FIELD_DECL, but we also need to
3281 make sure that the syntax is correct. */
3282 else if (TREE_CODE (decl
) == FIELD_DECL
)
3284 /* Since SCOPE is NULL here, this is an unqualified name.
3285 Access checking has been performed during name lookup
3286 already. Turn off checking to avoid duplicate errors. */
3287 push_deferring_access_checks (dk_no_check
);
3288 decl
= finish_non_static_data_member
3290 /*qualifying_scope=*/NULL_TREE
);
3291 pop_deferring_access_checks ();
3294 return id_expression
;
3297 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3299 error ("use of namespace %qD as expression", decl
);
3300 return error_mark_node
;
3302 else if (DECL_CLASS_TEMPLATE_P (decl
))
3304 error ("use of class template %qT as expression", decl
);
3305 return error_mark_node
;
3307 else if (TREE_CODE (decl
) == TREE_LIST
)
3309 /* Ambiguous reference to base members. */
3310 error ("request for member %qD is ambiguous in "
3311 "multiple inheritance lattice", id_expression
);
3312 print_candidates (decl
);
3313 return error_mark_node
;
3316 /* Mark variable-like entities as used. Functions are similarly
3317 marked either below or after overload resolution. */
3318 if ((TREE_CODE (decl
) == VAR_DECL
3319 || TREE_CODE (decl
) == PARM_DECL
3320 || TREE_CODE (decl
) == CONST_DECL
3321 || TREE_CODE (decl
) == RESULT_DECL
)
3322 && !mark_used (decl
))
3323 return error_mark_node
;
3325 /* Only certain kinds of names are allowed in constant
3326 expression. Template parameters have already
3327 been handled above. */
3328 if (! error_operand_p (decl
)
3329 && integral_constant_expression_p
3330 && ! decl_constant_var_p (decl
)
3331 && TREE_CODE (decl
) != CONST_DECL
3332 && ! builtin_valid_in_constant_expr_p (decl
))
3334 if (!allow_non_integral_constant_expression_p
)
3336 error ("%qD cannot appear in a constant-expression", decl
);
3337 return error_mark_node
;
3339 *non_integral_constant_expression_p
= true;
3343 if (TREE_CODE (decl
) == VAR_DECL
3344 && !cp_unevaluated_operand
3345 && DECL_THREAD_LOCAL_P (decl
)
3346 && (wrap
= get_tls_wrapper_fn (decl
)))
3348 /* Replace an evaluated use of the thread_local variable with
3349 a call to its wrapper. */
3350 decl
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
3354 decl
= (adjust_result_of_qualified_name_lookup
3355 (decl
, scope
, current_nonlambda_class_type()));
3357 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3361 decl
= finish_qualified_id_expr (scope
,
3367 tf_warning_or_error
);
3369 decl
= convert_from_reference (decl
);
3371 else if (TREE_CODE (decl
) == FIELD_DECL
)
3373 /* Since SCOPE is NULL here, this is an unqualified name.
3374 Access checking has been performed during name lookup
3375 already. Turn off checking to avoid duplicate errors. */
3376 push_deferring_access_checks (dk_no_check
);
3377 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3378 /*qualifying_scope=*/NULL_TREE
);
3379 pop_deferring_access_checks ();
3381 else if (is_overloaded_fn (decl
))
3385 first_fn
= get_first_fn (decl
);
3386 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3387 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3389 if (!really_overloaded_fn (decl
)
3390 && !mark_used (first_fn
))
3391 return error_mark_node
;
3394 && TREE_CODE (first_fn
) == FUNCTION_DECL
3395 && DECL_FUNCTION_MEMBER_P (first_fn
)
3396 && !shared_member_p (decl
))
3398 /* A set of member functions. */
3399 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3400 return finish_class_member_access_expr (decl
, id_expression
,
3401 /*template_p=*/false,
3402 tf_warning_or_error
);
3405 decl
= baselink_for_fns (decl
);
3409 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3410 && DECL_CLASS_SCOPE_P (decl
))
3412 tree context
= context_for_name_lookup (decl
);
3413 if (context
!= current_class_type
)
3415 tree path
= currently_open_derived_class (context
);
3416 perform_or_defer_access_check (TYPE_BINFO (path
),
3418 tf_warning_or_error
);
3422 decl
= convert_from_reference (decl
);
3426 if (TREE_DEPRECATED (decl
))
3427 warn_deprecated_use (decl
, NULL_TREE
);
3432 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3433 use as a type-specifier. */
3436 finish_typeof (tree expr
)
3440 if (type_dependent_expression_p (expr
))
3442 type
= cxx_make_type (TYPEOF_TYPE
);
3443 TYPEOF_TYPE_EXPR (type
) = expr
;
3444 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3449 expr
= mark_type_use (expr
);
3451 type
= unlowered_expr_type (expr
);
3453 if (!type
|| type
== unknown_type_node
)
3455 error ("type of %qE is unknown", expr
);
3456 return error_mark_node
;
3462 /* Implement the __underlying_type keyword: Return the underlying
3463 type of TYPE, suitable for use as a type-specifier. */
3466 finish_underlying_type (tree type
)
3468 tree underlying_type
;
3470 if (processing_template_decl
)
3472 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3473 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3474 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3476 return underlying_type
;
3479 complete_type (type
);
3481 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3483 error ("%qT is not an enumeration type", type
);
3484 return error_mark_node
;
3487 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3489 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3490 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3491 See finish_enum_value_list for details. */
3492 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3494 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3495 TYPE_UNSIGNED (underlying_type
));
3497 return underlying_type
;
3500 /* Implement the __direct_bases keyword: Return the direct base classes
3504 calculate_direct_bases (tree type
)
3506 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3507 tree bases_vec
= NULL_TREE
;
3508 vec
<tree
, va_gc
> *base_binfos
;
3512 complete_type (type
);
3514 if (!NON_UNION_CLASS_TYPE_P (type
))
3515 return make_tree_vec (0);
3517 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3519 /* Virtual bases are initialized first */
3520 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3522 if (BINFO_VIRTUAL_P (binfo
))
3524 vec_safe_push (vector
, binfo
);
3528 /* Now non-virtuals */
3529 for (i
= 0; base_binfos
->iterate (i
, &binfo
); i
++)
3531 if (!BINFO_VIRTUAL_P (binfo
))
3533 vec_safe_push (vector
, binfo
);
3538 bases_vec
= make_tree_vec (vector
->length ());
3540 for (i
= 0; i
< vector
->length (); ++i
)
3542 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE ((*vector
)[i
]);
3547 /* Implement the __bases keyword: Return the base classes
3550 /* Find morally non-virtual base classes by walking binfo hierarchy */
3551 /* Virtual base classes are handled separately in finish_bases */
3554 dfs_calculate_bases_pre (tree binfo
, void * /*data_*/)
3556 /* Don't walk bases of virtual bases */
3557 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3561 dfs_calculate_bases_post (tree binfo
, void *data_
)
3563 vec
<tree
, va_gc
> **data
= ((vec
<tree
, va_gc
> **) data_
);
3564 if (!BINFO_VIRTUAL_P (binfo
))
3566 vec_safe_push (*data
, BINFO_TYPE (binfo
));
3571 /* Calculates the morally non-virtual base classes of a class */
3572 static vec
<tree
, va_gc
> *
3573 calculate_bases_helper (tree type
)
3575 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3577 /* Now add non-virtual base classes in order of construction */
3578 dfs_walk_all (TYPE_BINFO (type
),
3579 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3584 calculate_bases (tree type
)
3586 vec
<tree
, va_gc
> *vector
= make_tree_vector();
3587 tree bases_vec
= NULL_TREE
;
3589 vec
<tree
, va_gc
> *vbases
;
3590 vec
<tree
, va_gc
> *nonvbases
;
3593 complete_type (type
);
3595 if (!NON_UNION_CLASS_TYPE_P (type
))
3596 return make_tree_vec (0);
3598 /* First go through virtual base classes */
3599 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3600 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
3602 vec
<tree
, va_gc
> *vbase_bases
;
3603 vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3604 vec_safe_splice (vector
, vbase_bases
);
3605 release_tree_vector (vbase_bases
);
3608 /* Now for the non-virtual bases */
3609 nonvbases
= calculate_bases_helper (type
);
3610 vec_safe_splice (vector
, nonvbases
);
3611 release_tree_vector (nonvbases
);
3613 /* Last element is entire class, so don't copy */
3614 bases_vec
= make_tree_vec (vector
->length () - 1);
3616 for (i
= 0; i
< vector
->length () - 1; ++i
)
3618 TREE_VEC_ELT (bases_vec
, i
) = (*vector
)[i
];
3620 release_tree_vector (vector
);
3625 finish_bases (tree type
, bool direct
)
3627 tree bases
= NULL_TREE
;
3629 if (!processing_template_decl
)
3631 /* Parameter packs can only be used in templates */
3632 error ("Parameter pack __bases only valid in template declaration");
3633 return error_mark_node
;
3636 bases
= cxx_make_type (BASES
);
3637 BASES_TYPE (bases
) = type
;
3638 BASES_DIRECT (bases
) = direct
;
3639 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3644 /* Perform C++-specific checks for __builtin_offsetof before calling
3648 finish_offsetof (tree expr
)
3650 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3652 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3653 TREE_OPERAND (expr
, 2));
3654 return error_mark_node
;
3656 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3657 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3658 || TREE_TYPE (expr
) == unknown_type_node
)
3660 if (TREE_CODE (expr
) == COMPONENT_REF
3661 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3662 expr
= TREE_OPERAND (expr
, 1);
3663 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3664 return error_mark_node
;
3666 if (REFERENCE_REF_P (expr
))
3667 expr
= TREE_OPERAND (expr
, 0);
3668 if (TREE_CODE (expr
) == COMPONENT_REF
)
3670 tree object
= TREE_OPERAND (expr
, 0);
3671 if (!complete_type_or_else (TREE_TYPE (object
), object
))
3672 return error_mark_node
;
3674 return fold_offsetof (expr
);
3677 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3678 function is broken out from the above for the benefit of the tree-ssa
3682 simplify_aggr_init_expr (tree
*tp
)
3684 tree aggr_init_expr
= *tp
;
3686 /* Form an appropriate CALL_EXPR. */
3687 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3688 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3689 tree type
= TREE_TYPE (slot
);
3692 enum style_t
{ ctor
, arg
, pcc
} style
;
3694 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3696 #ifdef PCC_STATIC_STRUCT_RETURN
3702 gcc_assert (TREE_ADDRESSABLE (type
));
3706 call_expr
= build_call_array_loc (input_location
,
3707 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3709 aggr_init_expr_nargs (aggr_init_expr
),
3710 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3711 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3715 /* Replace the first argument to the ctor with the address of the
3717 cxx_mark_addressable (slot
);
3718 CALL_EXPR_ARG (call_expr
, 0) =
3719 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3721 else if (style
== arg
)
3723 /* Just mark it addressable here, and leave the rest to
3724 expand_call{,_inline}. */
3725 cxx_mark_addressable (slot
);
3726 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3727 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3729 else if (style
== pcc
)
3731 /* If we're using the non-reentrant PCC calling convention, then we
3732 need to copy the returned value out of the static buffer into the
3734 push_deferring_access_checks (dk_no_check
);
3735 call_expr
= build_aggr_init (slot
, call_expr
,
3736 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3737 tf_warning_or_error
);
3738 pop_deferring_access_checks ();
3739 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3742 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3744 tree init
= build_zero_init (type
, NULL_TREE
,
3745 /*static_storage_p=*/false);
3746 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3747 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3754 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3757 emit_associated_thunks (tree fn
)
3759 /* When we use vcall offsets, we emit thunks with the virtual
3760 functions to which they thunk. The whole point of vcall offsets
3761 is so that you can know statically the entire set of thunks that
3762 will ever be needed for a given virtual function, thereby
3763 enabling you to output all the thunks with the function itself. */
3764 if (DECL_VIRTUAL_P (fn
)
3765 /* Do not emit thunks for extern template instantiations. */
3766 && ! DECL_REALLY_EXTERN (fn
))
3770 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3772 if (!THUNK_ALIAS (thunk
))
3774 use_thunk (thunk
, /*emit_p=*/1);
3775 if (DECL_RESULT_THUNK_P (thunk
))
3779 for (probe
= DECL_THUNKS (thunk
);
3780 probe
; probe
= DECL_CHAIN (probe
))
3781 use_thunk (probe
, /*emit_p=*/1);
3785 gcc_assert (!DECL_THUNKS (thunk
));
3790 /* Returns true iff FUN is an instantiation of a constexpr function
3794 is_instantiation_of_constexpr (tree fun
)
3796 return (DECL_TEMPLOID_INSTANTIATION (fun
)
3797 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3798 (DECL_TI_TEMPLATE (fun
))));
3801 /* Generate RTL for FN. */
3804 expand_or_defer_fn_1 (tree fn
)
3806 /* When the parser calls us after finishing the body of a template
3807 function, we don't really want to expand the body. */
3808 if (processing_template_decl
)
3810 /* Normally, collection only occurs in rest_of_compilation. So,
3811 if we don't collect here, we never collect junk generated
3812 during the processing of templates until we hit a
3813 non-template function. It's not safe to do this inside a
3814 nested class, though, as the parser may have local state that
3815 is not a GC root. */
3816 if (!function_depth
)
3821 gcc_assert (DECL_SAVED_TREE (fn
));
3823 /* If this is a constructor or destructor body, we have to clone
3825 if (maybe_clone_body (fn
))
3827 /* We don't want to process FN again, so pretend we've written
3828 it out, even though we haven't. */
3829 TREE_ASM_WRITTEN (fn
) = 1;
3830 /* If this is an instantiation of a constexpr function, keep
3831 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3832 if (!is_instantiation_of_constexpr (fn
))
3833 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3837 /* We make a decision about linkage for these functions at the end
3838 of the compilation. Until that point, we do not want the back
3839 end to output them -- but we do want it to see the bodies of
3840 these functions so that it can inline them as appropriate. */
3841 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3843 if (DECL_INTERFACE_KNOWN (fn
))
3844 /* We've already made a decision as to how this function will
3848 DECL_EXTERNAL (fn
) = 1;
3849 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3850 note_vague_linkage_fn (fn
);
3851 /* A non-template inline function with external linkage will
3852 always be COMDAT. As we must eventually determine the
3853 linkage of all functions, and as that causes writes to
3854 the data mapped in from the PCH file, it's advantageous
3855 to mark the functions at this point. */
3856 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3858 /* This function must have external linkage, as
3859 otherwise DECL_INTERFACE_KNOWN would have been
3861 gcc_assert (TREE_PUBLIC (fn
));
3862 comdat_linkage (fn
);
3863 DECL_INTERFACE_KNOWN (fn
) = 1;
3867 import_export_decl (fn
);
3869 /* If the user wants us to keep all inline functions, then mark
3870 this function as needed so that finish_file will make sure to
3871 output it later. Similarly, all dllexport'd functions must
3872 be emitted; there may be callers in other DLLs. */
3873 if ((flag_keep_inline_functions
3874 && DECL_DECLARED_INLINE_P (fn
)
3875 && !DECL_REALLY_EXTERN (fn
))
3876 || (flag_keep_inline_dllexport
3877 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3880 DECL_EXTERNAL (fn
) = 0;
3884 /* There's no reason to do any of the work here if we're only doing
3885 semantic analysis; this code just generates RTL. */
3886 if (flag_syntax_only
)
3893 expand_or_defer_fn (tree fn
)
3895 if (expand_or_defer_fn_1 (fn
))
3899 /* Expand or defer, at the whim of the compilation unit manager. */
3900 cgraph_finalize_function (fn
, function_depth
> 1);
3901 emit_associated_thunks (fn
);
3911 hash_table
<pointer_hash
<tree_node
> > visited
;
3914 /* Helper function for walk_tree, used by finalize_nrv below. */
3917 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3919 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3922 /* No need to walk into types. There wouldn't be any need to walk into
3923 non-statements, except that we have to consider STMT_EXPRs. */
3926 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3927 but differs from using NULL_TREE in that it indicates that we care
3928 about the value of the RESULT_DECL. */
3929 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3930 TREE_OPERAND (*tp
, 0) = dp
->result
;
3931 /* Change all cleanups for the NRV to only run when an exception is
3933 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3934 && CLEANUP_DECL (*tp
) == dp
->var
)
3935 CLEANUP_EH_ONLY (*tp
) = 1;
3936 /* Replace the DECL_EXPR for the NRV with an initialization of the
3937 RESULT_DECL, if needed. */
3938 else if (TREE_CODE (*tp
) == DECL_EXPR
3939 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3942 if (DECL_INITIAL (dp
->var
)
3943 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3944 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3945 DECL_INITIAL (dp
->var
));
3947 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3948 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3949 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3952 /* And replace all uses of the NRV with the RESULT_DECL. */
3953 else if (*tp
== dp
->var
)
3956 /* Avoid walking into the same tree more than once. Unfortunately, we
3957 can't just use walk_tree_without duplicates because it would only call
3958 us for the first occurrence of dp->var in the function body. */
3959 slot
= dp
->visited
.find_slot (*tp
, INSERT
);
3965 /* Keep iterating. */
3969 /* Called from finish_function to implement the named return value
3970 optimization by overriding all the RETURN_EXPRs and pertinent
3971 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3972 RESULT_DECL for the function. */
3975 finalize_nrv (tree
*tp
, tree var
, tree result
)
3977 struct nrv_data data
;
3979 /* Copy name from VAR to RESULT. */
3980 DECL_NAME (result
) = DECL_NAME (var
);
3981 /* Don't forget that we take its address. */
3982 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3983 /* Finally set DECL_VALUE_EXPR to avoid assigning
3984 a stack slot at -O0 for the original var and debug info
3985 uses RESULT location for VAR. */
3986 SET_DECL_VALUE_EXPR (var
, result
);
3987 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3990 data
.result
= result
;
3991 data
.visited
.create (37);
3992 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3993 data
.visited
.dispose ();
3996 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3999 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
4000 bool need_copy_ctor
, bool need_copy_assignment
)
4002 int save_errorcount
= errorcount
;
4005 /* Always allocate 3 elements for simplicity. These are the
4006 function decls for the ctor, dtor, and assignment op.
4007 This layout is known to the three lang hooks,
4008 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4009 and cxx_omp_clause_assign_op. */
4010 info
= make_tree_vec (3);
4011 CP_OMP_CLAUSE_INFO (c
) = info
;
4013 if (need_default_ctor
|| need_copy_ctor
)
4015 if (need_default_ctor
)
4016 t
= get_default_ctor (type
);
4018 t
= get_copy_ctor (type
, tf_warning_or_error
);
4020 if (t
&& !trivial_fn_p (t
))
4021 TREE_VEC_ELT (info
, 0) = t
;
4024 if ((need_default_ctor
|| need_copy_ctor
)
4025 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
4026 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
4028 if (need_copy_assignment
)
4030 t
= get_copy_assign (type
);
4032 if (t
&& !trivial_fn_p (t
))
4033 TREE_VEC_ELT (info
, 2) = t
;
4036 return errorcount
!= save_errorcount
;
4039 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
4040 Remove any elements from the list that are invalid. */
4043 finish_omp_clauses (tree clauses
)
4045 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
4046 tree c
, t
, *pc
= &clauses
;
4049 bitmap_obstack_initialize (NULL
);
4050 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
4051 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
4052 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
4054 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
4056 bool remove
= false;
4058 switch (OMP_CLAUSE_CODE (c
))
4060 case OMP_CLAUSE_SHARED
:
4062 goto check_dup_generic
;
4063 case OMP_CLAUSE_PRIVATE
:
4065 goto check_dup_generic
;
4066 case OMP_CLAUSE_REDUCTION
:
4068 goto check_dup_generic
;
4069 case OMP_CLAUSE_COPYPRIVATE
:
4070 name
= "copyprivate";
4071 goto check_dup_generic
;
4072 case OMP_CLAUSE_COPYIN
:
4074 goto check_dup_generic
;
4076 t
= OMP_CLAUSE_DECL (c
);
4077 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4079 if (processing_template_decl
)
4082 error ("%qD is not a variable in clause %qs", t
, name
);
4084 error ("%qE is not a variable in clause %qs", t
, name
);
4087 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4088 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
4089 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4091 error ("%qD appears more than once in data clauses", t
);
4095 bitmap_set_bit (&generic_head
, DECL_UID (t
));
4098 case OMP_CLAUSE_FIRSTPRIVATE
:
4099 t
= OMP_CLAUSE_DECL (c
);
4100 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4102 if (processing_template_decl
)
4105 error ("%qD is not a variable in clause %<firstprivate%>", t
);
4107 error ("%qE is not a variable in clause %<firstprivate%>", t
);
4110 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4111 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4113 error ("%qD appears more than once in data clauses", t
);
4117 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
4120 case OMP_CLAUSE_LASTPRIVATE
:
4121 t
= OMP_CLAUSE_DECL (c
);
4122 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4124 if (processing_template_decl
)
4127 error ("%qD is not a variable in clause %<lastprivate%>", t
);
4129 error ("%qE is not a variable in clause %<lastprivate%>", t
);
4132 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4133 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4135 error ("%qD appears more than once in data clauses", t
);
4139 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
4143 t
= OMP_CLAUSE_IF_EXPR (c
);
4144 t
= maybe_convert_cond (t
);
4145 if (t
== error_mark_node
)
4147 else if (!processing_template_decl
)
4148 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4149 OMP_CLAUSE_IF_EXPR (c
) = t
;
4152 case OMP_CLAUSE_FINAL
:
4153 t
= OMP_CLAUSE_FINAL_EXPR (c
);
4154 t
= maybe_convert_cond (t
);
4155 if (t
== error_mark_node
)
4157 else if (!processing_template_decl
)
4158 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4159 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
4162 case OMP_CLAUSE_NUM_THREADS
:
4163 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
4164 if (t
== error_mark_node
)
4166 else if (!type_dependent_expression_p (t
)
4167 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4169 error ("num_threads expression must be integral");
4174 t
= mark_rvalue_use (t
);
4175 if (!processing_template_decl
)
4176 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4177 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
4181 case OMP_CLAUSE_SCHEDULE
:
4182 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
4185 else if (t
== error_mark_node
)
4187 else if (!type_dependent_expression_p (t
)
4188 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4190 error ("schedule chunk size expression must be integral");
4195 t
= mark_rvalue_use (t
);
4196 if (!processing_template_decl
)
4197 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4198 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
4202 case OMP_CLAUSE_NOWAIT
:
4203 case OMP_CLAUSE_ORDERED
:
4204 case OMP_CLAUSE_DEFAULT
:
4205 case OMP_CLAUSE_UNTIED
:
4206 case OMP_CLAUSE_COLLAPSE
:
4207 case OMP_CLAUSE_MERGEABLE
:
4215 *pc
= OMP_CLAUSE_CHAIN (c
);
4217 pc
= &OMP_CLAUSE_CHAIN (c
);
4220 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
4222 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
4223 bool remove
= false;
4224 bool need_complete_non_reference
= false;
4225 bool need_default_ctor
= false;
4226 bool need_copy_ctor
= false;
4227 bool need_copy_assignment
= false;
4228 bool need_implicitly_determined
= false;
4229 tree type
, inner_type
;
4233 case OMP_CLAUSE_SHARED
:
4235 need_implicitly_determined
= true;
4237 case OMP_CLAUSE_PRIVATE
:
4239 need_complete_non_reference
= true;
4240 need_default_ctor
= true;
4241 need_implicitly_determined
= true;
4243 case OMP_CLAUSE_FIRSTPRIVATE
:
4244 name
= "firstprivate";
4245 need_complete_non_reference
= true;
4246 need_copy_ctor
= true;
4247 need_implicitly_determined
= true;
4249 case OMP_CLAUSE_LASTPRIVATE
:
4250 name
= "lastprivate";
4251 need_complete_non_reference
= true;
4252 need_copy_assignment
= true;
4253 need_implicitly_determined
= true;
4255 case OMP_CLAUSE_REDUCTION
:
4257 need_implicitly_determined
= true;
4259 case OMP_CLAUSE_COPYPRIVATE
:
4260 name
= "copyprivate";
4261 need_copy_assignment
= true;
4263 case OMP_CLAUSE_COPYIN
:
4265 need_copy_assignment
= true;
4268 pc
= &OMP_CLAUSE_CHAIN (c
);
4272 t
= OMP_CLAUSE_DECL (c
);
4273 if (processing_template_decl
4274 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4276 pc
= &OMP_CLAUSE_CHAIN (c
);
4282 case OMP_CLAUSE_LASTPRIVATE
:
4283 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4284 need_default_ctor
= true;
4287 case OMP_CLAUSE_REDUCTION
:
4288 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4289 || POINTER_TYPE_P (TREE_TYPE (t
)))
4291 error ("%qE has invalid type for %<reduction%>", t
);
4294 else if (FLOAT_TYPE_P (TREE_TYPE (t
))
4295 || TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
4297 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
4306 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
4307 r_code
= ERROR_MARK
;
4313 r_code
= ERROR_MARK
;
4315 case TRUTH_ANDIF_EXPR
:
4316 case TRUTH_ORIF_EXPR
:
4317 if (FLOAT_TYPE_P (TREE_TYPE (t
)))
4318 r_code
= ERROR_MARK
;
4321 if (r_code
== ERROR_MARK
)
4323 error ("%qE has invalid type for %<reduction(%s)%>",
4324 t
, operator_name_info
[r_code
].name
);
4330 case OMP_CLAUSE_COPYIN
:
4331 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
4333 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
4342 if (need_complete_non_reference
|| need_copy_assignment
)
4344 t
= require_complete_type (t
);
4345 if (t
== error_mark_node
)
4347 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4348 && need_complete_non_reference
)
4350 error ("%qE has reference type for %qs", t
, name
);
4354 if (need_implicitly_determined
)
4356 const char *share_name
= NULL
;
4358 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4359 share_name
= "threadprivate";
4360 else switch (cxx_omp_predetermined_sharing (t
))
4362 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
4364 case OMP_CLAUSE_DEFAULT_SHARED
:
4365 /* const vars may be specified in firstprivate clause. */
4366 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
4367 && cxx_omp_const_qual_no_mutable (t
))
4369 share_name
= "shared";
4371 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4372 share_name
= "private";
4379 error ("%qE is predetermined %qs for %qs",
4380 t
, share_name
, name
);
4385 /* We're interested in the base element, not arrays. */
4386 inner_type
= type
= TREE_TYPE (t
);
4387 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
4388 inner_type
= TREE_TYPE (inner_type
);
4390 /* Check for special function availability by building a call to one.
4391 Save the results, because later we won't be in the right context
4392 for making these queries. */
4393 if (CLASS_TYPE_P (inner_type
)
4394 && COMPLETE_TYPE_P (inner_type
)
4395 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
4396 && !type_dependent_expression_p (t
)
4397 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
4398 need_copy_ctor
, need_copy_assignment
))
4402 *pc
= OMP_CLAUSE_CHAIN (c
);
4404 pc
= &OMP_CLAUSE_CHAIN (c
);
4407 bitmap_obstack_release (NULL
);
4411 /* For all variables in the tree_list VARS, mark them as thread local. */
4414 finish_omp_threadprivate (tree vars
)
4418 /* Mark every variable in VARS to be assigned thread local storage. */
4419 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4421 tree v
= TREE_PURPOSE (t
);
4423 if (error_operand_p (v
))
4425 else if (TREE_CODE (v
) != VAR_DECL
)
4426 error ("%<threadprivate%> %qD is not file, namespace "
4427 "or block scope variable", v
);
4428 /* If V had already been marked threadprivate, it doesn't matter
4429 whether it had been used prior to this point. */
4430 else if (TREE_USED (v
)
4431 && (DECL_LANG_SPECIFIC (v
) == NULL
4432 || !CP_DECL_THREADPRIVATE_P (v
)))
4433 error ("%qE declared %<threadprivate%> after first use", v
);
4434 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4435 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4436 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v
))))
4437 error ("%<threadprivate%> %qE has incomplete type", v
);
4438 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4439 && CP_DECL_CONTEXT (v
) != current_class_type
)
4440 error ("%<threadprivate%> %qE directive not "
4441 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4444 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4445 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4447 retrofit_lang_decl (v
);
4449 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4450 after the allocation of the lang_decl structure. */
4451 if (DECL_DISCRIMINATOR_P (v
))
4452 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4455 if (! DECL_THREAD_LOCAL_P (v
))
4457 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4458 /* If rtl has been already set for this var, call
4459 make_decl_rtl once again, so that encode_section_info
4460 has a chance to look at the new decl flags. */
4461 if (DECL_RTL_SET_P (v
))
4464 CP_DECL_THREADPRIVATE_P (v
) = 1;
4469 /* Build an OpenMP structured block. */
4472 begin_omp_structured_block (void)
4474 return do_pushlevel (sk_omp
);
4478 finish_omp_structured_block (tree block
)
4480 return do_poplevel (block
);
4483 /* Similarly, except force the retention of the BLOCK. */
4486 begin_omp_parallel (void)
4488 keep_next_level (true);
4489 return begin_omp_structured_block ();
4493 finish_omp_parallel (tree clauses
, tree body
)
4497 body
= finish_omp_structured_block (body
);
4499 stmt
= make_node (OMP_PARALLEL
);
4500 TREE_TYPE (stmt
) = void_type_node
;
4501 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4502 OMP_PARALLEL_BODY (stmt
) = body
;
4504 return add_stmt (stmt
);
4508 begin_omp_task (void)
4510 keep_next_level (true);
4511 return begin_omp_structured_block ();
4515 finish_omp_task (tree clauses
, tree body
)
4519 body
= finish_omp_structured_block (body
);
4521 stmt
= make_node (OMP_TASK
);
4522 TREE_TYPE (stmt
) = void_type_node
;
4523 OMP_TASK_CLAUSES (stmt
) = clauses
;
4524 OMP_TASK_BODY (stmt
) = body
;
4526 return add_stmt (stmt
);
4529 /* Helper function for finish_omp_for. Convert Ith random access iterator
4530 into integral iterator. Return FALSE if successful. */
4533 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4534 tree condv
, tree incrv
, tree
*body
,
4535 tree
*pre_body
, tree clauses
)
4537 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4538 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4539 tree decl
= TREE_VEC_ELT (declv
, i
);
4540 tree init
= TREE_VEC_ELT (initv
, i
);
4541 tree cond
= TREE_VEC_ELT (condv
, i
);
4542 tree incr
= TREE_VEC_ELT (incrv
, i
);
4544 location_t elocus
= locus
;
4546 if (init
&& EXPR_HAS_LOCATION (init
))
4547 elocus
= EXPR_LOCATION (init
);
4549 switch (TREE_CODE (cond
))
4555 if (TREE_OPERAND (cond
, 1) == iter
)
4556 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4557 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4558 if (TREE_OPERAND (cond
, 0) != iter
)
4559 cond
= error_mark_node
;
4562 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
4565 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4566 NULL
, tf_warning_or_error
);
4567 if (error_operand_p (tem
))
4572 cond
= error_mark_node
;
4575 if (cond
== error_mark_node
)
4577 error_at (elocus
, "invalid controlling predicate");
4580 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4581 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4582 tf_warning_or_error
);
4583 if (error_operand_p (diff
))
4585 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4587 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4588 TREE_OPERAND (cond
, 1), iter
);
4592 switch (TREE_CODE (incr
))
4594 case PREINCREMENT_EXPR
:
4595 case PREDECREMENT_EXPR
:
4596 case POSTINCREMENT_EXPR
:
4597 case POSTDECREMENT_EXPR
:
4598 if (TREE_OPERAND (incr
, 0) != iter
)
4600 incr
= error_mark_node
;
4603 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
4604 TREE_CODE (incr
), iter
,
4605 tf_warning_or_error
);
4606 if (error_operand_p (iter_incr
))
4608 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4609 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4610 incr
= integer_one_node
;
4612 incr
= integer_minus_one_node
;
4615 if (TREE_OPERAND (incr
, 0) != iter
)
4616 incr
= error_mark_node
;
4617 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4618 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4620 tree rhs
= TREE_OPERAND (incr
, 1);
4621 if (TREE_OPERAND (rhs
, 0) == iter
)
4623 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4625 incr
= error_mark_node
;
4628 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
4629 iter
, TREE_CODE (rhs
),
4630 TREE_OPERAND (rhs
, 1),
4631 tf_warning_or_error
);
4632 if (error_operand_p (iter_incr
))
4634 incr
= TREE_OPERAND (rhs
, 1);
4635 incr
= cp_convert (TREE_TYPE (diff
), incr
,
4636 tf_warning_or_error
);
4637 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4639 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4640 incr
= fold_if_not_in_template (incr
);
4642 if (TREE_CODE (incr
) != INTEGER_CST
4643 && (TREE_CODE (incr
) != NOP_EXPR
4644 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4649 else if (TREE_OPERAND (rhs
, 1) == iter
)
4651 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4652 || TREE_CODE (rhs
) != PLUS_EXPR
)
4653 incr
= error_mark_node
;
4656 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
4658 TREE_OPERAND (rhs
, 0),
4661 tf_warning_or_error
);
4662 if (error_operand_p (iter_incr
))
4664 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
4667 tf_warning_or_error
);
4668 if (error_operand_p (iter_incr
))
4670 incr
= TREE_OPERAND (rhs
, 0);
4675 incr
= error_mark_node
;
4678 incr
= error_mark_node
;
4681 incr
= error_mark_node
;
4685 if (incr
== error_mark_node
)
4687 error_at (elocus
, "invalid increment expression");
4691 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
4692 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4693 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4694 && OMP_CLAUSE_DECL (c
) == iter
)
4697 decl
= create_temporary_var (TREE_TYPE (diff
));
4699 add_decl_expr (decl
);
4700 last
= create_temporary_var (TREE_TYPE (diff
));
4702 add_decl_expr (last
);
4703 if (c
&& iter_incr
== NULL
)
4705 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4706 pushdecl (incr_var
);
4707 add_decl_expr (incr_var
);
4709 gcc_assert (stmts_are_full_exprs_p ());
4711 orig_pre_body
= *pre_body
;
4712 *pre_body
= push_stmt_list ();
4714 add_stmt (orig_pre_body
);
4716 finish_expr_stmt (build_x_modify_expr (elocus
,
4717 iter
, NOP_EXPR
, init
,
4718 tf_warning_or_error
));
4719 init
= build_int_cst (TREE_TYPE (diff
), 0);
4720 if (c
&& iter_incr
== NULL
)
4722 finish_expr_stmt (build_x_modify_expr (elocus
,
4724 incr
, tf_warning_or_error
));
4726 iter_incr
= build_x_modify_expr (elocus
,
4727 iter
, PLUS_EXPR
, incr
,
4728 tf_warning_or_error
);
4730 finish_expr_stmt (build_x_modify_expr (elocus
,
4731 last
, NOP_EXPR
, init
,
4732 tf_warning_or_error
));
4733 *pre_body
= pop_stmt_list (*pre_body
);
4735 cond
= cp_build_binary_op (elocus
,
4736 TREE_CODE (cond
), decl
, diff
,
4737 tf_warning_or_error
);
4738 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4739 elocus
, incr
, NULL_TREE
);
4742 *body
= push_stmt_list ();
4743 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4744 iter_init
= build_x_modify_expr (elocus
,
4745 iter
, PLUS_EXPR
, iter_init
,
4746 tf_warning_or_error
);
4747 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4748 finish_expr_stmt (iter_init
);
4749 finish_expr_stmt (build_x_modify_expr (elocus
,
4750 last
, NOP_EXPR
, decl
,
4751 tf_warning_or_error
));
4752 add_stmt (orig_body
);
4753 *body
= pop_stmt_list (*body
);
4757 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4758 finish_expr_stmt (iter_incr
);
4759 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4760 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4763 TREE_VEC_ELT (declv
, i
) = decl
;
4764 TREE_VEC_ELT (initv
, i
) = init
;
4765 TREE_VEC_ELT (condv
, i
) = cond
;
4766 TREE_VEC_ELT (incrv
, i
) = incr
;
4771 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4772 are directly for their associated operands in the statement. DECL
4773 and INIT are a combo; if DECL is NULL then INIT ought to be a
4774 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4775 optional statements that need to go before the loop into its
4779 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4780 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4782 tree omp_for
= NULL
, orig_incr
= NULL
;
4783 tree decl
, init
, cond
, incr
;
4787 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4788 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4789 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4790 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4792 decl
= TREE_VEC_ELT (declv
, i
);
4793 init
= TREE_VEC_ELT (initv
, i
);
4794 cond
= TREE_VEC_ELT (condv
, i
);
4795 incr
= TREE_VEC_ELT (incrv
, i
);
4801 switch (TREE_CODE (init
))
4804 decl
= TREE_OPERAND (init
, 0);
4805 init
= TREE_OPERAND (init
, 1);
4808 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4810 decl
= TREE_OPERAND (init
, 0);
4811 init
= TREE_OPERAND (init
, 2);
4821 "expected iteration declaration or initialization");
4826 if (init
&& EXPR_HAS_LOCATION (init
))
4827 elocus
= EXPR_LOCATION (init
);
4831 error_at (elocus
, "missing controlling predicate");
4837 error_at (elocus
, "missing increment expression");
4841 TREE_VEC_ELT (declv
, i
) = decl
;
4842 TREE_VEC_ELT (initv
, i
) = init
;
4845 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4849 stmt
= make_node (OMP_FOR
);
4851 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4853 /* This is really just a place-holder. We'll be decomposing this
4854 again and going through the cp_build_modify_expr path below when
4855 we instantiate the thing. */
4856 TREE_VEC_ELT (initv
, i
)
4857 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4858 TREE_VEC_ELT (initv
, i
));
4861 TREE_TYPE (stmt
) = void_type_node
;
4862 OMP_FOR_INIT (stmt
) = initv
;
4863 OMP_FOR_COND (stmt
) = condv
;
4864 OMP_FOR_INCR (stmt
) = incrv
;
4865 OMP_FOR_BODY (stmt
) = body
;
4866 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4867 OMP_FOR_CLAUSES (stmt
) = clauses
;
4869 SET_EXPR_LOCATION (stmt
, locus
);
4870 return add_stmt (stmt
);
4873 if (processing_template_decl
)
4874 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4876 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4878 decl
= TREE_VEC_ELT (declv
, i
);
4879 init
= TREE_VEC_ELT (initv
, i
);
4880 cond
= TREE_VEC_ELT (condv
, i
);
4881 incr
= TREE_VEC_ELT (incrv
, i
);
4883 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4886 if (init
&& EXPR_HAS_LOCATION (init
))
4887 elocus
= EXPR_LOCATION (init
);
4891 error_at (elocus
, "expected iteration declaration or initialization");
4895 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4898 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4899 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4900 TREE_CODE (TREE_OPERAND (incr
, 1)),
4901 TREE_OPERAND (incr
, 2),
4902 tf_warning_or_error
);
4905 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4907 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4908 incrv
, &body
, &pre_body
, clauses
))
4913 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4914 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4916 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4920 if (!processing_template_decl
)
4922 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4923 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4926 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4928 && TREE_SIDE_EFFECTS (cond
)
4929 && COMPARISON_CLASS_P (cond
)
4930 && !processing_template_decl
)
4932 tree t
= TREE_OPERAND (cond
, 0);
4933 if (TREE_SIDE_EFFECTS (t
)
4935 && (TREE_CODE (t
) != NOP_EXPR
4936 || TREE_OPERAND (t
, 0) != decl
))
4937 TREE_OPERAND (cond
, 0)
4938 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4940 t
= TREE_OPERAND (cond
, 1);
4941 if (TREE_SIDE_EFFECTS (t
)
4943 && (TREE_CODE (t
) != NOP_EXPR
4944 || TREE_OPERAND (t
, 0) != decl
))
4945 TREE_OPERAND (cond
, 1)
4946 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4948 if (decl
== error_mark_node
|| init
== error_mark_node
)
4951 TREE_VEC_ELT (declv
, i
) = decl
;
4952 TREE_VEC_ELT (initv
, i
) = init
;
4953 TREE_VEC_ELT (condv
, i
) = cond
;
4954 TREE_VEC_ELT (incrv
, i
) = incr
;
4958 if (IS_EMPTY_STMT (pre_body
))
4961 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4964 if (omp_for
== NULL
)
4967 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4969 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4970 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4972 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4975 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4976 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4977 && !processing_template_decl
)
4979 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4980 if (TREE_SIDE_EFFECTS (t
)
4982 && (TREE_CODE (t
) != NOP_EXPR
4983 || TREE_OPERAND (t
, 0) != decl
))
4984 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4985 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4987 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4988 if (TREE_SIDE_EFFECTS (t
)
4990 && (TREE_CODE (t
) != NOP_EXPR
4991 || TREE_OPERAND (t
, 0) != decl
))
4992 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4993 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4997 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4999 if (omp_for
!= NULL
)
5000 OMP_FOR_CLAUSES (omp_for
) = clauses
;
5005 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
5006 tree rhs
, tree v
, tree lhs1
, tree rhs1
)
5021 dependent_p
= false;
5024 /* Even in a template, we can detect invalid uses of the atomic
5025 pragma if neither LHS nor RHS is type-dependent. */
5026 if (processing_template_decl
)
5028 dependent_p
= (type_dependent_expression_p (lhs
)
5029 || (rhs
&& type_dependent_expression_p (rhs
))
5030 || (v
&& type_dependent_expression_p (v
))
5031 || (lhs1
&& type_dependent_expression_p (lhs1
))
5032 || (rhs1
&& type_dependent_expression_p (rhs1
)));
5035 lhs
= build_non_dependent_expr (lhs
);
5037 rhs
= build_non_dependent_expr (rhs
);
5039 v
= build_non_dependent_expr (v
);
5041 lhs1
= build_non_dependent_expr (lhs1
);
5043 rhs1
= build_non_dependent_expr (rhs1
);
5048 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
5050 if (stmt
== error_mark_node
)
5053 if (processing_template_decl
)
5055 if (code
== OMP_ATOMIC_READ
)
5057 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
5058 OMP_ATOMIC_READ
, orig_lhs
);
5059 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
5063 if (opcode
== NOP_EXPR
)
5064 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
5066 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
5068 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
5069 COMPOUND_EXPR
, orig_rhs1
, stmt
);
5070 if (code
!= OMP_ATOMIC
)
5072 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
5073 code
, orig_lhs1
, stmt
);
5074 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
5077 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
5079 finish_expr_stmt (stmt
);
5083 finish_omp_barrier (void)
5085 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
5086 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5087 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5088 release_tree_vector (vec
);
5089 finish_expr_stmt (stmt
);
5093 finish_omp_flush (void)
5095 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
5096 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5097 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5098 release_tree_vector (vec
);
5099 finish_expr_stmt (stmt
);
5103 finish_omp_taskwait (void)
5105 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
5106 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5107 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5108 release_tree_vector (vec
);
5109 finish_expr_stmt (stmt
);
5113 finish_omp_taskyield (void)
5115 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
5116 vec
<tree
, va_gc
> *vec
= make_tree_vector ();
5117 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5118 release_tree_vector (vec
);
5119 finish_expr_stmt (stmt
);
5122 /* Begin a __transaction_atomic or __transaction_relaxed statement.
5123 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
5124 should create an extra compound stmt. */
5127 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
5132 *pcompound
= begin_compound_stmt (0);
5134 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
5136 /* Only add the statement to the function if support enabled. */
5140 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
5141 ? G_("%<__transaction_relaxed%> without "
5142 "transactional memory support enabled")
5143 : G_("%<__transaction_atomic%> without "
5144 "transactional memory support enabled")));
5146 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
5147 TREE_SIDE_EFFECTS (r
) = 1;
5151 /* End a __transaction_atomic or __transaction_relaxed statement.
5152 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
5153 and we should end the compound. If NOEX is non-NULL, we wrap the body in
5154 a MUST_NOT_THROW_EXPR with NOEX as condition. */
5157 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
5159 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
5160 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
5161 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
5162 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
5164 /* noexcept specifications are not allowed for function transactions. */
5165 gcc_assert (!(noex
&& compound_stmt
));
5168 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
5170 SET_EXPR_LOCATION (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
5171 TREE_SIDE_EFFECTS (body
) = 1;
5172 TRANSACTION_EXPR_BODY (stmt
) = body
;
5176 finish_compound_stmt (compound_stmt
);
5180 /* Build a __transaction_atomic or __transaction_relaxed expression. If
5181 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
5185 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
5190 expr
= build_must_not_throw_expr (expr
, noex
);
5191 SET_EXPR_LOCATION (expr
, loc
);
5192 TREE_SIDE_EFFECTS (expr
) = 1;
5194 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
5195 if (flags
& TM_STMT_ATTR_RELAXED
)
5196 TRANSACTION_EXPR_RELAXED (ret
) = 1;
5197 TREE_SIDE_EFFECTS (ret
) = 1;
5198 SET_EXPR_LOCATION (ret
, loc
);
5203 init_cp_semantics (void)
5207 /* Build a STATIC_ASSERT for a static assertion with the condition
5208 CONDITION and the message text MESSAGE. LOCATION is the location
5209 of the static assertion in the source code. When MEMBER_P, this
5210 static assertion is a member of a class. */
5212 finish_static_assert (tree condition
, tree message
, location_t location
,
5215 if (message
== NULL_TREE
5216 || message
== error_mark_node
5217 || condition
== NULL_TREE
5218 || condition
== error_mark_node
)
5221 if (check_for_bare_parameter_packs (condition
))
5222 condition
= error_mark_node
;
5224 if (type_dependent_expression_p (condition
)
5225 || value_dependent_expression_p (condition
))
5227 /* We're in a template; build a STATIC_ASSERT and put it in
5231 assertion
= make_node (STATIC_ASSERT
);
5232 STATIC_ASSERT_CONDITION (assertion
) = condition
;
5233 STATIC_ASSERT_MESSAGE (assertion
) = message
;
5234 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
5237 maybe_add_class_template_decl_list (current_class_type
,
5241 add_stmt (assertion
);
5246 /* Fold the expression and convert it to a boolean value. */
5247 condition
= fold_non_dependent_expr (condition
);
5248 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
5249 condition
= maybe_constant_value (condition
);
5251 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
5252 /* Do nothing; the condition is satisfied. */
5256 location_t saved_loc
= input_location
;
5258 input_location
= location
;
5259 if (TREE_CODE (condition
) == INTEGER_CST
5260 && integer_zerop (condition
))
5261 /* Report the error. */
5262 error ("static assertion failed: %s", TREE_STRING_POINTER (message
));
5263 else if (condition
&& condition
!= error_mark_node
)
5265 error ("non-constant condition for static assertion");
5266 cxx_constant_value (condition
);
5268 input_location
= saved_loc
;
5272 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5273 suitable for use as a type-specifier.
5275 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5276 id-expression or a class member access, FALSE when it was parsed as
5277 a full expression. */
5280 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
5281 tsubst_flags_t complain
)
5283 tree type
= NULL_TREE
;
5285 if (!expr
|| error_operand_p (expr
))
5286 return error_mark_node
;
5289 || TREE_CODE (expr
) == TYPE_DECL
5290 || (TREE_CODE (expr
) == BIT_NOT_EXPR
5291 && TYPE_P (TREE_OPERAND (expr
, 0))))
5293 if (complain
& tf_error
)
5294 error ("argument to decltype must be an expression");
5295 return error_mark_node
;
5298 /* Depending on the resolution of DR 1172, we may later need to distinguish
5299 instantiation-dependent but not type-dependent expressions so that, say,
5300 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
5301 if (instantiation_dependent_expression_p (expr
))
5303 type
= cxx_make_type (DECLTYPE_TYPE
);
5304 DECLTYPE_TYPE_EXPR (type
) = expr
;
5305 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
5306 = id_expression_or_member_access_p
;
5307 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5312 /* The type denoted by decltype(e) is defined as follows: */
5314 expr
= resolve_nondeduced_context (expr
);
5316 if (type_unknown_p (expr
))
5318 if (complain
& tf_error
)
5319 error ("decltype cannot resolve address of overloaded function");
5320 return error_mark_node
;
5323 if (invalid_nonstatic_memfn_p (expr
, complain
))
5324 return error_mark_node
;
5326 /* To get the size of a static data member declared as an array of
5327 unknown bound, we need to instantiate it. */
5328 if (TREE_CODE (expr
) == VAR_DECL
5329 && VAR_HAD_UNKNOWN_BOUND (expr
)
5330 && DECL_TEMPLATE_INSTANTIATION (expr
))
5331 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
5333 if (id_expression_or_member_access_p
)
5335 /* If e is an id-expression or a class member access (5.2.5
5336 [expr.ref]), decltype(e) is defined as the type of the entity
5337 named by e. If there is no such entity, or e names a set of
5338 overloaded functions, the program is ill-formed. */
5339 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
5340 expr
= lookup_name (expr
);
5342 if (TREE_CODE (expr
) == INDIRECT_REF
)
5343 /* This can happen when the expression is, e.g., "a.b". Just
5344 look at the underlying operand. */
5345 expr
= TREE_OPERAND (expr
, 0);
5347 if (TREE_CODE (expr
) == OFFSET_REF
5348 || TREE_CODE (expr
) == MEMBER_REF
5349 || TREE_CODE (expr
) == SCOPE_REF
)
5350 /* We're only interested in the field itself. If it is a
5351 BASELINK, we will need to see through it in the next
5353 expr
= TREE_OPERAND (expr
, 1);
5355 if (BASELINK_P (expr
))
5356 /* See through BASELINK nodes to the underlying function. */
5357 expr
= BASELINK_FUNCTIONS (expr
);
5359 switch (TREE_CODE (expr
))
5362 if (DECL_BIT_FIELD_TYPE (expr
))
5364 type
= DECL_BIT_FIELD_TYPE (expr
);
5367 /* Fall through for fields that aren't bitfields. */
5374 case TEMPLATE_PARM_INDEX
:
5375 expr
= mark_type_use (expr
);
5376 type
= TREE_TYPE (expr
);
5380 type
= error_mark_node
;
5385 mark_type_use (expr
);
5386 type
= is_bitfield_expr_with_lowered_type (expr
);
5388 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
5396 /* We can get here when the id-expression refers to an
5397 enumerator or non-type template parameter. */
5398 type
= TREE_TYPE (expr
);
5402 /* Handle instantiated template non-type arguments. */
5403 type
= TREE_TYPE (expr
);
5409 /* Within a lambda-expression:
5411 Every occurrence of decltype((x)) where x is a possibly
5412 parenthesized id-expression that names an entity of
5413 automatic storage duration is treated as if x were
5414 transformed into an access to a corresponding data member
5415 of the closure type that would have been declared if x
5416 were a use of the denoted entity. */
5417 if (outer_automatic_var_p (expr
)
5418 && current_function_decl
5419 && LAMBDA_FUNCTION_P (current_function_decl
))
5420 type
= capture_decltype (expr
);
5421 else if (error_operand_p (expr
))
5422 type
= error_mark_node
;
5423 else if (expr
== current_class_ptr
)
5424 /* If the expression is just "this", we want the
5425 cv-unqualified pointer for the "this" type. */
5426 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
5429 /* Otherwise, where T is the type of e, if e is an lvalue,
5430 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5431 cp_lvalue_kind clk
= lvalue_kind (expr
);
5432 type
= unlowered_expr_type (expr
);
5433 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
5435 /* For vector types, pick a non-opaque variant. */
5436 if (TREE_CODE (type
) == VECTOR_TYPE
)
5437 type
= strip_typedefs (type
);
5439 if (clk
!= clk_none
&& !(clk
& clk_class
))
5440 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
5447 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5448 __has_nothrow_copy, depending on assign_p. */
5451 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5458 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5461 fns
= (*CLASSTYPE_METHOD_VEC (type
))[ix
];
5463 else if (TYPE_HAS_COPY_CTOR (type
))
5465 /* If construction of the copy constructor was postponed, create
5467 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5468 lazily_declare_fn (sfk_copy_constructor
, type
);
5469 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5470 lazily_declare_fn (sfk_move_constructor
, type
);
5471 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5476 for (; fns
; fns
= OVL_NEXT (fns
))
5478 tree fn
= OVL_CURRENT (fns
);
5482 if (copy_fn_p (fn
) == 0)
5485 else if (copy_fn_p (fn
) <= 0)
5488 maybe_instantiate_noexcept (fn
);
5489 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5496 /* Actually evaluates the trait. */
5499 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5501 enum tree_code type_code1
;
5504 type_code1
= TREE_CODE (type1
);
5508 case CPTK_HAS_NOTHROW_ASSIGN
:
5509 type1
= strip_array_types (type1
);
5510 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5511 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5512 || (CLASS_TYPE_P (type1
)
5513 && classtype_has_nothrow_assign_or_copy_p (type1
,
5516 case CPTK_HAS_TRIVIAL_ASSIGN
:
5517 /* ??? The standard seems to be missing the "or array of such a class
5518 type" wording for this trait. */
5519 type1
= strip_array_types (type1
);
5520 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5521 && (trivial_type_p (type1
)
5522 || (CLASS_TYPE_P (type1
)
5523 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5525 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5526 type1
= strip_array_types (type1
);
5527 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5528 || (CLASS_TYPE_P (type1
)
5529 && (t
= locate_ctor (type1
))
5530 && (maybe_instantiate_noexcept (t
),
5531 TYPE_NOTHROW_P (TREE_TYPE (t
)))));
5533 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5534 type1
= strip_array_types (type1
);
5535 return (trivial_type_p (type1
)
5536 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5538 case CPTK_HAS_NOTHROW_COPY
:
5539 type1
= strip_array_types (type1
);
5540 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5541 || (CLASS_TYPE_P (type1
)
5542 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5544 case CPTK_HAS_TRIVIAL_COPY
:
5545 /* ??? The standard seems to be missing the "or array of such a class
5546 type" wording for this trait. */
5547 type1
= strip_array_types (type1
);
5548 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5549 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5551 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5552 type1
= strip_array_types (type1
);
5553 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5554 || (CLASS_TYPE_P (type1
)
5555 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5557 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5558 return type_has_virtual_destructor (type1
);
5560 case CPTK_IS_ABSTRACT
:
5561 return (ABSTRACT_CLASS_TYPE_P (type1
));
5563 case CPTK_IS_BASE_OF
:
5564 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5565 && DERIVED_FROM_P (type1
, type2
));
5568 return (NON_UNION_CLASS_TYPE_P (type1
));
5570 case CPTK_IS_CONVERTIBLE_TO
:
5575 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5578 return (type_code1
== ENUMERAL_TYPE
);
5581 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
5583 case CPTK_IS_LITERAL_TYPE
:
5584 return (literal_type_p (type1
));
5587 return (pod_type_p (type1
));
5589 case CPTK_IS_POLYMORPHIC
:
5590 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5592 case CPTK_IS_STD_LAYOUT
:
5593 return (std_layout_type_p (type1
));
5595 case CPTK_IS_TRIVIAL
:
5596 return (trivial_type_p (type1
));
5599 return (type_code1
== UNION_TYPE
);
5607 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5608 void, or a complete type, returns it, otherwise NULL_TREE. */
5611 check_trait_type (tree type
)
5613 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5614 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5617 if (VOID_TYPE_P (type
))
5620 return complete_type_or_else (strip_array_types (type
), NULL_TREE
);
5623 /* Process a trait expression. */
5626 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5628 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5629 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5630 || kind
== CPTK_HAS_NOTHROW_COPY
5631 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5632 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5633 || kind
== CPTK_HAS_TRIVIAL_COPY
5634 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5635 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5636 || kind
== CPTK_IS_ABSTRACT
5637 || kind
== CPTK_IS_BASE_OF
5638 || kind
== CPTK_IS_CLASS
5639 || kind
== CPTK_IS_CONVERTIBLE_TO
5640 || kind
== CPTK_IS_EMPTY
5641 || kind
== CPTK_IS_ENUM
5642 || kind
== CPTK_IS_FINAL
5643 || kind
== CPTK_IS_LITERAL_TYPE
5644 || kind
== CPTK_IS_POD
5645 || kind
== CPTK_IS_POLYMORPHIC
5646 || kind
== CPTK_IS_STD_LAYOUT
5647 || kind
== CPTK_IS_TRIVIAL
5648 || kind
== CPTK_IS_UNION
);
5650 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5652 sorry ("__is_convertible_to");
5653 return error_mark_node
;
5656 if (type1
== error_mark_node
5657 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5658 && type2
== error_mark_node
))
5659 return error_mark_node
;
5661 if (processing_template_decl
)
5663 tree trait_expr
= make_node (TRAIT_EXPR
);
5664 TREE_TYPE (trait_expr
) = boolean_type_node
;
5665 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5666 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5667 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5673 case CPTK_HAS_NOTHROW_ASSIGN
:
5674 case CPTK_HAS_TRIVIAL_ASSIGN
:
5675 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5676 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5677 case CPTK_HAS_NOTHROW_COPY
:
5678 case CPTK_HAS_TRIVIAL_COPY
:
5679 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5680 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5681 case CPTK_IS_ABSTRACT
:
5684 case CPTK_IS_LITERAL_TYPE
:
5686 case CPTK_IS_POLYMORPHIC
:
5687 case CPTK_IS_STD_LAYOUT
:
5688 case CPTK_IS_TRIVIAL
:
5689 if (!check_trait_type (type1
))
5690 return error_mark_node
;
5693 case CPTK_IS_BASE_OF
:
5694 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5695 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5696 && !complete_type_or_else (type2
, NULL_TREE
))
5697 /* We already issued an error. */
5698 return error_mark_node
;
5706 case CPTK_IS_CONVERTIBLE_TO
:
5711 return (trait_expr_value (kind
, type1
, type2
)
5712 ? boolean_true_node
: boolean_false_node
);
5715 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5716 which is ignored for C++. */
5719 set_float_const_decimal64 (void)
5724 clear_float_const_decimal64 (void)
5729 float_const_decimal64_p (void)
5735 /* Return true if T is a literal type. */
5738 literal_type_p (tree t
)
5740 if (SCALAR_TYPE_P (t
)
5741 || TREE_CODE (t
) == VECTOR_TYPE
5742 || TREE_CODE (t
) == REFERENCE_TYPE
)
5744 if (CLASS_TYPE_P (t
))
5746 t
= complete_type (t
);
5747 gcc_assert (COMPLETE_TYPE_P (t
) || errorcount
);
5748 return CLASSTYPE_LITERAL_P (t
);
5750 if (TREE_CODE (t
) == ARRAY_TYPE
)
5751 return literal_type_p (strip_array_types (t
));
5755 /* If DECL is a variable declared `constexpr', require its type
5756 be literal. Return the DECL if OK, otherwise NULL. */
5759 ensure_literal_type_for_constexpr_object (tree decl
)
5761 tree type
= TREE_TYPE (decl
);
5762 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5763 && !processing_template_decl
)
5765 if (CLASS_TYPE_P (type
) && !COMPLETE_TYPE_P (complete_type (type
)))
5766 /* Don't complain here, we'll complain about incompleteness
5767 when we try to initialize the variable. */;
5768 else if (!literal_type_p (type
))
5770 error ("the type %qT of constexpr variable %qD is not literal",
5772 explain_non_literal_class (type
);
5779 /* Representation of entries in the constexpr function definition table. */
5781 typedef struct GTY(()) constexpr_fundef
{
5786 /* This table holds all constexpr function definitions seen in
5787 the current translation unit. */
5789 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5791 /* Utility function used for managing the constexpr function table.
5792 Return true if the entries pointed to by P and Q are for the
5793 same constexpr function. */
5796 constexpr_fundef_equal (const void *p
, const void *q
)
5798 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5799 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5800 return lhs
->decl
== rhs
->decl
;
5803 /* Utility function used for managing the constexpr function table.
5804 Return a hash value for the entry pointed to by Q. */
5806 static inline hashval_t
5807 constexpr_fundef_hash (const void *p
)
5809 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5810 return DECL_UID (fundef
->decl
);
5813 /* Return a previously saved definition of function FUN. */
5815 static constexpr_fundef
*
5816 retrieve_constexpr_fundef (tree fun
)
5818 constexpr_fundef fundef
= { NULL
, NULL
};
5819 if (constexpr_fundef_table
== NULL
)
5823 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5826 /* Check whether the parameter and return types of FUN are valid for a
5827 constexpr function, and complain if COMPLAIN. */
5830 is_valid_constexpr_fn (tree fun
, bool complain
)
5832 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5834 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5835 if (!literal_type_p (TREE_TYPE (parm
)))
5840 error ("invalid type for parameter %d of constexpr "
5841 "function %q+#D", DECL_PARM_INDEX (parm
), fun
);
5842 explain_non_literal_class (TREE_TYPE (parm
));
5846 if (!DECL_CONSTRUCTOR_P (fun
))
5848 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5849 if (!literal_type_p (rettype
))
5854 error ("invalid return type %qT of constexpr function %q+D",
5856 explain_non_literal_class (rettype
);
5860 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5861 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun
)))
5866 error ("enclosing class of constexpr non-static member "
5867 "function %q+#D is not a literal type", fun
);
5868 explain_non_literal_class (DECL_CONTEXT (fun
));
5872 else if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fun
)))
5876 error ("%q#T has virtual base classes", DECL_CONTEXT (fun
));
5882 /* Subroutine of build_data_member_initialization. MEMBER is a COMPONENT_REF
5883 for a member of an anonymous aggregate, INIT is the initializer for that
5884 member, and VEC_OUTER is the vector of constructor elements for the class
5885 whose constructor we are processing. Add the initializer to the vector
5886 and return true to indicate success. */
5889 build_anon_member_initialization (tree member
, tree init
,
5890 vec
<constructor_elt
, va_gc
> **vec_outer
)
5892 /* MEMBER presents the relevant fields from the inside out, but we need
5893 to build up the initializer from the outside in so that we can reuse
5894 previously built CONSTRUCTORs if this is, say, the second field in an
5895 anonymous struct. So we use a vec as a stack. */
5900 fields
.safe_push (TREE_OPERAND (member
, 1));
5901 member
= TREE_OPERAND (member
, 0);
5903 while (ANON_AGGR_TYPE_P (TREE_TYPE (member
)));
5905 /* VEC has the constructor elements vector for the context of FIELD.
5906 If FIELD is an anonymous aggregate, we will push inside it. */
5907 vec
<constructor_elt
, va_gc
> **vec
= vec_outer
;
5909 while (field
= fields
.pop(),
5910 ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
5913 /* If there is already an outer constructor entry for the anonymous
5914 aggregate FIELD, use it; otherwise, insert one. */
5915 if (vec_safe_is_empty (*vec
)
5916 || (*vec
)->last().index
!= field
)
5918 ctor
= build_constructor (TREE_TYPE (field
), NULL
);
5919 CONSTRUCTOR_APPEND_ELT (*vec
, field
, ctor
);
5922 ctor
= (*vec
)->last().value
;
5923 vec
= &CONSTRUCTOR_ELTS (ctor
);
5926 /* Now we're at the innermost field, the one that isn't an anonymous
5927 aggregate. Add its initializer to the CONSTRUCTOR and we're done. */
5928 gcc_assert (fields
.is_empty());
5930 CONSTRUCTOR_APPEND_ELT (*vec
, field
, init
);
5935 /* Subroutine of build_constexpr_constructor_member_initializers.
5936 The expression tree T represents a data member initialization
5937 in a (constexpr) constructor definition. Build a pairing of
5938 the data member with its initializer, and prepend that pair
5939 to the existing initialization pair INITS. */
5942 build_data_member_initialization (tree t
, vec
<constructor_elt
, va_gc
> **vec
)
5945 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5946 t
= TREE_OPERAND (t
, 0);
5947 if (TREE_CODE (t
) == EXPR_STMT
)
5948 t
= TREE_OPERAND (t
, 0);
5949 if (t
== error_mark_node
)
5951 if (TREE_CODE (t
) == STATEMENT_LIST
)
5953 tree_stmt_iterator i
;
5954 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5956 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5961 if (TREE_CODE (t
) == CLEANUP_STMT
)
5963 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5964 but we can in a constexpr constructor for a non-literal class. Just
5965 ignore it; either all the initialization will be constant, in which
5966 case the cleanup can't run, or it can't be constexpr.
5967 Still recurse into CLEANUP_BODY. */
5968 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5970 if (TREE_CODE (t
) == CONVERT_EXPR
)
5971 t
= TREE_OPERAND (t
, 0);
5972 if (TREE_CODE (t
) == INIT_EXPR
5973 || TREE_CODE (t
) == MODIFY_EXPR
)
5975 member
= TREE_OPERAND (t
, 0);
5976 init
= break_out_target_exprs (TREE_OPERAND (t
, 1));
5978 else if (TREE_CODE (t
) == CALL_EXPR
)
5980 member
= CALL_EXPR_ARG (t
, 0);
5981 /* We don't use build_cplus_new here because it complains about
5982 abstract bases. Leaving the call unwrapped means that it has the
5983 wrong type, but cxx_eval_constant_expression doesn't care. */
5984 init
= break_out_target_exprs (t
);
5986 else if (TREE_CODE (t
) == DECL_EXPR
)
5987 /* Declaring a temporary, don't add it to the CONSTRUCTOR. */
5991 if (TREE_CODE (member
) == INDIRECT_REF
)
5992 member
= TREE_OPERAND (member
, 0);
5993 if (TREE_CODE (member
) == NOP_EXPR
)
5997 if (TREE_CODE (op
) == ADDR_EXPR
)
5999 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6000 (TREE_TYPE (TREE_TYPE (op
)),
6001 TREE_TYPE (TREE_TYPE (member
))));
6002 /* Initializing a cv-qualified member; we need to look through
6006 else if (op
== current_class_ptr
6007 && (same_type_ignoring_top_level_qualifiers_p
6008 (TREE_TYPE (TREE_TYPE (member
)),
6009 current_class_type
)))
6010 /* Delegating constructor. */
6014 /* This is an initializer for an empty base; keep it for now so
6015 we can check it in cxx_eval_bare_aggregate. */
6016 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
6019 if (TREE_CODE (member
) == ADDR_EXPR
)
6020 member
= TREE_OPERAND (member
, 0);
6021 if (TREE_CODE (member
) == COMPONENT_REF
)
6023 tree aggr
= TREE_OPERAND (member
, 0);
6024 if (TREE_CODE (aggr
) != COMPONENT_REF
)
6025 /* Normal member initialization. */
6026 member
= TREE_OPERAND (member
, 1);
6027 else if (ANON_AGGR_TYPE_P (TREE_TYPE (aggr
)))
6028 /* Initializing a member of an anonymous union. */
6029 return build_anon_member_initialization (member
, init
, vec
);
6031 /* We're initializing a vtable pointer in a base. Leave it as
6032 COMPONENT_REF so we remember the path to get to the vfield. */
6033 gcc_assert (TREE_TYPE (member
) == vtbl_ptr_type_node
);
6036 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
6040 /* Make sure that there are no statements after LAST in the constructor
6041 body represented by LIST. */
6044 check_constexpr_ctor_body (tree last
, tree list
)
6047 if (TREE_CODE (list
) == STATEMENT_LIST
)
6049 tree_stmt_iterator i
= tsi_last (list
);
6050 for (; !tsi_end_p (i
); tsi_prev (&i
))
6052 tree t
= tsi_stmt (i
);
6055 if (TREE_CODE (t
) == BIND_EXPR
)
6057 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
6062 /* We currently allow typedefs and static_assert.
6063 FIXME allow them in the standard, too. */
6064 if (TREE_CODE (t
) != STATIC_ASSERT
)
6071 else if (list
!= last
6072 && TREE_CODE (list
) != STATIC_ASSERT
)
6076 error ("constexpr constructor does not have empty body");
6077 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
6082 /* V is a vector of constructor elements built up for the base and member
6083 initializers of a constructor for TYPE. They need to be in increasing
6084 offset order, which they might not be yet if TYPE has a primary base
6085 which is not first in the base-clause or a vptr and at least one base
6086 all of which are non-primary. */
6088 static vec
<constructor_elt
, va_gc
> *
6089 sort_constexpr_mem_initializers (tree type
, vec
<constructor_elt
, va_gc
> *v
)
6091 tree pri
= CLASSTYPE_PRIMARY_BINFO (type
);
6093 constructor_elt elt
;
6097 field_type
= BINFO_TYPE (pri
);
6098 else if (TYPE_CONTAINS_VPTR_P (type
))
6099 field_type
= vtbl_ptr_type_node
;
6103 /* Find the element for the primary base or vptr and move it to the
6104 beginning of the vec. */
6105 vec
<constructor_elt
, va_gc
> &vref
= *v
;
6107 if (TREE_TYPE (vref
[i
].index
) == field_type
)
6114 vref
[i
] = vref
[i
-1];
6121 /* Build compile-time evalable representations of member-initializer list
6122 for a constexpr constructor. */
6125 build_constexpr_constructor_member_initializers (tree type
, tree body
)
6127 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6129 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
6130 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
6131 body
= TREE_OPERAND (body
, 0);
6132 if (TREE_CODE (body
) == STATEMENT_LIST
)
6133 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
6134 body
= BIND_EXPR_BODY (body
);
6135 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
6137 body
= TREE_OPERAND (body
, 0);
6138 if (TREE_CODE (body
) == EXPR_STMT
)
6139 body
= TREE_OPERAND (body
, 0);
6140 if (TREE_CODE (body
) == INIT_EXPR
6141 && (same_type_ignoring_top_level_qualifiers_p
6142 (TREE_TYPE (TREE_OPERAND (body
, 0)),
6143 current_class_type
)))
6146 return TREE_OPERAND (body
, 1);
6148 ok
= build_data_member_initialization (body
, &vec
);
6150 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6152 tree_stmt_iterator i
;
6153 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
6155 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
6160 else if (TREE_CODE (body
) == TRY_BLOCK
)
6162 error ("body of %<constexpr%> constructor cannot be "
6163 "a function-try-block");
6164 return error_mark_node
;
6166 else if (EXPR_P (body
))
6167 ok
= build_data_member_initialization (body
, &vec
);
6169 gcc_assert (errorcount
> 0);
6172 if (vec_safe_length (vec
) > 0)
6174 /* In a delegating constructor, return the target. */
6175 constructor_elt
*ce
= &(*vec
)[0];
6176 if (ce
->index
== current_class_ptr
)
6183 vec
= sort_constexpr_mem_initializers (type
, vec
);
6184 return build_constructor (type
, vec
);
6187 return error_mark_node
;
6190 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
6191 declared to be constexpr, or a sub-statement thereof. Returns the
6192 return value if suitable, error_mark_node for a statement not allowed in
6193 a constexpr function, or NULL_TREE if no return value was found. */
6196 constexpr_fn_retval (tree body
)
6198 switch (TREE_CODE (body
))
6200 case STATEMENT_LIST
:
6202 tree_stmt_iterator i
;
6203 tree expr
= NULL_TREE
;
6204 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
6206 tree s
= constexpr_fn_retval (tsi_stmt (i
));
6207 if (s
== error_mark_node
)
6208 return error_mark_node
;
6209 else if (s
== NULL_TREE
)
6210 /* Keep iterating. */;
6212 /* Multiple return statements. */
6213 return error_mark_node
;
6221 return break_out_target_exprs (TREE_OPERAND (body
, 0));
6224 if (TREE_CODE (DECL_EXPR_DECL (body
)) == USING_DECL
)
6226 return error_mark_node
;
6228 case CLEANUP_POINT_EXPR
:
6229 return constexpr_fn_retval (TREE_OPERAND (body
, 0));
6235 return error_mark_node
;
6239 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
6240 FUN; do the necessary transformations to turn it into a single expression
6241 that we can store in the hash table. */
6244 massage_constexpr_body (tree fun
, tree body
)
6246 if (DECL_CONSTRUCTOR_P (fun
))
6247 body
= build_constexpr_constructor_member_initializers
6248 (DECL_CONTEXT (fun
), body
);
6251 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
6252 body
= EH_SPEC_STMTS (body
);
6253 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
6254 body
= TREE_OPERAND (body
, 0);
6255 if (TREE_CODE (body
) == BIND_EXPR
)
6256 body
= BIND_EXPR_BODY (body
);
6257 body
= constexpr_fn_retval (body
);
6262 /* FUN is a constexpr constructor with massaged body BODY. Return true
6263 if some bases/fields are uninitialized, and complain if COMPLAIN. */
6266 cx_check_missing_mem_inits (tree fun
, tree body
, bool complain
)
6273 if (TREE_CODE (body
) != CONSTRUCTOR
)
6276 nelts
= CONSTRUCTOR_NELTS (body
);
6277 ctype
= DECL_CONTEXT (fun
);
6278 field
= TYPE_FIELDS (ctype
);
6280 if (TREE_CODE (ctype
) == UNION_TYPE
)
6282 if (nelts
== 0 && next_initializable_field (field
))
6285 error ("%<constexpr%> constructor for union %qT must "
6286 "initialize exactly one non-static data member", ctype
);
6293 for (i
= 0; i
<= nelts
; ++i
)
6300 index
= CONSTRUCTOR_ELT (body
, i
)->index
;
6301 /* Skip base and vtable inits. */
6302 if (TREE_CODE (index
) != FIELD_DECL
6303 || DECL_ARTIFICIAL (index
))
6306 for (; field
!= index
; field
= DECL_CHAIN (field
))
6309 if (TREE_CODE (field
) != FIELD_DECL
6310 || (DECL_C_BIT_FIELD (field
) && !DECL_NAME (field
))
6311 || DECL_ARTIFICIAL (field
))
6313 ftype
= strip_array_types (TREE_TYPE (field
));
6314 if (type_has_constexpr_default_constructor (ftype
))
6316 /* It's OK to skip a member with a trivial constexpr ctor.
6317 A constexpr ctor that isn't trivial should have been
6319 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype
)
6320 || errorcount
!= 0);
6325 error ("uninitialized member %qD in %<constexpr%> constructor",
6329 if (field
== NULL_TREE
)
6331 field
= DECL_CHAIN (field
);
6337 /* We are processing the definition of the constexpr function FUN.
6338 Check that its BODY fulfills the propriate requirements and
6339 enter it in the constexpr function definition table.
6340 For constructor BODY is actually the TREE_LIST of the
6341 member-initializer list. */
6344 register_constexpr_fundef (tree fun
, tree body
)
6346 constexpr_fundef entry
;
6347 constexpr_fundef
**slot
;
6349 if (!is_valid_constexpr_fn (fun
, !DECL_GENERATED_P (fun
)))
6352 body
= massage_constexpr_body (fun
, body
);
6353 if (body
== NULL_TREE
|| body
== error_mark_node
)
6355 if (!DECL_CONSTRUCTOR_P (fun
))
6356 error ("body of constexpr function %qD not a return-statement", fun
);
6360 if (!potential_rvalue_constant_expression (body
))
6362 if (!DECL_GENERATED_P (fun
))
6363 require_potential_rvalue_constant_expression (body
);
6367 if (DECL_CONSTRUCTOR_P (fun
)
6368 && cx_check_missing_mem_inits (fun
, body
, !DECL_GENERATED_P (fun
)))
6371 /* Create the constexpr function table if necessary. */
6372 if (constexpr_fundef_table
== NULL
)
6373 constexpr_fundef_table
= htab_create_ggc (101,
6374 constexpr_fundef_hash
,
6375 constexpr_fundef_equal
,
6379 slot
= (constexpr_fundef
**)
6380 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
6382 gcc_assert (*slot
== NULL
);
6383 *slot
= ggc_alloc_constexpr_fundef ();
6389 /* FUN is a non-constexpr function called in a context that requires a
6390 constant expression. If it comes from a constexpr template, explain why
6391 the instantiation isn't constexpr. */
6394 explain_invalid_constexpr_fn (tree fun
)
6396 static struct pointer_set_t
*diagnosed
;
6398 location_t save_loc
;
6399 /* Only diagnose defaulted functions or instantiations. */
6400 if (!DECL_DEFAULTED_FN (fun
)
6401 && !is_instantiation_of_constexpr (fun
))
6403 if (diagnosed
== NULL
)
6404 diagnosed
= pointer_set_create ();
6405 if (pointer_set_insert (diagnosed
, fun
) != 0)
6406 /* Already explained. */
6409 save_loc
= input_location
;
6410 input_location
= DECL_SOURCE_LOCATION (fun
);
6411 inform (0, "%q+D is not usable as a constexpr function because:", fun
);
6412 /* First check the declaration. */
6413 if (is_valid_constexpr_fn (fun
, true))
6415 /* Then if it's OK, the body. */
6416 if (DECL_DEFAULTED_FN (fun
))
6417 explain_implicit_non_constexpr (fun
);
6420 body
= massage_constexpr_body (fun
, DECL_SAVED_TREE (fun
));
6421 require_potential_rvalue_constant_expression (body
);
6422 if (DECL_CONSTRUCTOR_P (fun
))
6423 cx_check_missing_mem_inits (fun
, body
, true);
6426 input_location
= save_loc
;
6429 /* Objects of this type represent calls to constexpr functions
6430 along with the bindings of parameters to their arguments, for
6431 the purpose of compile time evaluation. */
6433 typedef struct GTY(()) constexpr_call
{
6434 /* Description of the constexpr function definition. */
6435 constexpr_fundef
*fundef
;
6436 /* Parameter bindings environment. A TREE_LIST where each TREE_PURPOSE
6437 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6438 Note: This arrangement is made to accomodate the use of
6439 iterative_hash_template_arg (see pt.c). If you change this
6440 representation, also change the hash calculation in
6441 cxx_eval_call_expression. */
6443 /* Result of the call.
6444 NULL means the call is being evaluated.
6445 error_mark_node means that the evaluation was erroneous;
6446 otherwise, the actuall value of the call. */
6448 /* The hash of this call; we remember it here to avoid having to
6449 recalculate it when expanding the hash table. */
6453 /* A table of all constexpr calls that have been evaluated by the
6454 compiler in this translation unit. */
6456 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
6458 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
6459 bool, bool, bool *, bool *);
6461 /* Compute a hash value for a constexpr call representation. */
6464 constexpr_call_hash (const void *p
)
6466 const constexpr_call
*info
= (const constexpr_call
*) p
;
6470 /* Return 1 if the objects pointed to by P and Q represent calls
6471 to the same constexpr function with the same arguments.
6472 Otherwise, return 0. */
6475 constexpr_call_equal (const void *p
, const void *q
)
6477 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
6478 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
6483 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
6485 lhs_bindings
= lhs
->bindings
;
6486 rhs_bindings
= rhs
->bindings
;
6487 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
6489 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
6490 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
6491 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
6492 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
6494 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
6495 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
6497 return lhs_bindings
== rhs_bindings
;
6500 /* Initialize the constexpr call table, if needed. */
6503 maybe_initialize_constexpr_call_table (void)
6505 if (constexpr_call_table
== NULL
)
6506 constexpr_call_table
= htab_create_ggc (101,
6507 constexpr_call_hash
,
6508 constexpr_call_equal
,
6512 /* Return true if T designates the implied `this' parameter. */
6515 is_this_parameter (tree t
)
6517 return t
== current_class_ptr
;
6520 /* We have an expression tree T that represents a call, either CALL_EXPR
6521 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6522 retrun the _DECL for that function. */
6525 get_function_named_in_call (tree t
)
6528 switch (TREE_CODE (t
))
6531 fun
= CALL_EXPR_FN (t
);
6534 case AGGR_INIT_EXPR
:
6535 fun
= AGGR_INIT_EXPR_FN (t
);
6542 if (TREE_CODE (fun
) == ADDR_EXPR
6543 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
6544 fun
= TREE_OPERAND (fun
, 0);
6548 /* We have an expression tree T that represents a call, either CALL_EXPR
6549 or AGGR_INIT_EXPR. Return the Nth argument. */
6552 get_nth_callarg (tree t
, int n
)
6554 switch (TREE_CODE (t
))
6557 return CALL_EXPR_ARG (t
, n
);
6559 case AGGR_INIT_EXPR
:
6560 return AGGR_INIT_EXPR_ARG (t
, n
);
6568 /* Look up the binding of the function parameter T in a constexpr
6569 function call context CALL. */
6572 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
6574 tree b
= purpose_member (t
, call
->bindings
);
6575 return TREE_VALUE (b
);
6578 /* Attempt to evaluate T which represents a call to a builtin function.
6579 We assume here that all builtin functions evaluate to scalar types
6580 represented by _CST nodes. */
6583 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
6584 bool allow_non_constant
, bool addr
,
6585 bool *non_constant_p
, bool *overflow_p
)
6587 const int nargs
= call_expr_nargs (t
);
6588 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
6591 for (i
= 0; i
< nargs
; ++i
)
6593 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
6594 allow_non_constant
, addr
,
6595 non_constant_p
, overflow_p
);
6596 if (allow_non_constant
&& *non_constant_p
)
6599 if (*non_constant_p
)
6601 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
6602 CALL_EXPR_FN (t
), nargs
, args
);
6603 new_call
= fold (new_call
);
6604 VERIFY_CONSTANT (new_call
);
6608 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6609 the type of the value to match. */
6612 adjust_temp_type (tree type
, tree temp
)
6614 if (TREE_TYPE (temp
) == type
)
6616 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6617 if (TREE_CODE (temp
) == CONSTRUCTOR
)
6618 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
6619 gcc_assert (scalarish_type_p (type
));
6620 return cp_fold_convert (type
, temp
);
6623 /* Subroutine of cxx_eval_call_expression.
6624 We are processing a call expression (either CALL_EXPR or
6625 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6626 all arguments and bind their values to correspondings
6627 parameters, making up the NEW_CALL context. */
6630 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
6631 constexpr_call
*new_call
,
6632 bool allow_non_constant
,
6633 bool *non_constant_p
, bool *overflow_p
)
6635 const int nargs
= call_expr_nargs (t
);
6636 tree fun
= new_call
->fundef
->decl
;
6637 tree parms
= DECL_ARGUMENTS (fun
);
6639 for (i
= 0; i
< nargs
; ++i
)
6642 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
6643 /* For member function, the first argument is a pointer to the implied
6644 object. And for an object contruction, don't bind `this' before
6645 it is fully constructed. */
6646 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
6648 x
= get_nth_callarg (t
, i
);
6649 if (parms
&& DECL_BY_REFERENCE (parms
))
6651 /* cp_genericize made this a reference for argument passing, but
6652 we don't want to treat it like one for constexpr evaluation. */
6653 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
6654 gcc_assert (TREE_CODE (TREE_TYPE (x
)) == REFERENCE_TYPE
);
6655 type
= TREE_TYPE (type
);
6656 x
= convert_from_reference (x
);
6658 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
6659 TREE_CODE (type
) == REFERENCE_TYPE
,
6660 non_constant_p
, overflow_p
);
6661 /* Don't VERIFY_CONSTANT here. */
6662 if (*non_constant_p
&& allow_non_constant
)
6664 /* Just discard ellipsis args after checking their constantitude. */
6667 if (*non_constant_p
)
6668 /* Don't try to adjust the type of non-constant args. */
6671 /* Make sure the binding has the same type as the parm. */
6672 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6673 arg
= adjust_temp_type (type
, arg
);
6674 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
6676 parms
= TREE_CHAIN (parms
);
6680 /* Variables and functions to manage constexpr call expansion context.
6681 These do not need to be marked for PCH or GC. */
6683 /* FIXME remember and print actual constant arguments. */
6684 static vec
<tree
> call_stack
= vNULL
;
6685 static int call_stack_tick
;
6686 static int last_cx_error_tick
;
6689 push_cx_call_context (tree call
)
6692 if (!EXPR_HAS_LOCATION (call
))
6693 SET_EXPR_LOCATION (call
, input_location
);
6694 call_stack
.safe_push (call
);
6695 if (call_stack
.length () > (unsigned) max_constexpr_depth
)
6701 pop_cx_call_context (void)
6708 cx_error_context (void)
6710 vec
<tree
> r
= vNULL
;
6711 if (call_stack_tick
!= last_cx_error_tick
6712 && !call_stack
.is_empty ())
6714 last_cx_error_tick
= call_stack_tick
;
6718 /* Subroutine of cxx_eval_constant_expression.
6719 Evaluate the call expression tree T in the context of OLD_CALL expression
6723 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
6724 bool allow_non_constant
, bool addr
,
6725 bool *non_constant_p
, bool *overflow_p
)
6727 location_t loc
= EXPR_LOC_OR_HERE (t
);
6728 tree fun
= get_function_named_in_call (t
);
6730 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
6731 constexpr_call
**slot
;
6732 constexpr_call
*entry
;
6735 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6737 /* Might be a constexpr function pointer. */
6738 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
6739 /*addr*/false, non_constant_p
, overflow_p
);
6740 if (TREE_CODE (fun
) == ADDR_EXPR
)
6741 fun
= TREE_OPERAND (fun
, 0);
6743 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6745 if (!allow_non_constant
&& !*non_constant_p
)
6746 error_at (loc
, "expression %qE does not designate a constexpr "
6748 *non_constant_p
= true;
6751 if (DECL_CLONED_FUNCTION_P (fun
))
6752 fun
= DECL_CLONED_FUNCTION (fun
);
6753 if (is_builtin_fn (fun
))
6754 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6755 addr
, non_constant_p
, overflow_p
);
6756 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6758 if (!allow_non_constant
)
6760 error_at (loc
, "call to non-constexpr function %qD", fun
);
6761 explain_invalid_constexpr_fn (fun
);
6763 *non_constant_p
= true;
6767 /* Shortcut trivial copy constructor/op=. */
6768 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6770 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6771 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6772 addr
, non_constant_p
, overflow_p
);
6775 /* If in direct recursive call, optimize definition search. */
6776 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6777 new_call
.fundef
= old_call
->fundef
;
6780 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6781 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6783 if (!allow_non_constant
)
6785 if (DECL_INITIAL (fun
))
6787 /* The definition of fun was somehow unsuitable. */
6788 error_at (loc
, "%qD called in a constant expression", fun
);
6789 explain_invalid_constexpr_fn (fun
);
6792 error_at (loc
, "%qD used before its definition", fun
);
6794 *non_constant_p
= true;
6798 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6799 allow_non_constant
, non_constant_p
, overflow_p
);
6800 if (*non_constant_p
)
6803 depth_ok
= push_cx_call_context (t
);
6806 = iterative_hash_template_arg (new_call
.bindings
,
6807 constexpr_fundef_hash (new_call
.fundef
));
6809 /* If we have seen this call before, we are done. */
6810 maybe_initialize_constexpr_call_table ();
6811 slot
= (constexpr_call
**)
6812 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6816 /* We need to keep a pointer to the entry, not just the slot, as the
6817 slot can move in the call to cxx_eval_builtin_function_call. */
6818 *slot
= entry
= ggc_alloc_constexpr_call ();
6821 /* Calls which are in progress have their result set to NULL
6822 so that we can detect circular dependencies. */
6823 else if (entry
->result
== NULL
)
6825 if (!allow_non_constant
)
6826 error ("call has circular dependency");
6827 *non_constant_p
= true;
6828 entry
->result
= result
= error_mark_node
;
6833 if (!allow_non_constant
)
6834 error ("constexpr evaluation depth exceeds maximum of %d (use "
6835 "-fconstexpr-depth= to increase the maximum)",
6836 max_constexpr_depth
);
6837 *non_constant_p
= true;
6838 entry
->result
= result
= error_mark_node
;
6842 result
= entry
->result
;
6843 if (!result
|| result
== error_mark_node
)
6844 result
= (cxx_eval_constant_expression
6845 (&new_call
, new_call
.fundef
->body
,
6846 allow_non_constant
, addr
,
6847 non_constant_p
, overflow_p
));
6848 if (result
== error_mark_node
)
6849 *non_constant_p
= true;
6850 if (*non_constant_p
)
6851 entry
->result
= result
= error_mark_node
;
6854 /* If this was a call to initialize an object, set the type of
6855 the CONSTRUCTOR to the type of that object. */
6856 if (DECL_CONSTRUCTOR_P (fun
))
6858 tree ob_arg
= get_nth_callarg (t
, 0);
6859 STRIP_NOPS (ob_arg
);
6860 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6861 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6862 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6865 entry
->result
= result
;
6869 pop_cx_call_context ();
6870 return unshare_expr (result
);
6873 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6876 reduced_constant_expression_p (tree t
)
6878 /* FIXME are we calling this too much? */
6879 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6882 /* Some expressions may have constant operands but are not constant
6883 themselves, such as 1/0. Call this function (or rather, the macro
6884 following it) to check for that condition.
6886 We only call this in places that require an arithmetic constant, not in
6887 places where we might have a non-constant expression that can be a
6888 component of a constant expression, such as the address of a constexpr
6889 variable that might be dereferenced later. */
6892 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
,
6895 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6897 if (!allow_non_constant
)
6898 error ("%q+E is not a constant expression", t
);
6899 *non_constant_p
= true;
6901 if (TREE_OVERFLOW_P (t
))
6903 if (!allow_non_constant
)
6905 permerror (input_location
, "overflow in constant expression");
6906 /* If we're being permissive (and are in an enforcing
6907 context), ignore the overflow. */
6908 if (flag_permissive
)
6909 return *non_constant_p
;
6913 return *non_constant_p
;
6916 /* Subroutine of cxx_eval_constant_expression.
6917 Attempt to reduce the unary expression tree T to a compile time value.
6918 If successful, return the value. Otherwise issue a diagnostic
6919 and return error_mark_node. */
6922 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6923 bool allow_non_constant
, bool addr
,
6924 bool *non_constant_p
, bool *overflow_p
)
6927 tree orig_arg
= TREE_OPERAND (t
, 0);
6928 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6929 addr
, non_constant_p
, overflow_p
);
6930 VERIFY_CONSTANT (arg
);
6931 if (arg
== orig_arg
)
6933 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6934 VERIFY_CONSTANT (r
);
6938 /* Subroutine of cxx_eval_constant_expression.
6939 Like cxx_eval_unary_expression, except for binary expressions. */
6942 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6943 bool allow_non_constant
, bool addr
,
6944 bool *non_constant_p
, bool *overflow_p
)
6947 tree orig_lhs
= TREE_OPERAND (t
, 0);
6948 tree orig_rhs
= TREE_OPERAND (t
, 1);
6950 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6951 allow_non_constant
, addr
,
6952 non_constant_p
, overflow_p
);
6953 VERIFY_CONSTANT (lhs
);
6954 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6955 allow_non_constant
, addr
,
6956 non_constant_p
, overflow_p
);
6957 VERIFY_CONSTANT (rhs
);
6958 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6960 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6961 VERIFY_CONSTANT (r
);
6965 /* Subroutine of cxx_eval_constant_expression.
6966 Attempt to evaluate condition expressions. Dead branches are not
6970 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6971 bool allow_non_constant
, bool addr
,
6972 bool *non_constant_p
, bool *overflow_p
)
6974 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6975 allow_non_constant
, addr
,
6976 non_constant_p
, overflow_p
);
6977 VERIFY_CONSTANT (val
);
6978 /* Don't VERIFY_CONSTANT the other operands. */
6979 if (integer_zerop (val
))
6980 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6981 allow_non_constant
, addr
,
6982 non_constant_p
, overflow_p
);
6983 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6984 allow_non_constant
, addr
,
6985 non_constant_p
, overflow_p
);
6988 /* Subroutine of cxx_eval_constant_expression.
6989 Attempt to reduce a reference to an array slot. */
6992 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6993 bool allow_non_constant
, bool addr
,
6994 bool *non_constant_p
, bool *overflow_p
)
6996 tree oldary
= TREE_OPERAND (t
, 0);
6997 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6998 allow_non_constant
, addr
,
6999 non_constant_p
, overflow_p
);
7003 unsigned len
, elem_nchars
= 1;
7004 if (*non_constant_p
)
7006 oldidx
= TREE_OPERAND (t
, 1);
7007 index
= cxx_eval_constant_expression (call
, oldidx
,
7008 allow_non_constant
, false,
7009 non_constant_p
, overflow_p
);
7010 VERIFY_CONSTANT (index
);
7011 if (addr
&& ary
== oldary
&& index
== oldidx
)
7014 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
7015 elem_type
= TREE_TYPE (TREE_TYPE (ary
));
7016 if (TREE_CODE (ary
) == CONSTRUCTOR
)
7017 len
= CONSTRUCTOR_NELTS (ary
);
7018 else if (TREE_CODE (ary
) == STRING_CST
)
7020 elem_nchars
= (TYPE_PRECISION (elem_type
)
7021 / TYPE_PRECISION (char_type_node
));
7022 len
= (unsigned) TREE_STRING_LENGTH (ary
) / elem_nchars
;
7026 /* We can't do anything with other tree codes, so use
7027 VERIFY_CONSTANT to complain and fail. */
7028 VERIFY_CONSTANT (ary
);
7031 if (compare_tree_int (index
, len
) >= 0)
7033 if (tree_int_cst_lt (index
, array_type_nelts_top (TREE_TYPE (ary
))))
7035 /* If it's within the array bounds but doesn't have an explicit
7036 initializer, it's value-initialized. */
7037 tree val
= build_value_init (elem_type
, tf_warning_or_error
);
7038 return cxx_eval_constant_expression (call
, val
,
7039 allow_non_constant
, addr
,
7040 non_constant_p
, overflow_p
);
7043 if (!allow_non_constant
)
7044 error ("array subscript out of bound");
7045 *non_constant_p
= true;
7048 else if (tree_int_cst_lt (index
, integer_zero_node
))
7050 if (!allow_non_constant
)
7051 error ("negative array subscript");
7052 *non_constant_p
= true;
7055 i
= tree_low_cst (index
, 0);
7056 if (TREE_CODE (ary
) == CONSTRUCTOR
)
7057 return (*CONSTRUCTOR_ELTS (ary
))[i
].value
;
7058 else if (elem_nchars
== 1)
7059 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
7060 TREE_STRING_POINTER (ary
)[i
]);
7063 tree type
= cv_unqualified (TREE_TYPE (TREE_TYPE (ary
)));
7064 return native_interpret_expr (type
, (const unsigned char *)
7065 TREE_STRING_POINTER (ary
)
7066 + i
* elem_nchars
, elem_nchars
);
7068 /* Don't VERIFY_CONSTANT here. */
7071 /* Subroutine of cxx_eval_constant_expression.
7072 Attempt to reduce a field access of a value of class type. */
7075 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
7076 bool allow_non_constant
, bool addr
,
7077 bool *non_constant_p
, bool *overflow_p
)
7079 unsigned HOST_WIDE_INT i
;
7082 tree part
= TREE_OPERAND (t
, 1);
7083 tree orig_whole
= TREE_OPERAND (t
, 0);
7084 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
7085 allow_non_constant
, addr
,
7086 non_constant_p
, overflow_p
);
7087 if (whole
== orig_whole
)
7090 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
7091 whole
, part
, NULL_TREE
);
7092 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7094 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
7096 if (!allow_non_constant
)
7097 error ("%qE is not a constant expression", orig_whole
);
7098 *non_constant_p
= true;
7100 if (DECL_MUTABLE_P (part
))
7102 if (!allow_non_constant
)
7103 error ("mutable %qD is not usable in a constant expression", part
);
7104 *non_constant_p
= true;
7106 if (*non_constant_p
)
7108 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
7113 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
7114 && CONSTRUCTOR_NELTS (whole
) > 0)
7116 /* DR 1188 says we don't have to deal with this. */
7117 if (!allow_non_constant
)
7118 error ("accessing %qD member instead of initialized %qD member in "
7119 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
7120 *non_constant_p
= true;
7124 /* If there's no explicit init for this field, it's value-initialized. */
7125 value
= build_value_init (TREE_TYPE (t
), tf_warning_or_error
);
7126 return cxx_eval_constant_expression (call
, value
,
7127 allow_non_constant
, addr
,
7128 non_constant_p
, overflow_p
);
7131 /* Subroutine of cxx_eval_constant_expression.
7132 Attempt to reduce a field access of a value of class type that is
7133 expressed as a BIT_FIELD_REF. */
7136 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
7137 bool allow_non_constant
, bool addr
,
7138 bool *non_constant_p
, bool *overflow_p
)
7140 tree orig_whole
= TREE_OPERAND (t
, 0);
7141 tree retval
, fldval
, utype
, mask
;
7142 bool fld_seen
= false;
7143 HOST_WIDE_INT istart
, isize
;
7144 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
7145 allow_non_constant
, addr
,
7146 non_constant_p
, overflow_p
);
7147 tree start
, field
, value
;
7148 unsigned HOST_WIDE_INT i
;
7150 if (whole
== orig_whole
)
7152 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7154 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
7156 if (!allow_non_constant
)
7157 error ("%qE is not a constant expression", orig_whole
);
7158 *non_constant_p
= true;
7160 if (*non_constant_p
)
7163 start
= TREE_OPERAND (t
, 2);
7164 istart
= tree_low_cst (start
, 0);
7165 isize
= tree_low_cst (TREE_OPERAND (t
, 1), 0);
7166 utype
= TREE_TYPE (t
);
7167 if (!TYPE_UNSIGNED (utype
))
7168 utype
= build_nonstandard_integer_type (TYPE_PRECISION (utype
), 1);
7169 retval
= build_int_cst (utype
, 0);
7170 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
7172 tree bitpos
= bit_position (field
);
7173 if (bitpos
== start
&& DECL_SIZE (field
) == TREE_OPERAND (t
, 1))
7175 if (TREE_CODE (TREE_TYPE (field
)) == INTEGER_TYPE
7176 && TREE_CODE (value
) == INTEGER_CST
7177 && host_integerp (bitpos
, 0)
7178 && host_integerp (DECL_SIZE (field
), 0))
7180 HOST_WIDE_INT bit
= tree_low_cst (bitpos
, 0);
7181 HOST_WIDE_INT sz
= tree_low_cst (DECL_SIZE (field
), 0);
7182 HOST_WIDE_INT shift
;
7183 if (bit
>= istart
&& bit
+ sz
<= istart
+ isize
)
7185 fldval
= fold_convert (utype
, value
);
7186 mask
= build_int_cst_type (utype
, -1);
7187 mask
= fold_build2 (LSHIFT_EXPR
, utype
, mask
,
7188 size_int (TYPE_PRECISION (utype
) - sz
));
7189 mask
= fold_build2 (RSHIFT_EXPR
, utype
, mask
,
7190 size_int (TYPE_PRECISION (utype
) - sz
));
7191 fldval
= fold_build2 (BIT_AND_EXPR
, utype
, fldval
, mask
);
7192 shift
= bit
- istart
;
7193 if (BYTES_BIG_ENDIAN
)
7194 shift
= TYPE_PRECISION (utype
) - shift
- sz
;
7195 fldval
= fold_build2 (LSHIFT_EXPR
, utype
, fldval
,
7197 retval
= fold_build2 (BIT_IOR_EXPR
, utype
, retval
, fldval
);
7203 return fold_convert (TREE_TYPE (t
), retval
);
7205 return error_mark_node
;
7208 /* Subroutine of cxx_eval_constant_expression.
7209 Evaluate a short-circuited logical expression T in the context
7210 of a given constexpr CALL. BAILOUT_VALUE is the value for
7211 early return. CONTINUE_VALUE is used here purely for
7212 sanity check purposes. */
7215 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
7216 tree bailout_value
, tree continue_value
,
7217 bool allow_non_constant
, bool addr
,
7218 bool *non_constant_p
, bool *overflow_p
)
7221 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7222 allow_non_constant
, addr
,
7223 non_constant_p
, overflow_p
);
7224 VERIFY_CONSTANT (lhs
);
7225 if (tree_int_cst_equal (lhs
, bailout_value
))
7227 gcc_assert (tree_int_cst_equal (lhs
, continue_value
));
7228 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7229 allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7230 VERIFY_CONSTANT (r
);
7234 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
7235 CONSTRUCTOR elements to initialize (part of) an object containing that
7236 field. Return a pointer to the constructor_elt corresponding to the
7237 initialization of the field. */
7239 static constructor_elt
*
7240 base_field_constructor_elt (vec
<constructor_elt
, va_gc
> *v
, tree ref
)
7242 tree aggr
= TREE_OPERAND (ref
, 0);
7243 tree field
= TREE_OPERAND (ref
, 1);
7245 constructor_elt
*ce
;
7247 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
7249 if (TREE_CODE (aggr
) == COMPONENT_REF
)
7251 constructor_elt
*base_ce
7252 = base_field_constructor_elt (v
, aggr
);
7253 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
7256 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
7257 if (ce
->index
== field
)
7264 /* Subroutine of cxx_eval_constant_expression.
7265 The expression tree T denotes a C-style array or a C-style
7266 aggregate. Reduce it to a constant expression. */
7269 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
7270 bool allow_non_constant
, bool addr
,
7271 bool *non_constant_p
, bool *overflow_p
)
7273 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
7274 vec
<constructor_elt
, va_gc
> *n
;
7275 vec_alloc (n
, vec_safe_length (v
));
7276 constructor_elt
*ce
;
7278 bool changed
= false;
7279 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
7280 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
7282 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
7283 allow_non_constant
, addr
,
7284 non_constant_p
, overflow_p
);
7285 /* Don't VERIFY_CONSTANT here. */
7286 if (allow_non_constant
&& *non_constant_p
)
7288 if (elt
!= ce
->value
)
7290 if (ce
->index
&& TREE_CODE (ce
->index
) == COMPONENT_REF
)
7292 /* This is an initialization of a vfield inside a base
7293 subaggregate that we already initialized; push this
7294 initialization into the previous initialization. */
7295 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
7298 else if (ce
->index
&& TREE_CODE (ce
->index
) == NOP_EXPR
)
7300 /* This is an initializer for an empty base; now that we've
7301 checked that it's constant, we can ignore it. */
7302 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (ce
->index
))));
7305 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
7307 if (*non_constant_p
|| !changed
)
7313 t
= build_constructor (TREE_TYPE (t
), n
);
7314 TREE_CONSTANT (t
) = true;
7315 if (TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
7320 /* Subroutine of cxx_eval_constant_expression.
7321 The expression tree T is a VEC_INIT_EXPR which denotes the desired
7322 initialization of a non-static data member of array type. Reduce it to a
7325 Note that apart from value-initialization (when VALUE_INIT is true),
7326 this is only intended to support value-initialization and the
7327 initializations done by defaulted constructors for classes with
7328 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
7329 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
7330 for the copy/move constructor. */
7333 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
7334 bool value_init
, bool allow_non_constant
, bool addr
,
7335 bool *non_constant_p
, bool *overflow_p
)
7337 tree elttype
= TREE_TYPE (atype
);
7338 int max
= tree_low_cst (array_type_nelts (atype
), 0);
7339 vec
<constructor_elt
, va_gc
> *n
;
7340 vec_alloc (n
, max
+ 1);
7341 bool pre_init
= false;
7344 /* For the default constructor, build up a call to the default
7345 constructor of the element type. We only need to handle class types
7346 here, as for a constructor to be constexpr, all members must be
7347 initialized, which for a defaulted default constructor means they must
7348 be of a class type with a constexpr default constructor. */
7349 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7350 /* We only do this at the lowest level. */;
7351 else if (value_init
)
7353 init
= build_value_init (elttype
, tf_warning_or_error
);
7354 init
= cxx_eval_constant_expression
7355 (call
, init
, allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7360 vec
<tree
, va_gc
> *argvec
= make_tree_vector ();
7361 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7362 &argvec
, elttype
, LOOKUP_NORMAL
,
7363 tf_warning_or_error
);
7364 release_tree_vector (argvec
);
7365 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
7366 addr
, non_constant_p
, overflow_p
);
7370 if (*non_constant_p
&& !allow_non_constant
)
7373 for (i
= 0; i
<= max
; ++i
)
7375 tree idx
= build_int_cst (size_type_node
, i
);
7377 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7379 /* A multidimensional array; recurse. */
7380 if (value_init
|| init
== NULL_TREE
)
7381 eltinit
= NULL_TREE
;
7383 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7384 tf_warning_or_error
);
7385 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
7386 allow_non_constant
, addr
,
7387 non_constant_p
, overflow_p
);
7391 /* Initializing an element using value or default initialization
7392 we just pre-built above. */
7396 eltinit
= unshare_expr (init
);
7400 /* Copying an element. */
7401 vec
<tree
, va_gc
> *argvec
;
7402 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7403 (atype
, TREE_TYPE (init
)));
7404 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7405 tf_warning_or_error
);
7406 if (!real_lvalue_p (init
))
7407 eltinit
= move (eltinit
);
7408 argvec
= make_tree_vector ();
7409 argvec
->quick_push (eltinit
);
7410 eltinit
= (build_special_member_call
7411 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
7412 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
7413 release_tree_vector (argvec
);
7414 eltinit
= cxx_eval_constant_expression
7415 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7417 if (*non_constant_p
&& !allow_non_constant
)
7419 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
7422 if (!*non_constant_p
)
7424 init
= build_constructor (atype
, n
);
7425 TREE_CONSTANT (init
) = true;
7435 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
7436 bool allow_non_constant
, bool addr
,
7437 bool *non_constant_p
, bool *overflow_p
)
7439 tree atype
= TREE_TYPE (t
);
7440 tree init
= VEC_INIT_EXPR_INIT (t
);
7441 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
7442 VEC_INIT_EXPR_VALUE_INIT (t
),
7443 allow_non_constant
, addr
, non_constant_p
, overflow_p
);
7444 if (*non_constant_p
)
7450 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7451 match. We want to be less strict for simple *& folding; if we have a
7452 non-const temporary that we access through a const pointer, that should
7453 work. We handle this here rather than change fold_indirect_ref_1
7454 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7455 don't really make sense outside of constant expression evaluation. Also
7456 we want to allow folding to COMPONENT_REF, which could cause trouble
7457 with TBAA in fold_indirect_ref_1.
7459 Try to keep this function synced with fold_indirect_ref_1. */
7462 cxx_fold_indirect_ref (location_t loc
, tree type
, tree op0
, bool *empty_base
)
7468 subtype
= TREE_TYPE (sub
);
7469 if (!POINTER_TYPE_P (subtype
))
7472 if (TREE_CODE (sub
) == ADDR_EXPR
)
7474 tree op
= TREE_OPERAND (sub
, 0);
7475 tree optype
= TREE_TYPE (op
);
7477 /* *&CONST_DECL -> to the value of the const decl. */
7478 if (TREE_CODE (op
) == CONST_DECL
)
7479 return DECL_INITIAL (op
);
7480 /* *&p => p; make sure to handle *&"str"[cst] here. */
7481 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
7483 tree fop
= fold_read_from_constant_string (op
);
7489 /* *(foo *)&fooarray => fooarray[0] */
7490 else if (TREE_CODE (optype
) == ARRAY_TYPE
7491 && (same_type_ignoring_top_level_qualifiers_p
7492 (type
, TREE_TYPE (optype
))))
7494 tree type_domain
= TYPE_DOMAIN (optype
);
7495 tree min_val
= size_zero_node
;
7496 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7497 min_val
= TYPE_MIN_VALUE (type_domain
);
7498 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
7499 NULL_TREE
, NULL_TREE
);
7501 /* *(foo *)&complexfoo => __real__ complexfoo */
7502 else if (TREE_CODE (optype
) == COMPLEX_TYPE
7503 && (same_type_ignoring_top_level_qualifiers_p
7504 (type
, TREE_TYPE (optype
))))
7505 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
7506 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7507 else if (TREE_CODE (optype
) == VECTOR_TYPE
7508 && (same_type_ignoring_top_level_qualifiers_p
7509 (type
, TREE_TYPE (optype
))))
7511 tree part_width
= TYPE_SIZE (type
);
7512 tree index
= bitsize_int (0);
7513 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
7515 /* Also handle conversion to an empty base class, which
7516 is represented with a NOP_EXPR. */
7517 else if (is_empty_class (type
)
7518 && CLASS_TYPE_P (optype
)
7519 && DERIVED_FROM_P (type
, optype
))
7524 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7525 else if (RECORD_OR_UNION_TYPE_P (optype
))
7527 tree field
= TYPE_FIELDS (optype
);
7528 for (; field
; field
= DECL_CHAIN (field
))
7529 if (TREE_CODE (field
) == FIELD_DECL
7530 && integer_zerop (byte_position (field
))
7531 && (same_type_ignoring_top_level_qualifiers_p
7532 (TREE_TYPE (field
), type
)))
7534 return fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
7539 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
7540 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
7542 tree op00
= TREE_OPERAND (sub
, 0);
7543 tree op01
= TREE_OPERAND (sub
, 1);
7546 if (TREE_CODE (op00
) == ADDR_EXPR
)
7549 op00
= TREE_OPERAND (op00
, 0);
7550 op00type
= TREE_TYPE (op00
);
7552 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7553 if (TREE_CODE (op00type
) == VECTOR_TYPE
7554 && (same_type_ignoring_top_level_qualifiers_p
7555 (type
, TREE_TYPE (op00type
))))
7557 HOST_WIDE_INT offset
= tree_low_cst (op01
, 0);
7558 tree part_width
= TYPE_SIZE (type
);
7559 unsigned HOST_WIDE_INT part_widthi
= tree_low_cst (part_width
, 0)/BITS_PER_UNIT
;
7560 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
7561 tree index
= bitsize_int (indexi
);
7563 if (offset
/ part_widthi
< TYPE_VECTOR_SUBPARTS (op00type
))
7564 return fold_build3_loc (loc
,
7565 BIT_FIELD_REF
, type
, op00
,
7569 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7570 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
7571 && (same_type_ignoring_top_level_qualifiers_p
7572 (type
, TREE_TYPE (op00type
))))
7574 tree size
= TYPE_SIZE_UNIT (type
);
7575 if (tree_int_cst_equal (size
, op01
))
7576 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
7578 /* ((foo *)&fooarray)[1] => fooarray[1] */
7579 else if (TREE_CODE (op00type
) == ARRAY_TYPE
7580 && (same_type_ignoring_top_level_qualifiers_p
7581 (type
, TREE_TYPE (op00type
))))
7583 tree type_domain
= TYPE_DOMAIN (op00type
);
7584 tree min_val
= size_zero_node
;
7585 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7586 min_val
= TYPE_MIN_VALUE (type_domain
);
7587 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
7588 TYPE_SIZE_UNIT (type
));
7589 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
7590 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
7591 NULL_TREE
, NULL_TREE
);
7593 /* Also handle conversion to an empty base class, which
7594 is represented with a NOP_EXPR. */
7595 else if (is_empty_class (type
)
7596 && CLASS_TYPE_P (op00type
)
7597 && DERIVED_FROM_P (type
, op00type
))
7602 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7603 else if (RECORD_OR_UNION_TYPE_P (op00type
))
7605 tree field
= TYPE_FIELDS (op00type
);
7606 for (; field
; field
= DECL_CHAIN (field
))
7607 if (TREE_CODE (field
) == FIELD_DECL
7608 && tree_int_cst_equal (byte_position (field
), op01
)
7609 && (same_type_ignoring_top_level_qualifiers_p
7610 (TREE_TYPE (field
), type
)))
7612 return fold_build3 (COMPONENT_REF
, type
, op00
,
7619 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
7620 else if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
7621 && (same_type_ignoring_top_level_qualifiers_p
7622 (type
, TREE_TYPE (TREE_TYPE (subtype
)))))
7625 tree min_val
= size_zero_node
;
7626 tree newsub
= cxx_fold_indirect_ref (loc
, TREE_TYPE (subtype
), sub
, NULL
);
7630 sub
= build1_loc (loc
, INDIRECT_REF
, TREE_TYPE (subtype
), sub
);
7631 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
7632 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7633 min_val
= TYPE_MIN_VALUE (type_domain
);
7634 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
7642 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
7643 bool allow_non_constant
, bool addr
,
7644 bool *non_constant_p
, bool *overflow_p
)
7646 tree orig_op0
= TREE_OPERAND (t
, 0);
7647 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
7648 /*addr*/false, non_constant_p
, overflow_p
);
7649 bool empty_base
= false;
7652 /* Don't VERIFY_CONSTANT here. */
7653 if (*non_constant_p
)
7656 r
= cxx_fold_indirect_ref (EXPR_LOCATION (t
), TREE_TYPE (t
), op0
,
7660 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
7661 addr
, non_constant_p
, overflow_p
);
7666 if (TREE_CODE (sub
) == ADDR_EXPR
)
7668 /* We couldn't fold to a constant value. Make sure it's not
7669 something we should have been able to fold. */
7670 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7671 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
7672 /* DR 1188 says we don't have to deal with this. */
7673 if (!allow_non_constant
)
7674 error ("accessing value of %qE through a %qT glvalue in a "
7675 "constant expression", build_fold_indirect_ref (sub
),
7677 *non_constant_p
= true;
7682 /* If we're pulling out the value of an empty base, make sure
7683 that the whole object is constant and then return an empty
7687 VERIFY_CONSTANT (r
);
7688 r
= build_constructor (TREE_TYPE (t
), NULL
);
7689 TREE_CONSTANT (r
) = true;
7694 if (addr
&& op0
!= orig_op0
)
7695 return build1 (INDIRECT_REF
, TREE_TYPE (t
), op0
);
7697 VERIFY_CONSTANT (t
);
7703 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7704 Shared between potential_constant_expression and
7705 cxx_eval_constant_expression. */
7708 non_const_var_error (tree r
)
7710 tree type
= TREE_TYPE (r
);
7711 error ("the value of %qD is not usable in a constant "
7713 /* Avoid error cascade. */
7714 if (DECL_INITIAL (r
) == error_mark_node
)
7716 if (DECL_DECLARED_CONSTEXPR_P (r
))
7717 inform (DECL_SOURCE_LOCATION (r
),
7718 "%qD used in its own initializer", r
);
7719 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7721 if (!CP_TYPE_CONST_P (type
))
7722 inform (DECL_SOURCE_LOCATION (r
),
7723 "%q#D is not const", r
);
7724 else if (CP_TYPE_VOLATILE_P (type
))
7725 inform (DECL_SOURCE_LOCATION (r
),
7726 "%q#D is volatile", r
);
7727 else if (!DECL_INITIAL (r
)
7728 || !TREE_CONSTANT (DECL_INITIAL (r
)))
7729 inform (DECL_SOURCE_LOCATION (r
),
7730 "%qD was not initialized with a constant "
7737 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
7738 inform (DECL_SOURCE_LOCATION (r
),
7739 "%qD was not declared %<constexpr%>", r
);
7741 inform (DECL_SOURCE_LOCATION (r
),
7742 "%qD does not have integral or enumeration type",
7747 /* Evaluate VEC_PERM_EXPR (v1, v2, mask). */
7749 cxx_eval_vec_perm_expr (const constexpr_call
*call
, tree t
,
7750 bool allow_non_constant
, bool addr
,
7751 bool *non_constant_p
, bool *overflow_p
)
7756 tree elttype
= TREE_TYPE (t
);
7758 for (i
= 0; i
< 3; i
++)
7760 args
[i
] = cxx_eval_constant_expression (call
, TREE_OPERAND (t
, i
),
7761 allow_non_constant
, addr
,
7762 non_constant_p
, overflow_p
);
7763 if (*non_constant_p
)
7767 gcc_assert (TREE_CODE (TREE_TYPE (args
[0])) == VECTOR_TYPE
);
7768 gcc_assert (TREE_CODE (TREE_TYPE (args
[1])) == VECTOR_TYPE
);
7769 gcc_assert (TREE_CODE (TREE_TYPE (args
[2])) == VECTOR_TYPE
);
7771 val
= fold_ternary_loc (EXPR_LOCATION (t
), VEC_PERM_EXPR
, elttype
,
7772 args
[0], args
[1], args
[2]);
7773 if (val
!= NULL_TREE
)
7780 /* Attempt to reduce the expression T to a constant value.
7781 On failure, issue diagnostic and return error_mark_node. */
7782 /* FIXME unify with c_fully_fold */
7785 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
7786 bool allow_non_constant
, bool addr
,
7787 bool *non_constant_p
, bool *overflow_p
)
7791 if (t
== error_mark_node
)
7793 *non_constant_p
= true;
7796 if (CONSTANT_CLASS_P (t
))
7798 if (TREE_CODE (t
) == PTRMEM_CST
)
7799 t
= cplus_expand_constant (t
);
7800 else if (TREE_OVERFLOW (t
) && (!flag_permissive
|| allow_non_constant
))
7804 if (TREE_CODE (t
) != NOP_EXPR
7805 && reduced_constant_expression_p (t
))
7808 switch (TREE_CODE (t
))
7813 /* else fall through. */
7815 r
= integral_constant_value (t
);
7816 if (TREE_CODE (r
) == TARGET_EXPR
7817 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
7818 r
= TARGET_EXPR_INITIAL (r
);
7821 if (!allow_non_constant
)
7822 non_const_var_error (r
);
7823 *non_constant_p
= true;
7833 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
7835 if (DECL_ARTIFICIAL (t
) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t
)))
7837 if (!allow_non_constant
)
7838 sorry ("use of the value of the object being constructed "
7839 "in a constant expression");
7840 *non_constant_p
= true;
7843 r
= lookup_parameter_binding (call
, t
);
7846 /* Defer in case this is only used for its type. */;
7849 if (!allow_non_constant
)
7850 error ("%qE is not a constant expression", t
);
7851 *non_constant_p
= true;
7856 case AGGR_INIT_EXPR
:
7857 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
7858 non_constant_p
, overflow_p
);
7862 if (!literal_type_p (TREE_TYPE (t
)))
7864 if (!allow_non_constant
)
7866 error ("temporary of non-literal type %qT in a "
7867 "constant expression", TREE_TYPE (t
));
7868 explain_non_literal_class (TREE_TYPE (t
));
7870 *non_constant_p
= true;
7873 /* else fall through. */
7875 /* Pass false for 'addr' because these codes indicate
7876 initialization of a temporary. */
7877 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7878 allow_non_constant
, false,
7879 non_constant_p
, overflow_p
);
7880 if (!*non_constant_p
)
7881 /* Adjust the type of the result to the type of the temporary. */
7882 r
= adjust_temp_type (TREE_TYPE (t
), r
);
7886 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7887 allow_non_constant
, addr
,
7888 non_constant_p
, overflow_p
);
7892 case NON_LVALUE_EXPR
:
7893 case TRY_CATCH_EXPR
:
7894 case CLEANUP_POINT_EXPR
:
7895 case MUST_NOT_THROW_EXPR
:
7897 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7898 allow_non_constant
, addr
,
7899 non_constant_p
, overflow_p
);
7902 /* These differ from cxx_eval_unary_expression in that this doesn't
7903 check for a constant operand or result; an address can be
7904 constant without its operand being, and vice versa. */
7906 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
7907 non_constant_p
, overflow_p
);
7912 tree oldop
= TREE_OPERAND (t
, 0);
7913 tree op
= cxx_eval_constant_expression (call
, oldop
,
7916 non_constant_p
, overflow_p
);
7917 /* Don't VERIFY_CONSTANT here. */
7918 if (*non_constant_p
)
7920 /* This function does more aggressive folding than fold itself. */
7921 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
7922 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
7930 case FIX_TRUNC_EXPR
:
7935 case TRUTH_NOT_EXPR
:
7936 case FIXED_CONVERT_EXPR
:
7937 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
7938 non_constant_p
, overflow_p
);
7942 if (SIZEOF_EXPR_TYPE_P (t
))
7943 r
= cxx_sizeof_or_alignof_type (TREE_TYPE (TREE_OPERAND (t
, 0)),
7944 SIZEOF_EXPR
, false);
7945 else if (TYPE_P (TREE_OPERAND (t
, 0)))
7946 r
= cxx_sizeof_or_alignof_type (TREE_OPERAND (t
, 0), SIZEOF_EXPR
,
7949 r
= cxx_sizeof_or_alignof_expr (TREE_OPERAND (t
, 0), SIZEOF_EXPR
,
7951 if (r
== error_mark_node
)
7953 VERIFY_CONSTANT (r
);
7958 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7959 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7960 introduced by build_call_a. */
7961 tree op0
= TREE_OPERAND (t
, 0);
7962 tree op1
= TREE_OPERAND (t
, 1);
7964 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7965 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7966 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7967 addr
, non_constant_p
, overflow_p
);
7970 /* Check that the LHS is constant and then discard it. */
7971 cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7972 false, non_constant_p
, overflow_p
);
7973 op1
= TREE_OPERAND (t
, 1);
7974 r
= cxx_eval_constant_expression (call
, op1
, allow_non_constant
,
7975 addr
, non_constant_p
, overflow_p
);
7980 case POINTER_PLUS_EXPR
:
7984 case TRUNC_DIV_EXPR
:
7986 case FLOOR_DIV_EXPR
:
7987 case ROUND_DIV_EXPR
:
7988 case TRUNC_MOD_EXPR
:
7990 case ROUND_MOD_EXPR
:
7992 case EXACT_DIV_EXPR
:
8002 case TRUTH_XOR_EXPR
:
8009 case UNORDERED_EXPR
:
8019 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
8020 non_constant_p
, overflow_p
);
8023 /* fold can introduce non-IF versions of these; still treat them as
8024 short-circuiting. */
8025 case TRUTH_AND_EXPR
:
8026 case TRUTH_ANDIF_EXPR
:
8027 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
8029 allow_non_constant
, addr
,
8030 non_constant_p
, overflow_p
);
8034 case TRUTH_ORIF_EXPR
:
8035 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
8037 allow_non_constant
, addr
,
8038 non_constant_p
, overflow_p
);
8042 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
8043 non_constant_p
, overflow_p
);
8047 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
8048 non_constant_p
, overflow_p
);
8052 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
8053 non_constant_p
, overflow_p
);
8058 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
8059 non_constant_p
, overflow_p
);
8063 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
8064 non_constant_p
, overflow_p
);
8068 /* We can get this in a defaulted constructor for a class with a
8069 non-static data member of array type. Either the initializer will
8070 be NULL, meaning default-initialization, or it will be an lvalue
8071 or xvalue of the same type, meaning direct-initialization from the
8072 corresponding member. */
8073 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
8074 non_constant_p
, overflow_p
);
8078 r
= cxx_eval_vec_perm_expr (call
, t
, allow_non_constant
, addr
,
8079 non_constant_p
, overflow_p
);
8083 case VIEW_CONVERT_EXPR
:
8086 tree oldop
= TREE_OPERAND (t
, 0);
8087 tree op
= cxx_eval_constant_expression (call
, oldop
,
8088 allow_non_constant
, addr
,
8089 non_constant_p
, overflow_p
);
8090 if (*non_constant_p
)
8093 /* We didn't fold at the top so we could check for ptr-int
8096 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), op
);
8097 /* Conversion of an out-of-range value has implementation-defined
8098 behavior; the language considers it different from arithmetic
8099 overflow, which is undefined. */
8100 if (TREE_OVERFLOW_P (r
) && !TREE_OVERFLOW_P (op
))
8101 TREE_OVERFLOW (r
) = false;
8105 case EMPTY_CLASS_EXPR
:
8106 /* This is good enough for a function argument that might not get
8107 used, and they can't do anything with it, so just return it. */
8111 case PREINCREMENT_EXPR
:
8112 case POSTINCREMENT_EXPR
:
8113 case PREDECREMENT_EXPR
:
8114 case POSTDECREMENT_EXPR
:
8118 case VEC_DELETE_EXPR
:
8122 /* GCC internal stuff. */
8125 case WITH_CLEANUP_EXPR
:
8126 case STATEMENT_LIST
:
8128 case NON_DEPENDENT_EXPR
:
8132 if (!allow_non_constant
)
8133 error_at (EXPR_LOC_OR_HERE (t
),
8134 "expression %qE is not a constant-expression", t
);
8135 *non_constant_p
= true;
8139 internal_error ("unexpected expression %qE of kind %s", t
,
8140 tree_code_name
[TREE_CODE (t
)]);
8141 *non_constant_p
= true;
8145 if (r
== error_mark_node
)
8146 *non_constant_p
= true;
8148 if (*non_constant_p
)
8155 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
8157 bool non_constant_p
= false;
8158 bool overflow_p
= false;
8159 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
8160 false, &non_constant_p
, &overflow_p
);
8162 verify_constant (r
, allow_non_constant
, &non_constant_p
, &overflow_p
);
8164 if (TREE_CODE (t
) != CONSTRUCTOR
8165 && cp_has_mutable_p (TREE_TYPE (t
)))
8167 /* We allow a mutable type if the original expression was a
8168 CONSTRUCTOR so that we can do aggregate initialization of
8169 constexpr variables. */
8170 if (!allow_non_constant
)
8171 error ("%qT cannot be the type of a complete constant expression "
8172 "because it has mutable sub-objects", TREE_TYPE (t
));
8173 non_constant_p
= true;
8176 /* Technically we should check this for all subexpressions, but that
8177 runs into problems with our internal representation of pointer
8178 subtraction and the 5.19 rules are still in flux. */
8179 if (CONVERT_EXPR_CODE_P (TREE_CODE (r
))
8180 && ARITHMETIC_TYPE_P (TREE_TYPE (r
))
8181 && TREE_CODE (TREE_OPERAND (r
, 0)) == ADDR_EXPR
)
8183 if (!allow_non_constant
)
8184 error ("conversion from pointer type %qT "
8185 "to arithmetic type %qT in a constant-expression",
8186 TREE_TYPE (TREE_OPERAND (r
, 0)), TREE_TYPE (r
));
8187 non_constant_p
= true;
8190 if (!non_constant_p
&& overflow_p
)
8191 non_constant_p
= true;
8193 if (non_constant_p
&& !allow_non_constant
)
8194 return error_mark_node
;
8195 else if (non_constant_p
&& TREE_CONSTANT (r
))
8197 /* This isn't actually constant, so unset TREE_CONSTANT. */
8200 else if (TREE_CODE (r
) == CONSTRUCTOR
)
8201 r
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (r
), r
);
8203 r
= build_nop (TREE_TYPE (r
), r
);
8204 TREE_CONSTANT (r
) = false;
8206 else if (non_constant_p
|| r
== t
)
8209 if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
8211 if (TREE_CODE (t
) == TARGET_EXPR
8212 && TARGET_EXPR_INITIAL (t
) == r
)
8216 r
= get_target_expr (r
);
8217 TREE_CONSTANT (r
) = true;
8225 /* Returns true if T is a valid subexpression of a constant expression,
8226 even if it isn't itself a constant expression. */
8229 is_sub_constant_expr (tree t
)
8231 bool non_constant_p
= false;
8232 bool overflow_p
= false;
8233 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
,
8235 return !non_constant_p
&& !overflow_p
;
8238 /* If T represents a constant expression returns its reduced value.
8239 Otherwise return error_mark_node. If T is dependent, then
8243 cxx_constant_value (tree t
)
8245 return cxx_eval_outermost_constant_expr (t
, false);
8248 /* If T is a constant expression, returns its reduced value.
8249 Otherwise, if T does not have TREE_CONSTANT set, returns T.
8250 Otherwise, returns a version of T without TREE_CONSTANT. */
8253 maybe_constant_value (tree t
)
8257 if (type_dependent_expression_p (t
)
8258 || type_unknown_p (t
)
8259 || BRACE_ENCLOSED_INITIALIZER_P (t
)
8260 || !potential_constant_expression (t
)
8261 || value_dependent_expression_p (t
))
8263 if (TREE_OVERFLOW_P (t
))
8265 t
= build_nop (TREE_TYPE (t
), t
);
8266 TREE_CONSTANT (t
) = false;
8271 r
= cxx_eval_outermost_constant_expr (t
, true);
8272 #ifdef ENABLE_CHECKING
8273 /* cp_tree_equal looks through NOPs, so allow them. */
8275 || CONVERT_EXPR_P (t
)
8276 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
8277 || !cp_tree_equal (r
, t
));
8282 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
8283 than wrapped in a TARGET_EXPR. */
8286 maybe_constant_init (tree t
)
8288 t
= maybe_constant_value (t
);
8289 if (TREE_CODE (t
) == TARGET_EXPR
)
8291 tree init
= TARGET_EXPR_INITIAL (t
);
8292 if (TREE_CODE (init
) == CONSTRUCTOR
)
8299 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
8300 /* Return true if the object referred to by REF has automatic or thread
8303 enum { ck_ok
, ck_bad
, ck_unknown
};
8305 check_automatic_or_tls (tree ref
)
8307 enum machine_mode mode
;
8308 HOST_WIDE_INT bitsize
, bitpos
;
8310 int volatilep
= 0, unsignedp
= 0;
8311 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
8312 &mode
, &unsignedp
, &volatilep
, false);
8315 /* If there isn't a decl in the middle, we don't know the linkage here,
8316 and this isn't a constant expression anyway. */
8319 dk
= decl_storage_duration (decl
);
8320 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
8324 /* Return true if T denotes a potentially constant expression. Issue
8325 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
8326 an lvalue-rvalue conversion is implied.
8328 C++0x [expr.const] used to say
8330 6 An expression is a potential constant expression if it is
8331 a constant expression where all occurences of function
8332 parameters are replaced by arbitrary constant expressions
8333 of the appropriate type.
8335 2 A conditional expression is a constant expression unless it
8336 involves one of the following as a potentially evaluated
8337 subexpression (3.2), but subexpressions of logical AND (5.14),
8338 logical OR (5.15), and conditional (5.16) operations that are
8339 not evaluated are not considered. */
8342 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
8344 enum { any
= false, rval
= true };
8348 if (t
== error_mark_node
)
8352 if (TREE_THIS_VOLATILE (t
))
8354 if (flags
& tf_error
)
8355 error ("expression %qE has side-effects", t
);
8358 if (CONSTANT_CLASS_P (t
))
8361 switch (TREE_CODE (t
))
8367 case TEMPLATE_ID_EXPR
:
8374 case TEMPLATE_PARM_INDEX
:
8376 case IDENTIFIER_NODE
:
8377 case USERDEF_LITERAL
:
8378 /* We can see a FIELD_DECL in a pointer-to-member expression. */
8384 case AGGR_INIT_EXPR
:
8386 /* -- an invocation of a function other than a constexpr function
8387 or a constexpr constructor. */
8389 tree fun
= get_function_named_in_call (t
);
8390 const int nargs
= call_expr_nargs (t
);
8393 if (is_overloaded_fn (fun
))
8395 if (TREE_CODE (fun
) == FUNCTION_DECL
)
8397 if (builtin_valid_in_constant_expr_p (fun
))
8399 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
8400 /* Allow any built-in function; if the expansion
8401 isn't constant, we'll deal with that then. */
8402 && !is_builtin_fn (fun
))
8404 if (flags
& tf_error
)
8406 error_at (EXPR_LOC_OR_HERE (t
),
8407 "call to non-constexpr function %qD", fun
);
8408 explain_invalid_constexpr_fn (fun
);
8412 /* A call to a non-static member function takes the address
8413 of the object as the first argument. But in a constant
8414 expression the address will be folded away, so look
8416 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
8417 && !DECL_CONSTRUCTOR_P (fun
))
8419 tree x
= get_nth_callarg (t
, 0);
8420 if (is_this_parameter (x
))
8422 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8424 if (flags
& tf_error
)
8425 sorry ("calling a member function of the "
8426 "object being constructed in a constant "
8430 /* Otherwise OK. */;
8432 else if (!potential_constant_expression_1 (x
, rval
, flags
))
8439 if (!potential_constant_expression_1 (fun
, true, flags
))
8441 fun
= get_first_fn (fun
);
8443 /* Skip initial arguments to base constructors. */
8444 if (DECL_BASE_CONSTRUCTOR_P (fun
))
8445 i
= num_artificial_parms_for (fun
);
8446 fun
= DECL_ORIGIN (fun
);
8450 if (potential_constant_expression_1 (fun
, rval
, flags
))
8451 /* Might end up being a constant function pointer. */;
8455 for (; i
< nargs
; ++i
)
8457 tree x
= get_nth_callarg (t
, i
);
8458 if (!potential_constant_expression_1 (x
, rval
, flags
))
8464 case NON_LVALUE_EXPR
:
8465 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
8466 -- an lvalue of integral type that refers to a non-volatile
8467 const variable or static data member initialized with
8468 constant expressions, or
8470 -- an lvalue of literal type that refers to non-volatile
8471 object defined with constexpr, or that refers to a
8472 sub-object of such an object; */
8473 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
8476 if (want_rval
&& !decl_constant_var_p (t
)
8477 && !dependent_type_p (TREE_TYPE (t
)))
8479 if (flags
& tf_error
)
8480 non_const_var_error (t
);
8487 case VIEW_CONVERT_EXPR
:
8488 /* -- a reinterpret_cast. FIXME not implemented, and this rule
8489 may change to something more specific to type-punning (DR 1312). */
8491 tree from
= TREE_OPERAND (t
, 0);
8492 return (potential_constant_expression_1
8493 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
8497 /* -- a unary operator & that is applied to an lvalue that
8498 designates an object with thread or automatic storage
8500 t
= TREE_OPERAND (t
, 0);
8502 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8503 any checking here, as we might dereference the pointer later. If
8504 we remove this code, also remove check_automatic_or_tls. */
8505 i
= check_automatic_or_tls (t
);
8510 if (flags
& tf_error
)
8511 error ("address-of an object %qE with thread local or "
8512 "automatic storage is not a constant expression", t
);
8516 return potential_constant_expression_1 (t
, any
, flags
);
8522 /* -- a class member access unless its postfix-expression is
8523 of literal type or of pointer to literal type. */
8524 /* This test would be redundant, as it follows from the
8525 postfix-expression being a potential constant expression. */
8526 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8529 case EXPR_PACK_EXPANSION
:
8530 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
8535 tree x
= TREE_OPERAND (t
, 0);
8537 if (is_this_parameter (x
))
8539 if (want_rval
&& DECL_CONTEXT (x
)
8540 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8542 if (flags
& tf_error
)
8543 sorry ("use of the value of the object being constructed "
8544 "in a constant expression");
8549 return potential_constant_expression_1 (x
, rval
, flags
);
8553 case DYNAMIC_CAST_EXPR
:
8554 case PSEUDO_DTOR_EXPR
:
8555 case PREINCREMENT_EXPR
:
8556 case POSTINCREMENT_EXPR
:
8557 case PREDECREMENT_EXPR
:
8558 case POSTDECREMENT_EXPR
:
8562 case VEC_DELETE_EXPR
:
8566 /* GCC internal stuff. */
8569 case WITH_CLEANUP_EXPR
:
8570 case CLEANUP_POINT_EXPR
:
8571 case MUST_NOT_THROW_EXPR
:
8572 case TRY_CATCH_EXPR
:
8573 case STATEMENT_LIST
:
8574 /* Don't bother trying to define a subset of statement-expressions to
8575 be constant-expressions, at least for now. */
8579 case TRANSACTION_EXPR
:
8584 if (flags
& tf_error
)
8585 error ("expression %qE is not a constant-expression", t
);
8589 /* -- a typeid expression whose operand is of polymorphic
8592 tree e
= TREE_OPERAND (t
, 0);
8593 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
8594 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
8596 if (flags
& tf_error
)
8597 error ("typeid-expression is not a constant expression "
8598 "because %qE is of polymorphic type", e
);
8605 /* -- a subtraction where both operands are pointers. */
8606 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8607 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8609 if (flags
& tf_error
)
8610 error ("difference of two pointer expressions is not "
8611 "a constant expression");
8623 /* -- a relational or equality operator where at least
8624 one of the operands is a pointer. */
8625 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8626 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8628 if (flags
& tf_error
)
8629 error ("pointer comparison expression is not a "
8630 "constant expression");
8638 if (TYPE_P (TREE_OPERAND (t
, 0)))
8640 /* else fall through. */
8646 case FIX_TRUNC_EXPR
:
8650 case TRUTH_NOT_EXPR
:
8651 case FIXED_CONVERT_EXPR
:
8652 case UNARY_PLUS_EXPR
:
8653 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
8657 case CONST_CAST_EXPR
:
8658 case STATIC_CAST_EXPR
:
8659 case REINTERPRET_CAST_EXPR
:
8660 case IMPLICIT_CONV_EXPR
:
8661 if (cxx_dialect
< cxx0x
8662 && !dependent_type_p (TREE_TYPE (t
))
8663 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
)))
8664 /* In C++98, a conversion to non-integral type can't be part of a
8665 constant expression. */
8667 if (flags
& tf_error
)
8668 error ("cast to non-integral type %qT in a constant expression",
8673 return (potential_constant_expression_1
8674 (TREE_OPERAND (t
, 0),
8675 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
8678 case NON_DEPENDENT_EXPR
:
8679 /* For convenience. */
8681 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8685 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8689 if (!literal_type_p (TREE_TYPE (t
)))
8691 if (flags
& tf_error
)
8693 error ("temporary of non-literal type %qT in a "
8694 "constant expression", TREE_TYPE (t
));
8695 explain_non_literal_class (TREE_TYPE (t
));
8700 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8705 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (t
);
8706 constructor_elt
*ce
;
8707 for (i
= 0; vec_safe_iterate (v
, i
, &ce
); ++i
)
8708 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
8715 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8716 || DECL_P (TREE_PURPOSE (t
)));
8717 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
8720 if (TREE_CHAIN (t
) == NULL_TREE
)
8722 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
8726 case TRUNC_DIV_EXPR
:
8728 case FLOOR_DIV_EXPR
:
8729 case ROUND_DIV_EXPR
:
8730 case TRUNC_MOD_EXPR
:
8732 case ROUND_MOD_EXPR
:
8734 tree denom
= TREE_OPERAND (t
, 1);
8735 if (!potential_constant_expression_1 (denom
, rval
, flags
))
8737 /* We can't call cxx_eval_outermost_constant_expr on an expression
8738 that hasn't been through fold_non_dependent_expr yet. */
8739 if (!processing_template_decl
)
8740 denom
= cxx_eval_outermost_constant_expr (denom
, true);
8741 if (integer_zerop (denom
))
8743 if (flags
& tf_error
)
8744 error ("division by zero is not a constant-expression");
8750 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8757 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8758 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8759 introduced by build_call_a. */
8760 tree op0
= TREE_OPERAND (t
, 0);
8761 tree op1
= TREE_OPERAND (t
, 1);
8763 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
8764 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
8765 return potential_constant_expression_1 (op0
, want_rval
, flags
);
8770 /* If the first operand is the non-short-circuit constant, look at
8771 the second operand; otherwise we only care about the first one for
8773 case TRUTH_AND_EXPR
:
8774 case TRUTH_ANDIF_EXPR
:
8775 tmp
= boolean_true_node
;
8778 case TRUTH_ORIF_EXPR
:
8779 tmp
= boolean_false_node
;
8782 tree op
= TREE_OPERAND (t
, 0);
8783 if (!potential_constant_expression_1 (op
, rval
, flags
))
8785 if (!processing_template_decl
)
8786 op
= cxx_eval_outermost_constant_expr (op
, true);
8787 if (tree_int_cst_equal (op
, tmp
))
8788 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
8795 case POINTER_PLUS_EXPR
:
8797 case EXACT_DIV_EXPR
:
8807 case TRUTH_XOR_EXPR
:
8808 case UNORDERED_EXPR
:
8821 case ARRAY_RANGE_REF
:
8825 for (i
= 0; i
< 2; ++i
)
8826 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8833 for (i
= 0; i
< 3; ++i
)
8834 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8841 /* If the condition is a known constant, we know which of the legs we
8842 care about; otherwise we only require that the condition and
8843 either of the legs be potentially constant. */
8844 tmp
= TREE_OPERAND (t
, 0);
8845 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
8847 if (!processing_template_decl
)
8848 tmp
= cxx_eval_outermost_constant_expr (tmp
, true);
8849 if (integer_zerop (tmp
))
8850 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
8852 else if (TREE_CODE (tmp
) == INTEGER_CST
)
8853 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8855 for (i
= 1; i
< 3; ++i
)
8856 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8857 want_rval
, tf_none
))
8859 if (flags
& tf_error
)
8860 error ("expression %qE is not a constant-expression", t
);
8864 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
8866 if (flags
& tf_error
)
8868 error ("non-constant array initialization");
8869 diagnose_non_constexpr_vec_init (t
);
8874 case OMP_ATOMIC_READ
:
8875 case OMP_ATOMIC_CAPTURE_OLD
:
8876 case OMP_ATOMIC_CAPTURE_NEW
:
8880 if (objc_is_property_ref (t
))
8883 sorry ("unexpected AST of kind %s", tree_code_name
[TREE_CODE (t
)]);
8889 /* The main entry point to the above. */
8892 potential_constant_expression (tree t
)
8894 return potential_constant_expression_1 (t
, false, tf_none
);
8897 /* As above, but require a constant rvalue. */
8900 potential_rvalue_constant_expression (tree t
)
8902 return potential_constant_expression_1 (t
, true, tf_none
);
8905 /* Like above, but complain about non-constant expressions. */
8908 require_potential_constant_expression (tree t
)
8910 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
8913 /* Cross product of the above. */
8916 require_potential_rvalue_constant_expression (tree t
)
8918 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
8921 /* Constructor for a lambda expression. */
8924 build_lambda_expr (void)
8926 tree lambda
= make_node (LAMBDA_EXPR
);
8927 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
8928 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
8929 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
8930 LAMBDA_EXPR_PENDING_PROXIES (lambda
) = NULL
;
8931 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
8932 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
8936 /* Create the closure object for a LAMBDA_EXPR. */
8939 build_lambda_object (tree lambda_expr
)
8941 /* Build aggregate constructor call.
8942 - cp_parser_braced_list
8943 - cp_parser_functional_cast */
8944 vec
<constructor_elt
, va_gc
> *elts
= NULL
;
8945 tree node
, expr
, type
;
8946 location_t saved_loc
;
8948 if (processing_template_decl
)
8951 /* Make sure any error messages refer to the lambda-introducer. */
8952 saved_loc
= input_location
;
8953 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
8955 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
8957 node
= TREE_CHAIN (node
))
8959 tree field
= TREE_PURPOSE (node
);
8960 tree val
= TREE_VALUE (node
);
8962 if (field
== error_mark_node
)
8964 expr
= error_mark_node
;
8971 /* Mere mortals can't copy arrays with aggregate initialization, so
8972 do some magic to make it work here. */
8973 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
8974 val
= build_array_copy (val
);
8975 else if (DECL_NORMAL_CAPTURE_P (field
)
8976 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
8978 /* "the entities that are captured by copy are used to
8979 direct-initialize each corresponding non-static data
8980 member of the resulting closure object."
8982 There's normally no way to express direct-initialization
8983 from an element of a CONSTRUCTOR, so we build up a special
8984 TARGET_EXPR to bypass the usual copy-initialization. */
8985 val
= force_rvalue (val
, tf_warning_or_error
);
8986 if (TREE_CODE (val
) == TARGET_EXPR
)
8987 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
8990 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
8993 expr
= build_constructor (init_list_type_node
, elts
);
8994 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
8996 /* N2927: "[The closure] class type is not an aggregate."
8997 But we briefly treat it as an aggregate to make this simpler. */
8998 type
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
8999 CLASSTYPE_NON_AGGREGATE (type
) = 0;
9000 expr
= finish_compound_literal (type
, expr
, tf_warning_or_error
);
9001 CLASSTYPE_NON_AGGREGATE (type
) = 1;
9004 input_location
= saved_loc
;
9008 /* Return an initialized RECORD_TYPE for LAMBDA.
9009 LAMBDA must have its explicit captures already. */
9012 begin_lambda_type (tree lambda
)
9017 /* Unique name. This is just like an unnamed class, but we cannot use
9018 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
9020 name
= make_lambda_name ();
9022 /* Create the new RECORD_TYPE for this lambda. */
9023 type
= xref_tag (/*tag_code=*/record_type
,
9025 /*scope=*/ts_lambda
,
9026 /*template_header_p=*/false);
9027 if (type
== error_mark_node
)
9028 return error_mark_node
;
9031 /* Designate it as a struct so that we can use aggregate initialization. */
9032 CLASSTYPE_DECLARED_CLASS (type
) = false;
9034 /* Cross-reference the expression and the type. */
9035 LAMBDA_EXPR_CLOSURE (lambda
) = type
;
9036 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
9038 /* Clear base types. */
9039 xref_basetypes (type
, /*bases=*/NULL_TREE
);
9041 /* Start the class. */
9042 type
= begin_class_definition (type
);
9047 /* Returns the type to use for the return type of the operator() of a
9051 lambda_return_type (tree expr
)
9053 if (expr
== NULL_TREE
)
9054 return void_type_node
;
9055 if (type_unknown_p (expr
)
9056 || BRACE_ENCLOSED_INITIALIZER_P (expr
))
9058 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
9059 return void_type_node
;
9061 gcc_checking_assert (!type_dependent_expression_p (expr
));
9062 return cv_unqualified (type_decays_to (unlowered_expr_type (expr
)));
9065 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
9069 lambda_function (tree lambda
)
9072 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
9073 type
= LAMBDA_EXPR_CLOSURE (lambda
);
9076 gcc_assert (LAMBDA_TYPE_P (type
));
9077 /* Don't let debug_tree cause instantiation. */
9078 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
9079 && !COMPLETE_OR_OPEN_TYPE_P (type
))
9081 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
9082 /*protect=*/0, /*want_type=*/false,
9083 tf_warning_or_error
);
9085 lambda
= BASELINK_FUNCTIONS (lambda
);
9089 /* Returns the type to use for the FIELD_DECL corresponding to the
9091 The caller should add REFERENCE_TYPE for capture by reference. */
9094 lambda_capture_field_type (tree expr
)
9097 if (type_dependent_expression_p (expr
)
9098 && !(TREE_TYPE (expr
) && TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
9099 && !type_uses_auto (TREE_TYPE (expr
))))
9101 type
= cxx_make_type (DECLTYPE_TYPE
);
9102 DECLTYPE_TYPE_EXPR (type
) = expr
;
9103 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
9104 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9107 type
= non_reference (unlowered_expr_type (expr
));
9111 /* Insert the deduced return type for an auto function. */
9114 apply_deduced_return_type (tree fco
, tree return_type
)
9118 if (return_type
== error_mark_node
)
9121 if (LAMBDA_FUNCTION_P (fco
))
9123 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
9124 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
9127 if (DECL_CONV_FN_P (fco
))
9128 DECL_NAME (fco
) = mangle_conv_op_name_for_type (return_type
);
9130 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
9132 result
= DECL_RESULT (fco
);
9133 if (result
== NULL_TREE
)
9135 if (TREE_TYPE (result
) == return_type
)
9138 /* We already have a DECL_RESULT from start_preparsed_function.
9139 Now we need to redo the work it and allocate_struct_function
9140 did to reflect the new type. */
9141 gcc_assert (current_function_decl
== fco
);
9142 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
9143 TYPE_MAIN_VARIANT (return_type
));
9144 DECL_ARTIFICIAL (result
) = 1;
9145 DECL_IGNORED_P (result
) = 1;
9146 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
9149 DECL_RESULT (fco
) = result
;
9151 if (!processing_template_decl
)
9153 bool aggr
= aggregate_value_p (result
, fco
);
9154 #ifdef PCC_STATIC_STRUCT_RETURN
9155 cfun
->returns_pcc_struct
= aggr
;
9157 cfun
->returns_struct
= aggr
;
9162 /* DECL is a local variable or parameter from the surrounding scope of a
9163 lambda-expression. Returns the decltype for a use of the capture field
9164 for DECL even if it hasn't been captured yet. */
9167 capture_decltype (tree decl
)
9169 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9170 /* FIXME do lookup instead of list walk? */
9171 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
9175 type
= TREE_TYPE (TREE_PURPOSE (cap
));
9177 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
9180 error ("%qD is not captured", decl
);
9181 return error_mark_node
;
9184 type
= TREE_TYPE (decl
);
9185 if (TREE_CODE (type
) == REFERENCE_TYPE
9186 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
9187 type
= TREE_TYPE (type
);
9190 case CPLD_REFERENCE
:
9191 type
= TREE_TYPE (decl
);
9192 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9193 type
= build_reference_type (TREE_TYPE (decl
));
9200 if (TREE_CODE (type
) != REFERENCE_TYPE
)
9202 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
9203 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
9205 type
= build_reference_type (type
);
9210 /* Returns true iff DECL is a lambda capture proxy variable created by
9211 build_capture_proxy. */
9214 is_capture_proxy (tree decl
)
9216 return (TREE_CODE (decl
) == VAR_DECL
9217 && DECL_HAS_VALUE_EXPR_P (decl
)
9218 && !DECL_ANON_UNION_VAR_P (decl
)
9219 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl
)));
9222 /* Returns true iff DECL is a capture proxy for a normal capture
9223 (i.e. without explicit initializer). */
9226 is_normal_capture_proxy (tree decl
)
9228 if (!is_capture_proxy (decl
))
9229 /* It's not a capture proxy. */
9232 /* It is a capture proxy, is it a normal capture? */
9233 tree val
= DECL_VALUE_EXPR (decl
);
9234 if (val
== error_mark_node
)
9237 gcc_assert (TREE_CODE (val
) == COMPONENT_REF
);
9238 val
= TREE_OPERAND (val
, 1);
9239 return DECL_NORMAL_CAPTURE_P (val
);
9242 /* VAR is a capture proxy created by build_capture_proxy; add it to the
9243 current function, which is the operator() for the appropriate lambda. */
9246 insert_capture_proxy (tree var
)
9248 cp_binding_level
*b
;
9251 /* Put the capture proxy in the extra body block so that it won't clash
9252 with a later local variable. */
9253 b
= current_binding_level
;
9256 cp_binding_level
*n
= b
->level_chain
;
9257 if (n
->kind
== sk_function_parms
)
9261 pushdecl_with_scope (var
, b
, false);
9263 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
9264 var
= build_stmt (DECL_SOURCE_LOCATION (var
), DECL_EXPR
, var
);
9265 stmt_list
= (*stmt_list_stack
)[1];
9266 gcc_assert (stmt_list
);
9267 append_to_statement_list_force (var
, &stmt_list
);
9270 /* We've just finished processing a lambda; if the containing scope is also
9271 a lambda, insert any capture proxies that were created while processing
9272 the nested lambda. */
9275 insert_pending_capture_proxies (void)
9278 vec
<tree
, va_gc
> *proxies
;
9281 if (!current_function_decl
|| !LAMBDA_FUNCTION_P (current_function_decl
))
9284 lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9285 proxies
= LAMBDA_EXPR_PENDING_PROXIES (lam
);
9286 for (i
= 0; i
< vec_safe_length (proxies
); ++i
)
9288 tree var
= (*proxies
)[i
];
9289 insert_capture_proxy (var
);
9291 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam
));
9292 LAMBDA_EXPR_PENDING_PROXIES (lam
) = NULL
;
9295 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
9296 return the type we want the proxy to have: the type of the field itself,
9297 with added const-qualification if the lambda isn't mutable and the
9298 capture is by value. */
9301 lambda_proxy_type (tree ref
)
9304 if (REFERENCE_REF_P (ref
))
9305 ref
= TREE_OPERAND (ref
, 0);
9306 type
= TREE_TYPE (ref
);
9307 if (!dependent_type_p (type
)
9308 || (type
&& TREE_CODE (type
) == POINTER_TYPE
))
9310 type
= cxx_make_type (DECLTYPE_TYPE
);
9311 DECLTYPE_TYPE_EXPR (type
) = ref
;
9312 DECLTYPE_FOR_LAMBDA_PROXY (type
) = true;
9313 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9317 /* MEMBER is a capture field in a lambda closure class. Now that we're
9318 inside the operator(), build a placeholder var for future lookups and
9322 build_capture_proxy (tree member
)
9324 tree var
, object
, fn
, closure
, name
, lam
, type
;
9326 closure
= DECL_CONTEXT (member
);
9327 fn
= lambda_function (closure
);
9328 lam
= CLASSTYPE_LAMBDA_EXPR (closure
);
9330 /* The proxy variable forwards to the capture field. */
9331 object
= build_fold_indirect_ref (DECL_ARGUMENTS (fn
));
9332 object
= finish_non_static_data_member (member
, object
, NULL_TREE
);
9333 if (REFERENCE_REF_P (object
))
9334 object
= TREE_OPERAND (object
, 0);
9336 /* Remove the __ inserted by add_capture. */
9337 name
= get_identifier (IDENTIFIER_POINTER (DECL_NAME (member
)) + 2);
9339 type
= lambda_proxy_type (object
);
9340 var
= build_decl (input_location
, VAR_DECL
, name
, type
);
9341 SET_DECL_VALUE_EXPR (var
, object
);
9342 DECL_HAS_VALUE_EXPR_P (var
) = 1;
9343 DECL_ARTIFICIAL (var
) = 1;
9344 TREE_USED (var
) = 1;
9345 DECL_CONTEXT (var
) = fn
;
9347 if (name
== this_identifier
)
9349 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam
) == member
);
9350 LAMBDA_EXPR_THIS_CAPTURE (lam
) = var
;
9353 if (fn
== current_function_decl
)
9354 insert_capture_proxy (var
);
9356 vec_safe_push (LAMBDA_EXPR_PENDING_PROXIES (lam
), var
);
9361 /* From an ID and INITIALIZER, create a capture (by reference if
9362 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
9366 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
9367 bool explicit_init_p
)
9370 tree type
, member
, name
;
9372 type
= lambda_capture_field_type (initializer
);
9375 type
= build_reference_type (type
);
9376 if (!real_lvalue_p (initializer
))
9377 error ("cannot capture %qE by reference", initializer
);
9380 /* Capture by copy requires a complete type. */
9381 type
= complete_type (type
);
9383 /* Add __ to the beginning of the field name so that user code
9384 won't find the field with name lookup. We can't just leave the name
9385 unset because template instantiation uses the name to find
9386 instantiated fields. */
9387 buf
= (char *) alloca (IDENTIFIER_LENGTH (id
) + 3);
9388 buf
[1] = buf
[0] = '_';
9389 memcpy (buf
+ 2, IDENTIFIER_POINTER (id
),
9390 IDENTIFIER_LENGTH (id
) + 1);
9391 name
= get_identifier (buf
);
9393 /* If TREE_TYPE isn't set, we're still in the introducer, so check
9395 if (!LAMBDA_EXPR_CLOSURE (lambda
))
9397 if (IDENTIFIER_MARKED (name
))
9399 pedwarn (input_location
, 0,
9400 "already captured %qD in lambda expression", id
);
9403 IDENTIFIER_MARKED (name
) = true;
9406 /* Make member variable. */
9407 member
= build_lang_decl (FIELD_DECL
, name
, type
);
9409 if (!explicit_init_p
)
9410 /* Normal captures are invisible to name lookup but uses are replaced
9411 with references to the capture field; we implement this by only
9412 really making them invisible in unevaluated context; see
9413 qualify_lookup. For now, let's make explicitly initialized captures
9415 DECL_NORMAL_CAPTURE_P (member
) = true;
9417 if (id
== this_identifier
)
9418 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
9420 /* Add it to the appropriate closure class if we've started it. */
9421 if (current_class_type
9422 && current_class_type
== LAMBDA_EXPR_CLOSURE (lambda
))
9423 finish_member_declaration (member
);
9425 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
9426 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
9428 if (LAMBDA_EXPR_CLOSURE (lambda
))
9429 return build_capture_proxy (member
);
9430 /* For explicit captures we haven't started the function yet, so we wait
9431 and build the proxy from cp_parser_lambda_body. */
9435 /* Register all the capture members on the list CAPTURES, which is the
9436 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
9439 register_capture_members (tree captures
)
9441 if (captures
== NULL_TREE
)
9444 register_capture_members (TREE_CHAIN (captures
));
9445 /* We set this in add_capture to avoid duplicates. */
9446 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures
))) = false;
9447 finish_member_declaration (TREE_PURPOSE (captures
));
9450 /* Similar to add_capture, except this works on a stack of nested lambdas.
9451 BY_REFERENCE_P in this case is derived from the default capture mode.
9452 Returns the capture for the lambda at the bottom of the stack. */
9455 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
9457 bool this_capture_p
= (id
== this_identifier
);
9459 tree var
= NULL_TREE
;
9461 tree saved_class_type
= current_class_type
;
9465 for (node
= lambda_stack
;
9467 node
= TREE_CHAIN (node
))
9469 tree lambda
= TREE_VALUE (node
);
9471 current_class_type
= LAMBDA_EXPR_CLOSURE (lambda
);
9472 var
= add_capture (lambda
,
9477 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
9478 == CPLD_REFERENCE
)),
9479 /*explicit_init_p=*/false);
9480 initializer
= convert_from_reference (var
);
9483 current_class_type
= saved_class_type
;
9488 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
9489 INDIRECT_REF, possibly adding it through default capturing. */
9492 lambda_expr_this_capture (tree lambda
)
9496 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
9498 /* In unevaluated context this isn't an odr-use, so just return the
9500 if (cp_unevaluated_operand
)
9502 /* In an NSDMI the fake 'this' pointer that we're using for
9503 parsing is in scope_chain. */
9504 if (LAMBDA_EXPR_EXTRA_SCOPE (lambda
)
9505 && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (lambda
)) == FIELD_DECL
)
9506 return scope_chain
->x_current_class_ptr
;
9507 return lookup_name (this_identifier
);
9510 /* Try to default capture 'this' if we can. */
9512 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
9514 tree lambda_stack
= NULL_TREE
;
9515 tree init
= NULL_TREE
;
9517 /* If we are in a lambda function, we can move out until we hit:
9518 1. a non-lambda function or NSDMI,
9519 2. a lambda function capturing 'this', or
9520 3. a non-default capturing lambda function. */
9521 for (tree tlambda
= lambda
; ;)
9523 lambda_stack
= tree_cons (NULL_TREE
,
9527 if (LAMBDA_EXPR_EXTRA_SCOPE (tlambda
)
9528 && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (tlambda
)) == FIELD_DECL
)
9530 /* In an NSDMI, we don't have a function to look up the decl in,
9531 but the fake 'this' pointer that we're using for parsing is
9533 init
= scope_chain
->x_current_class_ptr
;
9535 (init
&& (TREE_TYPE (TREE_TYPE (init
))
9536 == current_nonlambda_class_type ()));
9540 tree closure_decl
= TYPE_NAME (LAMBDA_EXPR_CLOSURE (tlambda
));
9541 tree containing_function
= decl_function_context (closure_decl
);
9543 if (containing_function
== NULL_TREE
)
9544 /* We ran out of scopes; there's no 'this' to capture. */
9547 if (!LAMBDA_FUNCTION_P (containing_function
))
9549 /* We found a non-lambda function. */
9550 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
))
9551 /* First parameter is 'this'. */
9552 init
= DECL_ARGUMENTS (containing_function
);
9557 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
9559 if (LAMBDA_EXPR_THIS_CAPTURE (tlambda
))
9561 /* An outer lambda has already captured 'this'. */
9562 init
= LAMBDA_EXPR_THIS_CAPTURE (tlambda
);
9566 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (tlambda
) == CPLD_NONE
)
9567 /* An outer lambda won't let us capture 'this'. */
9572 this_capture
= add_default_capture (lambda_stack
,
9573 /*id=*/this_identifier
,
9579 error ("%<this%> was not captured for this lambda function");
9580 result
= error_mark_node
;
9584 /* To make sure that current_class_ref is for the lambda. */
9585 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
))
9586 == LAMBDA_EXPR_CLOSURE (lambda
));
9588 result
= this_capture
;
9590 /* If 'this' is captured, each use of 'this' is transformed into an
9591 access to the corresponding unnamed data member of the closure
9592 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9593 ensures that the transformed expression is an rvalue. ] */
9594 result
= rvalue (result
);
9600 /* We don't want to capture 'this' until we know we need it, i.e. after
9601 overload resolution has chosen a non-static member function. At that
9602 point we call this function to turn a dummy object into a use of the
9606 maybe_resolve_dummy (tree object
)
9608 if (!is_dummy_object (object
))
9611 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (object
));
9612 gcc_assert (TREE_CODE (type
) != POINTER_TYPE
);
9614 if (type
!= current_class_type
9615 && current_class_type
9616 && LAMBDA_TYPE_P (current_class_type
)
9617 && DERIVED_FROM_P (type
, current_nonlambda_class_type ()))
9619 /* In a lambda, need to go through 'this' capture. */
9620 tree lam
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
9621 tree cap
= lambda_expr_this_capture (lam
);
9622 object
= build_x_indirect_ref (EXPR_LOCATION (object
), cap
,
9623 RO_NULL
, tf_warning_or_error
);
9629 /* Returns the method basetype of the innermost non-lambda function, or
9630 NULL_TREE if none. */
9633 nonlambda_method_basetype (void)
9636 if (!current_class_ref
)
9639 type
= current_class_type
;
9640 if (!LAMBDA_TYPE_P (type
))
9643 /* Find the nearest enclosing non-lambda function. */
9644 fn
= TYPE_NAME (type
);
9646 fn
= decl_function_context (fn
);
9647 while (fn
&& LAMBDA_FUNCTION_P (fn
));
9649 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
9652 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
9655 /* If the closure TYPE has a static op(), also add a conversion to function
9659 maybe_add_lambda_conv_op (tree type
)
9661 bool nested
= (current_function_decl
!= NULL_TREE
);
9662 tree callop
= lambda_function (type
);
9663 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
9664 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
9665 vec
<tree
, va_gc
> *argvec
;
9667 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
9670 if (processing_template_decl
)
9673 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
9674 FUNCTION_ARG_CHAIN (callop
));
9676 /* First build up the conversion op. */
9678 rettype
= build_pointer_type (stattype
);
9679 name
= mangle_conv_op_name_for_type (rettype
);
9680 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
9681 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
9682 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
9683 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9685 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9686 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9687 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9689 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
9690 grokclassfn (type
, fn
, NO_SPECIAL
);
9691 set_linkage_according_to_type (type
, fn
);
9692 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9693 DECL_IN_AGGR_P (fn
) = 1;
9694 DECL_ARTIFICIAL (fn
) = 1;
9695 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9696 DECL_DECLARED_INLINE_P (fn
) = 1;
9697 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
9699 DECL_INTERFACE_KNOWN (fn
) = 1;
9701 add_method (type
, fn
, NULL_TREE
);
9703 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9704 the conversion op is used. */
9705 if (varargs_function_p (callop
))
9707 DECL_DELETED_FN (fn
) = 1;
9711 /* Now build up the thunk to be returned. */
9713 name
= get_identifier ("_FUN");
9714 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
9715 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9716 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9717 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9718 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9719 grokclassfn (type
, fn
, NO_SPECIAL
);
9720 set_linkage_according_to_type (type
, fn
);
9721 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9722 DECL_IN_AGGR_P (fn
) = 1;
9723 DECL_ARTIFICIAL (fn
) = 1;
9724 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9725 DECL_DECLARED_INLINE_P (fn
) = 1;
9726 DECL_STATIC_FUNCTION_P (fn
) = 1;
9727 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
9728 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
9729 DECL_CONTEXT (arg
) = fn
;
9731 DECL_INTERFACE_KNOWN (fn
) = 1;
9733 add_method (type
, fn
, NULL_TREE
);
9736 push_function_context ();
9738 /* Still increment function_depth so that we don't GC in the
9739 middle of an expression. */
9742 /* Generate the body of the thunk. */
9744 start_preparsed_function (statfn
, NULL_TREE
,
9745 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9746 if (DECL_ONE_ONLY (statfn
))
9748 /* Put the thunk in the same comdat group as the call op. */
9749 symtab_add_to_same_comdat_group
9750 ((symtab_node
) cgraph_get_create_node (statfn
),
9751 (symtab_node
) cgraph_get_create_node (callop
));
9753 body
= begin_function_body ();
9754 compound_stmt
= begin_compound_stmt (0);
9756 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
9758 argvec
= make_tree_vector ();
9759 argvec
->quick_push (arg
);
9760 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
9762 mark_exp_read (arg
);
9763 vec_safe_push (argvec
, arg
);
9765 call
= build_call_a (callop
, argvec
->length (), argvec
->address ());
9766 CALL_FROM_THUNK_P (call
) = 1;
9767 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
9768 call
= build_cplus_new (TREE_TYPE (call
), call
, tf_warning_or_error
);
9769 call
= convert_from_reference (call
);
9770 finish_return_stmt (call
);
9772 finish_compound_stmt (compound_stmt
);
9773 finish_function_body (body
);
9775 expand_or_defer_fn (finish_function (2));
9777 /* Generate the body of the conversion op. */
9779 start_preparsed_function (convfn
, NULL_TREE
,
9780 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9781 body
= begin_function_body ();
9782 compound_stmt
= begin_compound_stmt (0);
9784 /* decl_needed_p needs to see that it's used. */
9785 TREE_USED (statfn
) = 1;
9786 finish_return_stmt (decay_conversion (statfn
, tf_warning_or_error
));
9788 finish_compound_stmt (compound_stmt
);
9789 finish_function_body (body
);
9791 expand_or_defer_fn (finish_function (2));
9794 pop_function_context ();
9799 /* Returns true iff VAL is a lambda-related declaration which should
9800 be ignored by unqualified lookup. */
9803 is_lambda_ignored_entity (tree val
)
9805 /* In unevaluated context, look past normal capture proxies. */
9806 if (cp_unevaluated_operand
&& is_normal_capture_proxy (val
))
9809 /* Always ignore lambda fields, their names are only for debugging. */
9810 if (TREE_CODE (val
) == FIELD_DECL
9811 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val
)))
9814 /* None of the lookups that use qualify_lookup want the op() from the
9815 lambda; they want the one from the enclosing class. */
9816 if (TREE_CODE (val
) == FUNCTION_DECL
&& LAMBDA_FUNCTION_P (val
))
9822 #include "gt-cp-semantics.h"