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 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 a for-statement. Returns a new FOR_STMT if appropriate. */
833 begin_for_stmt (void)
837 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
838 NULL_TREE, NULL_TREE);
840 if (flag_new_for_scope > 0)
841 TREE_CHAIN (r) = do_pushlevel (sk_for);
843 if (processing_template_decl)
844 FOR_INIT_STMT (r) = push_stmt_list ();
849 /* Finish the for-init-statement of a for-statement, which may be
850 given by FOR_STMT. */
853 finish_for_init_stmt (tree for_stmt)
855 if (processing_template_decl)
856 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
858 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
859 begin_cond (&FOR_COND (for_stmt));
862 /* Finish the COND of a for-statement, which may be given by
866 finish_for_cond (tree cond, tree for_stmt)
868 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
869 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
872 /* Finish the increment-EXPRESSION in a for-statement, which may be
873 given by FOR_STMT. */
876 finish_for_expr (tree expr, tree for_stmt)
880 /* If EXPR is an overloaded function, issue an error; there is no
881 context available to use to perform overload resolution. */
882 if (type_unknown_p (expr))
884 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
885 expr = error_mark_node;
887 if (!processing_template_decl)
889 if (warn_sequence_point)
890 verify_sequence_points (expr);
891 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
892 tf_warning_or_error);
894 else if (!type_dependent_expression_p (expr))
895 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
896 tf_warning_or_error);
897 expr = maybe_cleanup_point_expr_void (expr);
898 if (check_for_bare_parameter_packs (expr))
899 expr = error_mark_node;
900 FOR_EXPR (for_stmt) = expr;
903 /* Finish the body of a for-statement, which may be given by
904 FOR_STMT. The increment-EXPR for the loop must be
906 It can also finish RANGE_FOR_STMT. */
909 finish_for_stmt (tree for_stmt)
911 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
912 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
914 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
916 /* Pop the scope for the body of the loop. */
917 if (flag_new_for_scope > 0)
919 tree scope = TREE_CHAIN (for_stmt);
920 TREE_CHAIN (for_stmt) = NULL;
921 add_stmt (do_poplevel (scope));
927 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
928 To finish it call finish_for_stmt(). */
931 begin_range_for_stmt (void)
935 r = build_stmt (input_location, RANGE_FOR_STMT,
936 NULL_TREE, NULL_TREE, NULL_TREE);
938 if (flag_new_for_scope > 0)
939 TREE_CHAIN (r) = do_pushlevel (sk_for);
944 /* Finish the head of a range-based for statement, which may
945 be given by RANGE_FOR_STMT. DECL must be the declaration
946 and EXPR must be the loop expression. */
949 finish_range_for_decl (tree range_for_stmt, tree decl, tree expr)
951 RANGE_FOR_DECL (range_for_stmt) = decl;
952 RANGE_FOR_EXPR (range_for_stmt) = expr;
953 add_stmt (range_for_stmt);
954 RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block);
957 /* Finish a break-statement. */
960 finish_break_stmt (void)
962 return add_stmt (build_stmt (input_location, BREAK_STMT));
965 /* Finish a continue-statement. */
968 finish_continue_stmt (void)
970 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
973 /* Begin a switch-statement. Returns a new SWITCH_STMT if
977 begin_switch_stmt (void)
981 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
983 scope = do_pushlevel (sk_block);
984 TREE_CHAIN (r) = scope;
985 begin_cond (&SWITCH_STMT_COND (r));
990 /* Finish the cond of a switch-statement. */
993 finish_switch_cond (tree cond, tree switch_stmt)
995 tree orig_type = NULL;
996 if (!processing_template_decl)
998 /* Convert the condition to an integer or enumeration type. */
999 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1000 if (cond == NULL_TREE)
1002 error ("switch quantity not an integer");
1003 cond = error_mark_node;
1005 orig_type = TREE_TYPE (cond);
1006 if (cond != error_mark_node)
1010 Integral promotions are performed. */
1011 cond = perform_integral_promotions (cond);
1012 cond = maybe_cleanup_point_expr (cond);
1015 if (check_for_bare_parameter_packs (cond))
1016 cond = error_mark_node;
1017 else if (!processing_template_decl && warn_sequence_point)
1018 verify_sequence_points (cond);
1020 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1021 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1022 add_stmt (switch_stmt);
1023 push_switch (switch_stmt);
1024 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1027 /* Finish the body of a switch-statement, which may be given by
1028 SWITCH_STMT. The COND to switch on is indicated. */
1031 finish_switch_stmt (tree switch_stmt)
1035 SWITCH_STMT_BODY (switch_stmt) =
1036 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1040 scope = TREE_CHAIN (switch_stmt);
1041 TREE_CHAIN (switch_stmt) = NULL;
1042 add_stmt (do_poplevel (scope));
1045 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1049 begin_try_block (void)
1051 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1053 TRY_STMTS (r) = push_stmt_list ();
1057 /* Likewise, for a function-try-block. The block returned in
1058 *COMPOUND_STMT is an artificial outer scope, containing the
1059 function-try-block. */
1062 begin_function_try_block (tree *compound_stmt)
1065 /* This outer scope does not exist in the C++ standard, but we need
1066 a place to put __FUNCTION__ and similar variables. */
1067 *compound_stmt = begin_compound_stmt (0);
1068 r = begin_try_block ();
1069 FN_TRY_BLOCK_P (r) = 1;
1073 /* Finish a try-block, which may be given by TRY_BLOCK. */
1076 finish_try_block (tree try_block)
1078 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1079 TRY_HANDLERS (try_block) = push_stmt_list ();
1082 /* Finish the body of a cleanup try-block, which may be given by
1086 finish_cleanup_try_block (tree try_block)
1088 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1091 /* Finish an implicitly generated try-block, with a cleanup is given
1095 finish_cleanup (tree cleanup, tree try_block)
1097 TRY_HANDLERS (try_block) = cleanup;
1098 CLEANUP_P (try_block) = 1;
1101 /* Likewise, for a function-try-block. */
1104 finish_function_try_block (tree try_block)
1106 finish_try_block (try_block);
1107 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1108 the try block, but moving it inside. */
1109 in_function_try_handler = 1;
1112 /* Finish a handler-sequence for a try-block, which may be given by
1116 finish_handler_sequence (tree try_block)
1118 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1119 check_handlers (TRY_HANDLERS (try_block));
1122 /* Finish the handler-seq for a function-try-block, given by
1123 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1124 begin_function_try_block. */
1127 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1129 in_function_try_handler = 0;
1130 finish_handler_sequence (try_block);
1131 finish_compound_stmt (compound_stmt);
1134 /* Begin a handler. Returns a HANDLER if appropriate. */
1137 begin_handler (void)
1141 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1144 /* Create a binding level for the eh_info and the exception object
1146 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1151 /* Finish the handler-parameters for a handler, which may be given by
1152 HANDLER. DECL is the declaration for the catch parameter, or NULL
1153 if this is a `catch (...)' clause. */
1156 finish_handler_parms (tree decl, tree handler)
1158 tree type = NULL_TREE;
1159 if (processing_template_decl)
1163 decl = pushdecl (decl);
1164 decl = push_template_decl (decl);
1165 HANDLER_PARMS (handler) = decl;
1166 type = TREE_TYPE (decl);
1170 type = expand_start_catch_block (decl);
1171 HANDLER_TYPE (handler) = type;
1172 if (!processing_template_decl && type)
1173 mark_used (eh_type_info (type));
1176 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1177 the return value from the matching call to finish_handler_parms. */
1180 finish_handler (tree handler)
1182 if (!processing_template_decl)
1183 expand_end_catch_block ();
1184 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1187 /* Begin a compound statement. FLAGS contains some bits that control the
1188 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1189 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1190 block of a function. If BCS_TRY_BLOCK is set, this is the block
1191 created on behalf of a TRY statement. Returns a token to be passed to
1192 finish_compound_stmt. */
1195 begin_compound_stmt (unsigned int flags)
1199 if (flags & BCS_NO_SCOPE)
1201 r = push_stmt_list ();
1202 STATEMENT_LIST_NO_SCOPE (r) = 1;
1204 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1205 But, if it's a statement-expression with a scopeless block, there's
1206 nothing to keep, and we don't want to accidentally keep a block
1207 *inside* the scopeless block. */
1208 keep_next_level (false);
1211 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1213 /* When processing a template, we need to remember where the braces were,
1214 so that we can set up identical scopes when instantiating the template
1215 later. BIND_EXPR is a handy candidate for this.
1216 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1217 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1218 processing templates. */
1219 if (processing_template_decl)
1221 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1222 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1223 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1224 TREE_SIDE_EFFECTS (r) = 1;
1230 /* Finish a compound-statement, which is given by STMT. */
1233 finish_compound_stmt (tree stmt)
1235 if (TREE_CODE (stmt) == BIND_EXPR)
1237 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1238 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1239 discard the BIND_EXPR so it can be merged with the containing
1241 if (TREE_CODE (body) == STATEMENT_LIST
1242 && STATEMENT_LIST_HEAD (body) == NULL
1243 && !BIND_EXPR_BODY_BLOCK (stmt)
1244 && !BIND_EXPR_TRY_BLOCK (stmt))
1247 BIND_EXPR_BODY (stmt) = body;
1249 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1250 stmt = pop_stmt_list (stmt);
1253 /* Destroy any ObjC "super" receivers that may have been
1255 objc_clear_super_receiver ();
1257 stmt = do_poplevel (stmt);
1260 /* ??? See c_end_compound_stmt wrt statement expressions. */
1265 /* Finish an asm-statement, whose components are a STRING, some
1266 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1267 LABELS. Also note whether the asm-statement should be
1268 considered volatile. */
1271 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1272 tree input_operands, tree clobbers, tree labels)
1276 int ninputs = list_length (input_operands);
1277 int noutputs = list_length (output_operands);
1279 if (!processing_template_decl)
1281 const char *constraint;
1282 const char **oconstraints;
1283 bool allows_mem, allows_reg, is_inout;
1287 oconstraints = XALLOCAVEC (const char *, noutputs);
1289 string = resolve_asm_operand_names (string, output_operands,
1290 input_operands, labels);
1292 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1294 operand = TREE_VALUE (t);
1296 /* ??? Really, this should not be here. Users should be using a
1297 proper lvalue, dammit. But there's a long history of using
1298 casts in the output operands. In cases like longlong.h, this
1299 becomes a primitive form of typechecking -- if the cast can be
1300 removed, then the output operand had a type of the proper width;
1301 otherwise we'll get an error. Gross, but ... */
1302 STRIP_NOPS (operand);
1304 operand = mark_lvalue_use (operand);
1306 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1307 operand = error_mark_node;
1309 if (operand != error_mark_node
1310 && (TREE_READONLY (operand)
1311 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1312 /* Functions are not modifiable, even though they are
1314 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1315 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1316 /* If it's an aggregate and any field is const, then it is
1317 effectively const. */
1318 || (CLASS_TYPE_P (TREE_TYPE (operand))
1319 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1320 readonly_error (operand, REK_ASSIGNMENT_ASM);
1322 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1323 oconstraints[i] = constraint;
1325 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1326 &allows_mem, &allows_reg, &is_inout))
1328 /* If the operand is going to end up in memory,
1329 mark it addressable. */
1330 if (!allows_reg && !cxx_mark_addressable (operand))
1331 operand = error_mark_node;
1334 operand = error_mark_node;
1336 TREE_VALUE (t) = operand;
1339 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1341 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1342 operand = decay_conversion (TREE_VALUE (t));
1344 /* If the type of the operand hasn't been determined (e.g.,
1345 because it involves an overloaded function), then issue
1346 an error message. There's no context available to
1347 resolve the overloading. */
1348 if (TREE_TYPE (operand) == unknown_type_node)
1350 error ("type of asm operand %qE could not be determined",
1352 operand = error_mark_node;
1355 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1356 oconstraints, &allows_mem, &allows_reg))
1358 /* If the operand is going to end up in memory,
1359 mark it addressable. */
1360 if (!allows_reg && allows_mem)
1362 /* Strip the nops as we allow this case. FIXME, this really
1363 should be rejected or made deprecated. */
1364 STRIP_NOPS (operand);
1365 if (!cxx_mark_addressable (operand))
1366 operand = error_mark_node;
1370 operand = error_mark_node;
1372 TREE_VALUE (t) = operand;
1376 r = build_stmt (input_location, ASM_EXPR, string,
1377 output_operands, input_operands,
1379 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1380 r = maybe_cleanup_point_expr_void (r);
1381 return add_stmt (r);
1384 /* Finish a label with the indicated NAME. Returns the new label. */
1387 finish_label_stmt (tree name)
1389 tree decl = define_label (input_location, name);
1391 if (decl == error_mark_node)
1392 return error_mark_node;
1394 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1399 /* Finish a series of declarations for local labels. G++ allows users
1400 to declare "local" labels, i.e., labels with scope. This extension
1401 is useful when writing code involving statement-expressions. */
1404 finish_label_decl (tree name)
1406 if (!at_function_scope_p ())
1408 error ("__label__ declarations are only allowed in function scopes");
1412 add_decl_expr (declare_local_label (name));
1415 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1418 finish_decl_cleanup (tree decl, tree cleanup)
1420 push_cleanup (decl, cleanup, false);
1423 /* If the current scope exits with an exception, run CLEANUP. */
1426 finish_eh_cleanup (tree cleanup)
1428 push_cleanup (NULL, cleanup, true);
1431 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1432 order they were written by the user. Each node is as for
1433 emit_mem_initializers. */
1436 finish_mem_initializers (tree mem_inits)
1438 /* Reorder the MEM_INITS so that they are in the order they appeared
1439 in the source program. */
1440 mem_inits = nreverse (mem_inits);
1442 if (processing_template_decl)
1446 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1448 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1449 check for bare parameter packs in the TREE_VALUE, because
1450 any parameter packs in the TREE_VALUE have already been
1451 bound as part of the TREE_PURPOSE. See
1452 make_pack_expansion for more information. */
1453 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1454 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1455 TREE_VALUE (mem) = error_mark_node;
1458 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1461 emit_mem_initializers (mem_inits);
1464 /* Finish a parenthesized expression EXPR. */
1467 finish_parenthesized_expr (tree expr)
1470 /* This inhibits warnings in c_common_truthvalue_conversion. */
1471 TREE_NO_WARNING (expr) = 1;
1473 if (TREE_CODE (expr) == OFFSET_REF)
1474 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1475 enclosed in parentheses. */
1476 PTRMEM_OK_P (expr) = 0;
1478 if (TREE_CODE (expr) == STRING_CST)
1479 PAREN_STRING_LITERAL_P (expr) = 1;
1484 /* Finish a reference to a non-static data member (DECL) that is not
1485 preceded by `.' or `->'. */
1488 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1490 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1494 tree scope = qualifying_scope;
1495 if (scope == NULL_TREE)
1496 scope = context_for_name_lookup (decl);
1497 object = maybe_dummy_object (scope, NULL);
1500 /* DR 613: Can use non-static data members without an associated
1501 object in sizeof/decltype/alignof. */
1502 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1503 && (!processing_template_decl || !current_class_ref))
1505 if (current_function_decl
1506 && DECL_STATIC_FUNCTION_P (current_function_decl))
1507 error ("invalid use of member %q+D in static member function", decl);
1509 error ("invalid use of non-static data member %q+D", decl);
1510 error ("from this location");
1512 return error_mark_node;
1515 if (current_class_ptr)
1516 TREE_USED (current_class_ptr) = 1;
1517 if (processing_template_decl && !qualifying_scope)
1519 tree type = TREE_TYPE (decl);
1521 if (TREE_CODE (type) == REFERENCE_TYPE)
1522 type = TREE_TYPE (type);
1525 /* Set the cv qualifiers. */
1526 int quals = (current_class_ref
1527 ? cp_type_quals (TREE_TYPE (current_class_ref))
1528 : TYPE_UNQUALIFIED);
1530 if (DECL_MUTABLE_P (decl))
1531 quals &= ~TYPE_QUAL_CONST;
1533 quals |= cp_type_quals (TREE_TYPE (decl));
1534 type = cp_build_qualified_type (type, quals);
1537 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1539 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1540 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1542 else if (processing_template_decl)
1543 return build_qualified_name (TREE_TYPE (decl),
1546 /*template_p=*/false);
1549 tree access_type = TREE_TYPE (object);
1551 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1554 /* If the data member was named `C::M', convert `*this' to `C'
1556 if (qualifying_scope)
1558 tree binfo = NULL_TREE;
1559 object = build_scoped_ref (object, qualifying_scope,
1563 return build_class_member_access_expr (object, decl,
1564 /*access_path=*/NULL_TREE,
1565 /*preserve_reference=*/false,
1566 tf_warning_or_error);
1570 /* If we are currently parsing a template and we encountered a typedef
1571 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1572 adds the typedef to a list tied to the current template.
1573 At tempate instantiatin time, that list is walked and access check
1574 performed for each typedef.
1575 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1578 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1580 location_t location)
1582 tree template_info = NULL;
1583 tree cs = current_scope ();
1585 if (!is_typedef_decl (typedef_decl)
1587 || !CLASS_TYPE_P (context)
1591 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1592 template_info = get_template_info (cs);
1595 && TI_TEMPLATE (template_info)
1596 && !currently_open_class (context))
1597 append_type_to_template_for_access_check (cs, typedef_decl,
1601 /* DECL was the declaration to which a qualified-id resolved. Issue
1602 an error message if it is not accessible. If OBJECT_TYPE is
1603 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1604 type of `*x', or `x', respectively. If the DECL was named as
1605 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1608 check_accessibility_of_qualified_id (tree decl,
1610 tree nested_name_specifier)
1613 tree qualifying_type = NULL_TREE;
1615 /* If we are parsing a template declaration and if decl is a typedef,
1616 add it to a list tied to the template.
1617 At template instantiation time, that list will be walked and
1618 access check performed. */
1619 add_typedef_to_current_template_for_access_check (decl,
1620 nested_name_specifier
1621 ? nested_name_specifier
1622 : DECL_CONTEXT (decl),
1625 /* If we're not checking, return immediately. */
1626 if (deferred_access_no_check)
1629 /* Determine the SCOPE of DECL. */
1630 scope = context_for_name_lookup (decl);
1631 /* If the SCOPE is not a type, then DECL is not a member. */
1632 if (!TYPE_P (scope))
1634 /* Compute the scope through which DECL is being accessed. */
1636 /* OBJECT_TYPE might not be a class type; consider:
1638 class A { typedef int I; };
1642 In this case, we will have "A::I" as the DECL, but "I" as the
1644 && CLASS_TYPE_P (object_type)
1645 && DERIVED_FROM_P (scope, object_type))
1646 /* If we are processing a `->' or `.' expression, use the type of the
1648 qualifying_type = object_type;
1649 else if (nested_name_specifier)
1651 /* If the reference is to a non-static member of the
1652 current class, treat it as if it were referenced through
1654 if (DECL_NONSTATIC_MEMBER_P (decl)
1655 && current_class_ptr
1656 && DERIVED_FROM_P (scope, current_class_type))
1657 qualifying_type = current_class_type;
1658 /* Otherwise, use the type indicated by the
1659 nested-name-specifier. */
1661 qualifying_type = nested_name_specifier;
1664 /* Otherwise, the name must be from the current class or one of
1666 qualifying_type = currently_open_derived_class (scope);
1669 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1670 or similar in a default argument value. */
1671 && CLASS_TYPE_P (qualifying_type)
1672 && !dependent_type_p (qualifying_type))
1673 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1677 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1678 class named to the left of the "::" operator. DONE is true if this
1679 expression is a complete postfix-expression; it is false if this
1680 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1681 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1682 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1683 is true iff this qualified name appears as a template argument. */
1686 finish_qualified_id_expr (tree qualifying_class,
1691 bool template_arg_p)
1693 gcc_assert (TYPE_P (qualifying_class));
1695 if (error_operand_p (expr))
1696 return error_mark_node;
1698 if (DECL_P (expr) || BASELINK_P (expr))
1702 check_template_keyword (expr);
1704 /* If EXPR occurs as the operand of '&', use special handling that
1705 permits a pointer-to-member. */
1706 if (address_p && done)
1708 if (TREE_CODE (expr) == SCOPE_REF)
1709 expr = TREE_OPERAND (expr, 1);
1710 expr = build_offset_ref (qualifying_class, expr,
1711 /*address_p=*/true);
1715 /* Within the scope of a class, turn references to non-static
1716 members into expression of the form "this->...". */
1718 /* But, within a template argument, we do not want make the
1719 transformation, as there is no "this" pointer. */
1721 else if (TREE_CODE (expr) == FIELD_DECL)
1723 push_deferring_access_checks (dk_no_check);
1724 expr = finish_non_static_data_member (expr, NULL_TREE,
1726 pop_deferring_access_checks ();
1728 else if (BASELINK_P (expr) && !processing_template_decl)
1732 /* See if any of the functions are non-static members. */
1733 /* If so, the expression may be relative to 'this'. */
1734 if (!shared_member_p (expr)
1735 && (ob = maybe_dummy_object (qualifying_class, NULL),
1736 !is_dummy_object (ob)))
1737 expr = (build_class_member_access_expr
1740 BASELINK_ACCESS_BINFO (expr),
1741 /*preserve_reference=*/false,
1742 tf_warning_or_error));
1744 /* The expression is a qualified name whose address is not
1746 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1752 /* Begin a statement-expression. The value returned must be passed to
1753 finish_stmt_expr. */
1756 begin_stmt_expr (void)
1758 return push_stmt_list ();
1761 /* Process the final expression of a statement expression. EXPR can be
1762 NULL, if the final expression is empty. Return a STATEMENT_LIST
1763 containing all the statements in the statement-expression, or
1764 ERROR_MARK_NODE if there was an error. */
1767 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1769 if (error_operand_p (expr))
1771 /* The type of the statement-expression is the type of the last
1773 TREE_TYPE (stmt_expr) = error_mark_node;
1774 return error_mark_node;
1777 /* If the last statement does not have "void" type, then the value
1778 of the last statement is the value of the entire expression. */
1781 tree type = TREE_TYPE (expr);
1783 if (processing_template_decl)
1785 expr = build_stmt (input_location, EXPR_STMT, expr);
1786 expr = add_stmt (expr);
1787 /* Mark the last statement so that we can recognize it as such at
1788 template-instantiation time. */
1789 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1791 else if (VOID_TYPE_P (type))
1793 /* Just treat this like an ordinary statement. */
1794 expr = finish_expr_stmt (expr);
1798 /* It actually has a value we need to deal with. First, force it
1799 to be an rvalue so that we won't need to build up a copy
1800 constructor call later when we try to assign it to something. */
1801 expr = force_rvalue (expr);
1802 if (error_operand_p (expr))
1803 return error_mark_node;
1805 /* Update for array-to-pointer decay. */
1806 type = TREE_TYPE (expr);
1808 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1809 normal statement, but don't convert to void or actually add
1811 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1812 expr = maybe_cleanup_point_expr (expr);
1816 /* The type of the statement-expression is the type of the last
1818 TREE_TYPE (stmt_expr) = type;
1824 /* Finish a statement-expression. EXPR should be the value returned
1825 by the previous begin_stmt_expr. Returns an expression
1826 representing the statement-expression. */
1829 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1834 if (error_operand_p (stmt_expr))
1836 pop_stmt_list (stmt_expr);
1837 return error_mark_node;
1840 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1842 type = TREE_TYPE (stmt_expr);
1843 result = pop_stmt_list (stmt_expr);
1844 TREE_TYPE (result) = type;
1846 if (processing_template_decl)
1848 result = build_min (STMT_EXPR, type, result);
1849 TREE_SIDE_EFFECTS (result) = 1;
1850 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1852 else if (CLASS_TYPE_P (type))
1854 /* Wrap the statement-expression in a TARGET_EXPR so that the
1855 temporary object created by the final expression is destroyed at
1856 the end of the full-expression containing the
1857 statement-expression. */
1858 result = force_target_expr (type, result);
1864 /* Returns the expression which provides the value of STMT_EXPR. */
1867 stmt_expr_value_expr (tree stmt_expr)
1869 tree t = STMT_EXPR_STMT (stmt_expr);
1871 if (TREE_CODE (t) == BIND_EXPR)
1872 t = BIND_EXPR_BODY (t);
1874 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1875 t = STATEMENT_LIST_TAIL (t)->stmt;
1877 if (TREE_CODE (t) == EXPR_STMT)
1878 t = EXPR_STMT_EXPR (t);
1883 /* Return TRUE iff EXPR_STMT is an empty list of
1884 expression statements. */
1887 empty_expr_stmt_p (tree expr_stmt)
1889 tree body = NULL_TREE;
1891 if (expr_stmt == void_zero_node)
1896 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1897 body = EXPR_STMT_EXPR (expr_stmt);
1898 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1904 if (TREE_CODE (body) == STATEMENT_LIST)
1905 return tsi_end_p (tsi_start (body));
1907 return empty_expr_stmt_p (body);
1912 /* Perform Koenig lookup. FN is the postfix-expression representing
1913 the function (or functions) to call; ARGS are the arguments to the
1914 call; if INCLUDE_STD then the `std' namespace is automatically
1915 considered an associated namespace (used in range-based for loops).
1916 Returns the functions to be considered by overload resolution. */
1919 perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std)
1921 tree identifier = NULL_TREE;
1922 tree functions = NULL_TREE;
1923 tree tmpl_args = NULL_TREE;
1924 bool template_id = false;
1926 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1928 /* Use a separate flag to handle null args. */
1930 tmpl_args = TREE_OPERAND (fn, 1);
1931 fn = TREE_OPERAND (fn, 0);
1934 /* Find the name of the overloaded function. */
1935 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1937 else if (is_overloaded_fn (fn))
1940 identifier = DECL_NAME (get_first_fn (functions));
1942 else if (DECL_P (fn))
1945 identifier = DECL_NAME (fn);
1948 /* A call to a namespace-scope function using an unqualified name.
1950 Do Koenig lookup -- unless any of the arguments are
1952 if (!any_type_dependent_arguments_p (args)
1953 && !any_dependent_template_arguments_p (tmpl_args))
1955 fn = lookup_arg_dependent (identifier, functions, args, include_std);
1957 /* The unqualified name could not be resolved. */
1958 fn = unqualified_fn_lookup_error (identifier);
1961 if (fn && template_id)
1962 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1967 /* Generate an expression for `FN (ARGS)'. This may change the
1970 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1971 as a virtual call, even if FN is virtual. (This flag is set when
1972 encountering an expression where the function name is explicitly
1973 qualified. For example a call to `X::f' never generates a virtual
1976 Returns code for the call. */
1979 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1980 bool koenig_p, tsubst_flags_t complain)
1984 VEC(tree,gc) *orig_args = NULL;
1986 if (fn == error_mark_node)
1987 return error_mark_node;
1989 gcc_assert (!TYPE_P (fn));
1993 if (processing_template_decl)
1995 if (type_dependent_expression_p (fn)
1996 || any_type_dependent_arguments_p (*args))
1998 result = build_nt_call_vec (fn, *args);
1999 KOENIG_LOOKUP_P (result) = koenig_p;
2004 tree fndecl = OVL_CURRENT (fn);
2005 if (TREE_CODE (fndecl) != FUNCTION_DECL
2006 || !TREE_THIS_VOLATILE (fndecl))
2012 current_function_returns_abnormally = 1;
2016 orig_args = make_tree_vector_copy (*args);
2017 if (!BASELINK_P (fn)
2018 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2019 && TREE_TYPE (fn) != unknown_type_node)
2020 fn = build_non_dependent_expr (fn);
2021 make_args_non_dependent (*args);
2024 if (is_overloaded_fn (fn))
2025 fn = baselink_for_fns (fn);
2028 if (BASELINK_P (fn))
2032 /* A call to a member function. From [over.call.func]:
2034 If the keyword this is in scope and refers to the class of
2035 that member function, or a derived class thereof, then the
2036 function call is transformed into a qualified function call
2037 using (*this) as the postfix-expression to the left of the
2038 . operator.... [Otherwise] a contrived object of type T
2039 becomes the implied object argument.
2043 struct A { void f(); };
2044 struct B : public A {};
2045 struct C : public A { void g() { B::f(); }};
2047 "the class of that member function" refers to `A'. But 11.2
2048 [class.access.base] says that we need to convert 'this' to B* as
2049 part of the access, so we pass 'B' to maybe_dummy_object. */
2051 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2054 if (processing_template_decl)
2056 if (type_dependent_expression_p (object))
2058 tree ret = build_nt_call_vec (orig_fn, orig_args);
2059 release_tree_vector (orig_args);
2062 object = build_non_dependent_expr (object);
2065 result = build_new_method_call (object, fn, args, NULL_TREE,
2067 ? LOOKUP_NONVIRTUAL : 0),
2071 else if (is_overloaded_fn (fn))
2073 /* If the function is an overloaded builtin, resolve it. */
2074 if (TREE_CODE (fn) == FUNCTION_DECL
2075 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2076 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2077 result = resolve_overloaded_builtin (input_location, fn, *args);
2080 /* A call to a namespace-scope function. */
2081 result = build_new_function_call (fn, args, koenig_p, complain);
2083 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2085 if (!VEC_empty (tree, *args))
2086 error ("arguments to destructor are not allowed");
2087 /* Mark the pseudo-destructor call as having side-effects so
2088 that we do not issue warnings about its use. */
2089 result = build1 (NOP_EXPR,
2091 TREE_OPERAND (fn, 0));
2092 TREE_SIDE_EFFECTS (result) = 1;
2094 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2095 /* If the "function" is really an object of class type, it might
2096 have an overloaded `operator ()'. */
2097 result = build_op_call (fn, args, complain);
2100 /* A call where the function is unknown. */
2101 result = cp_build_function_call_vec (fn, args, complain);
2103 if (processing_template_decl)
2105 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2106 KOENIG_LOOKUP_P (result) = koenig_p;
2107 release_tree_vector (orig_args);
2113 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2114 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2115 POSTDECREMENT_EXPR.) */
2118 finish_increment_expr (tree expr, enum tree_code code)
2120 return build_x_unary_op (code, expr, tf_warning_or_error);
2123 /* Finish a use of `this'. Returns an expression for `this'. */
2126 finish_this_expr (void)
2130 if (current_class_ptr)
2132 tree type = TREE_TYPE (current_class_ref);
2134 /* In a lambda expression, 'this' refers to the captured 'this'. */
2135 if (LAMBDA_TYPE_P (type))
2136 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2138 result = current_class_ptr;
2141 else if (current_function_decl
2142 && DECL_STATIC_FUNCTION_P (current_function_decl))
2144 error ("%<this%> is unavailable for static member functions");
2145 result = error_mark_node;
2149 if (current_function_decl)
2150 error ("invalid use of %<this%> in non-member function");
2152 error ("invalid use of %<this%> at top level");
2153 result = error_mark_node;
2159 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2160 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2161 the TYPE for the type given. If SCOPE is non-NULL, the expression
2162 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2165 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2167 if (object == error_mark_node || destructor == error_mark_node)
2168 return error_mark_node;
2170 gcc_assert (TYPE_P (destructor));
2172 if (!processing_template_decl)
2174 if (scope == error_mark_node)
2176 error ("invalid qualifying scope in pseudo-destructor name");
2177 return error_mark_node;
2179 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2181 error ("qualified type %qT does not match destructor name ~%qT",
2183 return error_mark_node;
2187 /* [expr.pseudo] says both:
2189 The type designated by the pseudo-destructor-name shall be
2190 the same as the object type.
2194 The cv-unqualified versions of the object type and of the
2195 type designated by the pseudo-destructor-name shall be the
2198 We implement the more generous second sentence, since that is
2199 what most other compilers do. */
2200 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2203 error ("%qE is not of type %qT", object, destructor);
2204 return error_mark_node;
2208 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2211 /* Finish an expression of the form CODE EXPR. */
2214 finish_unary_op_expr (enum tree_code code, tree expr)
2216 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2217 /* Inside a template, build_x_unary_op does not fold the
2218 expression. So check whether the result is folded before
2219 setting TREE_NEGATED_INT. */
2220 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2221 && TREE_CODE (result) == INTEGER_CST
2222 && !TYPE_UNSIGNED (TREE_TYPE (result))
2223 && INT_CST_LT (result, integer_zero_node))
2225 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2226 setting TREE_NEGATED_INT. */
2227 result = copy_node (result);
2228 TREE_NEGATED_INT (result) = 1;
2230 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2231 overflow_warning (input_location, result);
2236 /* Finish a compound-literal expression. TYPE is the type to which
2237 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2240 finish_compound_literal (tree type, tree compound_literal)
2242 if (type == error_mark_node)
2243 return error_mark_node;
2245 if (!TYPE_OBJ_P (type))
2247 error ("compound literal of non-object type %qT", type);
2248 return error_mark_node;
2251 if (processing_template_decl)
2253 TREE_TYPE (compound_literal) = type;
2254 /* Mark the expression as a compound literal. */
2255 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2256 return compound_literal;
2259 type = complete_type (type);
2261 if (TYPE_NON_AGGREGATE_CLASS (type))
2263 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2264 everywhere that deals with function arguments would be a pain, so
2265 just wrap it in a TREE_LIST. The parser set a flag so we know
2266 that it came from T{} rather than T({}). */
2267 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2268 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2269 return build_functional_cast (type, compound_literal, tf_error);
2272 if (TREE_CODE (type) == ARRAY_TYPE
2273 && check_array_initializer (NULL_TREE, type, compound_literal))
2274 return error_mark_node;
2275 compound_literal = reshape_init (type, compound_literal);
2276 if (TREE_CODE (type) == ARRAY_TYPE)
2277 cp_complete_array_type (&type, compound_literal, false);
2278 compound_literal = digest_init (type, compound_literal);
2279 return get_target_expr (compound_literal);
2282 /* Return the declaration for the function-name variable indicated by
2286 finish_fname (tree id)
2290 decl = fname_decl (input_location, C_RID_CODE (id), id);
2291 if (processing_template_decl)
2292 decl = DECL_NAME (decl);
2296 /* Finish a translation unit. */
2299 finish_translation_unit (void)
2301 /* In case there were missing closebraces,
2302 get us back to the global binding level. */
2304 while (current_namespace != global_namespace)
2307 /* Do file scope __FUNCTION__ et al. */
2308 finish_fname_decls ();
2311 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2312 Returns the parameter. */
2315 finish_template_type_parm (tree aggr, tree identifier)
2317 if (aggr != class_type_node)
2319 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2320 aggr = class_type_node;
2323 return build_tree_list (aggr, identifier);
2326 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2327 Returns the parameter. */
2330 finish_template_template_parm (tree aggr, tree identifier)
2332 tree decl = build_decl (input_location,
2333 TYPE_DECL, identifier, NULL_TREE);
2334 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2335 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2336 DECL_TEMPLATE_RESULT (tmpl) = decl;
2337 DECL_ARTIFICIAL (decl) = 1;
2338 end_template_decl ();
2340 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2342 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2343 /*is_primary=*/true, /*is_partial=*/false,
2346 return finish_template_type_parm (aggr, tmpl);
2349 /* ARGUMENT is the default-argument value for a template template
2350 parameter. If ARGUMENT is invalid, issue error messages and return
2351 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2354 check_template_template_default_arg (tree argument)
2356 if (TREE_CODE (argument) != TEMPLATE_DECL
2357 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2358 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2360 if (TREE_CODE (argument) == TYPE_DECL)
2361 error ("invalid use of type %qT as a default value for a template "
2362 "template-parameter", TREE_TYPE (argument));
2364 error ("invalid default argument for a template template parameter");
2365 return error_mark_node;
2371 /* Begin a class definition, as indicated by T. */
2374 begin_class_definition (tree t, tree attributes)
2376 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2377 return error_mark_node;
2379 if (processing_template_parmlist)
2381 error ("definition of %q#T inside template parameter list", t);
2382 return error_mark_node;
2385 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2386 are passed the same as decimal scalar types. */
2387 if (TREE_CODE (t) == RECORD_TYPE
2388 && !processing_template_decl)
2390 tree ns = TYPE_CONTEXT (t);
2391 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2392 && DECL_CONTEXT (ns) == std_node
2394 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2396 const char *n = TYPE_NAME_STRING (t);
2397 if ((strcmp (n, "decimal32") == 0)
2398 || (strcmp (n, "decimal64") == 0)
2399 || (strcmp (n, "decimal128") == 0))
2400 TYPE_TRANSPARENT_AGGR (t) = 1;
2404 /* A non-implicit typename comes from code like:
2406 template <typename T> struct A {
2407 template <typename U> struct A<T>::B ...
2409 This is erroneous. */
2410 else if (TREE_CODE (t) == TYPENAME_TYPE)
2412 error ("invalid definition of qualified type %qT", t);
2413 t = error_mark_node;
2416 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2418 t = make_class_type (RECORD_TYPE);
2419 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2422 if (TYPE_BEING_DEFINED (t))
2424 t = make_class_type (TREE_CODE (t));
2425 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2427 maybe_process_partial_specialization (t);
2429 TYPE_BEING_DEFINED (t) = 1;
2431 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2432 fixup_attribute_variants (t);
2434 if (flag_pack_struct)
2437 TYPE_PACKED (t) = 1;
2438 /* Even though the type is being defined for the first time
2439 here, there might have been a forward declaration, so there
2440 might be cv-qualified variants of T. */
2441 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2442 TYPE_PACKED (v) = 1;
2444 /* Reset the interface data, at the earliest possible
2445 moment, as it might have been set via a class foo;
2447 if (! TYPE_ANONYMOUS_P (t))
2449 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2450 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2451 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2452 (t, finfo->interface_unknown);
2454 reset_specialization();
2456 /* Make a declaration for this class in its own scope. */
2457 build_self_reference ();
2462 /* Finish the member declaration given by DECL. */
2465 finish_member_declaration (tree decl)
2467 if (decl == error_mark_node || decl == NULL_TREE)
2470 if (decl == void_type_node)
2471 /* The COMPONENT was a friend, not a member, and so there's
2472 nothing for us to do. */
2475 /* We should see only one DECL at a time. */
2476 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2478 /* Set up access control for DECL. */
2480 = (current_access_specifier == access_private_node);
2481 TREE_PROTECTED (decl)
2482 = (current_access_specifier == access_protected_node);
2483 if (TREE_CODE (decl) == TEMPLATE_DECL)
2485 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2486 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2489 /* Mark the DECL as a member of the current class. */
2490 DECL_CONTEXT (decl) = current_class_type;
2492 /* Check for bare parameter packs in the member variable declaration. */
2493 if (TREE_CODE (decl) == FIELD_DECL)
2495 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2496 TREE_TYPE (decl) = error_mark_node;
2497 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2498 DECL_ATTRIBUTES (decl) = NULL_TREE;
2503 A C language linkage is ignored for the names of class members
2504 and the member function type of class member functions. */
2505 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2506 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2508 /* Put functions on the TYPE_METHODS list and everything else on the
2509 TYPE_FIELDS list. Note that these are built up in reverse order.
2510 We reverse them (to obtain declaration order) in finish_struct. */
2511 if (TREE_CODE (decl) == FUNCTION_DECL
2512 || DECL_FUNCTION_TEMPLATE_P (decl))
2514 /* We also need to add this function to the
2515 CLASSTYPE_METHOD_VEC. */
2516 if (add_method (current_class_type, decl, NULL_TREE))
2518 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2519 TYPE_METHODS (current_class_type) = decl;
2521 maybe_add_class_template_decl_list (current_class_type, decl,
2525 /* Enter the DECL into the scope of the class. */
2526 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2527 || pushdecl_class_level (decl))
2529 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2530 go at the beginning. The reason is that lookup_field_1
2531 searches the list in order, and we want a field name to
2532 override a type name so that the "struct stat hack" will
2533 work. In particular:
2535 struct S { enum E { }; int E } s;
2538 is valid. In addition, the FIELD_DECLs must be maintained in
2539 declaration order so that class layout works as expected.
2540 However, we don't need that order until class layout, so we
2541 save a little time by putting FIELD_DECLs on in reverse order
2542 here, and then reversing them in finish_struct_1. (We could
2543 also keep a pointer to the correct insertion points in the
2546 if (TREE_CODE (decl) == TYPE_DECL)
2547 TYPE_FIELDS (current_class_type)
2548 = chainon (TYPE_FIELDS (current_class_type), decl);
2551 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2552 TYPE_FIELDS (current_class_type) = decl;
2555 maybe_add_class_template_decl_list (current_class_type, decl,
2560 note_decl_for_pch (decl);
2563 /* DECL has been declared while we are building a PCH file. Perform
2564 actions that we might normally undertake lazily, but which can be
2565 performed now so that they do not have to be performed in
2566 translation units which include the PCH file. */
2569 note_decl_for_pch (tree decl)
2571 gcc_assert (pch_file);
2573 /* There's a good chance that we'll have to mangle names at some
2574 point, even if only for emission in debugging information. */
2575 if ((TREE_CODE (decl) == VAR_DECL
2576 || TREE_CODE (decl) == FUNCTION_DECL)
2577 && !processing_template_decl)
2581 /* Finish processing a complete template declaration. The PARMS are
2582 the template parameters. */
2585 finish_template_decl (tree parms)
2588 end_template_decl ();
2590 end_specialization ();
2593 /* Finish processing a template-id (which names a type) of the form
2594 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2595 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2596 the scope of template-id indicated. */
2599 finish_template_type (tree name, tree args, int entering_scope)
2603 decl = lookup_template_class (name, args,
2604 NULL_TREE, NULL_TREE, entering_scope,
2605 tf_warning_or_error | tf_user);
2606 if (decl != error_mark_node)
2607 decl = TYPE_STUB_DECL (decl);
2612 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2613 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2614 BASE_CLASS, or NULL_TREE if an error occurred. The
2615 ACCESS_SPECIFIER is one of
2616 access_{default,public,protected_private}_node. For a virtual base
2617 we set TREE_TYPE. */
2620 finish_base_specifier (tree base, tree access, bool virtual_p)
2624 if (base == error_mark_node)
2626 error ("invalid base-class specification");
2629 else if (! MAYBE_CLASS_TYPE_P (base))
2631 error ("%qT is not a class type", base);
2636 if (cp_type_quals (base) != 0)
2638 error ("base class %qT has cv qualifiers", base);
2639 base = TYPE_MAIN_VARIANT (base);
2641 result = build_tree_list (access, base);
2643 TREE_TYPE (result) = integer_type_node;
2649 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2650 what we found when we tried to do the lookup.
2651 LOCATION is the location of the NAME identifier;
2652 The location is used in the error message*/
2655 qualified_name_lookup_error (tree scope, tree name,
2656 tree decl, location_t location)
2658 if (scope == error_mark_node)
2659 ; /* We already complained. */
2660 else if (TYPE_P (scope))
2662 if (!COMPLETE_TYPE_P (scope))
2663 error_at (location, "incomplete type %qT used in nested name specifier",
2665 else if (TREE_CODE (decl) == TREE_LIST)
2667 error_at (location, "reference to %<%T::%D%> is ambiguous",
2669 print_candidates (decl);
2672 error_at (location, "%qD is not a member of %qT", name, scope);
2674 else if (scope != global_namespace)
2675 error_at (location, "%qD is not a member of %qD", name, scope);
2677 error_at (location, "%<::%D%> has not been declared", name);
2680 /* If FNS is a member function, a set of member functions, or a
2681 template-id referring to one or more member functions, return a
2682 BASELINK for FNS, incorporating the current access context.
2683 Otherwise, return FNS unchanged. */
2686 baselink_for_fns (tree fns)
2691 if (BASELINK_P (fns)
2692 || error_operand_p (fns))
2696 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2697 fn = TREE_OPERAND (fn, 0);
2698 fn = get_first_fn (fn);
2699 if (!DECL_FUNCTION_MEMBER_P (fn))
2702 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2704 cl = DECL_CONTEXT (fn);
2705 cl = TYPE_BINFO (cl);
2706 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2709 /* Returns true iff DECL is an automatic variable from a function outside
2713 outer_automatic_var_p (tree decl)
2715 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2716 && DECL_FUNCTION_SCOPE_P (decl)
2717 && !TREE_STATIC (decl)
2718 && DECL_CONTEXT (decl) != current_function_decl);
2721 /* Returns true iff DECL is a capture field from a lambda that is not our
2722 immediate context. */
2725 outer_lambda_capture_p (tree decl)
2727 return (TREE_CODE (decl) == FIELD_DECL
2728 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2729 && (!current_class_type
2730 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2733 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2734 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2735 if non-NULL, is the type or namespace used to explicitly qualify
2736 ID_EXPRESSION. DECL is the entity to which that name has been
2739 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2740 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2741 be set to true if this expression isn't permitted in a
2742 constant-expression, but it is otherwise not set by this function.
2743 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2744 constant-expression, but a non-constant expression is also
2747 DONE is true if this expression is a complete postfix-expression;
2748 it is false if this expression is followed by '->', '[', '(', etc.
2749 ADDRESS_P is true iff this expression is the operand of '&'.
2750 TEMPLATE_P is true iff the qualified-id was of the form
2751 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2752 appears as a template argument.
2754 If an error occurs, and it is the kind of error that might cause
2755 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2756 is the caller's responsibility to issue the message. *ERROR_MSG
2757 will be a string with static storage duration, so the caller need
2760 Return an expression for the entity, after issuing appropriate
2761 diagnostics. This function is also responsible for transforming a
2762 reference to a non-static member into a COMPONENT_REF that makes
2763 the use of "this" explicit.
2765 Upon return, *IDK will be filled in appropriately. */
2767 finish_id_expression (tree id_expression,
2771 bool integral_constant_expression_p,
2772 bool allow_non_integral_constant_expression_p,
2773 bool *non_integral_constant_expression_p,
2777 bool template_arg_p,
2778 const char **error_msg,
2779 location_t location)
2781 /* Initialize the output parameters. */
2782 *idk = CP_ID_KIND_NONE;
2785 if (id_expression == error_mark_node)
2786 return error_mark_node;
2787 /* If we have a template-id, then no further lookup is
2788 required. If the template-id was for a template-class, we
2789 will sometimes have a TYPE_DECL at this point. */
2790 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2791 || TREE_CODE (decl) == TYPE_DECL)
2793 /* Look up the name. */
2796 if (decl == error_mark_node)
2798 /* Name lookup failed. */
2801 || (!dependent_type_p (scope)
2802 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2803 && IDENTIFIER_TYPENAME_P (id_expression)
2804 && dependent_type_p (TREE_TYPE (id_expression))))))
2806 /* If the qualifying type is non-dependent (and the name
2807 does not name a conversion operator to a dependent
2808 type), issue an error. */
2809 qualified_name_lookup_error (scope, id_expression, decl, location);
2810 return error_mark_node;
2814 /* It may be resolved via Koenig lookup. */
2815 *idk = CP_ID_KIND_UNQUALIFIED;
2816 return id_expression;
2819 decl = id_expression;
2821 /* If DECL is a variable that would be out of scope under
2822 ANSI/ISO rules, but in scope in the ARM, name lookup
2823 will succeed. Issue a diagnostic here. */
2825 decl = check_for_out_of_scope_variable (decl);
2827 /* Remember that the name was used in the definition of
2828 the current class so that we can check later to see if
2829 the meaning would have been different after the class
2830 was entirely defined. */
2831 if (!scope && decl != error_mark_node)
2832 maybe_note_name_used_in_class (id_expression, decl);
2834 /* Disallow uses of local variables from containing functions, except
2835 within lambda-expressions. */
2836 if ((outer_automatic_var_p (decl)
2837 || outer_lambda_capture_p (decl))
2838 /* It's not a use (3.2) if we're in an unevaluated context. */
2839 && !cp_unevaluated_operand)
2841 tree context = DECL_CONTEXT (decl);
2842 tree containing_function = current_function_decl;
2843 tree lambda_stack = NULL_TREE;
2844 tree lambda_expr = NULL_TREE;
2845 tree initializer = decl;
2847 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2848 support for an approach in which a reference to a local
2849 [constant] automatic variable in a nested class or lambda body
2850 would enter the expression as an rvalue, which would reduce
2851 the complexity of the problem"
2853 FIXME update for final resolution of core issue 696. */
2854 if (decl_constant_var_p (decl))
2855 return integral_constant_value (decl);
2857 if (TYPE_P (context))
2859 /* Implicit capture of an explicit capture. */
2860 context = lambda_function (context);
2861 initializer = thisify_lambda_field (decl);
2864 /* If we are in a lambda function, we can move out until we hit
2866 2. a non-lambda function, or
2867 3. a non-default capturing lambda function. */
2868 while (context != containing_function
2869 && LAMBDA_FUNCTION_P (containing_function))
2871 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2872 (DECL_CONTEXT (containing_function));
2874 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2878 lambda_stack = tree_cons (NULL_TREE,
2883 = decl_function_context (containing_function);
2886 if (context == containing_function)
2888 decl = add_default_capture (lambda_stack,
2889 /*id=*/DECL_NAME (decl),
2892 else if (lambda_expr)
2894 error ("%qD is not captured", decl);
2895 return error_mark_node;
2899 error (TREE_CODE (decl) == VAR_DECL
2900 ? "use of %<auto%> variable from containing function"
2901 : "use of parameter from containing function");
2902 error (" %q+#D declared here", decl);
2903 return error_mark_node;
2907 /* Also disallow uses of function parameters outside the function
2908 body, except inside an unevaluated context (i.e. decltype). */
2909 if (TREE_CODE (decl) == PARM_DECL
2910 && DECL_CONTEXT (decl) == NULL_TREE
2911 && !cp_unevaluated_operand)
2913 error ("use of parameter %qD outside function body", decl);
2914 return error_mark_node;
2918 /* If we didn't find anything, or what we found was a type,
2919 then this wasn't really an id-expression. */
2920 if (TREE_CODE (decl) == TEMPLATE_DECL
2921 && !DECL_FUNCTION_TEMPLATE_P (decl))
2923 *error_msg = "missing template arguments";
2924 return error_mark_node;
2926 else if (TREE_CODE (decl) == TYPE_DECL
2927 || TREE_CODE (decl) == NAMESPACE_DECL)
2929 *error_msg = "expected primary-expression";
2930 return error_mark_node;
2933 /* If the name resolved to a template parameter, there is no
2934 need to look it up again later. */
2935 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2936 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2940 *idk = CP_ID_KIND_NONE;
2941 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2942 decl = TEMPLATE_PARM_DECL (decl);
2943 r = convert_from_reference (DECL_INITIAL (decl));
2945 if (integral_constant_expression_p
2946 && !dependent_type_p (TREE_TYPE (decl))
2947 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2949 if (!allow_non_integral_constant_expression_p)
2950 error ("template parameter %qD of type %qT is not allowed in "
2951 "an integral constant expression because it is not of "
2952 "integral or enumeration type", decl, TREE_TYPE (decl));
2953 *non_integral_constant_expression_p = true;
2957 /* Similarly, we resolve enumeration constants to their
2958 underlying values. */
2959 else if (TREE_CODE (decl) == CONST_DECL)
2961 *idk = CP_ID_KIND_NONE;
2962 if (!processing_template_decl)
2964 used_types_insert (TREE_TYPE (decl));
2965 return DECL_INITIAL (decl);
2973 /* If the declaration was explicitly qualified indicate
2974 that. The semantics of `A::f(3)' are different than
2975 `f(3)' if `f' is virtual. */
2977 ? CP_ID_KIND_QUALIFIED
2978 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2979 ? CP_ID_KIND_TEMPLATE_ID
2980 : CP_ID_KIND_UNQUALIFIED));
2985 An id-expression is type-dependent if it contains an
2986 identifier that was declared with a dependent type.
2988 The standard is not very specific about an id-expression that
2989 names a set of overloaded functions. What if some of them
2990 have dependent types and some of them do not? Presumably,
2991 such a name should be treated as a dependent name. */
2992 /* Assume the name is not dependent. */
2993 dependent_p = false;
2994 if (!processing_template_decl)
2995 /* No names are dependent outside a template. */
2997 /* A template-id where the name of the template was not resolved
2998 is definitely dependent. */
2999 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3000 && (TREE_CODE (TREE_OPERAND (decl, 0))
3001 == IDENTIFIER_NODE))
3003 /* For anything except an overloaded function, just check its
3005 else if (!is_overloaded_fn (decl))
3007 = dependent_type_p (TREE_TYPE (decl));
3008 /* For a set of overloaded functions, check each of the
3014 if (BASELINK_P (fns))
3015 fns = BASELINK_FUNCTIONS (fns);
3017 /* For a template-id, check to see if the template
3018 arguments are dependent. */
3019 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3021 tree args = TREE_OPERAND (fns, 1);
3022 dependent_p = any_dependent_template_arguments_p (args);
3023 /* The functions are those referred to by the
3025 fns = TREE_OPERAND (fns, 0);
3028 /* If there are no dependent template arguments, go through
3029 the overloaded functions. */
3030 while (fns && !dependent_p)
3032 tree fn = OVL_CURRENT (fns);
3034 /* Member functions of dependent classes are
3036 if (TREE_CODE (fn) == FUNCTION_DECL
3037 && type_dependent_expression_p (fn))
3039 else if (TREE_CODE (fn) == TEMPLATE_DECL
3040 && dependent_template_p (fn))
3043 fns = OVL_NEXT (fns);
3047 /* If the name was dependent on a template parameter, we will
3048 resolve the name at instantiation time. */
3051 /* Create a SCOPE_REF for qualified names, if the scope is
3057 if (address_p && done)
3058 decl = finish_qualified_id_expr (scope, decl,
3064 tree type = NULL_TREE;
3065 if (DECL_P (decl) && !dependent_scope_p (scope))
3066 type = TREE_TYPE (decl);
3067 decl = build_qualified_name (type,
3073 if (TREE_TYPE (decl))
3074 decl = convert_from_reference (decl);
3077 /* A TEMPLATE_ID already contains all the information we
3079 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3080 return id_expression;
3081 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3082 /* If we found a variable, then name lookup during the
3083 instantiation will always resolve to the same VAR_DECL
3084 (or an instantiation thereof). */
3085 if (TREE_CODE (decl) == VAR_DECL
3086 || TREE_CODE (decl) == PARM_DECL)
3087 return convert_from_reference (decl);
3088 /* The same is true for FIELD_DECL, but we also need to
3089 make sure that the syntax is correct. */
3090 else if (TREE_CODE (decl) == FIELD_DECL)
3092 /* Since SCOPE is NULL here, this is an unqualified name.
3093 Access checking has been performed during name lookup
3094 already. Turn off checking to avoid duplicate errors. */
3095 push_deferring_access_checks (dk_no_check);
3096 decl = finish_non_static_data_member
3098 /*qualifying_scope=*/NULL_TREE);
3099 pop_deferring_access_checks ();
3102 return id_expression;
3105 if (TREE_CODE (decl) == NAMESPACE_DECL)
3107 error ("use of namespace %qD as expression", decl);
3108 return error_mark_node;
3110 else if (DECL_CLASS_TEMPLATE_P (decl))
3112 error ("use of class template %qT as expression", decl);
3113 return error_mark_node;
3115 else if (TREE_CODE (decl) == TREE_LIST)
3117 /* Ambiguous reference to base members. */
3118 error ("request for member %qD is ambiguous in "
3119 "multiple inheritance lattice", id_expression);
3120 print_candidates (decl);
3121 return error_mark_node;
3124 /* Mark variable-like entities as used. Functions are similarly
3125 marked either below or after overload resolution. */
3126 if (TREE_CODE (decl) == VAR_DECL
3127 || TREE_CODE (decl) == PARM_DECL
3128 || TREE_CODE (decl) == RESULT_DECL)
3131 /* Only certain kinds of names are allowed in constant
3132 expression. Enumerators and template parameters have already
3133 been handled above. */
3134 if (integral_constant_expression_p
3135 && ! decl_constant_var_p (decl)
3136 && ! builtin_valid_in_constant_expr_p (decl))
3138 if (!allow_non_integral_constant_expression_p)
3140 error ("%qD cannot appear in a constant-expression", decl);
3141 return error_mark_node;
3143 *non_integral_constant_expression_p = true;
3148 decl = (adjust_result_of_qualified_name_lookup
3149 (decl, scope, current_class_type));
3151 if (TREE_CODE (decl) == FUNCTION_DECL)
3154 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3155 decl = finish_qualified_id_expr (scope,
3163 tree r = convert_from_reference (decl);
3165 /* In a template, return a SCOPE_REF for most qualified-ids
3166 so that we can check access at instantiation time. But if
3167 we're looking at a member of the current instantiation, we
3168 know we have access and building up the SCOPE_REF confuses
3169 non-type template argument handling. */
3170 if (processing_template_decl && TYPE_P (scope)
3171 && !currently_open_class (scope))
3172 r = build_qualified_name (TREE_TYPE (r),
3178 else if (TREE_CODE (decl) == FIELD_DECL)
3180 /* Since SCOPE is NULL here, this is an unqualified name.
3181 Access checking has been performed during name lookup
3182 already. Turn off checking to avoid duplicate errors. */
3183 push_deferring_access_checks (dk_no_check);
3184 decl = finish_non_static_data_member (decl, NULL_TREE,
3185 /*qualifying_scope=*/NULL_TREE);
3186 pop_deferring_access_checks ();
3188 else if (is_overloaded_fn (decl))
3192 first_fn = get_first_fn (decl);
3193 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3194 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3196 if (!really_overloaded_fn (decl))
3197 mark_used (first_fn);
3200 && TREE_CODE (first_fn) == FUNCTION_DECL
3201 && DECL_FUNCTION_MEMBER_P (first_fn)
3202 && !shared_member_p (decl))
3204 /* A set of member functions. */
3205 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3206 return finish_class_member_access_expr (decl, id_expression,
3207 /*template_p=*/false,
3208 tf_warning_or_error);
3211 decl = baselink_for_fns (decl);
3215 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3216 && DECL_CLASS_SCOPE_P (decl))
3218 tree context = context_for_name_lookup (decl);
3219 if (context != current_class_type)
3221 tree path = currently_open_derived_class (context);
3222 perform_or_defer_access_check (TYPE_BINFO (path),
3227 decl = convert_from_reference (decl);
3231 if (TREE_DEPRECATED (decl))
3232 warn_deprecated_use (decl, NULL_TREE);
3237 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3238 use as a type-specifier. */
3241 finish_typeof (tree expr)
3245 if (type_dependent_expression_p (expr))
3247 type = cxx_make_type (TYPEOF_TYPE);
3248 TYPEOF_TYPE_EXPR (type) = expr;
3249 SET_TYPE_STRUCTURAL_EQUALITY (type);
3254 expr = mark_type_use (expr);
3256 type = unlowered_expr_type (expr);
3258 if (!type || type == unknown_type_node)
3260 error ("type of %qE is unknown", expr);
3261 return error_mark_node;
3267 /* Perform C++-specific checks for __builtin_offsetof before calling
3271 finish_offsetof (tree expr)
3273 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3275 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3276 TREE_OPERAND (expr, 2));
3277 return error_mark_node;
3279 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3280 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3281 || TREE_TYPE (expr) == unknown_type_node)
3283 if (TREE_CODE (expr) == COMPONENT_REF
3284 || TREE_CODE (expr) == COMPOUND_EXPR)
3285 expr = TREE_OPERAND (expr, 1);
3286 error ("cannot apply %<offsetof%> to member function %qD", expr);
3287 return error_mark_node;
3289 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3290 expr = TREE_OPERAND (expr, 0);
3291 return fold_offsetof (expr, NULL_TREE);
3294 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3295 function is broken out from the above for the benefit of the tree-ssa
3299 simplify_aggr_init_expr (tree *tp)
3301 tree aggr_init_expr = *tp;
3303 /* Form an appropriate CALL_EXPR. */
3304 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3305 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3306 tree type = TREE_TYPE (slot);
3309 enum style_t { ctor, arg, pcc } style;
3311 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3313 #ifdef PCC_STATIC_STRUCT_RETURN
3319 gcc_assert (TREE_ADDRESSABLE (type));
3323 call_expr = build_call_array_loc (input_location,
3324 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3326 aggr_init_expr_nargs (aggr_init_expr),
3327 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3328 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3332 /* Replace the first argument to the ctor with the address of the
3334 cxx_mark_addressable (slot);
3335 CALL_EXPR_ARG (call_expr, 0) =
3336 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3338 else if (style == arg)
3340 /* Just mark it addressable here, and leave the rest to
3341 expand_call{,_inline}. */
3342 cxx_mark_addressable (slot);
3343 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3344 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3346 else if (style == pcc)
3348 /* If we're using the non-reentrant PCC calling convention, then we
3349 need to copy the returned value out of the static buffer into the
3351 push_deferring_access_checks (dk_no_check);
3352 call_expr = build_aggr_init (slot, call_expr,
3353 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3354 tf_warning_or_error);
3355 pop_deferring_access_checks ();
3356 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3359 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3361 tree init = build_zero_init (type, NULL_TREE,
3362 /*static_storage_p=*/false);
3363 init = build2 (INIT_EXPR, void_type_node, slot, init);
3364 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3371 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3374 emit_associated_thunks (tree fn)
3376 /* When we use vcall offsets, we emit thunks with the virtual
3377 functions to which they thunk. The whole point of vcall offsets
3378 is so that you can know statically the entire set of thunks that
3379 will ever be needed for a given virtual function, thereby
3380 enabling you to output all the thunks with the function itself. */
3381 if (DECL_VIRTUAL_P (fn)
3382 /* Do not emit thunks for extern template instantiations. */
3383 && ! DECL_REALLY_EXTERN (fn))
3387 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3389 if (!THUNK_ALIAS (thunk))
3391 use_thunk (thunk, /*emit_p=*/1);
3392 if (DECL_RESULT_THUNK_P (thunk))
3396 for (probe = DECL_THUNKS (thunk);
3397 probe; probe = DECL_CHAIN (probe))
3398 use_thunk (probe, /*emit_p=*/1);
3402 gcc_assert (!DECL_THUNKS (thunk));
3407 /* Generate RTL for FN. */
3410 expand_or_defer_fn_1 (tree fn)
3412 /* When the parser calls us after finishing the body of a template
3413 function, we don't really want to expand the body. */
3414 if (processing_template_decl)
3416 /* Normally, collection only occurs in rest_of_compilation. So,
3417 if we don't collect here, we never collect junk generated
3418 during the processing of templates until we hit a
3419 non-template function. It's not safe to do this inside a
3420 nested class, though, as the parser may have local state that
3421 is not a GC root. */
3422 if (!function_depth)
3427 gcc_assert (DECL_SAVED_TREE (fn));
3429 /* If this is a constructor or destructor body, we have to clone
3431 if (maybe_clone_body (fn))
3433 /* We don't want to process FN again, so pretend we've written
3434 it out, even though we haven't. */
3435 TREE_ASM_WRITTEN (fn) = 1;
3436 DECL_SAVED_TREE (fn) = NULL_TREE;
3440 /* We make a decision about linkage for these functions at the end
3441 of the compilation. Until that point, we do not want the back
3442 end to output them -- but we do want it to see the bodies of
3443 these functions so that it can inline them as appropriate. */
3444 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3446 if (DECL_INTERFACE_KNOWN (fn))
3447 /* We've already made a decision as to how this function will
3451 DECL_EXTERNAL (fn) = 1;
3452 DECL_NOT_REALLY_EXTERN (fn) = 1;
3453 note_vague_linkage_fn (fn);
3454 /* A non-template inline function with external linkage will
3455 always be COMDAT. As we must eventually determine the
3456 linkage of all functions, and as that causes writes to
3457 the data mapped in from the PCH file, it's advantageous
3458 to mark the functions at this point. */
3459 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3461 /* This function must have external linkage, as
3462 otherwise DECL_INTERFACE_KNOWN would have been
3464 gcc_assert (TREE_PUBLIC (fn));
3465 comdat_linkage (fn);
3466 DECL_INTERFACE_KNOWN (fn) = 1;
3470 import_export_decl (fn);
3472 /* If the user wants us to keep all inline functions, then mark
3473 this function as needed so that finish_file will make sure to
3474 output it later. Similarly, all dllexport'd functions must
3475 be emitted; there may be callers in other DLLs. */
3476 if ((flag_keep_inline_functions
3477 && DECL_DECLARED_INLINE_P (fn)
3478 && !DECL_REALLY_EXTERN (fn))
3479 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3483 /* There's no reason to do any of the work here if we're only doing
3484 semantic analysis; this code just generates RTL. */
3485 if (flag_syntax_only)
3492 expand_or_defer_fn (tree fn)
3494 if (expand_or_defer_fn_1 (fn))
3498 /* Expand or defer, at the whim of the compilation unit manager. */
3499 cgraph_finalize_function (fn, function_depth > 1);
3500 emit_associated_thunks (fn);
3513 /* Helper function for walk_tree, used by finalize_nrv below. */
3516 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3518 struct nrv_data *dp = (struct nrv_data *)data;
3521 /* No need to walk into types. There wouldn't be any need to walk into
3522 non-statements, except that we have to consider STMT_EXPRs. */
3525 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3526 but differs from using NULL_TREE in that it indicates that we care
3527 about the value of the RESULT_DECL. */
3528 else if (TREE_CODE (*tp) == RETURN_EXPR)
3529 TREE_OPERAND (*tp, 0) = dp->result;
3530 /* Change all cleanups for the NRV to only run when an exception is
3532 else if (TREE_CODE (*tp) == CLEANUP_STMT
3533 && CLEANUP_DECL (*tp) == dp->var)
3534 CLEANUP_EH_ONLY (*tp) = 1;
3535 /* Replace the DECL_EXPR for the NRV with an initialization of the
3536 RESULT_DECL, if needed. */
3537 else if (TREE_CODE (*tp) == DECL_EXPR
3538 && DECL_EXPR_DECL (*tp) == dp->var)
3541 if (DECL_INITIAL (dp->var)
3542 && DECL_INITIAL (dp->var) != error_mark_node)
3543 init = build2 (INIT_EXPR, void_type_node, dp->result,
3544 DECL_INITIAL (dp->var));
3546 init = build_empty_stmt (EXPR_LOCATION (*tp));
3547 DECL_INITIAL (dp->var) = NULL_TREE;
3548 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3551 /* And replace all uses of the NRV with the RESULT_DECL. */
3552 else if (*tp == dp->var)
3555 /* Avoid walking into the same tree more than once. Unfortunately, we
3556 can't just use walk_tree_without duplicates because it would only call
3557 us for the first occurrence of dp->var in the function body. */
3558 slot = htab_find_slot (dp->visited, *tp, INSERT);
3564 /* Keep iterating. */
3568 /* Called from finish_function to implement the named return value
3569 optimization by overriding all the RETURN_EXPRs and pertinent
3570 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3571 RESULT_DECL for the function. */
3574 finalize_nrv (tree *tp, tree var, tree result)
3576 struct nrv_data data;
3578 /* Copy name from VAR to RESULT. */
3579 DECL_NAME (result) = DECL_NAME (var);
3580 /* Don't forget that we take its address. */
3581 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3582 /* Finally set DECL_VALUE_EXPR to avoid assigning
3583 a stack slot at -O0 for the original var and debug info
3584 uses RESULT location for VAR. */
3585 SET_DECL_VALUE_EXPR (var, result);
3586 DECL_HAS_VALUE_EXPR_P (var) = 1;
3589 data.result = result;
3590 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3591 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3592 htab_delete (data.visited);
3595 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3598 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3599 bool need_copy_ctor, bool need_copy_assignment)
3601 int save_errorcount = errorcount;
3604 /* Always allocate 3 elements for simplicity. These are the
3605 function decls for the ctor, dtor, and assignment op.
3606 This layout is known to the three lang hooks,
3607 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3608 and cxx_omp_clause_assign_op. */
3609 info = make_tree_vec (3);
3610 CP_OMP_CLAUSE_INFO (c) = info;
3612 if (need_default_ctor || need_copy_ctor)
3614 if (need_default_ctor)
3615 t = get_default_ctor (type);
3617 t = get_copy_ctor (type);
3619 if (t && !trivial_fn_p (t))
3620 TREE_VEC_ELT (info, 0) = t;
3623 if ((need_default_ctor || need_copy_ctor)
3624 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3625 TREE_VEC_ELT (info, 1) = get_dtor (type);
3627 if (need_copy_assignment)
3629 t = get_copy_assign (type);
3631 if (t && !trivial_fn_p (t))
3632 TREE_VEC_ELT (info, 2) = t;
3635 return errorcount != save_errorcount;
3638 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3639 Remove any elements from the list that are invalid. */
3642 finish_omp_clauses (tree clauses)
3644 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3645 tree c, t, *pc = &clauses;
3648 bitmap_obstack_initialize (NULL);
3649 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3650 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3651 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3653 for (pc = &clauses, c = clauses; c ; c = *pc)
3655 bool remove = false;
3657 switch (OMP_CLAUSE_CODE (c))
3659 case OMP_CLAUSE_SHARED:
3661 goto check_dup_generic;
3662 case OMP_CLAUSE_PRIVATE:
3664 goto check_dup_generic;
3665 case OMP_CLAUSE_REDUCTION:
3667 goto check_dup_generic;
3668 case OMP_CLAUSE_COPYPRIVATE:
3669 name = "copyprivate";
3670 goto check_dup_generic;
3671 case OMP_CLAUSE_COPYIN:
3673 goto check_dup_generic;
3675 t = OMP_CLAUSE_DECL (c);
3676 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3678 if (processing_template_decl)
3681 error ("%qD is not a variable in clause %qs", t, name);
3683 error ("%qE is not a variable in clause %qs", t, name);
3686 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3687 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3688 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3690 error ("%qD appears more than once in data clauses", t);
3694 bitmap_set_bit (&generic_head, DECL_UID (t));
3697 case OMP_CLAUSE_FIRSTPRIVATE:
3698 t = OMP_CLAUSE_DECL (c);
3699 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3701 if (processing_template_decl)
3704 error ("%qD is not a variable in clause %<firstprivate%>", t);
3706 error ("%qE is not a variable in clause %<firstprivate%>", t);
3709 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3710 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3712 error ("%qD appears more than once in data clauses", t);
3716 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3719 case OMP_CLAUSE_LASTPRIVATE:
3720 t = OMP_CLAUSE_DECL (c);
3721 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3723 if (processing_template_decl)
3726 error ("%qD is not a variable in clause %<lastprivate%>", t);
3728 error ("%qE is not a variable in clause %<lastprivate%>", t);
3731 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3732 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3734 error ("%qD appears more than once in data clauses", t);
3738 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3742 t = OMP_CLAUSE_IF_EXPR (c);
3743 t = maybe_convert_cond (t);
3744 if (t == error_mark_node)
3746 OMP_CLAUSE_IF_EXPR (c) = t;
3749 case OMP_CLAUSE_NUM_THREADS:
3750 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3751 if (t == error_mark_node)
3753 else if (!type_dependent_expression_p (t)
3754 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3756 error ("num_threads expression must be integral");
3761 case OMP_CLAUSE_SCHEDULE:
3762 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3765 else if (t == error_mark_node)
3767 else if (!type_dependent_expression_p (t)
3768 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3770 error ("schedule chunk size expression must be integral");
3775 case OMP_CLAUSE_NOWAIT:
3776 case OMP_CLAUSE_ORDERED:
3777 case OMP_CLAUSE_DEFAULT:
3778 case OMP_CLAUSE_UNTIED:
3779 case OMP_CLAUSE_COLLAPSE:
3787 *pc = OMP_CLAUSE_CHAIN (c);
3789 pc = &OMP_CLAUSE_CHAIN (c);
3792 for (pc = &clauses, c = clauses; c ; c = *pc)
3794 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3795 bool remove = false;
3796 bool need_complete_non_reference = false;
3797 bool need_default_ctor = false;
3798 bool need_copy_ctor = false;
3799 bool need_copy_assignment = false;
3800 bool need_implicitly_determined = false;
3801 tree type, inner_type;
3805 case OMP_CLAUSE_SHARED:
3807 need_implicitly_determined = true;
3809 case OMP_CLAUSE_PRIVATE:
3811 need_complete_non_reference = true;
3812 need_default_ctor = true;
3813 need_implicitly_determined = true;
3815 case OMP_CLAUSE_FIRSTPRIVATE:
3816 name = "firstprivate";
3817 need_complete_non_reference = true;
3818 need_copy_ctor = true;
3819 need_implicitly_determined = true;
3821 case OMP_CLAUSE_LASTPRIVATE:
3822 name = "lastprivate";
3823 need_complete_non_reference = true;
3824 need_copy_assignment = true;
3825 need_implicitly_determined = true;
3827 case OMP_CLAUSE_REDUCTION:
3829 need_implicitly_determined = true;
3831 case OMP_CLAUSE_COPYPRIVATE:
3832 name = "copyprivate";
3833 need_copy_assignment = true;
3835 case OMP_CLAUSE_COPYIN:
3837 need_copy_assignment = true;
3840 pc = &OMP_CLAUSE_CHAIN (c);
3844 t = OMP_CLAUSE_DECL (c);
3845 if (processing_template_decl
3846 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3848 pc = &OMP_CLAUSE_CHAIN (c);
3854 case OMP_CLAUSE_LASTPRIVATE:
3855 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3856 need_default_ctor = true;
3859 case OMP_CLAUSE_REDUCTION:
3860 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3861 || POINTER_TYPE_P (TREE_TYPE (t)))
3863 error ("%qE has invalid type for %<reduction%>", t);
3866 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3868 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3876 error ("%qE has invalid type for %<reduction(%s)%>",
3877 t, operator_name_info[r_code].name);
3883 case OMP_CLAUSE_COPYIN:
3884 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3886 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3895 if (need_complete_non_reference)
3897 t = require_complete_type (t);
3898 if (t == error_mark_node)
3900 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3902 error ("%qE has reference type for %qs", t, name);
3906 if (need_implicitly_determined)
3908 const char *share_name = NULL;
3910 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3911 share_name = "threadprivate";
3912 else switch (cxx_omp_predetermined_sharing (t))
3914 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3916 case OMP_CLAUSE_DEFAULT_SHARED:
3917 share_name = "shared";
3919 case OMP_CLAUSE_DEFAULT_PRIVATE:
3920 share_name = "private";
3927 error ("%qE is predetermined %qs for %qs",
3928 t, share_name, name);
3933 /* We're interested in the base element, not arrays. */
3934 inner_type = type = TREE_TYPE (t);
3935 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3936 inner_type = TREE_TYPE (inner_type);
3938 /* Check for special function availability by building a call to one.
3939 Save the results, because later we won't be in the right context
3940 for making these queries. */
3941 if (CLASS_TYPE_P (inner_type)
3942 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3943 && !type_dependent_expression_p (t)
3944 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3945 need_copy_ctor, need_copy_assignment))
3949 *pc = OMP_CLAUSE_CHAIN (c);
3951 pc = &OMP_CLAUSE_CHAIN (c);
3954 bitmap_obstack_release (NULL);
3958 /* For all variables in the tree_list VARS, mark them as thread local. */
3961 finish_omp_threadprivate (tree vars)
3965 /* Mark every variable in VARS to be assigned thread local storage. */
3966 for (t = vars; t; t = TREE_CHAIN (t))
3968 tree v = TREE_PURPOSE (t);
3970 if (error_operand_p (v))
3972 else if (TREE_CODE (v) != VAR_DECL)
3973 error ("%<threadprivate%> %qD is not file, namespace "
3974 "or block scope variable", v);
3975 /* If V had already been marked threadprivate, it doesn't matter
3976 whether it had been used prior to this point. */
3977 else if (TREE_USED (v)
3978 && (DECL_LANG_SPECIFIC (v) == NULL
3979 || !CP_DECL_THREADPRIVATE_P (v)))
3980 error ("%qE declared %<threadprivate%> after first use", v);
3981 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3982 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3983 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3984 error ("%<threadprivate%> %qE has incomplete type", v);
3985 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3986 && CP_DECL_CONTEXT (v) != current_class_type)
3987 error ("%<threadprivate%> %qE directive not "
3988 "in %qT definition", v, CP_DECL_CONTEXT (v));
3991 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3992 if (DECL_LANG_SPECIFIC (v) == NULL)
3994 retrofit_lang_decl (v);
3996 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3997 after the allocation of the lang_decl structure. */
3998 if (DECL_DISCRIMINATOR_P (v))
3999 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4002 if (! DECL_THREAD_LOCAL_P (v))
4004 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4005 /* If rtl has been already set for this var, call
4006 make_decl_rtl once again, so that encode_section_info
4007 has a chance to look at the new decl flags. */
4008 if (DECL_RTL_SET_P (v))
4011 CP_DECL_THREADPRIVATE_P (v) = 1;
4016 /* Build an OpenMP structured block. */
4019 begin_omp_structured_block (void)
4021 return do_pushlevel (sk_omp);
4025 finish_omp_structured_block (tree block)
4027 return do_poplevel (block);
4030 /* Similarly, except force the retention of the BLOCK. */
4033 begin_omp_parallel (void)
4035 keep_next_level (true);
4036 return begin_omp_structured_block ();
4040 finish_omp_parallel (tree clauses, tree body)
4044 body = finish_omp_structured_block (body);
4046 stmt = make_node (OMP_PARALLEL);
4047 TREE_TYPE (stmt) = void_type_node;
4048 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4049 OMP_PARALLEL_BODY (stmt) = body;
4051 return add_stmt (stmt);
4055 begin_omp_task (void)
4057 keep_next_level (true);
4058 return begin_omp_structured_block ();
4062 finish_omp_task (tree clauses, tree body)
4066 body = finish_omp_structured_block (body);
4068 stmt = make_node (OMP_TASK);
4069 TREE_TYPE (stmt) = void_type_node;
4070 OMP_TASK_CLAUSES (stmt) = clauses;
4071 OMP_TASK_BODY (stmt) = body;
4073 return add_stmt (stmt);
4076 /* Helper function for finish_omp_for. Convert Ith random access iterator
4077 into integral iterator. Return FALSE if successful. */
4080 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4081 tree condv, tree incrv, tree *body,
4082 tree *pre_body, tree clauses)
4084 tree diff, iter_init, iter_incr = NULL, last;
4085 tree incr_var = NULL, orig_pre_body, orig_body, c;
4086 tree decl = TREE_VEC_ELT (declv, i);
4087 tree init = TREE_VEC_ELT (initv, i);
4088 tree cond = TREE_VEC_ELT (condv, i);
4089 tree incr = TREE_VEC_ELT (incrv, i);
4091 location_t elocus = locus;
4093 if (init && EXPR_HAS_LOCATION (init))
4094 elocus = EXPR_LOCATION (init);
4096 switch (TREE_CODE (cond))
4102 if (TREE_OPERAND (cond, 1) == iter)
4103 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4104 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4105 if (TREE_OPERAND (cond, 0) != iter)
4106 cond = error_mark_node;
4109 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4110 TREE_OPERAND (cond, 1), ERROR_MARK,
4111 NULL, tf_warning_or_error);
4112 if (error_operand_p (tem))
4117 cond = error_mark_node;
4120 if (cond == error_mark_node)
4122 error_at (elocus, "invalid controlling predicate");
4125 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4126 ERROR_MARK, iter, ERROR_MARK, NULL,
4127 tf_warning_or_error);
4128 if (error_operand_p (diff))
4130 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4132 error_at (elocus, "difference between %qE and %qD does not have integer type",
4133 TREE_OPERAND (cond, 1), iter);
4137 switch (TREE_CODE (incr))
4139 case PREINCREMENT_EXPR:
4140 case PREDECREMENT_EXPR:
4141 case POSTINCREMENT_EXPR:
4142 case POSTDECREMENT_EXPR:
4143 if (TREE_OPERAND (incr, 0) != iter)
4145 incr = error_mark_node;
4148 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4149 tf_warning_or_error);
4150 if (error_operand_p (iter_incr))
4152 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4153 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4154 incr = integer_one_node;
4156 incr = integer_minus_one_node;
4159 if (TREE_OPERAND (incr, 0) != iter)
4160 incr = error_mark_node;
4161 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4162 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4164 tree rhs = TREE_OPERAND (incr, 1);
4165 if (TREE_OPERAND (rhs, 0) == iter)
4167 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4169 incr = error_mark_node;
4172 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4173 TREE_OPERAND (rhs, 1),
4174 tf_warning_or_error);
4175 if (error_operand_p (iter_incr))
4177 incr = TREE_OPERAND (rhs, 1);
4178 incr = cp_convert (TREE_TYPE (diff), incr);
4179 if (TREE_CODE (rhs) == MINUS_EXPR)
4181 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4182 incr = fold_if_not_in_template (incr);
4184 if (TREE_CODE (incr) != INTEGER_CST
4185 && (TREE_CODE (incr) != NOP_EXPR
4186 || (TREE_CODE (TREE_OPERAND (incr, 0))
4191 else if (TREE_OPERAND (rhs, 1) == iter)
4193 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4194 || TREE_CODE (rhs) != PLUS_EXPR)
4195 incr = error_mark_node;
4198 iter_incr = build_x_binary_op (PLUS_EXPR,
4199 TREE_OPERAND (rhs, 0),
4202 tf_warning_or_error);
4203 if (error_operand_p (iter_incr))
4205 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4207 tf_warning_or_error);
4208 if (error_operand_p (iter_incr))
4210 incr = TREE_OPERAND (rhs, 0);
4215 incr = error_mark_node;
4218 incr = error_mark_node;
4221 incr = error_mark_node;
4225 if (incr == error_mark_node)
4227 error_at (elocus, "invalid increment expression");
4231 incr = cp_convert (TREE_TYPE (diff), incr);
4232 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4233 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4234 && OMP_CLAUSE_DECL (c) == iter)
4237 decl = create_temporary_var (TREE_TYPE (diff));
4239 add_decl_expr (decl);
4240 last = create_temporary_var (TREE_TYPE (diff));
4242 add_decl_expr (last);
4243 if (c && iter_incr == NULL)
4245 incr_var = create_temporary_var (TREE_TYPE (diff));
4246 pushdecl (incr_var);
4247 add_decl_expr (incr_var);
4249 gcc_assert (stmts_are_full_exprs_p ());
4251 orig_pre_body = *pre_body;
4252 *pre_body = push_stmt_list ();
4254 add_stmt (orig_pre_body);
4256 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4257 tf_warning_or_error));
4258 init = build_int_cst (TREE_TYPE (diff), 0);
4259 if (c && iter_incr == NULL)
4261 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4262 incr, tf_warning_or_error));
4264 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4265 tf_warning_or_error);
4267 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4268 tf_warning_or_error));
4269 *pre_body = pop_stmt_list (*pre_body);
4271 cond = cp_build_binary_op (elocus,
4272 TREE_CODE (cond), decl, diff,
4273 tf_warning_or_error);
4274 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4275 elocus, incr, NULL_TREE);
4278 *body = push_stmt_list ();
4279 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4280 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4281 tf_warning_or_error);
4282 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4283 finish_expr_stmt (iter_init);
4284 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4285 tf_warning_or_error));
4286 add_stmt (orig_body);
4287 *body = pop_stmt_list (*body);
4291 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4292 finish_expr_stmt (iter_incr);
4293 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4294 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4297 TREE_VEC_ELT (declv, i) = decl;
4298 TREE_VEC_ELT (initv, i) = init;
4299 TREE_VEC_ELT (condv, i) = cond;
4300 TREE_VEC_ELT (incrv, i) = incr;
4305 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4306 are directly for their associated operands in the statement. DECL
4307 and INIT are a combo; if DECL is NULL then INIT ought to be a
4308 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4309 optional statements that need to go before the loop into its
4313 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4314 tree incrv, tree body, tree pre_body, tree clauses)
4316 tree omp_for = NULL, orig_incr = NULL;
4317 tree decl, init, cond, incr;
4321 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4322 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4323 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4324 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4326 decl = TREE_VEC_ELT (declv, i);
4327 init = TREE_VEC_ELT (initv, i);
4328 cond = TREE_VEC_ELT (condv, i);
4329 incr = TREE_VEC_ELT (incrv, i);
4335 switch (TREE_CODE (init))
4338 decl = TREE_OPERAND (init, 0);
4339 init = TREE_OPERAND (init, 1);
4342 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4344 decl = TREE_OPERAND (init, 0);
4345 init = TREE_OPERAND (init, 2);
4355 "expected iteration declaration or initialization");
4360 if (init && EXPR_HAS_LOCATION (init))
4361 elocus = EXPR_LOCATION (init);
4365 error_at (elocus, "missing controlling predicate");
4371 error_at (elocus, "missing increment expression");
4375 TREE_VEC_ELT (declv, i) = decl;
4376 TREE_VEC_ELT (initv, i) = init;
4379 if (dependent_omp_for_p (declv, initv, condv, incrv))
4383 stmt = make_node (OMP_FOR);
4385 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4387 /* This is really just a place-holder. We'll be decomposing this
4388 again and going through the cp_build_modify_expr path below when
4389 we instantiate the thing. */
4390 TREE_VEC_ELT (initv, i)
4391 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4392 TREE_VEC_ELT (initv, i));
4395 TREE_TYPE (stmt) = void_type_node;
4396 OMP_FOR_INIT (stmt) = initv;
4397 OMP_FOR_COND (stmt) = condv;
4398 OMP_FOR_INCR (stmt) = incrv;
4399 OMP_FOR_BODY (stmt) = body;
4400 OMP_FOR_PRE_BODY (stmt) = pre_body;
4401 OMP_FOR_CLAUSES (stmt) = clauses;
4403 SET_EXPR_LOCATION (stmt, locus);
4404 return add_stmt (stmt);
4407 if (processing_template_decl)
4408 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4410 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4412 decl = TREE_VEC_ELT (declv, i);
4413 init = TREE_VEC_ELT (initv, i);
4414 cond = TREE_VEC_ELT (condv, i);
4415 incr = TREE_VEC_ELT (incrv, i);
4417 TREE_VEC_ELT (orig_incr, i) = incr;
4420 if (init && EXPR_HAS_LOCATION (init))
4421 elocus = EXPR_LOCATION (init);
4425 error_at (elocus, "expected iteration declaration or initialization");
4429 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4432 TREE_VEC_ELT (orig_incr, i) = incr;
4433 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4434 TREE_CODE (TREE_OPERAND (incr, 1)),
4435 TREE_OPERAND (incr, 2),
4436 tf_warning_or_error);
4439 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4441 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4442 incrv, &body, &pre_body, clauses))
4447 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4448 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4450 error_at (elocus, "invalid type for iteration variable %qE", decl);
4454 if (!processing_template_decl)
4456 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4457 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4460 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4462 && TREE_SIDE_EFFECTS (cond)
4463 && COMPARISON_CLASS_P (cond)
4464 && !processing_template_decl)
4466 tree t = TREE_OPERAND (cond, 0);
4467 if (TREE_SIDE_EFFECTS (t)
4469 && (TREE_CODE (t) != NOP_EXPR
4470 || TREE_OPERAND (t, 0) != decl))
4471 TREE_OPERAND (cond, 0)
4472 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4474 t = TREE_OPERAND (cond, 1);
4475 if (TREE_SIDE_EFFECTS (t)
4477 && (TREE_CODE (t) != NOP_EXPR
4478 || TREE_OPERAND (t, 0) != decl))
4479 TREE_OPERAND (cond, 1)
4480 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4482 if (decl == error_mark_node || init == error_mark_node)
4485 TREE_VEC_ELT (declv, i) = decl;
4486 TREE_VEC_ELT (initv, i) = init;
4487 TREE_VEC_ELT (condv, i) = cond;
4488 TREE_VEC_ELT (incrv, i) = incr;
4492 if (IS_EMPTY_STMT (pre_body))
4495 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4498 if (omp_for == NULL)
4501 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4503 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4504 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4506 if (TREE_CODE (incr) != MODIFY_EXPR)
4509 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4510 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4511 && !processing_template_decl)
4513 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4514 if (TREE_SIDE_EFFECTS (t)
4516 && (TREE_CODE (t) != NOP_EXPR
4517 || TREE_OPERAND (t, 0) != decl))
4518 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4519 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4521 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4522 if (TREE_SIDE_EFFECTS (t)
4524 && (TREE_CODE (t) != NOP_EXPR
4525 || TREE_OPERAND (t, 0) != decl))
4526 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4527 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4531 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4533 if (omp_for != NULL)
4534 OMP_FOR_CLAUSES (omp_for) = clauses;
4539 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4548 dependent_p = false;
4551 /* Even in a template, we can detect invalid uses of the atomic
4552 pragma if neither LHS nor RHS is type-dependent. */
4553 if (processing_template_decl)
4555 dependent_p = (type_dependent_expression_p (lhs)
4556 || type_dependent_expression_p (rhs));
4559 lhs = build_non_dependent_expr (lhs);
4560 rhs = build_non_dependent_expr (rhs);
4565 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4566 if (stmt == error_mark_node)
4569 if (processing_template_decl)
4570 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4571 build2 (code, void_type_node, orig_lhs, orig_rhs));
4576 finish_omp_barrier (void)
4578 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4579 VEC(tree,gc) *vec = make_tree_vector ();
4580 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4581 release_tree_vector (vec);
4582 finish_expr_stmt (stmt);
4586 finish_omp_flush (void)
4588 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4589 VEC(tree,gc) *vec = make_tree_vector ();
4590 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4591 release_tree_vector (vec);
4592 finish_expr_stmt (stmt);
4596 finish_omp_taskwait (void)
4598 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4599 VEC(tree,gc) *vec = make_tree_vector ();
4600 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4601 release_tree_vector (vec);
4602 finish_expr_stmt (stmt);
4606 init_cp_semantics (void)
4610 /* Build a STATIC_ASSERT for a static assertion with the condition
4611 CONDITION and the message text MESSAGE. LOCATION is the location
4612 of the static assertion in the source code. When MEMBER_P, this
4613 static assertion is a member of a class. */
4615 finish_static_assert (tree condition, tree message, location_t location,
4618 if (check_for_bare_parameter_packs (condition))
4619 condition = error_mark_node;
4621 if (type_dependent_expression_p (condition)
4622 || value_dependent_expression_p (condition))
4624 /* We're in a template; build a STATIC_ASSERT and put it in
4628 assertion = make_node (STATIC_ASSERT);
4629 STATIC_ASSERT_CONDITION (assertion) = condition;
4630 STATIC_ASSERT_MESSAGE (assertion) = message;
4631 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4634 maybe_add_class_template_decl_list (current_class_type,
4638 add_stmt (assertion);
4643 /* Fold the expression and convert it to a boolean value. */
4644 condition = fold_non_dependent_expr (condition);
4645 condition = cp_convert (boolean_type_node, condition);
4646 condition = maybe_constant_value (condition);
4648 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4649 /* Do nothing; the condition is satisfied. */
4653 location_t saved_loc = input_location;
4655 input_location = location;
4656 if (TREE_CODE (condition) == INTEGER_CST
4657 && integer_zerop (condition))
4658 /* Report the error. */
4659 error ("static assertion failed: %E", message);
4660 else if (condition && condition != error_mark_node)
4662 error ("non-constant condition for static assertion");
4663 cxx_constant_value (condition);
4665 input_location = saved_loc;
4669 /* Returns the type of EXPR for cases where we can determine it even though
4670 EXPR is a type-dependent expression. */
4673 describable_type (tree expr)
4675 tree type = NULL_TREE;
4677 if (! type_dependent_expression_p (expr)
4678 && ! type_unknown_p (expr))
4680 type = unlowered_expr_type (expr);
4681 if (real_lvalue_p (expr))
4682 type = build_reference_type (type);
4688 switch (TREE_CODE (expr))
4694 return TREE_TYPE (expr);
4699 case TEMPLATE_PARM_INDEX:
4701 case STATIC_CAST_EXPR:
4702 case REINTERPRET_CAST_EXPR:
4703 case CONST_CAST_EXPR:
4704 case DYNAMIC_CAST_EXPR:
4705 type = TREE_TYPE (expr);
4710 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4711 if (ptrtype && POINTER_TYPE_P (ptrtype))
4712 type = build_reference_type (TREE_TYPE (ptrtype));
4717 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4718 type = TREE_TYPE (expr);
4722 if (type && type_uses_auto (type))
4728 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4729 suitable for use as a type-specifier.
4731 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4732 id-expression or a class member access, FALSE when it was parsed as
4733 a full expression. */
4736 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4738 tree orig_expr = expr;
4739 tree type = NULL_TREE;
4741 if (!expr || error_operand_p (expr))
4742 return error_mark_node;
4745 || TREE_CODE (expr) == TYPE_DECL
4746 || (TREE_CODE (expr) == BIT_NOT_EXPR
4747 && TYPE_P (TREE_OPERAND (expr, 0))))
4749 error ("argument to decltype must be an expression");
4750 return error_mark_node;
4753 if (type_dependent_expression_p (expr)
4754 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4755 if it isn't dependent, so that we can check access control at
4756 instantiation time, so defer the decltype as well (PR 42277). */
4757 || (id_expression_or_member_access_p
4758 && processing_template_decl
4759 && TREE_CODE (expr) == COMPONENT_REF))
4761 if (id_expression_or_member_access_p)
4763 switch (TREE_CODE (expr))
4770 case TEMPLATE_PARM_INDEX:
4771 type = TREE_TYPE (expr);
4779 if (type && !type_uses_auto (type))
4783 type = cxx_make_type (DECLTYPE_TYPE);
4784 DECLTYPE_TYPE_EXPR (type) = expr;
4785 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4786 = id_expression_or_member_access_p;
4787 SET_TYPE_STRUCTURAL_EQUALITY (type);
4792 /* The type denoted by decltype(e) is defined as follows: */
4794 expr = resolve_nondeduced_context (expr);
4796 /* To get the size of a static data member declared as an array of
4797 unknown bound, we need to instantiate it. */
4798 if (TREE_CODE (expr) == VAR_DECL
4799 && VAR_HAD_UNKNOWN_BOUND (expr)
4800 && DECL_TEMPLATE_INSTANTIATION (expr))
4801 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
4803 if (id_expression_or_member_access_p)
4805 /* If e is an id-expression or a class member access (5.2.5
4806 [expr.ref]), decltype(e) is defined as the type of the entity
4807 named by e. If there is no such entity, or e names a set of
4808 overloaded functions, the program is ill-formed. */
4809 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4810 expr = lookup_name (expr);
4812 if (TREE_CODE (expr) == INDIRECT_REF)
4813 /* This can happen when the expression is, e.g., "a.b". Just
4814 look at the underlying operand. */
4815 expr = TREE_OPERAND (expr, 0);
4817 if (TREE_CODE (expr) == OFFSET_REF
4818 || TREE_CODE (expr) == MEMBER_REF)
4819 /* We're only interested in the field itself. If it is a
4820 BASELINK, we will need to see through it in the next
4822 expr = TREE_OPERAND (expr, 1);
4824 if (TREE_CODE (expr) == BASELINK)
4825 /* See through BASELINK nodes to the underlying functions. */
4826 expr = BASELINK_FUNCTIONS (expr);
4828 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4829 expr = TREE_OPERAND (expr, 0);
4831 if (TREE_CODE (expr) == OVERLOAD)
4833 if (OVL_CHAIN (expr)
4834 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4836 error ("%qE refers to a set of overloaded functions", orig_expr);
4837 return error_mark_node;
4840 /* An overload set containing only one function: just look
4841 at that function. */
4842 expr = OVL_FUNCTION (expr);
4845 switch (TREE_CODE (expr))
4848 if (DECL_BIT_FIELD_TYPE (expr))
4850 type = DECL_BIT_FIELD_TYPE (expr);
4853 /* Fall through for fields that aren't bitfields. */
4860 case TEMPLATE_PARM_INDEX:
4861 expr = mark_type_use (expr);
4862 type = TREE_TYPE (expr);
4866 type = error_mark_node;
4870 mark_type_use (expr);
4871 type = is_bitfield_expr_with_lowered_type (expr);
4873 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4880 /* We can get here when the id-expression refers to an
4882 type = TREE_TYPE (expr);
4886 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4887 || TREE_CODE (expr) == SCOPE_REF);
4888 error ("argument to decltype must be an expression");
4889 return error_mark_node;
4894 /* Expressions of reference type are sometimes wrapped in
4895 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4896 representation, not part of the language, so we have to look
4898 if (TREE_CODE (expr) == INDIRECT_REF
4899 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4901 expr = TREE_OPERAND (expr, 0);
4903 if (TREE_CODE (expr) == CALL_EXPR)
4905 /* If e is a function call (5.2.2 [expr.call]) or an
4906 invocation of an overloaded operator (parentheses around e
4907 are ignored), decltype(e) is defined as the return type of
4909 tree fndecl = get_callee_fndecl (expr);
4910 if (fndecl && fndecl != error_mark_node)
4911 type = TREE_TYPE (TREE_TYPE (fndecl));
4914 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4915 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4916 || TREE_CODE (target_type) == POINTER_TYPE)
4917 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4918 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4919 type = TREE_TYPE (TREE_TYPE (target_type));
4920 else if (processing_template_decl)
4921 /* Within a template finish_call_expr doesn't resolve
4922 CALL_EXPR_FN, so even though this decltype isn't really
4923 dependent let's defer resolving it. */
4924 goto treat_as_dependent;
4926 sorry ("unable to determine the declared type of expression %<%E%>",
4932 type = is_bitfield_expr_with_lowered_type (expr);
4935 /* Bitfields are special, because their type encodes the
4936 number of bits they store. If the expression referenced a
4937 bitfield, TYPE now has the declared type of that
4939 type = cp_build_qualified_type (type,
4940 cp_type_quals (TREE_TYPE (expr)));
4942 if (real_lvalue_p (expr))
4943 type = build_reference_type (type);
4945 /* Within a lambda-expression:
4947 Every occurrence of decltype((x)) where x is a possibly
4948 parenthesized id-expression that names an entity of
4949 automatic storage duration is treated as if x were
4950 transformed into an access to a corresponding data member
4951 of the closure type that would have been declared if x
4952 were a use of the denoted entity. */
4953 else if (outer_automatic_var_p (expr)
4954 && current_function_decl
4955 && LAMBDA_FUNCTION_P (current_function_decl))
4956 type = capture_decltype (expr);
4959 /* Otherwise, where T is the type of e, if e is an lvalue,
4960 decltype(e) is defined as T&, otherwise decltype(e) is
4962 type = TREE_TYPE (expr);
4963 if (type == error_mark_node)
4964 return error_mark_node;
4965 else if (expr == current_class_ptr)
4966 /* If the expression is just "this", we want the
4967 cv-unqualified pointer for the "this" type. */
4968 type = TYPE_MAIN_VARIANT (type);
4969 else if (real_lvalue_p (expr))
4971 if (TREE_CODE (type) != REFERENCE_TYPE
4972 || TYPE_REF_IS_RVALUE (type))
4973 type = build_reference_type (non_reference (type));
4976 type = non_reference (type);
4981 if (!type || type == unknown_type_node)
4983 error ("type of %qE is unknown", expr);
4984 return error_mark_node;
4990 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4991 __has_nothrow_copy, depending on assign_p. */
4994 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5001 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5004 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5006 else if (TYPE_HAS_COPY_CTOR (type))
5008 /* If construction of the copy constructor was postponed, create
5010 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5011 lazily_declare_fn (sfk_copy_constructor, type);
5012 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5013 lazily_declare_fn (sfk_move_constructor, type);
5014 fns = CLASSTYPE_CONSTRUCTORS (type);
5019 for (; fns; fns = OVL_NEXT (fns))
5021 tree fn = OVL_CURRENT (fns);
5025 if (copy_fn_p (fn) == 0)
5028 else if (copy_fn_p (fn) <= 0)
5031 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5038 /* Actually evaluates the trait. */
5041 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5043 enum tree_code type_code1;
5046 type_code1 = TREE_CODE (type1);
5050 case CPTK_HAS_NOTHROW_ASSIGN:
5051 type1 = strip_array_types (type1);
5052 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5053 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5054 || (CLASS_TYPE_P (type1)
5055 && classtype_has_nothrow_assign_or_copy_p (type1,
5058 case CPTK_HAS_TRIVIAL_ASSIGN:
5059 /* ??? The standard seems to be missing the "or array of such a class
5060 type" wording for this trait. */
5061 type1 = strip_array_types (type1);
5062 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5063 && (trivial_type_p (type1)
5064 || (CLASS_TYPE_P (type1)
5065 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5067 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5068 type1 = strip_array_types (type1);
5069 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5070 || (CLASS_TYPE_P (type1)
5071 && (t = locate_ctor (type1))
5072 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5074 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5075 type1 = strip_array_types (type1);
5076 return (trivial_type_p (type1)
5077 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5079 case CPTK_HAS_NOTHROW_COPY:
5080 type1 = strip_array_types (type1);
5081 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5082 || (CLASS_TYPE_P (type1)
5083 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5085 case CPTK_HAS_TRIVIAL_COPY:
5086 /* ??? The standard seems to be missing the "or array of such a class
5087 type" wording for this trait. */
5088 type1 = strip_array_types (type1);
5089 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5090 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5092 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5093 type1 = strip_array_types (type1);
5094 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5095 || (CLASS_TYPE_P (type1)
5096 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5098 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5099 return type_has_virtual_destructor (type1);
5101 case CPTK_IS_ABSTRACT:
5102 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5104 case CPTK_IS_BASE_OF:
5105 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5106 && DERIVED_FROM_P (type1, type2));
5109 return (NON_UNION_CLASS_TYPE_P (type1));
5111 case CPTK_IS_CONVERTIBLE_TO:
5116 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5119 return (type_code1 == ENUMERAL_TYPE);
5122 return (pod_type_p (type1));
5124 case CPTK_IS_POLYMORPHIC:
5125 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5127 case CPTK_IS_STD_LAYOUT:
5128 return (std_layout_type_p (type1));
5130 case CPTK_IS_TRIVIAL:
5131 return (trivial_type_p (type1));
5134 return (type_code1 == UNION_TYPE);
5136 case CPTK_IS_LITERAL_TYPE:
5137 return (literal_type_p (type1));
5145 /* Returns true if TYPE is a complete type, an array of unknown bound,
5146 or (possibly cv-qualified) void, returns false otherwise. */
5149 check_trait_type (tree type)
5151 if (COMPLETE_TYPE_P (type))
5154 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5155 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5158 if (VOID_TYPE_P (type))
5164 /* Process a trait expression. */
5167 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5169 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5170 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5171 || kind == CPTK_HAS_NOTHROW_COPY
5172 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5173 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5174 || kind == CPTK_HAS_TRIVIAL_COPY
5175 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5176 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5177 || kind == CPTK_IS_ABSTRACT
5178 || kind == CPTK_IS_BASE_OF
5179 || kind == CPTK_IS_CLASS
5180 || kind == CPTK_IS_CONVERTIBLE_TO
5181 || kind == CPTK_IS_EMPTY
5182 || kind == CPTK_IS_ENUM
5183 || kind == CPTK_IS_POD
5184 || kind == CPTK_IS_POLYMORPHIC
5185 || kind == CPTK_IS_STD_LAYOUT
5186 || kind == CPTK_IS_TRIVIAL
5187 || kind == CPTK_IS_LITERAL_TYPE
5188 || kind == CPTK_IS_UNION);
5190 if (kind == CPTK_IS_CONVERTIBLE_TO)
5192 sorry ("__is_convertible_to");
5193 return error_mark_node;
5196 if (type1 == error_mark_node
5197 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5198 && type2 == error_mark_node))
5199 return error_mark_node;
5201 if (processing_template_decl)
5203 tree trait_expr = make_node (TRAIT_EXPR);
5204 TREE_TYPE (trait_expr) = boolean_type_node;
5205 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5206 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5207 TRAIT_EXPR_KIND (trait_expr) = kind;
5211 complete_type (type1);
5213 complete_type (type2);
5217 case CPTK_HAS_NOTHROW_ASSIGN:
5218 case CPTK_HAS_TRIVIAL_ASSIGN:
5219 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5220 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5221 case CPTK_HAS_NOTHROW_COPY:
5222 case CPTK_HAS_TRIVIAL_COPY:
5223 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5224 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5225 case CPTK_IS_ABSTRACT:
5228 case CPTK_IS_POLYMORPHIC:
5229 case CPTK_IS_STD_LAYOUT:
5230 case CPTK_IS_TRIVIAL:
5231 case CPTK_IS_LITERAL_TYPE:
5232 if (!check_trait_type (type1))
5234 error ("incomplete type %qT not allowed", type1);
5235 return error_mark_node;
5239 case CPTK_IS_BASE_OF:
5240 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5241 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5242 && !COMPLETE_TYPE_P (type2))
5244 error ("incomplete type %qT not allowed", type2);
5245 return error_mark_node;
5254 case CPTK_IS_CONVERTIBLE_TO:
5259 return (trait_expr_value (kind, type1, type2)
5260 ? boolean_true_node : boolean_false_node);
5263 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5264 which is ignored for C++. */
5267 set_float_const_decimal64 (void)
5272 clear_float_const_decimal64 (void)
5277 float_const_decimal64_p (void)
5283 /* Return true if T is a literal type. */
5286 literal_type_p (tree t)
5288 if (SCALAR_TYPE_P (t))
5290 if (CLASS_TYPE_P (t))
5291 return CLASSTYPE_LITERAL_P (t);
5292 if (TREE_CODE (t) == ARRAY_TYPE)
5293 return literal_type_p (strip_array_types (t));
5297 /* If DECL is a variable declared `constexpr', require its type
5298 be literal. Return the DECL if OK, otherwise NULL. */
5301 ensure_literal_type_for_constexpr_object (tree decl)
5303 tree type = TREE_TYPE (decl);
5304 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5305 && !processing_template_decl
5306 /* The call to complete_type is just for initializer_list. */
5307 && !literal_type_p (complete_type (type)))
5309 error ("the type %qT of constexpr variable %qD is not literal",
5316 /* Representation of entries in the constexpr function definition table. */
5318 typedef struct GTY(()) constexpr_fundef {
5323 /* This table holds all constexpr function definitions seen in
5324 the current translation unit. */
5326 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5328 /* Utility function used for managing the constexpr function table.
5329 Return true if the entries pointed to by P and Q are for the
5330 same constexpr function. */
5333 constexpr_fundef_equal (const void *p, const void *q)
5335 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5336 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5337 return lhs->decl == rhs->decl;
5340 /* Utility function used for managing the constexpr function table.
5341 Return a hash value for the entry pointed to by Q. */
5343 static inline hashval_t
5344 constexpr_fundef_hash (const void *p)
5346 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5347 return DECL_UID (fundef->decl);
5350 /* Return a previously saved definition of function FUN. */
5352 static constexpr_fundef *
5353 retrieve_constexpr_fundef (tree fun)
5355 constexpr_fundef fundef = { NULL, NULL };
5356 if (constexpr_fundef_table == NULL)
5360 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5363 /* Return true if type expression T is a valid parameter type, or
5364 a valid return type, of a constexpr function. */
5367 valid_type_in_constexpr_fundecl_p (tree t)
5369 return (literal_type_p (t)
5370 /* FIXME we allow ref to non-literal; should change standard to
5371 match, or change back if not. */
5372 || TREE_CODE (t) == REFERENCE_TYPE);
5375 /* Check whether the parameter and return types of FUN are valid for a
5376 constexpr function, and complain if COMPLAIN. */
5379 is_valid_constexpr_fn (tree fun, bool complain)
5381 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5383 for (; parm != NULL; parm = TREE_CHAIN (parm))
5384 if (!valid_type_in_constexpr_fundecl_p (TREE_TYPE (parm)))
5388 error ("invalid type for parameter %q#D of constexpr function",
5392 if (!DECL_CONSTRUCTOR_P (fun))
5394 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5395 if (!valid_type_in_constexpr_fundecl_p (rettype))
5399 error ("invalid return type %qT of constexpr function %qD",
5403 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5404 && COMPLETE_TYPE_P (DECL_CONTEXT (fun))
5405 && !valid_type_in_constexpr_fundecl_p (DECL_CONTEXT (fun)))
5409 error ("enclosing class of %q#D is not a literal type", fun);
5416 /* Return non-null if FUN certainly designates a valid constexpr function
5417 declaration. Otherwise return NULL. Issue appropriate diagnostics
5418 if necessary. Note that we only check the declaration, not the body
5422 validate_constexpr_fundecl (tree fun)
5424 constexpr_fundef entry;
5425 constexpr_fundef **slot;
5427 if (processing_template_decl || !DECL_DECLARED_CONSTEXPR_P (fun))
5429 else if (DECL_CLONED_FUNCTION_P (fun))
5430 /* We already checked the original function. */
5433 if (!is_valid_constexpr_fn (fun, !DECL_TEMPLATE_INSTANTIATION (fun)))
5435 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5439 /* Create the constexpr function table if necessary. */
5440 if (constexpr_fundef_table == NULL)
5441 constexpr_fundef_table = htab_create_ggc (101,
5442 constexpr_fundef_hash,
5443 constexpr_fundef_equal,
5447 slot = (constexpr_fundef **)
5448 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
5451 *slot = ggc_alloc_constexpr_fundef ();
5457 /* Subroutine of build_constexpr_constructor_member_initializers.
5458 The expression tree T represents a data member initialization
5459 in a (constexpr) constructor definition. Build a pairing of
5460 the data member with its initializer, and prepend that pair
5461 to the existing initialization pair INITS. */
5464 build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec)
5467 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5468 t = TREE_OPERAND (t, 0);
5469 if (TREE_CODE (t) == EXPR_STMT)
5470 t = TREE_OPERAND (t, 0);
5471 if (t == error_mark_node)
5473 if (TREE_CODE (t) == CLEANUP_STMT)
5474 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5475 but we can in a constexpr constructor for a non-literal class. Just
5476 ignore it; either all the initialization will be constant, in which
5477 case the cleanup can't run, or it can't be constexpr. */
5479 if (TREE_CODE (t) == CONVERT_EXPR)
5480 t = TREE_OPERAND (t, 0);
5481 if (TREE_CODE (t) == INIT_EXPR
5482 || TREE_CODE (t) == MODIFY_EXPR)
5484 member = TREE_OPERAND (t, 0);
5485 init = unshare_expr (TREE_OPERAND (t, 1));
5486 if (TREE_CODE (member) == INDIRECT_REF)
5488 /* Don't put out anything for an empty base. */
5489 gcc_assert (is_empty_class (TREE_TYPE (member)));
5496 gcc_assert (TREE_CODE (t) == CALL_EXPR);
5497 member = CALL_EXPR_ARG (t, 0);
5498 memtype = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (member)));
5499 if (TREE_CODE (member) == NOP_EXPR)
5501 /* We don't put out anything for an empty base. */
5502 gcc_assert (is_empty_class (memtype));
5503 /* But if the constructor used isn't constexpr, leave in the call
5504 so we complain later. */
5505 if (potential_constant_expression (t, tf_none))
5510 gcc_assert (TREE_CODE (member) == ADDR_EXPR);
5511 member = TREE_OPERAND (member, 0);
5513 /* We don't use build_cplus_new here because it complains about
5514 abstract bases. T has the wrong type, but
5515 cxx_eval_constant_expression doesn't care. */
5516 init = unshare_expr (t);
5518 if (TREE_CODE (member) == COMPONENT_REF)
5519 member = TREE_OPERAND (member, 1);
5520 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
5524 /* Make sure that there are no statements after LAST in the constructor
5525 body represented by LIST. */
5528 check_constexpr_ctor_body (tree last, tree list)
5531 if (TREE_CODE (list) == STATEMENT_LIST)
5533 tree_stmt_iterator i = tsi_last (list);
5534 for (; !tsi_end_p (i); tsi_prev (&i))
5536 tree t = tsi_stmt (i);
5539 if (TREE_CODE (t) == BIND_EXPR)
5541 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
5546 /* We currently allow typedefs and static_assert.
5547 FIXME allow them in the standard, too. */
5548 if (TREE_CODE (t) != STATIC_ASSERT)
5555 else if (list != last
5556 && TREE_CODE (list) != STATIC_ASSERT)
5560 error ("constexpr constructor does not have empty body");
5561 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
5566 /* Build compile-time evalable representations of member-initializer list
5567 for a constexpr constructor. */
5570 build_constexpr_constructor_member_initializers (tree type, tree body)
5572 VEC(constructor_elt,gc) *vec = NULL;
5574 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
5575 || TREE_CODE (body) == EH_SPEC_BLOCK)
5576 body = TREE_OPERAND (body, 0);
5577 if (TREE_CODE (body) == STATEMENT_LIST)
5578 body = STATEMENT_LIST_HEAD (body)->stmt;
5579 body = BIND_EXPR_BODY (body);
5580 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5581 ok = build_data_member_initialization (body, &vec);
5582 else if (TREE_CODE (body) == STATEMENT_LIST)
5584 tree_stmt_iterator i;
5585 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5587 ok = build_data_member_initialization (tsi_stmt (i), &vec);
5593 gcc_assert (errorcount > 0);
5595 return build_constructor (type, vec);
5597 return error_mark_node;
5600 /* We are processing the definition of the constexpr function FUN.
5601 Check that its BODY fulfills the propriate requirements and
5602 enter it in the constexpr function definition table.
5603 For constructor BODY is actually the TREE_LIST of the
5604 member-initializer list. */
5607 register_constexpr_fundef (tree fun, tree body)
5609 constexpr_fundef *fundef = retrieve_constexpr_fundef (fun);
5610 gcc_assert (fundef != NULL && fundef->body == NULL);
5612 if (DECL_CONSTRUCTOR_P (fun))
5613 body = build_constexpr_constructor_member_initializers
5614 (DECL_CONTEXT (fun), body);
5617 if (TREE_CODE (body) == BIND_EXPR)
5618 body = BIND_EXPR_BODY (body);
5619 if (TREE_CODE (body) == EH_SPEC_BLOCK)
5620 body = EH_SPEC_STMTS (body);
5621 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
5622 body = TREE_OPERAND (body, 0);
5623 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5624 body = TREE_OPERAND (body, 0);
5625 if (TREE_CODE (body) != RETURN_EXPR)
5627 error ("body of constexpr function %qD not a return-statement", fun);
5628 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5631 body = unshare_expr (TREE_OPERAND (body, 0));
5634 if (!potential_constant_expression (body, (DECL_TEMPLATE_INSTANTIATION (fun)
5635 ? tf_none : tf_error)))
5637 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5640 fundef->body = body;
5644 /* Objects of this type represent calls to constexpr functions
5645 along with the bindings of parameters to their arguments, for
5646 the purpose of compile time evaluation. */
5648 typedef struct GTY(()) constexpr_call {
5649 /* Description of the constexpr function definition. */
5650 constexpr_fundef *fundef;
5651 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5652 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5653 Note: This arrangement is made to accomodate the use of
5654 iterative_hash_template_arg (see pt.c). If you change this
5655 representation, also change the hash calculation in
5656 cxx_eval_call_expression. */
5658 /* Result of the call.
5659 NULL means the call is being evaluated.
5660 error_mark_node means that the evaluation was erroneous;
5661 otherwise, the actuall value of the call. */
5663 /* The hash of this call; we remember it here to avoid having to
5664 recalculate it when expanding the hash table. */
5668 /* A table of all constexpr calls that have been evaluated by the
5669 compiler in this translation unit. */
5671 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
5673 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
5674 bool, bool, bool *);
5676 /* Compute a hash value for a constexpr call representation. */
5679 constexpr_call_hash (const void *p)
5681 const constexpr_call *info = (const constexpr_call *) p;
5685 /* Return 1 if the objects pointed to by P and Q represent calls
5686 to the same constexpr function with the same arguments.
5687 Otherwise, return 0. */
5690 constexpr_call_equal (const void *p, const void *q)
5692 const constexpr_call *lhs = (const constexpr_call *) p;
5693 const constexpr_call *rhs = (const constexpr_call *) q;
5698 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
5700 lhs_bindings = lhs->bindings;
5701 rhs_bindings = rhs->bindings;
5702 while (lhs_bindings != NULL && rhs_bindings != NULL)
5704 tree lhs_arg = TREE_VALUE (lhs_bindings);
5705 tree rhs_arg = TREE_VALUE (rhs_bindings);
5706 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
5707 if (!cp_tree_equal (lhs_arg, rhs_arg))
5709 lhs_bindings = TREE_CHAIN (lhs_bindings);
5710 rhs_bindings = TREE_CHAIN (rhs_bindings);
5712 return lhs_bindings == rhs_bindings;
5715 /* Initialize the constexpr call table, if needed. */
5718 maybe_initialize_constexpr_call_table (void)
5720 if (constexpr_call_table == NULL)
5721 constexpr_call_table = htab_create_ggc (101,
5722 constexpr_call_hash,
5723 constexpr_call_equal,
5727 /* Return true if T designates the implied `this' parameter. */
5730 is_this_parameter (tree t)
5732 return t == current_class_ptr;
5735 /* We have an expression tree T that represents a call, either CALL_EXPR
5736 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5737 retrun the _DECL for that function. */
5740 get_function_named_in_call (tree t)
5743 switch (TREE_CODE (t))
5746 fun = CALL_EXPR_FN (t);
5749 case AGGR_INIT_EXPR:
5750 fun = AGGR_INIT_EXPR_FN (t);
5757 if (TREE_CODE (fun) == ADDR_EXPR
5758 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
5759 fun = TREE_OPERAND (fun, 0);
5763 /* We have an expression tree T that represents a call, either CALL_EXPR
5764 or AGGR_INIT_EXPR. Return the Nth argument. */
5767 get_nth_callarg (tree t, int n)
5769 switch (TREE_CODE (t))
5772 return CALL_EXPR_ARG (t, n);
5774 case AGGR_INIT_EXPR:
5775 return AGGR_INIT_EXPR_ARG (t, n);
5783 /* Look up the binding of the function parameter T in a constexpr
5784 function call context CALL. */
5787 lookup_parameter_binding (const constexpr_call *call, tree t)
5789 tree b = purpose_member (t, call->bindings);
5790 return TREE_VALUE (b);
5793 /* Attempt to evaluate T which represents a call to a builtin function.
5794 We assume here that all builtin functions evaluate to scalar types
5795 represented by _CST nodes. */
5798 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
5799 bool allow_non_constant, bool addr,
5800 bool *non_constant_p)
5802 const int nargs = call_expr_nargs (t);
5803 tree *args = (tree *) alloca (nargs * sizeof (tree));
5806 for (i = 0; i < nargs; ++i)
5808 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
5809 allow_non_constant, addr,
5811 if (allow_non_constant && *non_constant_p)
5814 if (*non_constant_p)
5816 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
5817 CALL_EXPR_FN (t), nargs, args);
5818 return fold (new_call);
5821 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5822 the type of the value to match. */
5825 adjust_temp_type (tree type, tree temp)
5827 if (TREE_TYPE (temp) == type)
5829 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5830 if (TREE_CODE (temp) == CONSTRUCTOR)
5831 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
5832 gcc_assert (SCALAR_TYPE_P (type));
5833 return cp_fold_convert (type, temp);
5836 /* Subroutine of cxx_eval_call_expression.
5837 We are processing a call expression (either CALL_EXPR or
5838 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5839 all arguments and bind their values to correspondings
5840 parameters, making up the NEW_CALL context. */
5843 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
5844 constexpr_call *new_call,
5845 bool allow_non_constant,
5846 bool *non_constant_p)
5848 const int nargs = call_expr_nargs (t);
5849 tree fun = new_call->fundef->decl;
5850 tree parms = DECL_ARGUMENTS (fun);
5852 for (i = 0; i < nargs; ++i)
5855 tree type = parms ? TREE_TYPE (parms) : void_type_node;
5856 /* For member function, the first argument is a pointer to the implied
5857 object. And for an object contruction, don't bind `this' before
5858 it is fully constructed. */
5859 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
5861 x = get_nth_callarg (t, i);
5862 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
5863 TREE_CODE (type) == REFERENCE_TYPE,
5865 /* Don't VERIFY_CONSTANT here. */
5866 if (*non_constant_p && allow_non_constant)
5868 /* Just discard ellipsis args after checking their constantitude. */
5872 /* Make sure the binding has the same type as the parm. */
5873 if (TREE_CODE (type) != REFERENCE_TYPE)
5874 arg = adjust_temp_type (type, arg);
5875 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
5877 parms = TREE_CHAIN (parms);
5881 /* Variables and functions to manage constexpr call expansion context.
5882 These do not need to be marked for PCH or GC. */
5884 static VEC(tree,heap) *call_stack = NULL;
5885 static int call_stack_tick;
5886 static int last_cx_error_tick;
5889 push_cx_call_context (tree call)
5892 if (!EXPR_HAS_LOCATION (call))
5893 SET_EXPR_LOCATION (call, input_location);
5894 VEC_safe_push (tree, heap, call_stack, call);
5898 pop_cx_call_context (void)
5901 VEC_pop (tree, call_stack);
5905 cx_error_context (void)
5907 VEC(tree,heap) *r = NULL;
5908 if (call_stack_tick != last_cx_error_tick
5909 && !VEC_empty (tree, call_stack))
5911 last_cx_error_tick = call_stack_tick;
5915 /* Subroutine of cxx_eval_constant_expression.
5916 Evaluate the call expression tree T in the context of OLD_CALL expression
5920 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
5921 bool allow_non_constant, bool addr,
5922 bool *non_constant_p)
5924 location_t loc = EXPR_LOC_OR_HERE (t);
5925 tree fun = get_function_named_in_call (t);
5927 constexpr_call new_call = { NULL, NULL, NULL, 0 };
5928 constexpr_call **slot;
5929 if (TREE_CODE (fun) != FUNCTION_DECL)
5931 /* Might be a constexpr function pointer. */
5932 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
5933 /*addr*/false, non_constant_p);
5934 if (TREE_CODE (fun) == ADDR_EXPR)
5935 fun = TREE_OPERAND (fun, 0);
5937 if (TREE_CODE (fun) != FUNCTION_DECL)
5939 if (!allow_non_constant)
5940 error_at (loc, "expression %qE does not designate a constexpr "
5942 *non_constant_p = true;
5945 if (DECL_CLONED_FUNCTION_P (fun))
5946 fun = DECL_CLONED_FUNCTION (fun);
5947 if (is_builtin_fn (fun))
5948 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
5949 addr, non_constant_p);
5950 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5952 if (!allow_non_constant)
5954 error_at (loc, "%qD is not a constexpr function", fun);
5955 if (DECL_TEMPLATE_INSTANTIATION (fun)
5956 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
5957 (DECL_TI_TEMPLATE (fun))))
5958 is_valid_constexpr_fn (fun, true);
5960 *non_constant_p = true;
5964 /* If in direct recursive call, optimize definition search. */
5965 if (old_call != NULL && old_call->fundef->decl == fun)
5966 new_call.fundef = old_call->fundef;
5969 new_call.fundef = retrieve_constexpr_fundef (fun);
5970 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
5972 if (!allow_non_constant)
5973 error_at (loc, "%qD used before its definition", fun);
5974 *non_constant_p = true;
5978 cxx_bind_parameters_in_call (old_call, t, &new_call,
5979 allow_non_constant, non_constant_p);
5980 if (*non_constant_p)
5983 push_cx_call_context (t);
5986 = iterative_hash_template_arg (new_call.bindings,
5987 constexpr_fundef_hash (new_call.fundef));
5989 /* If we have seen this call before, we are done. */
5990 maybe_initialize_constexpr_call_table ();
5991 slot = (constexpr_call **)
5992 htab_find_slot (constexpr_call_table, &new_call, INSERT);
5995 /* Calls which are in progress have their result set to NULL
5996 so that we can detect circular dependencies. */
5997 if ((*slot)->result == NULL)
5999 if (!allow_non_constant)
6000 error ("call has circular dependency");
6001 (*slot)->result = result = error_mark_node;
6005 result = (*slot)->result;
6006 if (result == error_mark_node && !allow_non_constant)
6007 /* Re-evaluate to get the error. */
6008 cxx_eval_constant_expression (&new_call, new_call.fundef->body,
6009 allow_non_constant, addr,
6015 /* We need to keep a pointer to the entry, not just the slot, as the
6016 slot can move in the call to cxx_eval_builtin_function_call. */
6017 constexpr_call *entry = ggc_alloc_constexpr_call ();
6021 = cxx_eval_constant_expression (&new_call, new_call.fundef->body,
6022 allow_non_constant, addr,
6024 if (*non_constant_p)
6025 entry->result = result = error_mark_node;
6028 /* If this was a call to initialize an object, set the type of
6029 the CONSTRUCTOR to the type of that object. */
6030 if (DECL_CONSTRUCTOR_P (fun))
6032 tree ob_arg = get_nth_callarg (t, 0);
6033 STRIP_NOPS (ob_arg);
6034 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6035 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6036 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6039 entry->result = result;
6043 pop_cx_call_context ();
6044 return unshare_expr (result);
6047 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6050 reduced_constant_expression_p (tree t)
6052 if (TREE_OVERFLOW_P (t))
6053 /* Integer overflow makes this not a constant expression. */
6055 /* FIXME are we calling this too much? */
6056 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6059 /* Some expressions may have constant operands but are not constant
6060 themselves, such as 1/0. Call this function (or rather, the macro
6061 following it) to check for that condition.
6063 We only call this in places that require an arithmetic constant, not in
6064 places where we might have a non-constant expression that can be a
6065 component of a constant expression, such as the address of a constexpr
6066 variable that might be dereferenced later. */
6069 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p)
6071 if (!*non_constant_p && !reduced_constant_expression_p (t))
6073 if (!allow_non_constant)
6075 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6076 printing the folded constant isn't helpful. */
6077 if (TREE_OVERFLOW_P (t))
6079 permerror (input_location, "overflow in constant expression");
6080 /* If we're being permissive (and are in an enforcing
6081 context), consider this constant. */
6082 if (flag_permissive)
6086 error ("%q+E is not a constant expression", t);
6088 *non_constant_p = true;
6090 return *non_constant_p;
6092 #define VERIFY_CONSTANT(X) \
6094 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6098 /* Subroutine of cxx_eval_constant_expression.
6099 Attempt to reduce the unary expression tree T to a compile time value.
6100 If successful, return the value. Otherwise issue a diagnostic
6101 and return error_mark_node. */
6104 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6105 bool allow_non_constant, bool addr,
6106 bool *non_constant_p)
6109 tree orig_arg = TREE_OPERAND (t, 0);
6110 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6111 addr, non_constant_p);
6112 VERIFY_CONSTANT (arg);
6113 if (arg == orig_arg)
6115 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6116 VERIFY_CONSTANT (r);
6120 /* Subroutine of cxx_eval_constant_expression.
6121 Like cxx_eval_unary_expression, except for binary expressions. */
6124 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6125 bool allow_non_constant, bool addr,
6126 bool *non_constant_p)
6129 tree orig_lhs = TREE_OPERAND (t, 0);
6130 tree orig_rhs = TREE_OPERAND (t, 1);
6132 lhs = cxx_eval_constant_expression (call, orig_lhs,
6133 allow_non_constant, addr,
6135 VERIFY_CONSTANT (lhs);
6136 rhs = cxx_eval_constant_expression (call, orig_rhs,
6137 allow_non_constant, addr,
6139 VERIFY_CONSTANT (rhs);
6140 if (lhs == orig_lhs && rhs == orig_rhs)
6142 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6143 VERIFY_CONSTANT (r);
6147 /* Subroutine of cxx_eval_constant_expression.
6148 Attempt to evaluate condition expressions. Dead branches are not
6152 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6153 bool allow_non_constant, bool addr,
6154 bool *non_constant_p)
6156 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6157 allow_non_constant, addr,
6159 VERIFY_CONSTANT (val);
6160 if (val == boolean_true_node)
6161 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6162 allow_non_constant, addr,
6164 gcc_assert (val == boolean_false_node);
6165 /* Don't VERIFY_CONSTANT here. */
6166 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6167 allow_non_constant, addr,
6171 /* Subroutine of cxx_eval_constant_expression.
6172 Attempt to reduce a reference to an array slot. */
6175 cxx_eval_array_reference (const constexpr_call *call, tree t,
6176 bool allow_non_constant, bool addr,
6177 bool *non_constant_p)
6179 tree oldary = TREE_OPERAND (t, 0);
6180 tree ary = cxx_eval_constant_expression (call, oldary,
6181 allow_non_constant, addr,
6186 if (*non_constant_p)
6188 oldidx = TREE_OPERAND (t, 1);
6189 index = cxx_eval_constant_expression (call, oldidx,
6190 allow_non_constant, false,
6192 VERIFY_CONSTANT (index);
6193 if (addr && ary == oldary && index == oldidx)
6196 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6197 len = (TREE_CODE (ary) == CONSTRUCTOR
6198 ? CONSTRUCTOR_NELTS (ary)
6199 : (unsigned)TREE_STRING_LENGTH (ary));
6200 if (compare_tree_int (index, len) >= 0)
6202 if (!allow_non_constant)
6203 error ("array subscript out of bound");
6204 *non_constant_p = true;
6207 i = tree_low_cst (index, 0);
6208 if (TREE_CODE (ary) == CONSTRUCTOR)
6209 return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value;
6211 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
6212 TREE_STRING_POINTER (ary)[i]);
6213 /* Don't VERIFY_CONSTANT here. */
6216 /* Subroutine of cxx_eval_constant_expression.
6217 Attempt to reduce a field access of a value of class type. */
6220 cxx_eval_component_reference (const constexpr_call *call, tree t,
6221 bool allow_non_constant, bool addr,
6222 bool *non_constant_p)
6224 unsigned HOST_WIDE_INT i;
6227 tree part = TREE_OPERAND (t, 1);
6228 tree orig_whole = TREE_OPERAND (t, 0);
6229 tree whole = cxx_eval_constant_expression (call, orig_whole,
6230 allow_non_constant, addr,
6232 if (whole == orig_whole)
6235 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
6236 whole, part, NULL_TREE);
6237 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6239 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6241 if (!allow_non_constant)
6242 error ("%qE is not a constant expression", orig_whole);
6243 *non_constant_p = true;
6245 if (*non_constant_p)
6247 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6252 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE)
6254 /* FIXME Mike Miller wants this to be OK. */
6255 if (!allow_non_constant)
6256 error ("accessing %qD member instead of initialized %qD member in "
6257 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
6258 *non_constant_p = true;
6262 return error_mark_node;
6265 /* Subroutine of cxx_eval_constant_expression.
6266 Attempt to reduce a field access of a value of class type that is
6267 expressed as a BIT_FIELD_REF. */
6270 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
6271 bool allow_non_constant, bool addr,
6272 bool *non_constant_p)
6274 tree orig_whole = TREE_OPERAND (t, 0);
6275 tree whole = cxx_eval_constant_expression (call, orig_whole,
6276 allow_non_constant, addr,
6278 tree start, field, value;
6279 unsigned HOST_WIDE_INT i;
6281 if (whole == orig_whole)
6283 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6285 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6287 if (!allow_non_constant)
6288 error ("%qE is not a constant expression", orig_whole);
6289 *non_constant_p = true;
6291 if (*non_constant_p)
6294 start = TREE_OPERAND (t, 2);
6295 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6297 if (bit_position (field) == start)
6301 return error_mark_node;
6304 /* Subroutine of cxx_eval_constant_expression.
6305 Evaluate a short-circuited logical expression T in the context
6306 of a given constexpr CALL. BAILOUT_VALUE is the value for
6307 early return. CONTINUE_VALUE is used here purely for
6308 sanity check purposes. */
6311 cxx_eval_logical_expression (const constexpr_call *call, tree t,
6312 tree bailout_value, tree continue_value,
6313 bool allow_non_constant, bool addr,
6314 bool *non_constant_p)
6317 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6318 allow_non_constant, addr,
6320 VERIFY_CONSTANT (lhs);
6321 if (lhs == bailout_value)
6323 gcc_assert (lhs == continue_value);
6324 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6325 allow_non_constant, addr, non_constant_p);
6326 VERIFY_CONSTANT (r);
6330 /* Subroutine of cxx_eval_constant_expression.
6331 The expression tree T denotes a C-style array or a C-style
6332 aggregate. Reduce it to a constant expression. */
6335 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
6336 bool allow_non_constant, bool addr,
6337 bool *non_constant_p)
6339 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t);
6340 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc,
6341 VEC_length (constructor_elt, v));
6342 constructor_elt *ce;
6344 bool changed = false;
6345 tree type = TREE_TYPE (t);
6346 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
6347 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6349 tree elt = cxx_eval_constant_expression (call, ce->value,
6350 allow_non_constant, addr,
6352 /* Don't VERIFY_CONSTANT here. */
6353 if (allow_non_constant && *non_constant_p)
6355 if (elt != ce->value)
6357 if (TREE_CODE (type) != ARRAY_TYPE
6358 && !(same_type_ignoring_top_level_qualifiers_p
6359 (DECL_CONTEXT (ce->index), type)))
6361 /* Push our vtable pointer down into the base where it belongs. */
6362 tree vptr_base = DECL_CONTEXT (ce->index);
6364 gcc_assert (ce->index == TYPE_VFIELD (type));
6365 for (base_ctor = VEC_index (constructor_elt, n, 0)->value; ;
6366 base_ctor = CONSTRUCTOR_ELT (base_ctor, 0)->value)
6367 if (TREE_TYPE (base_ctor) == vptr_base)
6369 constructor_elt *p = CONSTRUCTOR_ELT (base_ctor, 0);
6370 gcc_assert (p->index == ce->index);
6376 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
6378 if (*non_constant_p || !changed)
6381 VEC_free (constructor_elt, gc, n);
6384 t = build_constructor (TREE_TYPE (t), n);
6385 TREE_CONSTANT (t) = true;
6389 /* Subroutine of cxx_eval_constant_expression.
6390 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6391 initialization of a non-static data member of array type. Reduce it to a
6394 Note that this is only intended to support the initializations done by
6395 defaulted constructors for classes with non-static data members of array
6396 type. In this case, VEC_INIT_EXPR_INIT will either be NULL_TREE for the
6397 default constructor, or a COMPONENT_REF for the copy/move
6401 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
6402 bool allow_non_constant, bool addr,
6403 bool *non_constant_p)
6405 tree elttype = TREE_TYPE (atype);
6406 int max = tree_low_cst (array_type_nelts (atype), 0);
6407 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1);
6410 /* For the default constructor, build up a call to the default
6411 constructor of the element type. We only need to handle class types
6412 here, as for a constructor to be constexpr, all members must be
6413 initialized, which for a defaulted default constructor means they must
6414 be of a class type with a constexpr default constructor. */
6417 VEC(tree,gc) *argvec = make_tree_vector ();
6418 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6419 &argvec, elttype, LOOKUP_NORMAL,
6420 tf_warning_or_error);
6421 release_tree_vector (argvec);
6422 init = cxx_eval_constant_expression (call, init, allow_non_constant,
6423 addr, non_constant_p);
6426 if (*non_constant_p && !allow_non_constant)
6429 for (i = 0; i <= max; ++i)
6431 tree idx = build_int_cst (size_type_node, i);
6433 if (TREE_CODE (elttype) == ARRAY_TYPE)
6435 /* A multidimensional array; recurse. */
6436 eltinit = cp_build_array_ref (input_location, init, idx,
6437 tf_warning_or_error);
6438 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit,
6439 allow_non_constant, addr,
6442 else if (TREE_CODE (init) == CONSTRUCTOR)
6444 /* Initializing an element using the call to the default
6445 constructor we just built above. */
6446 eltinit = unshare_expr (init);
6450 /* Copying an element. */
6451 VEC(tree,gc) *argvec;
6452 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6453 (atype, TREE_TYPE (init)));
6454 eltinit = cp_build_array_ref (input_location, init, idx,
6455 tf_warning_or_error);
6456 if (!real_lvalue_p (init))
6457 eltinit = move (eltinit);
6458 argvec = make_tree_vector ();
6459 VEC_quick_push (tree, argvec, eltinit);
6460 eltinit = (build_special_member_call
6461 (NULL_TREE, complete_ctor_identifier, &argvec,
6462 elttype, LOOKUP_NORMAL, tf_warning_or_error));
6463 release_tree_vector (argvec);
6464 eltinit = cxx_eval_constant_expression
6465 (call, eltinit, allow_non_constant, addr, non_constant_p);
6467 if (*non_constant_p && !allow_non_constant)
6469 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
6472 if (!*non_constant_p)
6474 init = build_constructor (TREE_TYPE (atype), n);
6475 TREE_CONSTANT (init) = true;
6480 VEC_free (constructor_elt, gc, n);
6485 cxx_eval_vec_init (const constexpr_call *call, tree t,
6486 bool allow_non_constant, bool addr,
6487 bool *non_constant_p)
6489 tree atype = TREE_TYPE (t);
6490 tree init = VEC_INIT_EXPR_INIT (t);
6491 tree r = cxx_eval_vec_init_1 (call, atype, init, allow_non_constant,
6492 addr, non_constant_p);
6493 if (*non_constant_p)
6499 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6500 match. We want to be less strict for simple *& folding; if we have a
6501 non-const temporary that we access through a const pointer, that should
6502 work. We handle this here rather than change fold_indirect_ref_1
6503 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6504 don't really make sense outside of constant expression evaluation. Also
6505 we want to allow folding to COMPONENT_REF, which could cause trouble
6506 with TBAA in fold_indirect_ref_1. */
6509 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
6510 bool allow_non_constant, bool addr,
6511 bool *non_constant_p)
6513 tree orig_op0 = TREE_OPERAND (t, 0);
6514 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
6515 /*addr*/false, non_constant_p);
6516 tree type, sub, subtype, r;
6519 /* Don't VERIFY_CONSTANT here. */
6520 if (*non_constant_p)
6523 type = TREE_TYPE (t);
6529 subtype = TREE_TYPE (sub);
6530 gcc_assert (POINTER_TYPE_P (subtype));
6532 if (TREE_CODE (sub) == ADDR_EXPR)
6534 tree op = TREE_OPERAND (sub, 0);
6535 tree optype = TREE_TYPE (op);
6537 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
6539 /* Also handle conversion to an empty base class, which
6540 is represented with a NOP_EXPR. */
6541 else if (!addr && is_empty_class (type)
6542 && CLASS_TYPE_P (optype)
6543 && DERIVED_FROM_P (type, optype))
6548 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6549 else if (RECORD_OR_UNION_TYPE_P (optype))
6551 tree field = TYPE_FIELDS (optype);
6552 for (; field; field = DECL_CHAIN (field))
6553 if (TREE_CODE (field) == FIELD_DECL
6554 && integer_zerop (byte_position (field))
6555 && (same_type_ignoring_top_level_qualifiers_p
6556 (TREE_TYPE (field), type)))
6558 r = fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
6563 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
6564 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
6566 tree op00 = TREE_OPERAND (sub, 0);
6567 tree op01 = TREE_OPERAND (sub, 1);
6570 if (TREE_CODE (op00) == ADDR_EXPR)
6573 op00 = TREE_OPERAND (op00, 0);
6574 op00type = TREE_TYPE (op00);
6576 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6577 if (RECORD_OR_UNION_TYPE_P (op00type))
6579 tree field = TYPE_FIELDS (op00type);
6580 for (; field; field = DECL_CHAIN (field))
6581 if (TREE_CODE (field) == FIELD_DECL
6582 && tree_int_cst_equal (byte_position (field), op01)
6583 && (same_type_ignoring_top_level_qualifiers_p
6584 (TREE_TYPE (field), type)))
6586 r = fold_build3 (COMPONENT_REF, type, op00,
6594 /* Let build_fold_indirect_ref handle the cases it does fine with. */
6596 r = build_fold_indirect_ref (op0);
6597 if (TREE_CODE (r) != INDIRECT_REF)
6598 r = cxx_eval_constant_expression (call, r, allow_non_constant,
6599 addr, non_constant_p);
6600 else if (TREE_CODE (sub) == ADDR_EXPR
6601 || TREE_CODE (sub) == POINTER_PLUS_EXPR)
6603 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6604 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
6605 /* FIXME Mike Miller wants this to be OK. */
6606 if (!allow_non_constant)
6607 error ("accessing value of %qE through a %qT glvalue in a "
6608 "constant expression", build_fold_indirect_ref (sub),
6610 *non_constant_p = true;
6614 /* If we're pulling out the value of an empty base, make sure
6615 that the whole object is constant and then return an empty
6619 VERIFY_CONSTANT (r);
6620 r = build_constructor (TREE_TYPE (t), NULL);
6621 TREE_CONSTANT (r) = true;
6624 if (TREE_CODE (r) == INDIRECT_REF && TREE_OPERAND (r, 0) == orig_op0)
6629 /* Attempt to reduce the expression T to a constant value.
6630 On failure, issue diagnostic and return error_mark_node. */
6631 /* FIXME unify with c_fully_fold */
6634 cxx_eval_constant_expression (const constexpr_call *call, tree t,
6635 bool allow_non_constant, bool addr,
6636 bool *non_constant_p)
6640 if (t == error_mark_node)
6642 *non_constant_p = true;
6645 if (CONSTANT_CLASS_P (t))
6647 if (TREE_CODE (t) == PTRMEM_CST)
6648 t = cplus_expand_constant (t);
6651 if (TREE_CODE (t) != NOP_EXPR
6652 && reduced_constant_expression_p (t))
6655 switch (TREE_CODE (t))
6660 /* else fall through. */
6662 r = integral_constant_value (t);
6663 if (TREE_CODE (r) == TARGET_EXPR
6664 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
6665 r = TARGET_EXPR_INITIAL (r);
6668 if (!allow_non_constant)
6670 tree type = TREE_TYPE (r);
6671 error ("the value of %qD is not usable in a constant "
6673 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6675 if (!CP_TYPE_CONST_P (type))
6676 inform (DECL_SOURCE_LOCATION (r),
6677 "%q#D is not const", r);
6678 else if (CP_TYPE_VOLATILE_P (type))
6679 inform (DECL_SOURCE_LOCATION (r),
6680 "%q#D is volatile", r);
6681 else if (!DECL_INITIAL (r))
6682 inform (DECL_SOURCE_LOCATION (r),
6683 "%qD was not initialized with a constant "
6690 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
6691 inform (DECL_SOURCE_LOCATION (r),
6692 "%qD was not declared %<constexpr%>", r);
6694 inform (DECL_SOURCE_LOCATION (r),
6695 "%qD does not have integral or enumeration type",
6699 *non_constant_p = true;
6708 if (call && DECL_CONTEXT (t) == call->fundef->decl)
6709 r = lookup_parameter_binding (call, t);
6711 /* Defer in case this is only used for its type. */;
6714 if (!allow_non_constant)
6715 error ("%qE is not a constant expression", t);
6716 *non_constant_p = true;
6721 case AGGR_INIT_EXPR:
6722 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
6728 /* Pass false for 'addr' because these codes indicate
6729 initialization of a temporary. */
6730 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6731 allow_non_constant, false,
6733 if (!*non_constant_p)
6734 /* Adjust the type of the result to the type of the temporary. */
6735 r = adjust_temp_type (TREE_TYPE (t), r);
6739 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6740 allow_non_constant, addr,
6745 case NON_LVALUE_EXPR:
6746 case TRY_CATCH_EXPR:
6747 case CLEANUP_POINT_EXPR:
6748 case MUST_NOT_THROW_EXPR:
6750 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6751 allow_non_constant, addr,
6755 /* These differ from cxx_eval_unary_expression in that this doesn't
6756 check for a constant operand or result; an address can be
6757 constant without its operand being, and vice versa. */
6759 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
6765 tree oldop = TREE_OPERAND (t, 0);
6766 tree op = cxx_eval_constant_expression (call, oldop,
6770 /* Don't VERIFY_CONSTANT here. */
6771 if (*non_constant_p)
6773 /* This function does more aggressive folding than fold itself. */
6774 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
6775 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
6783 case FIX_TRUNC_EXPR:
6788 case TRUTH_NOT_EXPR:
6789 case FIXED_CONVERT_EXPR:
6790 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
6796 /* check_return_expr sometimes wraps a TARGET_EXPR in a
6797 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
6798 introduced by build_call_a. */
6799 tree op0 = TREE_OPERAND (t, 0);
6800 tree op1 = TREE_OPERAND (t, 1);
6802 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
6803 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
6804 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
6805 addr, non_constant_p);
6811 case POINTER_PLUS_EXPR:
6815 case TRUNC_DIV_EXPR:
6817 case FLOOR_DIV_EXPR:
6818 case ROUND_DIV_EXPR:
6819 case TRUNC_MOD_EXPR:
6821 case ROUND_MOD_EXPR:
6823 case EXACT_DIV_EXPR:
6833 case TRUTH_XOR_EXPR:
6840 case UNORDERED_EXPR:
6850 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
6854 /* fold can introduce non-IF versions of these; still treat them as
6855 short-circuiting. */
6856 case TRUTH_AND_EXPR:
6857 case TRUTH_ANDIF_EXPR:
6858 r = cxx_eval_logical_expression (call, t, boolean_false_node,
6860 allow_non_constant, addr,
6865 case TRUTH_ORIF_EXPR:
6866 r = cxx_eval_logical_expression (call, t, boolean_true_node,
6868 allow_non_constant, addr,
6873 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
6878 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
6883 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
6889 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
6894 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
6899 /* We can get this in a defaulted constructor for a class with a
6900 non-static data member of array type. Either the initializer will
6901 be NULL, meaning default-initialization, or it will be an lvalue
6902 or xvalue of the same type, meaning direct-initialization from the
6903 corresponding member. */
6904 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
6909 case VIEW_CONVERT_EXPR:
6912 tree oldop = TREE_OPERAND (t, 0);
6914 tree to = TREE_TYPE (t);
6915 tree source = TREE_TYPE (op);
6916 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to)
6917 && !(TREE_CODE (op) == COMPONENT_REF
6918 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0)))))
6920 if (!allow_non_constant)
6921 error ("conversion of expression %qE of pointer type "
6922 "cannot yield a constant expression", op);
6923 *non_constant_p = true;
6926 op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6927 allow_non_constant, addr,
6929 if (*non_constant_p)
6932 /* We didn't fold at the top so we could check for ptr-int
6935 r = fold_build1 (TREE_CODE (t), to, op);
6939 case EMPTY_CLASS_EXPR:
6940 /* This is good enough for a function argument that might not get
6941 used, and they can't do anything with it, so just return it. */
6945 case DYNAMIC_CAST_EXPR:
6946 case PSEUDO_DTOR_EXPR:
6947 case PREINCREMENT_EXPR:
6948 case POSTINCREMENT_EXPR:
6949 case PREDECREMENT_EXPR:
6950 case POSTDECREMENT_EXPR:
6954 case VEC_DELETE_EXPR:
6958 /* GCC internal stuff. */
6961 case WITH_CLEANUP_EXPR:
6962 case STATEMENT_LIST:
6964 case NON_DEPENDENT_EXPR:
6967 if (!allow_non_constant)
6968 error_at (EXPR_LOC_OR_HERE (t),
6969 "expression %qE is not a constant-expression", t);
6970 *non_constant_p = true;
6974 internal_error ("unexpected expression %qE of kind %s", t,
6975 tree_code_name[TREE_CODE (t)]);
6976 *non_constant_p = true;
6980 if (r == error_mark_node)
6981 *non_constant_p = true;
6983 if (*non_constant_p)
6990 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
6992 bool non_constant_p = false;
6993 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
6994 false, &non_constant_p);
6996 verify_constant (r, allow_non_constant, &non_constant_p);
6998 if (non_constant_p && !allow_non_constant)
6999 return error_mark_node;
7000 else if (non_constant_p && TREE_CONSTANT (t))
7002 /* This isn't actually constant, so unset TREE_CONSTANT. */
7003 if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR)
7006 r = build_nop (TREE_TYPE (t), t);
7007 TREE_CONSTANT (r) = false;
7010 else if (non_constant_p || r == t)
7012 else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
7014 if (TREE_CODE (t) == TARGET_EXPR
7015 && TARGET_EXPR_INITIAL (t) == r)
7019 r = get_target_expr (r);
7020 TREE_CONSTANT (r) = true;
7028 /* Returns true if T is a valid subexpression of a constant expression,
7029 even if it isn't itself a constant expression. */
7032 is_sub_constant_expr (tree t)
7034 bool non_constant_p = false;
7035 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p);
7036 return !non_constant_p;
7039 /* If T represents a constant expression returns its reduced value.
7040 Otherwise return error_mark_node. If T is dependent, then
7044 cxx_constant_value (tree t)
7046 return cxx_eval_outermost_constant_expr (t, false);
7049 /* If T is a constant expression, returns its reduced value.
7050 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7051 Otherwise, returns a version of T without TREE_CONSTANT. */
7054 maybe_constant_value (tree t)
7058 if (type_dependent_expression_p (t)
7059 /* FIXME shouldn't check value-dependence first; see comment before
7060 value_dependent_expression_p. */
7061 || value_dependent_expression_p (t))
7064 r = cxx_eval_outermost_constant_expr (t, true);
7065 #ifdef ENABLE_CHECKING
7066 /* cp_tree_equal looks through NOPs, so allow them. */
7068 || CONVERT_EXPR_P (t)
7069 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
7070 || !cp_tree_equal (r, t));
7075 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7076 than wrapped in a TARGET_EXPR. */
7079 maybe_constant_init (tree t)
7081 t = maybe_constant_value (t);
7082 if (TREE_CODE (t) == TARGET_EXPR)
7084 tree init = TARGET_EXPR_INITIAL (t);
7085 if (TREE_CODE (init) == CONSTRUCTOR
7086 && TREE_CONSTANT (init))
7092 /* Return true if the object referred to by REF has automatic or thread
7095 enum { ck_ok, ck_bad, ck_unknown };
7097 check_automatic_or_tls (tree ref)
7099 enum machine_mode mode;
7100 HOST_WIDE_INT bitsize, bitpos;
7102 int volatilep = 0, unsignedp = 0;
7103 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
7104 &mode, &unsignedp, &volatilep, false);
7107 /* If there isn't a decl in the middle, we don't know the linkage here,
7108 and this isn't a constant expression anyway. */
7111 dk = decl_storage_duration (decl);
7112 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
7115 /* Return true if the DECL designates a builtin function that is
7116 morally constexpr, in the sense that its parameter types and
7117 return type are literal types and the compiler is allowed to
7118 fold its invocations. */
7121 morally_constexpr_builtin_function_p (tree decl)
7123 tree funtype = TREE_TYPE (decl);
7126 if (!is_builtin_fn (decl))
7128 if (!literal_type_p (TREE_TYPE (funtype)))
7130 for (t = TYPE_ARG_TYPES (funtype); t != NULL ; t = TREE_CHAIN (t))
7132 if (t == void_list_node)
7134 if (!literal_type_p (TREE_VALUE (t)))
7137 /* We assume no varargs builtins are suitable. */
7141 /* Return true if T denotes a constant expression, or potential constant
7142 expression if POTENTIAL is true.
7143 Issue diagnostic as appropriate under control of flags. Variables
7144 with static storage duration initialized by constant expressions
7145 are guaranteed to be statically initialized.
7149 6 An expression is a potential constant expression if it is
7150 a constant expression where all occurences of function
7151 parameters are replaced by arbitrary constant expressions
7152 of the appropriate type.
7154 2 A conditional expression is a constant expression unless it
7155 involves one of the following as a potentially evaluated
7156 subexpression (3.2), but subexpressions of logical AND (5.14),
7157 logical OR (5.15), and conditional (5.16) operations that are
7158 not evaluated are not considered. */
7161 potential_constant_expression (tree t, tsubst_flags_t flags)
7165 if (t == error_mark_node)
7167 if (TREE_THIS_VOLATILE (t))
7169 if (flags & tf_error)
7170 error ("expression %qE has side-effects", t);
7173 if (CONSTANT_CLASS_P (t))
7176 switch (TREE_CODE (t))
7184 /* -- this (5.1) unless it appears as the postfix-expression in a
7185 class member access expression, including the result of the
7186 implicit transformation in the body of the non-static
7187 member function (9.3.1); */
7188 if (is_this_parameter (t))
7190 if (flags & tf_error)
7191 error ("%qE is not a potential constant expression", t);
7196 case AGGR_INIT_EXPR:
7198 /* -- an invocation of a function other than a constexpr function
7199 or a constexpr constructor. */
7201 tree fun = get_function_named_in_call (t);
7202 const int nargs = call_expr_nargs (t);
7203 if (TREE_CODE (fun) != FUNCTION_DECL)
7205 if (potential_constant_expression (fun, flags))
7206 /* Might end up being a constant function pointer. */
7208 if (flags & tf_error)
7209 error ("%qE is not a function name", fun);
7212 /* Skip initial arguments to base constructors. */
7213 if (DECL_BASE_CONSTRUCTOR_P (fun))
7214 i = num_artificial_parms_for (fun);
7217 fun = DECL_ORIGIN (fun);
7218 if (builtin_valid_in_constant_expr_p (fun))
7220 if (!DECL_DECLARED_CONSTEXPR_P (fun)
7221 && !morally_constexpr_builtin_function_p (fun))
7223 if (flags & tf_error)
7224 error ("%qD is not %<constexpr%>", fun);
7227 for (; i < nargs; ++i)
7229 tree x = get_nth_callarg (t, i);
7230 /* A call to a non-static member function takes the
7231 address of the object as the first argument.
7232 But in a constant expression the address will be folded
7233 away, so look through it now. */
7234 if (i == 0 && DECL_NONSTATIC_MEMBER_P (fun)
7235 && !DECL_CONSTRUCTOR_P (fun))
7237 if (TREE_CODE (x) == ADDR_EXPR)
7238 x = TREE_OPERAND (x, 0);
7239 if (is_this_parameter (x))
7241 else if (!potential_constant_expression (x, flags))
7243 if (flags & tf_error)
7244 error ("object argument is not a potential constant "
7249 else if (!potential_constant_expression (x, flags))
7251 if (flags & tf_error)
7252 error ("argument in position %qP is not a "
7253 "potential constant expression", i);
7260 case NON_LVALUE_EXPR:
7261 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7262 -- an lvalue of integral type that refers to a non-volatile
7263 const variable or static data member initialized with
7264 constant expressions, or
7266 -- an lvalue of literal type that refers to non-volatile
7267 object defined with constexpr, or that refers to a
7268 sub-object of such an object; */
7269 return potential_constant_expression (TREE_OPERAND (t, 0), flags);
7272 if (!decl_constant_var_p (t))
7274 if (flags & tf_error)
7275 error ("variable %qD is not declared constexpr", t);
7282 case VIEW_CONVERT_EXPR:
7283 /* -- an array-to-pointer conversion that is applied to an lvalue
7284 that designates an object with thread or automatic storage
7285 duration; FIXME not implemented as it breaks constexpr arrays;
7286 need to fix the standard
7287 -- a type conversion from a pointer or pointer-to-member type
7288 to a literal type. */
7290 tree from = TREE_OPERAND (t, 0);
7291 tree source = TREE_TYPE (from);
7292 tree target = TREE_TYPE (t);
7293 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target)
7294 && !(TREE_CODE (from) == COMPONENT_REF
7295 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0)))))
7297 if (flags & tf_error)
7298 error ("conversion of expression %qE of pointer type "
7299 "cannot yield a constant expression", from);
7302 return potential_constant_expression (from, flags);
7306 /* -- a unary operator & that is applied to an lvalue that
7307 designates an object with thread or automatic storage
7309 t = TREE_OPERAND (t, 0);
7310 i = check_automatic_or_tls (t);
7315 if (flags & tf_error)
7316 error ("address-of an object %qE with thread local or "
7317 "automatic storage is not a constant expression", t);
7320 return potential_constant_expression (t, flags);
7324 /* -- a class member access unless its postfix-expression is
7325 of literal type or of pointer to literal type. */
7326 /* This test would be redundant, as it follows from the
7327 postfix-expression being a potential constant expression. */
7328 return potential_constant_expression (TREE_OPERAND (t, 0), flags);
7332 tree x = TREE_OPERAND (t, 0);
7334 if (is_this_parameter (x))
7336 return potential_constant_expression (x, flags);
7340 case DYNAMIC_CAST_EXPR:
7341 case PSEUDO_DTOR_EXPR:
7342 case PREINCREMENT_EXPR:
7343 case POSTINCREMENT_EXPR:
7344 case PREDECREMENT_EXPR:
7345 case POSTDECREMENT_EXPR:
7349 case VEC_DELETE_EXPR:
7353 /* GCC internal stuff. */
7356 case WITH_CLEANUP_EXPR:
7357 case CLEANUP_POINT_EXPR:
7358 case MUST_NOT_THROW_EXPR:
7359 case TRY_CATCH_EXPR:
7360 case STATEMENT_LIST:
7362 if (flags & tf_error)
7363 error ("expression %qE is not a constant-expression", t);
7367 /* -- a typeid expression whose operand is of polymorphic
7370 tree e = TREE_OPERAND (t, 0);
7371 if (!TYPE_P (e) && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
7373 if (flags & tf_error)
7374 error ("typeid-expression is not a constant expression "
7375 "because %qE is of polymorphic type", e);
7382 /* -- a subtraction where both operands are pointers. */
7383 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7384 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
7386 if (flags & tf_error)
7387 error ("difference of two pointer expressions is not "
7388 "a constant expression");
7399 /* -- a relational or equality operator where at least
7400 one of the operands is a pointer. */
7401 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7402 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
7404 if (flags & tf_error)
7405 error ("pointer comparison expression is not a "
7406 "constant expression");
7415 case FIX_TRUNC_EXPR:
7420 case TRUTH_NOT_EXPR:
7422 case FIXED_CONVERT_EXPR:
7423 /* For convenience. */
7425 return potential_constant_expression (TREE_OPERAND (t, 0), flags);
7429 return potential_constant_expression (TREE_OPERAND (t, 1), flags);
7433 VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t);
7434 constructor_elt *ce;
7435 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
7436 if (!potential_constant_expression (ce->value, flags))
7443 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
7444 || DECL_P (TREE_PURPOSE (t)));
7445 if (!potential_constant_expression (TREE_VALUE (t), flags))
7447 if (TREE_CHAIN (t) == NULL_TREE)
7449 return potential_constant_expression (TREE_CHAIN (t), flags);
7452 case TRUNC_DIV_EXPR:
7454 case FLOOR_DIV_EXPR:
7455 case ROUND_DIV_EXPR:
7456 case TRUNC_MOD_EXPR:
7458 case ROUND_MOD_EXPR:
7459 if (integer_zerop (maybe_constant_value (TREE_OPERAND (t, 1))))
7466 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7467 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7468 introduced by build_call_a. */
7469 tree op0 = TREE_OPERAND (t, 0);
7470 tree op1 = TREE_OPERAND (t, 1);
7472 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7473 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7474 return potential_constant_expression (op0, flags);
7479 /* If the first operand is the non-short-circuit constant, look at
7480 the second operand; otherwise we only care about the first one for
7482 case TRUTH_AND_EXPR:
7483 case TRUTH_ANDIF_EXPR:
7484 tmp = boolean_true_node;
7487 case TRUTH_ORIF_EXPR:
7488 tmp = boolean_false_node;
7490 if (TREE_OPERAND (t, 0) == tmp)
7491 return potential_constant_expression (TREE_OPERAND (t, 1), flags);
7493 return potential_constant_expression (TREE_OPERAND (t, 0), flags);
7496 case ARRAY_RANGE_REF:
7499 case POINTER_PLUS_EXPR:
7501 case EXACT_DIV_EXPR:
7519 for (i = 0; i < 2; ++i)
7520 if (!potential_constant_expression (TREE_OPERAND (t, i),
7527 /* If the condition is a known constant, we know which of the legs we
7528 care about; otherwise we only require that the condition and
7529 either of the legs be potentially constant. */
7530 tmp = TREE_OPERAND (t, 0);
7531 if (!potential_constant_expression (tmp, flags))
7533 else if (tmp == boolean_true_node)
7534 return potential_constant_expression (TREE_OPERAND (t, 1), flags);
7535 else if (tmp == boolean_false_node)
7536 return potential_constant_expression (TREE_OPERAND (t, 2), flags);
7537 for (i = 1; i < 3; ++i)
7538 if (potential_constant_expression (TREE_OPERAND (t, i), tf_none))
7540 if (flags & tf_error)
7541 error ("expression %qE is not a constant-expression", t);
7545 return VEC_INIT_EXPR_IS_CONSTEXPR (t);
7548 sorry ("unexpected ast of kind %s", tree_code_name[TREE_CODE (t)]);
7555 /* Constructor for a lambda expression. */
7558 build_lambda_expr (void)
7560 tree lambda = make_node (LAMBDA_EXPR);
7561 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
7562 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
7563 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
7564 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
7565 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
7569 /* Create the closure object for a LAMBDA_EXPR. */
7572 build_lambda_object (tree lambda_expr)
7574 /* Build aggregate constructor call.
7575 - cp_parser_braced_list
7576 - cp_parser_functional_cast */
7577 VEC(constructor_elt,gc) *elts = NULL;
7578 tree node, expr, type;
7579 location_t saved_loc;
7581 if (processing_template_decl)
7584 /* Make sure any error messages refer to the lambda-introducer. */
7585 saved_loc = input_location;
7586 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
7588 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
7590 node = TREE_CHAIN (node))
7592 tree field = TREE_PURPOSE (node);
7593 tree val = TREE_VALUE (node);
7598 /* Mere mortals can't copy arrays with aggregate initialization, so
7599 do some magic to make it work here. */
7600 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
7601 val = build_array_copy (val);
7602 else if (DECL_NORMAL_CAPTURE_P (field)
7603 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
7605 /* "the entities that are captured by copy are used to
7606 direct-initialize each corresponding non-static data
7607 member of the resulting closure object."
7609 There's normally no way to express direct-initialization
7610 from an element of a CONSTRUCTOR, so we build up a special
7611 TARGET_EXPR to bypass the usual copy-initialization. */
7612 val = force_rvalue (val);
7613 if (TREE_CODE (val) == TARGET_EXPR)
7614 TARGET_EXPR_DIRECT_INIT_P (val) = true;
7617 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
7620 expr = build_constructor (init_list_type_node, elts);
7621 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
7623 /* N2927: "[The closure] class type is not an aggregate."
7624 But we briefly treat it as an aggregate to make this simpler. */
7625 type = TREE_TYPE (lambda_expr);
7626 CLASSTYPE_NON_AGGREGATE (type) = 0;
7627 expr = finish_compound_literal (type, expr);
7628 CLASSTYPE_NON_AGGREGATE (type) = 1;
7630 input_location = saved_loc;
7634 /* Return an initialized RECORD_TYPE for LAMBDA.
7635 LAMBDA must have its explicit captures already. */
7638 begin_lambda_type (tree lambda)
7643 /* Unique name. This is just like an unnamed class, but we cannot use
7644 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
7646 name = make_lambda_name ();
7648 /* Create the new RECORD_TYPE for this lambda. */
7649 type = xref_tag (/*tag_code=*/record_type,
7651 /*scope=*/ts_within_enclosing_non_class,
7652 /*template_header_p=*/false);
7655 /* Designate it as a struct so that we can use aggregate initialization. */
7656 CLASSTYPE_DECLARED_CLASS (type) = false;
7658 /* Clear base types. */
7659 xref_basetypes (type, /*bases=*/NULL_TREE);
7661 /* Start the class. */
7662 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
7664 /* Cross-reference the expression and the type. */
7665 TREE_TYPE (lambda) = type;
7666 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
7671 /* Returns the type to use for the return type of the operator() of a
7675 lambda_return_type (tree expr)
7678 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
7680 warning (0, "cannot deduce lambda return type from a braced-init-list");
7681 return void_type_node;
7683 if (type_dependent_expression_p (expr))
7685 type = cxx_make_type (DECLTYPE_TYPE);
7686 DECLTYPE_TYPE_EXPR (type) = expr;
7687 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
7688 SET_TYPE_STRUCTURAL_EQUALITY (type);
7691 type = type_decays_to (unlowered_expr_type (expr));
7695 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
7699 lambda_function (tree lambda)
7702 if (TREE_CODE (lambda) == LAMBDA_EXPR)
7703 type = TREE_TYPE (lambda);
7706 gcc_assert (LAMBDA_TYPE_P (type));
7707 /* Don't let debug_tree cause instantiation. */
7708 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
7710 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
7711 /*protect=*/0, /*want_type=*/false);
7713 lambda = BASELINK_FUNCTIONS (lambda);
7717 /* Returns the type to use for the FIELD_DECL corresponding to the
7719 The caller should add REFERENCE_TYPE for capture by reference. */
7722 lambda_capture_field_type (tree expr)
7725 if (type_dependent_expression_p (expr))
7727 type = cxx_make_type (DECLTYPE_TYPE);
7728 DECLTYPE_TYPE_EXPR (type) = expr;
7729 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
7730 SET_TYPE_STRUCTURAL_EQUALITY (type);
7733 type = non_reference (unlowered_expr_type (expr));
7737 /* Recompute the return type for LAMBDA with body of the form:
7738 { return EXPR ; } */
7741 apply_lambda_return_type (tree lambda, tree return_type)
7743 tree fco = lambda_function (lambda);
7746 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
7748 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
7749 it would interfere with instantiating the closure type. */
7750 if (dependent_type_p (return_type))
7752 if (return_type == error_mark_node)
7755 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
7756 TREE_TYPE (METHOD_TYPE) == return-type */
7757 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
7759 result = DECL_RESULT (fco);
7760 if (result == NULL_TREE)
7763 /* We already have a DECL_RESULT from start_preparsed_function.
7764 Now we need to redo the work it and allocate_struct_function
7765 did to reflect the new type. */
7766 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
7767 TYPE_MAIN_VARIANT (return_type));
7768 DECL_ARTIFICIAL (result) = 1;
7769 DECL_IGNORED_P (result) = 1;
7770 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
7773 DECL_RESULT (fco) = result;
7775 if (!processing_template_decl && aggregate_value_p (result, fco))
7777 #ifdef PCC_STATIC_STRUCT_RETURN
7778 cfun->returns_pcc_struct = 1;
7780 cfun->returns_struct = 1;
7785 /* DECL is a local variable or parameter from the surrounding scope of a
7786 lambda-expression. Returns the decltype for a use of the capture field
7787 for DECL even if it hasn't been captured yet. */
7790 capture_decltype (tree decl)
7792 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
7793 /* FIXME do lookup instead of list walk? */
7794 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
7798 type = TREE_TYPE (TREE_PURPOSE (cap));
7800 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
7803 error ("%qD is not captured", decl);
7804 return error_mark_node;
7807 type = TREE_TYPE (decl);
7808 if (TREE_CODE (type) == REFERENCE_TYPE
7809 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
7810 type = TREE_TYPE (type);
7813 case CPLD_REFERENCE:
7814 type = TREE_TYPE (decl);
7815 if (TREE_CODE (type) != REFERENCE_TYPE)
7816 type = build_reference_type (TREE_TYPE (decl));
7823 if (TREE_CODE (type) != REFERENCE_TYPE)
7825 if (!LAMBDA_EXPR_MUTABLE_P (lam))
7826 type = cp_build_qualified_type (type, (cp_type_quals (type)
7828 type = build_reference_type (type);
7833 /* From an ID and INITIALIZER, create a capture (by reference if
7834 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
7838 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
7839 bool explicit_init_p)
7844 type = lambda_capture_field_type (initializer);
7847 type = build_reference_type (type);
7848 if (!real_lvalue_p (initializer))
7849 error ("cannot capture %qE by reference", initializer);
7852 /* Make member variable. */
7853 member = build_lang_decl (FIELD_DECL, id, type);
7854 if (!explicit_init_p)
7855 /* Normal captures are invisible to name lookup but uses are replaced
7856 with references to the capture field; we implement this by only
7857 really making them invisible in unevaluated context; see
7858 qualify_lookup. For now, let's make explicitly initialized captures
7860 DECL_NORMAL_CAPTURE_P (member) = true;
7862 /* Add it to the appropriate closure class if we've started it. */
7863 if (current_class_type && current_class_type == TREE_TYPE (lambda))
7864 finish_member_declaration (member);
7866 LAMBDA_EXPR_CAPTURE_LIST (lambda)
7867 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
7869 if (id == get_identifier ("__this"))
7871 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
7872 error ("already captured %<this%> in lambda expression");
7873 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
7879 /* Register all the capture members on the list CAPTURES, which is the
7880 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
7882 void register_capture_members (tree captures)
7886 register_capture_members (TREE_CHAIN (captures));
7887 finish_member_declaration (TREE_PURPOSE (captures));
7891 /* Given a FIELD_DECL decl belonging to a closure type, return a
7892 COMPONENT_REF of it relative to the 'this' parameter of the op() for
7896 thisify_lambda_field (tree decl)
7898 tree context = lambda_function (DECL_CONTEXT (decl));
7899 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
7901 tf_warning_or_error);
7902 return finish_non_static_data_member (decl, object,
7903 /*qualifying_scope*/NULL_TREE);
7906 /* Similar to add_capture, except this works on a stack of nested lambdas.
7907 BY_REFERENCE_P in this case is derived from the default capture mode.
7908 Returns the capture for the lambda at the bottom of the stack. */
7911 add_default_capture (tree lambda_stack, tree id, tree initializer)
7913 bool this_capture_p = (id == get_identifier ("__this"));
7915 tree member = NULL_TREE;
7917 tree saved_class_type = current_class_type;
7921 for (node = lambda_stack;
7923 node = TREE_CHAIN (node))
7925 tree lambda = TREE_VALUE (node);
7927 current_class_type = TREE_TYPE (lambda);
7928 member = add_capture (lambda,
7933 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
7934 == CPLD_REFERENCE)),
7935 /*explicit_init_p=*/false);
7936 initializer = thisify_lambda_field (member);
7939 current_class_type = saved_class_type;
7944 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
7945 INDIRECT_REF, possibly adding it through default capturing. */
7948 lambda_expr_this_capture (tree lambda)
7952 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
7954 /* Try to default capture 'this' if we can. */
7956 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
7958 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
7959 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
7960 tree init = NULL_TREE;
7962 /* If we are in a lambda function, we can move out until we hit:
7963 1. a non-lambda function,
7964 2. a lambda function capturing 'this', or
7965 3. a non-default capturing lambda function. */
7966 while (LAMBDA_FUNCTION_P (containing_function))
7969 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
7971 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
7973 /* An outer lambda has already captured 'this'. */
7974 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
7975 init = thisify_lambda_field (cap);
7979 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
7980 /* An outer lambda won't let us capture 'this'. */
7983 lambda_stack = tree_cons (NULL_TREE,
7987 containing_function = decl_function_context (containing_function);
7990 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
7991 && !LAMBDA_FUNCTION_P (containing_function))
7992 /* First parameter is 'this'. */
7993 init = DECL_ARGUMENTS (containing_function);
7996 this_capture = add_default_capture (lambda_stack,
7997 /*id=*/get_identifier ("__this"),
8003 error ("%<this%> was not captured for this lambda function");
8004 result = error_mark_node;
8008 /* To make sure that current_class_ref is for the lambda. */
8009 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
8011 result = finish_non_static_data_member (this_capture,
8013 /*qualifying_scope=*/NULL_TREE);
8015 /* If 'this' is captured, each use of 'this' is transformed into an
8016 access to the corresponding unnamed data member of the closure
8017 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8018 ensures that the transformed expression is an rvalue. ] */
8019 result = rvalue (result);
8025 /* Returns the method basetype of the innermost non-lambda function, or
8026 NULL_TREE if none. */
8029 nonlambda_method_basetype (void)
8032 if (!current_class_ref)
8035 type = current_class_type;
8036 if (!LAMBDA_TYPE_P (type))
8039 /* Find the nearest enclosing non-lambda function. */
8040 fn = TYPE_NAME (type);
8042 fn = decl_function_context (fn);
8043 while (fn && LAMBDA_FUNCTION_P (fn));
8045 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8048 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
8051 /* If the closure TYPE has a static op(), also add a conversion to function
8055 maybe_add_lambda_conv_op (tree type)
8057 bool nested = (current_function_decl != NULL_TREE);
8058 tree callop = lambda_function (type);
8059 tree rettype, name, fntype, fn, body, compound_stmt;
8060 tree thistype, stattype, statfn, convfn, call, arg;
8061 VEC (tree, gc) *argvec;
8063 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
8066 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
8067 FUNCTION_ARG_CHAIN (callop));
8069 /* First build up the conversion op. */
8071 rettype = build_pointer_type (stattype);
8072 name = mangle_conv_op_name_for_type (rettype);
8073 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
8074 fntype = build_method_type_directly (thistype, rettype, void_list_node);
8075 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
8076 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8078 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8079 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8080 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8082 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
8083 grokclassfn (type, fn, NO_SPECIAL);
8084 set_linkage_according_to_type (type, fn);
8085 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8086 DECL_IN_AGGR_P (fn) = 1;
8087 DECL_ARTIFICIAL (fn) = 1;
8088 DECL_NOT_REALLY_EXTERN (fn) = 1;
8089 DECL_DECLARED_INLINE_P (fn) = 1;
8090 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
8092 DECL_INTERFACE_KNOWN (fn) = 1;
8094 add_method (type, fn, NULL_TREE);
8096 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8097 the conversion op is used. */
8098 if (varargs_function_p (callop))
8100 DECL_DELETED_FN (fn) = 1;
8104 /* Now build up the thunk to be returned. */
8106 name = get_identifier ("_FUN");
8107 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
8108 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8109 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8110 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8111 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8112 grokclassfn (type, fn, NO_SPECIAL);
8113 set_linkage_according_to_type (type, fn);
8114 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8115 DECL_IN_AGGR_P (fn) = 1;
8116 DECL_ARTIFICIAL (fn) = 1;
8117 DECL_NOT_REALLY_EXTERN (fn) = 1;
8118 DECL_DECLARED_INLINE_P (fn) = 1;
8119 DECL_STATIC_FUNCTION_P (fn) = 1;
8120 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
8121 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
8122 DECL_CONTEXT (arg) = fn;
8124 DECL_INTERFACE_KNOWN (fn) = 1;
8126 add_method (type, fn, NULL_TREE);
8129 push_function_context ();
8131 /* Generate the body of the thunk. */
8133 start_preparsed_function (statfn, NULL_TREE,
8134 SF_PRE_PARSED | SF_INCLASS_INLINE);
8135 if (DECL_ONE_ONLY (statfn))
8137 /* Put the thunk in the same comdat group as the call op. */
8138 struct cgraph_node *callop_node, *thunk_node;
8139 DECL_COMDAT_GROUP (statfn) = DECL_COMDAT_GROUP (callop);
8140 callop_node = cgraph_node (callop);
8141 thunk_node = cgraph_node (statfn);
8142 gcc_assert (callop_node->same_comdat_group == NULL);
8143 gcc_assert (thunk_node->same_comdat_group == NULL);
8144 callop_node->same_comdat_group = thunk_node;
8145 thunk_node->same_comdat_group = callop_node;
8147 body = begin_function_body ();
8148 compound_stmt = begin_compound_stmt (0);
8150 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
8152 argvec = make_tree_vector ();
8153 VEC_quick_push (tree, argvec, arg);
8154 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
8155 VEC_safe_push (tree, gc, argvec, arg);
8156 call = build_call_a (callop, VEC_length (tree, argvec),
8157 VEC_address (tree, argvec));
8158 CALL_FROM_THUNK_P (call) = 1;
8159 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
8160 call = build_cplus_new (TREE_TYPE (call), call);
8161 call = convert_from_reference (call);
8162 finish_return_stmt (call);
8164 finish_compound_stmt (compound_stmt);
8165 finish_function_body (body);
8167 expand_or_defer_fn (finish_function (2));
8169 /* Generate the body of the conversion op. */
8171 start_preparsed_function (convfn, NULL_TREE,
8172 SF_PRE_PARSED | SF_INCLASS_INLINE);
8173 body = begin_function_body ();
8174 compound_stmt = begin_compound_stmt (0);
8176 finish_return_stmt (decay_conversion (statfn));
8178 finish_compound_stmt (compound_stmt);
8179 finish_function_body (body);
8181 expand_or_defer_fn (finish_function (2));
8184 pop_function_context ();
8186 #include "gt-cp-semantics.h"