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 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 /* The DESTINATION is being used as an rvalue. */
550 if (!processing_template_decl)
552 destination = decay_conversion (destination);
553 destination = cp_convert (ptr_type_node, destination);
554 if (error_operand_p (destination))
557 /* We don't inline calls to functions with computed gotos.
558 Those functions are typically up to some funny business,
559 and may be depending on the labels being at particular
560 addresses, or some such. */
561 DECL_UNINLINABLE (current_function_decl) = 1;
564 check_goto (destination);
566 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
569 /* COND is the condition-expression for an if, while, etc.,
570 statement. Convert it to a boolean value, if appropriate.
571 In addition, verify sequence points if -Wsequence-point is enabled. */
574 maybe_convert_cond (tree cond)
576 /* Empty conditions remain empty. */
580 /* Wait until we instantiate templates before doing conversion. */
581 if (processing_template_decl)
584 if (warn_sequence_point)
585 verify_sequence_points (cond);
587 /* Do the conversion. */
588 cond = convert_from_reference (cond);
590 if (TREE_CODE (cond) == MODIFY_EXPR
591 && !TREE_NO_WARNING (cond)
594 warning (OPT_Wparentheses,
595 "suggest parentheses around assignment used as truth value");
596 TREE_NO_WARNING (cond) = 1;
599 return condition_conversion (cond);
602 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
605 finish_expr_stmt (tree expr)
609 if (expr != NULL_TREE)
611 if (!processing_template_decl)
613 if (warn_sequence_point)
614 verify_sequence_points (expr);
615 expr = convert_to_void (expr, "statement", tf_warning_or_error);
617 else if (!type_dependent_expression_p (expr))
618 convert_to_void (build_non_dependent_expr (expr), "statement",
619 tf_warning_or_error);
621 if (check_for_bare_parameter_packs (expr))
622 expr = error_mark_node;
624 /* Simplification of inner statement expressions, compound exprs,
625 etc can result in us already having an EXPR_STMT. */
626 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
628 if (TREE_CODE (expr) != EXPR_STMT)
629 expr = build_stmt (input_location, EXPR_STMT, expr);
630 expr = maybe_cleanup_point_expr_void (expr);
642 /* Begin an if-statement. Returns a newly created IF_STMT if
649 scope = do_pushlevel (sk_block);
650 r = build_stmt (input_location, IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
651 TREE_CHAIN (r) = scope;
652 begin_cond (&IF_COND (r));
656 /* Process the COND of an if-statement, which may be given by
660 finish_if_stmt_cond (tree cond, tree if_stmt)
662 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
664 THEN_CLAUSE (if_stmt) = push_stmt_list ();
667 /* Finish the then-clause of an if-statement, which may be given by
671 finish_then_clause (tree if_stmt)
673 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
677 /* Begin the else-clause of an if-statement. */
680 begin_else_clause (tree if_stmt)
682 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
685 /* Finish the else-clause of an if-statement, which may be given by
689 finish_else_clause (tree if_stmt)
691 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
694 /* Finish an if-statement. */
697 finish_if_stmt (tree if_stmt)
699 tree scope = TREE_CHAIN (if_stmt);
700 TREE_CHAIN (if_stmt) = NULL;
701 add_stmt (do_poplevel (scope));
705 /* Begin a while-statement. Returns a newly created WHILE_STMT if
709 begin_while_stmt (void)
712 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
714 WHILE_BODY (r) = do_pushlevel (sk_block);
715 begin_cond (&WHILE_COND (r));
719 /* Process the COND of a while-statement, which may be given by
723 finish_while_stmt_cond (tree cond, tree while_stmt)
725 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
726 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
729 /* Finish a while-statement, which may be given by WHILE_STMT. */
732 finish_while_stmt (tree while_stmt)
734 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
738 /* Begin a do-statement. Returns a newly created DO_STMT if
744 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
746 DO_BODY (r) = push_stmt_list ();
750 /* Finish the body of a do-statement, which may be given by DO_STMT. */
753 finish_do_body (tree do_stmt)
755 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
757 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
758 body = STATEMENT_LIST_TAIL (body)->stmt;
760 if (IS_EMPTY_STMT (body))
761 warning (OPT_Wempty_body,
762 "suggest explicit braces around empty body in %<do%> statement");
765 /* Finish a do-statement, which may be given by DO_STMT, and whose
766 COND is as indicated. */
769 finish_do_stmt (tree cond, tree do_stmt)
771 cond = maybe_convert_cond (cond);
772 DO_COND (do_stmt) = cond;
776 /* Finish a return-statement. The EXPRESSION returned, if any, is as
780 finish_return_stmt (tree expr)
785 expr = check_return_expr (expr, &no_warning);
787 if (flag_openmp && !check_omp_return ())
788 return error_mark_node;
789 if (!processing_template_decl)
791 if (warn_sequence_point)
792 verify_sequence_points (expr);
794 if (DECL_DESTRUCTOR_P (current_function_decl)
795 || (DECL_CONSTRUCTOR_P (current_function_decl)
796 && targetm.cxx.cdtor_returns_this ()))
798 /* Similarly, all destructors must run destructors for
799 base-classes before returning. So, all returns in a
800 destructor get sent to the DTOR_LABEL; finish_function emits
801 code to return a value there. */
802 return finish_goto_stmt (cdtor_label);
806 r = build_stmt (input_location, RETURN_EXPR, expr);
807 TREE_NO_WARNING (r) |= no_warning;
808 r = maybe_cleanup_point_expr_void (r);
815 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
818 begin_for_stmt (void)
822 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
823 NULL_TREE, NULL_TREE);
825 if (flag_new_for_scope > 0)
826 TREE_CHAIN (r) = do_pushlevel (sk_for);
828 if (processing_template_decl)
829 FOR_INIT_STMT (r) = push_stmt_list ();
834 /* Finish the for-init-statement of a for-statement, which may be
835 given by FOR_STMT. */
838 finish_for_init_stmt (tree for_stmt)
840 if (processing_template_decl)
841 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
843 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
844 begin_cond (&FOR_COND (for_stmt));
847 /* Finish the COND of a for-statement, which may be given by
851 finish_for_cond (tree cond, tree for_stmt)
853 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
854 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
857 /* Finish the increment-EXPRESSION in a for-statement, which may be
858 given by FOR_STMT. */
861 finish_for_expr (tree expr, tree for_stmt)
865 /* If EXPR is an overloaded function, issue an error; there is no
866 context available to use to perform overload resolution. */
867 if (type_unknown_p (expr))
869 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
870 expr = error_mark_node;
872 if (!processing_template_decl)
874 if (warn_sequence_point)
875 verify_sequence_points (expr);
876 expr = convert_to_void (expr, "3rd expression in for",
877 tf_warning_or_error);
879 else if (!type_dependent_expression_p (expr))
880 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for",
881 tf_warning_or_error);
882 expr = maybe_cleanup_point_expr_void (expr);
883 if (check_for_bare_parameter_packs (expr))
884 expr = error_mark_node;
885 FOR_EXPR (for_stmt) = expr;
888 /* Finish the body of a for-statement, which may be given by
889 FOR_STMT. The increment-EXPR for the loop must be
893 finish_for_stmt (tree for_stmt)
895 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
897 /* Pop the scope for the body of the loop. */
898 if (flag_new_for_scope > 0)
900 tree scope = TREE_CHAIN (for_stmt);
901 TREE_CHAIN (for_stmt) = NULL;
902 add_stmt (do_poplevel (scope));
908 /* Finish a break-statement. */
911 finish_break_stmt (void)
913 return add_stmt (build_stmt (input_location, BREAK_STMT));
916 /* Finish a continue-statement. */
919 finish_continue_stmt (void)
921 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
924 /* Begin a switch-statement. Returns a new SWITCH_STMT if
928 begin_switch_stmt (void)
932 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
934 scope = do_pushlevel (sk_block);
935 TREE_CHAIN (r) = scope;
936 begin_cond (&SWITCH_STMT_COND (r));
941 /* Finish the cond of a switch-statement. */
944 finish_switch_cond (tree cond, tree switch_stmt)
946 tree orig_type = NULL;
947 if (!processing_template_decl)
949 /* Convert the condition to an integer or enumeration type. */
950 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
951 if (cond == NULL_TREE)
953 error ("switch quantity not an integer");
954 cond = error_mark_node;
956 orig_type = TREE_TYPE (cond);
957 if (cond != error_mark_node)
961 Integral promotions are performed. */
962 cond = perform_integral_promotions (cond);
963 cond = maybe_cleanup_point_expr (cond);
966 if (check_for_bare_parameter_packs (cond))
967 cond = error_mark_node;
968 else if (!processing_template_decl && warn_sequence_point)
969 verify_sequence_points (cond);
971 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
972 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
973 add_stmt (switch_stmt);
974 push_switch (switch_stmt);
975 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
978 /* Finish the body of a switch-statement, which may be given by
979 SWITCH_STMT. The COND to switch on is indicated. */
982 finish_switch_stmt (tree switch_stmt)
986 SWITCH_STMT_BODY (switch_stmt) =
987 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
991 scope = TREE_CHAIN (switch_stmt);
992 TREE_CHAIN (switch_stmt) = NULL;
993 add_stmt (do_poplevel (scope));
996 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1000 begin_try_block (void)
1002 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1004 TRY_STMTS (r) = push_stmt_list ();
1008 /* Likewise, for a function-try-block. The block returned in
1009 *COMPOUND_STMT is an artificial outer scope, containing the
1010 function-try-block. */
1013 begin_function_try_block (tree *compound_stmt)
1016 /* This outer scope does not exist in the C++ standard, but we need
1017 a place to put __FUNCTION__ and similar variables. */
1018 *compound_stmt = begin_compound_stmt (0);
1019 r = begin_try_block ();
1020 FN_TRY_BLOCK_P (r) = 1;
1024 /* Finish a try-block, which may be given by TRY_BLOCK. */
1027 finish_try_block (tree try_block)
1029 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1030 TRY_HANDLERS (try_block) = push_stmt_list ();
1033 /* Finish the body of a cleanup try-block, which may be given by
1037 finish_cleanup_try_block (tree try_block)
1039 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1042 /* Finish an implicitly generated try-block, with a cleanup is given
1046 finish_cleanup (tree cleanup, tree try_block)
1048 TRY_HANDLERS (try_block) = cleanup;
1049 CLEANUP_P (try_block) = 1;
1052 /* Likewise, for a function-try-block. */
1055 finish_function_try_block (tree try_block)
1057 finish_try_block (try_block);
1058 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1059 the try block, but moving it inside. */
1060 in_function_try_handler = 1;
1063 /* Finish a handler-sequence for a try-block, which may be given by
1067 finish_handler_sequence (tree try_block)
1069 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1070 check_handlers (TRY_HANDLERS (try_block));
1073 /* Finish the handler-seq for a function-try-block, given by
1074 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1075 begin_function_try_block. */
1078 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1080 in_function_try_handler = 0;
1081 finish_handler_sequence (try_block);
1082 finish_compound_stmt (compound_stmt);
1085 /* Begin a handler. Returns a HANDLER if appropriate. */
1088 begin_handler (void)
1092 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1095 /* Create a binding level for the eh_info and the exception object
1097 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1102 /* Finish the handler-parameters for a handler, which may be given by
1103 HANDLER. DECL is the declaration for the catch parameter, or NULL
1104 if this is a `catch (...)' clause. */
1107 finish_handler_parms (tree decl, tree handler)
1109 tree type = NULL_TREE;
1110 if (processing_template_decl)
1114 decl = pushdecl (decl);
1115 decl = push_template_decl (decl);
1116 HANDLER_PARMS (handler) = decl;
1117 type = TREE_TYPE (decl);
1121 type = expand_start_catch_block (decl);
1122 HANDLER_TYPE (handler) = type;
1123 if (!processing_template_decl && type)
1124 mark_used (eh_type_info (type));
1127 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1128 the return value from the matching call to finish_handler_parms. */
1131 finish_handler (tree handler)
1133 if (!processing_template_decl)
1134 expand_end_catch_block ();
1135 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1138 /* Begin a compound statement. FLAGS contains some bits that control the
1139 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1140 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1141 block of a function. If BCS_TRY_BLOCK is set, this is the block
1142 created on behalf of a TRY statement. Returns a token to be passed to
1143 finish_compound_stmt. */
1146 begin_compound_stmt (unsigned int flags)
1150 if (flags & BCS_NO_SCOPE)
1152 r = push_stmt_list ();
1153 STATEMENT_LIST_NO_SCOPE (r) = 1;
1155 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1156 But, if it's a statement-expression with a scopeless block, there's
1157 nothing to keep, and we don't want to accidentally keep a block
1158 *inside* the scopeless block. */
1159 keep_next_level (false);
1162 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1164 /* When processing a template, we need to remember where the braces were,
1165 so that we can set up identical scopes when instantiating the template
1166 later. BIND_EXPR is a handy candidate for this.
1167 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1168 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1169 processing templates. */
1170 if (processing_template_decl)
1172 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1173 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1174 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1175 TREE_SIDE_EFFECTS (r) = 1;
1181 /* Finish a compound-statement, which is given by STMT. */
1184 finish_compound_stmt (tree stmt)
1186 if (TREE_CODE (stmt) == BIND_EXPR)
1187 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1188 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1189 stmt = pop_stmt_list (stmt);
1192 /* Destroy any ObjC "super" receivers that may have been
1194 objc_clear_super_receiver ();
1196 stmt = do_poplevel (stmt);
1199 /* ??? See c_end_compound_stmt wrt statement expressions. */
1204 /* Finish an asm-statement, whose components are a STRING, some
1205 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1206 LABELS. Also note whether the asm-statement should be
1207 considered volatile. */
1210 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1211 tree input_operands, tree clobbers, tree labels)
1215 int ninputs = list_length (input_operands);
1216 int noutputs = list_length (output_operands);
1218 if (!processing_template_decl)
1220 const char *constraint;
1221 const char **oconstraints;
1222 bool allows_mem, allows_reg, is_inout;
1226 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1228 string = resolve_asm_operand_names (string, output_operands,
1229 input_operands, labels);
1231 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1233 operand = TREE_VALUE (t);
1235 /* ??? Really, this should not be here. Users should be using a
1236 proper lvalue, dammit. But there's a long history of using
1237 casts in the output operands. In cases like longlong.h, this
1238 becomes a primitive form of typechecking -- if the cast can be
1239 removed, then the output operand had a type of the proper width;
1240 otherwise we'll get an error. Gross, but ... */
1241 STRIP_NOPS (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, "assignment (via 'asm' output)");
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);
1429 if (!object && cp_unevaluated_operand != 0)
1431 /* DR 613: Can use non-static data members without an associated
1432 object in sizeof/decltype/alignof. */
1433 tree scope = qualifying_scope;
1434 if (scope == NULL_TREE)
1435 scope = context_for_name_lookup (decl);
1436 object = maybe_dummy_object (scope, NULL);
1441 if (current_function_decl
1442 && DECL_STATIC_FUNCTION_P (current_function_decl))
1443 error ("invalid use of member %q+D in static member function", decl);
1445 error ("invalid use of non-static data member %q+D", decl);
1446 error ("from this location");
1448 return error_mark_node;
1451 /* If decl is a non-capture field and object has a lambda type,
1452 then we have a reference to a member of 'this' from a
1453 lambda inside a non-static member function, and we must get to decl
1454 through the 'this' capture. If decl is not a member of that object,
1455 either, then its access will still fail later. */
1456 if (LAMBDA_TYPE_P (TREE_TYPE (object))
1457 && !LAMBDA_TYPE_P (DECL_CONTEXT (decl)))
1458 object = cp_build_indirect_ref (lambda_expr_this_capture
1459 (CLASSTYPE_LAMBDA_EXPR
1460 (TREE_TYPE (object))),
1462 /*complain=*/tf_warning_or_error);
1464 if (current_class_ptr)
1465 TREE_USED (current_class_ptr) = 1;
1466 if (processing_template_decl && !qualifying_scope)
1468 tree type = TREE_TYPE (decl);
1470 if (TREE_CODE (type) == REFERENCE_TYPE)
1471 type = TREE_TYPE (type);
1474 /* Set the cv qualifiers. */
1475 int quals = (current_class_ref
1476 ? cp_type_quals (TREE_TYPE (current_class_ref))
1477 : TYPE_UNQUALIFIED);
1479 if (DECL_MUTABLE_P (decl))
1480 quals &= ~TYPE_QUAL_CONST;
1482 quals |= cp_type_quals (TREE_TYPE (decl));
1483 type = cp_build_qualified_type (type, quals);
1486 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1488 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1489 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1491 else if (processing_template_decl)
1492 return build_qualified_name (TREE_TYPE (decl),
1495 /*template_p=*/false);
1498 tree access_type = TREE_TYPE (object);
1499 tree lookup_context = context_for_name_lookup (decl);
1501 while (!DERIVED_FROM_P (lookup_context, access_type))
1503 access_type = TYPE_CONTEXT (access_type);
1504 while (access_type && DECL_P (access_type))
1505 access_type = DECL_CONTEXT (access_type);
1509 error ("object missing in reference to %q+D", decl);
1510 error ("from this location");
1511 return error_mark_node;
1515 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1518 /* If the data member was named `C::M', convert `*this' to `C'
1520 if (qualifying_scope)
1522 tree binfo = NULL_TREE;
1523 object = build_scoped_ref (object, qualifying_scope,
1527 return build_class_member_access_expr (object, decl,
1528 /*access_path=*/NULL_TREE,
1529 /*preserve_reference=*/false,
1530 tf_warning_or_error);
1534 /* If we are currently parsing a template and we encountered a typedef
1535 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1536 adds the typedef to a list tied to the current template.
1537 At tempate instantiatin time, that list is walked and access check
1538 performed for each typedef.
1539 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1542 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1544 location_t location)
1546 tree template_info = NULL;
1547 tree cs = current_scope ();
1549 if (!is_typedef_decl (typedef_decl)
1551 || !CLASS_TYPE_P (context)
1555 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1556 template_info = get_template_info (cs);
1559 && TI_TEMPLATE (template_info)
1560 && !currently_open_class (context))
1561 append_type_to_template_for_access_check (cs, typedef_decl,
1565 /* DECL was the declaration to which a qualified-id resolved. Issue
1566 an error message if it is not accessible. If OBJECT_TYPE is
1567 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1568 type of `*x', or `x', respectively. If the DECL was named as
1569 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1572 check_accessibility_of_qualified_id (tree decl,
1574 tree nested_name_specifier)
1577 tree qualifying_type = NULL_TREE;
1579 /* If we are parsing a template declaration and if decl is a typedef,
1580 add it to a list tied to the template.
1581 At template instantiation time, that list will be walked and
1582 access check performed. */
1583 add_typedef_to_current_template_for_access_check (decl,
1584 nested_name_specifier
1585 ? nested_name_specifier
1586 : DECL_CONTEXT (decl),
1589 /* If we're not checking, return immediately. */
1590 if (deferred_access_no_check)
1593 /* Determine the SCOPE of DECL. */
1594 scope = context_for_name_lookup (decl);
1595 /* If the SCOPE is not a type, then DECL is not a member. */
1596 if (!TYPE_P (scope))
1598 /* Compute the scope through which DECL is being accessed. */
1600 /* OBJECT_TYPE might not be a class type; consider:
1602 class A { typedef int I; };
1606 In this case, we will have "A::I" as the DECL, but "I" as the
1608 && CLASS_TYPE_P (object_type)
1609 && DERIVED_FROM_P (scope, object_type))
1610 /* If we are processing a `->' or `.' expression, use the type of the
1612 qualifying_type = object_type;
1613 else if (nested_name_specifier)
1615 /* If the reference is to a non-static member of the
1616 current class, treat it as if it were referenced through
1618 if (DECL_NONSTATIC_MEMBER_P (decl)
1619 && current_class_ptr
1620 && DERIVED_FROM_P (scope, current_class_type))
1621 qualifying_type = current_class_type;
1622 /* Otherwise, use the type indicated by the
1623 nested-name-specifier. */
1625 qualifying_type = nested_name_specifier;
1628 /* Otherwise, the name must be from the current class or one of
1630 qualifying_type = currently_open_derived_class (scope);
1633 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1634 or similar in a default argument value. */
1635 && CLASS_TYPE_P (qualifying_type)
1636 && !dependent_type_p (qualifying_type))
1637 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1641 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1642 class named to the left of the "::" operator. DONE is true if this
1643 expression is a complete postfix-expression; it is false if this
1644 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1645 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1646 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1647 is true iff this qualified name appears as a template argument. */
1650 finish_qualified_id_expr (tree qualifying_class,
1655 bool template_arg_p)
1657 gcc_assert (TYPE_P (qualifying_class));
1659 if (error_operand_p (expr))
1660 return error_mark_node;
1662 if (DECL_P (expr) || BASELINK_P (expr))
1666 check_template_keyword (expr);
1668 /* If EXPR occurs as the operand of '&', use special handling that
1669 permits a pointer-to-member. */
1670 if (address_p && done)
1672 if (TREE_CODE (expr) == SCOPE_REF)
1673 expr = TREE_OPERAND (expr, 1);
1674 expr = build_offset_ref (qualifying_class, expr,
1675 /*address_p=*/true);
1679 /* Within the scope of a class, turn references to non-static
1680 members into expression of the form "this->...". */
1682 /* But, within a template argument, we do not want make the
1683 transformation, as there is no "this" pointer. */
1685 else if (TREE_CODE (expr) == FIELD_DECL)
1687 push_deferring_access_checks (dk_no_check);
1688 expr = finish_non_static_data_member (expr, current_class_ref,
1690 pop_deferring_access_checks ();
1692 else if (BASELINK_P (expr) && !processing_template_decl)
1696 /* See if any of the functions are non-static members. */
1697 fns = BASELINK_FUNCTIONS (expr);
1698 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1699 fns = TREE_OPERAND (fns, 0);
1700 /* If so, the expression may be relative to 'this'. */
1701 if (!shared_member_p (fns)
1702 && current_class_ref
1703 && DERIVED_FROM_P (qualifying_class, TREE_TYPE (current_class_ref)))
1704 expr = (build_class_member_access_expr
1705 (maybe_dummy_object (qualifying_class, NULL),
1707 BASELINK_ACCESS_BINFO (expr),
1708 /*preserve_reference=*/false,
1709 tf_warning_or_error));
1711 /* The expression is a qualified name whose address is not
1713 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1719 /* Begin a statement-expression. The value returned must be passed to
1720 finish_stmt_expr. */
1723 begin_stmt_expr (void)
1725 return push_stmt_list ();
1728 /* Process the final expression of a statement expression. EXPR can be
1729 NULL, if the final expression is empty. Return a STATEMENT_LIST
1730 containing all the statements in the statement-expression, or
1731 ERROR_MARK_NODE if there was an error. */
1734 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1736 if (error_operand_p (expr))
1738 /* The type of the statement-expression is the type of the last
1740 TREE_TYPE (stmt_expr) = error_mark_node;
1741 return error_mark_node;
1744 /* If the last statement does not have "void" type, then the value
1745 of the last statement is the value of the entire expression. */
1748 tree type = TREE_TYPE (expr);
1750 if (processing_template_decl)
1752 expr = build_stmt (input_location, EXPR_STMT, expr);
1753 expr = add_stmt (expr);
1754 /* Mark the last statement so that we can recognize it as such at
1755 template-instantiation time. */
1756 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1758 else if (VOID_TYPE_P (type))
1760 /* Just treat this like an ordinary statement. */
1761 expr = finish_expr_stmt (expr);
1765 /* It actually has a value we need to deal with. First, force it
1766 to be an rvalue so that we won't need to build up a copy
1767 constructor call later when we try to assign it to something. */
1768 expr = force_rvalue (expr);
1769 if (error_operand_p (expr))
1770 return error_mark_node;
1772 /* Update for array-to-pointer decay. */
1773 type = TREE_TYPE (expr);
1775 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1776 normal statement, but don't convert to void or actually add
1778 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1779 expr = maybe_cleanup_point_expr (expr);
1783 /* The type of the statement-expression is the type of the last
1785 TREE_TYPE (stmt_expr) = type;
1791 /* Finish a statement-expression. EXPR should be the value returned
1792 by the previous begin_stmt_expr. Returns an expression
1793 representing the statement-expression. */
1796 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1801 if (error_operand_p (stmt_expr))
1803 pop_stmt_list (stmt_expr);
1804 return error_mark_node;
1807 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1809 type = TREE_TYPE (stmt_expr);
1810 result = pop_stmt_list (stmt_expr);
1811 TREE_TYPE (result) = type;
1813 if (processing_template_decl)
1815 result = build_min (STMT_EXPR, type, result);
1816 TREE_SIDE_EFFECTS (result) = 1;
1817 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1819 else if (CLASS_TYPE_P (type))
1821 /* Wrap the statement-expression in a TARGET_EXPR so that the
1822 temporary object created by the final expression is destroyed at
1823 the end of the full-expression containing the
1824 statement-expression. */
1825 result = force_target_expr (type, result);
1831 /* Returns the expression which provides the value of STMT_EXPR. */
1834 stmt_expr_value_expr (tree stmt_expr)
1836 tree t = STMT_EXPR_STMT (stmt_expr);
1838 if (TREE_CODE (t) == BIND_EXPR)
1839 t = BIND_EXPR_BODY (t);
1841 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1842 t = STATEMENT_LIST_TAIL (t)->stmt;
1844 if (TREE_CODE (t) == EXPR_STMT)
1845 t = EXPR_STMT_EXPR (t);
1850 /* Return TRUE iff EXPR_STMT is an empty list of
1851 expression statements. */
1854 empty_expr_stmt_p (tree expr_stmt)
1856 tree body = NULL_TREE;
1860 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1861 body = EXPR_STMT_EXPR (expr_stmt);
1862 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1868 if (TREE_CODE (body) == STATEMENT_LIST)
1869 return tsi_end_p (tsi_start (body));
1871 return empty_expr_stmt_p (body);
1876 /* Perform Koenig lookup. FN is the postfix-expression representing
1877 the function (or functions) to call; ARGS are the arguments to the
1878 call. Returns the functions to be considered by overload
1882 perform_koenig_lookup (tree fn, VEC(tree,gc) *args)
1884 tree identifier = NULL_TREE;
1885 tree functions = NULL_TREE;
1886 tree tmpl_args = NULL_TREE;
1887 bool template_id = false;
1889 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1891 /* Use a separate flag to handle null args. */
1893 tmpl_args = TREE_OPERAND (fn, 1);
1894 fn = TREE_OPERAND (fn, 0);
1897 /* Find the name of the overloaded function. */
1898 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1900 else if (is_overloaded_fn (fn))
1903 identifier = DECL_NAME (get_first_fn (functions));
1905 else if (DECL_P (fn))
1908 identifier = DECL_NAME (fn);
1911 /* A call to a namespace-scope function using an unqualified name.
1913 Do Koenig lookup -- unless any of the arguments are
1915 if (!any_type_dependent_arguments_p (args)
1916 && !any_dependent_template_arguments_p (tmpl_args))
1918 fn = lookup_arg_dependent (identifier, functions, args);
1920 /* The unqualified name could not be resolved. */
1921 fn = unqualified_fn_lookup_error (identifier);
1924 if (fn && template_id)
1925 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
1930 /* Generate an expression for `FN (ARGS)'. This may change the
1933 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1934 as a virtual call, even if FN is virtual. (This flag is set when
1935 encountering an expression where the function name is explicitly
1936 qualified. For example a call to `X::f' never generates a virtual
1939 Returns code for the call. */
1942 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
1943 bool koenig_p, tsubst_flags_t complain)
1947 VEC(tree,gc) *orig_args = NULL;
1949 if (fn == error_mark_node)
1950 return error_mark_node;
1952 gcc_assert (!TYPE_P (fn));
1956 if (processing_template_decl)
1958 if (type_dependent_expression_p (fn)
1959 || any_type_dependent_arguments_p (*args))
1961 result = build_nt_call_vec (fn, *args);
1962 KOENIG_LOOKUP_P (result) = koenig_p;
1967 tree fndecl = OVL_CURRENT (fn);
1968 if (TREE_CODE (fndecl) != FUNCTION_DECL
1969 || !TREE_THIS_VOLATILE (fndecl))
1975 current_function_returns_abnormally = 1;
1979 orig_args = make_tree_vector_copy (*args);
1980 if (!BASELINK_P (fn)
1981 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1982 && TREE_TYPE (fn) != unknown_type_node)
1983 fn = build_non_dependent_expr (fn);
1984 make_args_non_dependent (*args);
1987 if (is_overloaded_fn (fn))
1988 fn = baselink_for_fns (fn);
1991 if (BASELINK_P (fn))
1995 /* A call to a member function. From [over.call.func]:
1997 If the keyword this is in scope and refers to the class of
1998 that member function, or a derived class thereof, then the
1999 function call is transformed into a qualified function call
2000 using (*this) as the postfix-expression to the left of the
2001 . operator.... [Otherwise] a contrived object of type T
2002 becomes the implied object argument.
2004 This paragraph is unclear about this situation:
2006 struct A { void f(); };
2007 struct B : public A {};
2008 struct C : public A { void g() { B::f(); }};
2010 In particular, for `B::f', this paragraph does not make clear
2011 whether "the class of that member function" refers to `A' or
2012 to `B'. We believe it refers to `B'. */
2013 if (current_class_type
2014 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2016 && current_class_ref)
2017 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2021 tree representative_fn;
2023 representative_fn = BASELINK_FUNCTIONS (fn);
2024 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
2025 representative_fn = TREE_OPERAND (representative_fn, 0);
2026 representative_fn = get_first_fn (representative_fn);
2027 object = build_dummy_object (DECL_CONTEXT (representative_fn));
2030 if (processing_template_decl)
2032 if (type_dependent_expression_p (object))
2034 tree ret = build_nt_call_vec (orig_fn, orig_args);
2035 release_tree_vector (orig_args);
2038 object = build_non_dependent_expr (object);
2041 result = build_new_method_call (object, fn, args, NULL_TREE,
2043 ? LOOKUP_NONVIRTUAL : 0),
2047 else if (is_overloaded_fn (fn))
2049 /* If the function is an overloaded builtin, resolve it. */
2050 if (TREE_CODE (fn) == FUNCTION_DECL
2051 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2052 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2053 result = resolve_overloaded_builtin (input_location, fn, *args);
2056 /* A call to a namespace-scope function. */
2057 result = build_new_function_call (fn, args, koenig_p, complain);
2059 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2061 if (!VEC_empty (tree, *args))
2062 error ("arguments to destructor are not allowed");
2063 /* Mark the pseudo-destructor call as having side-effects so
2064 that we do not issue warnings about its use. */
2065 result = build1 (NOP_EXPR,
2067 TREE_OPERAND (fn, 0));
2068 TREE_SIDE_EFFECTS (result) = 1;
2070 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2071 /* If the "function" is really an object of class type, it might
2072 have an overloaded `operator ()'. */
2073 result = build_op_call (fn, args, complain);
2076 /* A call where the function is unknown. */
2077 result = cp_build_function_call_vec (fn, args, complain);
2079 if (processing_template_decl)
2081 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2082 KOENIG_LOOKUP_P (result) = koenig_p;
2083 release_tree_vector (orig_args);
2089 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2090 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2091 POSTDECREMENT_EXPR.) */
2094 finish_increment_expr (tree expr, enum tree_code code)
2096 return build_x_unary_op (code, expr, tf_warning_or_error);
2099 /* Finish a use of `this'. Returns an expression for `this'. */
2102 finish_this_expr (void)
2106 /* In a lambda expression, 'this' refers to the captured 'this'. */
2107 if (current_function_decl
2108 && LAMBDA_FUNCTION_P (current_function_decl))
2109 result = (lambda_expr_this_capture
2110 (CLASSTYPE_LAMBDA_EXPR (current_class_type)));
2111 else if (current_class_ptr)
2112 result = current_class_ptr;
2113 else if (current_function_decl
2114 && DECL_STATIC_FUNCTION_P (current_function_decl))
2116 error ("%<this%> is unavailable for static member functions");
2117 result = error_mark_node;
2121 if (current_function_decl)
2122 error ("invalid use of %<this%> in non-member function");
2124 error ("invalid use of %<this%> at top level");
2125 result = error_mark_node;
2131 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2132 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2133 the TYPE for the type given. If SCOPE is non-NULL, the expression
2134 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2137 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2139 if (object == error_mark_node || destructor == error_mark_node)
2140 return error_mark_node;
2142 gcc_assert (TYPE_P (destructor));
2144 if (!processing_template_decl)
2146 if (scope == error_mark_node)
2148 error ("invalid qualifying scope in pseudo-destructor name");
2149 return error_mark_node;
2151 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2153 error ("qualified type %qT does not match destructor name ~%qT",
2155 return error_mark_node;
2159 /* [expr.pseudo] says both:
2161 The type designated by the pseudo-destructor-name shall be
2162 the same as the object type.
2166 The cv-unqualified versions of the object type and of the
2167 type designated by the pseudo-destructor-name shall be the
2170 We implement the more generous second sentence, since that is
2171 what most other compilers do. */
2172 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2175 error ("%qE is not of type %qT", object, destructor);
2176 return error_mark_node;
2180 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2183 /* Finish an expression of the form CODE EXPR. */
2186 finish_unary_op_expr (enum tree_code code, tree expr)
2188 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2189 /* Inside a template, build_x_unary_op does not fold the
2190 expression. So check whether the result is folded before
2191 setting TREE_NEGATED_INT. */
2192 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2193 && TREE_CODE (result) == INTEGER_CST
2194 && !TYPE_UNSIGNED (TREE_TYPE (result))
2195 && INT_CST_LT (result, integer_zero_node))
2197 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2198 setting TREE_NEGATED_INT. */
2199 result = copy_node (result);
2200 TREE_NEGATED_INT (result) = 1;
2202 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2203 overflow_warning (input_location, result);
2208 /* Finish a compound-literal expression. TYPE is the type to which
2209 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2212 finish_compound_literal (tree type, tree compound_literal)
2214 if (type == error_mark_node)
2215 return error_mark_node;
2217 if (!TYPE_OBJ_P (type))
2219 error ("compound literal of non-object type %qT", type);
2220 return error_mark_node;
2223 if (processing_template_decl)
2225 TREE_TYPE (compound_literal) = type;
2226 /* Mark the expression as a compound literal. */
2227 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2228 return compound_literal;
2231 type = complete_type (type);
2233 if (TYPE_NON_AGGREGATE_CLASS (type))
2235 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2236 everywhere that deals with function arguments would be a pain, so
2237 just wrap it in a TREE_LIST. The parser set a flag so we know
2238 that it came from T{} rather than T({}). */
2239 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2240 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2241 return build_functional_cast (type, compound_literal, tf_error);
2244 if (TREE_CODE (type) == ARRAY_TYPE
2245 && check_array_initializer (NULL_TREE, type, compound_literal))
2246 return error_mark_node;
2247 compound_literal = reshape_init (type, compound_literal);
2248 if (TREE_CODE (type) == ARRAY_TYPE)
2249 cp_complete_array_type (&type, compound_literal, false);
2250 compound_literal = digest_init (type, compound_literal);
2251 if ((!at_function_scope_p () || cp_type_readonly (type))
2252 && initializer_constant_valid_p (compound_literal, type))
2254 tree decl = create_temporary_var (type);
2255 DECL_INITIAL (decl) = compound_literal;
2256 TREE_STATIC (decl) = 1;
2257 decl = pushdecl_top_level (decl);
2258 DECL_NAME (decl) = make_anon_name ();
2259 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2263 return get_target_expr (compound_literal);
2266 /* Return the declaration for the function-name variable indicated by
2270 finish_fname (tree id)
2274 decl = fname_decl (input_location, C_RID_CODE (id), id);
2275 if (processing_template_decl)
2276 decl = DECL_NAME (decl);
2280 /* Finish a translation unit. */
2283 finish_translation_unit (void)
2285 /* In case there were missing closebraces,
2286 get us back to the global binding level. */
2288 while (current_namespace != global_namespace)
2291 /* Do file scope __FUNCTION__ et al. */
2292 finish_fname_decls ();
2295 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2296 Returns the parameter. */
2299 finish_template_type_parm (tree aggr, tree identifier)
2301 if (aggr != class_type_node)
2303 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2304 aggr = class_type_node;
2307 return build_tree_list (aggr, identifier);
2310 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2311 Returns the parameter. */
2314 finish_template_template_parm (tree aggr, tree identifier)
2316 tree decl = build_decl (input_location,
2317 TYPE_DECL, identifier, NULL_TREE);
2318 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2319 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2320 DECL_TEMPLATE_RESULT (tmpl) = decl;
2321 DECL_ARTIFICIAL (decl) = 1;
2322 end_template_decl ();
2324 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2326 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2327 /*is_primary=*/true, /*is_partial=*/false,
2330 return finish_template_type_parm (aggr, tmpl);
2333 /* ARGUMENT is the default-argument value for a template template
2334 parameter. If ARGUMENT is invalid, issue error messages and return
2335 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2338 check_template_template_default_arg (tree argument)
2340 if (TREE_CODE (argument) != TEMPLATE_DECL
2341 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2342 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2344 if (TREE_CODE (argument) == TYPE_DECL)
2345 error ("invalid use of type %qT as a default value for a template "
2346 "template-parameter", TREE_TYPE (argument));
2348 error ("invalid default argument for a template template parameter");
2349 return error_mark_node;
2355 /* Begin a class definition, as indicated by T. */
2358 begin_class_definition (tree t, tree attributes)
2360 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2361 return error_mark_node;
2363 if (processing_template_parmlist)
2365 error ("definition of %q#T inside template parameter list", t);
2366 return error_mark_node;
2368 /* A non-implicit typename comes from code like:
2370 template <typename T> struct A {
2371 template <typename U> struct A<T>::B ...
2373 This is erroneous. */
2374 else if (TREE_CODE (t) == TYPENAME_TYPE)
2376 error ("invalid definition of qualified type %qT", t);
2377 t = error_mark_node;
2380 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2382 t = make_class_type (RECORD_TYPE);
2383 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2386 /* Update the location of the decl. */
2387 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2389 if (TYPE_BEING_DEFINED (t))
2391 t = make_class_type (TREE_CODE (t));
2392 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2394 maybe_process_partial_specialization (t);
2396 TYPE_BEING_DEFINED (t) = 1;
2398 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2400 if (flag_pack_struct)
2403 TYPE_PACKED (t) = 1;
2404 /* Even though the type is being defined for the first time
2405 here, there might have been a forward declaration, so there
2406 might be cv-qualified variants of T. */
2407 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2408 TYPE_PACKED (v) = 1;
2410 /* Reset the interface data, at the earliest possible
2411 moment, as it might have been set via a class foo;
2413 if (! TYPE_ANONYMOUS_P (t))
2415 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2416 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2417 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2418 (t, finfo->interface_unknown);
2420 reset_specialization();
2422 /* Make a declaration for this class in its own scope. */
2423 build_self_reference ();
2428 /* Finish the member declaration given by DECL. */
2431 finish_member_declaration (tree decl)
2433 if (decl == error_mark_node || decl == NULL_TREE)
2436 if (decl == void_type_node)
2437 /* The COMPONENT was a friend, not a member, and so there's
2438 nothing for us to do. */
2441 /* We should see only one DECL at a time. */
2442 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2444 /* Set up access control for DECL. */
2446 = (current_access_specifier == access_private_node);
2447 TREE_PROTECTED (decl)
2448 = (current_access_specifier == access_protected_node);
2449 if (TREE_CODE (decl) == TEMPLATE_DECL)
2451 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2452 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2455 /* Mark the DECL as a member of the current class. */
2456 DECL_CONTEXT (decl) = current_class_type;
2458 /* Check for bare parameter packs in the member variable declaration. */
2459 if (TREE_CODE (decl) == FIELD_DECL)
2461 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2462 TREE_TYPE (decl) = error_mark_node;
2463 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2464 DECL_ATTRIBUTES (decl) = NULL_TREE;
2469 A C language linkage is ignored for the names of class members
2470 and the member function type of class member functions. */
2471 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2472 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2474 /* Put functions on the TYPE_METHODS list and everything else on the
2475 TYPE_FIELDS list. Note that these are built up in reverse order.
2476 We reverse them (to obtain declaration order) in finish_struct. */
2477 if (TREE_CODE (decl) == FUNCTION_DECL
2478 || DECL_FUNCTION_TEMPLATE_P (decl))
2480 /* We also need to add this function to the
2481 CLASSTYPE_METHOD_VEC. */
2482 if (add_method (current_class_type, decl, NULL_TREE))
2484 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2485 TYPE_METHODS (current_class_type) = decl;
2487 maybe_add_class_template_decl_list (current_class_type, decl,
2491 /* Enter the DECL into the scope of the class. */
2492 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2493 || pushdecl_class_level (decl))
2495 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2496 go at the beginning. The reason is that lookup_field_1
2497 searches the list in order, and we want a field name to
2498 override a type name so that the "struct stat hack" will
2499 work. In particular:
2501 struct S { enum E { }; int E } s;
2504 is valid. In addition, the FIELD_DECLs must be maintained in
2505 declaration order so that class layout works as expected.
2506 However, we don't need that order until class layout, so we
2507 save a little time by putting FIELD_DECLs on in reverse order
2508 here, and then reversing them in finish_struct_1. (We could
2509 also keep a pointer to the correct insertion points in the
2512 if (TREE_CODE (decl) == TYPE_DECL)
2513 TYPE_FIELDS (current_class_type)
2514 = chainon (TYPE_FIELDS (current_class_type), decl);
2517 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2518 TYPE_FIELDS (current_class_type) = decl;
2521 maybe_add_class_template_decl_list (current_class_type, decl,
2526 note_decl_for_pch (decl);
2529 /* DECL has been declared while we are building a PCH file. Perform
2530 actions that we might normally undertake lazily, but which can be
2531 performed now so that they do not have to be performed in
2532 translation units which include the PCH file. */
2535 note_decl_for_pch (tree decl)
2537 gcc_assert (pch_file);
2539 /* There's a good chance that we'll have to mangle names at some
2540 point, even if only for emission in debugging information. */
2541 if ((TREE_CODE (decl) == VAR_DECL
2542 || TREE_CODE (decl) == FUNCTION_DECL)
2543 && !processing_template_decl)
2547 /* Finish processing a complete template declaration. The PARMS are
2548 the template parameters. */
2551 finish_template_decl (tree parms)
2554 end_template_decl ();
2556 end_specialization ();
2559 /* Finish processing a template-id (which names a type) of the form
2560 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2561 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2562 the scope of template-id indicated. */
2565 finish_template_type (tree name, tree args, int entering_scope)
2569 decl = lookup_template_class (name, args,
2570 NULL_TREE, NULL_TREE, entering_scope,
2571 tf_warning_or_error | tf_user);
2572 if (decl != error_mark_node)
2573 decl = TYPE_STUB_DECL (decl);
2578 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2579 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2580 BASE_CLASS, or NULL_TREE if an error occurred. The
2581 ACCESS_SPECIFIER is one of
2582 access_{default,public,protected_private}_node. For a virtual base
2583 we set TREE_TYPE. */
2586 finish_base_specifier (tree base, tree access, bool virtual_p)
2590 if (base == error_mark_node)
2592 error ("invalid base-class specification");
2595 else if (! MAYBE_CLASS_TYPE_P (base))
2597 error ("%qT is not a class type", base);
2602 if (cp_type_quals (base) != 0)
2604 error ("base class %qT has cv qualifiers", base);
2605 base = TYPE_MAIN_VARIANT (base);
2607 result = build_tree_list (access, base);
2609 TREE_TYPE (result) = integer_type_node;
2615 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2616 what we found when we tried to do the lookup.
2617 LOCATION is the location of the NAME identifier;
2618 The location is used in the error message*/
2621 qualified_name_lookup_error (tree scope, tree name,
2622 tree decl, location_t location)
2624 if (scope == error_mark_node)
2625 ; /* We already complained. */
2626 else if (TYPE_P (scope))
2628 if (!COMPLETE_TYPE_P (scope))
2629 error_at (location, "incomplete type %qT used in nested name specifier",
2631 else if (TREE_CODE (decl) == TREE_LIST)
2633 error_at (location, "reference to %<%T::%D%> is ambiguous",
2635 print_candidates (decl);
2638 error_at (location, "%qD is not a member of %qT", name, scope);
2640 else if (scope != global_namespace)
2641 error_at (location, "%qD is not a member of %qD", name, scope);
2643 error_at (location, "%<::%D%> has not been declared", name);
2646 /* If FNS is a member function, a set of member functions, or a
2647 template-id referring to one or more member functions, return a
2648 BASELINK for FNS, incorporating the current access context.
2649 Otherwise, return FNS unchanged. */
2652 baselink_for_fns (tree fns)
2657 if (BASELINK_P (fns)
2658 || error_operand_p (fns))
2662 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2663 fn = TREE_OPERAND (fn, 0);
2664 fn = get_first_fn (fn);
2665 if (!DECL_FUNCTION_MEMBER_P (fn))
2668 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2670 cl = DECL_CONTEXT (fn);
2671 cl = TYPE_BINFO (cl);
2672 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2675 /* Returns true iff DECL is an automatic variable from a function outside
2679 outer_automatic_var_p (tree decl)
2681 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2682 && DECL_FUNCTION_SCOPE_P (decl)
2683 && !TREE_STATIC (decl)
2684 && DECL_CONTEXT (decl) != current_function_decl);
2687 /* Returns true iff DECL is a capture field from a lambda that is not our
2688 immediate context. */
2691 outer_lambda_capture_p (tree decl)
2693 return (TREE_CODE (decl) == FIELD_DECL
2694 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2695 && (!current_class_type
2696 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2699 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2700 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2701 if non-NULL, is the type or namespace used to explicitly qualify
2702 ID_EXPRESSION. DECL is the entity to which that name has been
2705 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2706 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2707 be set to true if this expression isn't permitted in a
2708 constant-expression, but it is otherwise not set by this function.
2709 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2710 constant-expression, but a non-constant expression is also
2713 DONE is true if this expression is a complete postfix-expression;
2714 it is false if this expression is followed by '->', '[', '(', etc.
2715 ADDRESS_P is true iff this expression is the operand of '&'.
2716 TEMPLATE_P is true iff the qualified-id was of the form
2717 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2718 appears as a template argument.
2720 If an error occurs, and it is the kind of error that might cause
2721 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2722 is the caller's responsibility to issue the message. *ERROR_MSG
2723 will be a string with static storage duration, so the caller need
2726 Return an expression for the entity, after issuing appropriate
2727 diagnostics. This function is also responsible for transforming a
2728 reference to a non-static member into a COMPONENT_REF that makes
2729 the use of "this" explicit.
2731 Upon return, *IDK will be filled in appropriately. */
2733 finish_id_expression (tree id_expression,
2737 bool integral_constant_expression_p,
2738 bool allow_non_integral_constant_expression_p,
2739 bool *non_integral_constant_expression_p,
2743 bool template_arg_p,
2744 const char **error_msg,
2745 location_t location)
2747 /* Initialize the output parameters. */
2748 *idk = CP_ID_KIND_NONE;
2751 if (id_expression == error_mark_node)
2752 return error_mark_node;
2753 /* If we have a template-id, then no further lookup is
2754 required. If the template-id was for a template-class, we
2755 will sometimes have a TYPE_DECL at this point. */
2756 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2757 || TREE_CODE (decl) == TYPE_DECL)
2759 /* Look up the name. */
2762 if (decl == error_mark_node)
2764 /* Name lookup failed. */
2767 || (!dependent_type_p (scope)
2768 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2769 && IDENTIFIER_TYPENAME_P (id_expression)
2770 && dependent_type_p (TREE_TYPE (id_expression))))))
2772 /* If the qualifying type is non-dependent (and the name
2773 does not name a conversion operator to a dependent
2774 type), issue an error. */
2775 qualified_name_lookup_error (scope, id_expression, decl, location);
2776 return error_mark_node;
2780 /* It may be resolved via Koenig lookup. */
2781 *idk = CP_ID_KIND_UNQUALIFIED;
2782 return id_expression;
2785 decl = id_expression;
2787 /* If DECL is a variable that would be out of scope under
2788 ANSI/ISO rules, but in scope in the ARM, name lookup
2789 will succeed. Issue a diagnostic here. */
2791 decl = check_for_out_of_scope_variable (decl);
2793 /* Remember that the name was used in the definition of
2794 the current class so that we can check later to see if
2795 the meaning would have been different after the class
2796 was entirely defined. */
2797 if (!scope && decl != error_mark_node)
2798 maybe_note_name_used_in_class (id_expression, decl);
2800 /* Disallow uses of local variables from containing functions, except
2801 within lambda-expressions. */
2802 if ((outer_automatic_var_p (decl)
2803 || outer_lambda_capture_p (decl))
2804 /* It's not a use (3.2) if we're in an unevaluated context. */
2805 && !cp_unevaluated_operand)
2807 tree context = DECL_CONTEXT (decl);
2808 tree containing_function = current_function_decl;
2809 tree lambda_stack = NULL_TREE;
2810 tree lambda_expr = NULL_TREE;
2811 tree initializer = decl;
2813 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2814 support for an approach in which a reference to a local
2815 [constant] automatic variable in a nested class or lambda body
2816 would enter the expression as an rvalue, which would reduce
2817 the complexity of the problem"
2819 FIXME update for final resolution of core issue 696. */
2820 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2821 return integral_constant_value (decl);
2823 if (TYPE_P (context))
2825 /* Implicit capture of an explicit capture. */
2826 context = lambda_function (context);
2827 initializer = thisify_lambda_field (decl);
2830 /* If we are in a lambda function, we can move out until we hit
2832 2. a non-lambda function, or
2833 3. a non-default capturing lambda function. */
2834 while (context != containing_function
2835 && LAMBDA_FUNCTION_P (containing_function))
2837 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2838 (DECL_CONTEXT (containing_function));
2840 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2844 lambda_stack = tree_cons (NULL_TREE,
2849 = decl_function_context (containing_function);
2852 if (context == containing_function)
2854 decl = add_default_capture (lambda_stack,
2855 /*id=*/DECL_NAME (decl),
2858 else if (lambda_expr)
2860 error ("%qD is not captured", decl);
2861 return error_mark_node;
2865 error (TREE_CODE (decl) == VAR_DECL
2866 ? "use of %<auto%> variable from containing function"
2867 : "use of parameter from containing function");
2868 error (" %q+#D declared here", decl);
2869 return error_mark_node;
2874 /* If we didn't find anything, or what we found was a type,
2875 then this wasn't really an id-expression. */
2876 if (TREE_CODE (decl) == TEMPLATE_DECL
2877 && !DECL_FUNCTION_TEMPLATE_P (decl))
2879 *error_msg = "missing template arguments";
2880 return error_mark_node;
2882 else if (TREE_CODE (decl) == TYPE_DECL
2883 || TREE_CODE (decl) == NAMESPACE_DECL)
2885 *error_msg = "expected primary-expression";
2886 return error_mark_node;
2889 /* If the name resolved to a template parameter, there is no
2890 need to look it up again later. */
2891 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2892 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2896 *idk = CP_ID_KIND_NONE;
2897 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2898 decl = TEMPLATE_PARM_DECL (decl);
2899 r = convert_from_reference (DECL_INITIAL (decl));
2901 if (integral_constant_expression_p
2902 && !dependent_type_p (TREE_TYPE (decl))
2903 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2905 if (!allow_non_integral_constant_expression_p)
2906 error ("template parameter %qD of type %qT is not allowed in "
2907 "an integral constant expression because it is not of "
2908 "integral or enumeration type", decl, TREE_TYPE (decl));
2909 *non_integral_constant_expression_p = true;
2913 /* Similarly, we resolve enumeration constants to their
2914 underlying values. */
2915 else if (TREE_CODE (decl) == CONST_DECL)
2917 *idk = CP_ID_KIND_NONE;
2918 if (!processing_template_decl)
2920 used_types_insert (TREE_TYPE (decl));
2921 return DECL_INITIAL (decl);
2929 /* If the declaration was explicitly qualified indicate
2930 that. The semantics of `A::f(3)' are different than
2931 `f(3)' if `f' is virtual. */
2933 ? CP_ID_KIND_QUALIFIED
2934 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2935 ? CP_ID_KIND_TEMPLATE_ID
2936 : CP_ID_KIND_UNQUALIFIED));
2941 An id-expression is type-dependent if it contains an
2942 identifier that was declared with a dependent type.
2944 The standard is not very specific about an id-expression that
2945 names a set of overloaded functions. What if some of them
2946 have dependent types and some of them do not? Presumably,
2947 such a name should be treated as a dependent name. */
2948 /* Assume the name is not dependent. */
2949 dependent_p = false;
2950 if (!processing_template_decl)
2951 /* No names are dependent outside a template. */
2953 /* A template-id where the name of the template was not resolved
2954 is definitely dependent. */
2955 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2956 && (TREE_CODE (TREE_OPERAND (decl, 0))
2957 == IDENTIFIER_NODE))
2959 /* For anything except an overloaded function, just check its
2961 else if (!is_overloaded_fn (decl))
2963 = dependent_type_p (TREE_TYPE (decl));
2964 /* For a set of overloaded functions, check each of the
2970 if (BASELINK_P (fns))
2971 fns = BASELINK_FUNCTIONS (fns);
2973 /* For a template-id, check to see if the template
2974 arguments are dependent. */
2975 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2977 tree args = TREE_OPERAND (fns, 1);
2978 dependent_p = any_dependent_template_arguments_p (args);
2979 /* The functions are those referred to by the
2981 fns = TREE_OPERAND (fns, 0);
2984 /* If there are no dependent template arguments, go through
2985 the overloaded functions. */
2986 while (fns && !dependent_p)
2988 tree fn = OVL_CURRENT (fns);
2990 /* Member functions of dependent classes are
2992 if (TREE_CODE (fn) == FUNCTION_DECL
2993 && type_dependent_expression_p (fn))
2995 else if (TREE_CODE (fn) == TEMPLATE_DECL
2996 && dependent_template_p (fn))
2999 fns = OVL_NEXT (fns);
3003 /* If the name was dependent on a template parameter, we will
3004 resolve the name at instantiation time. */
3007 /* Create a SCOPE_REF for qualified names, if the scope is
3013 if (address_p && done)
3014 decl = finish_qualified_id_expr (scope, decl,
3020 tree type = NULL_TREE;
3021 if (DECL_P (decl) && !dependent_scope_p (scope))
3022 type = TREE_TYPE (decl);
3023 decl = build_qualified_name (type,
3029 if (TREE_TYPE (decl))
3030 decl = convert_from_reference (decl);
3033 /* A TEMPLATE_ID already contains all the information we
3035 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3036 return id_expression;
3037 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3038 /* If we found a variable, then name lookup during the
3039 instantiation will always resolve to the same VAR_DECL
3040 (or an instantiation thereof). */
3041 if (TREE_CODE (decl) == VAR_DECL
3042 || TREE_CODE (decl) == PARM_DECL)
3043 return convert_from_reference (decl);
3044 /* The same is true for FIELD_DECL, but we also need to
3045 make sure that the syntax is correct. */
3046 else if (TREE_CODE (decl) == FIELD_DECL)
3048 /* Since SCOPE is NULL here, this is an unqualified name.
3049 Access checking has been performed during name lookup
3050 already. Turn off checking to avoid duplicate errors. */
3051 push_deferring_access_checks (dk_no_check);
3052 decl = finish_non_static_data_member
3053 (decl, current_class_ref,
3054 /*qualifying_scope=*/NULL_TREE);
3055 pop_deferring_access_checks ();
3058 return id_expression;
3061 /* Only certain kinds of names are allowed in constant
3062 expression. Enumerators and template parameters have already
3063 been handled above. */
3064 if (integral_constant_expression_p
3065 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
3066 && ! builtin_valid_in_constant_expr_p (decl))
3068 if (!allow_non_integral_constant_expression_p)
3070 error ("%qD cannot appear in a constant-expression", decl);
3071 return error_mark_node;
3073 *non_integral_constant_expression_p = true;
3076 if (TREE_CODE (decl) == NAMESPACE_DECL)
3078 error ("use of namespace %qD as expression", decl);
3079 return error_mark_node;
3081 else if (DECL_CLASS_TEMPLATE_P (decl))
3083 error ("use of class template %qT as expression", decl);
3084 return error_mark_node;
3086 else if (TREE_CODE (decl) == TREE_LIST)
3088 /* Ambiguous reference to base members. */
3089 error ("request for member %qD is ambiguous in "
3090 "multiple inheritance lattice", id_expression);
3091 print_candidates (decl);
3092 return error_mark_node;
3095 /* Mark variable-like entities as used. Functions are similarly
3096 marked either below or after overload resolution. */
3097 if (TREE_CODE (decl) == VAR_DECL
3098 || TREE_CODE (decl) == PARM_DECL
3099 || TREE_CODE (decl) == RESULT_DECL)
3104 decl = (adjust_result_of_qualified_name_lookup
3105 (decl, scope, current_class_type));
3107 if (TREE_CODE (decl) == FUNCTION_DECL)
3110 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3111 decl = finish_qualified_id_expr (scope,
3119 tree r = convert_from_reference (decl);
3121 if (processing_template_decl && TYPE_P (scope))
3122 r = build_qualified_name (TREE_TYPE (r),
3128 else if (TREE_CODE (decl) == FIELD_DECL)
3130 /* Since SCOPE is NULL here, this is an unqualified name.
3131 Access checking has been performed during name lookup
3132 already. Turn off checking to avoid duplicate errors. */
3133 push_deferring_access_checks (dk_no_check);
3134 decl = finish_non_static_data_member (decl, current_class_ref,
3135 /*qualifying_scope=*/NULL_TREE);
3136 pop_deferring_access_checks ();
3138 else if (is_overloaded_fn (decl))
3143 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
3144 first_fn = TREE_OPERAND (first_fn, 0);
3145 first_fn = get_first_fn (first_fn);
3146 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3147 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3149 if (!really_overloaded_fn (decl))
3150 mark_used (first_fn);
3153 && TREE_CODE (first_fn) == FUNCTION_DECL
3154 && DECL_FUNCTION_MEMBER_P (first_fn)
3155 && !shared_member_p (decl))
3157 /* A set of member functions. */
3158 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3159 return finish_class_member_access_expr (decl, id_expression,
3160 /*template_p=*/false,
3161 tf_warning_or_error);
3164 decl = baselink_for_fns (decl);
3168 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3169 && DECL_CLASS_SCOPE_P (decl))
3171 tree context = context_for_name_lookup (decl);
3172 if (context != current_class_type)
3174 tree path = currently_open_derived_class (context);
3175 perform_or_defer_access_check (TYPE_BINFO (path),
3180 decl = convert_from_reference (decl);
3184 if (TREE_DEPRECATED (decl))
3185 warn_deprecated_use (decl, NULL_TREE);
3190 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3191 use as a type-specifier. */
3194 finish_typeof (tree expr)
3198 if (type_dependent_expression_p (expr))
3200 type = cxx_make_type (TYPEOF_TYPE);
3201 TYPEOF_TYPE_EXPR (type) = expr;
3202 SET_TYPE_STRUCTURAL_EQUALITY (type);
3207 type = unlowered_expr_type (expr);
3209 if (!type || type == unknown_type_node)
3211 error ("type of %qE is unknown", expr);
3212 return error_mark_node;
3218 /* Perform C++-specific checks for __builtin_offsetof before calling
3222 finish_offsetof (tree expr)
3224 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3226 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3227 TREE_OPERAND (expr, 2));
3228 return error_mark_node;
3230 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3231 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3232 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3234 if (TREE_CODE (expr) == COMPONENT_REF
3235 || TREE_CODE (expr) == COMPOUND_EXPR)
3236 expr = TREE_OPERAND (expr, 1);
3237 error ("cannot apply %<offsetof%> to member function %qD", expr);
3238 return error_mark_node;
3240 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3241 expr = TREE_OPERAND (expr, 0);
3242 return fold_offsetof (expr, NULL_TREE);
3245 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3246 function is broken out from the above for the benefit of the tree-ssa
3250 simplify_aggr_init_expr (tree *tp)
3252 tree aggr_init_expr = *tp;
3254 /* Form an appropriate CALL_EXPR. */
3255 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3256 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3257 tree type = TREE_TYPE (slot);
3260 enum style_t { ctor, arg, pcc } style;
3262 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3264 #ifdef PCC_STATIC_STRUCT_RETURN
3270 gcc_assert (TREE_ADDRESSABLE (type));
3274 call_expr = build_call_array_loc (input_location,
3275 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3277 aggr_init_expr_nargs (aggr_init_expr),
3278 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3282 /* Replace the first argument to the ctor with the address of the
3284 cxx_mark_addressable (slot);
3285 CALL_EXPR_ARG (call_expr, 0) =
3286 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3288 else if (style == arg)
3290 /* Just mark it addressable here, and leave the rest to
3291 expand_call{,_inline}. */
3292 cxx_mark_addressable (slot);
3293 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3294 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3296 else if (style == pcc)
3298 /* If we're using the non-reentrant PCC calling convention, then we
3299 need to copy the returned value out of the static buffer into the
3301 push_deferring_access_checks (dk_no_check);
3302 call_expr = build_aggr_init (slot, call_expr,
3303 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3304 tf_warning_or_error);
3305 pop_deferring_access_checks ();
3306 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3309 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3311 tree init = build_zero_init (type, NULL_TREE,
3312 /*static_storage_p=*/false);
3313 init = build2 (INIT_EXPR, void_type_node, slot, init);
3314 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3321 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3324 emit_associated_thunks (tree fn)
3326 /* When we use vcall offsets, we emit thunks with the virtual
3327 functions to which they thunk. The whole point of vcall offsets
3328 is so that you can know statically the entire set of thunks that
3329 will ever be needed for a given virtual function, thereby
3330 enabling you to output all the thunks with the function itself. */
3331 if (DECL_VIRTUAL_P (fn)
3332 /* Do not emit thunks for extern template instantiations. */
3333 && ! DECL_REALLY_EXTERN (fn))
3337 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3339 if (!THUNK_ALIAS (thunk))
3341 use_thunk (thunk, /*emit_p=*/1);
3342 if (DECL_RESULT_THUNK_P (thunk))
3346 for (probe = DECL_THUNKS (thunk);
3347 probe; probe = TREE_CHAIN (probe))
3348 use_thunk (probe, /*emit_p=*/1);
3352 gcc_assert (!DECL_THUNKS (thunk));
3357 /* Generate RTL for FN. */
3360 expand_or_defer_fn_1 (tree fn)
3362 /* When the parser calls us after finishing the body of a template
3363 function, we don't really want to expand the body. */
3364 if (processing_template_decl)
3366 /* Normally, collection only occurs in rest_of_compilation. So,
3367 if we don't collect here, we never collect junk generated
3368 during the processing of templates until we hit a
3369 non-template function. It's not safe to do this inside a
3370 nested class, though, as the parser may have local state that
3371 is not a GC root. */
3372 if (!function_depth)
3377 gcc_assert (DECL_SAVED_TREE (fn));
3379 /* If this is a constructor or destructor body, we have to clone
3381 if (maybe_clone_body (fn))
3383 /* We don't want to process FN again, so pretend we've written
3384 it out, even though we haven't. */
3385 TREE_ASM_WRITTEN (fn) = 1;
3386 DECL_SAVED_TREE (fn) = NULL_TREE;
3390 /* We make a decision about linkage for these functions at the end
3391 of the compilation. Until that point, we do not want the back
3392 end to output them -- but we do want it to see the bodies of
3393 these functions so that it can inline them as appropriate. */
3394 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3396 if (DECL_INTERFACE_KNOWN (fn))
3397 /* We've already made a decision as to how this function will
3401 DECL_EXTERNAL (fn) = 1;
3402 DECL_NOT_REALLY_EXTERN (fn) = 1;
3403 note_vague_linkage_fn (fn);
3404 /* A non-template inline function with external linkage will
3405 always be COMDAT. As we must eventually determine the
3406 linkage of all functions, and as that causes writes to
3407 the data mapped in from the PCH file, it's advantageous
3408 to mark the functions at this point. */
3409 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3411 /* This function must have external linkage, as
3412 otherwise DECL_INTERFACE_KNOWN would have been
3414 gcc_assert (TREE_PUBLIC (fn));
3415 comdat_linkage (fn);
3416 DECL_INTERFACE_KNOWN (fn) = 1;
3420 import_export_decl (fn);
3422 /* If the user wants us to keep all inline functions, then mark
3423 this function as needed so that finish_file will make sure to
3424 output it later. Similarly, all dllexport'd functions must
3425 be emitted; there may be callers in other DLLs. */
3426 if ((flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3427 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn)))
3431 /* There's no reason to do any of the work here if we're only doing
3432 semantic analysis; this code just generates RTL. */
3433 if (flag_syntax_only)
3440 expand_or_defer_fn (tree fn)
3442 if (expand_or_defer_fn_1 (fn))
3446 /* Expand or defer, at the whim of the compilation unit manager. */
3447 cgraph_finalize_function (fn, function_depth > 1);
3460 /* Helper function for walk_tree, used by finalize_nrv below. */
3463 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3465 struct nrv_data *dp = (struct nrv_data *)data;
3468 /* No need to walk into types. There wouldn't be any need to walk into
3469 non-statements, except that we have to consider STMT_EXPRs. */
3472 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3473 but differs from using NULL_TREE in that it indicates that we care
3474 about the value of the RESULT_DECL. */
3475 else if (TREE_CODE (*tp) == RETURN_EXPR)
3476 TREE_OPERAND (*tp, 0) = dp->result;
3477 /* Change all cleanups for the NRV to only run when an exception is
3479 else if (TREE_CODE (*tp) == CLEANUP_STMT
3480 && CLEANUP_DECL (*tp) == dp->var)
3481 CLEANUP_EH_ONLY (*tp) = 1;
3482 /* Replace the DECL_EXPR for the NRV with an initialization of the
3483 RESULT_DECL, if needed. */
3484 else if (TREE_CODE (*tp) == DECL_EXPR
3485 && DECL_EXPR_DECL (*tp) == dp->var)
3488 if (DECL_INITIAL (dp->var)
3489 && DECL_INITIAL (dp->var) != error_mark_node)
3490 init = build2 (INIT_EXPR, void_type_node, dp->result,
3491 DECL_INITIAL (dp->var));
3493 init = build_empty_stmt (EXPR_LOCATION (*tp));
3494 DECL_INITIAL (dp->var) = NULL_TREE;
3495 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3498 /* And replace all uses of the NRV with the RESULT_DECL. */
3499 else if (*tp == dp->var)
3502 /* Avoid walking into the same tree more than once. Unfortunately, we
3503 can't just use walk_tree_without duplicates because it would only call
3504 us for the first occurrence of dp->var in the function body. */
3505 slot = htab_find_slot (dp->visited, *tp, INSERT);
3511 /* Keep iterating. */
3515 /* Called from finish_function to implement the named return value
3516 optimization by overriding all the RETURN_EXPRs and pertinent
3517 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3518 RESULT_DECL for the function. */
3521 finalize_nrv (tree *tp, tree var, tree result)
3523 struct nrv_data data;
3525 /* Copy debugging information from VAR to RESULT. */
3526 DECL_NAME (result) = DECL_NAME (var);
3527 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3528 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3529 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3530 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3531 /* Don't forget that we take its address. */
3532 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3535 data.result = result;
3536 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3537 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3538 htab_delete (data.visited);
3541 /* Return the declaration for the function called by CALL_EXPR T,
3542 TYPE is the class type of the clause decl. */
3545 omp_clause_info_fndecl (tree t, tree type)
3547 tree ret = get_callee_fndecl (t);
3552 gcc_assert (TREE_CODE (t) == CALL_EXPR);
3553 t = CALL_EXPR_FN (t);
3555 if (TREE_CODE (t) == OBJ_TYPE_REF)
3557 t = cp_fold_obj_type_ref (t, type);
3558 if (TREE_CODE (t) == ADDR_EXPR
3559 && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL)
3560 return TREE_OPERAND (t, 0);
3566 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3569 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3570 bool need_copy_ctor, bool need_copy_assignment)
3572 int save_errorcount = errorcount;
3575 /* Always allocate 3 elements for simplicity. These are the
3576 function decls for the ctor, dtor, and assignment op.
3577 This layout is known to the three lang hooks,
3578 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3579 and cxx_omp_clause_assign_op. */
3580 info = make_tree_vec (3);
3581 CP_OMP_CLAUSE_INFO (c) = info;
3583 if (need_default_ctor
3584 || (need_copy_ctor && !TYPE_HAS_TRIVIAL_INIT_REF (type)))
3588 if (need_default_ctor)
3592 t = build_int_cst (build_pointer_type (type), 0);
3593 t = build1 (INDIRECT_REF, type, t);
3594 vec = make_tree_vector_single (t);
3596 t = build_special_member_call (NULL_TREE, complete_ctor_identifier,
3597 &vec, type, LOOKUP_NORMAL,
3598 tf_warning_or_error);
3601 release_tree_vector (vec);
3603 if (targetm.cxx.cdtor_returns_this () || errorcount)
3604 /* Because constructors and destructors return this,
3605 the call will have been cast to "void". Remove the
3606 cast here. We would like to use STRIP_NOPS, but it
3607 wouldn't work here because TYPE_MODE (t) and
3608 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3609 They are VOIDmode and Pmode, respectively. */
3610 if (TREE_CODE (t) == NOP_EXPR)
3611 t = TREE_OPERAND (t, 0);
3613 TREE_VEC_ELT (info, 0) = get_callee_fndecl (t);
3616 if ((need_default_ctor || need_copy_ctor)
3617 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3619 t = build_int_cst (build_pointer_type (type), 0);
3620 t = build1 (INDIRECT_REF, type, t);
3621 t = build_special_member_call (t, complete_dtor_identifier,
3622 NULL, type, LOOKUP_NORMAL,
3623 tf_warning_or_error);
3625 if (targetm.cxx.cdtor_returns_this () || errorcount)
3626 /* Because constructors and destructors return this,
3627 the call will have been cast to "void". Remove the
3628 cast here. We would like to use STRIP_NOPS, but it
3629 wouldn't work here because TYPE_MODE (t) and
3630 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3631 They are VOIDmode and Pmode, respectively. */
3632 if (TREE_CODE (t) == NOP_EXPR)
3633 t = TREE_OPERAND (t, 0);
3635 TREE_VEC_ELT (info, 1) = omp_clause_info_fndecl (t, type);
3638 if (need_copy_assignment && !TYPE_HAS_TRIVIAL_ASSIGN_REF (type))
3642 t = build_int_cst (build_pointer_type (type), 0);
3643 t = build1 (INDIRECT_REF, type, t);
3644 vec = make_tree_vector_single (t);
3645 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3646 &vec, type, LOOKUP_NORMAL,
3647 tf_warning_or_error);
3648 release_tree_vector (vec);
3650 /* We'll have called convert_from_reference on the call, which
3651 may well have added an indirect_ref. It's unneeded here,
3652 and in the way, so kill it. */
3653 if (TREE_CODE (t) == INDIRECT_REF)
3654 t = TREE_OPERAND (t, 0);
3656 TREE_VEC_ELT (info, 2) = omp_clause_info_fndecl (t, type);
3659 return errorcount != save_errorcount;
3662 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3663 Remove any elements from the list that are invalid. */
3666 finish_omp_clauses (tree clauses)
3668 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3669 tree c, t, *pc = &clauses;
3672 bitmap_obstack_initialize (NULL);
3673 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3674 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3675 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3677 for (pc = &clauses, c = clauses; c ; c = *pc)
3679 bool remove = false;
3681 switch (OMP_CLAUSE_CODE (c))
3683 case OMP_CLAUSE_SHARED:
3685 goto check_dup_generic;
3686 case OMP_CLAUSE_PRIVATE:
3688 goto check_dup_generic;
3689 case OMP_CLAUSE_REDUCTION:
3691 goto check_dup_generic;
3692 case OMP_CLAUSE_COPYPRIVATE:
3693 name = "copyprivate";
3694 goto check_dup_generic;
3695 case OMP_CLAUSE_COPYIN:
3697 goto check_dup_generic;
3699 t = OMP_CLAUSE_DECL (c);
3700 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3702 if (processing_template_decl)
3705 error ("%qD is not a variable in clause %qs", t, name);
3707 error ("%qE is not a variable in clause %qs", t, name);
3710 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3711 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3712 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3714 error ("%qD appears more than once in data clauses", t);
3718 bitmap_set_bit (&generic_head, DECL_UID (t));
3721 case OMP_CLAUSE_FIRSTPRIVATE:
3722 t = OMP_CLAUSE_DECL (c);
3723 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3725 if (processing_template_decl)
3728 error ("%qD is not a variable in clause %<firstprivate%>", t);
3730 error ("%qE is not a variable in clause %<firstprivate%>", t);
3733 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3734 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3736 error ("%qD appears more than once in data clauses", t);
3740 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3743 case OMP_CLAUSE_LASTPRIVATE:
3744 t = OMP_CLAUSE_DECL (c);
3745 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3747 if (processing_template_decl)
3750 error ("%qD is not a variable in clause %<lastprivate%>", t);
3752 error ("%qE is not a variable in clause %<lastprivate%>", t);
3755 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3756 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3758 error ("%qD appears more than once in data clauses", t);
3762 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3766 t = OMP_CLAUSE_IF_EXPR (c);
3767 t = maybe_convert_cond (t);
3768 if (t == error_mark_node)
3770 OMP_CLAUSE_IF_EXPR (c) = t;
3773 case OMP_CLAUSE_NUM_THREADS:
3774 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3775 if (t == error_mark_node)
3777 else if (!type_dependent_expression_p (t)
3778 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3780 error ("num_threads expression must be integral");
3785 case OMP_CLAUSE_SCHEDULE:
3786 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3789 else if (t == error_mark_node)
3791 else if (!type_dependent_expression_p (t)
3792 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3794 error ("schedule chunk size expression must be integral");
3799 case OMP_CLAUSE_NOWAIT:
3800 case OMP_CLAUSE_ORDERED:
3801 case OMP_CLAUSE_DEFAULT:
3802 case OMP_CLAUSE_UNTIED:
3803 case OMP_CLAUSE_COLLAPSE:
3811 *pc = OMP_CLAUSE_CHAIN (c);
3813 pc = &OMP_CLAUSE_CHAIN (c);
3816 for (pc = &clauses, c = clauses; c ; c = *pc)
3818 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3819 bool remove = false;
3820 bool need_complete_non_reference = false;
3821 bool need_default_ctor = false;
3822 bool need_copy_ctor = false;
3823 bool need_copy_assignment = false;
3824 bool need_implicitly_determined = false;
3825 tree type, inner_type;
3829 case OMP_CLAUSE_SHARED:
3831 need_implicitly_determined = true;
3833 case OMP_CLAUSE_PRIVATE:
3835 need_complete_non_reference = true;
3836 need_default_ctor = true;
3837 need_implicitly_determined = true;
3839 case OMP_CLAUSE_FIRSTPRIVATE:
3840 name = "firstprivate";
3841 need_complete_non_reference = true;
3842 need_copy_ctor = true;
3843 need_implicitly_determined = true;
3845 case OMP_CLAUSE_LASTPRIVATE:
3846 name = "lastprivate";
3847 need_complete_non_reference = true;
3848 need_copy_assignment = true;
3849 need_implicitly_determined = true;
3851 case OMP_CLAUSE_REDUCTION:
3853 need_implicitly_determined = true;
3855 case OMP_CLAUSE_COPYPRIVATE:
3856 name = "copyprivate";
3857 need_copy_assignment = true;
3859 case OMP_CLAUSE_COPYIN:
3861 need_copy_assignment = true;
3864 pc = &OMP_CLAUSE_CHAIN (c);
3868 t = OMP_CLAUSE_DECL (c);
3869 if (processing_template_decl
3870 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3872 pc = &OMP_CLAUSE_CHAIN (c);
3878 case OMP_CLAUSE_LASTPRIVATE:
3879 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3880 need_default_ctor = true;
3883 case OMP_CLAUSE_REDUCTION:
3884 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3885 || POINTER_TYPE_P (TREE_TYPE (t)))
3887 error ("%qE has invalid type for %<reduction%>", t);
3890 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3892 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3900 error ("%qE has invalid type for %<reduction(%s)%>",
3901 t, operator_name_info[r_code].name);
3907 case OMP_CLAUSE_COPYIN:
3908 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3910 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3919 if (need_complete_non_reference)
3921 t = require_complete_type (t);
3922 if (t == error_mark_node)
3924 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3926 error ("%qE has reference type for %qs", t, name);
3930 if (need_implicitly_determined)
3932 const char *share_name = NULL;
3934 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3935 share_name = "threadprivate";
3936 else switch (cxx_omp_predetermined_sharing (t))
3938 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3940 case OMP_CLAUSE_DEFAULT_SHARED:
3941 share_name = "shared";
3943 case OMP_CLAUSE_DEFAULT_PRIVATE:
3944 share_name = "private";
3951 error ("%qE is predetermined %qs for %qs",
3952 t, share_name, name);
3957 /* We're interested in the base element, not arrays. */
3958 inner_type = type = TREE_TYPE (t);
3959 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3960 inner_type = TREE_TYPE (inner_type);
3962 /* Check for special function availability by building a call to one.
3963 Save the results, because later we won't be in the right context
3964 for making these queries. */
3965 if (CLASS_TYPE_P (inner_type)
3966 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3967 && !type_dependent_expression_p (t)
3968 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
3969 need_copy_ctor, need_copy_assignment))
3973 *pc = OMP_CLAUSE_CHAIN (c);
3975 pc = &OMP_CLAUSE_CHAIN (c);
3978 bitmap_obstack_release (NULL);
3982 /* For all variables in the tree_list VARS, mark them as thread local. */
3985 finish_omp_threadprivate (tree vars)
3989 /* Mark every variable in VARS to be assigned thread local storage. */
3990 for (t = vars; t; t = TREE_CHAIN (t))
3992 tree v = TREE_PURPOSE (t);
3994 if (error_operand_p (v))
3996 else if (TREE_CODE (v) != VAR_DECL)
3997 error ("%<threadprivate%> %qD is not file, namespace "
3998 "or block scope variable", v);
3999 /* If V had already been marked threadprivate, it doesn't matter
4000 whether it had been used prior to this point. */
4001 else if (TREE_USED (v)
4002 && (DECL_LANG_SPECIFIC (v) == NULL
4003 || !CP_DECL_THREADPRIVATE_P (v)))
4004 error ("%qE declared %<threadprivate%> after first use", v);
4005 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4006 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4007 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4008 error ("%<threadprivate%> %qE has incomplete type", v);
4009 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4010 && CP_DECL_CONTEXT (v) != current_class_type)
4011 error ("%<threadprivate%> %qE directive not "
4012 "in %qT definition", v, CP_DECL_CONTEXT (v));
4015 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4016 if (DECL_LANG_SPECIFIC (v) == NULL)
4018 retrofit_lang_decl (v);
4020 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4021 after the allocation of the lang_decl structure. */
4022 if (DECL_DISCRIMINATOR_P (v))
4023 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4026 if (! DECL_THREAD_LOCAL_P (v))
4028 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4029 /* If rtl has been already set for this var, call
4030 make_decl_rtl once again, so that encode_section_info
4031 has a chance to look at the new decl flags. */
4032 if (DECL_RTL_SET_P (v))
4035 CP_DECL_THREADPRIVATE_P (v) = 1;
4040 /* Build an OpenMP structured block. */
4043 begin_omp_structured_block (void)
4045 return do_pushlevel (sk_omp);
4049 finish_omp_structured_block (tree block)
4051 return do_poplevel (block);
4054 /* Similarly, except force the retention of the BLOCK. */
4057 begin_omp_parallel (void)
4059 keep_next_level (true);
4060 return begin_omp_structured_block ();
4064 finish_omp_parallel (tree clauses, tree body)
4068 body = finish_omp_structured_block (body);
4070 stmt = make_node (OMP_PARALLEL);
4071 TREE_TYPE (stmt) = void_type_node;
4072 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4073 OMP_PARALLEL_BODY (stmt) = body;
4075 return add_stmt (stmt);
4079 begin_omp_task (void)
4081 keep_next_level (true);
4082 return begin_omp_structured_block ();
4086 finish_omp_task (tree clauses, tree body)
4090 body = finish_omp_structured_block (body);
4092 stmt = make_node (OMP_TASK);
4093 TREE_TYPE (stmt) = void_type_node;
4094 OMP_TASK_CLAUSES (stmt) = clauses;
4095 OMP_TASK_BODY (stmt) = body;
4097 return add_stmt (stmt);
4100 /* Helper function for finish_omp_for. Convert Ith random access iterator
4101 into integral iterator. Return FALSE if successful. */
4104 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4105 tree condv, tree incrv, tree *body,
4106 tree *pre_body, tree clauses)
4108 tree diff, iter_init, iter_incr = NULL, last;
4109 tree incr_var = NULL, orig_pre_body, orig_body, c;
4110 tree decl = TREE_VEC_ELT (declv, i);
4111 tree init = TREE_VEC_ELT (initv, i);
4112 tree cond = TREE_VEC_ELT (condv, i);
4113 tree incr = TREE_VEC_ELT (incrv, i);
4115 location_t elocus = locus;
4117 if (init && EXPR_HAS_LOCATION (init))
4118 elocus = EXPR_LOCATION (init);
4120 switch (TREE_CODE (cond))
4126 if (TREE_OPERAND (cond, 1) == iter)
4127 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4128 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4129 if (TREE_OPERAND (cond, 0) != iter)
4130 cond = error_mark_node;
4133 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4134 TREE_OPERAND (cond, 1), ERROR_MARK,
4135 NULL, tf_warning_or_error);
4136 if (error_operand_p (tem))
4141 cond = error_mark_node;
4144 if (cond == error_mark_node)
4146 error_at (elocus, "invalid controlling predicate");
4149 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4150 ERROR_MARK, iter, ERROR_MARK, NULL,
4151 tf_warning_or_error);
4152 if (error_operand_p (diff))
4154 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4156 error_at (elocus, "difference between %qE and %qD does not have integer type",
4157 TREE_OPERAND (cond, 1), iter);
4161 switch (TREE_CODE (incr))
4163 case PREINCREMENT_EXPR:
4164 case PREDECREMENT_EXPR:
4165 case POSTINCREMENT_EXPR:
4166 case POSTDECREMENT_EXPR:
4167 if (TREE_OPERAND (incr, 0) != iter)
4169 incr = error_mark_node;
4172 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4173 tf_warning_or_error);
4174 if (error_operand_p (iter_incr))
4176 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4177 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4178 incr = integer_one_node;
4180 incr = integer_minus_one_node;
4183 if (TREE_OPERAND (incr, 0) != iter)
4184 incr = error_mark_node;
4185 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4186 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4188 tree rhs = TREE_OPERAND (incr, 1);
4189 if (TREE_OPERAND (rhs, 0) == iter)
4191 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4193 incr = error_mark_node;
4196 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4197 TREE_OPERAND (rhs, 1),
4198 tf_warning_or_error);
4199 if (error_operand_p (iter_incr))
4201 incr = TREE_OPERAND (rhs, 1);
4202 incr = cp_convert (TREE_TYPE (diff), incr);
4203 if (TREE_CODE (rhs) == MINUS_EXPR)
4205 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4206 incr = fold_if_not_in_template (incr);
4208 if (TREE_CODE (incr) != INTEGER_CST
4209 && (TREE_CODE (incr) != NOP_EXPR
4210 || (TREE_CODE (TREE_OPERAND (incr, 0))
4215 else if (TREE_OPERAND (rhs, 1) == iter)
4217 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4218 || TREE_CODE (rhs) != PLUS_EXPR)
4219 incr = error_mark_node;
4222 iter_incr = build_x_binary_op (PLUS_EXPR,
4223 TREE_OPERAND (rhs, 0),
4226 tf_warning_or_error);
4227 if (error_operand_p (iter_incr))
4229 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4231 tf_warning_or_error);
4232 if (error_operand_p (iter_incr))
4234 incr = TREE_OPERAND (rhs, 0);
4239 incr = error_mark_node;
4242 incr = error_mark_node;
4245 incr = error_mark_node;
4249 if (incr == error_mark_node)
4251 error_at (elocus, "invalid increment expression");
4255 incr = cp_convert (TREE_TYPE (diff), incr);
4256 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4257 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4258 && OMP_CLAUSE_DECL (c) == iter)
4261 decl = create_temporary_var (TREE_TYPE (diff));
4263 add_decl_expr (decl);
4264 last = create_temporary_var (TREE_TYPE (diff));
4266 add_decl_expr (last);
4267 if (c && iter_incr == NULL)
4269 incr_var = create_temporary_var (TREE_TYPE (diff));
4270 pushdecl (incr_var);
4271 add_decl_expr (incr_var);
4273 gcc_assert (stmts_are_full_exprs_p ());
4275 orig_pre_body = *pre_body;
4276 *pre_body = push_stmt_list ();
4278 add_stmt (orig_pre_body);
4280 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4281 tf_warning_or_error));
4282 init = build_int_cst (TREE_TYPE (diff), 0);
4283 if (c && iter_incr == NULL)
4285 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4286 incr, tf_warning_or_error));
4288 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4289 tf_warning_or_error);
4291 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4292 tf_warning_or_error));
4293 *pre_body = pop_stmt_list (*pre_body);
4295 cond = cp_build_binary_op (elocus,
4296 TREE_CODE (cond), decl, diff,
4297 tf_warning_or_error);
4298 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4299 elocus, incr, NULL_TREE);
4302 *body = push_stmt_list ();
4303 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4304 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4305 tf_warning_or_error);
4306 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4307 finish_expr_stmt (iter_init);
4308 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4309 tf_warning_or_error));
4310 add_stmt (orig_body);
4311 *body = pop_stmt_list (*body);
4315 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4316 finish_expr_stmt (iter_incr);
4317 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4318 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4321 TREE_VEC_ELT (declv, i) = decl;
4322 TREE_VEC_ELT (initv, i) = init;
4323 TREE_VEC_ELT (condv, i) = cond;
4324 TREE_VEC_ELT (incrv, i) = incr;
4329 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4330 are directly for their associated operands in the statement. DECL
4331 and INIT are a combo; if DECL is NULL then INIT ought to be a
4332 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4333 optional statements that need to go before the loop into its
4337 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4338 tree incrv, tree body, tree pre_body, tree clauses)
4340 tree omp_for = NULL, orig_incr = NULL;
4341 tree decl, init, cond, incr;
4345 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4346 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4347 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4348 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4350 decl = TREE_VEC_ELT (declv, i);
4351 init = TREE_VEC_ELT (initv, i);
4352 cond = TREE_VEC_ELT (condv, i);
4353 incr = TREE_VEC_ELT (incrv, i);
4359 switch (TREE_CODE (init))
4362 decl = TREE_OPERAND (init, 0);
4363 init = TREE_OPERAND (init, 1);
4366 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4368 decl = TREE_OPERAND (init, 0);
4369 init = TREE_OPERAND (init, 2);
4379 "expected iteration declaration or initialization");
4384 if (init && EXPR_HAS_LOCATION (init))
4385 elocus = EXPR_LOCATION (init);
4389 error_at (elocus, "missing controlling predicate");
4395 error_at (elocus, "missing increment expression");
4399 TREE_VEC_ELT (declv, i) = decl;
4400 TREE_VEC_ELT (initv, i) = init;
4403 if (dependent_omp_for_p (declv, initv, condv, incrv))
4407 stmt = make_node (OMP_FOR);
4409 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4411 /* This is really just a place-holder. We'll be decomposing this
4412 again and going through the cp_build_modify_expr path below when
4413 we instantiate the thing. */
4414 TREE_VEC_ELT (initv, i)
4415 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4416 TREE_VEC_ELT (initv, i));
4419 TREE_TYPE (stmt) = void_type_node;
4420 OMP_FOR_INIT (stmt) = initv;
4421 OMP_FOR_COND (stmt) = condv;
4422 OMP_FOR_INCR (stmt) = incrv;
4423 OMP_FOR_BODY (stmt) = body;
4424 OMP_FOR_PRE_BODY (stmt) = pre_body;
4425 OMP_FOR_CLAUSES (stmt) = clauses;
4427 SET_EXPR_LOCATION (stmt, locus);
4428 return add_stmt (stmt);
4431 if (processing_template_decl)
4432 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4434 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4436 decl = TREE_VEC_ELT (declv, i);
4437 init = TREE_VEC_ELT (initv, i);
4438 cond = TREE_VEC_ELT (condv, i);
4439 incr = TREE_VEC_ELT (incrv, i);
4441 TREE_VEC_ELT (orig_incr, i) = incr;
4444 if (init && EXPR_HAS_LOCATION (init))
4445 elocus = EXPR_LOCATION (init);
4449 error_at (elocus, "expected iteration declaration or initialization");
4453 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4456 TREE_VEC_ELT (orig_incr, i) = incr;
4457 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4458 TREE_CODE (TREE_OPERAND (incr, 1)),
4459 TREE_OPERAND (incr, 2),
4460 tf_warning_or_error);
4463 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4465 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4466 incrv, &body, &pre_body, clauses))
4471 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4472 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4474 error_at (elocus, "invalid type for iteration variable %qE", decl);
4478 if (!processing_template_decl)
4480 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4481 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4484 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4486 && TREE_SIDE_EFFECTS (cond)
4487 && COMPARISON_CLASS_P (cond)
4488 && !processing_template_decl)
4490 tree t = TREE_OPERAND (cond, 0);
4491 if (TREE_SIDE_EFFECTS (t)
4493 && (TREE_CODE (t) != NOP_EXPR
4494 || TREE_OPERAND (t, 0) != decl))
4495 TREE_OPERAND (cond, 0)
4496 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4498 t = TREE_OPERAND (cond, 1);
4499 if (TREE_SIDE_EFFECTS (t)
4501 && (TREE_CODE (t) != NOP_EXPR
4502 || TREE_OPERAND (t, 0) != decl))
4503 TREE_OPERAND (cond, 1)
4504 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4506 if (decl == error_mark_node || init == error_mark_node)
4509 TREE_VEC_ELT (declv, i) = decl;
4510 TREE_VEC_ELT (initv, i) = init;
4511 TREE_VEC_ELT (condv, i) = cond;
4512 TREE_VEC_ELT (incrv, i) = incr;
4516 if (IS_EMPTY_STMT (pre_body))
4519 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4522 if (omp_for == NULL)
4525 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4527 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4528 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4530 if (TREE_CODE (incr) != MODIFY_EXPR)
4533 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4534 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4535 && !processing_template_decl)
4537 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4538 if (TREE_SIDE_EFFECTS (t)
4540 && (TREE_CODE (t) != NOP_EXPR
4541 || TREE_OPERAND (t, 0) != decl))
4542 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4543 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4545 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4546 if (TREE_SIDE_EFFECTS (t)
4548 && (TREE_CODE (t) != NOP_EXPR
4549 || TREE_OPERAND (t, 0) != decl))
4550 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4551 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4555 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4557 if (omp_for != NULL)
4558 OMP_FOR_CLAUSES (omp_for) = clauses;
4563 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4572 dependent_p = false;
4575 /* Even in a template, we can detect invalid uses of the atomic
4576 pragma if neither LHS nor RHS is type-dependent. */
4577 if (processing_template_decl)
4579 dependent_p = (type_dependent_expression_p (lhs)
4580 || type_dependent_expression_p (rhs));
4583 lhs = build_non_dependent_expr (lhs);
4584 rhs = build_non_dependent_expr (rhs);
4589 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4590 if (stmt == error_mark_node)
4593 if (processing_template_decl)
4594 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4595 build2 (code, void_type_node, orig_lhs, orig_rhs));
4600 finish_omp_barrier (void)
4602 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4603 VEC(tree,gc) *vec = make_tree_vector ();
4604 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4605 release_tree_vector (vec);
4606 finish_expr_stmt (stmt);
4610 finish_omp_flush (void)
4612 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4613 VEC(tree,gc) *vec = make_tree_vector ();
4614 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4615 release_tree_vector (vec);
4616 finish_expr_stmt (stmt);
4620 finish_omp_taskwait (void)
4622 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4623 VEC(tree,gc) *vec = make_tree_vector ();
4624 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4625 release_tree_vector (vec);
4626 finish_expr_stmt (stmt);
4630 init_cp_semantics (void)
4634 /* Build a STATIC_ASSERT for a static assertion with the condition
4635 CONDITION and the message text MESSAGE. LOCATION is the location
4636 of the static assertion in the source code. When MEMBER_P, this
4637 static assertion is a member of a class. */
4639 finish_static_assert (tree condition, tree message, location_t location,
4642 if (check_for_bare_parameter_packs (condition))
4643 condition = error_mark_node;
4645 if (type_dependent_expression_p (condition)
4646 || value_dependent_expression_p (condition))
4648 /* We're in a template; build a STATIC_ASSERT and put it in
4652 assertion = make_node (STATIC_ASSERT);
4653 STATIC_ASSERT_CONDITION (assertion) = condition;
4654 STATIC_ASSERT_MESSAGE (assertion) = message;
4655 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4658 maybe_add_class_template_decl_list (current_class_type,
4662 add_stmt (assertion);
4667 /* Fold the expression and convert it to a boolean value. */
4668 condition = fold_non_dependent_expr (condition);
4669 condition = cp_convert (boolean_type_node, condition);
4671 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4672 /* Do nothing; the condition is satisfied. */
4676 location_t saved_loc = input_location;
4678 input_location = location;
4679 if (TREE_CODE (condition) == INTEGER_CST
4680 && integer_zerop (condition))
4681 /* Report the error. */
4682 error ("static assertion failed: %E", message);
4683 else if (condition && condition != error_mark_node)
4684 error ("non-constant condition for static assertion");
4685 input_location = saved_loc;
4689 /* Returns decltype((EXPR)) for cases where we can drop the decltype and
4690 just return the type even though EXPR is a type-dependent expression.
4691 The ABI specifies which cases this applies to, which is a subset of the
4695 describable_type (tree expr)
4697 tree type = NULL_TREE;
4699 if (! type_dependent_expression_p (expr)
4700 && ! type_unknown_p (expr))
4702 type = unlowered_expr_type (expr);
4703 if (real_lvalue_p (expr))
4704 type = build_reference_type (type);
4710 switch (TREE_CODE (expr))
4716 /* Named rvalue reference becomes lvalue. */
4717 type = build_reference_type (non_reference (TREE_TYPE (expr)));
4722 case TEMPLATE_PARM_INDEX:
4724 case STATIC_CAST_EXPR:
4725 case REINTERPRET_CAST_EXPR:
4726 case CONST_CAST_EXPR:
4727 case DYNAMIC_CAST_EXPR:
4728 type = TREE_TYPE (expr);
4733 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4734 if (ptrtype && POINTER_TYPE_P (ptrtype))
4735 type = build_reference_type (TREE_TYPE (ptrtype));
4740 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4741 type = TREE_TYPE (expr);
4745 if (type && type_uses_auto (type))
4751 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4752 suitable for use as a type-specifier.
4754 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4755 id-expression or a class member access, FALSE when it was parsed as
4756 a full expression. */
4759 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4761 tree orig_expr = expr;
4762 tree type = NULL_TREE;
4764 if (!expr || error_operand_p (expr))
4765 return error_mark_node;
4768 || TREE_CODE (expr) == TYPE_DECL
4769 || (TREE_CODE (expr) == BIT_NOT_EXPR
4770 && TYPE_P (TREE_OPERAND (expr, 0))))
4772 error ("argument to decltype must be an expression");
4773 return error_mark_node;
4776 if (type_dependent_expression_p (expr))
4778 if (id_expression_or_member_access_p)
4780 switch (TREE_CODE (expr))
4787 case TEMPLATE_PARM_INDEX:
4788 type = TREE_TYPE (expr);
4796 if (type && !type_uses_auto (type))
4799 type = cxx_make_type (DECLTYPE_TYPE);
4800 DECLTYPE_TYPE_EXPR (type) = expr;
4801 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4802 = id_expression_or_member_access_p;
4803 SET_TYPE_STRUCTURAL_EQUALITY (type);
4808 /* The type denoted by decltype(e) is defined as follows: */
4810 expr = resolve_nondeduced_context (expr);
4811 if (id_expression_or_member_access_p)
4813 /* If e is an id-expression or a class member access (5.2.5
4814 [expr.ref]), decltype(e) is defined as the type of the entity
4815 named by e. If there is no such entity, or e names a set of
4816 overloaded functions, the program is ill-formed. */
4817 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4818 expr = lookup_name (expr);
4820 if (TREE_CODE (expr) == INDIRECT_REF)
4821 /* This can happen when the expression is, e.g., "a.b". Just
4822 look at the underlying operand. */
4823 expr = TREE_OPERAND (expr, 0);
4825 if (TREE_CODE (expr) == OFFSET_REF
4826 || TREE_CODE (expr) == MEMBER_REF)
4827 /* We're only interested in the field itself. If it is a
4828 BASELINK, we will need to see through it in the next
4830 expr = TREE_OPERAND (expr, 1);
4832 if (TREE_CODE (expr) == BASELINK)
4833 /* See through BASELINK nodes to the underlying functions. */
4834 expr = BASELINK_FUNCTIONS (expr);
4836 if (TREE_CODE (expr) == TEMPLATE_ID_EXPR)
4837 expr = TREE_OPERAND (expr, 0);
4839 if (TREE_CODE (expr) == OVERLOAD)
4841 if (OVL_CHAIN (expr)
4842 || TREE_CODE (OVL_FUNCTION (expr)) == TEMPLATE_DECL)
4844 error ("%qE refers to a set of overloaded functions", orig_expr);
4845 return error_mark_node;
4848 /* An overload set containing only one function: just look
4849 at that function. */
4850 expr = OVL_FUNCTION (expr);
4853 switch (TREE_CODE (expr))
4856 if (DECL_BIT_FIELD_TYPE (expr))
4858 type = DECL_BIT_FIELD_TYPE (expr);
4861 /* Fall through for fields that aren't bitfields. */
4868 case TEMPLATE_PARM_INDEX:
4869 type = TREE_TYPE (expr);
4873 type = error_mark_node;
4877 type = is_bitfield_expr_with_lowered_type (expr);
4879 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4886 /* We can get here when the id-expression refers to an
4888 type = TREE_TYPE (expr);
4892 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4893 || TREE_CODE (expr) == SCOPE_REF);
4894 error ("argument to decltype must be an expression");
4895 return error_mark_node;
4900 /* Expressions of reference type are sometimes wrapped in
4901 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4902 representation, not part of the language, so we have to look
4904 if (TREE_CODE (expr) == INDIRECT_REF
4905 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4907 expr = TREE_OPERAND (expr, 0);
4909 if (TREE_CODE (expr) == CALL_EXPR)
4911 /* If e is a function call (5.2.2 [expr.call]) or an
4912 invocation of an overloaded operator (parentheses around e
4913 are ignored), decltype(e) is defined as the return type of
4915 tree fndecl = get_callee_fndecl (expr);
4916 if (fndecl && fndecl != error_mark_node)
4917 type = TREE_TYPE (TREE_TYPE (fndecl));
4920 tree target_type = TREE_TYPE (CALL_EXPR_FN (expr));
4921 if ((TREE_CODE (target_type) == REFERENCE_TYPE
4922 || TREE_CODE (target_type) == POINTER_TYPE)
4923 && (TREE_CODE (TREE_TYPE (target_type)) == FUNCTION_TYPE
4924 || TREE_CODE (TREE_TYPE (target_type)) == METHOD_TYPE))
4925 type = TREE_TYPE (TREE_TYPE (target_type));
4927 sorry ("unable to determine the declared type of expression %<%E%>",
4933 type = is_bitfield_expr_with_lowered_type (expr);
4936 /* Bitfields are special, because their type encodes the
4937 number of bits they store. If the expression referenced a
4938 bitfield, TYPE now has the declared type of that
4940 type = cp_build_qualified_type (type,
4941 cp_type_quals (TREE_TYPE (expr)));
4943 if (real_lvalue_p (expr))
4944 type = build_reference_type (type);
4946 /* Within a lambda-expression:
4948 Every occurrence of decltype((x)) where x is a possibly
4949 parenthesized id-expression that names an entity of
4950 automatic storage duration is treated as if x were
4951 transformed into an access to a corresponding data member
4952 of the closure type that would have been declared if x
4953 were a use of the denoted entity. */
4954 else if (outer_automatic_var_p (expr)
4955 && current_function_decl
4956 && LAMBDA_FUNCTION_P (current_function_decl))
4957 type = capture_decltype (expr);
4960 /* Otherwise, where T is the type of e, if e is an lvalue,
4961 decltype(e) is defined as T&, otherwise decltype(e) is
4963 type = TREE_TYPE (expr);
4964 if (type == error_mark_node)
4965 return error_mark_node;
4966 else if (expr == current_class_ptr)
4967 /* If the expression is just "this", we want the
4968 cv-unqualified pointer for the "this" type. */
4969 type = TYPE_MAIN_VARIANT (type);
4970 else if (real_lvalue_p (expr))
4972 if (TREE_CODE (type) != REFERENCE_TYPE)
4973 type = build_reference_type (type);
4976 type = non_reference (type);
4981 if (!type || type == unknown_type_node)
4983 error ("type of %qE is unknown", expr);
4984 return error_mark_node;
4990 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4991 __has_nothrow_copy, depending on assign_p. */
4994 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5001 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5004 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5006 else if (TYPE_HAS_INIT_REF (type))
5008 /* If construction of the copy constructor was postponed, create
5010 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5011 lazily_declare_fn (sfk_copy_constructor, type);
5012 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5013 lazily_declare_fn (sfk_move_constructor, type);
5014 fns = CLASSTYPE_CONSTRUCTORS (type);
5019 for (; fns; fns = OVL_NEXT (fns))
5021 tree fn = OVL_CURRENT (fns);
5025 if (copy_fn_p (fn) == 0)
5028 else if (copy_fn_p (fn) <= 0)
5031 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5038 /* Actually evaluates the trait. */
5041 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5043 enum tree_code type_code1;
5046 type_code1 = TREE_CODE (type1);
5050 case CPTK_HAS_NOTHROW_ASSIGN:
5051 type1 = strip_array_types (type1);
5052 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5053 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5054 || (CLASS_TYPE_P (type1)
5055 && classtype_has_nothrow_assign_or_copy_p (type1,
5058 case CPTK_HAS_TRIVIAL_ASSIGN:
5059 /* ??? The standard seems to be missing the "or array of such a class
5060 type" wording for this trait. */
5061 type1 = strip_array_types (type1);
5062 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5063 && (trivial_type_p (type1)
5064 || (CLASS_TYPE_P (type1)
5065 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
5067 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5068 type1 = strip_array_types (type1);
5069 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5070 || (CLASS_TYPE_P (type1)
5071 && (t = locate_ctor (type1, NULL))
5072 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5074 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5075 type1 = strip_array_types (type1);
5076 return (trivial_type_p (type1)
5077 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5079 case CPTK_HAS_NOTHROW_COPY:
5080 type1 = strip_array_types (type1);
5081 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5082 || (CLASS_TYPE_P (type1)
5083 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5085 case CPTK_HAS_TRIVIAL_COPY:
5086 /* ??? The standard seems to be missing the "or array of such a class
5087 type" wording for this trait. */
5088 type1 = strip_array_types (type1);
5089 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5090 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
5092 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5093 type1 = strip_array_types (type1);
5094 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5095 || (CLASS_TYPE_P (type1)
5096 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5098 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5099 return (CLASS_TYPE_P (type1)
5100 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
5102 case CPTK_IS_ABSTRACT:
5103 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5105 case CPTK_IS_BASE_OF:
5106 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5107 && DERIVED_FROM_P (type1, type2));
5110 return (NON_UNION_CLASS_TYPE_P (type1));
5112 case CPTK_IS_CONVERTIBLE_TO:
5117 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5120 return (type_code1 == ENUMERAL_TYPE);
5123 return (pod_type_p (type1));
5125 case CPTK_IS_POLYMORPHIC:
5126 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5128 case CPTK_IS_STD_LAYOUT:
5129 return (std_layout_type_p (type1));
5131 case CPTK_IS_TRIVIAL:
5132 return (trivial_type_p (type1));
5135 return (type_code1 == UNION_TYPE);
5143 /* Returns true if TYPE is a complete type, an array of unknown bound,
5144 or (possibly cv-qualified) void, returns false otherwise. */
5147 check_trait_type (tree type)
5149 if (COMPLETE_TYPE_P (type))
5152 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
5155 if (VOID_TYPE_P (type))
5161 /* Process a trait expression. */
5164 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5166 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5167 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5168 || kind == CPTK_HAS_NOTHROW_COPY
5169 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5170 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5171 || kind == CPTK_HAS_TRIVIAL_COPY
5172 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5173 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5174 || kind == CPTK_IS_ABSTRACT
5175 || kind == CPTK_IS_BASE_OF
5176 || kind == CPTK_IS_CLASS
5177 || kind == CPTK_IS_CONVERTIBLE_TO
5178 || kind == CPTK_IS_EMPTY
5179 || kind == CPTK_IS_ENUM
5180 || kind == CPTK_IS_POD
5181 || kind == CPTK_IS_POLYMORPHIC
5182 || kind == CPTK_IS_STD_LAYOUT
5183 || kind == CPTK_IS_TRIVIAL
5184 || kind == CPTK_IS_UNION);
5186 if (kind == CPTK_IS_CONVERTIBLE_TO)
5188 sorry ("__is_convertible_to");
5189 return error_mark_node;
5192 if (type1 == error_mark_node
5193 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5194 && type2 == error_mark_node))
5195 return error_mark_node;
5197 if (processing_template_decl)
5199 tree trait_expr = make_node (TRAIT_EXPR);
5200 TREE_TYPE (trait_expr) = boolean_type_node;
5201 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5202 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5203 TRAIT_EXPR_KIND (trait_expr) = kind;
5207 complete_type (type1);
5209 complete_type (type2);
5213 case CPTK_HAS_NOTHROW_ASSIGN:
5214 case CPTK_HAS_TRIVIAL_ASSIGN:
5215 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5216 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5217 case CPTK_HAS_NOTHROW_COPY:
5218 case CPTK_HAS_TRIVIAL_COPY:
5219 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5220 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5221 case CPTK_IS_ABSTRACT:
5224 case CPTK_IS_POLYMORPHIC:
5225 case CPTK_IS_STD_LAYOUT:
5226 case CPTK_IS_TRIVIAL:
5227 if (!check_trait_type (type1))
5229 error ("incomplete type %qT not allowed", type1);
5230 return error_mark_node;
5234 case CPTK_IS_BASE_OF:
5235 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5236 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5237 && !COMPLETE_TYPE_P (type2))
5239 error ("incomplete type %qT not allowed", type2);
5240 return error_mark_node;
5249 case CPTK_IS_CONVERTIBLE_TO:
5254 return (trait_expr_value (kind, type1, type2)
5255 ? boolean_true_node : boolean_false_node);
5258 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5259 which is ignored for C++. */
5262 set_float_const_decimal64 (void)
5267 clear_float_const_decimal64 (void)
5272 float_const_decimal64_p (void)
5277 /* Return true if T is a literal type. */
5280 literal_type_p (tree t)
5282 if (SCALAR_TYPE_P (t))
5284 if (CLASS_TYPE_P (t))
5285 return CLASSTYPE_LITERAL_P (t);
5286 if (TREE_CODE (t) == ARRAY_TYPE)
5287 return literal_type_p (strip_array_types (t));
5292 /* If DECL is a variable declared `constexpr', require its type
5293 be literal. Return the DECL if OK, otherwise NULL. */
5296 ensure_literal_type_for_constexpr_object (tree decl)
5298 tree type = TREE_TYPE (decl);
5299 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5300 && !processing_template_decl && !literal_type_p (type))
5302 error ("the type %qT of constexpr variable %qD is not literal",
5309 /* Return non-null if FUN certainly designates a valid constexpr function
5310 declaration. Otherwise return NULL. Issue appropriate diagnostics
5311 if necessary. Note that we only check the declaration, not the body
5315 validate_constexpr_fundecl (tree fun)
5317 tree rettype = NULL;
5320 /* Don't bother if FUN is not marked constexpr. */
5321 if (!DECL_DECLARED_CONSTEXPR_P (fun))
5324 /* For a function template, we have absolutely no guarantee that all
5325 instantiations will be constexpr. */
5326 if (TREE_CODE (fun) == TEMPLATE_DECL)
5329 parm = FUNCTION_FIRST_USER_PARM (fun);
5330 for (; parm != NULL; parm = TREE_CHAIN (parm))
5332 tree type = TREE_TYPE (parm);
5333 if (dependent_type_p (type))
5335 if (!literal_type_p (type))
5337 error ("parameter %q#D is not of literal type", parm);
5342 if (DECL_CONSTRUCTOR_P (fun))
5345 rettype = TREE_TYPE (TREE_TYPE (fun));
5346 if (dependent_type_p (rettype))
5348 if (!literal_type_p (rettype))
5350 error ("return type %qT of function %qD is not a literal type",
5351 TREE_TYPE (TREE_TYPE (fun)), fun);
5358 /* Constructor for a lambda expression. */
5361 build_lambda_expr (void)
5363 tree lambda = make_node (LAMBDA_EXPR);
5364 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
5365 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
5366 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
5367 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
5368 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
5372 /* Create the closure object for a LAMBDA_EXPR. */
5375 build_lambda_object (tree lambda_expr)
5377 /* Build aggregate constructor call.
5378 - cp_parser_braced_list
5379 - cp_parser_functional_cast */
5380 VEC(constructor_elt,gc) *elts = NULL;
5381 tree node, expr, type;
5382 location_t saved_loc;
5384 if (processing_template_decl)
5387 /* Make sure any error messages refer to the lambda-introducer. */
5388 saved_loc = input_location;
5389 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
5391 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
5393 node = TREE_CHAIN (node))
5395 tree field = TREE_PURPOSE (node);
5396 tree val = TREE_VALUE (node);
5398 /* Mere mortals can't copy arrays with aggregate initialization, so
5399 do some magic to make it work here. */
5400 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
5401 val = build_array_copy (val);
5402 else if (DECL_NORMAL_CAPTURE_P (field)
5403 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
5405 /* "the entities that are captured by copy are used to
5406 direct-initialize each corresponding non-static data
5407 member of the resulting closure object."
5409 There's normally no way to express direct-initialization
5410 from an element of a CONSTRUCTOR, so we build up a special
5411 TARGET_EXPR to bypass the usual copy-initialization. */
5412 val = force_rvalue (val);
5413 if (TREE_CODE (val) == TARGET_EXPR)
5414 TARGET_EXPR_DIRECT_INIT_P (val) = true;
5417 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
5420 expr = build_constructor (init_list_type_node, elts);
5421 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
5423 /* N2927: "[The closure] class type is not an aggregate."
5424 But we briefly treat it as an aggregate to make this simpler. */
5425 type = TREE_TYPE (lambda_expr);
5426 CLASSTYPE_NON_AGGREGATE (type) = 0;
5427 expr = finish_compound_literal (type, expr);
5428 CLASSTYPE_NON_AGGREGATE (type) = 1;
5430 input_location = saved_loc;
5434 /* Return an initialized RECORD_TYPE for LAMBDA.
5435 LAMBDA must have its explicit captures already. */
5438 begin_lambda_type (tree lambda)
5443 /* Unique name. This is just like an unnamed class, but we cannot use
5444 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5446 name = make_lambda_name ();
5448 /* Create the new RECORD_TYPE for this lambda. */
5449 type = xref_tag (/*tag_code=*/record_type,
5451 /*scope=*/ts_within_enclosing_non_class,
5452 /*template_header_p=*/false);
5455 /* Designate it as a struct so that we can use aggregate initialization. */
5456 CLASSTYPE_DECLARED_CLASS (type) = false;
5458 /* Clear base types. */
5459 xref_basetypes (type, /*bases=*/NULL_TREE);
5461 /* Start the class. */
5462 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
5464 /* Cross-reference the expression and the type. */
5465 TREE_TYPE (lambda) = type;
5466 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
5471 /* Returns the type to use for the return type of the operator() of a
5475 lambda_return_type (tree expr)
5478 if (type_dependent_expression_p (expr))
5480 type = cxx_make_type (DECLTYPE_TYPE);
5481 DECLTYPE_TYPE_EXPR (type) = expr;
5482 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
5483 SET_TYPE_STRUCTURAL_EQUALITY (type);
5486 type = type_decays_to (unlowered_expr_type (expr));
5490 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5494 lambda_function (tree lambda)
5497 if (TREE_CODE (lambda) == LAMBDA_EXPR)
5498 type = TREE_TYPE (lambda);
5501 gcc_assert (LAMBDA_TYPE_P (type));
5502 /* Don't let debug_tree cause instantiation. */
5503 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
5505 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
5506 /*protect=*/0, /*want_type=*/false);
5508 lambda = BASELINK_FUNCTIONS (lambda);
5512 /* Returns the type to use for the FIELD_DECL corresponding to the
5514 The caller should add REFERENCE_TYPE for capture by reference. */
5517 lambda_capture_field_type (tree expr)
5520 if (type_dependent_expression_p (expr))
5522 type = cxx_make_type (DECLTYPE_TYPE);
5523 DECLTYPE_TYPE_EXPR (type) = expr;
5524 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
5525 SET_TYPE_STRUCTURAL_EQUALITY (type);
5528 type = non_reference (unlowered_expr_type (expr));
5532 /* Recompute the return type for LAMBDA with body of the form:
5533 { return EXPR ; } */
5536 apply_lambda_return_type (tree lambda, tree return_type)
5538 tree fco = lambda_function (lambda);
5541 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
5543 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5544 it would interfere with instantiating the closure type. */
5545 if (dependent_type_p (return_type))
5547 if (return_type == error_mark_node)
5550 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5551 TREE_TYPE (METHOD_TYPE) == return-type */
5552 TREE_TYPE (TREE_TYPE (fco)) = return_type;
5554 result = DECL_RESULT (fco);
5555 if (result == NULL_TREE)
5558 /* We already have a DECL_RESULT from start_preparsed_function.
5559 Now we need to redo the work it and allocate_struct_function
5560 did to reflect the new type. */
5561 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
5562 TYPE_MAIN_VARIANT (return_type));
5563 DECL_ARTIFICIAL (result) = 1;
5564 DECL_IGNORED_P (result) = 1;
5565 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
5568 DECL_RESULT (fco) = result;
5570 if (!processing_template_decl && aggregate_value_p (result, fco))
5572 #ifdef PCC_STATIC_STRUCT_RETURN
5573 cfun->returns_pcc_struct = 1;
5575 cfun->returns_struct = 1;
5580 /* DECL is a local variable or parameter from the surrounding scope of a
5581 lambda-expression. Returns the decltype for a use of the capture field
5582 for DECL even if it hasn't been captured yet. */
5585 capture_decltype (tree decl)
5587 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
5588 /* FIXME do lookup instead of list walk? */
5589 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
5593 type = TREE_TYPE (TREE_PURPOSE (cap));
5595 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
5598 error ("%qD is not captured", decl);
5599 return error_mark_node;
5602 type = TREE_TYPE (decl);
5603 if (TREE_CODE (type) == REFERENCE_TYPE
5604 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
5605 type = TREE_TYPE (type);
5608 case CPLD_REFERENCE:
5609 type = TREE_TYPE (decl);
5610 if (TREE_CODE (type) != REFERENCE_TYPE)
5611 type = build_reference_type (TREE_TYPE (decl));
5618 if (TREE_CODE (type) != REFERENCE_TYPE)
5620 if (!LAMBDA_EXPR_MUTABLE_P (lam))
5621 type = cp_build_qualified_type (type, (TYPE_QUALS (type)
5623 type = build_reference_type (type);
5628 /* From an ID and INITIALIZER, create a capture (by reference if
5629 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5633 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
5634 bool explicit_init_p)
5639 type = lambda_capture_field_type (initializer);
5642 type = build_reference_type (type);
5643 if (!real_lvalue_p (initializer))
5644 error ("cannot capture %qE by reference", initializer);
5647 /* Make member variable. */
5648 member = build_lang_decl (FIELD_DECL, id, type);
5649 if (!explicit_init_p)
5650 /* Normal captures are invisible to name lookup but uses are replaced
5651 with references to the capture field; we implement this by only
5652 really making them invisible in unevaluated context; see
5653 qualify_lookup. For now, let's make explicitly initialized captures
5655 DECL_NORMAL_CAPTURE_P (member) = true;
5657 /* Add it to the appropriate closure class. */
5658 finish_member_declaration (member);
5660 LAMBDA_EXPR_CAPTURE_LIST (lambda)
5661 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
5663 if (id == get_identifier ("__this"))
5665 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
5666 error ("already captured %<this%> in lambda expression");
5667 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
5673 /* Given a FIELD_DECL decl belonging to a closure type, return a
5674 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5678 thisify_lambda_field (tree decl)
5680 tree context = lambda_function (DECL_CONTEXT (decl));
5681 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
5683 tf_warning_or_error);
5684 return finish_non_static_data_member (decl, object,
5685 /*qualifying_scope*/NULL_TREE);
5688 /* Similar to add_capture, except this works on a stack of nested lambdas.
5689 BY_REFERENCE_P in this case is derived from the default capture mode.
5690 Returns the capture for the lambda at the bottom of the stack. */
5693 add_default_capture (tree lambda_stack, tree id, tree initializer)
5695 bool this_capture_p = (id == get_identifier ("__this"));
5697 tree member = NULL_TREE;
5699 tree saved_class_type = current_class_type;
5703 for (node = lambda_stack;
5705 node = TREE_CHAIN (node))
5707 tree lambda = TREE_VALUE (node);
5709 current_class_type = TREE_TYPE (lambda);
5710 member = add_capture (lambda,
5715 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
5716 == CPLD_REFERENCE)),
5717 /*explicit_init_p=*/false);
5718 initializer = thisify_lambda_field (member);
5721 current_class_type = saved_class_type;
5726 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5727 INDIRECT_REF, possibly adding it through default capturing. */
5730 lambda_expr_this_capture (tree lambda)
5734 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5736 /* Try to default capture 'this' if we can. */
5738 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
5740 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
5741 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
5742 tree init = NULL_TREE;
5744 /* If we are in a lambda function, we can move out until we hit:
5745 1. a non-lambda function,
5746 2. a lambda function capturing 'this', or
5747 3. a non-default capturing lambda function. */
5748 while (LAMBDA_FUNCTION_P (containing_function))
5751 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
5753 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
5755 /* An outer lambda has already captured 'this'. */
5756 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
5757 init = thisify_lambda_field (cap);
5761 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
5762 /* An outer lambda won't let us capture 'this'. */
5765 lambda_stack = tree_cons (NULL_TREE,
5769 containing_function = decl_function_context (containing_function);
5772 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
5773 && !LAMBDA_FUNCTION_P (containing_function))
5774 /* First parameter is 'this'. */
5775 init = DECL_ARGUMENTS (containing_function);
5778 this_capture = add_default_capture (lambda_stack,
5779 /*id=*/get_identifier ("__this"),
5785 error ("%<this%> was not captured for this lambda function");
5786 result = error_mark_node;
5790 /* To make sure that current_class_ref is for the lambda. */
5791 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
5793 result = finish_non_static_data_member (this_capture,
5795 /*qualifying_scope=*/NULL_TREE);
5797 /* If 'this' is captured, each use of 'this' is transformed into an
5798 access to the corresponding unnamed data member of the closure
5799 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5800 ensures that the transformed expression is an rvalue. ] */
5801 result = rvalue (result);
5807 /* If the closure TYPE has a static op(), also add a conversion to function
5811 maybe_add_lambda_conv_op (tree type)
5813 bool nested = (current_function_decl != NULL_TREE);
5814 tree callop = lambda_function (type);
5815 tree rettype, name, fntype, fn, body, compound_stmt;
5817 if (!DECL_STATIC_FUNCTION_P (callop))
5820 rettype = build_pointer_type (TREE_TYPE (callop));
5821 name = mangle_conv_op_name_for_type (rettype);
5822 fntype = build_function_type (rettype, void_list_node);
5823 fn = build_lang_decl (FUNCTION_DECL, name, fntype);
5824 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
5826 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
5827 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
5828 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
5830 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
5831 grokclassfn (type, fn, NO_SPECIAL);
5832 set_linkage_according_to_type (type, fn);
5833 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
5834 DECL_IN_AGGR_P (fn) = 1;
5835 DECL_ARTIFICIAL (fn) = 1;
5836 DECL_NOT_REALLY_EXTERN (fn) = 1;
5837 DECL_DECLARED_INLINE_P (fn) = 1;
5838 DECL_STATIC_FUNCTION_P (fn) = 1;
5840 add_method (type, fn, NULL_TREE);
5843 push_function_context ();
5844 start_preparsed_function (fn, NULL_TREE,
5845 SF_PRE_PARSED | SF_INCLASS_INLINE);
5846 body = begin_function_body ();
5847 compound_stmt = begin_compound_stmt (0);
5849 finish_return_stmt (decay_conversion (callop));
5851 finish_compound_stmt (compound_stmt);
5852 finish_function_body (body);
5854 expand_or_defer_fn (finish_function (2));
5856 pop_function_context ();
5858 #include "gt-cp-semantics.h"