1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
34 #include "c-family/c-objc.h"
35 #include "tree-inline.h"
40 #include "diagnostic.h"
42 #include "tree-iterator.h"
48 /* There routines provide a modular interface to perform many parsing
49 operations. They may therefore be used during actual parsing, or
50 during template instantiation, which may be regarded as a
51 degenerate form of parsing. */
53 static tree
maybe_convert_cond (tree
);
54 static tree
finalize_nrv_r (tree
*, int *, void *);
55 static tree
capture_decltype (tree
);
58 /* Deferred Access Checking Overview
59 ---------------------------------
61 Most C++ expressions and declarations require access checking
62 to be performed during parsing. However, in several cases,
63 this has to be treated differently.
65 For member declarations, access checking has to be deferred
66 until more information about the declaration is known. For
78 When we are parsing the function return type `A::X', we don't
79 really know if this is allowed until we parse the function name.
81 Furthermore, some contexts require that access checking is
82 never performed at all. These include class heads, and template
85 Typical use of access checking functions is described here:
87 1. When we enter a context that requires certain access checking
88 mode, the function `push_deferring_access_checks' is called with
89 DEFERRING argument specifying the desired mode. Access checking
90 may be performed immediately (dk_no_deferred), deferred
91 (dk_deferred), or not performed (dk_no_check).
93 2. When a declaration such as a type, or a variable, is encountered,
94 the function `perform_or_defer_access_check' is called. It
95 maintains a VEC of all deferred checks.
97 3. The global `current_class_type' or `current_function_decl' is then
98 setup by the parser. `enforce_access' relies on these information
101 4. Upon exiting the context mentioned in step 1,
102 `perform_deferred_access_checks' is called to check all declaration
103 stored in the VEC. `pop_deferring_access_checks' is then
104 called to restore the previous access checking mode.
106 In case of parsing error, we simply call `pop_deferring_access_checks'
107 without `perform_deferred_access_checks'. */
109 typedef struct GTY(()) deferred_access
{
110 /* A VEC representing name-lookups for which we have deferred
111 checking access controls. We cannot check the accessibility of
112 names used in a decl-specifier-seq until we know what is being
113 declared because code like:
120 A::B* A::f() { return 0; }
122 is valid, even though `A::B' is not generally accessible. */
123 VEC (deferred_access_check
,gc
)* GTY(()) deferred_access_checks
;
125 /* The current mode of access checks. */
126 enum deferring_kind deferring_access_checks_kind
;
129 DEF_VEC_O (deferred_access
);
130 DEF_VEC_ALLOC_O (deferred_access
,gc
);
132 /* Data for deferred access checking. */
133 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
134 static GTY(()) unsigned deferred_access_no_check
;
136 /* Save the current deferred access states and start deferred
137 access checking iff DEFER_P is true. */
140 push_deferring_access_checks (deferring_kind deferring
)
142 /* For context like template instantiation, access checking
143 disabling applies to all nested context. */
144 if (deferred_access_no_check
|| deferring
== dk_no_check
)
145 deferred_access_no_check
++;
148 deferred_access
*ptr
;
150 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
151 ptr
->deferred_access_checks
= NULL
;
152 ptr
->deferring_access_checks_kind
= deferring
;
156 /* Resume deferring access checks again after we stopped doing
160 resume_deferring_access_checks (void)
162 if (!deferred_access_no_check
)
163 VEC_last (deferred_access
, deferred_access_stack
)
164 .deferring_access_checks_kind
= dk_deferred
;
167 /* Stop deferring access checks. */
170 stop_deferring_access_checks (void)
172 if (!deferred_access_no_check
)
173 VEC_last (deferred_access
, deferred_access_stack
)
174 .deferring_access_checks_kind
= dk_no_deferred
;
177 /* Discard the current deferred access checks and restore the
181 pop_deferring_access_checks (void)
183 if (deferred_access_no_check
)
184 deferred_access_no_check
--;
186 VEC_pop (deferred_access
, deferred_access_stack
);
189 /* Returns a TREE_LIST representing the deferred checks.
190 The TREE_PURPOSE of each node is the type through which the
191 access occurred; the TREE_VALUE is the declaration named.
194 VEC (deferred_access_check
,gc
)*
195 get_deferred_access_checks (void)
197 if (deferred_access_no_check
)
200 return (VEC_last (deferred_access
, deferred_access_stack
)
201 .deferred_access_checks
);
204 /* Take current deferred checks and combine with the
205 previous states if we also defer checks previously.
206 Otherwise perform checks now. */
209 pop_to_parent_deferring_access_checks (void)
211 if (deferred_access_no_check
)
212 deferred_access_no_check
--;
215 VEC (deferred_access_check
,gc
) *checks
;
216 deferred_access
*ptr
;
218 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
219 .deferred_access_checks
);
221 VEC_pop (deferred_access
, deferred_access_stack
);
222 ptr
= &VEC_last (deferred_access
, deferred_access_stack
);
223 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
226 perform_access_checks (checks
, tf_warning_or_error
);
230 /* Merge with parent. */
232 deferred_access_check
*chk
, *probe
;
234 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
236 FOR_EACH_VEC_ELT (deferred_access_check
,
237 ptr
->deferred_access_checks
, j
, probe
)
239 if (probe
->binfo
== chk
->binfo
&&
240 probe
->decl
== chk
->decl
&&
241 probe
->diag_decl
== chk
->diag_decl
)
244 /* Insert into parent's checks. */
245 VEC_safe_push (deferred_access_check
, gc
,
246 ptr
->deferred_access_checks
, chk
);
253 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
254 is the BINFO indicating the qualifying scope used to access the
255 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
256 or we aren't in SFINAE context or all the checks succeed return TRUE,
260 perform_access_checks (VEC (deferred_access_check
,gc
)* checks
,
261 tsubst_flags_t complain
)
264 deferred_access_check
*chk
;
265 location_t loc
= input_location
;
271 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
273 input_location
= chk
->loc
;
274 ok
&= enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
, complain
);
277 input_location
= loc
;
278 return (complain
& tf_error
) ? true : ok
;
281 /* Perform the deferred access checks.
283 After performing the checks, we still have to keep the list
284 `deferred_access_stack->deferred_access_checks' since we may want
285 to check access for them again later in a different context.
292 A::X A::a, x; // No error for `A::a', error for `x'
294 We have to perform deferred access of `A::X', first with `A::a',
295 next with `x'. Return value like perform_access_checks above. */
298 perform_deferred_access_checks (tsubst_flags_t complain
)
300 return perform_access_checks (get_deferred_access_checks (), complain
);
303 /* Defer checking the accessibility of DECL, when looked up in
304 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
305 Return value like perform_access_checks above. */
308 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
,
309 tsubst_flags_t complain
)
312 deferred_access
*ptr
;
313 deferred_access_check
*chk
;
314 deferred_access_check
*new_access
;
317 /* Exit if we are in a context that no access checking is performed.
319 if (deferred_access_no_check
)
322 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
324 ptr
= &VEC_last (deferred_access
, deferred_access_stack
);
326 /* If we are not supposed to defer access checks, just check now. */
327 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
329 bool ok
= enforce_access (binfo
, decl
, diag_decl
, complain
);
330 return (complain
& tf_error
) ? true : ok
;
333 /* See if we are already going to perform this check. */
334 FOR_EACH_VEC_ELT (deferred_access_check
,
335 ptr
->deferred_access_checks
, i
, chk
)
337 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
338 chk
->diag_decl
== diag_decl
)
343 /* If not, record the check. */
345 VEC_safe_push (deferred_access_check
, gc
,
346 ptr
->deferred_access_checks
, 0);
347 new_access
->binfo
= binfo
;
348 new_access
->decl
= decl
;
349 new_access
->diag_decl
= diag_decl
;
350 new_access
->loc
= input_location
;
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 (!VEC_empty (tree
, stmt_list_stack
));
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 operand
= decay_conversion (TREE_VALUE (t
), tf_warning_or_error
);
1385 /* If the type of the operand hasn't been determined (e.g.,
1386 because it involves an overloaded function), then issue
1387 an error message. There's no context available to
1388 resolve the overloading. */
1389 if (TREE_TYPE (operand
) == unknown_type_node
)
1391 error ("type of asm operand %qE could not be determined",
1393 operand
= error_mark_node
;
1396 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1397 oconstraints
, &allows_mem
, &allows_reg
))
1399 /* If the operand is going to end up in memory,
1400 mark it addressable. */
1401 if (!allows_reg
&& allows_mem
)
1403 /* Strip the nops as we allow this case. FIXME, this really
1404 should be rejected or made deprecated. */
1405 STRIP_NOPS (operand
);
1406 if (!cxx_mark_addressable (operand
))
1407 operand
= error_mark_node
;
1411 operand
= error_mark_node
;
1413 TREE_VALUE (t
) = operand
;
1417 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1418 output_operands
, input_operands
,
1420 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1421 r
= maybe_cleanup_point_expr_void (r
);
1422 return add_stmt (r
);
1425 /* Finish a label with the indicated NAME. Returns the new label. */
1428 finish_label_stmt (tree name
)
1430 tree decl
= define_label (input_location
, name
);
1432 if (decl
== error_mark_node
)
1433 return error_mark_node
;
1435 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1440 /* Finish a series of declarations for local labels. G++ allows users
1441 to declare "local" labels, i.e., labels with scope. This extension
1442 is useful when writing code involving statement-expressions. */
1445 finish_label_decl (tree name
)
1447 if (!at_function_scope_p ())
1449 error ("__label__ declarations are only allowed in function scopes");
1453 add_decl_expr (declare_local_label (name
));
1456 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1459 finish_decl_cleanup (tree decl
, tree cleanup
)
1461 push_cleanup (decl
, cleanup
, false);
1464 /* If the current scope exits with an exception, run CLEANUP. */
1467 finish_eh_cleanup (tree cleanup
)
1469 push_cleanup (NULL
, cleanup
, true);
1472 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1473 order they were written by the user. Each node is as for
1474 emit_mem_initializers. */
1477 finish_mem_initializers (tree mem_inits
)
1479 /* Reorder the MEM_INITS so that they are in the order they appeared
1480 in the source program. */
1481 mem_inits
= nreverse (mem_inits
);
1483 if (processing_template_decl
)
1487 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1489 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1490 check for bare parameter packs in the TREE_VALUE, because
1491 any parameter packs in the TREE_VALUE have already been
1492 bound as part of the TREE_PURPOSE. See
1493 make_pack_expansion for more information. */
1494 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1495 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1496 TREE_VALUE (mem
) = error_mark_node
;
1499 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION
,
1500 CTOR_INITIALIZER
, mem_inits
));
1503 emit_mem_initializers (mem_inits
);
1506 /* Finish a parenthesized expression EXPR. */
1509 finish_parenthesized_expr (tree expr
)
1512 /* This inhibits warnings in c_common_truthvalue_conversion. */
1513 TREE_NO_WARNING (expr
) = 1;
1515 if (TREE_CODE (expr
) == OFFSET_REF
1516 || TREE_CODE (expr
) == SCOPE_REF
)
1517 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1518 enclosed in parentheses. */
1519 PTRMEM_OK_P (expr
) = 0;
1521 if (TREE_CODE (expr
) == STRING_CST
)
1522 PAREN_STRING_LITERAL_P (expr
) = 1;
1527 /* Finish a reference to a non-static data member (DECL) that is not
1528 preceded by `.' or `->'. */
1531 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1533 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1537 tree scope
= qualifying_scope
;
1538 if (scope
== NULL_TREE
)
1539 scope
= context_for_name_lookup (decl
);
1540 object
= maybe_dummy_object (scope
, NULL
);
1543 if (object
== error_mark_node
)
1544 return error_mark_node
;
1546 /* DR 613: Can use non-static data members without an associated
1547 object in sizeof/decltype/alignof. */
1548 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1549 && (!processing_template_decl
|| !current_class_ref
))
1551 if (current_function_decl
1552 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1553 error ("invalid use of member %q+D in static member function", decl
);
1555 error ("invalid use of non-static data member %q+D", decl
);
1556 error ("from this location");
1558 return error_mark_node
;
1561 if (current_class_ptr
)
1562 TREE_USED (current_class_ptr
) = 1;
1563 if (processing_template_decl
&& !qualifying_scope
)
1565 tree type
= TREE_TYPE (decl
);
1567 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1568 /* Quals on the object don't matter. */;
1571 /* Set the cv qualifiers. */
1572 int quals
= (current_class_ref
1573 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1574 : TYPE_UNQUALIFIED
);
1576 if (DECL_MUTABLE_P (decl
))
1577 quals
&= ~TYPE_QUAL_CONST
;
1579 quals
|= cp_type_quals (TREE_TYPE (decl
));
1580 type
= cp_build_qualified_type (type
, quals
);
1583 return (convert_from_reference
1584 (build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
)));
1586 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1587 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1589 else if (processing_template_decl
)
1590 return build_qualified_name (TREE_TYPE (decl
),
1593 /*template_p=*/false);
1596 tree access_type
= TREE_TYPE (object
);
1598 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1599 decl
, tf_warning_or_error
);
1601 /* If the data member was named `C::M', convert `*this' to `C'
1603 if (qualifying_scope
)
1605 tree binfo
= NULL_TREE
;
1606 object
= build_scoped_ref (object
, qualifying_scope
,
1610 return build_class_member_access_expr (object
, decl
,
1611 /*access_path=*/NULL_TREE
,
1612 /*preserve_reference=*/false,
1613 tf_warning_or_error
);
1617 /* If we are currently parsing a template and we encountered a typedef
1618 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1619 adds the typedef to a list tied to the current template.
1620 At template instantiation time, that list is walked and access check
1621 performed for each typedef.
1622 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1625 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1627 location_t location
)
1629 tree template_info
= NULL
;
1630 tree cs
= current_scope ();
1632 if (!is_typedef_decl (typedef_decl
)
1634 || !CLASS_TYPE_P (context
)
1638 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1639 template_info
= get_template_info (cs
);
1642 && TI_TEMPLATE (template_info
)
1643 && !currently_open_class (context
))
1644 append_type_to_template_for_access_check (cs
, typedef_decl
,
1648 /* DECL was the declaration to which a qualified-id resolved. Issue
1649 an error message if it is not accessible. If OBJECT_TYPE is
1650 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1651 type of `*x', or `x', respectively. If the DECL was named as
1652 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1655 check_accessibility_of_qualified_id (tree decl
,
1657 tree nested_name_specifier
)
1660 tree qualifying_type
= NULL_TREE
;
1662 /* If we are parsing a template declaration and if decl is a typedef,
1663 add it to a list tied to the template.
1664 At template instantiation time, that list will be walked and
1665 access check performed. */
1666 add_typedef_to_current_template_for_access_check (decl
,
1667 nested_name_specifier
1668 ? nested_name_specifier
1669 : DECL_CONTEXT (decl
),
1672 /* If we're not checking, return immediately. */
1673 if (deferred_access_no_check
)
1676 /* Determine the SCOPE of DECL. */
1677 scope
= context_for_name_lookup (decl
);
1678 /* If the SCOPE is not a type, then DECL is not a member. */
1679 if (!TYPE_P (scope
))
1681 /* Compute the scope through which DECL is being accessed. */
1683 /* OBJECT_TYPE might not be a class type; consider:
1685 class A { typedef int I; };
1689 In this case, we will have "A::I" as the DECL, but "I" as the
1691 && CLASS_TYPE_P (object_type
)
1692 && DERIVED_FROM_P (scope
, object_type
))
1693 /* If we are processing a `->' or `.' expression, use the type of the
1695 qualifying_type
= object_type
;
1696 else if (nested_name_specifier
)
1698 /* If the reference is to a non-static member of the
1699 current class, treat it as if it were referenced through
1701 if (DECL_NONSTATIC_MEMBER_P (decl
)
1702 && current_class_ptr
1703 && DERIVED_FROM_P (scope
, current_class_type
))
1704 qualifying_type
= current_class_type
;
1705 /* Otherwise, use the type indicated by the
1706 nested-name-specifier. */
1708 qualifying_type
= nested_name_specifier
;
1711 /* Otherwise, the name must be from the current class or one of
1713 qualifying_type
= currently_open_derived_class (scope
);
1716 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1717 or similar in a default argument value. */
1718 && CLASS_TYPE_P (qualifying_type
)
1719 && !dependent_type_p (qualifying_type
))
1720 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1721 decl
, tf_warning_or_error
);
1724 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1725 class named to the left of the "::" operator. DONE is true if this
1726 expression is a complete postfix-expression; it is false if this
1727 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1728 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1729 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1730 is true iff this qualified name appears as a template argument. */
1733 finish_qualified_id_expr (tree qualifying_class
,
1738 bool template_arg_p
)
1740 gcc_assert (TYPE_P (qualifying_class
));
1742 if (error_operand_p (expr
))
1743 return error_mark_node
;
1745 if (DECL_P (expr
) || BASELINK_P (expr
))
1749 check_template_keyword (expr
);
1751 /* If EXPR occurs as the operand of '&', use special handling that
1752 permits a pointer-to-member. */
1753 if (address_p
&& done
)
1755 if (TREE_CODE (expr
) == SCOPE_REF
)
1756 expr
= TREE_OPERAND (expr
, 1);
1757 expr
= build_offset_ref (qualifying_class
, expr
,
1758 /*address_p=*/true);
1762 /* Within the scope of a class, turn references to non-static
1763 members into expression of the form "this->...". */
1765 /* But, within a template argument, we do not want make the
1766 transformation, as there is no "this" pointer. */
1768 else if (TREE_CODE (expr
) == FIELD_DECL
)
1770 push_deferring_access_checks (dk_no_check
);
1771 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1773 pop_deferring_access_checks ();
1775 else if (BASELINK_P (expr
) && !processing_template_decl
)
1779 /* See if any of the functions are non-static members. */
1780 /* If so, the expression may be relative to 'this'. */
1781 if (!shared_member_p (expr
)
1782 && (ob
= maybe_dummy_object (qualifying_class
, NULL
),
1783 !is_dummy_object (ob
)))
1784 expr
= (build_class_member_access_expr
1787 BASELINK_ACCESS_BINFO (expr
),
1788 /*preserve_reference=*/false,
1789 tf_warning_or_error
));
1791 /* The expression is a qualified name whose address is not
1793 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1795 else if (BASELINK_P (expr
))
1799 expr
= convert_from_reference (expr
);
1801 /* In a template, return a SCOPE_REF for most qualified-ids
1802 so that we can check access at instantiation time. But if
1803 we're looking at a member of the current instantiation, we
1804 know we have access and building up the SCOPE_REF confuses
1805 non-type template argument handling. */
1806 if (processing_template_decl
1807 && !currently_open_class (qualifying_class
))
1808 expr
= build_qualified_name (TREE_TYPE (expr
),
1809 qualifying_class
, expr
,
1816 /* Begin a statement-expression. The value returned must be passed to
1817 finish_stmt_expr. */
1820 begin_stmt_expr (void)
1822 return push_stmt_list ();
1825 /* Process the final expression of a statement expression. EXPR can be
1826 NULL, if the final expression is empty. Return a STATEMENT_LIST
1827 containing all the statements in the statement-expression, or
1828 ERROR_MARK_NODE if there was an error. */
1831 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1833 if (error_operand_p (expr
))
1835 /* The type of the statement-expression is the type of the last
1837 TREE_TYPE (stmt_expr
) = error_mark_node
;
1838 return error_mark_node
;
1841 /* If the last statement does not have "void" type, then the value
1842 of the last statement is the value of the entire expression. */
1845 tree type
= TREE_TYPE (expr
);
1847 if (processing_template_decl
)
1849 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1850 expr
= add_stmt (expr
);
1851 /* Mark the last statement so that we can recognize it as such at
1852 template-instantiation time. */
1853 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1855 else if (VOID_TYPE_P (type
))
1857 /* Just treat this like an ordinary statement. */
1858 expr
= finish_expr_stmt (expr
);
1862 /* It actually has a value we need to deal with. First, force it
1863 to be an rvalue so that we won't need to build up a copy
1864 constructor call later when we try to assign it to something. */
1865 expr
= force_rvalue (expr
, tf_warning_or_error
);
1866 if (error_operand_p (expr
))
1867 return error_mark_node
;
1869 /* Update for array-to-pointer decay. */
1870 type
= TREE_TYPE (expr
);
1872 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1873 normal statement, but don't convert to void or actually add
1875 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1876 expr
= maybe_cleanup_point_expr (expr
);
1880 /* The type of the statement-expression is the type of the last
1882 TREE_TYPE (stmt_expr
) = type
;
1888 /* Finish a statement-expression. EXPR should be the value returned
1889 by the previous begin_stmt_expr. Returns an expression
1890 representing the statement-expression. */
1893 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1898 if (error_operand_p (stmt_expr
))
1900 pop_stmt_list (stmt_expr
);
1901 return error_mark_node
;
1904 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1906 type
= TREE_TYPE (stmt_expr
);
1907 result
= pop_stmt_list (stmt_expr
);
1908 TREE_TYPE (result
) = type
;
1910 if (processing_template_decl
)
1912 result
= build_min (STMT_EXPR
, type
, result
);
1913 TREE_SIDE_EFFECTS (result
) = 1;
1914 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1916 else if (CLASS_TYPE_P (type
))
1918 /* Wrap the statement-expression in a TARGET_EXPR so that the
1919 temporary object created by the final expression is destroyed at
1920 the end of the full-expression containing the
1921 statement-expression. */
1922 result
= force_target_expr (type
, result
, tf_warning_or_error
);
1928 /* Returns the expression which provides the value of STMT_EXPR. */
1931 stmt_expr_value_expr (tree stmt_expr
)
1933 tree t
= STMT_EXPR_STMT (stmt_expr
);
1935 if (TREE_CODE (t
) == BIND_EXPR
)
1936 t
= BIND_EXPR_BODY (t
);
1938 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1939 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1941 if (TREE_CODE (t
) == EXPR_STMT
)
1942 t
= EXPR_STMT_EXPR (t
);
1947 /* Return TRUE iff EXPR_STMT is an empty list of
1948 expression statements. */
1951 empty_expr_stmt_p (tree expr_stmt
)
1953 tree body
= NULL_TREE
;
1955 if (expr_stmt
== void_zero_node
)
1960 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1961 body
= EXPR_STMT_EXPR (expr_stmt
);
1962 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1968 if (TREE_CODE (body
) == STATEMENT_LIST
)
1969 return tsi_end_p (tsi_start (body
));
1971 return empty_expr_stmt_p (body
);
1976 /* Perform Koenig lookup. FN is the postfix-expression representing
1977 the function (or functions) to call; ARGS are the arguments to the
1978 call; if INCLUDE_STD then the `std' namespace is automatically
1979 considered an associated namespace (used in range-based for loops).
1980 Returns the functions to be considered by overload resolution. */
1983 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
, bool include_std
,
1984 tsubst_flags_t complain
)
1986 tree identifier
= NULL_TREE
;
1987 tree functions
= NULL_TREE
;
1988 tree tmpl_args
= NULL_TREE
;
1989 bool template_id
= false;
1991 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1993 /* Use a separate flag to handle null args. */
1995 tmpl_args
= TREE_OPERAND (fn
, 1);
1996 fn
= TREE_OPERAND (fn
, 0);
1999 /* Find the name of the overloaded function. */
2000 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
2002 else if (is_overloaded_fn (fn
))
2005 identifier
= DECL_NAME (get_first_fn (functions
));
2007 else if (DECL_P (fn
))
2010 identifier
= DECL_NAME (fn
);
2013 /* A call to a namespace-scope function using an unqualified name.
2015 Do Koenig lookup -- unless any of the arguments are
2017 if (!any_type_dependent_arguments_p (args
)
2018 && !any_dependent_template_arguments_p (tmpl_args
))
2020 fn
= lookup_arg_dependent (identifier
, functions
, args
, include_std
);
2023 /* The unqualified name could not be resolved. */
2025 fn
= unqualified_fn_lookup_error (identifier
);
2031 if (fn
&& template_id
)
2032 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
2037 /* Generate an expression for `FN (ARGS)'. This may change the
2040 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2041 as a virtual call, even if FN is virtual. (This flag is set when
2042 encountering an expression where the function name is explicitly
2043 qualified. For example a call to `X::f' never generates a virtual
2046 Returns code for the call. */
2049 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
2050 bool koenig_p
, tsubst_flags_t complain
)
2054 VEC(tree
,gc
) *orig_args
= NULL
;
2056 if (fn
== error_mark_node
)
2057 return error_mark_node
;
2059 gcc_assert (!TYPE_P (fn
));
2063 if (processing_template_decl
)
2065 /* If the call expression is dependent, build a CALL_EXPR node
2066 with no type; type_dependent_expression_p recognizes
2067 expressions with no type as being dependent. */
2068 if (type_dependent_expression_p (fn
)
2069 || any_type_dependent_arguments_p (*args
)
2070 /* For a non-static member function that doesn't have an
2071 explicit object argument, we need to specifically
2072 test the type dependency of the "this" pointer because it
2073 is not included in *ARGS even though it is considered to
2074 be part of the list of arguments. Note that this is
2075 related to CWG issues 515 and 1005. */
2076 || (TREE_CODE (fn
) != COMPONENT_REF
2077 && non_static_member_function_p (fn
)
2078 && current_class_ref
2079 && type_dependent_expression_p (current_class_ref
)))
2081 result
= build_nt_call_vec (fn
, *args
);
2082 SET_EXPR_LOCATION (result
, EXPR_LOC_OR_HERE (fn
));
2083 KOENIG_LOOKUP_P (result
) = koenig_p
;
2088 tree fndecl
= OVL_CURRENT (fn
);
2089 if (TREE_CODE (fndecl
) != FUNCTION_DECL
2090 || !TREE_THIS_VOLATILE (fndecl
))
2096 current_function_returns_abnormally
= 1;
2100 orig_args
= make_tree_vector_copy (*args
);
2101 if (!BASELINK_P (fn
)
2102 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
2103 && TREE_TYPE (fn
) != unknown_type_node
)
2104 fn
= build_non_dependent_expr (fn
);
2105 make_args_non_dependent (*args
);
2108 if (TREE_CODE (fn
) == COMPONENT_REF
)
2110 tree member
= TREE_OPERAND (fn
, 1);
2111 if (BASELINK_P (member
))
2113 tree object
= TREE_OPERAND (fn
, 0);
2114 return build_new_method_call (object
, member
,
2117 ? LOOKUP_NORMAL
| LOOKUP_NONVIRTUAL
2124 if (is_overloaded_fn (fn
))
2125 fn
= baselink_for_fns (fn
);
2128 if (BASELINK_P (fn
))
2132 /* A call to a member function. From [over.call.func]:
2134 If the keyword this is in scope and refers to the class of
2135 that member function, or a derived class thereof, then the
2136 function call is transformed into a qualified function call
2137 using (*this) as the postfix-expression to the left of the
2138 . operator.... [Otherwise] a contrived object of type T
2139 becomes the implied object argument.
2143 struct A { void f(); };
2144 struct B : public A {};
2145 struct C : public A { void g() { B::f(); }};
2147 "the class of that member function" refers to `A'. But 11.2
2148 [class.access.base] says that we need to convert 'this' to B* as
2149 part of the access, so we pass 'B' to maybe_dummy_object. */
2151 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2154 if (processing_template_decl
)
2156 if (type_dependent_expression_p (object
))
2158 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2159 release_tree_vector (orig_args
);
2162 object
= build_non_dependent_expr (object
);
2165 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2167 ? LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
2172 else if (is_overloaded_fn (fn
))
2174 /* If the function is an overloaded builtin, resolve it. */
2175 if (TREE_CODE (fn
) == FUNCTION_DECL
2176 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2177 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2178 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2181 /* A call to a namespace-scope function. */
2182 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2184 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2186 if (!VEC_empty (tree
, *args
))
2187 error ("arguments to destructor are not allowed");
2188 /* Mark the pseudo-destructor call as having side-effects so
2189 that we do not issue warnings about its use. */
2190 result
= build1 (NOP_EXPR
,
2192 TREE_OPERAND (fn
, 0));
2193 TREE_SIDE_EFFECTS (result
) = 1;
2195 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2196 /* If the "function" is really an object of class type, it might
2197 have an overloaded `operator ()'. */
2198 result
= build_op_call (fn
, args
, complain
);
2201 /* A call where the function is unknown. */
2202 result
= cp_build_function_call_vec (fn
, args
, complain
);
2204 if (processing_template_decl
&& result
!= error_mark_node
)
2206 if (TREE_CODE (result
) == INDIRECT_REF
)
2207 result
= TREE_OPERAND (result
, 0);
2208 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2209 SET_EXPR_LOCATION (result
, input_location
);
2210 KOENIG_LOOKUP_P (result
) = koenig_p
;
2211 release_tree_vector (orig_args
);
2212 result
= convert_from_reference (result
);
2217 /* Free garbage OVERLOADs from arg-dependent lookup. */
2218 tree next
= NULL_TREE
;
2220 fn
&& TREE_CODE (fn
) == OVERLOAD
&& OVL_ARG_DEPENDENT (fn
);
2223 if (processing_template_decl
)
2224 /* In a template, we'll re-use them at instantiation time. */
2225 OVL_ARG_DEPENDENT (fn
) = false;
2228 next
= OVL_CHAIN (fn
);
2237 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2238 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2239 POSTDECREMENT_EXPR.) */
2242 finish_increment_expr (tree expr
, enum tree_code code
)
2244 return build_x_unary_op (input_location
, code
, expr
, tf_warning_or_error
);
2247 /* Finish a use of `this'. Returns an expression for `this'. */
2250 finish_this_expr (void)
2254 if (current_class_ptr
)
2256 tree type
= TREE_TYPE (current_class_ref
);
2258 /* In a lambda expression, 'this' refers to the captured 'this'. */
2259 if (LAMBDA_TYPE_P (type
))
2260 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2262 result
= current_class_ptr
;
2265 else if (current_function_decl
2266 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2268 error ("%<this%> is unavailable for static member functions");
2269 result
= error_mark_node
;
2273 if (current_function_decl
)
2274 error ("invalid use of %<this%> in non-member function");
2276 error ("invalid use of %<this%> at top level");
2277 result
= error_mark_node
;
2283 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2284 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2285 the TYPE for the type given. If SCOPE is non-NULL, the expression
2286 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2289 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2291 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2292 return error_mark_node
;
2294 gcc_assert (TYPE_P (destructor
));
2296 if (!processing_template_decl
)
2298 if (scope
== error_mark_node
)
2300 error ("invalid qualifying scope in pseudo-destructor name");
2301 return error_mark_node
;
2303 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2305 error ("qualified type %qT does not match destructor name ~%qT",
2307 return error_mark_node
;
2311 /* [expr.pseudo] says both:
2313 The type designated by the pseudo-destructor-name shall be
2314 the same as the object type.
2318 The cv-unqualified versions of the object type and of the
2319 type designated by the pseudo-destructor-name shall be the
2322 We implement the more generous second sentence, since that is
2323 what most other compilers do. */
2324 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2327 error ("%qE is not of type %qT", object
, destructor
);
2328 return error_mark_node
;
2332 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2335 /* Finish an expression of the form CODE EXPR. */
2338 finish_unary_op_expr (location_t loc
, enum tree_code code
, tree expr
)
2340 tree result
= build_x_unary_op (loc
, code
, expr
, tf_warning_or_error
);
2341 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2342 overflow_warning (input_location
, result
);
2347 /* Finish a compound-literal expression. TYPE is the type to which
2348 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2351 finish_compound_literal (tree type
, tree compound_literal
,
2352 tsubst_flags_t complain
)
2354 if (type
== error_mark_node
)
2355 return error_mark_node
;
2357 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2360 = finish_compound_literal (TREE_TYPE (type
), compound_literal
,
2362 return cp_build_c_cast (type
, compound_literal
, complain
);
2365 if (!TYPE_OBJ_P (type
))
2367 if (complain
& tf_error
)
2368 error ("compound literal of non-object type %qT", type
);
2369 return error_mark_node
;
2372 if (processing_template_decl
)
2374 TREE_TYPE (compound_literal
) = type
;
2375 /* Mark the expression as a compound literal. */
2376 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2377 return compound_literal
;
2380 type
= complete_type (type
);
2382 if (TYPE_NON_AGGREGATE_CLASS (type
))
2384 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2385 everywhere that deals with function arguments would be a pain, so
2386 just wrap it in a TREE_LIST. The parser set a flag so we know
2387 that it came from T{} rather than T({}). */
2388 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2389 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2390 return build_functional_cast (type
, compound_literal
, complain
);
2393 if (TREE_CODE (type
) == ARRAY_TYPE
2394 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2395 return error_mark_node
;
2396 compound_literal
= reshape_init (type
, compound_literal
, complain
);
2397 if (SCALAR_TYPE_P (type
)
2398 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal
)
2399 && (complain
& tf_warning_or_error
))
2400 check_narrowing (type
, compound_literal
);
2401 if (TREE_CODE (type
) == ARRAY_TYPE
2402 && TYPE_DOMAIN (type
) == NULL_TREE
)
2404 cp_complete_array_type_or_error (&type
, compound_literal
,
2406 if (type
== error_mark_node
)
2407 return error_mark_node
;
2409 compound_literal
= digest_init (type
, compound_literal
, complain
);
2410 if (TREE_CODE (compound_literal
) == CONSTRUCTOR
)
2411 TREE_HAS_CONSTRUCTOR (compound_literal
) = true;
2412 /* Put static/constant array temporaries in static variables, but always
2413 represent class temporaries with TARGET_EXPR so we elide copies. */
2414 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2415 && TREE_CODE (type
) == ARRAY_TYPE
2416 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
2417 && initializer_constant_valid_p (compound_literal
, type
))
2419 tree decl
= create_temporary_var (type
);
2420 DECL_INITIAL (decl
) = compound_literal
;
2421 TREE_STATIC (decl
) = 1;
2422 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
2424 /* 5.19 says that a constant expression can include an
2425 lvalue-rvalue conversion applied to "a glvalue of literal type
2426 that refers to a non-volatile temporary object initialized
2427 with a constant expression". Rather than try to communicate
2428 that this VAR_DECL is a temporary, just mark it constexpr. */
2429 DECL_DECLARED_CONSTEXPR_P (decl
) = true;
2430 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
2431 TREE_CONSTANT (decl
) = true;
2433 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2434 decl
= pushdecl_top_level (decl
);
2435 DECL_NAME (decl
) = make_anon_name ();
2436 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2440 return get_target_expr_sfinae (compound_literal
, complain
);
2443 /* Return the declaration for the function-name variable indicated by
2447 finish_fname (tree id
)
2451 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2452 if (processing_template_decl
&& current_function_decl
)
2453 decl
= DECL_NAME (decl
);
2457 /* Finish a translation unit. */
2460 finish_translation_unit (void)
2462 /* In case there were missing closebraces,
2463 get us back to the global binding level. */
2465 while (current_namespace
!= global_namespace
)
2468 /* Do file scope __FUNCTION__ et al. */
2469 finish_fname_decls ();
2472 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2473 Returns the parameter. */
2476 finish_template_type_parm (tree aggr
, tree identifier
)
2478 if (aggr
!= class_type_node
)
2480 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2481 aggr
= class_type_node
;
2484 return build_tree_list (aggr
, identifier
);
2487 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2488 Returns the parameter. */
2491 finish_template_template_parm (tree aggr
, tree identifier
)
2493 tree decl
= build_decl (input_location
,
2494 TYPE_DECL
, identifier
, NULL_TREE
);
2495 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2496 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2497 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2498 DECL_ARTIFICIAL (decl
) = 1;
2499 end_template_decl ();
2501 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2503 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2504 /*is_primary=*/true, /*is_partial=*/false,
2507 return finish_template_type_parm (aggr
, tmpl
);
2510 /* ARGUMENT is the default-argument value for a template template
2511 parameter. If ARGUMENT is invalid, issue error messages and return
2512 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2515 check_template_template_default_arg (tree argument
)
2517 if (TREE_CODE (argument
) != TEMPLATE_DECL
2518 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2519 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2521 if (TREE_CODE (argument
) == TYPE_DECL
)
2522 error ("invalid use of type %qT as a default value for a template "
2523 "template-parameter", TREE_TYPE (argument
));
2525 error ("invalid default argument for a template template parameter");
2526 return error_mark_node
;
2532 /* Begin a class definition, as indicated by T. */
2535 begin_class_definition (tree t
)
2537 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2538 return error_mark_node
;
2540 if (processing_template_parmlist
)
2542 error ("definition of %q#T inside template parameter list", t
);
2543 return error_mark_node
;
2546 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2547 are passed the same as decimal scalar types. */
2548 if (TREE_CODE (t
) == RECORD_TYPE
2549 && !processing_template_decl
)
2551 tree ns
= TYPE_CONTEXT (t
);
2552 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2553 && DECL_CONTEXT (ns
) == std_node
2555 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2557 const char *n
= TYPE_NAME_STRING (t
);
2558 if ((strcmp (n
, "decimal32") == 0)
2559 || (strcmp (n
, "decimal64") == 0)
2560 || (strcmp (n
, "decimal128") == 0))
2561 TYPE_TRANSPARENT_AGGR (t
) = 1;
2565 /* A non-implicit typename comes from code like:
2567 template <typename T> struct A {
2568 template <typename U> struct A<T>::B ...
2570 This is erroneous. */
2571 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2573 error ("invalid definition of qualified type %qT", t
);
2574 t
= error_mark_node
;
2577 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2579 t
= make_class_type (RECORD_TYPE
);
2580 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2583 if (TYPE_BEING_DEFINED (t
))
2585 t
= make_class_type (TREE_CODE (t
));
2586 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2588 maybe_process_partial_specialization (t
);
2590 TYPE_BEING_DEFINED (t
) = 1;
2592 if (flag_pack_struct
)
2595 TYPE_PACKED (t
) = 1;
2596 /* Even though the type is being defined for the first time
2597 here, there might have been a forward declaration, so there
2598 might be cv-qualified variants of T. */
2599 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2600 TYPE_PACKED (v
) = 1;
2602 /* Reset the interface data, at the earliest possible
2603 moment, as it might have been set via a class foo;
2605 if (! TYPE_ANONYMOUS_P (t
))
2607 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2608 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2609 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2610 (t
, finfo
->interface_unknown
);
2612 reset_specialization();
2614 /* Make a declaration for this class in its own scope. */
2615 build_self_reference ();
2620 /* Finish the member declaration given by DECL. */
2623 finish_member_declaration (tree decl
)
2625 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2628 if (decl
== void_type_node
)
2629 /* The COMPONENT was a friend, not a member, and so there's
2630 nothing for us to do. */
2633 /* We should see only one DECL at a time. */
2634 gcc_assert (DECL_CHAIN (decl
) == NULL_TREE
);
2636 /* Set up access control for DECL. */
2638 = (current_access_specifier
== access_private_node
);
2639 TREE_PROTECTED (decl
)
2640 = (current_access_specifier
== access_protected_node
);
2641 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2643 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2644 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2647 /* Mark the DECL as a member of the current class, unless it's
2648 a member of an enumeration. */
2649 if (TREE_CODE (decl
) != CONST_DECL
)
2650 DECL_CONTEXT (decl
) = current_class_type
;
2652 /* Check for bare parameter packs in the member variable declaration. */
2653 if (TREE_CODE (decl
) == FIELD_DECL
)
2655 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2656 TREE_TYPE (decl
) = error_mark_node
;
2657 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2658 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2663 A C language linkage is ignored for the names of class members
2664 and the member function type of class member functions. */
2665 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2666 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2668 /* Put functions on the TYPE_METHODS list and everything else on the
2669 TYPE_FIELDS list. Note that these are built up in reverse order.
2670 We reverse them (to obtain declaration order) in finish_struct. */
2671 if (TREE_CODE (decl
) == FUNCTION_DECL
2672 || DECL_FUNCTION_TEMPLATE_P (decl
))
2674 /* We also need to add this function to the
2675 CLASSTYPE_METHOD_VEC. */
2676 if (add_method (current_class_type
, decl
, NULL_TREE
))
2678 DECL_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2679 TYPE_METHODS (current_class_type
) = decl
;
2681 maybe_add_class_template_decl_list (current_class_type
, decl
,
2685 /* Enter the DECL into the scope of the class. */
2686 else if (pushdecl_class_level (decl
))
2688 if (TREE_CODE (decl
) == USING_DECL
)
2690 /* For now, ignore class-scope USING_DECLS, so that
2691 debugging backends do not see them. */
2692 DECL_IGNORED_P (decl
) = 1;
2695 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2696 go at the beginning. The reason is that lookup_field_1
2697 searches the list in order, and we want a field name to
2698 override a type name so that the "struct stat hack" will
2699 work. In particular:
2701 struct S { enum E { }; int E } s;
2704 is valid. In addition, the FIELD_DECLs must be maintained in
2705 declaration order so that class layout works as expected.
2706 However, we don't need that order until class layout, so we
2707 save a little time by putting FIELD_DECLs on in reverse order
2708 here, and then reversing them in finish_struct_1. (We could
2709 also keep a pointer to the correct insertion points in the
2712 if (TREE_CODE (decl
) == TYPE_DECL
)
2713 TYPE_FIELDS (current_class_type
)
2714 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2717 DECL_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2718 TYPE_FIELDS (current_class_type
) = decl
;
2721 maybe_add_class_template_decl_list (current_class_type
, decl
,
2726 note_decl_for_pch (decl
);
2729 /* DECL has been declared while we are building a PCH file. Perform
2730 actions that we might normally undertake lazily, but which can be
2731 performed now so that they do not have to be performed in
2732 translation units which include the PCH file. */
2735 note_decl_for_pch (tree decl
)
2737 gcc_assert (pch_file
);
2739 /* There's a good chance that we'll have to mangle names at some
2740 point, even if only for emission in debugging information. */
2741 if ((TREE_CODE (decl
) == VAR_DECL
2742 || TREE_CODE (decl
) == FUNCTION_DECL
)
2743 && !processing_template_decl
)
2747 /* Finish processing a complete template declaration. The PARMS are
2748 the template parameters. */
2751 finish_template_decl (tree parms
)
2754 end_template_decl ();
2756 end_specialization ();
2759 /* Finish processing a template-id (which names a type) of the form
2760 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2761 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2762 the scope of template-id indicated. */
2765 finish_template_type (tree name
, tree args
, int entering_scope
)
2769 type
= lookup_template_class (name
, args
,
2770 NULL_TREE
, NULL_TREE
, entering_scope
,
2771 tf_warning_or_error
| tf_user
);
2772 if (type
== error_mark_node
)
2774 else if (CLASS_TYPE_P (type
) && !alias_type_or_template_p (type
))
2775 return TYPE_STUB_DECL (type
);
2777 return TYPE_NAME (type
);
2780 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2781 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2782 BASE_CLASS, or NULL_TREE if an error occurred. The
2783 ACCESS_SPECIFIER is one of
2784 access_{default,public,protected_private}_node. For a virtual base
2785 we set TREE_TYPE. */
2788 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2792 if (base
== error_mark_node
)
2794 error ("invalid base-class specification");
2797 else if (! MAYBE_CLASS_TYPE_P (base
))
2799 error ("%qT is not a class type", base
);
2804 if (cp_type_quals (base
) != 0)
2806 /* DR 484: Can a base-specifier name a cv-qualified
2808 base
= TYPE_MAIN_VARIANT (base
);
2810 result
= build_tree_list (access
, base
);
2812 TREE_TYPE (result
) = integer_type_node
;
2818 /* If FNS is a member function, a set of member functions, or a
2819 template-id referring to one or more member functions, return a
2820 BASELINK for FNS, incorporating the current access context.
2821 Otherwise, return FNS unchanged. */
2824 baselink_for_fns (tree fns
)
2829 if (BASELINK_P (fns
)
2830 || error_operand_p (fns
))
2833 scope
= ovl_scope (fns
);
2834 if (!CLASS_TYPE_P (scope
))
2837 cl
= currently_open_derived_class (scope
);
2840 cl
= TYPE_BINFO (cl
);
2841 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2844 /* Returns true iff DECL is an automatic variable from a function outside
2848 outer_automatic_var_p (tree decl
)
2850 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2851 && DECL_FUNCTION_SCOPE_P (decl
)
2852 && !TREE_STATIC (decl
)
2853 && DECL_CONTEXT (decl
) != current_function_decl
);
2856 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2857 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2858 if non-NULL, is the type or namespace used to explicitly qualify
2859 ID_EXPRESSION. DECL is the entity to which that name has been
2862 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2863 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2864 be set to true if this expression isn't permitted in a
2865 constant-expression, but it is otherwise not set by this function.
2866 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2867 constant-expression, but a non-constant expression is also
2870 DONE is true if this expression is a complete postfix-expression;
2871 it is false if this expression is followed by '->', '[', '(', etc.
2872 ADDRESS_P is true iff this expression is the operand of '&'.
2873 TEMPLATE_P is true iff the qualified-id was of the form
2874 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2875 appears as a template argument.
2877 If an error occurs, and it is the kind of error that might cause
2878 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2879 is the caller's responsibility to issue the message. *ERROR_MSG
2880 will be a string with static storage duration, so the caller need
2883 Return an expression for the entity, after issuing appropriate
2884 diagnostics. This function is also responsible for transforming a
2885 reference to a non-static member into a COMPONENT_REF that makes
2886 the use of "this" explicit.
2888 Upon return, *IDK will be filled in appropriately. */
2890 finish_id_expression (tree id_expression
,
2894 bool integral_constant_expression_p
,
2895 bool allow_non_integral_constant_expression_p
,
2896 bool *non_integral_constant_expression_p
,
2900 bool template_arg_p
,
2901 const char **error_msg
,
2902 location_t location
)
2904 decl
= strip_using_decl (decl
);
2906 /* Initialize the output parameters. */
2907 *idk
= CP_ID_KIND_NONE
;
2910 if (id_expression
== error_mark_node
)
2911 return error_mark_node
;
2912 /* If we have a template-id, then no further lookup is
2913 required. If the template-id was for a template-class, we
2914 will sometimes have a TYPE_DECL at this point. */
2915 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2916 || TREE_CODE (decl
) == TYPE_DECL
)
2918 /* Look up the name. */
2921 if (decl
== error_mark_node
)
2923 /* Name lookup failed. */
2926 || (!dependent_type_p (scope
)
2927 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2928 && IDENTIFIER_TYPENAME_P (id_expression
)
2929 && dependent_type_p (TREE_TYPE (id_expression
))))))
2931 /* If the qualifying type is non-dependent (and the name
2932 does not name a conversion operator to a dependent
2933 type), issue an error. */
2934 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2935 return error_mark_node
;
2939 /* It may be resolved via Koenig lookup. */
2940 *idk
= CP_ID_KIND_UNQUALIFIED
;
2941 return id_expression
;
2944 decl
= id_expression
;
2946 /* If DECL is a variable that would be out of scope under
2947 ANSI/ISO rules, but in scope in the ARM, name lookup
2948 will succeed. Issue a diagnostic here. */
2950 decl
= check_for_out_of_scope_variable (decl
);
2952 /* Remember that the name was used in the definition of
2953 the current class so that we can check later to see if
2954 the meaning would have been different after the class
2955 was entirely defined. */
2956 if (!scope
&& decl
!= error_mark_node
2957 && TREE_CODE (id_expression
) == IDENTIFIER_NODE
)
2958 maybe_note_name_used_in_class (id_expression
, decl
);
2960 /* Disallow uses of local variables from containing functions, except
2961 within lambda-expressions. */
2962 if (outer_automatic_var_p (decl
)
2963 /* It's not a use (3.2) if we're in an unevaluated context. */
2964 && !cp_unevaluated_operand
)
2966 tree context
= DECL_CONTEXT (decl
);
2967 tree containing_function
= current_function_decl
;
2968 tree lambda_stack
= NULL_TREE
;
2969 tree lambda_expr
= NULL_TREE
;
2970 tree initializer
= convert_from_reference (decl
);
2972 /* Mark it as used now even if the use is ill-formed. */
2975 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2976 support for an approach in which a reference to a local
2977 [constant] automatic variable in a nested class or lambda body
2978 would enter the expression as an rvalue, which would reduce
2979 the complexity of the problem"
2981 FIXME update for final resolution of core issue 696. */
2982 if (decl_constant_var_p (decl
))
2983 return integral_constant_value (decl
);
2985 /* If we are in a lambda function, we can move out until we hit
2987 2. a non-lambda function, or
2988 3. a non-default capturing lambda function. */
2989 while (context
!= containing_function
2990 && LAMBDA_FUNCTION_P (containing_function
))
2992 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2993 (DECL_CONTEXT (containing_function
));
2995 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2999 lambda_stack
= tree_cons (NULL_TREE
,
3004 = decl_function_context (containing_function
);
3007 if (context
== containing_function
)
3009 decl
= add_default_capture (lambda_stack
,
3010 /*id=*/DECL_NAME (decl
),
3013 else if (lambda_expr
)
3015 error ("%qD is not captured", decl
);
3016 return error_mark_node
;
3020 error (TREE_CODE (decl
) == VAR_DECL
3021 ? G_("use of %<auto%> variable from containing function")
3022 : G_("use of parameter from containing function"));
3023 error (" %q+#D declared here", decl
);
3024 return error_mark_node
;
3028 /* Also disallow uses of function parameters outside the function
3029 body, except inside an unevaluated context (i.e. decltype). */
3030 if (TREE_CODE (decl
) == PARM_DECL
3031 && DECL_CONTEXT (decl
) == NULL_TREE
3032 && !cp_unevaluated_operand
)
3034 error ("use of parameter %qD outside function body", decl
);
3035 return error_mark_node
;
3039 /* If we didn't find anything, or what we found was a type,
3040 then this wasn't really an id-expression. */
3041 if (TREE_CODE (decl
) == TEMPLATE_DECL
3042 && !DECL_FUNCTION_TEMPLATE_P (decl
))
3044 *error_msg
= "missing template arguments";
3045 return error_mark_node
;
3047 else if (TREE_CODE (decl
) == TYPE_DECL
3048 || TREE_CODE (decl
) == NAMESPACE_DECL
)
3050 *error_msg
= "expected primary-expression";
3051 return error_mark_node
;
3054 /* If the name resolved to a template parameter, there is no
3055 need to look it up again later. */
3056 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
3057 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3061 *idk
= CP_ID_KIND_NONE
;
3062 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
3063 decl
= TEMPLATE_PARM_DECL (decl
);
3064 r
= convert_from_reference (DECL_INITIAL (decl
));
3066 if (integral_constant_expression_p
3067 && !dependent_type_p (TREE_TYPE (decl
))
3068 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
3070 if (!allow_non_integral_constant_expression_p
)
3071 error ("template parameter %qD of type %qT is not allowed in "
3072 "an integral constant expression because it is not of "
3073 "integral or enumeration type", decl
, TREE_TYPE (decl
));
3074 *non_integral_constant_expression_p
= true;
3082 /* If the declaration was explicitly qualified indicate
3083 that. The semantics of `A::f(3)' are different than
3084 `f(3)' if `f' is virtual. */
3086 ? CP_ID_KIND_QUALIFIED
3087 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3088 ? CP_ID_KIND_TEMPLATE_ID
3089 : CP_ID_KIND_UNQUALIFIED
));
3094 An id-expression is type-dependent if it contains an
3095 identifier that was declared with a dependent type.
3097 The standard is not very specific about an id-expression that
3098 names a set of overloaded functions. What if some of them
3099 have dependent types and some of them do not? Presumably,
3100 such a name should be treated as a dependent name. */
3101 /* Assume the name is not dependent. */
3102 dependent_p
= false;
3103 if (!processing_template_decl
)
3104 /* No names are dependent outside a template. */
3106 else if (TREE_CODE (decl
) == CONST_DECL
)
3107 /* We don't want to treat enumerators as dependent. */
3109 /* A template-id where the name of the template was not resolved
3110 is definitely dependent. */
3111 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
3112 && (TREE_CODE (TREE_OPERAND (decl
, 0))
3113 == IDENTIFIER_NODE
))
3115 /* For anything except an overloaded function, just check its
3117 else if (!is_overloaded_fn (decl
))
3119 = dependent_type_p (TREE_TYPE (decl
));
3120 /* For a set of overloaded functions, check each of the
3126 if (BASELINK_P (fns
))
3127 fns
= BASELINK_FUNCTIONS (fns
);
3129 /* For a template-id, check to see if the template
3130 arguments are dependent. */
3131 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3133 tree args
= TREE_OPERAND (fns
, 1);
3134 dependent_p
= any_dependent_template_arguments_p (args
);
3135 /* The functions are those referred to by the
3137 fns
= TREE_OPERAND (fns
, 0);
3140 /* If there are no dependent template arguments, go through
3141 the overloaded functions. */
3142 while (fns
&& !dependent_p
)
3144 tree fn
= OVL_CURRENT (fns
);
3146 /* Member functions of dependent classes are
3148 if (TREE_CODE (fn
) == FUNCTION_DECL
3149 && type_dependent_expression_p (fn
))
3151 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3152 && dependent_template_p (fn
))
3155 fns
= OVL_NEXT (fns
);
3159 /* If the name was dependent on a template parameter, we will
3160 resolve the name at instantiation time. */
3163 /* Create a SCOPE_REF for qualified names, if the scope is
3169 if (address_p
&& done
)
3170 decl
= finish_qualified_id_expr (scope
, decl
,
3176 tree type
= NULL_TREE
;
3177 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3178 type
= TREE_TYPE (decl
);
3179 decl
= build_qualified_name (type
,
3185 if (TREE_TYPE (decl
))
3186 decl
= convert_from_reference (decl
);
3189 /* A TEMPLATE_ID already contains all the information we
3191 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3192 return id_expression
;
3193 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3194 /* If we found a variable, then name lookup during the
3195 instantiation will always resolve to the same VAR_DECL
3196 (or an instantiation thereof). */
3197 if (TREE_CODE (decl
) == VAR_DECL
3198 || TREE_CODE (decl
) == PARM_DECL
)
3201 return convert_from_reference (decl
);
3203 /* The same is true for FIELD_DECL, but we also need to
3204 make sure that the syntax is correct. */
3205 else if (TREE_CODE (decl
) == FIELD_DECL
)
3207 /* Since SCOPE is NULL here, this is an unqualified name.
3208 Access checking has been performed during name lookup
3209 already. Turn off checking to avoid duplicate errors. */
3210 push_deferring_access_checks (dk_no_check
);
3211 decl
= finish_non_static_data_member
3213 /*qualifying_scope=*/NULL_TREE
);
3214 pop_deferring_access_checks ();
3217 return id_expression
;
3220 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3222 error ("use of namespace %qD as expression", decl
);
3223 return error_mark_node
;
3225 else if (DECL_CLASS_TEMPLATE_P (decl
))
3227 error ("use of class template %qT as expression", decl
);
3228 return error_mark_node
;
3230 else if (TREE_CODE (decl
) == TREE_LIST
)
3232 /* Ambiguous reference to base members. */
3233 error ("request for member %qD is ambiguous in "
3234 "multiple inheritance lattice", id_expression
);
3235 print_candidates (decl
);
3236 return error_mark_node
;
3239 /* Mark variable-like entities as used. Functions are similarly
3240 marked either below or after overload resolution. */
3241 if ((TREE_CODE (decl
) == VAR_DECL
3242 || TREE_CODE (decl
) == PARM_DECL
3243 || TREE_CODE (decl
) == CONST_DECL
3244 || TREE_CODE (decl
) == RESULT_DECL
)
3245 && !mark_used (decl
))
3246 return error_mark_node
;
3248 /* Only certain kinds of names are allowed in constant
3249 expression. Template parameters have already
3250 been handled above. */
3251 if (! error_operand_p (decl
)
3252 && integral_constant_expression_p
3253 && ! decl_constant_var_p (decl
)
3254 && TREE_CODE (decl
) != CONST_DECL
3255 && ! builtin_valid_in_constant_expr_p (decl
))
3257 if (!allow_non_integral_constant_expression_p
)
3259 error ("%qD cannot appear in a constant-expression", decl
);
3260 return error_mark_node
;
3262 *non_integral_constant_expression_p
= true;
3267 decl
= (adjust_result_of_qualified_name_lookup
3268 (decl
, scope
, current_nonlambda_class_type()));
3270 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3274 decl
= finish_qualified_id_expr (scope
,
3281 decl
= convert_from_reference (decl
);
3283 else if (TREE_CODE (decl
) == FIELD_DECL
)
3285 /* Since SCOPE is NULL here, this is an unqualified name.
3286 Access checking has been performed during name lookup
3287 already. Turn off checking to avoid duplicate errors. */
3288 push_deferring_access_checks (dk_no_check
);
3289 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3290 /*qualifying_scope=*/NULL_TREE
);
3291 pop_deferring_access_checks ();
3293 else if (is_overloaded_fn (decl
))
3297 first_fn
= get_first_fn (decl
);
3298 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3299 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3301 if (!really_overloaded_fn (decl
)
3302 && !mark_used (first_fn
))
3303 return error_mark_node
;
3306 && TREE_CODE (first_fn
) == FUNCTION_DECL
3307 && DECL_FUNCTION_MEMBER_P (first_fn
)
3308 && !shared_member_p (decl
))
3310 /* A set of member functions. */
3311 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3312 return finish_class_member_access_expr (decl
, id_expression
,
3313 /*template_p=*/false,
3314 tf_warning_or_error
);
3317 decl
= baselink_for_fns (decl
);
3321 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3322 && DECL_CLASS_SCOPE_P (decl
))
3324 tree context
= context_for_name_lookup (decl
);
3325 if (context
!= current_class_type
)
3327 tree path
= currently_open_derived_class (context
);
3328 perform_or_defer_access_check (TYPE_BINFO (path
),
3330 tf_warning_or_error
);
3334 decl
= convert_from_reference (decl
);
3338 if (TREE_DEPRECATED (decl
))
3339 warn_deprecated_use (decl
, NULL_TREE
);
3344 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3345 use as a type-specifier. */
3348 finish_typeof (tree expr
)
3352 if (type_dependent_expression_p (expr
))
3354 type
= cxx_make_type (TYPEOF_TYPE
);
3355 TYPEOF_TYPE_EXPR (type
) = expr
;
3356 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3361 expr
= mark_type_use (expr
);
3363 type
= unlowered_expr_type (expr
);
3365 if (!type
|| type
== unknown_type_node
)
3367 error ("type of %qE is unknown", expr
);
3368 return error_mark_node
;
3374 /* Implement the __underlying_type keyword: Return the underlying
3375 type of TYPE, suitable for use as a type-specifier. */
3378 finish_underlying_type (tree type
)
3380 tree underlying_type
;
3382 if (processing_template_decl
)
3384 underlying_type
= cxx_make_type (UNDERLYING_TYPE
);
3385 UNDERLYING_TYPE_TYPE (underlying_type
) = type
;
3386 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type
);
3388 return underlying_type
;
3391 complete_type (type
);
3393 if (TREE_CODE (type
) != ENUMERAL_TYPE
)
3395 error ("%qT is not an enumeration type", type
);
3396 return error_mark_node
;
3399 underlying_type
= ENUM_UNDERLYING_TYPE (type
);
3401 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3402 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3403 See finish_enum_value_list for details. */
3404 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type
))
3406 = c_common_type_for_mode (TYPE_MODE (underlying_type
),
3407 TYPE_UNSIGNED (underlying_type
));
3409 return underlying_type
;
3412 /* Implement the __direct_bases keyword: Return the direct base classes
3416 calculate_direct_bases (tree type
)
3418 VEC(tree
, gc
) *vector
= make_tree_vector();
3419 tree bases_vec
= NULL_TREE
;
3420 VEC(tree
, none
) *base_binfos
;
3424 complete_type (type
);
3426 if (!NON_UNION_CLASS_TYPE_P (type
))
3427 return make_tree_vec (0);
3429 base_binfos
= BINFO_BASE_BINFOS (TYPE_BINFO (type
));
3431 /* Virtual bases are initialized first */
3432 for (i
= 0; VEC_iterate (tree
, base_binfos
, i
, binfo
); i
++)
3434 if (BINFO_VIRTUAL_P (binfo
))
3436 VEC_safe_push (tree
, gc
, vector
, binfo
);
3440 /* Now non-virtuals */
3441 for (i
= 0; VEC_iterate (tree
, base_binfos
, i
, binfo
); i
++)
3443 if (!BINFO_VIRTUAL_P (binfo
))
3445 VEC_safe_push (tree
, gc
, vector
, binfo
);
3450 bases_vec
= make_tree_vec (VEC_length (tree
, vector
));
3452 for (i
= 0; i
< VEC_length (tree
, vector
); ++i
)
3454 TREE_VEC_ELT (bases_vec
, i
) = BINFO_TYPE (VEC_index (tree
, vector
, i
));
3459 /* Implement the __bases keyword: Return the base classes
3462 /* Find morally non-virtual base classes by walking binfo hierarchy */
3463 /* Virtual base classes are handled separately in finish_bases */
3466 dfs_calculate_bases_pre (tree binfo
, ATTRIBUTE_UNUSED
void *data_
)
3468 /* Don't walk bases of virtual bases */
3469 return BINFO_VIRTUAL_P (binfo
) ? dfs_skip_bases
: NULL_TREE
;
3473 dfs_calculate_bases_post (tree binfo
, void *data_
)
3475 VEC(tree
, gc
) **data
= (VEC(tree
, gc
) **) data_
;
3476 if (!BINFO_VIRTUAL_P (binfo
))
3478 VEC_safe_push (tree
, gc
, *data
, BINFO_TYPE (binfo
));
3483 /* Calculates the morally non-virtual base classes of a class */
3484 static VEC(tree
, gc
) *
3485 calculate_bases_helper (tree type
)
3487 VEC(tree
, gc
) *vector
= make_tree_vector();
3489 /* Now add non-virtual base classes in order of construction */
3490 dfs_walk_all (TYPE_BINFO (type
),
3491 dfs_calculate_bases_pre
, dfs_calculate_bases_post
, &vector
);
3496 calculate_bases (tree type
)
3498 VEC(tree
, gc
) *vector
= make_tree_vector();
3499 tree bases_vec
= NULL_TREE
;
3501 VEC(tree
, gc
) *vbases
;
3502 VEC(tree
, gc
) *nonvbases
;
3505 complete_type (type
);
3507 if (!NON_UNION_CLASS_TYPE_P (type
))
3508 return make_tree_vec (0);
3510 /* First go through virtual base classes */
3511 for (vbases
= CLASSTYPE_VBASECLASSES (type
), i
= 0;
3512 VEC_iterate (tree
, vbases
, i
, binfo
); i
++)
3514 VEC(tree
, gc
) *vbase_bases
= calculate_bases_helper (BINFO_TYPE (binfo
));
3515 VEC_safe_splice (tree
, gc
, vector
, vbase_bases
);
3516 release_tree_vector (vbase_bases
);
3519 /* Now for the non-virtual bases */
3520 nonvbases
= calculate_bases_helper (type
);
3521 VEC_safe_splice (tree
, gc
, vector
, nonvbases
);
3522 release_tree_vector (nonvbases
);
3524 /* Last element is entire class, so don't copy */
3525 bases_vec
= make_tree_vec (VEC_length (tree
, vector
) - 1);
3527 for (i
= 0; i
< VEC_length (tree
, vector
) - 1; ++i
)
3529 TREE_VEC_ELT (bases_vec
, i
) = VEC_index (tree
, vector
, i
);
3531 release_tree_vector (vector
);
3536 finish_bases (tree type
, bool direct
)
3538 tree bases
= NULL_TREE
;
3540 if (!processing_template_decl
)
3542 /* Parameter packs can only be used in templates */
3543 error ("Parameter pack __bases only valid in template declaration");
3544 return error_mark_node
;
3547 bases
= cxx_make_type (BASES
);
3548 BASES_TYPE (bases
) = type
;
3549 BASES_DIRECT (bases
) = direct
;
3550 SET_TYPE_STRUCTURAL_EQUALITY (bases
);
3555 /* Perform C++-specific checks for __builtin_offsetof before calling
3559 finish_offsetof (tree expr
)
3561 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3563 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3564 TREE_OPERAND (expr
, 2));
3565 return error_mark_node
;
3567 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3568 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3569 || TREE_TYPE (expr
) == unknown_type_node
)
3571 if (TREE_CODE (expr
) == COMPONENT_REF
3572 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3573 expr
= TREE_OPERAND (expr
, 1);
3574 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3575 return error_mark_node
;
3577 if (REFERENCE_REF_P (expr
))
3578 expr
= TREE_OPERAND (expr
, 0);
3579 if (TREE_CODE (expr
) == COMPONENT_REF
)
3581 tree object
= TREE_OPERAND (expr
, 0);
3582 if (!complete_type_or_else (TREE_TYPE (object
), object
))
3583 return error_mark_node
;
3585 return fold_offsetof (expr
);
3588 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3589 function is broken out from the above for the benefit of the tree-ssa
3593 simplify_aggr_init_expr (tree
*tp
)
3595 tree aggr_init_expr
= *tp
;
3597 /* Form an appropriate CALL_EXPR. */
3598 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3599 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3600 tree type
= TREE_TYPE (slot
);
3603 enum style_t
{ ctor
, arg
, pcc
} style
;
3605 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3607 #ifdef PCC_STATIC_STRUCT_RETURN
3613 gcc_assert (TREE_ADDRESSABLE (type
));
3617 call_expr
= build_call_array_loc (input_location
,
3618 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3620 aggr_init_expr_nargs (aggr_init_expr
),
3621 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3622 TREE_NOTHROW (call_expr
) = TREE_NOTHROW (aggr_init_expr
);
3626 /* Replace the first argument to the ctor with the address of the
3628 cxx_mark_addressable (slot
);
3629 CALL_EXPR_ARG (call_expr
, 0) =
3630 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3632 else if (style
== arg
)
3634 /* Just mark it addressable here, and leave the rest to
3635 expand_call{,_inline}. */
3636 cxx_mark_addressable (slot
);
3637 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3638 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3640 else if (style
== pcc
)
3642 /* If we're using the non-reentrant PCC calling convention, then we
3643 need to copy the returned value out of the static buffer into the
3645 push_deferring_access_checks (dk_no_check
);
3646 call_expr
= build_aggr_init (slot
, call_expr
,
3647 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3648 tf_warning_or_error
);
3649 pop_deferring_access_checks ();
3650 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3653 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3655 tree init
= build_zero_init (type
, NULL_TREE
,
3656 /*static_storage_p=*/false);
3657 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3658 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3665 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3668 emit_associated_thunks (tree fn
)
3670 /* When we use vcall offsets, we emit thunks with the virtual
3671 functions to which they thunk. The whole point of vcall offsets
3672 is so that you can know statically the entire set of thunks that
3673 will ever be needed for a given virtual function, thereby
3674 enabling you to output all the thunks with the function itself. */
3675 if (DECL_VIRTUAL_P (fn
)
3676 /* Do not emit thunks for extern template instantiations. */
3677 && ! DECL_REALLY_EXTERN (fn
))
3681 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= DECL_CHAIN (thunk
))
3683 if (!THUNK_ALIAS (thunk
))
3685 use_thunk (thunk
, /*emit_p=*/1);
3686 if (DECL_RESULT_THUNK_P (thunk
))
3690 for (probe
= DECL_THUNKS (thunk
);
3691 probe
; probe
= DECL_CHAIN (probe
))
3692 use_thunk (probe
, /*emit_p=*/1);
3696 gcc_assert (!DECL_THUNKS (thunk
));
3701 /* Returns true iff FUN is an instantiation of a constexpr function
3705 is_instantiation_of_constexpr (tree fun
)
3707 return (DECL_TEMPLOID_INSTANTIATION (fun
)
3708 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3709 (DECL_TI_TEMPLATE (fun
))));
3712 /* Generate RTL for FN. */
3715 expand_or_defer_fn_1 (tree fn
)
3717 /* When the parser calls us after finishing the body of a template
3718 function, we don't really want to expand the body. */
3719 if (processing_template_decl
)
3721 /* Normally, collection only occurs in rest_of_compilation. So,
3722 if we don't collect here, we never collect junk generated
3723 during the processing of templates until we hit a
3724 non-template function. It's not safe to do this inside a
3725 nested class, though, as the parser may have local state that
3726 is not a GC root. */
3727 if (!function_depth
)
3732 gcc_assert (DECL_SAVED_TREE (fn
));
3734 /* If this is a constructor or destructor body, we have to clone
3736 if (maybe_clone_body (fn
))
3738 /* We don't want to process FN again, so pretend we've written
3739 it out, even though we haven't. */
3740 TREE_ASM_WRITTEN (fn
) = 1;
3741 /* If this is an instantiation of a constexpr function, keep
3742 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3743 if (!is_instantiation_of_constexpr (fn
))
3744 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3748 /* We make a decision about linkage for these functions at the end
3749 of the compilation. Until that point, we do not want the back
3750 end to output them -- but we do want it to see the bodies of
3751 these functions so that it can inline them as appropriate. */
3752 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3754 if (DECL_INTERFACE_KNOWN (fn
))
3755 /* We've already made a decision as to how this function will
3759 DECL_EXTERNAL (fn
) = 1;
3760 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3761 note_vague_linkage_fn (fn
);
3762 /* A non-template inline function with external linkage will
3763 always be COMDAT. As we must eventually determine the
3764 linkage of all functions, and as that causes writes to
3765 the data mapped in from the PCH file, it's advantageous
3766 to mark the functions at this point. */
3767 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3769 /* This function must have external linkage, as
3770 otherwise DECL_INTERFACE_KNOWN would have been
3772 gcc_assert (TREE_PUBLIC (fn
));
3773 comdat_linkage (fn
);
3774 DECL_INTERFACE_KNOWN (fn
) = 1;
3778 import_export_decl (fn
);
3780 /* If the user wants us to keep all inline functions, then mark
3781 this function as needed so that finish_file will make sure to
3782 output it later. Similarly, all dllexport'd functions must
3783 be emitted; there may be callers in other DLLs. */
3784 if ((flag_keep_inline_functions
3785 && DECL_DECLARED_INLINE_P (fn
)
3786 && !DECL_REALLY_EXTERN (fn
))
3787 || (flag_keep_inline_dllexport
3788 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
))))
3791 DECL_EXTERNAL (fn
) = 0;
3795 /* There's no reason to do any of the work here if we're only doing
3796 semantic analysis; this code just generates RTL. */
3797 if (flag_syntax_only
)
3804 expand_or_defer_fn (tree fn
)
3806 if (expand_or_defer_fn_1 (fn
))
3810 /* Expand or defer, at the whim of the compilation unit manager. */
3811 cgraph_finalize_function (fn
, function_depth
> 1);
3812 emit_associated_thunks (fn
);
3825 /* Helper function for walk_tree, used by finalize_nrv below. */
3828 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3830 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3833 /* No need to walk into types. There wouldn't be any need to walk into
3834 non-statements, except that we have to consider STMT_EXPRs. */
3837 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3838 but differs from using NULL_TREE in that it indicates that we care
3839 about the value of the RESULT_DECL. */
3840 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3841 TREE_OPERAND (*tp
, 0) = dp
->result
;
3842 /* Change all cleanups for the NRV to only run when an exception is
3844 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3845 && CLEANUP_DECL (*tp
) == dp
->var
)
3846 CLEANUP_EH_ONLY (*tp
) = 1;
3847 /* Replace the DECL_EXPR for the NRV with an initialization of the
3848 RESULT_DECL, if needed. */
3849 else if (TREE_CODE (*tp
) == DECL_EXPR
3850 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3853 if (DECL_INITIAL (dp
->var
)
3854 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3855 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3856 DECL_INITIAL (dp
->var
));
3858 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3859 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3860 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3863 /* And replace all uses of the NRV with the RESULT_DECL. */
3864 else if (*tp
== dp
->var
)
3867 /* Avoid walking into the same tree more than once. Unfortunately, we
3868 can't just use walk_tree_without duplicates because it would only call
3869 us for the first occurrence of dp->var in the function body. */
3870 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3876 /* Keep iterating. */
3880 /* Called from finish_function to implement the named return value
3881 optimization by overriding all the RETURN_EXPRs and pertinent
3882 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3883 RESULT_DECL for the function. */
3886 finalize_nrv (tree
*tp
, tree var
, tree result
)
3888 struct nrv_data data
;
3890 /* Copy name from VAR to RESULT. */
3891 DECL_NAME (result
) = DECL_NAME (var
);
3892 /* Don't forget that we take its address. */
3893 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3894 /* Finally set DECL_VALUE_EXPR to avoid assigning
3895 a stack slot at -O0 for the original var and debug info
3896 uses RESULT location for VAR. */
3897 SET_DECL_VALUE_EXPR (var
, result
);
3898 DECL_HAS_VALUE_EXPR_P (var
) = 1;
3901 data
.result
= result
;
3902 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3903 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3904 htab_delete (data
.visited
);
3907 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3910 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3911 bool need_copy_ctor
, bool need_copy_assignment
)
3913 int save_errorcount
= errorcount
;
3916 /* Always allocate 3 elements for simplicity. These are the
3917 function decls for the ctor, dtor, and assignment op.
3918 This layout is known to the three lang hooks,
3919 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3920 and cxx_omp_clause_assign_op. */
3921 info
= make_tree_vec (3);
3922 CP_OMP_CLAUSE_INFO (c
) = info
;
3924 if (need_default_ctor
|| need_copy_ctor
)
3926 if (need_default_ctor
)
3927 t
= get_default_ctor (type
);
3929 t
= get_copy_ctor (type
, tf_warning_or_error
);
3931 if (t
&& !trivial_fn_p (t
))
3932 TREE_VEC_ELT (info
, 0) = t
;
3935 if ((need_default_ctor
|| need_copy_ctor
)
3936 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3937 TREE_VEC_ELT (info
, 1) = get_dtor (type
, tf_warning_or_error
);
3939 if (need_copy_assignment
)
3941 t
= get_copy_assign (type
);
3943 if (t
&& !trivial_fn_p (t
))
3944 TREE_VEC_ELT (info
, 2) = t
;
3947 return errorcount
!= save_errorcount
;
3950 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3951 Remove any elements from the list that are invalid. */
3954 finish_omp_clauses (tree clauses
)
3956 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3957 tree c
, t
, *pc
= &clauses
;
3960 bitmap_obstack_initialize (NULL
);
3961 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3962 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3963 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3965 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3967 bool remove
= false;
3969 switch (OMP_CLAUSE_CODE (c
))
3971 case OMP_CLAUSE_SHARED
:
3973 goto check_dup_generic
;
3974 case OMP_CLAUSE_PRIVATE
:
3976 goto check_dup_generic
;
3977 case OMP_CLAUSE_REDUCTION
:
3979 goto check_dup_generic
;
3980 case OMP_CLAUSE_COPYPRIVATE
:
3981 name
= "copyprivate";
3982 goto check_dup_generic
;
3983 case OMP_CLAUSE_COPYIN
:
3985 goto check_dup_generic
;
3987 t
= OMP_CLAUSE_DECL (c
);
3988 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3990 if (processing_template_decl
)
3993 error ("%qD is not a variable in clause %qs", t
, name
);
3995 error ("%qE is not a variable in clause %qs", t
, name
);
3998 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3999 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
4000 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4002 error ("%qD appears more than once in data clauses", t
);
4006 bitmap_set_bit (&generic_head
, DECL_UID (t
));
4009 case OMP_CLAUSE_FIRSTPRIVATE
:
4010 t
= OMP_CLAUSE_DECL (c
);
4011 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4013 if (processing_template_decl
)
4016 error ("%qD is not a variable in clause %<firstprivate%>", t
);
4018 error ("%qE is not a variable in clause %<firstprivate%>", t
);
4021 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4022 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4024 error ("%qD appears more than once in data clauses", t
);
4028 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
4031 case OMP_CLAUSE_LASTPRIVATE
:
4032 t
= OMP_CLAUSE_DECL (c
);
4033 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4035 if (processing_template_decl
)
4038 error ("%qD is not a variable in clause %<lastprivate%>", t
);
4040 error ("%qE is not a variable in clause %<lastprivate%>", t
);
4043 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
4044 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
4046 error ("%qD appears more than once in data clauses", t
);
4050 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
4054 t
= OMP_CLAUSE_IF_EXPR (c
);
4055 t
= maybe_convert_cond (t
);
4056 if (t
== error_mark_node
)
4058 else if (!processing_template_decl
)
4059 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4060 OMP_CLAUSE_IF_EXPR (c
) = t
;
4063 case OMP_CLAUSE_FINAL
:
4064 t
= OMP_CLAUSE_FINAL_EXPR (c
);
4065 t
= maybe_convert_cond (t
);
4066 if (t
== error_mark_node
)
4068 else if (!processing_template_decl
)
4069 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4070 OMP_CLAUSE_FINAL_EXPR (c
) = t
;
4073 case OMP_CLAUSE_NUM_THREADS
:
4074 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
4075 if (t
== error_mark_node
)
4077 else if (!type_dependent_expression_p (t
)
4078 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4080 error ("num_threads expression must be integral");
4085 t
= mark_rvalue_use (t
);
4086 if (!processing_template_decl
)
4087 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4088 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
4092 case OMP_CLAUSE_SCHEDULE
:
4093 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
4096 else if (t
== error_mark_node
)
4098 else if (!type_dependent_expression_p (t
)
4099 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
4101 error ("schedule chunk size expression must be integral");
4106 t
= mark_rvalue_use (t
);
4107 if (!processing_template_decl
)
4108 t
= fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4109 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
4113 case OMP_CLAUSE_NOWAIT
:
4114 case OMP_CLAUSE_ORDERED
:
4115 case OMP_CLAUSE_DEFAULT
:
4116 case OMP_CLAUSE_UNTIED
:
4117 case OMP_CLAUSE_COLLAPSE
:
4118 case OMP_CLAUSE_MERGEABLE
:
4126 *pc
= OMP_CLAUSE_CHAIN (c
);
4128 pc
= &OMP_CLAUSE_CHAIN (c
);
4131 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
4133 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
4134 bool remove
= false;
4135 bool need_complete_non_reference
= false;
4136 bool need_default_ctor
= false;
4137 bool need_copy_ctor
= false;
4138 bool need_copy_assignment
= false;
4139 bool need_implicitly_determined
= false;
4140 tree type
, inner_type
;
4144 case OMP_CLAUSE_SHARED
:
4146 need_implicitly_determined
= true;
4148 case OMP_CLAUSE_PRIVATE
:
4150 need_complete_non_reference
= true;
4151 need_default_ctor
= true;
4152 need_implicitly_determined
= true;
4154 case OMP_CLAUSE_FIRSTPRIVATE
:
4155 name
= "firstprivate";
4156 need_complete_non_reference
= true;
4157 need_copy_ctor
= true;
4158 need_implicitly_determined
= true;
4160 case OMP_CLAUSE_LASTPRIVATE
:
4161 name
= "lastprivate";
4162 need_complete_non_reference
= true;
4163 need_copy_assignment
= true;
4164 need_implicitly_determined
= true;
4166 case OMP_CLAUSE_REDUCTION
:
4168 need_implicitly_determined
= true;
4170 case OMP_CLAUSE_COPYPRIVATE
:
4171 name
= "copyprivate";
4172 need_copy_assignment
= true;
4174 case OMP_CLAUSE_COPYIN
:
4176 need_copy_assignment
= true;
4179 pc
= &OMP_CLAUSE_CHAIN (c
);
4183 t
= OMP_CLAUSE_DECL (c
);
4184 if (processing_template_decl
4185 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
4187 pc
= &OMP_CLAUSE_CHAIN (c
);
4193 case OMP_CLAUSE_LASTPRIVATE
:
4194 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
4195 need_default_ctor
= true;
4198 case OMP_CLAUSE_REDUCTION
:
4199 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
4200 || POINTER_TYPE_P (TREE_TYPE (t
)))
4202 error ("%qE has invalid type for %<reduction%>", t
);
4205 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
4207 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
4217 error ("%qE has invalid type for %<reduction(%s)%>",
4218 t
, operator_name_info
[r_code
].name
);
4224 case OMP_CLAUSE_COPYIN
:
4225 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
4227 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
4236 if (need_complete_non_reference
|| need_copy_assignment
)
4238 t
= require_complete_type (t
);
4239 if (t
== error_mark_node
)
4241 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
4242 && need_complete_non_reference
)
4244 error ("%qE has reference type for %qs", t
, name
);
4248 if (need_implicitly_determined
)
4250 const char *share_name
= NULL
;
4252 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
4253 share_name
= "threadprivate";
4254 else switch (cxx_omp_predetermined_sharing (t
))
4256 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
4258 case OMP_CLAUSE_DEFAULT_SHARED
:
4259 /* const vars may be specified in firstprivate clause. */
4260 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
4261 && cxx_omp_const_qual_no_mutable (t
))
4263 share_name
= "shared";
4265 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4266 share_name
= "private";
4273 error ("%qE is predetermined %qs for %qs",
4274 t
, share_name
, name
);
4279 /* We're interested in the base element, not arrays. */
4280 inner_type
= type
= TREE_TYPE (t
);
4281 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
4282 inner_type
= TREE_TYPE (inner_type
);
4284 /* Check for special function availability by building a call to one.
4285 Save the results, because later we won't be in the right context
4286 for making these queries. */
4287 if (CLASS_TYPE_P (inner_type
)
4288 && COMPLETE_TYPE_P (inner_type
)
4289 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
4290 && !type_dependent_expression_p (t
)
4291 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
4292 need_copy_ctor
, need_copy_assignment
))
4296 *pc
= OMP_CLAUSE_CHAIN (c
);
4298 pc
= &OMP_CLAUSE_CHAIN (c
);
4301 bitmap_obstack_release (NULL
);
4305 /* For all variables in the tree_list VARS, mark them as thread local. */
4308 finish_omp_threadprivate (tree vars
)
4312 /* Mark every variable in VARS to be assigned thread local storage. */
4313 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4315 tree v
= TREE_PURPOSE (t
);
4317 if (error_operand_p (v
))
4319 else if (TREE_CODE (v
) != VAR_DECL
)
4320 error ("%<threadprivate%> %qD is not file, namespace "
4321 "or block scope variable", v
);
4322 /* If V had already been marked threadprivate, it doesn't matter
4323 whether it had been used prior to this point. */
4324 else if (TREE_USED (v
)
4325 && (DECL_LANG_SPECIFIC (v
) == NULL
4326 || !CP_DECL_THREADPRIVATE_P (v
)))
4327 error ("%qE declared %<threadprivate%> after first use", v
);
4328 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4329 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4330 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4331 error ("%<threadprivate%> %qE has incomplete type", v
);
4332 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4333 && CP_DECL_CONTEXT (v
) != current_class_type
)
4334 error ("%<threadprivate%> %qE directive not "
4335 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4338 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4339 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4341 retrofit_lang_decl (v
);
4343 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4344 after the allocation of the lang_decl structure. */
4345 if (DECL_DISCRIMINATOR_P (v
))
4346 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4349 if (! DECL_THREAD_LOCAL_P (v
))
4351 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4352 /* If rtl has been already set for this var, call
4353 make_decl_rtl once again, so that encode_section_info
4354 has a chance to look at the new decl flags. */
4355 if (DECL_RTL_SET_P (v
))
4358 CP_DECL_THREADPRIVATE_P (v
) = 1;
4363 /* Build an OpenMP structured block. */
4366 begin_omp_structured_block (void)
4368 return do_pushlevel (sk_omp
);
4372 finish_omp_structured_block (tree block
)
4374 return do_poplevel (block
);
4377 /* Similarly, except force the retention of the BLOCK. */
4380 begin_omp_parallel (void)
4382 keep_next_level (true);
4383 return begin_omp_structured_block ();
4387 finish_omp_parallel (tree clauses
, tree body
)
4391 body
= finish_omp_structured_block (body
);
4393 stmt
= make_node (OMP_PARALLEL
);
4394 TREE_TYPE (stmt
) = void_type_node
;
4395 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4396 OMP_PARALLEL_BODY (stmt
) = body
;
4398 return add_stmt (stmt
);
4402 begin_omp_task (void)
4404 keep_next_level (true);
4405 return begin_omp_structured_block ();
4409 finish_omp_task (tree clauses
, tree body
)
4413 body
= finish_omp_structured_block (body
);
4415 stmt
= make_node (OMP_TASK
);
4416 TREE_TYPE (stmt
) = void_type_node
;
4417 OMP_TASK_CLAUSES (stmt
) = clauses
;
4418 OMP_TASK_BODY (stmt
) = body
;
4420 return add_stmt (stmt
);
4423 /* Helper function for finish_omp_for. Convert Ith random access iterator
4424 into integral iterator. Return FALSE if successful. */
4427 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4428 tree condv
, tree incrv
, tree
*body
,
4429 tree
*pre_body
, tree clauses
)
4431 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4432 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4433 tree decl
= TREE_VEC_ELT (declv
, i
);
4434 tree init
= TREE_VEC_ELT (initv
, i
);
4435 tree cond
= TREE_VEC_ELT (condv
, i
);
4436 tree incr
= TREE_VEC_ELT (incrv
, i
);
4438 location_t elocus
= locus
;
4440 if (init
&& EXPR_HAS_LOCATION (init
))
4441 elocus
= EXPR_LOCATION (init
);
4443 switch (TREE_CODE (cond
))
4449 if (TREE_OPERAND (cond
, 1) == iter
)
4450 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4451 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4452 if (TREE_OPERAND (cond
, 0) != iter
)
4453 cond
= error_mark_node
;
4456 tree tem
= build_x_binary_op (EXPR_LOCATION (cond
),
4459 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4460 NULL
, tf_warning_or_error
);
4461 if (error_operand_p (tem
))
4466 cond
= error_mark_node
;
4469 if (cond
== error_mark_node
)
4471 error_at (elocus
, "invalid controlling predicate");
4474 diff
= build_x_binary_op (elocus
, MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4475 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4476 tf_warning_or_error
);
4477 if (error_operand_p (diff
))
4479 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4481 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4482 TREE_OPERAND (cond
, 1), iter
);
4486 switch (TREE_CODE (incr
))
4488 case PREINCREMENT_EXPR
:
4489 case PREDECREMENT_EXPR
:
4490 case POSTINCREMENT_EXPR
:
4491 case POSTDECREMENT_EXPR
:
4492 if (TREE_OPERAND (incr
, 0) != iter
)
4494 incr
= error_mark_node
;
4497 iter_incr
= build_x_unary_op (EXPR_LOCATION (incr
),
4498 TREE_CODE (incr
), iter
,
4499 tf_warning_or_error
);
4500 if (error_operand_p (iter_incr
))
4502 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4503 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4504 incr
= integer_one_node
;
4506 incr
= integer_minus_one_node
;
4509 if (TREE_OPERAND (incr
, 0) != iter
)
4510 incr
= error_mark_node
;
4511 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4512 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4514 tree rhs
= TREE_OPERAND (incr
, 1);
4515 if (TREE_OPERAND (rhs
, 0) == iter
)
4517 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4519 incr
= error_mark_node
;
4522 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
4523 iter
, TREE_CODE (rhs
),
4524 TREE_OPERAND (rhs
, 1),
4525 tf_warning_or_error
);
4526 if (error_operand_p (iter_incr
))
4528 incr
= TREE_OPERAND (rhs
, 1);
4529 incr
= cp_convert (TREE_TYPE (diff
), incr
,
4530 tf_warning_or_error
);
4531 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4533 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4534 incr
= fold_if_not_in_template (incr
);
4536 if (TREE_CODE (incr
) != INTEGER_CST
4537 && (TREE_CODE (incr
) != NOP_EXPR
4538 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4543 else if (TREE_OPERAND (rhs
, 1) == iter
)
4545 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4546 || TREE_CODE (rhs
) != PLUS_EXPR
)
4547 incr
= error_mark_node
;
4550 iter_incr
= build_x_binary_op (EXPR_LOCATION (rhs
),
4552 TREE_OPERAND (rhs
, 0),
4555 tf_warning_or_error
);
4556 if (error_operand_p (iter_incr
))
4558 iter_incr
= build_x_modify_expr (EXPR_LOCATION (rhs
),
4561 tf_warning_or_error
);
4562 if (error_operand_p (iter_incr
))
4564 incr
= TREE_OPERAND (rhs
, 0);
4569 incr
= error_mark_node
;
4572 incr
= error_mark_node
;
4575 incr
= error_mark_node
;
4579 if (incr
== error_mark_node
)
4581 error_at (elocus
, "invalid increment expression");
4585 incr
= cp_convert (TREE_TYPE (diff
), incr
, tf_warning_or_error
);
4586 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4587 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4588 && OMP_CLAUSE_DECL (c
) == iter
)
4591 decl
= create_temporary_var (TREE_TYPE (diff
));
4593 add_decl_expr (decl
);
4594 last
= create_temporary_var (TREE_TYPE (diff
));
4596 add_decl_expr (last
);
4597 if (c
&& iter_incr
== NULL
)
4599 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4600 pushdecl (incr_var
);
4601 add_decl_expr (incr_var
);
4603 gcc_assert (stmts_are_full_exprs_p ());
4605 orig_pre_body
= *pre_body
;
4606 *pre_body
= push_stmt_list ();
4608 add_stmt (orig_pre_body
);
4610 finish_expr_stmt (build_x_modify_expr (elocus
,
4611 iter
, NOP_EXPR
, init
,
4612 tf_warning_or_error
));
4613 init
= build_int_cst (TREE_TYPE (diff
), 0);
4614 if (c
&& iter_incr
== NULL
)
4616 finish_expr_stmt (build_x_modify_expr (elocus
,
4618 incr
, tf_warning_or_error
));
4620 iter_incr
= build_x_modify_expr (elocus
,
4621 iter
, PLUS_EXPR
, incr
,
4622 tf_warning_or_error
);
4624 finish_expr_stmt (build_x_modify_expr (elocus
,
4625 last
, NOP_EXPR
, init
,
4626 tf_warning_or_error
));
4627 *pre_body
= pop_stmt_list (*pre_body
);
4629 cond
= cp_build_binary_op (elocus
,
4630 TREE_CODE (cond
), decl
, diff
,
4631 tf_warning_or_error
);
4632 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4633 elocus
, incr
, NULL_TREE
);
4636 *body
= push_stmt_list ();
4637 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4638 iter_init
= build_x_modify_expr (elocus
,
4639 iter
, PLUS_EXPR
, iter_init
,
4640 tf_warning_or_error
);
4641 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4642 finish_expr_stmt (iter_init
);
4643 finish_expr_stmt (build_x_modify_expr (elocus
,
4644 last
, NOP_EXPR
, decl
,
4645 tf_warning_or_error
));
4646 add_stmt (orig_body
);
4647 *body
= pop_stmt_list (*body
);
4651 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4652 finish_expr_stmt (iter_incr
);
4653 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4654 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4657 TREE_VEC_ELT (declv
, i
) = decl
;
4658 TREE_VEC_ELT (initv
, i
) = init
;
4659 TREE_VEC_ELT (condv
, i
) = cond
;
4660 TREE_VEC_ELT (incrv
, i
) = incr
;
4665 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4666 are directly for their associated operands in the statement. DECL
4667 and INIT are a combo; if DECL is NULL then INIT ought to be a
4668 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4669 optional statements that need to go before the loop into its
4673 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4674 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4676 tree omp_for
= NULL
, orig_incr
= NULL
;
4677 tree decl
, init
, cond
, incr
;
4681 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4682 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4683 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4684 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4686 decl
= TREE_VEC_ELT (declv
, i
);
4687 init
= TREE_VEC_ELT (initv
, i
);
4688 cond
= TREE_VEC_ELT (condv
, i
);
4689 incr
= TREE_VEC_ELT (incrv
, i
);
4695 switch (TREE_CODE (init
))
4698 decl
= TREE_OPERAND (init
, 0);
4699 init
= TREE_OPERAND (init
, 1);
4702 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4704 decl
= TREE_OPERAND (init
, 0);
4705 init
= TREE_OPERAND (init
, 2);
4715 "expected iteration declaration or initialization");
4720 if (init
&& EXPR_HAS_LOCATION (init
))
4721 elocus
= EXPR_LOCATION (init
);
4725 error_at (elocus
, "missing controlling predicate");
4731 error_at (elocus
, "missing increment expression");
4735 TREE_VEC_ELT (declv
, i
) = decl
;
4736 TREE_VEC_ELT (initv
, i
) = init
;
4739 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4743 stmt
= make_node (OMP_FOR
);
4745 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4747 /* This is really just a place-holder. We'll be decomposing this
4748 again and going through the cp_build_modify_expr path below when
4749 we instantiate the thing. */
4750 TREE_VEC_ELT (initv
, i
)
4751 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4752 TREE_VEC_ELT (initv
, i
));
4755 TREE_TYPE (stmt
) = void_type_node
;
4756 OMP_FOR_INIT (stmt
) = initv
;
4757 OMP_FOR_COND (stmt
) = condv
;
4758 OMP_FOR_INCR (stmt
) = incrv
;
4759 OMP_FOR_BODY (stmt
) = body
;
4760 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4761 OMP_FOR_CLAUSES (stmt
) = clauses
;
4763 SET_EXPR_LOCATION (stmt
, locus
);
4764 return add_stmt (stmt
);
4767 if (processing_template_decl
)
4768 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4770 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4772 decl
= TREE_VEC_ELT (declv
, i
);
4773 init
= TREE_VEC_ELT (initv
, i
);
4774 cond
= TREE_VEC_ELT (condv
, i
);
4775 incr
= TREE_VEC_ELT (incrv
, i
);
4777 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4780 if (init
&& EXPR_HAS_LOCATION (init
))
4781 elocus
= EXPR_LOCATION (init
);
4785 error_at (elocus
, "expected iteration declaration or initialization");
4789 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4792 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4793 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4794 TREE_CODE (TREE_OPERAND (incr
, 1)),
4795 TREE_OPERAND (incr
, 2),
4796 tf_warning_or_error
);
4799 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4801 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4802 incrv
, &body
, &pre_body
, clauses
))
4807 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4808 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4810 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4814 if (!processing_template_decl
)
4816 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4817 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4820 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4822 && TREE_SIDE_EFFECTS (cond
)
4823 && COMPARISON_CLASS_P (cond
)
4824 && !processing_template_decl
)
4826 tree t
= TREE_OPERAND (cond
, 0);
4827 if (TREE_SIDE_EFFECTS (t
)
4829 && (TREE_CODE (t
) != NOP_EXPR
4830 || TREE_OPERAND (t
, 0) != decl
))
4831 TREE_OPERAND (cond
, 0)
4832 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4834 t
= TREE_OPERAND (cond
, 1);
4835 if (TREE_SIDE_EFFECTS (t
)
4837 && (TREE_CODE (t
) != NOP_EXPR
4838 || TREE_OPERAND (t
, 0) != decl
))
4839 TREE_OPERAND (cond
, 1)
4840 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4842 if (decl
== error_mark_node
|| init
== error_mark_node
)
4845 TREE_VEC_ELT (declv
, i
) = decl
;
4846 TREE_VEC_ELT (initv
, i
) = init
;
4847 TREE_VEC_ELT (condv
, i
) = cond
;
4848 TREE_VEC_ELT (incrv
, i
) = incr
;
4852 if (IS_EMPTY_STMT (pre_body
))
4855 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4858 if (omp_for
== NULL
)
4861 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4863 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4864 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4866 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4869 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4870 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4871 && !processing_template_decl
)
4873 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4874 if (TREE_SIDE_EFFECTS (t
)
4876 && (TREE_CODE (t
) != NOP_EXPR
4877 || TREE_OPERAND (t
, 0) != decl
))
4878 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4879 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4881 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4882 if (TREE_SIDE_EFFECTS (t
)
4884 && (TREE_CODE (t
) != NOP_EXPR
4885 || TREE_OPERAND (t
, 0) != decl
))
4886 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4887 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4891 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4893 if (omp_for
!= NULL
)
4894 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4899 finish_omp_atomic (enum tree_code code
, enum tree_code opcode
, tree lhs
,
4900 tree rhs
, tree v
, tree lhs1
, tree rhs1
)
4915 dependent_p
= false;
4918 /* Even in a template, we can detect invalid uses of the atomic
4919 pragma if neither LHS nor RHS is type-dependent. */
4920 if (processing_template_decl
)
4922 dependent_p
= (type_dependent_expression_p (lhs
)
4923 || (rhs
&& type_dependent_expression_p (rhs
))
4924 || (v
&& type_dependent_expression_p (v
))
4925 || (lhs1
&& type_dependent_expression_p (lhs1
))
4926 || (rhs1
&& type_dependent_expression_p (rhs1
)));
4929 lhs
= build_non_dependent_expr (lhs
);
4931 rhs
= build_non_dependent_expr (rhs
);
4933 v
= build_non_dependent_expr (v
);
4935 lhs1
= build_non_dependent_expr (lhs1
);
4937 rhs1
= build_non_dependent_expr (rhs1
);
4942 stmt
= c_finish_omp_atomic (input_location
, code
, opcode
, lhs
, rhs
,
4944 if (stmt
== error_mark_node
)
4947 if (processing_template_decl
)
4949 if (code
== OMP_ATOMIC_READ
)
4951 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs
),
4952 OMP_ATOMIC_READ
, orig_lhs
);
4953 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
4957 if (opcode
== NOP_EXPR
)
4958 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_lhs
, orig_rhs
);
4960 stmt
= build2 (opcode
, void_type_node
, orig_lhs
, orig_rhs
);
4962 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_rhs1
),
4963 COMPOUND_EXPR
, orig_rhs1
, stmt
);
4964 if (code
!= OMP_ATOMIC
)
4966 stmt
= build_min_nt_loc (EXPR_LOCATION (orig_lhs1
),
4967 code
, orig_lhs1
, stmt
);
4968 stmt
= build2 (MODIFY_EXPR
, void_type_node
, orig_v
, stmt
);
4971 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
, stmt
);
4977 finish_omp_barrier (void)
4979 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_BARRIER
);
4980 VEC(tree
,gc
) *vec
= make_tree_vector ();
4981 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4982 release_tree_vector (vec
);
4983 finish_expr_stmt (stmt
);
4987 finish_omp_flush (void)
4989 tree fn
= builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE
);
4990 VEC(tree
,gc
) *vec
= make_tree_vector ();
4991 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4992 release_tree_vector (vec
);
4993 finish_expr_stmt (stmt
);
4997 finish_omp_taskwait (void)
4999 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT
);
5000 VEC(tree
,gc
) *vec
= make_tree_vector ();
5001 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5002 release_tree_vector (vec
);
5003 finish_expr_stmt (stmt
);
5007 finish_omp_taskyield (void)
5009 tree fn
= builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD
);
5010 VEC(tree
,gc
) *vec
= make_tree_vector ();
5011 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
5012 release_tree_vector (vec
);
5013 finish_expr_stmt (stmt
);
5016 /* Begin a __transaction_atomic or __transaction_relaxed statement.
5017 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
5018 should create an extra compound stmt. */
5021 begin_transaction_stmt (location_t loc
, tree
*pcompound
, int flags
)
5026 *pcompound
= begin_compound_stmt (0);
5028 r
= build_stmt (loc
, TRANSACTION_EXPR
, NULL_TREE
);
5030 /* Only add the statement to the function if support enabled. */
5034 error_at (loc
, ((flags
& TM_STMT_ATTR_RELAXED
) != 0
5035 ? G_("%<__transaction_relaxed%> without "
5036 "transactional memory support enabled")
5037 : G_("%<__transaction_atomic%> without "
5038 "transactional memory support enabled")));
5040 TRANSACTION_EXPR_BODY (r
) = push_stmt_list ();
5044 /* End a __transaction_atomic or __transaction_relaxed statement.
5045 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
5046 and we should end the compound. If NOEX is non-NULL, we wrap the body in
5047 a MUST_NOT_THROW_EXPR with NOEX as condition. */
5050 finish_transaction_stmt (tree stmt
, tree compound_stmt
, int flags
, tree noex
)
5052 TRANSACTION_EXPR_BODY (stmt
) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt
));
5053 TRANSACTION_EXPR_OUTER (stmt
) = (flags
& TM_STMT_ATTR_OUTER
) != 0;
5054 TRANSACTION_EXPR_RELAXED (stmt
) = (flags
& TM_STMT_ATTR_RELAXED
) != 0;
5055 TRANSACTION_EXPR_IS_STMT (stmt
) = 1;
5057 /* noexcept specifications are not allowed for function transactions. */
5058 gcc_assert (!(noex
&& compound_stmt
));
5061 tree body
= build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt
),
5063 SET_EXPR_LOCATION (body
, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt
)));
5064 TREE_SIDE_EFFECTS (body
) = 1;
5065 TRANSACTION_EXPR_BODY (stmt
) = body
;
5069 finish_compound_stmt (compound_stmt
);
5073 /* Build a __transaction_atomic or __transaction_relaxed expression. If
5074 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
5078 build_transaction_expr (location_t loc
, tree expr
, int flags
, tree noex
)
5083 expr
= build_must_not_throw_expr (expr
, noex
);
5084 SET_EXPR_LOCATION (expr
, loc
);
5085 TREE_SIDE_EFFECTS (expr
) = 1;
5087 ret
= build1 (TRANSACTION_EXPR
, TREE_TYPE (expr
), expr
);
5088 if (flags
& TM_STMT_ATTR_RELAXED
)
5089 TRANSACTION_EXPR_RELAXED (ret
) = 1;
5090 SET_EXPR_LOCATION (ret
, loc
);
5095 init_cp_semantics (void)
5099 /* Build a STATIC_ASSERT for a static assertion with the condition
5100 CONDITION and the message text MESSAGE. LOCATION is the location
5101 of the static assertion in the source code. When MEMBER_P, this
5102 static assertion is a member of a class. */
5104 finish_static_assert (tree condition
, tree message
, location_t location
,
5107 if (message
== NULL_TREE
5108 || message
== error_mark_node
5109 || condition
== NULL_TREE
5110 || condition
== error_mark_node
)
5113 if (check_for_bare_parameter_packs (condition
))
5114 condition
= error_mark_node
;
5116 if (type_dependent_expression_p (condition
)
5117 || value_dependent_expression_p (condition
))
5119 /* We're in a template; build a STATIC_ASSERT and put it in
5123 assertion
= make_node (STATIC_ASSERT
);
5124 STATIC_ASSERT_CONDITION (assertion
) = condition
;
5125 STATIC_ASSERT_MESSAGE (assertion
) = message
;
5126 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
5129 maybe_add_class_template_decl_list (current_class_type
,
5133 add_stmt (assertion
);
5138 /* Fold the expression and convert it to a boolean value. */
5139 condition
= fold_non_dependent_expr (condition
);
5140 condition
= cp_convert (boolean_type_node
, condition
, tf_warning_or_error
);
5141 condition
= maybe_constant_value (condition
);
5143 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
5144 /* Do nothing; the condition is satisfied. */
5148 location_t saved_loc
= input_location
;
5150 input_location
= location
;
5151 if (TREE_CODE (condition
) == INTEGER_CST
5152 && integer_zerop (condition
))
5153 /* Report the error. */
5154 error ("static assertion failed: %s", TREE_STRING_POINTER (message
));
5155 else if (condition
&& condition
!= error_mark_node
)
5157 error ("non-constant condition for static assertion");
5158 cxx_constant_value (condition
);
5160 input_location
= saved_loc
;
5164 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5165 suitable for use as a type-specifier.
5167 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5168 id-expression or a class member access, FALSE when it was parsed as
5169 a full expression. */
5172 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
,
5173 tsubst_flags_t complain
)
5175 tree type
= NULL_TREE
;
5177 if (!expr
|| error_operand_p (expr
))
5178 return error_mark_node
;
5181 || TREE_CODE (expr
) == TYPE_DECL
5182 || (TREE_CODE (expr
) == BIT_NOT_EXPR
5183 && TYPE_P (TREE_OPERAND (expr
, 0))))
5185 if (complain
& tf_error
)
5186 error ("argument to decltype must be an expression");
5187 return error_mark_node
;
5190 /* FIXME instantiation-dependent */
5191 if (type_dependent_expression_p (expr
)
5192 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
5193 if it isn't dependent, so that we can check access control at
5194 instantiation time, so defer the decltype as well (PR 42277). */
5195 || (id_expression_or_member_access_p
5196 && processing_template_decl
5197 && TREE_CODE (expr
) == COMPONENT_REF
))
5199 type
= cxx_make_type (DECLTYPE_TYPE
);
5200 DECLTYPE_TYPE_EXPR (type
) = expr
;
5201 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
5202 = id_expression_or_member_access_p
;
5203 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5208 /* The type denoted by decltype(e) is defined as follows: */
5210 expr
= resolve_nondeduced_context (expr
);
5212 if (type_unknown_p (expr
))
5214 if (complain
& tf_error
)
5215 error ("decltype cannot resolve address of overloaded function");
5216 return error_mark_node
;
5219 if (invalid_nonstatic_memfn_p (expr
, complain
))
5220 return error_mark_node
;
5222 /* To get the size of a static data member declared as an array of
5223 unknown bound, we need to instantiate it. */
5224 if (TREE_CODE (expr
) == VAR_DECL
5225 && VAR_HAD_UNKNOWN_BOUND (expr
)
5226 && DECL_TEMPLATE_INSTANTIATION (expr
))
5227 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
5229 if (id_expression_or_member_access_p
)
5231 /* If e is an id-expression or a class member access (5.2.5
5232 [expr.ref]), decltype(e) is defined as the type of the entity
5233 named by e. If there is no such entity, or e names a set of
5234 overloaded functions, the program is ill-formed. */
5235 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
5236 expr
= lookup_name (expr
);
5238 if (TREE_CODE (expr
) == INDIRECT_REF
)
5239 /* This can happen when the expression is, e.g., "a.b". Just
5240 look at the underlying operand. */
5241 expr
= TREE_OPERAND (expr
, 0);
5243 if (TREE_CODE (expr
) == OFFSET_REF
5244 || TREE_CODE (expr
) == MEMBER_REF
)
5245 /* We're only interested in the field itself. If it is a
5246 BASELINK, we will need to see through it in the next
5248 expr
= TREE_OPERAND (expr
, 1);
5250 if (BASELINK_P (expr
))
5251 /* See through BASELINK nodes to the underlying function. */
5252 expr
= BASELINK_FUNCTIONS (expr
);
5254 switch (TREE_CODE (expr
))
5257 if (DECL_BIT_FIELD_TYPE (expr
))
5259 type
= DECL_BIT_FIELD_TYPE (expr
);
5262 /* Fall through for fields that aren't bitfields. */
5269 case TEMPLATE_PARM_INDEX
:
5270 expr
= mark_type_use (expr
);
5271 type
= TREE_TYPE (expr
);
5275 type
= error_mark_node
;
5279 mark_type_use (expr
);
5280 type
= is_bitfield_expr_with_lowered_type (expr
);
5282 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
5290 /* We can get here when the id-expression refers to an
5291 enumerator or non-type template parameter. */
5292 type
= TREE_TYPE (expr
);
5297 return error_mark_node
;
5302 /* Within a lambda-expression:
5304 Every occurrence of decltype((x)) where x is a possibly
5305 parenthesized id-expression that names an entity of
5306 automatic storage duration is treated as if x were
5307 transformed into an access to a corresponding data member
5308 of the closure type that would have been declared if x
5309 were a use of the denoted entity. */
5310 if (outer_automatic_var_p (expr
)
5311 && current_function_decl
5312 && LAMBDA_FUNCTION_P (current_function_decl
))
5313 type
= capture_decltype (expr
);
5314 else if (error_operand_p (expr
))
5315 type
= error_mark_node
;
5316 else if (expr
== current_class_ptr
)
5317 /* If the expression is just "this", we want the
5318 cv-unqualified pointer for the "this" type. */
5319 type
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
5322 /* Otherwise, where T is the type of e, if e is an lvalue,
5323 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5324 cp_lvalue_kind clk
= lvalue_kind (expr
);
5325 type
= unlowered_expr_type (expr
);
5326 gcc_assert (TREE_CODE (type
) != REFERENCE_TYPE
);
5327 if (clk
!= clk_none
&& !(clk
& clk_class
))
5328 type
= cp_build_reference_type (type
, (clk
& clk_rvalueref
));
5335 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5336 __has_nothrow_copy, depending on assign_p. */
5339 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5346 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5349 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5351 else if (TYPE_HAS_COPY_CTOR (type
))
5353 /* If construction of the copy constructor was postponed, create
5355 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5356 lazily_declare_fn (sfk_copy_constructor
, type
);
5357 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5358 lazily_declare_fn (sfk_move_constructor
, type
);
5359 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5364 for (; fns
; fns
= OVL_NEXT (fns
))
5366 tree fn
= OVL_CURRENT (fns
);
5370 if (copy_fn_p (fn
) == 0)
5373 else if (copy_fn_p (fn
) <= 0)
5376 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5383 /* Actually evaluates the trait. */
5386 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5388 enum tree_code type_code1
;
5391 type_code1
= TREE_CODE (type1
);
5395 case CPTK_HAS_NOTHROW_ASSIGN
:
5396 type1
= strip_array_types (type1
);
5397 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5398 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5399 || (CLASS_TYPE_P (type1
)
5400 && classtype_has_nothrow_assign_or_copy_p (type1
,
5403 case CPTK_HAS_TRIVIAL_ASSIGN
:
5404 /* ??? The standard seems to be missing the "or array of such a class
5405 type" wording for this trait. */
5406 type1
= strip_array_types (type1
);
5407 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5408 && (trivial_type_p (type1
)
5409 || (CLASS_TYPE_P (type1
)
5410 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1
))));
5412 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5413 type1
= strip_array_types (type1
);
5414 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5415 || (CLASS_TYPE_P (type1
)
5416 && (t
= locate_ctor (type1
))
5417 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5419 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5420 type1
= strip_array_types (type1
);
5421 return (trivial_type_p (type1
)
5422 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5424 case CPTK_HAS_NOTHROW_COPY
:
5425 type1
= strip_array_types (type1
);
5426 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5427 || (CLASS_TYPE_P (type1
)
5428 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5430 case CPTK_HAS_TRIVIAL_COPY
:
5431 /* ??? The standard seems to be missing the "or array of such a class
5432 type" wording for this trait. */
5433 type1
= strip_array_types (type1
);
5434 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5435 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1
)));
5437 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5438 type1
= strip_array_types (type1
);
5439 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5440 || (CLASS_TYPE_P (type1
)
5441 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5443 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5444 return type_has_virtual_destructor (type1
);
5446 case CPTK_IS_ABSTRACT
:
5447 return (ABSTRACT_CLASS_TYPE_P (type1
));
5449 case CPTK_IS_BASE_OF
:
5450 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5451 && DERIVED_FROM_P (type1
, type2
));
5454 return (NON_UNION_CLASS_TYPE_P (type1
));
5456 case CPTK_IS_CONVERTIBLE_TO
:
5461 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5464 return (type_code1
== ENUMERAL_TYPE
);
5467 return (CLASS_TYPE_P (type1
) && CLASSTYPE_FINAL (type1
));
5469 case CPTK_IS_LITERAL_TYPE
:
5470 return (literal_type_p (type1
));
5473 return (pod_type_p (type1
));
5475 case CPTK_IS_POLYMORPHIC
:
5476 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5478 case CPTK_IS_STD_LAYOUT
:
5479 return (std_layout_type_p (type1
));
5481 case CPTK_IS_TRIVIAL
:
5482 return (trivial_type_p (type1
));
5485 return (type_code1
== UNION_TYPE
);
5493 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5494 void, or a complete type, returns it, otherwise NULL_TREE. */
5497 check_trait_type (tree type
)
5499 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
5500 && COMPLETE_TYPE_P (TREE_TYPE (type
)))
5503 if (VOID_TYPE_P (type
))
5506 return complete_type_or_else (strip_array_types (type
), NULL_TREE
);
5509 /* Process a trait expression. */
5512 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5514 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5515 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5516 || kind
== CPTK_HAS_NOTHROW_COPY
5517 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5518 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5519 || kind
== CPTK_HAS_TRIVIAL_COPY
5520 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5521 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5522 || kind
== CPTK_IS_ABSTRACT
5523 || kind
== CPTK_IS_BASE_OF
5524 || kind
== CPTK_IS_CLASS
5525 || kind
== CPTK_IS_CONVERTIBLE_TO
5526 || kind
== CPTK_IS_EMPTY
5527 || kind
== CPTK_IS_ENUM
5528 || kind
== CPTK_IS_FINAL
5529 || kind
== CPTK_IS_LITERAL_TYPE
5530 || kind
== CPTK_IS_POD
5531 || kind
== CPTK_IS_POLYMORPHIC
5532 || kind
== CPTK_IS_STD_LAYOUT
5533 || kind
== CPTK_IS_TRIVIAL
5534 || kind
== CPTK_IS_UNION
);
5536 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5538 sorry ("__is_convertible_to");
5539 return error_mark_node
;
5542 if (type1
== error_mark_node
5543 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5544 && type2
== error_mark_node
))
5545 return error_mark_node
;
5547 if (processing_template_decl
)
5549 tree trait_expr
= make_node (TRAIT_EXPR
);
5550 TREE_TYPE (trait_expr
) = boolean_type_node
;
5551 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5552 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5553 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5559 case CPTK_HAS_NOTHROW_ASSIGN
:
5560 case CPTK_HAS_TRIVIAL_ASSIGN
:
5561 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5562 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5563 case CPTK_HAS_NOTHROW_COPY
:
5564 case CPTK_HAS_TRIVIAL_COPY
:
5565 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5566 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5567 case CPTK_IS_ABSTRACT
:
5570 case CPTK_IS_LITERAL_TYPE
:
5572 case CPTK_IS_POLYMORPHIC
:
5573 case CPTK_IS_STD_LAYOUT
:
5574 case CPTK_IS_TRIVIAL
:
5575 if (!check_trait_type (type1
))
5576 return error_mark_node
;
5579 case CPTK_IS_BASE_OF
:
5580 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5581 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5582 && !complete_type_or_else (type2
, NULL_TREE
))
5583 /* We already issued an error. */
5584 return error_mark_node
;
5592 case CPTK_IS_CONVERTIBLE_TO
:
5597 return (trait_expr_value (kind
, type1
, type2
)
5598 ? boolean_true_node
: boolean_false_node
);
5601 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5602 which is ignored for C++. */
5605 set_float_const_decimal64 (void)
5610 clear_float_const_decimal64 (void)
5615 float_const_decimal64_p (void)
5621 /* Return true if T is a literal type. */
5624 literal_type_p (tree t
)
5626 if (SCALAR_TYPE_P (t
)
5627 || TREE_CODE (t
) == VECTOR_TYPE
5628 || TREE_CODE (t
) == REFERENCE_TYPE
)
5630 if (CLASS_TYPE_P (t
))
5632 t
= complete_type (t
);
5633 gcc_assert (COMPLETE_TYPE_P (t
) || errorcount
);
5634 return CLASSTYPE_LITERAL_P (t
);
5636 if (TREE_CODE (t
) == ARRAY_TYPE
)
5637 return literal_type_p (strip_array_types (t
));
5641 /* If DECL is a variable declared `constexpr', require its type
5642 be literal. Return the DECL if OK, otherwise NULL. */
5645 ensure_literal_type_for_constexpr_object (tree decl
)
5647 tree type
= TREE_TYPE (decl
);
5648 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5649 && !processing_template_decl
)
5651 if (CLASS_TYPE_P (type
) && !COMPLETE_TYPE_P (complete_type (type
)))
5652 /* Don't complain here, we'll complain about incompleteness
5653 when we try to initialize the variable. */;
5654 else if (!literal_type_p (type
))
5656 error ("the type %qT of constexpr variable %qD is not literal",
5658 explain_non_literal_class (type
);
5665 /* Representation of entries in the constexpr function definition table. */
5667 typedef struct GTY(()) constexpr_fundef
{
5672 /* This table holds all constexpr function definitions seen in
5673 the current translation unit. */
5675 static GTY ((param_is (constexpr_fundef
))) htab_t constexpr_fundef_table
;
5677 /* Utility function used for managing the constexpr function table.
5678 Return true if the entries pointed to by P and Q are for the
5679 same constexpr function. */
5682 constexpr_fundef_equal (const void *p
, const void *q
)
5684 const constexpr_fundef
*lhs
= (const constexpr_fundef
*) p
;
5685 const constexpr_fundef
*rhs
= (const constexpr_fundef
*) q
;
5686 return lhs
->decl
== rhs
->decl
;
5689 /* Utility function used for managing the constexpr function table.
5690 Return a hash value for the entry pointed to by Q. */
5692 static inline hashval_t
5693 constexpr_fundef_hash (const void *p
)
5695 const constexpr_fundef
*fundef
= (const constexpr_fundef
*) p
;
5696 return DECL_UID (fundef
->decl
);
5699 /* Return a previously saved definition of function FUN. */
5701 static constexpr_fundef
*
5702 retrieve_constexpr_fundef (tree fun
)
5704 constexpr_fundef fundef
= { NULL
, NULL
};
5705 if (constexpr_fundef_table
== NULL
)
5709 return (constexpr_fundef
*) htab_find (constexpr_fundef_table
, &fundef
);
5712 /* Check whether the parameter and return types of FUN are valid for a
5713 constexpr function, and complain if COMPLAIN. */
5716 is_valid_constexpr_fn (tree fun
, bool complain
)
5718 tree parm
= FUNCTION_FIRST_USER_PARM (fun
);
5720 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5721 if (!literal_type_p (TREE_TYPE (parm
)))
5726 error ("invalid type for parameter %d of constexpr "
5727 "function %q+#D", DECL_PARM_INDEX (parm
), fun
);
5728 explain_non_literal_class (TREE_TYPE (parm
));
5732 if (!DECL_CONSTRUCTOR_P (fun
))
5734 tree rettype
= TREE_TYPE (TREE_TYPE (fun
));
5735 if (!literal_type_p (rettype
))
5740 error ("invalid return type %qT of constexpr function %q+D",
5742 explain_non_literal_class (rettype
);
5746 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
5747 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun
)))
5752 error ("enclosing class of constexpr non-static member "
5753 "function %q+#D is not a literal type", fun
);
5754 explain_non_literal_class (DECL_CONTEXT (fun
));
5758 else if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fun
)))
5762 error ("%q#T has virtual base classes", DECL_CONTEXT (fun
));
5768 /* Subroutine of build_constexpr_constructor_member_initializers.
5769 The expression tree T represents a data member initialization
5770 in a (constexpr) constructor definition. Build a pairing of
5771 the data member with its initializer, and prepend that pair
5772 to the existing initialization pair INITS. */
5775 build_data_member_initialization (tree t
, VEC(constructor_elt
,gc
) **vec
)
5778 if (TREE_CODE (t
) == CLEANUP_POINT_EXPR
)
5779 t
= TREE_OPERAND (t
, 0);
5780 if (TREE_CODE (t
) == EXPR_STMT
)
5781 t
= TREE_OPERAND (t
, 0);
5782 if (t
== error_mark_node
)
5784 if (TREE_CODE (t
) == STATEMENT_LIST
)
5786 tree_stmt_iterator i
;
5787 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
5789 if (! build_data_member_initialization (tsi_stmt (i
), vec
))
5794 if (TREE_CODE (t
) == CLEANUP_STMT
)
5796 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5797 but we can in a constexpr constructor for a non-literal class. Just
5798 ignore it; either all the initialization will be constant, in which
5799 case the cleanup can't run, or it can't be constexpr.
5800 Still recurse into CLEANUP_BODY. */
5801 return build_data_member_initialization (CLEANUP_BODY (t
), vec
);
5803 if (TREE_CODE (t
) == CONVERT_EXPR
)
5804 t
= TREE_OPERAND (t
, 0);
5805 if (TREE_CODE (t
) == INIT_EXPR
5806 || TREE_CODE (t
) == MODIFY_EXPR
)
5808 member
= TREE_OPERAND (t
, 0);
5809 init
= unshare_expr (TREE_OPERAND (t
, 1));
5813 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
5814 member
= CALL_EXPR_ARG (t
, 0);
5815 /* We don't use build_cplus_new here because it complains about
5816 abstract bases. Leaving the call unwrapped means that it has the
5817 wrong type, but cxx_eval_constant_expression doesn't care. */
5818 init
= unshare_expr (t
);
5820 if (TREE_CODE (member
) == INDIRECT_REF
)
5821 member
= TREE_OPERAND (member
, 0);
5822 if (TREE_CODE (member
) == NOP_EXPR
)
5826 if (TREE_CODE (op
) == ADDR_EXPR
)
5828 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5829 (TREE_TYPE (TREE_TYPE (op
)),
5830 TREE_TYPE (TREE_TYPE (member
))));
5831 /* Initializing a cv-qualified member; we need to look through
5835 else if (op
== current_class_ptr
5836 && (same_type_ignoring_top_level_qualifiers_p
5837 (TREE_TYPE (TREE_TYPE (member
)),
5838 current_class_type
)))
5839 /* Delegating constructor. */
5843 /* This is an initializer for an empty base; keep it for now so
5844 we can check it in cxx_eval_bare_aggregate. */
5845 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member
))));
5848 if (TREE_CODE (member
) == ADDR_EXPR
)
5849 member
= TREE_OPERAND (member
, 0);
5850 if (TREE_CODE (member
) == COMPONENT_REF
5851 /* If we're initializing a member of a subaggregate, it's a vtable
5852 pointer. Leave it as COMPONENT_REF so we remember the path to get
5854 && TREE_CODE (TREE_OPERAND (member
, 0)) != COMPONENT_REF
)
5855 member
= TREE_OPERAND (member
, 1);
5856 CONSTRUCTOR_APPEND_ELT (*vec
, member
, init
);
5860 /* Make sure that there are no statements after LAST in the constructor
5861 body represented by LIST. */
5864 check_constexpr_ctor_body (tree last
, tree list
)
5867 if (TREE_CODE (list
) == STATEMENT_LIST
)
5869 tree_stmt_iterator i
= tsi_last (list
);
5870 for (; !tsi_end_p (i
); tsi_prev (&i
))
5872 tree t
= tsi_stmt (i
);
5875 if (TREE_CODE (t
) == BIND_EXPR
)
5877 if (!check_constexpr_ctor_body (last
, BIND_EXPR_BODY (t
)))
5882 /* We currently allow typedefs and static_assert.
5883 FIXME allow them in the standard, too. */
5884 if (TREE_CODE (t
) != STATIC_ASSERT
)
5891 else if (list
!= last
5892 && TREE_CODE (list
) != STATIC_ASSERT
)
5896 error ("constexpr constructor does not have empty body");
5897 DECL_DECLARED_CONSTEXPR_P (current_function_decl
) = false;
5902 /* Build compile-time evalable representations of member-initializer list
5903 for a constexpr constructor. */
5906 build_constexpr_constructor_member_initializers (tree type
, tree body
)
5908 VEC(constructor_elt
,gc
) *vec
= NULL
;
5910 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
5911 || TREE_CODE (body
) == EH_SPEC_BLOCK
)
5912 body
= TREE_OPERAND (body
, 0);
5913 if (TREE_CODE (body
) == STATEMENT_LIST
)
5914 body
= STATEMENT_LIST_HEAD (body
)->stmt
;
5915 body
= BIND_EXPR_BODY (body
);
5916 if (TREE_CODE (body
) == CLEANUP_POINT_EXPR
)
5918 body
= TREE_OPERAND (body
, 0);
5919 if (TREE_CODE (body
) == EXPR_STMT
)
5920 body
= TREE_OPERAND (body
, 0);
5921 if (TREE_CODE (body
) == INIT_EXPR
5922 && (same_type_ignoring_top_level_qualifiers_p
5923 (TREE_TYPE (TREE_OPERAND (body
, 0)),
5924 current_class_type
)))
5927 return TREE_OPERAND (body
, 1);
5929 ok
= build_data_member_initialization (body
, &vec
);
5931 else if (TREE_CODE (body
) == STATEMENT_LIST
)
5933 tree_stmt_iterator i
;
5934 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5936 ok
= build_data_member_initialization (tsi_stmt (i
), &vec
);
5941 else if (TREE_CODE (body
) == TRY_BLOCK
)
5943 error ("body of %<constexpr%> constructor cannot be "
5944 "a function-try-block");
5945 return error_mark_node
;
5947 else if (EXPR_P (body
))
5948 ok
= build_data_member_initialization (body
, &vec
);
5950 gcc_assert (errorcount
> 0);
5953 if (VEC_length (constructor_elt
, vec
) > 0)
5955 /* In a delegating constructor, return the target. */
5956 constructor_elt
*ce
= &VEC_index (constructor_elt
, vec
, 0);
5957 if (ce
->index
== current_class_ptr
)
5960 VEC_free (constructor_elt
, gc
, vec
);
5964 return build_constructor (type
, vec
);
5967 return error_mark_node
;
5970 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5971 declared to be constexpr, or a sub-statement thereof. Returns the
5972 return value if suitable, error_mark_node for a statement not allowed in
5973 a constexpr function, or NULL_TREE if no return value was found. */
5976 constexpr_fn_retval (tree body
)
5978 switch (TREE_CODE (body
))
5980 case STATEMENT_LIST
:
5982 tree_stmt_iterator i
;
5983 tree expr
= NULL_TREE
;
5984 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
5986 tree s
= constexpr_fn_retval (tsi_stmt (i
));
5987 if (s
== error_mark_node
)
5988 return error_mark_node
;
5989 else if (s
== NULL_TREE
)
5990 /* Keep iterating. */;
5992 /* Multiple return statements. */
5993 return error_mark_node
;
6001 return unshare_expr (TREE_OPERAND (body
, 0));
6004 if (TREE_CODE (DECL_EXPR_DECL (body
)) == USING_DECL
)
6006 return error_mark_node
;
6008 case CLEANUP_POINT_EXPR
:
6009 return constexpr_fn_retval (TREE_OPERAND (body
, 0));
6015 return error_mark_node
;
6019 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
6020 FUN; do the necessary transformations to turn it into a single expression
6021 that we can store in the hash table. */
6024 massage_constexpr_body (tree fun
, tree body
)
6026 if (DECL_CONSTRUCTOR_P (fun
))
6027 body
= build_constexpr_constructor_member_initializers
6028 (DECL_CONTEXT (fun
), body
);
6031 if (TREE_CODE (body
) == EH_SPEC_BLOCK
)
6032 body
= EH_SPEC_STMTS (body
);
6033 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
6034 body
= TREE_OPERAND (body
, 0);
6035 if (TREE_CODE (body
) == BIND_EXPR
)
6036 body
= BIND_EXPR_BODY (body
);
6037 body
= constexpr_fn_retval (body
);
6042 /* FUN is a constexpr constructor with massaged body BODY. Return true
6043 if some bases/fields are uninitialized, and complain if COMPLAIN. */
6046 cx_check_missing_mem_inits (tree fun
, tree body
, bool complain
)
6053 if (TREE_CODE (body
) != CONSTRUCTOR
)
6056 nelts
= CONSTRUCTOR_NELTS (body
);
6057 ctype
= DECL_CONTEXT (fun
);
6058 field
= TYPE_FIELDS (ctype
);
6060 if (TREE_CODE (ctype
) == UNION_TYPE
)
6062 if (nelts
== 0 && next_initializable_field (field
))
6065 error ("%<constexpr%> constructor for union %qT must "
6066 "initialize exactly one non-static data member", ctype
);
6073 for (i
= 0; i
<= nelts
; ++i
)
6080 index
= CONSTRUCTOR_ELT (body
, i
)->index
;
6081 /* Skip base and vtable inits. */
6082 if (TREE_CODE (index
) != FIELD_DECL
)
6085 for (; field
!= index
; field
= DECL_CHAIN (field
))
6088 if (TREE_CODE (field
) != FIELD_DECL
6089 || (DECL_C_BIT_FIELD (field
) && !DECL_NAME (field
)))
6091 ftype
= strip_array_types (TREE_TYPE (field
));
6092 if (type_has_constexpr_default_constructor (ftype
))
6094 /* It's OK to skip a member with a trivial constexpr ctor.
6095 A constexpr ctor that isn't trivial should have been
6097 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype
)
6098 || errorcount
!= 0);
6103 error ("uninitialized member %qD in %<constexpr%> constructor",
6107 if (field
== NULL_TREE
)
6109 field
= DECL_CHAIN (field
);
6115 /* We are processing the definition of the constexpr function FUN.
6116 Check that its BODY fulfills the propriate requirements and
6117 enter it in the constexpr function definition table.
6118 For constructor BODY is actually the TREE_LIST of the
6119 member-initializer list. */
6122 register_constexpr_fundef (tree fun
, tree body
)
6124 constexpr_fundef entry
;
6125 constexpr_fundef
**slot
;
6127 if (!is_valid_constexpr_fn (fun
, !DECL_GENERATED_P (fun
)))
6130 body
= massage_constexpr_body (fun
, body
);
6131 if (body
== NULL_TREE
|| body
== error_mark_node
)
6133 if (!DECL_CONSTRUCTOR_P (fun
))
6134 error ("body of constexpr function %qD not a return-statement", fun
);
6138 if (!potential_rvalue_constant_expression (body
))
6140 if (!DECL_GENERATED_P (fun
))
6141 require_potential_rvalue_constant_expression (body
);
6145 if (DECL_CONSTRUCTOR_P (fun
)
6146 && cx_check_missing_mem_inits (fun
, body
, !DECL_GENERATED_P (fun
)))
6149 /* Create the constexpr function table if necessary. */
6150 if (constexpr_fundef_table
== NULL
)
6151 constexpr_fundef_table
= htab_create_ggc (101,
6152 constexpr_fundef_hash
,
6153 constexpr_fundef_equal
,
6157 slot
= (constexpr_fundef
**)
6158 htab_find_slot (constexpr_fundef_table
, &entry
, INSERT
);
6160 gcc_assert (*slot
== NULL
);
6161 *slot
= ggc_alloc_constexpr_fundef ();
6167 /* FUN is a non-constexpr function called in a context that requires a
6168 constant expression. If it comes from a constexpr template, explain why
6169 the instantiation isn't constexpr. */
6172 explain_invalid_constexpr_fn (tree fun
)
6174 static struct pointer_set_t
*diagnosed
;
6176 location_t save_loc
;
6177 /* Only diagnose defaulted functions or instantiations. */
6178 if (!DECL_DEFAULTED_FN (fun
)
6179 && !is_instantiation_of_constexpr (fun
))
6181 if (diagnosed
== NULL
)
6182 diagnosed
= pointer_set_create ();
6183 if (pointer_set_insert (diagnosed
, fun
) != 0)
6184 /* Already explained. */
6187 save_loc
= input_location
;
6188 input_location
= DECL_SOURCE_LOCATION (fun
);
6189 inform (0, "%q+D is not usable as a constexpr function because:", fun
);
6190 /* First check the declaration. */
6191 if (is_valid_constexpr_fn (fun
, true))
6193 /* Then if it's OK, the body. */
6194 if (DECL_DEFAULTED_FN (fun
))
6195 explain_implicit_non_constexpr (fun
);
6198 body
= massage_constexpr_body (fun
, DECL_SAVED_TREE (fun
));
6199 require_potential_rvalue_constant_expression (body
);
6200 if (DECL_CONSTRUCTOR_P (fun
))
6201 cx_check_missing_mem_inits (fun
, body
, true);
6204 input_location
= save_loc
;
6207 /* Objects of this type represent calls to constexpr functions
6208 along with the bindings of parameters to their arguments, for
6209 the purpose of compile time evaluation. */
6211 typedef struct GTY(()) constexpr_call
{
6212 /* Description of the constexpr function definition. */
6213 constexpr_fundef
*fundef
;
6214 /* Parameter bindings environment. A TREE_LIST where each TREE_PURPOSE
6215 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6216 Note: This arrangement is made to accomodate the use of
6217 iterative_hash_template_arg (see pt.c). If you change this
6218 representation, also change the hash calculation in
6219 cxx_eval_call_expression. */
6221 /* Result of the call.
6222 NULL means the call is being evaluated.
6223 error_mark_node means that the evaluation was erroneous;
6224 otherwise, the actuall value of the call. */
6226 /* The hash of this call; we remember it here to avoid having to
6227 recalculate it when expanding the hash table. */
6231 /* A table of all constexpr calls that have been evaluated by the
6232 compiler in this translation unit. */
6234 static GTY ((param_is (constexpr_call
))) htab_t constexpr_call_table
;
6236 static tree
cxx_eval_constant_expression (const constexpr_call
*, tree
,
6237 bool, bool, bool *);
6238 static tree
cxx_eval_vec_perm_expr (const constexpr_call
*, tree
, bool, bool,
6242 /* Compute a hash value for a constexpr call representation. */
6245 constexpr_call_hash (const void *p
)
6247 const constexpr_call
*info
= (const constexpr_call
*) p
;
6251 /* Return 1 if the objects pointed to by P and Q represent calls
6252 to the same constexpr function with the same arguments.
6253 Otherwise, return 0. */
6256 constexpr_call_equal (const void *p
, const void *q
)
6258 const constexpr_call
*lhs
= (const constexpr_call
*) p
;
6259 const constexpr_call
*rhs
= (const constexpr_call
*) q
;
6264 if (!constexpr_fundef_equal (lhs
->fundef
, rhs
->fundef
))
6266 lhs_bindings
= lhs
->bindings
;
6267 rhs_bindings
= rhs
->bindings
;
6268 while (lhs_bindings
!= NULL
&& rhs_bindings
!= NULL
)
6270 tree lhs_arg
= TREE_VALUE (lhs_bindings
);
6271 tree rhs_arg
= TREE_VALUE (rhs_bindings
);
6272 gcc_assert (TREE_TYPE (lhs_arg
) == TREE_TYPE (rhs_arg
));
6273 if (!cp_tree_equal (lhs_arg
, rhs_arg
))
6275 lhs_bindings
= TREE_CHAIN (lhs_bindings
);
6276 rhs_bindings
= TREE_CHAIN (rhs_bindings
);
6278 return lhs_bindings
== rhs_bindings
;
6281 /* Initialize the constexpr call table, if needed. */
6284 maybe_initialize_constexpr_call_table (void)
6286 if (constexpr_call_table
== NULL
)
6287 constexpr_call_table
= htab_create_ggc (101,
6288 constexpr_call_hash
,
6289 constexpr_call_equal
,
6293 /* Return true if T designates the implied `this' parameter. */
6296 is_this_parameter (tree t
)
6298 return t
== current_class_ptr
;
6301 /* We have an expression tree T that represents a call, either CALL_EXPR
6302 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6303 retrun the _DECL for that function. */
6306 get_function_named_in_call (tree t
)
6309 switch (TREE_CODE (t
))
6312 fun
= CALL_EXPR_FN (t
);
6315 case AGGR_INIT_EXPR
:
6316 fun
= AGGR_INIT_EXPR_FN (t
);
6323 if (TREE_CODE (fun
) == ADDR_EXPR
6324 && TREE_CODE (TREE_OPERAND (fun
, 0)) == FUNCTION_DECL
)
6325 fun
= TREE_OPERAND (fun
, 0);
6329 /* We have an expression tree T that represents a call, either CALL_EXPR
6330 or AGGR_INIT_EXPR. Return the Nth argument. */
6333 get_nth_callarg (tree t
, int n
)
6335 switch (TREE_CODE (t
))
6338 return CALL_EXPR_ARG (t
, n
);
6340 case AGGR_INIT_EXPR
:
6341 return AGGR_INIT_EXPR_ARG (t
, n
);
6349 /* Look up the binding of the function parameter T in a constexpr
6350 function call context CALL. */
6353 lookup_parameter_binding (const constexpr_call
*call
, tree t
)
6355 tree b
= purpose_member (t
, call
->bindings
);
6356 return TREE_VALUE (b
);
6359 /* Attempt to evaluate T which represents a call to a builtin function.
6360 We assume here that all builtin functions evaluate to scalar types
6361 represented by _CST nodes. */
6364 cxx_eval_builtin_function_call (const constexpr_call
*call
, tree t
,
6365 bool allow_non_constant
, bool addr
,
6366 bool *non_constant_p
)
6368 const int nargs
= call_expr_nargs (t
);
6369 tree
*args
= (tree
*) alloca (nargs
* sizeof (tree
));
6372 for (i
= 0; i
< nargs
; ++i
)
6374 args
[i
] = cxx_eval_constant_expression (call
, CALL_EXPR_ARG (t
, i
),
6375 allow_non_constant
, addr
,
6377 if (allow_non_constant
&& *non_constant_p
)
6380 if (*non_constant_p
)
6382 new_call
= build_call_array_loc (EXPR_LOCATION (t
), TREE_TYPE (t
),
6383 CALL_EXPR_FN (t
), nargs
, args
);
6384 return fold (new_call
);
6387 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6388 the type of the value to match. */
6391 adjust_temp_type (tree type
, tree temp
)
6393 if (TREE_TYPE (temp
) == type
)
6395 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6396 if (TREE_CODE (temp
) == CONSTRUCTOR
)
6397 return build_constructor (type
, CONSTRUCTOR_ELTS (temp
));
6398 gcc_assert (SCALAR_TYPE_P (type
));
6399 return cp_fold_convert (type
, temp
);
6402 /* Subroutine of cxx_eval_call_expression.
6403 We are processing a call expression (either CALL_EXPR or
6404 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6405 all arguments and bind their values to correspondings
6406 parameters, making up the NEW_CALL context. */
6409 cxx_bind_parameters_in_call (const constexpr_call
*old_call
, tree t
,
6410 constexpr_call
*new_call
,
6411 bool allow_non_constant
,
6412 bool *non_constant_p
)
6414 const int nargs
= call_expr_nargs (t
);
6415 tree fun
= new_call
->fundef
->decl
;
6416 tree parms
= DECL_ARGUMENTS (fun
);
6418 for (i
= 0; i
< nargs
; ++i
)
6421 tree type
= parms
? TREE_TYPE (parms
) : void_type_node
;
6422 /* For member function, the first argument is a pointer to the implied
6423 object. And for an object contruction, don't bind `this' before
6424 it is fully constructed. */
6425 if (i
== 0 && DECL_CONSTRUCTOR_P (fun
))
6427 x
= get_nth_callarg (t
, i
);
6428 arg
= cxx_eval_constant_expression (old_call
, x
, allow_non_constant
,
6429 TREE_CODE (type
) == REFERENCE_TYPE
,
6431 /* Don't VERIFY_CONSTANT here. */
6432 if (*non_constant_p
&& allow_non_constant
)
6434 /* Just discard ellipsis args after checking their constantitude. */
6437 if (*non_constant_p
)
6438 /* Don't try to adjust the type of non-constant args. */
6441 /* Make sure the binding has the same type as the parm. */
6442 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6443 arg
= adjust_temp_type (type
, arg
);
6444 new_call
->bindings
= tree_cons (parms
, arg
, new_call
->bindings
);
6446 parms
= TREE_CHAIN (parms
);
6450 /* Variables and functions to manage constexpr call expansion context.
6451 These do not need to be marked for PCH or GC. */
6453 /* FIXME remember and print actual constant arguments. */
6454 static VEC(tree
,heap
) *call_stack
= NULL
;
6455 static int call_stack_tick
;
6456 static int last_cx_error_tick
;
6459 push_cx_call_context (tree call
)
6462 if (!EXPR_HAS_LOCATION (call
))
6463 SET_EXPR_LOCATION (call
, input_location
);
6464 VEC_safe_push (tree
, heap
, call_stack
, call
);
6465 if (VEC_length (tree
, call_stack
) > (unsigned) max_constexpr_depth
)
6471 pop_cx_call_context (void)
6474 VEC_pop (tree
, call_stack
);
6478 cx_error_context (void)
6480 VEC(tree
,heap
) *r
= NULL
;
6481 if (call_stack_tick
!= last_cx_error_tick
6482 && !VEC_empty (tree
, call_stack
))
6484 last_cx_error_tick
= call_stack_tick
;
6488 /* Subroutine of cxx_eval_constant_expression.
6489 Evaluate the call expression tree T in the context of OLD_CALL expression
6493 cxx_eval_call_expression (const constexpr_call
*old_call
, tree t
,
6494 bool allow_non_constant
, bool addr
,
6495 bool *non_constant_p
)
6497 location_t loc
= EXPR_LOC_OR_HERE (t
);
6498 tree fun
= get_function_named_in_call (t
);
6500 constexpr_call new_call
= { NULL
, NULL
, NULL
, 0 };
6501 constexpr_call
**slot
;
6502 constexpr_call
*entry
;
6505 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6507 /* Might be a constexpr function pointer. */
6508 fun
= cxx_eval_constant_expression (old_call
, fun
, allow_non_constant
,
6509 /*addr*/false, non_constant_p
);
6510 if (TREE_CODE (fun
) == ADDR_EXPR
)
6511 fun
= TREE_OPERAND (fun
, 0);
6513 if (TREE_CODE (fun
) != FUNCTION_DECL
)
6515 if (!allow_non_constant
&& !*non_constant_p
)
6516 error_at (loc
, "expression %qE does not designate a constexpr "
6518 *non_constant_p
= true;
6521 if (DECL_CLONED_FUNCTION_P (fun
))
6522 fun
= DECL_CLONED_FUNCTION (fun
);
6523 if (is_builtin_fn (fun
))
6524 return cxx_eval_builtin_function_call (old_call
, t
, allow_non_constant
,
6525 addr
, non_constant_p
);
6526 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
6528 if (!allow_non_constant
)
6530 error_at (loc
, "call to non-constexpr function %qD", fun
);
6531 explain_invalid_constexpr_fn (fun
);
6533 *non_constant_p
= true;
6537 /* Shortcut trivial copy constructor/op=. */
6538 if (call_expr_nargs (t
) == 2 && trivial_fn_p (fun
))
6540 tree arg
= convert_from_reference (get_nth_callarg (t
, 1));
6541 return cxx_eval_constant_expression (old_call
, arg
, allow_non_constant
,
6542 addr
, non_constant_p
);
6545 /* If in direct recursive call, optimize definition search. */
6546 if (old_call
!= NULL
&& old_call
->fundef
->decl
== fun
)
6547 new_call
.fundef
= old_call
->fundef
;
6550 new_call
.fundef
= retrieve_constexpr_fundef (fun
);
6551 if (new_call
.fundef
== NULL
|| new_call
.fundef
->body
== NULL
)
6553 if (!allow_non_constant
)
6555 if (DECL_INITIAL (fun
))
6557 /* The definition of fun was somehow unsuitable. */
6558 error_at (loc
, "%qD called in a constant expression", fun
);
6559 explain_invalid_constexpr_fn (fun
);
6562 error_at (loc
, "%qD used before its definition", fun
);
6564 *non_constant_p
= true;
6568 cxx_bind_parameters_in_call (old_call
, t
, &new_call
,
6569 allow_non_constant
, non_constant_p
);
6570 if (*non_constant_p
)
6573 depth_ok
= push_cx_call_context (t
);
6576 = iterative_hash_template_arg (new_call
.bindings
,
6577 constexpr_fundef_hash (new_call
.fundef
));
6579 /* If we have seen this call before, we are done. */
6580 maybe_initialize_constexpr_call_table ();
6581 slot
= (constexpr_call
**)
6582 htab_find_slot (constexpr_call_table
, &new_call
, INSERT
);
6586 /* We need to keep a pointer to the entry, not just the slot, as the
6587 slot can move in the call to cxx_eval_builtin_function_call. */
6588 *slot
= entry
= ggc_alloc_constexpr_call ();
6591 /* Calls which are in progress have their result set to NULL
6592 so that we can detect circular dependencies. */
6593 else if (entry
->result
== NULL
)
6595 if (!allow_non_constant
)
6596 error ("call has circular dependency");
6597 *non_constant_p
= true;
6598 entry
->result
= result
= error_mark_node
;
6603 if (!allow_non_constant
)
6604 error ("constexpr evaluation depth exceeds maximum of %d (use "
6605 "-fconstexpr-depth= to increase the maximum)",
6606 max_constexpr_depth
);
6607 *non_constant_p
= true;
6608 entry
->result
= result
= error_mark_node
;
6612 result
= entry
->result
;
6613 if (!result
|| result
== error_mark_node
)
6614 result
= (cxx_eval_constant_expression
6615 (&new_call
, new_call
.fundef
->body
,
6616 allow_non_constant
, addr
,
6618 if (result
== error_mark_node
)
6619 *non_constant_p
= true;
6620 if (*non_constant_p
)
6621 entry
->result
= result
= error_mark_node
;
6624 /* If this was a call to initialize an object, set the type of
6625 the CONSTRUCTOR to the type of that object. */
6626 if (DECL_CONSTRUCTOR_P (fun
))
6628 tree ob_arg
= get_nth_callarg (t
, 0);
6629 STRIP_NOPS (ob_arg
);
6630 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg
)) == POINTER_TYPE
6631 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg
))));
6632 result
= adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg
)),
6635 entry
->result
= result
;
6639 pop_cx_call_context ();
6640 return unshare_expr (result
);
6643 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6646 reduced_constant_expression_p (tree t
)
6648 if (TREE_OVERFLOW_P (t
))
6649 /* Integer overflow makes this not a constant expression. */
6651 /* FIXME are we calling this too much? */
6652 return initializer_constant_valid_p (t
, TREE_TYPE (t
)) != NULL_TREE
;
6655 /* Some expressions may have constant operands but are not constant
6656 themselves, such as 1/0. Call this function (or rather, the macro
6657 following it) to check for that condition.
6659 We only call this in places that require an arithmetic constant, not in
6660 places where we might have a non-constant expression that can be a
6661 component of a constant expression, such as the address of a constexpr
6662 variable that might be dereferenced later. */
6665 verify_constant (tree t
, bool allow_non_constant
, bool *non_constant_p
)
6667 if (!*non_constant_p
&& !reduced_constant_expression_p (t
))
6669 if (!allow_non_constant
)
6671 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6672 printing the folded constant isn't helpful. */
6673 if (TREE_OVERFLOW_P (t
))
6675 permerror (input_location
, "overflow in constant expression");
6676 /* If we're being permissive (and are in an enforcing
6677 context), consider this constant. */
6678 if (flag_permissive
)
6682 error ("%q+E is not a constant expression", t
);
6684 *non_constant_p
= true;
6686 return *non_constant_p
;
6688 #define VERIFY_CONSTANT(X) \
6690 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6694 /* Subroutine of cxx_eval_constant_expression.
6695 Attempt to reduce the unary expression tree T to a compile time value.
6696 If successful, return the value. Otherwise issue a diagnostic
6697 and return error_mark_node. */
6700 cxx_eval_unary_expression (const constexpr_call
*call
, tree t
,
6701 bool allow_non_constant
, bool addr
,
6702 bool *non_constant_p
)
6705 tree orig_arg
= TREE_OPERAND (t
, 0);
6706 tree arg
= cxx_eval_constant_expression (call
, orig_arg
, allow_non_constant
,
6707 addr
, non_constant_p
);
6708 VERIFY_CONSTANT (arg
);
6709 if (arg
== orig_arg
)
6711 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), arg
);
6712 VERIFY_CONSTANT (r
);
6716 /* Subroutine of cxx_eval_constant_expression.
6717 Like cxx_eval_unary_expression, except for binary expressions. */
6720 cxx_eval_binary_expression (const constexpr_call
*call
, tree t
,
6721 bool allow_non_constant
, bool addr
,
6722 bool *non_constant_p
)
6725 tree orig_lhs
= TREE_OPERAND (t
, 0);
6726 tree orig_rhs
= TREE_OPERAND (t
, 1);
6728 lhs
= cxx_eval_constant_expression (call
, orig_lhs
,
6729 allow_non_constant
, addr
,
6731 VERIFY_CONSTANT (lhs
);
6732 rhs
= cxx_eval_constant_expression (call
, orig_rhs
,
6733 allow_non_constant
, addr
,
6735 VERIFY_CONSTANT (rhs
);
6736 if (lhs
== orig_lhs
&& rhs
== orig_rhs
)
6738 r
= fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), lhs
, rhs
);
6739 VERIFY_CONSTANT (r
);
6743 /* Subroutine of cxx_eval_constant_expression.
6744 Attempt to evaluate condition expressions. Dead branches are not
6748 cxx_eval_conditional_expression (const constexpr_call
*call
, tree t
,
6749 bool allow_non_constant
, bool addr
,
6750 bool *non_constant_p
)
6752 tree val
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6753 allow_non_constant
, addr
,
6755 VERIFY_CONSTANT (val
);
6756 /* Don't VERIFY_CONSTANT the other operands. */
6757 if (integer_zerop (val
))
6758 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 2),
6759 allow_non_constant
, addr
,
6761 return cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
6762 allow_non_constant
, addr
,
6766 /* Subroutine of cxx_eval_constant_expression.
6767 Attempt to reduce a reference to an array slot. */
6770 cxx_eval_array_reference (const constexpr_call
*call
, tree t
,
6771 bool allow_non_constant
, bool addr
,
6772 bool *non_constant_p
)
6774 tree oldary
= TREE_OPERAND (t
, 0);
6775 tree ary
= cxx_eval_constant_expression (call
, oldary
,
6776 allow_non_constant
, addr
,
6781 unsigned len
, elem_nchars
= 1;
6782 if (*non_constant_p
)
6784 oldidx
= TREE_OPERAND (t
, 1);
6785 index
= cxx_eval_constant_expression (call
, oldidx
,
6786 allow_non_constant
, false,
6788 VERIFY_CONSTANT (index
);
6789 if (addr
&& ary
== oldary
&& index
== oldidx
)
6792 return build4 (ARRAY_REF
, TREE_TYPE (t
), ary
, index
, NULL
, NULL
);
6793 elem_type
= TREE_TYPE (TREE_TYPE (ary
));
6794 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6795 len
= CONSTRUCTOR_NELTS (ary
);
6796 else if (TREE_CODE (ary
) == STRING_CST
)
6798 elem_nchars
= (TYPE_PRECISION (elem_type
)
6799 / TYPE_PRECISION (char_type_node
));
6800 len
= (unsigned) TREE_STRING_LENGTH (ary
) / elem_nchars
;
6804 /* We can't do anything with other tree codes, so use
6805 VERIFY_CONSTANT to complain and fail. */
6806 VERIFY_CONSTANT (ary
);
6809 if (compare_tree_int (index
, len
) >= 0)
6811 if (tree_int_cst_lt (index
, array_type_nelts_top (TREE_TYPE (ary
))))
6813 /* If it's within the array bounds but doesn't have an explicit
6814 initializer, it's value-initialized. */
6815 tree val
= build_value_init (elem_type
, tf_warning_or_error
);
6816 return cxx_eval_constant_expression (call
, val
,
6817 allow_non_constant
, addr
,
6821 if (!allow_non_constant
)
6822 error ("array subscript out of bound");
6823 *non_constant_p
= true;
6826 i
= tree_low_cst (index
, 0);
6827 if (TREE_CODE (ary
) == CONSTRUCTOR
)
6828 return VEC_index (constructor_elt
, CONSTRUCTOR_ELTS (ary
), i
).value
;
6829 else if (elem_nchars
== 1)
6830 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary
))),
6831 TREE_STRING_POINTER (ary
)[i
]);
6834 tree type
= cv_unqualified (TREE_TYPE (TREE_TYPE (ary
)));
6835 return native_interpret_expr (type
, (const unsigned char *)
6836 TREE_STRING_POINTER (ary
)
6837 + i
* elem_nchars
, elem_nchars
);
6839 /* Don't VERIFY_CONSTANT here. */
6842 /* Subroutine of cxx_eval_constant_expression.
6843 Attempt to reduce a field access of a value of class type. */
6846 cxx_eval_component_reference (const constexpr_call
*call
, tree t
,
6847 bool allow_non_constant
, bool addr
,
6848 bool *non_constant_p
)
6850 unsigned HOST_WIDE_INT i
;
6853 tree part
= TREE_OPERAND (t
, 1);
6854 tree orig_whole
= TREE_OPERAND (t
, 0);
6855 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6856 allow_non_constant
, addr
,
6858 if (whole
== orig_whole
)
6861 return fold_build3 (COMPONENT_REF
, TREE_TYPE (t
),
6862 whole
, part
, NULL_TREE
);
6863 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6865 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6867 if (!allow_non_constant
)
6868 error ("%qE is not a constant expression", orig_whole
);
6869 *non_constant_p
= true;
6871 if (DECL_MUTABLE_P (part
))
6873 if (!allow_non_constant
)
6874 error ("mutable %qD is not usable in a constant expression", part
);
6875 *non_constant_p
= true;
6877 if (*non_constant_p
)
6879 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6884 if (TREE_CODE (TREE_TYPE (whole
)) == UNION_TYPE
6885 && CONSTRUCTOR_NELTS (whole
) > 0)
6887 /* DR 1188 says we don't have to deal with this. */
6888 if (!allow_non_constant
)
6889 error ("accessing %qD member instead of initialized %qD member in "
6890 "constant expression", part
, CONSTRUCTOR_ELT (whole
, 0)->index
);
6891 *non_constant_p
= true;
6895 /* If there's no explicit init for this field, it's value-initialized. */
6896 value
= build_value_init (TREE_TYPE (t
), tf_warning_or_error
);
6897 return cxx_eval_constant_expression (call
, value
,
6898 allow_non_constant
, addr
,
6902 /* Subroutine of cxx_eval_constant_expression.
6903 Attempt to reduce a field access of a value of class type that is
6904 expressed as a BIT_FIELD_REF. */
6907 cxx_eval_bit_field_ref (const constexpr_call
*call
, tree t
,
6908 bool allow_non_constant
, bool addr
,
6909 bool *non_constant_p
)
6911 tree orig_whole
= TREE_OPERAND (t
, 0);
6912 tree retval
, fldval
, utype
, mask
;
6913 bool fld_seen
= false;
6914 HOST_WIDE_INT istart
, isize
;
6915 tree whole
= cxx_eval_constant_expression (call
, orig_whole
,
6916 allow_non_constant
, addr
,
6918 tree start
, field
, value
;
6919 unsigned HOST_WIDE_INT i
;
6921 if (whole
== orig_whole
)
6923 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6925 if (!*non_constant_p
&& TREE_CODE (whole
) != CONSTRUCTOR
)
6927 if (!allow_non_constant
)
6928 error ("%qE is not a constant expression", orig_whole
);
6929 *non_constant_p
= true;
6931 if (*non_constant_p
)
6934 start
= TREE_OPERAND (t
, 2);
6935 istart
= tree_low_cst (start
, 0);
6936 isize
= tree_low_cst (TREE_OPERAND (t
, 1), 0);
6937 utype
= TREE_TYPE (t
);
6938 if (!TYPE_UNSIGNED (utype
))
6939 utype
= build_nonstandard_integer_type (TYPE_PRECISION (utype
), 1);
6940 retval
= build_int_cst (utype
, 0);
6941 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole
), i
, field
, value
)
6943 tree bitpos
= bit_position (field
);
6944 if (bitpos
== start
&& DECL_SIZE (field
) == TREE_OPERAND (t
, 1))
6946 if (TREE_CODE (TREE_TYPE (field
)) == INTEGER_TYPE
6947 && TREE_CODE (value
) == INTEGER_CST
6948 && host_integerp (bitpos
, 0)
6949 && host_integerp (DECL_SIZE (field
), 0))
6951 HOST_WIDE_INT bit
= tree_low_cst (bitpos
, 0);
6952 HOST_WIDE_INT sz
= tree_low_cst (DECL_SIZE (field
), 0);
6953 HOST_WIDE_INT shift
;
6954 if (bit
>= istart
&& bit
+ sz
<= istart
+ isize
)
6956 fldval
= fold_convert (utype
, value
);
6957 mask
= build_int_cst_type (utype
, -1);
6958 mask
= fold_build2 (LSHIFT_EXPR
, utype
, mask
,
6959 size_int (TYPE_PRECISION (utype
) - sz
));
6960 mask
= fold_build2 (RSHIFT_EXPR
, utype
, mask
,
6961 size_int (TYPE_PRECISION (utype
) - sz
));
6962 fldval
= fold_build2 (BIT_AND_EXPR
, utype
, fldval
, mask
);
6963 shift
= bit
- istart
;
6964 if (BYTES_BIG_ENDIAN
)
6965 shift
= TYPE_PRECISION (utype
) - shift
- sz
;
6966 fldval
= fold_build2 (LSHIFT_EXPR
, utype
, fldval
,
6968 retval
= fold_build2 (BIT_IOR_EXPR
, utype
, retval
, fldval
);
6974 return fold_convert (TREE_TYPE (t
), retval
);
6976 return error_mark_node
;
6979 /* Subroutine of cxx_eval_constant_expression.
6980 Evaluate a short-circuited logical expression T in the context
6981 of a given constexpr CALL. BAILOUT_VALUE is the value for
6982 early return. CONTINUE_VALUE is used here purely for
6983 sanity check purposes. */
6986 cxx_eval_logical_expression (const constexpr_call
*call
, tree t
,
6987 tree bailout_value
, tree continue_value
,
6988 bool allow_non_constant
, bool addr
,
6989 bool *non_constant_p
)
6992 tree lhs
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
6993 allow_non_constant
, addr
,
6995 VERIFY_CONSTANT (lhs
);
6996 if (tree_int_cst_equal (lhs
, bailout_value
))
6998 gcc_assert (tree_int_cst_equal (lhs
, continue_value
));
6999 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7000 allow_non_constant
, addr
, non_constant_p
);
7001 VERIFY_CONSTANT (r
);
7005 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
7006 CONSTRUCTOR elements to initialize (part of) an object containing that
7007 field. Return a pointer to the constructor_elt corresponding to the
7008 initialization of the field. */
7010 static constructor_elt
*
7011 base_field_constructor_elt (VEC(constructor_elt
,gc
) *v
, tree ref
)
7013 tree aggr
= TREE_OPERAND (ref
, 0);
7014 tree field
= TREE_OPERAND (ref
, 1);
7016 constructor_elt
*ce
;
7018 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
7020 if (TREE_CODE (aggr
) == COMPONENT_REF
)
7022 constructor_elt
*base_ce
7023 = base_field_constructor_elt (v
, aggr
);
7024 v
= CONSTRUCTOR_ELTS (base_ce
->value
);
7027 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
7028 if (ce
->index
== field
)
7035 /* Subroutine of cxx_eval_constant_expression.
7036 The expression tree T denotes a C-style array or a C-style
7037 aggregate. Reduce it to a constant expression. */
7040 cxx_eval_bare_aggregate (const constexpr_call
*call
, tree t
,
7041 bool allow_non_constant
, bool addr
,
7042 bool *non_constant_p
)
7044 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (t
);
7045 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
,
7046 VEC_length (constructor_elt
, v
));
7047 constructor_elt
*ce
;
7049 bool changed
= false;
7050 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t
));
7051 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
7053 tree elt
= cxx_eval_constant_expression (call
, ce
->value
,
7054 allow_non_constant
, addr
,
7056 /* Don't VERIFY_CONSTANT here. */
7057 if (allow_non_constant
&& *non_constant_p
)
7059 if (elt
!= ce
->value
)
7061 if (TREE_CODE (ce
->index
) == COMPONENT_REF
)
7063 /* This is an initialization of a vfield inside a base
7064 subaggregate that we already initialized; push this
7065 initialization into the previous initialization. */
7066 constructor_elt
*inner
= base_field_constructor_elt (n
, ce
->index
);
7069 else if (TREE_CODE (ce
->index
) == NOP_EXPR
)
7071 /* This is an initializer for an empty base; now that we've
7072 checked that it's constant, we can ignore it. */
7073 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (ce
->index
))));
7076 CONSTRUCTOR_APPEND_ELT (n
, ce
->index
, elt
);
7078 if (*non_constant_p
|| !changed
)
7081 VEC_free (constructor_elt
, gc
, n
);
7084 t
= build_constructor (TREE_TYPE (t
), n
);
7085 TREE_CONSTANT (t
) = true;
7089 /* Subroutine of cxx_eval_constant_expression.
7090 The expression tree T is a VEC_INIT_EXPR which denotes the desired
7091 initialization of a non-static data member of array type. Reduce it to a
7094 Note that apart from value-initialization (when VALUE_INIT is true),
7095 this is only intended to support value-initialization and the
7096 initializations done by defaulted constructors for classes with
7097 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
7098 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
7099 for the copy/move constructor. */
7102 cxx_eval_vec_init_1 (const constexpr_call
*call
, tree atype
, tree init
,
7103 bool value_init
, bool allow_non_constant
, bool addr
,
7104 bool *non_constant_p
)
7106 tree elttype
= TREE_TYPE (atype
);
7107 int max
= tree_low_cst (array_type_nelts (atype
), 0);
7108 VEC(constructor_elt
,gc
) *n
= VEC_alloc (constructor_elt
, gc
, max
+ 1);
7109 bool pre_init
= false;
7112 /* For the default constructor, build up a call to the default
7113 constructor of the element type. We only need to handle class types
7114 here, as for a constructor to be constexpr, all members must be
7115 initialized, which for a defaulted default constructor means they must
7116 be of a class type with a constexpr default constructor. */
7117 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7118 /* We only do this at the lowest level. */;
7119 else if (value_init
)
7121 init
= build_value_init (elttype
, tf_warning_or_error
);
7122 init
= cxx_eval_constant_expression
7123 (call
, init
, allow_non_constant
, addr
, non_constant_p
);
7128 VEC(tree
,gc
) *argvec
= make_tree_vector ();
7129 init
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7130 &argvec
, elttype
, LOOKUP_NORMAL
,
7131 tf_warning_or_error
);
7132 release_tree_vector (argvec
);
7133 init
= cxx_eval_constant_expression (call
, init
, allow_non_constant
,
7134 addr
, non_constant_p
);
7138 if (*non_constant_p
&& !allow_non_constant
)
7141 for (i
= 0; i
<= max
; ++i
)
7143 tree idx
= build_int_cst (size_type_node
, i
);
7145 if (TREE_CODE (elttype
) == ARRAY_TYPE
)
7147 /* A multidimensional array; recurse. */
7148 if (value_init
|| init
== NULL_TREE
)
7149 eltinit
= NULL_TREE
;
7151 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7152 tf_warning_or_error
);
7153 eltinit
= cxx_eval_vec_init_1 (call
, elttype
, eltinit
, value_init
,
7154 allow_non_constant
, addr
,
7159 /* Initializing an element using value or default initialization
7160 we just pre-built above. */
7164 eltinit
= unshare_expr (init
);
7168 /* Copying an element. */
7169 VEC(tree
,gc
) *argvec
;
7170 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7171 (atype
, TREE_TYPE (init
)));
7172 eltinit
= cp_build_array_ref (input_location
, init
, idx
,
7173 tf_warning_or_error
);
7174 if (!real_lvalue_p (init
))
7175 eltinit
= move (eltinit
);
7176 argvec
= make_tree_vector ();
7177 VEC_quick_push (tree
, argvec
, eltinit
);
7178 eltinit
= (build_special_member_call
7179 (NULL_TREE
, complete_ctor_identifier
, &argvec
,
7180 elttype
, LOOKUP_NORMAL
, tf_warning_or_error
));
7181 release_tree_vector (argvec
);
7182 eltinit
= cxx_eval_constant_expression
7183 (call
, eltinit
, allow_non_constant
, addr
, non_constant_p
);
7185 if (*non_constant_p
&& !allow_non_constant
)
7187 CONSTRUCTOR_APPEND_ELT (n
, idx
, eltinit
);
7190 if (!*non_constant_p
)
7192 init
= build_constructor (atype
, n
);
7193 TREE_CONSTANT (init
) = true;
7198 VEC_free (constructor_elt
, gc
, n
);
7203 cxx_eval_vec_init (const constexpr_call
*call
, tree t
,
7204 bool allow_non_constant
, bool addr
,
7205 bool *non_constant_p
)
7207 tree atype
= TREE_TYPE (t
);
7208 tree init
= VEC_INIT_EXPR_INIT (t
);
7209 tree r
= cxx_eval_vec_init_1 (call
, atype
, init
,
7210 VEC_INIT_EXPR_VALUE_INIT (t
),
7211 allow_non_constant
, addr
, non_constant_p
);
7212 if (*non_constant_p
)
7218 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7219 match. We want to be less strict for simple *& folding; if we have a
7220 non-const temporary that we access through a const pointer, that should
7221 work. We handle this here rather than change fold_indirect_ref_1
7222 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7223 don't really make sense outside of constant expression evaluation. Also
7224 we want to allow folding to COMPONENT_REF, which could cause trouble
7225 with TBAA in fold_indirect_ref_1.
7227 Try to keep this function synced with fold_indirect_ref_1. */
7230 cxx_fold_indirect_ref (location_t loc
, tree type
, tree op0
, bool *empty_base
)
7236 subtype
= TREE_TYPE (sub
);
7237 if (!POINTER_TYPE_P (subtype
))
7240 if (TREE_CODE (sub
) == ADDR_EXPR
)
7242 tree op
= TREE_OPERAND (sub
, 0);
7243 tree optype
= TREE_TYPE (op
);
7245 /* *&CONST_DECL -> to the value of the const decl. */
7246 if (TREE_CODE (op
) == CONST_DECL
)
7247 return DECL_INITIAL (op
);
7248 /* *&p => p; make sure to handle *&"str"[cst] here. */
7249 if (same_type_ignoring_top_level_qualifiers_p (optype
, type
))
7251 tree fop
= fold_read_from_constant_string (op
);
7257 /* *(foo *)&fooarray => fooarray[0] */
7258 else if (TREE_CODE (optype
) == ARRAY_TYPE
7259 && (same_type_ignoring_top_level_qualifiers_p
7260 (type
, TREE_TYPE (optype
))))
7262 tree type_domain
= TYPE_DOMAIN (optype
);
7263 tree min_val
= size_zero_node
;
7264 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7265 min_val
= TYPE_MIN_VALUE (type_domain
);
7266 return build4_loc (loc
, ARRAY_REF
, type
, op
, min_val
,
7267 NULL_TREE
, NULL_TREE
);
7269 /* *(foo *)&complexfoo => __real__ complexfoo */
7270 else if (TREE_CODE (optype
) == COMPLEX_TYPE
7271 && (same_type_ignoring_top_level_qualifiers_p
7272 (type
, TREE_TYPE (optype
))))
7273 return fold_build1_loc (loc
, REALPART_EXPR
, type
, op
);
7274 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7275 else if (TREE_CODE (optype
) == VECTOR_TYPE
7276 && (same_type_ignoring_top_level_qualifiers_p
7277 (type
, TREE_TYPE (optype
))))
7279 tree part_width
= TYPE_SIZE (type
);
7280 tree index
= bitsize_int (0);
7281 return fold_build3_loc (loc
, BIT_FIELD_REF
, type
, op
, part_width
, index
);
7283 /* Also handle conversion to an empty base class, which
7284 is represented with a NOP_EXPR. */
7285 else if (is_empty_class (type
)
7286 && CLASS_TYPE_P (optype
)
7287 && DERIVED_FROM_P (type
, optype
))
7292 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7293 else if (RECORD_OR_UNION_TYPE_P (optype
))
7295 tree field
= TYPE_FIELDS (optype
);
7296 for (; field
; field
= DECL_CHAIN (field
))
7297 if (TREE_CODE (field
) == FIELD_DECL
7298 && integer_zerop (byte_position (field
))
7299 && (same_type_ignoring_top_level_qualifiers_p
7300 (TREE_TYPE (field
), type
)))
7302 return fold_build3 (COMPONENT_REF
, type
, op
, field
, NULL_TREE
);
7307 else if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
7308 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
7310 tree op00
= TREE_OPERAND (sub
, 0);
7311 tree op01
= TREE_OPERAND (sub
, 1);
7314 if (TREE_CODE (op00
) == ADDR_EXPR
)
7317 op00
= TREE_OPERAND (op00
, 0);
7318 op00type
= TREE_TYPE (op00
);
7320 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7321 if (TREE_CODE (op00type
) == VECTOR_TYPE
7322 && (same_type_ignoring_top_level_qualifiers_p
7323 (type
, TREE_TYPE (op00type
))))
7325 HOST_WIDE_INT offset
= tree_low_cst (op01
, 0);
7326 tree part_width
= TYPE_SIZE (type
);
7327 unsigned HOST_WIDE_INT part_widthi
= tree_low_cst (part_width
, 0)/BITS_PER_UNIT
;
7328 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
7329 tree index
= bitsize_int (indexi
);
7331 if (offset
/part_widthi
<= TYPE_VECTOR_SUBPARTS (op00type
))
7332 return fold_build3_loc (loc
,
7333 BIT_FIELD_REF
, type
, op00
,
7337 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7338 else if (TREE_CODE (op00type
) == COMPLEX_TYPE
7339 && (same_type_ignoring_top_level_qualifiers_p
7340 (type
, TREE_TYPE (op00type
))))
7342 tree size
= TYPE_SIZE_UNIT (type
);
7343 if (tree_int_cst_equal (size
, op01
))
7344 return fold_build1_loc (loc
, IMAGPART_EXPR
, type
, op00
);
7346 /* ((foo *)&fooarray)[1] => fooarray[1] */
7347 else if (TREE_CODE (op00type
) == ARRAY_TYPE
7348 && (same_type_ignoring_top_level_qualifiers_p
7349 (type
, TREE_TYPE (op00type
))))
7351 tree type_domain
= TYPE_DOMAIN (op00type
);
7352 tree min_val
= size_zero_node
;
7353 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7354 min_val
= TYPE_MIN_VALUE (type_domain
);
7355 op01
= size_binop_loc (loc
, EXACT_DIV_EXPR
, op01
,
7356 TYPE_SIZE_UNIT (type
));
7357 op01
= size_binop_loc (loc
, PLUS_EXPR
, op01
, min_val
);
7358 return build4_loc (loc
, ARRAY_REF
, type
, op00
, op01
,
7359 NULL_TREE
, NULL_TREE
);
7361 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7362 else if (RECORD_OR_UNION_TYPE_P (op00type
))
7364 tree field
= TYPE_FIELDS (op00type
);
7365 for (; field
; field
= DECL_CHAIN (field
))
7366 if (TREE_CODE (field
) == FIELD_DECL
7367 && tree_int_cst_equal (byte_position (field
), op01
)
7368 && (same_type_ignoring_top_level_qualifiers_p
7369 (TREE_TYPE (field
), type
)))
7371 return fold_build3 (COMPONENT_REF
, type
, op00
,
7378 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7379 else if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
7380 && (same_type_ignoring_top_level_qualifiers_p
7381 (type
, TREE_TYPE (TREE_TYPE (subtype
)))))
7384 tree min_val
= size_zero_node
;
7385 sub
= cxx_fold_indirect_ref (loc
, TREE_TYPE (subtype
), sub
, NULL
);
7387 sub
= build1_loc (loc
, INDIRECT_REF
, TREE_TYPE (subtype
), sub
);
7388 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
7389 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
7390 min_val
= TYPE_MIN_VALUE (type_domain
);
7391 return build4_loc (loc
, ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
,
7399 cxx_eval_indirect_ref (const constexpr_call
*call
, tree t
,
7400 bool allow_non_constant
, bool addr
,
7401 bool *non_constant_p
)
7403 tree orig_op0
= TREE_OPERAND (t
, 0);
7404 tree op0
= cxx_eval_constant_expression (call
, orig_op0
, allow_non_constant
,
7405 /*addr*/false, non_constant_p
);
7406 bool empty_base
= false;
7409 /* Don't VERIFY_CONSTANT here. */
7410 if (*non_constant_p
)
7413 r
= cxx_fold_indirect_ref (EXPR_LOCATION (t
), TREE_TYPE (t
), op0
,
7417 r
= cxx_eval_constant_expression (call
, r
, allow_non_constant
,
7418 addr
, non_constant_p
);
7423 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
)
7425 sub
= TREE_OPERAND (sub
, 0);
7428 if (TREE_CODE (sub
) == ADDR_EXPR
)
7430 /* We couldn't fold to a constant value. Make sure it's not
7431 something we should have been able to fold. */
7432 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7433 (TREE_TYPE (TREE_TYPE (sub
)), TREE_TYPE (t
)));
7434 /* DR 1188 says we don't have to deal with this. */
7435 if (!allow_non_constant
)
7436 error ("accessing value of %qE through a %qT glvalue in a "
7437 "constant expression", build_fold_indirect_ref (sub
),
7439 *non_constant_p
= true;
7444 /* If we're pulling out the value of an empty base, make sure
7445 that the whole object is constant and then return an empty
7449 VERIFY_CONSTANT (r
);
7450 r
= build_constructor (TREE_TYPE (t
), NULL
);
7451 TREE_CONSTANT (r
) = true;
7459 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7460 Shared between potential_constant_expression and
7461 cxx_eval_constant_expression. */
7464 non_const_var_error (tree r
)
7466 tree type
= TREE_TYPE (r
);
7467 error ("the value of %qD is not usable in a constant "
7469 /* Avoid error cascade. */
7470 if (DECL_INITIAL (r
) == error_mark_node
)
7472 if (DECL_DECLARED_CONSTEXPR_P (r
))
7473 inform (DECL_SOURCE_LOCATION (r
),
7474 "%qD used in its own initializer", r
);
7475 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7477 if (!CP_TYPE_CONST_P (type
))
7478 inform (DECL_SOURCE_LOCATION (r
),
7479 "%q#D is not const", r
);
7480 else if (CP_TYPE_VOLATILE_P (type
))
7481 inform (DECL_SOURCE_LOCATION (r
),
7482 "%q#D is volatile", r
);
7483 else if (!DECL_INITIAL (r
)
7484 || !TREE_CONSTANT (DECL_INITIAL (r
)))
7485 inform (DECL_SOURCE_LOCATION (r
),
7486 "%qD was not initialized with a constant "
7493 if (cxx_dialect
>= cxx0x
&& !DECL_DECLARED_CONSTEXPR_P (r
))
7494 inform (DECL_SOURCE_LOCATION (r
),
7495 "%qD was not declared %<constexpr%>", r
);
7497 inform (DECL_SOURCE_LOCATION (r
),
7498 "%qD does not have integral or enumeration type",
7503 /* Evaluate VEC_PERM_EXPR (v1, v2, mask). */
7505 cxx_eval_vec_perm_expr (const constexpr_call
*call
, tree t
,
7506 bool allow_non_constant
, bool addr
,
7507 bool * non_constant_p
)
7512 tree elttype
= TREE_TYPE (t
);
7514 for (i
= 0; i
< 3; i
++)
7516 args
[i
] = cxx_eval_constant_expression (call
, TREE_OPERAND (t
, i
),
7517 allow_non_constant
, addr
,
7519 if (*non_constant_p
)
7523 gcc_assert (TREE_CODE (TREE_TYPE (args
[0])) == VECTOR_TYPE
);
7524 gcc_assert (TREE_CODE (TREE_TYPE (args
[1])) == VECTOR_TYPE
);
7525 gcc_assert (TREE_CODE (TREE_TYPE (args
[2])) == VECTOR_TYPE
);
7527 val
= fold_ternary_loc (EXPR_LOCATION (t
), VEC_PERM_EXPR
, elttype
,
7528 args
[0], args
[1], args
[2]);
7529 if (val
!= NULL_TREE
)
7536 /* Attempt to reduce the expression T to a constant value.
7537 On failure, issue diagnostic and return error_mark_node. */
7538 /* FIXME unify with c_fully_fold */
7541 cxx_eval_constant_expression (const constexpr_call
*call
, tree t
,
7542 bool allow_non_constant
, bool addr
,
7543 bool *non_constant_p
)
7547 if (t
== error_mark_node
)
7549 *non_constant_p
= true;
7552 if (CONSTANT_CLASS_P (t
))
7554 if (TREE_CODE (t
) == PTRMEM_CST
)
7555 t
= cplus_expand_constant (t
);
7558 if (TREE_CODE (t
) != NOP_EXPR
7559 && reduced_constant_expression_p (t
))
7562 switch (TREE_CODE (t
))
7567 /* else fall through. */
7569 r
= integral_constant_value (t
);
7570 if (TREE_CODE (r
) == TARGET_EXPR
7571 && TREE_CODE (TARGET_EXPR_INITIAL (r
)) == CONSTRUCTOR
)
7572 r
= TARGET_EXPR_INITIAL (r
);
7575 if (!allow_non_constant
)
7576 non_const_var_error (r
);
7577 *non_constant_p
= true;
7587 if (call
&& DECL_CONTEXT (t
) == call
->fundef
->decl
)
7589 if (DECL_ARTIFICIAL (t
) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t
)))
7591 if (!allow_non_constant
)
7592 sorry ("use of the value of the object being constructed "
7593 "in a constant expression");
7594 *non_constant_p
= true;
7597 r
= lookup_parameter_binding (call
, t
);
7600 /* Defer in case this is only used for its type. */;
7603 if (!allow_non_constant
)
7604 error ("%qE is not a constant expression", t
);
7605 *non_constant_p
= true;
7610 case AGGR_INIT_EXPR
:
7611 r
= cxx_eval_call_expression (call
, t
, allow_non_constant
, addr
,
7616 if (!literal_type_p (TREE_TYPE (t
)))
7618 if (!allow_non_constant
)
7620 error ("temporary of non-literal type %qT in a "
7621 "constant expression", TREE_TYPE (t
));
7622 explain_non_literal_class (TREE_TYPE (t
));
7624 *non_constant_p
= true;
7627 /* else fall through. */
7629 /* Pass false for 'addr' because these codes indicate
7630 initialization of a temporary. */
7631 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7632 allow_non_constant
, false,
7634 if (!*non_constant_p
)
7635 /* Adjust the type of the result to the type of the temporary. */
7636 r
= adjust_temp_type (TREE_TYPE (t
), r
);
7640 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 1),
7641 allow_non_constant
, addr
,
7646 case NON_LVALUE_EXPR
:
7647 case TRY_CATCH_EXPR
:
7648 case CLEANUP_POINT_EXPR
:
7649 case MUST_NOT_THROW_EXPR
:
7651 r
= cxx_eval_constant_expression (call
, TREE_OPERAND (t
, 0),
7652 allow_non_constant
, addr
,
7656 /* These differ from cxx_eval_unary_expression in that this doesn't
7657 check for a constant operand or result; an address can be
7658 constant without its operand being, and vice versa. */
7660 r
= cxx_eval_indirect_ref (call
, t
, allow_non_constant
, addr
,
7666 tree oldop
= TREE_OPERAND (t
, 0);
7667 tree op
= cxx_eval_constant_expression (call
, oldop
,
7671 /* Don't VERIFY_CONSTANT here. */
7672 if (*non_constant_p
)
7674 /* This function does more aggressive folding than fold itself. */
7675 r
= build_fold_addr_expr_with_type (op
, TREE_TYPE (t
));
7676 if (TREE_CODE (r
) == ADDR_EXPR
&& TREE_OPERAND (r
, 0) == oldop
)
7684 case FIX_TRUNC_EXPR
:
7689 case TRUTH_NOT_EXPR
:
7690 case FIXED_CONVERT_EXPR
:
7691 r
= cxx_eval_unary_expression (call
, t
, allow_non_constant
, addr
,
7697 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7698 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7699 introduced by build_call_a. */
7700 tree op0
= TREE_OPERAND (t
, 0);
7701 tree op1
= TREE_OPERAND (t
, 1);
7703 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
7704 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
7705 r
= cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7706 addr
, non_constant_p
);
7709 /* Check that the LHS is constant and then discard it. */
7710 cxx_eval_constant_expression (call
, op0
, allow_non_constant
,
7711 false, non_constant_p
);
7712 r
= cxx_eval_constant_expression (call
, op1
, allow_non_constant
,
7713 addr
, non_constant_p
);
7718 case POINTER_PLUS_EXPR
:
7722 case TRUNC_DIV_EXPR
:
7724 case FLOOR_DIV_EXPR
:
7725 case ROUND_DIV_EXPR
:
7726 case TRUNC_MOD_EXPR
:
7728 case ROUND_MOD_EXPR
:
7730 case EXACT_DIV_EXPR
:
7740 case TRUTH_XOR_EXPR
:
7747 case UNORDERED_EXPR
:
7756 r
= cxx_eval_binary_expression (call
, t
, allow_non_constant
, addr
,
7760 /* fold can introduce non-IF versions of these; still treat them as
7761 short-circuiting. */
7762 case TRUTH_AND_EXPR
:
7763 case TRUTH_ANDIF_EXPR
:
7764 r
= cxx_eval_logical_expression (call
, t
, boolean_false_node
,
7766 allow_non_constant
, addr
,
7771 case TRUTH_ORIF_EXPR
:
7772 r
= cxx_eval_logical_expression (call
, t
, boolean_true_node
,
7774 allow_non_constant
, addr
,
7779 r
= cxx_eval_array_reference (call
, t
, allow_non_constant
, addr
,
7784 r
= cxx_eval_component_reference (call
, t
, allow_non_constant
, addr
,
7789 r
= cxx_eval_bit_field_ref (call
, t
, allow_non_constant
, addr
,
7795 r
= cxx_eval_conditional_expression (call
, t
, allow_non_constant
, addr
,
7800 r
= cxx_eval_bare_aggregate (call
, t
, allow_non_constant
, addr
,
7805 /* We can get this in a defaulted constructor for a class with a
7806 non-static data member of array type. Either the initializer will
7807 be NULL, meaning default-initialization, or it will be an lvalue
7808 or xvalue of the same type, meaning direct-initialization from the
7809 corresponding member. */
7810 r
= cxx_eval_vec_init (call
, t
, allow_non_constant
, addr
,
7815 r
= cxx_eval_vec_perm_expr (call
, t
, allow_non_constant
, addr
,
7820 case VIEW_CONVERT_EXPR
:
7823 tree oldop
= TREE_OPERAND (t
, 0);
7824 tree op
= cxx_eval_constant_expression (call
, oldop
,
7825 allow_non_constant
, addr
,
7827 if (*non_constant_p
)
7830 /* We didn't fold at the top so we could check for ptr-int
7833 r
= fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), op
);
7834 /* Conversion of an out-of-range value has implementation-defined
7835 behavior; the language considers it different from arithmetic
7836 overflow, which is undefined. */
7837 if (TREE_OVERFLOW_P (r
) && !TREE_OVERFLOW_P (op
))
7838 TREE_OVERFLOW (r
) = false;
7842 case EMPTY_CLASS_EXPR
:
7843 /* This is good enough for a function argument that might not get
7844 used, and they can't do anything with it, so just return it. */
7848 case PREINCREMENT_EXPR
:
7849 case POSTINCREMENT_EXPR
:
7850 case PREDECREMENT_EXPR
:
7851 case POSTDECREMENT_EXPR
:
7855 case VEC_DELETE_EXPR
:
7859 /* GCC internal stuff. */
7862 case WITH_CLEANUP_EXPR
:
7863 case STATEMENT_LIST
:
7865 case NON_DEPENDENT_EXPR
:
7869 if (!allow_non_constant
)
7870 error_at (EXPR_LOC_OR_HERE (t
),
7871 "expression %qE is not a constant-expression", t
);
7872 *non_constant_p
= true;
7876 internal_error ("unexpected expression %qE of kind %s", t
,
7877 tree_code_name
[TREE_CODE (t
)]);
7878 *non_constant_p
= true;
7882 if (r
== error_mark_node
)
7883 *non_constant_p
= true;
7885 if (*non_constant_p
)
7892 cxx_eval_outermost_constant_expr (tree t
, bool allow_non_constant
)
7894 bool non_constant_p
= false;
7895 tree r
= cxx_eval_constant_expression (NULL
, t
, allow_non_constant
,
7896 false, &non_constant_p
);
7898 verify_constant (r
, allow_non_constant
, &non_constant_p
);
7900 if (TREE_CODE (t
) != CONSTRUCTOR
7901 && cp_has_mutable_p (TREE_TYPE (t
)))
7903 /* We allow a mutable type if the original expression was a
7904 CONSTRUCTOR so that we can do aggregate initialization of
7905 constexpr variables. */
7906 if (!allow_non_constant
)
7907 error ("%qT cannot be the type of a complete constant expression "
7908 "because it has mutable sub-objects", TREE_TYPE (t
));
7909 non_constant_p
= true;
7912 /* Technically we should check this for all subexpressions, but that
7913 runs into problems with our internal representation of pointer
7914 subtraction and the 5.19 rules are still in flux. */
7915 if (CONVERT_EXPR_CODE_P (TREE_CODE (r
))
7916 && ARITHMETIC_TYPE_P (TREE_TYPE (r
))
7917 && TREE_CODE (TREE_OPERAND (r
, 0)) == ADDR_EXPR
)
7919 if (!allow_non_constant
)
7920 error ("conversion from pointer type %qT "
7921 "to arithmetic type %qT in a constant-expression",
7922 TREE_TYPE (TREE_OPERAND (r
, 0)), TREE_TYPE (r
));
7923 non_constant_p
= true;
7926 if (non_constant_p
&& !allow_non_constant
)
7927 return error_mark_node
;
7928 else if (non_constant_p
&& TREE_CONSTANT (t
))
7930 /* This isn't actually constant, so unset TREE_CONSTANT. */
7931 if (EXPR_P (t
) || TREE_CODE (t
) == CONSTRUCTOR
)
7934 r
= build_nop (TREE_TYPE (t
), t
);
7935 TREE_CONSTANT (r
) = false;
7938 else if (non_constant_p
|| r
== t
)
7940 else if (TREE_CODE (r
) == CONSTRUCTOR
&& CLASS_TYPE_P (TREE_TYPE (r
)))
7942 if (TREE_CODE (t
) == TARGET_EXPR
7943 && TARGET_EXPR_INITIAL (t
) == r
)
7947 r
= get_target_expr (r
);
7948 TREE_CONSTANT (r
) = true;
7956 /* Returns true if T is a valid subexpression of a constant expression,
7957 even if it isn't itself a constant expression. */
7960 is_sub_constant_expr (tree t
)
7962 bool non_constant_p
= false;
7963 cxx_eval_constant_expression (NULL
, t
, true, false, &non_constant_p
);
7964 return !non_constant_p
;
7967 /* If T represents a constant expression returns its reduced value.
7968 Otherwise return error_mark_node. If T is dependent, then
7972 cxx_constant_value (tree t
)
7974 return cxx_eval_outermost_constant_expr (t
, false);
7977 /* If T is a constant expression, returns its reduced value.
7978 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7979 Otherwise, returns a version of T without TREE_CONSTANT. */
7982 maybe_constant_value (tree t
)
7986 if (type_dependent_expression_p (t
)
7987 || type_unknown_p (t
)
7988 || BRACE_ENCLOSED_INITIALIZER_P (t
)
7989 || !potential_constant_expression (t
)
7990 || value_dependent_expression_p (t
))
7992 if (TREE_OVERFLOW_P (t
))
7994 t
= build_nop (TREE_TYPE (t
), t
);
7995 TREE_CONSTANT (t
) = false;
8000 r
= cxx_eval_outermost_constant_expr (t
, true);
8001 #ifdef ENABLE_CHECKING
8002 /* cp_tree_equal looks through NOPs, so allow them. */
8004 || CONVERT_EXPR_P (t
)
8005 || (TREE_CONSTANT (t
) && !TREE_CONSTANT (r
))
8006 || !cp_tree_equal (r
, t
));
8011 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
8012 than wrapped in a TARGET_EXPR. */
8015 maybe_constant_init (tree t
)
8017 t
= maybe_constant_value (t
);
8018 if (TREE_CODE (t
) == TARGET_EXPR
)
8020 tree init
= TARGET_EXPR_INITIAL (t
);
8021 if (TREE_CODE (init
) == CONSTRUCTOR
8022 && TREE_CONSTANT (init
))
8029 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
8030 /* Return true if the object referred to by REF has automatic or thread
8033 enum { ck_ok
, ck_bad
, ck_unknown
};
8035 check_automatic_or_tls (tree ref
)
8037 enum machine_mode mode
;
8038 HOST_WIDE_INT bitsize
, bitpos
;
8040 int volatilep
= 0, unsignedp
= 0;
8041 tree decl
= get_inner_reference (ref
, &bitsize
, &bitpos
, &offset
,
8042 &mode
, &unsignedp
, &volatilep
, false);
8045 /* If there isn't a decl in the middle, we don't know the linkage here,
8046 and this isn't a constant expression anyway. */
8049 dk
= decl_storage_duration (decl
);
8050 return (dk
== dk_auto
|| dk
== dk_thread
) ? ck_bad
: ck_ok
;
8054 /* Return true if T denotes a potentially constant expression. Issue
8055 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
8056 an lvalue-rvalue conversion is implied.
8058 C++0x [expr.const] used to say
8060 6 An expression is a potential constant expression if it is
8061 a constant expression where all occurences of function
8062 parameters are replaced by arbitrary constant expressions
8063 of the appropriate type.
8065 2 A conditional expression is a constant expression unless it
8066 involves one of the following as a potentially evaluated
8067 subexpression (3.2), but subexpressions of logical AND (5.14),
8068 logical OR (5.15), and conditional (5.16) operations that are
8069 not evaluated are not considered. */
8072 potential_constant_expression_1 (tree t
, bool want_rval
, tsubst_flags_t flags
)
8074 enum { any
= false, rval
= true };
8078 /* C++98 has different rules for the form of a constant expression that
8079 are enforced in the parser, so we can assume that anything that gets
8080 this far is suitable. */
8081 if (cxx_dialect
< cxx0x
)
8084 if (t
== error_mark_node
)
8088 if (TREE_THIS_VOLATILE (t
))
8090 if (flags
& tf_error
)
8091 error ("expression %qE has side-effects", t
);
8094 if (CONSTANT_CLASS_P (t
))
8096 if (TREE_OVERFLOW (t
))
8098 if (flags
& tf_error
)
8100 permerror (EXPR_LOC_OR_HERE (t
),
8101 "overflow in constant expression");
8102 if (flag_permissive
)
8110 switch (TREE_CODE (t
))
8116 case TEMPLATE_ID_EXPR
:
8123 case TEMPLATE_PARM_INDEX
:
8125 case IDENTIFIER_NODE
:
8126 case USERDEF_LITERAL
:
8127 /* We can see a FIELD_DECL in a pointer-to-member expression. */
8133 case AGGR_INIT_EXPR
:
8135 /* -- an invocation of a function other than a constexpr function
8136 or a constexpr constructor. */
8138 tree fun
= get_function_named_in_call (t
);
8139 const int nargs
= call_expr_nargs (t
);
8142 if (is_overloaded_fn (fun
))
8144 if (TREE_CODE (fun
) == FUNCTION_DECL
)
8146 if (builtin_valid_in_constant_expr_p (fun
))
8148 if (!DECL_DECLARED_CONSTEXPR_P (fun
)
8149 /* Allow any built-in function; if the expansion
8150 isn't constant, we'll deal with that then. */
8151 && !is_builtin_fn (fun
))
8153 if (flags
& tf_error
)
8155 error_at (EXPR_LOC_OR_HERE (t
),
8156 "call to non-constexpr function %qD", fun
);
8157 explain_invalid_constexpr_fn (fun
);
8161 /* A call to a non-static member function takes the address
8162 of the object as the first argument. But in a constant
8163 expression the address will be folded away, so look
8165 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun
)
8166 && !DECL_CONSTRUCTOR_P (fun
))
8168 tree x
= get_nth_callarg (t
, 0);
8169 if (is_this_parameter (x
))
8171 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8173 if (flags
& tf_error
)
8174 sorry ("calling a member function of the "
8175 "object being constructed in a constant "
8179 /* Otherwise OK. */;
8181 else if (!potential_constant_expression_1 (x
, rval
, flags
))
8187 fun
= get_first_fn (fun
);
8188 /* Skip initial arguments to base constructors. */
8189 if (DECL_BASE_CONSTRUCTOR_P (fun
))
8190 i
= num_artificial_parms_for (fun
);
8191 fun
= DECL_ORIGIN (fun
);
8195 if (potential_constant_expression_1 (fun
, rval
, flags
))
8196 /* Might end up being a constant function pointer. */;
8200 for (; i
< nargs
; ++i
)
8202 tree x
= get_nth_callarg (t
, i
);
8203 if (!potential_constant_expression_1 (x
, rval
, flags
))
8209 case NON_LVALUE_EXPR
:
8210 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
8211 -- an lvalue of integral type that refers to a non-volatile
8212 const variable or static data member initialized with
8213 constant expressions, or
8215 -- an lvalue of literal type that refers to non-volatile
8216 object defined with constexpr, or that refers to a
8217 sub-object of such an object; */
8218 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
, flags
);
8221 if (want_rval
&& !decl_constant_var_p (t
)
8222 && !dependent_type_p (TREE_TYPE (t
)))
8224 if (flags
& tf_error
)
8225 non_const_var_error (t
);
8232 case VIEW_CONVERT_EXPR
:
8233 /* -- a reinterpret_cast. FIXME not implemented, and this rule
8234 may change to something more specific to type-punning (DR 1312). */
8236 tree from
= TREE_OPERAND (t
, 0);
8237 return (potential_constant_expression_1
8238 (from
, TREE_CODE (t
) != VIEW_CONVERT_EXPR
, flags
));
8242 /* -- a unary operator & that is applied to an lvalue that
8243 designates an object with thread or automatic storage
8245 t
= TREE_OPERAND (t
, 0);
8247 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8248 any checking here, as we might dereference the pointer later. If
8249 we remove this code, also remove check_automatic_or_tls. */
8250 i
= check_automatic_or_tls (t
);
8255 if (flags
& tf_error
)
8256 error ("address-of an object %qE with thread local or "
8257 "automatic storage is not a constant expression", t
);
8261 return potential_constant_expression_1 (t
, any
, flags
);
8267 /* -- a class member access unless its postfix-expression is
8268 of literal type or of pointer to literal type. */
8269 /* This test would be redundant, as it follows from the
8270 postfix-expression being a potential constant expression. */
8271 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8274 case EXPR_PACK_EXPANSION
:
8275 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t
),
8280 tree x
= TREE_OPERAND (t
, 0);
8282 if (is_this_parameter (x
))
8284 if (want_rval
&& DECL_CONTEXT (x
)
8285 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x
)))
8287 if (flags
& tf_error
)
8288 sorry ("use of the value of the object being constructed "
8289 "in a constant expression");
8294 return potential_constant_expression_1 (x
, rval
, flags
);
8298 case DYNAMIC_CAST_EXPR
:
8299 case PSEUDO_DTOR_EXPR
:
8300 case PREINCREMENT_EXPR
:
8301 case POSTINCREMENT_EXPR
:
8302 case PREDECREMENT_EXPR
:
8303 case POSTDECREMENT_EXPR
:
8307 case VEC_DELETE_EXPR
:
8311 /* GCC internal stuff. */
8314 case WITH_CLEANUP_EXPR
:
8315 case CLEANUP_POINT_EXPR
:
8316 case MUST_NOT_THROW_EXPR
:
8317 case TRY_CATCH_EXPR
:
8318 case STATEMENT_LIST
:
8319 /* Don't bother trying to define a subset of statement-expressions to
8320 be constant-expressions, at least for now. */
8324 case TRANSACTION_EXPR
:
8329 if (flags
& tf_error
)
8330 error ("expression %qE is not a constant-expression", t
);
8334 /* -- a typeid expression whose operand is of polymorphic
8337 tree e
= TREE_OPERAND (t
, 0);
8338 if (!TYPE_P (e
) && !type_dependent_expression_p (e
)
8339 && TYPE_POLYMORPHIC_P (TREE_TYPE (e
)))
8341 if (flags
& tf_error
)
8342 error ("typeid-expression is not a constant expression "
8343 "because %qE is of polymorphic type", e
);
8350 /* -- a subtraction where both operands are pointers. */
8351 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8352 && TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8354 if (flags
& tf_error
)
8355 error ("difference of two pointer expressions is not "
8356 "a constant expression");
8368 /* -- a relational or equality operator where at least
8369 one of the operands is a pointer. */
8370 if (TYPE_PTR_P (TREE_OPERAND (t
, 0))
8371 || TYPE_PTR_P (TREE_OPERAND (t
, 1)))
8373 if (flags
& tf_error
)
8374 error ("pointer comparison expression is not a "
8375 "constant expression");
8383 if (TYPE_P (TREE_OPERAND (t
, 0)))
8385 /* else fall through. */
8391 case FIX_TRUNC_EXPR
:
8395 case TRUTH_NOT_EXPR
:
8396 case FIXED_CONVERT_EXPR
:
8397 case UNARY_PLUS_EXPR
:
8398 return potential_constant_expression_1 (TREE_OPERAND (t
, 0), rval
,
8402 case CONST_CAST_EXPR
:
8403 case STATIC_CAST_EXPR
:
8404 case REINTERPRET_CAST_EXPR
:
8405 case IMPLICIT_CONV_EXPR
:
8406 return (potential_constant_expression_1
8407 (TREE_OPERAND (t
, 0),
8408 TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
, flags
));
8411 case NON_DEPENDENT_EXPR
:
8412 /* For convenience. */
8414 return potential_constant_expression_1 (TREE_OPERAND (t
, 0),
8418 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8422 if (!literal_type_p (TREE_TYPE (t
)))
8424 if (flags
& tf_error
)
8426 error ("temporary of non-literal type %qT in a "
8427 "constant expression", TREE_TYPE (t
));
8428 explain_non_literal_class (TREE_TYPE (t
));
8433 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8438 VEC(constructor_elt
, gc
) *v
= CONSTRUCTOR_ELTS (t
);
8439 constructor_elt
*ce
;
8440 for (i
= 0; VEC_iterate (constructor_elt
, v
, i
, ce
); ++i
)
8441 if (!potential_constant_expression_1 (ce
->value
, want_rval
, flags
))
8448 gcc_assert (TREE_PURPOSE (t
) == NULL_TREE
8449 || DECL_P (TREE_PURPOSE (t
)));
8450 if (!potential_constant_expression_1 (TREE_VALUE (t
), want_rval
,
8453 if (TREE_CHAIN (t
) == NULL_TREE
)
8455 return potential_constant_expression_1 (TREE_CHAIN (t
), want_rval
,
8459 case TRUNC_DIV_EXPR
:
8461 case FLOOR_DIV_EXPR
:
8462 case ROUND_DIV_EXPR
:
8463 case TRUNC_MOD_EXPR
:
8465 case ROUND_MOD_EXPR
:
8467 tree denom
= TREE_OPERAND (t
, 1);
8468 /* We can't call maybe_constant_value on an expression
8469 that hasn't been through fold_non_dependent_expr yet. */
8470 if (!processing_template_decl
)
8471 denom
= maybe_constant_value (denom
);
8472 if (integer_zerop (denom
))
8474 if (flags
& tf_error
)
8475 error ("division by zero is not a constant-expression");
8487 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8488 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8489 introduced by build_call_a. */
8490 tree op0
= TREE_OPERAND (t
, 0);
8491 tree op1
= TREE_OPERAND (t
, 1);
8493 if ((TREE_CODE (op0
) == TARGET_EXPR
&& op1
== TARGET_EXPR_SLOT (op0
))
8494 || TREE_CODE (op1
) == EMPTY_CLASS_EXPR
)
8495 return potential_constant_expression_1 (op0
, want_rval
, flags
);
8500 /* If the first operand is the non-short-circuit constant, look at
8501 the second operand; otherwise we only care about the first one for
8503 case TRUTH_AND_EXPR
:
8504 case TRUTH_ANDIF_EXPR
:
8505 tmp
= boolean_true_node
;
8508 case TRUTH_ORIF_EXPR
:
8509 tmp
= boolean_false_node
;
8512 tree op
= TREE_OPERAND (t
, 0);
8513 if (!potential_constant_expression_1 (op
, rval
, flags
))
8515 if (!processing_template_decl
)
8516 op
= maybe_constant_value (op
);
8517 if (tree_int_cst_equal (op
, tmp
))
8518 return potential_constant_expression_1 (TREE_OPERAND (t
, 1), rval
, flags
);
8525 case POINTER_PLUS_EXPR
:
8527 case EXACT_DIV_EXPR
:
8537 case TRUTH_XOR_EXPR
:
8538 case UNORDERED_EXPR
:
8551 case ARRAY_RANGE_REF
:
8555 for (i
= 0; i
< 2; ++i
)
8556 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8563 for (i
= 0; i
< 3; ++i
)
8564 if (!potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8571 /* If the condition is a known constant, we know which of the legs we
8572 care about; otherwise we only require that the condition and
8573 either of the legs be potentially constant. */
8574 tmp
= TREE_OPERAND (t
, 0);
8575 if (!potential_constant_expression_1 (tmp
, rval
, flags
))
8577 if (!processing_template_decl
)
8578 tmp
= maybe_constant_value (tmp
);
8579 if (integer_zerop (tmp
))
8580 return potential_constant_expression_1 (TREE_OPERAND (t
, 2),
8582 else if (TREE_CODE (tmp
) == INTEGER_CST
)
8583 return potential_constant_expression_1 (TREE_OPERAND (t
, 1),
8585 for (i
= 1; i
< 3; ++i
)
8586 if (potential_constant_expression_1 (TREE_OPERAND (t
, i
),
8587 want_rval
, tf_none
))
8589 if (flags
& tf_error
)
8590 error ("expression %qE is not a constant-expression", t
);
8594 if (VEC_INIT_EXPR_IS_CONSTEXPR (t
))
8596 if (flags
& tf_error
)
8598 error ("non-constant array initialization");
8599 diagnose_non_constexpr_vec_init (t
);
8604 sorry ("unexpected AST of kind %s", tree_code_name
[TREE_CODE (t
)]);
8610 /* The main entry point to the above. */
8613 potential_constant_expression (tree t
)
8615 return potential_constant_expression_1 (t
, false, tf_none
);
8618 /* As above, but require a constant rvalue. */
8621 potential_rvalue_constant_expression (tree t
)
8623 return potential_constant_expression_1 (t
, true, tf_none
);
8626 /* Like above, but complain about non-constant expressions. */
8629 require_potential_constant_expression (tree t
)
8631 return potential_constant_expression_1 (t
, false, tf_warning_or_error
);
8634 /* Cross product of the above. */
8637 require_potential_rvalue_constant_expression (tree t
)
8639 return potential_constant_expression_1 (t
, true, tf_warning_or_error
);
8642 /* Constructor for a lambda expression. */
8645 build_lambda_expr (void)
8647 tree lambda
= make_node (LAMBDA_EXPR
);
8648 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
8649 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
8650 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
8651 LAMBDA_EXPR_PENDING_PROXIES (lambda
) = NULL
;
8652 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
8653 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
8657 /* Create the closure object for a LAMBDA_EXPR. */
8660 build_lambda_object (tree lambda_expr
)
8662 /* Build aggregate constructor call.
8663 - cp_parser_braced_list
8664 - cp_parser_functional_cast */
8665 VEC(constructor_elt
,gc
) *elts
= NULL
;
8666 tree node
, expr
, type
;
8667 location_t saved_loc
;
8669 if (processing_template_decl
)
8672 /* Make sure any error messages refer to the lambda-introducer. */
8673 saved_loc
= input_location
;
8674 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
8676 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
8678 node
= TREE_CHAIN (node
))
8680 tree field
= TREE_PURPOSE (node
);
8681 tree val
= TREE_VALUE (node
);
8683 if (field
== error_mark_node
)
8685 expr
= error_mark_node
;
8692 /* Mere mortals can't copy arrays with aggregate initialization, so
8693 do some magic to make it work here. */
8694 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
8695 val
= build_array_copy (val
);
8696 else if (DECL_NORMAL_CAPTURE_P (field
)
8697 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
8699 /* "the entities that are captured by copy are used to
8700 direct-initialize each corresponding non-static data
8701 member of the resulting closure object."
8703 There's normally no way to express direct-initialization
8704 from an element of a CONSTRUCTOR, so we build up a special
8705 TARGET_EXPR to bypass the usual copy-initialization. */
8706 val
= force_rvalue (val
, tf_warning_or_error
);
8707 if (TREE_CODE (val
) == TARGET_EXPR
)
8708 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
8711 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
8714 expr
= build_constructor (init_list_type_node
, elts
);
8715 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
8717 /* N2927: "[The closure] class type is not an aggregate."
8718 But we briefly treat it as an aggregate to make this simpler. */
8719 type
= LAMBDA_EXPR_CLOSURE (lambda_expr
);
8720 CLASSTYPE_NON_AGGREGATE (type
) = 0;
8721 expr
= finish_compound_literal (type
, expr
, tf_warning_or_error
);
8722 CLASSTYPE_NON_AGGREGATE (type
) = 1;
8725 input_location
= saved_loc
;
8729 /* Return an initialized RECORD_TYPE for LAMBDA.
8730 LAMBDA must have its explicit captures already. */
8733 begin_lambda_type (tree lambda
)
8738 /* Unique name. This is just like an unnamed class, but we cannot use
8739 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8741 name
= make_lambda_name ();
8743 /* Create the new RECORD_TYPE for this lambda. */
8744 type
= xref_tag (/*tag_code=*/record_type
,
8746 /*scope=*/ts_within_enclosing_non_class
,
8747 /*template_header_p=*/false);
8750 /* Designate it as a struct so that we can use aggregate initialization. */
8751 CLASSTYPE_DECLARED_CLASS (type
) = false;
8753 /* Clear base types. */
8754 xref_basetypes (type
, /*bases=*/NULL_TREE
);
8756 /* Start the class. */
8757 type
= begin_class_definition (type
);
8758 if (type
== error_mark_node
)
8759 return error_mark_node
;
8761 /* Cross-reference the expression and the type. */
8762 LAMBDA_EXPR_CLOSURE (lambda
) = type
;
8763 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
8768 /* Returns the type to use for the return type of the operator() of a
8772 lambda_return_type (tree expr
)
8774 if (expr
== NULL_TREE
)
8775 return void_type_node
;
8776 if (type_unknown_p (expr
)
8777 || BRACE_ENCLOSED_INITIALIZER_P (expr
))
8779 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
8780 return void_type_node
;
8782 gcc_checking_assert (!type_dependent_expression_p (expr
));
8783 return cv_unqualified (type_decays_to (unlowered_expr_type (expr
)));
8786 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8790 lambda_function (tree lambda
)
8793 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
8794 type
= LAMBDA_EXPR_CLOSURE (lambda
);
8797 gcc_assert (LAMBDA_TYPE_P (type
));
8798 /* Don't let debug_tree cause instantiation. */
8799 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
8800 && !COMPLETE_OR_OPEN_TYPE_P (type
))
8802 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
8803 /*protect=*/0, /*want_type=*/false,
8804 tf_warning_or_error
);
8806 lambda
= BASELINK_FUNCTIONS (lambda
);
8810 /* Returns the type to use for the FIELD_DECL corresponding to the
8812 The caller should add REFERENCE_TYPE for capture by reference. */
8815 lambda_capture_field_type (tree expr
)
8818 if (type_dependent_expression_p (expr
))
8820 type
= cxx_make_type (DECLTYPE_TYPE
);
8821 DECLTYPE_TYPE_EXPR (type
) = expr
;
8822 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
8823 SET_TYPE_STRUCTURAL_EQUALITY (type
);
8826 type
= non_reference (unlowered_expr_type (expr
));
8830 /* Insert the deduced return type for an auto function. */
8833 apply_deduced_return_type (tree fco
, tree return_type
)
8837 if (return_type
== error_mark_node
)
8840 if (LAMBDA_FUNCTION_P (fco
))
8842 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
8843 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
8846 if (DECL_CONV_FN_P (fco
))
8847 DECL_NAME (fco
) = mangle_conv_op_name_for_type (return_type
);
8849 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
8851 result
= DECL_RESULT (fco
);
8852 if (result
== NULL_TREE
)
8854 if (TREE_TYPE (result
) == return_type
)
8857 /* We already have a DECL_RESULT from start_preparsed_function.
8858 Now we need to redo the work it and allocate_struct_function
8859 did to reflect the new type. */
8860 gcc_assert (current_function_decl
== fco
);
8861 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
8862 TYPE_MAIN_VARIANT (return_type
));
8863 DECL_ARTIFICIAL (result
) = 1;
8864 DECL_IGNORED_P (result
) = 1;
8865 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
8868 DECL_RESULT (fco
) = result
;
8870 if (!processing_template_decl
)
8872 bool aggr
= aggregate_value_p (result
, fco
);
8873 #ifdef PCC_STATIC_STRUCT_RETURN
8874 cfun
->returns_pcc_struct
= aggr
;
8876 cfun
->returns_struct
= aggr
;
8881 /* DECL is a local variable or parameter from the surrounding scope of a
8882 lambda-expression. Returns the decltype for a use of the capture field
8883 for DECL even if it hasn't been captured yet. */
8886 capture_decltype (tree decl
)
8888 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
8889 /* FIXME do lookup instead of list walk? */
8890 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
8894 type
= TREE_TYPE (TREE_PURPOSE (cap
));
8896 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
8899 error ("%qD is not captured", decl
);
8900 return error_mark_node
;
8903 type
= TREE_TYPE (decl
);
8904 if (TREE_CODE (type
) == REFERENCE_TYPE
8905 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
8906 type
= TREE_TYPE (type
);
8909 case CPLD_REFERENCE
:
8910 type
= TREE_TYPE (decl
);
8911 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8912 type
= build_reference_type (TREE_TYPE (decl
));
8919 if (TREE_CODE (type
) != REFERENCE_TYPE
)
8921 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
8922 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
8924 type
= build_reference_type (type
);
8929 /* Returns true iff DECL is a lambda capture proxy variable created by
8930 build_capture_proxy. */
8933 is_capture_proxy (tree decl
)
8935 return (TREE_CODE (decl
) == VAR_DECL
8936 && DECL_HAS_VALUE_EXPR_P (decl
)
8937 && !DECL_ANON_UNION_VAR_P (decl
)
8938 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl
)));
8941 /* Returns true iff DECL is a capture proxy for a normal capture
8942 (i.e. without explicit initializer). */
8945 is_normal_capture_proxy (tree decl
)
8949 if (!is_capture_proxy (decl
))
8950 /* It's not a capture proxy. */
8953 /* It is a capture proxy, is it a normal capture? */
8954 val
= DECL_VALUE_EXPR (decl
);
8955 gcc_assert (TREE_CODE (val
) == COMPONENT_REF
);
8956 val
= TREE_OPERAND (val
, 1);
8957 return DECL_NORMAL_CAPTURE_P (val
);
8960 /* VAR is a capture proxy created by build_capture_proxy; add it to the
8961 current function, which is the operator() for the appropriate lambda. */
8964 insert_capture_proxy (tree var
)
8966 cp_binding_level
*b
;
8970 /* Put the capture proxy in the extra body block so that it won't clash
8971 with a later local variable. */
8972 b
= current_binding_level
;
8973 for (skip
= 0; ; ++skip
)
8975 cp_binding_level
*n
= b
->level_chain
;
8976 if (n
->kind
== sk_function_parms
)
8980 pushdecl_with_scope (var
, b
, false);
8982 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
8983 var
= build_stmt (DECL_SOURCE_LOCATION (var
), DECL_EXPR
, var
);
8984 stmt_list
= VEC_index (tree
, stmt_list_stack
,
8985 VEC_length (tree
, stmt_list_stack
) - 1 - skip
);
8986 gcc_assert (stmt_list
);
8987 append_to_statement_list_force (var
, &stmt_list
);
8990 /* We've just finished processing a lambda; if the containing scope is also
8991 a lambda, insert any capture proxies that were created while processing
8992 the nested lambda. */
8995 insert_pending_capture_proxies (void)
8998 VEC(tree
,gc
) *proxies
;
9001 if (!current_function_decl
|| !LAMBDA_FUNCTION_P (current_function_decl
))
9004 lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
9005 proxies
= LAMBDA_EXPR_PENDING_PROXIES (lam
);
9006 for (i
= 0; i
< VEC_length (tree
, proxies
); ++i
)
9008 tree var
= VEC_index (tree
, proxies
, i
);
9009 insert_capture_proxy (var
);
9011 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam
));
9012 LAMBDA_EXPR_PENDING_PROXIES (lam
) = NULL
;
9015 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
9016 return the type we want the proxy to have: the type of the field itself,
9017 with added const-qualification if the lambda isn't mutable and the
9018 capture is by value. */
9021 lambda_proxy_type (tree ref
)
9024 if (REFERENCE_REF_P (ref
))
9025 ref
= TREE_OPERAND (ref
, 0);
9026 type
= TREE_TYPE (ref
);
9027 if (!dependent_type_p (type
))
9029 type
= cxx_make_type (DECLTYPE_TYPE
);
9030 DECLTYPE_TYPE_EXPR (type
) = ref
;
9031 DECLTYPE_FOR_LAMBDA_PROXY (type
) = true;
9032 SET_TYPE_STRUCTURAL_EQUALITY (type
);
9036 /* MEMBER is a capture field in a lambda closure class. Now that we're
9037 inside the operator(), build a placeholder var for future lookups and
9041 build_capture_proxy (tree member
)
9043 tree var
, object
, fn
, closure
, name
, lam
, type
;
9045 closure
= DECL_CONTEXT (member
);
9046 fn
= lambda_function (closure
);
9047 lam
= CLASSTYPE_LAMBDA_EXPR (closure
);
9049 /* The proxy variable forwards to the capture field. */
9050 object
= build_fold_indirect_ref (DECL_ARGUMENTS (fn
));
9051 object
= finish_non_static_data_member (member
, object
, NULL_TREE
);
9052 if (REFERENCE_REF_P (object
))
9053 object
= TREE_OPERAND (object
, 0);
9055 /* Remove the __ inserted by add_capture. */
9056 name
= get_identifier (IDENTIFIER_POINTER (DECL_NAME (member
)) + 2);
9058 type
= lambda_proxy_type (object
);
9059 var
= build_decl (input_location
, VAR_DECL
, name
, type
);
9060 SET_DECL_VALUE_EXPR (var
, object
);
9061 DECL_HAS_VALUE_EXPR_P (var
) = 1;
9062 DECL_ARTIFICIAL (var
) = 1;
9063 TREE_USED (var
) = 1;
9064 DECL_CONTEXT (var
) = fn
;
9066 if (name
== this_identifier
)
9068 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam
) == member
);
9069 LAMBDA_EXPR_THIS_CAPTURE (lam
) = var
;
9072 if (fn
== current_function_decl
)
9073 insert_capture_proxy (var
);
9075 VEC_safe_push (tree
, gc
, LAMBDA_EXPR_PENDING_PROXIES (lam
), var
);
9080 /* From an ID and INITIALIZER, create a capture (by reference if
9081 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
9085 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
9086 bool explicit_init_p
)
9089 tree type
, member
, name
;
9091 type
= lambda_capture_field_type (initializer
);
9094 type
= build_reference_type (type
);
9095 if (!real_lvalue_p (initializer
))
9096 error ("cannot capture %qE by reference", initializer
);
9099 /* Capture by copy requires a complete type. */
9100 type
= complete_type (type
);
9102 /* Add __ to the beginning of the field name so that user code
9103 won't find the field with name lookup. We can't just leave the name
9104 unset because template instantiation uses the name to find
9105 instantiated fields. */
9106 buf
= (char *) alloca (IDENTIFIER_LENGTH (id
) + 3);
9107 buf
[1] = buf
[0] = '_';
9108 memcpy (buf
+ 2, IDENTIFIER_POINTER (id
),
9109 IDENTIFIER_LENGTH (id
) + 1);
9110 name
= get_identifier (buf
);
9112 /* If TREE_TYPE isn't set, we're still in the introducer, so check
9114 if (!LAMBDA_EXPR_CLOSURE (lambda
))
9116 if (IDENTIFIER_MARKED (name
))
9118 pedwarn (input_location
, 0,
9119 "already captured %qD in lambda expression", id
);
9122 IDENTIFIER_MARKED (name
) = true;
9125 /* Make member variable. */
9126 member
= build_lang_decl (FIELD_DECL
, name
, type
);
9128 if (!explicit_init_p
)
9129 /* Normal captures are invisible to name lookup but uses are replaced
9130 with references to the capture field; we implement this by only
9131 really making them invisible in unevaluated context; see
9132 qualify_lookup. For now, let's make explicitly initialized captures
9134 DECL_NORMAL_CAPTURE_P (member
) = true;
9136 if (id
== this_identifier
)
9137 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
9139 /* Add it to the appropriate closure class if we've started it. */
9140 if (current_class_type
9141 && current_class_type
== LAMBDA_EXPR_CLOSURE (lambda
))
9142 finish_member_declaration (member
);
9144 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
9145 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
9147 if (LAMBDA_EXPR_CLOSURE (lambda
))
9148 return build_capture_proxy (member
);
9149 /* For explicit captures we haven't started the function yet, so we wait
9150 and build the proxy from cp_parser_lambda_body. */
9154 /* Register all the capture members on the list CAPTURES, which is the
9155 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
9158 register_capture_members (tree captures
)
9160 if (captures
== NULL_TREE
)
9163 register_capture_members (TREE_CHAIN (captures
));
9164 /* We set this in add_capture to avoid duplicates. */
9165 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures
))) = false;
9166 finish_member_declaration (TREE_PURPOSE (captures
));
9169 /* Similar to add_capture, except this works on a stack of nested lambdas.
9170 BY_REFERENCE_P in this case is derived from the default capture mode.
9171 Returns the capture for the lambda at the bottom of the stack. */
9174 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
9176 bool this_capture_p
= (id
== this_identifier
);
9178 tree var
= NULL_TREE
;
9180 tree saved_class_type
= current_class_type
;
9184 for (node
= lambda_stack
;
9186 node
= TREE_CHAIN (node
))
9188 tree lambda
= TREE_VALUE (node
);
9190 current_class_type
= LAMBDA_EXPR_CLOSURE (lambda
);
9191 var
= add_capture (lambda
,
9196 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
9197 == CPLD_REFERENCE
)),
9198 /*explicit_init_p=*/false);
9199 initializer
= convert_from_reference (var
);
9202 current_class_type
= saved_class_type
;
9207 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
9208 INDIRECT_REF, possibly adding it through default capturing. */
9211 lambda_expr_this_capture (tree lambda
)
9215 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
9217 /* Try to default capture 'this' if we can. */
9219 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
9221 tree containing_function
= TYPE_CONTEXT (LAMBDA_EXPR_CLOSURE (lambda
));
9222 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
9223 tree init
= NULL_TREE
;
9225 /* If we are in a lambda function, we can move out until we hit:
9226 1. a non-lambda function,
9227 2. a lambda function capturing 'this', or
9228 3. a non-default capturing lambda function. */
9229 while (LAMBDA_FUNCTION_P (containing_function
))
9232 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
9234 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
9236 /* An outer lambda has already captured 'this'. */
9237 init
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
9241 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
9242 /* An outer lambda won't let us capture 'this'. */
9245 lambda_stack
= tree_cons (NULL_TREE
,
9249 containing_function
= decl_function_context (containing_function
);
9252 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
9253 && !LAMBDA_FUNCTION_P (containing_function
))
9254 /* First parameter is 'this'. */
9255 init
= DECL_ARGUMENTS (containing_function
);
9258 this_capture
= add_default_capture (lambda_stack
,
9259 /*id=*/this_identifier
,
9265 error ("%<this%> was not captured for this lambda function");
9266 result
= error_mark_node
;
9270 /* To make sure that current_class_ref is for the lambda. */
9271 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
))
9272 == LAMBDA_EXPR_CLOSURE (lambda
));
9274 result
= this_capture
;
9276 /* If 'this' is captured, each use of 'this' is transformed into an
9277 access to the corresponding unnamed data member of the closure
9278 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9279 ensures that the transformed expression is an rvalue. ] */
9280 result
= rvalue (result
);
9286 /* Returns the method basetype of the innermost non-lambda function, or
9287 NULL_TREE if none. */
9290 nonlambda_method_basetype (void)
9293 if (!current_class_ref
)
9296 type
= current_class_type
;
9297 if (!LAMBDA_TYPE_P (type
))
9300 /* Find the nearest enclosing non-lambda function. */
9301 fn
= TYPE_NAME (type
);
9303 fn
= decl_function_context (fn
);
9304 while (fn
&& LAMBDA_FUNCTION_P (fn
));
9306 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
9309 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
9312 /* If the closure TYPE has a static op(), also add a conversion to function
9316 maybe_add_lambda_conv_op (tree type
)
9318 bool nested
= (current_function_decl
!= NULL_TREE
);
9319 tree callop
= lambda_function (type
);
9320 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
9321 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
9322 VEC (tree
, gc
) *argvec
;
9324 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
9327 if (processing_template_decl
)
9330 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
9331 FUNCTION_ARG_CHAIN (callop
));
9333 /* First build up the conversion op. */
9335 rettype
= build_pointer_type (stattype
);
9336 name
= mangle_conv_op_name_for_type (rettype
);
9337 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
9338 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
9339 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
9340 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9342 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9343 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9344 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9346 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
9347 grokclassfn (type
, fn
, NO_SPECIAL
);
9348 set_linkage_according_to_type (type
, fn
);
9349 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9350 DECL_IN_AGGR_P (fn
) = 1;
9351 DECL_ARTIFICIAL (fn
) = 1;
9352 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9353 DECL_DECLARED_INLINE_P (fn
) = 1;
9354 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
9356 add_method (type
, fn
, NULL_TREE
);
9358 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9359 the conversion op is used. */
9360 if (varargs_function_p (callop
))
9362 DECL_DELETED_FN (fn
) = 1;
9366 /* Now build up the thunk to be returned. */
9368 name
= get_identifier ("_FUN");
9369 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
9370 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
9371 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
9372 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
9373 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
9374 grokclassfn (type
, fn
, NO_SPECIAL
);
9375 set_linkage_according_to_type (type
, fn
);
9376 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
9377 DECL_IN_AGGR_P (fn
) = 1;
9378 DECL_ARTIFICIAL (fn
) = 1;
9379 DECL_NOT_REALLY_EXTERN (fn
) = 1;
9380 DECL_DECLARED_INLINE_P (fn
) = 1;
9381 DECL_STATIC_FUNCTION_P (fn
) = 1;
9382 DECL_ARGUMENTS (fn
) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop
)));
9383 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= DECL_CHAIN (arg
))
9384 DECL_CONTEXT (arg
) = fn
;
9386 add_method (type
, fn
, NULL_TREE
);
9389 push_function_context ();
9391 /* Still increment function_depth so that we don't GC in the
9392 middle of an expression. */
9395 /* Generate the body of the thunk. */
9397 start_preparsed_function (statfn
, NULL_TREE
,
9398 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9399 if (DECL_ONE_ONLY (statfn
))
9401 /* Put the thunk in the same comdat group as the call op. */
9402 symtab_add_to_same_comdat_group
9403 ((symtab_node
) cgraph_get_create_node (statfn
),
9404 (symtab_node
) cgraph_get_create_node (callop
));
9406 body
= begin_function_body ();
9407 compound_stmt
= begin_compound_stmt (0);
9409 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
9411 argvec
= make_tree_vector ();
9412 VEC_quick_push (tree
, argvec
, arg
);
9413 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= DECL_CHAIN (arg
))
9415 mark_exp_read (arg
);
9416 VEC_safe_push (tree
, gc
, argvec
, arg
);
9418 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
9419 VEC_address (tree
, argvec
));
9420 CALL_FROM_THUNK_P (call
) = 1;
9421 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
9422 call
= build_cplus_new (TREE_TYPE (call
), call
, tf_warning_or_error
);
9423 call
= convert_from_reference (call
);
9424 finish_return_stmt (call
);
9426 finish_compound_stmt (compound_stmt
);
9427 finish_function_body (body
);
9429 expand_or_defer_fn (finish_function (2));
9431 /* Generate the body of the conversion op. */
9433 start_preparsed_function (convfn
, NULL_TREE
,
9434 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
9435 body
= begin_function_body ();
9436 compound_stmt
= begin_compound_stmt (0);
9438 finish_return_stmt (decay_conversion (statfn
, tf_warning_or_error
));
9440 finish_compound_stmt (compound_stmt
);
9441 finish_function_body (body
);
9443 expand_or_defer_fn (finish_function (2));
9446 pop_function_context ();
9451 /* Returns true iff VAL is a lambda-related declaration which should
9452 be ignored by unqualified lookup. */
9455 is_lambda_ignored_entity (tree val
)
9457 /* In unevaluated context, look past normal capture proxies. */
9458 if (cp_unevaluated_operand
&& is_normal_capture_proxy (val
))
9461 /* Always ignore lambda fields, their names are only for debugging. */
9462 if (TREE_CODE (val
) == FIELD_DECL
9463 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val
)))
9466 /* None of the lookups that use qualify_lookup want the op() from the
9467 lambda; they want the one from the enclosing class. */
9468 if (TREE_CODE (val
) == FUNCTION_DECL
&& LAMBDA_FUNCTION_P (val
))
9474 #include "gt-cp-semantics.h"