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"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree maybe_convert_cond (tree);
57 static tree finalize_nrv_r (tree *, int *, void *);
58 static tree capture_decltype (tree);
59 static tree thisify_lambda_field (tree);
62 /* Deferred Access Checking Overview
63 ---------------------------------
65 Most C++ expressions and declarations require access checking
66 to be performed during parsing. However, in several cases,
67 this has to be treated differently.
69 For member declarations, access checking has to be deferred
70 until more information about the declaration is known. For
82 When we are parsing the function return type `A::X', we don't
83 really know if this is allowed until we parse the function name.
85 Furthermore, some contexts require that access checking is
86 never performed at all. These include class heads, and template
89 Typical use of access checking functions is described here:
91 1. When we enter a context that requires certain access checking
92 mode, the function `push_deferring_access_checks' is called with
93 DEFERRING argument specifying the desired mode. Access checking
94 may be performed immediately (dk_no_deferred), deferred
95 (dk_deferred), or not performed (dk_no_check).
97 2. When a declaration such as a type, or a variable, is encountered,
98 the function `perform_or_defer_access_check' is called. It
99 maintains a VEC of all deferred checks.
101 3. The global `current_class_type' or `current_function_decl' is then
102 setup by the parser. `enforce_access' relies on these information
105 4. Upon exiting the context mentioned in step 1,
106 `perform_deferred_access_checks' is called to check all declaration
107 stored in the VEC. `pop_deferring_access_checks' is then
108 called to restore the previous access checking mode.
110 In case of parsing error, we simply call `pop_deferring_access_checks'
111 without `perform_deferred_access_checks'. */
113 typedef struct GTY(()) deferred_access {
114 /* A VEC representing name-lookups for which we have deferred
115 checking access controls. We cannot check the accessibility of
116 names used in a decl-specifier-seq until we know what is being
117 declared because code like:
124 A::B* A::f() { return 0; }
126 is valid, even though `A::B' is not generally accessible. */
127 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
129 /* The current mode of access checks. */
130 enum deferring_kind deferring_access_checks_kind;
133 DEF_VEC_O (deferred_access);
134 DEF_VEC_ALLOC_O (deferred_access,gc);
136 /* Data for deferred access checking. */
137 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
138 static GTY(()) unsigned deferred_access_no_check;
140 /* Save the current deferred access states and start deferred
141 access checking iff DEFER_P is true. */
144 push_deferring_access_checks (deferring_kind deferring)
146 /* For context like template instantiation, access checking
147 disabling applies to all nested context. */
148 if (deferred_access_no_check || deferring == dk_no_check)
149 deferred_access_no_check++;
152 deferred_access *ptr;
154 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
155 ptr->deferred_access_checks = NULL;
156 ptr->deferring_access_checks_kind = deferring;
160 /* Resume deferring access checks again after we stopped doing
164 resume_deferring_access_checks (void)
166 if (!deferred_access_no_check)
167 VEC_last (deferred_access, deferred_access_stack)
168 ->deferring_access_checks_kind = dk_deferred;
171 /* Stop deferring access checks. */
174 stop_deferring_access_checks (void)
176 if (!deferred_access_no_check)
177 VEC_last (deferred_access, deferred_access_stack)
178 ->deferring_access_checks_kind = dk_no_deferred;
181 /* Discard the current deferred access checks and restore the
185 pop_deferring_access_checks (void)
187 if (deferred_access_no_check)
188 deferred_access_no_check--;
190 VEC_pop (deferred_access, deferred_access_stack);
193 /* Returns a TREE_LIST representing the deferred checks.
194 The TREE_PURPOSE of each node is the type through which the
195 access occurred; the TREE_VALUE is the declaration named.
198 VEC (deferred_access_check,gc)*
199 get_deferred_access_checks (void)
201 if (deferred_access_no_check)
204 return (VEC_last (deferred_access, deferred_access_stack)
205 ->deferred_access_checks);
208 /* Take current deferred checks and combine with the
209 previous states if we also defer checks previously.
210 Otherwise perform checks now. */
213 pop_to_parent_deferring_access_checks (void)
215 if (deferred_access_no_check)
216 deferred_access_no_check--;
219 VEC (deferred_access_check,gc) *checks;
220 deferred_access *ptr;
222 checks = (VEC_last (deferred_access, deferred_access_stack)
223 ->deferred_access_checks);
225 VEC_pop (deferred_access, deferred_access_stack);
226 ptr = VEC_last (deferred_access, deferred_access_stack);
227 if (ptr->deferring_access_checks_kind == dk_no_deferred)
230 perform_access_checks (checks);
234 /* Merge with parent. */
236 deferred_access_check *chk, *probe;
239 VEC_iterate (deferred_access_check, checks, i, chk) ;
243 VEC_iterate (deferred_access_check,
244 ptr->deferred_access_checks, j, probe) ;
247 if (probe->binfo == chk->binfo &&
248 probe->decl == chk->decl &&
249 probe->diag_decl == chk->diag_decl)
252 /* Insert into parent's checks. */
253 VEC_safe_push (deferred_access_check, gc,
254 ptr->deferred_access_checks, chk);
261 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
262 is the BINFO indicating the qualifying scope used to access the
263 DECL node stored in the TREE_VALUE of the node. */
266 perform_access_checks (VEC (deferred_access_check,gc)* checks)
269 deferred_access_check *chk;
274 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
275 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
278 /* Perform the deferred access checks.
280 After performing the checks, we still have to keep the list
281 `deferred_access_stack->deferred_access_checks' since we may want
282 to check access for them again later in a different context.
289 A::X A::a, x; // No error for `A::a', error for `x'
291 We have to perform deferred access of `A::X', first with `A::a',
295 perform_deferred_access_checks (void)
297 perform_access_checks (get_deferred_access_checks ());
300 /* Defer checking the accessibility of DECL, when looked up in
301 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
304 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
307 deferred_access *ptr;
308 deferred_access_check *chk;
309 deferred_access_check *new_access;
312 /* Exit if we are in a context that no access checking is performed.
314 if (deferred_access_no_check)
317 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
319 ptr = VEC_last (deferred_access, deferred_access_stack);
321 /* If we are not supposed to defer access checks, just check now. */
322 if (ptr->deferring_access_checks_kind == dk_no_deferred)
324 enforce_access (binfo, decl, diag_decl);
328 /* See if we are already going to perform this check. */
330 VEC_iterate (deferred_access_check,
331 ptr->deferred_access_checks, i, chk) ;
334 if (chk->decl == decl && chk->binfo == binfo &&
335 chk->diag_decl == diag_decl)
340 /* If not, record the check. */
342 VEC_safe_push (deferred_access_check, gc,
343 ptr->deferred_access_checks, 0);
344 new_access->binfo = binfo;
345 new_access->decl = decl;
346 new_access->diag_decl = diag_decl;
349 /* Returns nonzero if the current statement is a full expression,
350 i.e. temporaries created during that statement should be destroyed
351 at the end of the statement. */
354 stmts_are_full_exprs_p (void)
356 return current_stmt_tree ()->stmts_are_full_exprs_p;
359 /* T is a statement. Add it to the statement-tree. This is the C++
360 version. The C/ObjC frontends have a slightly different version of
366 enum tree_code code = TREE_CODE (t);
368 if (EXPR_P (t) && code != LABEL_EXPR)
370 if (!EXPR_HAS_LOCATION (t))
371 SET_EXPR_LOCATION (t, input_location);
373 /* When we expand a statement-tree, we must know whether or not the
374 statements are full-expressions. We record that fact here. */
375 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
378 /* Add T to the statement-tree. Non-side-effect statements need to be
379 recorded during statement expressions. */
380 append_to_statement_list_force (t, &cur_stmt_list);
385 /* Returns the stmt_tree to which statements are currently being added. */
388 current_stmt_tree (void)
391 ? &cfun->language->base.x_stmt_tree
392 : &scope_chain->x_stmt_tree);
395 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
398 maybe_cleanup_point_expr (tree expr)
400 if (!processing_template_decl && stmts_are_full_exprs_p ())
401 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
405 /* Like maybe_cleanup_point_expr except have the type of the new expression be
406 void so we don't need to create a temporary variable to hold the inner
407 expression. The reason why we do this is because the original type might be
408 an aggregate and we cannot create a temporary variable for that type. */
411 maybe_cleanup_point_expr_void (tree expr)
413 if (!processing_template_decl && stmts_are_full_exprs_p ())
414 expr = fold_build_cleanup_point_expr (void_type_node, expr);
420 /* Create a declaration statement for the declaration given by the DECL. */
423 add_decl_expr (tree decl)
425 tree r = build_stmt (input_location, DECL_EXPR, decl);
426 if (DECL_INITIAL (decl)
427 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
428 r = maybe_cleanup_point_expr_void (r);
432 /* Finish a scope. */
435 do_poplevel (tree stmt_list)
439 if (stmts_are_full_exprs_p ())
440 block = poplevel (kept_level_p (), 1, 0);
442 stmt_list = pop_stmt_list (stmt_list);
444 if (!processing_template_decl)
446 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
447 /* ??? See c_end_compound_stmt re statement expressions. */
453 /* Begin a new scope. */
456 do_pushlevel (scope_kind sk)
458 tree ret = push_stmt_list ();
459 if (stmts_are_full_exprs_p ())
460 begin_scope (sk, NULL);
464 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
465 when the current scope is exited. EH_ONLY is true when this is not
466 meant to apply to normal control flow transfer. */
469 push_cleanup (tree decl, tree cleanup, bool eh_only)
471 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
472 CLEANUP_EH_ONLY (stmt) = eh_only;
474 CLEANUP_BODY (stmt) = push_stmt_list ();
477 /* Begin a conditional that might contain a declaration. When generating
478 normal code, we want the declaration to appear before the statement
479 containing the conditional. When generating template code, we want the
480 conditional to be rendered as the raw DECL_EXPR. */
483 begin_cond (tree *cond_p)
485 if (processing_template_decl)
486 *cond_p = push_stmt_list ();
489 /* Finish such a conditional. */
492 finish_cond (tree *cond_p, tree expr)
494 if (processing_template_decl)
496 tree cond = pop_stmt_list (*cond_p);
497 if (TREE_CODE (cond) == DECL_EXPR)
500 if (check_for_bare_parameter_packs (expr))
501 *cond_p = error_mark_node;
506 /* If *COND_P specifies a conditional with a declaration, transform the
509 for (; A x = 42;) { }
511 while (true) { A x = 42; if (!x) break; }
512 for (;;) { A x = 42; if (!x) break; }
513 The statement list for BODY will be empty if the conditional did
514 not declare anything. */
517 simplify_loop_decl_cond (tree *cond_p, tree body)
521 if (!TREE_SIDE_EFFECTS (body))
525 *cond_p = boolean_true_node;
527 if_stmt = begin_if_stmt ();
528 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
529 finish_if_stmt_cond (cond, if_stmt);
530 finish_break_stmt ();
531 finish_then_clause (if_stmt);
532 finish_if_stmt (if_stmt);
535 /* Finish a goto-statement. */
538 finish_goto_stmt (tree destination)
540 if (TREE_CODE (destination) == IDENTIFIER_NODE)
541 destination = lookup_label (destination);
543 /* We warn about unused labels with -Wunused. That means we have to
544 mark the used labels as used. */
545 if (TREE_CODE (destination) == LABEL_DECL)
546 TREE_USED (destination) = 1;
549 if (!processing_template_decl)
551 destination = cp_convert (ptr_type_node, destination);
552 if (error_operand_p (destination))
555 /* We don't inline calls to functions with computed gotos.
556 Those functions are typically up to some funny business,
557 and may be depending on the labels being at particular
558 addresses, or some such. */
559 DECL_UNINLINABLE (current_function_decl) = 1;
562 check_goto (destination);
564 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
567 /* COND is the condition-expression for an if, while, etc.,
568 statement. Convert it to a boolean value, if appropriate.
569 In addition, verify sequence points if -Wsequence-point is enabled. */
572 maybe_convert_cond (tree cond)
574 /* Empty conditions remain empty. */
578 /* Wait until we instantiate templates before doing conversion. */
579 if (processing_template_decl)
582 if (warn_sequence_point)
583 verify_sequence_points (cond);
585 /* Do the conversion. */
586 cond = convert_from_reference (cond);
588 if (TREE_CODE (cond) == MODIFY_EXPR
589 && !TREE_NO_WARNING (cond)
592 warning (OPT_Wparentheses,
593 "suggest parentheses around assignment used as truth value");
594 TREE_NO_WARNING (cond) = 1;
597 return condition_conversion (cond);
600 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
603 finish_expr_stmt (tree expr)
607 if (expr != NULL_TREE)
609 if (!processing_template_decl)
611 if (warn_sequence_point)
612 verify_sequence_points (expr);
613 expr = convert_to_void (expr, "statement", tf_warning_or_error);
615 else if (!type_dependent_expression_p (expr))
616 convert_to_void (build_non_dependent_expr (expr), "statement",
617 tf_warning_or_error);
619 if (check_for_bare_parameter_packs (expr))
620 expr = error_mark_node;
622 /* Simplification of inner statement expressions, compound exprs,
623 etc can result in us already having an EXPR_STMT. */
624 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
626 if (TREE_CODE (expr) != EXPR_STMT)
627 expr = build_stmt (input_location, EXPR_STMT, expr);
628 expr = maybe_cleanup_point_expr_void (expr);
640 /* Begin an if-statement. Returns a newly created IF_STMT if
647 scope = do_pushlevel (sk_block);
648 r = build_stmt (input_location, IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
649 TREE_CHAIN (r) = scope;
650 begin_cond (&IF_COND (r));
654 /* Process the COND of an if-statement, which may be given by
658 finish_if_stmt_cond (tree cond, tree if_stmt)
660 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
662 THEN_CLAUSE (if_stmt) = push_stmt_list ();
665 /* Finish the then-clause of an if-statement, which may be given by
669 finish_then_clause (tree if_stmt)
671 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
675 /* Begin the else-clause of an if-statement. */
678 begin_else_clause (tree if_stmt)
680 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
683 /* Finish the else-clause of an if-statement, which may be given by
687 finish_else_clause (tree if_stmt)
689 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
692 /* Finish an if-statement. */
695 finish_if_stmt (tree if_stmt)
697 tree scope = TREE_CHAIN (if_stmt);
698 TREE_CHAIN (if_stmt) = NULL;
699 add_stmt (do_poplevel (scope));
703 /* Begin a while-statement. Returns a newly created WHILE_STMT if
707 begin_while_stmt (void)
710 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
712 WHILE_BODY (r) = do_pushlevel (sk_block);
713 begin_cond (&WHILE_COND (r));
717 /* Process the COND of a while-statement, which may be given by
721 finish_while_stmt_cond (tree cond, tree while_stmt)
723 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
724 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
727 /* Finish a while-statement, which may be given by WHILE_STMT. */
730 finish_while_stmt (tree while_stmt)
732 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
736 /* Begin a do-statement. Returns a newly created DO_STMT if
742 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
744 DO_BODY (r) = push_stmt_list ();
748 /* Finish the body of a do-statement, which may be given by DO_STMT. */
751 finish_do_body (tree do_stmt)
753 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
755 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
756 body = STATEMENT_LIST_TAIL (body)->stmt;
758 if (IS_EMPTY_STMT (body))
759 warning (OPT_Wempty_body,
760 "suggest explicit braces around empty body in %<do%> statement");
763 /* Finish a do-statement, which may be given by DO_STMT, and whose
764 COND is as indicated. */
767 finish_do_stmt (tree cond, tree do_stmt)
769 cond = maybe_convert_cond (cond);
770 DO_COND (do_stmt) = cond;
774 /* Finish a return-statement. The EXPRESSION returned, if any, is as
778 finish_return_stmt (tree expr)
783 expr = check_return_expr (expr, &no_warning);
785 if (flag_openmp && !check_omp_return ())
786 return error_mark_node;
787 if (!processing_template_decl)
789 if (warn_sequence_point)
790 verify_sequence_points (expr);
792 if (DECL_DESTRUCTOR_P (current_function_decl)
793 || (DECL_CONSTRUCTOR_P (current_function_decl)
794 && targetm.cxx.cdtor_returns_this ()))
796 /* Similarly, all destructors must run destructors for
797 base-classes before returning. So, all returns in a
798 destructor get sent to the DTOR_LABEL; finish_function emits
799 code to return a value there. */
800 return finish_goto_stmt (cdtor_label);
804 r = build_stmt (input_location, RETURN_EXPR, expr);
805 TREE_NO_WARNING (r) |= no_warning;
806 r = maybe_cleanup_point_expr_void (r);
813 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
816 begin_for_stmt (void)
820 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
821 NULL_TREE, NULL_TREE);
823 if (flag_new_for_scope > 0)
824 TREE_CHAIN (r) = do_pushlevel (sk_for);
826 if (processing_template_decl)
827 FOR_INIT_STMT (r) = push_stmt_list ();
832 /* Finish the for-init-statement of a for-statement, which may be
833 given by FOR_STMT. */
836 finish_for_init_stmt (tree for_stmt)
838 if (processing_template_decl)
839 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
841 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
842 begin_cond (&FOR_COND (for_stmt));
845 /* Finish the COND of a for-statement, which may be given by
849 finish_for_cond (tree cond, tree for_stmt)
851 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
852 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
855 /* Finish the increment-EXPRESSION in a for-statement, which may be
856 given by FOR_STMT. */
859 finish_for_expr (tree expr, tree for_stmt)
863 /* If EXPR is an overloaded function, issue an error; there is no
864 context available to use to perform overload resolution. */
865 if (type_unknown_p (expr))
867 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
868 expr = error_mark_node;
870 if (!processing_template_decl)
872 if (warn_sequence_point)
873 verify_sequence_points (expr);
874 expr = convert_to_void (expr, "3rd expression in for",
875 tf_warning_or_error);
877 else if (!type_dependent_expression_p (expr))
878 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
879 tf_warning_or_error);
880 expr = maybe_cleanup_point_expr_void (expr);
881 if (check_for_bare_parameter_packs (expr))
882 expr = error_mark_node;
883 FOR_EXPR (for_stmt) = expr;
886 /* Finish the body of a for-statement, which may be given by
887 FOR_STMT. The increment-EXPR for the loop must be
891 finish_for_stmt (tree for_stmt)
893 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
895 /* Pop the scope for the body of the loop. */
896 if (flag_new_for_scope > 0)
898 tree scope = TREE_CHAIN (for_stmt);
899 TREE_CHAIN (for_stmt) = NULL;
900 add_stmt (do_poplevel (scope));
906 /* Finish a break-statement. */
909 finish_break_stmt (void)
911 return add_stmt (build_stmt (input_location, BREAK_STMT));
914 /* Finish a continue-statement. */
917 finish_continue_stmt (void)
919 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
922 /* Begin a switch-statement. Returns a new SWITCH_STMT if
926 begin_switch_stmt (void)
930 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
932 scope = do_pushlevel (sk_block);
933 TREE_CHAIN (r) = scope;
934 begin_cond (&SWITCH_STMT_COND (r));
939 /* Finish the cond of a switch-statement. */
942 finish_switch_cond (tree cond, tree switch_stmt)
944 tree orig_type = NULL;
945 if (!processing_template_decl)
947 /* Convert the condition to an integer or enumeration type. */
948 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
949 if (cond == NULL_TREE)
951 error ("switch quantity not an integer");
952 cond = error_mark_node;
954 orig_type = TREE_TYPE (cond);
955 if (cond != error_mark_node)
959 Integral promotions are performed. */
960 cond = perform_integral_promotions (cond);
961 cond = maybe_cleanup_point_expr (cond);
964 if (check_for_bare_parameter_packs (cond))
965 cond = error_mark_node;
966 else if (!processing_template_decl && warn_sequence_point)
967 verify_sequence_points (cond);
969 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
970 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
971 add_stmt (switch_stmt);
972 push_switch (switch_stmt);
973 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
976 /* Finish the body of a switch-statement, which may be given by
977 SWITCH_STMT. The COND to switch on is indicated. */
980 finish_switch_stmt (tree switch_stmt)
984 SWITCH_STMT_BODY (switch_stmt) =
985 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
989 scope = TREE_CHAIN (switch_stmt);
990 TREE_CHAIN (switch_stmt) = NULL;
991 add_stmt (do_poplevel (scope));
994 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
998 begin_try_block (void)
1000 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1002 TRY_STMTS (r) = push_stmt_list ();
1006 /* Likewise, for a function-try-block. The block returned in
1007 *COMPOUND_STMT is an artificial outer scope, containing the
1008 function-try-block. */
1011 begin_function_try_block (tree *compound_stmt)
1014 /* This outer scope does not exist in the C++ standard, but we need
1015 a place to put __FUNCTION__ and similar variables. */
1016 *compound_stmt = begin_compound_stmt (0);
1017 r = begin_try_block ();
1018 FN_TRY_BLOCK_P (r) = 1;
1022 /* Finish a try-block, which may be given by TRY_BLOCK. */
1025 finish_try_block (tree try_block)
1027 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1028 TRY_HANDLERS (try_block) = push_stmt_list ();
1031 /* Finish the body of a cleanup try-block, which may be given by
1035 finish_cleanup_try_block (tree try_block)
1037 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1040 /* Finish an implicitly generated try-block, with a cleanup is given
1044 finish_cleanup (tree cleanup, tree try_block)
1046 TRY_HANDLERS (try_block) = cleanup;
1047 CLEANUP_P (try_block) = 1;
1050 /* Likewise, for a function-try-block. */
1053 finish_function_try_block (tree try_block)
1055 finish_try_block (try_block);
1056 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1057 the try block, but moving it inside. */
1058 in_function_try_handler = 1;
1061 /* Finish a handler-sequence for a try-block, which may be given by
1065 finish_handler_sequence (tree try_block)
1067 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1068 check_handlers (TRY_HANDLERS (try_block));
1071 /* Finish the handler-seq for a function-try-block, given by
1072 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1073 begin_function_try_block. */
1076 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1078 in_function_try_handler = 0;
1079 finish_handler_sequence (try_block);
1080 finish_compound_stmt (compound_stmt);
1083 /* Begin a handler. Returns a HANDLER if appropriate. */
1086 begin_handler (void)
1090 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1093 /* Create a binding level for the eh_info and the exception object
1095 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1100 /* Finish the handler-parameters for a handler, which may be given by
1101 HANDLER. DECL is the declaration for the catch parameter, or NULL
1102 if this is a `catch (...)' clause. */
1105 finish_handler_parms (tree decl, tree handler)
1107 tree type = NULL_TREE;
1108 if (processing_template_decl)
1112 decl = pushdecl (decl);
1113 decl = push_template_decl (decl);
1114 HANDLER_PARMS (handler) = decl;
1115 type = TREE_TYPE (decl);
1119 type = expand_start_catch_block (decl);
1120 HANDLER_TYPE (handler) = type;
1121 if (!processing_template_decl && type)
1122 mark_used (eh_type_info (type));
1125 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1126 the return value from the matching call to finish_handler_parms. */
1129 finish_handler (tree handler)
1131 if (!processing_template_decl)
1132 expand_end_catch_block ();
1133 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1136 /* Begin a compound statement. FLAGS contains some bits that control the
1137 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1138 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1139 block of a function. If BCS_TRY_BLOCK is set, this is the block
1140 created on behalf of a TRY statement. Returns a token to be passed to
1141 finish_compound_stmt. */
1144 begin_compound_stmt (unsigned int flags)
1148 if (flags & BCS_NO_SCOPE)
1150 r = push_stmt_list ();
1151 STATEMENT_LIST_NO_SCOPE (r) = 1;
1153 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1154 But, if it's a statement-expression with a scopeless block, there's
1155 nothing to keep, and we don't want to accidentally keep a block
1156 *inside* the scopeless block. */
1157 keep_next_level (false);
1160 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1162 /* When processing a template, we need to remember where the braces were,
1163 so that we can set up identical scopes when instantiating the template
1164 later. BIND_EXPR is a handy candidate for this.
1165 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1166 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1167 processing templates. */
1168 if (processing_template_decl)
1170 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1171 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1172 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1173 TREE_SIDE_EFFECTS (r) = 1;
1179 /* Finish a compound-statement, which is given by STMT. */
1182 finish_compound_stmt (tree stmt)
1184 if (TREE_CODE (stmt) == BIND_EXPR)
1185 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1186 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1187 stmt = pop_stmt_list (stmt);
1190 /* Destroy any ObjC "super" receivers that may have been
1192 objc_clear_super_receiver ();
1194 stmt = do_poplevel (stmt);
1197 /* ??? See c_end_compound_stmt wrt statement expressions. */
1202 /* Finish an asm-statement, whose components are a STRING, some
1203 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1204 LABELS. Also note whether the asm-statement should be
1205 considered volatile. */
1208 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1209 tree input_operands, tree clobbers, tree labels)
1213 int ninputs = list_length (input_operands);
1214 int noutputs = list_length (output_operands);
1216 if (!processing_template_decl)
1218 const char *constraint;
1219 const char **oconstraints;
1220 bool allows_mem, allows_reg, is_inout;
1224 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1226 string = resolve_asm_operand_names (string, output_operands,
1227 input_operands, labels);
1229 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1231 operand = TREE_VALUE (t);
1233 /* ??? Really, this should not be here. Users should be using a
1234 proper lvalue, dammit. But there's a long history of using
1235 casts in the output operands. In cases like longlong.h, this
1236 becomes a primitive form of typechecking -- if the cast can be
1237 removed, then the output operand had a type of the proper width;
1238 otherwise we'll get an error. Gross, but ... */
1239 STRIP_NOPS (operand);
1241 operand = mark_lvalue_use (operand);
1243 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1244 operand = error_mark_node;
1246 if (operand != error_mark_node
1247 && (TREE_READONLY (operand)
1248 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1249 /* Functions are not modifiable, even though they are
1251 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1252 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1253 /* If it's an aggregate and any field is const, then it is
1254 effectively const. */
1255 || (CLASS_TYPE_P (TREE_TYPE (operand))
1256 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1257 readonly_error (operand, REK_ASSIGNMENT_ASM);
1259 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1260 oconstraints[i] = constraint;
1262 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1263 &allows_mem, &allows_reg, &is_inout))
1265 /* If the operand is going to end up in memory,
1266 mark it addressable. */
1267 if (!allows_reg && !cxx_mark_addressable (operand))
1268 operand = error_mark_node;
1271 operand = error_mark_node;
1273 TREE_VALUE (t) = operand;
1276 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1278 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1279 operand = decay_conversion (TREE_VALUE (t));
1281 /* If the type of the operand hasn't been determined (e.g.,
1282 because it involves an overloaded function), then issue
1283 an error message. There's no context available to
1284 resolve the overloading. */
1285 if (TREE_TYPE (operand) == unknown_type_node)
1287 error ("type of asm operand %qE could not be determined",
1289 operand = error_mark_node;
1292 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1293 oconstraints, &allows_mem, &allows_reg))
1295 /* If the operand is going to end up in memory,
1296 mark it addressable. */
1297 if (!allows_reg && allows_mem)
1299 /* Strip the nops as we allow this case. FIXME, this really
1300 should be rejected or made deprecated. */
1301 STRIP_NOPS (operand);
1302 if (!cxx_mark_addressable (operand))
1303 operand = error_mark_node;
1307 operand = error_mark_node;
1309 TREE_VALUE (t) = operand;
1313 r = build_stmt (input_location, ASM_EXPR, string,
1314 output_operands, input_operands,
1316 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1317 r = maybe_cleanup_point_expr_void (r);
1318 return add_stmt (r);
1321 /* Finish a label with the indicated NAME. Returns the new label. */
1324 finish_label_stmt (tree name)
1326 tree decl = define_label (input_location, name);
1328 if (decl == error_mark_node)
1329 return error_mark_node;
1331 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1336 /* Finish a series of declarations for local labels. G++ allows users
1337 to declare "local" labels, i.e., labels with scope. This extension
1338 is useful when writing code involving statement-expressions. */
1341 finish_label_decl (tree name)
1343 if (!at_function_scope_p ())
1345 error ("__label__ declarations are only allowed in function scopes");
1349 add_decl_expr (declare_local_label (name));
1352 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1355 finish_decl_cleanup (tree decl, tree cleanup)
1357 push_cleanup (decl, cleanup, false);
1360 /* If the current scope exits with an exception, run CLEANUP. */
1363 finish_eh_cleanup (tree cleanup)
1365 push_cleanup (NULL, cleanup, true);
1368 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1369 order they were written by the user. Each node is as for
1370 emit_mem_initializers. */
1373 finish_mem_initializers (tree mem_inits)
1375 /* Reorder the MEM_INITS so that they are in the order they appeared
1376 in the source program. */
1377 mem_inits = nreverse (mem_inits);
1379 if (processing_template_decl)
1383 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1385 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1386 check for bare parameter packs in the TREE_VALUE, because
1387 any parameter packs in the TREE_VALUE have already been
1388 bound as part of the TREE_PURPOSE. See
1389 make_pack_expansion for more information. */
1390 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1391 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1392 TREE_VALUE (mem) = error_mark_node;
1395 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1398 emit_mem_initializers (mem_inits);
1401 /* Finish a parenthesized expression EXPR. */
1404 finish_parenthesized_expr (tree expr)
1407 /* This inhibits warnings in c_common_truthvalue_conversion. */
1408 TREE_NO_WARNING (expr) = 1;
1410 if (TREE_CODE (expr) == OFFSET_REF)
1411 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1412 enclosed in parentheses. */
1413 PTRMEM_OK_P (expr) = 0;
1415 if (TREE_CODE (expr) == STRING_CST)
1416 PAREN_STRING_LITERAL_P (expr) = 1;
1421 /* Finish a reference to a non-static data member (DECL) that is not
1422 preceded by `.' or `->'. */
1425 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1427 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1431 tree scope = qualifying_scope;
1432 if (scope == NULL_TREE)
1433 scope = context_for_name_lookup (decl);
1434 object = maybe_dummy_object (scope, NULL);
1437 /* DR 613: Can use non-static data members without an associated
1438 object in sizeof/decltype/alignof. */
1439 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1440 && (!processing_template_decl || !current_class_ref))
1442 if (current_function_decl
1443 && DECL_STATIC_FUNCTION_P (current_function_decl))
1444 error ("invalid use of member %q+D in static member function", decl);
1446 error ("invalid use of non-static data member %q+D", decl);
1447 error ("from this location");
1449 return error_mark_node;
1452 if (current_class_ptr)
1453 TREE_USED (current_class_ptr) = 1;
1454 if (processing_template_decl && !qualifying_scope)
1456 tree type = TREE_TYPE (decl);
1458 if (TREE_CODE (type) == REFERENCE_TYPE)
1459 type = TREE_TYPE (type);
1462 /* Set the cv qualifiers. */
1463 int quals = (current_class_ref
1464 ? cp_type_quals (TREE_TYPE (current_class_ref))
1465 : TYPE_UNQUALIFIED);
1467 if (DECL_MUTABLE_P (decl))
1468 quals &= ~TYPE_QUAL_CONST;
1470 quals |= cp_type_quals (TREE_TYPE (decl));
1471 type = cp_build_qualified_type (type, quals);
1474 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1476 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1477 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1479 else if (processing_template_decl)
1480 return build_qualified_name (TREE_TYPE (decl),
1483 /*template_p=*/false);
1486 tree access_type = TREE_TYPE (object);
1488 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1491 /* If the data member was named `C::M', convert `*this' to `C'
1493 if (qualifying_scope)
1495 tree binfo = NULL_TREE;
1496 object = build_scoped_ref (object, qualifying_scope,
1500 return build_class_member_access_expr (object, decl,
1501 /*access_path=*/NULL_TREE,
1502 /*preserve_reference=*/false,
1503 tf_warning_or_error);
1507 /* If we are currently parsing a template and we encountered a typedef
1508 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1509 adds the typedef to a list tied to the current template.
1510 At tempate instantiatin time, that list is walked and access check
1511 performed for each typedef.
1512 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1515 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1517 location_t location)
1519 tree template_info = NULL;
1520 tree cs = current_scope ();
1522 if (!is_typedef_decl (typedef_decl)
1524 || !CLASS_TYPE_P (context)
1528 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1529 template_info = get_template_info (cs);
1532 && TI_TEMPLATE (template_info)
1533 && !currently_open_class (context))
1534 append_type_to_template_for_access_check (cs, typedef_decl,
1538 /* DECL was the declaration to which a qualified-id resolved. Issue
1539 an error message if it is not accessible. If OBJECT_TYPE is
1540 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1541 type of `*x', or `x', respectively. If the DECL was named as
1542 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1545 check_accessibility_of_qualified_id (tree decl,
1547 tree nested_name_specifier)
1550 tree qualifying_type = NULL_TREE;
1552 /* If we are parsing a template declaration and if decl is a typedef,
1553 add it to a list tied to the template.
1554 At template instantiation time, that list will be walked and
1555 access check performed. */
1556 add_typedef_to_current_template_for_access_check (decl,
1557 nested_name_specifier
1558 ? nested_name_specifier
1559 : DECL_CONTEXT (decl),
1562 /* If we're not checking, return immediately. */
1563 if (deferred_access_no_check)
1566 /* Determine the SCOPE of DECL. */
1567 scope = context_for_name_lookup (decl);
1568 /* If the SCOPE is not a type, then DECL is not a member. */
1569 if (!TYPE_P (scope))
1571 /* Compute the scope through which DECL is being accessed. */
1573 /* OBJECT_TYPE might not be a class type; consider:
1575 class A { typedef int I; };
1579 In this case, we will have "A::I" as the DECL, but "I" as the
1581 && CLASS_TYPE_P (object_type)
1582 && DERIVED_FROM_P (scope, object_type))
1583 /* If we are processing a `->' or `.' expression, use the type of the
1585 qualifying_type = object_type;
1586 else if (nested_name_specifier)
1588 /* If the reference is to a non-static member of the
1589 current class, treat it as if it were referenced through
1591 if (DECL_NONSTATIC_MEMBER_P (decl)
1592 && current_class_ptr
1593 && DERIVED_FROM_P (scope, current_class_type))
1594 qualifying_type = current_class_type;
1595 /* Otherwise, use the type indicated by the
1596 nested-name-specifier. */
1598 qualifying_type = nested_name_specifier;
1601 /* Otherwise, the name must be from the current class or one of
1603 qualifying_type = currently_open_derived_class (scope);
1606 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1607 or similar in a default argument value. */
1608 && CLASS_TYPE_P (qualifying_type)
1609 && !dependent_type_p (qualifying_type))
1610 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1614 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1615 class named to the left of the "::" operator. DONE is true if this
1616 expression is a complete postfix-expression; it is false if this
1617 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1618 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1619 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1620 is true iff this qualified name appears as a template argument. */
1623 finish_qualified_id_expr (tree qualifying_class,
1628 bool template_arg_p)
1630 gcc_assert (TYPE_P (qualifying_class));
1632 if (error_operand_p (expr))
1633 return error_mark_node;
1635 if (DECL_P (expr) || BASELINK_P (expr))
1639 check_template_keyword (expr);
1641 /* If EXPR occurs as the operand of '&', use special handling that
1642 permits a pointer-to-member. */
1643 if (address_p && done)
1645 if (TREE_CODE (expr) == SCOPE_REF)
1646 expr = TREE_OPERAND (expr, 1);
1647 expr = build_offset_ref (qualifying_class, expr,
1648 /*address_p=*/true);
1652 /* Within the scope of a class, turn references to non-static
1653 members into expression of the form "this->...". */
1655 /* But, within a template argument, we do not want make the
1656 transformation, as there is no "this" pointer. */
1658 else if (TREE_CODE (expr) == FIELD_DECL)
1660 push_deferring_access_checks (dk_no_check);
1661 expr = finish_non_static_data_member (expr, NULL_TREE,
1663 pop_deferring_access_checks ();
1665 else if (BASELINK_P (expr) && !processing_template_decl)
1669 /* See if any of the functions are non-static members. */
1670 /* If so, the expression may be relative to 'this'. */
1671 if (!shared_member_p (expr)
1672 && (ob = maybe_dummy_object (qualifying_class, NULL),
1673 !is_dummy_object (ob)))
1674 expr = (build_class_member_access_expr
1677 BASELINK_ACCESS_BINFO (expr),
1678 /*preserve_reference=*/false,
1679 tf_warning_or_error));
1681 /* The expression is a qualified name whose address is not
1683 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1689 /* Begin a statement-expression. The value returned must be passed to
1690 finish_stmt_expr. */
1693 begin_stmt_expr (void)
1695 return push_stmt_list ();
1698 /* Process the final expression of a statement expression. EXPR can be
1699 NULL, if the final expression is empty. Return a STATEMENT_LIST
1700 containing all the statements in the statement-expression, or
1701 ERROR_MARK_NODE if there was an error. */
1704 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1706 if (error_operand_p (expr))
1708 /* The type of the statement-expression is the type of the last
1710 TREE_TYPE (stmt_expr) = error_mark_node;
1711 return error_mark_node;
1714 /* If the last statement does not have "void" type, then the value
1715 of the last statement is the value of the entire expression. */
1718 tree type = TREE_TYPE (expr);
1720 if (processing_template_decl)
1722 expr = build_stmt (input_location, EXPR_STMT, expr);
1723 expr = add_stmt (expr);
1724 /* Mark the last statement so that we can recognize it as such at
1725 template-instantiation time. */
1726 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1728 else if (VOID_TYPE_P (type))
1730 /* Just treat this like an ordinary statement. */
1731 expr = finish_expr_stmt (expr);
1735 /* It actually has a value we need to deal with. First, force it
1736 to be an rvalue so that we won't need to build up a copy
1737 constructor call later when we try to assign it to something. */
1738 expr = force_rvalue (expr);
1739 if (error_operand_p (expr))
1740 return error_mark_node;
1742 /* Update for array-to-pointer decay. */
1743 type = TREE_TYPE (expr);
1745 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1746 normal statement, but don't convert to void or actually add
1748 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1749 expr = maybe_cleanup_point_expr (expr);
1753 /* The type of the statement-expression is the type of the last
1755 TREE_TYPE (stmt_expr) = type;
1761 /* Finish a statement-expression. EXPR should be the value returned
1762 by the previous begin_stmt_expr. Returns an expression
1763 representing the statement-expression. */
1766 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1771 if (error_operand_p (stmt_expr))
1773 pop_stmt_list (stmt_expr);
1774 return error_mark_node;
1777 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1779 type = TREE_TYPE (stmt_expr);
1780 result = pop_stmt_list (stmt_expr);
1781 TREE_TYPE (result) = type;
1783 if (processing_template_decl)
1785 result = build_min (STMT_EXPR, type, result);
1786 TREE_SIDE_EFFECTS (result) = 1;
1787 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1789 else if (CLASS_TYPE_P (type))
1791 /* Wrap the statement-expression in a TARGET_EXPR so that the
1792 temporary object created by the final expression is destroyed at
1793 the end of the full-expression containing the
1794 statement-expression. */
1795 result = force_target_expr (type, result);
1801 /* Returns the expression which provides the value of STMT_EXPR. */
1804 stmt_expr_value_expr (tree stmt_expr)
1806 tree t = STMT_EXPR_STMT (stmt_expr);
1808 if (TREE_CODE (t) == BIND_EXPR)
1809 t = BIND_EXPR_BODY (t);
1811 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1812 t = STATEMENT_LIST_TAIL (t)->stmt;
1814 if (TREE_CODE (t) == EXPR_STMT)
1815 t = EXPR_STMT_EXPR (t);
1820 /* Return TRUE iff EXPR_STMT is an empty list of
1821 expression statements. */
1824 empty_expr_stmt_p (tree expr_stmt)
1826 tree body = NULL_TREE;
1828 if (expr_stmt == void_zero_node)
1833 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1834 body = EXPR_STMT_EXPR (expr_stmt);
1835 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1841 if (TREE_CODE (body) == STATEMENT_LIST)
1842 return tsi_end_p (tsi_start (body));
1844 return empty_expr_stmt_p (body);
1849 /* Perform Koenig lookup. FN is the postfix-expression representing
1850 the function (or functions) to call; ARGS are the arguments to the
1851 call. Returns the functions to be considered by overload
1855 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1857 tree identifier = NULL_TREE;
1858 tree functions = NULL_TREE;
1859 tree tmpl_args = NULL_TREE;
1860 bool template_id = false;
1862 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1864 /* Use a separate flag to handle null args. */
1866 tmpl_args = TREE_OPERAND (fn, 1);
1867 fn = TREE_OPERAND (fn, 0);
1870 /* Find the name of the overloaded function. */
1871 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1873 else if (is_overloaded_fn (fn))
1876 identifier = DECL_NAME (get_first_fn (functions));
1878 else if (DECL_P (fn))
1881 identifier = DECL_NAME (fn);
1884 /* A call to a namespace-scope function using an unqualified name.
1886 Do Koenig lookup -- unless any of the arguments are
1888 if (!any_type_dependent_arguments_p (args)
1889 && !any_dependent_template_arguments_p (tmpl_args))
1891 fn = lookup_arg_dependent (identifier, functions, args);
1893 /* The unqualified name could not be resolved. */
1894 fn = unqualified_fn_lookup_error (identifier);
1897 if (fn && template_id)
1898 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1903 /* Generate an expression for `FN (ARGS)'. This may change the
1906 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1907 as a virtual call, even if FN is virtual. (This flag is set when
1908 encountering an expression where the function name is explicitly
1909 qualified. For example a call to `X::f' never generates a virtual
1912 Returns code for the call. */
1915 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1916 bool koenig_p, tsubst_flags_t complain)
1920 VEC(tree,gc) *orig_args = NULL;
1922 if (fn == error_mark_node)
1923 return error_mark_node;
1925 gcc_assert (!TYPE_P (fn));
1929 if (processing_template_decl)
1931 if (type_dependent_expression_p (fn)
1932 || any_type_dependent_arguments_p (*args))
1934 result = build_nt_call_vec (fn, *args);
1935 KOENIG_LOOKUP_P (result) = koenig_p;
1940 tree fndecl = OVL_CURRENT (fn);
1941 if (TREE_CODE (fndecl) != FUNCTION_DECL
1942 || !TREE_THIS_VOLATILE (fndecl))
1948 current_function_returns_abnormally = 1;
1952 orig_args = make_tree_vector_copy (*args);
1953 if (!BASELINK_P (fn)
1954 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1955 && TREE_TYPE (fn) != unknown_type_node)
1956 fn = build_non_dependent_expr (fn);
1957 make_args_non_dependent (*args);
1960 if (is_overloaded_fn (fn))
1961 fn = baselink_for_fns (fn);
1964 if (BASELINK_P (fn))
1968 /* A call to a member function. From [over.call.func]:
1970 If the keyword this is in scope and refers to the class of
1971 that member function, or a derived class thereof, then the
1972 function call is transformed into a qualified function call
1973 using (*this) as the postfix-expression to the left of the
1974 . operator.... [Otherwise] a contrived object of type T
1975 becomes the implied object argument.
1979 struct A { void f(); };
1980 struct B : public A {};
1981 struct C : public A { void g() { B::f(); }};
1983 "the class of that member function" refers to `A'. But 11.2
1984 [class.access.base] says that we need to convert 'this' to B* as
1985 part of the access, so we pass 'B' to maybe_dummy_object. */
1987 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1990 if (processing_template_decl)
1992 if (type_dependent_expression_p (object))
1994 tree ret = build_nt_call_vec (orig_fn, orig_args);
1995 release_tree_vector (orig_args);
1998 object = build_non_dependent_expr (object);
2001 result = build_new_method_call (object, fn, args, NULL_TREE,
2003 ? LOOKUP_NONVIRTUAL : 0),
2007 else if (is_overloaded_fn (fn))
2009 /* If the function is an overloaded builtin, resolve it. */
2010 if (TREE_CODE (fn) == FUNCTION_DECL
2011 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2012 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2013 result = resolve_overloaded_builtin (input_location, fn, *args);
2016 /* A call to a namespace-scope function. */
2017 result = build_new_function_call (fn, args, koenig_p, complain);
2019 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2021 if (!VEC_empty (tree, *args))
2022 error ("arguments to destructor are not allowed");
2023 /* Mark the pseudo-destructor call as having side-effects so
2024 that we do not issue warnings about its use. */
2025 result = build1 (NOP_EXPR,
2027 TREE_OPERAND (fn, 0));
2028 TREE_SIDE_EFFECTS (result) = 1;
2030 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2031 /* If the "function" is really an object of class type, it might
2032 have an overloaded `operator ()'. */
2033 result = build_op_call (fn, args, complain);
2036 /* A call where the function is unknown. */
2037 result = cp_build_function_call_vec (fn, args, complain);
2039 if (processing_template_decl)
2041 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2042 KOENIG_LOOKUP_P (result) = koenig_p;
2043 release_tree_vector (orig_args);
2049 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2050 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2051 POSTDECREMENT_EXPR.) */
2054 finish_increment_expr (tree expr, enum tree_code code)
2056 return build_x_unary_op (code, expr, tf_warning_or_error);
2059 /* Finish a use of `this'. Returns an expression for `this'. */
2062 finish_this_expr (void)
2066 if (current_class_ptr)
2068 tree type = TREE_TYPE (current_class_ref);
2070 /* In a lambda expression, 'this' refers to the captured 'this'. */
2071 if (LAMBDA_TYPE_P (type))
2072 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2074 result = current_class_ptr;
2077 else if (current_function_decl
2078 && DECL_STATIC_FUNCTION_P (current_function_decl))
2080 error ("%<this%> is unavailable for static member functions");
2081 result = error_mark_node;
2085 if (current_function_decl)
2086 error ("invalid use of %<this%> in non-member function");
2088 error ("invalid use of %<this%> at top level");
2089 result = error_mark_node;
2095 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2096 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2097 the TYPE for the type given. If SCOPE is non-NULL, the expression
2098 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2101 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2103 if (object == error_mark_node || destructor == error_mark_node)
2104 return error_mark_node;
2106 gcc_assert (TYPE_P (destructor));
2108 if (!processing_template_decl)
2110 if (scope == error_mark_node)
2112 error ("invalid qualifying scope in pseudo-destructor name");
2113 return error_mark_node;
2115 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2117 error ("qualified type %qT does not match destructor name ~%qT",
2119 return error_mark_node;
2123 /* [expr.pseudo] says both:
2125 The type designated by the pseudo-destructor-name shall be
2126 the same as the object type.
2130 The cv-unqualified versions of the object type and of the
2131 type designated by the pseudo-destructor-name shall be the
2134 We implement the more generous second sentence, since that is
2135 what most other compilers do. */
2136 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2139 error ("%qE is not of type %qT", object, destructor);
2140 return error_mark_node;
2144 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2147 /* Finish an expression of the form CODE EXPR. */
2150 finish_unary_op_expr (enum tree_code code, tree expr)
2152 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2153 /* Inside a template, build_x_unary_op does not fold the
2154 expression. So check whether the result is folded before
2155 setting TREE_NEGATED_INT. */
2156 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2157 && TREE_CODE (result) == INTEGER_CST
2158 && !TYPE_UNSIGNED (TREE_TYPE (result))
2159 && INT_CST_LT (result, integer_zero_node))
2161 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2162 setting TREE_NEGATED_INT. */
2163 result = copy_node (result);
2164 TREE_NEGATED_INT (result) = 1;
2166 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2167 overflow_warning (input_location, result);
2172 /* Finish a compound-literal expression. TYPE is the type to which
2173 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2176 finish_compound_literal (tree type, tree compound_literal)
2178 if (type == error_mark_node)
2179 return error_mark_node;
2181 if (!TYPE_OBJ_P (type))
2183 error ("compound literal of non-object type %qT", type);
2184 return error_mark_node;
2187 if (processing_template_decl)
2189 TREE_TYPE (compound_literal) = type;
2190 /* Mark the expression as a compound literal. */
2191 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2192 return compound_literal;
2195 type = complete_type (type);
2197 if (TYPE_NON_AGGREGATE_CLASS (type))
2199 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2200 everywhere that deals with function arguments would be a pain, so
2201 just wrap it in a TREE_LIST. The parser set a flag so we know
2202 that it came from T{} rather than T({}). */
2203 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2204 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2205 return build_functional_cast (type, compound_literal, tf_error);
2208 if (TREE_CODE (type) == ARRAY_TYPE
2209 && check_array_initializer (NULL_TREE, type, compound_literal))
2210 return error_mark_node;
2211 compound_literal = reshape_init (type, compound_literal);
2212 if (TREE_CODE (type) == ARRAY_TYPE)
2213 cp_complete_array_type (&type, compound_literal, false);
2214 compound_literal = digest_init (type, compound_literal);
2215 if ((!at_function_scope_p () || cp_type_readonly (type))
2216 && initializer_constant_valid_p (compound_literal, type))
2218 tree decl = create_temporary_var (type);
2219 DECL_INITIAL (decl) = compound_literal;
2220 TREE_STATIC (decl) = 1;
2221 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2222 decl = pushdecl_top_level (decl);
2223 DECL_NAME (decl) = make_anon_name ();
2224 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2228 return get_target_expr (compound_literal);
2231 /* Return the declaration for the function-name variable indicated by
2235 finish_fname (tree id)
2239 decl = fname_decl (input_location, C_RID_CODE (id), id);
2240 if (processing_template_decl)
2241 decl = DECL_NAME (decl);
2245 /* Finish a translation unit. */
2248 finish_translation_unit (void)
2250 /* In case there were missing closebraces,
2251 get us back to the global binding level. */
2253 while (current_namespace != global_namespace)
2256 /* Do file scope __FUNCTION__ et al. */
2257 finish_fname_decls ();
2260 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2261 Returns the parameter. */
2264 finish_template_type_parm (tree aggr, tree identifier)
2266 if (aggr != class_type_node)
2268 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2269 aggr = class_type_node;
2272 return build_tree_list (aggr, identifier);
2275 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2276 Returns the parameter. */
2279 finish_template_template_parm (tree aggr, tree identifier)
2281 tree decl = build_decl (input_location,
2282 TYPE_DECL, identifier, NULL_TREE);
2283 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2284 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2285 DECL_TEMPLATE_RESULT (tmpl) = decl;
2286 DECL_ARTIFICIAL (decl) = 1;
2287 end_template_decl ();
2289 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2291 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2292 /*is_primary=*/true, /*is_partial=*/false,
2295 return finish_template_type_parm (aggr, tmpl);
2298 /* ARGUMENT is the default-argument value for a template template
2299 parameter. If ARGUMENT is invalid, issue error messages and return
2300 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2303 check_template_template_default_arg (tree argument)
2305 if (TREE_CODE (argument) != TEMPLATE_DECL
2306 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2307 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2309 if (TREE_CODE (argument) == TYPE_DECL)
2310 error ("invalid use of type %qT as a default value for a template "
2311 "template-parameter", TREE_TYPE (argument));
2313 error ("invalid default argument for a template template parameter");
2314 return error_mark_node;
2320 /* Begin a class definition, as indicated by T. */
2323 begin_class_definition (tree t, tree attributes)
2325 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2326 return error_mark_node;
2328 if (processing_template_parmlist)
2330 error ("definition of %q#T inside template parameter list", t);
2331 return error_mark_node;
2334 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2335 are passed the same as decimal scalar types. */
2336 if (TREE_CODE (t) == RECORD_TYPE
2337 && !processing_template_decl)
2339 tree ns = TYPE_CONTEXT (t);
2340 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2341 && DECL_CONTEXT (ns) == std_node
2343 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2345 const char *n = TYPE_NAME_STRING (t);
2346 if ((strcmp (n, "decimal32") == 0)
2347 || (strcmp (n, "decimal64") == 0)
2348 || (strcmp (n, "decimal128") == 0))
2349 TYPE_TRANSPARENT_AGGR (t) = 1;
2353 /* A non-implicit typename comes from code like:
2355 template <typename T> struct A {
2356 template <typename U> struct A<T>::B ...
2358 This is erroneous. */
2359 else if (TREE_CODE (t) == TYPENAME_TYPE)
2361 error ("invalid definition of qualified type %qT", t);
2362 t = error_mark_node;
2365 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2367 t = make_class_type (RECORD_TYPE);
2368 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2371 if (TYPE_BEING_DEFINED (t))
2373 t = make_class_type (TREE_CODE (t));
2374 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2376 maybe_process_partial_specialization (t);
2378 TYPE_BEING_DEFINED (t) = 1;
2380 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2382 if (flag_pack_struct)
2385 TYPE_PACKED (t) = 1;
2386 /* Even though the type is being defined for the first time
2387 here, there might have been a forward declaration, so there
2388 might be cv-qualified variants of T. */
2389 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2390 TYPE_PACKED (v) = 1;
2392 /* Reset the interface data, at the earliest possible
2393 moment, as it might have been set via a class foo;
2395 if (! TYPE_ANONYMOUS_P (t))
2397 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2398 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2399 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2400 (t, finfo->interface_unknown);
2402 reset_specialization();
2404 /* Make a declaration for this class in its own scope. */
2405 build_self_reference ();
2410 /* Finish the member declaration given by DECL. */
2413 finish_member_declaration (tree decl)
2415 if (decl == error_mark_node || decl == NULL_TREE)
2418 if (decl == void_type_node)
2419 /* The COMPONENT was a friend, not a member, and so there's
2420 nothing for us to do. */
2423 /* We should see only one DECL at a time. */
2424 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2426 /* Set up access control for DECL. */
2428 = (current_access_specifier == access_private_node);
2429 TREE_PROTECTED (decl)
2430 = (current_access_specifier == access_protected_node);
2431 if (TREE_CODE (decl) == TEMPLATE_DECL)
2433 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2434 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2437 /* Mark the DECL as a member of the current class. */
2438 DECL_CONTEXT (decl) = current_class_type;
2440 /* Check for bare parameter packs in the member variable declaration. */
2441 if (TREE_CODE (decl) == FIELD_DECL)
2443 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2444 TREE_TYPE (decl) = error_mark_node;
2445 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2446 DECL_ATTRIBUTES (decl) = NULL_TREE;
2451 A C language linkage is ignored for the names of class members
2452 and the member function type of class member functions. */
2453 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2454 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2456 /* Put functions on the TYPE_METHODS list and everything else on the
2457 TYPE_FIELDS list. Note that these are built up in reverse order.
2458 We reverse them (to obtain declaration order) in finish_struct. */
2459 if (TREE_CODE (decl) == FUNCTION_DECL
2460 || DECL_FUNCTION_TEMPLATE_P (decl))
2462 /* We also need to add this function to the
2463 CLASSTYPE_METHOD_VEC. */
2464 if (add_method (current_class_type, decl, NULL_TREE))
2466 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2467 TYPE_METHODS (current_class_type) = decl;
2469 maybe_add_class_template_decl_list (current_class_type, decl,
2473 /* Enter the DECL into the scope of the class. */
2474 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2475 || pushdecl_class_level (decl))
2477 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2478 go at the beginning. The reason is that lookup_field_1
2479 searches the list in order, and we want a field name to
2480 override a type name so that the "struct stat hack" will
2481 work. In particular:
2483 struct S { enum E { }; int E } s;
2486 is valid. In addition, the FIELD_DECLs must be maintained in
2487 declaration order so that class layout works as expected.
2488 However, we don't need that order until class layout, so we
2489 save a little time by putting FIELD_DECLs on in reverse order
2490 here, and then reversing them in finish_struct_1. (We could
2491 also keep a pointer to the correct insertion points in the
2494 if (TREE_CODE (decl) == TYPE_DECL)
2495 TYPE_FIELDS (current_class_type)
2496 = chainon (TYPE_FIELDS (current_class_type), decl);
2499 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2500 TYPE_FIELDS (current_class_type) = decl;
2503 maybe_add_class_template_decl_list (current_class_type, decl,
2508 note_decl_for_pch (decl);
2511 /* DECL has been declared while we are building a PCH file. Perform
2512 actions that we might normally undertake lazily, but which can be
2513 performed now so that they do not have to be performed in
2514 translation units which include the PCH file. */
2517 note_decl_for_pch (tree decl)
2519 gcc_assert (pch_file);
2521 /* There's a good chance that we'll have to mangle names at some
2522 point, even if only for emission in debugging information. */
2523 if ((TREE_CODE (decl) == VAR_DECL
2524 || TREE_CODE (decl) == FUNCTION_DECL)
2525 && !processing_template_decl)
2529 /* Finish processing a complete template declaration. The PARMS are
2530 the template parameters. */
2533 finish_template_decl (tree parms)
2536 end_template_decl ();
2538 end_specialization ();
2541 /* Finish processing a template-id (which names a type) of the form
2542 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2543 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2544 the scope of template-id indicated. */
2547 finish_template_type (tree name, tree args, int entering_scope)
2551 decl = lookup_template_class (name, args,
2552 NULL_TREE, NULL_TREE, entering_scope,
2553 tf_warning_or_error | tf_user);
2554 if (decl != error_mark_node)
2555 decl = TYPE_STUB_DECL (decl);
2560 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2561 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2562 BASE_CLASS, or NULL_TREE if an error occurred. The
2563 ACCESS_SPECIFIER is one of
2564 access_{default,public,protected_private}_node. For a virtual base
2565 we set TREE_TYPE. */
2568 finish_base_specifier (tree base, tree access, bool virtual_p)
2572 if (base == error_mark_node)
2574 error ("invalid base-class specification");
2577 else if (! MAYBE_CLASS_TYPE_P (base))
2579 error ("%qT is not a class type", base);
2584 if (cp_type_quals (base) != 0)
2586 error ("base class %qT has cv qualifiers", base);
2587 base = TYPE_MAIN_VARIANT (base);
2589 result = build_tree_list (access, base);
2591 TREE_TYPE (result) = integer_type_node;
2597 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2598 what we found when we tried to do the lookup.
2599 LOCATION is the location of the NAME identifier;
2600 The location is used in the error message*/
2603 qualified_name_lookup_error (tree scope, tree name,
2604 tree decl, location_t location)
2606 if (scope == error_mark_node)
2607 ; /* We already complained. */
2608 else if (TYPE_P (scope))
2610 if (!COMPLETE_TYPE_P (scope))
2611 error_at (location, "incomplete type %qT used in nested name specifier",
2613 else if (TREE_CODE (decl) == TREE_LIST)
2615 error_at (location, "reference to %<%T::%D%> is ambiguous",
2617 print_candidates (decl);
2620 error_at (location, "%qD is not a member of %qT", name, scope);
2622 else if (scope != global_namespace)
2623 error_at (location, "%qD is not a member of %qD", name, scope);
2625 error_at (location, "%<::%D%> has not been declared", name);
2628 /* If FNS is a member function, a set of member functions, or a
2629 template-id referring to one or more member functions, return a
2630 BASELINK for FNS, incorporating the current access context.
2631 Otherwise, return FNS unchanged. */
2634 baselink_for_fns (tree fns)
2639 if (BASELINK_P (fns)
2640 || error_operand_p (fns))
2644 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2645 fn = TREE_OPERAND (fn, 0);
2646 fn = get_first_fn (fn);
2647 if (!DECL_FUNCTION_MEMBER_P (fn))
2650 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2652 cl = DECL_CONTEXT (fn);
2653 cl = TYPE_BINFO (cl);
2654 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2657 /* Returns true iff DECL is an automatic variable from a function outside
2661 outer_automatic_var_p (tree decl)
2663 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2664 && DECL_FUNCTION_SCOPE_P (decl)
2665 && !TREE_STATIC (decl)
2666 && DECL_CONTEXT (decl) != current_function_decl);
2669 /* Returns true iff DECL is a capture field from a lambda that is not our
2670 immediate context. */
2673 outer_lambda_capture_p (tree decl)
2675 return (TREE_CODE (decl) == FIELD_DECL
2676 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2677 && (!current_class_type
2678 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2681 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2682 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2683 if non-NULL, is the type or namespace used to explicitly qualify
2684 ID_EXPRESSION. DECL is the entity to which that name has been
2687 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2688 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2689 be set to true if this expression isn't permitted in a
2690 constant-expression, but it is otherwise not set by this function.
2691 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2692 constant-expression, but a non-constant expression is also
2695 DONE is true if this expression is a complete postfix-expression;
2696 it is false if this expression is followed by '->', '[', '(', etc.
2697 ADDRESS_P is true iff this expression is the operand of '&'.
2698 TEMPLATE_P is true iff the qualified-id was of the form
2699 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2700 appears as a template argument.
2702 If an error occurs, and it is the kind of error that might cause
2703 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2704 is the caller's responsibility to issue the message. *ERROR_MSG
2705 will be a string with static storage duration, so the caller need
2708 Return an expression for the entity, after issuing appropriate
2709 diagnostics. This function is also responsible for transforming a
2710 reference to a non-static member into a COMPONENT_REF that makes
2711 the use of "this" explicit.
2713 Upon return, *IDK will be filled in appropriately. */
2715 finish_id_expression (tree id_expression,
2719 bool integral_constant_expression_p,
2720 bool allow_non_integral_constant_expression_p,
2721 bool *non_integral_constant_expression_p,
2725 bool template_arg_p,
2726 const char **error_msg,
2727 location_t location)
2729 /* Initialize the output parameters. */
2730 *idk = CP_ID_KIND_NONE;
2733 if (id_expression == error_mark_node)
2734 return error_mark_node;
2735 /* If we have a template-id, then no further lookup is
2736 required. If the template-id was for a template-class, we
2737 will sometimes have a TYPE_DECL at this point. */
2738 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2739 || TREE_CODE (decl) == TYPE_DECL)
2741 /* Look up the name. */
2744 if (decl == error_mark_node)
2746 /* Name lookup failed. */
2749 || (!dependent_type_p (scope)
2750 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2751 && IDENTIFIER_TYPENAME_P (id_expression)
2752 && dependent_type_p (TREE_TYPE (id_expression))))))
2754 /* If the qualifying type is non-dependent (and the name
2755 does not name a conversion operator to a dependent
2756 type), issue an error. */
2757 qualified_name_lookup_error (scope, id_expression, decl, location);
2758 return error_mark_node;
2762 /* It may be resolved via Koenig lookup. */
2763 *idk = CP_ID_KIND_UNQUALIFIED;
2764 return id_expression;
2767 decl = id_expression;
2769 /* If DECL is a variable that would be out of scope under
2770 ANSI/ISO rules, but in scope in the ARM, name lookup
2771 will succeed. Issue a diagnostic here. */
2773 decl = check_for_out_of_scope_variable (decl);
2775 /* Remember that the name was used in the definition of
2776 the current class so that we can check later to see if
2777 the meaning would have been different after the class
2778 was entirely defined. */
2779 if (!scope && decl != error_mark_node)
2780 maybe_note_name_used_in_class (id_expression, decl);
2782 /* Disallow uses of local variables from containing functions, except
2783 within lambda-expressions. */
2784 if ((outer_automatic_var_p (decl)
2785 || outer_lambda_capture_p (decl))
2786 /* It's not a use (3.2) if we're in an unevaluated context. */
2787 && !cp_unevaluated_operand)
2789 tree context = DECL_CONTEXT (decl);
2790 tree containing_function = current_function_decl;
2791 tree lambda_stack = NULL_TREE;
2792 tree lambda_expr = NULL_TREE;
2793 tree initializer = decl;
2795 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2796 support for an approach in which a reference to a local
2797 [constant] automatic variable in a nested class or lambda body
2798 would enter the expression as an rvalue, which would reduce
2799 the complexity of the problem"
2801 FIXME update for final resolution of core issue 696. */
2802 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2803 return integral_constant_value (decl);
2805 if (TYPE_P (context))
2807 /* Implicit capture of an explicit capture. */
2808 context = lambda_function (context);
2809 initializer = thisify_lambda_field (decl);
2812 /* If we are in a lambda function, we can move out until we hit
2814 2. a non-lambda function, or
2815 3. a non-default capturing lambda function. */
2816 while (context != containing_function
2817 && LAMBDA_FUNCTION_P (containing_function))
2819 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2820 (DECL_CONTEXT (containing_function));
2822 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2826 lambda_stack = tree_cons (NULL_TREE,
2831 = decl_function_context (containing_function);
2834 if (context == containing_function)
2836 decl = add_default_capture (lambda_stack,
2837 /*id=*/DECL_NAME (decl),
2840 else if (lambda_expr)
2842 error ("%qD is not captured", decl);
2843 return error_mark_node;
2847 error (TREE_CODE (decl) == VAR_DECL
2848 ? "use of %<auto%> variable from containing function"
2849 : "use of parameter from containing function");
2850 error (" %q+#D declared here", decl);
2851 return error_mark_node;
2856 /* If we didn't find anything, or what we found was a type,
2857 then this wasn't really an id-expression. */
2858 if (TREE_CODE (decl) == TEMPLATE_DECL
2859 && !DECL_FUNCTION_TEMPLATE_P (decl))
2861 *error_msg = "missing template arguments";
2862 return error_mark_node;
2864 else if (TREE_CODE (decl) == TYPE_DECL
2865 || TREE_CODE (decl) == NAMESPACE_DECL)
2867 *error_msg = "expected primary-expression";
2868 return error_mark_node;
2871 /* If the name resolved to a template parameter, there is no
2872 need to look it up again later. */
2873 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2874 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2878 *idk = CP_ID_KIND_NONE;
2879 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2880 decl = TEMPLATE_PARM_DECL (decl);
2881 r = convert_from_reference (DECL_INITIAL (decl));
2883 if (integral_constant_expression_p
2884 && !dependent_type_p (TREE_TYPE (decl))
2885 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2887 if (!allow_non_integral_constant_expression_p)
2888 error ("template parameter %qD of type %qT is not allowed in "
2889 "an integral constant expression because it is not of "
2890 "integral or enumeration type", decl, TREE_TYPE (decl));
2891 *non_integral_constant_expression_p = true;
2895 /* Similarly, we resolve enumeration constants to their
2896 underlying values. */
2897 else if (TREE_CODE (decl) == CONST_DECL)
2899 *idk = CP_ID_KIND_NONE;
2900 if (!processing_template_decl)
2902 used_types_insert (TREE_TYPE (decl));
2903 return DECL_INITIAL (decl);
2911 /* If the declaration was explicitly qualified indicate
2912 that. The semantics of `A::f(3)' are different than
2913 `f(3)' if `f' is virtual. */
2915 ? CP_ID_KIND_QUALIFIED
2916 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2917 ? CP_ID_KIND_TEMPLATE_ID
2918 : CP_ID_KIND_UNQUALIFIED));
2923 An id-expression is type-dependent if it contains an
2924 identifier that was declared with a dependent type.
2926 The standard is not very specific about an id-expression that
2927 names a set of overloaded functions. What if some of them
2928 have dependent types and some of them do not? Presumably,
2929 such a name should be treated as a dependent name. */
2930 /* Assume the name is not dependent. */
2931 dependent_p = false;
2932 if (!processing_template_decl)
2933 /* No names are dependent outside a template. */
2935 /* A template-id where the name of the template was not resolved
2936 is definitely dependent. */
2937 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2938 && (TREE_CODE (TREE_OPERAND (decl, 0))
2939 == IDENTIFIER_NODE))
2941 /* For anything except an overloaded function, just check its
2943 else if (!is_overloaded_fn (decl))
2945 = dependent_type_p (TREE_TYPE (decl));
2946 /* For a set of overloaded functions, check each of the
2952 if (BASELINK_P (fns))
2953 fns = BASELINK_FUNCTIONS (fns);
2955 /* For a template-id, check to see if the template
2956 arguments are dependent. */
2957 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2959 tree args = TREE_OPERAND (fns, 1);
2960 dependent_p = any_dependent_template_arguments_p (args);
2961 /* The functions are those referred to by the
2963 fns = TREE_OPERAND (fns, 0);
2966 /* If there are no dependent template arguments, go through
2967 the overloaded functions. */
2968 while (fns && !dependent_p)
2970 tree fn = OVL_CURRENT (fns);
2972 /* Member functions of dependent classes are
2974 if (TREE_CODE (fn) == FUNCTION_DECL
2975 && type_dependent_expression_p (fn))
2977 else if (TREE_CODE (fn) == TEMPLATE_DECL
2978 && dependent_template_p (fn))
2981 fns = OVL_NEXT (fns);
2985 /* If the name was dependent on a template parameter, we will
2986 resolve the name at instantiation time. */
2989 /* Create a SCOPE_REF for qualified names, if the scope is
2995 if (address_p && done)
2996 decl = finish_qualified_id_expr (scope, decl,
3002 tree type = NULL_TREE;
3003 if (DECL_P (decl) && !dependent_scope_p (scope))
3004 type = TREE_TYPE (decl);
3005 decl = build_qualified_name (type,
3011 if (TREE_TYPE (decl))
3012 decl = convert_from_reference (decl);
3015 /* A TEMPLATE_ID already contains all the information we
3017 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3018 return id_expression;
3019 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3020 /* If we found a variable, then name lookup during the
3021 instantiation will always resolve to the same VAR_DECL
3022 (or an instantiation thereof). */
3023 if (TREE_CODE (decl) == VAR_DECL
3024 || TREE_CODE (decl) == PARM_DECL)
3025 return convert_from_reference (decl);
3026 /* The same is true for FIELD_DECL, but we also need to
3027 make sure that the syntax is correct. */
3028 else if (TREE_CODE (decl) == FIELD_DECL)
3030 /* Since SCOPE is NULL here, this is an unqualified name.
3031 Access checking has been performed during name lookup
3032 already. Turn off checking to avoid duplicate errors. */
3033 push_deferring_access_checks (dk_no_check);
3034 decl = finish_non_static_data_member
3036 /*qualifying_scope=*/NULL_TREE);
3037 pop_deferring_access_checks ();
3040 return id_expression;
3043 /* Only certain kinds of names are allowed in constant
3044 expression. Enumerators and template parameters have already
3045 been handled above. */
3046 if (integral_constant_expression_p
3047 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3048 && ! builtin_valid_in_constant_expr_p (decl))
3050 if (!allow_non_integral_constant_expression_p)
3052 error ("%qD cannot appear in a constant-expression", decl);
3053 return error_mark_node;
3055 *non_integral_constant_expression_p = true;
3058 if (TREE_CODE (decl) == NAMESPACE_DECL)
3060 error ("use of namespace %qD as expression", decl);
3061 return error_mark_node;
3063 else if (DECL_CLASS_TEMPLATE_P (decl))
3065 error ("use of class template %qT as expression", decl);
3066 return error_mark_node;
3068 else if (TREE_CODE (decl) == TREE_LIST)
3070 /* Ambiguous reference to base members. */
3071 error ("request for member %qD is ambiguous in "
3072 "multiple inheritance lattice", id_expression);
3073 print_candidates (decl);
3074 return error_mark_node;
3077 /* Mark variable-like entities as used. Functions are similarly
3078 marked either below or after overload resolution. */
3079 if (TREE_CODE (decl) == VAR_DECL
3080 || TREE_CODE (decl) == PARM_DECL
3081 || TREE_CODE (decl) == RESULT_DECL)
3086 decl = (adjust_result_of_qualified_name_lookup
3087 (decl, scope, current_class_type));
3089 if (TREE_CODE (decl) == FUNCTION_DECL)
3092 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3093 decl = finish_qualified_id_expr (scope,
3101 tree r = convert_from_reference (decl);
3103 if (processing_template_decl && TYPE_P (scope))
3104 r = build_qualified_name (TREE_TYPE (r),
3110 else if (TREE_CODE (decl) == FIELD_DECL)
3112 /* Since SCOPE is NULL here, this is an unqualified name.
3113 Access checking has been performed during name lookup
3114 already. Turn off checking to avoid duplicate errors. */
3115 push_deferring_access_checks (dk_no_check);
3116 decl = finish_non_static_data_member (decl, NULL_TREE,
3117 /*qualifying_scope=*/NULL_TREE);
3118 pop_deferring_access_checks ();
3120 else if (is_overloaded_fn (decl))
3124 first_fn = get_first_fn (decl);
3125 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3126 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3128 if (!really_overloaded_fn (decl))
3129 mark_used (first_fn);
3132 && TREE_CODE (first_fn) == FUNCTION_DECL
3133 && DECL_FUNCTION_MEMBER_P (first_fn)
3134 && !shared_member_p (decl))
3136 /* A set of member functions. */
3137 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3138 return finish_class_member_access_expr (decl, id_expression,
3139 /*template_p=*/false,
3140 tf_warning_or_error);
3143 decl = baselink_for_fns (decl);
3147 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3148 && DECL_CLASS_SCOPE_P (decl))
3150 tree context = context_for_name_lookup (decl);
3151 if (context != current_class_type)
3153 tree path = currently_open_derived_class (context);
3154 perform_or_defer_access_check (TYPE_BINFO (path),
3159 decl = convert_from_reference (decl);
3163 if (TREE_DEPRECATED (decl))
3164 warn_deprecated_use (decl, NULL_TREE);
3169 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3170 use as a type-specifier. */
3173 finish_typeof (tree expr)
3177 if (type_dependent_expression_p (expr))
3179 type = cxx_make_type (TYPEOF_TYPE);
3180 TYPEOF_TYPE_EXPR (type) = expr;
3181 SET_TYPE_STRUCTURAL_EQUALITY (type);
3186 expr = mark_type_use (expr);
3188 type = unlowered_expr_type (expr);
3190 if (!type || type == unknown_type_node)
3192 error ("type of %qE is unknown", expr);
3193 return error_mark_node;
3199 /* Perform C++-specific checks for __builtin_offsetof before calling
3203 finish_offsetof (tree expr)
3205 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3207 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3208 TREE_OPERAND (expr, 2));
3209 return error_mark_node;
3211 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3212 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3213 || TREE_TYPE (expr) == unknown_type_node)
3215 if (TREE_CODE (expr) == COMPONENT_REF
3216 || TREE_CODE (expr) == COMPOUND_EXPR)
3217 expr = TREE_OPERAND (expr, 1);
3218 error ("cannot apply %<offsetof%> to member function %qD", expr);
3219 return error_mark_node;
3221 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3222 expr = TREE_OPERAND (expr, 0);
3223 return fold_offsetof (expr, NULL_TREE);
3226 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3227 function is broken out from the above for the benefit of the tree-ssa
3231 simplify_aggr_init_expr (tree *tp)
3233 tree aggr_init_expr = *tp;
3235 /* Form an appropriate CALL_EXPR. */
3236 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3237 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3238 tree type = TREE_TYPE (slot);
3241 enum style_t { ctor, arg, pcc } style;
3243 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3245 #ifdef PCC_STATIC_STRUCT_RETURN
3251 gcc_assert (TREE_ADDRESSABLE (type));
3255 call_expr = build_call_array_loc (input_location,
3256 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3258 aggr_init_expr_nargs (aggr_init_expr),
3259 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3263 /* Replace the first argument to the ctor with the address of the
3265 cxx_mark_addressable (slot);
3266 CALL_EXPR_ARG (call_expr, 0) =
3267 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3269 else if (style == arg)
3271 /* Just mark it addressable here, and leave the rest to
3272 expand_call{,_inline}. */
3273 cxx_mark_addressable (slot);
3274 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3275 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3277 else if (style == pcc)
3279 /* If we're using the non-reentrant PCC calling convention, then we
3280 need to copy the returned value out of the static buffer into the
3282 push_deferring_access_checks (dk_no_check);
3283 call_expr = build_aggr_init (slot, call_expr,
3284 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3285 tf_warning_or_error);
3286 pop_deferring_access_checks ();
3287 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3290 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3292 tree init = build_zero_init (type, NULL_TREE,
3293 /*static_storage_p=*/false);
3294 init = build2 (INIT_EXPR, void_type_node, slot, init);
3295 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3302 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3305 emit_associated_thunks (tree fn)
3307 /* When we use vcall offsets, we emit thunks with the virtual
3308 functions to which they thunk. The whole point of vcall offsets
3309 is so that you can know statically the entire set of thunks that
3310 will ever be needed for a given virtual function, thereby
3311 enabling you to output all the thunks with the function itself. */
3312 if (DECL_VIRTUAL_P (fn)
3313 /* Do not emit thunks for extern template instantiations. */
3314 && ! DECL_REALLY_EXTERN (fn))
3318 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3320 if (!THUNK_ALIAS (thunk))
3322 use_thunk (thunk, /*emit_p=*/1);
3323 if (DECL_RESULT_THUNK_P (thunk))
3327 for (probe = DECL_THUNKS (thunk);
3328 probe; probe = TREE_CHAIN (probe))
3329 use_thunk (probe, /*emit_p=*/1);
3333 gcc_assert (!DECL_THUNKS (thunk));
3338 /* Generate RTL for FN. */
3341 expand_or_defer_fn_1 (tree fn)
3343 /* When the parser calls us after finishing the body of a template
3344 function, we don't really want to expand the body. */
3345 if (processing_template_decl)
3347 /* Normally, collection only occurs in rest_of_compilation. So,
3348 if we don't collect here, we never collect junk generated
3349 during the processing of templates until we hit a
3350 non-template function. It's not safe to do this inside a
3351 nested class, though, as the parser may have local state that
3352 is not a GC root. */
3353 if (!function_depth)
3358 gcc_assert (DECL_SAVED_TREE (fn));
3360 /* If this is a constructor or destructor body, we have to clone
3362 if (maybe_clone_body (fn))
3364 /* We don't want to process FN again, so pretend we've written
3365 it out, even though we haven't. */
3366 TREE_ASM_WRITTEN (fn) = 1;
3367 DECL_SAVED_TREE (fn) = NULL_TREE;
3371 /* We make a decision about linkage for these functions at the end
3372 of the compilation. Until that point, we do not want the back
3373 end to output them -- but we do want it to see the bodies of
3374 these functions so that it can inline them as appropriate. */
3375 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3377 if (DECL_INTERFACE_KNOWN (fn))
3378 /* We've already made a decision as to how this function will
3382 DECL_EXTERNAL (fn) = 1;
3383 DECL_NOT_REALLY_EXTERN (fn) = 1;
3384 note_vague_linkage_fn (fn);
3385 /* A non-template inline function with external linkage will
3386 always be COMDAT. As we must eventually determine the
3387 linkage of all functions, and as that causes writes to
3388 the data mapped in from the PCH file, it's advantageous
3389 to mark the functions at this point. */
3390 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3392 /* This function must have external linkage, as
3393 otherwise DECL_INTERFACE_KNOWN would have been
3395 gcc_assert (TREE_PUBLIC (fn));
3396 comdat_linkage (fn);
3397 DECL_INTERFACE_KNOWN (fn) = 1;
3401 import_export_decl (fn);
3403 /* If the user wants us to keep all inline functions, then mark
3404 this function as needed so that finish_file will make sure to
3405 output it later. Similarly, all dllexport'd functions must
3406 be emitted; there may be callers in other DLLs. */
3407 if ((flag_keep_inline_functions
3408 && DECL_DECLARED_INLINE_P (fn)
3409 && !DECL_REALLY_EXTERN (fn))
3410 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3414 /* There's no reason to do any of the work here if we're only doing
3415 semantic analysis; this code just generates RTL. */
3416 if (flag_syntax_only)
3423 expand_or_defer_fn (tree fn)
3425 if (expand_or_defer_fn_1 (fn))
3429 /* Expand or defer, at the whim of the compilation unit manager. */
3430 cgraph_finalize_function (fn, function_depth > 1);
3431 emit_associated_thunks (fn);
3444 /* Helper function for walk_tree, used by finalize_nrv below. */
3447 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3449 struct nrv_data *dp = (struct nrv_data *)data;
3452 /* No need to walk into types. There wouldn't be any need to walk into
3453 non-statements, except that we have to consider STMT_EXPRs. */
3456 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3457 but differs from using NULL_TREE in that it indicates that we care
3458 about the value of the RESULT_DECL. */
3459 else if (TREE_CODE (*tp) == RETURN_EXPR)
3460 TREE_OPERAND (*tp, 0) = dp->result;
3461 /* Change all cleanups for the NRV to only run when an exception is
3463 else if (TREE_CODE (*tp) == CLEANUP_STMT
3464 && CLEANUP_DECL (*tp) == dp->var)
3465 CLEANUP_EH_ONLY (*tp) = 1;
3466 /* Replace the DECL_EXPR for the NRV with an initialization of the
3467 RESULT_DECL, if needed. */
3468 else if (TREE_CODE (*tp) == DECL_EXPR
3469 && DECL_EXPR_DECL (*tp) == dp->var)
3472 if (DECL_INITIAL (dp->var)
3473 && DECL_INITIAL (dp->var) != error_mark_node)
3474 init = build2 (INIT_EXPR, void_type_node, dp->result,
3475 DECL_INITIAL (dp->var));
3477 init = build_empty_stmt (EXPR_LOCATION (*tp));
3478 DECL_INITIAL (dp->var) = NULL_TREE;
3479 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3482 /* And replace all uses of the NRV with the RESULT_DECL. */
3483 else if (*tp == dp->var)
3486 /* Avoid walking into the same tree more than once. Unfortunately, we
3487 can't just use walk_tree_without duplicates because it would only call
3488 us for the first occurrence of dp->var in the function body. */
3489 slot = htab_find_slot (dp->visited, *tp, INSERT);
3495 /* Keep iterating. */
3499 /* Called from finish_function to implement the named return value
3500 optimization by overriding all the RETURN_EXPRs and pertinent
3501 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3502 RESULT_DECL for the function. */
3505 finalize_nrv (tree *tp, tree var, tree result)
3507 struct nrv_data data;
3509 /* Copy debugging information from VAR to RESULT. */
3510 DECL_NAME (result) = DECL_NAME (var);
3511 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3512 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3513 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3514 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3515 /* Don't forget that we take its address. */
3516 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3519 data.result = result;
3520 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3521 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3522 htab_delete (data.visited);
3525 /* Return the declaration for the function called by CALL_EXPR T,
3526 TYPE is the class type of the clause decl. */
3529 omp_clause_info_fndecl (tree t, tree type)
3531 tree ret = get_callee_fndecl (t);
3536 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3537 t = CALL_EXPR_FN (t);
3539 if (TREE_CODE (t) == OBJ_TYPE_REF)
3541 t = cp_fold_obj_type_ref (t, type);
3542 if (TREE_CODE (t) == ADDR_EXPR
3543 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3544 return TREE_OPERAND (t, 0);
3550 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3553 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3554 bool need_copy_ctor, bool need_copy_assignment)
3556 int save_errorcount = errorcount;
3559 /* Always allocate 3 elements for simplicity. These are the
3560 function decls for the ctor, dtor, and assignment op.
3561 This layout is known to the three lang hooks,
3562 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3563 and cxx_omp_clause_assign_op. */
3564 info = make_tree_vec (3);
3565 CP_OMP_CLAUSE_INFO (c) = info;
3567 if (need_default_ctor
3568 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3572 if (need_default_ctor)
3576 t = build_int_cst (build_pointer_type (type), 0);
3577 t = build1 (INDIRECT_REF, type, t);
3578 vec = make_tree_vector_single (t);
3580 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3581 &vec, type, LOOKUP_NORMAL,
3582 tf_warning_or_error);
3585 release_tree_vector (vec);
3587 if (targetm.cxx.cdtor_returns_this () || errorcount)
3588 /* Because constructors and destructors return this,
3589 the call will have been cast to "void". Remove the
3590 cast here. We would like to use STRIP_NOPS, but it
3591 wouldn't work here because TYPE_MODE (t) and
3592 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3593 They are VOIDmode and Pmode, respectively. */
3594 if (TREE_CODE (t) == NOP_EXPR)
3595 t = TREE_OPERAND (t, 0);
3597 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3600 if ((need_default_ctor || need_copy_ctor)
3601 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3603 t = build_int_cst (build_pointer_type (type), 0);
3604 t = build1 (INDIRECT_REF, type, t);
3605 t = build_special_member_call (t, complete_dtor_identifier,
3606 NULL, type, LOOKUP_NORMAL,
3607 tf_warning_or_error);
3609 if (targetm.cxx.cdtor_returns_this () || errorcount)
3610 /* Because constructors and destructors return this,
3611 the call will have been cast to "void". Remove the
3612 cast here. We would like to use STRIP_NOPS, but it
3613 wouldn't work here because TYPE_MODE (t) and
3614 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3615 They are VOIDmode and Pmode, respectively. */
3616 if (TREE_CODE (t) == NOP_EXPR)
3617 t = TREE_OPERAND (t, 0);
3619 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3622 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3626 t = build_int_cst (build_pointer_type (type), 0);
3627 t = build1 (INDIRECT_REF, type, t);
3628 vec = make_tree_vector_single (t);
3629 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3630 &vec, type, LOOKUP_NORMAL,
3631 tf_warning_or_error);
3632 release_tree_vector (vec);
3634 /* We'll have called convert_from_reference on the call, which
3635 may well have added an indirect_ref. It's unneeded here,
3636 and in the way, so kill it. */
3637 if (TREE_CODE (t) == INDIRECT_REF)
3638 t = TREE_OPERAND (t, 0);
3640 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3643 return errorcount != save_errorcount;
3646 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3647 Remove any elements from the list that are invalid. */
3650 finish_omp_clauses (tree clauses)
3652 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3653 tree c, t, *pc = &clauses;
3656 bitmap_obstack_initialize (NULL);
3657 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3658 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3659 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3661 for (pc = &clauses, c = clauses; c ; c = *pc)
3663 bool remove = false;
3665 switch (OMP_CLAUSE_CODE (c))
3667 case OMP_CLAUSE_SHARED:
3669 goto check_dup_generic;
3670 case OMP_CLAUSE_PRIVATE:
3672 goto check_dup_generic;
3673 case OMP_CLAUSE_REDUCTION:
3675 goto check_dup_generic;
3676 case OMP_CLAUSE_COPYPRIVATE:
3677 name = "copyprivate";
3678 goto check_dup_generic;
3679 case OMP_CLAUSE_COPYIN:
3681 goto check_dup_generic;
3683 t = OMP_CLAUSE_DECL (c);
3684 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3686 if (processing_template_decl)
3689 error ("%qD is not a variable in clause %qs", t, name);
3691 error ("%qE is not a variable in clause %qs", t, name);
3694 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3695 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3696 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3698 error ("%qD appears more than once in data clauses", t);
3702 bitmap_set_bit (&generic_head, DECL_UID (t));
3705 case OMP_CLAUSE_FIRSTPRIVATE:
3706 t = OMP_CLAUSE_DECL (c);
3707 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3709 if (processing_template_decl)
3712 error ("%qD is not a variable in clause %<firstprivate%>", t);
3714 error ("%qE is not a variable in clause %<firstprivate%>", t);
3717 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3718 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3720 error ("%qD appears more than once in data clauses", t);
3724 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3727 case OMP_CLAUSE_LASTPRIVATE:
3728 t = OMP_CLAUSE_DECL (c);
3729 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3731 if (processing_template_decl)
3734 error ("%qD is not a variable in clause %<lastprivate%>", t);
3736 error ("%qE is not a variable in clause %<lastprivate%>", t);
3739 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3740 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3742 error ("%qD appears more than once in data clauses", t);
3746 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3750 t = OMP_CLAUSE_IF_EXPR (c);
3751 t = maybe_convert_cond (t);
3752 if (t == error_mark_node)
3754 OMP_CLAUSE_IF_EXPR (c) = t;
3757 case OMP_CLAUSE_NUM_THREADS:
3758 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3759 if (t == error_mark_node)
3761 else if (!type_dependent_expression_p (t)
3762 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3764 error ("num_threads expression must be integral");
3769 case OMP_CLAUSE_SCHEDULE:
3770 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3773 else if (t == error_mark_node)
3775 else if (!type_dependent_expression_p (t)
3776 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3778 error ("schedule chunk size expression must be integral");
3783 case OMP_CLAUSE_NOWAIT:
3784 case OMP_CLAUSE_ORDERED:
3785 case OMP_CLAUSE_DEFAULT:
3786 case OMP_CLAUSE_UNTIED:
3787 case OMP_CLAUSE_COLLAPSE:
3795 *pc = OMP_CLAUSE_CHAIN (c);
3797 pc = &OMP_CLAUSE_CHAIN (c);
3800 for (pc = &clauses, c = clauses; c ; c = *pc)
3802 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3803 bool remove = false;
3804 bool need_complete_non_reference = false;
3805 bool need_default_ctor = false;
3806 bool need_copy_ctor = false;
3807 bool need_copy_assignment = false;
3808 bool need_implicitly_determined = false;
3809 tree type, inner_type;
3813 case OMP_CLAUSE_SHARED:
3815 need_implicitly_determined = true;
3817 case OMP_CLAUSE_PRIVATE:
3819 need_complete_non_reference = true;
3820 need_default_ctor = true;
3821 need_implicitly_determined = true;
3823 case OMP_CLAUSE_FIRSTPRIVATE:
3824 name = "firstprivate";
3825 need_complete_non_reference = true;
3826 need_copy_ctor = true;
3827 need_implicitly_determined = true;
3829 case OMP_CLAUSE_LASTPRIVATE:
3830 name = "lastprivate";
3831 need_complete_non_reference = true;
3832 need_copy_assignment = true;
3833 need_implicitly_determined = true;
3835 case OMP_CLAUSE_REDUCTION:
3837 need_implicitly_determined = true;
3839 case OMP_CLAUSE_COPYPRIVATE:
3840 name = "copyprivate";
3841 need_copy_assignment = true;
3843 case OMP_CLAUSE_COPYIN:
3845 need_copy_assignment = true;
3848 pc = &OMP_CLAUSE_CHAIN (c);
3852 t = OMP_CLAUSE_DECL (c);
3853 if (processing_template_decl
3854 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3856 pc = &OMP_CLAUSE_CHAIN (c);
3862 case OMP_CLAUSE_LASTPRIVATE:
3863 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3864 need_default_ctor = true;
3867 case OMP_CLAUSE_REDUCTION:
3868 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3869 || POINTER_TYPE_P (TREE_TYPE (t)))
3871 error ("%qE has invalid type for %<reduction%>", t);
3874 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3876 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3884 error ("%qE has invalid type for %<reduction(%s)%>",
3885 t, operator_name_info[r_code].name);
3891 case OMP_CLAUSE_COPYIN:
3892 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3894 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3903 if (need_complete_non_reference)
3905 t = require_complete_type (t);
3906 if (t == error_mark_node)
3908 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3910 error ("%qE has reference type for %qs", t, name);
3914 if (need_implicitly_determined)
3916 const char *share_name = NULL;
3918 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3919 share_name = "threadprivate";
3920 else switch (cxx_omp_predetermined_sharing (t))
3922 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3924 case OMP_CLAUSE_DEFAULT_SHARED:
3925 share_name = "shared";
3927 case OMP_CLAUSE_DEFAULT_PRIVATE:
3928 share_name = "private";
3935 error ("%qE is predetermined %qs for %qs",
3936 t, share_name, name);
3941 /* We're interested in the base element, not arrays. */
3942 inner_type = type = TREE_TYPE (t);
3943 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3944 inner_type = TREE_TYPE (inner_type);
3946 /* Check for special function availability by building a call to one.
3947 Save the results, because later we won't be in the right context
3948 for making these queries. */
3949 if (CLASS_TYPE_P (inner_type)
3950 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3951 && !type_dependent_expression_p (t)
3952 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3953 need_copy_ctor, need_copy_assignment))
3957 *pc = OMP_CLAUSE_CHAIN (c);
3959 pc = &OMP_CLAUSE_CHAIN (c);
3962 bitmap_obstack_release (NULL);
3966 /* For all variables in the tree_list VARS, mark them as thread local. */
3969 finish_omp_threadprivate (tree vars)
3973 /* Mark every variable in VARS to be assigned thread local storage. */
3974 for (t = vars; t; t = TREE_CHAIN (t))
3976 tree v = TREE_PURPOSE (t);
3978 if (error_operand_p (v))
3980 else if (TREE_CODE (v) != VAR_DECL)
3981 error ("%<threadprivate%> %qD is not file, namespace "
3982 "or block scope variable", v);
3983 /* If V had already been marked threadprivate, it doesn't matter
3984 whether it had been used prior to this point. */
3985 else if (TREE_USED (v)
3986 && (DECL_LANG_SPECIFIC (v) == NULL
3987 || !CP_DECL_THREADPRIVATE_P (v)))
3988 error ("%qE declared %<threadprivate%> after first use", v);
3989 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3990 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3991 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3992 error ("%<threadprivate%> %qE has incomplete type", v);
3993 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
3994 && CP_DECL_CONTEXT (v) != current_class_type)
3995 error ("%<threadprivate%> %qE directive not "
3996 "in %qT definition", v, CP_DECL_CONTEXT (v));
3999 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4000 if (DECL_LANG_SPECIFIC (v) == NULL)
4002 retrofit_lang_decl (v);
4004 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4005 after the allocation of the lang_decl structure. */
4006 if (DECL_DISCRIMINATOR_P (v))
4007 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4010 if (! DECL_THREAD_LOCAL_P (v))
4012 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4013 /* If rtl has been already set for this var, call
4014 make_decl_rtl once again, so that encode_section_info
4015 has a chance to look at the new decl flags. */
4016 if (DECL_RTL_SET_P (v))
4019 CP_DECL_THREADPRIVATE_P (v) = 1;
4024 /* Build an OpenMP structured block. */
4027 begin_omp_structured_block (void)
4029 return do_pushlevel (sk_omp);
4033 finish_omp_structured_block (tree block)
4035 return do_poplevel (block);
4038 /* Similarly, except force the retention of the BLOCK. */
4041 begin_omp_parallel (void)
4043 keep_next_level (true);
4044 return begin_omp_structured_block ();
4048 finish_omp_parallel (tree clauses, tree body)
4052 body = finish_omp_structured_block (body);
4054 stmt = make_node (OMP_PARALLEL);
4055 TREE_TYPE (stmt) = void_type_node;
4056 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4057 OMP_PARALLEL_BODY (stmt) = body;
4059 return add_stmt (stmt);
4063 begin_omp_task (void)
4065 keep_next_level (true);
4066 return begin_omp_structured_block ();
4070 finish_omp_task (tree clauses, tree body)
4074 body = finish_omp_structured_block (body);
4076 stmt = make_node (OMP_TASK);
4077 TREE_TYPE (stmt) = void_type_node;
4078 OMP_TASK_CLAUSES (stmt) = clauses;
4079 OMP_TASK_BODY (stmt) = body;
4081 return add_stmt (stmt);
4084 /* Helper function for finish_omp_for. Convert Ith random access iterator
4085 into integral iterator. Return FALSE if successful. */
4088 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4089 tree condv, tree incrv, tree *body,
4090 tree *pre_body, tree clauses)
4092 tree diff, iter_init, iter_incr = NULL, last;
4093 tree incr_var = NULL, orig_pre_body, orig_body, c;
4094 tree decl = TREE_VEC_ELT (declv, i);
4095 tree init = TREE_VEC_ELT (initv, i);
4096 tree cond = TREE_VEC_ELT (condv, i);
4097 tree incr = TREE_VEC_ELT (incrv, i);
4099 location_t elocus = locus;
4101 if (init && EXPR_HAS_LOCATION (init))
4102 elocus = EXPR_LOCATION (init);
4104 switch (TREE_CODE (cond))
4110 if (TREE_OPERAND (cond, 1) == iter)
4111 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4112 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4113 if (TREE_OPERAND (cond, 0) != iter)
4114 cond = error_mark_node;
4117 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4118 TREE_OPERAND (cond, 1), ERROR_MARK,
4119 NULL, tf_warning_or_error);
4120 if (error_operand_p (tem))
4125 cond = error_mark_node;
4128 if (cond == error_mark_node)
4130 error_at (elocus, "invalid controlling predicate");
4133 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4134 ERROR_MARK, iter, ERROR_MARK, NULL,
4135 tf_warning_or_error);
4136 if (error_operand_p (diff))
4138 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4140 error_at (elocus, "difference between %qE and %qD does not have integer type",
4141 TREE_OPERAND (cond, 1), iter);
4145 switch (TREE_CODE (incr))
4147 case PREINCREMENT_EXPR:
4148 case PREDECREMENT_EXPR:
4149 case POSTINCREMENT_EXPR:
4150 case POSTDECREMENT_EXPR:
4151 if (TREE_OPERAND (incr, 0) != iter)
4153 incr = error_mark_node;
4156 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4157 tf_warning_or_error);
4158 if (error_operand_p (iter_incr))
4160 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4161 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4162 incr = integer_one_node;
4164 incr = integer_minus_one_node;
4167 if (TREE_OPERAND (incr, 0) != iter)
4168 incr = error_mark_node;
4169 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4170 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4172 tree rhs = TREE_OPERAND (incr, 1);
4173 if (TREE_OPERAND (rhs, 0) == iter)
4175 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4177 incr = error_mark_node;
4180 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4181 TREE_OPERAND (rhs, 1),
4182 tf_warning_or_error);
4183 if (error_operand_p (iter_incr))
4185 incr = TREE_OPERAND (rhs, 1);
4186 incr = cp_convert (TREE_TYPE (diff), incr);
4187 if (TREE_CODE (rhs) == MINUS_EXPR)
4189 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4190 incr = fold_if_not_in_template (incr);
4192 if (TREE_CODE (incr) != INTEGER_CST
4193 && (TREE_CODE (incr) != NOP_EXPR
4194 || (TREE_CODE (TREE_OPERAND (incr, 0))
4199 else if (TREE_OPERAND (rhs, 1) == iter)
4201 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4202 || TREE_CODE (rhs) != PLUS_EXPR)
4203 incr = error_mark_node;
4206 iter_incr = build_x_binary_op (PLUS_EXPR,
4207 TREE_OPERAND (rhs, 0),
4210 tf_warning_or_error);
4211 if (error_operand_p (iter_incr))
4213 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4215 tf_warning_or_error);
4216 if (error_operand_p (iter_incr))
4218 incr = TREE_OPERAND (rhs, 0);
4223 incr = error_mark_node;
4226 incr = error_mark_node;
4229 incr = error_mark_node;
4233 if (incr == error_mark_node)
4235 error_at (elocus, "invalid increment expression");
4239 incr = cp_convert (TREE_TYPE (diff), incr);
4240 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4241 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4242 && OMP_CLAUSE_DECL (c) == iter)
4245 decl = create_temporary_var (TREE_TYPE (diff));
4247 add_decl_expr (decl);
4248 last = create_temporary_var (TREE_TYPE (diff));
4250 add_decl_expr (last);
4251 if (c && iter_incr == NULL)
4253 incr_var = create_temporary_var (TREE_TYPE (diff));
4254 pushdecl (incr_var);
4255 add_decl_expr (incr_var);
4257 gcc_assert (stmts_are_full_exprs_p ());
4259 orig_pre_body = *pre_body;
4260 *pre_body = push_stmt_list ();
4262 add_stmt (orig_pre_body);
4264 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4265 tf_warning_or_error));
4266 init = build_int_cst (TREE_TYPE (diff), 0);
4267 if (c && iter_incr == NULL)
4269 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4270 incr, tf_warning_or_error));
4272 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4273 tf_warning_or_error);
4275 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4276 tf_warning_or_error));
4277 *pre_body = pop_stmt_list (*pre_body);
4279 cond = cp_build_binary_op (elocus,
4280 TREE_CODE (cond), decl, diff,
4281 tf_warning_or_error);
4282 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4283 elocus, incr, NULL_TREE);
4286 *body = push_stmt_list ();
4287 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4288 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4289 tf_warning_or_error);
4290 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4291 finish_expr_stmt (iter_init);
4292 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4293 tf_warning_or_error));
4294 add_stmt (orig_body);
4295 *body = pop_stmt_list (*body);
4299 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4300 finish_expr_stmt (iter_incr);
4301 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4302 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4305 TREE_VEC_ELT (declv, i) = decl;
4306 TREE_VEC_ELT (initv, i) = init;
4307 TREE_VEC_ELT (condv, i) = cond;
4308 TREE_VEC_ELT (incrv, i) = incr;
4313 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4314 are directly for their associated operands in the statement. DECL
4315 and INIT are a combo; if DECL is NULL then INIT ought to be a
4316 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4317 optional statements that need to go before the loop into its
4321 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4322 tree incrv, tree body, tree pre_body, tree clauses)
4324 tree omp_for = NULL, orig_incr = NULL;
4325 tree decl, init, cond, incr;
4329 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4330 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4331 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4332 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4334 decl = TREE_VEC_ELT (declv, i);
4335 init = TREE_VEC_ELT (initv, i);
4336 cond = TREE_VEC_ELT (condv, i);
4337 incr = TREE_VEC_ELT (incrv, i);
4343 switch (TREE_CODE (init))
4346 decl = TREE_OPERAND (init, 0);
4347 init = TREE_OPERAND (init, 1);
4350 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4352 decl = TREE_OPERAND (init, 0);
4353 init = TREE_OPERAND (init, 2);
4363 "expected iteration declaration or initialization");
4368 if (init && EXPR_HAS_LOCATION (init))
4369 elocus = EXPR_LOCATION (init);
4373 error_at (elocus, "missing controlling predicate");
4379 error_at (elocus, "missing increment expression");
4383 TREE_VEC_ELT (declv, i) = decl;
4384 TREE_VEC_ELT (initv, i) = init;
4387 if (dependent_omp_for_p (declv, initv, condv, incrv))
4391 stmt = make_node (OMP_FOR);
4393 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4395 /* This is really just a place-holder. We'll be decomposing this
4396 again and going through the cp_build_modify_expr path below when
4397 we instantiate the thing. */
4398 TREE_VEC_ELT (initv, i)
4399 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4400 TREE_VEC_ELT (initv, i));
4403 TREE_TYPE (stmt) = void_type_node;
4404 OMP_FOR_INIT (stmt) = initv;
4405 OMP_FOR_COND (stmt) = condv;
4406 OMP_FOR_INCR (stmt) = incrv;
4407 OMP_FOR_BODY (stmt) = body;
4408 OMP_FOR_PRE_BODY (stmt) = pre_body;
4409 OMP_FOR_CLAUSES (stmt) = clauses;
4411 SET_EXPR_LOCATION (stmt, locus);
4412 return add_stmt (stmt);
4415 if (processing_template_decl)
4416 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4418 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4420 decl = TREE_VEC_ELT (declv, i);
4421 init = TREE_VEC_ELT (initv, i);
4422 cond = TREE_VEC_ELT (condv, i);
4423 incr = TREE_VEC_ELT (incrv, i);
4425 TREE_VEC_ELT (orig_incr, i) = incr;
4428 if (init && EXPR_HAS_LOCATION (init))
4429 elocus = EXPR_LOCATION (init);
4433 error_at (elocus, "expected iteration declaration or initialization");
4437 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4440 TREE_VEC_ELT (orig_incr, i) = incr;
4441 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4442 TREE_CODE (TREE_OPERAND (incr, 1)),
4443 TREE_OPERAND (incr, 2),
4444 tf_warning_or_error);
4447 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4449 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4450 incrv, &body, &pre_body, clauses))
4455 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4456 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4458 error_at (elocus, "invalid type for iteration variable %qE", decl);
4462 if (!processing_template_decl)
4464 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4465 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4468 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4470 && TREE_SIDE_EFFECTS (cond)
4471 && COMPARISON_CLASS_P (cond)
4472 && !processing_template_decl)
4474 tree t = TREE_OPERAND (cond, 0);
4475 if (TREE_SIDE_EFFECTS (t)
4477 && (TREE_CODE (t) != NOP_EXPR
4478 || TREE_OPERAND (t, 0) != decl))
4479 TREE_OPERAND (cond, 0)
4480 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4482 t = TREE_OPERAND (cond, 1);
4483 if (TREE_SIDE_EFFECTS (t)
4485 && (TREE_CODE (t) != NOP_EXPR
4486 || TREE_OPERAND (t, 0) != decl))
4487 TREE_OPERAND (cond, 1)
4488 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4490 if (decl == error_mark_node || init == error_mark_node)
4493 TREE_VEC_ELT (declv, i) = decl;
4494 TREE_VEC_ELT (initv, i) = init;
4495 TREE_VEC_ELT (condv, i) = cond;
4496 TREE_VEC_ELT (incrv, i) = incr;
4500 if (IS_EMPTY_STMT (pre_body))
4503 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4506 if (omp_for == NULL)
4509 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4511 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4512 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4514 if (TREE_CODE (incr) != MODIFY_EXPR)
4517 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4518 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4519 && !processing_template_decl)
4521 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
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), 0)
4527 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4529 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4530 if (TREE_SIDE_EFFECTS (t)
4532 && (TREE_CODE (t) != NOP_EXPR
4533 || TREE_OPERAND (t, 0) != decl))
4534 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4535 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4539 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4541 if (omp_for != NULL)
4542 OMP_FOR_CLAUSES (omp_for) = clauses;
4547 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4556 dependent_p = false;
4559 /* Even in a template, we can detect invalid uses of the atomic
4560 pragma if neither LHS nor RHS is type-dependent. */
4561 if (processing_template_decl)
4563 dependent_p = (type_dependent_expression_p (lhs)
4564 || type_dependent_expression_p (rhs));
4567 lhs = build_non_dependent_expr (lhs);
4568 rhs = build_non_dependent_expr (rhs);
4573 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4574 if (stmt == error_mark_node)
4577 if (processing_template_decl)
4578 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4579 build2 (code, void_type_node, orig_lhs, orig_rhs));
4584 finish_omp_barrier (void)
4586 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4587 VEC(tree,gc) *vec = make_tree_vector ();
4588 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4589 release_tree_vector (vec);
4590 finish_expr_stmt (stmt);
4594 finish_omp_flush (void)
4596 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4597 VEC(tree,gc) *vec = make_tree_vector ();
4598 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4599 release_tree_vector (vec);
4600 finish_expr_stmt (stmt);
4604 finish_omp_taskwait (void)
4606 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4607 VEC(tree,gc) *vec = make_tree_vector ();
4608 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4609 release_tree_vector (vec);
4610 finish_expr_stmt (stmt);
4614 init_cp_semantics (void)
4618 /* Build a STATIC_ASSERT for a static assertion with the condition
4619 CONDITION and the message text MESSAGE. LOCATION is the location
4620 of the static assertion in the source code. When MEMBER_P, this
4621 static assertion is a member of a class. */
4623 finish_static_assert (tree condition, tree message, location_t location,
4626 if (check_for_bare_parameter_packs (condition))
4627 condition = error_mark_node;
4629 if (type_dependent_expression_p (condition)
4630 || value_dependent_expression_p (condition))
4632 /* We're in a template; build a STATIC_ASSERT and put it in
4636 assertion = make_node (STATIC_ASSERT);
4637 STATIC_ASSERT_CONDITION (assertion) = condition;
4638 STATIC_ASSERT_MESSAGE (assertion) = message;
4639 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4642 maybe_add_class_template_decl_list (current_class_type,
4646 add_stmt (assertion);
4651 /* Fold the expression and convert it to a boolean value. */
4652 condition = fold_non_dependent_expr (condition);
4653 condition = cp_convert (boolean_type_node, condition);
4655 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4656 /* Do nothing; the condition is satisfied. */
4660 location_t saved_loc = input_location;
4662 input_location = location;
4663 if (TREE_CODE (condition) == INTEGER_CST
4664 && integer_zerop (condition))
4665 /* Report the error. */
4666 error ("static assertion failed: %E", message);
4667 else if (condition && condition != error_mark_node)
4668 error ("non-constant condition for static assertion");
4669 input_location = saved_loc;
4673 /* Returns the type of EXPR for cases where we can determine it even though
4674 EXPR is a type-dependent expression. */
4677 describable_type (tree expr)
4679 tree type = NULL_TREE;
4681 if (! type_dependent_expression_p (expr)
4682 && ! type_unknown_p (expr))
4684 type = unlowered_expr_type (expr);
4685 if (real_lvalue_p (expr))
4686 type = build_reference_type (type);
4692 switch (TREE_CODE (expr))
4698 return TREE_TYPE (expr);
4703 case TEMPLATE_PARM_INDEX:
4705 case STATIC_CAST_EXPR:
4706 case REINTERPRET_CAST_EXPR:
4707 case CONST_CAST_EXPR:
4708 case DYNAMIC_CAST_EXPR:
4709 type = TREE_TYPE (expr);
4714 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4715 if (ptrtype && POINTER_TYPE_P (ptrtype))
4716 type = build_reference_type (TREE_TYPE (ptrtype));
4721 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4722 type = TREE_TYPE (expr);
4726 if (type && type_uses_auto (type))
4732 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4733 suitable for use as a type-specifier.
4735 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4736 id-expression or a class member access, FALSE when it was parsed as
4737 a full expression. */
4740 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4742 tree orig_expr = expr;
4743 tree type = NULL_TREE;
4745 if (!expr || error_operand_p (expr))
4746 return error_mark_node;
4749 || TREE_CODE (expr) == TYPE_DECL
4750 || (TREE_CODE (expr) == BIT_NOT_EXPR
4751 && TYPE_P (TREE_OPERAND (expr, 0))))
4753 error ("argument to decltype must be an expression");
4754 return error_mark_node;
4757 if (type_dependent_expression_p (expr)
4758 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4759 if it isn't dependent, so that we can check access control at
4760 instantiation time, so defer the decltype as well (PR 42277). */
4761 || (id_expression_or_member_access_p
4762 && processing_template_decl
4763 && TREE_CODE (expr) == COMPONENT_REF))
4765 if (id_expression_or_member_access_p)
4767 switch (TREE_CODE (expr))
4774 case TEMPLATE_PARM_INDEX:
4775 type = TREE_TYPE (expr);
4783 if (type && !type_uses_auto (type))
4787 type = cxx_make_type (DECLTYPE_TYPE);
4788 DECLTYPE_TYPE_EXPR (type) = expr;
4789 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4790 = id_expression_or_member_access_p;
4791 SET_TYPE_STRUCTURAL_EQUALITY (type);
4796 /* The type denoted by decltype(e) is defined as follows: */
4798 expr = resolve_nondeduced_context (expr);
4800 /* To get the size of a static data member declared as an array of
4801 unknown bound, we need to instantiate it. */
4802 if (TREE_CODE (expr) == VAR_DECL
4803 && VAR_HAD_UNKNOWN_BOUND (expr)
4804 && DECL_TEMPLATE_INSTANTIATION (expr))
4805 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
4807 if (id_expression_or_member_access_p)
4809 /* If e is an id-expression or a class member access (5.2.5
4810 [expr.ref]), decltype(e) is defined as the type of the entity
4811 named by e. If there is no such entity, or e names a set of
4812 overloaded functions, the program is ill-formed. */
4813 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4814 expr = lookup_name (expr);
4816 if (TREE_CODE (expr) == INDIRECT_REF)
4817 /* This can happen when the expression is, e.g., "a.b". Just
4818 look at the underlying operand. */
4819 expr = TREE_OPERAND (expr, 0);
4821 if (TREE_CODE (expr) == OFFSET_REF
4822 || TREE_CODE (expr) == MEMBER_REF)
4823 /* We're only interested in the field itself. If it is a
4824 BASELINK, we will need to see through it in the next
4826 expr = TREE_OPERAND (expr, 1);
4828 if (TREE_CODE (expr) == BASELINK)
4829 /* See through BASELINK nodes to the underlying functions. */
4830 expr = BASELINK_FUNCTIONS (expr);
4832 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4833 expr = TREE_OPERAND (expr, 0);
4835 if (TREE_CODE (expr) == OVERLOAD)
4837 if (OVL_CHAIN (expr)
4838 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4840 error ("%qE refers to a set of overloaded functions", orig_expr);
4841 return error_mark_node;
4844 /* An overload set containing only one function: just look
4845 at that function. */
4846 expr = OVL_FUNCTION (expr);
4849 switch (TREE_CODE (expr))
4852 if (DECL_BIT_FIELD_TYPE (expr))
4854 type = DECL_BIT_FIELD_TYPE (expr);
4857 /* Fall through for fields that aren't bitfields. */
4864 case TEMPLATE_PARM_INDEX:
4865 expr = mark_type_use (expr);
4866 type = TREE_TYPE (expr);
4870 type = error_mark_node;
4874 mark_type_use (expr);
4875 type = is_bitfield_expr_with_lowered_type (expr);
4877 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4884 /* We can get here when the id-expression refers to an
4886 type = TREE_TYPE (expr);
4890 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4891 || TREE_CODE (expr) == SCOPE_REF);
4892 error ("argument to decltype must be an expression");
4893 return error_mark_node;
4898 /* Expressions of reference type are sometimes wrapped in
4899 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4900 representation, not part of the language, so we have to look
4902 if (TREE_CODE (expr) == INDIRECT_REF
4903 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4905 expr = TREE_OPERAND (expr, 0);
4907 if (TREE_CODE (expr) == CALL_EXPR)
4909 /* If e is a function call (5.2.2 [expr.call]) or an
4910 invocation of an overloaded operator (parentheses around e
4911 are ignored), decltype(e) is defined as the return type of
4913 tree fndecl = get_callee_fndecl (expr);
4914 if (fndecl && fndecl != error_mark_node)
4915 type = TREE_TYPE (TREE_TYPE (fndecl));
4918 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4919 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4920 || TREE_CODE (target_type) == POINTER_TYPE)
4921 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4922 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4923 type = TREE_TYPE (TREE_TYPE (target_type));
4924 else if (processing_template_decl)
4925 /* Within a template finish_call_expr doesn't resolve
4926 CALL_EXPR_FN, so even though this decltype isn't really
4927 dependent let's defer resolving it. */
4928 goto treat_as_dependent;
4930 sorry ("unable to determine the declared type of expression %<%E%>",
4936 type = is_bitfield_expr_with_lowered_type (expr);
4939 /* Bitfields are special, because their type encodes the
4940 number of bits they store. If the expression referenced a
4941 bitfield, TYPE now has the declared type of that
4943 type = cp_build_qualified_type (type,
4944 cp_type_quals (TREE_TYPE (expr)));
4946 if (real_lvalue_p (expr))
4947 type = build_reference_type (type);
4949 /* Within a lambda-expression:
4951 Every occurrence of decltype((x)) where x is a possibly
4952 parenthesized id-expression that names an entity of
4953 automatic storage duration is treated as if x were
4954 transformed into an access to a corresponding data member
4955 of the closure type that would have been declared if x
4956 were a use of the denoted entity. */
4957 else if (outer_automatic_var_p (expr)
4958 && current_function_decl
4959 && LAMBDA_FUNCTION_P (current_function_decl))
4960 type = capture_decltype (expr);
4963 /* Otherwise, where T is the type of e, if e is an lvalue,
4964 decltype(e) is defined as T&, otherwise decltype(e) is
4966 type = TREE_TYPE (expr);
4967 if (type == error_mark_node)
4968 return error_mark_node;
4969 else if (expr == current_class_ptr)
4970 /* If the expression is just "this", we want the
4971 cv-unqualified pointer for the "this" type. */
4972 type = TYPE_MAIN_VARIANT (type);
4973 else if (real_lvalue_p (expr))
4975 if (TREE_CODE (type) != REFERENCE_TYPE)
4976 type = build_reference_type (type);
4979 type = non_reference (type);
4984 if (!type || type == unknown_type_node)
4986 error ("type of %qE is unknown", expr);
4987 return error_mark_node;
4993 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4994 __has_nothrow_copy, depending on assign_p. */
4997 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5004 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5007 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5009 else if (TYPE_HAS_INIT_REF (type))
5011 /* If construction of the copy constructor was postponed, create
5013 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5014 lazily_declare_fn (sfk_copy_constructor, type);
5015 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5016 lazily_declare_fn (sfk_move_constructor, type);
5017 fns = CLASSTYPE_CONSTRUCTORS (type);
5022 for (; fns; fns = OVL_NEXT (fns))
5024 tree fn = OVL_CURRENT (fns);
5028 if (copy_fn_p (fn) == 0)
5031 else if (copy_fn_p (fn) <= 0)
5034 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5041 /* Actually evaluates the trait. */
5044 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5046 enum tree_code type_code1;
5049 type_code1 = TREE_CODE (type1);
5053 case CPTK_HAS_NOTHROW_ASSIGN:
5054 type1 = strip_array_types (type1);
5055 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5056 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5057 || (CLASS_TYPE_P (type1)
5058 && classtype_has_nothrow_assign_or_copy_p (type1,
5061 case CPTK_HAS_TRIVIAL_ASSIGN:
5062 /* ??? The standard seems to be missing the "or array of such a class
5063 type" wording for this trait. */
5064 type1 = strip_array_types (type1);
5065 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5066 && (trivial_type_p (type1)
5067 || (CLASS_TYPE_P (type1)
5068 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
5070 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5071 type1 = strip_array_types (type1);
5072 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5073 || (CLASS_TYPE_P (type1)
5074 && (t = locate_ctor (type1, NULL))
5075 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5077 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5078 type1 = strip_array_types (type1);
5079 return (trivial_type_p (type1)
5080 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5082 case CPTK_HAS_NOTHROW_COPY:
5083 type1 = strip_array_types (type1);
5084 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5085 || (CLASS_TYPE_P (type1)
5086 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5088 case CPTK_HAS_TRIVIAL_COPY:
5089 /* ??? The standard seems to be missing the "or array of such a class
5090 type" wording for this trait. */
5091 type1 = strip_array_types (type1);
5092 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5093 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5095 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5096 type1 = strip_array_types (type1);
5097 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5098 || (CLASS_TYPE_P (type1)
5099 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5101 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5102 return (CLASS_TYPE_P (type1)
5103 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5105 case CPTK_IS_ABSTRACT:
5106 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5108 case CPTK_IS_BASE_OF:
5109 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5110 && DERIVED_FROM_P (type1, type2));
5113 return (NON_UNION_CLASS_TYPE_P (type1));
5115 case CPTK_IS_CONVERTIBLE_TO:
5120 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5123 return (type_code1 == ENUMERAL_TYPE);
5126 return (pod_type_p (type1));
5128 case CPTK_IS_POLYMORPHIC:
5129 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5131 case CPTK_IS_STD_LAYOUT:
5132 return (std_layout_type_p (type1));
5134 case CPTK_IS_TRIVIAL:
5135 return (trivial_type_p (type1));
5138 return (type_code1 == UNION_TYPE);
5146 /* Returns true if TYPE is a complete type, an array of unknown bound,
5147 or (possibly cv-qualified) void, returns false otherwise. */
5150 check_trait_type (tree type)
5152 if (COMPLETE_TYPE_P (type))
5155 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (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_UNION);
5189 if (kind == CPTK_IS_CONVERTIBLE_TO)
5191 sorry ("__is_convertible_to");
5192 return error_mark_node;
5195 if (type1 == error_mark_node
5196 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5197 && type2 == error_mark_node))
5198 return error_mark_node;
5200 if (processing_template_decl)
5202 tree trait_expr = make_node (TRAIT_EXPR);
5203 TREE_TYPE (trait_expr) = boolean_type_node;
5204 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5205 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5206 TRAIT_EXPR_KIND (trait_expr) = kind;
5210 complete_type (type1);
5212 complete_type (type2);
5216 case CPTK_HAS_NOTHROW_ASSIGN:
5217 case CPTK_HAS_TRIVIAL_ASSIGN:
5218 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5219 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5220 case CPTK_HAS_NOTHROW_COPY:
5221 case CPTK_HAS_TRIVIAL_COPY:
5222 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5223 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5224 case CPTK_IS_ABSTRACT:
5227 case CPTK_IS_POLYMORPHIC:
5228 case CPTK_IS_STD_LAYOUT:
5229 case CPTK_IS_TRIVIAL:
5230 if (!check_trait_type (type1))
5232 error ("incomplete type %qT not allowed", type1);
5233 return error_mark_node;
5237 case CPTK_IS_BASE_OF:
5238 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5239 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5240 && !COMPLETE_TYPE_P (type2))
5242 error ("incomplete type %qT not allowed", type2);
5243 return error_mark_node;
5252 case CPTK_IS_CONVERTIBLE_TO:
5257 return (trait_expr_value (kind, type1, type2)
5258 ? boolean_true_node : boolean_false_node);
5261 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5262 which is ignored for C++. */
5265 set_float_const_decimal64 (void)
5270 clear_float_const_decimal64 (void)
5275 float_const_decimal64_p (void)
5280 /* Return true if T is a literal type. */
5283 literal_type_p (tree t)
5285 if (SCALAR_TYPE_P (t))
5287 if (CLASS_TYPE_P (t))
5288 return CLASSTYPE_LITERAL_P (t);
5289 if (TREE_CODE (t) == ARRAY_TYPE)
5290 return literal_type_p (strip_array_types (t));
5295 /* If DECL is a variable declared `constexpr', require its type
5296 be literal. Return the DECL if OK, otherwise NULL. */
5299 ensure_literal_type_for_constexpr_object (tree decl)
5301 tree type = TREE_TYPE (decl);
5302 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5303 && !processing_template_decl && !literal_type_p (type))
5305 error ("the type %qT of constexpr variable %qD is not literal",
5312 /* Return non-null if FUN certainly designates a valid constexpr function
5313 declaration. Otherwise return NULL. Issue appropriate diagnostics
5314 if necessary. Note that we only check the declaration, not the body
5318 validate_constexpr_fundecl (tree fun)
5320 tree rettype = NULL;
5323 /* Don't bother if FUN is not marked constexpr. */
5324 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5327 /* For a function template, we have absolutely no guarantee that all
5328 instantiations will be constexpr. */
5329 if (TREE_CODE (fun) == TEMPLATE_DECL)
5332 parm = FUNCTION_FIRST_USER_PARM (fun);
5333 for (; parm != NULL; parm = TREE_CHAIN (parm))
5335 tree type = TREE_TYPE (parm);
5336 if (dependent_type_p (type))
5338 if (!literal_type_p (type))
5340 error ("parameter %q#D is not of literal type", parm);
5345 if (DECL_CONSTRUCTOR_P (fun))
5348 rettype = TREE_TYPE (TREE_TYPE (fun));
5349 if (dependent_type_p (rettype))
5351 if (!literal_type_p (rettype))
5353 error ("return type %qT of function %qD is not a literal type",
5354 TREE_TYPE (TREE_TYPE (fun)), fun);
5361 /* Constructor for a lambda expression. */
5364 build_lambda_expr (void)
5366 tree lambda = make_node (LAMBDA_EXPR);
5367 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5368 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5369 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5370 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5371 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5375 /* Create the closure object for a LAMBDA_EXPR. */
5378 build_lambda_object (tree lambda_expr)
5380 /* Build aggregate constructor call.
5381 - cp_parser_braced_list
5382 - cp_parser_functional_cast */
5383 VEC(constructor_elt,gc) *elts = NULL;
5384 tree node, expr, type;
5385 location_t saved_loc;
5387 if (processing_template_decl)
5390 /* Make sure any error messages refer to the lambda-introducer. */
5391 saved_loc = input_location;
5392 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5394 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5396 node = TREE_CHAIN (node))
5398 tree field = TREE_PURPOSE (node);
5399 tree val = TREE_VALUE (node);
5404 /* Mere mortals can't copy arrays with aggregate initialization, so
5405 do some magic to make it work here. */
5406 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5407 val = build_array_copy (val);
5408 else if (DECL_NORMAL_CAPTURE_P (field)
5409 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5411 /* "the entities that are captured by copy are used to
5412 direct-initialize each corresponding non-static data
5413 member of the resulting closure object."
5415 There's normally no way to express direct-initialization
5416 from an element of a CONSTRUCTOR, so we build up a special
5417 TARGET_EXPR to bypass the usual copy-initialization. */
5418 val = force_rvalue (val);
5419 if (TREE_CODE (val) == TARGET_EXPR)
5420 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5423 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5426 expr = build_constructor (init_list_type_node, elts);
5427 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5429 /* N2927: "[The closure] class type is not an aggregate."
5430 But we briefly treat it as an aggregate to make this simpler. */
5431 type = TREE_TYPE (lambda_expr);
5432 CLASSTYPE_NON_AGGREGATE (type) = 0;
5433 expr = finish_compound_literal (type, expr);
5434 CLASSTYPE_NON_AGGREGATE (type) = 1;
5436 input_location = saved_loc;
5440 /* Return an initialized RECORD_TYPE for LAMBDA.
5441 LAMBDA must have its explicit captures already. */
5444 begin_lambda_type (tree lambda)
5449 /* Unique name. This is just like an unnamed class, but we cannot use
5450 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5452 name = make_lambda_name ();
5454 /* Create the new RECORD_TYPE for this lambda. */
5455 type = xref_tag (/*tag_code=*/record_type,
5457 /*scope=*/ts_within_enclosing_non_class,
5458 /*template_header_p=*/false);
5461 /* Designate it as a struct so that we can use aggregate initialization. */
5462 CLASSTYPE_DECLARED_CLASS (type) = false;
5464 /* Clear base types. */
5465 xref_basetypes (type, /*bases=*/NULL_TREE);
5467 /* Start the class. */
5468 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5470 /* Cross-reference the expression and the type. */
5471 TREE_TYPE (lambda) = type;
5472 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5477 /* Returns the type to use for the return type of the operator() of a
5481 lambda_return_type (tree expr)
5484 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
5486 warning (0, "cannot deduce lambda return type from a braced-init-list");
5487 return void_type_node;
5489 if (type_dependent_expression_p (expr))
5491 type = cxx_make_type (DECLTYPE_TYPE);
5492 DECLTYPE_TYPE_EXPR (type) = expr;
5493 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5494 SET_TYPE_STRUCTURAL_EQUALITY (type);
5497 type = type_decays_to (unlowered_expr_type (expr));
5501 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5505 lambda_function (tree lambda)
5508 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5509 type = TREE_TYPE (lambda);
5512 gcc_assert (LAMBDA_TYPE_P (type));
5513 /* Don't let debug_tree cause instantiation. */
5514 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5516 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5517 /*protect=*/0, /*want_type=*/false);
5519 lambda = BASELINK_FUNCTIONS (lambda);
5523 /* Returns the type to use for the FIELD_DECL corresponding to the
5525 The caller should add REFERENCE_TYPE for capture by reference. */
5528 lambda_capture_field_type (tree expr)
5531 if (type_dependent_expression_p (expr))
5533 type = cxx_make_type (DECLTYPE_TYPE);
5534 DECLTYPE_TYPE_EXPR (type) = expr;
5535 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5536 SET_TYPE_STRUCTURAL_EQUALITY (type);
5539 type = non_reference (unlowered_expr_type (expr));
5543 /* Recompute the return type for LAMBDA with body of the form:
5544 { return EXPR ; } */
5547 apply_lambda_return_type (tree lambda, tree return_type)
5549 tree fco = lambda_function (lambda);
5552 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5554 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5555 it would interfere with instantiating the closure type. */
5556 if (dependent_type_p (return_type))
5558 if (return_type == error_mark_node)
5561 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5562 TREE_TYPE (METHOD_TYPE) == return-type */
5563 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
5565 result = DECL_RESULT (fco);
5566 if (result == NULL_TREE)
5569 /* We already have a DECL_RESULT from start_preparsed_function.
5570 Now we need to redo the work it and allocate_struct_function
5571 did to reflect the new type. */
5572 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5573 TYPE_MAIN_VARIANT (return_type));
5574 DECL_ARTIFICIAL (result) = 1;
5575 DECL_IGNORED_P (result) = 1;
5576 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5579 DECL_RESULT (fco) = result;
5581 if (!processing_template_decl && aggregate_value_p (result, fco))
5583 #ifdef PCC_STATIC_STRUCT_RETURN
5584 cfun->returns_pcc_struct = 1;
5586 cfun->returns_struct = 1;
5591 /* DECL is a local variable or parameter from the surrounding scope of a
5592 lambda-expression. Returns the decltype for a use of the capture field
5593 for DECL even if it hasn't been captured yet. */
5596 capture_decltype (tree decl)
5598 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5599 /* FIXME do lookup instead of list walk? */
5600 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5604 type = TREE_TYPE (TREE_PURPOSE (cap));
5606 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5609 error ("%qD is not captured", decl);
5610 return error_mark_node;
5613 type = TREE_TYPE (decl);
5614 if (TREE_CODE (type) == REFERENCE_TYPE
5615 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5616 type = TREE_TYPE (type);
5619 case CPLD_REFERENCE:
5620 type = TREE_TYPE (decl);
5621 if (TREE_CODE (type) != REFERENCE_TYPE)
5622 type = build_reference_type (TREE_TYPE (decl));
5629 if (TREE_CODE (type) != REFERENCE_TYPE)
5631 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5632 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5634 type = build_reference_type (type);
5639 /* From an ID and INITIALIZER, create a capture (by reference if
5640 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5644 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5645 bool explicit_init_p)
5650 type = lambda_capture_field_type (initializer);
5653 type = build_reference_type (type);
5654 if (!real_lvalue_p (initializer))
5655 error ("cannot capture %qE by reference", initializer);
5658 /* Make member variable. */
5659 member = build_lang_decl (FIELD_DECL, id, type);
5660 if (!explicit_init_p)
5661 /* Normal captures are invisible to name lookup but uses are replaced
5662 with references to the capture field; we implement this by only
5663 really making them invisible in unevaluated context; see
5664 qualify_lookup. For now, let's make explicitly initialized captures
5666 DECL_NORMAL_CAPTURE_P (member) = true;
5668 /* Add it to the appropriate closure class if we've started it. */
5669 if (current_class_type && current_class_type == TREE_TYPE (lambda))
5670 finish_member_declaration (member);
5672 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5673 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5675 if (id == get_identifier ("__this"))
5677 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5678 error ("already captured %<this%> in lambda expression");
5679 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5685 /* Register all the capture members on the list CAPTURES, which is the
5686 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
5688 void register_capture_members (tree captures)
5692 register_capture_members (TREE_CHAIN (captures));
5693 finish_member_declaration (TREE_PURPOSE (captures));
5697 /* Given a FIELD_DECL decl belonging to a closure type, return a
5698 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5702 thisify_lambda_field (tree decl)
5704 tree context = lambda_function (DECL_CONTEXT (decl));
5705 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5707 tf_warning_or_error);
5708 return finish_non_static_data_member (decl, object,
5709 /*qualifying_scope*/NULL_TREE);
5712 /* Similar to add_capture, except this works on a stack of nested lambdas.
5713 BY_REFERENCE_P in this case is derived from the default capture mode.
5714 Returns the capture for the lambda at the bottom of the stack. */
5717 add_default_capture (tree lambda_stack, tree id, tree initializer)
5719 bool this_capture_p = (id == get_identifier ("__this"));
5721 tree member = NULL_TREE;
5723 tree saved_class_type = current_class_type;
5727 for (node = lambda_stack;
5729 node = TREE_CHAIN (node))
5731 tree lambda = TREE_VALUE (node);
5733 current_class_type = TREE_TYPE (lambda);
5734 member = add_capture (lambda,
5739 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5740 == CPLD_REFERENCE)),
5741 /*explicit_init_p=*/false);
5742 initializer = thisify_lambda_field (member);
5745 current_class_type = saved_class_type;
5750 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5751 INDIRECT_REF, possibly adding it through default capturing. */
5754 lambda_expr_this_capture (tree lambda)
5758 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5760 /* Try to default capture 'this' if we can. */
5762 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5764 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5765 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5766 tree init = NULL_TREE;
5768 /* If we are in a lambda function, we can move out until we hit:
5769 1. a non-lambda function,
5770 2. a lambda function capturing 'this', or
5771 3. a non-default capturing lambda function. */
5772 while (LAMBDA_FUNCTION_P (containing_function))
5775 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5777 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5779 /* An outer lambda has already captured 'this'. */
5780 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5781 init = thisify_lambda_field (cap);
5785 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5786 /* An outer lambda won't let us capture 'this'. */
5789 lambda_stack = tree_cons (NULL_TREE,
5793 containing_function = decl_function_context (containing_function);
5796 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5797 && !LAMBDA_FUNCTION_P (containing_function))
5798 /* First parameter is 'this'. */
5799 init = DECL_ARGUMENTS (containing_function);
5802 this_capture = add_default_capture (lambda_stack,
5803 /*id=*/get_identifier ("__this"),
5809 error ("%<this%> was not captured for this lambda function");
5810 result = error_mark_node;
5814 /* To make sure that current_class_ref is for the lambda. */
5815 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5817 result = finish_non_static_data_member (this_capture,
5819 /*qualifying_scope=*/NULL_TREE);
5821 /* If 'this' is captured, each use of 'this' is transformed into an
5822 access to the corresponding unnamed data member of the closure
5823 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5824 ensures that the transformed expression is an rvalue. ] */
5825 result = rvalue (result);
5831 /* Returns the method basetype of the innermost non-lambda function, or
5832 NULL_TREE if none. */
5835 nonlambda_method_basetype (void)
5838 if (!current_class_ref)
5841 type = current_class_type;
5842 if (!LAMBDA_TYPE_P (type))
5845 /* Find the nearest enclosing non-lambda function. */
5846 fn = TYPE_NAME (type);
5848 fn = decl_function_context (fn);
5849 while (fn && LAMBDA_FUNCTION_P (fn));
5851 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
5854 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
5857 /* If the closure TYPE has a static op(), also add a conversion to function
5861 maybe_add_lambda_conv_op (tree type)
5863 bool nested = (current_function_decl != NULL_TREE);
5864 tree callop = lambda_function (type);
5865 tree rettype, name, fntype, fn, body, compound_stmt;
5866 tree thistype, stattype, statfn, convfn, call, arg;
5867 VEC (tree, gc) *argvec;
5869 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
5872 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
5873 FUNCTION_ARG_CHAIN (callop));
5875 /* First build up the conversion op. */
5877 rettype = build_pointer_type (stattype);
5878 name = mangle_conv_op_name_for_type (rettype);
5879 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
5880 fntype = build_method_type_directly (thistype, rettype, void_list_node);
5881 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
5882 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5884 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5885 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5886 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5888 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5889 grokclassfn (type, fn, NO_SPECIAL);
5890 set_linkage_according_to_type (type, fn);
5891 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5892 DECL_IN_AGGR_P (fn) = 1;
5893 DECL_ARTIFICIAL (fn) = 1;
5894 DECL_NOT_REALLY_EXTERN (fn) = 1;
5895 DECL_DECLARED_INLINE_P (fn) = 1;
5896 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
5898 DECL_INTERFACE_KNOWN (fn) = 1;
5900 add_method (type, fn, NULL_TREE);
5902 /* Generic thunk code fails for varargs; we'll complain in mark_used if
5903 the conversion op is used. */
5904 if (varargs_function_p (callop))
5906 DECL_DELETED_FN (fn) = 1;
5910 /* Now build up the thunk to be returned. */
5912 name = get_identifier ("_FUN");
5913 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
5914 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5915 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5916 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5917 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5918 grokclassfn (type, fn, NO_SPECIAL);
5919 set_linkage_according_to_type (type, fn);
5920 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5921 DECL_IN_AGGR_P (fn) = 1;
5922 DECL_ARTIFICIAL (fn) = 1;
5923 DECL_NOT_REALLY_EXTERN (fn) = 1;
5924 DECL_DECLARED_INLINE_P (fn) = 1;
5925 DECL_STATIC_FUNCTION_P (fn) = 1;
5926 DECL_ARGUMENTS (fn) = copy_list (TREE_CHAIN (DECL_ARGUMENTS (callop)));
5927 for (arg = DECL_ARGUMENTS (fn); arg; arg = TREE_CHAIN (arg))
5928 DECL_CONTEXT (arg) = fn;
5930 DECL_INTERFACE_KNOWN (fn) = 1;
5932 add_method (type, fn, NULL_TREE);
5935 push_function_context ();
5937 /* Generate the body of the thunk. */
5939 start_preparsed_function (statfn, NULL_TREE,
5940 SF_PRE_PARSED | SF_INCLASS_INLINE);
5941 if (DECL_ONE_ONLY (statfn))
5943 /* Put the thunk in the same comdat group as the call op. */
5944 struct cgraph_node *callop_node, *thunk_node;
5945 DECL_COMDAT_GROUP (statfn) = DECL_COMDAT_GROUP (callop);
5946 callop_node = cgraph_node (callop);
5947 thunk_node = cgraph_node (statfn);
5948 gcc_assert (callop_node->same_comdat_group == NULL);
5949 gcc_assert (thunk_node->same_comdat_group == NULL);
5950 callop_node->same_comdat_group = thunk_node;
5951 thunk_node->same_comdat_group = callop_node;
5953 body = begin_function_body ();
5954 compound_stmt = begin_compound_stmt (0);
5956 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
5958 argvec = make_tree_vector ();
5959 VEC_quick_push (tree, argvec, arg);
5960 for (arg = DECL_ARGUMENTS (statfn); arg; arg = TREE_CHAIN (arg))
5961 VEC_safe_push (tree, gc, argvec, arg);
5962 call = build_call_a (callop, VEC_length (tree, argvec),
5963 VEC_address (tree, argvec));
5964 CALL_FROM_THUNK_P (call) = 1;
5965 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
5966 call = build_cplus_new (TREE_TYPE (call), call);
5967 call = convert_from_reference (call);
5968 finish_return_stmt (call);
5970 finish_compound_stmt (compound_stmt);
5971 finish_function_body (body);
5973 expand_or_defer_fn (finish_function (2));
5975 /* Generate the body of the conversion op. */
5977 start_preparsed_function (convfn, NULL_TREE,
5978 SF_PRE_PARSED | SF_INCLASS_INLINE);
5979 body = begin_function_body ();
5980 compound_stmt = begin_compound_stmt (0);
5982 finish_return_stmt (decay_conversion (statfn));
5984 finish_compound_stmt (compound_stmt);
5985 finish_function_body (body);
5987 expand_or_defer_fn (finish_function (2));
5990 pop_function_context ();
5992 #include "gt-cp-semantics.h"