1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
34 #include "c-family/c-objc.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
42 #include "diagnostic.h"
44 #include "tree-iterator.h"
50 /* There routines provide a modular interface to perform many parsing
51 operations. They may therefore be used during actual parsing, or
52 during template instantiation, which may be regarded as a
53 degenerate form of parsing. */
55 static tree maybe_convert_cond (tree);
56 static tree finalize_nrv_r (tree *, int *, void *);
57 static tree capture_decltype (tree);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct GTY(()) deferred_access {
112 /* A VEC representing name-lookups for which we have deferred
113 checking access controls. We cannot check the accessibility of
114 names used in a decl-specifier-seq until we know what is being
115 declared because code like:
122 A::B* A::f() { return 0; }
124 is valid, even though `A::B' is not generally accessible. */
125 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
127 /* The current mode of access checks. */
128 enum deferring_kind deferring_access_checks_kind;
131 DEF_VEC_O (deferred_access);
132 DEF_VEC_ALLOC_O (deferred_access,gc);
134 /* Data for deferred access checking. */
135 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
136 static GTY(()) unsigned deferred_access_no_check;
138 /* Save the current deferred access states and start deferred
139 access checking iff DEFER_P is true. */
142 push_deferring_access_checks (deferring_kind deferring)
144 /* For context like template instantiation, access checking
145 disabling applies to all nested context. */
146 if (deferred_access_no_check || deferring == dk_no_check)
147 deferred_access_no_check++;
150 deferred_access *ptr;
152 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
153 ptr->deferred_access_checks = NULL;
154 ptr->deferring_access_checks_kind = deferring;
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check)
165 VEC_last (deferred_access, deferred_access_stack)
166 ->deferring_access_checks_kind = dk_deferred;
169 /* Stop deferring access checks. */
172 stop_deferring_access_checks (void)
174 if (!deferred_access_no_check)
175 VEC_last (deferred_access, deferred_access_stack)
176 ->deferring_access_checks_kind = dk_no_deferred;
179 /* Discard the current deferred access checks and restore the
183 pop_deferring_access_checks (void)
185 if (deferred_access_no_check)
186 deferred_access_no_check--;
188 VEC_pop (deferred_access, deferred_access_stack);
191 /* Returns a TREE_LIST representing the deferred checks.
192 The TREE_PURPOSE of each node is the type through which the
193 access occurred; the TREE_VALUE is the declaration named.
196 VEC (deferred_access_check,gc)*
197 get_deferred_access_checks (void)
199 if (deferred_access_no_check)
202 return (VEC_last (deferred_access, deferred_access_stack)
203 ->deferred_access_checks);
206 /* Take current deferred checks and combine with the
207 previous states if we also defer checks previously.
208 Otherwise perform checks now. */
211 pop_to_parent_deferring_access_checks (void)
213 if (deferred_access_no_check)
214 deferred_access_no_check--;
217 VEC (deferred_access_check,gc) *checks;
218 deferred_access *ptr;
220 checks = (VEC_last (deferred_access, deferred_access_stack)
221 ->deferred_access_checks);
223 VEC_pop (deferred_access, deferred_access_stack);
224 ptr = VEC_last (deferred_access, deferred_access_stack);
225 if (ptr->deferring_access_checks_kind == dk_no_deferred)
228 perform_access_checks (checks);
232 /* Merge with parent. */
234 deferred_access_check *chk, *probe;
236 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
238 FOR_EACH_VEC_ELT (deferred_access_check,
239 ptr->deferred_access_checks, j, probe)
241 if (probe->binfo == chk->binfo &&
242 probe->decl == chk->decl &&
243 probe->diag_decl == chk->diag_decl)
246 /* Insert into parent's checks. */
247 VEC_safe_push (deferred_access_check, gc,
248 ptr->deferred_access_checks, chk);
255 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
256 is the BINFO indicating the qualifying scope used to access the
257 DECL node stored in the TREE_VALUE of the node. */
260 perform_access_checks (VEC (deferred_access_check,gc)* checks)
263 deferred_access_check *chk;
268 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
269 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
272 /* Perform the deferred access checks.
274 After performing the checks, we still have to keep the list
275 `deferred_access_stack->deferred_access_checks' since we may want
276 to check access for them again later in a different context.
283 A::X A::a, x; // No error for `A::a', error for `x'
285 We have to perform deferred access of `A::X', first with `A::a',
289 perform_deferred_access_checks (void)
291 perform_access_checks (get_deferred_access_checks ());
294 /* Defer checking the accessibility of DECL, when looked up in
295 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
298 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
301 deferred_access *ptr;
302 deferred_access_check *chk;
303 deferred_access_check *new_access;
306 /* Exit if we are in a context that no access checking is performed.
308 if (deferred_access_no_check)
311 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
313 ptr = VEC_last (deferred_access, deferred_access_stack);
315 /* If we are not supposed to defer access checks, just check now. */
316 if (ptr->deferring_access_checks_kind == dk_no_deferred)
318 enforce_access (binfo, decl, diag_decl);
322 /* See if we are already going to perform this check. */
323 FOR_EACH_VEC_ELT (deferred_access_check,
324 ptr->deferred_access_checks, i, chk)
326 if (chk->decl == decl && chk->binfo == binfo &&
327 chk->diag_decl == diag_decl)
332 /* If not, record the check. */
334 VEC_safe_push (deferred_access_check, gc,
335 ptr->deferred_access_checks, 0);
336 new_access->binfo = binfo;
337 new_access->decl = decl;
338 new_access->diag_decl = diag_decl;
341 /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL
342 is accessible in BINFO, and possibly complain if not. If we're not
343 checking access, everything is accessible. */
346 speculative_access_check (tree binfo, tree decl, tree diag_decl,
349 if (deferred_access_no_check)
352 /* If we're checking for implicit delete, we don't want access
354 if (!accessible_p (binfo, decl, true))
356 /* Unless we're under maybe_explain_implicit_delete. */
358 enforce_access (binfo, decl, diag_decl);
365 /* Returns nonzero if the current statement is a full expression,
366 i.e. temporaries created during that statement should be destroyed
367 at the end of the statement. */
370 stmts_are_full_exprs_p (void)
372 return current_stmt_tree ()->stmts_are_full_exprs_p;
375 /* T is a statement. Add it to the statement-tree. This is the C++
376 version. The C/ObjC frontends have a slightly different version of
382 enum tree_code code = TREE_CODE (t);
384 if (EXPR_P (t) && code != LABEL_EXPR)
386 if (!EXPR_HAS_LOCATION (t))
387 SET_EXPR_LOCATION (t, input_location);
389 /* When we expand a statement-tree, we must know whether or not the
390 statements are full-expressions. We record that fact here. */
391 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
394 /* Add T to the statement-tree. Non-side-effect statements need to be
395 recorded during statement expressions. */
396 gcc_checking_assert (!VEC_empty (tree, stmt_list_stack));
397 append_to_statement_list_force (t, &cur_stmt_list);
402 /* Returns the stmt_tree to which statements are currently being added. */
405 current_stmt_tree (void)
408 ? &cfun->language->base.x_stmt_tree
409 : &scope_chain->x_stmt_tree);
412 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
415 maybe_cleanup_point_expr (tree expr)
417 if (!processing_template_decl && stmts_are_full_exprs_p ())
418 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
422 /* Like maybe_cleanup_point_expr except have the type of the new expression be
423 void so we don't need to create a temporary variable to hold the inner
424 expression. The reason why we do this is because the original type might be
425 an aggregate and we cannot create a temporary variable for that type. */
428 maybe_cleanup_point_expr_void (tree expr)
430 if (!processing_template_decl && stmts_are_full_exprs_p ())
431 expr = fold_build_cleanup_point_expr (void_type_node, expr);
437 /* Create a declaration statement for the declaration given by the DECL. */
440 add_decl_expr (tree decl)
442 tree r = build_stmt (input_location, DECL_EXPR, decl);
443 if (DECL_INITIAL (decl)
444 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
445 r = maybe_cleanup_point_expr_void (r);
449 /* Finish a scope. */
452 do_poplevel (tree stmt_list)
456 if (stmts_are_full_exprs_p ())
457 block = poplevel (kept_level_p (), 1, 0);
459 stmt_list = pop_stmt_list (stmt_list);
461 if (!processing_template_decl)
463 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
464 /* ??? See c_end_compound_stmt re statement expressions. */
470 /* Begin a new scope. */
473 do_pushlevel (scope_kind sk)
475 tree ret = push_stmt_list ();
476 if (stmts_are_full_exprs_p ())
477 begin_scope (sk, NULL);
481 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
482 when the current scope is exited. EH_ONLY is true when this is not
483 meant to apply to normal control flow transfer. */
486 push_cleanup (tree decl, tree cleanup, bool eh_only)
488 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
489 CLEANUP_EH_ONLY (stmt) = eh_only;
491 CLEANUP_BODY (stmt) = push_stmt_list ();
494 /* Begin a conditional that might contain a declaration. When generating
495 normal code, we want the declaration to appear before the statement
496 containing the conditional. When generating template code, we want the
497 conditional to be rendered as the raw DECL_EXPR. */
500 begin_cond (tree *cond_p)
502 if (processing_template_decl)
503 *cond_p = push_stmt_list ();
506 /* Finish such a conditional. */
509 finish_cond (tree *cond_p, tree expr)
511 if (processing_template_decl)
513 tree cond = pop_stmt_list (*cond_p);
514 if (TREE_CODE (cond) == DECL_EXPR)
517 if (check_for_bare_parameter_packs (expr))
518 *cond_p = error_mark_node;
523 /* If *COND_P specifies a conditional with a declaration, transform the
526 for (; A x = 42;) { }
528 while (true) { A x = 42; if (!x) break; }
529 for (;;) { A x = 42; if (!x) break; }
530 The statement list for BODY will be empty if the conditional did
531 not declare anything. */
534 simplify_loop_decl_cond (tree *cond_p, tree body)
538 if (!TREE_SIDE_EFFECTS (body))
542 *cond_p = boolean_true_node;
544 if_stmt = begin_if_stmt ();
545 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
546 finish_if_stmt_cond (cond, if_stmt);
547 finish_break_stmt ();
548 finish_then_clause (if_stmt);
549 finish_if_stmt (if_stmt);
552 /* Finish a goto-statement. */
555 finish_goto_stmt (tree destination)
557 if (TREE_CODE (destination) == IDENTIFIER_NODE)
558 destination = lookup_label (destination);
560 /* We warn about unused labels with -Wunused. That means we have to
561 mark the used labels as used. */
562 if (TREE_CODE (destination) == LABEL_DECL)
563 TREE_USED (destination) = 1;
566 destination = mark_rvalue_use (destination);
567 if (!processing_template_decl)
569 destination = cp_convert (ptr_type_node, destination);
570 if (error_operand_p (destination))
575 check_goto (destination);
577 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
580 /* COND is the condition-expression for an if, while, etc.,
581 statement. Convert it to a boolean value, if appropriate.
582 In addition, verify sequence points if -Wsequence-point is enabled. */
585 maybe_convert_cond (tree cond)
587 /* Empty conditions remain empty. */
591 /* Wait until we instantiate templates before doing conversion. */
592 if (processing_template_decl)
595 if (warn_sequence_point)
596 verify_sequence_points (cond);
598 /* Do the conversion. */
599 cond = convert_from_reference (cond);
601 if (TREE_CODE (cond) == MODIFY_EXPR
602 && !TREE_NO_WARNING (cond)
605 warning (OPT_Wparentheses,
606 "suggest parentheses around assignment used as truth value");
607 TREE_NO_WARNING (cond) = 1;
610 return condition_conversion (cond);
613 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
616 finish_expr_stmt (tree expr)
620 if (expr != NULL_TREE)
622 if (!processing_template_decl)
624 if (warn_sequence_point)
625 verify_sequence_points (expr);
626 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
628 else if (!type_dependent_expression_p (expr))
629 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
630 tf_warning_or_error);
632 if (check_for_bare_parameter_packs (expr))
633 expr = error_mark_node;
635 /* Simplification of inner statement expressions, compound exprs,
636 etc can result in us already having an EXPR_STMT. */
637 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
639 if (TREE_CODE (expr) != EXPR_STMT)
640 expr = build_stmt (input_location, EXPR_STMT, expr);
641 expr = maybe_cleanup_point_expr_void (expr);
653 /* Begin an if-statement. Returns a newly created IF_STMT if
660 scope = do_pushlevel (sk_cond);
661 r = build_stmt (input_location, IF_STMT, NULL_TREE,
662 NULL_TREE, NULL_TREE, scope);
663 begin_cond (&IF_COND (r));
667 /* Process the COND of an if-statement, which may be given by
671 finish_if_stmt_cond (tree cond, tree if_stmt)
673 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
675 THEN_CLAUSE (if_stmt) = push_stmt_list ();
678 /* Finish the then-clause of an if-statement, which may be given by
682 finish_then_clause (tree if_stmt)
684 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
688 /* Begin the else-clause of an if-statement. */
691 begin_else_clause (tree if_stmt)
693 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
696 /* Finish the else-clause of an if-statement, which may be given by
700 finish_else_clause (tree if_stmt)
702 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
705 /* Finish an if-statement. */
708 finish_if_stmt (tree if_stmt)
710 tree scope = IF_SCOPE (if_stmt);
711 IF_SCOPE (if_stmt) = NULL;
712 add_stmt (do_poplevel (scope));
716 /* Begin a while-statement. Returns a newly created WHILE_STMT if
720 begin_while_stmt (void)
723 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
725 WHILE_BODY (r) = do_pushlevel (sk_block);
726 begin_cond (&WHILE_COND (r));
730 /* Process the COND of a while-statement, which may be given by
734 finish_while_stmt_cond (tree cond, tree while_stmt)
736 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
737 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
740 /* Finish a while-statement, which may be given by WHILE_STMT. */
743 finish_while_stmt (tree while_stmt)
745 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
749 /* Begin a do-statement. Returns a newly created DO_STMT if
755 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
757 DO_BODY (r) = push_stmt_list ();
761 /* Finish the body of a do-statement, which may be given by DO_STMT. */
764 finish_do_body (tree do_stmt)
766 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
768 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
769 body = STATEMENT_LIST_TAIL (body)->stmt;
771 if (IS_EMPTY_STMT (body))
772 warning (OPT_Wempty_body,
773 "suggest explicit braces around empty body in %<do%> statement");
776 /* Finish a do-statement, which may be given by DO_STMT, and whose
777 COND is as indicated. */
780 finish_do_stmt (tree cond, tree do_stmt)
782 cond = maybe_convert_cond (cond);
783 DO_COND (do_stmt) = cond;
787 /* Finish a return-statement. The EXPRESSION returned, if any, is as
791 finish_return_stmt (tree expr)
796 expr = check_return_expr (expr, &no_warning);
798 if (flag_openmp && !check_omp_return ())
799 return error_mark_node;
800 if (!processing_template_decl)
802 if (warn_sequence_point)
803 verify_sequence_points (expr);
805 if (DECL_DESTRUCTOR_P (current_function_decl)
806 || (DECL_CONSTRUCTOR_P (current_function_decl)
807 && targetm.cxx.cdtor_returns_this ()))
809 /* Similarly, all destructors must run destructors for
810 base-classes before returning. So, all returns in a
811 destructor get sent to the DTOR_LABEL; finish_function emits
812 code to return a value there. */
813 return finish_goto_stmt (cdtor_label);
817 r = build_stmt (input_location, RETURN_EXPR, expr);
818 TREE_NO_WARNING (r) |= no_warning;
819 r = maybe_cleanup_point_expr_void (r);
826 /* Begin the scope of a for-statement or a range-for-statement.
827 Both the returned trees are to be used in a call to
828 begin_for_stmt or begin_range_for_stmt. */
831 begin_for_scope (tree *init)
833 tree scope = NULL_TREE;
834 if (flag_new_for_scope > 0)
835 scope = do_pushlevel (sk_for);
837 if (processing_template_decl)
838 *init = push_stmt_list ();
845 /* Begin a for-statement. Returns a new FOR_STMT.
846 SCOPE and INIT should be the return of begin_for_scope,
850 begin_for_stmt (tree scope, tree init)
854 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
855 NULL_TREE, NULL_TREE, NULL_TREE);
857 if (scope == NULL_TREE)
859 gcc_assert (!init || !(flag_new_for_scope > 0));
861 scope = begin_for_scope (&init);
863 FOR_INIT_STMT (r) = init;
864 FOR_SCOPE (r) = scope;
869 /* Finish the for-init-statement of a for-statement, which may be
870 given by FOR_STMT. */
873 finish_for_init_stmt (tree for_stmt)
875 if (processing_template_decl)
876 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
878 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
879 begin_cond (&FOR_COND (for_stmt));
882 /* Finish the COND of a for-statement, which may be given by
886 finish_for_cond (tree cond, tree for_stmt)
888 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
889 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
892 /* Finish the increment-EXPRESSION in a for-statement, which may be
893 given by FOR_STMT. */
896 finish_for_expr (tree expr, tree for_stmt)
900 /* If EXPR is an overloaded function, issue an error; there is no
901 context available to use to perform overload resolution. */
902 if (type_unknown_p (expr))
904 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
905 expr = error_mark_node;
907 if (!processing_template_decl)
909 if (warn_sequence_point)
910 verify_sequence_points (expr);
911 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
912 tf_warning_or_error);
914 else if (!type_dependent_expression_p (expr))
915 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
916 tf_warning_or_error);
917 expr = maybe_cleanup_point_expr_void (expr);
918 if (check_for_bare_parameter_packs (expr))
919 expr = error_mark_node;
920 FOR_EXPR (for_stmt) = expr;
923 /* Finish the body of a for-statement, which may be given by
924 FOR_STMT. The increment-EXPR for the loop must be
926 It can also finish RANGE_FOR_STMT. */
929 finish_for_stmt (tree for_stmt)
931 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
932 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
934 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
936 /* Pop the scope for the body of the loop. */
937 if (flag_new_for_scope > 0)
940 tree *scope_ptr = (TREE_CODE (for_stmt) == RANGE_FOR_STMT
941 ? &RANGE_FOR_SCOPE (for_stmt)
942 : &FOR_SCOPE (for_stmt));
945 add_stmt (do_poplevel (scope));
951 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
952 SCOPE and INIT should be the return of begin_for_scope,
954 To finish it call finish_for_stmt(). */
957 begin_range_for_stmt (tree scope, tree init)
961 r = build_stmt (input_location, RANGE_FOR_STMT,
962 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE);
964 if (scope == NULL_TREE)
966 gcc_assert (!init || !(flag_new_for_scope > 0));
968 scope = begin_for_scope (&init);
971 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
974 pop_stmt_list (init);
975 RANGE_FOR_SCOPE (r) = scope;
980 /* Finish the head of a range-based for statement, which may
981 be given by RANGE_FOR_STMT. DECL must be the declaration
982 and EXPR must be the loop expression. */
985 finish_range_for_decl (tree range_for_stmt, tree decl, tree expr)
987 RANGE_FOR_DECL (range_for_stmt) = decl;
988 RANGE_FOR_EXPR (range_for_stmt) = expr;
989 add_stmt (range_for_stmt);
990 RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block);
993 /* Finish a break-statement. */
996 finish_break_stmt (void)
998 return add_stmt (build_stmt (input_location, BREAK_STMT));
1001 /* Finish a continue-statement. */
1004 finish_continue_stmt (void)
1006 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
1009 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1013 begin_switch_stmt (void)
1017 scope = do_pushlevel (sk_cond);
1018 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE, scope);
1020 begin_cond (&SWITCH_STMT_COND (r));
1025 /* Finish the cond of a switch-statement. */
1028 finish_switch_cond (tree cond, tree switch_stmt)
1030 tree orig_type = NULL;
1031 if (!processing_template_decl)
1033 /* Convert the condition to an integer or enumeration type. */
1034 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1035 if (cond == NULL_TREE)
1037 error ("switch quantity not an integer");
1038 cond = error_mark_node;
1040 orig_type = TREE_TYPE (cond);
1041 if (cond != error_mark_node)
1045 Integral promotions are performed. */
1046 cond = perform_integral_promotions (cond);
1047 cond = maybe_cleanup_point_expr (cond);
1050 if (check_for_bare_parameter_packs (cond))
1051 cond = error_mark_node;
1052 else if (!processing_template_decl && warn_sequence_point)
1053 verify_sequence_points (cond);
1055 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1056 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1057 add_stmt (switch_stmt);
1058 push_switch (switch_stmt);
1059 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1062 /* Finish the body of a switch-statement, which may be given by
1063 SWITCH_STMT. The COND to switch on is indicated. */
1066 finish_switch_stmt (tree switch_stmt)
1070 SWITCH_STMT_BODY (switch_stmt) =
1071 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1075 scope = SWITCH_STMT_SCOPE (switch_stmt);
1076 SWITCH_STMT_SCOPE (switch_stmt) = NULL;
1077 add_stmt (do_poplevel (scope));
1080 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1084 begin_try_block (void)
1086 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1088 TRY_STMTS (r) = push_stmt_list ();
1092 /* Likewise, for a function-try-block. The block returned in
1093 *COMPOUND_STMT is an artificial outer scope, containing the
1094 function-try-block. */
1097 begin_function_try_block (tree *compound_stmt)
1100 /* This outer scope does not exist in the C++ standard, but we need
1101 a place to put __FUNCTION__ and similar variables. */
1102 *compound_stmt = begin_compound_stmt (0);
1103 r = begin_try_block ();
1104 FN_TRY_BLOCK_P (r) = 1;
1108 /* Finish a try-block, which may be given by TRY_BLOCK. */
1111 finish_try_block (tree try_block)
1113 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1114 TRY_HANDLERS (try_block) = push_stmt_list ();
1117 /* Finish the body of a cleanup try-block, which may be given by
1121 finish_cleanup_try_block (tree try_block)
1123 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1126 /* Finish an implicitly generated try-block, with a cleanup is given
1130 finish_cleanup (tree cleanup, tree try_block)
1132 TRY_HANDLERS (try_block) = cleanup;
1133 CLEANUP_P (try_block) = 1;
1136 /* Likewise, for a function-try-block. */
1139 finish_function_try_block (tree try_block)
1141 finish_try_block (try_block);
1142 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1143 the try block, but moving it inside. */
1144 in_function_try_handler = 1;
1147 /* Finish a handler-sequence for a try-block, which may be given by
1151 finish_handler_sequence (tree try_block)
1153 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1154 check_handlers (TRY_HANDLERS (try_block));
1157 /* Finish the handler-seq for a function-try-block, given by
1158 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1159 begin_function_try_block. */
1162 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1164 in_function_try_handler = 0;
1165 finish_handler_sequence (try_block);
1166 finish_compound_stmt (compound_stmt);
1169 /* Begin a handler. Returns a HANDLER if appropriate. */
1172 begin_handler (void)
1176 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1179 /* Create a binding level for the eh_info and the exception object
1181 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1186 /* Finish the handler-parameters for a handler, which may be given by
1187 HANDLER. DECL is the declaration for the catch parameter, or NULL
1188 if this is a `catch (...)' clause. */
1191 finish_handler_parms (tree decl, tree handler)
1193 tree type = NULL_TREE;
1194 if (processing_template_decl)
1198 decl = pushdecl (decl);
1199 decl = push_template_decl (decl);
1200 HANDLER_PARMS (handler) = decl;
1201 type = TREE_TYPE (decl);
1205 type = expand_start_catch_block (decl);
1206 HANDLER_TYPE (handler) = type;
1207 if (!processing_template_decl && type)
1208 mark_used (eh_type_info (type));
1211 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1212 the return value from the matching call to finish_handler_parms. */
1215 finish_handler (tree handler)
1217 if (!processing_template_decl)
1218 expand_end_catch_block ();
1219 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1222 /* Begin a compound statement. FLAGS contains some bits that control the
1223 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1224 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1225 block of a function. If BCS_TRY_BLOCK is set, this is the block
1226 created on behalf of a TRY statement. Returns a token to be passed to
1227 finish_compound_stmt. */
1230 begin_compound_stmt (unsigned int flags)
1234 if (flags & BCS_NO_SCOPE)
1236 r = push_stmt_list ();
1237 STATEMENT_LIST_NO_SCOPE (r) = 1;
1239 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1240 But, if it's a statement-expression with a scopeless block, there's
1241 nothing to keep, and we don't want to accidentally keep a block
1242 *inside* the scopeless block. */
1243 keep_next_level (false);
1246 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1248 /* When processing a template, we need to remember where the braces were,
1249 so that we can set up identical scopes when instantiating the template
1250 later. BIND_EXPR is a handy candidate for this.
1251 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1252 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1253 processing templates. */
1254 if (processing_template_decl)
1256 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1257 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1258 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1259 TREE_SIDE_EFFECTS (r) = 1;
1265 /* Finish a compound-statement, which is given by STMT. */
1268 finish_compound_stmt (tree stmt)
1270 if (TREE_CODE (stmt) == BIND_EXPR)
1272 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1273 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1274 discard the BIND_EXPR so it can be merged with the containing
1276 if (TREE_CODE (body) == STATEMENT_LIST
1277 && STATEMENT_LIST_HEAD (body) == NULL
1278 && !BIND_EXPR_BODY_BLOCK (stmt)
1279 && !BIND_EXPR_TRY_BLOCK (stmt))
1282 BIND_EXPR_BODY (stmt) = body;
1284 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1285 stmt = pop_stmt_list (stmt);
1288 /* Destroy any ObjC "super" receivers that may have been
1290 objc_clear_super_receiver ();
1292 stmt = do_poplevel (stmt);
1295 /* ??? See c_end_compound_stmt wrt statement expressions. */
1300 /* Finish an asm-statement, whose components are a STRING, some
1301 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1302 LABELS. Also note whether the asm-statement should be
1303 considered volatile. */
1306 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1307 tree input_operands, tree clobbers, tree labels)
1311 int ninputs = list_length (input_operands);
1312 int noutputs = list_length (output_operands);
1314 if (!processing_template_decl)
1316 const char *constraint;
1317 const char **oconstraints;
1318 bool allows_mem, allows_reg, is_inout;
1322 oconstraints = XALLOCAVEC (const char *, noutputs);
1324 string = resolve_asm_operand_names (string, output_operands,
1325 input_operands, labels);
1327 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1329 operand = TREE_VALUE (t);
1331 /* ??? Really, this should not be here. Users should be using a
1332 proper lvalue, dammit. But there's a long history of using
1333 casts in the output operands. In cases like longlong.h, this
1334 becomes a primitive form of typechecking -- if the cast can be
1335 removed, then the output operand had a type of the proper width;
1336 otherwise we'll get an error. Gross, but ... */
1337 STRIP_NOPS (operand);
1339 operand = mark_lvalue_use (operand);
1341 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1342 operand = error_mark_node;
1344 if (operand != error_mark_node
1345 && (TREE_READONLY (operand)
1346 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1347 /* Functions are not modifiable, even though they are
1349 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1350 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1351 /* If it's an aggregate and any field is const, then it is
1352 effectively const. */
1353 || (CLASS_TYPE_P (TREE_TYPE (operand))
1354 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1355 cxx_readonly_error (operand, lv_asm);
1357 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1358 oconstraints[i] = constraint;
1360 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1361 &allows_mem, &allows_reg, &is_inout))
1363 /* If the operand is going to end up in memory,
1364 mark it addressable. */
1365 if (!allows_reg && !cxx_mark_addressable (operand))
1366 operand = error_mark_node;
1369 operand = error_mark_node;
1371 TREE_VALUE (t) = operand;
1374 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1376 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1377 operand = decay_conversion (TREE_VALUE (t));
1379 /* If the type of the operand hasn't been determined (e.g.,
1380 because it involves an overloaded function), then issue
1381 an error message. There's no context available to
1382 resolve the overloading. */
1383 if (TREE_TYPE (operand) == unknown_type_node)
1385 error ("type of asm operand %qE could not be determined",
1387 operand = error_mark_node;
1390 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1391 oconstraints, &allows_mem, &allows_reg))
1393 /* If the operand is going to end up in memory,
1394 mark it addressable. */
1395 if (!allows_reg && allows_mem)
1397 /* Strip the nops as we allow this case. FIXME, this really
1398 should be rejected or made deprecated. */
1399 STRIP_NOPS (operand);
1400 if (!cxx_mark_addressable (operand))
1401 operand = error_mark_node;
1405 operand = error_mark_node;
1407 TREE_VALUE (t) = operand;
1411 r = build_stmt (input_location, ASM_EXPR, string,
1412 output_operands, input_operands,
1414 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1415 r = maybe_cleanup_point_expr_void (r);
1416 return add_stmt (r);
1419 /* Finish a label with the indicated NAME. Returns the new label. */
1422 finish_label_stmt (tree name)
1424 tree decl = define_label (input_location, name);
1426 if (decl == error_mark_node)
1427 return error_mark_node;
1429 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1434 /* Finish a series of declarations for local labels. G++ allows users
1435 to declare "local" labels, i.e., labels with scope. This extension
1436 is useful when writing code involving statement-expressions. */
1439 finish_label_decl (tree name)
1441 if (!at_function_scope_p ())
1443 error ("__label__ declarations are only allowed in function scopes");
1447 add_decl_expr (declare_local_label (name));
1450 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1453 finish_decl_cleanup (tree decl, tree cleanup)
1455 push_cleanup (decl, cleanup, false);
1458 /* If the current scope exits with an exception, run CLEANUP. */
1461 finish_eh_cleanup (tree cleanup)
1463 push_cleanup (NULL, cleanup, true);
1466 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1467 order they were written by the user. Each node is as for
1468 emit_mem_initializers. */
1471 finish_mem_initializers (tree mem_inits)
1473 /* Reorder the MEM_INITS so that they are in the order they appeared
1474 in the source program. */
1475 mem_inits = nreverse (mem_inits);
1477 if (processing_template_decl)
1481 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1483 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1484 check for bare parameter packs in the TREE_VALUE, because
1485 any parameter packs in the TREE_VALUE have already been
1486 bound as part of the TREE_PURPOSE. See
1487 make_pack_expansion for more information. */
1488 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1489 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1490 TREE_VALUE (mem) = error_mark_node;
1493 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1496 emit_mem_initializers (mem_inits);
1499 /* Finish a parenthesized expression EXPR. */
1502 finish_parenthesized_expr (tree expr)
1505 /* This inhibits warnings in c_common_truthvalue_conversion. */
1506 TREE_NO_WARNING (expr) = 1;
1508 if (TREE_CODE (expr) == OFFSET_REF
1509 || TREE_CODE (expr) == SCOPE_REF)
1510 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1511 enclosed in parentheses. */
1512 PTRMEM_OK_P (expr) = 0;
1514 if (TREE_CODE (expr) == STRING_CST)
1515 PAREN_STRING_LITERAL_P (expr) = 1;
1520 /* Finish a reference to a non-static data member (DECL) that is not
1521 preceded by `.' or `->'. */
1524 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1526 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1530 tree scope = qualifying_scope;
1531 if (scope == NULL_TREE)
1532 scope = context_for_name_lookup (decl);
1533 object = maybe_dummy_object (scope, NULL);
1536 if (object == error_mark_node)
1537 return error_mark_node;
1539 /* DR 613: Can use non-static data members without an associated
1540 object in sizeof/decltype/alignof. */
1541 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1542 && (!processing_template_decl || !current_class_ref))
1544 if (current_function_decl
1545 && DECL_STATIC_FUNCTION_P (current_function_decl))
1546 error ("invalid use of member %q+D in static member function", decl);
1548 error ("invalid use of non-static data member %q+D", decl);
1549 error ("from this location");
1551 return error_mark_node;
1554 if (current_class_ptr)
1555 TREE_USED (current_class_ptr) = 1;
1556 if (processing_template_decl && !qualifying_scope)
1558 tree type = TREE_TYPE (decl);
1560 if (TREE_CODE (type) == REFERENCE_TYPE)
1561 /* Quals on the object don't matter. */;
1564 /* Set the cv qualifiers. */
1565 int quals = (current_class_ref
1566 ? cp_type_quals (TREE_TYPE (current_class_ref))
1567 : TYPE_UNQUALIFIED);
1569 if (DECL_MUTABLE_P (decl))
1570 quals &= ~TYPE_QUAL_CONST;
1572 quals |= cp_type_quals (TREE_TYPE (decl));
1573 type = cp_build_qualified_type (type, quals);
1576 return (convert_from_reference
1577 (build_min (COMPONENT_REF, type, object, decl, NULL_TREE)));
1579 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1580 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1582 else if (processing_template_decl)
1583 return build_qualified_name (TREE_TYPE (decl),
1586 /*template_p=*/false);
1589 tree access_type = TREE_TYPE (object);
1591 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1594 /* If the data member was named `C::M', convert `*this' to `C'
1596 if (qualifying_scope)
1598 tree binfo = NULL_TREE;
1599 object = build_scoped_ref (object, qualifying_scope,
1603 return build_class_member_access_expr (object, decl,
1604 /*access_path=*/NULL_TREE,
1605 /*preserve_reference=*/false,
1606 tf_warning_or_error);
1610 /* If we are currently parsing a template and we encountered a typedef
1611 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1612 adds the typedef to a list tied to the current template.
1613 At tempate instantiatin time, that list is walked and access check
1614 performed for each typedef.
1615 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1618 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1620 location_t location)
1622 tree template_info = NULL;
1623 tree cs = current_scope ();
1625 if (!is_typedef_decl (typedef_decl)
1627 || !CLASS_TYPE_P (context)
1631 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1632 template_info = get_template_info (cs);
1635 && TI_TEMPLATE (template_info)
1636 && !currently_open_class (context))
1637 append_type_to_template_for_access_check (cs, typedef_decl,
1641 /* DECL was the declaration to which a qualified-id resolved. Issue
1642 an error message if it is not accessible. If OBJECT_TYPE is
1643 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1644 type of `*x', or `x', respectively. If the DECL was named as
1645 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1648 check_accessibility_of_qualified_id (tree decl,
1650 tree nested_name_specifier)
1653 tree qualifying_type = NULL_TREE;
1655 /* If we are parsing a template declaration and if decl is a typedef,
1656 add it to a list tied to the template.
1657 At template instantiation time, that list will be walked and
1658 access check performed. */
1659 add_typedef_to_current_template_for_access_check (decl,
1660 nested_name_specifier
1661 ? nested_name_specifier
1662 : DECL_CONTEXT (decl),
1665 /* If we're not checking, return immediately. */
1666 if (deferred_access_no_check)
1669 /* Determine the SCOPE of DECL. */
1670 scope = context_for_name_lookup (decl);
1671 /* If the SCOPE is not a type, then DECL is not a member. */
1672 if (!TYPE_P (scope))
1674 /* Compute the scope through which DECL is being accessed. */
1676 /* OBJECT_TYPE might not be a class type; consider:
1678 class A { typedef int I; };
1682 In this case, we will have "A::I" as the DECL, but "I" as the
1684 && CLASS_TYPE_P (object_type)
1685 && DERIVED_FROM_P (scope, object_type))
1686 /* If we are processing a `->' or `.' expression, use the type of the
1688 qualifying_type = object_type;
1689 else if (nested_name_specifier)
1691 /* If the reference is to a non-static member of the
1692 current class, treat it as if it were referenced through
1694 if (DECL_NONSTATIC_MEMBER_P (decl)
1695 && current_class_ptr
1696 && DERIVED_FROM_P (scope, current_class_type))
1697 qualifying_type = current_class_type;
1698 /* Otherwise, use the type indicated by the
1699 nested-name-specifier. */
1701 qualifying_type = nested_name_specifier;
1704 /* Otherwise, the name must be from the current class or one of
1706 qualifying_type = currently_open_derived_class (scope);
1709 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1710 or similar in a default argument value. */
1711 && CLASS_TYPE_P (qualifying_type)
1712 && !dependent_type_p (qualifying_type))
1713 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1717 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1718 class named to the left of the "::" operator. DONE is true if this
1719 expression is a complete postfix-expression; it is false if this
1720 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1721 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1722 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1723 is true iff this qualified name appears as a template argument. */
1726 finish_qualified_id_expr (tree qualifying_class,
1731 bool template_arg_p)
1733 gcc_assert (TYPE_P (qualifying_class));
1735 if (error_operand_p (expr))
1736 return error_mark_node;
1738 if (DECL_P (expr) || BASELINK_P (expr))
1742 check_template_keyword (expr);
1744 /* If EXPR occurs as the operand of '&', use special handling that
1745 permits a pointer-to-member. */
1746 if (address_p && done)
1748 if (TREE_CODE (expr) == SCOPE_REF)
1749 expr = TREE_OPERAND (expr, 1);
1750 expr = build_offset_ref (qualifying_class, expr,
1751 /*address_p=*/true);
1755 /* Within the scope of a class, turn references to non-static
1756 members into expression of the form "this->...". */
1758 /* But, within a template argument, we do not want make the
1759 transformation, as there is no "this" pointer. */
1761 else if (TREE_CODE (expr) == FIELD_DECL)
1763 push_deferring_access_checks (dk_no_check);
1764 expr = finish_non_static_data_member (expr, NULL_TREE,
1766 pop_deferring_access_checks ();
1768 else if (BASELINK_P (expr) && !processing_template_decl)
1772 /* See if any of the functions are non-static members. */
1773 /* If so, the expression may be relative to 'this'. */
1774 if (!shared_member_p (expr)
1775 && (ob = maybe_dummy_object (qualifying_class, NULL),
1776 !is_dummy_object (ob)))
1777 expr = (build_class_member_access_expr
1780 BASELINK_ACCESS_BINFO (expr),
1781 /*preserve_reference=*/false,
1782 tf_warning_or_error));
1784 /* The expression is a qualified name whose address is not
1786 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1792 /* Begin a statement-expression. The value returned must be passed to
1793 finish_stmt_expr. */
1796 begin_stmt_expr (void)
1798 return push_stmt_list ();
1801 /* Process the final expression of a statement expression. EXPR can be
1802 NULL, if the final expression is empty. Return a STATEMENT_LIST
1803 containing all the statements in the statement-expression, or
1804 ERROR_MARK_NODE if there was an error. */
1807 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1809 if (error_operand_p (expr))
1811 /* The type of the statement-expression is the type of the last
1813 TREE_TYPE (stmt_expr) = error_mark_node;
1814 return error_mark_node;
1817 /* If the last statement does not have "void" type, then the value
1818 of the last statement is the value of the entire expression. */
1821 tree type = TREE_TYPE (expr);
1823 if (processing_template_decl)
1825 expr = build_stmt (input_location, EXPR_STMT, expr);
1826 expr = add_stmt (expr);
1827 /* Mark the last statement so that we can recognize it as such at
1828 template-instantiation time. */
1829 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1831 else if (VOID_TYPE_P (type))
1833 /* Just treat this like an ordinary statement. */
1834 expr = finish_expr_stmt (expr);
1838 /* It actually has a value we need to deal with. First, force it
1839 to be an rvalue so that we won't need to build up a copy
1840 constructor call later when we try to assign it to something. */
1841 expr = force_rvalue (expr, tf_warning_or_error);
1842 if (error_operand_p (expr))
1843 return error_mark_node;
1845 /* Update for array-to-pointer decay. */
1846 type = TREE_TYPE (expr);
1848 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1849 normal statement, but don't convert to void or actually add
1851 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1852 expr = maybe_cleanup_point_expr (expr);
1856 /* The type of the statement-expression is the type of the last
1858 TREE_TYPE (stmt_expr) = type;
1864 /* Finish a statement-expression. EXPR should be the value returned
1865 by the previous begin_stmt_expr. Returns an expression
1866 representing the statement-expression. */
1869 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1874 if (error_operand_p (stmt_expr))
1876 pop_stmt_list (stmt_expr);
1877 return error_mark_node;
1880 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1882 type = TREE_TYPE (stmt_expr);
1883 result = pop_stmt_list (stmt_expr);
1884 TREE_TYPE (result) = type;
1886 if (processing_template_decl)
1888 result = build_min (STMT_EXPR, type, result);
1889 TREE_SIDE_EFFECTS (result) = 1;
1890 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1892 else if (CLASS_TYPE_P (type))
1894 /* Wrap the statement-expression in a TARGET_EXPR so that the
1895 temporary object created by the final expression is destroyed at
1896 the end of the full-expression containing the
1897 statement-expression. */
1898 result = force_target_expr (type, result, tf_warning_or_error);
1904 /* Returns the expression which provides the value of STMT_EXPR. */
1907 stmt_expr_value_expr (tree stmt_expr)
1909 tree t = STMT_EXPR_STMT (stmt_expr);
1911 if (TREE_CODE (t) == BIND_EXPR)
1912 t = BIND_EXPR_BODY (t);
1914 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1915 t = STATEMENT_LIST_TAIL (t)->stmt;
1917 if (TREE_CODE (t) == EXPR_STMT)
1918 t = EXPR_STMT_EXPR (t);
1923 /* Return TRUE iff EXPR_STMT is an empty list of
1924 expression statements. */
1927 empty_expr_stmt_p (tree expr_stmt)
1929 tree body = NULL_TREE;
1931 if (expr_stmt == void_zero_node)
1936 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1937 body = EXPR_STMT_EXPR (expr_stmt);
1938 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1944 if (TREE_CODE (body) == STATEMENT_LIST)
1945 return tsi_end_p (tsi_start (body));
1947 return empty_expr_stmt_p (body);
1952 /* Perform Koenig lookup. FN is the postfix-expression representing
1953 the function (or functions) to call; ARGS are the arguments to the
1954 call; if INCLUDE_STD then the `std' namespace is automatically
1955 considered an associated namespace (used in range-based for loops).
1956 Returns the functions to be considered by overload resolution. */
1959 perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std,
1960 tsubst_flags_t complain)
1962 tree identifier = NULL_TREE;
1963 tree functions = NULL_TREE;
1964 tree tmpl_args = NULL_TREE;
1965 bool template_id = false;
1967 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1969 /* Use a separate flag to handle null args. */
1971 tmpl_args = TREE_OPERAND (fn, 1);
1972 fn = TREE_OPERAND (fn, 0);
1975 /* Find the name of the overloaded function. */
1976 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1978 else if (is_overloaded_fn (fn))
1981 identifier = DECL_NAME (get_first_fn (functions));
1983 else if (DECL_P (fn))
1986 identifier = DECL_NAME (fn);
1989 /* A call to a namespace-scope function using an unqualified name.
1991 Do Koenig lookup -- unless any of the arguments are
1993 if (!any_type_dependent_arguments_p (args)
1994 && !any_dependent_template_arguments_p (tmpl_args))
1996 fn = lookup_arg_dependent (identifier, functions, args, include_std);
1999 /* The unqualified name could not be resolved. */
2001 fn = unqualified_fn_lookup_error (identifier);
2007 if (fn && template_id)
2008 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2013 /* Generate an expression for `FN (ARGS)'. This may change the
2016 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2017 as a virtual call, even if FN is virtual. (This flag is set when
2018 encountering an expression where the function name is explicitly
2019 qualified. For example a call to `X::f' never generates a virtual
2022 Returns code for the call. */
2025 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
2026 bool koenig_p, tsubst_flags_t complain)
2030 VEC(tree,gc) *orig_args = NULL;
2032 if (fn == error_mark_node)
2033 return error_mark_node;
2035 gcc_assert (!TYPE_P (fn));
2039 if (processing_template_decl)
2041 /* If the call expression is dependent, build a CALL_EXPR node
2042 with no type; type_dependent_expression_p recognizes
2043 expressions with no type as being dependent. */
2044 if (type_dependent_expression_p (fn)
2045 || any_type_dependent_arguments_p (*args)
2046 /* For a non-static member function that doesn't have an
2047 explicit object argument, we need to specifically
2048 test the type dependency of the "this" pointer because it
2049 is not included in *ARGS even though it is considered to
2050 be part of the list of arguments. Note that this is
2051 related to CWG issues 515 and 1005. */
2052 || (TREE_CODE (fn) != COMPONENT_REF
2053 && non_static_member_function_p (fn)
2054 && current_class_ref
2055 && type_dependent_expression_p (current_class_ref)))
2057 result = build_nt_call_vec (fn, *args);
2058 KOENIG_LOOKUP_P (result) = koenig_p;
2063 tree fndecl = OVL_CURRENT (fn);
2064 if (TREE_CODE (fndecl) != FUNCTION_DECL
2065 || !TREE_THIS_VOLATILE (fndecl))
2071 current_function_returns_abnormally = 1;
2075 orig_args = make_tree_vector_copy (*args);
2076 if (!BASELINK_P (fn)
2077 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2078 && TREE_TYPE (fn) != unknown_type_node)
2079 fn = build_non_dependent_expr (fn);
2080 make_args_non_dependent (*args);
2083 if (TREE_CODE (fn) == COMPONENT_REF)
2085 tree member = TREE_OPERAND (fn, 1);
2086 if (BASELINK_P (member))
2088 tree object = TREE_OPERAND (fn, 0);
2089 return build_new_method_call (object, member,
2092 ? LOOKUP_NORMAL | LOOKUP_NONVIRTUAL
2099 if (is_overloaded_fn (fn))
2100 fn = baselink_for_fns (fn);
2103 if (BASELINK_P (fn))
2107 /* A call to a member function. From [over.call.func]:
2109 If the keyword this is in scope and refers to the class of
2110 that member function, or a derived class thereof, then the
2111 function call is transformed into a qualified function call
2112 using (*this) as the postfix-expression to the left of the
2113 . operator.... [Otherwise] a contrived object of type T
2114 becomes the implied object argument.
2118 struct A { void f(); };
2119 struct B : public A {};
2120 struct C : public A { void g() { B::f(); }};
2122 "the class of that member function" refers to `A'. But 11.2
2123 [class.access.base] says that we need to convert 'this' to B* as
2124 part of the access, so we pass 'B' to maybe_dummy_object. */
2126 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2129 if (processing_template_decl)
2131 if (type_dependent_expression_p (object))
2133 tree ret = build_nt_call_vec (orig_fn, orig_args);
2134 release_tree_vector (orig_args);
2137 object = build_non_dependent_expr (object);
2140 result = build_new_method_call (object, fn, args, NULL_TREE,
2142 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
2147 else if (is_overloaded_fn (fn))
2149 /* If the function is an overloaded builtin, resolve it. */
2150 if (TREE_CODE (fn) == FUNCTION_DECL
2151 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2152 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2153 result = resolve_overloaded_builtin (input_location, fn, *args);
2156 /* A call to a namespace-scope function. */
2157 result = build_new_function_call (fn, args, koenig_p, complain);
2159 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2161 if (!VEC_empty (tree, *args))
2162 error ("arguments to destructor are not allowed");
2163 /* Mark the pseudo-destructor call as having side-effects so
2164 that we do not issue warnings about its use. */
2165 result = build1 (NOP_EXPR,
2167 TREE_OPERAND (fn, 0));
2168 TREE_SIDE_EFFECTS (result) = 1;
2170 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2171 /* If the "function" is really an object of class type, it might
2172 have an overloaded `operator ()'. */
2173 result = build_op_call (fn, args, complain);
2176 /* A call where the function is unknown. */
2177 result = cp_build_function_call_vec (fn, args, complain);
2179 if (processing_template_decl && result != error_mark_node)
2181 if (TREE_CODE (result) == INDIRECT_REF)
2182 result = TREE_OPERAND (result, 0);
2183 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2184 SET_EXPR_LOCATION (result, input_location);
2185 KOENIG_LOOKUP_P (result) = koenig_p;
2186 release_tree_vector (orig_args);
2187 result = convert_from_reference (result);
2192 /* Free garbage OVERLOADs from arg-dependent lookup. */
2193 tree next = NULL_TREE;
2195 fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn);
2198 if (processing_template_decl)
2199 /* In a template, we'll re-use them at instantiation time. */
2200 OVL_ARG_DEPENDENT (fn) = false;
2203 next = OVL_CHAIN (fn);
2212 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2213 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2214 POSTDECREMENT_EXPR.) */
2217 finish_increment_expr (tree expr, enum tree_code code)
2219 return build_x_unary_op (code, expr, tf_warning_or_error);
2222 /* Finish a use of `this'. Returns an expression for `this'. */
2225 finish_this_expr (void)
2229 if (current_class_ptr)
2231 tree type = TREE_TYPE (current_class_ref);
2233 /* In a lambda expression, 'this' refers to the captured 'this'. */
2234 if (LAMBDA_TYPE_P (type))
2235 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2237 result = current_class_ptr;
2240 else if (current_function_decl
2241 && DECL_STATIC_FUNCTION_P (current_function_decl))
2243 error ("%<this%> is unavailable for static member functions");
2244 result = error_mark_node;
2248 if (current_function_decl)
2249 error ("invalid use of %<this%> in non-member function");
2251 error ("invalid use of %<this%> at top level");
2252 result = error_mark_node;
2258 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2259 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2260 the TYPE for the type given. If SCOPE is non-NULL, the expression
2261 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2264 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2266 if (object == error_mark_node || destructor == error_mark_node)
2267 return error_mark_node;
2269 gcc_assert (TYPE_P (destructor));
2271 if (!processing_template_decl)
2273 if (scope == error_mark_node)
2275 error ("invalid qualifying scope in pseudo-destructor name");
2276 return error_mark_node;
2278 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2280 error ("qualified type %qT does not match destructor name ~%qT",
2282 return error_mark_node;
2286 /* [expr.pseudo] says both:
2288 The type designated by the pseudo-destructor-name shall be
2289 the same as the object type.
2293 The cv-unqualified versions of the object type and of the
2294 type designated by the pseudo-destructor-name shall be the
2297 We implement the more generous second sentence, since that is
2298 what most other compilers do. */
2299 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2302 error ("%qE is not of type %qT", object, destructor);
2303 return error_mark_node;
2307 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2310 /* Finish an expression of the form CODE EXPR. */
2313 finish_unary_op_expr (enum tree_code code, tree expr)
2315 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2316 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2317 overflow_warning (input_location, result);
2322 /* Finish a compound-literal expression. TYPE is the type to which
2323 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2326 finish_compound_literal (tree type, tree compound_literal,
2327 tsubst_flags_t complain)
2329 if (type == error_mark_node)
2330 return error_mark_node;
2332 if (TREE_CODE (type) == REFERENCE_TYPE)
2335 = finish_compound_literal (TREE_TYPE (type), compound_literal,
2337 return cp_build_c_cast (type, compound_literal, complain);
2340 if (!TYPE_OBJ_P (type))
2342 if (complain & tf_error)
2343 error ("compound literal of non-object type %qT", type);
2344 return error_mark_node;
2347 if (processing_template_decl)
2349 TREE_TYPE (compound_literal) = type;
2350 /* Mark the expression as a compound literal. */
2351 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2352 return compound_literal;
2355 type = complete_type (type);
2357 if (TYPE_NON_AGGREGATE_CLASS (type))
2359 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2360 everywhere that deals with function arguments would be a pain, so
2361 just wrap it in a TREE_LIST. The parser set a flag so we know
2362 that it came from T{} rather than T({}). */
2363 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2364 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2365 return build_functional_cast (type, compound_literal, complain);
2368 if (TREE_CODE (type) == ARRAY_TYPE
2369 && check_array_initializer (NULL_TREE, type, compound_literal))
2370 return error_mark_node;
2371 compound_literal = reshape_init (type, compound_literal, complain);
2372 if (SCALAR_TYPE_P (type)
2373 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal))
2374 check_narrowing (type, compound_literal);
2375 if (TREE_CODE (type) == ARRAY_TYPE
2376 && TYPE_DOMAIN (type) == NULL_TREE)
2378 cp_complete_array_type_or_error (&type, compound_literal,
2380 if (type == error_mark_node)
2381 return error_mark_node;
2383 compound_literal = digest_init (type, compound_literal, complain);
2384 if (TREE_CODE (compound_literal) == CONSTRUCTOR)
2385 TREE_HAS_CONSTRUCTOR (compound_literal) = true;
2386 /* Put static/constant array temporaries in static variables, but always
2387 represent class temporaries with TARGET_EXPR so we elide copies. */
2388 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type))
2389 && TREE_CODE (type) == ARRAY_TYPE
2390 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2391 && initializer_constant_valid_p (compound_literal, type))
2393 tree decl = create_temporary_var (type);
2394 DECL_INITIAL (decl) = compound_literal;
2395 TREE_STATIC (decl) = 1;
2396 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
2398 /* 5.19 says that a constant expression can include an
2399 lvalue-rvalue conversion applied to "a glvalue of literal type
2400 that refers to a non-volatile temporary object initialized
2401 with a constant expression". Rather than try to communicate
2402 that this VAR_DECL is a temporary, just mark it constexpr. */
2403 DECL_DECLARED_CONSTEXPR_P (decl) = true;
2404 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
2405 TREE_CONSTANT (decl) = true;
2407 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2408 decl = pushdecl_top_level (decl);
2409 DECL_NAME (decl) = make_anon_name ();
2410 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2414 return get_target_expr_sfinae (compound_literal, complain);
2417 /* Return the declaration for the function-name variable indicated by
2421 finish_fname (tree id)
2425 decl = fname_decl (input_location, C_RID_CODE (id), id);
2426 if (processing_template_decl && current_function_decl)
2427 decl = DECL_NAME (decl);
2431 /* Finish a translation unit. */
2434 finish_translation_unit (void)
2436 /* In case there were missing closebraces,
2437 get us back to the global binding level. */
2439 while (current_namespace != global_namespace)
2442 /* Do file scope __FUNCTION__ et al. */
2443 finish_fname_decls ();
2446 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2447 Returns the parameter. */
2450 finish_template_type_parm (tree aggr, tree identifier)
2452 if (aggr != class_type_node)
2454 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2455 aggr = class_type_node;
2458 return build_tree_list (aggr, identifier);
2461 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2462 Returns the parameter. */
2465 finish_template_template_parm (tree aggr, tree identifier)
2467 tree decl = build_decl (input_location,
2468 TYPE_DECL, identifier, NULL_TREE);
2469 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2470 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2471 DECL_TEMPLATE_RESULT (tmpl) = decl;
2472 DECL_ARTIFICIAL (decl) = 1;
2473 end_template_decl ();
2475 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2477 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2478 /*is_primary=*/true, /*is_partial=*/false,
2481 return finish_template_type_parm (aggr, tmpl);
2484 /* ARGUMENT is the default-argument value for a template template
2485 parameter. If ARGUMENT is invalid, issue error messages and return
2486 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2489 check_template_template_default_arg (tree argument)
2491 if (TREE_CODE (argument) != TEMPLATE_DECL
2492 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2493 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2495 if (TREE_CODE (argument) == TYPE_DECL)
2496 error ("invalid use of type %qT as a default value for a template "
2497 "template-parameter", TREE_TYPE (argument));
2499 error ("invalid default argument for a template template parameter");
2500 return error_mark_node;
2506 /* Begin a class definition, as indicated by T. */
2509 begin_class_definition (tree t, tree attributes)
2511 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2512 return error_mark_node;
2514 if (processing_template_parmlist)
2516 error ("definition of %q#T inside template parameter list", t);
2517 return error_mark_node;
2520 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2521 are passed the same as decimal scalar types. */
2522 if (TREE_CODE (t) == RECORD_TYPE
2523 && !processing_template_decl)
2525 tree ns = TYPE_CONTEXT (t);
2526 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2527 && DECL_CONTEXT (ns) == std_node
2529 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2531 const char *n = TYPE_NAME_STRING (t);
2532 if ((strcmp (n, "decimal32") == 0)
2533 || (strcmp (n, "decimal64") == 0)
2534 || (strcmp (n, "decimal128") == 0))
2535 TYPE_TRANSPARENT_AGGR (t) = 1;
2539 /* A non-implicit typename comes from code like:
2541 template <typename T> struct A {
2542 template <typename U> struct A<T>::B ...
2544 This is erroneous. */
2545 else if (TREE_CODE (t) == TYPENAME_TYPE)
2547 error ("invalid definition of qualified type %qT", t);
2548 t = error_mark_node;
2551 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2553 t = make_class_type (RECORD_TYPE);
2554 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2557 if (TYPE_BEING_DEFINED (t))
2559 t = make_class_type (TREE_CODE (t));
2560 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2562 maybe_process_partial_specialization (t);
2564 TYPE_BEING_DEFINED (t) = 1;
2566 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2567 fixup_attribute_variants (t);
2569 if (flag_pack_struct)
2572 TYPE_PACKED (t) = 1;
2573 /* Even though the type is being defined for the first time
2574 here, there might have been a forward declaration, so there
2575 might be cv-qualified variants of T. */
2576 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2577 TYPE_PACKED (v) = 1;
2579 /* Reset the interface data, at the earliest possible
2580 moment, as it might have been set via a class foo;
2582 if (! TYPE_ANONYMOUS_P (t))
2584 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2585 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2586 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2587 (t, finfo->interface_unknown);
2589 reset_specialization();
2591 /* Make a declaration for this class in its own scope. */
2592 build_self_reference ();
2597 /* Finish the member declaration given by DECL. */
2600 finish_member_declaration (tree decl)
2602 if (decl == error_mark_node || decl == NULL_TREE)
2605 if (decl == void_type_node)
2606 /* The COMPONENT was a friend, not a member, and so there's
2607 nothing for us to do. */
2610 /* We should see only one DECL at a time. */
2611 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2613 /* Set up access control for DECL. */
2615 = (current_access_specifier == access_private_node);
2616 TREE_PROTECTED (decl)
2617 = (current_access_specifier == access_protected_node);
2618 if (TREE_CODE (decl) == TEMPLATE_DECL)
2620 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2621 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2624 /* Mark the DECL as a member of the current class. */
2625 DECL_CONTEXT (decl) = current_class_type;
2627 /* Check for bare parameter packs in the member variable declaration. */
2628 if (TREE_CODE (decl) == FIELD_DECL)
2630 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2631 TREE_TYPE (decl) = error_mark_node;
2632 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2633 DECL_ATTRIBUTES (decl) = NULL_TREE;
2638 A C language linkage is ignored for the names of class members
2639 and the member function type of class member functions. */
2640 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2641 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2643 /* Put functions on the TYPE_METHODS list and everything else on the
2644 TYPE_FIELDS list. Note that these are built up in reverse order.
2645 We reverse them (to obtain declaration order) in finish_struct. */
2646 if (TREE_CODE (decl) == FUNCTION_DECL
2647 || DECL_FUNCTION_TEMPLATE_P (decl))
2649 /* We also need to add this function to the
2650 CLASSTYPE_METHOD_VEC. */
2651 if (add_method (current_class_type, decl, NULL_TREE))
2653 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2654 TYPE_METHODS (current_class_type) = decl;
2656 maybe_add_class_template_decl_list (current_class_type, decl,
2660 /* Enter the DECL into the scope of the class. */
2661 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2662 || pushdecl_class_level (decl))
2664 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2665 go at the beginning. The reason is that lookup_field_1
2666 searches the list in order, and we want a field name to
2667 override a type name so that the "struct stat hack" will
2668 work. In particular:
2670 struct S { enum E { }; int E } s;
2673 is valid. In addition, the FIELD_DECLs must be maintained in
2674 declaration order so that class layout works as expected.
2675 However, we don't need that order until class layout, so we
2676 save a little time by putting FIELD_DECLs on in reverse order
2677 here, and then reversing them in finish_struct_1. (We could
2678 also keep a pointer to the correct insertion points in the
2681 if (TREE_CODE (decl) == TYPE_DECL)
2682 TYPE_FIELDS (current_class_type)
2683 = chainon (TYPE_FIELDS (current_class_type), decl);
2686 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2687 TYPE_FIELDS (current_class_type) = decl;
2690 maybe_add_class_template_decl_list (current_class_type, decl,
2695 note_decl_for_pch (decl);
2698 /* DECL has been declared while we are building a PCH file. Perform
2699 actions that we might normally undertake lazily, but which can be
2700 performed now so that they do not have to be performed in
2701 translation units which include the PCH file. */
2704 note_decl_for_pch (tree decl)
2706 gcc_assert (pch_file);
2708 /* There's a good chance that we'll have to mangle names at some
2709 point, even if only for emission in debugging information. */
2710 if ((TREE_CODE (decl) == VAR_DECL
2711 || TREE_CODE (decl) == FUNCTION_DECL)
2712 && !processing_template_decl)
2716 /* Finish processing a complete template declaration. The PARMS are
2717 the template parameters. */
2720 finish_template_decl (tree parms)
2723 end_template_decl ();
2725 end_specialization ();
2728 /* Finish processing a template-id (which names a type) of the form
2729 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2730 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2731 the scope of template-id indicated. */
2734 finish_template_type (tree name, tree args, int entering_scope)
2738 type = lookup_template_class (name, args,
2739 NULL_TREE, NULL_TREE, entering_scope,
2740 tf_warning_or_error | tf_user);
2741 if (type == error_mark_node)
2743 else if (CLASS_TYPE_P (type) && !alias_type_or_template_p (type))
2744 return TYPE_STUB_DECL (type);
2746 return TYPE_NAME (type);
2749 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2750 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2751 BASE_CLASS, or NULL_TREE if an error occurred. The
2752 ACCESS_SPECIFIER is one of
2753 access_{default,public,protected_private}_node. For a virtual base
2754 we set TREE_TYPE. */
2757 finish_base_specifier (tree base, tree access, bool virtual_p)
2761 if (base == error_mark_node)
2763 error ("invalid base-class specification");
2766 else if (! MAYBE_CLASS_TYPE_P (base))
2768 error ("%qT is not a class type", base);
2773 if (cp_type_quals (base) != 0)
2775 /* DR 484: Can a base-specifier name a cv-qualified
2777 base = TYPE_MAIN_VARIANT (base);
2779 result = build_tree_list (access, base);
2781 TREE_TYPE (result) = integer_type_node;
2787 /* If FNS is a member function, a set of member functions, or a
2788 template-id referring to one or more member functions, return a
2789 BASELINK for FNS, incorporating the current access context.
2790 Otherwise, return FNS unchanged. */
2793 baselink_for_fns (tree fns)
2798 if (BASELINK_P (fns)
2799 || error_operand_p (fns))
2803 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2804 fn = TREE_OPERAND (fn, 0);
2805 fn = get_first_fn (fn);
2806 if (!DECL_FUNCTION_MEMBER_P (fn))
2809 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2811 cl = DECL_CONTEXT (fn);
2812 cl = TYPE_BINFO (cl);
2813 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2816 /* Returns true iff DECL is an automatic variable from a function outside
2820 outer_automatic_var_p (tree decl)
2822 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2823 && DECL_FUNCTION_SCOPE_P (decl)
2824 && !TREE_STATIC (decl)
2825 && DECL_CONTEXT (decl) != current_function_decl);
2828 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2829 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2830 if non-NULL, is the type or namespace used to explicitly qualify
2831 ID_EXPRESSION. DECL is the entity to which that name has been
2834 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2835 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2836 be set to true if this expression isn't permitted in a
2837 constant-expression, but it is otherwise not set by this function.
2838 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2839 constant-expression, but a non-constant expression is also
2842 DONE is true if this expression is a complete postfix-expression;
2843 it is false if this expression is followed by '->', '[', '(', etc.
2844 ADDRESS_P is true iff this expression is the operand of '&'.
2845 TEMPLATE_P is true iff the qualified-id was of the form
2846 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2847 appears as a template argument.
2849 If an error occurs, and it is the kind of error that might cause
2850 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2851 is the caller's responsibility to issue the message. *ERROR_MSG
2852 will be a string with static storage duration, so the caller need
2855 Return an expression for the entity, after issuing appropriate
2856 diagnostics. This function is also responsible for transforming a
2857 reference to a non-static member into a COMPONENT_REF that makes
2858 the use of "this" explicit.
2860 Upon return, *IDK will be filled in appropriately. */
2862 finish_id_expression (tree id_expression,
2866 bool integral_constant_expression_p,
2867 bool allow_non_integral_constant_expression_p,
2868 bool *non_integral_constant_expression_p,
2872 bool template_arg_p,
2873 const char **error_msg,
2874 location_t location)
2876 /* Initialize the output parameters. */
2877 *idk = CP_ID_KIND_NONE;
2880 if (id_expression == error_mark_node)
2881 return error_mark_node;
2882 /* If we have a template-id, then no further lookup is
2883 required. If the template-id was for a template-class, we
2884 will sometimes have a TYPE_DECL at this point. */
2885 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2886 || TREE_CODE (decl) == TYPE_DECL)
2888 /* Look up the name. */
2891 if (decl == error_mark_node)
2893 /* Name lookup failed. */
2896 || (!dependent_type_p (scope)
2897 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2898 && IDENTIFIER_TYPENAME_P (id_expression)
2899 && dependent_type_p (TREE_TYPE (id_expression))))))
2901 /* If the qualifying type is non-dependent (and the name
2902 does not name a conversion operator to a dependent
2903 type), issue an error. */
2904 qualified_name_lookup_error (scope, id_expression, decl, location);
2905 return error_mark_node;
2909 /* It may be resolved via Koenig lookup. */
2910 *idk = CP_ID_KIND_UNQUALIFIED;
2911 return id_expression;
2914 decl = id_expression;
2916 /* If DECL is a variable that would be out of scope under
2917 ANSI/ISO rules, but in scope in the ARM, name lookup
2918 will succeed. Issue a diagnostic here. */
2920 decl = check_for_out_of_scope_variable (decl);
2922 /* Remember that the name was used in the definition of
2923 the current class so that we can check later to see if
2924 the meaning would have been different after the class
2925 was entirely defined. */
2926 if (!scope && decl != error_mark_node
2927 && TREE_CODE (id_expression) == IDENTIFIER_NODE)
2928 maybe_note_name_used_in_class (id_expression, decl);
2930 /* Disallow uses of local variables from containing functions, except
2931 within lambda-expressions. */
2932 if (outer_automatic_var_p (decl)
2933 /* It's not a use (3.2) if we're in an unevaluated context. */
2934 && !cp_unevaluated_operand)
2936 tree context = DECL_CONTEXT (decl);
2937 tree containing_function = current_function_decl;
2938 tree lambda_stack = NULL_TREE;
2939 tree lambda_expr = NULL_TREE;
2940 tree initializer = convert_from_reference (decl);
2942 /* Mark it as used now even if the use is ill-formed. */
2945 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2946 support for an approach in which a reference to a local
2947 [constant] automatic variable in a nested class or lambda body
2948 would enter the expression as an rvalue, which would reduce
2949 the complexity of the problem"
2951 FIXME update for final resolution of core issue 696. */
2952 if (decl_constant_var_p (decl))
2953 return integral_constant_value (decl);
2955 /* If we are in a lambda function, we can move out until we hit
2957 2. a non-lambda function, or
2958 3. a non-default capturing lambda function. */
2959 while (context != containing_function
2960 && LAMBDA_FUNCTION_P (containing_function))
2962 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2963 (DECL_CONTEXT (containing_function));
2965 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2969 lambda_stack = tree_cons (NULL_TREE,
2974 = decl_function_context (containing_function);
2977 if (context == containing_function)
2979 decl = add_default_capture (lambda_stack,
2980 /*id=*/DECL_NAME (decl),
2983 else if (lambda_expr)
2985 error ("%qD is not captured", decl);
2986 return error_mark_node;
2990 error (TREE_CODE (decl) == VAR_DECL
2991 ? G_("use of %<auto%> variable from containing function")
2992 : G_("use of parameter from containing function"));
2993 error (" %q+#D declared here", decl);
2994 return error_mark_node;
2998 /* Also disallow uses of function parameters outside the function
2999 body, except inside an unevaluated context (i.e. decltype). */
3000 if (TREE_CODE (decl) == PARM_DECL
3001 && DECL_CONTEXT (decl) == NULL_TREE
3002 && !cp_unevaluated_operand)
3004 error ("use of parameter %qD outside function body", decl);
3005 return error_mark_node;
3009 /* If we didn't find anything, or what we found was a type,
3010 then this wasn't really an id-expression. */
3011 if (TREE_CODE (decl) == TEMPLATE_DECL
3012 && !DECL_FUNCTION_TEMPLATE_P (decl))
3014 *error_msg = "missing template arguments";
3015 return error_mark_node;
3017 else if (TREE_CODE (decl) == TYPE_DECL
3018 || TREE_CODE (decl) == NAMESPACE_DECL)
3020 *error_msg = "expected primary-expression";
3021 return error_mark_node;
3024 /* If the name resolved to a template parameter, there is no
3025 need to look it up again later. */
3026 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3027 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3031 *idk = CP_ID_KIND_NONE;
3032 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3033 decl = TEMPLATE_PARM_DECL (decl);
3034 r = convert_from_reference (DECL_INITIAL (decl));
3036 if (integral_constant_expression_p
3037 && !dependent_type_p (TREE_TYPE (decl))
3038 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3040 if (!allow_non_integral_constant_expression_p)
3041 error ("template parameter %qD of type %qT is not allowed in "
3042 "an integral constant expression because it is not of "
3043 "integral or enumeration type", decl, TREE_TYPE (decl));
3044 *non_integral_constant_expression_p = true;
3048 /* Similarly, we resolve enumeration constants to their
3049 underlying values. */
3050 else if (TREE_CODE (decl) == CONST_DECL)
3052 *idk = CP_ID_KIND_NONE;
3053 if (!processing_template_decl)
3055 used_types_insert (TREE_TYPE (decl));
3056 return DECL_INITIAL (decl);
3064 /* If the declaration was explicitly qualified indicate
3065 that. The semantics of `A::f(3)' are different than
3066 `f(3)' if `f' is virtual. */
3068 ? CP_ID_KIND_QUALIFIED
3069 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3070 ? CP_ID_KIND_TEMPLATE_ID
3071 : CP_ID_KIND_UNQUALIFIED));
3076 An id-expression is type-dependent if it contains an
3077 identifier that was declared with a dependent type.
3079 The standard is not very specific about an id-expression that
3080 names a set of overloaded functions. What if some of them
3081 have dependent types and some of them do not? Presumably,
3082 such a name should be treated as a dependent name. */
3083 /* Assume the name is not dependent. */
3084 dependent_p = false;
3085 if (!processing_template_decl)
3086 /* No names are dependent outside a template. */
3088 /* A template-id where the name of the template was not resolved
3089 is definitely dependent. */
3090 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3091 && (TREE_CODE (TREE_OPERAND (decl, 0))
3092 == IDENTIFIER_NODE))
3094 /* For anything except an overloaded function, just check its
3096 else if (!is_overloaded_fn (decl))
3098 = dependent_type_p (TREE_TYPE (decl));
3099 /* For a set of overloaded functions, check each of the
3105 if (BASELINK_P (fns))
3106 fns = BASELINK_FUNCTIONS (fns);
3108 /* For a template-id, check to see if the template
3109 arguments are dependent. */
3110 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3112 tree args = TREE_OPERAND (fns, 1);
3113 dependent_p = any_dependent_template_arguments_p (args);
3114 /* The functions are those referred to by the
3116 fns = TREE_OPERAND (fns, 0);
3119 /* If there are no dependent template arguments, go through
3120 the overloaded functions. */
3121 while (fns && !dependent_p)
3123 tree fn = OVL_CURRENT (fns);
3125 /* Member functions of dependent classes are
3127 if (TREE_CODE (fn) == FUNCTION_DECL
3128 && type_dependent_expression_p (fn))
3130 else if (TREE_CODE (fn) == TEMPLATE_DECL
3131 && dependent_template_p (fn))
3134 fns = OVL_NEXT (fns);
3138 /* If the name was dependent on a template parameter, we will
3139 resolve the name at instantiation time. */
3142 /* Create a SCOPE_REF for qualified names, if the scope is
3148 if (address_p && done)
3149 decl = finish_qualified_id_expr (scope, decl,
3155 tree type = NULL_TREE;
3156 if (DECL_P (decl) && !dependent_scope_p (scope))
3157 type = TREE_TYPE (decl);
3158 decl = build_qualified_name (type,
3164 if (TREE_TYPE (decl))
3165 decl = convert_from_reference (decl);
3168 /* A TEMPLATE_ID already contains all the information we
3170 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3171 return id_expression;
3172 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3173 /* If we found a variable, then name lookup during the
3174 instantiation will always resolve to the same VAR_DECL
3175 (or an instantiation thereof). */
3176 if (TREE_CODE (decl) == VAR_DECL
3177 || TREE_CODE (decl) == PARM_DECL)
3180 return convert_from_reference (decl);
3182 /* The same is true for FIELD_DECL, but we also need to
3183 make sure that the syntax is correct. */
3184 else if (TREE_CODE (decl) == FIELD_DECL)
3186 /* Since SCOPE is NULL here, this is an unqualified name.
3187 Access checking has been performed during name lookup
3188 already. Turn off checking to avoid duplicate errors. */
3189 push_deferring_access_checks (dk_no_check);
3190 decl = finish_non_static_data_member
3192 /*qualifying_scope=*/NULL_TREE);
3193 pop_deferring_access_checks ();
3196 return id_expression;
3199 if (TREE_CODE (decl) == NAMESPACE_DECL)
3201 error ("use of namespace %qD as expression", decl);
3202 return error_mark_node;
3204 else if (DECL_CLASS_TEMPLATE_P (decl))
3206 error ("use of class template %qT as expression", decl);
3207 return error_mark_node;
3209 else if (TREE_CODE (decl) == TREE_LIST)
3211 /* Ambiguous reference to base members. */
3212 error ("request for member %qD is ambiguous in "
3213 "multiple inheritance lattice", id_expression);
3214 print_candidates (decl);
3215 return error_mark_node;
3218 /* Mark variable-like entities as used. Functions are similarly
3219 marked either below or after overload resolution. */
3220 if (TREE_CODE (decl) == VAR_DECL
3221 || TREE_CODE (decl) == PARM_DECL
3222 || TREE_CODE (decl) == RESULT_DECL)
3225 /* Only certain kinds of names are allowed in constant
3226 expression. Enumerators and template parameters have already
3227 been handled above. */
3228 if (! error_operand_p (decl)
3229 && integral_constant_expression_p
3230 && ! decl_constant_var_p (decl)
3231 && ! builtin_valid_in_constant_expr_p (decl))
3233 if (!allow_non_integral_constant_expression_p)
3235 error ("%qD cannot appear in a constant-expression", decl);
3236 return error_mark_node;
3238 *non_integral_constant_expression_p = true;
3243 decl = (adjust_result_of_qualified_name_lookup
3244 (decl, scope, current_nonlambda_class_type()));
3246 if (TREE_CODE (decl) == FUNCTION_DECL)
3249 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3250 decl = finish_qualified_id_expr (scope,
3258 tree r = convert_from_reference (decl);
3260 /* In a template, return a SCOPE_REF for most qualified-ids
3261 so that we can check access at instantiation time. But if
3262 we're looking at a member of the current instantiation, we
3263 know we have access and building up the SCOPE_REF confuses
3264 non-type template argument handling. */
3265 if (processing_template_decl && TYPE_P (scope)
3266 && !currently_open_class (scope))
3267 r = build_qualified_name (TREE_TYPE (r),
3273 else if (TREE_CODE (decl) == FIELD_DECL)
3275 /* Since SCOPE is NULL here, this is an unqualified name.
3276 Access checking has been performed during name lookup
3277 already. Turn off checking to avoid duplicate errors. */
3278 push_deferring_access_checks (dk_no_check);
3279 decl = finish_non_static_data_member (decl, NULL_TREE,
3280 /*qualifying_scope=*/NULL_TREE);
3281 pop_deferring_access_checks ();
3283 else if (is_overloaded_fn (decl))
3287 first_fn = get_first_fn (decl);
3288 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3289 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3291 if (!really_overloaded_fn (decl)
3292 && !mark_used (first_fn))
3293 return error_mark_node;
3296 && TREE_CODE (first_fn) == FUNCTION_DECL
3297 && DECL_FUNCTION_MEMBER_P (first_fn)
3298 && !shared_member_p (decl))
3300 /* A set of member functions. */
3301 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3302 return finish_class_member_access_expr (decl, id_expression,
3303 /*template_p=*/false,
3304 tf_warning_or_error);
3307 decl = baselink_for_fns (decl);
3311 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3312 && DECL_CLASS_SCOPE_P (decl))
3314 tree context = context_for_name_lookup (decl);
3315 if (context != current_class_type)
3317 tree path = currently_open_derived_class (context);
3318 perform_or_defer_access_check (TYPE_BINFO (path),
3323 decl = convert_from_reference (decl);
3327 if (TREE_DEPRECATED (decl))
3328 warn_deprecated_use (decl, NULL_TREE);
3333 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3334 use as a type-specifier. */
3337 finish_typeof (tree expr)
3341 if (type_dependent_expression_p (expr))
3343 type = cxx_make_type (TYPEOF_TYPE);
3344 TYPEOF_TYPE_EXPR (type) = expr;
3345 SET_TYPE_STRUCTURAL_EQUALITY (type);
3350 expr = mark_type_use (expr);
3352 type = unlowered_expr_type (expr);
3354 if (!type || type == unknown_type_node)
3356 error ("type of %qE is unknown", expr);
3357 return error_mark_node;
3363 /* Implement the __underlying_type keyword: Return the underlying
3364 type of TYPE, suitable for use as a type-specifier. */
3367 finish_underlying_type (tree type)
3369 tree underlying_type;
3371 if (processing_template_decl)
3373 underlying_type = cxx_make_type (UNDERLYING_TYPE);
3374 UNDERLYING_TYPE_TYPE (underlying_type) = type;
3375 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type);
3377 return underlying_type;
3380 complete_type (type);
3382 if (TREE_CODE (type) != ENUMERAL_TYPE)
3384 error ("%qE is not an enumeration type", type);
3385 return error_mark_node;
3388 underlying_type = ENUM_UNDERLYING_TYPE (type);
3390 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3391 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3392 See finish_enum_value_list for details. */
3393 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type))
3395 = c_common_type_for_mode (TYPE_MODE (underlying_type),
3396 TYPE_UNSIGNED (underlying_type));
3398 return underlying_type;
3401 /* Implement the __direct_bases keyword: Return the direct base classes
3405 calculate_direct_bases (tree type)
3407 VEC(tree, gc) *vector = make_tree_vector();
3408 tree bases_vec = NULL_TREE;
3409 VEC(tree, none) *base_binfos;
3413 complete_type (type);
3415 if (!NON_UNION_CLASS_TYPE_P (type))
3416 return make_tree_vec (0);
3418 base_binfos = BINFO_BASE_BINFOS (TYPE_BINFO (type));
3420 /* Virtual bases are initialized first */
3421 for (i = 0; VEC_iterate (tree, base_binfos, i, binfo); i++)
3423 if (BINFO_VIRTUAL_P (binfo))
3425 VEC_safe_push (tree, gc, vector, binfo);
3429 /* Now non-virtuals */
3430 for (i = 0; VEC_iterate (tree, base_binfos, i, binfo); i++)
3432 if (!BINFO_VIRTUAL_P (binfo))
3434 VEC_safe_push (tree, gc, vector, binfo);
3439 bases_vec = make_tree_vec (VEC_length (tree, vector));
3441 for (i = 0; i < VEC_length (tree, vector); ++i)
3443 TREE_VEC_ELT (bases_vec, i) = BINFO_TYPE (VEC_index (tree, vector, i));
3448 /* Implement the __bases keyword: Return the base classes
3451 /* Find morally non-virtual base classes by walking binfo hierarchy */
3452 /* Virtual base classes are handled separately in finish_bases */
3455 dfs_calculate_bases_pre (tree binfo, ATTRIBUTE_UNUSED void *data_)
3457 /* Don't walk bases of virtual bases */
3458 return BINFO_VIRTUAL_P (binfo) ? dfs_skip_bases : NULL_TREE;
3462 dfs_calculate_bases_post (tree binfo, void *data_)
3464 VEC(tree, gc) **data = (VEC(tree, gc) **) data_;
3465 if (!BINFO_VIRTUAL_P (binfo))
3467 VEC_safe_push (tree, gc, *data, BINFO_TYPE (binfo));
3472 /* Calculates the morally non-virtual base classes of a class */
3473 static VEC(tree, gc) *
3474 calculate_bases_helper (tree type)
3476 VEC(tree, gc) *vector = make_tree_vector();
3478 /* Now add non-virtual base classes in order of construction */
3479 dfs_walk_all (TYPE_BINFO (type),
3480 dfs_calculate_bases_pre, dfs_calculate_bases_post, &vector);
3485 calculate_bases (tree type)
3487 VEC(tree, gc) *vector = make_tree_vector();
3488 tree bases_vec = NULL_TREE;
3490 VEC(tree, gc) *vbases;
3491 VEC(tree, gc) *nonvbases;
3494 complete_type (type);
3496 if (!NON_UNION_CLASS_TYPE_P (type))
3497 return make_tree_vec (0);
3499 /* First go through virtual base classes */
3500 for (vbases = CLASSTYPE_VBASECLASSES (type), i = 0;
3501 VEC_iterate (tree, vbases, i, binfo); i++)
3503 VEC(tree, gc) *vbase_bases = calculate_bases_helper (BINFO_TYPE (binfo));
3504 VEC_safe_splice (tree, gc, vector, vbase_bases);
3505 release_tree_vector (vbase_bases);
3508 /* Now for the non-virtual bases */
3509 nonvbases = calculate_bases_helper (type);
3510 VEC_safe_splice (tree, gc, vector, nonvbases);
3511 release_tree_vector (nonvbases);
3513 /* Last element is entire class, so don't copy */
3514 bases_vec = make_tree_vec (VEC_length (tree, vector) - 1);
3516 for (i = 0; i < VEC_length (tree, vector) - 1; ++i)
3518 TREE_VEC_ELT (bases_vec, i) = VEC_index (tree, vector, i);
3520 release_tree_vector (vector);
3525 finish_bases (tree type, bool direct)
3527 tree bases = NULL_TREE;
3529 if (!processing_template_decl)
3531 /* Parameter packs can only be used in templates */
3532 error ("Parameter pack __bases only valid in template declaration");
3533 return error_mark_node;
3536 bases = cxx_make_type (BASES);
3537 BASES_TYPE (bases) = type;
3538 BASES_DIRECT (bases) = direct;
3539 SET_TYPE_STRUCTURAL_EQUALITY (bases);
3544 /* Perform C++-specific checks for __builtin_offsetof before calling
3548 finish_offsetof (tree expr)
3550 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3552 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3553 TREE_OPERAND (expr, 2));
3554 return error_mark_node;
3556 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3557 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3558 || TREE_TYPE (expr) == unknown_type_node)
3560 if (TREE_CODE (expr) == COMPONENT_REF
3561 || TREE_CODE (expr) == COMPOUND_EXPR)
3562 expr = TREE_OPERAND (expr, 1);
3563 error ("cannot apply %<offsetof%> to member function %qD", expr);
3564 return error_mark_node;
3566 if (REFERENCE_REF_P (expr))
3567 expr = TREE_OPERAND (expr, 0);
3568 if (TREE_CODE (expr) == COMPONENT_REF)
3570 tree object = TREE_OPERAND (expr, 0);
3571 if (!complete_type_or_else (TREE_TYPE (object), object))
3572 return error_mark_node;
3574 return fold_offsetof (expr);
3577 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3578 function is broken out from the above for the benefit of the tree-ssa
3582 simplify_aggr_init_expr (tree *tp)
3584 tree aggr_init_expr = *tp;
3586 /* Form an appropriate CALL_EXPR. */
3587 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3588 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3589 tree type = TREE_TYPE (slot);
3592 enum style_t { ctor, arg, pcc } style;
3594 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3596 #ifdef PCC_STATIC_STRUCT_RETURN
3602 gcc_assert (TREE_ADDRESSABLE (type));
3606 call_expr = build_call_array_loc (input_location,
3607 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3609 aggr_init_expr_nargs (aggr_init_expr),
3610 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3611 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3615 /* Replace the first argument to the ctor with the address of the
3617 cxx_mark_addressable (slot);
3618 CALL_EXPR_ARG (call_expr, 0) =
3619 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3621 else if (style == arg)
3623 /* Just mark it addressable here, and leave the rest to
3624 expand_call{,_inline}. */
3625 cxx_mark_addressable (slot);
3626 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3627 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3629 else if (style == pcc)
3631 /* If we're using the non-reentrant PCC calling convention, then we
3632 need to copy the returned value out of the static buffer into the
3634 push_deferring_access_checks (dk_no_check);
3635 call_expr = build_aggr_init (slot, call_expr,
3636 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3637 tf_warning_or_error);
3638 pop_deferring_access_checks ();
3639 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3642 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3644 tree init = build_zero_init (type, NULL_TREE,
3645 /*static_storage_p=*/false);
3646 init = build2 (INIT_EXPR, void_type_node, slot, init);
3647 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3654 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3657 emit_associated_thunks (tree fn)
3659 /* When we use vcall offsets, we emit thunks with the virtual
3660 functions to which they thunk. The whole point of vcall offsets
3661 is so that you can know statically the entire set of thunks that
3662 will ever be needed for a given virtual function, thereby
3663 enabling you to output all the thunks with the function itself. */
3664 if (DECL_VIRTUAL_P (fn)
3665 /* Do not emit thunks for extern template instantiations. */
3666 && ! DECL_REALLY_EXTERN (fn))
3670 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3672 if (!THUNK_ALIAS (thunk))
3674 use_thunk (thunk, /*emit_p=*/1);
3675 if (DECL_RESULT_THUNK_P (thunk))
3679 for (probe = DECL_THUNKS (thunk);
3680 probe; probe = DECL_CHAIN (probe))
3681 use_thunk (probe, /*emit_p=*/1);
3685 gcc_assert (!DECL_THUNKS (thunk));
3690 /* Returns true iff FUN is an instantiation of a constexpr function
3694 is_instantiation_of_constexpr (tree fun)
3696 return (DECL_TEMPLOID_INSTANTIATION (fun)
3697 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3698 (DECL_TI_TEMPLATE (fun))));
3701 /* Generate RTL for FN. */
3704 expand_or_defer_fn_1 (tree fn)
3706 /* When the parser calls us after finishing the body of a template
3707 function, we don't really want to expand the body. */
3708 if (processing_template_decl)
3710 /* Normally, collection only occurs in rest_of_compilation. So,
3711 if we don't collect here, we never collect junk generated
3712 during the processing of templates until we hit a
3713 non-template function. It's not safe to do this inside a
3714 nested class, though, as the parser may have local state that
3715 is not a GC root. */
3716 if (!function_depth)
3721 gcc_assert (DECL_SAVED_TREE (fn));
3723 /* If this is a constructor or destructor body, we have to clone
3725 if (maybe_clone_body (fn))
3727 /* We don't want to process FN again, so pretend we've written
3728 it out, even though we haven't. */
3729 TREE_ASM_WRITTEN (fn) = 1;
3730 /* If this is an instantiation of a constexpr function, keep
3731 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3732 if (!is_instantiation_of_constexpr (fn))
3733 DECL_SAVED_TREE (fn) = NULL_TREE;
3737 /* We make a decision about linkage for these functions at the end
3738 of the compilation. Until that point, we do not want the back
3739 end to output them -- but we do want it to see the bodies of
3740 these functions so that it can inline them as appropriate. */
3741 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3743 if (DECL_INTERFACE_KNOWN (fn))
3744 /* We've already made a decision as to how this function will
3748 DECL_EXTERNAL (fn) = 1;
3749 DECL_NOT_REALLY_EXTERN (fn) = 1;
3750 note_vague_linkage_fn (fn);
3751 /* A non-template inline function with external linkage will
3752 always be COMDAT. As we must eventually determine the
3753 linkage of all functions, and as that causes writes to
3754 the data mapped in from the PCH file, it's advantageous
3755 to mark the functions at this point. */
3756 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3758 /* This function must have external linkage, as
3759 otherwise DECL_INTERFACE_KNOWN would have been
3761 gcc_assert (TREE_PUBLIC (fn));
3762 comdat_linkage (fn);
3763 DECL_INTERFACE_KNOWN (fn) = 1;
3767 import_export_decl (fn);
3769 /* If the user wants us to keep all inline functions, then mark
3770 this function as needed so that finish_file will make sure to
3771 output it later. Similarly, all dllexport'd functions must
3772 be emitted; there may be callers in other DLLs. */
3773 if ((flag_keep_inline_functions
3774 && DECL_DECLARED_INLINE_P (fn)
3775 && !DECL_REALLY_EXTERN (fn))
3776 || (flag_keep_inline_dllexport
3777 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3780 DECL_EXTERNAL (fn) = 0;
3784 /* There's no reason to do any of the work here if we're only doing
3785 semantic analysis; this code just generates RTL. */
3786 if (flag_syntax_only)
3793 expand_or_defer_fn (tree fn)
3795 if (expand_or_defer_fn_1 (fn))
3799 /* Expand or defer, at the whim of the compilation unit manager. */
3800 cgraph_finalize_function (fn, function_depth > 1);
3801 emit_associated_thunks (fn);
3814 /* Helper function for walk_tree, used by finalize_nrv below. */
3817 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3819 struct nrv_data *dp = (struct nrv_data *)data;
3822 /* No need to walk into types. There wouldn't be any need to walk into
3823 non-statements, except that we have to consider STMT_EXPRs. */
3826 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3827 but differs from using NULL_TREE in that it indicates that we care
3828 about the value of the RESULT_DECL. */
3829 else if (TREE_CODE (*tp) == RETURN_EXPR)
3830 TREE_OPERAND (*tp, 0) = dp->result;
3831 /* Change all cleanups for the NRV to only run when an exception is
3833 else if (TREE_CODE (*tp) == CLEANUP_STMT
3834 && CLEANUP_DECL (*tp) == dp->var)
3835 CLEANUP_EH_ONLY (*tp) = 1;
3836 /* Replace the DECL_EXPR for the NRV with an initialization of the
3837 RESULT_DECL, if needed. */
3838 else if (TREE_CODE (*tp) == DECL_EXPR
3839 && DECL_EXPR_DECL (*tp) == dp->var)
3842 if (DECL_INITIAL (dp->var)
3843 && DECL_INITIAL (dp->var) != error_mark_node)
3844 init = build2 (INIT_EXPR, void_type_node, dp->result,
3845 DECL_INITIAL (dp->var));
3847 init = build_empty_stmt (EXPR_LOCATION (*tp));
3848 DECL_INITIAL (dp->var) = NULL_TREE;
3849 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3852 /* And replace all uses of the NRV with the RESULT_DECL. */
3853 else if (*tp == dp->var)
3856 /* Avoid walking into the same tree more than once. Unfortunately, we
3857 can't just use walk_tree_without duplicates because it would only call
3858 us for the first occurrence of dp->var in the function body. */
3859 slot = htab_find_slot (dp->visited, *tp, INSERT);
3865 /* Keep iterating. */
3869 /* Called from finish_function to implement the named return value
3870 optimization by overriding all the RETURN_EXPRs and pertinent
3871 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3872 RESULT_DECL for the function. */
3875 finalize_nrv (tree *tp, tree var, tree result)
3877 struct nrv_data data;
3879 /* Copy name from VAR to RESULT. */
3880 DECL_NAME (result) = DECL_NAME (var);
3881 /* Don't forget that we take its address. */
3882 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3883 /* Finally set DECL_VALUE_EXPR to avoid assigning
3884 a stack slot at -O0 for the original var and debug info
3885 uses RESULT location for VAR. */
3886 SET_DECL_VALUE_EXPR (var, result);
3887 DECL_HAS_VALUE_EXPR_P (var) = 1;
3890 data.result = result;
3891 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3892 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3893 htab_delete (data.visited);
3896 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3899 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3900 bool need_copy_ctor, bool need_copy_assignment)
3902 int save_errorcount = errorcount;
3905 /* Always allocate 3 elements for simplicity. These are the
3906 function decls for the ctor, dtor, and assignment op.
3907 This layout is known to the three lang hooks,
3908 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3909 and cxx_omp_clause_assign_op. */
3910 info = make_tree_vec (3);
3911 CP_OMP_CLAUSE_INFO (c) = info;
3913 if (need_default_ctor || need_copy_ctor)
3915 if (need_default_ctor)
3916 t = get_default_ctor (type);
3918 t = get_copy_ctor (type, tf_warning_or_error);
3920 if (t && !trivial_fn_p (t))
3921 TREE_VEC_ELT (info, 0) = t;
3924 if ((need_default_ctor || need_copy_ctor)
3925 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3926 TREE_VEC_ELT (info, 1) = get_dtor (type, tf_warning_or_error);
3928 if (need_copy_assignment)
3930 t = get_copy_assign (type);
3932 if (t && !trivial_fn_p (t))
3933 TREE_VEC_ELT (info, 2) = t;
3936 return errorcount != save_errorcount;
3939 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3940 Remove any elements from the list that are invalid. */
3943 finish_omp_clauses (tree clauses)
3945 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3946 tree c, t, *pc = &clauses;
3949 bitmap_obstack_initialize (NULL);
3950 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3951 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3952 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3954 for (pc = &clauses, c = clauses; c ; c = *pc)
3956 bool remove = false;
3958 switch (OMP_CLAUSE_CODE (c))
3960 case OMP_CLAUSE_SHARED:
3962 goto check_dup_generic;
3963 case OMP_CLAUSE_PRIVATE:
3965 goto check_dup_generic;
3966 case OMP_CLAUSE_REDUCTION:
3968 goto check_dup_generic;
3969 case OMP_CLAUSE_COPYPRIVATE:
3970 name = "copyprivate";
3971 goto check_dup_generic;
3972 case OMP_CLAUSE_COPYIN:
3974 goto check_dup_generic;
3976 t = OMP_CLAUSE_DECL (c);
3977 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3979 if (processing_template_decl)
3982 error ("%qD is not a variable in clause %qs", t, name);
3984 error ("%qE is not a variable in clause %qs", t, name);
3987 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3988 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3989 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3991 error ("%qD appears more than once in data clauses", t);
3995 bitmap_set_bit (&generic_head, DECL_UID (t));
3998 case OMP_CLAUSE_FIRSTPRIVATE:
3999 t = OMP_CLAUSE_DECL (c);
4000 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4002 if (processing_template_decl)
4005 error ("%qD is not a variable in clause %<firstprivate%>", t);
4007 error ("%qE is not a variable in clause %<firstprivate%>", t);
4010 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4011 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4013 error ("%qD appears more than once in data clauses", t);
4017 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
4020 case OMP_CLAUSE_LASTPRIVATE:
4021 t = OMP_CLAUSE_DECL (c);
4022 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4024 if (processing_template_decl)
4027 error ("%qD is not a variable in clause %<lastprivate%>", t);
4029 error ("%qE is not a variable in clause %<lastprivate%>", t);
4032 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4033 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4035 error ("%qD appears more than once in data clauses", t);
4039 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
4043 t = OMP_CLAUSE_IF_EXPR (c);
4044 t = maybe_convert_cond (t);
4045 if (t == error_mark_node)
4047 OMP_CLAUSE_IF_EXPR (c) = t;
4050 case OMP_CLAUSE_FINAL:
4051 t = OMP_CLAUSE_FINAL_EXPR (c);
4052 t = maybe_convert_cond (t);
4053 if (t == error_mark_node)
4055 OMP_CLAUSE_FINAL_EXPR (c) = t;
4058 case OMP_CLAUSE_NUM_THREADS:
4059 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
4060 if (t == error_mark_node)
4062 else if (!type_dependent_expression_p (t)
4063 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4065 error ("num_threads expression must be integral");
4070 case OMP_CLAUSE_SCHEDULE:
4071 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
4074 else if (t == error_mark_node)
4076 else if (!type_dependent_expression_p (t)
4077 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4079 error ("schedule chunk size expression must be integral");
4084 case OMP_CLAUSE_NOWAIT:
4085 case OMP_CLAUSE_ORDERED:
4086 case OMP_CLAUSE_DEFAULT:
4087 case OMP_CLAUSE_UNTIED:
4088 case OMP_CLAUSE_COLLAPSE:
4089 case OMP_CLAUSE_MERGEABLE:
4097 *pc = OMP_CLAUSE_CHAIN (c);
4099 pc = &OMP_CLAUSE_CHAIN (c);
4102 for (pc = &clauses, c = clauses; c ; c = *pc)
4104 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
4105 bool remove = false;
4106 bool need_complete_non_reference = false;
4107 bool need_default_ctor = false;
4108 bool need_copy_ctor = false;
4109 bool need_copy_assignment = false;
4110 bool need_implicitly_determined = false;
4111 tree type, inner_type;
4115 case OMP_CLAUSE_SHARED:
4117 need_implicitly_determined = true;
4119 case OMP_CLAUSE_PRIVATE:
4121 need_complete_non_reference = true;
4122 need_default_ctor = true;
4123 need_implicitly_determined = true;
4125 case OMP_CLAUSE_FIRSTPRIVATE:
4126 name = "firstprivate";
4127 need_complete_non_reference = true;
4128 need_copy_ctor = true;
4129 need_implicitly_determined = true;
4131 case OMP_CLAUSE_LASTPRIVATE:
4132 name = "lastprivate";
4133 need_complete_non_reference = true;
4134 need_copy_assignment = true;
4135 need_implicitly_determined = true;
4137 case OMP_CLAUSE_REDUCTION:
4139 need_implicitly_determined = true;
4141 case OMP_CLAUSE_COPYPRIVATE:
4142 name = "copyprivate";
4143 need_copy_assignment = true;
4145 case OMP_CLAUSE_COPYIN:
4147 need_copy_assignment = true;
4150 pc = &OMP_CLAUSE_CHAIN (c);
4154 t = OMP_CLAUSE_DECL (c);
4155 if (processing_template_decl
4156 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4158 pc = &OMP_CLAUSE_CHAIN (c);
4164 case OMP_CLAUSE_LASTPRIVATE:
4165 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4166 need_default_ctor = true;
4169 case OMP_CLAUSE_REDUCTION:
4170 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4171 || POINTER_TYPE_P (TREE_TYPE (t)))
4173 error ("%qE has invalid type for %<reduction%>", t);
4176 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
4178 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
4188 error ("%qE has invalid type for %<reduction(%s)%>",
4189 t, operator_name_info[r_code].name);
4195 case OMP_CLAUSE_COPYIN:
4196 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
4198 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
4207 if (need_complete_non_reference || need_copy_assignment)
4209 t = require_complete_type (t);
4210 if (t == error_mark_node)
4212 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE
4213 && need_complete_non_reference)
4215 error ("%qE has reference type for %qs", t, name);
4219 if (need_implicitly_determined)
4221 const char *share_name = NULL;
4223 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4224 share_name = "threadprivate";
4225 else switch (cxx_omp_predetermined_sharing (t))
4227 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4229 case OMP_CLAUSE_DEFAULT_SHARED:
4230 /* const vars may be specified in firstprivate clause. */
4231 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
4232 && cxx_omp_const_qual_no_mutable (t))
4234 share_name = "shared";
4236 case OMP_CLAUSE_DEFAULT_PRIVATE:
4237 share_name = "private";
4244 error ("%qE is predetermined %qs for %qs",
4245 t, share_name, name);
4250 /* We're interested in the base element, not arrays. */
4251 inner_type = type = TREE_TYPE (t);
4252 while (TREE_CODE (inner_type) == ARRAY_TYPE)
4253 inner_type = TREE_TYPE (inner_type);
4255 /* Check for special function availability by building a call to one.
4256 Save the results, because later we won't be in the right context
4257 for making these queries. */
4258 if (CLASS_TYPE_P (inner_type)
4259 && COMPLETE_TYPE_P (inner_type)
4260 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
4261 && !type_dependent_expression_p (t)
4262 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
4263 need_copy_ctor, need_copy_assignment))
4267 *pc = OMP_CLAUSE_CHAIN (c);
4269 pc = &OMP_CLAUSE_CHAIN (c);
4272 bitmap_obstack_release (NULL);
4276 /* For all variables in the tree_list VARS, mark them as thread local. */
4279 finish_omp_threadprivate (tree vars)
4283 /* Mark every variable in VARS to be assigned thread local storage. */
4284 for (t = vars; t; t = TREE_CHAIN (t))
4286 tree v = TREE_PURPOSE (t);
4288 if (error_operand_p (v))
4290 else if (TREE_CODE (v) != VAR_DECL)
4291 error ("%<threadprivate%> %qD is not file, namespace "
4292 "or block scope variable", v);
4293 /* If V had already been marked threadprivate, it doesn't matter
4294 whether it had been used prior to this point. */
4295 else if (TREE_USED (v)
4296 && (DECL_LANG_SPECIFIC (v) == NULL
4297 || !CP_DECL_THREADPRIVATE_P (v)))
4298 error ("%qE declared %<threadprivate%> after first use", v);
4299 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4300 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4301 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4302 error ("%<threadprivate%> %qE has incomplete type", v);
4303 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4304 && CP_DECL_CONTEXT (v) != current_class_type)
4305 error ("%<threadprivate%> %qE directive not "
4306 "in %qT definition", v, CP_DECL_CONTEXT (v));
4309 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4310 if (DECL_LANG_SPECIFIC (v) == NULL)
4312 retrofit_lang_decl (v);
4314 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4315 after the allocation of the lang_decl structure. */
4316 if (DECL_DISCRIMINATOR_P (v))
4317 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4320 if (! DECL_THREAD_LOCAL_P (v))
4322 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4323 /* If rtl has been already set for this var, call
4324 make_decl_rtl once again, so that encode_section_info
4325 has a chance to look at the new decl flags. */
4326 if (DECL_RTL_SET_P (v))
4329 CP_DECL_THREADPRIVATE_P (v) = 1;
4334 /* Build an OpenMP structured block. */
4337 begin_omp_structured_block (void)
4339 return do_pushlevel (sk_omp);
4343 finish_omp_structured_block (tree block)
4345 return do_poplevel (block);
4348 /* Similarly, except force the retention of the BLOCK. */
4351 begin_omp_parallel (void)
4353 keep_next_level (true);
4354 return begin_omp_structured_block ();
4358 finish_omp_parallel (tree clauses, tree body)
4362 body = finish_omp_structured_block (body);
4364 stmt = make_node (OMP_PARALLEL);
4365 TREE_TYPE (stmt) = void_type_node;
4366 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4367 OMP_PARALLEL_BODY (stmt) = body;
4369 return add_stmt (stmt);
4373 begin_omp_task (void)
4375 keep_next_level (true);
4376 return begin_omp_structured_block ();
4380 finish_omp_task (tree clauses, tree body)
4384 body = finish_omp_structured_block (body);
4386 stmt = make_node (OMP_TASK);
4387 TREE_TYPE (stmt) = void_type_node;
4388 OMP_TASK_CLAUSES (stmt) = clauses;
4389 OMP_TASK_BODY (stmt) = body;
4391 return add_stmt (stmt);
4394 /* Helper function for finish_omp_for. Convert Ith random access iterator
4395 into integral iterator. Return FALSE if successful. */
4398 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4399 tree condv, tree incrv, tree *body,
4400 tree *pre_body, tree clauses)
4402 tree diff, iter_init, iter_incr = NULL, last;
4403 tree incr_var = NULL, orig_pre_body, orig_body, c;
4404 tree decl = TREE_VEC_ELT (declv, i);
4405 tree init = TREE_VEC_ELT (initv, i);
4406 tree cond = TREE_VEC_ELT (condv, i);
4407 tree incr = TREE_VEC_ELT (incrv, i);
4409 location_t elocus = locus;
4411 if (init && EXPR_HAS_LOCATION (init))
4412 elocus = EXPR_LOCATION (init);
4414 switch (TREE_CODE (cond))
4420 if (TREE_OPERAND (cond, 1) == iter)
4421 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4422 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4423 if (TREE_OPERAND (cond, 0) != iter)
4424 cond = error_mark_node;
4427 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4428 TREE_OPERAND (cond, 1), ERROR_MARK,
4429 NULL, tf_warning_or_error);
4430 if (error_operand_p (tem))
4435 cond = error_mark_node;
4438 if (cond == error_mark_node)
4440 error_at (elocus, "invalid controlling predicate");
4443 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4444 ERROR_MARK, iter, ERROR_MARK, NULL,
4445 tf_warning_or_error);
4446 if (error_operand_p (diff))
4448 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4450 error_at (elocus, "difference between %qE and %qD does not have integer type",
4451 TREE_OPERAND (cond, 1), iter);
4455 switch (TREE_CODE (incr))
4457 case PREINCREMENT_EXPR:
4458 case PREDECREMENT_EXPR:
4459 case POSTINCREMENT_EXPR:
4460 case POSTDECREMENT_EXPR:
4461 if (TREE_OPERAND (incr, 0) != iter)
4463 incr = error_mark_node;
4466 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4467 tf_warning_or_error);
4468 if (error_operand_p (iter_incr))
4470 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4471 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4472 incr = integer_one_node;
4474 incr = integer_minus_one_node;
4477 if (TREE_OPERAND (incr, 0) != iter)
4478 incr = error_mark_node;
4479 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4480 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4482 tree rhs = TREE_OPERAND (incr, 1);
4483 if (TREE_OPERAND (rhs, 0) == iter)
4485 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4487 incr = error_mark_node;
4490 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4491 TREE_OPERAND (rhs, 1),
4492 tf_warning_or_error);
4493 if (error_operand_p (iter_incr))
4495 incr = TREE_OPERAND (rhs, 1);
4496 incr = cp_convert (TREE_TYPE (diff), incr);
4497 if (TREE_CODE (rhs) == MINUS_EXPR)
4499 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4500 incr = fold_if_not_in_template (incr);
4502 if (TREE_CODE (incr) != INTEGER_CST
4503 && (TREE_CODE (incr) != NOP_EXPR
4504 || (TREE_CODE (TREE_OPERAND (incr, 0))
4509 else if (TREE_OPERAND (rhs, 1) == iter)
4511 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4512 || TREE_CODE (rhs) != PLUS_EXPR)
4513 incr = error_mark_node;
4516 iter_incr = build_x_binary_op (PLUS_EXPR,
4517 TREE_OPERAND (rhs, 0),
4520 tf_warning_or_error);
4521 if (error_operand_p (iter_incr))
4523 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4525 tf_warning_or_error);
4526 if (error_operand_p (iter_incr))
4528 incr = TREE_OPERAND (rhs, 0);
4533 incr = error_mark_node;
4536 incr = error_mark_node;
4539 incr = error_mark_node;
4543 if (incr == error_mark_node)
4545 error_at (elocus, "invalid increment expression");
4549 incr = cp_convert (TREE_TYPE (diff), incr);
4550 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4551 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4552 && OMP_CLAUSE_DECL (c) == iter)
4555 decl = create_temporary_var (TREE_TYPE (diff));
4557 add_decl_expr (decl);
4558 last = create_temporary_var (TREE_TYPE (diff));
4560 add_decl_expr (last);
4561 if (c && iter_incr == NULL)
4563 incr_var = create_temporary_var (TREE_TYPE (diff));
4564 pushdecl (incr_var);
4565 add_decl_expr (incr_var);
4567 gcc_assert (stmts_are_full_exprs_p ());
4569 orig_pre_body = *pre_body;
4570 *pre_body = push_stmt_list ();
4572 add_stmt (orig_pre_body);
4574 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4575 tf_warning_or_error));
4576 init = build_int_cst (TREE_TYPE (diff), 0);
4577 if (c && iter_incr == NULL)
4579 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4580 incr, tf_warning_or_error));
4582 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4583 tf_warning_or_error);
4585 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4586 tf_warning_or_error));
4587 *pre_body = pop_stmt_list (*pre_body);
4589 cond = cp_build_binary_op (elocus,
4590 TREE_CODE (cond), decl, diff,
4591 tf_warning_or_error);
4592 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4593 elocus, incr, NULL_TREE);
4596 *body = push_stmt_list ();
4597 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4598 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4599 tf_warning_or_error);
4600 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4601 finish_expr_stmt (iter_init);
4602 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4603 tf_warning_or_error));
4604 add_stmt (orig_body);
4605 *body = pop_stmt_list (*body);
4609 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4610 finish_expr_stmt (iter_incr);
4611 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4612 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4615 TREE_VEC_ELT (declv, i) = decl;
4616 TREE_VEC_ELT (initv, i) = init;
4617 TREE_VEC_ELT (condv, i) = cond;
4618 TREE_VEC_ELT (incrv, i) = incr;
4623 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4624 are directly for their associated operands in the statement. DECL
4625 and INIT are a combo; if DECL is NULL then INIT ought to be a
4626 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4627 optional statements that need to go before the loop into its
4631 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4632 tree incrv, tree body, tree pre_body, tree clauses)
4634 tree omp_for = NULL, orig_incr = NULL;
4635 tree decl, init, cond, incr;
4639 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4640 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4641 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4642 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4644 decl = TREE_VEC_ELT (declv, i);
4645 init = TREE_VEC_ELT (initv, i);
4646 cond = TREE_VEC_ELT (condv, i);
4647 incr = TREE_VEC_ELT (incrv, i);
4653 switch (TREE_CODE (init))
4656 decl = TREE_OPERAND (init, 0);
4657 init = TREE_OPERAND (init, 1);
4660 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4662 decl = TREE_OPERAND (init, 0);
4663 init = TREE_OPERAND (init, 2);
4673 "expected iteration declaration or initialization");
4678 if (init && EXPR_HAS_LOCATION (init))
4679 elocus = EXPR_LOCATION (init);
4683 error_at (elocus, "missing controlling predicate");
4689 error_at (elocus, "missing increment expression");
4693 TREE_VEC_ELT (declv, i) = decl;
4694 TREE_VEC_ELT (initv, i) = init;
4697 if (dependent_omp_for_p (declv, initv, condv, incrv))
4701 stmt = make_node (OMP_FOR);
4703 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4705 /* This is really just a place-holder. We'll be decomposing this
4706 again and going through the cp_build_modify_expr path below when
4707 we instantiate the thing. */
4708 TREE_VEC_ELT (initv, i)
4709 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4710 TREE_VEC_ELT (initv, i));
4713 TREE_TYPE (stmt) = void_type_node;
4714 OMP_FOR_INIT (stmt) = initv;
4715 OMP_FOR_COND (stmt) = condv;
4716 OMP_FOR_INCR (stmt) = incrv;
4717 OMP_FOR_BODY (stmt) = body;
4718 OMP_FOR_PRE_BODY (stmt) = pre_body;
4719 OMP_FOR_CLAUSES (stmt) = clauses;
4721 SET_EXPR_LOCATION (stmt, locus);
4722 return add_stmt (stmt);
4725 if (processing_template_decl)
4726 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4728 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4730 decl = TREE_VEC_ELT (declv, i);
4731 init = TREE_VEC_ELT (initv, i);
4732 cond = TREE_VEC_ELT (condv, i);
4733 incr = TREE_VEC_ELT (incrv, i);
4735 TREE_VEC_ELT (orig_incr, i) = incr;
4738 if (init && EXPR_HAS_LOCATION (init))
4739 elocus = EXPR_LOCATION (init);
4743 error_at (elocus, "expected iteration declaration or initialization");
4747 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4750 TREE_VEC_ELT (orig_incr, i) = incr;
4751 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4752 TREE_CODE (TREE_OPERAND (incr, 1)),
4753 TREE_OPERAND (incr, 2),
4754 tf_warning_or_error);
4757 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4759 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4760 incrv, &body, &pre_body, clauses))
4765 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4766 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4768 error_at (elocus, "invalid type for iteration variable %qE", decl);
4772 if (!processing_template_decl)
4774 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4775 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4778 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4780 && TREE_SIDE_EFFECTS (cond)
4781 && COMPARISON_CLASS_P (cond)
4782 && !processing_template_decl)
4784 tree t = TREE_OPERAND (cond, 0);
4785 if (TREE_SIDE_EFFECTS (t)
4787 && (TREE_CODE (t) != NOP_EXPR
4788 || TREE_OPERAND (t, 0) != decl))
4789 TREE_OPERAND (cond, 0)
4790 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4792 t = TREE_OPERAND (cond, 1);
4793 if (TREE_SIDE_EFFECTS (t)
4795 && (TREE_CODE (t) != NOP_EXPR
4796 || TREE_OPERAND (t, 0) != decl))
4797 TREE_OPERAND (cond, 1)
4798 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4800 if (decl == error_mark_node || init == error_mark_node)
4803 TREE_VEC_ELT (declv, i) = decl;
4804 TREE_VEC_ELT (initv, i) = init;
4805 TREE_VEC_ELT (condv, i) = cond;
4806 TREE_VEC_ELT (incrv, i) = incr;
4810 if (IS_EMPTY_STMT (pre_body))
4813 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4816 if (omp_for == NULL)
4819 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4821 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4822 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4824 if (TREE_CODE (incr) != MODIFY_EXPR)
4827 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4828 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4829 && !processing_template_decl)
4831 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4832 if (TREE_SIDE_EFFECTS (t)
4834 && (TREE_CODE (t) != NOP_EXPR
4835 || TREE_OPERAND (t, 0) != decl))
4836 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4837 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4839 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4840 if (TREE_SIDE_EFFECTS (t)
4842 && (TREE_CODE (t) != NOP_EXPR
4843 || TREE_OPERAND (t, 0) != decl))
4844 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4845 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4849 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4851 if (omp_for != NULL)
4852 OMP_FOR_CLAUSES (omp_for) = clauses;
4857 finish_omp_atomic (enum tree_code code, enum tree_code opcode, tree lhs,
4858 tree rhs, tree v, tree lhs1, tree rhs1)
4873 dependent_p = false;
4876 /* Even in a template, we can detect invalid uses of the atomic
4877 pragma if neither LHS nor RHS is type-dependent. */
4878 if (processing_template_decl)
4880 dependent_p = (type_dependent_expression_p (lhs)
4881 || (rhs && type_dependent_expression_p (rhs))
4882 || (v && type_dependent_expression_p (v))
4883 || (lhs1 && type_dependent_expression_p (lhs1))
4884 || (rhs1 && type_dependent_expression_p (rhs1)));
4887 lhs = build_non_dependent_expr (lhs);
4889 rhs = build_non_dependent_expr (rhs);
4891 v = build_non_dependent_expr (v);
4893 lhs1 = build_non_dependent_expr (lhs1);
4895 rhs1 = build_non_dependent_expr (rhs1);
4900 stmt = c_finish_omp_atomic (input_location, code, opcode, lhs, rhs,
4902 if (stmt == error_mark_node)
4905 if (processing_template_decl)
4907 if (code == OMP_ATOMIC_READ)
4909 stmt = build_min_nt (OMP_ATOMIC_READ, orig_lhs);
4910 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
4914 if (opcode == NOP_EXPR)
4915 stmt = build2 (MODIFY_EXPR, void_type_node, orig_lhs, orig_rhs);
4917 stmt = build2 (opcode, void_type_node, orig_lhs, orig_rhs);
4919 stmt = build_min_nt (COMPOUND_EXPR, orig_rhs1, stmt);
4920 if (code != OMP_ATOMIC)
4922 stmt = build_min_nt (code, orig_lhs1, stmt);
4923 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
4926 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);
4932 finish_omp_barrier (void)
4934 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER);
4935 VEC(tree,gc) *vec = make_tree_vector ();
4936 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4937 release_tree_vector (vec);
4938 finish_expr_stmt (stmt);
4942 finish_omp_flush (void)
4944 tree fn = builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE);
4945 VEC(tree,gc) *vec = make_tree_vector ();
4946 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4947 release_tree_vector (vec);
4948 finish_expr_stmt (stmt);
4952 finish_omp_taskwait (void)
4954 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT);
4955 VEC(tree,gc) *vec = make_tree_vector ();
4956 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4957 release_tree_vector (vec);
4958 finish_expr_stmt (stmt);
4962 finish_omp_taskyield (void)
4964 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD);
4965 VEC(tree,gc) *vec = make_tree_vector ();
4966 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4967 release_tree_vector (vec);
4968 finish_expr_stmt (stmt);
4972 init_cp_semantics (void)
4976 /* Build a STATIC_ASSERT for a static assertion with the condition
4977 CONDITION and the message text MESSAGE. LOCATION is the location
4978 of the static assertion in the source code. When MEMBER_P, this
4979 static assertion is a member of a class. */
4981 finish_static_assert (tree condition, tree message, location_t location,
4984 if (check_for_bare_parameter_packs (condition))
4985 condition = error_mark_node;
4987 if (type_dependent_expression_p (condition)
4988 || value_dependent_expression_p (condition))
4990 /* We're in a template; build a STATIC_ASSERT and put it in
4994 assertion = make_node (STATIC_ASSERT);
4995 STATIC_ASSERT_CONDITION (assertion) = condition;
4996 STATIC_ASSERT_MESSAGE (assertion) = message;
4997 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
5000 maybe_add_class_template_decl_list (current_class_type,
5004 add_stmt (assertion);
5009 /* Fold the expression and convert it to a boolean value. */
5010 condition = fold_non_dependent_expr (condition);
5011 condition = cp_convert (boolean_type_node, condition);
5012 condition = maybe_constant_value (condition);
5014 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
5015 /* Do nothing; the condition is satisfied. */
5019 location_t saved_loc = input_location;
5021 input_location = location;
5022 if (TREE_CODE (condition) == INTEGER_CST
5023 && integer_zerop (condition))
5024 /* Report the error. */
5025 error ("static assertion failed: %E", message);
5026 else if (condition && condition != error_mark_node)
5028 error ("non-constant condition for static assertion");
5029 cxx_constant_value (condition);
5031 input_location = saved_loc;
5035 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5036 suitable for use as a type-specifier.
5038 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5039 id-expression or a class member access, FALSE when it was parsed as
5040 a full expression. */
5043 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
5044 tsubst_flags_t complain)
5046 tree type = NULL_TREE;
5048 if (!expr || error_operand_p (expr))
5049 return error_mark_node;
5052 || TREE_CODE (expr) == TYPE_DECL
5053 || (TREE_CODE (expr) == BIT_NOT_EXPR
5054 && TYPE_P (TREE_OPERAND (expr, 0))))
5056 if (complain & tf_error)
5057 error ("argument to decltype must be an expression");
5058 return error_mark_node;
5061 /* FIXME instantiation-dependent */
5062 if (type_dependent_expression_p (expr)
5063 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
5064 if it isn't dependent, so that we can check access control at
5065 instantiation time, so defer the decltype as well (PR 42277). */
5066 || (id_expression_or_member_access_p
5067 && processing_template_decl
5068 && TREE_CODE (expr) == COMPONENT_REF))
5070 type = cxx_make_type (DECLTYPE_TYPE);
5071 DECLTYPE_TYPE_EXPR (type) = expr;
5072 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
5073 = id_expression_or_member_access_p;
5074 SET_TYPE_STRUCTURAL_EQUALITY (type);
5079 /* The type denoted by decltype(e) is defined as follows: */
5081 expr = resolve_nondeduced_context (expr);
5083 if (type_unknown_p (expr))
5085 if (complain & tf_error)
5086 error ("decltype cannot resolve address of overloaded function");
5087 return error_mark_node;
5090 if (invalid_nonstatic_memfn_p (expr, complain))
5091 return error_mark_node;
5093 /* To get the size of a static data member declared as an array of
5094 unknown bound, we need to instantiate it. */
5095 if (TREE_CODE (expr) == VAR_DECL
5096 && VAR_HAD_UNKNOWN_BOUND (expr)
5097 && DECL_TEMPLATE_INSTANTIATION (expr))
5098 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
5100 if (id_expression_or_member_access_p)
5102 /* If e is an id-expression or a class member access (5.2.5
5103 [expr.ref]), decltype(e) is defined as the type of the entity
5104 named by e. If there is no such entity, or e names a set of
5105 overloaded functions, the program is ill-formed. */
5106 if (TREE_CODE (expr) == IDENTIFIER_NODE)
5107 expr = lookup_name (expr);
5109 if (TREE_CODE (expr) == INDIRECT_REF)
5110 /* This can happen when the expression is, e.g., "a.b". Just
5111 look at the underlying operand. */
5112 expr = TREE_OPERAND (expr, 0);
5114 if (TREE_CODE (expr) == OFFSET_REF
5115 || TREE_CODE (expr) == MEMBER_REF)
5116 /* We're only interested in the field itself. If it is a
5117 BASELINK, we will need to see through it in the next
5119 expr = TREE_OPERAND (expr, 1);
5121 if (BASELINK_P (expr))
5122 /* See through BASELINK nodes to the underlying function. */
5123 expr = BASELINK_FUNCTIONS (expr);
5125 switch (TREE_CODE (expr))
5128 if (DECL_BIT_FIELD_TYPE (expr))
5130 type = DECL_BIT_FIELD_TYPE (expr);
5133 /* Fall through for fields that aren't bitfields. */
5140 case TEMPLATE_PARM_INDEX:
5141 expr = mark_type_use (expr);
5142 type = TREE_TYPE (expr);
5146 type = error_mark_node;
5150 mark_type_use (expr);
5151 type = is_bitfield_expr_with_lowered_type (expr);
5153 type = TREE_TYPE (TREE_OPERAND (expr, 1));
5160 /* We can get here when the id-expression refers to an
5162 type = TREE_TYPE (expr);
5167 return error_mark_node;
5172 /* Within a lambda-expression:
5174 Every occurrence of decltype((x)) where x is a possibly
5175 parenthesized id-expression that names an entity of
5176 automatic storage duration is treated as if x were
5177 transformed into an access to a corresponding data member
5178 of the closure type that would have been declared if x
5179 were a use of the denoted entity. */
5180 if (outer_automatic_var_p (expr)
5181 && current_function_decl
5182 && LAMBDA_FUNCTION_P (current_function_decl))
5183 type = capture_decltype (expr);
5184 else if (error_operand_p (expr))
5185 type = error_mark_node;
5186 else if (expr == current_class_ptr)
5187 /* If the expression is just "this", we want the
5188 cv-unqualified pointer for the "this" type. */
5189 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
5192 /* Otherwise, where T is the type of e, if e is an lvalue,
5193 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5194 cp_lvalue_kind clk = lvalue_kind (expr);
5195 type = unlowered_expr_type (expr);
5196 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
5197 if (clk != clk_none && !(clk & clk_class))
5198 type = cp_build_reference_type (type, (clk & clk_rvalueref));
5205 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5206 __has_nothrow_copy, depending on assign_p. */
5209 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5216 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5219 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5221 else if (TYPE_HAS_COPY_CTOR (type))
5223 /* If construction of the copy constructor was postponed, create
5225 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5226 lazily_declare_fn (sfk_copy_constructor, type);
5227 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5228 lazily_declare_fn (sfk_move_constructor, type);
5229 fns = CLASSTYPE_CONSTRUCTORS (type);
5234 for (; fns; fns = OVL_NEXT (fns))
5236 tree fn = OVL_CURRENT (fns);
5240 if (copy_fn_p (fn) == 0)
5243 else if (copy_fn_p (fn) <= 0)
5246 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5253 /* Actually evaluates the trait. */
5256 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5258 enum tree_code type_code1;
5261 type_code1 = TREE_CODE (type1);
5265 case CPTK_HAS_NOTHROW_ASSIGN:
5266 type1 = strip_array_types (type1);
5267 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5268 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5269 || (CLASS_TYPE_P (type1)
5270 && classtype_has_nothrow_assign_or_copy_p (type1,
5273 case CPTK_HAS_TRIVIAL_ASSIGN:
5274 /* ??? The standard seems to be missing the "or array of such a class
5275 type" wording for this trait. */
5276 type1 = strip_array_types (type1);
5277 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5278 && (trivial_type_p (type1)
5279 || (CLASS_TYPE_P (type1)
5280 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5282 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5283 type1 = strip_array_types (type1);
5284 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5285 || (CLASS_TYPE_P (type1)
5286 && (t = locate_ctor (type1))
5287 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5289 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5290 type1 = strip_array_types (type1);
5291 return (trivial_type_p (type1)
5292 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5294 case CPTK_HAS_NOTHROW_COPY:
5295 type1 = strip_array_types (type1);
5296 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5297 || (CLASS_TYPE_P (type1)
5298 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5300 case CPTK_HAS_TRIVIAL_COPY:
5301 /* ??? The standard seems to be missing the "or array of such a class
5302 type" wording for this trait. */
5303 type1 = strip_array_types (type1);
5304 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5305 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5307 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5308 type1 = strip_array_types (type1);
5309 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5310 || (CLASS_TYPE_P (type1)
5311 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5313 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5314 return type_has_virtual_destructor (type1);
5316 case CPTK_IS_ABSTRACT:
5317 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5319 case CPTK_IS_BASE_OF:
5320 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5321 && DERIVED_FROM_P (type1, type2));
5324 return (NON_UNION_CLASS_TYPE_P (type1));
5326 case CPTK_IS_CONVERTIBLE_TO:
5331 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5334 return (type_code1 == ENUMERAL_TYPE);
5336 case CPTK_IS_LITERAL_TYPE:
5337 return (literal_type_p (type1));
5340 return (pod_type_p (type1));
5342 case CPTK_IS_POLYMORPHIC:
5343 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5345 case CPTK_IS_STD_LAYOUT:
5346 return (std_layout_type_p (type1));
5348 case CPTK_IS_TRIVIAL:
5349 return (trivial_type_p (type1));
5352 return (type_code1 == UNION_TYPE);
5360 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5361 void, or a complete type, returns it, otherwise NULL_TREE. */
5364 check_trait_type (tree type)
5366 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5367 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5370 if (VOID_TYPE_P (type))
5373 return complete_type_or_else (strip_array_types (type), NULL_TREE);
5376 /* Process a trait expression. */
5379 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5381 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5382 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5383 || kind == CPTK_HAS_NOTHROW_COPY
5384 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5385 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5386 || kind == CPTK_HAS_TRIVIAL_COPY
5387 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5388 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5389 || kind == CPTK_IS_ABSTRACT
5390 || kind == CPTK_IS_BASE_OF
5391 || kind == CPTK_IS_CLASS
5392 || kind == CPTK_IS_CONVERTIBLE_TO
5393 || kind == CPTK_IS_EMPTY
5394 || kind == CPTK_IS_ENUM
5395 || kind == CPTK_IS_LITERAL_TYPE
5396 || kind == CPTK_IS_POD
5397 || kind == CPTK_IS_POLYMORPHIC
5398 || kind == CPTK_IS_STD_LAYOUT
5399 || kind == CPTK_IS_TRIVIAL
5400 || kind == CPTK_IS_UNION);
5402 if (kind == CPTK_IS_CONVERTIBLE_TO)
5404 sorry ("__is_convertible_to");
5405 return error_mark_node;
5408 if (type1 == error_mark_node
5409 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5410 && type2 == error_mark_node))
5411 return error_mark_node;
5413 if (processing_template_decl)
5415 tree trait_expr = make_node (TRAIT_EXPR);
5416 TREE_TYPE (trait_expr) = boolean_type_node;
5417 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5418 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5419 TRAIT_EXPR_KIND (trait_expr) = kind;
5425 case CPTK_HAS_NOTHROW_ASSIGN:
5426 case CPTK_HAS_TRIVIAL_ASSIGN:
5427 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5428 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5429 case CPTK_HAS_NOTHROW_COPY:
5430 case CPTK_HAS_TRIVIAL_COPY:
5431 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5432 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5433 case CPTK_IS_ABSTRACT:
5435 case CPTK_IS_LITERAL_TYPE:
5437 case CPTK_IS_POLYMORPHIC:
5438 case CPTK_IS_STD_LAYOUT:
5439 case CPTK_IS_TRIVIAL:
5440 if (!check_trait_type (type1))
5441 return error_mark_node;
5444 case CPTK_IS_BASE_OF:
5445 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5446 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5447 && !complete_type_or_else (type2, NULL_TREE))
5448 /* We already issued an error. */
5449 return error_mark_node;
5457 case CPTK_IS_CONVERTIBLE_TO:
5462 return (trait_expr_value (kind, type1, type2)
5463 ? boolean_true_node : boolean_false_node);
5466 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5467 which is ignored for C++. */
5470 set_float_const_decimal64 (void)
5475 clear_float_const_decimal64 (void)
5480 float_const_decimal64_p (void)
5486 /* Return true if T is a literal type. */
5489 literal_type_p (tree t)
5491 if (SCALAR_TYPE_P (t)
5492 || TREE_CODE (t) == REFERENCE_TYPE)
5494 if (CLASS_TYPE_P (t))
5496 t = complete_type (t);
5497 gcc_assert (COMPLETE_TYPE_P (t) || errorcount);
5498 return CLASSTYPE_LITERAL_P (t);
5500 if (TREE_CODE (t) == ARRAY_TYPE)
5501 return literal_type_p (strip_array_types (t));
5505 /* If DECL is a variable declared `constexpr', require its type
5506 be literal. Return the DECL if OK, otherwise NULL. */
5509 ensure_literal_type_for_constexpr_object (tree decl)
5511 tree type = TREE_TYPE (decl);
5512 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5513 && !processing_template_decl)
5515 if (CLASS_TYPE_P (type) && !COMPLETE_TYPE_P (complete_type (type)))
5516 /* Don't complain here, we'll complain about incompleteness
5517 when we try to initialize the variable. */;
5518 else if (!literal_type_p (type))
5520 error ("the type %qT of constexpr variable %qD is not literal",
5522 explain_non_literal_class (type);
5529 /* Representation of entries in the constexpr function definition table. */
5531 typedef struct GTY(()) constexpr_fundef {
5536 /* This table holds all constexpr function definitions seen in
5537 the current translation unit. */
5539 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5541 /* Utility function used for managing the constexpr function table.
5542 Return true if the entries pointed to by P and Q are for the
5543 same constexpr function. */
5546 constexpr_fundef_equal (const void *p, const void *q)
5548 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5549 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5550 return lhs->decl == rhs->decl;
5553 /* Utility function used for managing the constexpr function table.
5554 Return a hash value for the entry pointed to by Q. */
5556 static inline hashval_t
5557 constexpr_fundef_hash (const void *p)
5559 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5560 return DECL_UID (fundef->decl);
5563 /* Return a previously saved definition of function FUN. */
5565 static constexpr_fundef *
5566 retrieve_constexpr_fundef (tree fun)
5568 constexpr_fundef fundef = { NULL, NULL };
5569 if (constexpr_fundef_table == NULL)
5573 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5576 /* Check whether the parameter and return types of FUN are valid for a
5577 constexpr function, and complain if COMPLAIN. */
5580 is_valid_constexpr_fn (tree fun, bool complain)
5582 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5584 for (; parm != NULL; parm = TREE_CHAIN (parm))
5585 if (!literal_type_p (TREE_TYPE (parm)))
5590 error ("invalid type for parameter %d of constexpr "
5591 "function %q+#D", DECL_PARM_INDEX (parm), fun);
5592 explain_non_literal_class (TREE_TYPE (parm));
5596 if (!DECL_CONSTRUCTOR_P (fun))
5598 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5599 if (!literal_type_p (rettype))
5604 error ("invalid return type %qT of constexpr function %q+D",
5606 explain_non_literal_class (rettype);
5610 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5611 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
5616 error ("enclosing class of constexpr non-static member "
5617 "function %q+#D is not a literal type", fun);
5618 explain_non_literal_class (DECL_CONTEXT (fun));
5626 /* Subroutine of build_constexpr_constructor_member_initializers.
5627 The expression tree T represents a data member initialization
5628 in a (constexpr) constructor definition. Build a pairing of
5629 the data member with its initializer, and prepend that pair
5630 to the existing initialization pair INITS. */
5633 build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec)
5636 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5637 t = TREE_OPERAND (t, 0);
5638 if (TREE_CODE (t) == EXPR_STMT)
5639 t = TREE_OPERAND (t, 0);
5640 if (t == error_mark_node)
5642 if (TREE_CODE (t) == STATEMENT_LIST)
5644 tree_stmt_iterator i;
5645 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5647 if (! build_data_member_initialization (tsi_stmt (i), vec))
5652 if (TREE_CODE (t) == CLEANUP_STMT)
5654 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5655 but we can in a constexpr constructor for a non-literal class. Just
5656 ignore it; either all the initialization will be constant, in which
5657 case the cleanup can't run, or it can't be constexpr.
5658 Still recurse into CLEANUP_BODY. */
5659 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5661 if (TREE_CODE (t) == CONVERT_EXPR)
5662 t = TREE_OPERAND (t, 0);
5663 if (TREE_CODE (t) == INIT_EXPR
5664 || TREE_CODE (t) == MODIFY_EXPR)
5666 member = TREE_OPERAND (t, 0);
5667 init = unshare_expr (TREE_OPERAND (t, 1));
5671 gcc_assert (TREE_CODE (t) == CALL_EXPR);
5672 member = CALL_EXPR_ARG (t, 0);
5673 /* We don't use build_cplus_new here because it complains about
5674 abstract bases. Leaving the call unwrapped means that it has the
5675 wrong type, but cxx_eval_constant_expression doesn't care. */
5676 init = unshare_expr (t);
5678 if (TREE_CODE (member) == INDIRECT_REF)
5679 member = TREE_OPERAND (member, 0);
5680 if (TREE_CODE (member) == NOP_EXPR)
5684 if (TREE_CODE (op) == ADDR_EXPR)
5686 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5687 (TREE_TYPE (TREE_TYPE (op)),
5688 TREE_TYPE (TREE_TYPE (member))));
5689 /* Initializing a cv-qualified member; we need to look through
5695 /* We don't put out anything for an empty base. */
5696 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5697 /* But if the initializer isn't constexpr, leave it in so we
5699 if (potential_constant_expression (init))
5703 if (TREE_CODE (member) == ADDR_EXPR)
5704 member = TREE_OPERAND (member, 0);
5705 if (TREE_CODE (member) == COMPONENT_REF
5706 /* If we're initializing a member of a subaggregate, it's a vtable
5707 pointer. Leave it as COMPONENT_REF so we remember the path to get
5709 && TREE_CODE (TREE_OPERAND (member, 0)) != COMPONENT_REF)
5710 member = TREE_OPERAND (member, 1);
5711 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
5715 /* Make sure that there are no statements after LAST in the constructor
5716 body represented by LIST. */
5719 check_constexpr_ctor_body (tree last, tree list)
5722 if (TREE_CODE (list) == STATEMENT_LIST)
5724 tree_stmt_iterator i = tsi_last (list);
5725 for (; !tsi_end_p (i); tsi_prev (&i))
5727 tree t = tsi_stmt (i);
5730 if (TREE_CODE (t) == BIND_EXPR)
5732 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
5737 /* We currently allow typedefs and static_assert.
5738 FIXME allow them in the standard, too. */
5739 if (TREE_CODE (t) != STATIC_ASSERT)
5746 else if (list != last
5747 && TREE_CODE (list) != STATIC_ASSERT)
5751 error ("constexpr constructor does not have empty body");
5752 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
5757 /* Build compile-time evalable representations of member-initializer list
5758 for a constexpr constructor. */
5761 build_constexpr_constructor_member_initializers (tree type, tree body)
5763 VEC(constructor_elt,gc) *vec = NULL;
5765 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
5766 || TREE_CODE (body) == EH_SPEC_BLOCK)
5767 body = TREE_OPERAND (body, 0);
5768 if (TREE_CODE (body) == STATEMENT_LIST)
5769 body = STATEMENT_LIST_HEAD (body)->stmt;
5770 body = BIND_EXPR_BODY (body);
5771 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5773 body = TREE_OPERAND (body, 0);
5774 if (TREE_CODE (body) == EXPR_STMT)
5775 body = TREE_OPERAND (body, 0);
5776 if (TREE_CODE (body) == INIT_EXPR
5777 && (same_type_ignoring_top_level_qualifiers_p
5778 (TREE_TYPE (TREE_OPERAND (body, 0)),
5779 current_class_type)))
5782 return TREE_OPERAND (body, 1);
5784 ok = build_data_member_initialization (body, &vec);
5786 else if (TREE_CODE (body) == STATEMENT_LIST)
5788 tree_stmt_iterator i;
5789 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5791 ok = build_data_member_initialization (tsi_stmt (i), &vec);
5797 gcc_assert (errorcount > 0);
5799 return build_constructor (type, vec);
5801 return error_mark_node;
5804 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5805 declared to be constexpr, or a sub-statement thereof. Returns the
5806 return value if suitable, error_mark_node for a statement not allowed in
5807 a constexpr function, or NULL_TREE if no return value was found. */
5810 constexpr_fn_retval (tree body)
5812 switch (TREE_CODE (body))
5814 case STATEMENT_LIST:
5816 tree_stmt_iterator i;
5817 tree expr = NULL_TREE;
5818 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5820 tree s = constexpr_fn_retval (tsi_stmt (i));
5821 if (s == error_mark_node)
5822 return error_mark_node;
5823 else if (s == NULL_TREE)
5824 /* Keep iterating. */;
5826 /* Multiple return statements. */
5827 return error_mark_node;
5835 return unshare_expr (TREE_OPERAND (body, 0));
5838 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
5840 return error_mark_node;
5842 case CLEANUP_POINT_EXPR:
5843 return constexpr_fn_retval (TREE_OPERAND (body, 0));
5849 return error_mark_node;
5853 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
5854 FUN; do the necessary transformations to turn it into a single expression
5855 that we can store in the hash table. */
5858 massage_constexpr_body (tree fun, tree body)
5860 if (DECL_CONSTRUCTOR_P (fun))
5861 body = build_constexpr_constructor_member_initializers
5862 (DECL_CONTEXT (fun), body);
5865 if (TREE_CODE (body) == BIND_EXPR)
5866 body = BIND_EXPR_BODY (body);
5867 if (TREE_CODE (body) == EH_SPEC_BLOCK)
5868 body = EH_SPEC_STMTS (body);
5869 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
5870 body = TREE_OPERAND (body, 0);
5871 body = constexpr_fn_retval (body);
5876 /* FUN is a constexpr constructor with massaged body BODY. Return true
5877 if some bases/fields are uninitialized, and complain if COMPLAIN. */
5880 cx_check_missing_mem_inits (tree fun, tree body, bool complain)
5886 if (TREE_CODE (body) != CONSTRUCTOR)
5890 nelts = CONSTRUCTOR_NELTS (body);
5891 field = TYPE_FIELDS (DECL_CONTEXT (fun));
5892 for (i = 0; i <= nelts; ++i)
5899 index = CONSTRUCTOR_ELT (body, i)->index;
5900 /* Skip base and vtable inits. */
5901 if (TREE_CODE (index) != FIELD_DECL)
5904 for (; field != index; field = DECL_CHAIN (field))
5907 if (TREE_CODE (field) != FIELD_DECL
5908 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field)))
5912 ftype = strip_array_types (TREE_TYPE (field));
5913 if (type_has_constexpr_default_constructor (ftype))
5915 /* It's OK to skip a member with a trivial constexpr ctor.
5916 A constexpr ctor that isn't trivial should have been
5918 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype));
5921 error ("uninitialized member %qD in %<constexpr%> constructor",
5925 if (field == NULL_TREE)
5927 field = DECL_CHAIN (field);
5933 /* We are processing the definition of the constexpr function FUN.
5934 Check that its BODY fulfills the propriate requirements and
5935 enter it in the constexpr function definition table.
5936 For constructor BODY is actually the TREE_LIST of the
5937 member-initializer list. */
5940 register_constexpr_fundef (tree fun, tree body)
5942 constexpr_fundef entry;
5943 constexpr_fundef **slot;
5945 if (!is_valid_constexpr_fn (fun, !DECL_GENERATED_P (fun)))
5948 body = massage_constexpr_body (fun, body);
5949 if (body == NULL_TREE || body == error_mark_node)
5951 if (!DECL_CONSTRUCTOR_P (fun))
5952 error ("body of constexpr function %qD not a return-statement", fun);
5956 if (!potential_rvalue_constant_expression (body))
5958 if (!DECL_GENERATED_P (fun))
5959 require_potential_rvalue_constant_expression (body);
5963 if (DECL_CONSTRUCTOR_P (fun)
5964 && cx_check_missing_mem_inits (fun, body, !DECL_GENERATED_P (fun)))
5967 /* Create the constexpr function table if necessary. */
5968 if (constexpr_fundef_table == NULL)
5969 constexpr_fundef_table = htab_create_ggc (101,
5970 constexpr_fundef_hash,
5971 constexpr_fundef_equal,
5975 slot = (constexpr_fundef **)
5976 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
5978 gcc_assert (*slot == NULL);
5979 *slot = ggc_alloc_constexpr_fundef ();
5985 /* FUN is a non-constexpr function called in a context that requires a
5986 constant expression. If it comes from a constexpr template, explain why
5987 the instantiation isn't constexpr. */
5990 explain_invalid_constexpr_fn (tree fun)
5992 static struct pointer_set_t *diagnosed;
5994 location_t save_loc;
5995 /* Only diagnose defaulted functions or instantiations. */
5996 if (!DECL_DEFAULTED_FN (fun)
5997 && !is_instantiation_of_constexpr (fun))
5999 if (diagnosed == NULL)
6000 diagnosed = pointer_set_create ();
6001 if (pointer_set_insert (diagnosed, fun) != 0)
6002 /* Already explained. */
6005 save_loc = input_location;
6006 input_location = DECL_SOURCE_LOCATION (fun);
6007 inform (0, "%q+D is not usable as a constexpr function because:", fun);
6008 /* First check the declaration. */
6009 if (is_valid_constexpr_fn (fun, true))
6011 /* Then if it's OK, the body. */
6012 if (DECL_DEFAULTED_FN (fun))
6013 explain_implicit_non_constexpr (fun);
6016 body = massage_constexpr_body (fun, DECL_SAVED_TREE (fun));
6017 require_potential_rvalue_constant_expression (body);
6018 if (DECL_CONSTRUCTOR_P (fun))
6019 cx_check_missing_mem_inits (fun, body, true);
6022 input_location = save_loc;
6025 /* Objects of this type represent calls to constexpr functions
6026 along with the bindings of parameters to their arguments, for
6027 the purpose of compile time evaluation. */
6029 typedef struct GTY(()) constexpr_call {
6030 /* Description of the constexpr function definition. */
6031 constexpr_fundef *fundef;
6032 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
6033 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6034 Note: This arrangement is made to accomodate the use of
6035 iterative_hash_template_arg (see pt.c). If you change this
6036 representation, also change the hash calculation in
6037 cxx_eval_call_expression. */
6039 /* Result of the call.
6040 NULL means the call is being evaluated.
6041 error_mark_node means that the evaluation was erroneous;
6042 otherwise, the actuall value of the call. */
6044 /* The hash of this call; we remember it here to avoid having to
6045 recalculate it when expanding the hash table. */
6049 /* A table of all constexpr calls that have been evaluated by the
6050 compiler in this translation unit. */
6052 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
6054 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
6055 bool, bool, bool *);
6057 /* Compute a hash value for a constexpr call representation. */
6060 constexpr_call_hash (const void *p)
6062 const constexpr_call *info = (const constexpr_call *) p;
6066 /* Return 1 if the objects pointed to by P and Q represent calls
6067 to the same constexpr function with the same arguments.
6068 Otherwise, return 0. */
6071 constexpr_call_equal (const void *p, const void *q)
6073 const constexpr_call *lhs = (const constexpr_call *) p;
6074 const constexpr_call *rhs = (const constexpr_call *) q;
6079 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
6081 lhs_bindings = lhs->bindings;
6082 rhs_bindings = rhs->bindings;
6083 while (lhs_bindings != NULL && rhs_bindings != NULL)
6085 tree lhs_arg = TREE_VALUE (lhs_bindings);
6086 tree rhs_arg = TREE_VALUE (rhs_bindings);
6087 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
6088 if (!cp_tree_equal (lhs_arg, rhs_arg))
6090 lhs_bindings = TREE_CHAIN (lhs_bindings);
6091 rhs_bindings = TREE_CHAIN (rhs_bindings);
6093 return lhs_bindings == rhs_bindings;
6096 /* Initialize the constexpr call table, if needed. */
6099 maybe_initialize_constexpr_call_table (void)
6101 if (constexpr_call_table == NULL)
6102 constexpr_call_table = htab_create_ggc (101,
6103 constexpr_call_hash,
6104 constexpr_call_equal,
6108 /* Return true if T designates the implied `this' parameter. */
6111 is_this_parameter (tree t)
6113 return t == current_class_ptr;
6116 /* We have an expression tree T that represents a call, either CALL_EXPR
6117 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6118 retrun the _DECL for that function. */
6121 get_function_named_in_call (tree t)
6124 switch (TREE_CODE (t))
6127 fun = CALL_EXPR_FN (t);
6130 case AGGR_INIT_EXPR:
6131 fun = AGGR_INIT_EXPR_FN (t);
6138 if (TREE_CODE (fun) == ADDR_EXPR
6139 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
6140 fun = TREE_OPERAND (fun, 0);
6144 /* We have an expression tree T that represents a call, either CALL_EXPR
6145 or AGGR_INIT_EXPR. Return the Nth argument. */
6148 get_nth_callarg (tree t, int n)
6150 switch (TREE_CODE (t))
6153 return CALL_EXPR_ARG (t, n);
6155 case AGGR_INIT_EXPR:
6156 return AGGR_INIT_EXPR_ARG (t, n);
6164 /* Look up the binding of the function parameter T in a constexpr
6165 function call context CALL. */
6168 lookup_parameter_binding (const constexpr_call *call, tree t)
6170 tree b = purpose_member (t, call->bindings);
6171 return TREE_VALUE (b);
6174 /* Attempt to evaluate T which represents a call to a builtin function.
6175 We assume here that all builtin functions evaluate to scalar types
6176 represented by _CST nodes. */
6179 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
6180 bool allow_non_constant, bool addr,
6181 bool *non_constant_p)
6183 const int nargs = call_expr_nargs (t);
6184 tree *args = (tree *) alloca (nargs * sizeof (tree));
6187 for (i = 0; i < nargs; ++i)
6189 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
6190 allow_non_constant, addr,
6192 if (allow_non_constant && *non_constant_p)
6195 if (*non_constant_p)
6197 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
6198 CALL_EXPR_FN (t), nargs, args);
6199 return fold (new_call);
6202 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6203 the type of the value to match. */
6206 adjust_temp_type (tree type, tree temp)
6208 if (TREE_TYPE (temp) == type)
6210 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6211 if (TREE_CODE (temp) == CONSTRUCTOR)
6212 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
6213 gcc_assert (SCALAR_TYPE_P (type));
6214 return cp_fold_convert (type, temp);
6217 /* Subroutine of cxx_eval_call_expression.
6218 We are processing a call expression (either CALL_EXPR or
6219 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6220 all arguments and bind their values to correspondings
6221 parameters, making up the NEW_CALL context. */
6224 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
6225 constexpr_call *new_call,
6226 bool allow_non_constant,
6227 bool *non_constant_p)
6229 const int nargs = call_expr_nargs (t);
6230 tree fun = new_call->fundef->decl;
6231 tree parms = DECL_ARGUMENTS (fun);
6233 for (i = 0; i < nargs; ++i)
6236 tree type = parms ? TREE_TYPE (parms) : void_type_node;
6237 /* For member function, the first argument is a pointer to the implied
6238 object. And for an object contruction, don't bind `this' before
6239 it is fully constructed. */
6240 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
6242 x = get_nth_callarg (t, i);
6243 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
6244 TREE_CODE (type) == REFERENCE_TYPE,
6246 /* Don't VERIFY_CONSTANT here. */
6247 if (*non_constant_p && allow_non_constant)
6249 /* Just discard ellipsis args after checking their constantitude. */
6252 if (*non_constant_p)
6253 /* Don't try to adjust the type of non-constant args. */
6256 /* Make sure the binding has the same type as the parm. */
6257 if (TREE_CODE (type) != REFERENCE_TYPE)
6258 arg = adjust_temp_type (type, arg);
6259 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
6261 parms = TREE_CHAIN (parms);
6265 /* Variables and functions to manage constexpr call expansion context.
6266 These do not need to be marked for PCH or GC. */
6268 /* FIXME remember and print actual constant arguments. */
6269 static VEC(tree,heap) *call_stack = NULL;
6270 static int call_stack_tick;
6271 static int last_cx_error_tick;
6274 push_cx_call_context (tree call)
6277 if (!EXPR_HAS_LOCATION (call))
6278 SET_EXPR_LOCATION (call, input_location);
6279 VEC_safe_push (tree, heap, call_stack, call);
6280 if (VEC_length (tree, call_stack) > (unsigned) max_constexpr_depth)
6286 pop_cx_call_context (void)
6289 VEC_pop (tree, call_stack);
6293 cx_error_context (void)
6295 VEC(tree,heap) *r = NULL;
6296 if (call_stack_tick != last_cx_error_tick
6297 && !VEC_empty (tree, call_stack))
6299 last_cx_error_tick = call_stack_tick;
6303 /* Subroutine of cxx_eval_constant_expression.
6304 Evaluate the call expression tree T in the context of OLD_CALL expression
6308 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
6309 bool allow_non_constant, bool addr,
6310 bool *non_constant_p)
6312 location_t loc = EXPR_LOC_OR_HERE (t);
6313 tree fun = get_function_named_in_call (t);
6315 constexpr_call new_call = { NULL, NULL, NULL, 0 };
6316 constexpr_call **slot;
6317 constexpr_call *entry;
6320 if (TREE_CODE (fun) != FUNCTION_DECL)
6322 /* Might be a constexpr function pointer. */
6323 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
6324 /*addr*/false, non_constant_p);
6325 if (TREE_CODE (fun) == ADDR_EXPR)
6326 fun = TREE_OPERAND (fun, 0);
6328 if (TREE_CODE (fun) != FUNCTION_DECL)
6330 if (!allow_non_constant && !*non_constant_p)
6331 error_at (loc, "expression %qE does not designate a constexpr "
6333 *non_constant_p = true;
6336 if (DECL_CLONED_FUNCTION_P (fun))
6337 fun = DECL_CLONED_FUNCTION (fun);
6338 if (is_builtin_fn (fun))
6339 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
6340 addr, non_constant_p);
6341 if (!DECL_DECLARED_CONSTEXPR_P (fun))
6343 if (!allow_non_constant)
6345 error_at (loc, "call to non-constexpr function %qD", fun);
6346 explain_invalid_constexpr_fn (fun);
6348 *non_constant_p = true;
6352 /* Shortcut trivial copy constructor/op=. */
6353 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6355 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6356 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6357 addr, non_constant_p);
6360 /* If in direct recursive call, optimize definition search. */
6361 if (old_call != NULL && old_call->fundef->decl == fun)
6362 new_call.fundef = old_call->fundef;
6365 new_call.fundef = retrieve_constexpr_fundef (fun);
6366 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6368 if (!allow_non_constant)
6370 if (DECL_INITIAL (fun))
6372 /* The definition of fun was somehow unsuitable. */
6373 error_at (loc, "%qD called in a constant expression", fun);
6374 explain_invalid_constexpr_fn (fun);
6377 error_at (loc, "%qD used before its definition", fun);
6379 *non_constant_p = true;
6383 cxx_bind_parameters_in_call (old_call, t, &new_call,
6384 allow_non_constant, non_constant_p);
6385 if (*non_constant_p)
6388 depth_ok = push_cx_call_context (t);
6391 = iterative_hash_template_arg (new_call.bindings,
6392 constexpr_fundef_hash (new_call.fundef));
6394 /* If we have seen this call before, we are done. */
6395 maybe_initialize_constexpr_call_table ();
6396 slot = (constexpr_call **)
6397 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6401 /* We need to keep a pointer to the entry, not just the slot, as the
6402 slot can move in the call to cxx_eval_builtin_function_call. */
6403 *slot = entry = ggc_alloc_constexpr_call ();
6406 /* Calls which are in progress have their result set to NULL
6407 so that we can detect circular dependencies. */
6408 else if (entry->result == NULL)
6410 if (!allow_non_constant)
6411 error ("call has circular dependency");
6412 *non_constant_p = true;
6413 entry->result = result = error_mark_node;
6418 if (!allow_non_constant)
6419 error ("constexpr evaluation depth exceeds maximum of %d (use "
6420 "-fconstexpr-depth= to increase the maximum)",
6421 max_constexpr_depth);
6422 *non_constant_p = true;
6423 entry->result = result = error_mark_node;
6427 result = entry->result;
6428 if (!result || (result == error_mark_node && !allow_non_constant))
6429 result = (cxx_eval_constant_expression
6430 (&new_call, new_call.fundef->body,
6431 allow_non_constant, addr,
6433 if (result == error_mark_node)
6434 *non_constant_p = true;
6435 if (*non_constant_p)
6436 entry->result = result = error_mark_node;
6439 /* If this was a call to initialize an object, set the type of
6440 the CONSTRUCTOR to the type of that object. */
6441 if (DECL_CONSTRUCTOR_P (fun))
6443 tree ob_arg = get_nth_callarg (t, 0);
6444 STRIP_NOPS (ob_arg);
6445 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6446 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6447 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6450 entry->result = result;
6454 pop_cx_call_context ();
6455 return unshare_expr (result);
6458 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6461 reduced_constant_expression_p (tree t)
6463 if (TREE_OVERFLOW_P (t))
6464 /* Integer overflow makes this not a constant expression. */
6466 /* FIXME are we calling this too much? */
6467 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6470 /* Some expressions may have constant operands but are not constant
6471 themselves, such as 1/0. Call this function (or rather, the macro
6472 following it) to check for that condition.
6474 We only call this in places that require an arithmetic constant, not in
6475 places where we might have a non-constant expression that can be a
6476 component of a constant expression, such as the address of a constexpr
6477 variable that might be dereferenced later. */
6480 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p)
6482 if (!*non_constant_p && !reduced_constant_expression_p (t))
6484 if (!allow_non_constant)
6486 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6487 printing the folded constant isn't helpful. */
6488 if (TREE_OVERFLOW_P (t))
6490 permerror (input_location, "overflow in constant expression");
6491 /* If we're being permissive (and are in an enforcing
6492 context), consider this constant. */
6493 if (flag_permissive)
6497 error ("%q+E is not a constant expression", t);
6499 *non_constant_p = true;
6501 return *non_constant_p;
6503 #define VERIFY_CONSTANT(X) \
6505 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6509 /* Subroutine of cxx_eval_constant_expression.
6510 Attempt to reduce the unary expression tree T to a compile time value.
6511 If successful, return the value. Otherwise issue a diagnostic
6512 and return error_mark_node. */
6515 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6516 bool allow_non_constant, bool addr,
6517 bool *non_constant_p)
6520 tree orig_arg = TREE_OPERAND (t, 0);
6521 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6522 addr, non_constant_p);
6523 VERIFY_CONSTANT (arg);
6524 if (arg == orig_arg)
6526 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6527 VERIFY_CONSTANT (r);
6531 /* Subroutine of cxx_eval_constant_expression.
6532 Like cxx_eval_unary_expression, except for binary expressions. */
6535 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6536 bool allow_non_constant, bool addr,
6537 bool *non_constant_p)
6540 tree orig_lhs = TREE_OPERAND (t, 0);
6541 tree orig_rhs = TREE_OPERAND (t, 1);
6543 lhs = cxx_eval_constant_expression (call, orig_lhs,
6544 allow_non_constant, addr,
6546 VERIFY_CONSTANT (lhs);
6547 rhs = cxx_eval_constant_expression (call, orig_rhs,
6548 allow_non_constant, addr,
6550 VERIFY_CONSTANT (rhs);
6551 if (lhs == orig_lhs && rhs == orig_rhs)
6553 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6554 VERIFY_CONSTANT (r);
6558 /* Subroutine of cxx_eval_constant_expression.
6559 Attempt to evaluate condition expressions. Dead branches are not
6563 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6564 bool allow_non_constant, bool addr,
6565 bool *non_constant_p)
6567 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6568 allow_non_constant, addr,
6570 VERIFY_CONSTANT (val);
6571 /* Don't VERIFY_CONSTANT the other operands. */
6572 if (integer_zerop (val))
6573 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6574 allow_non_constant, addr,
6576 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6577 allow_non_constant, addr,
6581 /* Subroutine of cxx_eval_constant_expression.
6582 Attempt to reduce a reference to an array slot. */
6585 cxx_eval_array_reference (const constexpr_call *call, tree t,
6586 bool allow_non_constant, bool addr,
6587 bool *non_constant_p)
6589 tree oldary = TREE_OPERAND (t, 0);
6590 tree ary = cxx_eval_constant_expression (call, oldary,
6591 allow_non_constant, addr,
6596 unsigned len, elem_nchars = 1;
6597 if (*non_constant_p)
6599 oldidx = TREE_OPERAND (t, 1);
6600 index = cxx_eval_constant_expression (call, oldidx,
6601 allow_non_constant, false,
6603 VERIFY_CONSTANT (index);
6604 if (addr && ary == oldary && index == oldidx)
6607 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6608 elem_type = TREE_TYPE (TREE_TYPE (ary));
6609 if (TREE_CODE (ary) == CONSTRUCTOR)
6610 len = CONSTRUCTOR_NELTS (ary);
6611 else if (TREE_CODE (ary) == STRING_CST)
6613 elem_nchars = (TYPE_PRECISION (elem_type)
6614 / TYPE_PRECISION (char_type_node));
6615 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
6619 /* We can't do anything with other tree codes, so use
6620 VERIFY_CONSTANT to complain and fail. */
6621 VERIFY_CONSTANT (ary);
6624 if (compare_tree_int (index, len) >= 0)
6626 if (tree_int_cst_lt (index, array_type_nelts_top (TREE_TYPE (ary))))
6628 /* If it's within the array bounds but doesn't have an explicit
6629 initializer, it's value-initialized. */
6630 tree val = build_value_init (elem_type, tf_warning_or_error);
6631 return cxx_eval_constant_expression (call, val,
6632 allow_non_constant, addr,
6636 if (!allow_non_constant)
6637 error ("array subscript out of bound");
6638 *non_constant_p = true;
6641 i = tree_low_cst (index, 0);
6642 if (TREE_CODE (ary) == CONSTRUCTOR)
6643 return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value;
6644 else if (elem_nchars == 1)
6645 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
6646 TREE_STRING_POINTER (ary)[i]);
6649 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
6650 return native_interpret_expr (type, (const unsigned char *)
6651 TREE_STRING_POINTER (ary)
6652 + i * elem_nchars, elem_nchars);
6654 /* Don't VERIFY_CONSTANT here. */
6657 /* Subroutine of cxx_eval_constant_expression.
6658 Attempt to reduce a field access of a value of class type. */
6661 cxx_eval_component_reference (const constexpr_call *call, tree t,
6662 bool allow_non_constant, bool addr,
6663 bool *non_constant_p)
6665 unsigned HOST_WIDE_INT i;
6668 tree part = TREE_OPERAND (t, 1);
6669 tree orig_whole = TREE_OPERAND (t, 0);
6670 tree whole = cxx_eval_constant_expression (call, orig_whole,
6671 allow_non_constant, addr,
6673 if (whole == orig_whole)
6676 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
6677 whole, part, NULL_TREE);
6678 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6680 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6682 if (!allow_non_constant)
6683 error ("%qE is not a constant expression", orig_whole);
6684 *non_constant_p = true;
6686 if (DECL_MUTABLE_P (part))
6688 if (!allow_non_constant)
6689 error ("mutable %qD is not usable in a constant expression", part);
6690 *non_constant_p = true;
6692 if (*non_constant_p)
6694 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6699 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE
6700 && CONSTRUCTOR_NELTS (whole) > 0)
6702 /* DR 1188 says we don't have to deal with this. */
6703 if (!allow_non_constant)
6704 error ("accessing %qD member instead of initialized %qD member in "
6705 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
6706 *non_constant_p = true;
6710 /* If there's no explicit init for this field, it's value-initialized. */
6711 value = build_value_init (TREE_TYPE (t), tf_warning_or_error);
6712 return cxx_eval_constant_expression (call, value,
6713 allow_non_constant, addr,
6717 /* Subroutine of cxx_eval_constant_expression.
6718 Attempt to reduce a field access of a value of class type that is
6719 expressed as a BIT_FIELD_REF. */
6722 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
6723 bool allow_non_constant, bool addr,
6724 bool *non_constant_p)
6726 tree orig_whole = TREE_OPERAND (t, 0);
6727 tree retval, fldval, utype, mask;
6728 bool fld_seen = false;
6729 HOST_WIDE_INT istart, isize;
6730 tree whole = cxx_eval_constant_expression (call, orig_whole,
6731 allow_non_constant, addr,
6733 tree start, field, value;
6734 unsigned HOST_WIDE_INT i;
6736 if (whole == orig_whole)
6738 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6740 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6742 if (!allow_non_constant)
6743 error ("%qE is not a constant expression", orig_whole);
6744 *non_constant_p = true;
6746 if (*non_constant_p)
6749 start = TREE_OPERAND (t, 2);
6750 istart = tree_low_cst (start, 0);
6751 isize = tree_low_cst (TREE_OPERAND (t, 1), 0);
6752 utype = TREE_TYPE (t);
6753 if (!TYPE_UNSIGNED (utype))
6754 utype = build_nonstandard_integer_type (TYPE_PRECISION (utype), 1);
6755 retval = build_int_cst (utype, 0);
6756 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6758 tree bitpos = bit_position (field);
6759 if (bitpos == start && DECL_SIZE (field) == TREE_OPERAND (t, 1))
6761 if (TREE_CODE (TREE_TYPE (field)) == INTEGER_TYPE
6762 && TREE_CODE (value) == INTEGER_CST
6763 && host_integerp (bitpos, 0)
6764 && host_integerp (DECL_SIZE (field), 0))
6766 HOST_WIDE_INT bit = tree_low_cst (bitpos, 0);
6767 HOST_WIDE_INT sz = tree_low_cst (DECL_SIZE (field), 0);
6768 HOST_WIDE_INT shift;
6769 if (bit >= istart && bit + sz <= istart + isize)
6771 fldval = fold_convert (utype, value);
6772 mask = build_int_cst_type (utype, -1);
6773 mask = fold_build2 (LSHIFT_EXPR, utype, mask,
6774 size_int (TYPE_PRECISION (utype) - sz));
6775 mask = fold_build2 (RSHIFT_EXPR, utype, mask,
6776 size_int (TYPE_PRECISION (utype) - sz));
6777 fldval = fold_build2 (BIT_AND_EXPR, utype, fldval, mask);
6778 shift = bit - istart;
6779 if (BYTES_BIG_ENDIAN)
6780 shift = TYPE_PRECISION (utype) - shift - sz;
6781 fldval = fold_build2 (LSHIFT_EXPR, utype, fldval,
6783 retval = fold_build2 (BIT_IOR_EXPR, utype, retval, fldval);
6789 return fold_convert (TREE_TYPE (t), retval);
6791 return error_mark_node;
6794 /* Subroutine of cxx_eval_constant_expression.
6795 Evaluate a short-circuited logical expression T in the context
6796 of a given constexpr CALL. BAILOUT_VALUE is the value for
6797 early return. CONTINUE_VALUE is used here purely for
6798 sanity check purposes. */
6801 cxx_eval_logical_expression (const constexpr_call *call, tree t,
6802 tree bailout_value, tree continue_value,
6803 bool allow_non_constant, bool addr,
6804 bool *non_constant_p)
6807 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6808 allow_non_constant, addr,
6810 VERIFY_CONSTANT (lhs);
6811 if (tree_int_cst_equal (lhs, bailout_value))
6813 gcc_assert (tree_int_cst_equal (lhs, continue_value));
6814 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6815 allow_non_constant, addr, non_constant_p);
6816 VERIFY_CONSTANT (r);
6820 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6821 CONSTRUCTOR elements to initialize (part of) an object containing that
6822 field. Return a pointer to the constructor_elt corresponding to the
6823 initialization of the field. */
6825 static constructor_elt *
6826 base_field_constructor_elt (VEC(constructor_elt,gc) *v, tree ref)
6828 tree aggr = TREE_OPERAND (ref, 0);
6829 tree field = TREE_OPERAND (ref, 1);
6831 constructor_elt *ce;
6833 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
6835 if (TREE_CODE (aggr) == COMPONENT_REF)
6837 constructor_elt *base_ce
6838 = base_field_constructor_elt (v, aggr);
6839 v = CONSTRUCTOR_ELTS (base_ce->value);
6842 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6843 if (ce->index == field)
6850 /* Subroutine of cxx_eval_constant_expression.
6851 The expression tree T denotes a C-style array or a C-style
6852 aggregate. Reduce it to a constant expression. */
6855 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
6856 bool allow_non_constant, bool addr,
6857 bool *non_constant_p)
6859 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t);
6860 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc,
6861 VEC_length (constructor_elt, v));
6862 constructor_elt *ce;
6864 bool changed = false;
6865 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
6866 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6868 tree elt = cxx_eval_constant_expression (call, ce->value,
6869 allow_non_constant, addr,
6871 /* Don't VERIFY_CONSTANT here. */
6872 if (allow_non_constant && *non_constant_p)
6874 if (elt != ce->value)
6876 if (TREE_CODE (ce->index) == COMPONENT_REF)
6878 /* This is an initialization of a vfield inside a base
6879 subaggregate that we already initialized; push this
6880 initialization into the previous initialization. */
6881 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
6885 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
6887 if (*non_constant_p || !changed)
6890 VEC_free (constructor_elt, gc, n);
6893 t = build_constructor (TREE_TYPE (t), n);
6894 TREE_CONSTANT (t) = true;
6898 /* Subroutine of cxx_eval_constant_expression.
6899 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6900 initialization of a non-static data member of array type. Reduce it to a
6903 Note that apart from value-initialization (when VALUE_INIT is true),
6904 this is only intended to support value-initialization and the
6905 initializations done by defaulted constructors for classes with
6906 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6907 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6908 for the copy/move constructor. */
6911 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
6912 bool value_init, bool allow_non_constant, bool addr,
6913 bool *non_constant_p)
6915 tree elttype = TREE_TYPE (atype);
6916 int max = tree_low_cst (array_type_nelts (atype), 0);
6917 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1);
6918 bool pre_init = false;
6921 /* For the default constructor, build up a call to the default
6922 constructor of the element type. We only need to handle class types
6923 here, as for a constructor to be constexpr, all members must be
6924 initialized, which for a defaulted default constructor means they must
6925 be of a class type with a constexpr default constructor. */
6926 if (TREE_CODE (elttype) == ARRAY_TYPE)
6927 /* We only do this at the lowest level. */;
6928 else if (value_init)
6930 init = build_value_init (elttype, tf_warning_or_error);
6931 init = cxx_eval_constant_expression
6932 (call, init, allow_non_constant, addr, non_constant_p);
6937 VEC(tree,gc) *argvec = make_tree_vector ();
6938 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6939 &argvec, elttype, LOOKUP_NORMAL,
6940 tf_warning_or_error);
6941 release_tree_vector (argvec);
6942 init = cxx_eval_constant_expression (call, init, allow_non_constant,
6943 addr, non_constant_p);
6947 if (*non_constant_p && !allow_non_constant)
6950 for (i = 0; i <= max; ++i)
6952 tree idx = build_int_cst (size_type_node, i);
6954 if (TREE_CODE (elttype) == ARRAY_TYPE)
6956 /* A multidimensional array; recurse. */
6958 eltinit = NULL_TREE;
6960 eltinit = cp_build_array_ref (input_location, init, idx,
6961 tf_warning_or_error);
6962 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
6963 allow_non_constant, addr,
6968 /* Initializing an element using value or default initialization
6969 we just pre-built above. */
6973 eltinit = unshare_expr (init);
6977 /* Copying an element. */
6978 VEC(tree,gc) *argvec;
6979 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6980 (atype, TREE_TYPE (init)));
6981 eltinit = cp_build_array_ref (input_location, init, idx,
6982 tf_warning_or_error);
6983 if (!real_lvalue_p (init))
6984 eltinit = move (eltinit);
6985 argvec = make_tree_vector ();
6986 VEC_quick_push (tree, argvec, eltinit);
6987 eltinit = (build_special_member_call
6988 (NULL_TREE, complete_ctor_identifier, &argvec,
6989 elttype, LOOKUP_NORMAL, tf_warning_or_error));
6990 release_tree_vector (argvec);
6991 eltinit = cxx_eval_constant_expression
6992 (call, eltinit, allow_non_constant, addr, non_constant_p);
6994 if (*non_constant_p && !allow_non_constant)
6996 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
6999 if (!*non_constant_p)
7001 init = build_constructor (atype, n);
7002 TREE_CONSTANT (init) = true;
7007 VEC_free (constructor_elt, gc, n);
7012 cxx_eval_vec_init (const constexpr_call *call, tree t,
7013 bool allow_non_constant, bool addr,
7014 bool *non_constant_p)
7016 tree atype = TREE_TYPE (t);
7017 tree init = VEC_INIT_EXPR_INIT (t);
7018 tree r = cxx_eval_vec_init_1 (call, atype, init,
7019 VEC_INIT_EXPR_VALUE_INIT (t),
7020 allow_non_constant, addr, non_constant_p);
7021 if (*non_constant_p)
7027 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7028 match. We want to be less strict for simple *& folding; if we have a
7029 non-const temporary that we access through a const pointer, that should
7030 work. We handle this here rather than change fold_indirect_ref_1
7031 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7032 don't really make sense outside of constant expression evaluation. Also
7033 we want to allow folding to COMPONENT_REF, which could cause trouble
7034 with TBAA in fold_indirect_ref_1.
7036 Try to keep this function synced with fold_indirect_ref_1. */
7039 cxx_fold_indirect_ref (location_t loc, tree type, tree op0, bool *empty_base)
7045 subtype = TREE_TYPE (sub);
7046 gcc_assert (POINTER_TYPE_P (subtype));
7048 if (TREE_CODE (sub) == ADDR_EXPR)
7050 tree op = TREE_OPERAND (sub, 0);
7051 tree optype = TREE_TYPE (op);
7053 /* *&CONST_DECL -> to the value of the const decl. */
7054 if (TREE_CODE (op) == CONST_DECL)
7055 return DECL_INITIAL (op);
7056 /* *&p => p; make sure to handle *&"str"[cst] here. */
7057 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
7059 tree fop = fold_read_from_constant_string (op);
7065 /* *(foo *)&fooarray => fooarray[0] */
7066 else if (TREE_CODE (optype) == ARRAY_TYPE
7067 && (same_type_ignoring_top_level_qualifiers_p
7068 (type, TREE_TYPE (optype))))
7070 tree type_domain = TYPE_DOMAIN (optype);
7071 tree min_val = size_zero_node;
7072 if (type_domain && TYPE_MIN_VALUE (type_domain))
7073 min_val = TYPE_MIN_VALUE (type_domain);
7074 return build4_loc (loc, ARRAY_REF, type, op, min_val,
7075 NULL_TREE, NULL_TREE);
7077 /* *(foo *)&complexfoo => __real__ complexfoo */
7078 else if (TREE_CODE (optype) == COMPLEX_TYPE
7079 && (same_type_ignoring_top_level_qualifiers_p
7080 (type, TREE_TYPE (optype))))
7081 return fold_build1_loc (loc, REALPART_EXPR, type, op);
7082 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7083 else if (TREE_CODE (optype) == VECTOR_TYPE
7084 && (same_type_ignoring_top_level_qualifiers_p
7085 (type, TREE_TYPE (optype))))
7087 tree part_width = TYPE_SIZE (type);
7088 tree index = bitsize_int (0);
7089 return fold_build3_loc (loc, BIT_FIELD_REF, type, op, part_width, index);
7091 /* Also handle conversion to an empty base class, which
7092 is represented with a NOP_EXPR. */
7093 else if (is_empty_class (type)
7094 && CLASS_TYPE_P (optype)
7095 && DERIVED_FROM_P (type, optype))
7100 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7101 else if (RECORD_OR_UNION_TYPE_P (optype))
7103 tree field = TYPE_FIELDS (optype);
7104 for (; field; field = DECL_CHAIN (field))
7105 if (TREE_CODE (field) == FIELD_DECL
7106 && integer_zerop (byte_position (field))
7107 && (same_type_ignoring_top_level_qualifiers_p
7108 (TREE_TYPE (field), type)))
7110 return fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
7115 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
7116 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
7118 tree op00 = TREE_OPERAND (sub, 0);
7119 tree op01 = TREE_OPERAND (sub, 1);
7122 if (TREE_CODE (op00) == ADDR_EXPR)
7125 op00 = TREE_OPERAND (op00, 0);
7126 op00type = TREE_TYPE (op00);
7128 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7129 if (TREE_CODE (op00type) == VECTOR_TYPE
7130 && (same_type_ignoring_top_level_qualifiers_p
7131 (type, TREE_TYPE (op00type))))
7133 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
7134 tree part_width = TYPE_SIZE (type);
7135 unsigned HOST_WIDE_INT part_widthi = tree_low_cst (part_width, 0)/BITS_PER_UNIT;
7136 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
7137 tree index = bitsize_int (indexi);
7139 if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))
7140 return fold_build3_loc (loc,
7141 BIT_FIELD_REF, type, op00,
7145 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7146 else if (TREE_CODE (op00type) == COMPLEX_TYPE
7147 && (same_type_ignoring_top_level_qualifiers_p
7148 (type, TREE_TYPE (op00type))))
7150 tree size = TYPE_SIZE_UNIT (type);
7151 if (tree_int_cst_equal (size, op01))
7152 return fold_build1_loc (loc, IMAGPART_EXPR, type, op00);
7154 /* ((foo *)&fooarray)[1] => fooarray[1] */
7155 else if (TREE_CODE (op00type) == ARRAY_TYPE
7156 && (same_type_ignoring_top_level_qualifiers_p
7157 (type, TREE_TYPE (op00type))))
7159 tree type_domain = TYPE_DOMAIN (op00type);
7160 tree min_val = size_zero_node;
7161 if (type_domain && TYPE_MIN_VALUE (type_domain))
7162 min_val = TYPE_MIN_VALUE (type_domain);
7163 op01 = size_binop_loc (loc, EXACT_DIV_EXPR, op01,
7164 TYPE_SIZE_UNIT (type));
7165 op01 = size_binop_loc (loc, PLUS_EXPR, op01, min_val);
7166 return build4_loc (loc, ARRAY_REF, type, op00, op01,
7167 NULL_TREE, NULL_TREE);
7169 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7170 else if (RECORD_OR_UNION_TYPE_P (op00type))
7172 tree field = TYPE_FIELDS (op00type);
7173 for (; field; field = DECL_CHAIN (field))
7174 if (TREE_CODE (field) == FIELD_DECL
7175 && tree_int_cst_equal (byte_position (field), op01)
7176 && (same_type_ignoring_top_level_qualifiers_p
7177 (TREE_TYPE (field), type)))
7179 return fold_build3 (COMPONENT_REF, type, op00,
7186 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7187 else if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
7188 && (same_type_ignoring_top_level_qualifiers_p
7189 (type, TREE_TYPE (TREE_TYPE (subtype)))))
7192 tree min_val = size_zero_node;
7193 sub = cxx_fold_indirect_ref (loc, TREE_TYPE (subtype), sub, NULL);
7195 sub = build1_loc (loc, INDIRECT_REF, TREE_TYPE (subtype), sub);
7196 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
7197 if (type_domain && TYPE_MIN_VALUE (type_domain))
7198 min_val = TYPE_MIN_VALUE (type_domain);
7199 return build4_loc (loc, ARRAY_REF, type, sub, min_val, NULL_TREE,
7207 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
7208 bool allow_non_constant, bool addr,
7209 bool *non_constant_p)
7211 tree orig_op0 = TREE_OPERAND (t, 0);
7212 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
7213 /*addr*/false, non_constant_p);
7214 bool empty_base = false;
7217 /* Don't VERIFY_CONSTANT here. */
7218 if (*non_constant_p)
7221 r = cxx_fold_indirect_ref (EXPR_LOCATION (t), TREE_TYPE (t), op0,
7225 r = cxx_eval_constant_expression (call, r, allow_non_constant,
7226 addr, non_constant_p);
7231 if (TREE_CODE (sub) == ADDR_EXPR
7232 || TREE_CODE (sub) == POINTER_PLUS_EXPR)
7234 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7235 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
7236 /* DR 1188 says we don't have to deal with this. */
7237 if (!allow_non_constant)
7238 error ("accessing value of %qE through a %qT glvalue in a "
7239 "constant expression", build_fold_indirect_ref (sub),
7241 *non_constant_p = true;
7246 /* If we're pulling out the value of an empty base, make sure
7247 that the whole object is constant and then return an empty
7251 VERIFY_CONSTANT (r);
7252 r = build_constructor (TREE_TYPE (t), NULL);
7253 TREE_CONSTANT (r) = true;
7261 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7262 Shared between potential_constant_expression and
7263 cxx_eval_constant_expression. */
7266 non_const_var_error (tree r)
7268 tree type = TREE_TYPE (r);
7269 error ("the value of %qD is not usable in a constant "
7271 /* Avoid error cascade. */
7272 if (DECL_INITIAL (r) == error_mark_node)
7274 if (DECL_DECLARED_CONSTEXPR_P (r))
7275 inform (DECL_SOURCE_LOCATION (r),
7276 "%qD used in its own initializer", r);
7277 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
7279 if (!CP_TYPE_CONST_P (type))
7280 inform (DECL_SOURCE_LOCATION (r),
7281 "%q#D is not const", r);
7282 else if (CP_TYPE_VOLATILE_P (type))
7283 inform (DECL_SOURCE_LOCATION (r),
7284 "%q#D is volatile", r);
7285 else if (!DECL_INITIAL (r)
7286 || !TREE_CONSTANT (DECL_INITIAL (r)))
7287 inform (DECL_SOURCE_LOCATION (r),
7288 "%qD was not initialized with a constant "
7295 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
7296 inform (DECL_SOURCE_LOCATION (r),
7297 "%qD was not declared %<constexpr%>", r);
7299 inform (DECL_SOURCE_LOCATION (r),
7300 "%qD does not have integral or enumeration type",
7305 /* Attempt to reduce the expression T to a constant value.
7306 On failure, issue diagnostic and return error_mark_node. */
7307 /* FIXME unify with c_fully_fold */
7310 cxx_eval_constant_expression (const constexpr_call *call, tree t,
7311 bool allow_non_constant, bool addr,
7312 bool *non_constant_p)
7316 if (t == error_mark_node)
7318 *non_constant_p = true;
7321 if (CONSTANT_CLASS_P (t))
7323 if (TREE_CODE (t) == PTRMEM_CST)
7324 t = cplus_expand_constant (t);
7327 if (TREE_CODE (t) != NOP_EXPR
7328 && reduced_constant_expression_p (t))
7331 switch (TREE_CODE (t))
7336 /* else fall through. */
7338 r = integral_constant_value (t);
7339 if (TREE_CODE (r) == TARGET_EXPR
7340 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
7341 r = TARGET_EXPR_INITIAL (r);
7344 if (!allow_non_constant)
7345 non_const_var_error (r);
7346 *non_constant_p = true;
7356 if (call && DECL_CONTEXT (t) == call->fundef->decl)
7358 if (DECL_ARTIFICIAL (t) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t)))
7360 if (!allow_non_constant)
7361 sorry ("use of the value of the object being constructed "
7362 "in a constant expression");
7363 *non_constant_p = true;
7366 r = lookup_parameter_binding (call, t);
7369 /* Defer in case this is only used for its type. */;
7372 if (!allow_non_constant)
7373 error ("%qE is not a constant expression", t);
7374 *non_constant_p = true;
7379 case AGGR_INIT_EXPR:
7380 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
7385 if (!literal_type_p (TREE_TYPE (t)))
7387 if (!allow_non_constant)
7389 error ("temporary of non-literal type %qT in a "
7390 "constant expression", TREE_TYPE (t));
7391 explain_non_literal_class (TREE_TYPE (t));
7393 *non_constant_p = true;
7396 /* else fall through. */
7398 /* Pass false for 'addr' because these codes indicate
7399 initialization of a temporary. */
7400 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7401 allow_non_constant, false,
7403 if (!*non_constant_p)
7404 /* Adjust the type of the result to the type of the temporary. */
7405 r = adjust_temp_type (TREE_TYPE (t), r);
7409 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7410 allow_non_constant, addr,
7415 case NON_LVALUE_EXPR:
7416 case TRY_CATCH_EXPR:
7417 case CLEANUP_POINT_EXPR:
7418 case MUST_NOT_THROW_EXPR:
7420 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7421 allow_non_constant, addr,
7425 /* These differ from cxx_eval_unary_expression in that this doesn't
7426 check for a constant operand or result; an address can be
7427 constant without its operand being, and vice versa. */
7429 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
7435 tree oldop = TREE_OPERAND (t, 0);
7436 tree op = cxx_eval_constant_expression (call, oldop,
7440 /* Don't VERIFY_CONSTANT here. */
7441 if (*non_constant_p)
7443 /* This function does more aggressive folding than fold itself. */
7444 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
7445 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
7453 case FIX_TRUNC_EXPR:
7458 case TRUTH_NOT_EXPR:
7459 case FIXED_CONVERT_EXPR:
7460 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
7466 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7467 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7468 introduced by build_call_a. */
7469 tree op0 = TREE_OPERAND (t, 0);
7470 tree op1 = TREE_OPERAND (t, 1);
7472 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7473 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7474 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
7475 addr, non_constant_p);
7478 /* Check that the LHS is constant and then discard it. */
7479 cxx_eval_constant_expression (call, op0, allow_non_constant,
7480 false, non_constant_p);
7481 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
7482 addr, non_constant_p);
7487 case POINTER_PLUS_EXPR:
7491 case TRUNC_DIV_EXPR:
7493 case FLOOR_DIV_EXPR:
7494 case ROUND_DIV_EXPR:
7495 case TRUNC_MOD_EXPR:
7497 case ROUND_MOD_EXPR:
7499 case EXACT_DIV_EXPR:
7509 case TRUTH_XOR_EXPR:
7516 case UNORDERED_EXPR:
7525 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
7529 /* fold can introduce non-IF versions of these; still treat them as
7530 short-circuiting. */
7531 case TRUTH_AND_EXPR:
7532 case TRUTH_ANDIF_EXPR:
7533 r = cxx_eval_logical_expression (call, t, boolean_false_node,
7535 allow_non_constant, addr,
7540 case TRUTH_ORIF_EXPR:
7541 r = cxx_eval_logical_expression (call, t, boolean_true_node,
7543 allow_non_constant, addr,
7548 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
7553 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
7558 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
7564 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
7569 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
7574 /* We can get this in a defaulted constructor for a class with a
7575 non-static data member of array type. Either the initializer will
7576 be NULL, meaning default-initialization, or it will be an lvalue
7577 or xvalue of the same type, meaning direct-initialization from the
7578 corresponding member. */
7579 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
7584 case VIEW_CONVERT_EXPR:
7587 tree oldop = TREE_OPERAND (t, 0);
7589 tree to = TREE_TYPE (t);
7590 tree source = TREE_TYPE (op);
7591 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to)
7592 && !(TREE_CODE (op) == COMPONENT_REF
7593 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0)))))
7595 if (!allow_non_constant)
7596 error ("conversion of expression %qE of pointer type "
7597 "cannot yield a constant expression", op);
7598 *non_constant_p = true;
7601 op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7602 allow_non_constant, addr,
7604 if (*non_constant_p)
7607 /* We didn't fold at the top so we could check for ptr-int
7610 r = fold_build1 (TREE_CODE (t), to, op);
7611 /* Conversion of an out-of-range value has implementation-defined
7612 behavior; the language considers it different from arithmetic
7613 overflow, which is undefined. */
7614 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
7615 TREE_OVERFLOW (r) = false;
7619 case EMPTY_CLASS_EXPR:
7620 /* This is good enough for a function argument that might not get
7621 used, and they can't do anything with it, so just return it. */
7625 case PREINCREMENT_EXPR:
7626 case POSTINCREMENT_EXPR:
7627 case PREDECREMENT_EXPR:
7628 case POSTDECREMENT_EXPR:
7632 case VEC_DELETE_EXPR:
7636 /* GCC internal stuff. */
7639 case WITH_CLEANUP_EXPR:
7640 case STATEMENT_LIST:
7642 case NON_DEPENDENT_EXPR:
7646 if (!allow_non_constant)
7647 error_at (EXPR_LOC_OR_HERE (t),
7648 "expression %qE is not a constant-expression", t);
7649 *non_constant_p = true;
7653 internal_error ("unexpected expression %qE of kind %s", t,
7654 tree_code_name[TREE_CODE (t)]);
7655 *non_constant_p = true;
7659 if (r == error_mark_node)
7660 *non_constant_p = true;
7662 if (*non_constant_p)
7669 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
7671 bool non_constant_p = false;
7672 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
7673 false, &non_constant_p);
7675 verify_constant (r, allow_non_constant, &non_constant_p);
7677 if (TREE_CODE (t) != CONSTRUCTOR
7678 && cp_has_mutable_p (TREE_TYPE (t)))
7680 /* We allow a mutable type if the original expression was a
7681 CONSTRUCTOR so that we can do aggregate initialization of
7682 constexpr variables. */
7683 if (!allow_non_constant)
7684 error ("%qT cannot be the type of a complete constant expression "
7685 "because it has mutable sub-objects", TREE_TYPE (t));
7686 non_constant_p = true;
7689 if (non_constant_p && !allow_non_constant)
7690 return error_mark_node;
7691 else if (non_constant_p && TREE_CONSTANT (t))
7693 /* This isn't actually constant, so unset TREE_CONSTANT. */
7694 if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR)
7697 r = build_nop (TREE_TYPE (t), t);
7698 TREE_CONSTANT (r) = false;
7701 else if (non_constant_p || r == t)
7703 else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
7705 if (TREE_CODE (t) == TARGET_EXPR
7706 && TARGET_EXPR_INITIAL (t) == r)
7710 r = get_target_expr (r);
7711 TREE_CONSTANT (r) = true;
7719 /* Returns true if T is a valid subexpression of a constant expression,
7720 even if it isn't itself a constant expression. */
7723 is_sub_constant_expr (tree t)
7725 bool non_constant_p = false;
7726 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p);
7727 return !non_constant_p;
7730 /* If T represents a constant expression returns its reduced value.
7731 Otherwise return error_mark_node. If T is dependent, then
7735 cxx_constant_value (tree t)
7737 return cxx_eval_outermost_constant_expr (t, false);
7740 /* If T is a constant expression, returns its reduced value.
7741 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7742 Otherwise, returns a version of T without TREE_CONSTANT. */
7745 maybe_constant_value (tree t)
7749 if (type_dependent_expression_p (t)
7750 || type_unknown_p (t)
7751 || BRACE_ENCLOSED_INITIALIZER_P (t)
7752 || !potential_constant_expression (t)
7753 || value_dependent_expression_p (t))
7755 if (TREE_OVERFLOW_P (t))
7757 t = build_nop (TREE_TYPE (t), t);
7758 TREE_CONSTANT (t) = false;
7763 r = cxx_eval_outermost_constant_expr (t, true);
7764 #ifdef ENABLE_CHECKING
7765 /* cp_tree_equal looks through NOPs, so allow them. */
7767 || CONVERT_EXPR_P (t)
7768 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
7769 || !cp_tree_equal (r, t));
7774 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7775 than wrapped in a TARGET_EXPR. */
7778 maybe_constant_init (tree t)
7780 t = maybe_constant_value (t);
7781 if (TREE_CODE (t) == TARGET_EXPR)
7783 tree init = TARGET_EXPR_INITIAL (t);
7784 if (TREE_CODE (init) == CONSTRUCTOR
7785 && TREE_CONSTANT (init))
7792 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7793 /* Return true if the object referred to by REF has automatic or thread
7796 enum { ck_ok, ck_bad, ck_unknown };
7798 check_automatic_or_tls (tree ref)
7800 enum machine_mode mode;
7801 HOST_WIDE_INT bitsize, bitpos;
7803 int volatilep = 0, unsignedp = 0;
7804 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
7805 &mode, &unsignedp, &volatilep, false);
7808 /* If there isn't a decl in the middle, we don't know the linkage here,
7809 and this isn't a constant expression anyway. */
7812 dk = decl_storage_duration (decl);
7813 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
7817 /* Return true if T denotes a potentially constant expression. Issue
7818 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7819 an lvalue-rvalue conversion is implied.
7821 C++0x [expr.const] used to say
7823 6 An expression is a potential constant expression if it is
7824 a constant expression where all occurences of function
7825 parameters are replaced by arbitrary constant expressions
7826 of the appropriate type.
7828 2 A conditional expression is a constant expression unless it
7829 involves one of the following as a potentially evaluated
7830 subexpression (3.2), but subexpressions of logical AND (5.14),
7831 logical OR (5.15), and conditional (5.16) operations that are
7832 not evaluated are not considered. */
7835 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
7837 enum { any = false, rval = true };
7841 /* C++98 has different rules for the form of a constant expression that
7842 are enforced in the parser, so we can assume that anything that gets
7843 this far is suitable. */
7844 if (cxx_dialect < cxx0x)
7847 if (t == error_mark_node)
7851 if (TREE_THIS_VOLATILE (t))
7853 if (flags & tf_error)
7854 error ("expression %qE has side-effects", t);
7857 if (CONSTANT_CLASS_P (t))
7859 if (TREE_OVERFLOW (t))
7861 if (flags & tf_error)
7863 permerror (EXPR_LOC_OR_HERE (t),
7864 "overflow in constant expression");
7865 if (flag_permissive)
7873 switch (TREE_CODE (t))
7879 case TEMPLATE_ID_EXPR:
7886 case TEMPLATE_PARM_INDEX:
7888 case IDENTIFIER_NODE:
7889 case USERDEF_LITERAL:
7890 /* We can see a FIELD_DECL in a pointer-to-member expression. */
7896 case AGGR_INIT_EXPR:
7898 /* -- an invocation of a function other than a constexpr function
7899 or a constexpr constructor. */
7901 tree fun = get_function_named_in_call (t);
7902 const int nargs = call_expr_nargs (t);
7905 if (is_overloaded_fn (fun))
7907 if (TREE_CODE (fun) == FUNCTION_DECL)
7909 if (builtin_valid_in_constant_expr_p (fun))
7911 if (!DECL_DECLARED_CONSTEXPR_P (fun)
7912 /* Allow any built-in function; if the expansion
7913 isn't constant, we'll deal with that then. */
7914 && !is_builtin_fn (fun))
7916 if (flags & tf_error)
7918 error_at (EXPR_LOC_OR_HERE (t),
7919 "call to non-constexpr function %qD", fun);
7920 explain_invalid_constexpr_fn (fun);
7924 /* A call to a non-static member function takes the address
7925 of the object as the first argument. But in a constant
7926 expression the address will be folded away, so look
7928 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
7929 && !DECL_CONSTRUCTOR_P (fun))
7931 tree x = get_nth_callarg (t, 0);
7932 if (is_this_parameter (x))
7934 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
7936 if (flags & tf_error)
7937 sorry ("calling a member function of the "
7938 "object being constructed in a constant "
7942 /* Otherwise OK. */;
7944 else if (!potential_constant_expression_1 (x, rval, flags))
7950 fun = get_first_fn (fun);
7951 /* Skip initial arguments to base constructors. */
7952 if (DECL_BASE_CONSTRUCTOR_P (fun))
7953 i = num_artificial_parms_for (fun);
7954 fun = DECL_ORIGIN (fun);
7958 if (potential_constant_expression_1 (fun, rval, flags))
7959 /* Might end up being a constant function pointer. */;
7963 for (; i < nargs; ++i)
7965 tree x = get_nth_callarg (t, i);
7966 if (!potential_constant_expression_1 (x, rval, flags))
7972 case NON_LVALUE_EXPR:
7973 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7974 -- an lvalue of integral type that refers to a non-volatile
7975 const variable or static data member initialized with
7976 constant expressions, or
7978 -- an lvalue of literal type that refers to non-volatile
7979 object defined with constexpr, or that refers to a
7980 sub-object of such an object; */
7981 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
7984 if (want_rval && !decl_constant_var_p (t)
7985 && !dependent_type_p (TREE_TYPE (t)))
7987 if (flags & tf_error)
7988 non_const_var_error (t);
7995 case VIEW_CONVERT_EXPR:
7996 /* -- an array-to-pointer conversion that is applied to an lvalue
7997 that designates an object with thread or automatic storage
7998 duration; FIXME not implemented as it breaks constexpr arrays;
7999 need to fix the standard
8000 -- a type conversion from a pointer or pointer-to-member type
8001 to a literal type. */
8003 tree from = TREE_OPERAND (t, 0);
8004 tree source = TREE_TYPE (from);
8005 tree target = TREE_TYPE (t);
8006 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target)
8007 && !(TREE_CODE (from) == COMPONENT_REF
8008 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0)))))
8010 if (flags & tf_error)
8011 error ("conversion of expression %qE of pointer type "
8012 "cannot yield a constant expression", from);
8015 return (potential_constant_expression_1
8016 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
8020 /* -- a unary operator & that is applied to an lvalue that
8021 designates an object with thread or automatic storage
8023 t = TREE_OPERAND (t, 0);
8025 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8026 any checking here, as we might dereference the pointer later. If
8027 we remove this code, also remove check_automatic_or_tls. */
8028 i = check_automatic_or_tls (t);
8033 if (flags & tf_error)
8034 error ("address-of an object %qE with thread local or "
8035 "automatic storage is not a constant expression", t);
8039 return potential_constant_expression_1 (t, any, flags);
8045 /* -- a class member access unless its postfix-expression is
8046 of literal type or of pointer to literal type. */
8047 /* This test would be redundant, as it follows from the
8048 postfix-expression being a potential constant expression. */
8049 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8052 case EXPR_PACK_EXPANSION:
8053 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
8058 tree x = TREE_OPERAND (t, 0);
8060 if (is_this_parameter (x))
8062 if (want_rval && DECL_CONTEXT (x)
8063 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8065 if (flags & tf_error)
8066 sorry ("use of the value of the object being constructed "
8067 "in a constant expression");
8072 return potential_constant_expression_1 (x, rval, flags);
8076 case DYNAMIC_CAST_EXPR:
8077 case PSEUDO_DTOR_EXPR:
8078 case PREINCREMENT_EXPR:
8079 case POSTINCREMENT_EXPR:
8080 case PREDECREMENT_EXPR:
8081 case POSTDECREMENT_EXPR:
8085 case VEC_DELETE_EXPR:
8089 /* GCC internal stuff. */
8092 case WITH_CLEANUP_EXPR:
8093 case CLEANUP_POINT_EXPR:
8094 case MUST_NOT_THROW_EXPR:
8095 case TRY_CATCH_EXPR:
8096 case STATEMENT_LIST:
8097 /* Don't bother trying to define a subset of statement-expressions to
8098 be constant-expressions, at least for now. */
8102 if (flags & tf_error)
8103 error ("expression %qE is not a constant-expression", t);
8107 /* -- a typeid expression whose operand is of polymorphic
8110 tree e = TREE_OPERAND (t, 0);
8111 if (!TYPE_P (e) && !type_dependent_expression_p (e)
8112 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
8114 if (flags & tf_error)
8115 error ("typeid-expression is not a constant expression "
8116 "because %qE is of polymorphic type", e);
8123 /* -- a subtraction where both operands are pointers. */
8124 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8125 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
8127 if (flags & tf_error)
8128 error ("difference of two pointer expressions is not "
8129 "a constant expression");
8141 /* -- a relational or equality operator where at least
8142 one of the operands is a pointer. */
8143 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8144 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
8146 if (flags & tf_error)
8147 error ("pointer comparison expression is not a "
8148 "constant expression");
8156 if (TYPE_P (TREE_OPERAND (t, 0)))
8158 /* else fall through. */
8164 case FIX_TRUNC_EXPR:
8168 case TRUTH_NOT_EXPR:
8169 case FIXED_CONVERT_EXPR:
8170 case UNARY_PLUS_EXPR:
8171 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
8175 case CONST_CAST_EXPR:
8176 case STATIC_CAST_EXPR:
8177 case REINTERPRET_CAST_EXPR:
8178 case IMPLICIT_CONV_EXPR:
8179 return (potential_constant_expression_1
8180 (TREE_OPERAND (t, 0),
8181 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
8184 case NON_DEPENDENT_EXPR:
8185 /* For convenience. */
8187 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8191 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8195 if (!literal_type_p (TREE_TYPE (t)))
8197 if (flags & tf_error)
8199 error ("temporary of non-literal type %qT in a "
8200 "constant expression", TREE_TYPE (t));
8201 explain_non_literal_class (TREE_TYPE (t));
8206 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8211 VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t);
8212 constructor_elt *ce;
8213 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
8214 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
8221 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
8222 || DECL_P (TREE_PURPOSE (t)));
8223 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
8226 if (TREE_CHAIN (t) == NULL_TREE)
8228 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
8232 case TRUNC_DIV_EXPR:
8234 case FLOOR_DIV_EXPR:
8235 case ROUND_DIV_EXPR:
8236 case TRUNC_MOD_EXPR:
8238 case ROUND_MOD_EXPR:
8240 tree denom = TREE_OPERAND (t, 1);
8241 /* We can't call maybe_constant_value on an expression
8242 that hasn't been through fold_non_dependent_expr yet. */
8243 if (!processing_template_decl)
8244 denom = maybe_constant_value (denom);
8245 if (integer_zerop (denom))
8247 if (flags & tf_error)
8248 error ("division by zero is not a constant-expression");
8260 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8261 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8262 introduced by build_call_a. */
8263 tree op0 = TREE_OPERAND (t, 0);
8264 tree op1 = TREE_OPERAND (t, 1);
8266 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
8267 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
8268 return potential_constant_expression_1 (op0, want_rval, flags);
8273 /* If the first operand is the non-short-circuit constant, look at
8274 the second operand; otherwise we only care about the first one for
8276 case TRUTH_AND_EXPR:
8277 case TRUTH_ANDIF_EXPR:
8278 tmp = boolean_true_node;
8281 case TRUTH_ORIF_EXPR:
8282 tmp = boolean_false_node;
8284 if (TREE_OPERAND (t, 0) == tmp)
8285 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
8287 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
8291 case POINTER_PLUS_EXPR:
8293 case EXACT_DIV_EXPR:
8303 case TRUTH_XOR_EXPR:
8304 case UNORDERED_EXPR:
8316 case ARRAY_RANGE_REF:
8320 for (i = 0; i < 2; ++i)
8321 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8327 for (i = 0; i < 3; ++i)
8328 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8335 /* If the condition is a known constant, we know which of the legs we
8336 care about; otherwise we only require that the condition and
8337 either of the legs be potentially constant. */
8338 tmp = TREE_OPERAND (t, 0);
8339 if (!potential_constant_expression_1 (tmp, rval, flags))
8341 else if (integer_zerop (tmp))
8342 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
8344 else if (TREE_CODE (tmp) == INTEGER_CST)
8345 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8347 for (i = 1; i < 3; ++i)
8348 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
8349 want_rval, tf_none))
8351 if (flags & tf_error)
8352 error ("expression %qE is not a constant-expression", t);
8356 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
8358 if (flags & tf_error)
8360 error ("non-constant array initialization");
8361 diagnose_non_constexpr_vec_init (t);
8366 sorry ("unexpected AST of kind %s", tree_code_name[TREE_CODE (t)]);
8372 /* The main entry point to the above. */
8375 potential_constant_expression (tree t)
8377 return potential_constant_expression_1 (t, false, tf_none);
8380 /* As above, but require a constant rvalue. */
8383 potential_rvalue_constant_expression (tree t)
8385 return potential_constant_expression_1 (t, true, tf_none);
8388 /* Like above, but complain about non-constant expressions. */
8391 require_potential_constant_expression (tree t)
8393 return potential_constant_expression_1 (t, false, tf_warning_or_error);
8396 /* Cross product of the above. */
8399 require_potential_rvalue_constant_expression (tree t)
8401 return potential_constant_expression_1 (t, true, tf_warning_or_error);
8404 /* Constructor for a lambda expression. */
8407 build_lambda_expr (void)
8409 tree lambda = make_node (LAMBDA_EXPR);
8410 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
8411 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
8412 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
8413 LAMBDA_EXPR_PENDING_PROXIES (lambda) = NULL;
8414 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
8415 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
8419 /* Create the closure object for a LAMBDA_EXPR. */
8422 build_lambda_object (tree lambda_expr)
8424 /* Build aggregate constructor call.
8425 - cp_parser_braced_list
8426 - cp_parser_functional_cast */
8427 VEC(constructor_elt,gc) *elts = NULL;
8428 tree node, expr, type;
8429 location_t saved_loc;
8431 if (processing_template_decl)
8434 /* Make sure any error messages refer to the lambda-introducer. */
8435 saved_loc = input_location;
8436 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
8438 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8440 node = TREE_CHAIN (node))
8442 tree field = TREE_PURPOSE (node);
8443 tree val = TREE_VALUE (node);
8445 if (field == error_mark_node)
8447 expr = error_mark_node;
8454 /* Mere mortals can't copy arrays with aggregate initialization, so
8455 do some magic to make it work here. */
8456 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
8457 val = build_array_copy (val);
8458 else if (DECL_NORMAL_CAPTURE_P (field)
8459 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
8461 /* "the entities that are captured by copy are used to
8462 direct-initialize each corresponding non-static data
8463 member of the resulting closure object."
8465 There's normally no way to express direct-initialization
8466 from an element of a CONSTRUCTOR, so we build up a special
8467 TARGET_EXPR to bypass the usual copy-initialization. */
8468 val = force_rvalue (val, tf_warning_or_error);
8469 if (TREE_CODE (val) == TARGET_EXPR)
8470 TARGET_EXPR_DIRECT_INIT_P (val) = true;
8473 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
8476 expr = build_constructor (init_list_type_node, elts);
8477 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
8479 /* N2927: "[The closure] class type is not an aggregate."
8480 But we briefly treat it as an aggregate to make this simpler. */
8481 type = LAMBDA_EXPR_CLOSURE (lambda_expr);
8482 CLASSTYPE_NON_AGGREGATE (type) = 0;
8483 expr = finish_compound_literal (type, expr, tf_warning_or_error);
8484 CLASSTYPE_NON_AGGREGATE (type) = 1;
8487 input_location = saved_loc;
8491 /* Return an initialized RECORD_TYPE for LAMBDA.
8492 LAMBDA must have its explicit captures already. */
8495 begin_lambda_type (tree lambda)
8500 /* Unique name. This is just like an unnamed class, but we cannot use
8501 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8503 name = make_lambda_name ();
8505 /* Create the new RECORD_TYPE for this lambda. */
8506 type = xref_tag (/*tag_code=*/record_type,
8508 /*scope=*/ts_within_enclosing_non_class,
8509 /*template_header_p=*/false);
8512 /* Designate it as a struct so that we can use aggregate initialization. */
8513 CLASSTYPE_DECLARED_CLASS (type) = false;
8515 /* Clear base types. */
8516 xref_basetypes (type, /*bases=*/NULL_TREE);
8518 /* Start the class. */
8519 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
8521 /* Cross-reference the expression and the type. */
8522 LAMBDA_EXPR_CLOSURE (lambda) = type;
8523 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
8528 /* Returns the type to use for the return type of the operator() of a
8532 lambda_return_type (tree expr)
8535 if (type_unknown_p (expr)
8536 || BRACE_ENCLOSED_INITIALIZER_P (expr))
8538 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
8539 return void_type_node;
8541 if (type_dependent_expression_p (expr))
8542 type = dependent_lambda_return_type_node;
8544 type = cv_unqualified (type_decays_to (unlowered_expr_type (expr)));
8548 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8552 lambda_function (tree lambda)
8555 if (TREE_CODE (lambda) == LAMBDA_EXPR)
8556 type = LAMBDA_EXPR_CLOSURE (lambda);
8559 gcc_assert (LAMBDA_TYPE_P (type));
8560 /* Don't let debug_tree cause instantiation. */
8561 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
8562 && !COMPLETE_OR_OPEN_TYPE_P (type))
8564 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
8565 /*protect=*/0, /*want_type=*/false);
8567 lambda = BASELINK_FUNCTIONS (lambda);
8571 /* Returns the type to use for the FIELD_DECL corresponding to the
8573 The caller should add REFERENCE_TYPE for capture by reference. */
8576 lambda_capture_field_type (tree expr)
8579 if (type_dependent_expression_p (expr))
8581 type = cxx_make_type (DECLTYPE_TYPE);
8582 DECLTYPE_TYPE_EXPR (type) = expr;
8583 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
8584 SET_TYPE_STRUCTURAL_EQUALITY (type);
8587 type = non_reference (unlowered_expr_type (expr));
8591 /* Recompute the return type for LAMBDA with body of the form:
8592 { return EXPR ; } */
8595 apply_lambda_return_type (tree lambda, tree return_type)
8597 tree fco = lambda_function (lambda);
8600 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
8602 if (return_type == error_mark_node)
8604 if (TREE_TYPE (TREE_TYPE (fco)) == return_type)
8607 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8608 TREE_TYPE (METHOD_TYPE) == return-type */
8609 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
8611 result = DECL_RESULT (fco);
8612 if (result == NULL_TREE)
8615 /* We already have a DECL_RESULT from start_preparsed_function.
8616 Now we need to redo the work it and allocate_struct_function
8617 did to reflect the new type. */
8618 gcc_assert (current_function_decl == fco);
8619 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
8620 TYPE_MAIN_VARIANT (return_type));
8621 DECL_ARTIFICIAL (result) = 1;
8622 DECL_IGNORED_P (result) = 1;
8623 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
8626 DECL_RESULT (fco) = result;
8628 if (!processing_template_decl && aggregate_value_p (result, fco))
8630 #ifdef PCC_STATIC_STRUCT_RETURN
8631 cfun->returns_pcc_struct = 1;
8633 cfun->returns_struct = 1;
8638 /* DECL is a local variable or parameter from the surrounding scope of a
8639 lambda-expression. Returns the decltype for a use of the capture field
8640 for DECL even if it hasn't been captured yet. */
8643 capture_decltype (tree decl)
8645 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8646 /* FIXME do lookup instead of list walk? */
8647 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
8651 type = TREE_TYPE (TREE_PURPOSE (cap));
8653 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
8656 error ("%qD is not captured", decl);
8657 return error_mark_node;
8660 type = TREE_TYPE (decl);
8661 if (TREE_CODE (type) == REFERENCE_TYPE
8662 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
8663 type = TREE_TYPE (type);
8666 case CPLD_REFERENCE:
8667 type = TREE_TYPE (decl);
8668 if (TREE_CODE (type) != REFERENCE_TYPE)
8669 type = build_reference_type (TREE_TYPE (decl));
8676 if (TREE_CODE (type) != REFERENCE_TYPE)
8678 if (!LAMBDA_EXPR_MUTABLE_P (lam))
8679 type = cp_build_qualified_type (type, (cp_type_quals (type)
8681 type = build_reference_type (type);
8686 /* Returns true iff DECL is a lambda capture proxy variable created by
8687 build_capture_proxy. */
8690 is_capture_proxy (tree decl)
8692 return (TREE_CODE (decl) == VAR_DECL
8693 && DECL_HAS_VALUE_EXPR_P (decl)
8694 && !DECL_ANON_UNION_VAR_P (decl)
8695 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl)));
8698 /* Returns true iff DECL is a capture proxy for a normal capture
8699 (i.e. without explicit initializer). */
8702 is_normal_capture_proxy (tree decl)
8706 if (!is_capture_proxy (decl))
8707 /* It's not a capture proxy. */
8710 /* It is a capture proxy, is it a normal capture? */
8711 val = DECL_VALUE_EXPR (decl);
8712 gcc_assert (TREE_CODE (val) == COMPONENT_REF);
8713 val = TREE_OPERAND (val, 1);
8714 return DECL_NORMAL_CAPTURE_P (val);
8717 /* VAR is a capture proxy created by build_capture_proxy; add it to the
8718 current function, which is the operator() for the appropriate lambda. */
8721 insert_capture_proxy (tree var)
8723 cp_binding_level *b;
8727 /* Put the capture proxy in the extra body block so that it won't clash
8728 with a later local variable. */
8729 b = current_binding_level;
8730 for (skip = 0; ; ++skip)
8732 cp_binding_level *n = b->level_chain;
8733 if (n->kind == sk_function_parms)
8737 pushdecl_with_scope (var, b, false);
8739 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
8740 var = build_stmt (DECL_SOURCE_LOCATION (var), DECL_EXPR, var);
8741 stmt_list = VEC_index (tree, stmt_list_stack,
8742 VEC_length (tree, stmt_list_stack) - 1 - skip);
8743 gcc_assert (stmt_list);
8744 append_to_statement_list_force (var, &stmt_list);
8747 /* We've just finished processing a lambda; if the containing scope is also
8748 a lambda, insert any capture proxies that were created while processing
8749 the nested lambda. */
8752 insert_pending_capture_proxies (void)
8755 VEC(tree,gc) *proxies;
8758 if (!current_function_decl || !LAMBDA_FUNCTION_P (current_function_decl))
8761 lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8762 proxies = LAMBDA_EXPR_PENDING_PROXIES (lam);
8763 for (i = 0; i < VEC_length (tree, proxies); ++i)
8765 tree var = VEC_index (tree, proxies, i);
8766 insert_capture_proxy (var);
8768 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam));
8769 LAMBDA_EXPR_PENDING_PROXIES (lam) = NULL;
8772 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
8773 return the type we want the proxy to have: the type of the field itself,
8774 with added const-qualification if the lambda isn't mutable and the
8775 capture is by value. */
8778 lambda_proxy_type (tree ref)
8781 if (REFERENCE_REF_P (ref))
8782 ref = TREE_OPERAND (ref, 0);
8783 type = TREE_TYPE (ref);
8784 if (!dependent_type_p (type))
8786 type = cxx_make_type (DECLTYPE_TYPE);
8787 DECLTYPE_TYPE_EXPR (type) = ref;
8788 DECLTYPE_FOR_LAMBDA_PROXY (type) = true;
8789 SET_TYPE_STRUCTURAL_EQUALITY (type);
8793 /* MEMBER is a capture field in a lambda closure class. Now that we're
8794 inside the operator(), build a placeholder var for future lookups and
8798 build_capture_proxy (tree member)
8800 tree var, object, fn, closure, name, lam, type;
8802 closure = DECL_CONTEXT (member);
8803 fn = lambda_function (closure);
8804 lam = CLASSTYPE_LAMBDA_EXPR (closure);
8806 /* The proxy variable forwards to the capture field. */
8807 object = build_fold_indirect_ref (DECL_ARGUMENTS (fn));
8808 object = finish_non_static_data_member (member, object, NULL_TREE);
8809 if (REFERENCE_REF_P (object))
8810 object = TREE_OPERAND (object, 0);
8812 /* Remove the __ inserted by add_capture. */
8813 name = get_identifier (IDENTIFIER_POINTER (DECL_NAME (member)) + 2);
8815 type = lambda_proxy_type (object);
8816 var = build_decl (input_location, VAR_DECL, name, type);
8817 SET_DECL_VALUE_EXPR (var, object);
8818 DECL_HAS_VALUE_EXPR_P (var) = 1;
8819 DECL_ARTIFICIAL (var) = 1;
8820 TREE_USED (var) = 1;
8821 DECL_CONTEXT (var) = fn;
8823 if (name == this_identifier)
8825 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam) == member);
8826 LAMBDA_EXPR_THIS_CAPTURE (lam) = var;
8829 if (fn == current_function_decl)
8830 insert_capture_proxy (var);
8832 VEC_safe_push (tree, gc, LAMBDA_EXPR_PENDING_PROXIES (lam), var);
8837 /* From an ID and INITIALIZER, create a capture (by reference if
8838 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8842 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
8843 bool explicit_init_p)
8846 tree type, member, name;
8848 type = lambda_capture_field_type (initializer);
8851 type = build_reference_type (type);
8852 if (!real_lvalue_p (initializer))
8853 error ("cannot capture %qE by reference", initializer);
8856 /* Capture by copy requires a complete type. */
8857 type = complete_type (type);
8859 /* Add __ to the beginning of the field name so that user code
8860 won't find the field with name lookup. We can't just leave the name
8861 unset because template instantiation uses the name to find
8862 instantiated fields. */
8863 buf = (char *) alloca (IDENTIFIER_LENGTH (id) + 3);
8864 buf[1] = buf[0] = '_';
8865 memcpy (buf + 2, IDENTIFIER_POINTER (id),
8866 IDENTIFIER_LENGTH (id) + 1);
8867 name = get_identifier (buf);
8869 /* If TREE_TYPE isn't set, we're still in the introducer, so check
8871 if (!LAMBDA_EXPR_CLOSURE (lambda))
8873 if (IDENTIFIER_MARKED (name))
8875 pedwarn (input_location, 0,
8876 "already captured %qD in lambda expression", id);
8879 IDENTIFIER_MARKED (name) = true;
8882 /* Make member variable. */
8883 member = build_lang_decl (FIELD_DECL, name, type);
8885 if (!explicit_init_p)
8886 /* Normal captures are invisible to name lookup but uses are replaced
8887 with references to the capture field; we implement this by only
8888 really making them invisible in unevaluated context; see
8889 qualify_lookup. For now, let's make explicitly initialized captures
8891 DECL_NORMAL_CAPTURE_P (member) = true;
8893 if (id == this_identifier)
8894 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
8896 /* Add it to the appropriate closure class if we've started it. */
8897 if (current_class_type
8898 && current_class_type == LAMBDA_EXPR_CLOSURE (lambda))
8899 finish_member_declaration (member);
8901 LAMBDA_EXPR_CAPTURE_LIST (lambda)
8902 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
8904 if (LAMBDA_EXPR_CLOSURE (lambda))
8905 return build_capture_proxy (member);
8906 /* For explicit captures we haven't started the function yet, so we wait
8907 and build the proxy from cp_parser_lambda_body. */
8911 /* Register all the capture members on the list CAPTURES, which is the
8912 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8915 register_capture_members (tree captures)
8917 if (captures == NULL_TREE)
8920 register_capture_members (TREE_CHAIN (captures));
8921 /* We set this in add_capture to avoid duplicates. */
8922 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures))) = false;
8923 finish_member_declaration (TREE_PURPOSE (captures));
8926 /* Similar to add_capture, except this works on a stack of nested lambdas.
8927 BY_REFERENCE_P in this case is derived from the default capture mode.
8928 Returns the capture for the lambda at the bottom of the stack. */
8931 add_default_capture (tree lambda_stack, tree id, tree initializer)
8933 bool this_capture_p = (id == this_identifier);
8935 tree var = NULL_TREE;
8937 tree saved_class_type = current_class_type;
8941 for (node = lambda_stack;
8943 node = TREE_CHAIN (node))
8945 tree lambda = TREE_VALUE (node);
8947 current_class_type = LAMBDA_EXPR_CLOSURE (lambda);
8948 var = add_capture (lambda,
8953 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
8954 == CPLD_REFERENCE)),
8955 /*explicit_init_p=*/false);
8956 initializer = convert_from_reference (var);
8959 current_class_type = saved_class_type;
8964 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8965 INDIRECT_REF, possibly adding it through default capturing. */
8968 lambda_expr_this_capture (tree lambda)
8972 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8974 /* Try to default capture 'this' if we can. */
8976 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
8978 tree containing_function = TYPE_CONTEXT (LAMBDA_EXPR_CLOSURE (lambda));
8979 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
8980 tree init = NULL_TREE;
8982 /* If we are in a lambda function, we can move out until we hit:
8983 1. a non-lambda function,
8984 2. a lambda function capturing 'this', or
8985 3. a non-default capturing lambda function. */
8986 while (LAMBDA_FUNCTION_P (containing_function))
8989 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
8991 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
8993 /* An outer lambda has already captured 'this'. */
8994 init = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8998 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
8999 /* An outer lambda won't let us capture 'this'. */
9002 lambda_stack = tree_cons (NULL_TREE,
9006 containing_function = decl_function_context (containing_function);
9009 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
9010 && !LAMBDA_FUNCTION_P (containing_function))
9011 /* First parameter is 'this'. */
9012 init = DECL_ARGUMENTS (containing_function);
9015 this_capture = add_default_capture (lambda_stack,
9016 /*id=*/this_identifier,
9022 error ("%<this%> was not captured for this lambda function");
9023 result = error_mark_node;
9027 /* To make sure that current_class_ref is for the lambda. */
9028 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref))
9029 == LAMBDA_EXPR_CLOSURE (lambda));
9031 result = this_capture;
9033 /* If 'this' is captured, each use of 'this' is transformed into an
9034 access to the corresponding unnamed data member of the closure
9035 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9036 ensures that the transformed expression is an rvalue. ] */
9037 result = rvalue (result);
9043 /* Returns the method basetype of the innermost non-lambda function, or
9044 NULL_TREE if none. */
9047 nonlambda_method_basetype (void)
9050 if (!current_class_ref)
9053 type = current_class_type;
9054 if (!LAMBDA_TYPE_P (type))
9057 /* Find the nearest enclosing non-lambda function. */
9058 fn = TYPE_NAME (type);
9060 fn = decl_function_context (fn);
9061 while (fn && LAMBDA_FUNCTION_P (fn));
9063 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9066 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
9069 /* If the closure TYPE has a static op(), also add a conversion to function
9073 maybe_add_lambda_conv_op (tree type)
9075 bool nested = (current_function_decl != NULL_TREE);
9076 tree callop = lambda_function (type);
9077 tree rettype, name, fntype, fn, body, compound_stmt;
9078 tree thistype, stattype, statfn, convfn, call, arg;
9079 VEC (tree, gc) *argvec;
9081 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
9084 if (processing_template_decl)
9087 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
9088 FUNCTION_ARG_CHAIN (callop));
9090 /* First build up the conversion op. */
9092 rettype = build_pointer_type (stattype);
9093 name = mangle_conv_op_name_for_type (rettype);
9094 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
9095 fntype = build_method_type_directly (thistype, rettype, void_list_node);
9096 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
9097 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9099 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9100 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9101 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9103 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
9104 grokclassfn (type, fn, NO_SPECIAL);
9105 set_linkage_according_to_type (type, fn);
9106 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9107 DECL_IN_AGGR_P (fn) = 1;
9108 DECL_ARTIFICIAL (fn) = 1;
9109 DECL_NOT_REALLY_EXTERN (fn) = 1;
9110 DECL_DECLARED_INLINE_P (fn) = 1;
9111 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
9113 DECL_INTERFACE_KNOWN (fn) = 1;
9115 add_method (type, fn, NULL_TREE);
9117 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9118 the conversion op is used. */
9119 if (varargs_function_p (callop))
9121 DECL_DELETED_FN (fn) = 1;
9125 /* Now build up the thunk to be returned. */
9127 name = get_identifier ("_FUN");
9128 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
9129 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9130 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9131 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9132 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9133 grokclassfn (type, fn, NO_SPECIAL);
9134 set_linkage_according_to_type (type, fn);
9135 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9136 DECL_IN_AGGR_P (fn) = 1;
9137 DECL_ARTIFICIAL (fn) = 1;
9138 DECL_NOT_REALLY_EXTERN (fn) = 1;
9139 DECL_DECLARED_INLINE_P (fn) = 1;
9140 DECL_STATIC_FUNCTION_P (fn) = 1;
9141 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
9142 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
9143 DECL_CONTEXT (arg) = fn;
9145 DECL_INTERFACE_KNOWN (fn) = 1;
9147 add_method (type, fn, NULL_TREE);
9150 push_function_context ();
9152 /* Still increment function_depth so that we don't GC in the
9153 middle of an expression. */
9156 /* Generate the body of the thunk. */
9158 start_preparsed_function (statfn, NULL_TREE,
9159 SF_PRE_PARSED | SF_INCLASS_INLINE);
9160 if (DECL_ONE_ONLY (statfn))
9162 /* Put the thunk in the same comdat group as the call op. */
9163 cgraph_add_to_same_comdat_group (cgraph_get_create_node (statfn),
9164 cgraph_get_create_node (callop));
9166 body = begin_function_body ();
9167 compound_stmt = begin_compound_stmt (0);
9169 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
9171 argvec = make_tree_vector ();
9172 VEC_quick_push (tree, argvec, arg);
9173 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
9175 mark_exp_read (arg);
9176 VEC_safe_push (tree, gc, argvec, arg);
9178 call = build_call_a (callop, VEC_length (tree, argvec),
9179 VEC_address (tree, argvec));
9180 CALL_FROM_THUNK_P (call) = 1;
9181 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
9182 call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error);
9183 call = convert_from_reference (call);
9184 finish_return_stmt (call);
9186 finish_compound_stmt (compound_stmt);
9187 finish_function_body (body);
9189 expand_or_defer_fn (finish_function (2));
9191 /* Generate the body of the conversion op. */
9193 start_preparsed_function (convfn, NULL_TREE,
9194 SF_PRE_PARSED | SF_INCLASS_INLINE);
9195 body = begin_function_body ();
9196 compound_stmt = begin_compound_stmt (0);
9198 finish_return_stmt (decay_conversion (statfn));
9200 finish_compound_stmt (compound_stmt);
9201 finish_function_body (body);
9203 expand_or_defer_fn (finish_function (2));
9206 pop_function_context ();
9211 /* Returns true iff VAL is a lambda-related declaration which should
9212 be ignored by unqualified lookup. */
9215 is_lambda_ignored_entity (tree val)
9217 /* In unevaluated context, look past normal capture proxies. */
9218 if (cp_unevaluated_operand && is_normal_capture_proxy (val))
9221 /* Always ignore lambda fields, their names are only for debugging. */
9222 if (TREE_CODE (val) == FIELD_DECL
9223 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val)))
9226 /* None of the lookups that use qualify_lookup want the op() from the
9227 lambda; they want the one from the enclosing class. */
9228 if (TREE_CODE (val) == FUNCTION_DECL && LAMBDA_FUNCTION_P (val))
9234 #include "gt-cp-semantics.h"