1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
34 #include "c-family/c-objc.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
41 #include "diagnostic.h"
43 #include "tree-iterator.h"
49 /* There routines provide a modular interface to perform many parsing
50 operations. They may therefore be used during actual parsing, or
51 during template instantiation, which may be regarded as a
52 degenerate form of parsing. */
54 static tree maybe_convert_cond (tree);
55 static tree finalize_nrv_r (tree *, int *, void *);
56 static tree capture_decltype (tree);
57 static tree thisify_lambda_field (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 append_to_statement_list_force (t, &cur_stmt_list);
401 /* Returns the stmt_tree to which statements are currently being added. */
404 current_stmt_tree (void)
407 ? &cfun->language->base.x_stmt_tree
408 : &scope_chain->x_stmt_tree);
411 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
414 maybe_cleanup_point_expr (tree expr)
416 if (!processing_template_decl && stmts_are_full_exprs_p ())
417 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
421 /* Like maybe_cleanup_point_expr except have the type of the new expression be
422 void so we don't need to create a temporary variable to hold the inner
423 expression. The reason why we do this is because the original type might be
424 an aggregate and we cannot create a temporary variable for that type. */
427 maybe_cleanup_point_expr_void (tree expr)
429 if (!processing_template_decl && stmts_are_full_exprs_p ())
430 expr = fold_build_cleanup_point_expr (void_type_node, expr);
436 /* Create a declaration statement for the declaration given by the DECL. */
439 add_decl_expr (tree decl)
441 tree r = build_stmt (input_location, DECL_EXPR, decl);
442 if (DECL_INITIAL (decl)
443 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
444 r = maybe_cleanup_point_expr_void (r);
448 /* Finish a scope. */
451 do_poplevel (tree stmt_list)
455 if (stmts_are_full_exprs_p ())
456 block = poplevel (kept_level_p (), 1, 0);
458 stmt_list = pop_stmt_list (stmt_list);
460 if (!processing_template_decl)
462 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
463 /* ??? See c_end_compound_stmt re statement expressions. */
469 /* Begin a new scope. */
472 do_pushlevel (scope_kind sk)
474 tree ret = push_stmt_list ();
475 if (stmts_are_full_exprs_p ())
476 begin_scope (sk, NULL);
480 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
481 when the current scope is exited. EH_ONLY is true when this is not
482 meant to apply to normal control flow transfer. */
485 push_cleanup (tree decl, tree cleanup, bool eh_only)
487 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
488 CLEANUP_EH_ONLY (stmt) = eh_only;
490 CLEANUP_BODY (stmt) = push_stmt_list ();
493 /* Begin a conditional that might contain a declaration. When generating
494 normal code, we want the declaration to appear before the statement
495 containing the conditional. When generating template code, we want the
496 conditional to be rendered as the raw DECL_EXPR. */
499 begin_cond (tree *cond_p)
501 if (processing_template_decl)
502 *cond_p = push_stmt_list ();
505 /* Finish such a conditional. */
508 finish_cond (tree *cond_p, tree expr)
510 if (processing_template_decl)
512 tree cond = pop_stmt_list (*cond_p);
513 if (TREE_CODE (cond) == DECL_EXPR)
516 if (check_for_bare_parameter_packs (expr))
517 *cond_p = error_mark_node;
522 /* If *COND_P specifies a conditional with a declaration, transform the
525 for (; A x = 42;) { }
527 while (true) { A x = 42; if (!x) break; }
528 for (;;) { A x = 42; if (!x) break; }
529 The statement list for BODY will be empty if the conditional did
530 not declare anything. */
533 simplify_loop_decl_cond (tree *cond_p, tree body)
537 if (!TREE_SIDE_EFFECTS (body))
541 *cond_p = boolean_true_node;
543 if_stmt = begin_if_stmt ();
544 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
545 finish_if_stmt_cond (cond, if_stmt);
546 finish_break_stmt ();
547 finish_then_clause (if_stmt);
548 finish_if_stmt (if_stmt);
551 /* Finish a goto-statement. */
554 finish_goto_stmt (tree destination)
556 if (TREE_CODE (destination) == IDENTIFIER_NODE)
557 destination = lookup_label (destination);
559 /* We warn about unused labels with -Wunused. That means we have to
560 mark the used labels as used. */
561 if (TREE_CODE (destination) == LABEL_DECL)
562 TREE_USED (destination) = 1;
565 destination = mark_rvalue_use (destination);
566 if (!processing_template_decl)
568 destination = cp_convert (ptr_type_node, destination);
569 if (error_operand_p (destination))
572 /* We don't inline calls to functions with computed gotos.
573 Those functions are typically up to some funny business,
574 and may be depending on the labels being at particular
575 addresses, or some such. */
576 DECL_UNINLINABLE (current_function_decl) = 1;
579 check_goto (destination);
581 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
584 /* COND is the condition-expression for an if, while, etc.,
585 statement. Convert it to a boolean value, if appropriate.
586 In addition, verify sequence points if -Wsequence-point is enabled. */
589 maybe_convert_cond (tree cond)
591 /* Empty conditions remain empty. */
595 /* Wait until we instantiate templates before doing conversion. */
596 if (processing_template_decl)
599 if (warn_sequence_point)
600 verify_sequence_points (cond);
602 /* Do the conversion. */
603 cond = convert_from_reference (cond);
605 if (TREE_CODE (cond) == MODIFY_EXPR
606 && !TREE_NO_WARNING (cond)
609 warning (OPT_Wparentheses,
610 "suggest parentheses around assignment used as truth value");
611 TREE_NO_WARNING (cond) = 1;
614 return condition_conversion (cond);
617 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
620 finish_expr_stmt (tree expr)
624 if (expr != NULL_TREE)
626 if (!processing_template_decl)
628 if (warn_sequence_point)
629 verify_sequence_points (expr);
630 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
632 else if (!type_dependent_expression_p (expr))
633 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
634 tf_warning_or_error);
636 if (check_for_bare_parameter_packs (expr))
637 expr = error_mark_node;
639 /* Simplification of inner statement expressions, compound exprs,
640 etc can result in us already having an EXPR_STMT. */
641 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
643 if (TREE_CODE (expr) != EXPR_STMT)
644 expr = build_stmt (input_location, EXPR_STMT, expr);
645 expr = maybe_cleanup_point_expr_void (expr);
657 /* Begin an if-statement. Returns a newly created IF_STMT if
664 scope = do_pushlevel (sk_block);
665 r = build_stmt (input_location, IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
666 TREE_CHAIN (r) = scope;
667 begin_cond (&IF_COND (r));
671 /* Process the COND of an if-statement, which may be given by
675 finish_if_stmt_cond (tree cond, tree if_stmt)
677 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
679 THEN_CLAUSE (if_stmt) = push_stmt_list ();
682 /* Finish the then-clause of an if-statement, which may be given by
686 finish_then_clause (tree if_stmt)
688 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
692 /* Begin the else-clause of an if-statement. */
695 begin_else_clause (tree if_stmt)
697 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
700 /* Finish the else-clause of an if-statement, which may be given by
704 finish_else_clause (tree if_stmt)
706 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
709 /* Finish an if-statement. */
712 finish_if_stmt (tree if_stmt)
714 tree scope = TREE_CHAIN (if_stmt);
715 TREE_CHAIN (if_stmt) = NULL;
716 add_stmt (do_poplevel (scope));
720 /* Begin a while-statement. Returns a newly created WHILE_STMT if
724 begin_while_stmt (void)
727 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
729 WHILE_BODY (r) = do_pushlevel (sk_block);
730 begin_cond (&WHILE_COND (r));
734 /* Process the COND of a while-statement, which may be given by
738 finish_while_stmt_cond (tree cond, tree while_stmt)
740 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
741 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
744 /* Finish a while-statement, which may be given by WHILE_STMT. */
747 finish_while_stmt (tree while_stmt)
749 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
753 /* Begin a do-statement. Returns a newly created DO_STMT if
759 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
761 DO_BODY (r) = push_stmt_list ();
765 /* Finish the body of a do-statement, which may be given by DO_STMT. */
768 finish_do_body (tree do_stmt)
770 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
772 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
773 body = STATEMENT_LIST_TAIL (body)->stmt;
775 if (IS_EMPTY_STMT (body))
776 warning (OPT_Wempty_body,
777 "suggest explicit braces around empty body in %<do%> statement");
780 /* Finish a do-statement, which may be given by DO_STMT, and whose
781 COND is as indicated. */
784 finish_do_stmt (tree cond, tree do_stmt)
786 cond = maybe_convert_cond (cond);
787 DO_COND (do_stmt) = cond;
791 /* Finish a return-statement. The EXPRESSION returned, if any, is as
795 finish_return_stmt (tree expr)
800 expr = check_return_expr (expr, &no_warning);
802 if (flag_openmp && !check_omp_return ())
803 return error_mark_node;
804 if (!processing_template_decl)
806 if (warn_sequence_point)
807 verify_sequence_points (expr);
809 if (DECL_DESTRUCTOR_P (current_function_decl)
810 || (DECL_CONSTRUCTOR_P (current_function_decl)
811 && targetm.cxx.cdtor_returns_this ()))
813 /* Similarly, all destructors must run destructors for
814 base-classes before returning. So, all returns in a
815 destructor get sent to the DTOR_LABEL; finish_function emits
816 code to return a value there. */
817 return finish_goto_stmt (cdtor_label);
821 r = build_stmt (input_location, RETURN_EXPR, expr);
822 TREE_NO_WARNING (r) |= no_warning;
823 r = maybe_cleanup_point_expr_void (r);
830 /* Begin the scope of a for-statement or a range-for-statement.
831 Both the returned trees are to be used in a call to
832 begin_for_stmt or begin_range_for_stmt. */
835 begin_for_scope (tree *init)
837 tree scope = NULL_TREE;
838 if (flag_new_for_scope > 0)
839 scope = do_pushlevel (sk_for);
841 if (processing_template_decl)
842 *init = push_stmt_list ();
849 /* Begin a for-statement. Returns a new FOR_STMT.
850 SCOPE and INIT should be the return of begin_for_scope,
854 begin_for_stmt (tree scope, tree init)
858 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
859 NULL_TREE, NULL_TREE);
861 if (scope == NULL_TREE)
863 gcc_assert (!init || !(flag_new_for_scope > 0));
865 scope = begin_for_scope (&init);
867 FOR_INIT_STMT (r) = init;
868 TREE_CHAIN (r) = scope;
873 /* Finish the for-init-statement of a for-statement, which may be
874 given by FOR_STMT. */
877 finish_for_init_stmt (tree for_stmt)
879 if (processing_template_decl)
880 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
882 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
883 begin_cond (&FOR_COND (for_stmt));
886 /* Finish the COND of a for-statement, which may be given by
890 finish_for_cond (tree cond, tree for_stmt)
892 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
893 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
896 /* Finish the increment-EXPRESSION in a for-statement, which may be
897 given by FOR_STMT. */
900 finish_for_expr (tree expr, tree for_stmt)
904 /* If EXPR is an overloaded function, issue an error; there is no
905 context available to use to perform overload resolution. */
906 if (type_unknown_p (expr))
908 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
909 expr = error_mark_node;
911 if (!processing_template_decl)
913 if (warn_sequence_point)
914 verify_sequence_points (expr);
915 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
916 tf_warning_or_error);
918 else if (!type_dependent_expression_p (expr))
919 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
920 tf_warning_or_error);
921 expr = maybe_cleanup_point_expr_void (expr);
922 if (check_for_bare_parameter_packs (expr))
923 expr = error_mark_node;
924 FOR_EXPR (for_stmt) = expr;
927 /* Finish the body of a for-statement, which may be given by
928 FOR_STMT. The increment-EXPR for the loop must be
930 It can also finish RANGE_FOR_STMT. */
933 finish_for_stmt (tree for_stmt)
935 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
936 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
938 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
940 /* Pop the scope for the body of the loop. */
941 if (flag_new_for_scope > 0)
943 tree scope = TREE_CHAIN (for_stmt);
944 TREE_CHAIN (for_stmt) = NULL;
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);
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 TREE_CHAIN (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 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
1019 scope = do_pushlevel (sk_block);
1020 TREE_CHAIN (r) = scope;
1021 begin_cond (&SWITCH_STMT_COND (r));
1026 /* Finish the cond of a switch-statement. */
1029 finish_switch_cond (tree cond, tree switch_stmt)
1031 tree orig_type = NULL;
1032 if (!processing_template_decl)
1034 /* Convert the condition to an integer or enumeration type. */
1035 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1036 if (cond == NULL_TREE)
1038 error ("switch quantity not an integer");
1039 cond = error_mark_node;
1041 orig_type = TREE_TYPE (cond);
1042 if (cond != error_mark_node)
1046 Integral promotions are performed. */
1047 cond = perform_integral_promotions (cond);
1048 cond = maybe_cleanup_point_expr (cond);
1051 if (check_for_bare_parameter_packs (cond))
1052 cond = error_mark_node;
1053 else if (!processing_template_decl && warn_sequence_point)
1054 verify_sequence_points (cond);
1056 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1057 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1058 add_stmt (switch_stmt);
1059 push_switch (switch_stmt);
1060 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1063 /* Finish the body of a switch-statement, which may be given by
1064 SWITCH_STMT. The COND to switch on is indicated. */
1067 finish_switch_stmt (tree switch_stmt)
1071 SWITCH_STMT_BODY (switch_stmt) =
1072 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1076 scope = TREE_CHAIN (switch_stmt);
1077 TREE_CHAIN (switch_stmt) = NULL;
1078 add_stmt (do_poplevel (scope));
1081 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1085 begin_try_block (void)
1087 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1089 TRY_STMTS (r) = push_stmt_list ();
1093 /* Likewise, for a function-try-block. The block returned in
1094 *COMPOUND_STMT is an artificial outer scope, containing the
1095 function-try-block. */
1098 begin_function_try_block (tree *compound_stmt)
1101 /* This outer scope does not exist in the C++ standard, but we need
1102 a place to put __FUNCTION__ and similar variables. */
1103 *compound_stmt = begin_compound_stmt (0);
1104 r = begin_try_block ();
1105 FN_TRY_BLOCK_P (r) = 1;
1109 /* Finish a try-block, which may be given by TRY_BLOCK. */
1112 finish_try_block (tree try_block)
1114 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1115 TRY_HANDLERS (try_block) = push_stmt_list ();
1118 /* Finish the body of a cleanup try-block, which may be given by
1122 finish_cleanup_try_block (tree try_block)
1124 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1127 /* Finish an implicitly generated try-block, with a cleanup is given
1131 finish_cleanup (tree cleanup, tree try_block)
1133 TRY_HANDLERS (try_block) = cleanup;
1134 CLEANUP_P (try_block) = 1;
1137 /* Likewise, for a function-try-block. */
1140 finish_function_try_block (tree try_block)
1142 finish_try_block (try_block);
1143 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1144 the try block, but moving it inside. */
1145 in_function_try_handler = 1;
1148 /* Finish a handler-sequence for a try-block, which may be given by
1152 finish_handler_sequence (tree try_block)
1154 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1155 check_handlers (TRY_HANDLERS (try_block));
1158 /* Finish the handler-seq for a function-try-block, given by
1159 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1160 begin_function_try_block. */
1163 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1165 in_function_try_handler = 0;
1166 finish_handler_sequence (try_block);
1167 finish_compound_stmt (compound_stmt);
1170 /* Begin a handler. Returns a HANDLER if appropriate. */
1173 begin_handler (void)
1177 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1180 /* Create a binding level for the eh_info and the exception object
1182 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1187 /* Finish the handler-parameters for a handler, which may be given by
1188 HANDLER. DECL is the declaration for the catch parameter, or NULL
1189 if this is a `catch (...)' clause. */
1192 finish_handler_parms (tree decl, tree handler)
1194 tree type = NULL_TREE;
1195 if (processing_template_decl)
1199 decl = pushdecl (decl);
1200 decl = push_template_decl (decl);
1201 HANDLER_PARMS (handler) = decl;
1202 type = TREE_TYPE (decl);
1206 type = expand_start_catch_block (decl);
1207 HANDLER_TYPE (handler) = type;
1208 if (!processing_template_decl && type)
1209 mark_used (eh_type_info (type));
1212 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1213 the return value from the matching call to finish_handler_parms. */
1216 finish_handler (tree handler)
1218 if (!processing_template_decl)
1219 expand_end_catch_block ();
1220 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1223 /* Begin a compound statement. FLAGS contains some bits that control the
1224 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1225 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1226 block of a function. If BCS_TRY_BLOCK is set, this is the block
1227 created on behalf of a TRY statement. Returns a token to be passed to
1228 finish_compound_stmt. */
1231 begin_compound_stmt (unsigned int flags)
1235 if (flags & BCS_NO_SCOPE)
1237 r = push_stmt_list ();
1238 STATEMENT_LIST_NO_SCOPE (r) = 1;
1240 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1241 But, if it's a statement-expression with a scopeless block, there's
1242 nothing to keep, and we don't want to accidentally keep a block
1243 *inside* the scopeless block. */
1244 keep_next_level (false);
1247 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1249 /* When processing a template, we need to remember where the braces were,
1250 so that we can set up identical scopes when instantiating the template
1251 later. BIND_EXPR is a handy candidate for this.
1252 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1253 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1254 processing templates. */
1255 if (processing_template_decl)
1257 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1258 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1259 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1260 TREE_SIDE_EFFECTS (r) = 1;
1266 /* Finish a compound-statement, which is given by STMT. */
1269 finish_compound_stmt (tree stmt)
1271 if (TREE_CODE (stmt) == BIND_EXPR)
1273 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1274 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1275 discard the BIND_EXPR so it can be merged with the containing
1277 if (TREE_CODE (body) == STATEMENT_LIST
1278 && STATEMENT_LIST_HEAD (body) == NULL
1279 && !BIND_EXPR_BODY_BLOCK (stmt)
1280 && !BIND_EXPR_TRY_BLOCK (stmt))
1283 BIND_EXPR_BODY (stmt) = body;
1285 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1286 stmt = pop_stmt_list (stmt);
1289 /* Destroy any ObjC "super" receivers that may have been
1291 objc_clear_super_receiver ();
1293 stmt = do_poplevel (stmt);
1296 /* ??? See c_end_compound_stmt wrt statement expressions. */
1301 /* Finish an asm-statement, whose components are a STRING, some
1302 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1303 LABELS. Also note whether the asm-statement should be
1304 considered volatile. */
1307 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1308 tree input_operands, tree clobbers, tree labels)
1312 int ninputs = list_length (input_operands);
1313 int noutputs = list_length (output_operands);
1315 if (!processing_template_decl)
1317 const char *constraint;
1318 const char **oconstraints;
1319 bool allows_mem, allows_reg, is_inout;
1323 oconstraints = XALLOCAVEC (const char *, noutputs);
1325 string = resolve_asm_operand_names (string, output_operands,
1326 input_operands, labels);
1328 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1330 operand = TREE_VALUE (t);
1332 /* ??? Really, this should not be here. Users should be using a
1333 proper lvalue, dammit. But there's a long history of using
1334 casts in the output operands. In cases like longlong.h, this
1335 becomes a primitive form of typechecking -- if the cast can be
1336 removed, then the output operand had a type of the proper width;
1337 otherwise we'll get an error. Gross, but ... */
1338 STRIP_NOPS (operand);
1340 operand = mark_lvalue_use (operand);
1342 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1343 operand = error_mark_node;
1345 if (operand != error_mark_node
1346 && (TREE_READONLY (operand)
1347 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1348 /* Functions are not modifiable, even though they are
1350 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1351 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1352 /* If it's an aggregate and any field is const, then it is
1353 effectively const. */
1354 || (CLASS_TYPE_P (TREE_TYPE (operand))
1355 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1356 cxx_readonly_error (operand, lv_asm);
1358 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1359 oconstraints[i] = constraint;
1361 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1362 &allows_mem, &allows_reg, &is_inout))
1364 /* If the operand is going to end up in memory,
1365 mark it addressable. */
1366 if (!allows_reg && !cxx_mark_addressable (operand))
1367 operand = error_mark_node;
1370 operand = error_mark_node;
1372 TREE_VALUE (t) = operand;
1375 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1377 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1378 operand = decay_conversion (TREE_VALUE (t));
1380 /* If the type of the operand hasn't been determined (e.g.,
1381 because it involves an overloaded function), then issue
1382 an error message. There's no context available to
1383 resolve the overloading. */
1384 if (TREE_TYPE (operand) == unknown_type_node)
1386 error ("type of asm operand %qE could not be determined",
1388 operand = error_mark_node;
1391 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1392 oconstraints, &allows_mem, &allows_reg))
1394 /* If the operand is going to end up in memory,
1395 mark it addressable. */
1396 if (!allows_reg && allows_mem)
1398 /* Strip the nops as we allow this case. FIXME, this really
1399 should be rejected or made deprecated. */
1400 STRIP_NOPS (operand);
1401 if (!cxx_mark_addressable (operand))
1402 operand = error_mark_node;
1406 operand = error_mark_node;
1408 TREE_VALUE (t) = operand;
1412 r = build_stmt (input_location, ASM_EXPR, string,
1413 output_operands, input_operands,
1415 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1416 r = maybe_cleanup_point_expr_void (r);
1417 return add_stmt (r);
1420 /* Finish a label with the indicated NAME. Returns the new label. */
1423 finish_label_stmt (tree name)
1425 tree decl = define_label (input_location, name);
1427 if (decl == error_mark_node)
1428 return error_mark_node;
1430 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1435 /* Finish a series of declarations for local labels. G++ allows users
1436 to declare "local" labels, i.e., labels with scope. This extension
1437 is useful when writing code involving statement-expressions. */
1440 finish_label_decl (tree name)
1442 if (!at_function_scope_p ())
1444 error ("__label__ declarations are only allowed in function scopes");
1448 add_decl_expr (declare_local_label (name));
1451 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1454 finish_decl_cleanup (tree decl, tree cleanup)
1456 push_cleanup (decl, cleanup, false);
1459 /* If the current scope exits with an exception, run CLEANUP. */
1462 finish_eh_cleanup (tree cleanup)
1464 push_cleanup (NULL, cleanup, true);
1467 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1468 order they were written by the user. Each node is as for
1469 emit_mem_initializers. */
1472 finish_mem_initializers (tree mem_inits)
1474 /* Reorder the MEM_INITS so that they are in the order they appeared
1475 in the source program. */
1476 mem_inits = nreverse (mem_inits);
1478 if (processing_template_decl)
1482 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1484 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1485 check for bare parameter packs in the TREE_VALUE, because
1486 any parameter packs in the TREE_VALUE have already been
1487 bound as part of the TREE_PURPOSE. See
1488 make_pack_expansion for more information. */
1489 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1490 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1491 TREE_VALUE (mem) = error_mark_node;
1494 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1497 emit_mem_initializers (mem_inits);
1500 /* Finish a parenthesized expression EXPR. */
1503 finish_parenthesized_expr (tree expr)
1506 /* This inhibits warnings in c_common_truthvalue_conversion. */
1507 TREE_NO_WARNING (expr) = 1;
1509 if (TREE_CODE (expr) == OFFSET_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 type = TREE_TYPE (type);
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 build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1578 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1579 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1581 else if (processing_template_decl)
1582 return build_qualified_name (TREE_TYPE (decl),
1585 /*template_p=*/false);
1588 tree access_type = TREE_TYPE (object);
1590 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1593 /* If the data member was named `C::M', convert `*this' to `C'
1595 if (qualifying_scope)
1597 tree binfo = NULL_TREE;
1598 object = build_scoped_ref (object, qualifying_scope,
1602 return build_class_member_access_expr (object, decl,
1603 /*access_path=*/NULL_TREE,
1604 /*preserve_reference=*/false,
1605 tf_warning_or_error);
1609 /* If we are currently parsing a template and we encountered a typedef
1610 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1611 adds the typedef to a list tied to the current template.
1612 At tempate instantiatin time, that list is walked and access check
1613 performed for each typedef.
1614 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1617 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1619 location_t location)
1621 tree template_info = NULL;
1622 tree cs = current_scope ();
1624 if (!is_typedef_decl (typedef_decl)
1626 || !CLASS_TYPE_P (context)
1630 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1631 template_info = get_template_info (cs);
1634 && TI_TEMPLATE (template_info)
1635 && !currently_open_class (context))
1636 append_type_to_template_for_access_check (cs, typedef_decl,
1640 /* DECL was the declaration to which a qualified-id resolved. Issue
1641 an error message if it is not accessible. If OBJECT_TYPE is
1642 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1643 type of `*x', or `x', respectively. If the DECL was named as
1644 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1647 check_accessibility_of_qualified_id (tree decl,
1649 tree nested_name_specifier)
1652 tree qualifying_type = NULL_TREE;
1654 /* If we are parsing a template declaration and if decl is a typedef,
1655 add it to a list tied to the template.
1656 At template instantiation time, that list will be walked and
1657 access check performed. */
1658 add_typedef_to_current_template_for_access_check (decl,
1659 nested_name_specifier
1660 ? nested_name_specifier
1661 : DECL_CONTEXT (decl),
1664 /* If we're not checking, return immediately. */
1665 if (deferred_access_no_check)
1668 /* Determine the SCOPE of DECL. */
1669 scope = context_for_name_lookup (decl);
1670 /* If the SCOPE is not a type, then DECL is not a member. */
1671 if (!TYPE_P (scope))
1673 /* Compute the scope through which DECL is being accessed. */
1675 /* OBJECT_TYPE might not be a class type; consider:
1677 class A { typedef int I; };
1681 In this case, we will have "A::I" as the DECL, but "I" as the
1683 && CLASS_TYPE_P (object_type)
1684 && DERIVED_FROM_P (scope, object_type))
1685 /* If we are processing a `->' or `.' expression, use the type of the
1687 qualifying_type = object_type;
1688 else if (nested_name_specifier)
1690 /* If the reference is to a non-static member of the
1691 current class, treat it as if it were referenced through
1693 if (DECL_NONSTATIC_MEMBER_P (decl)
1694 && current_class_ptr
1695 && DERIVED_FROM_P (scope, current_class_type))
1696 qualifying_type = current_class_type;
1697 /* Otherwise, use the type indicated by the
1698 nested-name-specifier. */
1700 qualifying_type = nested_name_specifier;
1703 /* Otherwise, the name must be from the current class or one of
1705 qualifying_type = currently_open_derived_class (scope);
1708 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1709 or similar in a default argument value. */
1710 && CLASS_TYPE_P (qualifying_type)
1711 && !dependent_type_p (qualifying_type))
1712 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1716 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1717 class named to the left of the "::" operator. DONE is true if this
1718 expression is a complete postfix-expression; it is false if this
1719 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1720 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1721 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1722 is true iff this qualified name appears as a template argument. */
1725 finish_qualified_id_expr (tree qualifying_class,
1730 bool template_arg_p)
1732 gcc_assert (TYPE_P (qualifying_class));
1734 if (error_operand_p (expr))
1735 return error_mark_node;
1737 if (DECL_P (expr) || BASELINK_P (expr))
1741 check_template_keyword (expr);
1743 /* If EXPR occurs as the operand of '&', use special handling that
1744 permits a pointer-to-member. */
1745 if (address_p && done)
1747 if (TREE_CODE (expr) == SCOPE_REF)
1748 expr = TREE_OPERAND (expr, 1);
1749 expr = build_offset_ref (qualifying_class, expr,
1750 /*address_p=*/true);
1754 /* Within the scope of a class, turn references to non-static
1755 members into expression of the form "this->...". */
1757 /* But, within a template argument, we do not want make the
1758 transformation, as there is no "this" pointer. */
1760 else if (TREE_CODE (expr) == FIELD_DECL)
1762 push_deferring_access_checks (dk_no_check);
1763 expr = finish_non_static_data_member (expr, NULL_TREE,
1765 pop_deferring_access_checks ();
1767 else if (BASELINK_P (expr) && !processing_template_decl)
1771 /* See if any of the functions are non-static members. */
1772 /* If so, the expression may be relative to 'this'. */
1773 if (!shared_member_p (expr)
1774 && (ob = maybe_dummy_object (qualifying_class, NULL),
1775 !is_dummy_object (ob)))
1776 expr = (build_class_member_access_expr
1779 BASELINK_ACCESS_BINFO (expr),
1780 /*preserve_reference=*/false,
1781 tf_warning_or_error));
1783 /* The expression is a qualified name whose address is not
1785 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1791 /* Begin a statement-expression. The value returned must be passed to
1792 finish_stmt_expr. */
1795 begin_stmt_expr (void)
1797 return push_stmt_list ();
1800 /* Process the final expression of a statement expression. EXPR can be
1801 NULL, if the final expression is empty. Return a STATEMENT_LIST
1802 containing all the statements in the statement-expression, or
1803 ERROR_MARK_NODE if there was an error. */
1806 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1808 if (error_operand_p (expr))
1810 /* The type of the statement-expression is the type of the last
1812 TREE_TYPE (stmt_expr) = error_mark_node;
1813 return error_mark_node;
1816 /* If the last statement does not have "void" type, then the value
1817 of the last statement is the value of the entire expression. */
1820 tree type = TREE_TYPE (expr);
1822 if (processing_template_decl)
1824 expr = build_stmt (input_location, EXPR_STMT, expr);
1825 expr = add_stmt (expr);
1826 /* Mark the last statement so that we can recognize it as such at
1827 template-instantiation time. */
1828 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1830 else if (VOID_TYPE_P (type))
1832 /* Just treat this like an ordinary statement. */
1833 expr = finish_expr_stmt (expr);
1837 /* It actually has a value we need to deal with. First, force it
1838 to be an rvalue so that we won't need to build up a copy
1839 constructor call later when we try to assign it to something. */
1840 expr = force_rvalue (expr);
1841 if (error_operand_p (expr))
1842 return error_mark_node;
1844 /* Update for array-to-pointer decay. */
1845 type = TREE_TYPE (expr);
1847 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1848 normal statement, but don't convert to void or actually add
1850 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1851 expr = maybe_cleanup_point_expr (expr);
1855 /* The type of the statement-expression is the type of the last
1857 TREE_TYPE (stmt_expr) = type;
1863 /* Finish a statement-expression. EXPR should be the value returned
1864 by the previous begin_stmt_expr. Returns an expression
1865 representing the statement-expression. */
1868 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1873 if (error_operand_p (stmt_expr))
1875 pop_stmt_list (stmt_expr);
1876 return error_mark_node;
1879 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1881 type = TREE_TYPE (stmt_expr);
1882 result = pop_stmt_list (stmt_expr);
1883 TREE_TYPE (result) = type;
1885 if (processing_template_decl)
1887 result = build_min (STMT_EXPR, type, result);
1888 TREE_SIDE_EFFECTS (result) = 1;
1889 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1891 else if (CLASS_TYPE_P (type))
1893 /* Wrap the statement-expression in a TARGET_EXPR so that the
1894 temporary object created by the final expression is destroyed at
1895 the end of the full-expression containing the
1896 statement-expression. */
1897 result = force_target_expr (type, result);
1903 /* Returns the expression which provides the value of STMT_EXPR. */
1906 stmt_expr_value_expr (tree stmt_expr)
1908 tree t = STMT_EXPR_STMT (stmt_expr);
1910 if (TREE_CODE (t) == BIND_EXPR)
1911 t = BIND_EXPR_BODY (t);
1913 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1914 t = STATEMENT_LIST_TAIL (t)->stmt;
1916 if (TREE_CODE (t) == EXPR_STMT)
1917 t = EXPR_STMT_EXPR (t);
1922 /* Return TRUE iff EXPR_STMT is an empty list of
1923 expression statements. */
1926 empty_expr_stmt_p (tree expr_stmt)
1928 tree body = NULL_TREE;
1930 if (expr_stmt == void_zero_node)
1935 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1936 body = EXPR_STMT_EXPR (expr_stmt);
1937 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1943 if (TREE_CODE (body) == STATEMENT_LIST)
1944 return tsi_end_p (tsi_start (body));
1946 return empty_expr_stmt_p (body);
1951 /* Perform Koenig lookup. FN is the postfix-expression representing
1952 the function (or functions) to call; ARGS are the arguments to the
1953 call; if INCLUDE_STD then the `std' namespace is automatically
1954 considered an associated namespace (used in range-based for loops).
1955 Returns the functions to be considered by overload resolution. */
1958 perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std)
1960 tree identifier = NULL_TREE;
1961 tree functions = NULL_TREE;
1962 tree tmpl_args = NULL_TREE;
1963 bool template_id = false;
1965 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1967 /* Use a separate flag to handle null args. */
1969 tmpl_args = TREE_OPERAND (fn, 1);
1970 fn = TREE_OPERAND (fn, 0);
1973 /* Find the name of the overloaded function. */
1974 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1976 else if (is_overloaded_fn (fn))
1979 identifier = DECL_NAME (get_first_fn (functions));
1981 else if (DECL_P (fn))
1984 identifier = DECL_NAME (fn);
1987 /* A call to a namespace-scope function using an unqualified name.
1989 Do Koenig lookup -- unless any of the arguments are
1991 if (!any_type_dependent_arguments_p (args)
1992 && !any_dependent_template_arguments_p (tmpl_args))
1994 fn = lookup_arg_dependent (identifier, functions, args, include_std);
1996 /* The unqualified name could not be resolved. */
1997 fn = unqualified_fn_lookup_error (identifier);
2000 if (fn && template_id)
2001 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2006 /* Generate an expression for `FN (ARGS)'. This may change the
2009 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2010 as a virtual call, even if FN is virtual. (This flag is set when
2011 encountering an expression where the function name is explicitly
2012 qualified. For example a call to `X::f' never generates a virtual
2015 Returns code for the call. */
2018 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
2019 bool koenig_p, tsubst_flags_t complain)
2023 VEC(tree,gc) *orig_args = NULL;
2025 if (fn == error_mark_node)
2026 return error_mark_node;
2028 gcc_assert (!TYPE_P (fn));
2032 if (processing_template_decl)
2034 /* If the call expression is dependent, build a CALL_EXPR node
2035 with no type; type_dependent_expression_p recognizes
2036 expressions with no type as being dependent. */
2037 if (type_dependent_expression_p (fn)
2038 || any_type_dependent_arguments_p (*args)
2039 /* For a non-static member function, we need to specifically
2040 test the type dependency of the "this" pointer because it
2041 is not included in *ARGS even though it is considered to
2042 be part of the list of arguments. Note that this is
2043 related to CWG issues 515 and 1005. */
2044 || ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
2045 && current_class_ref
2046 && type_dependent_expression_p (current_class_ref)))
2048 result = build_nt_call_vec (fn, *args);
2049 KOENIG_LOOKUP_P (result) = koenig_p;
2054 tree fndecl = OVL_CURRENT (fn);
2055 if (TREE_CODE (fndecl) != FUNCTION_DECL
2056 || !TREE_THIS_VOLATILE (fndecl))
2062 current_function_returns_abnormally = 1;
2066 orig_args = make_tree_vector_copy (*args);
2067 if (!BASELINK_P (fn)
2068 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2069 && TREE_TYPE (fn) != unknown_type_node)
2070 fn = build_non_dependent_expr (fn);
2071 make_args_non_dependent (*args);
2074 if (is_overloaded_fn (fn))
2075 fn = baselink_for_fns (fn);
2078 if (BASELINK_P (fn))
2082 /* A call to a member function. From [over.call.func]:
2084 If the keyword this is in scope and refers to the class of
2085 that member function, or a derived class thereof, then the
2086 function call is transformed into a qualified function call
2087 using (*this) as the postfix-expression to the left of the
2088 . operator.... [Otherwise] a contrived object of type T
2089 becomes the implied object argument.
2093 struct A { void f(); };
2094 struct B : public A {};
2095 struct C : public A { void g() { B::f(); }};
2097 "the class of that member function" refers to `A'. But 11.2
2098 [class.access.base] says that we need to convert 'this' to B* as
2099 part of the access, so we pass 'B' to maybe_dummy_object. */
2101 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2104 if (processing_template_decl)
2106 if (type_dependent_expression_p (object))
2108 tree ret = build_nt_call_vec (orig_fn, orig_args);
2109 release_tree_vector (orig_args);
2112 object = build_non_dependent_expr (object);
2115 result = build_new_method_call (object, fn, args, NULL_TREE,
2117 ? LOOKUP_NONVIRTUAL : 0),
2121 else if (is_overloaded_fn (fn))
2123 /* If the function is an overloaded builtin, resolve it. */
2124 if (TREE_CODE (fn) == FUNCTION_DECL
2125 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2126 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2127 result = resolve_overloaded_builtin (input_location, fn, *args);
2130 /* A call to a namespace-scope function. */
2131 result = build_new_function_call (fn, args, koenig_p, complain);
2133 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2135 if (!VEC_empty (tree, *args))
2136 error ("arguments to destructor are not allowed");
2137 /* Mark the pseudo-destructor call as having side-effects so
2138 that we do not issue warnings about its use. */
2139 result = build1 (NOP_EXPR,
2141 TREE_OPERAND (fn, 0));
2142 TREE_SIDE_EFFECTS (result) = 1;
2144 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2145 /* If the "function" is really an object of class type, it might
2146 have an overloaded `operator ()'. */
2147 result = build_op_call (fn, args, complain);
2150 /* A call where the function is unknown. */
2151 result = cp_build_function_call_vec (fn, args, complain);
2153 if (processing_template_decl && result != error_mark_node)
2155 if (TREE_CODE (result) == INDIRECT_REF)
2156 result = TREE_OPERAND (result, 0);
2157 gcc_assert (TREE_CODE (result) == CALL_EXPR
2158 /* FIXME cp_build_function_call_vec should avoid argument
2159 and return transformations like build_over_call does. */
2160 || TREE_CODE (result) == TARGET_EXPR
2161 || TREE_CODE (fn) == PSEUDO_DTOR_EXPR
2163 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2164 KOENIG_LOOKUP_P (result) = koenig_p;
2165 release_tree_vector (orig_args);
2166 result = convert_from_reference (result);
2172 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2173 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2174 POSTDECREMENT_EXPR.) */
2177 finish_increment_expr (tree expr, enum tree_code code)
2179 return build_x_unary_op (code, expr, tf_warning_or_error);
2182 /* Finish a use of `this'. Returns an expression for `this'. */
2185 finish_this_expr (void)
2189 if (current_class_ptr)
2191 tree type = TREE_TYPE (current_class_ref);
2193 /* In a lambda expression, 'this' refers to the captured 'this'. */
2194 if (LAMBDA_TYPE_P (type))
2195 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2197 result = current_class_ptr;
2200 else if (current_function_decl
2201 && DECL_STATIC_FUNCTION_P (current_function_decl))
2203 error ("%<this%> is unavailable for static member functions");
2204 result = error_mark_node;
2208 if (current_function_decl)
2209 error ("invalid use of %<this%> in non-member function");
2211 error ("invalid use of %<this%> at top level");
2212 result = error_mark_node;
2218 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2219 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2220 the TYPE for the type given. If SCOPE is non-NULL, the expression
2221 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2224 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2226 if (object == error_mark_node || destructor == error_mark_node)
2227 return error_mark_node;
2229 gcc_assert (TYPE_P (destructor));
2231 if (!processing_template_decl)
2233 if (scope == error_mark_node)
2235 error ("invalid qualifying scope in pseudo-destructor name");
2236 return error_mark_node;
2238 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2240 error ("qualified type %qT does not match destructor name ~%qT",
2242 return error_mark_node;
2246 /* [expr.pseudo] says both:
2248 The type designated by the pseudo-destructor-name shall be
2249 the same as the object type.
2253 The cv-unqualified versions of the object type and of the
2254 type designated by the pseudo-destructor-name shall be the
2257 We implement the more generous second sentence, since that is
2258 what most other compilers do. */
2259 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2262 error ("%qE is not of type %qT", object, destructor);
2263 return error_mark_node;
2267 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2270 /* Finish an expression of the form CODE EXPR. */
2273 finish_unary_op_expr (enum tree_code code, tree expr)
2275 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2276 /* Inside a template, build_x_unary_op does not fold the
2277 expression. So check whether the result is folded before
2278 setting TREE_NEGATED_INT. */
2279 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2280 && TREE_CODE (result) == INTEGER_CST
2281 && !TYPE_UNSIGNED (TREE_TYPE (result))
2282 && INT_CST_LT (result, integer_zero_node))
2284 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2285 setting TREE_NEGATED_INT. */
2286 result = copy_node (result);
2287 TREE_NEGATED_INT (result) = 1;
2289 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2290 overflow_warning (input_location, result);
2295 /* Finish a compound-literal expression. TYPE is the type to which
2296 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2299 finish_compound_literal (tree type, tree compound_literal)
2301 if (type == error_mark_node)
2302 return error_mark_node;
2304 if (!TYPE_OBJ_P (type))
2306 error ("compound literal of non-object type %qT", type);
2307 return error_mark_node;
2310 if (processing_template_decl)
2312 TREE_TYPE (compound_literal) = type;
2313 /* Mark the expression as a compound literal. */
2314 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2315 return compound_literal;
2318 type = complete_type (type);
2320 if (TYPE_NON_AGGREGATE_CLASS (type))
2322 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2323 everywhere that deals with function arguments would be a pain, so
2324 just wrap it in a TREE_LIST. The parser set a flag so we know
2325 that it came from T{} rather than T({}). */
2326 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2327 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2328 return build_functional_cast (type, compound_literal, tf_error);
2331 if (TREE_CODE (type) == ARRAY_TYPE
2332 && check_array_initializer (NULL_TREE, type, compound_literal))
2333 return error_mark_node;
2334 compound_literal = reshape_init (type, compound_literal);
2335 if (TREE_CODE (type) == ARRAY_TYPE)
2336 cp_complete_array_type (&type, compound_literal, false);
2337 compound_literal = digest_init (type, compound_literal);
2338 return get_target_expr (compound_literal);
2341 /* Return the declaration for the function-name variable indicated by
2345 finish_fname (tree id)
2349 decl = fname_decl (input_location, C_RID_CODE (id), id);
2350 if (processing_template_decl && current_function_decl)
2351 decl = DECL_NAME (decl);
2355 /* Finish a translation unit. */
2358 finish_translation_unit (void)
2360 /* In case there were missing closebraces,
2361 get us back to the global binding level. */
2363 while (current_namespace != global_namespace)
2366 /* Do file scope __FUNCTION__ et al. */
2367 finish_fname_decls ();
2370 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2371 Returns the parameter. */
2374 finish_template_type_parm (tree aggr, tree identifier)
2376 if (aggr != class_type_node)
2378 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2379 aggr = class_type_node;
2382 return build_tree_list (aggr, identifier);
2385 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2386 Returns the parameter. */
2389 finish_template_template_parm (tree aggr, tree identifier)
2391 tree decl = build_decl (input_location,
2392 TYPE_DECL, identifier, NULL_TREE);
2393 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2394 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2395 DECL_TEMPLATE_RESULT (tmpl) = decl;
2396 DECL_ARTIFICIAL (decl) = 1;
2397 end_template_decl ();
2399 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2401 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2402 /*is_primary=*/true, /*is_partial=*/false,
2405 return finish_template_type_parm (aggr, tmpl);
2408 /* ARGUMENT is the default-argument value for a template template
2409 parameter. If ARGUMENT is invalid, issue error messages and return
2410 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2413 check_template_template_default_arg (tree argument)
2415 if (TREE_CODE (argument) != TEMPLATE_DECL
2416 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2417 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2419 if (TREE_CODE (argument) == TYPE_DECL)
2420 error ("invalid use of type %qT as a default value for a template "
2421 "template-parameter", TREE_TYPE (argument));
2423 error ("invalid default argument for a template template parameter");
2424 return error_mark_node;
2430 /* Begin a class definition, as indicated by T. */
2433 begin_class_definition (tree t, tree attributes)
2435 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2436 return error_mark_node;
2438 if (processing_template_parmlist)
2440 error ("definition of %q#T inside template parameter list", t);
2441 return error_mark_node;
2444 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2445 are passed the same as decimal scalar types. */
2446 if (TREE_CODE (t) == RECORD_TYPE
2447 && !processing_template_decl)
2449 tree ns = TYPE_CONTEXT (t);
2450 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2451 && DECL_CONTEXT (ns) == std_node
2453 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2455 const char *n = TYPE_NAME_STRING (t);
2456 if ((strcmp (n, "decimal32") == 0)
2457 || (strcmp (n, "decimal64") == 0)
2458 || (strcmp (n, "decimal128") == 0))
2459 TYPE_TRANSPARENT_AGGR (t) = 1;
2463 /* A non-implicit typename comes from code like:
2465 template <typename T> struct A {
2466 template <typename U> struct A<T>::B ...
2468 This is erroneous. */
2469 else if (TREE_CODE (t) == TYPENAME_TYPE)
2471 error ("invalid definition of qualified type %qT", t);
2472 t = error_mark_node;
2475 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2477 t = make_class_type (RECORD_TYPE);
2478 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2481 if (TYPE_BEING_DEFINED (t))
2483 t = make_class_type (TREE_CODE (t));
2484 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2486 maybe_process_partial_specialization (t);
2488 TYPE_BEING_DEFINED (t) = 1;
2490 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2491 fixup_attribute_variants (t);
2493 if (flag_pack_struct)
2496 TYPE_PACKED (t) = 1;
2497 /* Even though the type is being defined for the first time
2498 here, there might have been a forward declaration, so there
2499 might be cv-qualified variants of T. */
2500 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2501 TYPE_PACKED (v) = 1;
2503 /* Reset the interface data, at the earliest possible
2504 moment, as it might have been set via a class foo;
2506 if (! TYPE_ANONYMOUS_P (t))
2508 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2509 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2510 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2511 (t, finfo->interface_unknown);
2513 reset_specialization();
2515 /* Make a declaration for this class in its own scope. */
2516 build_self_reference ();
2521 /* Finish the member declaration given by DECL. */
2524 finish_member_declaration (tree decl)
2526 if (decl == error_mark_node || decl == NULL_TREE)
2529 if (decl == void_type_node)
2530 /* The COMPONENT was a friend, not a member, and so there's
2531 nothing for us to do. */
2534 /* We should see only one DECL at a time. */
2535 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2537 /* Set up access control for DECL. */
2539 = (current_access_specifier == access_private_node);
2540 TREE_PROTECTED (decl)
2541 = (current_access_specifier == access_protected_node);
2542 if (TREE_CODE (decl) == TEMPLATE_DECL)
2544 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2545 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2548 /* Mark the DECL as a member of the current class. */
2549 DECL_CONTEXT (decl) = current_class_type;
2551 /* Check for bare parameter packs in the member variable declaration. */
2552 if (TREE_CODE (decl) == FIELD_DECL)
2554 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2555 TREE_TYPE (decl) = error_mark_node;
2556 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2557 DECL_ATTRIBUTES (decl) = NULL_TREE;
2562 A C language linkage is ignored for the names of class members
2563 and the member function type of class member functions. */
2564 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2565 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2567 /* Put functions on the TYPE_METHODS list and everything else on the
2568 TYPE_FIELDS list. Note that these are built up in reverse order.
2569 We reverse them (to obtain declaration order) in finish_struct. */
2570 if (TREE_CODE (decl) == FUNCTION_DECL
2571 || DECL_FUNCTION_TEMPLATE_P (decl))
2573 /* We also need to add this function to the
2574 CLASSTYPE_METHOD_VEC. */
2575 if (add_method (current_class_type, decl, NULL_TREE))
2577 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2578 TYPE_METHODS (current_class_type) = decl;
2580 maybe_add_class_template_decl_list (current_class_type, decl,
2584 /* Enter the DECL into the scope of the class. */
2585 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2586 || pushdecl_class_level (decl))
2588 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2589 go at the beginning. The reason is that lookup_field_1
2590 searches the list in order, and we want a field name to
2591 override a type name so that the "struct stat hack" will
2592 work. In particular:
2594 struct S { enum E { }; int E } s;
2597 is valid. In addition, the FIELD_DECLs must be maintained in
2598 declaration order so that class layout works as expected.
2599 However, we don't need that order until class layout, so we
2600 save a little time by putting FIELD_DECLs on in reverse order
2601 here, and then reversing them in finish_struct_1. (We could
2602 also keep a pointer to the correct insertion points in the
2605 if (TREE_CODE (decl) == TYPE_DECL)
2606 TYPE_FIELDS (current_class_type)
2607 = chainon (TYPE_FIELDS (current_class_type), decl);
2610 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2611 TYPE_FIELDS (current_class_type) = decl;
2614 maybe_add_class_template_decl_list (current_class_type, decl,
2619 note_decl_for_pch (decl);
2622 /* DECL has been declared while we are building a PCH file. Perform
2623 actions that we might normally undertake lazily, but which can be
2624 performed now so that they do not have to be performed in
2625 translation units which include the PCH file. */
2628 note_decl_for_pch (tree decl)
2630 gcc_assert (pch_file);
2632 /* There's a good chance that we'll have to mangle names at some
2633 point, even if only for emission in debugging information. */
2634 if ((TREE_CODE (decl) == VAR_DECL
2635 || TREE_CODE (decl) == FUNCTION_DECL)
2636 && !processing_template_decl)
2640 /* Finish processing a complete template declaration. The PARMS are
2641 the template parameters. */
2644 finish_template_decl (tree parms)
2647 end_template_decl ();
2649 end_specialization ();
2652 /* Finish processing a template-id (which names a type) of the form
2653 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2654 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2655 the scope of template-id indicated. */
2658 finish_template_type (tree name, tree args, int entering_scope)
2662 decl = lookup_template_class (name, args,
2663 NULL_TREE, NULL_TREE, entering_scope,
2664 tf_warning_or_error | tf_user);
2665 if (decl != error_mark_node)
2666 decl = TYPE_STUB_DECL (decl);
2671 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2672 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2673 BASE_CLASS, or NULL_TREE if an error occurred. The
2674 ACCESS_SPECIFIER is one of
2675 access_{default,public,protected_private}_node. For a virtual base
2676 we set TREE_TYPE. */
2679 finish_base_specifier (tree base, tree access, bool virtual_p)
2683 if (base == error_mark_node)
2685 error ("invalid base-class specification");
2688 else if (! MAYBE_CLASS_TYPE_P (base))
2690 error ("%qT is not a class type", base);
2695 if (cp_type_quals (base) != 0)
2697 error ("base class %qT has cv qualifiers", base);
2698 base = TYPE_MAIN_VARIANT (base);
2700 result = build_tree_list (access, base);
2702 TREE_TYPE (result) = integer_type_node;
2708 /* If FNS is a member function, a set of member functions, or a
2709 template-id referring to one or more member functions, return a
2710 BASELINK for FNS, incorporating the current access context.
2711 Otherwise, return FNS unchanged. */
2714 baselink_for_fns (tree fns)
2719 if (BASELINK_P (fns)
2720 || error_operand_p (fns))
2724 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2725 fn = TREE_OPERAND (fn, 0);
2726 fn = get_first_fn (fn);
2727 if (!DECL_FUNCTION_MEMBER_P (fn))
2730 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2732 cl = DECL_CONTEXT (fn);
2733 cl = TYPE_BINFO (cl);
2734 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2737 /* Returns true iff DECL is an automatic variable from a function outside
2741 outer_automatic_var_p (tree decl)
2743 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2744 && DECL_FUNCTION_SCOPE_P (decl)
2745 && !TREE_STATIC (decl)
2746 && DECL_CONTEXT (decl) != current_function_decl);
2749 /* Returns true iff DECL is a capture field from a lambda that is not our
2750 immediate context. */
2753 outer_lambda_capture_p (tree decl)
2755 return (TREE_CODE (decl) == FIELD_DECL
2756 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2757 && (!current_class_type
2758 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2761 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2762 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2763 if non-NULL, is the type or namespace used to explicitly qualify
2764 ID_EXPRESSION. DECL is the entity to which that name has been
2767 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2768 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2769 be set to true if this expression isn't permitted in a
2770 constant-expression, but it is otherwise not set by this function.
2771 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2772 constant-expression, but a non-constant expression is also
2775 DONE is true if this expression is a complete postfix-expression;
2776 it is false if this expression is followed by '->', '[', '(', etc.
2777 ADDRESS_P is true iff this expression is the operand of '&'.
2778 TEMPLATE_P is true iff the qualified-id was of the form
2779 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2780 appears as a template argument.
2782 If an error occurs, and it is the kind of error that might cause
2783 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2784 is the caller's responsibility to issue the message. *ERROR_MSG
2785 will be a string with static storage duration, so the caller need
2788 Return an expression for the entity, after issuing appropriate
2789 diagnostics. This function is also responsible for transforming a
2790 reference to a non-static member into a COMPONENT_REF that makes
2791 the use of "this" explicit.
2793 Upon return, *IDK will be filled in appropriately. */
2795 finish_id_expression (tree id_expression,
2799 bool integral_constant_expression_p,
2800 bool allow_non_integral_constant_expression_p,
2801 bool *non_integral_constant_expression_p,
2805 bool template_arg_p,
2806 const char **error_msg,
2807 location_t location)
2809 /* Initialize the output parameters. */
2810 *idk = CP_ID_KIND_NONE;
2813 if (id_expression == error_mark_node)
2814 return error_mark_node;
2815 /* If we have a template-id, then no further lookup is
2816 required. If the template-id was for a template-class, we
2817 will sometimes have a TYPE_DECL at this point. */
2818 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2819 || TREE_CODE (decl) == TYPE_DECL)
2821 /* Look up the name. */
2824 if (decl == error_mark_node)
2826 /* Name lookup failed. */
2829 || (!dependent_type_p (scope)
2830 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2831 && IDENTIFIER_TYPENAME_P (id_expression)
2832 && dependent_type_p (TREE_TYPE (id_expression))))))
2834 /* If the qualifying type is non-dependent (and the name
2835 does not name a conversion operator to a dependent
2836 type), issue an error. */
2837 qualified_name_lookup_error (scope, id_expression, decl, location);
2838 return error_mark_node;
2842 /* It may be resolved via Koenig lookup. */
2843 *idk = CP_ID_KIND_UNQUALIFIED;
2844 return id_expression;
2847 decl = id_expression;
2849 /* If DECL is a variable that would be out of scope under
2850 ANSI/ISO rules, but in scope in the ARM, name lookup
2851 will succeed. Issue a diagnostic here. */
2853 decl = check_for_out_of_scope_variable (decl);
2855 /* Remember that the name was used in the definition of
2856 the current class so that we can check later to see if
2857 the meaning would have been different after the class
2858 was entirely defined. */
2859 if (!scope && decl != error_mark_node
2860 && TREE_CODE (id_expression) == IDENTIFIER_NODE)
2861 maybe_note_name_used_in_class (id_expression, decl);
2863 /* Disallow uses of local variables from containing functions, except
2864 within lambda-expressions. */
2865 if ((outer_automatic_var_p (decl)
2866 || outer_lambda_capture_p (decl))
2867 /* It's not a use (3.2) if we're in an unevaluated context. */
2868 && !cp_unevaluated_operand)
2870 tree context = DECL_CONTEXT (decl);
2871 tree containing_function = current_function_decl;
2872 tree lambda_stack = NULL_TREE;
2873 tree lambda_expr = NULL_TREE;
2874 tree initializer = decl;
2876 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2877 support for an approach in which a reference to a local
2878 [constant] automatic variable in a nested class or lambda body
2879 would enter the expression as an rvalue, which would reduce
2880 the complexity of the problem"
2882 FIXME update for final resolution of core issue 696. */
2883 if (decl_constant_var_p (decl))
2884 return integral_constant_value (decl);
2886 if (TYPE_P (context))
2888 /* Implicit capture of an explicit capture. */
2889 context = lambda_function (context);
2890 initializer = thisify_lambda_field (decl);
2893 /* If we are in a lambda function, we can move out until we hit
2895 2. a non-lambda function, or
2896 3. a non-default capturing lambda function. */
2897 while (context != containing_function
2898 && LAMBDA_FUNCTION_P (containing_function))
2900 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2901 (DECL_CONTEXT (containing_function));
2903 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2907 lambda_stack = tree_cons (NULL_TREE,
2912 = decl_function_context (containing_function);
2915 if (context == containing_function)
2917 decl = add_default_capture (lambda_stack,
2918 /*id=*/DECL_NAME (decl),
2921 else if (lambda_expr)
2923 error ("%qD is not captured", decl);
2924 return error_mark_node;
2928 error (TREE_CODE (decl) == VAR_DECL
2929 ? "use of %<auto%> variable from containing function"
2930 : "use of parameter from containing function");
2931 error (" %q+#D declared here", decl);
2932 return error_mark_node;
2936 /* Also disallow uses of function parameters outside the function
2937 body, except inside an unevaluated context (i.e. decltype). */
2938 if (TREE_CODE (decl) == PARM_DECL
2939 && DECL_CONTEXT (decl) == NULL_TREE
2940 && !cp_unevaluated_operand)
2942 error ("use of parameter %qD outside function body", decl);
2943 return error_mark_node;
2947 /* If we didn't find anything, or what we found was a type,
2948 then this wasn't really an id-expression. */
2949 if (TREE_CODE (decl) == TEMPLATE_DECL
2950 && !DECL_FUNCTION_TEMPLATE_P (decl))
2952 *error_msg = "missing template arguments";
2953 return error_mark_node;
2955 else if (TREE_CODE (decl) == TYPE_DECL
2956 || TREE_CODE (decl) == NAMESPACE_DECL)
2958 *error_msg = "expected primary-expression";
2959 return error_mark_node;
2962 /* If the name resolved to a template parameter, there is no
2963 need to look it up again later. */
2964 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2965 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2969 *idk = CP_ID_KIND_NONE;
2970 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2971 decl = TEMPLATE_PARM_DECL (decl);
2972 r = convert_from_reference (DECL_INITIAL (decl));
2974 if (integral_constant_expression_p
2975 && !dependent_type_p (TREE_TYPE (decl))
2976 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2978 if (!allow_non_integral_constant_expression_p)
2979 error ("template parameter %qD of type %qT is not allowed in "
2980 "an integral constant expression because it is not of "
2981 "integral or enumeration type", decl, TREE_TYPE (decl));
2982 *non_integral_constant_expression_p = true;
2986 /* Similarly, we resolve enumeration constants to their
2987 underlying values. */
2988 else if (TREE_CODE (decl) == CONST_DECL)
2990 *idk = CP_ID_KIND_NONE;
2991 if (!processing_template_decl)
2993 used_types_insert (TREE_TYPE (decl));
2994 return DECL_INITIAL (decl);
3002 /* If the declaration was explicitly qualified indicate
3003 that. The semantics of `A::f(3)' are different than
3004 `f(3)' if `f' is virtual. */
3006 ? CP_ID_KIND_QUALIFIED
3007 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3008 ? CP_ID_KIND_TEMPLATE_ID
3009 : CP_ID_KIND_UNQUALIFIED));
3014 An id-expression is type-dependent if it contains an
3015 identifier that was declared with a dependent type.
3017 The standard is not very specific about an id-expression that
3018 names a set of overloaded functions. What if some of them
3019 have dependent types and some of them do not? Presumably,
3020 such a name should be treated as a dependent name. */
3021 /* Assume the name is not dependent. */
3022 dependent_p = false;
3023 if (!processing_template_decl)
3024 /* No names are dependent outside a template. */
3026 /* A template-id where the name of the template was not resolved
3027 is definitely dependent. */
3028 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3029 && (TREE_CODE (TREE_OPERAND (decl, 0))
3030 == IDENTIFIER_NODE))
3032 /* For anything except an overloaded function, just check its
3034 else if (!is_overloaded_fn (decl))
3036 = dependent_type_p (TREE_TYPE (decl));
3037 /* For a set of overloaded functions, check each of the
3043 if (BASELINK_P (fns))
3044 fns = BASELINK_FUNCTIONS (fns);
3046 /* For a template-id, check to see if the template
3047 arguments are dependent. */
3048 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3050 tree args = TREE_OPERAND (fns, 1);
3051 dependent_p = any_dependent_template_arguments_p (args);
3052 /* The functions are those referred to by the
3054 fns = TREE_OPERAND (fns, 0);
3057 /* If there are no dependent template arguments, go through
3058 the overloaded functions. */
3059 while (fns && !dependent_p)
3061 tree fn = OVL_CURRENT (fns);
3063 /* Member functions of dependent classes are
3065 if (TREE_CODE (fn) == FUNCTION_DECL
3066 && type_dependent_expression_p (fn))
3068 else if (TREE_CODE (fn) == TEMPLATE_DECL
3069 && dependent_template_p (fn))
3072 fns = OVL_NEXT (fns);
3076 /* If the name was dependent on a template parameter, we will
3077 resolve the name at instantiation time. */
3080 /* Create a SCOPE_REF for qualified names, if the scope is
3086 if (address_p && done)
3087 decl = finish_qualified_id_expr (scope, decl,
3093 tree type = NULL_TREE;
3094 if (DECL_P (decl) && !dependent_scope_p (scope))
3095 type = TREE_TYPE (decl);
3096 decl = build_qualified_name (type,
3102 if (TREE_TYPE (decl))
3103 decl = convert_from_reference (decl);
3106 /* A TEMPLATE_ID already contains all the information we
3108 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3109 return id_expression;
3110 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3111 /* If we found a variable, then name lookup during the
3112 instantiation will always resolve to the same VAR_DECL
3113 (or an instantiation thereof). */
3114 if (TREE_CODE (decl) == VAR_DECL
3115 || TREE_CODE (decl) == PARM_DECL)
3116 return convert_from_reference (decl);
3117 /* The same is true for FIELD_DECL, but we also need to
3118 make sure that the syntax is correct. */
3119 else if (TREE_CODE (decl) == FIELD_DECL)
3121 /* Since SCOPE is NULL here, this is an unqualified name.
3122 Access checking has been performed during name lookup
3123 already. Turn off checking to avoid duplicate errors. */
3124 push_deferring_access_checks (dk_no_check);
3125 decl = finish_non_static_data_member
3127 /*qualifying_scope=*/NULL_TREE);
3128 pop_deferring_access_checks ();
3131 return id_expression;
3134 if (TREE_CODE (decl) == NAMESPACE_DECL)
3136 error ("use of namespace %qD as expression", decl);
3137 return error_mark_node;
3139 else if (DECL_CLASS_TEMPLATE_P (decl))
3141 error ("use of class template %qT as expression", decl);
3142 return error_mark_node;
3144 else if (TREE_CODE (decl) == TREE_LIST)
3146 /* Ambiguous reference to base members. */
3147 error ("request for member %qD is ambiguous in "
3148 "multiple inheritance lattice", id_expression);
3149 print_candidates (decl);
3150 return error_mark_node;
3153 /* Mark variable-like entities as used. Functions are similarly
3154 marked either below or after overload resolution. */
3155 if (TREE_CODE (decl) == VAR_DECL
3156 || TREE_CODE (decl) == PARM_DECL
3157 || TREE_CODE (decl) == RESULT_DECL)
3160 /* Only certain kinds of names are allowed in constant
3161 expression. Enumerators and template parameters have already
3162 been handled above. */
3163 if (! error_operand_p (decl)
3164 && integral_constant_expression_p
3165 && ! decl_constant_var_p (decl)
3166 && ! builtin_valid_in_constant_expr_p (decl))
3168 if (!allow_non_integral_constant_expression_p)
3170 error ("%qD cannot appear in a constant-expression", decl);
3171 return error_mark_node;
3173 *non_integral_constant_expression_p = true;
3178 decl = (adjust_result_of_qualified_name_lookup
3179 (decl, scope, current_class_type));
3181 if (TREE_CODE (decl) == FUNCTION_DECL)
3184 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3185 decl = finish_qualified_id_expr (scope,
3193 tree r = convert_from_reference (decl);
3195 /* In a template, return a SCOPE_REF for most qualified-ids
3196 so that we can check access at instantiation time. But if
3197 we're looking at a member of the current instantiation, we
3198 know we have access and building up the SCOPE_REF confuses
3199 non-type template argument handling. */
3200 if (processing_template_decl && TYPE_P (scope)
3201 && !currently_open_class (scope))
3202 r = build_qualified_name (TREE_TYPE (r),
3208 else if (TREE_CODE (decl) == FIELD_DECL)
3210 /* Since SCOPE is NULL here, this is an unqualified name.
3211 Access checking has been performed during name lookup
3212 already. Turn off checking to avoid duplicate errors. */
3213 push_deferring_access_checks (dk_no_check);
3214 decl = finish_non_static_data_member (decl, NULL_TREE,
3215 /*qualifying_scope=*/NULL_TREE);
3216 pop_deferring_access_checks ();
3218 else if (is_overloaded_fn (decl))
3222 first_fn = get_first_fn (decl);
3223 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3224 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3226 if (!really_overloaded_fn (decl))
3227 mark_used (first_fn);
3230 && TREE_CODE (first_fn) == FUNCTION_DECL
3231 && DECL_FUNCTION_MEMBER_P (first_fn)
3232 && !shared_member_p (decl))
3234 /* A set of member functions. */
3235 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3236 return finish_class_member_access_expr (decl, id_expression,
3237 /*template_p=*/false,
3238 tf_warning_or_error);
3241 decl = baselink_for_fns (decl);
3245 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3246 && DECL_CLASS_SCOPE_P (decl))
3248 tree context = context_for_name_lookup (decl);
3249 if (context != current_class_type)
3251 tree path = currently_open_derived_class (context);
3252 perform_or_defer_access_check (TYPE_BINFO (path),
3257 decl = convert_from_reference (decl);
3261 if (TREE_DEPRECATED (decl))
3262 warn_deprecated_use (decl, NULL_TREE);
3267 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3268 use as a type-specifier. */
3271 finish_typeof (tree expr)
3275 if (type_dependent_expression_p (expr))
3277 type = cxx_make_type (TYPEOF_TYPE);
3278 TYPEOF_TYPE_EXPR (type) = expr;
3279 SET_TYPE_STRUCTURAL_EQUALITY (type);
3284 expr = mark_type_use (expr);
3286 type = unlowered_expr_type (expr);
3288 if (!type || type == unknown_type_node)
3290 error ("type of %qE is unknown", expr);
3291 return error_mark_node;
3297 /* Perform C++-specific checks for __builtin_offsetof before calling
3301 finish_offsetof (tree expr)
3303 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3305 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3306 TREE_OPERAND (expr, 2));
3307 return error_mark_node;
3309 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3310 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3311 || TREE_TYPE (expr) == unknown_type_node)
3313 if (TREE_CODE (expr) == COMPONENT_REF
3314 || TREE_CODE (expr) == COMPOUND_EXPR)
3315 expr = TREE_OPERAND (expr, 1);
3316 error ("cannot apply %<offsetof%> to member function %qD", expr);
3317 return error_mark_node;
3319 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3320 expr = TREE_OPERAND (expr, 0);
3321 return fold_offsetof (expr, NULL_TREE);
3324 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3325 function is broken out from the above for the benefit of the tree-ssa
3329 simplify_aggr_init_expr (tree *tp)
3331 tree aggr_init_expr = *tp;
3333 /* Form an appropriate CALL_EXPR. */
3334 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3335 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3336 tree type = TREE_TYPE (slot);
3339 enum style_t { ctor, arg, pcc } style;
3341 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3343 #ifdef PCC_STATIC_STRUCT_RETURN
3349 gcc_assert (TREE_ADDRESSABLE (type));
3353 call_expr = build_call_array_loc (input_location,
3354 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3356 aggr_init_expr_nargs (aggr_init_expr),
3357 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3358 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3362 /* Replace the first argument to the ctor with the address of the
3364 cxx_mark_addressable (slot);
3365 CALL_EXPR_ARG (call_expr, 0) =
3366 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3368 else if (style == arg)
3370 /* Just mark it addressable here, and leave the rest to
3371 expand_call{,_inline}. */
3372 cxx_mark_addressable (slot);
3373 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3374 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3376 else if (style == pcc)
3378 /* If we're using the non-reentrant PCC calling convention, then we
3379 need to copy the returned value out of the static buffer into the
3381 push_deferring_access_checks (dk_no_check);
3382 call_expr = build_aggr_init (slot, call_expr,
3383 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3384 tf_warning_or_error);
3385 pop_deferring_access_checks ();
3386 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3389 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3391 tree init = build_zero_init (type, NULL_TREE,
3392 /*static_storage_p=*/false);
3393 init = build2 (INIT_EXPR, void_type_node, slot, init);
3394 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3401 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3404 emit_associated_thunks (tree fn)
3406 /* When we use vcall offsets, we emit thunks with the virtual
3407 functions to which they thunk. The whole point of vcall offsets
3408 is so that you can know statically the entire set of thunks that
3409 will ever be needed for a given virtual function, thereby
3410 enabling you to output all the thunks with the function itself. */
3411 if (DECL_VIRTUAL_P (fn)
3412 /* Do not emit thunks for extern template instantiations. */
3413 && ! DECL_REALLY_EXTERN (fn))
3417 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3419 if (!THUNK_ALIAS (thunk))
3421 use_thunk (thunk, /*emit_p=*/1);
3422 if (DECL_RESULT_THUNK_P (thunk))
3426 for (probe = DECL_THUNKS (thunk);
3427 probe; probe = DECL_CHAIN (probe))
3428 use_thunk (probe, /*emit_p=*/1);
3432 gcc_assert (!DECL_THUNKS (thunk));
3437 /* Generate RTL for FN. */
3440 expand_or_defer_fn_1 (tree fn)
3442 /* When the parser calls us after finishing the body of a template
3443 function, we don't really want to expand the body. */
3444 if (processing_template_decl)
3446 /* Normally, collection only occurs in rest_of_compilation. So,
3447 if we don't collect here, we never collect junk generated
3448 during the processing of templates until we hit a
3449 non-template function. It's not safe to do this inside a
3450 nested class, though, as the parser may have local state that
3451 is not a GC root. */
3452 if (!function_depth)
3457 gcc_assert (DECL_SAVED_TREE (fn));
3459 /* If this is a constructor or destructor body, we have to clone
3461 if (maybe_clone_body (fn))
3463 /* We don't want to process FN again, so pretend we've written
3464 it out, even though we haven't. */
3465 TREE_ASM_WRITTEN (fn) = 1;
3466 DECL_SAVED_TREE (fn) = NULL_TREE;
3470 /* We make a decision about linkage for these functions at the end
3471 of the compilation. Until that point, we do not want the back
3472 end to output them -- but we do want it to see the bodies of
3473 these functions so that it can inline them as appropriate. */
3474 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3476 if (DECL_INTERFACE_KNOWN (fn))
3477 /* We've already made a decision as to how this function will
3481 DECL_EXTERNAL (fn) = 1;
3482 DECL_NOT_REALLY_EXTERN (fn) = 1;
3483 note_vague_linkage_fn (fn);
3484 /* A non-template inline function with external linkage will
3485 always be COMDAT. As we must eventually determine the
3486 linkage of all functions, and as that causes writes to
3487 the data mapped in from the PCH file, it's advantageous
3488 to mark the functions at this point. */
3489 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3491 /* This function must have external linkage, as
3492 otherwise DECL_INTERFACE_KNOWN would have been
3494 gcc_assert (TREE_PUBLIC (fn));
3495 comdat_linkage (fn);
3496 DECL_INTERFACE_KNOWN (fn) = 1;
3500 import_export_decl (fn);
3502 /* If the user wants us to keep all inline functions, then mark
3503 this function as needed so that finish_file will make sure to
3504 output it later. Similarly, all dllexport'd functions must
3505 be emitted; there may be callers in other DLLs. */
3506 if ((flag_keep_inline_functions
3507 && DECL_DECLARED_INLINE_P (fn)
3508 && !DECL_REALLY_EXTERN (fn))
3509 || (flag_keep_inline_dllexport
3510 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3514 /* There's no reason to do any of the work here if we're only doing
3515 semantic analysis; this code just generates RTL. */
3516 if (flag_syntax_only)
3523 expand_or_defer_fn (tree fn)
3525 if (expand_or_defer_fn_1 (fn))
3529 /* Expand or defer, at the whim of the compilation unit manager. */
3530 cgraph_finalize_function (fn, function_depth > 1);
3531 emit_associated_thunks (fn);
3544 /* Helper function for walk_tree, used by finalize_nrv below. */
3547 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3549 struct nrv_data *dp = (struct nrv_data *)data;
3552 /* No need to walk into types. There wouldn't be any need to walk into
3553 non-statements, except that we have to consider STMT_EXPRs. */
3556 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3557 but differs from using NULL_TREE in that it indicates that we care
3558 about the value of the RESULT_DECL. */
3559 else if (TREE_CODE (*tp) == RETURN_EXPR)
3560 TREE_OPERAND (*tp, 0) = dp->result;
3561 /* Change all cleanups for the NRV to only run when an exception is
3563 else if (TREE_CODE (*tp) == CLEANUP_STMT
3564 && CLEANUP_DECL (*tp) == dp->var)
3565 CLEANUP_EH_ONLY (*tp) = 1;
3566 /* Replace the DECL_EXPR for the NRV with an initialization of the
3567 RESULT_DECL, if needed. */
3568 else if (TREE_CODE (*tp) == DECL_EXPR
3569 && DECL_EXPR_DECL (*tp) == dp->var)
3572 if (DECL_INITIAL (dp->var)
3573 && DECL_INITIAL (dp->var) != error_mark_node)
3574 init = build2 (INIT_EXPR, void_type_node, dp->result,
3575 DECL_INITIAL (dp->var));
3577 init = build_empty_stmt (EXPR_LOCATION (*tp));
3578 DECL_INITIAL (dp->var) = NULL_TREE;
3579 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3582 /* And replace all uses of the NRV with the RESULT_DECL. */
3583 else if (*tp == dp->var)
3586 /* Avoid walking into the same tree more than once. Unfortunately, we
3587 can't just use walk_tree_without duplicates because it would only call
3588 us for the first occurrence of dp->var in the function body. */
3589 slot = htab_find_slot (dp->visited, *tp, INSERT);
3595 /* Keep iterating. */
3599 /* Called from finish_function to implement the named return value
3600 optimization by overriding all the RETURN_EXPRs and pertinent
3601 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3602 RESULT_DECL for the function. */
3605 finalize_nrv (tree *tp, tree var, tree result)
3607 struct nrv_data data;
3609 /* Copy name from VAR to RESULT. */
3610 DECL_NAME (result) = DECL_NAME (var);
3611 /* Don't forget that we take its address. */
3612 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3613 /* Finally set DECL_VALUE_EXPR to avoid assigning
3614 a stack slot at -O0 for the original var and debug info
3615 uses RESULT location for VAR. */
3616 SET_DECL_VALUE_EXPR (var, result);
3617 DECL_HAS_VALUE_EXPR_P (var) = 1;
3620 data.result = result;
3621 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3622 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3623 htab_delete (data.visited);
3626 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3629 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3630 bool need_copy_ctor, bool need_copy_assignment)
3632 int save_errorcount = errorcount;
3635 /* Always allocate 3 elements for simplicity. These are the
3636 function decls for the ctor, dtor, and assignment op.
3637 This layout is known to the three lang hooks,
3638 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3639 and cxx_omp_clause_assign_op. */
3640 info = make_tree_vec (3);
3641 CP_OMP_CLAUSE_INFO (c) = info;
3643 if (need_default_ctor || need_copy_ctor)
3645 if (need_default_ctor)
3646 t = get_default_ctor (type);
3648 t = get_copy_ctor (type);
3650 if (t && !trivial_fn_p (t))
3651 TREE_VEC_ELT (info, 0) = t;
3654 if ((need_default_ctor || need_copy_ctor)
3655 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3656 TREE_VEC_ELT (info, 1) = get_dtor (type);
3658 if (need_copy_assignment)
3660 t = get_copy_assign (type);
3662 if (t && !trivial_fn_p (t))
3663 TREE_VEC_ELT (info, 2) = t;
3666 return errorcount != save_errorcount;
3669 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3670 Remove any elements from the list that are invalid. */
3673 finish_omp_clauses (tree clauses)
3675 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3676 tree c, t, *pc = &clauses;
3679 bitmap_obstack_initialize (NULL);
3680 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3681 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3682 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3684 for (pc = &clauses, c = clauses; c ; c = *pc)
3686 bool remove = false;
3688 switch (OMP_CLAUSE_CODE (c))
3690 case OMP_CLAUSE_SHARED:
3692 goto check_dup_generic;
3693 case OMP_CLAUSE_PRIVATE:
3695 goto check_dup_generic;
3696 case OMP_CLAUSE_REDUCTION:
3698 goto check_dup_generic;
3699 case OMP_CLAUSE_COPYPRIVATE:
3700 name = "copyprivate";
3701 goto check_dup_generic;
3702 case OMP_CLAUSE_COPYIN:
3704 goto check_dup_generic;
3706 t = OMP_CLAUSE_DECL (c);
3707 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3709 if (processing_template_decl)
3712 error ("%qD is not a variable in clause %qs", t, name);
3714 error ("%qE is not a variable in clause %qs", t, name);
3717 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3718 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3719 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3721 error ("%qD appears more than once in data clauses", t);
3725 bitmap_set_bit (&generic_head, DECL_UID (t));
3728 case OMP_CLAUSE_FIRSTPRIVATE:
3729 t = OMP_CLAUSE_DECL (c);
3730 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3732 if (processing_template_decl)
3735 error ("%qD is not a variable in clause %<firstprivate%>", t);
3737 error ("%qE is not a variable in clause %<firstprivate%>", t);
3740 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3741 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3743 error ("%qD appears more than once in data clauses", t);
3747 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3750 case OMP_CLAUSE_LASTPRIVATE:
3751 t = OMP_CLAUSE_DECL (c);
3752 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3754 if (processing_template_decl)
3757 error ("%qD is not a variable in clause %<lastprivate%>", t);
3759 error ("%qE is not a variable in clause %<lastprivate%>", t);
3762 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3763 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3765 error ("%qD appears more than once in data clauses", t);
3769 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3773 t = OMP_CLAUSE_IF_EXPR (c);
3774 t = maybe_convert_cond (t);
3775 if (t == error_mark_node)
3777 OMP_CLAUSE_IF_EXPR (c) = t;
3780 case OMP_CLAUSE_NUM_THREADS:
3781 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3782 if (t == error_mark_node)
3784 else if (!type_dependent_expression_p (t)
3785 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3787 error ("num_threads expression must be integral");
3792 case OMP_CLAUSE_SCHEDULE:
3793 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3796 else if (t == error_mark_node)
3798 else if (!type_dependent_expression_p (t)
3799 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3801 error ("schedule chunk size expression must be integral");
3806 case OMP_CLAUSE_NOWAIT:
3807 case OMP_CLAUSE_ORDERED:
3808 case OMP_CLAUSE_DEFAULT:
3809 case OMP_CLAUSE_UNTIED:
3810 case OMP_CLAUSE_COLLAPSE:
3818 *pc = OMP_CLAUSE_CHAIN (c);
3820 pc = &OMP_CLAUSE_CHAIN (c);
3823 for (pc = &clauses, c = clauses; c ; c = *pc)
3825 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3826 bool remove = false;
3827 bool need_complete_non_reference = false;
3828 bool need_default_ctor = false;
3829 bool need_copy_ctor = false;
3830 bool need_copy_assignment = false;
3831 bool need_implicitly_determined = false;
3832 tree type, inner_type;
3836 case OMP_CLAUSE_SHARED:
3838 need_implicitly_determined = true;
3840 case OMP_CLAUSE_PRIVATE:
3842 need_complete_non_reference = true;
3843 need_default_ctor = true;
3844 need_implicitly_determined = true;
3846 case OMP_CLAUSE_FIRSTPRIVATE:
3847 name = "firstprivate";
3848 need_complete_non_reference = true;
3849 need_copy_ctor = true;
3850 need_implicitly_determined = true;
3852 case OMP_CLAUSE_LASTPRIVATE:
3853 name = "lastprivate";
3854 need_complete_non_reference = true;
3855 need_copy_assignment = true;
3856 need_implicitly_determined = true;
3858 case OMP_CLAUSE_REDUCTION:
3860 need_implicitly_determined = true;
3862 case OMP_CLAUSE_COPYPRIVATE:
3863 name = "copyprivate";
3864 need_copy_assignment = true;
3866 case OMP_CLAUSE_COPYIN:
3868 need_copy_assignment = true;
3871 pc = &OMP_CLAUSE_CHAIN (c);
3875 t = OMP_CLAUSE_DECL (c);
3876 if (processing_template_decl
3877 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3879 pc = &OMP_CLAUSE_CHAIN (c);
3885 case OMP_CLAUSE_LASTPRIVATE:
3886 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3887 need_default_ctor = true;
3890 case OMP_CLAUSE_REDUCTION:
3891 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3892 || POINTER_TYPE_P (TREE_TYPE (t)))
3894 error ("%qE has invalid type for %<reduction%>", t);
3897 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3899 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3907 error ("%qE has invalid type for %<reduction(%s)%>",
3908 t, operator_name_info[r_code].name);
3914 case OMP_CLAUSE_COPYIN:
3915 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3917 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3926 if (need_complete_non_reference)
3928 t = require_complete_type (t);
3929 if (t == error_mark_node)
3931 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3933 error ("%qE has reference type for %qs", t, name);
3937 if (need_implicitly_determined)
3939 const char *share_name = NULL;
3941 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3942 share_name = "threadprivate";
3943 else switch (cxx_omp_predetermined_sharing (t))
3945 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3947 case OMP_CLAUSE_DEFAULT_SHARED:
3948 share_name = "shared";
3950 case OMP_CLAUSE_DEFAULT_PRIVATE:
3951 share_name = "private";
3958 error ("%qE is predetermined %qs for %qs",
3959 t, share_name, name);
3964 /* We're interested in the base element, not arrays. */
3965 inner_type = type = TREE_TYPE (t);
3966 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3967 inner_type = TREE_TYPE (inner_type);
3969 /* Check for special function availability by building a call to one.
3970 Save the results, because later we won't be in the right context
3971 for making these queries. */
3972 if (CLASS_TYPE_P (inner_type)
3973 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3974 && !type_dependent_expression_p (t)
3975 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3976 need_copy_ctor, need_copy_assignment))
3980 *pc = OMP_CLAUSE_CHAIN (c);
3982 pc = &OMP_CLAUSE_CHAIN (c);
3985 bitmap_obstack_release (NULL);
3989 /* For all variables in the tree_list VARS, mark them as thread local. */
3992 finish_omp_threadprivate (tree vars)
3996 /* Mark every variable in VARS to be assigned thread local storage. */
3997 for (t = vars; t; t = TREE_CHAIN (t))
3999 tree v = TREE_PURPOSE (t);
4001 if (error_operand_p (v))
4003 else if (TREE_CODE (v) != VAR_DECL)
4004 error ("%<threadprivate%> %qD is not file, namespace "
4005 "or block scope variable", v);
4006 /* If V had already been marked threadprivate, it doesn't matter
4007 whether it had been used prior to this point. */
4008 else if (TREE_USED (v)
4009 && (DECL_LANG_SPECIFIC (v) == NULL
4010 || !CP_DECL_THREADPRIVATE_P (v)))
4011 error ("%qE declared %<threadprivate%> after first use", v);
4012 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4013 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4014 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4015 error ("%<threadprivate%> %qE has incomplete type", v);
4016 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4017 && CP_DECL_CONTEXT (v) != current_class_type)
4018 error ("%<threadprivate%> %qE directive not "
4019 "in %qT definition", v, CP_DECL_CONTEXT (v));
4022 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4023 if (DECL_LANG_SPECIFIC (v) == NULL)
4025 retrofit_lang_decl (v);
4027 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4028 after the allocation of the lang_decl structure. */
4029 if (DECL_DISCRIMINATOR_P (v))
4030 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4033 if (! DECL_THREAD_LOCAL_P (v))
4035 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4036 /* If rtl has been already set for this var, call
4037 make_decl_rtl once again, so that encode_section_info
4038 has a chance to look at the new decl flags. */
4039 if (DECL_RTL_SET_P (v))
4042 CP_DECL_THREADPRIVATE_P (v) = 1;
4047 /* Build an OpenMP structured block. */
4050 begin_omp_structured_block (void)
4052 return do_pushlevel (sk_omp);
4056 finish_omp_structured_block (tree block)
4058 return do_poplevel (block);
4061 /* Similarly, except force the retention of the BLOCK. */
4064 begin_omp_parallel (void)
4066 keep_next_level (true);
4067 return begin_omp_structured_block ();
4071 finish_omp_parallel (tree clauses, tree body)
4075 body = finish_omp_structured_block (body);
4077 stmt = make_node (OMP_PARALLEL);
4078 TREE_TYPE (stmt) = void_type_node;
4079 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4080 OMP_PARALLEL_BODY (stmt) = body;
4082 return add_stmt (stmt);
4086 begin_omp_task (void)
4088 keep_next_level (true);
4089 return begin_omp_structured_block ();
4093 finish_omp_task (tree clauses, tree body)
4097 body = finish_omp_structured_block (body);
4099 stmt = make_node (OMP_TASK);
4100 TREE_TYPE (stmt) = void_type_node;
4101 OMP_TASK_CLAUSES (stmt) = clauses;
4102 OMP_TASK_BODY (stmt) = body;
4104 return add_stmt (stmt);
4107 /* Helper function for finish_omp_for. Convert Ith random access iterator
4108 into integral iterator. Return FALSE if successful. */
4111 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4112 tree condv, tree incrv, tree *body,
4113 tree *pre_body, tree clauses)
4115 tree diff, iter_init, iter_incr = NULL, last;
4116 tree incr_var = NULL, orig_pre_body, orig_body, c;
4117 tree decl = TREE_VEC_ELT (declv, i);
4118 tree init = TREE_VEC_ELT (initv, i);
4119 tree cond = TREE_VEC_ELT (condv, i);
4120 tree incr = TREE_VEC_ELT (incrv, i);
4122 location_t elocus = locus;
4124 if (init && EXPR_HAS_LOCATION (init))
4125 elocus = EXPR_LOCATION (init);
4127 switch (TREE_CODE (cond))
4133 if (TREE_OPERAND (cond, 1) == iter)
4134 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4135 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4136 if (TREE_OPERAND (cond, 0) != iter)
4137 cond = error_mark_node;
4140 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4141 TREE_OPERAND (cond, 1), ERROR_MARK,
4142 NULL, tf_warning_or_error);
4143 if (error_operand_p (tem))
4148 cond = error_mark_node;
4151 if (cond == error_mark_node)
4153 error_at (elocus, "invalid controlling predicate");
4156 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4157 ERROR_MARK, iter, ERROR_MARK, NULL,
4158 tf_warning_or_error);
4159 if (error_operand_p (diff))
4161 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4163 error_at (elocus, "difference between %qE and %qD does not have integer type",
4164 TREE_OPERAND (cond, 1), iter);
4168 switch (TREE_CODE (incr))
4170 case PREINCREMENT_EXPR:
4171 case PREDECREMENT_EXPR:
4172 case POSTINCREMENT_EXPR:
4173 case POSTDECREMENT_EXPR:
4174 if (TREE_OPERAND (incr, 0) != iter)
4176 incr = error_mark_node;
4179 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4180 tf_warning_or_error);
4181 if (error_operand_p (iter_incr))
4183 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4184 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4185 incr = integer_one_node;
4187 incr = integer_minus_one_node;
4190 if (TREE_OPERAND (incr, 0) != iter)
4191 incr = error_mark_node;
4192 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4193 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4195 tree rhs = TREE_OPERAND (incr, 1);
4196 if (TREE_OPERAND (rhs, 0) == iter)
4198 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4200 incr = error_mark_node;
4203 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4204 TREE_OPERAND (rhs, 1),
4205 tf_warning_or_error);
4206 if (error_operand_p (iter_incr))
4208 incr = TREE_OPERAND (rhs, 1);
4209 incr = cp_convert (TREE_TYPE (diff), incr);
4210 if (TREE_CODE (rhs) == MINUS_EXPR)
4212 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4213 incr = fold_if_not_in_template (incr);
4215 if (TREE_CODE (incr) != INTEGER_CST
4216 && (TREE_CODE (incr) != NOP_EXPR
4217 || (TREE_CODE (TREE_OPERAND (incr, 0))
4222 else if (TREE_OPERAND (rhs, 1) == iter)
4224 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4225 || TREE_CODE (rhs) != PLUS_EXPR)
4226 incr = error_mark_node;
4229 iter_incr = build_x_binary_op (PLUS_EXPR,
4230 TREE_OPERAND (rhs, 0),
4233 tf_warning_or_error);
4234 if (error_operand_p (iter_incr))
4236 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4238 tf_warning_or_error);
4239 if (error_operand_p (iter_incr))
4241 incr = TREE_OPERAND (rhs, 0);
4246 incr = error_mark_node;
4249 incr = error_mark_node;
4252 incr = error_mark_node;
4256 if (incr == error_mark_node)
4258 error_at (elocus, "invalid increment expression");
4262 incr = cp_convert (TREE_TYPE (diff), incr);
4263 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4264 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4265 && OMP_CLAUSE_DECL (c) == iter)
4268 decl = create_temporary_var (TREE_TYPE (diff));
4270 add_decl_expr (decl);
4271 last = create_temporary_var (TREE_TYPE (diff));
4273 add_decl_expr (last);
4274 if (c && iter_incr == NULL)
4276 incr_var = create_temporary_var (TREE_TYPE (diff));
4277 pushdecl (incr_var);
4278 add_decl_expr (incr_var);
4280 gcc_assert (stmts_are_full_exprs_p ());
4282 orig_pre_body = *pre_body;
4283 *pre_body = push_stmt_list ();
4285 add_stmt (orig_pre_body);
4287 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4288 tf_warning_or_error));
4289 init = build_int_cst (TREE_TYPE (diff), 0);
4290 if (c && iter_incr == NULL)
4292 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4293 incr, tf_warning_or_error));
4295 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4296 tf_warning_or_error);
4298 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4299 tf_warning_or_error));
4300 *pre_body = pop_stmt_list (*pre_body);
4302 cond = cp_build_binary_op (elocus,
4303 TREE_CODE (cond), decl, diff,
4304 tf_warning_or_error);
4305 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4306 elocus, incr, NULL_TREE);
4309 *body = push_stmt_list ();
4310 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4311 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4312 tf_warning_or_error);
4313 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4314 finish_expr_stmt (iter_init);
4315 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4316 tf_warning_or_error));
4317 add_stmt (orig_body);
4318 *body = pop_stmt_list (*body);
4322 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4323 finish_expr_stmt (iter_incr);
4324 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4325 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4328 TREE_VEC_ELT (declv, i) = decl;
4329 TREE_VEC_ELT (initv, i) = init;
4330 TREE_VEC_ELT (condv, i) = cond;
4331 TREE_VEC_ELT (incrv, i) = incr;
4336 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4337 are directly for their associated operands in the statement. DECL
4338 and INIT are a combo; if DECL is NULL then INIT ought to be a
4339 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4340 optional statements that need to go before the loop into its
4344 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4345 tree incrv, tree body, tree pre_body, tree clauses)
4347 tree omp_for = NULL, orig_incr = NULL;
4348 tree decl, init, cond, incr;
4352 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4353 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4354 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4355 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4357 decl = TREE_VEC_ELT (declv, i);
4358 init = TREE_VEC_ELT (initv, i);
4359 cond = TREE_VEC_ELT (condv, i);
4360 incr = TREE_VEC_ELT (incrv, i);
4366 switch (TREE_CODE (init))
4369 decl = TREE_OPERAND (init, 0);
4370 init = TREE_OPERAND (init, 1);
4373 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4375 decl = TREE_OPERAND (init, 0);
4376 init = TREE_OPERAND (init, 2);
4386 "expected iteration declaration or initialization");
4391 if (init && EXPR_HAS_LOCATION (init))
4392 elocus = EXPR_LOCATION (init);
4396 error_at (elocus, "missing controlling predicate");
4402 error_at (elocus, "missing increment expression");
4406 TREE_VEC_ELT (declv, i) = decl;
4407 TREE_VEC_ELT (initv, i) = init;
4410 if (dependent_omp_for_p (declv, initv, condv, incrv))
4414 stmt = make_node (OMP_FOR);
4416 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4418 /* This is really just a place-holder. We'll be decomposing this
4419 again and going through the cp_build_modify_expr path below when
4420 we instantiate the thing. */
4421 TREE_VEC_ELT (initv, i)
4422 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4423 TREE_VEC_ELT (initv, i));
4426 TREE_TYPE (stmt) = void_type_node;
4427 OMP_FOR_INIT (stmt) = initv;
4428 OMP_FOR_COND (stmt) = condv;
4429 OMP_FOR_INCR (stmt) = incrv;
4430 OMP_FOR_BODY (stmt) = body;
4431 OMP_FOR_PRE_BODY (stmt) = pre_body;
4432 OMP_FOR_CLAUSES (stmt) = clauses;
4434 SET_EXPR_LOCATION (stmt, locus);
4435 return add_stmt (stmt);
4438 if (processing_template_decl)
4439 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4441 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4443 decl = TREE_VEC_ELT (declv, i);
4444 init = TREE_VEC_ELT (initv, i);
4445 cond = TREE_VEC_ELT (condv, i);
4446 incr = TREE_VEC_ELT (incrv, i);
4448 TREE_VEC_ELT (orig_incr, i) = incr;
4451 if (init && EXPR_HAS_LOCATION (init))
4452 elocus = EXPR_LOCATION (init);
4456 error_at (elocus, "expected iteration declaration or initialization");
4460 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4463 TREE_VEC_ELT (orig_incr, i) = incr;
4464 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4465 TREE_CODE (TREE_OPERAND (incr, 1)),
4466 TREE_OPERAND (incr, 2),
4467 tf_warning_or_error);
4470 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4472 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4473 incrv, &body, &pre_body, clauses))
4478 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4479 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4481 error_at (elocus, "invalid type for iteration variable %qE", decl);
4485 if (!processing_template_decl)
4487 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4488 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4491 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4493 && TREE_SIDE_EFFECTS (cond)
4494 && COMPARISON_CLASS_P (cond)
4495 && !processing_template_decl)
4497 tree t = TREE_OPERAND (cond, 0);
4498 if (TREE_SIDE_EFFECTS (t)
4500 && (TREE_CODE (t) != NOP_EXPR
4501 || TREE_OPERAND (t, 0) != decl))
4502 TREE_OPERAND (cond, 0)
4503 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4505 t = TREE_OPERAND (cond, 1);
4506 if (TREE_SIDE_EFFECTS (t)
4508 && (TREE_CODE (t) != NOP_EXPR
4509 || TREE_OPERAND (t, 0) != decl))
4510 TREE_OPERAND (cond, 1)
4511 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4513 if (decl == error_mark_node || init == error_mark_node)
4516 TREE_VEC_ELT (declv, i) = decl;
4517 TREE_VEC_ELT (initv, i) = init;
4518 TREE_VEC_ELT (condv, i) = cond;
4519 TREE_VEC_ELT (incrv, i) = incr;
4523 if (IS_EMPTY_STMT (pre_body))
4526 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4529 if (omp_for == NULL)
4532 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4534 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4535 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4537 if (TREE_CODE (incr) != MODIFY_EXPR)
4540 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4541 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4542 && !processing_template_decl)
4544 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4545 if (TREE_SIDE_EFFECTS (t)
4547 && (TREE_CODE (t) != NOP_EXPR
4548 || TREE_OPERAND (t, 0) != decl))
4549 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4550 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4552 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4553 if (TREE_SIDE_EFFECTS (t)
4555 && (TREE_CODE (t) != NOP_EXPR
4556 || TREE_OPERAND (t, 0) != decl))
4557 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4558 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4562 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4564 if (omp_for != NULL)
4565 OMP_FOR_CLAUSES (omp_for) = clauses;
4570 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4579 dependent_p = false;
4582 /* Even in a template, we can detect invalid uses of the atomic
4583 pragma if neither LHS nor RHS is type-dependent. */
4584 if (processing_template_decl)
4586 dependent_p = (type_dependent_expression_p (lhs)
4587 || type_dependent_expression_p (rhs));
4590 lhs = build_non_dependent_expr (lhs);
4591 rhs = build_non_dependent_expr (rhs);
4596 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4597 if (stmt == error_mark_node)
4600 if (processing_template_decl)
4601 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4602 build2 (code, void_type_node, orig_lhs, orig_rhs));
4607 finish_omp_barrier (void)
4609 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4610 VEC(tree,gc) *vec = make_tree_vector ();
4611 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4612 release_tree_vector (vec);
4613 finish_expr_stmt (stmt);
4617 finish_omp_flush (void)
4619 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4620 VEC(tree,gc) *vec = make_tree_vector ();
4621 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4622 release_tree_vector (vec);
4623 finish_expr_stmt (stmt);
4627 finish_omp_taskwait (void)
4629 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4630 VEC(tree,gc) *vec = make_tree_vector ();
4631 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4632 release_tree_vector (vec);
4633 finish_expr_stmt (stmt);
4637 init_cp_semantics (void)
4641 /* Build a STATIC_ASSERT for a static assertion with the condition
4642 CONDITION and the message text MESSAGE. LOCATION is the location
4643 of the static assertion in the source code. When MEMBER_P, this
4644 static assertion is a member of a class. */
4646 finish_static_assert (tree condition, tree message, location_t location,
4649 if (check_for_bare_parameter_packs (condition))
4650 condition = error_mark_node;
4652 if (type_dependent_expression_p (condition)
4653 || value_dependent_expression_p (condition))
4655 /* We're in a template; build a STATIC_ASSERT and put it in
4659 assertion = make_node (STATIC_ASSERT);
4660 STATIC_ASSERT_CONDITION (assertion) = condition;
4661 STATIC_ASSERT_MESSAGE (assertion) = message;
4662 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4665 maybe_add_class_template_decl_list (current_class_type,
4669 add_stmt (assertion);
4674 /* Fold the expression and convert it to a boolean value. */
4675 condition = fold_non_dependent_expr (condition);
4676 condition = cp_convert (boolean_type_node, condition);
4677 condition = maybe_constant_value (condition);
4679 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4680 /* Do nothing; the condition is satisfied. */
4684 location_t saved_loc = input_location;
4686 input_location = location;
4687 if (TREE_CODE (condition) == INTEGER_CST
4688 && integer_zerop (condition))
4689 /* Report the error. */
4690 error ("static assertion failed: %E", message);
4691 else if (condition && condition != error_mark_node)
4693 error ("non-constant condition for static assertion");
4694 cxx_constant_value (condition);
4696 input_location = saved_loc;
4700 /* Returns the type of EXPR for cases where we can determine it even though
4701 EXPR is a type-dependent expression. */
4704 describable_type (tree expr)
4706 tree type = NULL_TREE;
4708 if (! type_dependent_expression_p (expr)
4709 && ! type_unknown_p (expr))
4711 type = unlowered_expr_type (expr);
4712 if (real_lvalue_p (expr))
4713 type = build_reference_type (type);
4719 switch (TREE_CODE (expr))
4725 return TREE_TYPE (expr);
4730 case TEMPLATE_PARM_INDEX:
4732 case STATIC_CAST_EXPR:
4733 case REINTERPRET_CAST_EXPR:
4734 case CONST_CAST_EXPR:
4735 case DYNAMIC_CAST_EXPR:
4736 type = TREE_TYPE (expr);
4741 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4742 if (ptrtype && POINTER_TYPE_P (ptrtype))
4743 type = build_reference_type (TREE_TYPE (ptrtype));
4748 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4749 type = TREE_TYPE (expr);
4753 if (type && type_uses_auto (type))
4759 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4760 suitable for use as a type-specifier.
4762 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4763 id-expression or a class member access, FALSE when it was parsed as
4764 a full expression. */
4767 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4769 tree orig_expr = expr;
4770 tree type = NULL_TREE;
4772 if (!expr || error_operand_p (expr))
4773 return error_mark_node;
4776 || TREE_CODE (expr) == TYPE_DECL
4777 || (TREE_CODE (expr) == BIT_NOT_EXPR
4778 && TYPE_P (TREE_OPERAND (expr, 0))))
4780 error ("argument to decltype must be an expression");
4781 return error_mark_node;
4784 /* FIXME instantiation-dependent */
4785 if (type_dependent_expression_p (expr)
4786 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4787 if it isn't dependent, so that we can check access control at
4788 instantiation time, so defer the decltype as well (PR 42277). */
4789 || (id_expression_or_member_access_p
4790 && processing_template_decl
4791 && TREE_CODE (expr) == COMPONENT_REF))
4793 type = cxx_make_type (DECLTYPE_TYPE);
4794 DECLTYPE_TYPE_EXPR (type) = expr;
4795 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4796 = id_expression_or_member_access_p;
4797 SET_TYPE_STRUCTURAL_EQUALITY (type);
4802 /* The type denoted by decltype(e) is defined as follows: */
4804 expr = resolve_nondeduced_context (expr);
4806 /* To get the size of a static data member declared as an array of
4807 unknown bound, we need to instantiate it. */
4808 if (TREE_CODE (expr) == VAR_DECL
4809 && VAR_HAD_UNKNOWN_BOUND (expr)
4810 && DECL_TEMPLATE_INSTANTIATION (expr))
4811 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
4813 if (id_expression_or_member_access_p)
4815 /* If e is an id-expression or a class member access (5.2.5
4816 [expr.ref]), decltype(e) is defined as the type of the entity
4817 named by e. If there is no such entity, or e names a set of
4818 overloaded functions, the program is ill-formed. */
4819 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4820 expr = lookup_name (expr);
4822 if (TREE_CODE (expr) == INDIRECT_REF)
4823 /* This can happen when the expression is, e.g., "a.b". Just
4824 look at the underlying operand. */
4825 expr = TREE_OPERAND (expr, 0);
4827 if (TREE_CODE (expr) == OFFSET_REF
4828 || TREE_CODE (expr) == MEMBER_REF)
4829 /* We're only interested in the field itself. If it is a
4830 BASELINK, we will need to see through it in the next
4832 expr = TREE_OPERAND (expr, 1);
4834 if (TREE_CODE (expr) == BASELINK)
4835 /* See through BASELINK nodes to the underlying functions. */
4836 expr = BASELINK_FUNCTIONS (expr);
4838 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4839 expr = TREE_OPERAND (expr, 0);
4841 if (TREE_CODE (expr) == OVERLOAD)
4843 if (OVL_CHAIN (expr)
4844 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4846 error ("%qE refers to a set of overloaded functions", orig_expr);
4847 return error_mark_node;
4850 /* An overload set containing only one function: just look
4851 at that function. */
4852 expr = OVL_FUNCTION (expr);
4855 switch (TREE_CODE (expr))
4858 if (DECL_BIT_FIELD_TYPE (expr))
4860 type = DECL_BIT_FIELD_TYPE (expr);
4863 /* Fall through for fields that aren't bitfields. */
4870 case TEMPLATE_PARM_INDEX:
4871 expr = mark_type_use (expr);
4872 type = TREE_TYPE (expr);
4876 type = error_mark_node;
4880 mark_type_use (expr);
4881 type = is_bitfield_expr_with_lowered_type (expr);
4883 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4890 /* We can get here when the id-expression refers to an
4892 type = TREE_TYPE (expr);
4896 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4897 || TREE_CODE (expr) == SCOPE_REF);
4898 error ("argument to decltype must be an expression");
4899 return error_mark_node;
4904 /* Within a lambda-expression:
4906 Every occurrence of decltype((x)) where x is a possibly
4907 parenthesized id-expression that names an entity of
4908 automatic storage duration is treated as if x were
4909 transformed into an access to a corresponding data member
4910 of the closure type that would have been declared if x
4911 were a use of the denoted entity. */
4912 if (outer_automatic_var_p (expr)
4913 && current_function_decl
4914 && LAMBDA_FUNCTION_P (current_function_decl))
4915 type = capture_decltype (expr);
4916 else if (error_operand_p (expr))
4917 type = error_mark_node;
4918 else if (expr == current_class_ptr)
4919 /* If the expression is just "this", we want the
4920 cv-unqualified pointer for the "this" type. */
4921 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
4924 /* Otherwise, where T is the type of e, if e is an lvalue,
4925 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
4926 cp_lvalue_kind clk = lvalue_kind (expr);
4927 type = unlowered_expr_type (expr);
4928 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
4929 if (clk != clk_none && !(clk & clk_class))
4930 type = cp_build_reference_type (type, (clk & clk_rvalueref));
4934 if (!type || type == unknown_type_node)
4936 error ("type of %qE is unknown", expr);
4937 return error_mark_node;
4943 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4944 __has_nothrow_copy, depending on assign_p. */
4947 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4954 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4957 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4959 else if (TYPE_HAS_COPY_CTOR (type))
4961 /* If construction of the copy constructor was postponed, create
4963 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4964 lazily_declare_fn (sfk_copy_constructor, type);
4965 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
4966 lazily_declare_fn (sfk_move_constructor, type);
4967 fns = CLASSTYPE_CONSTRUCTORS (type);
4972 for (; fns; fns = OVL_NEXT (fns))
4974 tree fn = OVL_CURRENT (fns);
4978 if (copy_fn_p (fn) == 0)
4981 else if (copy_fn_p (fn) <= 0)
4984 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
4991 /* Actually evaluates the trait. */
4994 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4996 enum tree_code type_code1;
4999 type_code1 = TREE_CODE (type1);
5003 case CPTK_HAS_NOTHROW_ASSIGN:
5004 type1 = strip_array_types (type1);
5005 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5006 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5007 || (CLASS_TYPE_P (type1)
5008 && classtype_has_nothrow_assign_or_copy_p (type1,
5011 case CPTK_HAS_TRIVIAL_ASSIGN:
5012 /* ??? The standard seems to be missing the "or array of such a class
5013 type" wording for this trait. */
5014 type1 = strip_array_types (type1);
5015 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5016 && (trivial_type_p (type1)
5017 || (CLASS_TYPE_P (type1)
5018 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5020 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5021 type1 = strip_array_types (type1);
5022 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5023 || (CLASS_TYPE_P (type1)
5024 && (t = locate_ctor (type1))
5025 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5027 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5028 type1 = strip_array_types (type1);
5029 return (trivial_type_p (type1)
5030 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5032 case CPTK_HAS_NOTHROW_COPY:
5033 type1 = strip_array_types (type1);
5034 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5035 || (CLASS_TYPE_P (type1)
5036 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5038 case CPTK_HAS_TRIVIAL_COPY:
5039 /* ??? The standard seems to be missing the "or array of such a class
5040 type" wording for this trait. */
5041 type1 = strip_array_types (type1);
5042 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5043 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5045 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5046 type1 = strip_array_types (type1);
5047 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5048 || (CLASS_TYPE_P (type1)
5049 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5051 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5052 return type_has_virtual_destructor (type1);
5054 case CPTK_IS_ABSTRACT:
5055 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5057 case CPTK_IS_BASE_OF:
5058 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5059 && DERIVED_FROM_P (type1, type2));
5062 return (NON_UNION_CLASS_TYPE_P (type1));
5064 case CPTK_IS_CONVERTIBLE_TO:
5069 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5072 return (type_code1 == ENUMERAL_TYPE);
5075 return (pod_type_p (type1));
5077 case CPTK_IS_POLYMORPHIC:
5078 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5080 case CPTK_IS_STD_LAYOUT:
5081 return (std_layout_type_p (type1));
5083 case CPTK_IS_TRIVIAL:
5084 return (trivial_type_p (type1));
5087 return (type_code1 == UNION_TYPE);
5089 case CPTK_IS_LITERAL_TYPE:
5090 return (literal_type_p (type1));
5098 /* Returns true if TYPE is a complete type, an array of unknown bound,
5099 or (possibly cv-qualified) void, returns false otherwise. */
5102 check_trait_type (tree type)
5104 if (COMPLETE_TYPE_P (type))
5107 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5108 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5111 if (VOID_TYPE_P (type))
5117 /* Process a trait expression. */
5120 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5122 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5123 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5124 || kind == CPTK_HAS_NOTHROW_COPY
5125 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5126 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5127 || kind == CPTK_HAS_TRIVIAL_COPY
5128 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5129 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5130 || kind == CPTK_IS_ABSTRACT
5131 || kind == CPTK_IS_BASE_OF
5132 || kind == CPTK_IS_CLASS
5133 || kind == CPTK_IS_CONVERTIBLE_TO
5134 || kind == CPTK_IS_EMPTY
5135 || kind == CPTK_IS_ENUM
5136 || kind == CPTK_IS_POD
5137 || kind == CPTK_IS_POLYMORPHIC
5138 || kind == CPTK_IS_STD_LAYOUT
5139 || kind == CPTK_IS_TRIVIAL
5140 || kind == CPTK_IS_LITERAL_TYPE
5141 || kind == CPTK_IS_UNION);
5143 if (kind == CPTK_IS_CONVERTIBLE_TO)
5145 sorry ("__is_convertible_to");
5146 return error_mark_node;
5149 if (type1 == error_mark_node
5150 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5151 && type2 == error_mark_node))
5152 return error_mark_node;
5154 if (processing_template_decl)
5156 tree trait_expr = make_node (TRAIT_EXPR);
5157 TREE_TYPE (trait_expr) = boolean_type_node;
5158 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5159 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5160 TRAIT_EXPR_KIND (trait_expr) = kind;
5164 complete_type (type1);
5166 complete_type (type2);
5170 case CPTK_HAS_NOTHROW_ASSIGN:
5171 case CPTK_HAS_TRIVIAL_ASSIGN:
5172 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5173 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5174 case CPTK_HAS_NOTHROW_COPY:
5175 case CPTK_HAS_TRIVIAL_COPY:
5176 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5177 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5178 case CPTK_IS_ABSTRACT:
5181 case CPTK_IS_POLYMORPHIC:
5182 case CPTK_IS_STD_LAYOUT:
5183 case CPTK_IS_TRIVIAL:
5184 case CPTK_IS_LITERAL_TYPE:
5185 if (!check_trait_type (type1))
5187 error ("incomplete type %qT not allowed", type1);
5188 return error_mark_node;
5192 case CPTK_IS_BASE_OF:
5193 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5194 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5195 && !COMPLETE_TYPE_P (type2))
5197 error ("incomplete type %qT not allowed", type2);
5198 return error_mark_node;
5207 case CPTK_IS_CONVERTIBLE_TO:
5212 return (trait_expr_value (kind, type1, type2)
5213 ? boolean_true_node : boolean_false_node);
5216 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5217 which is ignored for C++. */
5220 set_float_const_decimal64 (void)
5225 clear_float_const_decimal64 (void)
5230 float_const_decimal64_p (void)
5236 /* Return true if T is a literal type. */
5239 literal_type_p (tree t)
5241 if (SCALAR_TYPE_P (t))
5243 if (CLASS_TYPE_P (t))
5244 return CLASSTYPE_LITERAL_P (t);
5245 if (TREE_CODE (t) == ARRAY_TYPE)
5246 return literal_type_p (strip_array_types (t));
5250 /* If DECL is a variable declared `constexpr', require its type
5251 be literal. Return the DECL if OK, otherwise NULL. */
5254 ensure_literal_type_for_constexpr_object (tree decl)
5256 tree type = TREE_TYPE (decl);
5257 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5258 && !processing_template_decl
5259 /* The call to complete_type is just for initializer_list. */
5260 && !literal_type_p (complete_type (type)))
5262 error ("the type %qT of constexpr variable %qD is not literal",
5269 /* Representation of entries in the constexpr function definition table. */
5271 typedef struct GTY(()) constexpr_fundef {
5276 /* This table holds all constexpr function definitions seen in
5277 the current translation unit. */
5279 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5281 /* Utility function used for managing the constexpr function table.
5282 Return true if the entries pointed to by P and Q are for the
5283 same constexpr function. */
5286 constexpr_fundef_equal (const void *p, const void *q)
5288 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5289 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5290 return lhs->decl == rhs->decl;
5293 /* Utility function used for managing the constexpr function table.
5294 Return a hash value for the entry pointed to by Q. */
5296 static inline hashval_t
5297 constexpr_fundef_hash (const void *p)
5299 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5300 return DECL_UID (fundef->decl);
5303 /* Return a previously saved definition of function FUN. */
5305 static constexpr_fundef *
5306 retrieve_constexpr_fundef (tree fun)
5308 constexpr_fundef fundef = { NULL, NULL };
5309 if (constexpr_fundef_table == NULL)
5313 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5316 /* Return true if type expression T is a valid parameter type, or
5317 a valid return type, of a constexpr function. */
5320 valid_type_in_constexpr_fundecl_p (tree t)
5322 return (literal_type_p (t)
5323 /* FIXME we allow ref to non-literal; should change standard to
5324 match, or change back if not. */
5325 || TREE_CODE (t) == REFERENCE_TYPE);
5328 /* Check whether the parameter and return types of FUN are valid for a
5329 constexpr function, and complain if COMPLAIN. */
5332 is_valid_constexpr_fn (tree fun, bool complain)
5334 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5336 for (; parm != NULL; parm = TREE_CHAIN (parm))
5337 if (!valid_type_in_constexpr_fundecl_p (TREE_TYPE (parm)))
5341 error ("invalid type for parameter %q#D of constexpr function",
5345 if (!DECL_CONSTRUCTOR_P (fun))
5347 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5348 if (!valid_type_in_constexpr_fundecl_p (rettype))
5352 error ("invalid return type %qT of constexpr function %qD",
5356 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5357 && COMPLETE_TYPE_P (DECL_CONTEXT (fun))
5358 && !valid_type_in_constexpr_fundecl_p (DECL_CONTEXT (fun)))
5362 error ("enclosing class of %q#D is not a literal type", fun);
5369 /* Return non-null if FUN certainly designates a valid constexpr function
5370 declaration. Otherwise return NULL. Issue appropriate diagnostics
5371 if necessary. Note that we only check the declaration, not the body
5375 validate_constexpr_fundecl (tree fun)
5377 constexpr_fundef entry;
5378 constexpr_fundef **slot;
5380 if (processing_template_decl || !DECL_DECLARED_CONSTEXPR_P (fun))
5382 else if (DECL_CLONED_FUNCTION_P (fun))
5383 /* We already checked the original function. */
5386 if (!is_valid_constexpr_fn (fun, !DECL_TEMPLATE_INSTANTIATION (fun)))
5388 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5392 /* Create the constexpr function table if necessary. */
5393 if (constexpr_fundef_table == NULL)
5394 constexpr_fundef_table = htab_create_ggc (101,
5395 constexpr_fundef_hash,
5396 constexpr_fundef_equal,
5400 slot = (constexpr_fundef **)
5401 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
5404 *slot = ggc_alloc_constexpr_fundef ();
5410 /* Subroutine of build_constexpr_constructor_member_initializers.
5411 The expression tree T represents a data member initialization
5412 in a (constexpr) constructor definition. Build a pairing of
5413 the data member with its initializer, and prepend that pair
5414 to the existing initialization pair INITS. */
5417 build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec)
5420 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5421 t = TREE_OPERAND (t, 0);
5422 if (TREE_CODE (t) == EXPR_STMT)
5423 t = TREE_OPERAND (t, 0);
5424 if (t == error_mark_node)
5426 if (TREE_CODE (t) == STATEMENT_LIST)
5428 tree_stmt_iterator i;
5429 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5431 if (! build_data_member_initialization (tsi_stmt (i), vec))
5436 if (TREE_CODE (t) == CLEANUP_STMT)
5438 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5439 but we can in a constexpr constructor for a non-literal class. Just
5440 ignore it; either all the initialization will be constant, in which
5441 case the cleanup can't run, or it can't be constexpr.
5442 Still recurse into CLEANUP_BODY. */
5443 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5445 if (TREE_CODE (t) == CONVERT_EXPR)
5446 t = TREE_OPERAND (t, 0);
5447 if (TREE_CODE (t) == INIT_EXPR
5448 || TREE_CODE (t) == MODIFY_EXPR)
5450 member = TREE_OPERAND (t, 0);
5451 init = unshare_expr (TREE_OPERAND (t, 1));
5455 gcc_assert (TREE_CODE (t) == CALL_EXPR);
5456 member = CALL_EXPR_ARG (t, 0);
5457 /* We don't use build_cplus_new here because it complains about
5458 abstract bases. Leaving the call unwrapped means that it has the
5459 wrong type, but cxx_eval_constant_expression doesn't care. */
5460 init = unshare_expr (t);
5462 if (TREE_CODE (member) == INDIRECT_REF)
5463 member = TREE_OPERAND (member, 0);
5464 if (TREE_CODE (member) == NOP_EXPR)
5468 if (TREE_CODE (op) == ADDR_EXPR)
5470 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5471 (TREE_TYPE (TREE_TYPE (op)),
5472 TREE_TYPE (TREE_TYPE (member))));
5473 /* Initializing a cv-qualified member; we need to look through
5479 /* We don't put out anything for an empty base. */
5480 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5481 /* But if the initializer isn't constexpr, leave it in so we
5483 if (potential_constant_expression (init))
5487 if (TREE_CODE (member) == ADDR_EXPR)
5488 member = TREE_OPERAND (member, 0);
5489 if (TREE_CODE (member) == COMPONENT_REF
5490 /* If we're initializing a member of a subaggregate, it's a vtable
5491 pointer. Leave it as COMPONENT_REF so we remember the path to get
5493 && TREE_CODE (TREE_OPERAND (member, 0)) != COMPONENT_REF)
5494 member = TREE_OPERAND (member, 1);
5495 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
5499 /* Make sure that there are no statements after LAST in the constructor
5500 body represented by LIST. */
5503 check_constexpr_ctor_body (tree last, tree list)
5506 if (TREE_CODE (list) == STATEMENT_LIST)
5508 tree_stmt_iterator i = tsi_last (list);
5509 for (; !tsi_end_p (i); tsi_prev (&i))
5511 tree t = tsi_stmt (i);
5514 if (TREE_CODE (t) == BIND_EXPR)
5516 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
5521 /* We currently allow typedefs and static_assert.
5522 FIXME allow them in the standard, too. */
5523 if (TREE_CODE (t) != STATIC_ASSERT)
5530 else if (list != last
5531 && TREE_CODE (list) != STATIC_ASSERT)
5535 error ("constexpr constructor does not have empty body");
5536 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
5541 /* Build compile-time evalable representations of member-initializer list
5542 for a constexpr constructor. */
5545 build_constexpr_constructor_member_initializers (tree type, tree body)
5547 VEC(constructor_elt,gc) *vec = NULL;
5549 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
5550 || TREE_CODE (body) == EH_SPEC_BLOCK)
5551 body = TREE_OPERAND (body, 0);
5552 if (TREE_CODE (body) == STATEMENT_LIST)
5553 body = STATEMENT_LIST_HEAD (body)->stmt;
5554 body = BIND_EXPR_BODY (body);
5555 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5557 body = TREE_OPERAND (body, 0);
5558 if (TREE_CODE (body) == EXPR_STMT)
5559 body = TREE_OPERAND (body, 0);
5560 if (TREE_CODE (body) == INIT_EXPR
5561 && (same_type_ignoring_top_level_qualifiers_p
5562 (TREE_TYPE (TREE_OPERAND (body, 0)),
5563 current_class_type)))
5566 return TREE_OPERAND (body, 1);
5568 ok = build_data_member_initialization (body, &vec);
5570 else if (TREE_CODE (body) == STATEMENT_LIST)
5572 tree_stmt_iterator i;
5573 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5575 ok = build_data_member_initialization (tsi_stmt (i), &vec);
5581 gcc_assert (errorcount > 0);
5583 return build_constructor (type, vec);
5585 return error_mark_node;
5588 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5589 declared to be constexpr, or a sub-statement thereof. Returns the
5590 return value if suitable, error_mark_node for a statement not allowed in
5591 a constexpr function, or NULL_TREE if no return value was found. */
5594 constexpr_fn_retval (tree body)
5596 switch (TREE_CODE (body))
5598 case STATEMENT_LIST:
5600 tree_stmt_iterator i;
5601 tree expr = NULL_TREE;
5602 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5604 tree s = constexpr_fn_retval (tsi_stmt (i));
5605 if (s == error_mark_node)
5606 return error_mark_node;
5607 else if (s == NULL_TREE)
5608 /* Keep iterating. */;
5610 /* Multiple return statements. */
5611 return error_mark_node;
5619 return unshare_expr (TREE_OPERAND (body, 0));
5622 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
5624 return error_mark_node;
5630 return error_mark_node;
5634 /* We are processing the definition of the constexpr function FUN.
5635 Check that its BODY fulfills the propriate requirements and
5636 enter it in the constexpr function definition table.
5637 For constructor BODY is actually the TREE_LIST of the
5638 member-initializer list. */
5641 register_constexpr_fundef (tree fun, tree body)
5643 constexpr_fundef *fundef = retrieve_constexpr_fundef (fun);
5644 gcc_assert (fundef != NULL && fundef->body == NULL);
5646 if (DECL_CONSTRUCTOR_P (fun))
5647 body = build_constexpr_constructor_member_initializers
5648 (DECL_CONTEXT (fun), body);
5651 if (TREE_CODE (body) == BIND_EXPR)
5652 body = BIND_EXPR_BODY (body);
5653 if (TREE_CODE (body) == EH_SPEC_BLOCK)
5654 body = EH_SPEC_STMTS (body);
5655 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
5656 body = TREE_OPERAND (body, 0);
5657 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5658 body = TREE_OPERAND (body, 0);
5659 body = constexpr_fn_retval (body);
5660 if (body == NULL_TREE || body == error_mark_node)
5662 error ("body of constexpr function %qD not a return-statement", fun);
5663 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5668 if (!potential_rvalue_constant_expression (body))
5670 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5671 if (!DECL_TEMPLATE_INSTANTIATION (fun))
5672 require_potential_rvalue_constant_expression (body);
5675 fundef->body = body;
5679 /* Objects of this type represent calls to constexpr functions
5680 along with the bindings of parameters to their arguments, for
5681 the purpose of compile time evaluation. */
5683 typedef struct GTY(()) constexpr_call {
5684 /* Description of the constexpr function definition. */
5685 constexpr_fundef *fundef;
5686 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5687 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5688 Note: This arrangement is made to accomodate the use of
5689 iterative_hash_template_arg (see pt.c). If you change this
5690 representation, also change the hash calculation in
5691 cxx_eval_call_expression. */
5693 /* Result of the call.
5694 NULL means the call is being evaluated.
5695 error_mark_node means that the evaluation was erroneous;
5696 otherwise, the actuall value of the call. */
5698 /* The hash of this call; we remember it here to avoid having to
5699 recalculate it when expanding the hash table. */
5703 /* A table of all constexpr calls that have been evaluated by the
5704 compiler in this translation unit. */
5706 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
5708 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
5709 bool, bool, bool *);
5711 /* Compute a hash value for a constexpr call representation. */
5714 constexpr_call_hash (const void *p)
5716 const constexpr_call *info = (const constexpr_call *) p;
5720 /* Return 1 if the objects pointed to by P and Q represent calls
5721 to the same constexpr function with the same arguments.
5722 Otherwise, return 0. */
5725 constexpr_call_equal (const void *p, const void *q)
5727 const constexpr_call *lhs = (const constexpr_call *) p;
5728 const constexpr_call *rhs = (const constexpr_call *) q;
5733 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
5735 lhs_bindings = lhs->bindings;
5736 rhs_bindings = rhs->bindings;
5737 while (lhs_bindings != NULL && rhs_bindings != NULL)
5739 tree lhs_arg = TREE_VALUE (lhs_bindings);
5740 tree rhs_arg = TREE_VALUE (rhs_bindings);
5741 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
5742 if (!cp_tree_equal (lhs_arg, rhs_arg))
5744 lhs_bindings = TREE_CHAIN (lhs_bindings);
5745 rhs_bindings = TREE_CHAIN (rhs_bindings);
5747 return lhs_bindings == rhs_bindings;
5750 /* Initialize the constexpr call table, if needed. */
5753 maybe_initialize_constexpr_call_table (void)
5755 if (constexpr_call_table == NULL)
5756 constexpr_call_table = htab_create_ggc (101,
5757 constexpr_call_hash,
5758 constexpr_call_equal,
5762 /* Return true if T designates the implied `this' parameter. */
5765 is_this_parameter (tree t)
5767 return t == current_class_ptr;
5770 /* We have an expression tree T that represents a call, either CALL_EXPR
5771 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5772 retrun the _DECL for that function. */
5775 get_function_named_in_call (tree t)
5778 switch (TREE_CODE (t))
5781 fun = CALL_EXPR_FN (t);
5784 case AGGR_INIT_EXPR:
5785 fun = AGGR_INIT_EXPR_FN (t);
5792 if (TREE_CODE (fun) == ADDR_EXPR
5793 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
5794 fun = TREE_OPERAND (fun, 0);
5798 /* We have an expression tree T that represents a call, either CALL_EXPR
5799 or AGGR_INIT_EXPR. Return the Nth argument. */
5802 get_nth_callarg (tree t, int n)
5804 switch (TREE_CODE (t))
5807 return CALL_EXPR_ARG (t, n);
5809 case AGGR_INIT_EXPR:
5810 return AGGR_INIT_EXPR_ARG (t, n);
5818 /* Look up the binding of the function parameter T in a constexpr
5819 function call context CALL. */
5822 lookup_parameter_binding (const constexpr_call *call, tree t)
5824 tree b = purpose_member (t, call->bindings);
5825 return TREE_VALUE (b);
5828 /* Attempt to evaluate T which represents a call to a builtin function.
5829 We assume here that all builtin functions evaluate to scalar types
5830 represented by _CST nodes. */
5833 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
5834 bool allow_non_constant, bool addr,
5835 bool *non_constant_p)
5837 const int nargs = call_expr_nargs (t);
5838 tree *args = (tree *) alloca (nargs * sizeof (tree));
5841 for (i = 0; i < nargs; ++i)
5843 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
5844 allow_non_constant, addr,
5846 if (allow_non_constant && *non_constant_p)
5849 if (*non_constant_p)
5851 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
5852 CALL_EXPR_FN (t), nargs, args);
5853 return fold (new_call);
5856 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5857 the type of the value to match. */
5860 adjust_temp_type (tree type, tree temp)
5862 if (TREE_TYPE (temp) == type)
5864 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5865 if (TREE_CODE (temp) == CONSTRUCTOR)
5866 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
5867 gcc_assert (SCALAR_TYPE_P (type));
5868 return cp_fold_convert (type, temp);
5871 /* Subroutine of cxx_eval_call_expression.
5872 We are processing a call expression (either CALL_EXPR or
5873 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5874 all arguments and bind their values to correspondings
5875 parameters, making up the NEW_CALL context. */
5878 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
5879 constexpr_call *new_call,
5880 bool allow_non_constant,
5881 bool *non_constant_p)
5883 const int nargs = call_expr_nargs (t);
5884 tree fun = new_call->fundef->decl;
5885 tree parms = DECL_ARGUMENTS (fun);
5887 for (i = 0; i < nargs; ++i)
5890 tree type = parms ? TREE_TYPE (parms) : void_type_node;
5891 /* For member function, the first argument is a pointer to the implied
5892 object. And for an object contruction, don't bind `this' before
5893 it is fully constructed. */
5894 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
5896 x = get_nth_callarg (t, i);
5897 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
5898 TREE_CODE (type) == REFERENCE_TYPE,
5900 /* Don't VERIFY_CONSTANT here. */
5901 if (*non_constant_p && allow_non_constant)
5903 /* Just discard ellipsis args after checking their constantitude. */
5906 if (*non_constant_p)
5907 /* Don't try to adjust the type of non-constant args. */
5910 /* Make sure the binding has the same type as the parm. */
5911 if (TREE_CODE (type) != REFERENCE_TYPE)
5912 arg = adjust_temp_type (type, arg);
5913 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
5915 parms = TREE_CHAIN (parms);
5919 /* Variables and functions to manage constexpr call expansion context.
5920 These do not need to be marked for PCH or GC. */
5922 /* FIXME remember and print actual constant arguments. */
5923 static VEC(tree,heap) *call_stack = NULL;
5924 static int call_stack_tick;
5925 static int last_cx_error_tick;
5928 push_cx_call_context (tree call)
5931 if (!EXPR_HAS_LOCATION (call))
5932 SET_EXPR_LOCATION (call, input_location);
5933 VEC_safe_push (tree, heap, call_stack, call);
5934 if (VEC_length (tree, call_stack) > (unsigned) max_constexpr_depth)
5940 pop_cx_call_context (void)
5943 VEC_pop (tree, call_stack);
5947 cx_error_context (void)
5949 VEC(tree,heap) *r = NULL;
5950 if (call_stack_tick != last_cx_error_tick
5951 && !VEC_empty (tree, call_stack))
5953 last_cx_error_tick = call_stack_tick;
5957 /* Subroutine of cxx_eval_constant_expression.
5958 Evaluate the call expression tree T in the context of OLD_CALL expression
5962 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
5963 bool allow_non_constant, bool addr,
5964 bool *non_constant_p)
5966 location_t loc = EXPR_LOC_OR_HERE (t);
5967 tree fun = get_function_named_in_call (t);
5969 constexpr_call new_call = { NULL, NULL, NULL, 0 };
5970 constexpr_call **slot;
5971 constexpr_call *entry;
5974 if (TREE_CODE (fun) != FUNCTION_DECL)
5976 /* Might be a constexpr function pointer. */
5977 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
5978 /*addr*/false, non_constant_p);
5979 if (TREE_CODE (fun) == ADDR_EXPR)
5980 fun = TREE_OPERAND (fun, 0);
5982 if (TREE_CODE (fun) != FUNCTION_DECL)
5984 if (!allow_non_constant)
5985 error_at (loc, "expression %qE does not designate a constexpr "
5987 *non_constant_p = true;
5990 if (DECL_CLONED_FUNCTION_P (fun))
5991 fun = DECL_CLONED_FUNCTION (fun);
5992 if (is_builtin_fn (fun))
5993 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
5994 addr, non_constant_p);
5995 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5997 if (!allow_non_constant)
5999 error_at (loc, "%qD is not a constexpr function", fun);
6000 if (DECL_TEMPLATE_INSTANTIATION (fun)
6001 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
6002 (DECL_TI_TEMPLATE (fun))))
6003 is_valid_constexpr_fn (fun, true);
6005 *non_constant_p = true;
6009 /* Shortcut trivial copy constructor/op=. */
6010 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6012 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6013 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6014 addr, non_constant_p);
6017 /* If in direct recursive call, optimize definition search. */
6018 if (old_call != NULL && old_call->fundef->decl == fun)
6019 new_call.fundef = old_call->fundef;
6022 new_call.fundef = retrieve_constexpr_fundef (fun);
6023 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6025 if (!allow_non_constant)
6026 error_at (loc, "%qD used before its definition", fun);
6027 *non_constant_p = true;
6031 cxx_bind_parameters_in_call (old_call, t, &new_call,
6032 allow_non_constant, non_constant_p);
6033 if (*non_constant_p)
6036 depth_ok = push_cx_call_context (t);
6039 = iterative_hash_template_arg (new_call.bindings,
6040 constexpr_fundef_hash (new_call.fundef));
6042 /* If we have seen this call before, we are done. */
6043 maybe_initialize_constexpr_call_table ();
6044 slot = (constexpr_call **)
6045 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6049 /* We need to keep a pointer to the entry, not just the slot, as the
6050 slot can move in the call to cxx_eval_builtin_function_call. */
6051 *slot = entry = ggc_alloc_constexpr_call ();
6054 /* Calls which are in progress have their result set to NULL
6055 so that we can detect circular dependencies. */
6056 else if (entry->result == NULL)
6058 if (!allow_non_constant)
6059 error ("call has circular dependency");
6060 *non_constant_p = true;
6061 entry->result = result = error_mark_node;
6066 if (!allow_non_constant)
6067 error ("constexpr evaluation depth exceeds maximum of %d (use "
6068 "-fconstexpr-depth= to increase the maximum)",
6069 max_constexpr_depth);
6070 *non_constant_p = true;
6071 entry->result = result = error_mark_node;
6075 result = entry->result;
6076 if (!result || (result == error_mark_node && !allow_non_constant))
6077 result = (cxx_eval_constant_expression
6078 (&new_call, new_call.fundef->body,
6079 allow_non_constant, addr,
6081 if (result == error_mark_node)
6082 *non_constant_p = true;
6083 if (*non_constant_p)
6084 entry->result = result = error_mark_node;
6087 /* If this was a call to initialize an object, set the type of
6088 the CONSTRUCTOR to the type of that object. */
6089 if (DECL_CONSTRUCTOR_P (fun))
6091 tree ob_arg = get_nth_callarg (t, 0);
6092 STRIP_NOPS (ob_arg);
6093 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6094 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6095 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6098 entry->result = result;
6102 pop_cx_call_context ();
6103 return unshare_expr (result);
6106 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6109 reduced_constant_expression_p (tree t)
6111 if (TREE_OVERFLOW_P (t))
6112 /* Integer overflow makes this not a constant expression. */
6114 /* FIXME are we calling this too much? */
6115 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6118 /* Some expressions may have constant operands but are not constant
6119 themselves, such as 1/0. Call this function (or rather, the macro
6120 following it) to check for that condition.
6122 We only call this in places that require an arithmetic constant, not in
6123 places where we might have a non-constant expression that can be a
6124 component of a constant expression, such as the address of a constexpr
6125 variable that might be dereferenced later. */
6128 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p)
6130 if (!*non_constant_p && !reduced_constant_expression_p (t))
6132 if (!allow_non_constant)
6134 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6135 printing the folded constant isn't helpful. */
6136 if (TREE_OVERFLOW_P (t))
6138 permerror (input_location, "overflow in constant expression");
6139 /* If we're being permissive (and are in an enforcing
6140 context), consider this constant. */
6141 if (flag_permissive)
6145 error ("%q+E is not a constant expression", t);
6147 *non_constant_p = true;
6149 return *non_constant_p;
6151 #define VERIFY_CONSTANT(X) \
6153 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6157 /* Subroutine of cxx_eval_constant_expression.
6158 Attempt to reduce the unary expression tree T to a compile time value.
6159 If successful, return the value. Otherwise issue a diagnostic
6160 and return error_mark_node. */
6163 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6164 bool allow_non_constant, bool addr,
6165 bool *non_constant_p)
6168 tree orig_arg = TREE_OPERAND (t, 0);
6169 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6170 addr, non_constant_p);
6171 VERIFY_CONSTANT (arg);
6172 if (arg == orig_arg)
6174 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6175 VERIFY_CONSTANT (r);
6179 /* Subroutine of cxx_eval_constant_expression.
6180 Like cxx_eval_unary_expression, except for binary expressions. */
6183 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6184 bool allow_non_constant, bool addr,
6185 bool *non_constant_p)
6188 tree orig_lhs = TREE_OPERAND (t, 0);
6189 tree orig_rhs = TREE_OPERAND (t, 1);
6191 lhs = cxx_eval_constant_expression (call, orig_lhs,
6192 allow_non_constant, addr,
6194 VERIFY_CONSTANT (lhs);
6195 rhs = cxx_eval_constant_expression (call, orig_rhs,
6196 allow_non_constant, addr,
6198 VERIFY_CONSTANT (rhs);
6199 if (lhs == orig_lhs && rhs == orig_rhs)
6201 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6202 VERIFY_CONSTANT (r);
6206 /* Subroutine of cxx_eval_constant_expression.
6207 Attempt to evaluate condition expressions. Dead branches are not
6211 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6212 bool allow_non_constant, bool addr,
6213 bool *non_constant_p)
6215 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6216 allow_non_constant, addr,
6218 VERIFY_CONSTANT (val);
6219 if (val == boolean_true_node)
6220 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6221 allow_non_constant, addr,
6223 gcc_assert (val == boolean_false_node);
6224 /* Don't VERIFY_CONSTANT here. */
6225 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6226 allow_non_constant, addr,
6230 /* Subroutine of cxx_eval_constant_expression.
6231 Attempt to reduce a reference to an array slot. */
6234 cxx_eval_array_reference (const constexpr_call *call, tree t,
6235 bool allow_non_constant, bool addr,
6236 bool *non_constant_p)
6238 tree oldary = TREE_OPERAND (t, 0);
6239 tree ary = cxx_eval_constant_expression (call, oldary,
6240 allow_non_constant, addr,
6245 if (*non_constant_p)
6247 oldidx = TREE_OPERAND (t, 1);
6248 index = cxx_eval_constant_expression (call, oldidx,
6249 allow_non_constant, false,
6251 VERIFY_CONSTANT (index);
6252 if (addr && ary == oldary && index == oldidx)
6255 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6256 len = (TREE_CODE (ary) == CONSTRUCTOR
6257 ? CONSTRUCTOR_NELTS (ary)
6258 : (unsigned)TREE_STRING_LENGTH (ary));
6259 if (compare_tree_int (index, len) >= 0)
6261 if (!allow_non_constant)
6262 error ("array subscript out of bound");
6263 *non_constant_p = true;
6266 i = tree_low_cst (index, 0);
6267 if (TREE_CODE (ary) == CONSTRUCTOR)
6268 return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value;
6270 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
6271 TREE_STRING_POINTER (ary)[i]);
6272 /* Don't VERIFY_CONSTANT here. */
6275 /* Subroutine of cxx_eval_constant_expression.
6276 Attempt to reduce a field access of a value of class type. */
6279 cxx_eval_component_reference (const constexpr_call *call, tree t,
6280 bool allow_non_constant, bool addr,
6281 bool *non_constant_p)
6283 unsigned HOST_WIDE_INT i;
6286 tree part = TREE_OPERAND (t, 1);
6287 tree orig_whole = TREE_OPERAND (t, 0);
6288 tree whole = cxx_eval_constant_expression (call, orig_whole,
6289 allow_non_constant, addr,
6291 if (whole == orig_whole)
6294 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
6295 whole, part, NULL_TREE);
6296 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6298 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6300 if (!allow_non_constant)
6301 error ("%qE is not a constant expression", orig_whole);
6302 *non_constant_p = true;
6304 if (*non_constant_p)
6306 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6311 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE)
6313 /* FIXME Mike Miller wants this to be OK. */
6314 if (!allow_non_constant)
6315 error ("accessing %qD member instead of initialized %qD member in "
6316 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
6317 *non_constant_p = true;
6321 return error_mark_node;
6324 /* Subroutine of cxx_eval_constant_expression.
6325 Attempt to reduce a field access of a value of class type that is
6326 expressed as a BIT_FIELD_REF. */
6329 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
6330 bool allow_non_constant, bool addr,
6331 bool *non_constant_p)
6333 tree orig_whole = TREE_OPERAND (t, 0);
6334 tree whole = cxx_eval_constant_expression (call, orig_whole,
6335 allow_non_constant, addr,
6337 tree start, field, value;
6338 unsigned HOST_WIDE_INT i;
6340 if (whole == orig_whole)
6342 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6344 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6346 if (!allow_non_constant)
6347 error ("%qE is not a constant expression", orig_whole);
6348 *non_constant_p = true;
6350 if (*non_constant_p)
6353 start = TREE_OPERAND (t, 2);
6354 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6356 if (bit_position (field) == start)
6360 return error_mark_node;
6363 /* Subroutine of cxx_eval_constant_expression.
6364 Evaluate a short-circuited logical expression T in the context
6365 of a given constexpr CALL. BAILOUT_VALUE is the value for
6366 early return. CONTINUE_VALUE is used here purely for
6367 sanity check purposes. */
6370 cxx_eval_logical_expression (const constexpr_call *call, tree t,
6371 tree bailout_value, tree continue_value,
6372 bool allow_non_constant, bool addr,
6373 bool *non_constant_p)
6376 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6377 allow_non_constant, addr,
6379 VERIFY_CONSTANT (lhs);
6380 if (lhs == bailout_value)
6382 gcc_assert (lhs == continue_value);
6383 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6384 allow_non_constant, addr, non_constant_p);
6385 VERIFY_CONSTANT (r);
6389 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6390 CONSTRUCTOR elements to initialize (part of) an object containing that
6391 field. Return a pointer to the constructor_elt corresponding to the
6392 initialization of the field. */
6394 static constructor_elt *
6395 base_field_constructor_elt (VEC(constructor_elt,gc) *v, tree ref)
6397 tree aggr = TREE_OPERAND (ref, 0);
6398 tree field = TREE_OPERAND (ref, 1);
6400 constructor_elt *ce;
6402 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
6404 if (TREE_CODE (aggr) == COMPONENT_REF)
6406 constructor_elt *base_ce
6407 = base_field_constructor_elt (v, aggr);
6408 v = CONSTRUCTOR_ELTS (base_ce->value);
6411 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6412 if (ce->index == field)
6419 /* Subroutine of cxx_eval_constant_expression.
6420 The expression tree T denotes a C-style array or a C-style
6421 aggregate. Reduce it to a constant expression. */
6424 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
6425 bool allow_non_constant, bool addr,
6426 bool *non_constant_p)
6428 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t);
6429 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc,
6430 VEC_length (constructor_elt, v));
6431 constructor_elt *ce;
6433 bool changed = false;
6434 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
6435 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6437 tree elt = cxx_eval_constant_expression (call, ce->value,
6438 allow_non_constant, addr,
6440 /* Don't VERIFY_CONSTANT here. */
6441 if (allow_non_constant && *non_constant_p)
6443 if (elt != ce->value)
6445 if (TREE_CODE (ce->index) == COMPONENT_REF)
6447 /* This is an initialization of a vfield inside a base
6448 subaggregate that we already initialized; push this
6449 initialization into the previous initialization. */
6450 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
6454 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
6456 if (*non_constant_p || !changed)
6459 VEC_free (constructor_elt, gc, n);
6462 t = build_constructor (TREE_TYPE (t), n);
6463 TREE_CONSTANT (t) = true;
6467 /* Subroutine of cxx_eval_constant_expression.
6468 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6469 initialization of a non-static data member of array type. Reduce it to a
6472 Note that apart from value-initialization (when VALUE_INIT is true),
6473 this is only intended to support value-initialization and the
6474 initializations done by defaulted constructors for classes with
6475 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6476 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6477 for the copy/move constructor. */
6480 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
6481 bool value_init, bool allow_non_constant, bool addr,
6482 bool *non_constant_p)
6484 tree elttype = TREE_TYPE (atype);
6485 int max = tree_low_cst (array_type_nelts (atype), 0);
6486 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1);
6489 /* For the default constructor, build up a call to the default
6490 constructor of the element type. We only need to handle class types
6491 here, as for a constructor to be constexpr, all members must be
6492 initialized, which for a defaulted default constructor means they must
6493 be of a class type with a constexpr default constructor. */
6498 VEC(tree,gc) *argvec = make_tree_vector ();
6499 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6500 &argvec, elttype, LOOKUP_NORMAL,
6501 tf_warning_or_error);
6502 release_tree_vector (argvec);
6503 init = cxx_eval_constant_expression (call, init, allow_non_constant,
6504 addr, non_constant_p);
6507 if (*non_constant_p && !allow_non_constant)
6510 for (i = 0; i <= max; ++i)
6512 tree idx = build_int_cst (size_type_node, i);
6514 if (TREE_CODE (elttype) == ARRAY_TYPE)
6516 /* A multidimensional array; recurse. */
6518 eltinit = NULL_TREE;
6520 eltinit = cp_build_array_ref (input_location, init, idx,
6521 tf_warning_or_error);
6522 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
6523 allow_non_constant, addr,
6526 else if (value_init)
6528 eltinit = build_value_init (elttype, tf_warning_or_error);
6529 eltinit = cxx_eval_constant_expression
6530 (call, eltinit, allow_non_constant, addr, non_constant_p);
6532 else if (TREE_CODE (init) == CONSTRUCTOR)
6534 /* Initializing an element using the call to the default
6535 constructor we just built above. */
6536 eltinit = unshare_expr (init);
6540 /* Copying an element. */
6541 VEC(tree,gc) *argvec;
6542 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6543 (atype, TREE_TYPE (init)));
6544 eltinit = cp_build_array_ref (input_location, init, idx,
6545 tf_warning_or_error);
6546 if (!real_lvalue_p (init))
6547 eltinit = move (eltinit);
6548 argvec = make_tree_vector ();
6549 VEC_quick_push (tree, argvec, eltinit);
6550 eltinit = (build_special_member_call
6551 (NULL_TREE, complete_ctor_identifier, &argvec,
6552 elttype, LOOKUP_NORMAL, tf_warning_or_error));
6553 release_tree_vector (argvec);
6554 eltinit = cxx_eval_constant_expression
6555 (call, eltinit, allow_non_constant, addr, non_constant_p);
6557 if (*non_constant_p && !allow_non_constant)
6559 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
6562 if (!*non_constant_p)
6564 init = build_constructor (TREE_TYPE (atype), n);
6565 TREE_CONSTANT (init) = true;
6570 VEC_free (constructor_elt, gc, n);
6575 cxx_eval_vec_init (const constexpr_call *call, tree t,
6576 bool allow_non_constant, bool addr,
6577 bool *non_constant_p)
6579 tree atype = TREE_TYPE (t);
6580 tree init = VEC_INIT_EXPR_INIT (t);
6581 tree r = cxx_eval_vec_init_1 (call, atype, init,
6582 VEC_INIT_EXPR_VALUE_INIT (t),
6583 allow_non_constant, addr, non_constant_p);
6584 if (*non_constant_p)
6590 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6591 match. We want to be less strict for simple *& folding; if we have a
6592 non-const temporary that we access through a const pointer, that should
6593 work. We handle this here rather than change fold_indirect_ref_1
6594 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6595 don't really make sense outside of constant expression evaluation. Also
6596 we want to allow folding to COMPONENT_REF, which could cause trouble
6597 with TBAA in fold_indirect_ref_1. */
6600 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
6601 bool allow_non_constant, bool addr,
6602 bool *non_constant_p)
6604 tree orig_op0 = TREE_OPERAND (t, 0);
6605 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
6606 /*addr*/false, non_constant_p);
6607 tree type, sub, subtype, r;
6610 /* Don't VERIFY_CONSTANT here. */
6611 if (*non_constant_p)
6614 type = TREE_TYPE (t);
6620 subtype = TREE_TYPE (sub);
6621 gcc_assert (POINTER_TYPE_P (subtype));
6623 if (TREE_CODE (sub) == ADDR_EXPR)
6625 tree op = TREE_OPERAND (sub, 0);
6626 tree optype = TREE_TYPE (op);
6628 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
6630 /* Also handle conversion to an empty base class, which
6631 is represented with a NOP_EXPR. */
6632 else if (!addr && is_empty_class (type)
6633 && CLASS_TYPE_P (optype)
6634 && DERIVED_FROM_P (type, optype))
6639 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6640 else if (RECORD_OR_UNION_TYPE_P (optype))
6642 tree field = TYPE_FIELDS (optype);
6643 for (; field; field = DECL_CHAIN (field))
6644 if (TREE_CODE (field) == FIELD_DECL
6645 && integer_zerop (byte_position (field))
6646 && (same_type_ignoring_top_level_qualifiers_p
6647 (TREE_TYPE (field), type)))
6649 r = fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
6654 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
6655 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
6657 tree op00 = TREE_OPERAND (sub, 0);
6658 tree op01 = TREE_OPERAND (sub, 1);
6661 if (TREE_CODE (op00) == ADDR_EXPR)
6664 op00 = TREE_OPERAND (op00, 0);
6665 op00type = TREE_TYPE (op00);
6667 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6668 if (RECORD_OR_UNION_TYPE_P (op00type))
6670 tree field = TYPE_FIELDS (op00type);
6671 for (; field; field = DECL_CHAIN (field))
6672 if (TREE_CODE (field) == FIELD_DECL
6673 && tree_int_cst_equal (byte_position (field), op01)
6674 && (same_type_ignoring_top_level_qualifiers_p
6675 (TREE_TYPE (field), type)))
6677 r = fold_build3 (COMPONENT_REF, type, op00,
6685 /* Let build_fold_indirect_ref handle the cases it does fine with. */
6687 r = build_fold_indirect_ref (op0);
6688 if (TREE_CODE (r) != INDIRECT_REF)
6689 r = cxx_eval_constant_expression (call, r, allow_non_constant,
6690 addr, non_constant_p);
6691 else if (TREE_CODE (sub) == ADDR_EXPR
6692 || TREE_CODE (sub) == POINTER_PLUS_EXPR)
6694 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6695 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
6696 /* FIXME Mike Miller wants this to be OK. */
6697 if (!allow_non_constant)
6698 error ("accessing value of %qE through a %qT glvalue in a "
6699 "constant expression", build_fold_indirect_ref (sub),
6701 *non_constant_p = true;
6705 /* If we're pulling out the value of an empty base, make sure
6706 that the whole object is constant and then return an empty
6710 VERIFY_CONSTANT (r);
6711 r = build_constructor (TREE_TYPE (t), NULL);
6712 TREE_CONSTANT (r) = true;
6715 if (TREE_CODE (r) == INDIRECT_REF && TREE_OPERAND (r, 0) == orig_op0)
6720 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
6721 Shared between potential_constant_expression and
6722 cxx_eval_constant_expression. */
6725 non_const_var_error (tree r)
6727 tree type = TREE_TYPE (r);
6728 error ("the value of %qD is not usable in a constant "
6730 if (DECL_DECLARED_CONSTEXPR_P (r))
6731 inform (DECL_SOURCE_LOCATION (r),
6732 "%qD used in its own initializer", r);
6733 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6735 if (!CP_TYPE_CONST_P (type))
6736 inform (DECL_SOURCE_LOCATION (r),
6737 "%q#D is not const", r);
6738 else if (CP_TYPE_VOLATILE_P (type))
6739 inform (DECL_SOURCE_LOCATION (r),
6740 "%q#D is volatile", r);
6741 else if (!DECL_INITIAL (r))
6742 inform (DECL_SOURCE_LOCATION (r),
6743 "%qD was not initialized with a constant "
6750 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
6751 inform (DECL_SOURCE_LOCATION (r),
6752 "%qD was not declared %<constexpr%>", r);
6754 inform (DECL_SOURCE_LOCATION (r),
6755 "%qD does not have integral or enumeration type",
6760 /* Attempt to reduce the expression T to a constant value.
6761 On failure, issue diagnostic and return error_mark_node. */
6762 /* FIXME unify with c_fully_fold */
6765 cxx_eval_constant_expression (const constexpr_call *call, tree t,
6766 bool allow_non_constant, bool addr,
6767 bool *non_constant_p)
6771 if (t == error_mark_node)
6773 *non_constant_p = true;
6776 if (CONSTANT_CLASS_P (t))
6778 if (TREE_CODE (t) == PTRMEM_CST)
6779 t = cplus_expand_constant (t);
6782 if (TREE_CODE (t) != NOP_EXPR
6783 && reduced_constant_expression_p (t))
6786 switch (TREE_CODE (t))
6791 /* else fall through. */
6793 r = integral_constant_value (t);
6794 if (TREE_CODE (r) == TARGET_EXPR
6795 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
6796 r = TARGET_EXPR_INITIAL (r);
6799 if (!allow_non_constant)
6800 non_const_var_error (r);
6801 *non_constant_p = true;
6810 if (call && DECL_CONTEXT (t) == call->fundef->decl)
6811 r = lookup_parameter_binding (call, t);
6813 /* Defer in case this is only used for its type. */;
6816 if (!allow_non_constant)
6817 error ("%qE is not a constant expression", t);
6818 *non_constant_p = true;
6823 case AGGR_INIT_EXPR:
6824 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
6830 /* Pass false for 'addr' because these codes indicate
6831 initialization of a temporary. */
6832 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6833 allow_non_constant, false,
6835 if (!*non_constant_p)
6836 /* Adjust the type of the result to the type of the temporary. */
6837 r = adjust_temp_type (TREE_TYPE (t), r);
6841 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6842 allow_non_constant, addr,
6847 case NON_LVALUE_EXPR:
6848 case TRY_CATCH_EXPR:
6849 case CLEANUP_POINT_EXPR:
6850 case MUST_NOT_THROW_EXPR:
6852 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6853 allow_non_constant, addr,
6857 /* These differ from cxx_eval_unary_expression in that this doesn't
6858 check for a constant operand or result; an address can be
6859 constant without its operand being, and vice versa. */
6861 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
6867 tree oldop = TREE_OPERAND (t, 0);
6868 tree op = cxx_eval_constant_expression (call, oldop,
6872 /* Don't VERIFY_CONSTANT here. */
6873 if (*non_constant_p)
6875 /* This function does more aggressive folding than fold itself. */
6876 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
6877 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
6885 case FIX_TRUNC_EXPR:
6890 case TRUTH_NOT_EXPR:
6891 case FIXED_CONVERT_EXPR:
6892 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
6898 /* check_return_expr sometimes wraps a TARGET_EXPR in a
6899 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
6900 introduced by build_call_a. */
6901 tree op0 = TREE_OPERAND (t, 0);
6902 tree op1 = TREE_OPERAND (t, 1);
6904 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
6905 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
6906 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
6907 addr, non_constant_p);
6910 /* Check that the LHS is constant and then discard it. */
6911 cxx_eval_constant_expression (call, op0, allow_non_constant,
6912 false, non_constant_p);
6913 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
6914 addr, non_constant_p);
6919 case POINTER_PLUS_EXPR:
6923 case TRUNC_DIV_EXPR:
6925 case FLOOR_DIV_EXPR:
6926 case ROUND_DIV_EXPR:
6927 case TRUNC_MOD_EXPR:
6929 case ROUND_MOD_EXPR:
6931 case EXACT_DIV_EXPR:
6941 case TRUTH_XOR_EXPR:
6948 case UNORDERED_EXPR:
6957 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
6961 /* fold can introduce non-IF versions of these; still treat them as
6962 short-circuiting. */
6963 case TRUTH_AND_EXPR:
6964 case TRUTH_ANDIF_EXPR:
6965 r = cxx_eval_logical_expression (call, t, boolean_false_node,
6967 allow_non_constant, addr,
6972 case TRUTH_ORIF_EXPR:
6973 r = cxx_eval_logical_expression (call, t, boolean_true_node,
6975 allow_non_constant, addr,
6980 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
6985 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
6990 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
6996 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
7001 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
7006 /* We can get this in a defaulted constructor for a class with a
7007 non-static data member of array type. Either the initializer will
7008 be NULL, meaning default-initialization, or it will be an lvalue
7009 or xvalue of the same type, meaning direct-initialization from the
7010 corresponding member. */
7011 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
7016 case VIEW_CONVERT_EXPR:
7019 tree oldop = TREE_OPERAND (t, 0);
7021 tree to = TREE_TYPE (t);
7022 tree source = TREE_TYPE (op);
7023 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to)
7024 && !(TREE_CODE (op) == COMPONENT_REF
7025 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0)))))
7027 if (!allow_non_constant)
7028 error ("conversion of expression %qE of pointer type "
7029 "cannot yield a constant expression", op);
7030 *non_constant_p = true;
7033 op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7034 allow_non_constant, addr,
7036 if (*non_constant_p)
7039 /* We didn't fold at the top so we could check for ptr-int
7042 r = fold_build1 (TREE_CODE (t), to, op);
7043 /* Conversion of an out-of-range value has implementation-defined
7044 behavior; the language considers it different from arithmetic
7045 overflow, which is undefined. */
7046 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
7047 TREE_OVERFLOW (r) = false;
7051 case EMPTY_CLASS_EXPR:
7052 /* This is good enough for a function argument that might not get
7053 used, and they can't do anything with it, so just return it. */
7057 case DYNAMIC_CAST_EXPR:
7058 case PSEUDO_DTOR_EXPR:
7059 case PREINCREMENT_EXPR:
7060 case POSTINCREMENT_EXPR:
7061 case PREDECREMENT_EXPR:
7062 case POSTDECREMENT_EXPR:
7066 case VEC_DELETE_EXPR:
7070 /* GCC internal stuff. */
7073 case WITH_CLEANUP_EXPR:
7074 case STATEMENT_LIST:
7076 case NON_DEPENDENT_EXPR:
7080 if (!allow_non_constant)
7081 error_at (EXPR_LOC_OR_HERE (t),
7082 "expression %qE is not a constant-expression", t);
7083 *non_constant_p = true;
7087 internal_error ("unexpected expression %qE of kind %s", t,
7088 tree_code_name[TREE_CODE (t)]);
7089 *non_constant_p = true;
7093 if (r == error_mark_node)
7094 *non_constant_p = true;
7096 if (*non_constant_p)
7103 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
7105 bool non_constant_p = false;
7106 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
7107 false, &non_constant_p);
7109 verify_constant (r, allow_non_constant, &non_constant_p);
7111 if (non_constant_p && !allow_non_constant)
7112 return error_mark_node;
7113 else if (non_constant_p && TREE_CONSTANT (t))
7115 /* This isn't actually constant, so unset TREE_CONSTANT. */
7116 if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR)
7119 r = build_nop (TREE_TYPE (t), t);
7120 TREE_CONSTANT (r) = false;
7123 else if (non_constant_p || r == t)
7125 else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
7127 if (TREE_CODE (t) == TARGET_EXPR
7128 && TARGET_EXPR_INITIAL (t) == r)
7132 r = get_target_expr (r);
7133 TREE_CONSTANT (r) = true;
7141 /* Returns true if T is a valid subexpression of a constant expression,
7142 even if it isn't itself a constant expression. */
7145 is_sub_constant_expr (tree t)
7147 bool non_constant_p = false;
7148 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p);
7149 return !non_constant_p;
7152 /* If T represents a constant expression returns its reduced value.
7153 Otherwise return error_mark_node. If T is dependent, then
7157 cxx_constant_value (tree t)
7159 return cxx_eval_outermost_constant_expr (t, false);
7162 /* If T is a constant expression, returns its reduced value.
7163 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7164 Otherwise, returns a version of T without TREE_CONSTANT. */
7167 maybe_constant_value (tree t)
7171 if (type_dependent_expression_p (t)
7172 || type_unknown_p (t)
7173 || !potential_constant_expression (t)
7174 || value_dependent_expression_p (t))
7177 r = cxx_eval_outermost_constant_expr (t, true);
7178 #ifdef ENABLE_CHECKING
7179 /* cp_tree_equal looks through NOPs, so allow them. */
7181 || CONVERT_EXPR_P (t)
7182 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
7183 || !cp_tree_equal (r, t));
7188 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7189 than wrapped in a TARGET_EXPR. */
7192 maybe_constant_init (tree t)
7194 t = maybe_constant_value (t);
7195 if (TREE_CODE (t) == TARGET_EXPR)
7197 tree init = TARGET_EXPR_INITIAL (t);
7198 if (TREE_CODE (init) == CONSTRUCTOR
7199 && TREE_CONSTANT (init))
7206 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7207 /* Return true if the object referred to by REF has automatic or thread
7210 enum { ck_ok, ck_bad, ck_unknown };
7212 check_automatic_or_tls (tree ref)
7214 enum machine_mode mode;
7215 HOST_WIDE_INT bitsize, bitpos;
7217 int volatilep = 0, unsignedp = 0;
7218 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
7219 &mode, &unsignedp, &volatilep, false);
7222 /* If there isn't a decl in the middle, we don't know the linkage here,
7223 and this isn't a constant expression anyway. */
7226 dk = decl_storage_duration (decl);
7227 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
7231 /* Return true if the DECL designates a builtin function that is
7232 morally constexpr, in the sense that its parameter types and
7233 return type are literal types and the compiler is allowed to
7234 fold its invocations. */
7237 morally_constexpr_builtin_function_p (tree decl)
7239 tree funtype = TREE_TYPE (decl);
7242 if (!is_builtin_fn (decl))
7244 if (!literal_type_p (TREE_TYPE (funtype)))
7246 for (t = TYPE_ARG_TYPES (funtype); t != NULL ; t = TREE_CHAIN (t))
7248 if (t == void_list_node)
7250 if (!literal_type_p (TREE_VALUE (t)))
7253 /* We assume no varargs builtins are suitable. */
7257 /* Return true if T denotes a potentially constant expression. Issue
7258 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7259 an lvalue-rvalue conversion is implied.
7261 C++0x [expr.const] used to say
7263 6 An expression is a potential constant expression if it is
7264 a constant expression where all occurences of function
7265 parameters are replaced by arbitrary constant expressions
7266 of the appropriate type.
7268 2 A conditional expression is a constant expression unless it
7269 involves one of the following as a potentially evaluated
7270 subexpression (3.2), but subexpressions of logical AND (5.14),
7271 logical OR (5.15), and conditional (5.16) operations that are
7272 not evaluated are not considered. */
7275 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
7277 enum { any = false, rval = true };
7281 /* C++98 has different rules for the form of a constant expression that
7282 are enforced in the parser, so we can assume that anything that gets
7283 this far is suitable. */
7284 if (cxx_dialect < cxx0x)
7287 if (t == error_mark_node)
7291 if (TREE_THIS_VOLATILE (t))
7293 if (flags & tf_error)
7294 error ("expression %qE has side-effects", t);
7297 if (CONSTANT_CLASS_P (t))
7299 if (TREE_OVERFLOW (t))
7301 if (flags & tf_error)
7303 permerror (EXPR_LOC_OR_HERE (t),
7304 "overflow in constant expression");
7305 if (flag_permissive)
7313 switch (TREE_CODE (t))
7319 case TEMPLATE_ID_EXPR:
7326 case TEMPLATE_PARM_INDEX:
7328 case IDENTIFIER_NODE:
7332 /* -- this (5.1) unless it appears as the postfix-expression in a
7333 class member access expression, including the result of the
7334 implicit transformation in the body of the non-static
7335 member function (9.3.1); */
7336 if (is_this_parameter (t))
7338 if (flags & tf_error)
7339 error ("%qE is not a potential constant expression", t);
7344 case AGGR_INIT_EXPR:
7346 /* -- an invocation of a function other than a constexpr function
7347 or a constexpr constructor. */
7349 tree fun = get_function_named_in_call (t);
7350 const int nargs = call_expr_nargs (t);
7351 if (TREE_CODE (fun) != FUNCTION_DECL)
7353 if (potential_constant_expression_1 (fun, rval, flags))
7354 /* Might end up being a constant function pointer. */
7356 if (flags & tf_error)
7357 error ("%qE is not a function name", fun);
7360 /* Skip initial arguments to base constructors. */
7361 if (DECL_BASE_CONSTRUCTOR_P (fun))
7362 i = num_artificial_parms_for (fun);
7365 fun = DECL_ORIGIN (fun);
7366 if (builtin_valid_in_constant_expr_p (fun))
7368 if (!DECL_DECLARED_CONSTEXPR_P (fun)
7369 && !morally_constexpr_builtin_function_p (fun))
7371 if (flags & tf_error)
7372 error ("%qD is not %<constexpr%>", fun);
7375 for (; i < nargs; ++i)
7377 tree x = get_nth_callarg (t, i);
7378 /* A call to a non-static member function takes the
7379 address of the object as the first argument.
7380 But in a constant expression the address will be folded
7381 away, so look through it now. */
7382 if (i == 0 && DECL_NONSTATIC_MEMBER_P (fun)
7383 && !DECL_CONSTRUCTOR_P (fun))
7385 if (is_this_parameter (x))
7387 else if (!potential_constant_expression_1 (x, rval, flags))
7389 if (flags & tf_error)
7390 error ("object argument is not a potential constant "
7395 else if (!potential_constant_expression_1 (x, rval, flags))
7397 if (flags & tf_error)
7398 error ("argument in position %qP is not a "
7399 "potential constant expression", i);
7406 case NON_LVALUE_EXPR:
7407 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7408 -- an lvalue of integral type that refers to a non-volatile
7409 const variable or static data member initialized with
7410 constant expressions, or
7412 -- an lvalue of literal type that refers to non-volatile
7413 object defined with constexpr, or that refers to a
7414 sub-object of such an object; */
7415 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
7418 if (want_rval && !decl_constant_var_p (t)
7419 && !dependent_type_p (TREE_TYPE (t)))
7421 if (flags & tf_error)
7422 non_const_var_error (t);
7429 case VIEW_CONVERT_EXPR:
7430 /* -- an array-to-pointer conversion that is applied to an lvalue
7431 that designates an object with thread or automatic storage
7432 duration; FIXME not implemented as it breaks constexpr arrays;
7433 need to fix the standard
7434 -- a type conversion from a pointer or pointer-to-member type
7435 to a literal type. */
7437 tree from = TREE_OPERAND (t, 0);
7438 tree source = TREE_TYPE (from);
7439 tree target = TREE_TYPE (t);
7440 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target)
7441 && !(TREE_CODE (from) == COMPONENT_REF
7442 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0)))))
7444 if (flags & tf_error)
7445 error ("conversion of expression %qE of pointer type "
7446 "cannot yield a constant expression", from);
7449 return (potential_constant_expression_1
7450 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
7454 /* -- a unary operator & that is applied to an lvalue that
7455 designates an object with thread or automatic storage
7457 t = TREE_OPERAND (t, 0);
7459 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7460 any checking here, as we might dereference the pointer later. If
7461 we remove this code, also remove check_automatic_or_tls. */
7462 i = check_automatic_or_tls (t);
7467 if (flags & tf_error)
7468 error ("address-of an object %qE with thread local or "
7469 "automatic storage is not a constant expression", t);
7473 return potential_constant_expression_1 (t, any, flags);
7479 /* -- a class member access unless its postfix-expression is
7480 of literal type or of pointer to literal type. */
7481 /* This test would be redundant, as it follows from the
7482 postfix-expression being a potential constant expression. */
7483 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
7486 case EXPR_PACK_EXPANSION:
7487 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
7492 tree x = TREE_OPERAND (t, 0);
7494 if (is_this_parameter (x))
7496 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)) && want_rval)
7498 if (flags & tf_error)
7499 error ("the value of the object being constructed is "
7500 "not a constant expression");
7505 return potential_constant_expression_1 (x, rval, flags);
7509 case DYNAMIC_CAST_EXPR:
7510 case PSEUDO_DTOR_EXPR:
7511 case PREINCREMENT_EXPR:
7512 case POSTINCREMENT_EXPR:
7513 case PREDECREMENT_EXPR:
7514 case POSTDECREMENT_EXPR:
7518 case VEC_DELETE_EXPR:
7522 /* GCC internal stuff. */
7525 case WITH_CLEANUP_EXPR:
7526 case CLEANUP_POINT_EXPR:
7527 case MUST_NOT_THROW_EXPR:
7528 case TRY_CATCH_EXPR:
7529 case STATEMENT_LIST:
7530 /* Don't bother trying to define a subset of statement-expressions to
7531 be constant-expressions, at least for now. */
7535 if (flags & tf_error)
7536 error ("expression %qE is not a constant-expression", t);
7540 /* -- a typeid expression whose operand is of polymorphic
7543 tree e = TREE_OPERAND (t, 0);
7544 if (!TYPE_P (e) && !type_dependent_expression_p (e)
7545 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
7547 if (flags & tf_error)
7548 error ("typeid-expression is not a constant expression "
7549 "because %qE is of polymorphic type", e);
7556 /* -- a subtraction where both operands are pointers. */
7557 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7558 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
7560 if (flags & tf_error)
7561 error ("difference of two pointer expressions is not "
7562 "a constant expression");
7574 /* -- a relational or equality operator where at least
7575 one of the operands is a pointer. */
7576 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7577 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
7579 if (flags & tf_error)
7580 error ("pointer comparison expression is not a "
7581 "constant expression");
7591 case FIX_TRUNC_EXPR:
7596 case TRUTH_NOT_EXPR:
7597 case FIXED_CONVERT_EXPR:
7598 case UNARY_PLUS_EXPR:
7599 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
7603 case CONST_CAST_EXPR:
7604 case STATIC_CAST_EXPR:
7605 case REINTERPRET_CAST_EXPR:
7606 return (potential_constant_expression_1
7607 (TREE_OPERAND (t, 0),
7608 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
7611 case NON_DEPENDENT_EXPR:
7612 /* For convenience. */
7614 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
7618 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7623 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7628 VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t);
7629 constructor_elt *ce;
7630 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
7631 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
7638 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
7639 || DECL_P (TREE_PURPOSE (t)));
7640 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
7643 if (TREE_CHAIN (t) == NULL_TREE)
7645 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
7649 case TRUNC_DIV_EXPR:
7651 case FLOOR_DIV_EXPR:
7652 case ROUND_DIV_EXPR:
7653 case TRUNC_MOD_EXPR:
7655 case ROUND_MOD_EXPR:
7657 tree denom = TREE_OPERAND (t, 1);
7658 /* We can't call maybe_constant_value on an expression
7659 that hasn't been through fold_non_dependent_expr yet. */
7660 if (!processing_template_decl)
7661 denom = maybe_constant_value (denom);
7662 if (integer_zerop (denom))
7664 if (flags & tf_error)
7665 error ("division by zero is not a constant-expression");
7677 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7678 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7679 introduced by build_call_a. */
7680 tree op0 = TREE_OPERAND (t, 0);
7681 tree op1 = TREE_OPERAND (t, 1);
7683 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7684 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7685 return potential_constant_expression_1 (op0, want_rval, flags);
7690 /* If the first operand is the non-short-circuit constant, look at
7691 the second operand; otherwise we only care about the first one for
7693 case TRUTH_AND_EXPR:
7694 case TRUTH_ANDIF_EXPR:
7695 tmp = boolean_true_node;
7698 case TRUTH_ORIF_EXPR:
7699 tmp = boolean_false_node;
7701 if (TREE_OPERAND (t, 0) == tmp)
7702 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
7704 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
7708 case POINTER_PLUS_EXPR:
7710 case EXACT_DIV_EXPR:
7720 case TRUTH_XOR_EXPR:
7731 case ARRAY_RANGE_REF:
7735 for (i = 0; i < 2; ++i)
7736 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
7743 /* If the condition is a known constant, we know which of the legs we
7744 care about; otherwise we only require that the condition and
7745 either of the legs be potentially constant. */
7746 tmp = TREE_OPERAND (t, 0);
7747 if (!potential_constant_expression_1 (tmp, rval, flags))
7749 else if (tmp == boolean_true_node)
7750 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7752 else if (tmp == boolean_false_node)
7753 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
7755 for (i = 1; i < 3; ++i)
7756 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
7757 want_rval, tf_none))
7759 if (flags & tf_error)
7760 error ("expression %qE is not a constant-expression", t);
7764 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
7766 if (flags & tf_error)
7768 error ("non-constant array initialization");
7769 diagnose_non_constexpr_vec_init (t);
7774 sorry ("unexpected ast of kind %s", tree_code_name[TREE_CODE (t)]);
7780 /* The main entry point to the above. */
7783 potential_constant_expression (tree t)
7785 return potential_constant_expression_1 (t, false, tf_none);
7788 /* As above, but require a constant rvalue. */
7791 potential_rvalue_constant_expression (tree t)
7793 return potential_constant_expression_1 (t, true, tf_none);
7796 /* Like above, but complain about non-constant expressions. */
7799 require_potential_constant_expression (tree t)
7801 return potential_constant_expression_1 (t, false, tf_warning_or_error);
7804 /* Cross product of the above. */
7807 require_potential_rvalue_constant_expression (tree t)
7809 return potential_constant_expression_1 (t, true, tf_warning_or_error);
7812 /* Constructor for a lambda expression. */
7815 build_lambda_expr (void)
7817 tree lambda = make_node (LAMBDA_EXPR);
7818 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
7819 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
7820 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
7821 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
7822 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
7826 /* Create the closure object for a LAMBDA_EXPR. */
7829 build_lambda_object (tree lambda_expr)
7831 /* Build aggregate constructor call.
7832 - cp_parser_braced_list
7833 - cp_parser_functional_cast */
7834 VEC(constructor_elt,gc) *elts = NULL;
7835 tree node, expr, type;
7836 location_t saved_loc;
7838 if (processing_template_decl)
7841 /* Make sure any error messages refer to the lambda-introducer. */
7842 saved_loc = input_location;
7843 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
7845 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
7847 node = TREE_CHAIN (node))
7849 tree field = TREE_PURPOSE (node);
7850 tree val = TREE_VALUE (node);
7852 if (field == error_mark_node)
7854 expr = error_mark_node;
7861 /* Mere mortals can't copy arrays with aggregate initialization, so
7862 do some magic to make it work here. */
7863 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
7864 val = build_array_copy (val);
7865 else if (DECL_NORMAL_CAPTURE_P (field)
7866 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
7868 /* "the entities that are captured by copy are used to
7869 direct-initialize each corresponding non-static data
7870 member of the resulting closure object."
7872 There's normally no way to express direct-initialization
7873 from an element of a CONSTRUCTOR, so we build up a special
7874 TARGET_EXPR to bypass the usual copy-initialization. */
7875 val = force_rvalue (val);
7876 if (TREE_CODE (val) == TARGET_EXPR)
7877 TARGET_EXPR_DIRECT_INIT_P (val) = true;
7880 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
7883 expr = build_constructor (init_list_type_node, elts);
7884 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
7886 /* N2927: "[The closure] class type is not an aggregate."
7887 But we briefly treat it as an aggregate to make this simpler. */
7888 type = TREE_TYPE (lambda_expr);
7889 CLASSTYPE_NON_AGGREGATE (type) = 0;
7890 expr = finish_compound_literal (type, expr);
7891 CLASSTYPE_NON_AGGREGATE (type) = 1;
7894 input_location = saved_loc;
7898 /* Return an initialized RECORD_TYPE for LAMBDA.
7899 LAMBDA must have its explicit captures already. */
7902 begin_lambda_type (tree lambda)
7907 /* Unique name. This is just like an unnamed class, but we cannot use
7908 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
7910 name = make_lambda_name ();
7912 /* Create the new RECORD_TYPE for this lambda. */
7913 type = xref_tag (/*tag_code=*/record_type,
7915 /*scope=*/ts_within_enclosing_non_class,
7916 /*template_header_p=*/false);
7919 /* Designate it as a struct so that we can use aggregate initialization. */
7920 CLASSTYPE_DECLARED_CLASS (type) = false;
7922 /* Clear base types. */
7923 xref_basetypes (type, /*bases=*/NULL_TREE);
7925 /* Start the class. */
7926 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
7928 /* Cross-reference the expression and the type. */
7929 TREE_TYPE (lambda) = type;
7930 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
7935 /* Returns the type to use for the return type of the operator() of a
7939 lambda_return_type (tree expr)
7942 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
7944 warning (0, "cannot deduce lambda return type from a braced-init-list");
7945 return void_type_node;
7947 if (type_dependent_expression_p (expr))
7949 type = cxx_make_type (DECLTYPE_TYPE);
7950 DECLTYPE_TYPE_EXPR (type) = expr;
7951 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
7952 SET_TYPE_STRUCTURAL_EQUALITY (type);
7955 type = type_decays_to (unlowered_expr_type (expr));
7959 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
7963 lambda_function (tree lambda)
7966 if (TREE_CODE (lambda) == LAMBDA_EXPR)
7967 type = TREE_TYPE (lambda);
7970 gcc_assert (LAMBDA_TYPE_P (type));
7971 /* Don't let debug_tree cause instantiation. */
7972 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
7974 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
7975 /*protect=*/0, /*want_type=*/false);
7977 lambda = BASELINK_FUNCTIONS (lambda);
7981 /* Returns the type to use for the FIELD_DECL corresponding to the
7983 The caller should add REFERENCE_TYPE for capture by reference. */
7986 lambda_capture_field_type (tree expr)
7989 if (type_dependent_expression_p (expr))
7991 type = cxx_make_type (DECLTYPE_TYPE);
7992 DECLTYPE_TYPE_EXPR (type) = expr;
7993 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
7994 SET_TYPE_STRUCTURAL_EQUALITY (type);
7997 type = non_reference (unlowered_expr_type (expr));
8001 /* Recompute the return type for LAMBDA with body of the form:
8002 { return EXPR ; } */
8005 apply_lambda_return_type (tree lambda, tree return_type)
8007 tree fco = lambda_function (lambda);
8010 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
8012 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
8013 it would interfere with instantiating the closure type. */
8014 if (dependent_type_p (return_type))
8016 if (return_type == error_mark_node)
8019 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8020 TREE_TYPE (METHOD_TYPE) == return-type */
8021 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
8023 result = DECL_RESULT (fco);
8024 if (result == NULL_TREE)
8027 /* We already have a DECL_RESULT from start_preparsed_function.
8028 Now we need to redo the work it and allocate_struct_function
8029 did to reflect the new type. */
8030 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
8031 TYPE_MAIN_VARIANT (return_type));
8032 DECL_ARTIFICIAL (result) = 1;
8033 DECL_IGNORED_P (result) = 1;
8034 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
8037 DECL_RESULT (fco) = result;
8039 if (!processing_template_decl && aggregate_value_p (result, fco))
8041 #ifdef PCC_STATIC_STRUCT_RETURN
8042 cfun->returns_pcc_struct = 1;
8044 cfun->returns_struct = 1;
8049 /* DECL is a local variable or parameter from the surrounding scope of a
8050 lambda-expression. Returns the decltype for a use of the capture field
8051 for DECL even if it hasn't been captured yet. */
8054 capture_decltype (tree decl)
8056 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8057 /* FIXME do lookup instead of list walk? */
8058 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
8062 type = TREE_TYPE (TREE_PURPOSE (cap));
8064 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
8067 error ("%qD is not captured", decl);
8068 return error_mark_node;
8071 type = TREE_TYPE (decl);
8072 if (TREE_CODE (type) == REFERENCE_TYPE
8073 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
8074 type = TREE_TYPE (type);
8077 case CPLD_REFERENCE:
8078 type = TREE_TYPE (decl);
8079 if (TREE_CODE (type) != REFERENCE_TYPE)
8080 type = build_reference_type (TREE_TYPE (decl));
8087 if (TREE_CODE (type) != REFERENCE_TYPE)
8089 if (!LAMBDA_EXPR_MUTABLE_P (lam))
8090 type = cp_build_qualified_type (type, (cp_type_quals (type)
8092 type = build_reference_type (type);
8097 /* From an ID and INITIALIZER, create a capture (by reference if
8098 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8102 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
8103 bool explicit_init_p)
8108 type = lambda_capture_field_type (initializer);
8111 type = build_reference_type (type);
8112 if (!real_lvalue_p (initializer))
8113 error ("cannot capture %qE by reference", initializer);
8116 /* Make member variable. */
8117 member = build_lang_decl (FIELD_DECL, id, type);
8118 if (!explicit_init_p)
8119 /* Normal captures are invisible to name lookup but uses are replaced
8120 with references to the capture field; we implement this by only
8121 really making them invisible in unevaluated context; see
8122 qualify_lookup. For now, let's make explicitly initialized captures
8124 DECL_NORMAL_CAPTURE_P (member) = true;
8126 /* Add it to the appropriate closure class if we've started it. */
8127 if (current_class_type && current_class_type == TREE_TYPE (lambda))
8128 finish_member_declaration (member);
8130 LAMBDA_EXPR_CAPTURE_LIST (lambda)
8131 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
8133 if (id == get_identifier ("__this"))
8135 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
8136 error ("already captured %<this%> in lambda expression");
8137 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
8143 /* Register all the capture members on the list CAPTURES, which is the
8144 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8146 void register_capture_members (tree captures)
8150 register_capture_members (TREE_CHAIN (captures));
8151 finish_member_declaration (TREE_PURPOSE (captures));
8155 /* Given a FIELD_DECL decl belonging to a closure type, return a
8156 COMPONENT_REF of it relative to the 'this' parameter of the op() for
8160 thisify_lambda_field (tree decl)
8162 tree context = lambda_function (DECL_CONTEXT (decl));
8163 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
8165 tf_warning_or_error);
8166 return finish_non_static_data_member (decl, object,
8167 /*qualifying_scope*/NULL_TREE);
8170 /* Similar to add_capture, except this works on a stack of nested lambdas.
8171 BY_REFERENCE_P in this case is derived from the default capture mode.
8172 Returns the capture for the lambda at the bottom of the stack. */
8175 add_default_capture (tree lambda_stack, tree id, tree initializer)
8177 bool this_capture_p = (id == get_identifier ("__this"));
8179 tree member = NULL_TREE;
8181 tree saved_class_type = current_class_type;
8185 for (node = lambda_stack;
8187 node = TREE_CHAIN (node))
8189 tree lambda = TREE_VALUE (node);
8191 current_class_type = TREE_TYPE (lambda);
8192 member = add_capture (lambda,
8197 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
8198 == CPLD_REFERENCE)),
8199 /*explicit_init_p=*/false);
8200 initializer = thisify_lambda_field (member);
8203 current_class_type = saved_class_type;
8208 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8209 INDIRECT_REF, possibly adding it through default capturing. */
8212 lambda_expr_this_capture (tree lambda)
8216 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8218 /* Try to default capture 'this' if we can. */
8220 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
8222 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
8223 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
8224 tree init = NULL_TREE;
8226 /* If we are in a lambda function, we can move out until we hit:
8227 1. a non-lambda function,
8228 2. a lambda function capturing 'this', or
8229 3. a non-default capturing lambda function. */
8230 while (LAMBDA_FUNCTION_P (containing_function))
8233 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
8235 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
8237 /* An outer lambda has already captured 'this'. */
8238 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8239 init = thisify_lambda_field (cap);
8243 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
8244 /* An outer lambda won't let us capture 'this'. */
8247 lambda_stack = tree_cons (NULL_TREE,
8251 containing_function = decl_function_context (containing_function);
8254 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
8255 && !LAMBDA_FUNCTION_P (containing_function))
8256 /* First parameter is 'this'. */
8257 init = DECL_ARGUMENTS (containing_function);
8260 this_capture = add_default_capture (lambda_stack,
8261 /*id=*/get_identifier ("__this"),
8267 error ("%<this%> was not captured for this lambda function");
8268 result = error_mark_node;
8272 /* To make sure that current_class_ref is for the lambda. */
8273 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
8275 result = finish_non_static_data_member (this_capture,
8277 /*qualifying_scope=*/NULL_TREE);
8279 /* If 'this' is captured, each use of 'this' is transformed into an
8280 access to the corresponding unnamed data member of the closure
8281 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8282 ensures that the transformed expression is an rvalue. ] */
8283 result = rvalue (result);
8289 /* Returns the method basetype of the innermost non-lambda function, or
8290 NULL_TREE if none. */
8293 nonlambda_method_basetype (void)
8296 if (!current_class_ref)
8299 type = current_class_type;
8300 if (!LAMBDA_TYPE_P (type))
8303 /* Find the nearest enclosing non-lambda function. */
8304 fn = TYPE_NAME (type);
8306 fn = decl_function_context (fn);
8307 while (fn && LAMBDA_FUNCTION_P (fn));
8309 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8312 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
8315 /* If the closure TYPE has a static op(), also add a conversion to function
8319 maybe_add_lambda_conv_op (tree type)
8321 bool nested = (current_function_decl != NULL_TREE);
8322 tree callop = lambda_function (type);
8323 tree rettype, name, fntype, fn, body, compound_stmt;
8324 tree thistype, stattype, statfn, convfn, call, arg;
8325 VEC (tree, gc) *argvec;
8327 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
8330 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
8331 FUNCTION_ARG_CHAIN (callop));
8333 /* First build up the conversion op. */
8335 rettype = build_pointer_type (stattype);
8336 name = mangle_conv_op_name_for_type (rettype);
8337 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
8338 fntype = build_method_type_directly (thistype, rettype, void_list_node);
8339 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
8340 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8342 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8343 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8344 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8346 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
8347 grokclassfn (type, fn, NO_SPECIAL);
8348 set_linkage_according_to_type (type, fn);
8349 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8350 DECL_IN_AGGR_P (fn) = 1;
8351 DECL_ARTIFICIAL (fn) = 1;
8352 DECL_NOT_REALLY_EXTERN (fn) = 1;
8353 DECL_DECLARED_INLINE_P (fn) = 1;
8354 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
8356 DECL_INTERFACE_KNOWN (fn) = 1;
8358 add_method (type, fn, NULL_TREE);
8360 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8361 the conversion op is used. */
8362 if (varargs_function_p (callop))
8364 DECL_DELETED_FN (fn) = 1;
8368 /* Now build up the thunk to be returned. */
8370 name = get_identifier ("_FUN");
8371 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
8372 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8373 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8374 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8375 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8376 grokclassfn (type, fn, NO_SPECIAL);
8377 set_linkage_according_to_type (type, fn);
8378 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8379 DECL_IN_AGGR_P (fn) = 1;
8380 DECL_ARTIFICIAL (fn) = 1;
8381 DECL_NOT_REALLY_EXTERN (fn) = 1;
8382 DECL_DECLARED_INLINE_P (fn) = 1;
8383 DECL_STATIC_FUNCTION_P (fn) = 1;
8384 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
8385 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
8386 DECL_CONTEXT (arg) = fn;
8388 DECL_INTERFACE_KNOWN (fn) = 1;
8390 add_method (type, fn, NULL_TREE);
8393 push_function_context ();
8395 /* Generate the body of the thunk. */
8397 start_preparsed_function (statfn, NULL_TREE,
8398 SF_PRE_PARSED | SF_INCLASS_INLINE);
8399 if (DECL_ONE_ONLY (statfn))
8401 /* Put the thunk in the same comdat group as the call op. */
8402 struct cgraph_node *callop_node, *thunk_node;
8403 DECL_COMDAT_GROUP (statfn) = DECL_COMDAT_GROUP (callop);
8404 callop_node = cgraph_node (callop);
8405 thunk_node = cgraph_node (statfn);
8406 gcc_assert (callop_node->same_comdat_group == NULL);
8407 gcc_assert (thunk_node->same_comdat_group == NULL);
8408 callop_node->same_comdat_group = thunk_node;
8409 thunk_node->same_comdat_group = callop_node;
8411 body = begin_function_body ();
8412 compound_stmt = begin_compound_stmt (0);
8414 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
8416 argvec = make_tree_vector ();
8417 VEC_quick_push (tree, argvec, arg);
8418 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
8419 VEC_safe_push (tree, gc, argvec, arg);
8420 call = build_call_a (callop, VEC_length (tree, argvec),
8421 VEC_address (tree, argvec));
8422 CALL_FROM_THUNK_P (call) = 1;
8423 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
8424 call = build_cplus_new (TREE_TYPE (call), call);
8425 call = convert_from_reference (call);
8426 finish_return_stmt (call);
8428 finish_compound_stmt (compound_stmt);
8429 finish_function_body (body);
8431 expand_or_defer_fn (finish_function (2));
8433 /* Generate the body of the conversion op. */
8435 start_preparsed_function (convfn, NULL_TREE,
8436 SF_PRE_PARSED | SF_INCLASS_INLINE);
8437 body = begin_function_body ();
8438 compound_stmt = begin_compound_stmt (0);
8440 finish_return_stmt (decay_conversion (statfn));
8442 finish_compound_stmt (compound_stmt);
8443 finish_function_body (body);
8445 expand_or_defer_fn (finish_function (2));
8448 pop_function_context ();
8450 #include "gt-cp-semantics.h"